2004-09-10 Paolo Bonzini <bonzini@gnu.org>

[pf3gnuchains/gcc-fork.git] / gcc / cgraph.h

diff --git a/gcc/cgraph.h b/gcc/cgraph.h
index b845ef7..a6e9cd7 100644 (file)
--- a/gcc/cgraph.h
+++ b/gcc/cgraph.h
@@ -21,6 +21,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
 
 #ifndef GCC_CGRAPH_H
 #define GCC_CGRAPH_H
+#include "hashtab.h"
 
 /* Information about the function collected locally.
    Available after function is analyzed.  */
@@ -29,7 +30,6 @@ struct cgraph_local_info GTY(())
 {
   /* Size of the function before inlining.  */
   int self_insns;
-
   /* Set when function function is visible in current compilation unit only
      and it's address is never taken.  */
   bool local;
@@ -50,21 +50,13 @@ struct cgraph_local_info GTY(())
 
 struct cgraph_global_info GTY(())
 {
+  /* For inline clones this points to the function they will be inlined into.  */
+  struct cgraph_node *inlined_to;
+
   /* Estimated size of the function after inlining.  */
   int insns;
 
-  /* Number of times given function will be cloned during output.  */
-  int cloned_times;
-
-  /* Set when the function will be inlined exactly once.  */
-  bool inline_once;
-
-  /* Set to true for all reachable functions before inlining is decided.
-     Once we inline all calls to the function and the function is local,
-     it is set to false.  */
-  bool will_be_output;
-
-  /* Set iff at least one of the caller edges has inline_call flag set.  */
+  /* Set iff the function has been inlined at least once.  */
   bool inlined;
 };
 
@@ -73,9 +65,9 @@ struct cgraph_global_info GTY(())
 
 struct cgraph_rtl_info GTY(())
 {
+   int preferred_incoming_stack_boundary;
    bool const_function;
    bool pure_function;
-   int preferred_incoming_stack_boundary;
 };
 
 
@@ -97,7 +89,9 @@ struct cgraph_node GTY((chain_next ("%h.next"), chain_prev ("%h.previous")))
   struct cgraph_node *next_nested;
   /* Pointer to the next function in cgraph_nodes_queue.  */
   struct cgraph_node *next_needed;
-  PTR GTY ((skip (""))) aux;
+  /* Pointer to the next clone.  */
+  struct cgraph_node *next_clone;
+  PTR GTY ((skip)) aux;
 
   struct cgraph_local_info local;
   struct cgraph_global_info global;
@@ -117,12 +111,14 @@ struct cgraph_node GTY((chain_next ("%h.next"), chain_prev ("%h.previous")))
   bool output;
 };
 
-struct cgraph_edge GTY(())
+struct cgraph_edge GTY((chain_next ("%h.next_caller")))
 {
   struct cgraph_node *caller;
   struct cgraph_node *callee;
   struct cgraph_edge *next_caller;
   struct cgraph_edge *next_callee;
+  tree call_expr;
+  PTR GTY ((skip (""))) aux;
   /* When NULL, inline this call.  When non-NULL, points to the explanation
      why function was not inlined.  */
   const char *inline_failed;
@@ -151,31 +147,33 @@ extern GTY(()) int cgraph_n_nodes;
 extern GTY(()) int cgraph_max_uid;
 extern bool cgraph_global_info_ready;
 extern GTY(()) struct cgraph_node *cgraph_nodes_queue;
-extern FILE *cgraph_dump_file;
 
 extern GTY(()) int cgraph_varpool_n_nodes;
 extern GTY(()) struct cgraph_varpool_node *cgraph_varpool_nodes_queue;
 
-
 /* In cgraph.c  */
 void dump_cgraph (FILE *);
-void cgraph_remove_edge (struct cgraph_node *, struct cgraph_node *);
-void cgraph_remove_call (tree, tree);
+void dump_cgraph_node (FILE *, struct cgraph_node *);
+void cgraph_remove_edge (struct cgraph_edge *);
 void cgraph_remove_node (struct cgraph_node *);
-struct cgraph_edge *cgraph_record_call (tree, tree);
+struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
+                                       struct cgraph_node *,
+                                       tree);
 struct cgraph_node *cgraph_node (tree decl);
-struct cgraph_node *cgraph_node_for_identifier (tree id);
+struct cgraph_edge *cgraph_edge (struct cgraph_node *, tree call_expr);
 bool cgraph_calls_p (tree, tree);
 struct cgraph_local_info *cgraph_local_info (tree);
 struct cgraph_global_info *cgraph_global_info (tree);
 struct cgraph_rtl_info *cgraph_rtl_info (tree);
 const char * cgraph_node_name (struct cgraph_node *);
+struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *, struct cgraph_node *, tree);
+struct cgraph_node * cgraph_clone_node (struct cgraph_node *);
 
 struct cgraph_varpool_node *cgraph_varpool_node (tree decl);
-struct cgraph_varpool_node *cgraph_varpool_node_for_identifier (tree id);
 void cgraph_varpool_mark_needed_node (struct cgraph_varpool_node *);
 void cgraph_varpool_finalize_decl (tree);
 bool cgraph_varpool_assemble_pending_decls (void);
+void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *);
 
 bool cgraph_function_possibly_inlined_p (tree);
 
@@ -183,10 +181,17 @@ bool cgraph_function_possibly_inlined_p (tree);
 bool cgraph_assemble_pending_functions (void);
 void cgraph_finalize_function (tree, bool);
 void cgraph_finalize_compilation_unit (void);
-void cgraph_create_edges (tree, tree);
+void cgraph_create_edges (struct cgraph_node *, tree);
 void cgraph_optimize (void);
 void cgraph_mark_needed_node (struct cgraph_node *);
 void cgraph_mark_reachable_node (struct cgraph_node *);
-bool cgraph_inline_p (tree, tree, const char **reason);
+bool cgraph_inline_p (struct cgraph_edge *, const char **reason);
+bool cgraph_preserve_function_body_p (tree);
+void verify_cgraph (void);
+void verify_cgraph_node (struct cgraph_node *);
+void cgraph_mark_inline_edge (struct cgraph_edge *e);
+void cgraph_clone_inlined_nodes (struct cgraph_edge *e, bool duplicate);
+void cgraph_build_static_cdtor (char which, tree body, int priority);
+void init_cgraph (void);
 
 #endif  /* GCC_CGRAPH_H  */