-/**********************************************************************/
-/** Backedge information. **/
-/**********************************************************************/
-
-
-/* Returns backarray if the node can have backedges. Else returns
- NULL. */
-inline int *get_backarray(ir_node *n) {
- switch(get_irn_opcode(n)) {
- case iro_Block:
- if (interprocedural_view && n->attr.block.in_cg) {
- assert(n->attr.block.cg_backedge && "backedge array not allocated!");
- return n->attr.block.cg_backedge;
- } else {
- assert(n->attr.block.backedge && "backedge array not allocated!");
- return n->attr.block.backedge;
- }
- break;
- case iro_Phi:
- assert(n->attr.phi_backedge && "backedge array not allocated!");
- return n->attr.phi_backedge;
- break;
- case iro_Filter:
- if (interprocedural_view) {
- assert(n->attr.filter.backedge && "backedge array not allocated!");
- return n->attr.filter.backedge;
- }
- break;
- default: ;
- }
- return NULL;
+/*--------------------------------------------------------------------*/
+/* Backedge information. */
+/*--------------------------------------------------------------------*/
+
+
+/**
+ * Returns backarray if the node can have backedges, else returns
+ * NULL.
+ *
+ * Does not assert whether the backarray is correct -- use
+ * very careful!
+ */
+static bitset_t *mere_get_backarray(const ir_node *n)
+{
+ switch (get_irn_opcode(n)) {
+ case iro_Block:
+ if (!get_Block_matured(n)) return NULL;
+
+ assert(n->attr.block.backedge && "backedge array not allocated!");
+ return n->attr.block.backedge;
+ case iro_Phi:
+ assert(n->attr.phi.u.backedge && "backedge array not allocated!");
+ return n->attr.phi.u.backedge;
+ default:
+ break;
+ }
+ return NULL;
+}
+
+/**
+ * Returns backarray if the node can have backedges, else returns
+ * NULL.
+ */
+static bitset_t *get_backarray(const ir_node *n)
+{
+ bitset_t *ba = mere_get_backarray(n);
+
+#ifndef NDEBUG
+ if (ba) {
+ size_t bal = bitset_size(ba); /* avoid macro expansion in assertion. */
+ size_t inl = get_irn_arity(n);
+ assert(bal == inl && "backedge array with faulty length");
+ }
+#endif
+
+ return ba;
+}
+
+#ifndef NDEBUG
+/**
+ * Returns non-zero if node has no backarray, or
+ * if size of backarray == size of in array.
+ */
+static int legal_backarray(const ir_node *n)
+{
+ bitset_t *ba = mere_get_backarray(n);
+ if (ba && (bitset_size(ba) != (unsigned) get_irn_arity(n)))
+ return 0;
+ return 1;
+}
+#endif
+
+void fix_backedges(struct obstack *obst, ir_node *n)
+{
+ bitset_t *arr = mere_get_backarray(n);
+ unsigned opc;
+ int arity;
+
+ if (! arr)
+ return;
+
+ arity = get_irn_arity(n);
+ if (bitset_size(arr) != (unsigned) arity) {
+ arr = new_backedge_arr(obst, arity);
+
+ opc = get_irn_opcode(n);
+ if (opc == iro_Phi)
+ n->attr.phi.u.backedge = arr;
+ else if (opc == iro_Block) {
+ n->attr.block.backedge = arr;
+ }
+ }
+
+ assert(legal_backarray(n));
+}
+
+int is_backedge(const ir_node *n, int pos)
+{
+ bitset_t *ba = get_backarray(n);
+ if (ba)
+ return bitset_is_set(ba, pos);
+ return 0;