HomeSort by relevance Sort by last modified time
    Searched defs:Allocas (Results 1 - 5 of 5) sorted by null

  /external/llvm/lib/Transforms/Utils/
Mem2Reg.cpp 58 std::vector<AllocaInst*> Allocas;
67 Allocas.clear();
69 // Find allocas that are safe to promote, by looking at all instructions in
74 Allocas.push_back(AI);
76 if (Allocas.empty()) break;
78 PromoteMemToReg(Allocas, DT);
79 NumPromoted += Allocas.size();
PromoteMemoryToRegister.cpp 1 //===- PromoteMemoryToRegister.cpp - Convert allocas to registers ---------===//
152 /// blocks multiple times when promoting many allocas in the same block.
160 /// isInterestingInstruction - This code only looks at accesses to allocas.
201 /// Allocas - The alloca instructions being promoted.
203 std::vector<AllocaInst*> Allocas;
211 /// AllocaLookup - Reverse mapping of Allocas.
219 /// PhiToAllocaMap - For each PHI node, keep track of which entry in Allocas
250 : Allocas(A), DT(dt), DIB(0), AST(ast) {}
265 Allocas[AllocaIdx] = Allocas.back()
    [all...]
  /external/llvm/lib/ExecutionEngine/Interpreter/
Interpreter.h 78 AllocaHolderHandle Allocas; // Track memory allocated by alloca
  /external/llvm/lib/CodeGen/
StackColoring.cpp 19 // 2. Merge this pass with StackSlotColoring and allow merging of allocas with
254 // Allocas that start and end within a single block are handled
275 // allocas are live in/out of that block.
463 // Keep a list of *allocas* which need to be remapped.
464 DenseMap<const Value*, const Value*> Allocas;
470 Allocas[From] = To;
498 if (!V || !Allocas.count(V))
501 MMO->setValue(Allocas[V]);
629 // This is a simple greedy algorithm for merging allocas. First, sort the
  /external/llvm/lib/Transforms/Scalar/
ScalarReplAggregates.cpp 55 STATISTIC(NumReplaced, "Number of allocas broken up");
56 STATISTIC(NumPromoted, "Number of allocas promoted");
57 STATISTIC(NumAdjusted, "Number of scalar allocas adjusted to allow promotion");
    [all...]

Completed in 140 milliseconds