Lines Matching full:n_children
552 // n_children and max_children are 32-bit integers. 16-bit integers
555 UInt n_children; // number of children
576 UInt n_children;
629 xpt->n_children = 0;
642 tl_assert(parent->n_children <= parent->max_children);
643 if (parent->n_children == parent->max_children) {
659 parent->children[ parent->n_children++ ] = child;
706 for (i = 0; i < xpt->n_children; i++) {
711 n_insig_children = xpt->n_children - n_sig_children;
720 sxpt->Sig.n_children = n_child_sxpts;
732 for (i = 0; i < xpt->n_children; i++) {
768 for (i = 0; i < sxpt->Sig.n_children; i++) {
797 tl_assert(xpt->n_children <= xpt->max_children);
816 if (sxpt->Sig.n_children > 0) {
817 for (i = 0; i < sxpt->Sig.n_children; i++) {
955 if (ch == xpt->n_children) {
993 //tl_assert(0 == xpt->n_children); // Must be bottom-XPt
994 if (0 != xpt->n_children) {
2195 sxpt->Sig.n_children = 0;
2204 FP("%sn%d: %lu ", depth_str, sxpt->Sig.n_children, sxpt->szB);
2252 VG_(ssort)(sxpt->Sig.children, sxpt->Sig.n_children, sizeof(SXPt*),
2257 for (i = 0; i < sxpt->Sig.n_children; i++) {
2460 alloc_xpt->n_children,
2461 ( n_xpts ? alloc_xpt->n_children * 100 / n_xpts : 0));
