| /external/llvm-project/openmp/libomptarget/src/ |
| D | MemoryManager.cpp | 98 for (auto Itr = PtrToNodeTable.begin(); Itr != PtrToNodeTable.end(); ++Itr) { in ~MemoryManagerTy() local
99 assert(Itr->second.Ptr && "nullptr in map table"); in ~MemoryManagerTy()
100 deleteOnDevice(Itr->second.Ptr); in ~MemoryManagerTy()
190 FreeListTy::const_iterator Itr = List.find(TempNode); in allocate() local
192 if (Itr != List.end()) { in allocate()
193 NodePtr = &Itr->get(); in allocate()
194 List.erase(Itr); in allocate()
216 auto Itr = PtrToNodeTable.emplace(TgtPtr, NodeTy(Size, TgtPtr)); in allocate() local
217 NodePtr = &Itr.first->second; in allocate()
237 auto Itr = PtrToNodeTable.find(TgtPtr); in free() local
[all …]
|
| D | omptarget.cpp | 578 for (ShadowPtrListTy::iterator Itr = Device.ShadowPtrMap.begin(); in targetDataEnd() local
579 Itr != Device.ShadowPtrMap.end();) { in targetDataEnd()
580 void **ShadowHstPtrAddr = (void **)Itr->first; in targetDataEnd()
585 ++Itr; in targetDataEnd()
595 DPxPTR(Itr->second.HstPtrVal), DPxPTR(ShadowHstPtrAddr)); in targetDataEnd()
596 *ShadowHstPtrAddr = Itr->second.HstPtrVal; in targetDataEnd()
601 Itr = Device.ShadowPtrMap.erase(Itr); in targetDataEnd()
603 ++Itr; in targetDataEnd()
843 for (HostEntriesBeginToTransTableTy::iterator Itr = in getTableMap() local
845 Itr != PM->HostEntriesBeginToTransTable.end(); ++Itr) { in getTableMap()
[all …]
|
| /external/llvm-project/llvm/tools/llvm-exegesis/lib/ |
| D | RegisterAliasing.cpp | 19 for (auto Itr = RegAliasItr(PhysReg, &RegInfo, true); Itr.isValid(); in getAliasedBits() local
20 ++Itr) { in getAliasedBits()
21 AliasedBits.set(*Itr); in getAliasedBits()
52 for (auto Itr = RegAliasItr(PhysReg, &RegInfo, true); Itr.isValid(); in FillOriginAndAliasedBits() local
53 ++Itr) { in FillOriginAndAliasedBits()
54 AliasedBits.set(*Itr); in FillOriginAndAliasedBits()
55 Origins[*Itr] = PhysReg; in FillOriginAndAliasedBits()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | CFLAndersAliasAnalysis.cpp | 186 auto Itr = ReachMap.find(V); in reachableValueAliases() local
187 if (Itr == ReachMap.end()) in reachableValueAliases()
190 return make_range<const_valuestate_iterator>(Itr->second.begin(), in reachableValueAliases()
191 Itr->second.end()); in reachableValueAliases()
218 auto Itr = MemMap.find(V); in getMemoryAliases() local
219 if (Itr == MemMap.end()) in getMemoryAliases()
221 return &Itr->second; in getMemoryAliases()
245 auto Itr = AttrMap.find(V); in getAttrs() local
246 if (Itr != AttrMap.end()) in getAttrs()
247 Attr = Itr->second; in getAttrs()
[all …]
|
| D | CFLGraph.h | 103 auto Itr = ValueImpls.find(N.Val); in getNode() local
104 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel) in getNode()
106 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel); in getNode()
137 auto Itr = ValueImpls.find(N.Val); in getNode() local
138 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel) in getNode()
140 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel); in getNode()
|
| D | CFLSteensAliasAnalysis.cpp | 140 auto Itr = InterfaceMap.find(SetIndex); in FunctionInfo() local
141 if (Itr != InterfaceMap.end()) { in FunctionInfo()
142 if (CurrValue != Itr->second) in FunctionInfo()
144 ExternalRelation{CurrValue, Itr->second, UnknownOffset}); in FunctionInfo()
|
| /external/llvm-project/llvm/lib/Analysis/ |
| D | CFLAndersAliasAnalysis.cpp | 186 auto Itr = ReachMap.find(V); in reachableValueAliases() local
187 if (Itr == ReachMap.end()) in reachableValueAliases()
190 return make_range<const_valuestate_iterator>(Itr->second.begin(), in reachableValueAliases()
191 Itr->second.end()); in reachableValueAliases()
218 auto Itr = MemMap.find(V); in getMemoryAliases() local
219 if (Itr == MemMap.end()) in getMemoryAliases()
221 return &Itr->second; in getMemoryAliases()
245 auto Itr = AttrMap.find(V); in getAttrs() local
246 if (Itr != AttrMap.end()) in getAttrs()
247 Attr = Itr->second; in getAttrs()
[all …]
|
| D | CFLGraph.h | 103 auto Itr = ValueImpls.find(N.Val); in getNode() local
104 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel) in getNode()
106 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel); in getNode()
137 auto Itr = ValueImpls.find(N.Val); in getNode() local
138 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel) in getNode()
140 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel); in getNode()
|
| D | CFLSteensAliasAnalysis.cpp | 140 auto Itr = InterfaceMap.find(SetIndex); in FunctionInfo() local
141 if (Itr != InterfaceMap.end()) { in FunctionInfo()
142 if (CurrValue != Itr->second) in FunctionInfo()
144 ExternalRelation{CurrValue, Itr->second, UnknownOffset}); in FunctionInfo()
|
| /external/llvm-project/llvm/lib/ExecutionEngine/Orc/ |
| D | SpeculateAnalyses.cpp | 154 auto Itr = VisitedBlocks.find(AtBB); in traverseToEntryBlock() local
155 if (Itr != VisitedBlocks.end()) { // already visited. in traverseToEntryBlock()
156 if (!Itr->second.Upward) in traverseToEntryBlock()
158 Itr->second.Upward = false; in traverseToEntryBlock()
197 auto Itr = VisitedBlocks.find(AtBB); in traverseToExitBlock() local
198 if (Itr != VisitedBlocks.end()) { // already visited. in traverseToExitBlock()
199 if (!Itr->second.Downward) in traverseToExitBlock()
201 Itr->second.Downward = false; in traverseToExitBlock()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/Orc/ |
| D | SpeculateAnalyses.cpp | 154 auto Itr = VisitedBlocks.find(AtBB); in traverseToEntryBlock() local
155 if (Itr != VisitedBlocks.end()) { // already visited. in traverseToEntryBlock()
156 if (!Itr->second.Upward) in traverseToEntryBlock()
158 Itr->second.Upward = false; in traverseToEntryBlock()
197 auto Itr = VisitedBlocks.find(AtBB); in traverseToExitBlock() local
198 if (Itr != VisitedBlocks.end()) { // already visited. in traverseToExitBlock()
199 if (!Itr->second.Downward) in traverseToExitBlock()
201 Itr->second.Downward = false; in traverseToExitBlock()
|
| /external/libchrome/base/ |
| D | rand_util.h | 67 template <typename Itr>
68 void RandomShuffle(Itr first, Itr last) { in RandomShuffle()
|
| /external/llvm/lib/Analysis/ |
| D | CFLGraph.h | 81 auto Itr = ValueImpls.find(N.Val); in getNode() local
82 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel) in getNode()
84 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel); in getNode()
87 auto Itr = ValueImpls.find(N.Val); in getNode() local
88 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel) in getNode()
90 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel); in getNode()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/ |
| D | AArch64RedundantCopyElimination.cpp | 306 MachineBasicBlock::iterator Itr = std::next(CondBr); in optimizeBlock() local
308 --Itr; in optimizeBlock()
310 if (!knownRegValInBlock(*Itr, MBB, KnownRegs, FirstUse)) in optimizeBlock()
319 for (auto PredI = Itr;; --PredI) { in optimizeBlock()
364 } while (Itr != PredMBB->begin() && Itr->isTerminator()); in optimizeBlock()
|
| /external/llvm-project/llvm/lib/Target/AArch64/ |
| D | AArch64RedundantCopyElimination.cpp | 306 MachineBasicBlock::iterator Itr = std::next(CondBr); in optimizeBlock() local
308 --Itr; in optimizeBlock()
310 if (!knownRegValInBlock(*Itr, MBB, KnownRegs, FirstUse)) in optimizeBlock()
319 for (auto PredI = Itr;; --PredI) { in optimizeBlock()
364 } while (Itr != PredMBB->begin() && Itr->isTerminator()); in optimizeBlock()
|
| /external/llvm-project/llvm/lib/MC/ |
| D | ConstantPools.cpp | 44 auto Itr = C ? CachedEntries.find(C->getValue()) : CachedEntries.end(); in addEntry() local
45 if (Itr != CachedEntries.end()) in addEntry()
46 return Itr->second; in addEntry()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/MC/ |
| D | ConstantPools.cpp | 44 auto Itr = C ? CachedEntries.find(C->getValue()) : CachedEntries.end(); in addEntry() local
45 if (Itr != CachedEntries.end()) in addEntry()
46 return Itr->second; in addEntry()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/AggressiveInstCombine/ |
| D | TruncInstCombine.cpp | 237 for (auto Itr : InstInfoMap) { in getBestTruncatedType() local
238 Instruction *I = Itr.first; in getBestTruncatedType()
301 for (auto &Itr : InstInfoMap) { // Forward in ReduceExpressionDag() local
302 Instruction *I = Itr.first; in ReduceExpressionDag()
303 TruncInstCombine::Info &NodeInfo = Itr.second; in ReduceExpressionDag()
|
| /external/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
| D | TruncInstCombine.cpp | 250 for (auto Itr : InstInfoMap) { in getBestTruncatedType() local
251 Instruction *I = Itr.first; in getBestTruncatedType()
316 for (auto &Itr : InstInfoMap) { // Forward in ReduceExpressionDag() local
317 Instruction *I = Itr.first; in ReduceExpressionDag()
318 TruncInstCombine::Info &NodeInfo = Itr.second; in ReduceExpressionDag()
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 639 iterator Itr = find(V); in clearList() local
640 if (Itr != end()) { in clearList()
641 assert(NumNodes >= Itr->second.size()); in clearList()
642 NumNodes -= Itr->second.size(); in clearList()
644 Itr->second.clear(); in clearList()
680 Value2SUsMap::iterator Itr = Val2SUsMap.find(V); in addChainDependencies() local
681 if (Itr != Val2SUsMap.end()) in addChainDependencies()
682 addChainDependencies(SU, Itr->second, in addChainDependencies()
1031 for (auto &Itr : *this) { in dump()
1032 if (Itr.first.is<const Value*>()) { in dump()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 635 iterator Itr = find(V); in clearList() local
636 if (Itr != end()) { in clearList()
637 assert(NumNodes >= Itr->second.size()); in clearList()
638 NumNodes -= Itr->second.size(); in clearList()
640 Itr->second.clear(); in clearList()
676 Value2SUsMap::iterator Itr = Val2SUsMap.find(V); in addChainDependencies() local
677 if (Itr != Val2SUsMap.end()) in addChainDependencies()
678 addChainDependencies(SU, Itr->second, in addChainDependencies()
1027 for (auto &Itr : *this) { in dump()
1028 if (Itr.first.is<const Value*>()) { in dump()
[all …]
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | AbstractMapBasedMultiset.java | 163 abstract class Itr<T> implements Iterator<T> { class in AbstractMapBasedMultiset
206 return new Itr<E>() { in elementIterator()
216 return new Itr<Entry<E>>() {
|
| D | EnumMultiset.java | 208 abstract class Itr<T> implements Iterator<T> { class in EnumMultiset
249 return new Itr<E>() { in elementIterator()
259 return new Itr<Entry<E>>() {
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 752 iterator Itr = find(V); in clearList() local
753 if (Itr != end()) { in clearList()
754 assert (NumNodes >= Itr->second.size()); in clearList()
755 NumNodes -= Itr->second.size(); in clearList()
757 Itr->second.clear(); in clearList()
793 Value2SUsMap::iterator Itr = Val2SUsMap.find(V); in addChainDependencies() local
794 if (Itr != Val2SUsMap.end()) in addChainDependencies()
795 addChainDependencies(SU, Itr->second, in addChainDependencies()
1125 for (auto &Itr : *this) { in dump()
1126 if (Itr.first.is<const Value*>()) { in dump()
[all …]
|
| /external/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
| D | MonitorBasedPriorityBlockingQueue.java | 486 return new Itr(toArray()); in iterator()
490 private class Itr implements Iterator<E> { class in MonitorBasedPriorityBlockingQueue
495 Itr(Object[] array) { in Itr() method in MonitorBasedPriorityBlockingQueue.Itr
|