/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
H A D | lu_map_.hpp | 39 // purpose. It is provided "as is" without express or implied 207 template<typename It> 208 PB_DS_CLASS_NAME(It first_it, It last_it); 287 template<typename It> 289 copy_from_range(It, It);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | ComparisonCategories.cpp | 73 auto It = llvm::find_if( local 75 if (It != Objects.end()) 76 return &(*It); 112 auto It = Data.find(static_cast<char>(Kind)); local 113 if (It != Data.end()) 114 return &It->second;
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | release.h | 45 // accessors check the validity of the arguments, It is assumed that Index is 202 for (const auto &It : FreeList) { 203 for (u32 I = 0; I < It.getCount(); I++) { 204 const uptr P = reinterpret_cast<uptr>(It.get(I)); 211 for (const auto &It : FreeList) { 212 for (u32 I = 0; I < It.getCount(); I++) { 213 const uptr P = reinterpret_cast<uptr>(It.get(I));
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | CFGMST.h | 41 // Store all the edges in CFG. It may contain some stale edges 82 auto It = BBInfos.find(BB); local 83 assert(It->second.get() != nullptr); 84 return *It->second.get(); 89 auto It = BBInfos.find(BB); local 90 if (It == BBInfos.end()) 92 return It->second.get();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
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 580 RepeatedSubstringIterator It(*this); 582 return It; 641 /// Maps \p *It to a legal integer. 646 /// \returns The integer that \p *It was mapped to. 648 MachineBasicBlock::iterator &It, boo 647 mapToLegalUnsigned( MachineBasicBlock::iterator &It, bool &CanOutlineWithPrevInstr, bool &HaveLegalRange, unsigned &NumLegalInBlock, std::vector<unsigned> &UnsignedVecForMBB, std::vector<MachineBasicBlock::iterator> &InstrListForMBB) argument 700 mapToIllegalUnsigned( MachineBasicBlock::iterator &It, bool &CanOutlineWithPrevInstr, std::vector<unsigned> &UnsignedVecForMBB, std::vector<MachineBasicBlock::iterator> &InstrListForMBB) argument 1385 auto It = FunctionToInstrCount.find(Fname); local [all...] |
H A D | SafeStackColoring.cpp | 148 auto It = BlockMarkerSet.find(&I); local 149 if (It == BlockMarkerSet.end()) 151 ProcessMarker(&I, It->getSecond()); 226 for (auto &It : BBMarkers[BB]) { 227 unsigned InstNo = It.first; 228 bool IsStart = It.second.IsStart; 229 unsigned AllocaNo = It.second.AllocaNo;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/XRay/ |
H A D | Profile.cpp | 132 auto It = PathIDMap.find(P); local 133 if (It == PathIDMap.end()) 138 for (auto Node = It->second; Node; Node = Node->Caller) 150 auto It = RootToLeafPath.begin(); local 151 auto PathRoot = *It++; 167 while (It != RootToLeafPath.end()) { 168 auto NodeFuncID = *It++; 203 ThreadProfileIndexMap::iterator It; local 204 std::tie(It, std::ignore) = ThreadProfileIndex.insert( 213 std::tie(PathDataIt, Inserted) = It [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Serialization/ |
H A D | MultiOnDiskHashTable.h | 241 auto It = M->Data.find(Key); local 242 if (It != M->Data.end()) 243 Result = It->second; 250 auto It = HT.find_hashed(Key, KeyHash); local 251 if (It != HT.end()) 252 HT.getInfoObj().ReadDataInto(Key, It.getDataPtr(), It.getDataLen(),
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | CFGDiff.h | 121 auto It = DeleteChildren.find(BB); local 122 if (It == DeleteChildren.end()) 124 auto &EdgesForBB = It->second; 132 auto It = InsertChildren.find(BB); local 133 if (It == InsertChildren.end()) 135 return make_range(It->second.begin(), It->second.end());
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | RegBankSelect.cpp | 268 // TODO: It may be possible to actually avoid the copy. 314 // It will trigger the failed isel mode. 702 // It's possible the mapping changed control flow, and moved the following 751 MachineBasicBlock::iterator It = MI.getParent()->getFirstNonPHI(); local 752 if (It != MI.getParent()->end()) 753 addInsertPoint(*It, /*Before*/ true); 755 addInsertPoint(*(--It), /*Before*/ false); 763 MachineBasicBlock::iterator It = Pred.getLastNonDebugInstr(); local 764 for (auto Begin = Pred.begin(); It != Begin && It 786 MachineBasicBlock::reverse_iterator It = MI; local [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | PlistDiagnostics.cpp | 852 /// The implementation method of getMacroExpansion: It prints the expansion of 909 /// Retrieves the ')' token that matches '(' \p It points to. 911 MacroInfo::tokens_iterator It, 974 for (auto It = Info.MI->tokens_begin(), E = Info.MI->tokens_end(); It != E; 975 ++It) { 976 Token T = *It; 997 auto N = std::next(It); 999 It = getMatchingRParen(++It, 1176 getMatchingRParen( MacroInfo::tokens_iterator It, MacroInfo::tokens_iterator End) argument 1219 auto It = CurrExpArgTokens.begin(); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/PerfJITEvents/ |
H A D | PerfJITEventListener.cpp | 451 for (DILineInfoTable::iterator It = Begin; It != End; ++It) { 452 DILineInfo &line = It->second; 457 // The debug_entry describes the source line information. It is defined as 470 for (DILineInfoTable::iterator It = Begin; It != End; ++It) { 472 DILineInfo &Line = It->second; 474 LineInfo.Addr = It [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | Float2Int.cpp | 243 for (auto &It : reverse(SeenInsts)) { 244 if (It.second != unknownRange()) 247 Instruction *I = It.first; 358 for (auto It = ECs.begin(), E = ECs.end(); It != E; ++It) { 364 for (auto MI = ECs.member_begin(It), ME = ECs.member_end(); 395 if (ECs.member_begin(It) == ECs.member_end() || Fail || 428 for (auto MI = ECs.member_begin(It), ME = ECs.member_end();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/IntelJITEvents/ |
H A D | IntelJITEventListener.cpp | 165 for (DILineInfoTable::iterator It = Begin; It != End; ++It) { 167 DILineInfoToIntelJITFormat((uintptr_t)Addr, It->first, It->second));
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | MustExecute.h | 46 /// It keep information for loop blocks may throw exception or otherwise 74 /// Returns true iff the block \p BB potentially may throw exception. It can 165 /// \p Inst into the basic block \p BB. It will make all cache updates to keep 170 /// from its block. It will make all cache updates to keep it correct after 403 auto *&It = InstructionIteratorMap[PP]; local 404 if (!It) 405 It = new iterator(*this, PP); 406 return *It; 460 /// \param It The iterator that is used to traverse the must be 465 getMustBeExecutedNextInstruction(MustBeExecutedIterator &It, [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MC/ |
H A D | MCInstPrinter.cpp | 108 auto It = lower_bound(M.OpToPatterns, MI->getOpcode(), local 112 if (It == M.OpToPatterns.end() || It->Opcode != MI->getOpcode()) 118 M.Patterns.slice(It->PatternStart, It->NumPatterns);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/ |
H A D | LSUnit.cpp | 164 auto It = Groups.find(GroupID); local 165 assert(It != Groups.end() && "Instruction not dispatched to the LS unit"); 166 It->second->onInstructionExecuted(); 167 if (It->second->isExecuted()) 168 Groups.erase(It);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | binomial_heap_base_.hpp | 39 // purpose. It is provided "as is" without express or implied 187 template<typename It> 189 copy_from_range(It first_it, It last_it);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | constructor_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 57 template<typename It> 60 copy_from_range(It first_it, It last_it)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 159 template<typename It> 162 copy_from_range(It first_it, It last_it)
|
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | ExegesisEmitter.cpp | 43 const auto It = PfmCounterNameTable.find(Name); local 44 if (It == PfmCounterNameTable.end()) 46 return It->second;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | FunctionLoweringInfo.h | 81 /// instruction selection. It is reverted ValueMap. It is computed 82 /// in lazy style - on demand. It is used to get the Value corresponding 260 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN); local 261 if (It == ValueMap.end()) 264 unsigned Reg = It->second;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/ |
H A D | Speculation.cpp | 32 auto It = Maps.insert({I.first, {I.second.Aliasee, SrcJD}}); local 34 assert(It.second && "ImplSymbols are already tracked for this Symbol?"); 35 (void)(It);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Frontend/ |
H A D | CheckerRegistry.cpp | 93 auto It = binaryFind(Checkers, CmdLineArg); local 95 if (!isInPackage(*It, CmdLineArg)) 108 return {It, It + Size}; 319 auto It = AnOpts.Config.insert({FullOption, Option.DefaultValStr}); local 323 if (It.second) 331 StringRef SuppliedValue = It.first->getValue(); 340 It.first->setValue(Option.DefaultValStr); 354 It.first->setValue(Option.DefaultValStr); 365 auto It local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/OProfileJIT/ |
H A D | OProfileJITEventListener.cpp | 122 for (auto& It : Lines) { 123 debug_line[i].vma = (unsigned long)It.first; 124 debug_line[i].lineno = It.second.Line;
|