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

  /external/v8/src/compiler/
js-graph.cc 195 Node* JSGraph::Dead() {
196 return CACHED(kDead, graph()->NewNode(common()->Dead()));
  /external/llvm/include/llvm/CodeGen/
MachineInstrBuilder.h 34 Dead = 0x10,
73 flags & RegState::Dead,
398 return B ? RegState::Dead : 0;
  /external/llvm/lib/CodeGen/
RegAllocFast.cpp 650 DEBUG(dbgs() << "Clearing dubious dead: " << MO << "\n");
661 DEBUG(dbgs() << "Clearing clean dead: " << MO << "\n");
676 bool Dead = MO.isDead();
679 return MO.isKill() || Dead;
698 return Dead;
    [all...]
SplitKit.cpp     [all...]
  /external/llvm/lib/Transforms/Scalar/
DeadStoreElimination.cpp 1 //===- DeadStoreElimination.cpp - Fast Dead Store Elimination -------------===//
10 // This file implements a trivial dead store elimination that only considers
71 // Only check non-dead blocks. Dead blocks may have strange pointer
102 INITIALIZE_PASS_BEGIN(DSE, "dse", "Dead Store Elimination", false, false)
108 INITIALIZE_PASS_END(DSE, "dse", "Dead Store Elimination", false, false)
118 /// dead, delete them and the computation tree that feeds them.
136 // This instruction is dead, zap it, in stages. Start by removing it from
145 // If this operand just became dead, add it to the NowDeadInsts list.
256 // Never remove dead lifetime_end's, e.g. because it is followed by
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
FastISel.cpp 79 STATISTIC(NumFastIselDead, "Number of dead insts removed on failure");
356 MachineInstr *Dead = &*I;
358 Dead->eraseFromParent();
    [all...]
  /external/llvm/lib/Transforms/IPO/
GlobalOpt.cpp 201 // If Dead[n].first is the only use of a malloc result, we can delete its
202 // chain of computation and the store to the global in Dead[n].second.
203 SmallVector<std::pair<Instruction *, Instruction *>, 32> Dead;
216 Dead.push_back(std::make_pair(I, SI));
224 Dead.push_back(std::make_pair(I, MSI));
233 Dead.push_back(std::make_pair(I, MTI));
244 Dead.clear();
251 for (int i = 0, e = Dead.size(); i != e; ++i) {
252 if (IsSafeComputationToRemove(Dead[i].first, TLI)) {
253 Dead[i].second->eraseFromParent()
    [all...]

Completed in 199 milliseconds