Searched refs:NewSet (Results 1 – 8 of 8) sorted by relevance
| /llvm-project-15.0.7/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFDebugPubTable.cpp | 31 Set &NewSet = Sets.back(); in extract() local 34 std::tie(NewSet.Length, NewSet.Format) = Data.getInitialLength(C); in extract() 46 Offset = C.tell() + NewSet.Length; in extract() 48 const unsigned OffsetSize = dwarf::getDwarfOffsetByteSize(NewSet.Format); in extract() 50 NewSet.Version = SetData.getU16(C); in extract() 51 NewSet.Offset = SetData.getRelocatedValue(C, OffsetSize); in extract() 52 NewSet.Size = SetData.getUnsigned(C, OffsetSize); in extract() 72 NewSet.Entries.push_back( in extract()
|
| /llvm-project-15.0.7/bolt/lib/Passes/ |
| H A D | ReorderAlgorithm.cpp | 455 uint64_t NewSet = (Set | (1ULL << New)); in reorderBasicBlocks() local 456 if (DP[NewSet][New] == -1) in reorderBasicBlocks() 457 DP[NewSet][New] = DP[Set][Last] + (int64_t)Weight[Last][New]; in reorderBasicBlocks() 458 DP[NewSet][New] = std::max(DP[NewSet][New], in reorderBasicBlocks() 461 if (DP[NewSet][New] > BestWeight) { in reorderBasicBlocks() 462 BestWeight = DP[NewSet][New]; in reorderBasicBlocks() 463 BestSet = NewSet; in reorderBasicBlocks()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | MachinePipeliner.cpp | 1759 NodeSet NewSet; in groupRemainingNodes() local 1763 addConnectedNodes(I, NewSet, NodesAdded); in groupRemainingNodes() 1764 if (!NewSet.empty()) in groupRemainingNodes() 1765 NodeSets.push_back(NewSet); in groupRemainingNodes() 1769 NewSet.clear(); in groupRemainingNodes() 1773 if (!NewSet.empty()) in groupRemainingNodes() 1774 NodeSets.push_back(NewSet); in groupRemainingNodes() 1780 NewSet.clear(); in groupRemainingNodes() 1782 if (!NewSet.empty()) in groupRemainingNodes() 1783 NodeSets.push_back(NewSet); in groupRemainingNodes() [all …]
|
| /llvm-project-15.0.7/polly/unittests/DeLICM/ |
| H A D | DeLICMTest.cpp | 122 auto NewSet = isl::set::universe(NewSpace); in checkIsConflictingNonsymmetricCommon() local 123 Universe = Universe.unite(NewSet); in checkIsConflictingNonsymmetricCommon()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | IRSimilarityIdentifier.cpp | 536 DenseSet<unsigned> NewSet; in checkNumberingAndReplaceCommutative() local 540 NewSet.insert(Curr); in checkNumberingAndReplaceCommutative() 543 if (NewSet.empty()) in checkNumberingAndReplaceCommutative() 547 if (NewSet.size() != ValueMappingIt->second.size()) in checkNumberingAndReplaceCommutative() 548 ValueMappingIt->second.swap(NewSet); in checkNumberingAndReplaceCommutative()
|
| /llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/ |
| H A D | RangeConstraintManager.cpp | 2381 ClassSet NewSet = CF.remove(OriginalSetLinkedToOther, Other); in mergeImpl() local 2382 NewSet = CF.add(NewSet, *this); in mergeImpl() 2384 DisequalityInfo = DF.add(DisequalityInfo, DisequalClass, NewSet); in mergeImpl() 2477 ClassSet NewSet = CurrentSet ? *CurrentSet : CF.getEmptySet(); in addToDisequalityInfo() local 2478 NewSet = CF.add(NewSet, Second); in addToDisequalityInfo() 2480 Info = F.add(Info, First, NewSet); in addToDisequalityInfo() 2844 ClassSet NewSet = ClassSetFactory.remove(DisequalToDisequalSet, Class); in removeDeadBindings() local 2847 if (NewSet.isEmpty()) { in removeDeadBindings() 2852 DisequalityFactory.add(Disequalities, DisequalClass, NewSet); in removeDeadBindings()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | MachinePipeliner.h | 301 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
|
| /llvm-project-15.0.7/llvm/lib/Transforms/IPO/ |
| H A D | LowerTypeTests.cpp | 2116 GlobalClassesTy::member_iterator NewSet = in lower() local 2119 CurSet = NewSet; in lower() 2121 CurSet = GlobalClasses.unionSets(CurSet, NewSet); in lower()
|