/* Callgraph handling code.
- Copyright (C) 2003, 2004 Free Software Foundation, Inc.
+ Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
Contributed by Jan Hubicka
This file is part of GCC.
#ifndef GCC_CGRAPH_H
#define GCC_CGRAPH_H
+#include "tree.h"
/* Information about the function collected locally.
Available after function is analyzed. */
int self_insns;
/* Set when function function is visible in current compilation unit only
- and it's address is never taken. */
+ and its address is never taken. */
bool local;
+
/* Set once it has been finalized so we consider it to be output. */
bool finalized;
/* False when there something makes inlining impossible (such as va_arg). */
bool inlinable;
- /* True when function should be inlined independently on it's size. */
+
+ /* True when function should be inlined independently on its size. */
bool disregard_inline_limits;
+
/* True when the function has been originally extern inline, but it is
redefined now. */
bool redefined_extern_inline;
+
+ /* True if statics_read_for_function and
+ statics_written_for_function contain valid data. */
+ bool for_functions_valid;
};
/* Information about the function that needs to be computed globally
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;
};
struct cgraph_rtl_info GTY(())
{
+ int preferred_incoming_stack_boundary;
bool const_function;
bool pure_function;
- int preferred_incoming_stack_boundary;
};
-
/* The cgraph data structure.
Each function decl has assigned cgraph_node listing callees and callers. */
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;
+ struct cgraph_node *prev_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;
/* Set when function must be output - it is externally visible
- or it's address is taken. */
+ or its address is taken. */
bool needed;
/* Set when function is reachable by call from other function
that is either reachable or needed. */
bool analyzed;
/* Set when function is scheduled to be assembled. */
bool output;
+ /* Set for aliases once they got through assemble_alias. */
+ bool alias;
};
-struct cgraph_edge GTY(())
+struct cgraph_edge GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller")))
{
struct cgraph_node *caller;
struct cgraph_node *callee;
+ struct cgraph_edge *prev_caller;
struct cgraph_edge *next_caller;
+ struct cgraph_edge *prev_callee;
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;
struct cgraph_varpool_node GTY(())
{
tree decl;
+ /* Pointer to the next function in cgraph_varpool_nodes. */
+ struct cgraph_varpool_node *next;
/* Pointer to the next function in cgraph_varpool_nodes_queue. */
struct cgraph_varpool_node *next_needed;
/* Set when function must be output - it is externally visible
- or it's address is taken. */
+ or its address is taken. */
bool needed;
+ /* Needed variables might become dead by optimization. This flag
+ forces the variable to be output even if it appears dead otherwise. */
+ bool force_output;
+ /* Set once the variable has been instantiated and its callee
+ lists created. */
+ bool analyzed;
/* Set once it has been finalized so we consider it to be output. */
bool finalized;
/* Set when function is scheduled to be assembled. */
bool output;
+ /* Set for aliases once they got through assemble_alias. */
+ bool alias;
};
extern GTY(()) struct cgraph_node *cgraph_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_first_unanalyzed_node;
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 dump_varpool (FILE *);
+void dump_cgraph_varpool_node (FILE *, struct cgraph_varpool_node *);
+void cgraph_remove_edge (struct cgraph_edge *);
void cgraph_remove_node (struct cgraph_node *);
-struct cgraph_edge *cgraph_record_call (tree, tree);
+void cgraph_node_remove_callees (struct cgraph_node *node);
+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);
-bool cgraph_calls_p (tree, tree);
+struct cgraph_node *cgraph_node_for_asm (tree asmname);
+struct cgraph_edge *cgraph_edge (struct cgraph_node *, tree call_expr);
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);
+struct cgraph_varpool_node *cgraph_varpool_node_for_asm (tree asmname);
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);
+void cgraph_unnest_node (struct cgraph_node *node);
+void cgraph_varpool_enqueue_needed_node (struct cgraph_varpool_node *);
+void cgraph_varpool_reset_queue (void);
+bool decide_is_variable_needed (struct cgraph_varpool_node *, tree);
/* In cgraphunit.c */
bool cgraph_assemble_pending_functions (void);
+bool cgraph_varpool_assemble_pending_decls (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 cgraph_reset_static_var_maps (void);
+void init_cgraph (void);
#endif /* GCC_CGRAPH_H */
OSDN Git Service
