* Modified by:
* Created: 6.2005
* CVS-ID: $Id$
- * Copyright: (C) 2002-2005 Universität Karlsruhe
+ * Copyright: (C) 2002-2005 University of Karlsruhe
* Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
*
* @author Michael Beck
*/
-#ifndef _IRCONSCONFIRM_H_
-#define _IRCONSCONFIRM_H_
+#ifndef _FIRM_ANA_IRCONSCONFIRM_H_
+#define _FIRM_ANA_IRCONSCONFIRM_H_
-#include "irgraph.h"
+#include "firm_types.h"
/*
* Inject Confirm nodes into a graph.
* b.
*
* These allows to do some range dependent optimizations for Cmp,
- * Abs, Min, Max nodes as well as bounds checking removement.
+ * Abs, Min, Max nodes as well as bounds checking deletion.
*
* The heap analysis might profit also. On the other side, Confirm
* nodes disturb local optimizations, because patterns are destroyed.
*/
void remove_confirms(ir_graph *irg);
-#endif /* _IRCONSCONFIRM_H_ */
+#endif /* _FIRM_ANA_IRCONSCONFIRM_H_ */