- /* 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>
+
+# include "irvrfy.h"
# include "irdump.h"
# include "firm.h"
-/** This example describes a possible representation of heap allocated
-*** variables of imperative programs.
-*** It constructs the IR for the following program:
-***
-***
-*** main(): int
-*** int *a[10];
-***
-*** a = malloc(sizeof(a[10]));
-*** return (a[3]);
-*** end;
-***
-*** The array is placed on the heap. The pointer to the array that
-*** is a local variable is represented as a dataflow edge.
-*** There are two ways to model allocation to the heap in programs with
-*** explicit memory allocation:
-*** 1. Model the calls to malloc and free as simple procedure (of compiler
-*** known procedures returning a pointer. This is the simpler way of
-*** generating FIRM, but restricts the information that can be deduced
-*** for the call.
-*** 2. Insert an Alloc node. A later pass can lower this to the compiler
-*** known function. This makes the allocation explicit in FIRM, supporting
-*** optimization.
-*** A problem is modeling free. There is no free node in FIRM. Is this
-*** a necessary extension?
-*** This example shows the second alternative, where the size of the array
-*** is explicitly computed.
+/**
+* variables of imperative programs.
+* It constructs the IR for the following program:
+*
+*
+* main(): int
+* int *a[10];
+*
+* a = malloc(sizeof(a[10]));
+* return (a[3]);
+* end;
+*
+* The array is placed on the heap. The pointer to the array that
+* is a local variable is represented as a dataflow edge.
+* There are two ways to model allocation to the heap in programs with
+* explicit memory allocation:
+* 1. Model the calls to malloc and free as simple procedure (of compiler
+* known procedures returning a pointer. This is the simpler way of
+* generating FIRM, but restricts the information that can be deduced
+* for the call.
+* 2. Insert an Alloc node. A later pass can lower this to the compiler
+* known function. This makes the allocation explicit in FIRM, supporting
+* optimization.
+* A problem is modeling free. There is no free node in FIRM. Is this
+* a necessary extension?
+* This example shows the second alternative, where the size of the array
+* is explicitly computed.
**/
#define OPTIMIZE_NODE 0
main(void)
{
/* describes the method main */
- type_class *owner;
- type_method *proc_main;
- entity *proc_main_e;
+ type *owner;
+ type *proc_main;
+ entity *proc_main_e;
/* describes types defined by the language */
- type_primitive *prim_t_int;
+ type *prim_t_int;
/* describes the array and its fields. */
- type_array *array_type; /* the type information for the array */
- entity *array_ent; /* the entity representing a field of the array */
+ type *array_type; /* the type information for the array */
+ entity *array_ent; /* the entity representing a field of the array */
/* Needed while finding the element size. */
- type_primitive *elt_type;
- ir_mode *elt_type_mode;
- int size;
- ir_node *arr_size;
+ type *elt_type;
+ ir_mode *elt_type_mode;
+ int size;
+ ir_node *arr_size;
/* holds the graph and nodes. */
- ir_graph *main_irg;
- ir_node *array, *array_ptr, *c3, *elt, *val, *x;
+ 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.
This is the modeling appropriate for other languages.
Mode_i says that all integers shall be implemented as a
32 bit integer value. */
- prim_t_int = new_type_primitive(id_from_str ("int", 3), mode_i);
+ prim_t_int = new_type_primitive(new_id_from_chars ("int", 3), mode_Is);
- printf("creating an IR graph: ARRAY-HEAP_EXAMPLE...\n");
+ printf("\nCreating an IR graph: ARRAY-HEAP_EXAMPLE...\n");
/* first build procedure main */
owner = get_glob_type();
- proc_main = new_type_method(id_from_str("main", 4), 0, 1);
+ proc_main = new_type_method(new_id_from_chars("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 ("main", 4), (type *)proc_main);
- main_irg = new_ir_graph (proc_main_e, 4);
+ proc_main_e = new_entity ((type*)owner, new_id_from_chars("ARRAY-HEAP_EXAMPLE_main", 23), (type *)proc_main);
/* make type information for the array and set the bounds */
# define N_DIMS 1
# define L_BOUND 0
# define U_BOUND 9
- array_type = new_type_array(id_from_str("a", 1), N_DIMS);
- set_array_bounds(array_type, 1, L_BOUND, U_BOUND);
- set_array_element_type(array_type, (union type*)prim_t_int);
+ current_ir_graph = get_const_code_irg();
+ array_type = new_type_array(new_id_from_chars("a", 1), N_DIMS, prim_t_int);
+ 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. */
- array_ent = new_entity((type*)array_type, id_from_str("array_field", 11),
- (type*)prim_t_int);
+ 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
are not modeled by dataflow edges need an explicit allocate node.
If the variable shall be placed on the stack, set stack_alloc. */
/* first compute size in bytes. */
- elt_type = (type_primitive *)get_array_element_type(array_type);
- if (! (elt_type->kind == k_type_primitive)) printf(" do something else\n");
- elt_type_mode = get_primitive_mode(elt_type);
+ 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) * elt_type_mode->size;
+ size = (U_BOUND - L_BOUND + 1) * get_mode_size_bytes(elt_type_mode);
/* make constant representing the size */
- arr_size = new_Const(mode_I, tarval_from_long (mode_I, 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 */
- array_ptr = new_Proj(array, mode_p, 1); /* remember the pointer to the array */
+ array_ptr = new_Proj(array, mode_P, 2); /* remember the pointer to the array */
/* Now the "real" program: */
/* Load element 3 of the array. For this first generate the pointer to this
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_I, tarval_from_long (mode_I, 3));
+ c3 = new_Const (mode_Iu, new_tarval_from_long (3, mode_Iu));
{
ir_node *in[1];
in[0] = c3;
elt = new_Sel(get_store(), array_ptr, 1, in, array_ent);
}
- val = new_Load(get_store(), elt);
+ val = new_Load(get_store(), elt, mode_Is);
set_store(new_Proj(val, mode_M, 0));
- val = new_Proj(val, mode_i, 1);
+ val = new_Proj(val, mode_Is, 2);
/* return the result of procedure main */
{
x = new_Return (get_store (), 1, in);
}
- mature_block (main_irg->current_block);
+ mature_immBlock (get_irg_current_block(main_irg));
/* complete the end_block */
- add_in_edge (main_irg->end_block, x);
- mature_block (main_irg->end_block);
+ add_immBlock_pred (get_irg_end_block(main_irg), x);
+ mature_immBlock (get_irg_end_block(main_irg));
+
+ irg_finalize_cons (main_irg);
+
+ printf("Optimizing ...\n");
+ dead_node_elimination(main_irg);
/* verify the graph */
irg_vrfy(main_irg);
- printf("\nDone building the graph.\n");
printf("Dumping the graph and a type graph.\n");
- dump_ir_block_graph (main_irg);
- dump_type_graph(main_irg);
-
- printf("\nuse xvcg to view these graphs:\n");
- printf("/ben/goetz/bin/xvcg GRAPHNAME\n");
-
- return (1);
+ char *dump_file_suffix = "";
+ dump_ir_block_graph (main_irg, dump_file_suffix);
+ dump_type_graph(main_irg, dump_file_suffix);
+ dump_all_types(dump_file_suffix);
+ printf("use xvcg to view these graphs:\n");
+ printf("/ben/goetz/bin/xvcg GRAPHNAME\n\n");
+
+ return (0);
}
projects / libfirm / blobdiff