OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Dead
(Results
1 - 7
of
7
) sorted by null
/external/llvm/include/llvm/CodeGen/
MachineInstrBuilder.h
34
Dead
= 0x10,
72
flags & RegState::
Dead
,
398
return B ? RegState::
Dead
: 0;
/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
68
// Only check non-
dead
blocks.
Dead
blocks may have strange pointer
96
INITIALIZE_PASS_BEGIN(DSE, "dse", "
Dead
Store Elimination", false, false)
100
INITIALIZE_PASS_END(DSE, "dse", "
Dead
Store Elimination", false, false)
110
///
dead
, delete them and the computation tree that feeds them.
128
// This instruction is
dead
, zap it, in stages. Start by removing it from
137
// If this operand just became
dead
, add it to the NowDeadInsts list.
259
// Never remove
dead
lifetime_end's, e.g. because it is followed by
[
all
...]
/external/llvm/lib/CodeGen/
RegAllocFast.cpp
643
DEBUG(dbgs() << "Clearing dubious
dead
: " << MO << "\n");
654
DEBUG(dbgs() << "Clearing clean
dead
: " << MO << "\n");
669
bool
Dead
= MO.isDead();
672
return MO.isKill() ||
Dead
;
691
return
Dead
;
[
all
...]
SplitKit.cpp
[
all
...]
MachineInstr.cpp
302
OS << "
dead
";
[
all
...]
/external/llvm/lib/CodeGen/SelectionDAG/
FastISel.cpp
75
STATISTIC(NumFastIselDead, "Number of
dead
insts removed on failure");
332
MachineInstr *
Dead
= &*I;
334
Dead
->eraseFromParent();
[
all
...]
/external/llvm/lib/Transforms/IPO/
GlobalOpt.cpp
196
// If
Dead
[n].first is the only use of a malloc result, we can delete its
197
// chain of computation and the store to the global in
Dead
[n].second.
198
SmallVector<std::pair<Instruction *, Instruction *>, 32>
Dead
;
211
Dead
.push_back(std::make_pair(I, SI));
219
Dead
.push_back(std::make_pair(I, MSI));
228
Dead
.push_back(std::make_pair(I, MTI));
239
Dead
.clear();
246
for (int i = 0, e =
Dead
.size(); i != e; ++i) {
247
if (IsSafeComputationToRemove(
Dead
[i].first, TLI)) {
248
Dead
[i].second->eraseFromParent()
[
all
...]
Completed in 1213 milliseconds