| /src/external/gpl3/binutils/dist/gprofng/src/ |
| CallStack.h | 69 return ancestor;
80 CallStackNode *ancestor; member in class:CallStackNode
|
| PathTree.h | 92 ancestor = 0;
98 NodeIdx ancestor; member in struct:PathTree::Node
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| CallStack.h | 69 return ancestor;
80 CallStackNode *ancestor; member in class:CallStackNode
|
| PathTree.h | 92 ancestor = 0;
98 NodeIdx ancestor; member in struct:PathTree::Node
|
| /src/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| dsl_dir.c | 103 * the common ancestor. A receive will also validate the counts and then update
751 * initialized) filesystem or the given ancestor must be satisfied.
755 dsl_dir_t *ancestor, cred_t *cr)
800 * If an ancestor has been provided, stop checking the limit once we
802 * the check once we recurse up to the common ancestor.
804 if (ancestor == dd)
827 ancestor, cr);
1052 * How much space would dd have available if ancestor had delta applied
1058 dsl_dir_t *ancestor, int64_t delta, int ondiskonly)
1071 ancestor, delta, ondiskonly)
1946 dsl_dir_t *ancestor; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| cfgloop.cc | 255 basic_block ancestor = e->src;
257 if (ancestor->loop_father != loop)
259 ancestor->loop_father = loop;
261 stack.safe_push (ancestor);
1306 /* Finds nearest common ancestor in loop tree for given loops. */
254 basic_block ancestor = e->src; local
|
| ipa-prop.h | 59 getting addresses of ancestor fields in C++
61 NULL, ancestor jump function must behave like a simple pass-through.
78 IPA_JF_ANCESTOR /* represented by field ancestor */
143 /* Structure holding data required to describe an ancestor pass-through
148 /* Offset of the field representing the ancestor. */
351 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
448 /* Return the offset of an ancestor jump function JFUNC. */
454 return jfunc->value.ancestor.offset;
457 /* Return the number of the caller's formal parameter that an ancestor jump
464 return jfunc->value.ancestor.formal_id
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| cfgloop.cc | 262 basic_block ancestor = e->src;
264 if (ancestor->loop_father != loop)
266 ancestor->loop_father = loop;
268 stack.safe_push (ancestor);
1313 /* Finds nearest common ancestor in loop tree for given loops. */
261 basic_block ancestor = e->src; local
|
| ipa-prop.h | 54 getting addresses of ancestor fields in C++
56 NULL, ancestor jump function must behave like a simple pass-through.
73 IPA_JF_ANCESTOR /* represented by field ancestor */
138 /* Structure holding data required to describe an ancestor pass-through
143 /* Offset of the field representing the ancestor. */
341 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
438 /* Return the offset of an ancestor jump function JFUNC. */
444 return jfunc->value.ancestor.offset;
447 /* Return the number of the caller's formal parameter that an ancestor jump
454 return jfunc->value.ancestor.formal_id
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/amdgpu/ |
| amdgpu_vm.c | 756 struct amdgpu_bo *ancestor = bo; local
762 if (ancestor->parent) {
764 while (ancestor->parent->parent) {
766 ancestor = ancestor->parent;
782 pt = container_of(ancestor->vm_bo, struct amdgpu_vm_pt, base);
|
| /src/external/bsd/pcc/dist/pcc/mip/ |
| pass2.h | 456 unsigned int ancestor; member in struct:basicblock
|
| /src/external/gpl2/grep/dist/src/ |
| grep.c | 1007 struct stats const *ancestor; local
1013 for (ancestor = stats; (ancestor = ancestor->parent) != 0; )
1014 if (ancestor->stat.st_ino == stats->stat.st_ino
1015 && ancestor->stat.st_dev == stats->stat.st_dev)
|
| /src/external/mit/isl/dist/ |
| isl_schedule_node.c | 616 * We traverse the list from innermost ancestor (last element)
617 * to outermost ancestor (first element), calling collect_filter_prefix_init
630 * ancestor is a domain node, which always results in an initialization.
672 * there is also a filter ancestor that filters out all the extended
719 * there is also a filter ancestor that filters out all the extended
794 * there is also a filter ancestor that filters out all the extended
849 * there is also a filter ancestor that filters out all the extended
1093 /* Move the "node" pointer to the ancestor of the given generation
1556 isl_schedule_node *ancestor; local
1559 ancestor = isl_schedule_node_copy(node)
[all...] |
| /src/external/mit/isl/dist/interface/ |
| isl.py | 15223 def ancestor(arg0, arg1): member in class:schedule_node
|
| /src/external/gpl3/gcc.old/dist/gcc/c/ |
| c-parser.cc | 16304 ancestor | device_num */
16313 bool ancestor = false;
16324 if (strcmp ("ancestor", p) == 0)
16330 error_at (tok->location, "%<ancestor%> device modifier not "
16336 ancestor = true;
16342 error_at (tok->location, "expected %<ancestor%> or %<device_num%>");
16363 if (ancestor && TREE_CODE (t) == INTEGER_CST && !integer_onep (t))
16376 OMP_CLAUSE_DEVICE_ANCESTOR (c) = ancestor;
16308 bool ancestor = false; local
|
| /src/external/mit/isl/dist/include/isl/ |
| cpp-checked.h | 3287 inline isl::checked::schedule_node ancestor(int generation) const;
3288 inline class size ancestor_child_position(const isl::checked::schedule_node &ancestor) const;
3289 inline class size get_ancestor_child_position(const isl::checked::schedule_node &ancestor) const;
15980 isl::checked::schedule_node schedule_node::ancestor(int generation) const function in class:isl::checked::schedule_node
15986 class size schedule_node::ancestor_child_position(const isl::checked::schedule_node &ancestor) const
15988 auto res = isl_schedule_node_get_ancestor_child_position(get(), ancestor.get());
15992 class size schedule_node::get_ancestor_child_position(const isl::checked::schedule_node &ancestor) const
15994 return ancestor_child_position(ancestor);
|
| cpp.h | 3353 inline isl::schedule_node ancestor(int generation) const;
3354 inline unsigned ancestor_child_position(const isl::schedule_node &ancestor) const;
3355 inline unsigned get_ancestor_child_position(const isl::schedule_node &ancestor) const;
22069 isl::schedule_node schedule_node::ancestor(int generation) const function in class:isl::schedule_node
22081 unsigned schedule_node::ancestor_child_position(const isl::schedule_node &ancestor) const
22083 if (!ptr || ancestor.is_null())
22087 auto res = isl_schedule_node_get_ancestor_child_position(get(), ancestor.get());
22093 unsigned schedule_node::get_ancestor_child_position(const isl::schedule_node &ancestor) const
22095 return ancestor_child_position(ancestor);
|
| /src/external/gpl3/gcc/dist/gcc/c/ |
| c-parser.cc | 18917 ancestor | device_num */
18926 bool ancestor = false;
18937 if (strcmp ("ancestor", p) == 0)
18943 error_at (tok->location, "%<ancestor%> device modifier not "
18949 ancestor = true;
18955 error_at (tok->location, "expected %<ancestor%> or %<device_num%>");
18976 if (ancestor && TREE_CODE (t) == INTEGER_CST && !integer_onep (t))
18989 OMP_CLAUSE_DEVICE_ANCESTOR (c) = ancestor;
18921 bool ancestor = false; local
|
| /src/external/gpl3/gcc/dist/gcc/fortran/ |
| gfortran.h | 1584 unsigned nowait:1, ordered:1, untied:1, mergeable:1, ancestor:1; member in struct:gfc_omp_clauses
|
| /src/external/gpl3/gcc.old/dist/gcc/fortran/ |
| gfortran.h | 1530 unsigned nowait:1, ordered:1, untied:1, mergeable:1, ancestor:1; member in struct:gfc_omp_clauses
|
