Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in
Toggle navigation
Menu
Open sidebar
Zwinkau
libfirm
Commits
1693ad23
Commit
1693ad23
authored
Jul 23, 2015
by
Christoph Mallon
Browse files
irverify: Remove the parameter 'irg' from verify_new_node().
parent
4d3a8fe4
Changes
7
Hide whitespace changes
Inline
Side-by-side
include/libfirm/ircons.h
View file @
1693ad23
...
...
@@ -679,7 +679,7 @@ FIRM_API void irg_finalize_cons(ir_graph *irg);
* The normal node constructors already call this function, you only need to
* call this yourself if you create new node constructors on your own.
*/
FIRM_API
void
verify_new_node
(
ir_graph
*
irg
,
ir_node
*
node
);
FIRM_API
void
verify_new_node
(
ir_node
*
node
);
/**
* Register a new callback for the case that the value of an uninitialized
...
...
ir/be/benode.c
View file @
1693ad23
...
...
@@ -435,7 +435,7 @@ ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode,
for
(
int
i
=
0
;
i
<
n_ins
;
++
i
)
{
info
->
in_reqs
[
i
]
=
req
;
}
verify_new_node
(
irg
,
phi
);
verify_new_node
(
phi
);
phi
=
optimize_node
(
phi
);
return
phi
;
}
...
...
@@ -467,7 +467,7 @@ ir_node *be_complete_Phi(ir_node *const phi, unsigned const n_ins, ir_node **con
backend_info_t
*
const
info
=
be_get_info
(
phi
);
info
->
in_reqs
=
in_reqs
;
verify_new_node
(
irg
,
phi
);
verify_new_node
(
phi
);
return
optimize_node
(
phi
);
}
...
...
ir/be/scripts/generate_new_opcodes.pl
View file @
1693ad23
...
...
@@ -365,7 +365,7 @@ EOF
}
$temp
.=
<<EOF;
verify_new_node(
irg,
res);
verify_new_node(res);
return optimize_node(res);
EOF
...
...
ir/ir/ircons.c
View file @
1693ad23
...
...
@@ -66,7 +66,7 @@ ir_node *new_rd_ASM(dbg_info *db, ir_node *block, ir_node *mem,
MEMCPY
(
a
->
output_constraints
,
outputs
,
n_outs
);
MEMCPY
(
a
->
clobbers
,
clobber
,
n_clobber
);
verify_new_node
(
irg
,
res
);
verify_new_node
(
res
);
res
=
optimize_node
(
res
);
return
res
;
}
...
...
@@ -91,7 +91,7 @@ static inline ir_node *new_rd_Phi0(dbg_info *dbgi, ir_node *block,
ir_graph
*
irg
=
get_irn_irg
(
block
);
ir_node
*
res
=
new_ir_node
(
dbgi
,
irg
,
block
,
op_Phi
,
mode
,
0
,
NULL
);
res
->
attr
.
phi
.
u
.
pos
=
pos
;
verify_new_node
(
irg
,
res
);
verify_new_node
(
res
);
return
res
;
}
...
...
@@ -168,7 +168,7 @@ static ir_node *set_phi_arguments(ir_node *phi, int pos)
phi
->
attr
.
phi
.
u
.
backedge
=
new_backedge_arr
(
get_irg_obstack
(
irg
),
arity
);
set_irn_in
(
phi
,
arity
,
in
);
verify_new_node
(
irg
,
phi
);
verify_new_node
(
phi
);
try_remove_unnecessary_phi
(
phi
);
...
...
@@ -294,7 +294,7 @@ void mature_immBlock(ir_node *block)
* nodes refer to the unoptimized node.
* We can call optimize_in_place_2(), as global cse has no effect on blocks.
*/
verify_new_node
(
irg
,
block
);
verify_new_node
(
block
);
optimize_in_place_2
(
block
);
}
...
...
@@ -322,7 +322,7 @@ ir_node *new_rd_DivRL(dbg_info *dbgi, ir_node *block, ir_node * irn_mem, ir_node
res
->
attr
.
div
.
resmode
=
resmode
;
res
->
attr
.
div
.
no_remainder
=
1
;
res
->
attr
.
div
.
exc
.
pin_state
=
pin_state
;
verify_new_node
(
irg
,
res
);
verify_new_node
(
res
);
res
=
optimize_node
(
res
);
return
res
;
}
...
...
@@ -350,7 +350,7 @@ ir_node *new_rd_Phi_loop(dbg_info *db, ir_node *block, int arity,
ir_node
*
res
=
new_ir_node
(
db
,
irg
,
block
,
op_Phi
,
mode_M
,
arity
,
in
);
res
->
attr
.
phi
.
u
.
backedge
=
new_backedge_arr
(
get_irg_obstack
(
irg
),
arity
);
res
->
attr
.
phi
.
loop
=
true
;
verify_new_node
(
irg
,
res
);
verify_new_node
(
res
);
ir_node
*
optimized
=
optimize_node
(
res
);
if
(
optimized
==
res
)
keep_alive
(
optimized
);
...
...
@@ -392,7 +392,7 @@ ir_node *new_rd_immBlock(dbg_info *dbgi, ir_graph *irg)
res
->
attr
.
block
.
graph_arr
=
NEW_ARR_DZ
(
ir_node
*
,
get_irg_obstack
(
irg
),
irg
->
n_loc
);
/* Immature block may not be optimized! */
verify_new_node
(
irg
,
res
);
verify_new_node
(
res
);
return
res
;
}
...
...
@@ -606,13 +606,13 @@ ir_node *new_r_Block_noopt(ir_graph *irg, int arity, ir_node *in[])
if
(
irg_is_constrained
(
irg
,
IR_GRAPH_CONSTRAINT_CONSTRUCTION
))
{
res
->
attr
.
block
.
graph_arr
=
NEW_ARR_DZ
(
ir_node
*
,
get_irg_obstack
(
irg
),
irg
->
n_loc
);
}
verify_new_node
(
irg
,
res
);
verify_new_node
(
res
);
return
res
;
}
void
(
verify_new_node
)(
ir_graph
*
irg
,
ir_node
*
node
)
void
(
verify_new_node
)(
ir_node
*
node
)
{
verify_new_node_
(
irg
,
node
);
verify_new_node_
(
node
);
}
ir_node
*
new_rd_Const_null
(
dbg_info
*
const
dbgi
,
ir_graph
*
const
irg
,
ir_mode
*
const
mode
)
...
...
ir/ir/ircons_t.h
View file @
1693ad23
...
...
@@ -17,21 +17,20 @@
#include "irverify_t.h"
#include "compiler.h"
#define verify_new_node(
irg,
node) verify_new_node_(
(irg),
(node))
#define get_cur_block()
_get_cur_block()
#define verify_new_node(node) verify_new_node_((node))
#define get_cur_block() _get_cur_block()
static
inline
ir_node
*
_get_cur_block
(
void
)
{
return
current_ir_graph
->
current_block
;
}
static
inline
void
verify_new_node_
(
ir_
graph
*
irg
,
ir_
node
*
node
)
static
inline
void
verify_new_node_
(
ir_node
*
const
node
)
{
#ifdef DEBUG_libfirm
if
(
UNLIKELY
(
!
irn_verify
_irg
(
node
,
irg
)))
if
(
UNLIKELY
(
!
irn_verify
(
node
)))
abort
();
#else
(
void
)
irg
;
(
void
)
node
;
#endif
}
...
...
ir/opt/reassoc.c
View file @
1693ad23
...
...
@@ -124,7 +124,7 @@ static ir_node *create_node(dbg_info *dbgi, ir_node *block, ir_op *op,
{
ir_graph
*
irg
=
get_irn_irg
(
block
);
ir_node
*
new
=
new_ir_node
(
dbgi
,
irg
,
block
,
op
,
mode
,
n_in
,
in
);
verify_new_node
(
irg
,
new
);
verify_new_node
(
new
);
return
optimize_node
(
new
);
}
...
...
scripts/templates/gen_irnode.c
View file @
1693ad23
...
...
@@ -82,7 +82,7 @@ ir_node *new_rd_{{node.name}}(
{
%-
endfor
%
}
{
%-
endif
%
}
{{
-
node
.
init
}}
verify_new_node
(
irg
,
res
);
verify_new_node
(
res
);
res
=
optimize_node
(
res
);
{{
-
node
.
init_after_opt
}}
return
res
;
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment