File Manager

003 File Manager

Current Path: /usr/src/contrib/llvm-project/llvm/lib/Transforms/Utils

usr / src / contrib / llvm-project / llvm / lib / Transforms / Utils /

📁 ..
📄 AMDGPUEmitPrintf.cpp(8.57 KB)
📄 ASanStackFrameLayout.cpp(5.75 KB)
📄 AddDiscriminators.cpp(10.78 KB)
📄 AssumeBundleBuilder.cpp(21.46 KB)
📄 BasicBlockUtils.cpp(51.81 KB)
📄 BreakCriticalEdges.cpp(19.03 KB)
📄 BuildLibCalls.cpp(43.9 KB)
📄 BypassSlowDivision.cpp(17.95 KB)
📄 CallGraphUpdater.cpp(5.76 KB)
📄 CallPromotionUtils.cpp(22.18 KB)
📄 CanonicalizeAliases.cpp(3.18 KB)
📄 CanonicalizeFreezeInLoops.cpp(7.93 KB)
📄 CloneFunction.cpp(34.49 KB)
📄 CloneModule.cpp(7.93 KB)
📄 CodeExtractor.cpp(65.69 KB)
📄 CodeMoverUtils.cpp(15.82 KB)
📄 CtorUtils.cpp(5.1 KB)
📄 Debugify.cpp(17.78 KB)
📄 DemoteRegToStack.cpp(6.1 KB)
📄 EntryExitInstrumenter.cpp(5.83 KB)
📄 EscapeEnumerator.cpp(2.96 KB)
📄 Evaluator.cpp(27.98 KB)
📄 FixIrreducible.cpp(12.68 KB)
📄 FlattenCFG.cpp(16.99 KB)
📄 FunctionComparator.cpp(34.36 KB)
📄 FunctionImportUtils.cpp(13.8 KB)
📄 GlobalStatus.cpp(7.23 KB)
📄 GuardUtils.cpp(4.76 KB)
📄 ImportedFunctionsInliningStatistics.cpp(7.67 KB)
📄 InjectTLIMappings.cpp(6.62 KB)
📄 InlineFunction.cpp(103.28 KB)
📄 InstructionNamer.cpp(1.98 KB)
📄 IntegerDivision.cpp(26.17 KB)
📄 LCSSA.cpp(18.72 KB)
📄 LibCallsShrinkWrap.cpp(18.68 KB)
📄 Local.cpp(114.96 KB)
📄 LoopRotationUtils.cpp(29.47 KB)
📄 LoopSimplify.cpp(36.13 KB)
📄 LoopUnroll.cpp(38.07 KB)
📄 LoopUnrollAndJam.cpp(37.71 KB)
📄 LoopUnrollPeel.cpp(31.88 KB)
📄 LoopUnrollRuntime.cpp(40.17 KB)
📄 LoopUtils.cpp(65.03 KB)
📄 LoopVersioning.cpp(12.42 KB)
📄 LowerInvoke.cpp(3.3 KB)
📄 LowerMemIntrinsics.cpp(20.41 KB)
📄 LowerSwitch.cpp(23.46 KB)
📄 Mem2Reg.cpp(3.71 KB)
📄 MetaRenamer.cpp(5.29 KB)
📄 MisExpect.cpp(6.97 KB)
📄 ModuleUtils.cpp(10.99 KB)
📄 NameAnonGlobals.cpp(3.33 KB)
📄 PredicateInfo.cpp(36.79 KB)
📄 PromoteMemoryToRegister.cpp(37.26 KB)
📄 SSAUpdater.cpp(16.72 KB)
📄 SSAUpdaterBulk.cpp(7.46 KB)
📄 SanitizerStats.cpp(4.08 KB)
📄 ScalarEvolutionExpander.cpp(101.25 KB)
📄 SimplifyCFG.cpp(238.13 KB)
📄 SimplifyIndVar.cpp(34.53 KB)
📄 SimplifyLibCalls.cpp(122.25 KB)
📄 SizeOpts.cpp(5.08 KB)
📄 SplitModule.cpp(9.67 KB)
📄 StripGCRelocates.cpp(2.86 KB)
📄 StripNonLineTableDebugInfo.cpp(1.4 KB)
📄 SymbolRewriter.cpp(18.82 KB)
📄 UnifyFunctionExitNodes.cpp(4.42 KB)
📄 UnifyLoopExits.cpp(8.16 KB)
📄 UniqueInternalLinkageNames.cpp(2.91 KB)
📄 Utils.cpp(2.53 KB)
📄 VNCoercion.cpp(25.89 KB)
📄 ValueMapper.cpp(38.06 KB)

Editing: DemoteRegToStack.cpp

//===- DemoteRegToStack.cpp - Move a virtual register to the stack --------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

#include "llvm/ADT/DenseMap.h"
#include "llvm/Analysis/CFG.h"
#include "llvm/Transforms/Utils/Local.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/Type.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
using namespace llvm;

/// DemoteRegToStack - This function takes a virtual register computed by an
/// Instruction and replaces it with a slot in the stack frame, allocated via
/// alloca.  This allows the CFG to be changed around without fear of
/// invalidating the SSA information for the value.  It returns the pointer to
/// the alloca inserted to create a stack slot for I.
AllocaInst *llvm::DemoteRegToStack(Instruction &I, bool VolatileLoads,
                                   Instruction *AllocaPoint) {
  if (I.use_empty()) {
    I.eraseFromParent();
    return nullptr;
  }

Function *F = I.getParent()->getParent();
  const DataLayout &DL = F->getParent()->getDataLayout();

// Create a stack slot to hold the value.
  AllocaInst *Slot;
  if (AllocaPoint) {
    Slot = new AllocaInst(I.getType(), DL.getAllocaAddrSpace(), nullptr,
                          I.getName()+".reg2mem", AllocaPoint);
  } else {
    Slot = new AllocaInst(I.getType(), DL.getAllocaAddrSpace(), nullptr,
                          I.getName() + ".reg2mem", &F->getEntryBlock().front());
  }

// We cannot demote invoke instructions to the stack if their normal edge
  // is critical. Therefore, split the critical edge and create a basic block
  // into which the store can be inserted.
  if (InvokeInst *II = dyn_cast<InvokeInst>(&I)) {
    if (!II->getNormalDest()->getSinglePredecessor()) {
      unsigned SuccNum = GetSuccessorNumber(II->getParent(), II->getNormalDest());
      assert(isCriticalEdge(II, SuccNum) && "Expected a critical edge!");
      BasicBlock *BB = SplitCriticalEdge(II, SuccNum);
      assert(BB && "Unable to split critical edge.");
      (void)BB;
    }
  }

// Change all of the users of the instruction to read from the stack slot.
  while (!I.use_empty()) {
    Instruction *U = cast<Instruction>(I.user_back());
    if (PHINode *PN = dyn_cast<PHINode>(U)) {
      // If this is a PHI node, we can't insert a load of the value before the
      // use.  Instead insert the load in the predecessor block corresponding
      // to the incoming value.
      //
      // Note that if there are multiple edges from a basic block to this PHI
      // node that we cannot have multiple loads. The problem is that the
      // resulting PHI node will have multiple values (from each load) coming in
      // from the same block, which is illegal SSA form. For this reason, we
      // keep track of and reuse loads we insert.
      DenseMap<BasicBlock*, Value*> Loads;
      for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
        if (PN->getIncomingValue(i) == &I) {
          Value *&V = Loads[PN->getIncomingBlock(i)];
          if (!V) {
            // Insert the load into the predecessor block
            V = new LoadInst(I.getType(), Slot, I.getName() + ".reload",
                             VolatileLoads,
                             PN->getIncomingBlock(i)->getTerminator());
          }
          PN->setIncomingValue(i, V);
        }

} else {
      // If this is a normal instruction, just insert a load.
      Value *V = new LoadInst(I.getType(), Slot, I.getName() + ".reload",
                              VolatileLoads, U);
      U->replaceUsesOfWith(&I, V);
    }
  }

// Insert stores of the computed value into the stack slot. We have to be
  // careful if I is an invoke instruction, because we can't insert the store
  // AFTER the terminator instruction.
  BasicBlock::iterator InsertPt;
  if (!I.isTerminator()) {
    InsertPt = ++I.getIterator();
    for (; isa<PHINode>(InsertPt) || InsertPt->isEHPad(); ++InsertPt)
      /* empty */;   // Don't insert before PHI nodes or landingpad instrs.
  } else {
    InvokeInst &II = cast<InvokeInst>(I);
    InsertPt = II.getNormalDest()->getFirstInsertionPt();
  }

new StoreInst(&I, Slot, &*InsertPt);
  return Slot;
}

/// DemotePHIToStack - This function takes a virtual register computed by a PHI
/// node and replaces it with a slot in the stack frame allocated via alloca.
/// The PHI node is deleted. It returns the pointer to the alloca inserted.
AllocaInst *llvm::DemotePHIToStack(PHINode *P, Instruction *AllocaPoint) {
  if (P->use_empty()) {
    P->eraseFromParent();
    return nullptr;
  }

const DataLayout &DL = P->getModule()->getDataLayout();

// Create a stack slot to hold the value.
  AllocaInst *Slot;
  if (AllocaPoint) {
    Slot = new AllocaInst(P->getType(), DL.getAllocaAddrSpace(), nullptr,
                          P->getName()+".reg2mem", AllocaPoint);
  } else {
    Function *F = P->getParent()->getParent();
    Slot = new AllocaInst(P->getType(), DL.getAllocaAddrSpace(), nullptr,
                          P->getName() + ".reg2mem",
                          &F->getEntryBlock().front());
  }

// Iterate over each operand inserting a store in each predecessor.
  for (unsigned i = 0, e = P->getNumIncomingValues(); i < e; ++i) {
    if (InvokeInst *II = dyn_cast<InvokeInst>(P->getIncomingValue(i))) {
      assert(II->getParent() != P->getIncomingBlock(i) &&
             "Invoke edge not supported yet"); (void)II;
    }
    new StoreInst(P->getIncomingValue(i), Slot,
                  P->getIncomingBlock(i)->getTerminator());
  }

// Insert a load in place of the PHI and replace all uses.
  BasicBlock::iterator InsertPt = P->getIterator();

for (; isa<PHINode>(InsertPt) || InsertPt->isEHPad(); ++InsertPt)
    /* empty */;   // Don't insert before PHI nodes or landingpad instrs.

Value *V =
      new LoadInst(P->getType(), Slot, P->getName() + ".reload", &*InsertPt);
  P->replaceAllUsesWith(V);

// Delete PHI.
  P->eraseFromParent();
  return Slot;
}

003 File Manager

Editing: DemoteRegToStack.cpp

Upload File

Create Folder