-//BETTER use last 2 fields in COLUMNS section. See MPS docu for details
-static void pi_dump_milp(problem_instance_t *pi) {
- int i, max_abs_Qij;
- const matrix_elem_t *e;
- FILE *out = ffopen(pi->co->name, "milp", "wt");
-
- DBG((dbg, LEVEL_1, "Dumping milp...\n"));
- max_abs_Qij = pi->maxQij;
- if (-pi->minQij > max_abs_Qij)
- max_abs_Qij = -pi->minQij;
- pi->bigM = pi->A_dim * max_abs_Qij;
- DBG((dbg, LEVEL_2, "BigM = %d\n", pi->bigM));
-
- matrix_optimize(pi->Q);
- bitset_t *good_row = bitset_alloca(pi->x_dim);
- for (i=0; i<pi->x_dim; ++i)
- if (matrix_row_first(pi->Q, i))
- bitset_set(good_row, i);
-
- fprintf(out, "NAME %s\n", pi->co->name);
-
- fprintf(out, "ROWS\n");
- fprintf(out, " N obj\n");
- for (i=0; i<pi->x_dim; ++i)
- if (bitset_is_set(good_row, i))
- fprintf(out, " E cQ%d\n", i);
- for (i=0; i<pi->A_dim; ++i)
- fprintf(out, " E cA%d\n", i);
- for (i=0; i<pi->B_dim; ++i)
- fprintf(out, " L cB%d\n", i);
- for (i=0; i<pi->x_dim; ++i)
- if (bitset_is_set(good_row, i))
- fprintf(out, " L cy%d\n", i);
-
- fprintf(out, "COLUMNS\n");
- /* the x vars come first */
- /* mark them as binaries */
- fprintf(out, " MARKI0\t'MARKER'\t'INTORG'\n");
- for (i=0; i<pi->x_dim; ++i) {
- /* participation in objective */
- if (bitset_is_set(good_row, i))
- fprintf(out, " x%d_%d\tobj\t%d\n", pi->x[i].n, pi->x[i].c, -pi->bigM);
- /* in Q */
- matrix_foreach_in_col(pi->Q, i, e)
- fprintf(out, " x%d_%d\tcQ%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
- /* in A */
- matrix_foreach_in_col(pi->A, i, e)
- fprintf(out, " x%d_%d\tcA%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
- /* in B */
- matrix_foreach_in_col(pi->B, i, e)
- fprintf(out, " x%d_%d\tcB%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
- /* in y */
- if (bitset_is_set(good_row, i))
- fprintf(out, " x%d_%d\tcy%d\t%d\n", pi->x[i].n, pi->x[i].c, i, 2*pi->bigM);
+static inline bool sr_is_simplicial(size_red_t *sr, const ir_node *ifn)
+{
+ be_ifg_t *ifg = sr->co->cenv->ifg;
+ neighbours_iter_t iter;
+ ir_node **all = ALLOCAN(ir_node*, be_ifg_degree(ifg, ifn));
+ ir_node *curr;
+ int size = 0;
+ int i;
+ int o;
+
+ /* get all non-removed neighbors */
+ be_ifg_foreach_neighbour(ifg, &iter, ifn, curr)
+ if (!sr_is_removed(sr, curr))
+ all[size++] = curr;
+
+ /* check if these form a clique */
+ for (i=0; i<size; ++i)
+ for (o=i+1; o<size; ++o)
+ if (!be_ifg_connected(ifg, all[i], all[o]))
+ return false;
+
+ /* all edges exist so this is a clique */
+ return true;
+}
+
+void sr_remove(size_red_t *sr)
+{
+ ir_node *irn;
+ bool redo = true;
+ const be_ifg_t *ifg = sr->co->cenv->ifg;
+ nodes_iter_t iter;
+
+ while (redo) {
+ redo = false;
+ be_ifg_foreach_node(ifg, &iter, irn) {
+ const arch_register_req_t *req = arch_get_irn_register_req(irn);
+ coloring_suffix_t *cs;
+
+ if (arch_register_req_is(req, limited) || sr_is_removed(sr, irn))
+ continue;
+ if (co_gs_is_optimizable(sr->co, irn))
+ continue;
+ if (!sr_is_simplicial(sr, irn))
+ continue;
+
+ cs = OALLOC(&sr->ob, coloring_suffix_t);
+ cs->irn = irn;
+ cs->next = sr->col_suff;
+ sr->col_suff = cs;
+
+ pset_insert_ptr(sr->all_removed, irn);
+
+ redo = true;
+ }