X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=testprograms%2Fempty.c;h=1011d025e6e16d0e96406957f01fe22d53de2e89;hb=e690de805182c6c6f15d73b8649e59ffb7f84b6a;hp=75d130dbbeb103075c6d9d382f6b721758cc6bed;hpb=a6a4132882e2fc59c4f89fffc6a689b281e810ed;p=libfirm diff --git a/testprograms/empty.c b/testprograms/empty.c index 75d130dbb..1011d025e 100644 --- a/testprograms/empty.c +++ b/testprograms/empty.c @@ -1,98 +1,104 @@ -/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Christian Schaefer, Goetz Lindenmaier -** -** testprogram. -*/ +/* + * Project: libFIRM + * File name: testprograms/empty.c + * Purpose: The smallest possible firm graph. + * Author: Christian Schaefer, 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 +#include -# include "irdump.h" -# include "firm.h" -/* - * das leere FIRM Programm - */ + +#include /** -*** This file constructs the ir for the following pseudo-program: -*** -*** main() { -*** return; -*** } +* An empty Firm program. +* +* This file constructs the ir for the following pseudo-program: +* +* main() { +* return; +* } +* +* **/ -int main(int argc, char **argv) +int main(void) { - ir_graph *irg; /* this variable contains the irgraph */ - type_class *owner; /* the class in which this method is defined */ - type_method *proc_main; /* type information for the method main */ - entity *ent; /* represents this method as entity of owner */ - ir_node *x; + ir_graph *irg; /* this variable contains the irgraph */ + ir_type *owner; /* the class in which this method is defined */ + ir_type *proc_main; /* ir_type information for the method main */ + ir_entity *ent; /* represents this method as ir_entity of owner */ + ir_node *x; /* to build control flow */ - printf("creating an IR graph: EMPTY...\n"); + printf("\nCreating an IR graph: EMPTY...\n"); /* init library */ - init_firm (); + init_firm (NULL); - set_opt_dead_node_elimination (0); + /** Build ir_type information for the procedure. **/ /* FIRM was designed for oo languages where all methods belong to a class. * For imperative languages like C we view a file as a large class containing - * all functions as methods in this file. - * (Therefore we define a class "empty" according to the file name - * with a method main as an entity.) - * This class now is automatically generated. + * all functions in this file as methods. + * This clas is generated automatically. */ -#define METHODNAME "main" + owner = get_glob_type(); + +#define METHODNAME "EMPTY_main" #define NRARGS 0 #define NRES 0 - - owner = get_glob_type(); - proc_main = new_type_method(id_from_str(METHODNAME, strlen(METHODNAME)), + /* The ir_type of the method */ + proc_main = new_type_method(new_id_from_chars(METHODNAME, strlen(METHODNAME)), NRARGS, NRES); - ent = new_entity ((type *)owner, - id_from_str (METHODNAME, strlen(METHODNAME)), - (type *)proc_main); + /* An ir_entity representing the method. Owner of the ir_entity is the global class + ir_type mentioned above. */ + ent = new_entity ((ir_type *)owner, + new_id_from_chars (METHODNAME, strlen(METHODNAME)), + (ir_type *)proc_main); - /* Generates the basic graph for the method represented by entity ent, that + /** Build code for the procedure. **/ + + /* Generates the basic graph for the method represented by ir_entity ent, that * is, generates start and end blocks and nodes and a first, initial block. - * The constructor needs to know how many local variables the method has. + * The constructor needs to know the number of local variables (including + * the arguments) in the method. */ #define NUM_OF_LOCAL_VARS 0 - irg = new_ir_graph (ent, NUM_OF_LOCAL_VARS); - /* The constructor new_ir_graph() generated a region to place nodes in. * This region is accessible via the attribut current_block of irg and * it is not matured. * Generate the return node into this region. The Return node is needed to - * return at least the store. */ - { - ir_node *in[0]; /* this is the array containing the return parameters */ - x = new_Return (get_store(), 0, in); - } - /* Now generate all instructions for this block and all its predecessor blocks - * so we can mature it. */ - mature_block (irg->current_block); + * return at least the memory. */ + x = new_Return (get_store(), 0, NULL); + /* Now we generated all instructions for this block and all its predecessor + * blocks so we can mature it. (There are not too much.) */ + mature_immBlock (get_irg_current_block(irg)); /* This adds the in edge of the end block which originates at the return statement. * The return node passes controlflow to the end block. */ - add_in_edge (irg->end_block, x); + add_immBlock_pred (get_irg_end_block(irg), x); /* Now we can mature the end block as all it's predecessors are known. */ - mature_block (irg->end_block); + mature_immBlock (get_irg_end_block(irg)); - /* verify the graph */ + /* Verify the graph. Finds some very bad errors in the graph. */ irg_vrfy(irg); - dead_node_elimination(irg); + irg_finalize_cons (irg); - printf("\nDone building the graph. Dumping it.\n"); - dump_ir_block_graph (irg); + printf("Done building the graph. Dumping it.\n"); + dump_ir_block_graph (irg, 0); - printf("use xvcg to view this graph:\n"); - printf("/ben/goetz/bin/xvcg GRAPHNAME\n"); + printf("Use ycomp to view this graph:\n"); + printf("ycomp GRAPHNAME\n\n"); return (0); }