X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Firloop_t.h;h=8996a0a14283db5ffb77546d42ec9bd463fc680f;hb=d5d7159c209a9e5c5fa276f770b5b28a217990a8;hp=62d0ee15b062e71dcd4281cfb2a765980a9c542b;hpb=9b716841c3b0865b86af8d3890b3914060c37ed0;p=libfirm diff --git a/ir/ana/irloop_t.h b/ir/ana/irloop_t.h index 62d0ee15b..8996a0a14 100644 --- a/ir/ana/irloop_t.h +++ b/ir/ana/irloop_t.h @@ -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. * @@ -36,45 +36,55 @@ * 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 iterate exactly once. */ + loop_outer_loop = 0x00000100 /**< if set, this loop has child loops (is a no leaf). */ } loop_flags_t; -/** The loops datastructure. */ +/** + * The loops data structure. + * + * The loops data structure represents circles in the intermediate + * representation. It does not represent loops in the terms of a + * source program. + * Each ir_graph can contain one outermost loop data structure. + * loop is the entry point to the nested loops. + * The loop data structure contains a field indicating the depth of + * the loop within the nesting. Further it contains a list of the + * loops with nesting depth -1. Finally it contains a list of all + * nodes in the loop. + */ 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.*/ - - /* - struct state_entry *mem_phis; - struct state_entry *states; - - struct obset **oval; - struct loop_node *link; - */ + firm_kind kind; /**< A type tag, set to k_ir_loop. */ + unsigned depth; /**< Nesting depth */ + size_t n_sons; /**< Number of ir_nodes in array "children" */ + size_t n_nodes; /**< Number of loop_nodes in array "children" */ + unsigned flags; /**< a set of loop_flags_t */ + struct ir_loop *outer_loop; /**< The outer loop */ + loop_element *children; /**< Mixed flexible array: Contains sons and loop_nodes */ + ir_tarval *loop_iter_start; /**< counting loop: the start value */ + ir_tarval *loop_iter_end; /**< counting loop: the last value reached */ + ir_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. */ - void *link; /**< GL @@@ For debugging the analyses. */ + 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); @@ -82,50 +92,59 @@ void add_loop_son(ir_loop *loop, ir_loop *son); /** Add a node to a loop. */ void add_loop_node(ir_loop *loop, ir_node *n); +/** Add an IR graph to a loop. */ +void add_loop_irg(ir_loop *loop, ir_graph *irg); + /** Sets the loop a node belonging to. */ void set_irn_loop(ir_node *n, ir_loop *loop); -/* -------- INLINE functions -------- */ +/** + * 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); +static inline int _is_ir_loop(const void *thing) +{ + return get_kind(thing) == k_ir_loop; } -static INLINE void -_set_irg_loop(ir_graph *irg, ir_loop *loop) { - assert(irg); - irg->loop = loop; +static inline void _set_irg_loop(ir_graph *irg, ir_loop *loop) +{ + assert(irg); + irg->loop = loop; } -static INLINE ir_loop * -_get_irg_loop(ir_graph *irg) { - assert(irg); - return irg->loop; +static inline ir_loop *_get_irg_loop(const ir_graph *irg) +{ + 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; +static inline ir_loop *_get_loop_outer_loop(const ir_loop *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; +static inline unsigned _get_loop_depth(const ir_loop *loop) +{ + 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; +static inline size_t _get_loop_n_sons(const ir_loop *loop) +{ + 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; +static inline ir_loop *_get_irn_loop(const ir_node *n) +{ + return n->loop; } #define is_ir_loop(thing) _is_ir_loop(thing)