X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Firloop_t.h;h=514fb16b89a3af9cd990bd8707cc17f65d608b7b;hb=957f09e423ff72a702b00f0d4d5df18e10f0b2b1;hp=b32a56de8cb221be4a549b53de8af61fc04b4a6b;hpb=427f3beeb5d575e58b41c156f352e9dea708132a;p=libfirm

diff --git a/ir/ana/irloop_t.h b/ir/ana/irloop_t.h
index b32a56de8..514fb16b8 100644
--- a/ir/ana/irloop_t.h
+++ b/ir/ana/irloop_t.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (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.
  *
@@ -36,14 +36,14 @@
  * Possible loop flags, can be or'ed.
  */
 typedef enum loop_flags {
-  loop_is_count_loop = 0x00000001,  /**< if set it's a counting loop */
-  loop_downto_loop   = 0x00000002,  /**< if set, it's a downto loop, else an upto loop */
-  loop_is_endless    = 0x00000004,  /**< if set, this is an endless loop */
-  loop_is_dead       = 0x00000008,  /**< if set, it's a dead loop ie will never be entered */
-  loop_wrap_around   = 0x00000010,  /**< this loop is NOT endless, because of wrap around */
-  loop_end_false     = 0x00000020,  /**< this loop end can't be computed "from compute_loop_info.c" */
-  do_loop            = 0x00000040,  /**< this is a do loop */
-  once               = 0x00000080,  /**< this is a do loop, with a false condition.It itarate once */
+	loop_is_count_loop = 0x00000001,  /**< if set it's a counting loop */
+	loop_downto_loop   = 0x00000002,  /**< if set, it's a downto loop, else an upto loop */
+	loop_is_endless    = 0x00000004,  /**< if set, this is an endless loop */
+	loop_is_dead       = 0x00000008,  /**< if set, it's a dead loop ie will never be entered */
+	loop_wrap_around   = 0x00000010,  /**< this loop is NOT endless, because of wrap around */
+	loop_end_false     = 0x00000020,  /**< this loop end can't be computed "from compute_loop_info.c" */
+	do_loop            = 0x00000040,  /**< this is a do loop */
+	once               = 0x00000080,  /**< this is a do loop, with a false condition.It itarate once */
 } loop_flags_t;
 
 /**
@@ -63,26 +63,31 @@ typedef enum loop_flags {
  * this would cost a lot of memory, though.
  */
 struct ir_loop {
-  firm_kind kind;		    /**< A type tag, set to k_ir_loop. */
-
-  struct ir_loop *outer_loop;       /**< The outer loop */
-  loop_element   *children;         /**< Mixed array: Contains sons and loop_nodes */
-  int depth;                        /**< Nesting depth */
-  int n_sons;                       /**< Number of ir_nodes in array "children" */
-  int n_nodes;                      /**< Number of loop_nodes in array "children" */
-  unsigned flags;                   /**< a set of loop_flags_t */
-  tarval  *loop_iter_start;         /**< counting loop: the start value */
-  tarval  *loop_iter_end;           /**< counting loop: the last value reached */
-  tarval  *loop_iter_increment;     /**< counting loop: the increment */
-  ir_node *loop_iter_variable;      /**< The iteration variable of counting loop.*/
-
-  void *link;                       /**< link field. */
+	firm_kind kind;                   /**< A type tag, set to k_ir_loop. */
+
+	struct ir_loop *outer_loop;       /**< The outer loop */
+	loop_element   *children;         /**< Mixed flexible array: Contains sons and loop_nodes */
+	int depth;                        /**< Nesting depth */
+	int n_sons;                       /**< Number of ir_nodes in array "children" */
+	int n_nodes;                      /**< Number of loop_nodes in array "children" */
+	unsigned flags;                   /**< a set of loop_flags_t */
+	tarval  *loop_iter_start;         /**< counting loop: the start value */
+	tarval  *loop_iter_end;           /**< counting loop: the last value reached */
+	tarval  *loop_iter_increment;     /**< counting loop: the increment */
+	ir_node *loop_iter_variable;      /**< The iteration variable of counting loop.*/
+
+	void *link;                       /**< link field. */
 #ifdef DEBUG_libfirm
-  long loop_nr;            /**< a unique node number for each loop node to make output
-			      readable. */
+	long loop_nr;                     /**< A unique node number for each loop node to make output
+	                                       readable. */
 #endif
 };
 
+/**
+ * Allocates a new loop as son of father on the given obstack.
+ * If father is equal NULL, a new root loop is created.
+ */
+ir_loop *alloc_loop(ir_loop *father, struct obstack *obst);
 
 /** Add a son loop to a father loop. */
 void add_loop_son(ir_loop *loop, ir_loop *son);
@@ -93,47 +98,53 @@ void add_loop_node(ir_loop *loop, ir_node *n);
 /** Sets the loop a node belonging to. */
 void set_irn_loop(ir_node *n, ir_loop *loop);
 
+/**
+ * Mature all loops by removing the flexible arrays of a loop tree
+ * and putting them on the given obstack.
+ */
+void mature_loops(ir_loop *loop, struct obstack *obst);
+
 /* -------- INLINE functions -------- */
 
 static INLINE int
 _is_ir_loop(const void *thing) {
-  return (get_kind(thing) == k_ir_loop);
+	return get_kind(thing) == k_ir_loop;
 }
 
 static INLINE void
 _set_irg_loop(ir_graph *irg, ir_loop *loop) {
-  assert(irg);
-  irg->loop = loop;
+	assert(irg);
+	irg->loop = loop;
 }
 
 static INLINE ir_loop *
 _get_irg_loop(ir_graph *irg) {
-  assert(irg);
-  return irg->loop;
+	assert(irg);
+	return irg->loop;
 }
 
 static INLINE ir_loop *
 _get_loop_outer_loop(const ir_loop *loop) {
-  assert(_is_ir_loop(loop));
-  return loop->outer_loop;
+	assert(_is_ir_loop(loop));
+	return loop->outer_loop;
 }
 
 static INLINE int
 _get_loop_depth(const ir_loop *loop) {
-  assert(_is_ir_loop(loop));
-  return loop->depth;
+	assert(_is_ir_loop(loop));
+	return loop->depth;
 }
 
 static INLINE int
 _get_loop_n_sons(const ir_loop *loop) {
-  assert(_is_ir_loop(loop));
-  return loop->n_sons;
+	assert(_is_ir_loop(loop));
+	return loop->n_sons;
 }
 
 /* Uses temporary information to get the loop */
 static INLINE ir_loop *
 _get_irn_loop(const ir_node *n) {
-  return n->loop;
+	return n->loop;
 }
 
 #define is_ir_loop(thing)         _is_ir_loop(thing)