| /external/clang/test/CodeGen/ |
| const-unordered-compare.c | 3 // Checks folding of an unordered comparison
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 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:
|
| 2002-06-24-PHINode.ll | 1 ; -simplifycfg is not folding blocks if there is a PHI node involved. This
|
| 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
|
| PhiEliminate.ll | 2 ; be able to fold PHI nodes into computation in common cases. Folding the PHI
|
| 2003-08-17-FoldSwitch-dbg.ll | 17 ; Test folding all to same dest
32 ; Test folding switch -> branch
|
| /external/llvm/test/Transforms/Reassociate/ |
| subtest.ll | 1 ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
|
| 2002-05-15-SubReassociate.ll | 1 ; With sub reassociation, constant folding can eliminate all of the constants.
|
| 2002-05-15-SubReassociate2.ll | 1 ; With sub reassociation, constant folding can eliminate the two 12 constants.
|
| subtest2.ll | 1 ; With sub reassociation, constant folding can eliminate the uses of %a.
|
| /external/clang/test/CodeGenCXX/ |
| const-base-cast.cpp | 4 // in Firefox, is not misfolded (folding it correctly would be a bonus, but
|
| /external/llvm/test/Transforms/MergeFunc/ |
| fold-weak.ll | 6 ; This test is off for a bit as we change this particular sort of folding to
|
| /external/llvm/test/Assembler/ |
| ConstantExprFoldCast.ll | 11 ; Test folding of binary instrs
|
| /external/llvm/test/Transforms/BranchFolding/ |
| 2007-10-19-InlineAsmDirectives.ll | 3 ;; We don't want branch folding to fold asm directives.
|
| /external/icu4c/common/ |
| unormcmp.cpp | 17 * Depends on both normalization and case folding.
55 * performing the sub-processing (strlen, normalization, case-folding)
84 * (Same for case-folding.)
88 * and case-folding need code points.
94 * and the code point decomposes/case-folds, then the decomposition/folding
105 * Assumption: A decomposition or case-folding result string never contains
108 * decomposition/case-folding boundaries.
112 * first case-folds and then decomposes. This requires that case-folding does not
116 * This requires that case-folding does not un-NFD strings either.
123 * would be a partial NFD before the case folding, which does not work
[all...] |
| /external/llvm/include/llvm/ADT/ |
| FoldingSet.h | 28 /// This folding set used for two purposes:
38 /// Any node that is to be included in the folding set must be a subclass of
43 /// NOTE: That the folding set does not own the nodes and it is the
61 /// To define the folding set itself use the FoldingSet template;
66 /// Four public methods are available to manipulate the folding set;
74 /// Otherwise, the result is the node existing in the folding set, and the
96 /// 4) Finally, if you want to remove a node from the folding set call;
100 /// The result indicates whether the node existed in the folding set.
105 /// FoldingSetImpl - Implements the folding set functionality. The main
121 /// NumNodes - Number of nodes in the folding set. Growth occurs when NumNode
[all...] |
| /external/llvm/lib/VMCore/ |
| ConstantFold.h | 1 //===-- ConstantFolding.h - Internal Constant Folding Interface -*- C++ -*-===//
10 // This file defines the (internal) constant folding interfaces for LLVM. These
|
| /external/llvm/test/Transforms/InstCombine/ |
| bitcast-store.ll | 4 ; folding a bitcast into a store.
|
| /external/icu4c/samples/case/ |
| ucase.c | 9 * Case folding examples, in C
72 /* ustring.h APIs, UChar * string case folding */
|
| /external/v8/test/mjsunit/regress/ |
| regress-406.js | 28 // Test of constant folding of boolean-valued expressions.
47 // Helper function to prevent simple constant folding.
|
| /external/llvm/test/CodeGen/ARM/ |
| ifcvt7.ll | 2 ; FIXME: Need post-ifcvt branch folding to get rid of the extra br at end of BB1.
|
| /external/llvm/test/CodeGen/X86/ |
| 2010-03-05-EFLAGS-Redef.ll | 4 ; branch folding pass. That makes a complete mess of the %EFLAGS liveness, but
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| dont-hoist-simple-loop-constants.ll | 5 ; IV. Don't insert the 1 outside the loop, preventing folding it into the add.
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/byteorder/ |
| swab.h | 14 * make constant-folding work, provide C versions that
51 * versions always use the arch specific code (constant folding
140 * Allow constant folding
|
| /external/bison/src/ |
| vcg.h | 177 hidden by folding or edge classes) does not have fixed specified
228 /* folding specifies the default folding of the nodes. The folding k
232 no folding is specified for a node, then the node may be folded if
233 it is in the region of another node that starts the folding. If
234 folding 0 is specified, then the node is never folded. In this case
235 the folding stops at the predecessors of this node, if it is
236 reachable from another folding node. The summary node inherits some
237 attributes from the original node which starts the folding (al
246 int folding; member in struct:node
523 int folding; member in struct:graph
[all...] |
