children          446 examples/libsmbclient/tree.c     gtk_tree_remove_items(GTK_TREE(real_tree), GTK_TREE(real_tree)->children);
children          581 examples/libsmbclient/tree.c     gtk_tree_remove_items(GTK_TREE(real_tree), GTK_TREE(real_tree)->children);
children          164 lib/torture/torture.c 	suite->children = NULL;
children          273 lib/torture/torture.c 	for (tsuite = suite->children; tsuite; tsuite = tsuite->next) {
children          542 lib/torture/torture.c 	DLIST_ADD_END(suite->children, child, struct torture_suite *);
children          558 lib/torture/torture.c 	for (child = parent->children; child; child = child->next) 
children          158 lib/torture/torture.h 	struct torture_suite *children;
children          442 source3/client/tree.c     gtk_tree_remove_items(GTK_TREE(real_tree), GTK_TREE(real_tree)->children);
children          577 source3/client/tree.c     gtk_tree_remove_items(GTK_TREE(real_tree), GTK_TREE(real_tree)->children);
children           27 source3/include/adt_tree.h 	struct _tree_node	**children;
children           90 source3/lib/adt_tree.c 	siblings = TALLOC_REALLOC_ARRAY( node, node->children, TREE_NODE *, node->num_children+1 );
children           93 source3/lib/adt_tree.c 		node->children = siblings;
children          102 source3/lib/adt_tree.c 		node->children[0] = infant;
children          118 source3/lib/adt_tree.c 				infant->key, node->children[i-1]->key));
children          123 source3/lib/adt_tree.c 			if ( StrCaseCmp( infant->key, node->children[i-1]->key ) > 0 ) {
children          126 source3/lib/adt_tree.c 				node->children[i] = infant;
children          132 source3/lib/adt_tree.c 			node->children[i] = node->children[i-1];
children          141 source3/lib/adt_tree.c 			node->children[0] = infant;
children          169 source3/lib/adt_tree.c 			node->children[i]->key));
children          171 source3/lib/adt_tree.c 		result = StrCaseCmp( node->children[i]->key, key );
children          174 source3/lib/adt_tree.c 			next = node->children[i];
children          314 source3/lib/adt_tree.c 		pathtree_print_children(ctx, node->children[i], debug, path2 );
children          333 source3/lib/adt_tree.c 		pathtree_print_children(ctx, tree->root->children[i], debug,
children           99 source3/modules/vfs_aio_fork.c 	struct aio_child *children;
children          228 source3/modules/vfs_aio_fork.c 	for (child = list->children; child != NULL; child = next) {
children          250 source3/modules/vfs_aio_fork.c 	if (list->children != NULL) {
children          422 source3/modules/vfs_aio_fork.c 	DLIST_REMOVE(child->list->children, child);
children          451 source3/modules/vfs_aio_fork.c 	result = TALLOC_ZERO_P(children, struct aio_child);
children          498 source3/modules/vfs_aio_fork.c 	result->list = children;
children          499 source3/modules/vfs_aio_fork.c 	DLIST_ADD(children->children, result);
children          518 source3/modules/vfs_aio_fork.c 	struct aio_child_list *children;
children          522 source3/modules/vfs_aio_fork.c 	children = init_aio_children(handle);
children          523 source3/modules/vfs_aio_fork.c 	if (children == NULL) {
children          527 source3/modules/vfs_aio_fork.c 	for (child = children->children; child != NULL; child = child->next) {
children          537 source3/modules/vfs_aio_fork.c 		status = create_aio_child(children, 128*1024, &child);
children          639 source3/modules/vfs_aio_fork.c 	struct aio_child_list *children;
children          642 source3/modules/vfs_aio_fork.c 	children = init_aio_children(handle);
children          643 source3/modules/vfs_aio_fork.c 	if (children == NULL) {
children          647 source3/modules/vfs_aio_fork.c 	for (child = children->children; child != NULL; child = child->next) {
children          681 source3/modules/vfs_aio_fork.c 	struct aio_child_list *children;
children          684 source3/modules/vfs_aio_fork.c 	children = init_aio_children(handle);
children          685 source3/modules/vfs_aio_fork.c 	if (children == NULL) {
children          690 source3/modules/vfs_aio_fork.c 	for (child = children->children; child != NULL; child = child->next) {
children          187 source3/smbd/globals.c struct child_pid *children = 0;
children          199 source3/smbd/globals.h extern struct child_pid *children;
children          204 source3/smbd/server.c 	DLIST_ADD(children, child);
children          228 source3/smbd/server.c 	for (child = children; child != NULL; child = child->next) {
children          231 source3/smbd/server.c 			DLIST_REMOVE(children, child);
children           40 source3/torture/nbio.c } *children;
children           47 source3/torture/nbio.c 		total += children[i].bytes_out + children[i].bytes_in;
children           59 source3/torture/nbio.c 		lines += children[i].line;
children           60 source3/torture/nbio.c 		if (!children[i].done) num_clients++;
children           72 source3/torture/nbio.c 	children = (struct children *)shm_setup(sizeof(*children) * nprocs);
children           73 source3/torture/nbio.c 	if (!children) {
children           83 source3/torture/nbio.c 	children[nbio_id].line = line_count;
children           94 source3/torture/nbio.c 	children[nbio_id].line = line_count;
children          125 source3/torture/nbio.c 	children[nbio_id].done = 0;
children          194 source3/torture/nbio.c 	children[nbio_id].bytes_out += ret_size;
children          207 source3/torture/nbio.c 	children[nbio_id].bytes_in += ret_size;
children          325 source3/torture/nbio.c 	children[nbio_id].done = 1;
children          482 source3/winbindd/winbindd_dual.c struct winbindd_child *children = NULL;
children          488 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
children          501 source3/winbindd/winbindd_dual.c 	DLIST_REMOVE(children, child);
children          551 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
children          596 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
children          672 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
children          707 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
children          733 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
children         1204 source3/winbindd/winbindd_dual.c 	for (cl = children; cl != NULL; cl = cl->next) {
children         1274 source3/winbindd/winbindd_dual.c 		DLIST_ADD(children, child);
children          441 source4/client/tree.c     gtk_tree_remove_items(GTK_TREE(real_tree), GTK_TREE(real_tree)->children);
children          576 source4/client/tree.c     gtk_tree_remove_items(GTK_TREE(real_tree), GTK_TREE(real_tree)->children);
children           86 source4/heimdal/lib/krb5/config_file_netinfo.c 	ni_idlist children;
children          114 source4/heimdal/lib/krb5/config_file_netinfo.c 	nis = ni_children(ni, &nid, &children);
children          116 source4/heimdal/lib/krb5/config_file_netinfo.c 	    nis = ni_idlist2binding(ni, &children, &b->u.list);
children          142 source4/heimdal/lib/krb5/config_file_netinfo.c     ni_idlist children;
children          161 source4/heimdal/lib/krb5/config_file_netinfo.c 	    nis = ni_children(ni, &nid, &children);
children          164 source4/heimdal/lib/krb5/config_file_netinfo.c 	    nis = ni_idlist2binding(ni, &children, &s);
children           74 source4/torture/nbench/nbio.c } *children;
children          162 source4/torture/nbench/nbio.c 	children[client].connected = false;
children          191 source4/torture/nbench/nbio.c 		last_bytes = children[nbio_id].bytes;
children          196 source4/torture/nbench/nbio.c 	tdelay = (children[nbio_id].bytes - last_bytes)/(1.0e6*rate) - timeval_elapsed(&last_time);
children          200 source4/torture/nbench/nbio.c 		children[nbio_id].max_latency = MAX(children[nbio_id].max_latency, -tdelay);
children          204 source4/torture/nbench/nbio.c 	last_bytes = children[nbio_id].bytes;
children          209 source4/torture/nbench/nbio.c 	children[nbio_id].starttime = timeval_current();	
children          214 source4/torture/nbench/nbio.c 	double elapsed = timeval_elapsed(&children[nbio_id].starttime);
children          217 source4/torture/nbench/nbio.c 	} else if (elapsed - targett > children[nbio_id].max_latency) {
children          218 source4/torture/nbench/nbio.c 		children[nbio_id].max_latency = MAX(elapsed - targett, children[nbio_id].max_latency);
children          227 source4/torture/nbench/nbio.c 		total += children[i].bytes - children[i].warmup_bytes;
children          237 source4/torture/nbench/nbio.c 		if (children[i].max_latency > max_latency) {
children          238 source4/torture/nbench/nbio.c 			max_latency = children[i].max_latency;
children          239 source4/torture/nbench/nbio.c 			children[i].max_latency = 0;
children          247 source4/torture/nbench/nbio.c 	return children[nbio_id].done;
children          262 source4/torture/nbench/nbio.c 		if (children[i].connected) {
children          265 source4/torture/nbench/nbio.c 		if (children[i].bytes == 0) {
children          268 source4/torture/nbench/nbio.c 		lines += children[i].line;
children          277 source4/torture/nbench/nbio.c 			children[i].warmup_bytes = children[i].bytes;
children          285 source4/torture/nbench/nbio.c 			children[i].done = 1;
children          320 source4/torture/nbench/nbio.c 	children = shm_setup(sizeof(*children) * nprocs);
children          321 source4/torture/nbench/nbio.c 	if (!children) {
children          325 source4/torture/nbench/nbio.c 	memset(children, 0, sizeof(*children) * nprocs);
children          364 source4/torture/nbench/nbio.c 	children[nbio_id].line = nbench_line_count;
children          404 source4/torture/nbench/nbio.c 	children[id].connected = true;
children          579 source4/torture/nbench/nbio.c 	children[nbio_id].bytes += ret_size;
children          620 source4/torture/nbench/nbio.c 	children[nbio_id].bytes += ret_size;
children          746 source4/torture/nbench/nbio.c 	children[nbio_id].bytes += ret_size;
children          993 source4/torture/nbench/nbio.c 	children[nbio_id].connected = false;
children           52 source4/torture/smbtorture.c 		for (o = (torture_root == NULL?NULL:torture_root->children); o; o = o->next) {
children           67 source4/torture/smbtorture.c 		for (c = suite->children; c; c = c->next) {
children          112 source4/torture/smbtorture.c 		for (o = torture_root->children; o; o = o->next) {
children          203 source4/torture/smbtorture.c 	for (o = torture_root->children; o; o = o->next) {
children          204 source4/torture/smbtorture.c 		for (s = o->children; s; s = s->next) {
children          278 source4/torture/smbtorture.c 	for (o = torture_root->children; o; o = o->next) {
children          282 source4/torture/smbtorture.c 		for (s = o->children; s; s = s->next) {