Searched refs:folding (Results 1 – 25 of 70) sorted by relevance
123
/external/llvm/test/Transforms/SimplifyCFG/ |
D | PhiEliminate3.ll | 2 ; with various folding thresholds 4 ; RUN: opt < %s -simplifycfg -S -phi-node-folding-threshold=1 | grep N: 5 ; RUN: opt < %s -simplifycfg -S -phi-node-folding-threshold=2 | not grep N: 6 ; RUN: opt < %s -simplifycfg -S -phi-node-folding-threshold=2 | grep M: 7 ; RUN: opt < %s -simplifycfg -S -phi-node-folding-threshold=7 | not grep M:
|
D | 2003-08-17-FoldSwitch.ll | 4 ; Test normal folding 24 ; Test folding to default dest 44 ; Test folding all to same dest 58 ; Test folding switch -> branch
|
D | 2003-08-17-FoldSwitch-dbg.ll | 17 ; Test folding all to same dest 32 ; Test folding switch -> branch
|
D | 2002-06-24-PHINode.ll | 1 ; -simplifycfg is not folding blocks if there is a PHI node involved. This
|
D | switch-on-const-select.ll | 3 ; Test basic folding to a conditional branch. 33 ; Test basic folding to an unconditional branch.
|
D | SpeculativeExec.ll | 1 ; RUN: opt < %s -simplifycfg -phi-node-folding-threshold=2 -S | FileCheck %s
|
/external/llvm/test/Transforms/Reassociate/ |
D | subtest.ll | 1 ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
|
D | subtest2.ll | 1 ; With sub reassociation, constant folding can eliminate the uses of %a.
|
D | 2002-05-15-SubReassociate.ll | 1 ; With sub reassociation, constant folding can eliminate all of the constants.
|
D | 2002-05-15-SubReassociate2.ll | 1 ; With sub reassociation, constant folding can eliminate the two 12 constants.
|
/external/bison/src/ |
D | vcg.h | 246 int folding; member 523 int folding; member
|
D | vcg.c | 62 g->folding = G_FOLDING; in new_graph() 155 n->folding = N_FOLDING; /* No explicit default value. */ in new_node() 544 if (n->folding != N_FOLDING) in output_node() 545 fprintf (fout, "\t\tfolding:\t%d\n", n->folding); in output_node() 663 if (g->folding != G_FOLDING) in output_graph() 664 fprintf (fout, "\tfolding:\t%d\n", g->folding); in output_graph()
|
/external/llvm/test/Transforms/MergeFunc/ |
D | fold-weak.ll | 6 ; This test is off for a bit as we change this particular sort of folding to
|
/external/llvm/test/Transforms/InstCombine/ |
D | bitcast-store.ll | 4 ; folding a bitcast into a store.
|
D | 2009-01-19-fmod-constant-float.ll | 3 ; check constant folding for 'frem'. PR 3316.
|
/external/llvm/test/Transforms/BranchFolding/ |
D | 2007-10-19-InlineAsmDirectives.ll | 3 ;; We don't want branch folding to fold asm directives.
|
/external/llvm/test/Assembler/ |
D | ConstantExprFoldCast.ll | 11 ; Test folding of binary instrs
|
/external/llvm/test/Transforms/LoopStrengthReduce/ |
D | dont-hoist-simple-loop-constants.ll | 5 ; IV. Don't insert the 1 outside the loop, preventing folding it into the add.
|
/external/llvm/test/CodeGen/X86/ |
D | 2010-03-05-EFLAGS-Redef.ll | 4 ; branch folding pass. That makes a complete mess of the %EFLAGS liveness, but
|
D | fold-xmm-zero.ll | 3 ; Simple test to make sure folding for special constants (like float zero)
|
/external/llvm/test/CodeGen/ARM/ |
D | ifcvt7.ll | 2 ; FIXME: Need post-ifcvt branch folding to get rid of the extra br at end of BB1.
|
D | vector-DAGCombine.ll | 64 ; Test folding a binary vector operation with constant BUILD_VECTOR 127 ; constant folding the multiply because the "sext undef" was translated to
|
/external/llvm/lib/Target/MSP430/ |
D | README.txt | 40 11. Implement hooks for better memory op folding, etc.
|
/external/llvm/lib/Target/X86/ |
D | README-FPStack.txt | 64 folding spill code into the instructions.
|
/external/llvm/test/Transforms/JumpThreading/ |
D | indirectbr.ll | 44 ; Check constant folding of indirectbr
|
123