HomeSort by relevance Sort by last modified time
    Searched full:folding (Results 1 - 25 of 629) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /art/test/442-checker-constant-folding/
info.txt 1 Tests constant folding in the optimizing compiler.
  /external/clang/test/CodeGen/
const-unordered-compare.c 3 // Checks folding of an unordered comparison
  /development/samples/devbytes/graphics/FoldingLayout/src/com/example/android/foldinglayout/
OnFoldListener.java 20 * This interface listens for when the folding layout begins folding (enters
21 * a folded state from a completely unfolded state), or ends folding (enters a
  /system/core/libmemunreachable/tests/
LeakFolding_test.cpp 52 LeakFolding folding(heap_, heap_walker);
54 ASSERT_TRUE(folding.FoldLeaks());
59 ASSERT_EQ(true, folding.Leaked(leaked, &num_leaks, &leaked_bytes));
77 LeakFolding folding(heap_, heap_walker);
79 ASSERT_TRUE(folding.FoldLeaks());
84 ASSERT_EQ(true, folding.Leaked(leaked, &num_leaks, &leaked_bytes));
106 LeakFolding folding(heap_, heap_walker);
108 ASSERT_TRUE(folding.FoldLeaks());
113 ASSERT_EQ(true, folding.Leaked(leaked, &num_leaks, &leaked_bytes));
137 LeakFolding folding(heap_, heap_walker)
    [all...]
  /external/v8/test/mjsunit/regress/
regress-crbug-347903.js 5 // Flags: --allow-natives-syntax --use-allocation-folding --verify-heap
9 // Allocation folding will bail out trying to fold the elements alloc of
regress-484544.js 5 // Flags: --nouse-allocation-folding --stress-compaction --predictable
  /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:
2003-08-17-FoldSwitch.ll 5 ; Test normal folding
25 ; Test folding to default dest
45 ; Test folding all to same dest
59 ; Test folding switch -> branch
PHINode.ll 1 ; -simplifycfg is not folding blocks if there is a PHI node involved. This
  /external/clang/test/CodeGenCXX/
switch-case-folding-1.cpp 6 // Make sure we don't crash when constant folding the case 4
switch-case-folding.cpp 6 // Make sure we don't crash when constant folding the case 4
  /external/llvm/test/Bindings/llvm-c/
calc.test 3 ; constant folding
  /external/llvm/test/CodeGen/X86/
fold-vector-bv-crash.ll 6 ; truncation bug from constant folding after legalization.
  /external/clang/test/SemaCXX/
gnu-flags.cpp 11 // RUN: -Wgnu-flexible-array-union-member -Wgnu-folding-constant \
15 // RUN: -Wgnu-flexible-array-union-member -Wgnu-folding-constant \
19 // RUN: -Wgnu-flexible-array-union-member -Wgnu-folding-constant \
24 // RUN: -Wno-gnu-flexible-array-union-member -Wno-gnu-folding-constant \
28 // RUN: -Wno-gnu-flexible-array-union-member -Wno-gnu-folding-constant \
32 // RUN: -Wno-gnu-flexible-array-union-member -Wno-gnu-folding-constant \
39 // %clang_cc1 -fsyntax-only -verify %s -DFOLDINGCONSTANT -Wno-gnu -Wgnu-folding-constant
87 // expected-warning@+4 {{in-class initializer for static data member is not a constant expression; folding it to a constant is a GNU extension}}
  /external/llvm/test/Transforms/Reassociate/
2002-05-15-SubReassociate.ll 3 ; With sub reassociation, constant folding can eliminate all of the constants.
16 ; With sub reassociation, constant folding can eliminate the two 12 constants.
subtest.ll 3 ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
15 ; With sub reassociation, constant folding can eliminate the uses of %a.
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
flag-types.h 169 folding (x + CONSTANT > x) to 1. */
171 /* Overflow warning about folding a comparison to a constant because
173 WARN_STRICT_OVERFLOW_ALL. Example: folding (abs (x) >= 0) to 1
176 /* Overflow warning about changes to comparisons other than folding
177 them to a constant. Example: folding (x + 1 > 1) to (x > 0). */
180 folding ((x * 10) / 5) to (x * 2). */
183 comparison. Example: folding (x + 2 > y) to (x + 1 >= y). */
  /external/regex-re2/re2/
unicode_casefold.h 5 // Unicode case folding tables.
7 // The Unicode case folding tables encode the mapping from one Unicode point
8 // to the next largest Unicode point with equivalent folding. The largest
  /external/llvm/include/llvm/ADT/
FoldingSet.h 26 /// This folding set used for two purposes:
36 /// Any node that is to be included in the folding set must be a subclass of
41 /// NOTE: That the folding set does not own the nodes and it is the
59 /// To define the folding set itself use the FoldingSet template;
64 /// Four public methods are available to manipulate the folding set;
72 /// Otherwise, the result is the node existing in the folding set, and the
94 /// 4) Finally, if you want to remove a node from the folding set call;
98 /// The result indicates whether the node existed in the folding set.
103 /// FoldingSetImpl - Implements the folding set functionality. The main
121 /// NumNodes - Number of nodes in the folding set. Growth occurs when NumNode
    [all...]
  /external/llvm/test/CodeGen/ARM/
v1-constant-fold.ll 3 ; PR15611. Check that we don't crash when constant folding v1i32 types.
  /external/llvm/test/Transforms/BranchFolding/
2007-10-19-InlineAsmDirectives.ll 4 ;; We don't want branch folding to fold asm directives.
  /external/v8/test/mjsunit/
allocation-folding.js 30 // Test loop barrier when folding allocations.
49 // Test allocation folding of doubles.
65 // Test allocation folding of doubles into non-doubles.
81 // Test allocation folding over a branch.
  /frameworks/compile/mclinker/include/mcld/LD/
DiagLayouts.inc 33 "ICF folding section `%0' of `%1' into `%2' of `%3'",
34 "ICF folding section `%0' of `%1' into `%2' of `%3'")
  /external/clang/test/Analysis/
comparison-implicit-casts.cpp 13 // This is not directly related to additive folding, but we use SValBuilder's
14 // additive folding to tickle the bug. ExprEngine will simplify fully-constrained
16 // SymExpr (e.g. with additive folding) or (b) generated by a checker (e.g.
35 // Constant-folding will turn (local+1) back into the symbol for x.
55 // Constant-folding will turn (local+1) back into the symbol for x.
  /external/icu/icu4c/source/common/
unormcmp.cpp 17 * Depends on both normalization and case folding.
53 * performing the sub-processing (strlen, normalization, case-folding)
82 * (Same for case-folding.)
86 * and case-folding need code points.
92 * and the code point decomposes/case-folds, then the decomposition/folding
103 * Assumption: A decomposition or case-folding result string never contains
106 * decomposition/case-folding boundaries.
110 * first case-folds and then decomposes. This requires that case-folding does not
114 * This requires that case-folding does not un-NFD strings either.
121 * would be a partial NFD before the case folding, which does not work
    [all...]

Completed in 762 milliseconds

1 2 3 4 5 6 7 8 91011>>