Commit d3ad0b49 authored by Christoph Mallon's avatar Christoph Mallon
Browse files

irverify: Inline irn_verify_irg() into its only caller irn_verify().

parent e0381c84
...@@ -27,13 +27,6 @@ ...@@ -27,13 +27,6 @@
*/ */
FIRM_API int irn_verify(const ir_node *node); FIRM_API int irn_verify(const ir_node *node);
/**
* Tests @p node for well-formedness assuming that it is part of graph @p irg.
* @see irn_verify()
* @return NON-zero if no problems were found
*/
FIRM_API int irn_verify_irg(const ir_node *checknode, ir_graph *irg);
/** /**
* Calls irn_verify() for each node in irg. Also checks some global properties * Calls irn_verify() for each node in irg. Also checks some global properties
* like all (non-phi) operands dominating their points of usage; Also checks * like all (non-phi) operands dominating their points of usage; Also checks
......
...@@ -1018,13 +1018,9 @@ static bool check_irn_storage(ir_graph *irg, const ir_node *node) ...@@ -1018,13 +1018,9 @@ static bool check_irn_storage(ir_graph *irg, const ir_node *node)
} }
#endif #endif
int irn_verify_irg(const ir_node *n, ir_graph *irg) int irn_verify(const ir_node *const n)
{ {
/* early abort if we have an irg mismatch */ ir_graph *const irg = get_irn_irg(n);
if (get_irn_irg(n) != irg) {
warn(n, "get_irn_irg() != %+F", irg);
return false;
}
bool fine = true; bool fine = true;
/* check_irn_storage is an expensive check for large graphs (it has a /* check_irn_storage is an expensive check for large graphs (it has a
...@@ -1068,11 +1064,6 @@ int irn_verify_irg(const ir_node *n, ir_graph *irg) ...@@ -1068,11 +1064,6 @@ int irn_verify_irg(const ir_node *n, ir_graph *irg)
return fine; return fine;
} }
int irn_verify(const ir_node *n)
{
return irn_verify_irg(n, get_irn_irg(n));
}
/** /**
* Walker to check every node * Walker to check every node
*/ */
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment