X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeblocksched.c;h=97184dfe3b2beb79acadc3939b136799436682ab;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=470ad902fbded2e52972dcda19a3abff7acfa15c;hpb=f8dfdaaff8e4f364da8494fd35a9bb2f8c267e7f;p=libfirm

diff --git a/ir/be/beblocksched.c b/ir/be/beblocksched.c
index 470ad902f..97184dfe3 100644
--- a/ir/be/beblocksched.c
+++ b/ir/be/beblocksched.c
@@ -22,7 +22,6 @@
  * @brief       Block-scheduling strategies.
  * @author      Matthias Braun, Christoph Mallon
  * @date        27.09.2006
- * @version     $Id$
  *
  * The goals of the greedy (and ILP) algorithm here works by assuming that
  * we want to change as many jumps to fallthroughs as possible (executed jumps