| /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()
96 static void ClearKillFlags(MachineInstr *MI, SmallSet<unsigned, 4> &Uses) { in ClearKillFlags() argument
100 if (!Uses.count(MO.getReg())) in ClearKillFlags()
122 SmallSet<unsigned, 4> &Uses) { in MoveCopyOutOfITBlock() argument
136 if (Uses.count(DstReg) || Defs.count(SrcReg)) in MoveCopyOutOfITBlock()
179 SmallSet<unsigned, 4> Uses; in InsertITInstructions() local
192 Uses.clear(); in InsertITInstructions()
193 TrackDefUses(MI, Defs, Uses, TRI); in InsertITInstructions()
[all …]
|
| /external/clang/lib/Sema/ |
| D | ScopeInfo.cpp | 155 WeakUseVector &Uses = in recordUseOfWeak() local
157 Uses.push_back(WeakUseTy(Msg, Msg->getNumArgs() == 0)); in recordUseOfWeak()
182 FunctionScopeInfo::WeakObjectUseMap::iterator Uses; in markSafeWeakUse() local
187 Uses = WeakObjectUses.find(WeakObjectProfileTy(RefExpr)); in markSafeWeakUse()
194 Uses = WeakObjectUses.find(WeakObjectProfileTy(IvarE)); in markSafeWeakUse()
196 Uses = WeakObjectUses.find(WeakObjectProfileTy(DRE)); in markSafeWeakUse()
198 Uses = WeakObjectUses.end(); in markSafeWeakUse()
201 Uses = in markSafeWeakUse()
210 if (Uses == WeakObjectUses.end()) in markSafeWeakUse()
215 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
74 let Defs = [AL], Uses = [DX] in
77 let Defs = [AX], Uses = [DX] in
80 let Defs = [EAX], Uses = [DX] in
94 let Uses = [DX, AL] in
97 let Uses = [DX, AX] in
100 let Uses = [DX, EAX] in
104 let Uses = [AL] in
107 let Uses = [AX] in
110 let Uses = [EAX] in
[all …]
|
| 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 | X86InstrControl.td | 84 let isBranch = 1, isTerminator = 1, Uses = [EFLAGS], SchedRW = [WriteJump] in {
119 let Uses = [CX] in
123 let Uses = [ECX] in
127 let Uses = [RCX] in
192 // before calls from potentially appearing dead. Uses for argument
194 let Uses = [ESP] in {
245 let Uses = [ESP] in {
273 // immediately before calls from potentially appearing dead. Uses for argument
275 let isCall = 1, Uses = [RSP], SchedRW = [WriteJump] in {
297 isCodeGenOnly = 1, Uses = [RSP], usesCustomInserter = 1,
|
| 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/Hexagon/ |
| D | HexagonGenMux.cpp | 63 BitVector Defs, Uses; member
64 DefUseInfo() : Defs(), Uses() {} in DefUseInfo()
65 DefUseInfo(const BitVector &D, const BitVector &U) : Defs(D), Uses(U) {} in DefUseInfo()
88 BitVector &Uses) const;
119 BitVector &Uses) const { in getDefsUses()
128 expandReg(*R++, Uses); in getDefsUses()
135 BitVector &Set = Mo->isDef() ? Defs : Uses; in getDefsUses()
145 BitVector Defs(NR), Uses(NR); in buildMaps() local
151 Uses.reset(); in buildMaps()
152 getDefsUses(MI, Defs, Uses); in buildMaps()
[all …]
|
| D | HexagonIsetDx.td | 32 let Defs = [PC], Uses = [P0, R31], isCodeGenOnly = 1, isPredicated = 1, isPredicatedFalse = 1, isBr…
42 let Defs = [R31, R29, R30], Uses = [R30], isCodeGenOnly = 1, mayLoad = 1, accessSize = DoubleWordAc…
53 let Defs = [PC, R31, R29, R30], Uses = [R30, P0], isCodeGenOnly = 1, isPredicated = 1, isPredicated…
93 let Uses = [P0], isCodeGenOnly = 1, isPredicated = 1, isPredicatedNew = 1, hasSideEffects = 0, hasN…
122 let Defs = [PC], Uses = [P0, R31], isCodeGenOnly = 1, isPredicated = 1, isPredicatedNew = 1, isBran…
211 let Defs = [PC, R31, R29, R30], Uses = [R30, P0], isCodeGenOnly = 1, isPredicated = 1, mayLoad = 1,…
221 let Defs = [R29, R30], Uses = [R30, R31, R29], isCodeGenOnly = 1, mayStore = 1, accessSize = Double…
277 let Defs = [PC], Uses = [R31], isCodeGenOnly = 1, isBranch = 1, isIndirectBranch = 1, hasSideEffect…
409 let Uses = [P0], isCodeGenOnly = 1, isPredicated = 1, isPredicatedFalse = 1, hasSideEffects = 0, ha…
452 let Uses = [R29], isCodeGenOnly = 1, mayLoad = 1, accessSize = DoubleWordAccess in
[all …]
|
| D | HexagonCommonGEP.cpp | 134 NodeToUsesMap Uses; member in __anon71ab34300111::HexagonCommonGEP
380 Uses[PN].insert(Us.begin(), Us.end()); in processGepInst()
589 UseSet &MinUs = Uses[Min]; in common()
596 MinUs.insert(Uses[N].begin(), Uses[N].end()); in common()
600 Uses.erase(Min); in common()
754 NodeToUsesMap::iterator UF = Uses.find(Node); in recalculatePlacement()
755 assert(UF != Uses.end() && "Used node with no use information"); in recalculatePlacement()
970 NodeToUsesMap::iterator UF = Uses.find(Node); in separateChainForNode()
971 assert(UF != Uses.end()); in separateChainForNode()
985 Uses.erase(UF); in separateChainForNode()
[all …]
|
| D | HexagonExpandCondsets.cpp | 166 bool canMoveOver(MachineInstr *MI, ReferenceMap &Defs, ReferenceMap &Uses);
629 SmallVector<unsigned,4> Uses; in removeInstrFromLiveness() local
636 Uses.push_back(R); in removeInstrFromLiveness()
640 for (unsigned i = 0, n = Uses.size(); i < n; ++i) { in removeInstrFromLiveness()
641 LiveInterval &LI = LIS->getInterval(Uses[i]); in removeInstrFromLiveness()
642 shrinkToUses(Uses[i], LI); in removeInstrFromLiveness()
825 ReferenceMap &Uses) { in canMoveOver() argument
842 if (Op.isDef() && isRefInMap(RR, Uses, Exec_Then)) in canMoveOver()
996 ReferenceMap Uses, Defs; in predicate() local
1034 ReferenceMap &Map = Op.isDef() ? Defs : Uses; in predicate()
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopRerollPass.cpp | 426 UsesTy Uses; member
882 Uses[&I].resize(IL_End); in collectUsedInstructions()
897 Uses[I].set(0); in collectUsedInstructions()
912 Uses[I].set(Idx); in collectUsedInstructions()
919 Uses[I].set(IL_All); in collectUsedInstructions()
935 Uses[I].set(IL_All); in collectUsedInstructions()
1031 Uses[I].set(IL_All); in validate()
1036 for (auto &KV : Uses) { in validate()
1045 for (auto &KV : Uses) { in validate()
1062 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 | 1666 SmallVector<LSRUse, 16> Uses; member in __anonb19727160811::LSRInstance
2286 LSRUse &LU = Uses[LUIdx]; in getUse()
2293 size_t LUIdx = Uses.size(); in getUse()
2295 Uses.push_back(LSRUse(Kind, AccessTy)); in getUse()
2296 LSRUse &LU = Uses[LUIdx]; in getUse()
2310 if (&LU != &Uses.back()) in DeleteUse()
2311 std::swap(LU, Uses.back()); in DeleteUse()
2312 Uses.pop_back(); in DeleteUse()
2315 RegUses.swapAndDropUse(LUIdx, Uses.size()); in DeleteUse()
2324 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) { in FindUseWithSimilarFormula()
[all …]
|
| /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/curl/docs/ |
| D | LICENSE-MIXING | 23 Uses an MIT (or Modified BSD)-style license that is as liberal as
28 (May be used for SSL/TLS support) Uses an Original BSD-style license
37 (May be used for SSL/TLS support) Uses the LGPL[3] license. If this is
44 (May be used for SSL/TLS support) Uses the GPL[1] license or a
58 (May be used for SSL/TLS support) Uses a Modified BSD-style license.
62 (May be used for SSL/TLS support) Uses the GPL[1] license or a
78 (Used for asynchronous name resolves) Uses an MIT license that is very
84 (Used for compressed Transfer-Encoding support) Uses an MIT-style
105 (Used for IDNA support) Uses the GNU Lesser General Public
115 (Used for LDAP support) Uses a Modified BSD-style license. Since
|
| /external/v8/src/compiler/ |
| D | node.h | 164 class Uses final {
174 explicit Uses(Node* node) : node_(node) {} in Uses() function
180 Uses uses() { return Uses(this); } in uses()
519 class Node::Uses::const_iterator final {
544 friend class Node::Uses;
553 Node::Uses::const_iterator Node::Uses::begin() const { in begin()
558 Node::Uses::const_iterator Node::Uses::end() const { return const_iterator(); } in end()
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 1583 ArrayRef<SlotIndex> Uses = SA->getUseSlots(); in tryInstructionSplit() local
1584 if (Uses.size() <= 1) in tryInstructionSplit()
1587 DEBUG(dbgs() << "Split around " << Uses.size() << " individual instrs.\n"); in tryInstructionSplit()
1596 for (unsigned i = 0; i != Uses.size(); ++i) { in tryInstructionSplit()
1597 if (const MachineInstr *MI = Indexes->getInstructionFromIndex(Uses[i])) in tryInstructionSplit()
1602 DEBUG(dbgs() << " skip:\t" << Uses[i] << '\t' << *MI); in tryInstructionSplit()
1606 SlotIndex SegStart = SE->enterIntvBefore(Uses[i]); in tryInstructionSplit()
1607 SlotIndex SegStop = SE->leaveIntvAfter(Uses[i]); in tryInstructionSplit()
1641 ArrayRef<SlotIndex> Uses = SA->getUseSlots(); in calcGapWeights() local
1642 const unsigned NumGaps = Uses.size()-1; in calcGapWeights()
[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()
363 std::vector<Record*> Uses = Inst->getValueAsListOfDefs("Uses"); in run() local
364 if (!Uses.empty()) { in run()
365 unsigned &IL = EmittedLists[Uses]; in run()
366 if (!IL) PrintDefList(Uses, IL = ++ListNumber, OS); in run()
|
| /external/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyInstrCall.td | 21 let Uses = [SP32, SP64], Defs = [SP32, SP64], isCodeGenOnly = 1 in {
36 let Uses = [SP32, SP64], isCall = 1 in {
48 } // Uses = [SP32,SP64], isCall = 1
|
| /external/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 281 SmallVector<ArgumentGraphNode *, 4> Uses; member
304 iterator begin() { return SyntheticRoot.Uses.begin(); } in begin()
305 iterator end() { return SyntheticRoot.Uses.end(); } in end()
311 SyntheticRoot.Uses.push_back(&Node); in operator []()
367 Uses.push_back(&*std::next(F->arg_begin(), UseIndex)); in captured()
372 SmallVector<Argument *, 4> Uses; // Uses within our SCC. member
385 return N->Uses.begin(); in child_begin()
388 return N->Uses.end(); in child_end()
568 if (Tracker.Uses.empty()) { in addArgumentAttrs()
580 UI = Tracker.Uses.begin(), in addArgumentAttrs()
[all …]
|
| /external/clang/test/Modules/ |
| D | module_file_info.m | 38 // CHECK: Uses compiler/target-specific predefines [-undef]: Yes
39 // CHECK: Uses detailed preprocessing record (for indexing): No
|
| /external/llvm/lib/Target/AMDGPU/ |
| D | SIInstrFormats.td | 92 let Uses = [EXEC] in {
149 } // End Uses = [EXEC]
592 let Uses = [EXEC] in {
615 } // End Uses = [EXEC]
627 let Uses = [M0, EXEC];
644 let Uses = [EXEC];
658 let Uses = [EXEC];
674 let Uses = [EXEC, FLAT_SCR]; // M0
688 let Uses = [EXEC];
|
| /external/deqp/doc/testspecs/GLES3/ |
| D | stress.occlusion_query.txt | 25 + Uses primitives drawn with GL_TRIANGLES
26 + Uses query target ANY_SAMPLES_PASSED
|