/* Callgraph handling code.
- Copyright (C) 2003 Free Software Foundation, Inc.
+ Copyright (C) 2003, 2004 Free Software Foundation, Inc.
Contributed by Jan Hubicka
This file is part of GCC.
#ifndef GCC_CGRAPH_H
#define GCC_CGRAPH_H
+#include "hashtab.h"
/* Information about the function collected locally.
- Available after function is lowered */
+ Available after function is analyzed. */
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;
/* Set once it has been finalized so we consider it to be output. */
bool finalized;
- /* False when there is something making inlining impossible (such as va_arg) */
+ /* False when there something makes inlining impossible (such as va_arg). */
bool inlinable;
/* True when function should be inlined independently on it's size. */
- bool disgread_inline_limits;
- /* Size of the function before inlining. */
- int self_insns;
+ bool disregard_inline_limits;
+ /* True when the function has been originally extern inline, but it is
+ redefined now. */
+ bool redefined_extern_inline;
};
/* Information about the function that needs to be computed globally
struct cgraph_global_info GTY(())
{
- /* Set when the function will be inlined exactly once. */
- bool inline_once;
+ /* 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 direct calls not inlined into the function body. */
- int calls;
-
- /* Number of times given function will be cloned during output. */
- int cloned_times;
-
- /* 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 the function has been inlined at least once. */
+ bool inlined;
};
/* Information about the function that is propagated by the RTL backend.
struct cgraph_rtl_info GTY(())
{
+ int preferred_incoming_stack_boundary;
bool const_function;
bool pure_function;
- int preferred_incoming_stack_boundary;
};
-/* The cgraph data strutcture.
+/* The cgraph data structure.
Each function decl has assigned cgraph_node listing callees and callers. */
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;
+ /* Pointer to the next clone. */
+ struct cgraph_node *next_clone;
+ PTR GTY ((skip)) aux;
+
+ struct cgraph_local_info local;
+ struct cgraph_global_info global;
+ struct cgraph_rtl_info rtl;
/* Unique id of the node. */
int uid;
- PTR GTY ((skip (""))) aux;
-
/* Set when function must be output - it is externally visible
or it's address is taken. */
bool needed;
/* Set when function is reachable by call from other function
that is either reachable or needed. */
bool reachable;
- /* Set when the frontend has been asked to lower representation of this
- function into trees. Callees lists are not available when lowered
- is not set. */
- bool lowered;
+ /* Set once the function has been instantiated and its callee
+ lists created. */
+ bool analyzed;
/* Set when function is scheduled to be assembled. */
bool output;
- struct cgraph_local_info local;
- struct cgraph_global_info global;
- struct cgraph_rtl_info rtl;
};
-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;
- bool inline_call;
+ 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;
};
-/* The cgraph_varpool data strutcture.
+/* The cgraph_varpool data structure.
Each static variable decl has assigned cgraph_varpool_node. */
struct cgraph_varpool_node GTY(())
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_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);
/* In cgraphunit.c */
-void cgraph_finalize_function (tree, 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 *, int);
-bool cgraph_inline_p (tree, tree);
+void cgraph_mark_needed_node (struct cgraph_node *);
+void cgraph_mark_reachable_node (struct cgraph_node *);
+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);
#endif /* GCC_CGRAPH_H */