bechordal: Fully use the information provided by the borders to simplify assignment...

[libfirm] / ir / be / beinfo.h

diff --git a/ir/be/beinfo.h b/ir/be/beinfo.h
index 76a5eea..27bbe6e 100644 (file)
--- a/ir/be/beinfo.h
+++ b/ir/be/beinfo.h
@@ -1,27 +1,12 @@
 /*
- * Copyright (C) 1995-2011 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.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
 /**
  * @file
  * @brief       additional backend node infos
  * @author      Matthias Braun
- * @version     $Id$
  */
 #ifndef FIRM_BE_BEINFO_H
 #define FIRM_BE_BEINFO_H
@@ -55,15 +40,14 @@ struct backend_info_t {
 
 static inline backend_info_t *be_get_info(const ir_node *node)
 {
+       assert(!is_Proj(node));
        return (backend_info_t*) node->backend_info;
 }
 
 void be_info_init(void);
 void be_info_free(void);
 void be_info_init_irg(ir_graph *irg);
-void be_info_new_node(ir_node *node);
-void be_info_duplicate(const ir_node *old_node, ir_node *new_node);
-int be_info_initialized(const ir_graph *irg);
+void be_info_new_node(ir_graph *irg, ir_node *node);
 
 int be_nodes_equal(const ir_node *node1, const ir_node *node2);