/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
-** All rights reserved.
-**
-** Authors: Martin Trapp, Christian Schaefer
-**
-**
+* All rights reserved.
+*
+* Authors: Martin Trapp, Christian Schaefer
+*
+*
*/
/* $Id$ */
# include "mangle.h"
ir_graph *current_ir_graph;
-INLINE ir_graph *get_current_ir_graph() {
+INLINE ir_graph *get_current_ir_graph(void) {
return current_ir_graph;
}
INLINE void set_current_ir_graph(ir_graph *graph) {
bool interprocedural_view = false;
-INLINE bool get_interprocedural_view() {
+INLINE bool get_interprocedural_view(void) {
return interprocedural_view;
}
INLINE void set_interprocedural_view(bool state) {
interprocedural_view = state;
}
+static ident* frame_type_suffix = NULL;
+void init_irgraph(void) {
+ frame_type_suffix = id_from_str(FRAME_TP_SUFFIX, strlen(FRAME_TP_SUFFIX));
+}
+
#if USE_EXPLICIT_PHI_IN_STACK
/* really defined in ircons.c */
typedef struct Phi_in_stack Phi_in_stack;
ir_graph *
new_ir_graph (entity *ent, int n_loc)
{
- int i;
ir_graph *res;
ir_node *first_block;
ir_node *projX;
current_ir_graph = res;
add_irp_irg(res); /* remember this graph global. */
- /** Internal information for graph construction either held in the graph or
- *** initialized for each graph. **/
+/**
+ * initialized for each graph. **/
#if PRECISE_EXC_CONTEXT
res->n_loc = n_loc + 1 + 1; /* number of local variables that are never
dereferenced in this graph plus one for
res->ent = ent;
set_entity_irg(ent, res);
- /** A type that represents the stack frame. A class type so that it can
+/**
contain "inner" methods as in Pascal. **/
- res->frame_type = new_type_class(mangle(get_entity_ident(ent),
- id_from_str(FRAME_TP_SUFFIX, strlen(FRAME_TP_SUFFIX))));
+ res->frame_type = new_type_class(mangle(get_entity_ident(ent), frame_type_suffix));
/* Remove type from type list. Must be treated differently than other types. */
remove_irp_type_from_list(res->frame_type);
res->frame = new_Proj (res->start, mode_P, pns_frame_base);
res->globals = new_Proj (res->start, mode_P, pns_globals);
res->args = new_Proj (res->start, mode_T, pns_args);
+#ifdef DEBUG_libfirm
+ res->graph_nr = get_irp_new_node_nr();
+#endif
+
add_in_edge(res->start_block, projX);
/*
{attr type} get_irg_{attribute name} (ir_graph *irg);
void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
+/* Outputs a unique number for this node */
+
+INLINE long
+get_irg_graph_nr(ir_graph *irg) {
+ assert(irg);
+#ifdef DEBUG_libfirm
+ return irg->graph_nr;
+#else
+ return 0;
+#endif
+}
+
ir_node *
get_irg_start_block (ir_graph *irg)
{
#endif
}
+
+
+/* Returns the obstack associated with the graph. */
+struct obstack *get_irg_obstack(ir_graph *irg) {
+ return irg->obst;
+}
+
+/*
+ * Returns true if the node n is allocated on the storage of graph irg.
+ *
+ * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
+ */
+int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
+{
+ struct _obstack_chunk *p;
+
+ /*
+ * checks wheater the ir_node pointer i on the obstack.
+ * A more sophisticated chaeck would test the "whole" ir_node
+ */
+ for (p = irg->obst->chunk; p; p = p->prev) {
+ if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
+ return 1;
+ }
+
+ return 0;
+}
+
irg_phase_state
get_irg_phase_state (ir_graph *irg) {
return irg->phase_state;
unsigned long
get_max_irg_visited(void)
{
- int i;
+ //int i;
//for(i = 0; i < get_irp_n_irgs(); i++)
// assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
return max_irg_visited;
unsigned long
inc_max_irg_visited(void)
{
- int i;
+ //int i;
// for(i = 0; i < get_irp_n_irgs(); i++)
//assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
max_irg_visited++;