X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=testprograms%2Farray-stack_example.c;h=cda2601966f01fa5ea79136f54ac512018f37ee7;hb=2176bbfdff1f38e6f5a11b35d611ea6d339f6d3e;hp=715354370ac3de34234e46cc1cb564a9435f8925;hpb=6ed168c29789db8edf25c87f2da9164c49a5512c;p=libfirm diff --git a/testprograms/array-stack_example.c b/testprograms/array-stack_example.c index 715354370..cda260196 100644 --- a/testprograms/array-stack_example.c +++ b/testprograms/array-stack_example.c @@ -1,9 +1,9 @@ /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** testprogram. +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* testprogram. */ # include @@ -13,24 +13,24 @@ # include "irdump.h" # include "firm.h" -/** This example describes representation of stack allocated variables of -*** imperative programs. -*** It constructs the IR for the following program: -*** -*** -*** main(): int -*** int a[10]; -*** -*** return (a[3]); -*** end; -*** -*** The array is placed on the stack, i.e., a pointer to the array -*** is obtained by selecting the entity "a" from the stack. The variables -*** on the stack are considered to be entities of the method, as locals -*** of a method are only visible within the method. (An alternative to -*** make the method owner of the stack variables is to give the ownership -*** to the class representing the C-file. This would extend the visibility -*** of the locals, though.) +/** +* imperative programs. +* It constructs the IR for the following program: +* +* +* main(): int +* int a[10]; +* +* return (a[3]); +* end; +* +* The array is placed on the stack, i.e., a pointer to the array +* is obtained by selecting the entity "a" from the stack. The variables +* on the stack are considered to be entities of the method, as locals +* of a method are only visible within the method. (An alternative to +* make the method owner of the stack variables is to give the ownership +* to the class representing the C-file. This would extend the visibility +* of the locals, though.) **/ @@ -59,7 +59,7 @@ main(void) ir_graph *main_irg; ir_node *array_ptr, *c3, *elt, *val, *x; - init_firm (); + init_firm (NULL); printf("\nCreating an IR graph: ARRAY-STACK_EXAMPLE...\n"); @@ -84,8 +84,8 @@ main(void) # define U_BOUND 9 array_type = new_type_array(id_from_str("a_tp", 4), N_DIMS, prim_t_int); set_array_bounds(array_type, 1, - new_Const(mode_Iu, tarval_from_long (mode_Iu, L_BOUND)), - new_Const(mode_Iu, tarval_from_long (mode_Iu, U_BOUND))); + new_Const(mode_Iu, new_tarval_from_long (L_BOUND, mode_Iu)), + new_Const(mode_Iu, new_tarval_from_long (U_BOUND, mode_Iu))); /* The array is an entity of the method, placed on the mehtod's own memory, the stack frame. */ array_ent = new_entity(get_cur_frame_type(), id_from_str("a", 1), array_type); @@ -105,7 +105,7 @@ main(void) array pointer by (three * elt_size), but this complicates some optimizations.) The type information accessible via the entity allows to generate the pointer increment later. */ - c3 = new_Const (mode_Iu, tarval_from_long (mode_Iu, 3)); + c3 = new_Const (mode_Iu, new_tarval_from_long (3, mode_Iu)); { ir_node *in[1]; in[0] = c3;