Home
last modified time | relevance | path

Searched refs:assume (Results 1 – 25 of 963) sorted by relevance

12345678910>>...39

/external/llvm/test/Transforms/LoopVectorize/X86/
Dassume.ll12 ; 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) #1
[all …]
Dregister-assumption.ll21 call void @llvm.assume(i1 %maskcond)
22 ; CHECK: call void @llvm.assume(
23 ; CHECK-NOT: call void @llvm.assume(
30 declare void @llvm.assume(i1) #0
/external/llvm/test/Transforms/InstCombine/
Dassume.ll10 ; 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 …]
Dassume2.ll6 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 …]
Dassume-redundant.ll14 ; 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 removed
[all …]
Dpr23809.ll3 ; 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)
Dctpop.ll5 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)
/external/llvm/test/Transforms/SimplifyCFG/
Dassume.ll4 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
Dswitch-dead-default.ll94 call void @llvm.assume(i1 %cmp)
111 ; CHECK: @llvm.assume
115 call void @llvm.assume(i1 %cmp)
133 ; CHECK: @llvm.assume
137 call void @llvm.assume(i1 %cmp)
165 call void @llvm.assume(i1 %cmp)
179 declare void @llvm.assume(i1)
/external/llvm/test/Transforms/GVN/
Dassume-equal.ll20 tail call void @llvm.assume(i1 %cmp.vtables)
56 tail call void @llvm.assume(i1 %cmp.vtables)
114 tail call void @llvm.assume(i1 %cmp.vtables)
137 call void @llvm.assume(i1 %cmp)
152 call void @llvm.assume(i1 %cmp)
166 call void @llvm.assume(i1 %cmp)
177 call void @llvm.assume(i1 %cmp)
182 call void @llvm.assume(i1 true)
194 call void @llvm.assume(i1 %cmp)
201 ; CHECK-NOT: call void @llvm.assume(
[all …]
/external/llvm/test/Analysis/BasicAA/
Dassume.ll5 declare void @llvm.assume(i1) #0
8 tail call void @llvm.assume(i1 true)
15 ; CHECK: NoModRef: Ptr: i8* %P <-> tail call void @llvm.assume(i1 true)
16 ; CHECK: NoModRef: Ptr: i8* %Q <-> tail call void @llvm.assume(i1 true)
19 ; CHECK: NoModRef: tail call void @llvm.assume(i1 true) <-> tail call void @llvm.memcpy.p0i8.p0…
20 …y.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false) <-> tail call void @llvm.assume(i1 true)
/external/llvm/test/Transforms/JumpThreading/
Dassume-edge-dom.ll4 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
Dassume.ll9 tail call void @llvm.assume(i1 %cmp)
15 ; CHECK: call void @llvm.assume
39 tail call void @llvm.assume(i1 %cmp)
45 ; CHECK: tail call void @llvm.assume
60 declare void @llvm.assume(i1) #1
/external/llvm/test/Analysis/AssumptionCache/
Dbasic.ll5 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/CorrelatedValuePropagation/
Dconflict.ll23 declare void @llvm.assume(i1)
25 ; Test that we can handle conflicting assume vs edge facts
29 call void @llvm.assume(i1 %cmp1)
45 ; CHECK: call void @llvm.assume(i1 false)
46 call void @llvm.assume(i1 %cmp2)
/external/llvm/test/Transforms/LoadCombine/
Dload-combine-assume.ll5 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)
/external/llvm/test/Transforms/AlignmentFromAssumptions/
Dsimple.ll10 tail call void @llvm.assume(i1 %maskcond)
25 tail call void @llvm.assume(i1 %maskcond)
41 tail call void @llvm.assume(i1 %maskcond)
56 tail call void @llvm.assume(i1 %maskcond)
70 tail call void @llvm.assume(i1 %maskcond)
98 tail call void @llvm.assume(i1 %maskcond)
126 tail call void @llvm.assume(i1 %maskcond)
154 tail call void @llvm.assume(i1 %maskcond)
182 tail call void @llvm.assume(i1 %maskcond)
197 tail call void @llvm.assume(i1 %maskcond)
[all …]
Dsimple32.ll10 tail call void @llvm.assume(i1 %maskcond)
25 tail call void @llvm.assume(i1 %maskcond)
41 tail call void @llvm.assume(i1 %maskcond)
56 tail call void @llvm.assume(i1 %maskcond)
70 tail call void @llvm.assume(i1 %maskcond)
98 tail call void @llvm.assume(i1 %maskcond)
126 tail call void @llvm.assume(i1 %maskcond)
154 tail call void @llvm.assume(i1 %maskcond)
182 tail call void @llvm.assume(i1 %maskcond)
197 tail call void @llvm.assume(i1 %maskcond)
[all …]
/external/llvm/test/Transforms/Util/MemorySSA/
Dassume.ll6 declare void @llvm.assume(i1)
13 ; CHECK: call void @llvm.assume
14 call void @llvm.assume(i1 %c)
/external/llvm/test/Transforms/LICM/
Dassume.ll19 ; CHECK: tail call void @llvm.assume
20 tail call void @llvm.assume(i1 %p)
46 call void @llvm.assume(i1 %cond)
52 declare void @llvm.assume(i1)
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DConstraintManager.h67 virtual ProgramStateRef assume(ProgramStateRef state,
76 ProgramStateRef StTrue = assume(State, Cond, true); in assumeDual()
86 assert(assume(State, Cond, false) && "System is over constrained."); in assumeDual()
91 ProgramStateRef StFalse = assume(State, Cond, false); in assumeDual()
/external/llvm/lib/Analysis/
DAssumptionCache.cpp35 if (match(&II, m_Intrinsic<Intrinsic::assume>())) in scanFunction()
43 assert(match(CI, m_Intrinsic<Intrinsic::assume>()) && in registerAssumption()
69 assert(match(cast<CallInst>(VH), m_Intrinsic<Intrinsic::assume>()) && in registerAssumption()
125 if (match(&II, m_Intrinsic<Intrinsic::assume>())) in verifyAnalysis()
/external/llvm/test/Transforms/Inline/
Dinline-assume.ll11 ; CHECK: call void @llvm.assume(i1 undef)
24 call void @llvm.assume(i1 undef)
31 declare void @llvm.assume(i1)
Dephemeral.ll11 ; only by the @llvm.assume intrinsic, they're free (and, thus, inlining will
19 tail call void @llvm.assume(i1 %ca)
31 declare void @llvm.assume(i1) nounwind
/external/mesa3d/src/util/
Dmacros.h95 #define assume(expr) \ macro
101 #define assume(expr) ((expr) ? ((void) 0) \ macro
105 #define assume(expr) __assume(expr) macro
107 #define assume(expr) assert(expr) macro

12345678910>>...39