| /freebsd-12.1/contrib/llvm/include/llvm/ADT/ |
| H A D | PriorityWorklist.h | 94 auto InsertResult = M.insert({X, V.size()}); in insert() local
95 if (InsertResult.second) { in insert()
101 auto &Index = InsertResult.first->second; in insert()
126 auto InsertResult = M.insert({V[i], i}); in insert() local
127 if (InsertResult.second) in insert()
132 ptrdiff_t &Index = InsertResult.first->second; in insert()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Rewrite/ |
| H A D | DeltaTree.cpp | 58 struct InsertResult { struct in __anonb4cff6540111::DeltaTreeNode
110 bool DoInsertion(unsigned FileIndex, int Delta, InsertResult *InsertRes);
112 void DoSplit(InsertResult &InsertRes);
137 DeltaTreeInteriorNode(const InsertResult &IR) in DeltaTreeInteriorNode()
186 InsertResult *InsertRes) { in DoInsertion()
299 void DeltaTreeNode::DoSplit(InsertResult &InsertRes) { in DoSplit()
460 DeltaTreeNode::InsertResult InsertRes; in AddDelta()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | SpeculateAroundPHIs.cpp | 220 auto InsertResult = CostsAndCounts.insert({IncomingC, {}}); in isSafeAndProfitableToSpeculateAroundPHI() local
222 ++InsertResult.first->second.Count; in isSafeAndProfitableToSpeculateAroundPHI()
224 if (!InsertResult.second) in isSafeAndProfitableToSpeculateAroundPHI()
227 int &MatCost = InsertResult.first->second.MatCost; in isSafeAndProfitableToSpeculateAroundPHI()
625 auto InsertResult = SpeculatedValueMap.insert({OpPN, {}}); in speculatePHIs() local
626 if (!InsertResult.second) in speculatePHIs()
629 auto &SpeculatedVals = InsertResult.first->second; in speculatePHIs()
|
| /freebsd-12.1/contrib/llvm/lib/DebugInfo/Symbolize/ |
| H A D | Symbolize.cpp | 434 auto InsertResult = in getOrCreateModuleInfo() local
436 assert(InsertResult.second); in getOrCreateModuleInfo()
439 return InsertResult.first->second.get(); in getOrCreateModuleInfo()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/CodeGen/ |
| H A D | CodeGenTypes.cpp | 723 bool InsertResult = RecordsBeingLaidOut.insert(Key).second; in ConvertRecordDeclType() local
724 (void)InsertResult; in ConvertRecordDeclType()
725 assert(InsertResult && "Recursively compiling a struct?"); in ConvertRecordDeclType()
|
| /freebsd-12.1/contrib/llvm/lib/ProfileData/Coverage/ |
| H A D | CoverageMappingReader.cpp | 420 auto InsertResult = in insertFunctionRecordIfNeeded() local
422 if (InsertResult.second) { in insertFunctionRecordIfNeeded()
433 size_t OldRecordIndex = InsertResult.first->second; in insertFunctionRecordIfNeeded()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | PredicateInfo.cpp | 699 auto InsertResult = ValueInfoNums.insert({Operand, ValueInfos.size() - 1}); in getOrCreateValueInfo() local
700 assert(InsertResult.second && "Value info number already existed?"); in getOrCreateValueInfo()
701 return ValueInfos[InsertResult.first->second]; in getOrCreateValueInfo()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 1386 auto InsertResult = in insertTrivialCallEdge() local
1388 if (!InsertResult.second) { in insertTrivialCallEdge()
1390 Edge &E = SourceN->Edges[InsertResult.first->second]; in insertTrivialCallEdge()
1419 auto InsertResult = in insertTrivialRefEdge() local
1421 if (!InsertResult.second) in insertTrivialRefEdge()
|
| H A D | ScalarEvolution.cpp | 7151 auto InsertResult = TripCountMap.insert({{ExitCond, ControlsExit}, EL}); in insert() local
7152 assert(InsertResult.second && "Expected successful insertion!"); in insert()
7153 (void)InsertResult; in insert()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | MachineBlockPlacement.cpp | 1210 auto InsertResult = TriangleChainMap.try_emplace(PDom, &BB, PDom); in precomputeTriangleChains() local
1211 assert(InsertResult.second && "Block seen twice."); in precomputeTriangleChains()
1212 (void)InsertResult; in precomputeTriangleChains()
1233 auto InsertResult = ComputedEdges.insert({src, {dst, true}}); in precomputeTriangleChains() local
1234 assert(InsertResult.second && "Block seen twice."); in precomputeTriangleChains()
1235 (void)InsertResult; in precomputeTriangleChains()
|
| H A D | LiveDebugVariables.cpp | 1118 auto InsertResult = NewLocations.insert({Loc, {Spilled, SpillOffset}}); in rewriteLocations() local
1119 unsigned NewLocNo = std::distance(NewLocations.begin(), InsertResult.first); in rewriteLocations()
|
| /freebsd-12.1/contrib/llvm/lib/MC/MCParser/ |
| H A D | ELFAsmParser.cpp | 639 bool InsertResult = getContext().addGenDwarfSection(ELFSection); in ParseSectionArguments() local
640 if (InsertResult) { in ParseSectionArguments()
|
| H A D | AsmParser.cpp | 876 bool InsertResult = getContext().addGenDwarfSection(Sec); in Run() local
877 assert(InsertResult && ".text section should not have debug info yet"); in Run()
878 (void)InsertResult; in Run()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | CodeViewDebug.cpp | 426 auto InsertResult = TypeIndices.insert({{Node, ClassTy}, TI}); in recordTypeIndexForDINode() local
427 (void)InsertResult; in recordTypeIndexForDINode()
428 assert(InsertResult.second && "DINode was already assigned a type index"); in recordTypeIndexForDINode()
2475 auto InsertResult = CompleteTypeIndices.insert({CTy, TypeIndex()}); in getCompleteTypeIndex() local
2476 if (!InsertResult.second) in getCompleteTypeIndex()
2477 return InsertResult.first->second; in getCompleteTypeIndex()
|
| /freebsd-12.1/contrib/llvm/lib/IR/ |
| H A D | Verifier.cpp | 4917 auto InsertResult = TBAABaseNodes.insert({BaseNode, Result}); in verifyTBAABaseNode() local
4918 (void)InsertResult; in verifyTBAABaseNode()
4919 assert(InsertResult.second && "We just checked!"); in verifyTBAABaseNode()
5064 auto InsertResult = TBAAScalarNodes.insert({MD, Result}); in isValidScalarTBAANode() local
5065 (void)InsertResult; in isValidScalarTBAANode()
5066 assert(InsertResult.second && "Just checked!"); in isValidScalarTBAANode()
|