Lines Matching refs:n_children
265 nindex = pc->tree.n_children;
267 if (pc->tree.n_children == pc->tree.max_children) {
280 pc->tree.n_children++;
300 for (pos = 0; pos < pc->tree.n_children; pos++)
303 if (pos == pc->tree.n_children) return;
308 pc->tree.n_children--;
314 for (i = pos; i < pc->tree.n_children; i++)
317 pc->tree.children[pc->tree.n_children] = NULL;
417 tc->tree.n_children = 0;
528 if (tc->tree.n_children > 0)
535 for (i = 0; i< tc->tree.n_children; i++)
615 if (child != tw->tree.tree_root && tc->tree.n_children) {
635 for (j = 0; j < tc->tree.n_children; j++) {
751 if (tc->tree.n_children == 0) return;
760 for (i = 0; i < tc->tree.n_children; i++) {
827 for (i = 0; i < tc->tree.n_children; i++)
872 if (tc->tree.n_children == 0) return;
889 for (i = 0; i < tc->tree.n_children; i++) {