+ foreach_post_remat(bb, tmp) {
+ int n;
+ op_t *remat_op = get_irn_link(tmp);
+ pset *remat_args = pset_new_ptr(get_irn_arity(tmp));
+ ir_node *remat_arg;
+
+ for (n=get_irn_arity(tmp)-1; n>=0; --n) {
+ remat_arg = get_irn_n(tmp, n);
+
+ if(has_reg_class(si, remat_arg)) {
+ pset_insert_ptr(remat_args, remat_arg);
+ }
+ }
+
+ /* remat + \sum live_range(remat_arg) <= |args| */
+ ir_snprintf(buf, sizeof(buf), "one_must_die_%N", tmp);
+ cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, pset_count(remat_args));
+ lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
+
+ pset_foreach(remat_args, remat_arg) {
+ if(pset_find_ptr(live, remat_arg)) {
+ op_t *remat_arg_op = get_irn_link(remat_arg);
+ lpp_set_factor_fast(si->lpp, cst, remat_arg_op->attr.live_range.ilp, 1.0);
+ }
+ }
+ del_pset(remat_args);
+ }
+
+ foreach_post_remat(bb, tmp) {
+ int n;
+
+ for(n=get_irn_arity(tmp)-1; n>=0; --n) {
+ ir_node *remat_arg = get_irn_n(tmp, n);
+
+ /* if value is becoming live through use by remat2 */
+ if(has_reg_class(si, remat_arg) && !pset_find_ptr(live, remat_arg)) {
+ op_t *remat_arg_op = get_irn_link(remat_arg);
+ ilp_cst_t nomem;
+
+ DBG((si->dbg, LEVEL_3, " value %+F becoming live through use by remat2 at bb start %+F\n", remat_arg, tmp));
+
+ pset_insert_ptr(live, remat_arg);
+ spill = add_to_spill_bb(si, bb, remat_arg);
+ remat_arg_op->attr.live_range.ilp = ILP_UNDEF;
+
+ /* we need reg_in and mem_in for this value; they will be referenced later */
+ ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", remat_arg, bb);
+ spill->reg_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
+ ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", remat_arg, bb);
+ spill->mem_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
+
+
+ /* optimization: all memory stuff should be 0, for we do not want to insert reloads for remats */
+ ir_snprintf(buf, sizeof(buf), "nomem_%N_%N", remat_arg, bb);
+ nomem = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0.0);
+ lpp_set_factor_fast(si->lpp, nomem, spill->spill, 1.0);
+ }
+ }
+ }