Searched refs:Partitions (Results 1 – 8 of 8) sorted by relevance
389 Partitions.clear(); in repartition()474 Partitions.insert(std::make_pair(Partitions.size(), Contents)); in repartition()494 Partitions.insert(std::make_pair(Partitions.size(), Contents)); in repartition()498 for (auto &Partition : Partitions) in repartition()506 if (Partitions.size() == 0) { in repartition()511 Partitions.insert(std::make_pair(Partitions.size(), Contents)); in repartition()523 Partitions.insert(std::make_pair(Partitions.size(), Contents)); in repartition()525 for (auto &Partition : Partitions) in repartition()642 auto P = Partitions.find(I->second); in addToPartition()643 if (P == Partitions.end()) in addToPartition()[all …]
453 DenseMap<unsigned, BitVector> Partitions;501 const auto &I = Partitions.find(Idx); in getPossibleLeavesForPartition()502 assert(I != Partitions.end() && "Requested non-existant partition"); in getPossibleLeavesForPartition()506 size_t getNumPartitions() const { return Partitions.size(); } in getNumPartitions()509 for (const auto &P : Partitions) in getNumLeavesWithDupes()
549 Partitions.print(OS); in operator <<()726 Partitions.addToCyclicPartition(I); in processLoop()744 if (Partitions.getSize() < 2) in processLoop()750 Partitions.mergeBeforePopulating(); in processLoop()752 if (Partitions.getSize() < 2) in processLoop()757 Partitions.populateUsedSet(); in processLoop()764 << Partitions); in processLoop()765 if (Partitions.getSize() < 2) in processLoop()835 Partitions.cloneLoops(); in processLoop()839 Partitions.removeUnusedInsts(); in processLoop()[all …]
1 Partitions title
166 Partitions
2 partitions "part1" and "part2" (see https://lld.llvm.org/Partitions.html
396 .. _partition: https://lld.llvm.org/Partitions.html
547 - Enhanced the support for C++20 Modules, including: Partitions,