Searched refs:Dead (Results 1 - 25 of 39) sorted by relevance

12

/external/llvm/include/llvm/Transforms/Utils/
H A DSimplifyIndVar.h61 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead,
67 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead);
/external/v8/test/unittests/compiler/
H A Ddead-code-elimination-unittest.cc61 Node* const dead = graph()->NewNode(common()->Dead());
79 graph()->NewNode(common()->Dead())));
92 graph()->NewNode(common()->IfTrue(), graph()->NewNode(common()->Dead())));
104 common()->IfFalse(), graph()->NewNode(common()->Dead())));
116 common()->IfSuccess(), graph()->NewNode(common()->Dead())));
132 graph()->NewNode(common()->Dead())));
144 Node* const dead = graph()->NewNode(common()->Dead());
156 inputs[i] = graph()->NewNode(common()->Dead());
174 inputs[i] = graph()->NewNode(common()->Dead());
189 Node* const c1 = graph()->NewNode(common()->Dead());
[all...]
H A Dbranch-elimination-unittest.cc30 GraphReducer graph_reducer(zone(), graph(), jsgraph.Dead());
H A Dcommon-operator-unittest.cc51 SHARED(Dead, Operator::kFoldable, 0, 0, 0, 1, 1, 1),
/external/llvm/lib/CodeGen/
H A DLiveRangeEdit.cpp165 SmallVectorImpl<MachineInstr*> &Dead) {
216 Dead.push_back(DefMI);
335 void LiveRangeEdit::eliminateDeadDefs(SmallVectorImpl<MachineInstr*> &Dead, argument
341 while (!Dead.empty())
342 eliminateDeadDef(Dead.pop_back_val(), ToShrink);
350 if (foldAsLoad(LI, Dead))
355 if (!LIS.shrinkToUses(LI, &Dead))
164 foldAsLoad(LiveInterval *LI, SmallVectorImpl<MachineInstr*> &Dead) argument
H A DRegAllocFast.cpp676 bool Dead = MO.isDead(); local
679 return MO.isKill() || Dead;
698 return Dead;
H A DSplitKit.cpp999 SmallVector<MachineInstr*, 8> Dead; local
1003 // Dead defs end at the dead slot.
1014 Dead.push_back(MI);
1018 if (Dead.empty())
1021 Edit->eliminateDeadDefs(Dead);
/external/llvm/include/llvm/CodeGen/
H A DLiveRangeEdit.h93 bool foldAsLoad(LiveInterval *LI, SmallVectorImpl<MachineInstr*> &Dead);
221 void eliminateDeadDefs(SmallVectorImpl<MachineInstr*> &Dead,
H A DMachineInstrBuilder.h34 Dead = 0x10, enumerator in enum:llvm::RegState::__anon11496
73 flags & RegState::Dead,
398 return B ? RegState::Dead : 0;
/external/llvm/lib/Transforms/Utils/
H A DSimplifyIndVar.cpp58 LoopInfo *LI,SmallVectorImpl<WeakVH> &Dead)
59 : L(Loop), LI(LI), SE(SE), DT(DT), DeadInsts(Dead), Changed(false) {
598 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead,
600 SimplifyIndvar SIV(LI->getLoopFor(CurrIV->getParent()), SE, DT, LI, Dead);
608 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead) {
611 Changed |= simplifyUsersOfIV(cast<PHINode>(I), SE, DT, LI, Dead);
57 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, DominatorTree *DT, LoopInfo *LI,SmallVectorImpl<WeakVH> &Dead) argument
597 simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT, LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead, IVVisitor *V) argument
607 simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT, LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead) argument
/external/v8/src/compiler/
H A Djs-graph.cc195 Node* JSGraph::Dead() { function in class:v8::internal::compiler::JSGraph
196 return CACHED(kDead, graph()->NewNode(common()->Dead()));
H A Ddead-code-elimination.cc21 dead_(graph->NewNode(common->Dead())) {}
126 // If {node} has exactly one control input and this is {Dead},
127 // replace {node} with {Dead}.
H A Djs-graph.h122 Node* Dead();
H A Dbranch-elimination.cc20 dead_(js_graph->graph()->NewNode(js_graph->common()->Dead())) {}
H A Dcommon-operator.h128 const Operator* Dead();
H A Dcommon-operator-reducer.cc53 dead_(graph->NewNode(common->Dead())) {}
153 // Mark the {branch} as {Dead}.
155 NodeProperties::ChangeOp(branch, common()->Dead());
292 // {end} as revisit, because we mark {node} as {Dead} below, which was
H A Djs-native-context-specialization.cc425 value = effect = control = jsgraph()->Dead();
449 Node* const value = jsgraph()->Dead();
857 value = effect = control = jsgraph()->Dead();
928 Node* const value = jsgraph()->Dead();
H A Dloop-peeling.cc215 Node* dead = graph->NewNode(common->Dead());
H A Dopcodes.h62 V(Dead)
H A Dosr.cc285 Node* dead = jsgraph->Dead();
292 // Replace the normal entry with {Dead} and the loop entry with {Start}
H A Dast-graph-builder.h538 UpdateControlDependency(builder()->jsgraph()->Dead());
H A Djs-inlining.cc234 ReplaceWithValue(call, call, call, jsgraph_->Dead());
/external/llvm/lib/Transforms/Scalar/
H A DDeadStoreElimination.cpp1 //===- DeadStoreElimination.cpp - Fast Dead Store Elimination -------------===//
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)
592 DEBUG(dbgs() << "DSE: Remove Dead Store:\n DEAD: "
618 DEBUG(dbgs() << "DSE: Remove Dead Store:\n OW END: "
839 Instruction *Dead = &*BBI++; local
841 DEBUG(dbgs() << "DSE: Dead Store at End of Block:\n DEAD: "
842 << *Dead << "\n Objects: ";
852 DeleteDeadInstruction(Dead, *M
[all...]
/external/llvm/lib/Transforms/IPO/
H A DGlobalOpt.cpp201 // 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; local
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[
[all...]
/external/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp599 .addReg(DestReg, RegState::Define | RegState::Dead)

Completed in 3461 milliseconds

12