OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:PHIs
(Results
1 - 6
of
6
) sorted by null
/external/llvm/lib/Transforms/Utils/
BasicBlockUtils.cpp
98
// Recursively deleting a PHI may cause multiple
PHIs
to be deleted
99
// or RAUW'd undef, so use an array of WeakVH for the
PHIs
to delete.
100
SmallVector<WeakVH, 8>
PHIs
;
103
PHIs
.push_back(PN);
106
for (unsigned i = 0, e =
PHIs
.size(); i != e; ++i)
107
if (PHINode *PN = dyn_cast_or_null<PHINode>(
PHIs
[i].operator Value*()))
149
// Begin by getting rid of unneeded
PHIs
.
SimplifyCFG.cpp
[
all
...]
/external/llvm/lib/CodeGen/
InlineSpiller.cpp
439
// dominated,
phis
need checking.
508
// Stop at original
PHIs
. We don't know the value at the predecessors.
519
// expensive if there are many predecessors and many more
PHIs
as
526
// Separate all values dominated by OrigVNI into
PHIs
and non-
PHIs
.
527
SmallVector<VNInfo*, 8>
PHIs
, NonPHIs;
540
PHIs
.push_back(VNI2);
544
DEBUG(dbgs() << "split phi value, checking " <<
PHIs
.size()
548
// Create entries for all the
PHIs
. Don't add them to the worklist, we
550
for (unsigned i = 0, e =
PHIs
.size(); i != e; ++i
[
all
...]
/external/llvm/lib/Analysis/
ValueTracking.cpp
[
all
...]
/external/llvm/lib/Transforms/IPO/
GlobalOpt.cpp
634
/// value will trap if the value is dynamically null.
PHIs
keeps track of any
637
SmallPtrSet<const PHINode*, 8> &
PHIs
) {
660
if (!AllUsesOfValueWillTrapIfNull(CI,
PHIs
)) return false;
662
if (!AllUsesOfValueWillTrapIfNull(GEPI,
PHIs
)) return false;
666
if (
PHIs
.insert(PN) && !AllUsesOfValueWillTrapIfNull(PN,
PHIs
))
688
SmallPtrSet<const PHINode*, 8>
PHIs
;
689
if (!AllUsesOfValueWillTrapIfNull(LI,
PHIs
))
[
all
...]
/external/llvm/lib/Transforms/Scalar/
IndVarSimplify.cpp
146
// because it understands lcssa
phis
while SCEV does not.
446
SmallVector<WeakVH, 8>
PHIs
;
449
PHIs
.push_back(PN);
451
for (unsigned i = 0, e =
PHIs
.size(); i != e; ++i)
452
if (PHINode *PN = dyn_cast_or_null<PHINode>(&*
PHIs
[i]))
[
all
...]
Completed in 87 milliseconds