becopyheur4: Clean up co_mst_irn_init().
[libfirm] / ir / be / beverify.c
index b53e7a5..7cf0047 100644 (file)
@@ -1,20 +1,6 @@
 /*
- * Copyright (C) 1995-2010 University of Karlsruhe.  All right reserved.
- *
  * This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
 /**
@@ -179,6 +165,11 @@ static void verify_schedule_walker(ir_node *block, void *data)
                }
                last_timestep = timestep;
 
+               if (arch_get_irn_flags(node) & arch_irn_flags_not_scheduled) {
+                       ir_fprintf(stderr, "Verify warning: flags_not_scheduled node %+F scheduled anyway\n", node);
+                       env->problem_found = true;
+               }
+
                /* Check that phis come before any other node */
                if (is_Phi(node)) {
                        if (non_phi_found != NULL) {
@@ -201,8 +192,8 @@ static void verify_schedule_walker(ir_node *block, void *data)
                                cfchange_found = node;
                        }
                } else if (cfchange_found != NULL) {
-                       /* proj and keepany aren't real instructions... */
-                       if (!is_Proj(node) && !be_is_Keep(node)) {
+                       /* keepany isn't a real instruction. */
+                       if (!be_is_Keep(node)) {
                                ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
                                           node, block, get_irg_name(env->irg));
                                env->problem_found = true;
@@ -376,8 +367,6 @@ static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_nod
 
 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
 {
-       assert(is_Proj(node));
-
        ir_node *memperm = get_Proj_pred(node);
        int      out     = get_Proj_proj(node);
 
@@ -440,13 +429,6 @@ static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *rel
                collect_memperm(env, node, reload, ent);
        } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
                collect_memphi(env, node, reload, ent);
-       } else {
-               /* Disabled for now, spills might get transformed by the backend */
-#if 0
-               ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
-                       node, reload, get_nodes_block(node), get_irg_name(env->irg));
-               env->problem_found = true;
-#endif
        }
 }
 
@@ -680,7 +662,7 @@ static void check_input_constraints(ir_node *node)
                        ir_node               *pred     = get_Phi_pred(node, i);
                        const arch_register_t *pred_reg = arch_get_irn_register(pred);
 
-                       if (reg != pred_reg && !(pred_reg->type & arch_register_type_joker)) {
+                       if (reg != pred_reg && !(pred_reg->type & arch_register_type_virtual)) {
                                const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
                                const char *reg_name  = reg != NULL ? reg->name : "(null)";
                                ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
@@ -704,9 +686,8 @@ static void value_used(const ir_node *block, const ir_node *node)
        for (unsigned i = 0; i < req->width; ++i) {
                const ir_node *reg_node = registers[idx+i];
                if (reg_node != NULL && reg_node != node) {
-                       const arch_register_t *realreg = &arch_env->registers[idx+i];
                        ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
-                                          realreg->name, block, get_irg_name(irg),
+                                          reg->name, block, get_irg_name(irg),
                                           node, reg_node);
                        problem_found = true;
                }
@@ -733,9 +714,8 @@ static void value_def(const ir_node *node)
                        return;
 
                if (reg_node != node) {
-                       const arch_register_t *realreg = &arch_env->registers[idx+i];
                        ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
-                                  node, realreg->name, reg_node, get_nodes_block(node),
+                                  node, reg->name, reg_node, get_nodes_block(node),
                                   get_irg_name(irg));
                        problem_found = true;
                }
@@ -757,17 +737,10 @@ static void verify_block_register_allocation(ir_node *block, void *data)
        }
 
        sched_foreach_reverse(block, node) {
-
-               if (get_irn_mode(node) == mode_T) {
-                       foreach_out_edge(node, edge) {
-                               ir_node *def = get_edge_src_irn(edge);
-                               value_def(def);
-                               check_output_constraints(def);
-                       }
-               } else {
-                       value_def(node);
-                       check_output_constraints(node);
-               }
+               be_foreach_value(node, value,
+                       value_def(value);
+                       check_output_constraints(value);
+               );
 
                check_input_constraints(node);
 
@@ -836,7 +809,6 @@ static const char *lv_flags_to_str(unsigned flags)
 static void lv_check_walker(ir_node *bl, void *data)
 {
        lv_walker_t *w     = (lv_walker_t*)data;
-       be_lv_t     *lv    = w->lv;
        be_lv_t     *fresh = (be_lv_t*)w->data;
 
        be_lv_info_t *curr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
@@ -845,7 +817,7 @@ static void lv_check_walker(ir_node *bl, void *data)
        if (!fr && curr && curr[0].head.n_members > 0) {
                ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
                for (unsigned i = 0; i < curr[0].head.n_members; ++i) {
-                       ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].node.idx));
+                       ir_fprintf(stderr, "\t%+F\n", curr[1 + i].node.node);
                }
        } else if (curr) {
                unsigned n_curr  = curr[0].head.n_members;
@@ -857,13 +829,13 @@ static void lv_check_walker(ir_node *bl, void *data)
                        ir_fprintf(stderr, "current:\n");
                        for (unsigned i = 0; i < n_curr; ++i) {
                                be_lv_info_node_t *n = &curr[1 + i].node;
-                               ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
+                               ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, n->node, lv_flags_to_str(n->flags));
                        }
 
                        ir_fprintf(stderr, "correct:\n");
                        for (unsigned i = 0; i < n_fresh; ++i) {
                                be_lv_info_node_t *n = &fr[1 + i].node;
-                               ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
+                               ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, n->node, lv_flags_to_str(n->flags));
                        }
                }
        }