/third_party/json/include/nlohmann/detail/iterators/ |
H A D | iterator_traits.hpp | 21 template<typename It, typename = void> 24 template<typename It> 26 It, 27 void_t<typename It::difference_type, typename It::value_type, typename It::pointer, 28 typename It::reference, typename It::iterator_category >> 30 using difference_type = typename It::difference_type; 31 using value_type = typename It [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
H A D | R600OptimizeVectorRegisters.cpp | 168 for (DenseMap<unsigned, unsigned>::iterator It = ToMerge->RegToChan.begin(), in tryMergeVector() 169 E = ToMerge->RegToChan.end(); It != E; ++It) { in tryMergeVector() 171 Untouched->RegToChan.find((*It).first); in tryMergeVector() 174 ((*It).second, (*PosInUntouched).second)); in tryMergeVector() 180 ((*It).second, Untouched->UndefReg[CurrentUndexIdx++])); in tryMergeVector() 208 for (DenseMap<unsigned, unsigned>::iterator It = RSI->RegToChan.begin(), in RebuildVector() 209 E = RSI->RegToChan.end(); It != E; ++It) { in RebuildVector() 211 unsigned SubReg = (*It) in RebuildVector() [all...] |
H A D | AMDILCFGStructurizer.cpp | 211 int countActiveBlock(MBBVector::const_iterator It, 346 MBBInfoMap::const_iterator It = BlockInfoMap.find(MBB); in getSCCNum() local 347 if (It == BlockInfoMap.end()) in getSCCNum() 349 return (*It).second->SccNum; in getSCCNum() 354 LoopLandInfoMap::const_iterator It = LLInfoMap.find(LoopRep); in getLoopLandInfo() local 355 if (It == LLInfoMap.end()) in getLoopLandInfo() 357 return (*It).second; in getLoopLandInfo() 369 MBBInfoMap::const_iterator It = BlockInfoMap.find(MBB); in isRetiredBlock() local 370 if (It == BlockInfoMap.end()) in isRetiredBlock() 372 return (*It) in isRetiredBlock() 406 countActiveBlock(MBBVector::const_iterator It, MBBVector::const_iterator E) const countActiveBlock() argument 568 MachineBasicBlock::succ_iterator It = MBB->succ_begin(); getFalseBranch() local 610 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); getNormalBlockBranchInstr() local 634 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); getReturnInstr() local 688 MachineBasicBlock::iterator It = Pre; wrapup() local 775 SmallVectorImpl<MachineBasicBlock *>::const_iterator It = run() local [all...] |
H A D | GCNRegPressure.cpp | 378 for (auto &It : LiveRegs) { 379 const LiveInterval &LI = LIS.getInterval(It.first); 383 auto PrevMask = It.second; 384 It.second &= ~S.LaneMask; 385 CurPressure.inc(It.first, PrevMask, It.second, *MRI); 389 auto PrevMask = It.second; 390 It.second = LaneBitmask::getNone(); 391 CurPressure.inc(It.first, PrevMask, It [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/GSYM/ |
H A D | Range.cpp | 24 auto It = llvm::upper_bound(Ranges, Range); in insert() 25 auto It2 = It; in insert() 28 if (It != It2) { in insert() 30 It = Ranges.erase(It, It2); in insert() 32 if (It != Ranges.begin() && Range.Start < It[-1].End) in insert() 33 It[-1].End = std::max(It[-1].End, Range.End); in insert() 35 Ranges.insert(It, Rang in insert() 39 auto It = std::partition_point( contains() local [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
H A D | SwiftErrorValueTracking.cpp | 29 auto It = VRegDefMap.find(Key); in getOrCreateVReg() local 34 if (It == VRegDefMap.end()) { in getOrCreateVReg() 42 return It->second; in getOrCreateVReg() 53 auto It = VRegDefUses.find(Key); in getOrCreateVRegDefAt() local 54 if (It != VRegDefUses.end()) in getOrCreateVRegDefAt() 55 return It->second; in getOrCreateVRegDefAt() 68 auto It = VRegDefUses.find(Key); in getOrCreateVRegUseAt() local 69 if (It != VRegDefUses.end()) in getOrCreateVRegUseAt() 70 return It->second; in getOrCreateVRegUseAt() 129 // We will always generate a copy from the argument. It i in createEntriesInEntryBlock() [all...] |
H A D | MachineOutliner.cpp | 44 /// ultimately outlines them. It describes how the main data structure for this 45 /// pass, the suffix tree, is queried and purged for candidates. It also gives 92 // this is off by default. It should, however, be the default behaviour in 236 /// The root represents the empty string. It is maintained by the 543 // It's not an internal node, so it must be a leaf. If we have a in advance() 580 RepeatedSubstringIterator It(*this); in operator ++() 582 return It; in operator ++() 641 /// Maps \p *It to a legal integer. 646 /// \returns The integer that \p *It was mapped to. 648 MachineBasicBlock::iterator &It, boo in mapToLegalUnsigned() 1385 auto It = FunctionToInstrCount.find(Fname); emitInstrCountChangedRemark() local [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/ |
H A D | Graph.h | 213 auto It = NL.find(A); in begin() local 214 if (It == NL.end()) in begin() 216 return iterator(It->second.begin(), &M, A); in begin() 220 auto It = NL.find(A); in cbegin() local 221 if (It == NL.end()) in cbegin() 223 return const_iterator(It->second.begin(), &M, A); in cbegin() 229 auto It = NL.find(A); in end() local 230 if (It == NL.end()) in end() 232 return iterator(It->second.end(), &M, A); in end() 235 auto It in cend() local 399 auto It = Vertices.find(I); at() local 408 auto It = Vertices.find(I); at() local 418 auto It = Edges.find(I); at() local 427 auto It = Edges.find(I); at() local [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
H A D | PPCPreEmitPeephole.cpp | 62 // This function removes any redundant load immediates. It has two level 69 // kill/dead flag set. It keeps track of the def register of BBI, the use 134 // It loads same immediate value to the same Reg, which is redundant. in removeRedundantLIs() 244 MachineBasicBlock::reverse_iterator It = Br, Er = MBB.rend(); variable 245 for (It++; It != Er; It++) { 246 if (It->modifiesRegister(CRBit, TRI)) { 247 if ((It->getOpcode() == PPC::CRUNSET || 248 It 268 MachineBasicBlock::iterator It = Br, Er = MBB.end(); global() variable [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
H A D | LoopUnrollAndJam.cpp | 86 // Aft blocks that need to be moved before the subloop. It is used in two 282 // Maps Blocks[0] -> Blocks[It] in UnrollAndJamLoop() 314 for (unsigned It = 1; It != Count; ++It) { in UnrollAndJamLoop() 316 // Maps Blocks[It] -> Blocks[It-1] in UnrollAndJamLoop() 321 BasicBlock *New = CloneBasicBlock(*BB, VMap, "." + Twine(It)); in UnrollAndJamLoop() 350 PrevItValueMap[New] = (It == 1 ? *BB : LastValueMap[*BB]); in UnrollAndJamLoop() 355 const_cast<Value *>(It in UnrollAndJamLoop() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
H A D | CFG.h | 13 /// specific terminator instructions, etc. It also defines specializations of 47 USE_iterator It; 51 while (!It.atEnd()) { in advancePastNonTerminators() 52 if (auto *Inst = dyn_cast<Instruction>(*It)) in advancePastNonTerminators() 56 ++It; in advancePastNonTerminators() 65 explicit inline PredIterator(Ptr *bb) : It(bb->user_begin()) { in PredIterator() 68 inline PredIterator(Ptr *bb, bool) : It(bb->user_end()) {} in PredIterator() 70 inline bool operator==(const Self& x) const { return It == x.It; } in operator ==() 74 assert(!It in operator *() 158 Self It; global() member in llvm::SuccIterator::SuccessorProxy 161 SuccessorProxy(const Self &It) SuccessorProxy() argument [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/ObjCARC/ |
H A D | BlotMapVector.h | 80 typename MapTy::iterator It = Map.find(Key); in find() local 81 if (It == Map.end()) in find() 83 return Vector.begin() + It->second; in find() 87 typename MapTy::const_iterator It = Map.find(Key); in find() local 88 if (It == Map.end()) in find() 90 return Vector.begin() + It->second; in find() 97 typename MapTy::iterator It = Map.find(Key); in blot() local 98 if (It == Map.end()) in blot() 100 Vector[It->second].first = KeyT(); in blot() 101 Map.erase(It); in blot() [all...] |
/third_party/skia/third_party/externals/abseil-cpp/absl/algorithm/ |
H A D | algorithm.h | 77 template <typename It> 78 It RotateImpl(It first, It middle, It last, std::true_type) { in RotateImpl() 82 template <typename It> 83 It RotateImpl(It first, It middle, It las [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
H A D | PhiValues.cpp | 100 auto It = ReachableMap.find(OpDepthNumber); in processPhi() local 101 if (It != ReachableMap.end()) in processPhi() 102 Reachable.insert(It->second.begin(), It->second.end()); in processPhi() 153 auto It = TrackedValues.find_as(V); in invalidateValue() local 154 if (It != TrackedValues.end()) in invalidateValue() 155 TrackedValues.erase(It); in invalidateValue() 173 auto It = NonPhiReachableMap.find(N); in print() local 174 if (It == NonPhiReachableMap.end()) in print() 176 else if (It in print() [all...] |
H A D | InstructionPrecedenceTracking.cpp | 79 auto It = FirstSpecialInsts.find(BB); in validate() local 81 if (It == FirstSpecialInsts.end()) in validate() 86 assert(It->second == &Insn && in validate() 91 assert(It->second == nullptr && in validate() 98 for (auto &It : FirstSpecialInsts) in validateAll() 99 validate(It.first); in validateAll() 117 for (auto It : FirstSpecialInsts) in clear() 118 OI.invalidateBlock(It.first); in clear()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
H A D | HexagonFrameLowering.cpp | 569 // if the function makes a call. It is very similar to enableCalleeSaveSkip, 686 MachineBasicBlock::iterator It = RetI; in insertEpilogueInBlock() local 687 ++It; in insertEpilogueInBlock() 689 while (It != MBB.end()) { in insertEpilogueInBlock() 690 if (!It->isLabel()) in insertEpilogueInBlock() 691 It = MBB.erase(It); in insertEpilogueInBlock() 693 ++It; in insertEpilogueInBlock() 698 // It is possible that the restoring code is a call to a library function. in insertEpilogueInBlock() 850 MachineBasicBlock::iterator It in findCFILocation() local 1314 MachineBasicBlock::iterator It = MBB.getFirstTerminator(); insertCSRRestoresInBlock() local 1602 expandCopy(MachineBasicBlock &B, MachineBasicBlock::iterator It, MachineRegisterInfo &MRI, const HexagonInstrInfo &HII, SmallVectorImpl<unsigned> &NewRegs) const expandCopy() argument 1623 expandStoreInt(MachineBasicBlock &B, MachineBasicBlock::iterator It, MachineRegisterInfo &MRI, const HexagonInstrInfo &HII, SmallVectorImpl<unsigned> &NewRegs) const expandStoreInt() argument 1656 expandLoadInt(MachineBasicBlock &B, MachineBasicBlock::iterator It, MachineRegisterInfo &MRI, const HexagonInstrInfo &HII, SmallVectorImpl<unsigned> &NewRegs) const expandLoadInt() argument 1687 expandStoreVecPred(MachineBasicBlock &B, MachineBasicBlock::iterator It, MachineRegisterInfo &MRI, const HexagonInstrInfo &HII, SmallVectorImpl<unsigned> &NewRegs) const expandStoreVecPred() argument 1724 expandLoadVecPred(MachineBasicBlock &B, MachineBasicBlock::iterator It, MachineRegisterInfo &MRI, const HexagonInstrInfo &HII, SmallVectorImpl<unsigned> &NewRegs) const expandLoadVecPred() argument 1759 expandStoreVec2(MachineBasicBlock &B, MachineBasicBlock::iterator It, MachineRegisterInfo &MRI, const HexagonInstrInfo &HII, SmallVectorImpl<unsigned> &NewRegs) const expandStoreVec2() argument 1824 expandLoadVec2(MachineBasicBlock &B, MachineBasicBlock::iterator It, MachineRegisterInfo &MRI, const HexagonInstrInfo &HII, SmallVectorImpl<unsigned> &NewRegs) const expandLoadVec2() argument 1870 expandStoreVec(MachineBasicBlock &B, MachineBasicBlock::iterator It, MachineRegisterInfo &MRI, const HexagonInstrInfo &HII, SmallVectorImpl<unsigned> &NewRegs) const expandStoreVec() argument 1901 expandLoadVec(MachineBasicBlock &B, MachineBasicBlock::iterator It, MachineRegisterInfo &MRI, const HexagonInstrInfo &HII, SmallVectorImpl<unsigned> &NewRegs) const expandLoadVec() argument [all...] |
H A D | HexagonFrameLowering.h | 128 bool expandCopy(MachineBasicBlock &B, MachineBasicBlock::iterator It, 131 bool expandStoreInt(MachineBasicBlock &B, MachineBasicBlock::iterator It, 134 bool expandLoadInt(MachineBasicBlock &B, MachineBasicBlock::iterator It, 137 bool expandStoreVecPred(MachineBasicBlock &B, MachineBasicBlock::iterator It, 140 bool expandLoadVecPred(MachineBasicBlock &B, MachineBasicBlock::iterator It, 143 bool expandStoreVec2(MachineBasicBlock &B, MachineBasicBlock::iterator It, 146 bool expandLoadVec2(MachineBasicBlock &B, MachineBasicBlock::iterator It, 149 bool expandStoreVec(MachineBasicBlock &B, MachineBasicBlock::iterator It, 152 bool expandLoadVec(MachineBasicBlock &B, MachineBasicBlock::iterator It,
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/ |
H A D | ARMCallingConv.cpp | 232 for (SmallVectorImpl<CCValAssign>::iterator It = PendingMembers.begin(); in CC_ARM_AAPCS_Custom_Aggregate() 233 It != PendingMembers.end(); ++It) { in CC_ARM_AAPCS_Custom_Aggregate() 234 It->convertToReg(RegResult); in CC_ARM_AAPCS_Custom_Aggregate() 235 State.addLoc(*It); in CC_ARM_AAPCS_Custom_Aggregate() 248 for (auto &It : PendingMembers) { in CC_ARM_AAPCS_Custom_Aggregate() 250 It.convertToMem(State.AllocateStack(Size, Size)); in CC_ARM_AAPCS_Custom_Aggregate() 252 It.convertToReg(State.AllocateReg(RegList[RegIdx++])); in CC_ARM_AAPCS_Custom_Aggregate() 254 State.addLoc(It); in CC_ARM_AAPCS_Custom_Aggregate() 270 for (auto &It in CC_ARM_AAPCS_Custom_Aggregate() [all...] |
/third_party/spirv-tools/source/opt/ |
H A D | function.h | 191 template <class It> 192 void ReorderBasicBlocks(It begin, It end); 194 template <class It> 195 bool ContainsAllBlocksInTheFunction(It begin, It end); 278 template <class It> 279 void Function::ReorderBasicBlocks(It begin, It end) { in ReorderBasicBlocks() 293 template <class It> [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/ |
H A D | AArch64CallingConvention.cpp | 48 for (auto &It : PendingMembers) { in finishStackBlock() 49 It.convertToMem(State.AllocateStack( in finishStackBlock() 51 State.addLoc(It); in finishStackBlock() 122 for (auto &It : PendingMembers) { in CC_AArch64_Custom_Block() 123 It.convertToReg(RegResult); in CC_AArch64_Custom_Block() 124 State.addLoc(It); in CC_AArch64_Custom_Block() 133 for (auto &It : PendingMembers) { in CC_AArch64_Custom_Block() 135 State.addLoc(CCValAssign::getReg(It.getValNo(), MVT::i32, RegResult, in CC_AArch64_Custom_Block()
|
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/ |
H A D | IceLoopAnalyzer.cpp | 234 // Reaching here means a loop has been found! It consists of the nodes on the in processNode() 237 for (auto It = LoopStack.rbegin(); It != LoopStack.rend(); ++It) { in processNode() 238 (*It)->setOnStack(false); in processNode() 239 (*It)->incrementLoopNestDepth(); in processNode() 241 if (*It == &Node) { in processNode() 242 (*It)->setDeleted(); in processNode() 245 for (auto LoopIter = It.base() - 1; LoopIter != LoopStack.end(); in processNode() 250 LoopStack.erase(It in processNode() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
H A D | SetVector.h | 58 template<typename It> 59 SetVector(It Start, It End) { in SetVector() 149 template<typename It> 150 void insert(It Start, It End) { 303 template<typename It> 304 SmallSetVector(It Start, It End) {
|
/third_party/vixl/test/ |
H A D | test-api.cc | 198 typedef CPUFeatures::const_iterator It; in TEST() typedef 200 It it0; in TEST() 201 It it1_neon(&f1, CPUFeatures::kNEON); in TEST() 202 It it2_neon(&f2, CPUFeatures::kNEON); in TEST() 203 It it2_crc32(&f2, CPUFeatures::kCRC32); in TEST() 204 It it3(&f3); in TEST() 246 VIXL_STATIC_ASSERT(std::is_copy_constructible<It>::value); in TEST() 247 VIXL_STATIC_ASSERT(std::is_copy_assignable<It>::value); in TEST() 248 VIXL_STATIC_ASSERT(std::is_destructible<It>::value); in TEST() 251 It test in TEST() [all...] |
/third_party/json/tests/thirdparty/Fuzzer/ |
H A D | FuzzerUtilWindows.cpp | 173 for (const char *It = Cdata; It < End; ++It) in SearchMemory() 174 if (It[0] == Cpatt[0] && memcmp(It, Cpatt, PattLen) == 0) in SearchMemory() 175 return It; in SearchMemory()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/GlobalISel/ |
H A D | RegBankSelect.cpp | 268 // TODO: It may be possible to actually avoid the copy. in getRepairCost() 314 // It will trigger the failed isel mode. in findBestMapping() 702 // It's possible the mapping changed control flow, and moved the following in runOnMachineFunction() 751 MachineBasicBlock::iterator It = MI.getParent()->getFirstNonPHI(); in RepairingPlacement() local 752 if (It != MI.getParent()->end()) in RepairingPlacement() 753 addInsertPoint(*It, /*Before*/ true); in RepairingPlacement() 755 addInsertPoint(*(--It), /*Before*/ false); in RepairingPlacement() 763 MachineBasicBlock::iterator It = Pred.getLastNonDebugInstr(); in RepairingPlacement() local 764 for (auto Begin = Pred.begin(); It != Begin && It in RepairingPlacement() 786 MachineBasicBlock::reverse_iterator It = MI; RepairingPlacement() local [all...] |