- /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
-* All rights reserved.
-*
-* Authors: Goetz Lindenmaier
-*
-* testprogram.
-*/
+/*
+ * Project: libFIRM
+ * File name: testprograms/array-heap_example.c
+ * Purpose: Show representation of dynamically allocated array.
+ * Author: Goetz Lindenmaier
+ * Modified by:
+ * Created:
+ * CVS-ID: $Id$
+ * Copyright: (c) 1999-2003 Universität Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ */
+
# include <string.h>
# include <stdio.h>
ir_graph *main_irg;
ir_node *array, *array_ptr, *c3, *elt, *val, *x;
- init_firm ();
+ init_firm (NULL);
/* make basic type information for primitive type int.
In Sather primitive types are represented by a class.
proc_main = new_type_method(id_from_str("ARRAY-HEAP_EXAMPLE_main", 23), 0, 1);
set_method_res_type(proc_main, 0, (type *)prim_t_int);
proc_main_e = new_entity ((type*)owner, id_from_str ("ARRAY-HEAP_EXAMPLE_main", 23), (type *)proc_main);
- main_irg = new_ir_graph (proc_main_e, 4);
/* make type information for the array and set the bounds */
# define N_DIMS 1
# define L_BOUND 0
# define U_BOUND 9
+ current_ir_graph = get_const_code_irg();
array_type = new_type_array(id_from_str("a", 1), 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)));
+ set_array_bounds(array_type, 0,
+ new_Const(mode_Iu, new_tarval_from_long (L_BOUND, mode_Iu)),
+ new_Const(mode_Iu, new_tarval_from_long (U_BOUND, mode_Iu)));
/* As the array is accessed by Sel nodes, we need information about
the entity the node selects. Entities of an array are it's elements
which are, in this case, integers. */
+ main_irg = new_ir_graph (proc_main_e, 4);
array_ent = get_array_element_entity(array_type);
/* Allocate the array. All program known variables that
elt_type = get_array_element_type(array_type);
elt_type_mode = get_type_mode(elt_type);
/* better: read bounds out of array type information */
- size = (U_BOUND - L_BOUND + 1) * get_mode_size(elt_type_mode);
+ size = (U_BOUND - L_BOUND + 1) * get_mode_size_bytes(elt_type_mode);
/* make constant representing the size */
- arr_size = new_Const(mode_Iu, tarval_from_long (mode_Iu, size));
+ arr_size = new_Const(mode_Iu, new_tarval_from_long (size, mode_Iu));
/* allocate and generate the Proj nodes. */
array = new_Alloc(get_store(), arr_size, (type*)array_type, stack_alloc);
set_store(new_Proj(array, mode_M, 0)); /* make the changed memory visible */
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;
printf("Dumping the graph and a type graph.\n");
dump_ir_block_graph (main_irg);
dump_type_graph(main_irg);
+ dump_all_types();
printf("use xvcg to view these graphs:\n");
printf("/ben/goetz/bin/xvcg GRAPHNAME\n\n");