*/
#ifdef HAVE_CONFIG_H
-# include <config.h>
+# include "config.h"
#endif
+#ifdef HAVE_STRING_H
# include <string.h>
+#endif
# include "irprog_t.h"
# include "irgraph_t.h"
+# include "pseudo_irg.h"
# include "array.h"
# include "obst.h"
# include "typegmod.h"
/* A variable from where everything in the ir can be accessed. */
ir_prog *irp;
-ir_prog *get_irp() { return irp; }
+ir_prog *get_irp(void) { return irp; }
/* initializes ir_prog. Calles the constructor for an ir_prog. */
void init_irprog(void) {
new_ir_prog ();
}
-INLINE void remove_irp_type_from_list (type *typ) {
+void remove_irp_type_from_list (type *typ) {
int i;
assert(typ);
#if 0
#endif
if (irp->types[i] == typ) {
for(; i < (ARR_LEN (irp->types)) - 1; i++) {
- irp->types[i] = irp->types[i+1];
+ irp->types[i] = irp->types[i+1];
}
ARR_SETLEN(type*, irp->types, (ARR_LEN(irp->types)) - 1);
break;
ir_prog *new_ir_prog (void) {
ir_prog *res;
- res = (ir_prog *) malloc (sizeof(ir_prog));
- memset(res, 0, sizeof(res));
+ res = xmalloc (sizeof(*res));
+ memset(res, 0, sizeof(*res));
irp = res;
- /* res->obst = (struct obstack *) xmalloc (sizeof (struct obstack)); */
- res->graphs = NEW_ARR_F (ir_graph *, 0);
+ /* res->obst = xmalloc (sizeof(*res->obst)); */
+ res->graphs = NEW_ARR_F (ir_graph *, 0);
+ res->pseudo_graphs = NEW_ARR_F (ir_graph *, 0);
res->types = NEW_ARR_F (type *, 0);
res->name = new_id_from_str(INITAL_PROG_NAME);
/* frees all memory used by irp. Types in type list, irgs in irg
list and entities in global type must be freed by hand before. */
-void free_ir_prog() {
+void free_ir_prog(void) {
free_type(irp->glob_type);
/* @@@ * free_ir_graph(irp->const_code_irg); * ?? End has no in?? */
DEL_ARR_F(irp->graphs);
/* Access the main routine of the compiled program. */
-ir_graph *get_irp_main_irg() {
+ir_graph *get_irp_main_irg(void) {
assert (irp);
return irp->main_irg;
}
}
/* Removes irg from the list or irgs, shrinks the list by one. */
-void remove_irp_irg(ir_graph *irg){
- int i;
+void remove_irp_irg_from_list(ir_graph *irg){
+ int i, found = false;
assert(irg);
- free_ir_graph(irg);
for (i = 0; i < (ARR_LEN (irp->graphs)); i++) {
if (irp->graphs[i] == irg) {
+ found = true;
for(; i < (ARR_LEN (irp->graphs)) - 1; i++) {
- irp->graphs[i] = irp->graphs[i+1];
+ irp->graphs[i] = irp->graphs[i+1];
}
ARR_SETLEN(ir_graph*, irp->graphs, (ARR_LEN(irp->graphs)) - 1);
break;
}
}
+ if (!found) {
+ for (i = 0; i < (ARR_LEN (irp->pseudo_graphs)); i++) {
+ if (irp->pseudo_graphs[i] == irg) {
+ for(; i < (ARR_LEN (irp->pseudo_graphs)) - 1; i++) {
+ irp->pseudo_graphs[i] = irp->pseudo_graphs[i+1];
+ }
+ ARR_SETLEN(ir_graph*, irp->pseudo_graphs, (ARR_LEN(irp->pseudo_graphs)) - 1);
+ break;
+ }
+ }
+ }
+}
+
+/* Removes irg from the list or irgs, shrinks the list by one. */
+void remove_irp_irg(ir_graph *irg){
+ assert(irg);
+ free_ir_graph(irg);
+ remove_irp_irg_from_list(irg);
}
int (get_irp_n_irgs)(void) {
irp->graphs[pos] = irg;
}
+/* Gets the number of graphs _and_ pseudo graphs. */
+int get_irp_n_allirgs(void) {
+ /* We can not call get_irp_n_irgs, as we end up in a recursion ... */
+ return ARR_LEN((irp)->graphs) + get_irp_n_pseudo_irgs();
+}
+
+/* Returns the ir graph at position pos of all graphs (including
+ pseudo graphs). Visits first graphs, then pseudo graphs. */
+ir_graph *get_irp_allirg(int pos) {
+ int n_irgs = ARR_LEN((irp)->graphs);
+ assert(0 <= pos);
+ if (pos < n_irgs) {
+ return (irp)->graphs[pos];
+ } else {
+ return get_irp_pseudo_irg(pos-n_irgs);
+ }
+}
+
+
/* Adds type to the list of types in irp. */
void add_irp_type(type *typ) {
assert (typ != NULL);
void set_irp_ip_outedges(ir_node ** ip_outedges)
{
- irp -> ip_outedges = ip_outedges;
+ irp->ip_outedges = ip_outedges;
}
ir_node** get_irp_ip_outedges(void)
{
- return(irp -> ip_outedges);
+ return irp->ip_outedges;
}