[MachineVerifier] Doing ::calcRegsPassed over faster sets: ~15-20% faster MV

[rtereshin]

Summary

MachineVerifier still takes 45-50% of total compile time with
-verify-machineinstrs, with calcRegsPassed dataflow taking ~50-60% of
MachineVerifier.

The majority of that time is spent in BBInfo::addPassed, mostly within
DenseSet implementing the sets the dataflow is operating over.

In particular, 1/4 of that DenseSet time is spent just iterating over it
(operator++), 40-50% on insertions, and most of the rest in ::count.

Given that, we're implementing custom sets just for this analysis here,
focusing on cheap insertions and O(n) iteration time (as opposed to
O(U), where U is the universe).

As it's based _mostly_ on BitVector for sparse and SmallVector for
dense, it may remotely resemble SparseSet. The difference is, our
solution is a lot less clever, doesn't have constant time clear that
we won't use anyway as reusing these sets across analyses is cumbersome,
and thus more space efficient and safer (got a resizable Universe and a
fallback to DenseSet for sparse if it gets too big).

With this patch MachineVerifier gets ~15-20% faster, its contribution to
total compile time drops from 45-50% to ~35%, while contribution of
calcRegsPassed to MachineVerifier drops from 50-60% to ~35% as well.

calcRegsPassed itself gets another 2x faster here.

All measured on a large suite of shaders targeting a number of GPUs.

[rudkx]

llvm/lib/CodeGen/MachineVerifier.cpp

2190

FILTERb seems like a typo.

2195

FILTERb again.

[rtereshin]

llvm/lib/CodeGen/MachineVerifier.cpp

2190

Not a typo, intended is OUT_b, as a subscript, for "block". FILTER is unique per BB.

[rudkx]

llvm/lib/CodeGen/MachineVerifier.cpp

2131

You could reduce indentation here by adding braces around the body of the for loop, inverting the condition, and using continue, per https://www.llvm.org/docs/CodingStandards.html#use-early-exits-and-continue-to-simplify-code.

[rtereshin]

llvm/lib/CodeGen/MachineVerifier.cpp

2131

I could indeed! The body has started as one-liner, then grew, and I haven't changed this.

I'll update it that way in one go with the rest of the nitpicks when those are all available together, and if the patch clears overall. Thanks!

2190

Does that clears the issue, or you'd rather prefer those subscripts dropped (I suppose everywhere then, not just on FILTERb)?

I don't have a preference, fine either way.

[rudkx]

LGTM.

llvm/lib/CodeGen/MachineVerifier.cpp

2131

SGTM!

2190

I hadn't noticed the comment before the class which is why it stuck out. I guess I'm not opposed to any particular convention as long as we're consistent here but the all-caps name with lower-case suffix did stick out.

[rtereshin]

llvm/lib/CodeGen/MachineVerifier.cpp

2190

Yeah, I'm not very accustomed to trying to reproduce mathy notations in ASCII, I guess :)

Literally from wikipedia, for example:

Any particular style exists in LLVM's codebase for this kind of stuff?

[rtereshin]

llvm/lib/CodeGen/MachineVerifier.cpp

2190

I talked to @qcolombet briefly about this, he says he's not aware about any particular style being preferred, and we converged on a little bit more LATeX'y take on this with everything lower case and underscores for subscripts: out_b = in_b \ filter_b. I'll go with that.

[rtereshin]

Addressing the feedback (tidying up the comments a bit as discussed, going for if(! continue; instead of if() {})

llvm/lib/CodeGen/MachineVerifier.cpp

 
       BBInfo() = default;
 
-      // Add register to vregsPassed if it belongs there. Return true if
-      // anything changed.
-      bool addPassed(unsigned Reg) {
-        if (!Register::isVirtualRegister(Reg))
-          return false;
-        if (regsKilled.count(Reg) || regsLiveOut.count(Reg))
-          return false;
-        return vregsPassed.insert(Reg).second;
-      }
-
-      // Same for a full set.
-      bool addPassed(const RegSet &RS) {
-        bool changed = false;
-        for (RegSet::const_iterator I = RS.begin(), E = RS.end(); I != E; ++I)
-          if (addPassed(*I))
-            changed = true;
-        return changed;
-      }
-
       // Add register to vregsRequired if it belongs there. Return true if
       // anything changed.
       bool addRequired(unsigned Reg) {

   }
 }
 
+namespace {
+// This implements a set of registers that serves as a filter: can filter other
+// sets by passing through elements not in the filter and blocking those that
+// are. Any filter implicitly includes the full set of physical registers upon
+// creation, thus filtering them all out. The filter itself as a set only grows,
+// and needs to be as efficient as possible.
+struct VRegFilter {
+  // Add elements to the filter itself. \pre Input set \p FromRegSet must have
+  // no duplicates. Both virtual and physical registers are fine.
+  template <typename RegSetT> void add(const RegSetT &FromRegSet) {
+    SmallVector<unsigned, 0> VRegsBuffer;
+    filterAndAdd(FromRegSet, VRegsBuffer);
+  }
+  // Filter \p FromRegSet through the filter and append passed elements into \p
+  // ToVRegs. All elements appended are then added to the filter itself.
+  // \returns true if anything changed.
+  template <typename RegSetT>
+  bool filterAndAdd(const RegSetT &FromRegSet,
+                    SmallVectorImpl<unsigned> &ToVRegs) {
+    unsigned SparseUniverse = Sparse.size();
+    unsigned NewSparseUniverse = SparseUniverse;
+    unsigned NewDenseSize = Dense.size();
+    size_t Begin = ToVRegs.size();
+    for (unsigned Reg : FromRegSet)
+      if (Register::isVirtualRegister(Reg)) {
+        unsigned Index = Register::virtReg2Index(Reg);
+        if (Index < SparseUniverseMax) {
+          if (Index < SparseUniverse && Sparse.test(Index))
+            continue;
+          NewSparseUniverse = std::max(NewSparseUniverse, Index + 1);
+        } else {
+          if (Dense.count(Reg))
+            continue;
+          ++NewDenseSize;
+        }
+        ToVRegs.push_back(Reg);
+      }
+    size_t End = ToVRegs.size();
+    if (Begin == End)
+      return false;
+    // Reserving space in sets once performs better than doing so continuously
+    // and pays easily for double look-ups (even in Dense with SparseUniverseMax
+    // tuned all the way down) and double iteration (the second one is over a
+    // SmallVector, which is a lot cheaper compared to DenseSet or BitVector).
+    Sparse.resize(NewSparseUniverse);
+    Dense.reserve(NewDenseSize);
+    for (unsigned I = Begin; I < End; ++I) {
+      unsigned Reg = ToVRegs[I];
+      unsigned Index = Register::virtReg2Index(Reg);
+      if (Index < SparseUniverseMax)
+        Sparse.set(Index);
+      else
+        Dense.insert(Reg);
+    }
+    return true;
+  }
+
+private:
+  static constexpr unsigned SparseUniverseMax = 10 * 1024 * 8;
+  // VRegs indexed within SparseUniverseMax are tracked by Sparse, those beyound
+  // are tracked by Dense. The only purpose of the threashold and the Dense set
+  // is to have a reasonably growing memory usage in pathological cases (large
+  // number of very sparse VRegFilter instances live at the same time). In
+  // practice even in the worst-by-execution time cases having all elements
+  // tracked by Sparse (very large SparseUniverseMax scenario) tends to be more
+  // space efficient than if tracked by Dense. The threashold is set to keep the
+  // worst-case memory usage within 2x of figures determined empirically for
+  // "all Dense" scenario in such worst-by-execution-time cases.
+  BitVector Sparse;
+  DenseSet<unsigned> Dense;
+};
+
+// Implements both a transfer function and a (binary, in-place) join operator
+// for a dataflow over reg sets with filtering transfer (OUTb = INb \ FILTERb)
+// and set union join. FILTERb is expected to be set-up ahead of time. Maintains
+// OUTb as its state, allowing for O(n) iteration over it at any time, where n
+// is the size of the set (as opposed to O(U) where U is the universe). FILTERb
+// implicitly contains all physical registers at all times.
+class FilteringVRegSet {
+  VRegFilter Filter;
+  SmallVector<unsigned, 0> VRegs;
+
+public:
+  // Set-up the FILTERb. \pre Input register set \p RS must have no duplicates.
+  // Both virtual and physical registers are fine.
+  template <typename RegSetT> void addToFilter(const RegSetT &RS) {
+    Filter.add(RS);
+  }
+  // Passes \p RS through the FILTERb (transfer function) and adds what's left
+  // to itself (OUTb).
+  template <typename RegSetT> bool add(const RegSetT &RS) {
+    // Double-duty the Filter: to maintain VRegs a set (and the join operation
+    // a set union) just add everything being added here to the Filter as well.
+    return Filter.filterAndAdd(RS, VRegs);
+  }
+  using const_iterator = decltype(VRegs)::const_iterator;
+  const_iterator begin() const { return VRegs.begin(); }
+  const_iterator end() const { return VRegs.end(); }
+  size_t size() const { return VRegs.size(); }
+};
+} // namespace
+
 // Calculate the largest possible vregsPassed sets. These are the registers that
 // can pass through an MBB live, but may not be live every time. It is assumed
 // that all vregsPassed sets are empty before the call.

     // ReversePostOrderTraversal doesn't handle empty functions.
     return;
   }
+  std::vector<FilteringVRegSet> VRegsPassedSets(MF->size());
   for (const MachineBasicBlock *MBB :
        ReversePostOrderTraversal<const MachineFunction *>(MF)) {
     // Careful with the evaluation order, fetch next number before allocating.
     unsigned Number = RPONumbers.size();
     RPONumbers[MBB] = Number;
+    // Set-up the transfer functions for all blocks.
+    const BBInfo &MInfo = MBBInfoMap[MBB];
+    VRegsPassedSets[Number].addToFilter(MInfo.regsKilled);
+    VRegsPassedSets[Number].addToFilter(MInfo.regsLiveOut);
   }
   // First push live-out regs to successors' vregsPassed. Remember the MBBs that
   // have any vregsPassed.
   for (const MachineBasicBlock &MBB : *MF) {
-    BBInfo &MInfo = MBBInfoMap[&MBB];
+    const BBInfo &MInfo = MBBInfoMap[&MBB];
     if (!MInfo.reachable)
       continue;
     for (const MachineBasicBlock *Succ : MBB.successors()) {
-      BBInfo &SInfo = MBBInfoMap[Succ];
-      if (SInfo.addPassed(MInfo.regsLiveOut))
-        RPOWorklist.emplace(RPONumbers[Succ], Succ);
+      unsigned SuccNumber = RPONumbers[Succ];
+      FilteringVRegSet &SuccSet = VRegsPassedSets[SuccNumber];
+      if (SuccSet.add(MInfo.regsLiveOut))
+        RPOWorklist.emplace(SuccNumber, Succ);
     }
   }
 

     auto Next = RPOWorklist.begin();
     const MachineBasicBlock *MBB = Next->second;
     RPOWorklist.erase(Next);
-    BBInfo &MInfo = MBBInfoMap[MBB];
+    FilteringVRegSet &MSet = VRegsPassedSets[RPONumbers[MBB]];
     for (const MachineBasicBlock *Succ : MBB->successors()) {
       if (Succ == MBB)
         continue;
-      BBInfo &SInfo = MBBInfoMap[Succ];
-      if (SInfo.addPassed(MInfo.vregsPassed))
-        RPOWorklist.emplace(RPONumbers[Succ], Succ);
+      unsigned SuccNumber = RPONumbers[Succ];
+      FilteringVRegSet &SuccSet = VRegsPassedSets[SuccNumber];
+      if (SuccSet.add(MSet))
+        RPOWorklist.emplace(SuccNumber, Succ);
     }
   }
+  // Copy the results back to BBInfos.
+  for (const MachineBasicBlock &MBB : *MF) {
+    BBInfo &MInfo = MBBInfoMap[&MBB];
+    if (!MInfo.reachable)
+      continue;
+    const FilteringVRegSet &MSet = VRegsPassedSets[RPONumbers[&MBB]];
+    MInfo.vregsPassed.reserve(MSet.size());
+    MInfo.vregsPassed.insert(MSet.begin(), MSet.end());
+  }
 }
 
 // Calculate the set of virtual registers that must be passed through each basic