/external/llvm/test/Transforms/IndVarSimplify/ |
interesting-invoke-use.ll | 35 invoke void @system__img_int__image_integer(%struct.string___XUP* noalias sret null, i32 %i.0) 39 invoke void @system__string_ops__str_concat(%struct.string___XUP* noalias sret null, [0 x i8]* bitcast ([24 x i8]* @.str7 to [0 x i8]*), %struct.string___XUB* @C.17.316, [0 x i8]* null, %struct.string___XUB* null) 57 declare void @system__img_int__image_integer(%struct.string___XUP* noalias sret, i32) 59 declare void @system__string_ops__str_concat(%struct.string___XUP* noalias sret, [0 x i8]*, %struct.string___XUB*, [0 x i8]*, %struct.string___XUB*)
|
eliminate-max.ll | 48 %t22 = call i32 (i8*, ...)* @printf(i8* noalias getelementptr inbounds ([4 x i8]* @0, i32 0, i32 0), i32 %t18) nounwind 52 declare i32 @printf(i8* noalias nocapture, ...) nounwind
|
/external/llvm/test/Transforms/Inline/ |
2009-05-07-CallUsingSelfCrash.ll | 7 define void @func_113(%struct.S1* noalias nocapture sret %agg.result, i8 signext %p_114) noreturn nounwind {
|
/external/llvm/test/Transforms/LoopVectorize/ |
cpp-new-array.ll | 13 %call = call noalias i8* @_Znwm(i64 4) 16 %call1 = call noalias i8* @_Znwm(i64 4) 19 %call3 = call noalias i8* @_Znwm(i64 4) 46 declare noalias i8* @_Znwm(i64)
|
/external/llvm/test/Transforms/SLPVectorizer/X86/ |
saxpy.ll | 11 define void @SAXPY(i32* noalias nocapture %x, i32* noalias nocapture %y, i32 %a, i64 %i) { 47 define void @SAXPY_crash(i32* noalias nocapture %x, i32* noalias nocapture %y, i64 %i) {
|
diamond.ll | 19 define i32 @foo(i32* noalias nocapture %B, i32* noalias nocapture %A, i32 %n, i32 %m) #0 { 57 define i32 @extr_user(i32* noalias nocapture %B, i32* noalias nocapture %A, i32 %n, i32 %m) { 87 define i32 @extr_user1(i32* noalias nocapture %B, i32* noalias nocapture %A, i32 %n, i32 %m) {
|
/external/eigen/test/ |
product_extra.cpp | 42 VERIFY_IS_APPROX(m3.noalias() = m1 * m2.adjoint(), m1 * m2.adjoint().eval()); 43 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * square.adjoint(), m1.adjoint().eval() * square.adjoint().eval()); 44 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * m2, m1.adjoint().eval() * m2); 45 VERIFY_IS_APPROX(m3.noalias() = (s1 * m1.adjoint()) * m2, (s1 * m1.adjoint()).eval() * m2); 46 VERIFY_IS_APPROX(m3.noalias() = ((s1 * m1).adjoint()) * m2, (internal::conj(s1) * m1.adjoint()).eval() * m2); 47 VERIFY_IS_APPROX(m3.noalias() = (- m1.adjoint() * s1) * (s3 * m2), (- m1.adjoint() * s1).eval() * (s3 * m2).eval()); 48 VERIFY_IS_APPROX(m3.noalias() = (s2 * m1.adjoint() * s1) * m2, (s2 * m1.adjoint() * s1).eval() * m2); 49 VERIFY_IS_APPROX(m3.noalias() = (-m1*s2) * s1*m2.adjoint(), (-m1*s2).eval() * (s1*m2.adjoint()).eval());
|
/external/llvm/test/CodeGen/ARM/ |
umulo-32.ll | 36 %9 = call noalias i8* @_Znam(i32 %8) 41 declare noalias i8* @_Znam(i32)
|
/external/llvm/test/CodeGen/SPARC/ |
2011-01-22-SRet.ll | 5 define weak void @make_foo(%struct.foo_t* noalias sret %agg.result, i32 %a, i32 %b, i32 %c) nounwind { 26 call void @make_foo(%struct.foo_t* noalias sret %f, i32 10, i32 20, i32 30) nounwind
|
/external/llvm/test/CodeGen/X86/ |
2009-03-05-burr-list-crash.ll | 31 %15 = call noalias i8* @make_temp_file(i8* %11) nounwind ; <i8*> [#uses=0] 35 declare noalias i8* @make_temp_file(i8*)
|
2008-08-06-RewriterBug.ll | 6 define void @foo(double* noalias, double* noalias) {
|
/external/llvm/test/Transforms/DeadStoreElimination/ |
2011-03-25-DSEMiscompile.ll | 10 define cc10 void @Func1(i32* noalias %Arg1, i32* noalias %Arg2, i32* %Arg3, i32 %Arg4) {
|
free.ll | 6 declare noalias i8* @malloc(i64) 50 %alloc1 = tail call noalias i8* @malloc(i64 4) nounwind
|
pr11390.ll | 14 %call4 = tail call noalias i8* @malloc(i64 %add3) nounwind 36 declare noalias i8* @malloc(i64) nounwind
|
/external/llvm/test/Analysis/BasicAA/ |
phi-speculation.ll | 8 ; CHECK: NoAlias: i32* %ptr2_phi, i32* %ptr_phi 36 ; CHECK: NoAlias: i32* %ptr_outer_phi, i32* %ptr_outer_phi2 37 ; CHECK: NoAlias: i32* %ptr2_phi, i32* %ptr_phi 79 define i32 @test_noalias_3(i8* noalias %x, i8* noalias %y, i8* noalias %z,
|
/external/llvm/test/Transforms/LoopVectorize/X86/ |
gcc-examples.ll | 59 define void @example10b(i16* noalias nocapture %sa, i16* noalias nocapture %sb, i16* noalias nocapture %sc, i32* noalias nocapture %ia, i32* noalias nocapture %ib, i32* noalias nocapture %ic) nounwind uwtable ssp {
|
/external/llvm/lib/Analysis/ |
AliasAnalysisEvaluator.cpp | 51 unsigned NoAlias, MayAlias, PartialAlias, MustAlias; 66 NoAlias = MayAlias = PartialAlias = MustAlias = 0; 200 case AliasAnalysis::NoAlias: 201 PrintResults("NoAlias", PrintNoAlias, *I1, *I2, F.getParent()); 202 ++NoAlias; break; 225 case AliasAnalysis::NoAlias: 226 PrintLoadStoreResults("NoAlias", PrintNoAlias, *I1, *I2, 228 ++NoAlias; break; 251 case AliasAnalysis::NoAlias: 252 PrintLoadStoreResults("NoAlias", PrintNoAlias, *I1, *I2 [all...] |
ScalarEvolutionAliasAnalysis.cpp | 115 return NoAlias; 125 // see if it's enough to prove a NoAlias. 140 return NoAlias; 154 return NoAlias; 168 BO ? 0 : LocB.TBAATag)) == NoAlias) 169 return NoAlias;
|
/external/eigen/bench/ |
bench_gemm.cpp | 95 cr.noalias() += ar * br; 96 cr.noalias() -= ai * bi; 97 ci.noalias() += ar * bi; 98 ci.noalias() += ai * br; 103 cr.noalias() += a * br; 104 ci.noalias() += a * bi; 109 cr.noalias() += ar * b; 110 ci.noalias() += ai * b; 116 c.noalias() += a * b; 182 r.noalias() += a * b [all...] |
/external/clang/test/CodeGenCXX/ |
new-overflow.cpp | 20 // CHECK-NEXT: call noalias i8* @_Znaj(i32 [[T3]]) 43 // CHECK-NEXT: call noalias i8* @_Znaj(i32 [[T4]]) 71 // CHECK-NEXT: call noalias i8* @_Znaj(i32 [[T8]]) 90 // CHECK-NEXT: call noalias i8* @_Znaj(i32 [[T1]]) 109 // CHECK-NEXT: call noalias i8* @_Znaj(i32 [[T1]]) 131 // CHECK-NEXT: call noalias i8* @_Znaj(i32 [[T3]]) 154 // CHECK-NEXT: call noalias i8* @_Znaj(i32 [[T4]]) 179 // CHECK-NEXT: call noalias i8* @_Znaj(i32 [[T6]]) 204 // CHECK-NEXT: call noalias i8* @_Znaj(i32 [[T6]])
|
delete-two-arg.cpp | 29 // CHECK: [[NEW:%.*]] = call noalias i8* @_Znaj(i32 44) 65 // CHECK: call noalias i8* @_Znaj(i32 24)
|
/external/eigen/doc/ |
I01_TopicLazyEvaluation.dox | 7 manually by using the MatrixBase::eval() and MatrixBase::noalias() methods. 45 What if you know that the result does no alias the operand of the product and want to force lazy evaluation? Then use \link MatrixBase::noalias() .noalias()\endlink instead. Here is an example: 47 \code matrix1.noalias() = matrix2 * matrix2; \endcode 49 Here, since we know that matrix2 is not the same matrix as matrix1, we know that lazy evaluation is not dangerous, so we may force lazy evaluation. Concretely, the effect of noalias() here is to bypass the evaluate-before-assigning \link flags flag\endlink.
|
/external/llvm/test/Analysis/ScalarEvolution/ |
trip-count3.ll | 30 declare i64 @fread(i8* noalias nocapture, i64, i64, %struct.FILE* noalias nocapture) nounwind 34 declare noalias %struct.FILE* @fopen(i8* noalias nocapture, i8* noalias nocapture) nounwind
|
/external/llvm/test/Transforms/LICM/ |
atomics.ll | 43 ; (The noalias shouldn't be necessary in theory, but LICM isn't quite that 45 define i32 @test3(i32* nocapture noalias %x, i32* nocapture %y) nounwind uwtable ssp { 64 define i32 @test4(i32* nocapture noalias %x, i32* nocapture %y) nounwind uwtable ssp {
|
/external/llvm/test/Transforms/MemCpyOpt/ |
2008-02-24-MultipleUseofSRet.ll | 9 define internal fastcc void @initialize(%0* noalias sret %agg.result) nounwind { 25 call fastcc void @initialize(%0* noalias sret %memtmp)
|