| /external/llvm/lib/Target/ARM/ |
| D | Thumb2ITBlockPass.cpp | 52 SmallSet<unsigned, 4> &Uses);
63 SmallSet<unsigned, 4> &Uses, in TrackDefUses() argument
85 Uses.insert(*Subreg); in TrackDefUses()
101 static void ClearKillFlags(MachineInstr *MI, SmallSet<unsigned, 4> &Uses) { in ClearKillFlags() argument
105 if (!Uses.count(MO.getReg())) in ClearKillFlags()
127 SmallSet<unsigned, 4> &Uses) { in MoveCopyOutOfITBlock() argument
141 if (Uses.count(DstReg) || Defs.count(SrcReg)) in MoveCopyOutOfITBlock()
184 SmallSet<unsigned, 4> Uses; in InsertITInstructions() local
197 Uses.clear(); in InsertITInstructions()
198 TrackDefUses(MI, Defs, Uses, TRI); in InsertITInstructions()
[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]
|
| /external/clang/lib/Sema/ |
| D | ScopeInfo.cpp | 158 WeakUseVector &Uses = in recordUseOfWeak() local
160 Uses.push_back(WeakUseTy(Msg, Msg->getNumArgs() == 0)); in recordUseOfWeak()
185 FunctionScopeInfo::WeakObjectUseMap::iterator Uses; in markSafeWeakUse() local
190 Uses = WeakObjectUses.find(WeakObjectProfileTy(RefExpr)); in markSafeWeakUse()
197 Uses = WeakObjectUses.find(WeakObjectProfileTy(IvarE)); in markSafeWeakUse()
199 Uses = WeakObjectUses.find(WeakObjectProfileTy(DRE)); in markSafeWeakUse()
201 Uses = WeakObjectUses.end(); in markSafeWeakUse()
204 Uses = in markSafeWeakUse()
213 if (Uses == WeakObjectUses.end()) in markSafeWeakUse()
218 llvm::find(llvm::reverse(Uses->second), WeakUseTy(E, true)); in markSafeWeakUse()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Target/ARM/ |
| D | Thumb2ITBlockPass.cpp | 46 SmallSet<unsigned, 4> &Uses);
57 SmallSet<unsigned, 4> &Uses, in TrackDefUses() argument
77 Uses.insert(Reg); in TrackDefUses()
80 Uses.insert(*Subreg); in TrackDefUses()
110 SmallSet<unsigned, 4> &Uses) { in MoveCopyOutOfITBlock() argument
124 if (Uses.count(DstReg) || Defs.count(SrcReg)) in MoveCopyOutOfITBlock()
167 SmallSet<unsigned, 4> Uses; in InsertITInstructions() local
180 Uses.clear(); in InsertITInstructions()
181 TrackDefUses(MI, Defs, Uses, TRI); in InsertITInstructions()
218 MoveCopyOutOfITBlock(NMI, CC, OCC, Defs, Uses)) { in InsertITInstructions()
[all …]
|
| /external/llvm/include/llvm/Transforms/Scalar/ |
| D | ConstantHoisting.h | 62 ConstantUseListType Uses; member
72 Uses.push_back(ConstantUser(Inst, Idx)); in addUser()
79 ConstantUseListType Uses; member
82 RebasedConstantInfo(ConstantUseListType &&Uses, Constant *Offset) in RebasedConstantInfo()
83 : Uses(std::move(Uses)), Offset(Offset) { } in RebasedConstantInfo()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonGenMux.cpp | 67 BitVector Defs, Uses; member
68 DefUseInfo() : Defs(), Uses() {} in DefUseInfo()
69 DefUseInfo(const BitVector &D, const BitVector &U) : Defs(D), Uses(U) {} in DefUseInfo()
92 BitVector &Uses) const;
123 BitVector &Uses) const { in getDefsUses()
132 expandReg(*R++, Uses); in getDefsUses()
139 BitVector &Set = Mo->isDef() ? Defs : Uses; in getDefsUses()
149 BitVector Defs(NR), Uses(NR); in buildMaps() local
155 Uses.reset(); in buildMaps()
156 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 __anond9f0c40d0111::HexagonCommonGEP
379 Uses[PN].insert(Us.begin(), Us.end()); in processGepInst()
588 UseSet &MinUs = Uses[Min]; in common()
595 MinUs.insert(Uses[N].begin(), Uses[N].end()); in common()
599 Uses.erase(Min); in common()
753 NodeToUsesMap::iterator UF = Uses.find(Node); in recalculatePlacement()
754 assert(UF != Uses.end() && "Used node with no use information"); in recalculatePlacement()
969 NodeToUsesMap::iterator UF = Uses.find(Node); in separateChainForNode()
970 assert(UF != Uses.end()); in separateChainForNode()
984 Uses.erase(UF); in separateChainForNode()
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopRerollPass.cpp | 427 UsesTy Uses; member
1007 Uses[&I].resize(IL_End); in collectUsedInstructions()
1022 Uses[I].set(0); in collectUsedInstructions()
1037 Uses[I].set(Idx); in collectUsedInstructions()
1044 Uses[I].set(IL_All); in collectUsedInstructions()
1060 Uses[I].set(IL_All); in collectUsedInstructions()
1156 Uses[I].set(IL_All); in validate()
1166 Uses[IVUser].set(IL_All); in validate()
1170 Uses[UUser].set(IL_All); in validate()
1174 Uses[UUser].set(IL_All); in validate()
[all …]
|
| /external/curl/docs/ |
| D | LICENSE-MIXING.md | 26 Uses an [MIT style license](https://curl.haxx.se/docs/copyright.html) that is
31 (May be used for SSL/TLS support) Uses an Original BSD-style license with an
40 (May be used for SSL/TLS support) Uses the
48 (May be used for SSL/TLS support) Uses the GPL license or a proprietary
62 (May be used for SSL/TLS support) Uses a Modified BSD-style license.
66 (May be used for SSL/TLS support) Uses the [Apache 2.0
84 (Used for asynchronous name resolves) Uses an MIT license that is very
90 (Used for compressed Transfer-Encoding support) Uses an MIT-style license
111 (Used for IDNA support) Uses the GNU Lesser General Public License [3]. LGPL
121 (Used for LDAP support) Uses a Modified BSD-style license. Since libcurl uses
|
| /external/swiftshader/third_party/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/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 | 1593 ArrayRef<SlotIndex> Uses = SA->getUseSlots(); in tryInstructionSplit() local
1594 if (Uses.size() <= 1) in tryInstructionSplit()
1597 DEBUG(dbgs() << "Split around " << Uses.size() << " individual instrs.\n"); in tryInstructionSplit()
1606 for (unsigned i = 0; i != Uses.size(); ++i) { in tryInstructionSplit()
1607 if (const MachineInstr *MI = Indexes->getInstructionFromIndex(Uses[i])) in tryInstructionSplit()
1612 DEBUG(dbgs() << " skip:\t" << Uses[i] << '\t' << *MI); in tryInstructionSplit()
1616 SlotIndex SegStart = SE->enterIntvBefore(Uses[i]); in tryInstructionSplit()
1617 SlotIndex SegStop = SE->leaveIntvAfter(Uses[i]); in tryInstructionSplit()
1651 ArrayRef<SlotIndex> Uses = SA->getUseSlots(); in calcGapWeights() local
1652 const unsigned NumGaps = Uses.size()-1; in calcGapWeights()
[all …]
|
| /external/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 236 SmallVector<ArgumentGraphNode *, 4> Uses; member
259 iterator begin() { return SyntheticRoot.Uses.begin(); } in begin()
260 iterator end() { return SyntheticRoot.Uses.end(); } in end()
266 SyntheticRoot.Uses.push_back(&Node); in operator []()
321 Uses.push_back(&*std::next(F->arg_begin(), UseIndex)); in captured()
326 SmallVector<Argument *, 4> Uses; // Uses within our SCC. member
339 return N->Uses.begin(); in child_begin()
342 return N->Uses.end(); in child_end()
528 if (Tracker.Uses.empty()) { in addArgumentAttrs()
539 for (Argument *Use : Tracker.Uses) { in addArgumentAttrs()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Target/X86/ |
| D | X86InstrControl.td | 51 let isBranch = 1, isTerminator = 1, Uses = [EFLAGS] in {
81 let Uses = [CX] in
84 let Uses = [ECX] in
91 let Uses = [ECX] in
94 let Uses = [RCX] in
139 // before calls from potentially appearing dead. Uses for argument
145 Uses = [ESP] in {
184 Uses = [ESP] in {
213 // before calls from potentially appearing dead. Uses for argument
220 Uses = [RSP] in {
[all …]
|
| D | X86InstrCMovSetCC.td | 18 let Uses = [EFLAGS], Predicates = [HasCMov], Constraints = "$src1 = $dst",
37 let Uses = [EFLAGS], Predicates = [HasCMov], Constraints = "$src1 = $dst" in {
53 } // Uses = [EFLAGS], Predicates = [HasCMov], Constraints = "$src1 = $dst"
78 let Uses = [EFLAGS] in {
85 } // Uses = [EFLAGS]
|
| D | X86InstrSystem.td | 33 let Uses = [EFLAGS] in
68 let Defs = [AL], Uses = [DX] in
71 let Defs = [AX], Uses = [DX] in
74 let Defs = [EAX], Uses = [DX] in
88 let Uses = [DX, AL] in
91 let Uses = [DX, AX] in
94 let Uses = [DX, EAX] in
98 let Uses = [AL] in
101 let Uses = [AX] in
104 let Uses = [EAX] in
[all …]
|
| /external/v8/src/compiler/ |
| D | node.h | 136 class V8_EXPORT_PRIVATE Uses final {
146 explicit Uses(Node* node) : node_(node) {} in Uses() function
152 Uses uses() { return Uses(this); } in uses()
588 class Node::Uses::const_iterator final {
613 friend class Node::Uses;
622 Node::Uses::const_iterator Node::Uses::begin() const { in begin()
627 Node::Uses::const_iterator Node::Uses::end() const { return const_iterator(); } in end()
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | PeepholeOptimizer.cpp | 156 SmallVector<MachineOperand*, 8> Uses; in OptimizeExtInstr() local
199 Uses.push_back(&UseMO); in OptimizeExtInstr()
203 Uses.push_back(&UseMO); in OptimizeExtInstr()
219 std::back_inserter(Uses)); in OptimizeExtInstr()
223 if (!Uses.empty()) { in OptimizeExtInstr()
236 for (unsigned i = 0, e = Uses.size(); i != e; ++i) { in OptimizeExtInstr()
237 MachineOperand *UseMO = Uses[i]; in OptimizeExtInstr()
|
| D | RegAllocGreedy.cpp | 1271 const SmallVectorImpl<SlotIndex> &Uses = SA->UseSlots; in calcGapWeights() local
1272 const unsigned NumGaps = Uses.size()-1; in calcGapWeights()
1298 while (Uses[Gap+1].getBoundaryIndex() < IntI.start()) in calcGapWeights()
1308 if (Uses[Gap+1].getBaseIndex() >= IntI.stop()) in calcGapWeights()
1332 const SmallVectorImpl<SlotIndex> &Uses = SA->UseSlots; in tryLocalSplit() local
1333 if (Uses.size() <= 2) in tryLocalSplit()
1335 const unsigned NumGaps = Uses.size()-1; in tryLocalSplit()
1339 for (unsigned i = 0, e = Uses.size(); i != e; ++i) in tryLocalSplit()
1394 << Uses[SplitBefore] << '-' << Uses[SplitAfter] in tryLocalSplit()
1418 Uses[SplitBefore].distance(Uses[SplitAfter]) + in tryLocalSplit()
[all …]
|
| D | StackSlotColoring.cpp | 501 SmallVector<MachineOperand*, 4> Uses; in PropagateBackward() local
506 Uses.clear(); in PropagateBackward()
529 Uses.push_back(&MO); in PropagateBackward()
551 for (unsigned i = 0, e = Uses.size(); i != e; ++i) in PropagateBackward()
552 Refs.push_back(Uses[i]); in PropagateBackward()
566 SmallVector<MachineOperand*, 4> Uses; in PropagateForward() local
592 Uses.push_back(&MO); in PropagateForward()
598 for (unsigned i = 0, e = Uses.size(); i != e; ++i) in PropagateForward()
599 Uses[i]->setReg(NewReg); in PropagateForward()
|
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| D | InstrInfoEmitter.cpp | 22 static void PrintDefList(const std::vector<Record*> &Uses, in PrintDefList() argument
25 for (unsigned i = 0, e = Uses.size(); i != e; ++i) in PrintDefList()
26 OS << getQualifiedName(Uses[i]) << ", "; in PrintDefList()
187 std::vector<Record*> Uses = Inst->getValueAsListOfDefs("Uses"); in run() local
188 if (!Uses.empty()) { in run()
189 unsigned &IL = EmittedLists[Uses]; in run()
190 if (!IL) PrintDefList(Uses, IL = ++ListNumber, OS); in run()
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| D | LoopStrengthReduce.cpp | 1357 SmallVector<LSRUse, 16> Uses; member in __anon74d4b93f0711::LSRInstance
1956 LSRUse &LU = Uses[LUIdx]; in getUse()
1963 size_t LUIdx = Uses.size(); in getUse()
1965 Uses.push_back(LSRUse(Kind, AccessTy)); in getUse()
1966 LSRUse &LU = Uses[LUIdx]; in getUse()
1980 if (&LU != &Uses.back()) in DeleteUse()
1981 std::swap(LU, Uses.back()); in DeleteUse()
1982 Uses.pop_back(); in DeleteUse()
1985 RegUses.SwapAndDropUse(LUIdx, Uses.size()); in DeleteUse()
1994 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) { in FindUseWithSimilarFormula()
[all …]
|