1; RUN: opt -safe-stack -S -mtriple=i386-pc-linux-gnu < %s -o - | FileCheck %s 2; RUN: opt -safe-stack -S -mtriple=x86_64-pc-linux-gnu < %s -o - | FileCheck %s 3; RUN: opt -passes=safe-stack -S -mtriple=i386-pc-linux-gnu < %s -o - | FileCheck %s 4; RUN: opt -passes=safe-stack -S -mtriple=x86_64-pc-linux-gnu < %s -o - | FileCheck %s 5 6%struct.small = type { i8 } 7 8@.str = private unnamed_addr constant [4 x i8] c"%s\0A\00", align 1 9 10; Address-of a structure taken in a function with a loop where 11; the alloca is an incoming value to a PHI node and a use of that PHI 12; node is also an incoming value. 13; Verify that the address-of analysis does not get stuck in infinite 14; recursion when chasing the alloca through the PHI nodes. 15; Requires protector. 16define i32 @foo(i32 %arg) nounwind uwtable safestack { 17bb: 18 ; CHECK: __safestack_unsafe_stack_ptr 19 %tmp = alloca ptr, align 8 20 %tmp1 = call i32 (...) @dummy(ptr %tmp) nounwind 21 %tmp2 = load ptr, ptr %tmp, align 8 22 %tmp3 = ptrtoint ptr %tmp2 to i64 23 %tmp4 = trunc i64 %tmp3 to i32 24 %tmp5 = icmp sgt i32 %tmp4, 0 25 br i1 %tmp5, label %bb6, label %bb21 26 27bb6: ; preds = %bb17, %bb 28 %tmp7 = phi ptr [ %tmp19, %bb17 ], [ %tmp2, %bb ] 29 %tmp8 = phi i64 [ %tmp20, %bb17 ], [ 1, %bb ] 30 %tmp9 = phi i32 [ %tmp14, %bb17 ], [ %tmp1, %bb ] 31 %tmp11 = load i8, ptr %tmp7, align 1 32 %tmp12 = icmp eq i8 %tmp11, 1 33 %tmp13 = add nsw i32 %tmp9, 8 34 %tmp14 = select i1 %tmp12, i32 %tmp13, i32 %tmp9 35 %tmp15 = trunc i64 %tmp8 to i32 36 %tmp16 = icmp eq i32 %tmp15, %tmp4 37 br i1 %tmp16, label %bb21, label %bb17 38 39bb17: ; preds = %bb6 40 %tmp18 = getelementptr inbounds ptr, ptr %tmp, i64 %tmp8 41 %tmp19 = load ptr, ptr %tmp18, align 8 42 %tmp20 = add i64 %tmp8, 1 43 br label %bb6 44 45bb21: ; preds = %bb6, %bb 46 %tmp22 = phi i32 [ %tmp1, %bb ], [ %tmp14, %bb6 ] 47 %tmp23 = call i32 (...) @dummy(i32 %tmp22) nounwind 48 ret i32 undef 49} 50 51declare i32 @dummy(...) 52