# include "irprog_t.h"
# include "irgraph_t.h"
+# include "pseudo_irg.h"
# include "array.h"
# include "obst.h"
# include "typegmod.h"
memset(res, 0, sizeof(res));
irp = res;
/* res->obst = (struct obstack *) xmalloc (sizeof (struct obstack)); */
- res->graphs = NEW_ARR_F (ir_graph *, 0);
+ 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);
/* Removes irg from the list or irgs, shrinks the list by one. */
void remove_irp_irg(ir_graph *irg){
- int i;
+ 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];
}
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;
+ }
+ }
+ }
}
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);