basic.ll 1.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051
  1. ; RUN: opt -O3 -S < %s | FileCheck %s
  2. target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"
  3. target triple = "x86_64-apple-macosx10.6.7"
  4. declare i8* @malloc(i64)
  5. declare void @free(i8*)
  6. ; PR2338
  7. define void @test1() nounwind ssp {
  8. %retval = alloca i32, align 4
  9. %i = alloca i8*, align 8
  10. %call = call i8* @malloc(i64 1)
  11. store i8* %call, i8** %i, align 8
  12. %tmp = load i8*, i8** %i, align 8
  13. store i8 1, i8* %tmp
  14. %tmp1 = load i8*, i8** %i, align 8
  15. call void @free(i8* %tmp1)
  16. ret void
  17. ; CHECK-LABEL: @test1(
  18. ; CHECK-NEXT: ret void
  19. }
  20. ; This function exposes a phase ordering problem when InstCombine is
  21. ; turning %add into a bitmask, making it difficult to spot a 0 return value.
  22. ;
  23. ; It it also important that %add is expressed as a multiple of %div so scalar
  24. ; evolution can recognize it.
  25. define i32 @test2(i32 %a, i32* %p) nounwind uwtable ssp {
  26. entry:
  27. %div = udiv i32 %a, 4
  28. %arrayidx = getelementptr inbounds i32, i32* %p, i64 0
  29. store i32 %div, i32* %arrayidx, align 4
  30. %add = add i32 %div, %div
  31. %arrayidx1 = getelementptr inbounds i32, i32* %p, i64 1
  32. store i32 %add, i32* %arrayidx1, align 4
  33. %arrayidx2 = getelementptr inbounds i32, i32* %p, i64 1
  34. %0 = load i32, i32* %arrayidx2, align 4
  35. %arrayidx3 = getelementptr inbounds i32, i32* %p, i64 0
  36. %1 = load i32, i32* %arrayidx3, align 4
  37. %mul = mul i32 2, %1
  38. %sub = sub i32 %0, %mul
  39. ret i32 %sub
  40. ; CHECK-LABEL: @test2(
  41. ; CHECK: %div = lshr i32 %a, 2
  42. ; CHECK: %add = shl nuw nsw i32 %div, 1
  43. ; CHECK: ret i32 0
  44. }