File Manager

003 File Manager

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

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

📁 ..
📄 ADCE.cpp(24.71 KB)
📄 AlignmentFromAssumptions.cpp(15.9 KB)
📄 BDCE.cpp(7.42 KB)
📄 CallSiteSplitting.cpp(21.43 KB)
📄 ConstantHoisting.cpp(38.95 KB)
📄 ConstantProp.cpp(4.13 KB)
📄 CorrelatedValuePropagation.cpp(32.36 KB)
📄 DCE.cpp(6.84 KB)
📄 DeadStoreElimination.cpp(91.51 KB)
📄 DivRemPairs.cpp(15.01 KB)
📄 EarlyCSE.cpp(57.05 KB)
📄 FlattenCFGPass.cpp(2.74 KB)
📄 Float2Int.cpp(18.19 KB)
📄 GVN.cpp(100.11 KB)
📄 GVNHoist.cpp(44.85 KB)
📄 GVNSink.cpp(29.97 KB)
📄 GuardWidening.cpp(32.36 KB)
📄 IVUsersPrinter.cpp(839 B)
📄 IndVarSimplify.cpp(113.49 KB)
📄 InductiveRangeCheckElimination.cpp(72.96 KB)
📄 InferAddressSpaces.cpp(44.22 KB)
📄 InstSimplifyPass.cpp(5.39 KB)
📄 JumpThreading.cpp(115.06 KB)
📄 LICM.cpp(92.71 KB)
📄 LoopAccessAnalysisPrinter.cpp(977 B)
📄 LoopDataPrefetch.cpp(14.54 KB)
📄 LoopDeletion.cpp(11.37 KB)
📄 LoopDistribute.cpp(40.25 KB)
📄 LoopFuse.cpp(68.6 KB)
📄 LoopIdiomRecognize.cpp(69.09 KB)
📄 LoopInstSimplify.cpp(9.38 KB)
📄 LoopInterchange.cpp(60.65 KB)
📄 LoopLoadElimination.cpp(26.71 KB)
📄 LoopPassManager.cpp(4.02 KB)
📄 LoopPredication.cpp(49.21 KB)
📄 LoopRerollPass.cpp(58.54 KB)
📄 LoopRotation.cpp(4.79 KB)
📄 LoopSimplifyCFG.cpp(28.59 KB)
📄 LoopSink.cpp(14.93 KB)
📄 LoopStrengthReduce.cpp(216.88 KB)
📄 LoopUnrollAndJamPass.cpp(21.07 KB)
📄 LoopUnrollPass.cpp(60.73 KB)
📄 LoopUnswitch.cpp(64.17 KB)
📄 LoopVersioningLICM.cpp(23.65 KB)
📄 LowerAtomic.cpp(5.12 KB)
📄 LowerConstantIntrinsics.cpp(5.8 KB)
📄 LowerExpectIntrinsic.cpp(15 KB)
📄 LowerGuardIntrinsic.cpp(2.82 KB)
📄 LowerMatrixIntrinsics.cpp(73.36 KB)
📄 LowerWidenableCondition.cpp(2.75 KB)
📄 MakeGuardsExplicit.cpp(3.83 KB)
📄 MemCpyOptimizer.cpp(52.16 KB)
📄 MergeICmps.cpp(35.61 KB)
📄 MergedLoadStoreMotion.cpp(15.18 KB)
📄 NaryReassociate.cpp(19.86 KB)
📄 NewGVN.cpp(170.95 KB)
📄 PartiallyInlineLibCalls.cpp(6.22 KB)
📄 PlaceSafepoints.cpp(27.5 KB)
📄 Reassociate.cpp(95.61 KB)
📄 Reg2Mem.cpp(4.34 KB)
📄 RewriteStatepointsForGC.cpp(116.35 KB)
📄 SCCP.cpp(76.12 KB)
📄 SROA.cpp(183.83 KB)
📄 Scalar.cpp(10.08 KB)
📄 Scalarizer.cpp(32.93 KB)
📄 SeparateConstOffsetFromGEP.cpp(52.99 KB)
📄 SimpleLoopUnswitch.cpp(124.57 KB)
📄 SimplifyCFGPass.cpp(12.31 KB)
📄 Sink.cpp(10.81 KB)
📄 SpeculateAroundPHIs.cpp(35.69 KB)
📄 SpeculativeExecution.cpp(11.54 KB)
📄 StraightLineStrengthReduce.cpp(28.92 KB)
📄 StructurizeCFG.cpp(32.49 KB)
📄 TailRecursionElimination.cpp(34.9 KB)
📄 WarnMissedTransforms.cpp(6.14 KB)

Editing: Reg2Mem.cpp

//===- Reg2Mem.cpp - Convert registers to allocas -------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
//
// This file demotes all registers to memory references.  It is intended to be
// the inverse of PromoteMemoryToRegister.  By converting to loads, the only
// values live across basic blocks are allocas and loads before phi nodes.
// It is intended that this should make CFG hacking much easier.
// To make later hacking easier, the entry block is split into two, such that
// all introduced allocas and nothing else are in the entry block.
//
//===----------------------------------------------------------------------===//

#include "llvm/ADT/Statistic.h"
#include "llvm/IR/BasicBlock.h"
#include "llvm/IR/CFG.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/LLVMContext.h"
#include "llvm/IR/Module.h"
#include "llvm/InitializePasses.h"
#include "llvm/Pass.h"
#include "llvm/Transforms/Scalar.h"
#include "llvm/Transforms/Utils.h"
#include "llvm/Transforms/Utils/Local.h"
#include <list>
using namespace llvm;

#define DEBUG_TYPE "reg2mem"

STATISTIC(NumRegsDemoted, "Number of registers demoted");
STATISTIC(NumPhisDemoted, "Number of phi-nodes demoted");

namespace {
  struct RegToMem : public FunctionPass {
    static char ID; // Pass identification, replacement for typeid
    RegToMem() : FunctionPass(ID) {
      initializeRegToMemPass(*PassRegistry::getPassRegistry());
    }

void getAnalysisUsage(AnalysisUsage &AU) const override {
      AU.addRequiredID(BreakCriticalEdgesID);
      AU.addPreservedID(BreakCriticalEdgesID);
    }

bool valueEscapes(const Instruction *Inst) const {
      const BasicBlock *BB = Inst->getParent();
      for (const User *U : Inst->users()) {
        const Instruction *UI = cast<Instruction>(U);
        if (UI->getParent() != BB || isa<PHINode>(UI))
          return true;
      }
      return false;
    }

bool runOnFunction(Function &F) override;
  };
}

char RegToMem::ID = 0;
INITIALIZE_PASS_BEGIN(RegToMem, "reg2mem", "Demote all values to stack slots",
                false, false)
INITIALIZE_PASS_DEPENDENCY(BreakCriticalEdges)
INITIALIZE_PASS_END(RegToMem, "reg2mem", "Demote all values to stack slots",
                false, false)

bool RegToMem::runOnFunction(Function &F) {
  if (F.isDeclaration() || skipFunction(F))
    return false;

// Insert all new allocas into entry block.
  BasicBlock *BBEntry = &F.getEntryBlock();
  assert(pred_empty(BBEntry) &&
         "Entry block to function must not have predecessors!");

// Find first non-alloca instruction and create insertion point. This is
  // safe if block is well-formed: it always have terminator, otherwise
  // we'll get and assertion.
  BasicBlock::iterator I = BBEntry->begin();
  while (isa<AllocaInst>(I)) ++I;

CastInst *AllocaInsertionPoint = new BitCastInst(
      Constant::getNullValue(Type::getInt32Ty(F.getContext())),
      Type::getInt32Ty(F.getContext()), "reg2mem alloca point", &*I);

// Find the escaped instructions. But don't create stack slots for
  // allocas in entry block.
  std::list<Instruction*> WorkList;
  for (BasicBlock &ibb : F)
    for (BasicBlock::iterator iib = ibb.begin(), iie = ibb.end(); iib != iie;
         ++iib) {
      if (!(isa<AllocaInst>(iib) && iib->getParent() == BBEntry) &&
          valueEscapes(&*iib)) {
        WorkList.push_front(&*iib);
      }
    }

// Demote escaped instructions
  NumRegsDemoted += WorkList.size();
  for (Instruction *ilb : WorkList)
    DemoteRegToStack(*ilb, false, AllocaInsertionPoint);

WorkList.clear();

// Find all phi's
  for (BasicBlock &ibb : F)
    for (BasicBlock::iterator iib = ibb.begin(), iie = ibb.end(); iib != iie;
         ++iib)
      if (isa<PHINode>(iib))
        WorkList.push_front(&*iib);

// Demote phi nodes
  NumPhisDemoted += WorkList.size();
  for (Instruction *ilb : WorkList)
    DemotePHIToStack(cast<PHINode>(ilb), AllocaInsertionPoint);

return true;
}

// createDemoteRegisterToMemory - Provide an entry point to create this pass.
char &llvm::DemoteRegisterToMemoryID = RegToMem::ID;
FunctionPass *llvm::createDemoteRegisterToMemoryPass() {
  return new RegToMem();
}

003 File Manager

Editing: Reg2Mem.cpp

Upload File

Create Folder