*/
#include "config.h"
+#include "irnode_t.h"
#include "irprog.h"
#include "irop_t.h"
#include "irgraph_t.h"
#include "irnodeset.h"
#include "ircons.h"
-/** if this flag is set, verify entity types in Load & Store nodes */
-static int verify_entities = 0;
-
const char *firm_verify_failure_msg;
-void verify_enable_entity_tests(int enable)
-{
- verify_entities = enable;
-}
-
#ifndef NDEBUG
/**
get_mode_name_ex(m));
}
-/**
- * Prints a failure message for a proj
- */
-static void show_proj_failure_ent(const ir_node *n, ir_entity *ent)
-{
- ir_node *op = get_Proj_pred(n);
- int proj = get_Proj_proj(n);
- ir_mode *m = get_type_mode(get_entity_type(ent));
- char type_name[256];
- ir_print_type(type_name, sizeof(type_name), get_entity_type(ent));
-
- show_entity_failure(n);
- fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
- get_irn_node_nr(n),
- get_irn_opname(n), get_irn_modename(n), proj,
- get_irn_opname(op), get_irn_modename(op),
- get_entity_name(ent), type_name,
- get_mode_name_ex(m));
-}
-
/**
* Show a node and a graph
*/
*/
static void show_call_param(const ir_node *n, ir_type *mt)
{
- size_t i;
char type_name[256];
ir_print_type(type_name, sizeof(type_name), mt);
show_entity_failure(n);
fprintf(stderr, " Call type-check failed: %s(", type_name);
- for (i = 0; i < get_method_n_params(mt); ++i) {
+ size_t n_method_params = get_method_n_params(mt);
+ for (size_t i = 0; i < n_method_params; ++i) {
fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
}
fprintf(stderr, ") != CALL(");
- for (i = 0; i < get_Call_n_params(n); ++i) {
+ int n_params = get_Call_n_params(n);
+ for (int i = 0; i < n_params; ++i) {
fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
}
fprintf(stderr, ")\n");
#endif /* #ifndef NDEBUG */
-/**
- * If the address is Sel or SymConst, return the entity.
- *
- * @param ptr the node representing the address
- */
-static ir_entity *get_ptr_entity(const ir_node *ptr)
-{
- if (is_Sel(ptr)) {
- return get_Sel_entity(ptr);
- } else if (is_SymConst_addr_ent(ptr)) {
- return get_SymConst_entity(ptr);
- }
- return NULL;
-}
-
/**
* verify a Proj(Start) node
*/
(proj == pn_Div_M && mode == mode_M) ||
(proj == pn_Div_X_regular && mode == mode_X) ||
(proj == pn_Div_X_except && mode == mode_X) ||
- (proj == pn_Div_res && mode_is_data(mode) && mode == get_Div_resmode(n))
+ (proj == pn_Div_res && mode == get_Div_resmode(n))
),
"wrong Proj from Div", 0,
show_proj_failure(p);
long proj = get_Proj_proj(p);
if (proj == pn_Load_res) {
- ir_node *ptr = get_Load_ptr(n);
- ir_entity *ent = get_ptr_entity(ptr);
- ir_graph *irg = get_irn_irg(n);
-
- if (verify_entities && ent && get_irg_phase_state(irg) == phase_high) {
- /* do NOT check this for lowered phases, see comment on Store */
- ASSERT_AND_RET_DBG(
- (mode == get_type_mode(get_entity_type(ent))),
- "wrong data Proj from Load, entity type_mode failed", 0,
- show_proj_failure_ent(p, ent);
- );
- }
- else {
- ASSERT_AND_RET_DBG(
- mode_is_data(mode) && mode == get_Load_mode(n),
- "wrong data Proj from Load", 0,
- show_proj_failure(p);
- );
- }
- }
- else {
+ ASSERT_AND_RET_DBG(
+ mode_is_data(mode) && mode == get_Load_mode(n),
+ "wrong data Proj from Load", 0,
+ show_proj_failure(p);
+ );
+ } else {
ASSERT_AND_RET_DBG(
(
(proj == pn_Load_M && mode == mode_M) ||
if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
/* value argument */ break;
- if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
+ if (!irg_is_constrained(get_irn_irg(pred), IR_GRAPH_CONSTRAINT_BACKEND)) {
ASSERT_AND_RET_DBG(
(mode == get_type_mode(get_method_param_type(mt, proj))),
"Mode of Proj from Start doesn't match mode of param type.", 0,
return 1;
}
-/**
- * verify a Proj(Bound) node
- */
-static int verify_node_Proj_Bound(const ir_node *p)
-{
- ir_mode *mode = get_irn_mode(p);
- ir_node *n = get_Proj_pred(p);
- long proj = get_Proj_proj(p);
-
- ASSERT_AND_RET_DBG(
- (
- (proj == pn_Bound_M && mode == mode_M) ||
- (proj == pn_Bound_X_regular && mode == mode_X) ||
- (proj == pn_Bound_X_except && mode == mode_X) ||
- (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
- ),
- "wrong Proj from Bound", 0,
- show_proj_failure(p);
- );
- return 1;
-}
-
static int verify_node_Proj_fragile(const ir_node *node)
{
ir_node *pred = get_Proj_pred(node);
ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
}
- if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend) {
+ if (n == get_irg_end_block(irg) && !irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
/* End block may only have Return, Raise or fragile ops as preds. */
for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
/* Compare returned results with result types of method type */
mt = get_entity_type(get_irg_entity(irg));
- ASSERT_AND_RET_DBG(get_Return_n_ress(n) == get_method_n_ress(mt),
+ ASSERT_AND_RET_DBG((size_t)get_Return_n_ress(n) == get_method_n_ress(mt),
"Number of results for Return doesn't match number of results in type.", 0,
show_return_nres(irg, n, mt););
for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
ir_type *res_type = get_method_res_type(mt, i);
- if (get_irg_phase_state(irg) != phase_backend) {
+ if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
if (is_atomic_type(res_type)) {
ASSERT_AND_RET_DBG(
get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
if (get_method_variadicity(mt) == variadicity_variadic) {
ASSERT_AND_RET_DBG(
- get_Call_n_params(n) >= get_method_n_params(mt),
+ (size_t)get_Call_n_params(n) >= get_method_n_params(mt),
"Number of args for Call doesn't match number of args in variadic type.",
0,
ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
);
} else {
ASSERT_AND_RET_DBG(
- get_Call_n_params(n) == get_method_n_params(mt),
+ (size_t)get_Call_n_params(n) == get_method_n_params(mt),
"Number of args for Call doesn't match number of args in non variadic type.",
0,
ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
for (i = 0; i < get_method_n_params(mt); i++) {
ir_type *t = get_method_param_type(mt, i);
- if (get_irg_phase_state(irg) != phase_backend) {
+ if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
if (is_atomic_type(t)) {
ASSERT_AND_RET_DBG(
get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
ir_mode *op2mode = get_irn_mode(get_Div_left(n));
ir_mode *op3mode = get_irn_mode(get_Div_right(n));
+ ir_mode *resmode = get_Div_resmode(n);
ASSERT_AND_RET(
- /* Div: BB x M x data x data --> M x X x data */
- op1mode == mode_M &&
- op2mode == op3mode &&
- mode_is_data(op2mode) &&
+ /* Div: BB x M x num x num --> M x X x num */
+ op1mode == mode_M &&
+ op2mode == resmode &&
+ op3mode == resmode &&
+ mode_is_num(resmode) &&
mymode == mode_T,
"Div node", 0
);
ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
+ ir_mode *resmode = get_Mod_resmode(n);
ASSERT_AND_RET(
/* Mod: BB x M x int x int --> M x X x int */
- op1mode == mode_M &&
- op2mode == op3mode &&
- mode_is_int(op2mode) &&
+ op1mode == mode_M &&
+ op2mode == resmode &&
+ op3mode == resmode &&
+ mode_is_int(resmode) &&
mymode == mode_T,
"Mod node", 0
);
return 1;
}
-/**
- * verify a Cast node
- */
-static int verify_node_Cast(const ir_node *n)
-{
- ir_mode *mymode = get_irn_mode(n);
- ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
-
- ASSERT_AND_RET_DBG(
- /* Conv: BB x datab1 --> datab2 */
- mode_is_data(op1mode) && op1mode == mymode,
- "Cast node", 0,
- show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
- );
- return 1;
-}
-
/**
* verify a Phi node
*/
/* a Phi node MUST have the same number of inputs as its block
* Exception is a phi with 0 inputs which is used when (re)constructing the
* SSA form */
- if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
+ if (! is_Bad(block)
+ && !irg_is_constrained(get_irn_irg(n), IR_GRAPH_CONSTRAINT_CONSTRUCTION)
+ && get_irn_arity(n) > 0) {
ASSERT_AND_RET_DBG(
get_irn_arity(n) == get_irn_arity(block),
"wrong number of inputs in Phi node", 0,
ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
- if (get_irg_phase_state(irg) != phase_backend) {
+ if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
}
ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
- /*
- * jack's gen_add_firm_code:simpleSel seems to build Load (Load
- * (Proj (Proj))) sometimes ...
-
- * interprete.c:ai_eval seems to assume that this happens, too
-
- * obset.c:get_abstval_any can't deal with this if the load has
- * mode_T
- *
- {
- ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
- assert ((NULL != ent) || (mymode != mode_T));
- }
- */
-
return 1;
}
static int verify_node_Store(const ir_node *n)
{
ir_graph *irg = get_irn_irg(n);
- ir_entity *target;
ir_mode *mymode = get_irn_mode(n);
ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
ir_mode *op3mode = get_irn_mode(get_Store_value(n));
ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
- if (get_irg_phase_state(irg) != phase_backend) {
+ if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
}
ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
- target = get_ptr_entity(get_Store_ptr(n));
- if (verify_entities && target && get_irg_phase_state(irg) == phase_high) {
- /*
- * If lowered code, any Sels that add 0 may be removed, causing
- * an direct access to entities of array or compound type.
- * Prevent this by checking the phase.
- */
- ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
- "Store node", 0);
- }
-
return 1;
}
/* CopyB: BB x M x ref x ref --> M x X */
ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
- if (get_irg_phase_state(irg) != phase_backend) {
+ if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
"CopyB node", 0 );
}
return 1;
}
-/**
- * verify a Bound node
- */
-static int verify_node_Bound(const ir_node *n)
-{
- ir_mode *mymode = get_irn_mode(n);
- ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
- ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
- ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
- ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
-
- /* Bound: BB x M x int x int x int --> M x X */
- ASSERT_AND_RET(
- mymode == mode_T &&
- op1mode == mode_M &&
- op2mode == op3mode &&
- op3mode == op4mode &&
- mode_is_int(op3mode),
- "Bound node", 0 );
- return 1;
-}
-
/**
* Check dominance.
* For each usage of a node, it is checked, if the block of the
);
}
+ ASSERT_AND_RET_DBG(
+ !is_irn_start_block_placed(n) || get_nodes_block(n) == get_irg_start_block(irg),
+ "node should be in start block", 0,
+ ir_printf("node %+F", n);
+ );
+
if (op->ops.verify_node)
return op->ops.verify_node(n);
branch = skip_Tuple(branch);
if (is_Bad(branch))
continue;
- former_dest = pmap_get(branch_nodes, branch);
+ former_dest = pmap_get(ir_node, branch_nodes, branch);
ASSERT_AND_RET_DBG(former_dest==NULL || is_unknown_jump(skip_Proj(branch)),
"Multiple users on mode_X node", 0,
ir_printf("node %+F\n", branch);
if (is_Proj(branch)) {
branch = skip_Proj(branch);
}
- former_branch = pmap_get(branch_nodes, branch_block);
+ former_branch = pmap_get(ir_node, branch_nodes, branch_block);
ASSERT_AND_RET_DBG(former_branch == NULL || former_branch == branch,
"Multiple branching nodes in a block", 0,
static int verify_block_branch(const ir_node *block, check_cfg_env_t *env)
{
- ir_node *branch = pmap_get(env->branch_nodes, block);
+ ir_node *branch = pmap_get(ir_node, env->branch_nodes, block);
ASSERT_AND_RET_DBG(branch != NULL
|| ir_nodeset_contains(&env->kept_nodes, block)
|| block == get_irg_end_block(get_irn_irg(block)),
register_verify_node_func(op_Alloc, verify_node_Alloc);
register_verify_node_func(op_And, verify_node_And);
register_verify_node_func(op_Block, verify_node_Block);
- register_verify_node_func(op_Bound, verify_node_Bound);
register_verify_node_func(op_Call, verify_node_Call);
- register_verify_node_func(op_Cast, verify_node_Cast);
register_verify_node_func(op_Cmp, verify_node_Cmp);
register_verify_node_func(op_Cond, verify_node_Cond);
register_verify_node_func(op_Confirm, verify_node_Confirm);
register_verify_node_func(op_Sync, verify_node_Sync);
register_verify_node_func_proj(op_Alloc, verify_node_Proj_Alloc);
- register_verify_node_func_proj(op_Bound, verify_node_Proj_Bound);
register_verify_node_func_proj(op_Call, verify_node_Proj_Call);
register_verify_node_func_proj(op_Cond, verify_node_Proj_Cond);
register_verify_node_func_proj(op_CopyB, verify_node_Proj_CopyB);