X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeschedrss.c;h=45ac22a722929c2044ee7b2832feda70b0000dc4;hb=d4047948864818d91471e727bb973bd6f02f2ff7;hp=5ab8513c2c56c417ff1b748e931a12dec30cdabb;hpb=d2c1b0191844c3c23731158a153838d570dcd65a;p=libfirm

diff --git a/ir/be/beschedrss.c b/ir/be/beschedrss.c
index 5ab8513c2..45ac22a72 100644
--- a/ir/be/beschedrss.c
+++ b/ir/be/beschedrss.c
@@ -55,7 +55,7 @@
 
 #include "beabi.h"
 #include "bemodule.h"
-#include "benode_t.h"
+#include "benode.h"
 #include "besched.h"
 #include "beirg.h"
 #include "belive.h"
@@ -881,7 +881,7 @@ static void build_kill_edges(rss_t *rss, pset *epk) {
 
 		foreach_plist(rirn->pkiller_list, k_el) {
 			ir_node    *pkiller = plist_element_get_value(k_el);
-			rss_edge_t *ke      = obstack_alloc(phase_obst(&rss->ph), sizeof(*ke));
+			rss_edge_t *ke      = OALLOC(phase_obst(&rss->ph), rss_edge_t);
 
 			ke->src  = irn;
 			ke->tgt  = pkiller;
@@ -950,7 +950,7 @@ static void compute_bipartite_decomposition(rss_t *rss) {
 
 		DBG((rss->dbg, LEVEL_2, "\t\t%+F choosen:\n", u_irn));
 
-		cbc     = obstack_alloc(phase_obst(&rss->ph), sizeof(*cbc));
+		cbc     = OALLOC(phase_obst(&rss->ph), cbc_t);
 		cbc->nr = cur_num++;
 
 		/* initialize S_cb */
@@ -1184,8 +1184,7 @@ static void compute_killing_function(rss_t *rss) {
 
 		/* while X not empty */
 		while (ir_nodeset_size(&x) > 0) {
-			child_t *t = obstack_alloc(&obst, sizeof(*t));
-			memset(t, 0, sizeof(*t));
+			child_t *t = OALLOCZ(&obst, child_t);
 
 			t = select_child_max_cost(rss, &x, &y, t, cbc);
 
@@ -1265,7 +1264,7 @@ static inline void add_dvg_edge(rss_t *rss, dvg_t *dvg, const ir_node *src, cons
 	key.tgt = (ir_node *) tgt;
 	if (NULL != pset_find(dvg->edges, &key, HASH_RSS_EDGE(&key))) {
 		/* add the edge to the DVG */
-		dvg_edge = obstack_alloc(phase_obst(&rss->ph), sizeof(*dvg_edge));
+		dvg_edge = OALLOC(phase_obst(&rss->ph), rss_edge_t);
 
 		dvg_edge->src  = (ir_node *) src;
 		dvg_edge->tgt  = (ir_node *) tgt;
@@ -1314,7 +1313,7 @@ static void compute_dvg(rss_t *rss, dvg_t *dvg) {
 				There is an edge (u, v) in the DVG iff v is a descendant of the killer(u).
 			*/
 			if (BSEARCH_IRN_ARR(v_irn, u_kill->descendants)) {
-				rss_edge_t *dvg_edge = obstack_alloc(phase_obst(&rss->ph), sizeof(*dvg_edge));
+				rss_edge_t *dvg_edge = OALLOC(phase_obst(&rss->ph), rss_edge_t);
 				rss_edge_t key;
 
 				/* insert the user into the DVG and append it to the user list of u */
@@ -1579,7 +1578,7 @@ static ir_nodeset_t *compute_maximal_antichain(rss_t *rss, dvg_t *dvg, int itera
 			int       xj      = idx_map[j];
 			ir_node   *xj_irn = get_idx_irn(rss->irg, xj);
 			rss_irn_t *xj_rss = get_rss_irn(rss, xj_irn);
-			chain_t   *c      = obstack_alloc(phase_obst(&rss->ph), sizeof(*c));
+			chain_t   *c      = OALLOC(phase_obst(&rss->ph), chain_t);
 			int       source;
 
 			/* there was no source for j -> we have a source of a new chain */
@@ -1991,7 +1990,7 @@ static void perform_value_serialization_heuristic(rss_t *rss) {
 	sat_vals  = compute_maximal_antichain(rss, &dvg, iteration++);
 	while (sat_vals && (ir_nodeset_size(sat_vals) > available_regs)) {
 		serialization_t *ser, best_ser;
-		rss_edge_t      *edge = obstack_alloc(phase_obst(&rss->ph), sizeof(*edge));
+		rss_edge_t      *edge = OALLOC(phase_obst(&rss->ph), rss_edge_t);
 		ir_node         *dep_src, *dep_tgt;
 
 		best_ser.edge = edge;
@@ -2103,7 +2102,7 @@ static void process_block(ir_node *block, void *env) {
 			*/
 			if (is_Proj(irn)) {
 				ir_node *pred = get_Proj_pred(irn);
-				if (be_is_Barrier(pred) || is_Start(pred))
+				if (be_is_Barrier(pred) || be_is_Start(pred))
 					continue;
 			}