Dan Gohman | 572645c | 2010-02-12 10:34:29 +0000 | [diff] [blame^] | 1 | ; RUN: llc < %s -mtriple=i386-apple-darwin | FileCheck %s |
| 2 | |
| 3 | ; CHECK: leal 16(%eax), %edx |
| 4 | ; CHECK: align |
| 5 | ; CHECK: addl $4, %edx |
| 6 | ; CHECK: decl %ecx |
| 7 | ; CHECK: jne LBB1_2 |
Evan Cheng | d9fb712 | 2009-02-21 02:06:47 +0000 | [diff] [blame] | 8 | |
| 9 | %struct.CUMULATIVE_ARGS = type { i32, i32, i32, i32, i32, i32, i32 } |
| 10 | %struct.bitmap_element = type { %struct.bitmap_element*, %struct.bitmap_element*, i32, [2 x i64] } |
| 11 | %struct.bitmap_head_def = type { %struct.bitmap_element*, %struct.bitmap_element*, i32 } |
| 12 | %struct.branch_path = type { %struct.rtx_def*, i32 } |
| 13 | %struct.c_lang_decl = type <{ i8, [3 x i8] }> |
| 14 | %struct.constant_descriptor = type { %struct.constant_descriptor*, i8*, %struct.rtx_def*, { x86_fp80 } } |
| 15 | %struct.eh_region = type { %struct.eh_region*, %struct.eh_region*, %struct.eh_region*, i32, %struct.bitmap_head_def*, i32, { { %struct.eh_region*, %struct.eh_region*, %struct.eh_region*, %struct.rtx_def* } }, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def* } |
| 16 | %struct.eh_status = type { %struct.eh_region*, %struct.eh_region**, %struct.eh_region*, %struct.eh_region*, %struct.tree_node*, %struct.rtx_def*, %struct.rtx_def*, i32, i32, %struct.varray_head_tag*, %struct.varray_head_tag*, %struct.varray_head_tag*, %struct.branch_path*, i32, i32, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def* } |
| 17 | %struct.emit_status = type { i32, i32, %struct.rtx_def*, %struct.rtx_def*, %struct.tree_node*, %struct.sequence_stack*, i32, i32, i8*, i32, i8*, %struct.tree_node**, %struct.rtx_def** } |
| 18 | %struct.equiv_table = type { %struct.rtx_def*, %struct.rtx_def* } |
| 19 | %struct.expr_status = type { i32, i32, i32, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def* } |
| 20 | %struct.function = type { %struct.eh_status*, %struct.stmt_status*, %struct.expr_status*, %struct.emit_status*, %struct.varasm_status*, i8*, %struct.tree_node*, %struct.function*, i32, i32, i32, i32, %struct.rtx_def*, %struct.CUMULATIVE_ARGS, %struct.rtx_def*, %struct.rtx_def*, i8*, %struct.initial_value_struct*, i32, %struct.tree_node*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.tree_node*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, i64, %struct.tree_node*, %struct.tree_node*, %struct.rtx_def*, %struct.rtx_def*, i32, %struct.rtx_def**, %struct.temp_slot*, i32, i32, i32, %struct.var_refs_queue*, i32, i32, i8*, %struct.tree_node*, %struct.rtx_def*, i32, i32, %struct.machine_function*, i32, i32, %struct.language_function*, %struct.rtx_def*, i8, i8, i8 } |
| 21 | %struct.goto_fixup = type { %struct.goto_fixup*, %struct.rtx_def*, %struct.tree_node*, %struct.tree_node*, %struct.rtx_def*, i32, %struct.rtx_def*, %struct.tree_node* } |
| 22 | %struct.initial_value_struct = type { i32, i32, %struct.equiv_table* } |
| 23 | %struct.label_chain = type { %struct.label_chain*, %struct.tree_node* } |
| 24 | %struct.lang_decl = type { %struct.c_lang_decl, %struct.tree_node* } |
| 25 | %struct.language_function = type { %struct.stmt_tree_s, %struct.tree_node* } |
| 26 | %struct.machine_function = type { [59 x [3 x %struct.rtx_def*]], i32, i32 } |
| 27 | %struct.nesting = type { %struct.nesting*, %struct.nesting*, i32, %struct.rtx_def*, { { i32, %struct.rtx_def*, %struct.rtx_def*, %struct.nesting*, %struct.tree_node*, %struct.tree_node*, %struct.label_chain*, i32, i32, i32, i32, %struct.rtx_def*, %struct.tree_node** } } } |
| 28 | %struct.pool_constant = type { %struct.constant_descriptor*, %struct.pool_constant*, %struct.pool_constant*, %struct.rtx_def*, i32, i32, i32, i64, i32 } |
| 29 | %struct.rtunion = type { i64 } |
| 30 | %struct.rtx_def = type { i16, i8, i8, [1 x %struct.rtunion] } |
| 31 | %struct.sequence_stack = type { %struct.rtx_def*, %struct.rtx_def*, %struct.tree_node*, %struct.sequence_stack* } |
| 32 | %struct.stmt_status = type { %struct.nesting*, %struct.nesting*, %struct.nesting*, %struct.nesting*, %struct.nesting*, %struct.nesting*, i32, i32, %struct.tree_node*, %struct.rtx_def*, i32, i8*, i32, %struct.goto_fixup* } |
| 33 | %struct.stmt_tree_s = type { %struct.tree_node*, %struct.tree_node*, i8*, i32 } |
| 34 | %struct.temp_slot = type { %struct.temp_slot*, %struct.rtx_def*, %struct.rtx_def*, i32, i64, %struct.tree_node*, %struct.tree_node*, i8, i8, i32, i32, i64, i64 } |
| 35 | %struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, i8, i8, i8, i8 } |
| 36 | %struct.tree_decl = type { %struct.tree_common, i8*, i32, i32, %struct.tree_node*, i8, i8, i8, i8, i8, i8, %struct.rtunion, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.rtx_def*, %struct.rtx_def*, { %struct.function* }, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, i64, %struct.lang_decl* } |
| 37 | %struct.tree_exp = type { %struct.tree_common, i32, [1 x %struct.tree_node*] } |
| 38 | %struct.tree_node = type { %struct.tree_decl } |
| 39 | %struct.var_refs_queue = type { %struct.rtx_def*, i32, i32, %struct.var_refs_queue* } |
| 40 | %struct.varasm_status = type { %struct.constant_descriptor**, %struct.pool_constant**, %struct.pool_constant*, %struct.pool_constant*, i64, %struct.rtx_def* } |
| 41 | %struct.varray_data = type { [1 x i64] } |
| 42 | %struct.varray_head_tag = type { i32, i32, i32, i8*, %struct.varray_data } |
| 43 | @lineno = internal global i32 0 ; <i32*> [#uses=1] |
| 44 | @tree_code_length = internal global [256 x i32] zeroinitializer |
| 45 | @llvm.used = appending global [1 x i8*] [ i8* bitcast (%struct.tree_node* (i32, ...)* @build_stmt to i8*) ], section "llvm.metadata" ; <[1 x i8*]*> [#uses=0] |
| 46 | |
| 47 | define %struct.tree_node* @build_stmt(i32 %code, ...) nounwind { |
| 48 | entry: |
| 49 | %p = alloca i8* ; <i8**> [#uses=3] |
| 50 | %p1 = bitcast i8** %p to i8* ; <i8*> [#uses=2] |
| 51 | call void @llvm.va_start(i8* %p1) |
| 52 | %0 = call fastcc %struct.tree_node* @make_node(i32 %code) nounwind ; <%struct.tree_node*> [#uses=2] |
| 53 | %1 = getelementptr [256 x i32]* @tree_code_length, i32 0, i32 %code ; <i32*> [#uses=1] |
| 54 | %2 = load i32* %1, align 4 ; <i32> [#uses=2] |
| 55 | %3 = load i32* @lineno, align 4 ; <i32> [#uses=1] |
| 56 | %4 = bitcast %struct.tree_node* %0 to %struct.tree_exp* ; <%struct.tree_exp*> [#uses=2] |
| 57 | %5 = getelementptr %struct.tree_exp* %4, i32 0, i32 1 ; <i32*> [#uses=1] |
| 58 | store i32 %3, i32* %5, align 4 |
| 59 | %6 = icmp sgt i32 %2, 0 ; <i1> [#uses=1] |
| 60 | br i1 %6, label %bb, label %bb3 |
| 61 | |
| 62 | bb: ; preds = %bb, %entry |
| 63 | %i.01 = phi i32 [ %indvar.next, %bb ], [ 0, %entry ] ; <i32> [#uses=2] |
| 64 | %7 = load i8** %p, align 4 ; <i8*> [#uses=2] |
| 65 | %8 = getelementptr i8* %7, i32 4 ; <i8*> [#uses=1] |
| 66 | store i8* %8, i8** %p, align 4 |
| 67 | %9 = bitcast i8* %7 to %struct.tree_node** ; <%struct.tree_node**> [#uses=1] |
| 68 | %10 = load %struct.tree_node** %9, align 4 ; <%struct.tree_node*> [#uses=1] |
| 69 | %11 = getelementptr %struct.tree_exp* %4, i32 0, i32 2, i32 %i.01 ; <%struct.tree_node**> [#uses=1] |
| 70 | store %struct.tree_node* %10, %struct.tree_node** %11, align 4 |
| 71 | %indvar.next = add i32 %i.01, 1 ; <i32> [#uses=2] |
| 72 | %exitcond = icmp eq i32 %indvar.next, %2 ; <i1> [#uses=1] |
| 73 | br i1 %exitcond, label %bb3, label %bb |
| 74 | |
| 75 | bb3: ; preds = %bb, %entry |
| 76 | call void @llvm.va_end(i8* %p1) |
| 77 | ret %struct.tree_node* %0 |
| 78 | } |
| 79 | |
| 80 | declare void @llvm.va_start(i8*) nounwind |
| 81 | |
| 82 | declare void @llvm.va_end(i8*) nounwind |
| 83 | |
| 84 | declare fastcc %struct.tree_node* @make_node(i32) nounwind |