HomeSort by: relevance | last modified time | path
    Searched defs:next_child (Results 1 - 14 of 14) sorted by relevancy

  /src/external/gpl3/binutils/dist/gprof/
cg_arcs.h 38 struct arc *next_child; /* next child of PARENT */ member in struct:arc
  /src/external/gpl3/binutils/dist/gprofng/src/
cg_arcs.h 38 struct arc *next_child; /* next child of PARENT */ member in struct:arc
  /src/external/gpl3/binutils.old/dist/gprof/
cg_arcs.h 38 struct arc *next_child; /* next child of PARENT */ member in struct:arc
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/
prefix_search_node_update_imp.hpp 108 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits);
115 next_child(node_iterator nd_it, typename access_traits::const_iterator b, function in class:PB_DS_CLASS_C_DEC
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/
prefix_search_node_update_imp.hpp 108 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits);
115 next_child(node_iterator nd_it, typename access_traits::const_iterator b, function in class:PB_DS_CLASS_C_DEC
  /src/sys/kern/
kern_exit.c 203 struct proc *p, *child, *next_child, *old_parent, *new_parent; local
465 for (; child != NULL; child = next_child) {
466 next_child = LIST_NEXT(child, p_sibling);
  /src/usr.sbin/mrouted/
prune.c 550 next_child(struct gtable **gtpp, struct stable **stpp, u_long grp, u_long src, function
  /src/external/gpl3/gdb/dist/gdb/
macrotab.c 409 struct macro_source_file *child, *next_child;
412 for (child = src->includes; child; child = next_child)
414 next_child = child->next_included;
405 struct macro_source_file *child, *next_child; local
objfiles.c 424 struct objfile *next_child = child->separate_debug_objfile_link;
426 child = next_child;
422 struct objfile *next_child = child->separate_debug_objfile_link; local
  /src/external/gpl3/gdb.old/dist/gdb/
macrotab.c 408 struct macro_source_file *child, *next_child;
411 for (child = src->includes; child; child = next_child)
413 next_child = child->next_included;
404 struct macro_source_file *child, *next_child; local
objfiles.c 481 struct objfile *next_child = child->separate_debug_objfile_link;
483 child = next_child;
479 struct objfile *next_child = child->separate_debug_objfile_link; local
  /src/external/gpl2/lvm2/dist/tools/
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);
  /src/external/gpl3/gcc/dist/gcc/
tree-sra.cc 3468 struct access *next_child = *ptr; local
3474 new_acc->first_child = next_child;
3476 for (struct access *a = next_child; a; a = a->next_sibling)
3539 struct access *next_child; local
3541 next_child = parent->first_child;
3543 next_child = (*last_seen_sibling)->next_sibling;
3548 while (next_child && next_child->offset < pos)
3550 if (next_child->offset + next_child->size > pos
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-sra.cc 3162 struct access *next_child = *ptr; local
3168 new_acc->first_child = next_child;
3170 for (struct access *a = next_child; a; a = a->next_sibling)
3233 struct access *next_child; local
3235 next_child = parent->first_child;
3237 next_child = (*last_seen_sibling)->next_sibling;
3242 while (next_child && next_child->offset < pos)
3244 if (next_child->offset + next_child->size > pos
    [all...]

Completed in 49 milliseconds