OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:phis
(Results
101 - 125
of
161
) sorted by null
1
2
3
4
5
6
7
/external/llvm/test/Transforms/JumpThreading/
phi-eq.ll
5
; returning true if the value part of the operands of two
phis
were identical,
/external/v8/src/arm/
lithium-arm.cc
922
ASSERT(block->
phis
()->length() == 0);
939
// We are at a state join => process
phis
.
943
for (int i = 0; i < block->
phis
()->length(); ++i) {
944
HPhi* phi = block->
phis
()->at(i);
[
all
...]
/external/v8/src/ia32/
lithium-ia32.cc
923
ASSERT(block->
phis
()->length() == 0);
940
// We are at a state join => process
phis
.
944
for (int i = 0; i < block->
phis
()->length(); ++i) {
945
HPhi* phi = block->
phis
()->at(i);
[
all
...]
/external/v8/src/mips/
lithium-mips.cc
922
ASSERT(block->
phis
()->length() == 0);
939
// We are at a state join => process
phis
.
943
for (int i = 0; i < block->
phis
()->length(); ++i) {
944
HPhi* phi = block->
phis
()->at(i);
[
all
...]
/external/v8/src/x64/
lithium-x64.cc
917
ASSERT(block->
phis
()->length() == 0);
934
// We are at a state join => process
phis
.
938
for (int i = 0; i < block->
phis
()->length(); ++i) {
939
HPhi* phi = block->
phis
()->at(i);
[
all
...]
/external/llvm/lib/Transforms/InstCombine/
InstCombineShifts.cpp
170
// get into trouble with cyclic
PHIs
here because we only consider
299
// get into trouble with cyclic
PHIs
here because we only consider
/external/llvm/lib/Transforms/Scalar/
SROA.cpp
[
all
...]
CodeGenPrepare.cpp
53
STATISTIC(NumPHIsElim, "Number of trivial
PHIs
eliminated");
406
// Otherwise, we have multiple predecessors of BB. Update the
PHIs
in DestBB
435
// The
PHIs
are now updated, change everything that refers to BB to use
[
all
...]
/external/llvm/lib/CodeGen/
MachineTraceMetrics.cpp
[
all
...]
MachineCSE.cpp
404
// Heuristics #3: If the common subexpression is used by
PHIs
, do not reuse
/external/llvm/lib/Transforms/Utils/
PromoteMemoryToRegister.cpp
816
// nodes in this block that we are inserting (there could be
phis
before
[
all
...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
lp_state_setup.c
227
* Prefer select to if so we don't have to worry about
phis
or
/external/chromium_org/v8/src/arm/
lithium-arm.cc
795
ASSERT(block->
phis
()->length() == 0);
812
// We are at a state join => process
phis
.
816
for (int i = 0; i < block->
phis
()->length(); ++i) {
817
HPhi* phi = block->
phis
()->at(i);
[
all
...]
/external/chromium_org/v8/src/ia32/
lithium-ia32.cc
850
ASSERT(block->
phis
()->length() == 0);
867
// We are at a state join => process
phis
.
871
for (int i = 0; i < block->
phis
()->length(); ++i) {
872
HPhi* phi = block->
phis
()->at(i);
[
all
...]
/external/llvm/include/llvm/CodeGen/
Passes.h
513
/// OptimizePHIs - This pass optimizes machine instruction
PHIs
/external/llvm/lib/CodeGen/SelectionDAG/
FunctionLoweringInfo.cpp
278
"
PHIs
with non-vector integer types should have a single VT.");
/external/llvm/test/CodeGen/ARM/
coalesce-subregs.ll
146
; Coalesce vector lanes through
phis
.
/external/llvm/test/Instrumentation/MemorySanitizer/
msan_basic.ll
129
; Check that we generate
PHIs
for shadow.
/external/mesa3d/src/gallium/drivers/llvmpipe/
lp_state_setup.c
227
* Prefer select to if so we don't have to worry about
phis
or
/external/v8/src/
flag-definitions.h
164
DEFINE_bool(eliminate_dead_phis, true, "eliminate dead
phis
")
/external/llvm/lib/Transforms/Vectorize/
SLPVectorizer.cpp
558
DEBUG(dbgs() << "SLP: \tWe can schedule
PHIs
:" << *User << ". \n");
[
all
...]
/dalvik/dx/src/com/android/dx/ssa/
EscapeAnalysis.java
338
// Handle
phis
[
all
...]
/dalvik/dx/src/com/android/dx/ssa/back/
FirstFitLocalCombiningAllocator.java
150
if (DEBUG) System.out.println("--->Mapping
phis
");
[
all
...]
/external/dexmaker/src/dx/java/com/android/dx/ssa/
EscapeAnalysis.java
339
// Handle
phis
[
all
...]
/external/dexmaker/src/dx/java/com/android/dx/ssa/back/
FirstFitLocalCombiningAllocator.java
146
if (DEBUG) System.out.println("--->Mapping
phis
");
[
all
...]
Completed in 949 milliseconds
1
2
3
4
5
6
7