| /external/v8/tools/vim/ |
| ninja-build.vim | 7 " On Linux, <Leader>o, which is \o by default ("o"=creates .o files)
118 map <Leader>o :CrCompileFile<cr>
|
| /external/llvm/include/llvm/ADT/ |
| EquivalenceClasses.h | 45 /// if (!I->isLeader()) continue; // Ignore non-leader sets.
64 /// "leader pointer" depending on whether the value itself is a leader. A
65 /// "leader pointer" points to the node that is the leader for this element,
66 /// if the node is not a leader. A "end of list pointer" points to the last
68 /// leader is determined by a bit stolen from one of the pointers.
71 mutable const ECValue *Leader, *Next;
76 : Leader(this), Next((ECValue*)(intptr_t)1), Data(Elt) {}
80 if (Leader->isLeader()) return Leader
[all...] |
| /external/llvm/lib/Analysis/ |
| VectorUtils.cpp | 354 Value *Leader = ECs.getOrInsertLeaderValue(Val);
371 DBits[Leader] |= V;
385 DBits[Leader] |= ~0ULL;
395 if (DBits[Leader] == ~0ULL)
400 ECs.unionSets(Leader, O);
|
| LoopAccessAnalysis.cpp | 625 Value *Leader = DepCands.getLeaderValue(Access).getPointer();
626 unsigned &LeaderId = DepSetId[Leader];
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| EquivalenceClasses.h | 43 /// if (!I->isLeader()) continue; // Ignore non-leader sets.
61 /// "leader pointer" depending on whether the value itself is a leader. A
62 /// "leader pointer" points to the node that is the leader for this element,
63 /// if the node is not a leader. A "end of list pointer" points to the last
65 /// leader is determined by a bit stolen from one of the pointers.
68 mutable const ECValue *Leader, *Next;
73 : Leader(this), Next((ECValue*)(intptr_t)1), Data(Elt) {}
77 if (Leader->isLeader()) return Leader
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| EquivalenceClasses.h | 46 /// if (!I->isLeader()) continue; // Ignore non-leader sets.
65 /// "leader pointer" depending on whether the value itself is a leader. A
66 /// "leader pointer" points to the node that is the leader for this element,
67 /// if the node is not a leader. A "end of list pointer" points to the last
69 /// leader is determined by a bit stolen from one of the pointers.
73 mutable const ECValue *Leader, *Next;
79 : Leader(this), Next((ECValue*)(intptr_t)1), Data(Elt) {}
83 if (Leader->isLeader()) return Leader
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| VectorUtils.cpp | 356 Value *Leader = ECs.getOrInsertLeaderValue(Val);
373 DBits[Leader] |= V;
387 DBits[Leader] |= ~0ULL;
397 if (DBits[Leader] == ~0ULL)
402 ECs.unionSets(Leader, O);
|
| LoopAccessAnalysis.cpp | 679 Value *Leader = DepCands.getLeaderValue(Access).getPointer();
680 unsigned &LeaderId = DepSetId[Leader];
[all...] |
| /external/pdfium/xfa/fxfa/ |
| cxfa_textparser.cpp | 40 Leader,
|
| fxfa_basic.h | 563 Leader,
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| LiveDebugVariables.cpp | 113 UserValue *leader; ///< Equivalence class leader. member in class:__anon40514::UserValue
139 : variable(var), offset(o), dl(L), leader(this), next(0), locInts(alloc)
142 /// getLeader - Get the leader of this value's equivalence class.
144 UserValue *l = leader;
145 while (l != l->leader)
146 l = l->leader;
147 return leader = l;
169 End->leader = L1, End = End->next;
170 End->leader = L1
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveDebugVariables.cpp | 118 UserValue *leader; ///< Equivalence class leader. member in class:__anon30976::UserValue
146 dl(std::move(L)), leader(this), next(nullptr), locInts(alloc) {}
148 /// getLeader - Get the leader of this value's equivalence class.
150 UserValue *l = leader;
151 while (l != l->leader)
152 l = l->leader;
153 return leader = l;
177 End->leader = L1;
180 End->leader = L1
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| LiveDebugVariables.cpp | 156 UserValue *leader; ///< Equivalence class leader. member in class:__anon41941::UserValue
185 : Variable(var), Expression(expr), dl(std::move(L)), leader(this),
188 /// getLeader - Get the leader of this value's equivalence class.
190 UserValue *l = leader;
191 while (l != l->leader)
192 l = l->leader;
193 return leader = l;
218 End->leader = L1;
221 End->leader = L1
[all...] |
