+int node_is_in_irgs_storage(const ir_graph *irg, const ir_node *n);
+
+/*-------------------------------------------------------------------*/
+/* inline functions for graphs */
+/*-------------------------------------------------------------------*/
+
+static inline int is_ir_graph_(const void *thing)
+{
+ return (get_kind(thing) == k_ir_graph);
+}
+
+/** Returns the start block of a graph. */
+static inline ir_node *get_irg_start_block_(const ir_graph *irg)
+{
+ return get_irn_n(irg->anchor, anchor_start_block);
+}
+
+static inline void set_irg_start_block_(ir_graph *irg, ir_node *node)
+{
+ set_irn_n(irg->anchor, anchor_start_block, node);
+}
+
+static inline ir_node *get_irg_start_(const ir_graph *irg)
+{
+ return get_irn_n(irg->anchor, anchor_start);
+}
+
+static inline void set_irg_start_(ir_graph *irg, ir_node *node)
+{
+ set_irn_n(irg->anchor, anchor_start, node);
+}
+
+static inline ir_node *get_irg_end_block_(const ir_graph *irg)
+{
+ return get_irn_n(irg->anchor, anchor_end_block);
+}
+
+static inline void set_irg_end_block_(ir_graph *irg, ir_node *node)
+{
+ set_irn_n(irg->anchor, anchor_end_block, node);
+}
+
+static inline ir_node *get_irg_end_(const ir_graph *irg)
+{
+ return get_irn_n(irg->anchor, anchor_end);
+}
+
+static inline void set_irg_end_(ir_graph *irg, ir_node *node)
+{
+ set_irn_n(irg->anchor, anchor_end, node);
+}
+
+static inline ir_node *get_irg_initial_exec_(const ir_graph *irg)
+{
+ return get_irn_n(irg->anchor, anchor_initial_exec);
+}
+
+static inline void set_irg_initial_exec_(ir_graph *irg, ir_node *node)
+{
+ set_irn_n(irg->anchor, anchor_initial_exec, node);
+}
+
+static inline ir_node *get_irg_frame_(const ir_graph *irg)
+{
+ return get_irn_n(irg->anchor, anchor_frame);
+}
+
+static inline void set_irg_frame_(ir_graph *irg, ir_node *node)
+{
+ set_irn_n(irg->anchor, anchor_frame, node);
+}
+
+static inline ir_node *get_irg_initial_mem_(const ir_graph *irg)
+{
+ return get_irn_n(irg->anchor, anchor_initial_mem);
+}
+
+static inline void set_irg_initial_mem_(ir_graph *irg, ir_node *node)
+{
+ set_irn_n(irg->anchor, anchor_initial_mem, node);
+}
+
+static inline ir_node *get_irg_args_(const ir_graph *irg)
+{
+ return get_irn_n(irg->anchor, anchor_args);
+}
+
+static inline void set_irg_args_(ir_graph *irg, ir_node *node)
+{
+ set_irn_n(irg->anchor, anchor_args, node);
+}
+
+static inline ir_node *get_irg_no_mem_(const ir_graph *irg)
+{
+ return get_irn_n(irg->anchor, anchor_no_mem);
+}
+
+static inline void set_irg_no_mem_(ir_graph *irg, ir_node *node)
+{
+ set_irn_n(irg->anchor, anchor_no_mem, node);
+}
+
+static inline ir_entity *get_irg_entity_(const ir_graph *irg)
+{
+ return irg->ent;
+}
+
+static inline void set_irg_entity_(ir_graph *irg, ir_entity *ent)
+{
+ irg->ent = ent;
+}
+
+static inline ir_type *get_irg_frame_type_(ir_graph *irg)
+{
+ assert(irg->frame_type);
+ return irg->frame_type;
+}
+
+static inline void set_irg_frame_type_(ir_graph *irg, ir_type *ftp)
+{
+ assert(is_frame_type(ftp));
+ irg->frame_type = ftp;
+}
+
+static inline op_pin_state get_irg_pinned_(const ir_graph *irg)
+{
+ return irg->irg_pinned_state;
+}
+
+static inline irg_callee_info_state get_irg_callee_info_state_(const ir_graph *irg)
+{
+ return irg->callee_info_state;
+}
+
+static inline void set_irg_callee_info_state_(ir_graph *irg, irg_callee_info_state s)
+{
+ irg_callee_info_state irp_state = get_irp_callee_info_state();
+
+ irg->callee_info_state = s;
+
+ /* I could compare ... but who knows? */
+ if ((irp_state == irg_callee_info_consistent) ||
+ ((irp_state == irg_callee_info_inconsistent) && (s == irg_callee_info_none)))
+ set_irp_callee_info_state(s);
+}
+
+static inline void set_irg_link_(ir_graph *irg, void *thing)
+{
+ irg->link = thing;
+}
+
+static inline void *get_irg_link_(const ir_graph *irg)
+{
+ return irg->link;
+}
+
+static inline ir_visited_t get_irg_visited_(const ir_graph *irg)
+{
+ return irg->visited;
+}
+
+static inline ir_visited_t get_irg_block_visited_(const ir_graph *irg)
+{
+ return irg->block_visited;
+}
+
+static inline void set_irg_block_visited_(ir_graph *irg, ir_visited_t visited)
+{
+ irg->block_visited = visited;
+}
+
+static inline void inc_irg_block_visited_(ir_graph *irg)
+{
+ ++irg->block_visited;
+}
+
+static inline void dec_irg_block_visited_(ir_graph *irg)
+{
+ --irg->block_visited;
+}
+
+/* Return the floating point model of this graph. */
+static inline unsigned get_irg_fp_model_(const ir_graph *irg)
+{
+ return irg->fp_model;
+}
+
+static inline int irg_is_constrained_(const ir_graph *irg,
+ ir_graph_constraints_t constraints)
+{
+ return (irg->constraints & constraints) == constraints;
+}
+
+static inline void add_irg_properties_(ir_graph *irg,
+ ir_graph_properties_t props)
+{
+ irg->properties |= props;
+}
+
+static inline void clear_irg_properties_(ir_graph *irg,
+ ir_graph_properties_t props)
+{
+ irg->properties &= ~props;
+}
+
+static inline int irg_has_properties_(const ir_graph *irg,
+ ir_graph_properties_t props)
+{
+ return (irg->properties & props) == props;
+}
+
+/**
+ * Allocates a new idx in the irg for the node and adds the irn to the idx -> irn map.
+ * @param irg The graph.
+ * @param irn The node.
+ * @return The index allocated for the node.
+ */
+static inline unsigned irg_register_node_idx(ir_graph *irg, ir_node *irn)
+{
+ unsigned idx = irg->last_node_idx++;
+ if (idx >= (unsigned)ARR_LEN(irg->idx_irn_map))
+ ARR_RESIZE(ir_node *, irg->idx_irn_map, idx + 1);
+
+ irg->idx_irn_map[idx] = irn;
+ return idx;
+}
+
+/**
+ * Kill a node from the irg. BEWARE: this kills
+ * all later created nodes.
+ */
+static inline void irg_kill_node(ir_graph *irg, ir_node *n)
+{
+ unsigned idx = get_irn_idx(n);
+ assert(idx + 1 == irg->last_node_idx);
+
+ if (idx + 1 == irg->last_node_idx)
+ --irg->last_node_idx;
+ irg->idx_irn_map[idx] = NULL;
+ obstack_free(&irg->obst, n);
+}
+
+/**
+ * Get the node for an index.
+ * @param irg The graph.
+ * @param idx The index you want the node for.
+ * @return The node with that index or NULL, if there is no node with that index.
+ * @note The node you got might be dead.
+ */
+static inline ir_node *get_idx_irn_(const ir_graph *irg, unsigned idx)
+{
+ assert(idx < (unsigned) ARR_LEN(irg->idx_irn_map));
+ return irg->idx_irn_map[idx];
+}