Peter Collingbourne | 705a1ae | 2014-07-15 04:41:17 +0000 | [diff] [blame^] | 1 | ; RUN: opt < %s -dfsan -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-S128" |
| 3 | |
| 4 | @a = common global i32 0 |
| 5 | @b = common global i32 0 |
| 6 | |
| 7 | ; Check that we reuse unions where possible. |
| 8 | |
| 9 | ; CHECK-LABEL: @"dfs$f" |
| 10 | define void @f(i32 %x, i32 %y) { |
| 11 | ; CHECK: __dfsan_union |
| 12 | %xay = add i32 %x, %y |
| 13 | store i32 %xay, i32* @a |
| 14 | ; CHECK-NOT: __dfsan_union |
| 15 | %xmy = mul i32 %x, %y |
| 16 | store i32 %xmy, i32* @b |
| 17 | ret void |
| 18 | } |
| 19 | |
| 20 | ; In this case, we compute the unions on both sides because neither block |
| 21 | ; dominates the other. |
| 22 | |
| 23 | ; CHECK-LABEL: @"dfs$g" |
| 24 | define void @g(i1 %p, i32 %x, i32 %y) { |
| 25 | br i1 %p, label %l1, label %l2 |
| 26 | |
| 27 | l1: |
| 28 | ; CHECK: __dfsan_union |
| 29 | %xay = add i32 %x, %y |
| 30 | store i32 %xay, i32* @a |
| 31 | br label %l3 |
| 32 | |
| 33 | l2: |
| 34 | ; CHECK: __dfsan_union |
| 35 | %xmy = mul i32 %x, %y |
| 36 | store i32 %xmy, i32* @b |
| 37 | br label %l3 |
| 38 | |
| 39 | l3: |
| 40 | ret void |
| 41 | } |