Searched refs:n_children (Results 1 – 4 of 4) sorted by relevance
146 if (n->n_children[i] != NULL) { in rpst_update_parents()147 n->n_children[i]->n_parent = n; in rpst_update_parents()165 memset(&n->n_children, 0, sizeof(n->n_children)); in rpst_enlarge_tree()166 n->n_children[0] = t->t_root; in rpst_enlarge_tree()192 memset(&n->n_children, 0, sizeof(n->n_children)); in rpst_insert_node1()205 memcpy(n->n_children, cur->n_children, sizeof(n->n_children)); in rpst_insert_node1()214 where = &cur->n_children[idx]; in rpst_insert_node1()256 if (parent->n_children[i] == n) { in rpst_find_pptr()260 KASSERT(parent->n_children[i] == n); in rpst_find_pptr()261 return &parent->n_children[i]; in rpst_find_pptr()[all …]
271 int n_children = 0; in ada_varobj_get_struct_number_of_children() local299 n_children += ada_varobj_get_struct_number_of_children in ada_varobj_get_struct_number_of_children()303 n_children += ada_varobj_get_number_of_children (elt_value, elt_type); in ada_varobj_get_struct_number_of_children()316 n_children++; in ada_varobj_get_struct_number_of_children()319 return n_children; in ada_varobj_get_struct_number_of_children()
45 struct rpst_node *n_children[2]; member
194 static int n_children; /* # child processes still running */ variable657 if (n_children > 0) { in main()662 dbglog("Waiting for %d child processes...", n_children); in main()666 while (n_children > 0 && !childwait_done) { in main()2011 ++n_children; in record_child()2054 --n_children; in forget_child()2081 if (n_children == 0) in reap_kids()