while (redo) {
redo = 0;
be_ifg_foreach_node(ifg, iter, irn) {
- if (!sr_is_removed(sr, irn) && !co_is_optimizable_root(sr->co, irn) && !co_is_optimizable_arg(sr->co, irn)) {
+ arch_register_req_t req;
+
+ arch_get_register_req(sr->co->aenv, &req, irn, -1);
+
+ if (!arch_register_req_is(&req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) {
if (sr_is_simplicial(sr, irn)) {
coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
*****************************************************************************/
+#include <stdio.h>
+
ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
ilp_env_t *res = malloc(sizeof(*res));
assert(res);
}
lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
+ FILE *f;
+ char buf[256];
+
sr_remove(ienv->sr);
ienv->build(ienv);
lpp_solve_cplex(ienv->lp);
#endif
+ snprintf(buf, sizeof(buf), "%s.ilp", ienv->co->name);
+ f = fopen(buf, "wt");
+ lpp_dump_plain(ienv->lp, f);
+ fclose(f);
+
ienv->apply(ienv);
sr_reinsert(ienv->sr);