Merge rust-lang#11

11: Add the yk BlockDisambiguate pass. r=ltratt a=vext01



Co-authored-by: Edd Barrett <[email protected]>

Author: bors[bot]

llvm/include/llvm/Transforms/Yk/BlockDisambiguate.h

@@ -0,0 +1,12 @@
+#ifndef LLVM_TRANSFORMS_YK_BLOCKDISAMBIGUATE_H
+#define LLVM_TRANSFORMS_YK_BLOCKDISAMBIGUATE_H
+
+#include "llvm/CodeGen/Passes.h"
+#include "llvm/CodeGen/TargetPassConfig.h"
+#include "llvm/IR/PassManager.h"
+
+namespace llvm {
+ModulePass *createYkBlockDisambiguatePass();
+} // namespace llvm
+
+#endif

llvm/lib/CodeGen/CMakeLists.txt

@@ -216,6 +216,7 @@ add_llvm_component_library(LLVMCodeGen
   Support
   Target
   TransformUtils
+  YkPasses
   )
 
 add_subdirectory(SelectionDAG)

llvm/lib/CodeGen/TargetPassConfig.cpp

@@ -48,6 +48,7 @@
 #include "llvm/Transforms/Scalar.h"
 #include "llvm/Transforms/Utils.h"
 #include "llvm/Transforms/Utils/SymbolRewriter.h"
+#include "llvm/Transforms/Yk/BlockDisambiguate.h"
 #include <cassert>
 #include <string>
 
@@ -238,6 +239,10 @@ static cl::opt<bool> DisableExpandReductions(
     "disable-expand-reductions", cl::init(false), cl::Hidden,
     cl::desc("Disable the expand reduction intrinsics pass from running"));
 
+static cl::opt<bool> YkBlockDisambiguate(
+    "yk-block-disambiguate", cl::init(false), cl::NotHidden,
+    cl::desc("Disambiguate blocks for yk"));
+
 /// Allow standard passes to be disabled by command line options. This supports
 /// simple binary flags that either suppress the pass or do nothing.
 /// i.e. -disable-mypass=false has no effect.
@@ -1060,6 +1065,8 @@ bool TargetPassConfig::addISelPasses() {
   addIRPasses();
   addCodeGenPrepare();
   addPassesToHandleExceptions();
+  if (YkBlockDisambiguate)
+    addPass(createYkBlockDisambiguatePass());
   addISelPrepare();
 
   return addCoreISelPasses();

llvm/lib/LTO/CMakeLists.txt

@@ -35,5 +35,5 @@ add_llvm_component_library(LLVMLTO
   Support
   Target
   TransformUtils
-  YkControlPoint
+  YkPasses
 )

llvm/lib/Passes/CMakeLists.txt

@@ -25,5 +25,4 @@ add_llvm_component_library(LLVMPasses
   TransformUtils
   Vectorize
   Instrumentation
-  YkControlPoint
   )

llvm/lib/Transforms/Yk/BlockDisambiguate.cpp

@@ -0,0 +1,231 @@
+//===- BlockDisambiguate.cpp - Unambiguous block mapping for yk ----===//
+//
+// This pass ensures that yk is able to unambiguously map machine blocks back
+// to LLVM IR blocks.
+//
+// In the JIT runtime, the mapping stage converts the *machine* basic blocks of
+// a trace back to high-level basic blocks (the ones in LLVM IR). A problem
+// arises when the mapper encounters two consecutive machine basic block
+// entries that map back to the same high-level block. If after mapping machine
+// blocks, the high-level trace contains the sequence `[bbA, bbA]`, then it may
+// not clear if:
+//
+//  - the program executed the block `bbA` twice, or
+//  - `bbA` executed only once, but is composed of more than one machine block.
+//
+// This pass disambiguates the two cases by adding extra "disambiguation
+// blocks" for high-level IR blocks that have an edge straight back to
+// themselves. The new blocks make it clear when execution has left and
+// re-entered the same high-level block.
+//
+// For a concrete example, suppose that we have a high-level LLVM IR basic
+// block, `bbA`, as shown in Fig. 1a.
+//
+//                                       ┌──►│
+//                                       │   ▼
+//         ┌──►│                         │ ┌────┐   ┌────┐
+//         │   ▼                         │ │bb.0│──►│bb.1│
+//         │ ┌───┐                       │ └────┘   └────┘
+//         │ │bbA│                       │   │        │
+//         │ └───┘                       │   ▼        ▼
+//         └───┤                         │ ┌────┐   ┌────┐
+//             ▼                         │ │bb.3│◄──│bb.2│
+//                                       │ └────┘   └────┘
+//                                       └───┤
+//                                           ▼
+//
+//         (Fig. 1a)                         (Fig. 1b)
+//  High-level LLVM IR block.          Lowered machine blocks.
+//
+// Now suppose that during code-gen `bbA` lowers to the four machine blocks, as
+// shown in Fig. 1b. This is entirely possible: any given LLVM instruction can
+// lower to any number of machine blocks and there can be arbitrary control flow
+// between them [0].
+//
+// Let's look at two ways that execution can enter the machine blocks of `bbA`
+// and flow through them before exiting to the machine blocks elsewhere:
+//
+//  - `[bb.0, bb.3, bb.0, bb.3]`
+//    i.e. `bbA` is executed twice.
+//
+//  - `[bb.0, bb.1, bb.2, bb.3]`
+//    i.e. `bbA` is executed once, taking a longer path.
+//
+// Since `bb.0` through `bb.3` all belong to the high-level block `bbA`, a
+// naive mapping back to high-level IR would give a trace of `[bbA, bbA, bbA,
+// bbA]` for both of the above paths, and we have no way of knowing whether
+// `bbA` executed once or twice.
+//
+// The pass implemented in this file resolves this ambiguity by ensuring that
+// no high-level IR block can branch straight back to itself. With this
+// property in-place the mapper can safely assume that repeated consecutive
+// entries for the same high-level block, means that execution is within the
+// confines of the same high-level block, and that the block is not being
+// re-executed.
+//
+// For our worked example, this pass would change the high-level IR as shown in
+// Fig. 2a.
+//
+// ```
+//                                            ┌──►│
+//                                            │   ▼
+//                                            │ ┌────┐   ┌────┐
+//         ┌──►│                              │ │bb.0│──►│bb.1│
+//         │   ▼                              │ └────┘   └────┘
+//         │ ┌───┐                            │   │        │
+//         │ │bbA│                            │   ▼        ▼
+//         │ └───┘                            │ ┌────┐   ┌────┐
+//         │   │                              │ │bb.3│◄──│bb.2│
+//         │   ▼                              │ └────┘   └────┘
+//         │ ┌───┐                            │   │ │
+//         └─│bbB│  disambiguation            │   ▼ └───┐
+//           └───┘      block                 │ ┌────┐  │
+//             │                              └─│bb.4│  │
+//             ▼                                └────┘  │
+//                                                      ▼
+//
+//        (Fig. 2a)                            (Fig. 2b)
+//    High-level blocks after              Machine blocks after
+//     disambiguation pass.                disambiguation pass.
+// ```
+//
+// Now if `bbA` is re-executed control flow must go via the "disambiguation
+// block" `bbB` and our example paths would now be:
+//
+//  - `[bb.0, bb.3, bb.4, bb.0, bb.3, bb.4]`
+//  - `[bb.0, bb.1, bb.2, bb.3]`
+//
+// And their initial mappings are:
+//
+//  - `[bbA, bbA, bbB, bbA, bbA, bbB]`
+//  - `[bbA, bbA, bbA, bbA]`
+//
+// And consecutive repeated entries can be collapsed giving:
+//
+//  - `[bbA, bbB, bbA, bbB]`
+//  - `[bbA]`
+//
+// The former unambiguously expresses that `bbA` was executed twice. The latter
+// unambiguously expresses that `bbA` was executed only once.
+//
+// The pass runs after high-level IR optimisations (and requires some backend
+// optimisations disabled) to ensure that LLVM doesn't undo our work, by
+// folding the machine block for `bbB` back into its predecessor in `bbA`.
+//
+// Alternative approaches that we dismissed, and why:
+//
+//  - Consider branches back to the entry machine block of a high-level block
+//    as a re-execution of the high-level block. Even assuming that we can
+//    identify the entry machine block for a high-level block, this is flawed.
+//    As can be seen in the example above, both internal and non-internal
+//    control flow can branch back to the entry block. Additionally, there may
+//    not be a unique entry machine basic block.
+//
+//  - Mark (in the machine IR) which branches are exits to the high-level IR
+//    block and encode this is the basic block map somehow. This is more
+//    complicated, but may work. We may revisit this approach later:
+//    https://github.com/ykjit/yk/issues/435
+//
+//  - Try to make it so that high-level IR blocks lower to exactly one machine
+//    block. It will be difficult to find all of the (platform specific) cases
+//    where a high-level block can lower to many machine blocks, and it's
+//    likely that some LLVM IR constructs require internal control flow for
+//    correct semantics.
+//
+// Footnotes:
+//
+// [0]: For some targets, a single high-level LLVM IR instruction can even
+//      lower to a machine-IR-level loop, for example `cmpxchng` on some ARM
+//      targets, and integer division on targets which have no dedicated
+//      division instructions (e.g. AVR). A high-level instruction lowered to
+//      a machine-level loop presents a worst-case scenario for ambiguity, as
+//      a potentially unbounded number of machine blocks can be executed
+//      within the confines of a single high-level basic block.
+//
+//===----------------------------------------------------------------------===//
+
+#include "llvm/Transforms/Yk/BlockDisambiguate.h"
+#include "llvm/IR/BasicBlock.h"
+#include "llvm/IR/Function.h"
+#include "llvm/IR/Instructions.h"
+#include "llvm/IR/Module.h"
+#include "llvm/InitializePasses.h"
+#include "llvm/Pass.h"
+#include <llvm/IR/Dominators.h>
+#include <llvm/IR/IRBuilder.h>
+#include <llvm/IR/Verifier.h>
+
+using namespace llvm;
+
+#define DEBUG_TYPE "yk-block-disambiguate"
+
+namespace llvm {
+void initializeYkBlockDisambiguatePass(PassRegistry &);
+}
+
+namespace {
+class YkBlockDisambiguate : public ModulePass {
+public:
+  static char ID;
+  YkBlockDisambiguate() : ModulePass(ID) {
+    initializeYkBlockDisambiguatePass(*PassRegistry::getPassRegistry());
+  }
+  bool runOnModule(Module &M) override {
+    LLVMContext &Context = M.getContext();
+    for (Function &F : M)
+      processFunction(Context, F);
+    return true;
+  }
+
+private:
+  BasicBlock *makeDisambiguationBB(LLVMContext &Context, BasicBlock *BB,
+                                   std::vector<BasicBlock *> &NewBBs) {
+    BasicBlock *DBB = BasicBlock::Create(Context, "");
+    NewBBs.push_back(DBB);
+    IRBuilder<> Builder(DBB);
+    Builder.CreateBr(BB);
+    return DBB;
+  }
+
+  void processFunction(LLVMContext &Context, Function &F) {
+    std::vector<BasicBlock *> NewBBs;
+    for (BasicBlock &BB : F) {
+      Instruction *TI = BB.getTerminator();
+      assert(!isa<IndirectBrInst>(TI)); // YKFIXME: not implemented.
+      if (isa<BranchInst>(TI)) {
+        BranchInst *BI = cast<BranchInst>(TI);
+        for (unsigned SuccIdx = 0; SuccIdx < BI->getNumSuccessors();
+             SuccIdx++) {
+          BasicBlock *SuccBB = BI->getSuccessor(SuccIdx);
+          if (SuccBB == &BB) {
+            BasicBlock *DBB = makeDisambiguationBB(Context, &BB, NewBBs);
+            BI->setSuccessor(SuccIdx, DBB);
+          }
+        }
+      } else if (isa<SwitchInst>(TI)) {
+        SwitchInst *SI = cast<SwitchInst>(TI);
+        for (unsigned SuccIdx = 0; SuccIdx < SI->getNumSuccessors();
+             SuccIdx++) {
+          BasicBlock *SuccBB = SI->getSuccessor(SuccIdx);
+          if (SuccBB == &BB) {
+            BasicBlock *DBB = makeDisambiguationBB(Context, &BB, NewBBs);
+            SI->setSuccessor(SuccIdx, DBB);
+          }
+        }
+      }
+    }
+
+    // Insert new blocks at the end, so as to not iterate and mutate the
+    // function's basic block list simultaneously.
+    for (BasicBlock *BB : NewBBs)
+      BB->insertInto(&F);
+  }
+};
+} // namespace
+
+char YkBlockDisambiguate::ID = 0;
+INITIALIZE_PASS(YkBlockDisambiguate, DEBUG_TYPE, "yk block disambiguation",
+                false, false)
+ModulePass *llvm::createYkBlockDisambiguatePass() {
+  return new YkBlockDisambiguate();
+}

llvm/lib/Transforms/Yk/CMakeLists.txt

@@ -1,4 +1,5 @@
-add_llvm_component_library(LLVMYkControlPoint
+add_llvm_component_library(LLVMYkPasses
+  BlockDisambiguate.cpp
   ControlPoint.cpp
 
   DEPENDS