** by Goetz Lindenmaier
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "irgraph_t.h"
# include "irnode_t.h"
# include "irmode_t.h"
** irdump.h: dumping of an intermediate representation graph
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "irnode_t.h"
# include "irgraph_t.h"
# include "irprog.h"
** irflag --- optimization flags
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
/* 0 - don't do this optimization
1 - lets see, if there is a better graph */
** irgmod: ir graph modification
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "irnode_t.h"
# include "irgraph_t.h"
# include "irgmod.h"
** Optimizations for a whole ir graph, i.e., a procedure.
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include <assert.h>
# include "irgopt.h"
**
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "ircons.h"
# include "irgraph_t.h"
# include "irprog.h"
res->args = new_Proj (res->start, mode_T, pns_args);
add_in_edge(res->start_block, projX);
- // The code generation needs it. leave it in now.
- // Use of this edge is matter of discussion, unresolved. Also possible:
- // add_in_edge(res->start_block, res->start_block), but invalid typed.
-
+ /*
+ * The code generation needs it. leave it in now.
+ * Use of this edge is matter of discussion, unresolved. Also possible:
+ * add_in_edge(res->start_block, res->start_block), but invalid typed.
+ */
mature_block (res->current_block);
/** Make a block to start with **/
** - execute the post function after recursion
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "irnode.h"
# include "irgraph.h" /* visited flag */
**
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "irmode_t.h"
# include <malloc.h>
# include <stddef.h>
**
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
#include "irnode_t.h"
#include "irgraph_t.h"
#include "ident_t.h"
**
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "irop_t.h"
# include "irnode_t.h"
# include "misc.h"
** iropt --- optimizations intertwined with IR construction.
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "irnode_t.h"
# include "irgraph_t.h"
# include "iropt_t.h"
}
/* remove unnecessary nodes */
- //if (get_opt_constant_folding())
+ /*if (get_opt_constant_folding()) */
if (get_opt_constant_folding() || get_irn_op(n) == op_Phi)
n = equivalent_node (n);
** irprog.c: ir representation of a program
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "irprog_t.h"
# include "array.h"
# include "obst.h"
x**
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "irgraph_t.h"
# include "irvrfy.h"
# include "irgwalk.h"
break;
case iro_Return:
op1mode = get_irn_mode(in[1]);
- /* Return: BB x M x data1 x ... x datan --> X */
- //printf("mode: %s, code %s\n", ID_TO_STR(n->mode->name), ID_TO_STR(n->op->name));
+ /* Return: BB x M x data1 x ... x datan --> X */
+ /* printf("mode: %s, code %s\n", ID_TO_STR(n->mode->name), ID_TO_STR(n->op->name));*/
assert ( op1mode == mode_M ); /* operand M */
for (i=2; i < get_irn_arity(n); i++) {
assert ( mode_is_data(get_irn_mode(in[i])) ); /* operand datai */
**
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include <stdlib.h>
+# include <stddef.h>
# include "entity_t.h"
# include "entity.h"
# include "mangle.h"
**
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "mangle.h"
# include <obstack.h>
# include "obst.h"
** type.c: datastructures to hold type information.
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include "type.h"
# include "irprog.h" /* So that constructors can add the type to global
data structure. */
/*******************************************************************/
type_class *
-new_type_class (ident *name)//, int members)
+new_type_class (ident *name) /*, int members) */
{
type_class *res;
/*******************************************************************/
type_strct *
-new_type_strct (ident *name)//, int members)
+new_type_strct (ident *name) /*, int members) */
{
type_strct *res;
add_irp_type((type *) res); /* Remember the new type global. */
res->kind = k_type_method;
- res->name = name; // do I need the name, or is the name in entity sufficient?
+ res->name = name; /* do I need the name, or is the name in entity sufficient? */
res->arity = arity;
res->param_type = (type **) xmalloc (sizeof (type *) * arity);
res->n_res = n_res;
res = (type_union *) xmalloc (sizeof (type_union));
add_irp_type((type *) res); /* Remember the new type global. */
res->kind = k_type_union;
- res->name = name; // do I need a name?
+ res->name = name; /* do I need a name? */
res->n_types = n_types;
/*
res->unioned_type = (int *) xmalloc (sizeof (int) * n_types);
#endif
/* for recursive type definiton */
-//#ifndef _TYPE_TYPEDEF_
-//#define _TYPE_TYPEDEF_
+/*#ifndef _TYPE_TYPEDEF_ */
+/*#define _TYPE_TYPEDEF_ */
/* to resolve recursion between entity.h and irgraph.h */
typedef union type type;
-//#endif
+/*#endif */
/* visited flag to traverse the type information */
** - execute the post function after recursion
*/
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
#include <stdlib.h>
#include <stdio.h>
#include "irgwalk.h"
{
int i;
((type_class *)tore)->visit = type_visited;
- //CS
+ /* CS */
for (i=0; i<get_class_n_member((type_class *)tore); i++)
{
type_walk_2((type_or_ent *)get_class_member((type_class *)tore, i),
int i;
((type_strct *)tore)->visit = type_visited;
- //CS
+ /* CS */
for (i=0; i<get_strct_n_member((type_strct *)tore); i++)
{
type_walk_2((type_or_ent *)get_strct_member((type_strct *)tore, i),