/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | constructor_destructor_store_hash_fn_imps.hpp | 58 p->m_hash = ranged_hash_fn_base::operator()((const_key_reference)(PB_DS_V2F(p->m_value))).second;
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | constructor_destructor_store_hash_fn_imps.hpp | 57 p_e->m_hash = ranged_probe_fn_base::operator()(PB_DS_V2F(r_val)).second;
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/ |
H A D | SharingPtr.cpp | 82 if (ptr == NULL || pos->second.first == ptr) { 84 printf("\nsp(%p): %p\n", pos->first, pos->second.first); 85 pos->second.second.Dump();
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | GISelWorkList.h | 70 if (!WorklistMap.try_emplace(Worklist[i], i).second) 80 if (WorklistMap.try_emplace(I, Worklist.size()).second) 92 Worklist[It->second] = nullptr;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUMachineFunction.cpp | 48 if (!Entry.second) 49 return Entry.first->second; 60 Entry.first->second = Offset;
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/hwasan/ |
H A D | hwasan_setjmp.S | 71 // We always have the second argument to __sigjmp_save (savemask) set, since 79 .macro ALIAS first second 80 .globl \second 81 .equ \second\(), \first
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/Interp/ |
H A D | Record.cpp | 33 return It->second; 39 return It->second; 45 return It->second;
|
/freebsd-11-stable/contrib/flex/ |
H A D | nfa.c | 363 * branch = mkbranch( first, second ); 365 * branch - a machine which matches either first's pattern or second's 366 * first, second - machines whose patterns are to be or'ed (the | operator) 368 * Note that first and second are NEITHER destroyed by the operation. Also, 373 int mkbranch (first, second) 374 int first, second; 379 return second; 381 else if (second == NO_TRANSITION) 387 mkxtion (eps, second); 449 * new = mkor( first, second ); [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | MapVector.h | 101 auto &I = Result.first->second; 102 if (Result.second) { 106 return Vector[I].second; 114 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; 120 auto &I = Result.first->second; 121 if (Result.second) { 122 Vector.push_back(std::make_pair(KV.first, KV.second)); 133 auto &I = Result.first->second; 134 if (Result.second) { [all...] |
H A D | PriorityWorklist.h | 94 if (InsertResult.second) { 100 auto &Index = InsertResult.first->second; 126 if (InsertResult.second) 131 ptrdiff_t &Index = InsertResult.first->second; 168 assert(V[I->second] == X && "Value not actually at index in map!"); 169 if (I->second == (ptrdiff_t)(V.size() - 1)) { 174 V[I->second] = T();
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Frontend/ |
H A D | CommandLineSourceLoc.h | 39 if (!ColSplit.second.getAsInteger(10, PSL.Column) && 40 !LineSplit.second.getAsInteger(10, PSL.Line)) { 57 /// the second element is the column. 60 /// second element is the column. 76 if (!RangeSplit.second.empty()) { 77 std::pair<StringRef, StringRef> Split = RangeSplit.second.rsplit(':'); 79 Split.second.getAsInteger(10, EndColumn)) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | TypeFinder.cpp | 74 incorporateMDNode(MD.second); 94 if (!VisitedTypes.insert(Ty).second) 111 if (VisitedTypes.insert(*I).second) 132 if (!VisitedConstants.insert(V).second) 152 if (!VisitedMetadata.insert(V).second)
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | JITLinkMemoryManager.cpp | 43 void *SlabStart = SegBlocks.begin()->second.base(); 46 SlabStart = std::min(SlabStart, KV.second.base()); 47 SlabEnd = std::max(SlabEnd, (char *)(KV.second.base()) + 48 KV.second.allocatedSize()); 63 auto &Block = KV.second; 88 const auto &Seg = KV.second; 111 const auto &Seg = KV.second;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MC/ |
H A D | StringTableBuilder.cpp | 69 memcpy(Buf + P.second, Data.data(), Data.size()); 149 P->second = Pos; 155 P->second = Size; 184 return I->second; 193 if (P.second) { 195 P.first->second = Start; 198 return P.first->second;
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/ |
H A D | TypeSystem.cpp | 193 TypeSystem *type_system = pair.second.get(); 213 TypeSystem *type_system = pair.second.get(); 235 auto *type_system = pos->second.get(); 249 if (pair.second && pair.second->SupportsLanguage(language)) { 252 m_map[language] = pair.second; 253 if (pair.second.get()) { 255 return *pair.second.get(); 304 auto *type_system = pos->second.get(); 318 if (pair.second [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | SpeculateAroundPHIs.cpp | 149 if (!Visited.insert(OpI).second) 224 if (!IncomingConstantBlocks.insert(PN.getIncomingBlock(i)).second) 229 ++InsertResult.first->second.Count; 231 if (!InsertResult.second) 234 int &MatCost = InsertResult.first->second.MatCost; 283 int MatCost = IncomingConstantAndCostsAndCount.second.MatCost; 284 int &FoldedCost = IncomingConstantAndCostsAndCount.second.FoldedCost; 313 int MatCost = IncomingConstantAndCostsAndCount.second.MatCost; 314 int FoldedCost = IncomingConstantAndCostsAndCount.second.FoldedCost; 315 int Count = IncomingConstantAndCostsAndCount.second [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ProfileData/ |
H A D | SampleProf.h | 211 if (LHS.second != RHS.second) 212 return LHS.second > RHS.second; 262 SortedTargets.emplace(I.first(), I.second); 272 MergeResult(Result, addCalledTarget(I.first(), I.second, Weight)); 346 return ret->second.getSamples(); 357 return ret->second.getCallTargets(); 371 return &iter->second; 386 auto FS = iter->second [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontierImpl.h | 53 I->second.erase(BB); 61 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB"); 62 I->second.erase(Node); 69 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB"); 70 I->second.erase(Node); 105 tmpFrontiers.insert(std::make_pair(I->first, I->second)); 115 if (compareDomSet(I->second, DFI->second)) 138 const std::set<BlockT *> &BBs = I->second; 182 if (visited.insert(currentBB).second) { [all...] |
H A D | LoopIterator.h | 67 return N.second != L->getHeader() && L->contains(N.second); 78 {succ_begin(Node.second), Node.first}, 79 {succ_end(Node.second), Node.first}), 86 {succ_begin(Node.second), Node.first}, 87 {succ_end(Node.second), Node.first}), 148 return I != PostNumbers.end() && I->second; 155 assert(I->second && "block not finished by DFS"); 156 return I->second; 235 return DFS.PostNumbers.insert(std::make_pair(BB, 0)).second; [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SplitModule.cpp | 155 if (a.second || b.second) 156 return a.second > b.second; 185 return a.second->getData()->getName() > b.second->getData()->getName(); 192 unsigned CurrentClusterSize = BalancinQueue.top().second; 196 << I.first << ") ----> " << I.second->getData()->getName() 200 GVtoClusterMap.findLeader(I.second); 202 if (!Visited.insert(*MI).second) [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | CallGraph.cpp | 56 I.second->allReferencesDropped(); 97 Nodes.push_back(I.second.get()); 140 I->second->F = const_cast<Function*>(To); 141 FunctionMap[To] = std::move(I->second); 172 if (Function *FI = I.second->getFunction()) 191 I->second->DropRef(); 204 if (CalledFunctions[i].second == Callee) { 218 if (CR.second == Callee && CR.first == nullptr) { 235 I->second->DropRef(); 237 I->second [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/utils/TableGen/ |
H A D | ClangOpenCLBuiltinEmitter.cpp | 427 SignIndex = it->second; 460 OS << " // " << T.second << "\n" 478 OS << " // " << P.second << "\n "; 480 OS << TypeMap.find(R)->second << ", "; 494 for (const auto &Name : SLM.second.Names) { 499 for (const auto &Overload : SLM.second.Signatures) { 501 OS << " { " << Overload.second << ", " 524 SignatureListMap.find(Candidate)->second.Signatures; 552 for (const auto &Signature : Fct.second) { 553 CurSignatureList->push_back(Signature.second); [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Target/ |
H A D | SectionLoadHistory.cpp | 49 return rpos->second.get(); 55 return pos->second.get(); 58 return pos->second.get(); 74 return pos->second.get(); 83 new SectionLoadList(*rpos->second)); 161 pos->second->Dump(s, target);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ProfileData/ |
H A D | SampleProfWriter.cpp | 49 V.push_back(std::make_pair(I.getKey(), &I.second)); 53 if (A.second->getTotalSamples() == B.second->getTotalSamples()) 55 return A.second->getTotalSamples() > B.second->getTotalSamples(); 59 if (std::error_code EC = writeSample(*I.second)) 164 encodeULEB128(entry.second, OS); 182 addNames(I.second); 241 const SampleRecord &Sample = I->second; 251 OS << " " << J.first << ":" << J.second; [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Basic/ |
H A D | FileManager.cpp | 103 if (NamedDirEnt.second) 109 NamedDirEnt.second = *UDE.get(); 142 if (!SeenDirInsertResult.second) { 143 if (SeenDirInsertResult.first->second) 145 return llvm::errorCodeToError(SeenDirInsertResult.first->second.getError()); 151 assert(!NamedDirEnt.second && "should be newly-created"); 164 NamedDirEnt.second = statError; 176 NamedDirEnt.second = UDE; 209 if (!SeenFileInsertResult.second) { 210 if (!SeenFileInsertResult.first->second) [all...] |