| /external/llvm/include/llvm/Transforms/Utils/ |
| SimplifyIndVar.h | 61 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead,
67 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead);
|
| /external/v8/test/unittests/compiler/ |
| dead-code-elimination-unittest.cc | 6 #include "src/compiler/dead-code-elimination.h"
55 // General dead propagation
61 Node* const dead = graph()->NewNode(common()->Dead()); local
62 Node* const node = graph()->NewNode(&kOp0, value, effect, 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()); local
[all...] |
| branch-elimination-unittest.cc | 30 GraphReducer graph_reducer(zone(), graph(), jsgraph.Dead());
|
| common-operator-unittest.cc | 51 SHARED(Dead, Operator::kFoldable, 0, 0, 0, 1, 1, 1),
|
| /external/llvm/lib/CodeGen/ |
| LiveRangeEdit.cpp | 165 SmallVectorImpl<MachineInstr*> &Dead) {
216 Dead.push_back(DefMI);
239 assert(MI->allDefsAreDead() && "Def isn't really dead");
259 DEBUG(dbgs() << "Deleting dead def " << Idx << '\t' << *MI);
335 void LiveRangeEdit::eliminateDeadDefs(SmallVectorImpl<MachineInstr*> &Dead,
340 // Erase all dead defs.
341 while (!Dead.empty())
342 eliminateDeadDef(Dead.pop_back_val(), ToShrink);
347 // Shrink just one live interval. Then delete new dead defs.
350 if (foldAsLoad(LI, Dead))
[all...] |
| 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/include/llvm/CodeGen/ |
| LiveRangeEdit.h | 43 /// Called immediately before erasing a dead machine instruction.
93 bool foldAsLoad(LiveInterval *LI, SmallVectorImpl<MachineInstr*> &Dead);
215 /// eliminateDeadDefs - Try to delete machine instructions that are now dead
217 /// and further dead efs to be eliminated.
221 void eliminateDeadDefs(SmallVectorImpl<MachineInstr*> &Dead,
|
| MachineInstrBuilder.h | 34 Dead = 0x10,
73 flags & RegState::Dead,
398 return B ? RegState::Dead : 0;
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyIndVar.cpp | 58 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);
|
| /external/v8/src/compiler/ |
| js-graph.cc | 237 Node* JSGraph::Dead() {
238 return CACHED(kDead, graph()->NewNode(common()->Dead()));
|
| dead-code-elimination.cc | 5 #include "src/compiler/dead-code-elimination.h"
21 dead_(graph->NewNode(common->Dead())) {}
46 // Skip dead inputs.
53 return Replace(dead());
70 // same time. We consider {Loop}s dead even if only the first control input
71 // is dead.
77 // Skip dead inputs.
93 return Replace(dead());
101 Replace(use, dead());
126 // If {node} has exactly one control input and this is {Dead},
[all...] |
| js-graph.h | 132 // Create a control node that serves as dependency for dead nodes.
133 Node* Dead();
|
| common-operator.h | 162 const Operator* Dead();
|
| js-native-context-specialization.cc | 388 value = effect = control = jsgraph()->Dead();
448 Node* const value = jsgraph()->Dead();
[all...] |
| common-operator-reducer.cc | 47 dead_(graph->NewNode(common->Dead())) {}
109 Replace(use, (decision == Decision::kTrue) ? control : dead());
112 Replace(use, (decision == Decision::kFalse) ? control : dead());
118 return Replace(dead());
143 ReplaceWithValue(node, dead(), effect, control);
151 return Replace(dead());
180 // Mark the {branch} as {Dead}.
182 NodeProperties::ChangeOp(branch, common()->Dead());
234 // Check that the branch is not dead already.
319 // {end} as revisit, because we mark {node} as {Dead} below, which wa
[all...] |
| branch-elimination.cc | 21 dead_(js_graph->graph()->NewNode(js_graph->common()->Dead())) {}
67 Replace(use, known_value ? control_input : dead());
70 Replace(use, known_value ? dead() : control_input);
76 return Replace(dead());
104 ReplaceWithValue(node, dead(), effect, control);
112 return Replace(dead());
|
| loop-peeling.cc | 124 void CopyNodes(Graph* graph, Zone* tmp_zone, Node* dead, NodeRange nodes) {
215 Node* dead = graph->NewNode(common->Dead()); local
223 peeling.CopyNodes(graph, tmp_zone, dead, loop_tree->BodyNodes(loop));
282 peeling.CopyNodes(graph, tmp_zone, dead, exit_range);
|
| osr.cc | 10 #include "src/compiler/dead-code-elimination.h"
47 Zone* tmp_zone, Node* dead,
53 Node* sentinel = graph->NewNode(dead->op());
67 mapping->at(osr_normal_entry->id()) = dead;
68 mapping->at(osr_loop_entry->id()) = dead;
70 // The outer loops are dead in this copy.
74 mapping->at(node->id()) = dead;
75 TRACE(" ---- #%d:%s -> dead (header)\n", node->id(),
229 loop_header->ReplaceUses(dead);
285 Node* dead = jsgraph->Dead() local
[all...] |
| ast-graph-builder.h | 252 // Computes local variable liveness and replaces dead variables in
556 UpdateControlDependency(builder()->jsgraph()->Dead());
|
| js-inlining.cc | 175 ReplaceWithValue(call, call, call, jsgraph_->Dead());
|
| js-intrinsic-lowering.cc | 124 NodeProperties::ChangeOp(node, common()->Dead());
|
| /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/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...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64ConditionalCompares.cpp | 179 /// Check if an operand defining DstReg is dead.
259 // Writes to the zero register are dead.
264 // A virtual register def without any uses will be marked dead later, and
322 // cmp is an alias for subs with a dead destination register.
325 // cmn is an alias for adds with a dead destination register.
599 .addReg(DestReg, RegState::Define | RegState::Dead)
|
