num_children 28 source3/include/adt_tree.h int num_children; num_children 90 source3/lib/adt_tree.c siblings = TALLOC_REALLOC_ARRAY( node, node->children, TREE_NODE *, node->num_children+1 ); num_children 95 source3/lib/adt_tree.c node->num_children++; num_children 99 source3/lib/adt_tree.c if ( node->num_children == 1 ) { num_children 115 source3/lib/adt_tree.c for ( i = node->num_children-1; i>=1; i-- ) num_children 166 source3/lib/adt_tree.c for ( i=0; i<node->num_children; i++ ) num_children 287 source3/lib/adt_tree.c int num_children; num_children 312 source3/lib/adt_tree.c num_children = node->num_children; num_children 313 source3/lib/adt_tree.c for ( i=0; i<num_children; i++ ) { num_children 325 source3/lib/adt_tree.c int num_children = tree->root->num_children; num_children 331 source3/lib/adt_tree.c for ( i=0; i<num_children; i++ ) { num_children 188 source3/smbd/globals.c int num_children = 0; num_children 200 source3/smbd/globals.h extern int num_children; num_children 205 source3/smbd/server.c num_children += 1; num_children 233 source3/smbd/server.c num_children -= 1; num_children 252 source3/smbd/server.c return num_children < max_processes; num_children 38 source4/dsdb/samdb/ldb_modules/subtree_delete.c int num_children; num_children 84 source4/dsdb/samdb/ldb_modules/subtree_delete.c ac->num_children++; num_children 95 source4/dsdb/samdb/ldb_modules/subtree_delete.c if (ac->num_children > 0) { num_children 101 source4/dsdb/samdb/ldb_modules/subtree_delete.c ac->num_children); num_children 104 source4/smbd/process_prefork.c int i, num_children; num_children 136 source4/smbd/process_prefork.c num_children = lp_parm_int(lp_ctx, NULL, "prefork children", service_name, 0); num_children 137 source4/smbd/process_prefork.c if (num_children == 0) { num_children 149 source4/smbd/process_prefork.c for (i=0; i < num_children; i++) {