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

1 2 3 4 5 6 7 8 91011>>

  /external/llvm/test/CodeGen/Generic/
assume.ll 4 call void @llvm.assume(i1 1)
8 declare void @llvm.assume(i1) nounwind
  /art/test/530-checker-regression-reftype-final/
info.txt 1 Regression test for optimizing that used assume that array types are always exact.
  /external/llvm/test/Transforms/SimplifyCFG/
assume.ll 4 call void @llvm.assume(i1 0)
8 ; CHECK-NOT: llvm.assume
13 call void @llvm.assume(i1 undef)
17 ; CHECK-NOT: llvm.assume
21 declare void @llvm.assume(i1) nounwind
  /external/llvm/test/Transforms/InstSimplify/
assume.ll 4 call void @llvm.assume(i1 1)
8 ; CHECK-NOT: llvm.assume
12 declare void @llvm.assume(i1) nounwind
  /external/llvm/test/Transforms/InstCombine/
pr23809.ll 3 ; InstCombine should preserve the call to @llvm.assume.
8 call void @llvm.assume(i1 %1)
9 ; CHECK: call void @llvm.assume
17 call void @llvm.assume(i1 %1)
18 ; CHECK: call void @llvm.assume
22 declare void @llvm.assume(i1)
assume.ll 10 ; Check that the alignment has been upgraded and that the assume has not
14 ; CHECK-DAG: call void @llvm.assume
20 tail call void @llvm.assume(i1 %maskcond)
28 ; Same check as in @foo1, but make sure it works if the assume is first too.
31 ; CHECK-DAG: call void @llvm.assume
37 tail call void @llvm.assume(i1 %maskcond)
44 declare void @llvm.assume(i1) #1
50 ; CHECK: call void @llvm.assume
54 tail call void @llvm.assume(i1 %cmp)
63 tail call void @llvm.assume(i1 %and
    [all...]
assume2.ll 6 declare void @llvm.assume(i1) #1
12 ; CHECK: call void @llvm.assume
17 tail call void @llvm.assume(i1 %cmp)
27 ; CHECK: call void @llvm.assume
33 tail call void @llvm.assume(i1 %cmp)
43 ; CHECK: call void @llvm.assume
48 tail call void @llvm.assume(i1 %cmp)
58 ; CHECK: call void @llvm.assume
64 tail call void @llvm.assume(i1 %cmp)
74 ; CHECK: call void @llvm.assume
    [all...]
assume-redundant.ll 14 ; CHECK: call void @llvm.assume
15 ; CHECK-NOT: call void @llvm.assume
27 tail call void @llvm.assume(i1 %maskcond)
31 tail call void @llvm.assume(i1 %maskcond)
35 tail call void @llvm.assume(i1 %maskcond)
39 tail call void @llvm.assume(i1 %maskcond)
52 ; Check that redundant align assume is removed
54 ; CHECK-NOT: call void @llvm.assume
60 call void @llvm.assume(i1 %maskcond)
64 ; Check that redundant align assume is remove
    [all...]
pr21891.ll 6 call void @llvm.assume(i1 %cmp)
18 declare void @llvm.assume(i1)
ctpop.ll 5 declare void @llvm.assume(i1)
28 ;; Use an assume to make all the bits known without triggering constant
31 %assume = icmp eq i32 %arg, 0
32 call void @llvm.assume(i1 %assume)
  /art/test/574-irreducible-and-constant-area/
info.txt 1 Regression test for intrinsics on x86, which used to wrongly assume
  /external/llvm/test/Transforms/LoopVectorize/X86/
assume.ll 12 ; CHECK: @llvm.assume
13 ; CHECK: @llvm.assume
14 ; CHECK: @llvm.assume
15 ; CHECK: @llvm.assume
16 ; CHECK: @llvm.assume
17 ; CHECK: @llvm.assume
18 ; CHECK: @llvm.assume
19 ; CHECK: @llvm.assume
28 tail call void @llvm.assume(i1 %cmp1)
41 declare void @llvm.assume(i1) #
    [all...]
  /external/llvm/test/Analysis/AssumptionCache/
basic.ll 5 declare void @llvm.assume(i1)
15 call void @llvm.assume(i1 %cond1)
17 call void @llvm.assume(i1 %cond2)
19 call void @llvm.assume(i1 %cond3)
  /external/llvm/test/Transforms/Inline/
inline-indirect.ll 4 declare void @llvm.assume(i1)
11 call void @llvm.assume(i1 true)
  /external/llvm/test/Transforms/JumpThreading/
assume-edge-dom.ll 4 declare void @llvm.assume(i1)
17 tail call void @llvm.assume(i1 %a)
22 tail call void @llvm.assume(i1 %b)
25 ; An assume that can be used to simplify this comparison dominates each
26 ; predecessor branch (although no assume dominates the cmp itself). Make sure
  /external/clang/test/Format/
language-detection.cpp 2 // RUN: | clang-format -style=llvm -assume-filename=foo.js \
5 // RUN: | clang-format -style=llvm -assume-filename=foo.cpp \
  /external/llvm/test/Analysis/ValueTracking/
assume.ll 8 call void @llvm.assume(i1 %2)
14 declare void @llvm.assume(i1)
  /external/llvm/test/Transforms/GlobalOpt/
assume.ll 17 call void @llvm.assume(i1 %cmp)
21 declare void @llvm.assume(i1)
  /external/testng/src/test/java/test/junit4/
JUnit4Sample2.java 4 import org.junit.Assume;
38 Assume.assumeTrue(false);
  /external/clang/test/CodeGen/
align_value.cpp 19 // CHECK: call void @llvm.assume(i1 [[MASKCOND1]])
29 // CHECK: call void @llvm.assume(i1 [[MASKCOND2]])
39 // CHECK: call void @llvm.assume(i1 [[MASKCOND3]])
49 // CHECK: call void @llvm.assume(i1 [[MASKCOND4]])
59 // CHECK: call void @llvm.assume(i1 [[MASKCOND5]])
70 // CHECK: call void @llvm.assume(i1 [[MASKCOND6]])
77 // CHECK-NOT: call void @llvm.assume
83 // CHECK-NOT: call void @llvm.assume
89 // CHECK-NOT: call void @llvm.assume
95 // CHECK-NOT: call void @llvm.assume
    [all...]
builtin-assume.c 13 // CHECK: call void @llvm.assume(i1 [[CMP]])
17 // CHECK: call void @llvm.assume(i1 [[BOOL]])
21 // CHECK: call void @llvm.assume(i1 [[BOOLPURE]])
32 // Nothing is generated for an assume with side effects...
34 // CHECK-NOT: call void @llvm.assume
  /external/llvm/lib/Target/SystemZ/
SystemZProcessors.td 24 "Assume that the distinct-operands facility is installed"
29 "Assume that the load/store-on-condition facility is installed"
34 "Assume that the high-word facility is installed"
39 "Assume that the floating-point extension facility is installed"
44 "Assume that the population-count facility is installed"
49 "Assume that the fast-serialization facility is installed"
54 "Assume that interlocked-access facility 1 is installed"
60 "Assume that the miscellaneous-extensions facility is installed"
65 "Assume that the transactional-execution facility is installed"
70 "Assume that the processor-assist facility is installed
    [all...]
  /build/kati/testcase/
implicit_pattern_rule_chain2.mk 1 # TODO: Fix. We probably need to assume foo.y exists as there's a rule
  /external/kernel-headers/original/uapi/asm-x86/asm/
posix_types_64.h 7 * assume GCC is being used.
  /external/llvm/test/Transforms/LoadCombine/
load-combine-assume.ll 5 declare void @llvm.assume(i1) nounwind
12 ; CHECK-DAG: tail call void @llvm.assume(i1 %b)
19 tail call void @llvm.assume(i1 %b)
31 ; CHECK-DAG: tail call void @llvm.assume(i1 %b)
37 tail call void @llvm.assume(i1 %b)

Completed in 687 milliseconds

1 2 3 4 5 6 7 8 91011>>