/**
* 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;
}
/**
* 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 != NULL) {
size_t bal = bitset_size(ba); /* avoid macro expansion in assertion. */
size_t inl = get_irn_arity(n);
assert(bal == inl);
}
#endif
return ba;
}
sdm_idset
bitset_to_idset(bitset *b)
{
int bit;
sdm_set_clear(tmp_idset);
for (bit = 0; bit < bitset_size(b); bit++) {
if (bitset_test(b, bit)) {
sdm_set_add_element(tmp_idset, bit);
}
}
return tmp_idset;
}
void
bitsetv_matrix_dump (FILE * out, const char *title, bitsetv bset)
{
bitset_bindex i, j;
bitset_bindex hsize = bitset_size (bset[0]);
/* Title. */
fprintf (out, "%s BEGIN\n", title);
/* Column numbers. */
fputs (" ", out);
for (i = 0; i < hsize; ++i)
putc (i / 10 ? '0' + i / 10 : ' ', out);
putc ('\n', out);
fputs (" ", out);
for (i = 0; i < hsize; ++i)
fprintf (out, "%d", (int) (i % 10));
putc ('\n', out);
/* Bar. */
fputs (" .", out);
for (i = 0; i < hsize; ++i)
putc ('-', out);
fputs (".\n", out);
/* Contents. */
for (i = 0; bset[i]; ++i)
{
fprintf (out, "%2lu|", (unsigned long int) i);
for (j = 0; j < hsize; ++j)
fputs (bitset_test (bset[i], j) ? "1" : " ", out);
fputs ("|\n", out);
}
/* Bar. */
fputs (" `", out);
for (i = 0; i < hsize; ++i)
putc ('-', out);
fputs ("'\n", out);
/* End title. */
fprintf (out, "%s END\n\n", title);
}
void fix_backedges(struct obstack *obst, ir_node *n)
{
bitset_t *arr = mere_get_backarray(n);
if (arr == NULL)
return;
int arity = get_irn_arity(n);
if (bitset_size(arr) != (unsigned) arity) {
arr = new_backedge_arr(obst, arity);
unsigned 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));
}