void set_irg_loop(ir_graph *irg, ir_loop *l);
ir_loop *get_irg_loop(ir_graph *irg);
-/** Returns the loop n is contained in.
- assumes current_ir_graph set properly. */
-/* @@@ @@@ @@@ @@@@ @@@
- current impl is very expensive: O(#nodes in irg).
- Is used by heapanal (O(#phi)) --> better impl required. */
+/** Returns the loop n is contained in. NULL if node is in no loop. */
ir_loop *get_irn_loop(ir_node *n);
/** Returns outer loop, itself if outermost. */
kind pointer, an ir_node* or an ir_loop*. */
loop_element get_loop_element (ir_loop *loop, int pos);
+/** Returns the element number of the loop son in loop.
+ * Returns -1 if not found. O(#elements). */
+int get_loop_element_pos(ir_loop *loop, void *le);
+
+/** Returns a unique node number for the loop node to make output
+ readable. Casten pointer if libfirm_debug not set. */
+int get_loop_loop_nr(ir_loop *loop);
+
+/** A field to connect additional information to a loop. Only valid
+ if libfirm_debug is set, else returns NULL. */
+void set_loop_link (ir_loop *loop, void *link);
+void *get_loop_link (const ir_loop *loop);
+
/*
* Constructing and destructing the loop/backedge information.
*/