cleanup space generation logic and make it more robust for union constructs

[libfirm] / ir / arch / archop.c

diff --git a/ir/arch/archop.c b/ir/arch/archop.c
index 3145943..0ca77fd 100644 (file)
--- a/ir/arch/archop.c
+++ b/ir/arch/archop.c
@@ -1,5 +1,5 @@
 /*
- * Copyrigth (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -19,7 +19,7 @@
 
 /**
  * @file
- * @brief     architecture dependand IR operations
+ * @brief     architecture dependant IR operations
  * @version   $Id$
  */
 #ifdef HAVE_CONFIG_H
@@ -304,12 +304,13 @@ static int verify_node_MinMax(ir_node *n, ir_graph *irg) {
   ir_mode *mymode  = get_irn_mode(n);
   ir_mode *op1mode = get_irn_mode(get_binop_left(n));
   ir_mode *op2mode = get_irn_mode(get_binop_right(n));
+  (void) irg;
 
   ASSERT_AND_RET(
     /* MinMax: BB x numP x numP --> numP */
     op1mode == mymode &&
     op2mode == mymode &&
-    mode_is_numP(mymode),
+    mode_is_data(mymode),
     "Min or Max node", 0
   );
   return 1;