Home
last modified time | relevance | path

Searched refs:fold (Results 1 – 25 of 229) sorted by relevance

12345678910

/external/v8/test/mjsunit/es6/
Diteration-semantics.js80 function fold(cons, seed, iterable) { function
176 assertEquals(45, fold(sum, 0, integers_until(10)));
178 assertEquals([1, 2, 3], fold(append, [], values(1, 2, 3)));
180 assertEquals(45, fold(sum, 0, take(integers_from(0), 10)));
182 assertEquals(90, fold(sum, 0, take(skip_every(integers_from(0), 2), 10)));
192 fold(append, [],
204 fold(append, [],
208 fold(append, [],
228 fold(sum, 0, remove_next_after(integers_until(10), 10)));
231 fold(sum, 0, poison_next_after(integers_until(10), 10)));
[all …]
/external/llvm/test/Analysis/ScalarEvolution/
Dlatch-dominating-conditions.ll41 %does.not.fold.to.true = icmp slt i8 %idx, 42
42 ; CHECK: call void @side_effect(i1 %does.not.fold.to.true)
43 call void @side_effect(i1 %does.not.fold.to.true)
48 ; CHECK: call void @side_effect(i1 %does.not.fold.to.true)
49 call void @side_effect(i1 %does.not.fold.to.true)
/external/llvm/test/Transforms/ConstProp/
Dcalls.ll73 ; Shouldn't fold because of -fno-builtin
81 ; Shouldn't fold because of -fno-builtin
89 ; Shouldn't fold because of -fno-builtin
98 ; Shouldn't fold because of -fno-builtin
107 ; Shouldn't fold because of -fno-builtin
115 ; Shouldn't fold because of -fno-builtin
124 ; Shouldn't fold because of -fno-builtin
133 ; Shouldn't fold because of -fno-builtin
142 ; Shouldn't fold because of -fno-builtin
/external/llvm/test/Transforms/CodeGenPrepare/
Dbasic.ll7 ; objectsize should fold to a constant, which causes the branch to fold to an
8 ; uncond branch. Next, we fold the control flow alltogether.
/external/llvm/test/Assembler/
DConstantExprFoldCast.ll1 ; This test checks to make sure that constant exprs fold in some simple situations
6 @A = global i32* bitcast (i8* null to i32*) ; Cast null -> fold
7 @B = global i32** bitcast (i32** @A to i32**) ; Cast to same type -> fold
DConstantExprNoFold.ll1 ; This test checks to make sure that constant exprs don't fold in some simple
13 ; Don't fold this. @A might really be allocated next to @B, in which case the
20 ; Don't fold this completely away either. In theory this could be simplified
/external/llvm/test/CodeGen/AArch64/
Dfast-isel-folding.ll3 ; Test that we don't fold the shift.
17 ; Test that we don't fold the sign-extend.
31 ; Test that we don't fold the sign-extend.
/external/llvm/test/CodeGen/R600/
Doperand-folding.ll5 define void @fold_sgpr(i32 addrspace(1)* %out, i32 %fold) {
7 %tmp0 = icmp ne i32 %fold, 0
12 %offset = add i32 %fold, %id
25 %fold = add i32 3, 2
31 %val = or i32 %id, %fold
/external/llvm/test/Transforms/InstCombine/
Dfold-calls.ll3 ; This shouldn't fold, because sin(inf) is invalid.
11 ; This should fold.
D2004-02-23-ShiftShiftOverflow.ll4 ; Do not fold into shr X, 34, as this uses undefined behavior!
11 ; Do not fold into shl X, 34, as this uses undefined behavior!
Dfold-sqrt-sqrtf.ll4 ; Instcombine tries to fold (fptrunc (sqrt (fpext x))) -> (sqrtf x), but this
5 ; shouldn't fold when sqrtf isn't available.
Dsitofp.ll115 ; This can't fold because the 25-bit input doesn't fit in the mantissa.
145 ; This can fold because the 25-bit input is signed and we disard the sign bit.
154 ; This can't fold because the 26-bit input won't fit the mantissa
165 ; This can fold because the 54-bit output is signed and we disard the sign bit.
174 ; This can't fold because the 55-bit output won't fit the mantissa
/external/opencv/ml/src/
Dmlestimate.cpp108 int k, fold;
115 fold = ++crVal->current_fold;
117 if (fold >= crVal->folds_all)
119 if (fold == crVal->folds_all)
127 k = crVal->folds[fold + 1] - crVal->folds[fold];
128 crVal->sampleIdxTrain->data.i = crVal->sampleIdxAll + crVal->folds[fold + 1];
130 crVal->sampleIdxEval->data.i = crVal->sampleIdxAll + crVal->folds[fold];
/external/llvm/test/CodeGen/X86/
D2005-01-17-CycleInDAG.ll1 ; This testcase was distilled from 132.ijpeg. Bsaically we cannot fold the
4 ; that we do not fold the load into the sub.
Dand-or-fold.ll4 ; The dag combiner should fold together (x&127)|(y&16711680) -> (x|y)&c1
17 ; <rdar://problem/7529774> The optimizer shouldn't fold this into (and (or, C), D)
Ddagcombine-shifts.ll3 ; fold (shl (zext (lshr (A, X))), X) -> (zext (shl (lshr (A, X)), X))
7 ; This will help DAGCombiner to identify and then fold the sequence
96 ; Don't fold the pattern if we use arithmetic shifts.
137 ; Don't fold the pattern if there is more than one use of the
190 ; Verify also that we correctly fold the shl-shr sequence into an
Dlower-bitcast.ll11 ; FIXME: Ideally we should be able to fold the entire body of @test1 into a
72 ; Ideally, we should fold that sequence into a single paddd. This is fixed with
109 ; FIXME: Ideally we should be able to fold the entire body of @test6 into a
152 ; FIXME: Ideally we should be able to fold the entire body of @test8 into a
Dnarrow-shl-load.ll6 ; DAGCombiner should fold this code in finite time.
33 ; DAG Combiner can't fold this into a load of the 1'th byte.
Dlogical-load-fold.ll4 ; Although we have the ability to fold an unaligned load with AVX
6 ; can not fold the load under any circumstances in these test
Dstack-align.ll4 ; are required to read in extra bytes of memory in order to fold the
6 ; so don't fold the load.
/external/llvm/test/CodeGen/ARM/
D2012-03-26-FoldImmBug.ll5 ; fold the immediate by breaking it into two parts and fold them into the
/external/llvm/test/Transforms/InstSimplify/
Dfast-math.ll55 ; Dont fold this
79 ; Dont fold
97 ; Dont fold
/external/llvm/test/Transforms/LoopStrengthReduce/X86/
Dno_superflous_induction_vars.ll33 %fold = add i64 %1, 1
34 %n.mod.vf = and i64 %fold, 7
/external/llvm/test/Transforms/IndVarSimplify/
Div-fold.ll5 ; Indvars should be able to fold IV increments into shr when low bits are zero.
31 ; Invdars should not fold an increment into shr unless 2^shiftBits is
/external/llvm/test/Analysis/CostModel/ARM/
Dgep.ll19 ; Cost of scalar floating point geps should be one. We cannot fold the address
27 ; Cost of vector geps should be one. We cannot fold the address computation.

12345678910