X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive.c;h=8a81f54dcc9d9817e039d37c2740b05674fca017;hb=4d808298b72e72bd06c7466e837dd9dda4eb1070;hp=f44d77449092ad0c1806e53df0eef07e542aa741;hpb=79c525957c65f251d66263891a3f53688fe0c736;p=libfirm

diff --git a/ir/be/belive.c b/ir/be/belive.c
index f44d77449..8a81f54dc 100644
--- a/ir/be/belive.c
+++ b/ir/be/belive.c
@@ -525,7 +525,7 @@ static void compute_liveness(be_lv_t *lv)
 	/*
 	 * inserting the variables sorted by their ID is probably
 	 * more efficient since the binary sorted set insertion
-	 * will not need to move arounf the data.
+	 * will not need to move around the data.
 	 * However, if sorting the variables a priori pays off
 	 * needs to be checked, hence the define.
 	 */
@@ -620,7 +620,11 @@ void be_liveness_recompute(be_lv_t *lv)
 void be_liveness_free(be_lv_t *lv)
 {
 	be_liveness_invalidate(lv);
-	free(lv);
+#ifdef USE_LIVE_CHK
+	lv_chk_free(lv->lvc);
+	dfs_free(lv->dfs);
+#endif
+	xfree(lv);
 }
 
 void be_liveness_remove(be_lv_t *lv, const ir_node *irn)