never move around flag mofying nodes

[libfirm] / ir / ana / callgraph.c

diff --git a/ir/ana/callgraph.c b/ir/ana/callgraph.c
index 9928108..9ae1dee 100644 (file)
--- a/ir/ana/callgraph.c
+++ b/ir/ana/callgraph.c
@@ -1,13 +1,28 @@
 /*
- * Project:     libFIRM
- * File name:   ir/ana/callgraph.c
- * Purpose:     Representation and computation of the callgraph.
- * Author:      Goetz Lindenmaier
- * Modified by:
- * Created:     21.7.2004
- * CVS-ID:      $Id$
- * Copyright:   (c) 2004-2007 Universität Karlsruhe
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
+ * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief       Representation and computation of the callgraph.
+ * @author      Goetz Lindenmaier
+ * @date        21.7.2004
+ * @version     $Id$
  */
 #ifdef HAVE_CONFIG_H
 # include "config.h"
@@ -214,6 +229,7 @@ double get_irg_caller_method_execution_frequency(ir_graph *irg, int pos) {
 static void ana_Call(ir_node *n, void *env) {
        int i, n_callees;
        ir_graph *irg;
+       (void) env;
 
        if (! is_Call(n)) return;
 
@@ -683,7 +699,6 @@ is_head(ir_graph *n, ir_graph *root)
                        some_outof_loop = 1;
                } else {
                        if (get_irg_uplink(pred) < get_irg_uplink(root))  {
-                               DDMG(pred); DDMG(root);
                                assert(get_irg_uplink(pred) >= get_irg_uplink(root));
                        }
                        some_in_loop = 1;
@@ -714,7 +729,6 @@ is_endless_head(ir_graph *n, ir_graph *root)
                        some_outof_loop = 1;
                } else {
                        if(get_irg_uplink(pred) < get_irg_uplink(root)) {
-                               DDMG(pred); DDMG(root);
                                assert(get_irg_uplink(pred) >= get_irg_uplink(root));
                        }
                        some_in_loop = 1;
@@ -1189,6 +1203,7 @@ static void compute_method_execution_frequency(ir_graph *irg, void *env) {
        double freq;
        int    found_edge;
        int    n_callees;
+       (void) env;
 
        if (cg_irg_visited(irg)) return;