X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fopt%2Freassoc.h;h=3f15bdd2a52bc1a3c4c2998d4e5e3d6ef05fb9b5;hb=8df5c7fd80e2ecfb8bb896b426cf47335deb7bdf;hp=2383f7d3a18e7ceac4adaf99fb1934c36393934b;hpb=615fd2b49b3af731671b98e471563ad0aff27cc4;p=libfirm

diff --git a/ir/opt/reassoc.h b/ir/opt/reassoc.h
index 2383f7d3a..3f15bdd2a 100644
--- a/ir/opt/reassoc.h
+++ b/ir/opt/reassoc.h
@@ -13,6 +13,7 @@
  * @file reassoc.h
  *
  * Reassociation optimization.
+ * Uses the "firm.opt.reassoc" debug space
  *
  * @author Michael Beck
  */
@@ -23,13 +24,18 @@
 
 /** Reassociation.
  *
- * Applies Reassiciation rules to integer expressions.
+ * Applies Reassociation rules to integer expressions.
  * Beware: Works only if integer overflow might be ignored, as for C, Java
  * and for address expression.
  * Works only if Constant folding is activated.
  *
+ * Uses loop information to detect loop-invariant (ie contant
+ * inside the loop) values.
+ *
  * See Muchnik 12.3.1 Algebraic Simplification and Reassociation of
  * Addressing Expressions.
+ *
+ *
  */
 void optimize_reassociation(ir_graph *irg);