/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libgomp/ |
H A D | task.c | 69 task = task->next_child; 151 task->next_child = parent->children; 153 task->next_child->prev_child = task; 154 task->prev_child->next_child = task; 158 task->next_child = task; 216 parent->children = child_task->next_child; 249 child_task->prev_child->next_child = child_task->next_child; 250 child_task->next_child->prev_child = child_task->prev_child; 253 if (child_task->next_child ! [all...] |
H A D | libgomp.h | 244 struct gomp_task *next_child; member in struct:gomp_task
|
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gprof/ |
H A D | cg_arcs.h | 19 struct arc *next_child; /* next child of PARENT */ member in struct:arc
|
H A D | call_graph.c | 115 for (arc = sym->cg.children; arc; arc = arc->next_child)
|
H A D | cg_print.c | 406 sorted.next_child = 0; 410 detached = arc->next_child; 413 for (prev = &sorted; prev->next_child; prev = prev->next_child) 415 if (cmp_arc (arc, prev->next_child) != LESSTHAN) 419 arc->next_child = prev->next_child; 420 prev->next_child = arc; 424 parent->cg.children = sorted.next_child; 437 for (arc = parent->cg.children; arc; arc = arc->next_child) [all...] |
H A D | cg_dfn.c | 298 for (arc = parent->cg.children; arc; arc = arc->next_child)
|
H A D | cg_arcs.c | 70 for (arc = parent->cg.children; arc; arc = arc->next_child) 144 arc->next_child = parent->cg.children; 177 for (arc = parent->cg.children; arc; arc = arc->next_child)
|
H A D | gmon_io.c | 731 for (arc = sym->cg.children; arc; arc = arc->next_child)
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
H A D | prefix_search_node_update_imp.hpp | 114 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits); 121 next_child(node_iterator nd_it, typename e_access_traits::const_iterator b, typename e_access_traits::const_iterator e, node_iterator end_nd_it, const e_access_traits& r_traits) function in class:PB_DS_CLASS_C_DEC
|
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/gdb/ |
H A D | macrotab.c | 405 struct macro_source_file *child, *next_child; 408 for (child = src->includes; child; child = next_child) 410 next_child = child->next_included; 401 struct macro_source_file *child, *next_child; local
|
H A D | objfiles.c | 527 struct objfile *next_child = child->separate_debug_objfile_link; local 529 child = next_child;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/ |
H A D | trie_policy.hpp | 229 next_child(node_iterator, const_e_iterator, const_e_iterator,
|
/netbsd-6-1-5-RELEASE/external/gpl2/lvm2/dist/tools/ |
H A D | dmsetup.c | 1879 struct dm_tree_node *child, *next_child; local 1885 next_child = dm_tree_next_child(&handle, node, inverted); 1887 while ((child = next_child)) { 1888 next_child = dm_tree_next_child(&handle, node, inverted); 1893 next_child ? 0U : 1U, has_children);
|
/netbsd-6-1-5-RELEASE/usr.sbin/mrouted/ |
H A D | snmp.c | 1236 if (!next_child(>, &st, grp, src, mask, &vifi)) 1250 || !next_child(>, &st, grp, src, mask, &vifi))
|
H A D | prune.c | 550 next_child(struct gtable **gtpp, struct stable **stpp, u_long grp, u_long src, function
|