| /src/external/gpl3/binutils/dist/gprofng/src/ |
| CallStack.h | 69 return ancestor;
80 CallStackNode *ancestor; member in class:CallStackNode
|
| ArchiveExp.cc | 113 node = node->ancestor;
|
| CallStack.cc | 326 node = node->ancestor;
901 node = node->ancestor;
1008 ancestor = _ancestor;
1167 (unsigned long long) node, (unsigned long long) node->ancestor,
1187 for (; node; node = node->ancestor)
1197 node = node->ancestor;
1210 while (node && node->ancestor)
1213 node = node->ancestor;
1235 node1 = node1->ancestor;
1236 node2 = node2->ancestor;
[all...] |
| PathTree.h | 92 ancestor = 0;
98 NodeIdx ancestor; member in struct:PathTree::Node
|
| PathTree.cc | 351 node->ancestor = anc;
645 node_idx = NODE_IDX (node_idx)->ancestor;
1364 if (pathTreeType == PATHTREE_INTERNAL_FUNCTREE && node->ancestor != 0)
1905 // node->ancestor idx
2020 NodeIdx ancestor_idx = node->ancestor;
2065 for (anc = NODE_IDX (node->ancestor); anc;
2066 anc = NODE_IDX (anc->ancestor))
2229 for (anc = NODE_IDX (node->ancestor); anc;
2230 anc = NODE_IDX (anc->ancestor))
2287 Histable *instr = NODE_IDX (node->ancestor)->instr
[all...] |
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| CallStack.h | 69 return ancestor;
80 CallStackNode *ancestor; member in class:CallStackNode
|
| ArchiveExp.cc | 113 node = node->ancestor;
|
| CallStack.cc | 326 node = node->ancestor;
901 node = node->ancestor;
1008 ancestor = _ancestor;
1167 (unsigned long long) node, (unsigned long long) node->ancestor,
1187 for (; node; node = node->ancestor)
1197 node = node->ancestor;
1210 while (node && node->ancestor)
1213 node = node->ancestor;
1235 node1 = node1->ancestor;
1236 node2 = node2->ancestor;
[all...] |
| PathTree.h | 92 ancestor = 0;
98 NodeIdx ancestor; member in struct:PathTree::Node
|
| PathTree.cc | 351 node->ancestor = anc;
645 node_idx = NODE_IDX (node_idx)->ancestor;
1364 if (pathTreeType == PATHTREE_INTERNAL_FUNCTREE && node->ancestor != 0)
1905 // node->ancestor idx
2020 NodeIdx ancestor_idx = node->ancestor;
2065 for (anc = NODE_IDX (node->ancestor); anc;
2066 anc = NODE_IDX (anc->ancestor))
2229 for (anc = NODE_IDX (node->ancestor); anc;
2230 anc = NODE_IDX (anc->ancestor))
2287 Histable *instr = NODE_IDX (node->ancestor)->instr
[all...] |
| /src/external/gpl3/gcc/dist/contrib/ |
| git-descr.sh | 36 git merge-base --is-ancestor $c ${o:-origin}/$m && echo ${r};
|
| /src/external/gpl3/gcc.old/dist/contrib/ |
| git-descr.sh | 36 git merge-base --is-ancestor $c ${o:-origin}/$m && echo ${r};
|
| /src/external/gpl3/gcc.old/dist/gcc/d/dmd/ |
| access.d | 124 Dsymbol ancestor = mod.parent;
125 for (; ancestor; ancestor = ancestor.parent)
127 if (ancestor == pkg)
131 printf("\tsc is in permitted ancestor package for s\n");
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| 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...] |
| ipa-prop.cc | 356 fprintf (f, "ANCESTOR: ");
358 jump_func->value.ancestor.formal_id,
359 jump_func->value.ancestor.offset);
360 if (jump_func->value.ancestor.agg_preserved)
362 if (jump_func->value.ancestor.keep_null)
607 /* Set JFUNC to be an ancestor jump function. */
614 jfunc->value.ancestor.formal_id = formal_id;
615 jfunc->value.ancestor.offset = offset;
616 jfunc->value.ancestor.agg_preserved = agg_preserved;
617 jfunc->value.ancestor.keep_null = keep_null
[all...] |
| /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/ |
| ipa-prop.cc | 475 fprintf (f, "ANCESTOR: ");
477 jump_func->value.ancestor.formal_id,
478 jump_func->value.ancestor.offset);
479 if (jump_func->value.ancestor.agg_preserved)
481 if (jump_func->value.ancestor.keep_null)
710 /* Set JFUNC to be an ancestor jump function. */
717 jfunc->value.ancestor.formal_id = formal_id;
718 jfunc->value.ancestor.offset = offset;
719 jfunc->value.ancestor.agg_preserved = agg_preserved;
720 jfunc->value.ancestor.keep_null = keep_null
[all...] |
| 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/cddl/osnet/dist/uts/common/fs/zfs/sys/ |
| dsl_dir.h | 136 dsl_dir_t *ancestor, int64_t delta, int ondiskonly);
|
| /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_test_cpp-generic.cc | 259 node = band.ancestor(2);
265 node = node.ancestor(2);
|
| isl_test_python.py | 311 node = node.ancestor(2)
317 node = node.ancestor(2)
|
| 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/gpl3/gcc/dist/gcc/cp/ |
| name-lookup.h | 350 extern bool is_ancestor (tree ancestor, tree descendant);
|
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| name-lookup.h | 347 extern bool is_ancestor (tree ancestor, tree descendant);
|
