| /external/clang/lib/Sema/ |
| D | ScopeInfo.cpp | 152 WeakUseVector &Uses = in recordUseOfWeak() local
154 Uses.push_back(WeakUseTy(Msg, Msg->getNumArgs() == 0)); in recordUseOfWeak()
179 FunctionScopeInfo::WeakObjectUseMap::iterator Uses; in markSafeWeakUse() local
184 Uses = WeakObjectUses.find(WeakObjectProfileTy(RefExpr)); in markSafeWeakUse()
191 Uses = WeakObjectUses.find(WeakObjectProfileTy(IvarE)); in markSafeWeakUse()
193 Uses = WeakObjectUses.find(WeakObjectProfileTy(DRE)); in markSafeWeakUse()
195 Uses = WeakObjectUses.end(); in markSafeWeakUse()
198 Uses = in markSafeWeakUse()
207 if (Uses == WeakObjectUses.end()) in markSafeWeakUse()
212 std::find(Uses->second.rbegin(), Uses->second.rend(), WeakUseTy(E, true)); in markSafeWeakUse()
[all …]
|
| /external/llvm/lib/Target/X86/ |
| D | X86InstrSVM.td | 28 let Uses = [EAX] in
32 let Uses = [EAX] in
35 let Uses = [RAX] in
40 let Uses = [EAX] in
43 let Uses = [RAX] in
48 let Uses = [EAX] in
51 let Uses = [RAX] in
56 let Uses = [EAX, ECX] in
59 let Uses = [RAX, ECX] in
|
| D | X86InstrSystem.td | 35 let Uses = [EFLAGS] in
80 let Defs = [AL], Uses = [DX] in
83 let Defs = [AX], Uses = [DX] in
86 let Defs = [EAX], Uses = [DX] in
100 let Uses = [DX, AL] in
103 let Uses = [DX, AX] in
106 let Uses = [DX, EAX] in
110 let Uses = [AL] in
113 let Uses = [AX] in
116 let Uses = [EAX] in
[all …]
|
| D | X86InstrControl.td | 71 let isBranch = 1, isTerminator = 1, Uses = [EFLAGS], SchedRW = [WriteJump] in {
106 let Uses = [CX] in
109 let Uses = [ECX] in
113 let Uses = [RCX] in
177 // before calls from potentially appearing dead. Uses for argument
179 let Uses = [ESP] in {
230 let Uses = [ESP] in {
258 // immediately before calls from potentially appearing dead. Uses for argument
260 let isCall = 1, Uses = [RSP], SchedRW = [WriteJump] in {
282 isCodeGenOnly = 1, Uses = [RSP], usesCustomInserter = 1,
|
| D | X86InstrCMovSetCC.td | 18 let Uses = [EFLAGS], Predicates = [HasCMov], Constraints = "$src1 = $dst",
40 let Uses = [EFLAGS], Predicates = [HasCMov], Constraints = "$src1 = $dst",
59 } // Uses = [EFLAGS], Predicates = [HasCMov], Constraints = "$src1 = $dst"
84 let Uses = [EFLAGS] in {
93 } // Uses = [EFLAGS]
|
| D | X86InstrArithmetic.td | 60 let Defs = [AL,EFLAGS,AX], Uses = [AL] in
68 let Defs = [AX,DX,EFLAGS], Uses = [AX], hasSideEffects = 0 in
73 let Defs = [EAX,EDX,EFLAGS], Uses = [EAX], hasSideEffects = 0 in
79 let Defs = [RAX,RDX,EFLAGS], Uses = [RAX], hasSideEffects = 0 in
85 let Defs = [AL,EFLAGS,AX], Uses = [AL] in
95 let Defs = [AX,DX,EFLAGS], Uses = [AX] in
100 let Defs = [EAX,EDX,EFLAGS], Uses = [EAX] in
105 let Defs = [RAX,RDX,EFLAGS], Uses = [RAX] in
112 let Defs = [AL,EFLAGS,AX], Uses = [AL] in
116 let Defs = [AX,DX,EFLAGS], Uses = [AX] in
[all …]
|
| D | X86InstrExtension.td | 15 let Defs = [AX], Uses = [AL] in
18 let Defs = [EAX], Uses = [AX] in
22 let Defs = [AX,DX], Uses = [AX] in
25 let Defs = [EAX,EDX], Uses = [EAX] in
30 let Defs = [RAX], Uses = [EAX] in
34 let Defs = [RAX,RDX], Uses = [RAX] in
|
| /external/llvm/lib/Target/ARM/ |
| D | Thumb2ITBlockPass.cpp | 47 SmallSet<unsigned, 4> &Uses);
58 SmallSet<unsigned, 4> &Uses, in TrackDefUses() argument
80 Uses.insert(*Subreg); in TrackDefUses()
109 SmallSet<unsigned, 4> &Uses) { in MoveCopyOutOfITBlock() argument
123 if (Uses.count(DstReg) || Defs.count(SrcReg)) in MoveCopyOutOfITBlock()
166 SmallSet<unsigned, 4> Uses; in InsertITInstructions() local
179 Uses.clear(); in InsertITInstructions()
180 TrackDefUses(MI, Defs, Uses, TRI); in InsertITInstructions()
221 MoveCopyOutOfITBlock(NMI, CC, OCC, Defs, Uses)) { in InsertITInstructions()
230 TrackDefUses(NMI, Defs, Uses, TRI); in InsertITInstructions()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopRerollPass.cpp | 432 UsesTy Uses; member
896 Uses[&I].resize(IL_End); in collectUsedInstructions()
911 Uses[I].set(0); in collectUsedInstructions()
926 Uses[I].set(Idx); in collectUsedInstructions()
933 Uses[I].set(IL_All); in collectUsedInstructions()
949 Uses[I].set(IL_All); in collectUsedInstructions()
1026 Uses[I].set(IL_All); in validate()
1031 for (auto &KV : Uses) { in validate()
1040 for (auto &KV : Uses) { in validate()
1057 auto BaseIt = nextInstr(0, Uses, Visited); in validate()
[all …]
|
| D | ConstantHoisting.cpp | 74 ConstantUseListType Uses; member
84 Uses.push_back(ConstantUser(Inst, Idx)); in addUser()
91 ConstantUseListType Uses; member
94 RebasedConstantInfo(ConstantUseListType &&Uses, Constant *Offset) in RebasedConstantInfo()
95 : Uses(std::move(Uses)), Offset(Offset) { } in RebasedConstantInfo()
246 for (auto const &U : RCI.Uses) in findConstantInsertionPoint()
381 NumUses += ConstCand->Uses.size(); in findAndMakeBaseConstant()
400 RebasedConstantInfo(std::move(ConstCand->Uses), Offset)); in findAndMakeBaseConstant()
556 for (auto const &U : RCI.Uses) in emitBaseConstants()
|
| D | LoopStrengthReduce.cpp | 1677 SmallVector<LSRUse, 16> Uses; member in __anonb19727160811::LSRInstance
2301 LSRUse &LU = Uses[LUIdx]; in getUse()
2308 size_t LUIdx = Uses.size(); in getUse()
2310 Uses.push_back(LSRUse(Kind, AccessTy)); in getUse()
2311 LSRUse &LU = Uses[LUIdx]; in getUse()
2325 if (&LU != &Uses.back()) in DeleteUse()
2326 std::swap(LU, Uses.back()); in DeleteUse()
2327 Uses.pop_back(); in DeleteUse()
2330 RegUses.SwapAndDropUse(LUIdx, Uses.size()); in DeleteUse()
2339 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) { in FindUseWithSimilarFormula()
[all …]
|
| /external/v8/src/compiler/ |
| D | generic-node.h | 76 class Uses {
83 explicit Uses(GenericNode* node) : node_(node) {} in Uses() function
89 Uses uses() { return Uses(this); } in uses()
171 friend class GenericNode<B, S>::Uses::iterator;
225 class GenericNode<B, S>::Uses::iterator {
227 iterator(const typename GenericNode<B, S>::Uses::iterator& other) // NOLINT in iterator()
255 friend class GenericNode<B, S>::Uses;
|
| D | generic-node-inl.h | 48 inline typename GenericNode<B, S>::Uses::iterator
49 GenericNode<B, S>::Uses::begin() { in begin()
50 return typename GenericNode<B, S>::Uses::iterator(this->node_); in begin()
54 inline typename GenericNode<B, S>::Uses::iterator
55 GenericNode<B, S>::Uses::end() { in end()
56 return typename GenericNode<B, S>::Uses::iterator(); in end()
|
| D | verifier.cc | 29 Node::Uses uses = def->uses(); in IsDefUseChainLinkPresent()
30 for (Node::Uses::iterator it = uses.begin(); it != uses.end(); ++it) { in IsDefUseChainLinkPresent()
121 Node::Uses uses = node->uses(); in Pre()
122 for (Node::Uses::iterator it = uses.begin(); it != uses.end(); ++it) { in Pre()
145 Node::Uses uses = node->uses(); in Pre()
147 for (Node::Uses::iterator it = uses.begin(); it != uses.end(); ++it) { in Pre()
|
| /external/llvm/test/CodeGen/X86/ |
| D | fp-stack-2results.ll | 28 ; Uses both values.
39 ; Uses both values, requires fxch
50 ; Uses ST(0), ST(1) is dead but must be popped.
58 ; Uses ST(1), ST(0) is dead and must be popped.
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 1552 ArrayRef<SlotIndex> Uses = SA->getUseSlots(); in tryInstructionSplit() local
1553 if (Uses.size() <= 1) in tryInstructionSplit()
1556 DEBUG(dbgs() << "Split around " << Uses.size() << " individual instrs.\n"); in tryInstructionSplit()
1565 for (unsigned i = 0; i != Uses.size(); ++i) { in tryInstructionSplit()
1566 if (const MachineInstr *MI = Indexes->getInstructionFromIndex(Uses[i])) in tryInstructionSplit()
1571 DEBUG(dbgs() << " skip:\t" << Uses[i] << '\t' << *MI); in tryInstructionSplit()
1575 SlotIndex SegStart = SE->enterIntvBefore(Uses[i]); in tryInstructionSplit()
1576 SlotIndex SegStop = SE->leaveIntvAfter(Uses[i]); in tryInstructionSplit()
1610 ArrayRef<SlotIndex> Uses = SA->getUseSlots(); in calcGapWeights() local
1611 const unsigned NumGaps = Uses.size()-1; in calcGapWeights()
[all …]
|
| D | RegisterPressure.cpp | 318 SmallVector<unsigned, 8> Uses; member in __anon281631940111::RegisterOperands
331 pushRegUnits(MO.getReg(), Uses); in collect()
419 for (unsigned i = 0, e = RegOpers.Uses.size(); i != e; ++i) in collectPDiff()
420 PDiff.addPressureChange(RegOpers.Uses[i], false, MRI); in collectPDiff()
526 for (unsigned i = 0, e = RegOpers.Uses.size(); i < e; ++i) { in recede()
527 unsigned Reg = RegOpers.Uses[i]; in recede()
581 for (unsigned i = 0, e = RegOpers.Uses.size(); i < e; ++i) { in advance()
582 unsigned Reg = RegOpers.Uses[i]; in advance()
733 if (!containsReg(RegOpers.Uses, Reg)) in bumpUpwardPressure()
738 for (unsigned i = 0, e = RegOpers.Uses.size(); i < e; ++i) { in bumpUpwardPressure()
[all …]
|
| /external/v8/test/cctest/compiler/ |
| D | test-node.cc | 96 Node::Uses::iterator i(n1->uses().begin()); in TEST()
111 Node::Uses::iterator i(n0->uses().begin()); in TEST()
138 Node::Uses::iterator i1(n0->uses().begin()); in TEST()
143 Node::Uses::iterator i2(n3->uses().begin()); in TEST()
166 Node::Uses::iterator i1(n1->uses().begin()); in TEST()
173 Node::Uses::iterator i2(n3->uses().begin()); in TEST()
198 Node::Uses::iterator i2(n1->uses().begin()); in TEST()
204 Node::Uses::iterator i3(n4->uses().begin()); in TEST()
209 Node::Uses::iterator i4(n1->uses().begin()); in TEST()
212 Node::Uses::iterator i5(n4->uses().begin()); in TEST()
[all …]
|
| /external/llvm/utils/TableGen/ |
| D | InstrInfoEmitter.cpp | 75 static void PrintDefList(const std::vector<Record*> &Uses, in PrintDefList() argument
78 for (unsigned i = 0, e = Uses.size(); i != e; ++i) in PrintDefList()
79 OS << getQualifiedName(Uses[i]) << ", "; in PrintDefList()
364 std::vector<Record*> Uses = Inst->getValueAsListOfDefs("Uses"); in run() local
365 if (!Uses.empty()) { in run()
366 unsigned &IL = EmittedLists[Uses]; in run()
367 if (!IL) PrintDefList(Uses, IL = ++ListNumber, OS); in run()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 307 SmallVector<ArgumentGraphNode*, 4> Uses; member
330 iterator begin() { return SyntheticRoot.Uses.begin(); } in begin()
331 iterator end() { return SyntheticRoot.Uses.end(); } in end()
337 SyntheticRoot.Uses.push_back(&Node); in operator []()
368 Uses.push_back(AI); in captured()
379 SmallVector<Argument*, 4> Uses; // Uses within our SCC. member
392 return N->Uses.begin(); in child_begin()
395 return N->Uses.end(); in child_end()
579 if (Tracker.Uses.empty()) { in AddArgumentAttrs()
589 for (SmallVectorImpl<Argument*>::iterator UI = Tracker.Uses.begin(), in AddArgumentAttrs()
[all …]
|
| /external/clang/test/Modules/ |
| D | module_file_info.m | 36 // CHECK: Uses compiler/target-specific predefines [-undef]: Yes
37 // CHECK: Uses detailed preprocessing record (for indexing): No
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonExpandCondsets.cpp | 157 bool canMoveOver(MachineInstr *MI, ReferenceMap &Defs, ReferenceMap &Uses);
620 SmallVector<unsigned,4> Uses; in removeInstrFromLiveness() local
627 Uses.push_back(R); in removeInstrFromLiveness()
631 for (unsigned i = 0, n = Uses.size(); i < n; ++i) { in removeInstrFromLiveness()
632 LiveInterval &LI = LIS->getInterval(Uses[i]); in removeInstrFromLiveness()
633 shrinkToUses(Uses[i], LI); in removeInstrFromLiveness()
816 ReferenceMap &Uses) { in canMoveOver() argument
833 if (Op.isDef() && isRefInMap(RR, Uses, Exec_Then)) in canMoveOver()
987 ReferenceMap Uses, Defs; in predicate() local
1025 ReferenceMap &Map = Op.isDef() ? Defs : Uses; in predicate()
[all …]
|
| /external/llvm/lib/Target/Mips/ |
| D | MipsDelaySlotFiller.cpp | 96 BitVector Defs, Uses; member in __anonfbd221780111::RegDefsUses
160 SmallPtrSet<ValueType, 4> Uses, Defs; member in __anonfbd221780111::MemDefsUses
296 : TRI(TRI), Defs(TRI.getNumRegs(), false), Uses(TRI.getNumRegs(), false) {} in RegDefsUses()
352 Uses.set(*LI); in addLiveOut()
367 Uses |= NewUses; in update()
377 return (isRegInSet(Defs, Reg) || isRegInSet(Uses, Reg)); in checkRegDefsUses()
461 return !Defs.insert(V).second || Uses.count(V) || SeenNoObjStore || in updateDefsUses()
464 Uses.insert(V); in updateDefsUses()
|
| /external/llvm/lib/IR/ |
| D | Metadata.cpp | 167 SmallVector<UseTy, 8> Uses(UseMap.begin(), UseMap.end()); in replaceAllUsesWith() local
168 std::sort(Uses.begin(), Uses.end(), [](const UseTy &L, const UseTy &R) { in replaceAllUsesWith()
171 for (const auto &Pair : Uses) { in replaceAllUsesWith()
220 SmallVector<UseTy, 8> Uses(UseMap.begin(), UseMap.end()); in resolveAllUses() local
221 std::sort(Uses.begin(), Uses.end(), [](const UseTy &L, const UseTy &R) { in resolveAllUses()
225 for (const auto &Pair : Uses) { in resolveAllUses()
479 auto Uses = Context.takeReplaceableUses(); in resolve() local
484 Uses->resolveAllUses(); in resolve()
|
| /external/deqp/doc/testspecs/GLES3/ |
| D | stress.occlusion_query.txt | 25 + Uses primitives drawn with GL_TRIANGLES
26 + Uses query target ANY_SAMPLES_PASSED
|