- /* sort the register pairs by the indices of the in registers */
- qsort(pairs, n, sizeof(pairs[0]), compare_reg_pair);
-
- /* Mark all equal pairs as checked, and exchange the OUT proj with the IN
- * node. */
- for (i = 0; i < n; i++) {
- reg_pair_t *const pair = &pairs[i];
-
- if (pair->in_reg->index != pair->out_reg->index)
- continue;
-
- DBG((dbg, LEVEL_1, "%+F removing equal perm register pair (%+F, %+F, %s)\n",
- irn, pair->in_node, pair->out_node, pair->out_reg->name));
-
- /* reroute the edges from the proj to the argument */
- exchange(pair->out_node, pair->in_node);
-
- pair->checked = 1;
- }
+ DBG((dbg, LEVEL_1, "%+F has %d unresolved constraints\n", irn, n));