/external/bison/src/ |
D | relation.h | 34 typedef relation_nodes *relation; typedef 38 void relation_print (relation r, relation_node size, FILE *out); 45 void relation_digraph (relation r, relation_node size, bitsetv *function); 48 void relation_transpose (relation *R_arg, relation_node n);
|
D | relation.c | 30 relation_print (relation r, relation_node size, FILE *out) in relation_print() 54 static relation R; 97 relation_digraph (relation r, relation_node size, bitsetv *function) in relation_digraph() 125 relation_transpose (relation *R_arg, relation_node n) in relation_transpose() 127 relation r = *R_arg; in relation_transpose() 129 relation new_R = xnmalloc (n, sizeof *new_R); in relation_transpose() 131 relation end_R = xnmalloc (n, sizeof *end_R); in relation_transpose()
|
D | Makefile.in | 87 reader.$(OBJEXT) reduce.$(OBJEXT) relation.$(OBJEXT) \
|
/external/icu4c/test/intltest/ |
D | dadrcoll.cpp | 107 el.relation = Collator::LESS; in getNextInSequence() 111 el.relation = Collator::EQUAL; in getNextInSequence() 115 el.relation = Collator::GREATER; in getNextInSequence() 262 Collator::EComparisonResult relation = Collator::EQUAL; in processSequence() local 276 relation = Collator::EQUAL; in processSequence() 281 if(relation == Collator::EQUAL && source->relation != Collator::EQUAL) { in processSequence() 282 relation = source->relation; in processSequence() 284 doTest(col, source->source, target->source, relation); in processSequence()
|
D | dadrcoll.h | 33 Collator::EComparisonResult relation; variable
|
/external/iproute2/tc/ |
D | emp_ematch.y | 30 %type <i> invert relation 50 | match relation expr 52 $1->relation = $2; 82 relation:
|
D | m_ematch.c | 181 .flags = t->relation in parse_tree() 241 if (tree->relation == 0) in flatten_tree() 565 if (t->relation == TCF_EM_REL_AND) in print_ematch_tree() 567 else if (t->relation == TCF_EM_REL_OR) in print_ematch_tree()
|
D | m_ematch.h | 61 int relation; member
|
/external/valgrind/main/auxprogs/ |
D | DotToScc.hs | 114 search relation (visited, sequence) vertex 119 = deDepthFirstSearch relation 121 (relation vertex) 136 search relation (visited, utSetSequence) vertex 141 = deDepthFirstSearch relation 143 (relation vertex)
|
/external/e2fsprogs/e2fsck/ |
D | prof_err.et | 10 error_code PROF_NO_RELATION, "Profile relation not found" 12 "Attempt to add a relation to node which is not a section" 30 error_code PROF_RELATION_SYNTAX, "Syntax error in profile relation"
|
/external/llvm/utils/llvm-build/llvmbuild/ |
D | main.py | 142 '%r (%s)' % (ci.name, relation) 143 for relation,ci in current_stack) 162 for relation,referent_name in ci.get_component_references(): 167 ci.name, referent_name, relation)) 170 current_stack.append((relation,ci))
|
/external/llvm/test/Transforms/LoopRotate/ |
D | crash.ll | 33 %struct.relation = type { [4 x i16], i32, [4 x i16], i32, i32 } 45 … %r91.0.lcssa = phi %struct.relation* [ null, %bb139 ] ; <%struct.relation*> [#uses=0]
|
/external/webkit/Source/WebCore/css/ |
D | CSSSelector.cpp | 548 sel1->relation() != sel2->relation() || sel1->m_match != sel2->m_match || in operator ==() 660 if (cs->relation() != CSSSelector::SubSelector || !cs->tagHistory()) in selectorText() 667 if (cs->relation() == CSSSelector::DirectAdjacent) in selectorText() 669 else if (cs->relation() == CSSSelector::IndirectAdjacent) in selectorText() 671 else if (cs->relation() == CSSSelector::Child) in selectorText()
|
D | CSSSelector.h | 259 Relation relation() const { return static_cast<Relation>(m_relation); } in relation() function
|
D | CSSStyleSelector.cpp | 2084 …if (selector->relation() != CSSSelector::Descendant && selector->relation() != CSSSelector::Child … in isFastCheckableSelector() 2098 if (selector->relation() == CSSSelector::Descendant) in fastCheckSingleSelector() 2101 …ASSERT(selector->relation() == CSSSelector::Child || selector->relation() == CSSSelector::SubSelec… in fastCheckSingleSelector() 2105 if (selector->relation() != CSSSelector::SubSelector) in fastCheckSingleSelector() 2156 …if (selector->relation() == CSSSelector::Child || selector->relation() == CSSSelector::SubSelector) in fastCheckSelector() 2159 if (selector->relation() != CSSSelector::SubSelector) in fastCheckSelector() 2205 CSSSelector::Relation relation = sel->relation(); in checkSelector() local 2212 if (relation != CSSSelector::SubSelector) in checkSelector() 2228 switch (relation) { in checkSelector() 3074 CSSSelector::Relation relation = m_selector->relation(); in collectDescendantSelectorIdentifierHashes() local [all …]
|
/external/chromium/testing/gtest/include/gtest/internal/ |
D | gtest-internal.h | 1033 NativeArray(const Element* array, size_t count, RelationToSource relation) { 1034 Init(array, count, relation); 1063 void Init(const Element* array, size_t a_size, RelationToSource relation) { 1064 if (relation == kReference) { 1072 relation_to_source_ = relation;
|
/external/llvm/utils/unittest/googletest/include/gtest/internal/ |
D | gtest-internal.h | 1059 NativeArray(const Element* array, size_t count, RelationToSource relation) { 1060 Init(array, count, relation); 1089 void Init(const Element* array, size_t a_size, RelationToSource relation) { 1090 if (relation == kReference) { 1098 relation_to_source_ = relation;
|
/external/gtest/include/gtest/internal/ |
D | gtest-internal.h | 1040 NativeArray(const Element* array, size_t count, RelationToSource relation) { 1041 Init(array, count, relation); 1070 void Init(const Element* array, size_t a_size, RelationToSource relation) { 1071 if (relation == kReference) { 1079 relation_to_source_ = relation;
|
/external/webkit/Source/WebCore/html/ |
D | HTMLAnchorElement.h | 95 bool hasRel(uint32_t relation) const;
|
D | HTMLAnchorElement.cpp | 274 bool HTMLAnchorElement::hasRel(uint32_t relation) const in hasRel() 276 return m_linkRelations & relation; in hasRel()
|
/external/bison/ |
D | Android.mk | 62 src/relation.c \
|
/external/valgrind/main/VEX/priv/ |
D | ir_opt.c | 3115 GSAliasing relation; in findPutI() local 3138 relation in findPutI() 3144 if (relation == NoAlias) { in findPutI() 3152 vassert(relation != ExactAlias); in findPutI() 3161 relation = getAliasingRelation_II( in findPutI() 3168 if (relation == NoAlias) { in findPutI() 3174 if (relation == UnknownAlias) { in findPutI() 3181 vassert(relation == ExactAlias); in findPutI() 3231 GSAliasing relation; in guestAccessWhichMightOverlapPutI() local 3263 relation in guestAccessWhichMightOverlapPutI() [all …]
|
/external/chromium/testing/gmock/include/gmock/ |
D | gmock-matchers.h | 703 name, op, relation, negated_relation) \ argument 721 *os << relation " "; \ 1115 #define GMOCK_IMPLEMENT_COMPARISON2_MATCHER_(name, op, relation) \ argument 1136 *os << "are " relation; \ 1139 *os << "aren't " relation; \
|
/external/chromium/chrome/browser/accessibility/ |
D | browser_accessibility_win.h | 175 IAccessibleRelation** relation) { in get_relation() argument
|
/external/llvm/test/Analysis/ScalarEvolution/ |
D | scev-aa.ll | 90 ; prove whether n will be greater than 1, so that relation will always
|