X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=testprograms%2Farray-heap_example.c;h=0f3296b6a4a58f5398e8d36d678552086eadd3b6;hb=67b6304bf1b2df3cefa9f39151ed7436e64c48dd;hp=d0b776fb09933ea6b6ea46b1bb73b1af43aee879;hpb=760356ab155a0d884324c867a1f9a78a79c0b5a3;p=libfirm

diff --git a/testprograms/array-heap_example.c b/testprograms/array-heap_example.c
index d0b776fb0..0f3296b6a 100644
--- a/testprograms/array-heap_example.c
+++ b/testprograms/array-heap_example.c
@@ -1,10 +1,15 @@
- /* 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>
@@ -76,22 +81,22 @@ main(void)
      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_Is);
+  prim_t_int = new_type_primitive(new_id_from_chars ("int", 3), mode_Is);
 
   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("ARRAY-HEAP_EXAMPLE_main", 23), 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 ("ARRAY-HEAP_EXAMPLE_main", 23), (type *)proc_main);
+  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
   current_ir_graph = get_const_code_irg();
-  array_type = new_type_array(id_from_str("a", 1), N_DIMS, prim_t_int);
+  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)));
@@ -128,7 +133,7 @@ main(void)
      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_Is, 2);
 
@@ -139,13 +144,13 @@ main(void)
 
      x = new_Return (get_store (), 1, in);
   }
-  mature_block (get_irg_current_block(main_irg));
+  mature_immBlock (get_irg_current_block(main_irg));
 
   /* complete the end_block */
-  add_in_edge (get_irg_end_block(main_irg), x);
-  mature_block (get_irg_end_block(main_irg));
+  add_immBlock_pred (get_irg_end_block(main_irg), x);
+  mature_immBlock (get_irg_end_block(main_irg));
 
-  finalize_cons (main_irg);
+  irg_finalize_cons (main_irg);
 
   printf("Optimizing ...\n");
   dead_node_elimination(main_irg);
@@ -154,9 +159,10 @@ main(void)
   irg_vrfy(main_irg);
 
   printf("Dumping the graph and a type graph.\n");
-  dump_ir_block_graph (main_irg);
-  dump_type_graph(main_irg);
-  dump_all_types();
+  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");