X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeblocksched.c;h=11fb8c0a1211ca8a95097d8342e5acf5a38e2581;hb=9eeb2b41dc3c1fe19973b57b5454d651f95424e6;hp=cbfb98d5c83dced10f8ef9fce6848061f1cdba63;hpb=d935aa267d00966c360931d2f0f43008030c0592;p=libfirm

diff --git a/ir/be/beblocksched.c b/ir/be/beblocksched.c
index cbfb98d5c..11fb8c0a1 100644
--- a/ir/be/beblocksched.c
+++ b/ir/be/beblocksched.c
@@ -34,9 +34,7 @@
  * a next and prev pointers on blocks. The greedy algorithm sorts the edges by
  * execution frequencies and tries to transform them to fallthroughs in this order
  */
-#ifdef HAVE_CONFIG_H
 #include "config.h"
-#endif
 
 #include "beblocksched.h"
 
@@ -508,7 +506,6 @@ static void collect_egde_frequency_ilp(ir_node *block, void *data)
 	}
 	else {
 		int i;
-		int *edgenums = alloca(sizeof(edgenums[0]) * arity);
 
 		snprintf(name, sizeof(name), "block_in_constr_%ld", get_irn_node_nr(block));
 		cst = lpp_add_cst_uniq(env->lpp, name, lpp_greater, arity - 1);