OpenCores
URL https://opencores.org/ocsvn/openrisc_me/openrisc_me/trunk

Subversion Repositories openrisc_me

[/] [openrisc/] [trunk/] [gnu-src/] [gcc-4.5.1/] [gcc/] [cgraph.h] - Blame information for rev 280

Details | Compare with Previous | View Log

Line No. Rev Author Line
1 280 jeremybenn
/* Callgraph handling code.
2
   Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
3
   Free Software Foundation, Inc.
4
   Contributed by Jan Hubicka
5
 
6
This file is part of GCC.
7
 
8
GCC is free software; you can redistribute it and/or modify it under
9
the terms of the GNU General Public License as published by the Free
10
Software Foundation; either version 3, or (at your option) any later
11
version.
12
 
13
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14
WARRANTY; without even the implied warranty of MERCHANTABILITY or
15
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
16
for more details.
17
 
18
You should have received a copy of the GNU General Public License
19
along with GCC; see the file COPYING3.  If not see
20
<http://www.gnu.org/licenses/>.  */
21
 
22
#ifndef GCC_CGRAPH_H
23
#define GCC_CGRAPH_H
24
#include "tree.h"
25
#include "basic-block.h"
26
 
27
enum availability
28
{
29
  /* Not yet set by cgraph_function_body_availability.  */
30
  AVAIL_UNSET,
31
  /* Function body/variable initializer is unknown.  */
32
  AVAIL_NOT_AVAILABLE,
33
  /* Function body/variable initializer is known but might be replaced
34
     by a different one from other compilation unit and thus needs to
35
     be dealt with a care.  Like AVAIL_NOT_AVAILABLE it can have
36
     arbitrary side effects on escaping variables and functions, while
37
     like AVAILABLE it might access static variables.  */
38
  AVAIL_OVERWRITABLE,
39
  /* Function body/variable initializer is known and will be used in final
40
     program.  */
41
  AVAIL_AVAILABLE,
42
  /* Function body/variable initializer is known and all it's uses are explicitly
43
     visible within current unit (ie it's address is never taken and it is not
44
     exported to other units).
45
     Currently used only for functions.  */
46
  AVAIL_LOCAL
47
};
48
 
49
/* This is the information that is put into the cgraph local structure
50
   to recover a function.  */
51
struct lto_file_decl_data;
52
 
53
extern const char * const cgraph_availability_names[];
54
 
55
/* Function inlining information.  */
56
 
57
struct GTY(()) inline_summary
58
{
59
  /* Estimated stack frame consumption by the function.  */
60
  HOST_WIDE_INT estimated_self_stack_size;
61
 
62
  /* Size of the function body.  */
63
  int self_size;
64
  /* How many instructions are likely going to disappear after inlining.  */
65
  int size_inlining_benefit;
66
  /* Estimated time spent executing the function body.  */
67
  int self_time;
68
  /* How much time is going to be saved by inlining.  */
69
  int time_inlining_benefit;
70
};
71
 
72
/* Information about thunk, used only for same body aliases.  */
73
 
74
struct GTY(()) cgraph_thunk_info {
75
  /* Information about the thunk.  */
76
  HOST_WIDE_INT fixed_offset;
77
  HOST_WIDE_INT virtual_value;
78
  tree alias;
79
  bool this_adjusting;
80
  bool virtual_offset_p;
81
  /* Set to true when alias node is thunk.  */
82
  bool thunk_p;
83
};
84
 
85
/* Information about the function collected locally.
86
   Available after function is analyzed.  */
87
 
88
struct GTY(()) cgraph_local_info {
89
  /* File stream where this node is being written to.  */
90
  struct lto_file_decl_data * GTY ((skip)) lto_file_data;
91
 
92
  struct inline_summary inline_summary;
93
 
94
  /* Set when function function is visible in current compilation unit only
95
     and its address is never taken.  */
96
  unsigned local : 1;
97
 
98
  /* Set when function is visible by other units.  */
99
  unsigned externally_visible : 1;
100
 
101
  /* Set once it has been finalized so we consider it to be output.  */
102
  unsigned finalized : 1;
103
 
104
  /* False when there something makes inlining impossible (such as va_arg).  */
105
  unsigned inlinable : 1;
106
 
107
  /* True when function should be inlined independently on its size.  */
108
  unsigned disregard_inline_limits : 1;
109
 
110
  /* True when the function has been originally extern inline, but it is
111
     redefined now.  */
112
  unsigned redefined_extern_inline : 1;
113
 
114
  /* True if statics_read_for_function and
115
     statics_written_for_function contain valid data.  */
116
  unsigned for_functions_valid : 1;
117
 
118
  /* True if the function is going to be emitted in some other translation
119
     unit, referenced from vtable.  */
120
  unsigned vtable_method : 1;
121
};
122
 
123
/* Information about the function that needs to be computed globally
124
   once compilation is finished.  Available only with -funit-at-a-time.  */
125
 
126
struct GTY(()) cgraph_global_info {
127
  /* Estimated stack frame consumption by the function.  */
128
  HOST_WIDE_INT estimated_stack_size;
129
  /* Expected offset of the stack frame of inlined function.  */
130
  HOST_WIDE_INT stack_frame_offset;
131
 
132
  /* For inline clones this points to the function they will be
133
     inlined into.  */
134
  struct cgraph_node *inlined_to;
135
 
136
  /* Estimated size of the function after inlining.  */
137
  int time;
138
  int size;
139
 
140
  /* Estimated growth after inlining.  INT_MIN if not computed.  */
141
  int estimated_growth;
142
 
143
  /* Set iff the function has been inlined at least once.  */
144
  bool inlined;
145
};
146
 
147
/* Information about the function that is propagated by the RTL backend.
148
   Available only for functions that has been already assembled.  */
149
 
150
struct GTY(()) cgraph_rtl_info {
151
   unsigned int preferred_incoming_stack_boundary;
152
};
153
 
154
/* Represent which DECL tree (or reference to such tree)
155
   will be replaced by another tree while versioning.  */
156
struct GTY(()) ipa_replace_map
157
{
158
  /* The tree that will be replaced.  */
159
  tree old_tree;
160
  /* The new (replacing) tree.  */
161
  tree new_tree;
162
  /* True when a substitution should be done, false otherwise.  */
163
  bool replace_p;
164
  /* True when we replace a reference to old_tree.  */
165
  bool ref_p;
166
};
167
typedef struct ipa_replace_map *ipa_replace_map_p;
168
DEF_VEC_P(ipa_replace_map_p);
169
DEF_VEC_ALLOC_P(ipa_replace_map_p,gc);
170
 
171
struct GTY(()) cgraph_clone_info
172
{
173
  VEC(ipa_replace_map_p,gc)* tree_map;
174
  bitmap args_to_skip;
175
  bitmap combined_args_to_skip;
176
};
177
 
178
/* The cgraph data structure.
179
   Each function decl has assigned cgraph_node listing callees and callers.  */
180
 
181
struct GTY((chain_next ("%h.next"), chain_prev ("%h.previous"))) cgraph_node {
182
  tree decl;
183
  struct cgraph_edge *callees;
184
  struct cgraph_edge *callers;
185
  struct cgraph_node *next;
186
  struct cgraph_node *previous;
187
  /* For nested functions points to function the node is nested in.  */
188
  struct cgraph_node *origin;
189
  /* Points to first nested function, if any.  */
190
  struct cgraph_node *nested;
191
  /* Pointer to the next function with same origin, if any.  */
192
  struct cgraph_node *next_nested;
193
  /* Pointer to the next function in cgraph_nodes_queue.  */
194
  struct cgraph_node *next_needed;
195
  /* Pointer to the next clone.  */
196
  struct cgraph_node *next_sibling_clone;
197
  struct cgraph_node *prev_sibling_clone;
198
  struct cgraph_node *clones;
199
  struct cgraph_node *clone_of;
200
  /* For normal nodes pointer to the list of alias and thunk nodes,
201
     in alias/thunk nodes pointer to the normal node.  */
202
  struct cgraph_node *same_body;
203
  /* Circular list of nodes in the same comdat group if non-NULL.  */
204
  struct cgraph_node *same_comdat_group;
205
  /* For functions with many calls sites it holds map from call expression
206
     to the edge to speed up cgraph_edge function.  */
207
  htab_t GTY((param_is (struct cgraph_edge))) call_site_hash;
208
 
209
  PTR GTY ((skip)) aux;
210
 
211
  /* Interprocedural passes scheduled to have their transform functions
212
     applied next time we execute local pass on them.  We maintain it
213
     per-function in order to allow IPA passes to introduce new functions.  */
214
  VEC(ipa_opt_pass,heap) * GTY((skip)) ipa_transforms_to_apply;
215
 
216
  struct cgraph_local_info local;
217
  struct cgraph_global_info global;
218
  struct cgraph_rtl_info rtl;
219
  struct cgraph_clone_info clone;
220
  struct cgraph_thunk_info thunk;
221
 
222
  /* Expected number of executions: calculated in profile.c.  */
223
  gcov_type count;
224
  /* Unique id of the node.  */
225
  int uid;
226
  /* Ordering of all cgraph nodes.  */
227
  int order;
228
 
229
  /* unique id for profiling. pid is not suitable because of different
230
     number of cfg nodes with -fprofile-generate and -fprofile-use */
231
  int pid;
232
 
233
  /* Set when function must be output for some reason.  The primary
234
     use of this flag is to mark functions needed to be output for
235
     non-standard reason.  Functions that are externally visible
236
     or reachable from functions needed to be output are marked
237
     by specialized flags.  */
238
  unsigned needed : 1;
239
  /* Set when function has address taken.
240
     In current implementation it imply needed flag. */
241
  unsigned address_taken : 1;
242
  /* Set when decl is an abstract function pointed to by the
243
     ABSTRACT_DECL_ORIGIN of a reachable function.  */
244
  unsigned abstract_and_needed : 1;
245
  /* Set when function is reachable by call from other function
246
     that is either reachable or needed.
247
     This flag is computed at original cgraph construction and then
248
     updated in cgraph_remove_unreachable_nodes.  Note that after
249
     cgraph_remove_unreachable_nodes cgraph still can contain unreachable
250
     nodes when they are needed for virtual clone instantiation.  */
251
  unsigned reachable : 1;
252
  /* Set once the function is lowered (i.e. its CFG is built).  */
253
  unsigned lowered : 1;
254
  /* Set once the function has been instantiated and its callee
255
     lists created.  */
256
  unsigned analyzed : 1;
257
  /* Set when function is scheduled to be processed by local passes.  */
258
  unsigned process : 1;
259
  /* Set for aliases once they got through assemble_alias.  */
260
  unsigned alias : 1;
261
  /* Set for nodes that was constructed and finalized by frontend.  */
262
  unsigned finalized_by_frontend : 1;
263
  /* Set for alias and thunk nodes, same_body points to the node they are alias
264
     of and they are linked through the next/previous pointers.  */
265
  unsigned same_body_alias : 1;
266
};
267
 
268
typedef struct cgraph_node *cgraph_node_ptr;
269
 
270
DEF_VEC_P(cgraph_node_ptr);
271
DEF_VEC_ALLOC_P(cgraph_node_ptr,heap);
272
DEF_VEC_ALLOC_P(cgraph_node_ptr,gc);
273
 
274
/* A cgraph node set is a collection of cgraph nodes.  A cgraph node
275
   can appear in multiple sets.  */
276
struct GTY(()) cgraph_node_set_def
277
{
278
  htab_t GTY((param_is (struct cgraph_node_set_element_def))) hashtab;
279
  VEC(cgraph_node_ptr, gc) *nodes;
280
  PTR GTY ((skip)) aux;
281
};
282
 
283
typedef struct cgraph_node_set_def *cgraph_node_set;
284
 
285
DEF_VEC_P(cgraph_node_set);
286
DEF_VEC_ALLOC_P(cgraph_node_set,gc);
287
DEF_VEC_ALLOC_P(cgraph_node_set,heap);
288
 
289
/* A cgraph node set element contains an index in the vector of nodes in
290
   the set.  */
291
struct GTY(()) cgraph_node_set_element_def
292
{
293
  struct cgraph_node *node;
294
  HOST_WIDE_INT index;
295
};
296
 
297
typedef struct cgraph_node_set_element_def *cgraph_node_set_element;
298
typedef const struct cgraph_node_set_element_def *const_cgraph_node_set_element;
299
 
300
/* Iterator structure for cgraph node sets.  */
301
typedef struct
302
{
303
  cgraph_node_set set;
304
  unsigned index;
305
} cgraph_node_set_iterator;
306
 
307
#define DEFCIFCODE(code, string)        CIF_ ## code,
308
/* Reasons for inlining failures.  */
309
typedef enum {
310
#include "cif-code.def"
311
  CIF_N_REASONS
312
} cgraph_inline_failed_t;
313
 
314
struct GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) cgraph_edge {
315
  /* Expected number of executions: calculated in profile.c.  */
316
  gcov_type count;
317
  struct cgraph_node *caller;
318
  struct cgraph_node *callee;
319
  struct cgraph_edge *prev_caller;
320
  struct cgraph_edge *next_caller;
321
  struct cgraph_edge *prev_callee;
322
  struct cgraph_edge *next_callee;
323
  gimple call_stmt;
324
  PTR GTY ((skip (""))) aux;
325
  /* When equal to CIF_OK, inline this call.  Otherwise, points to the
326
     explanation why function was not inlined.  */
327
  cgraph_inline_failed_t inline_failed;
328
  /* The stmt_uid of call_stmt.  This is used by LTO to recover the call_stmt
329
     when the function is serialized in.  */
330
  unsigned int lto_stmt_uid;
331
  /* Expected frequency of executions within the function.
332
     When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
333
     per function call.  The range is 0 to CGRAPH_FREQ_MAX.  */
334
  int frequency;
335
  /* Unique id of the edge.  */
336
  int uid;
337
  /* Depth of loop nest, 1 means no loop nest.  */
338
  unsigned short int loop_nest;
339
  /* Whether this edge describes a call that was originally indirect.  */
340
  unsigned int indirect_call : 1;
341
  /* True if the corresponding CALL stmt cannot be inlined.  */
342
  unsigned int call_stmt_cannot_inline_p : 1;
343
  /* Can this call throw externally?  */
344
  unsigned int can_throw_external : 1;
345
};
346
 
347
#define CGRAPH_FREQ_BASE 1000
348
#define CGRAPH_FREQ_MAX 100000
349
 
350
typedef struct cgraph_edge *cgraph_edge_p;
351
 
352
DEF_VEC_P(cgraph_edge_p);
353
DEF_VEC_ALLOC_P(cgraph_edge_p,heap);
354
 
355
/* The varpool data structure.
356
   Each static variable decl has assigned varpool_node.  */
357
 
358
struct GTY((chain_next ("%h.next"))) varpool_node {
359
  tree decl;
360
  /* Pointer to the next function in varpool_nodes.  */
361
  struct varpool_node *next;
362
  /* Pointer to the next function in varpool_nodes_queue.  */
363
  struct varpool_node *next_needed;
364
  /* For normal nodes a pointer to the first extra name alias.  For alias
365
     nodes a pointer to the normal node.  */
366
  struct varpool_node *extra_name;
367
  /* Ordering of all cgraph nodes.  */
368
  int order;
369
 
370
  /* Set when function must be output - it is externally visible
371
     or its address is taken.  */
372
  unsigned needed : 1;
373
  /* Needed variables might become dead by optimization.  This flag
374
     forces the variable to be output even if it appears dead otherwise.  */
375
  unsigned force_output : 1;
376
  /* Set once the variable has been instantiated and its callee
377
     lists created.  */
378
  unsigned analyzed : 1;
379
  /* Set once it has been finalized so we consider it to be output.  */
380
  unsigned finalized : 1;
381
  /* Set when variable is scheduled to be assembled.  */
382
  unsigned output : 1;
383
  /* Set when function is visible by other units.  */
384
  unsigned externally_visible : 1;
385
  /* Set for aliases once they got through assemble_alias.  Also set for
386
     extra name aliases in varpool_extra_name_alias.  */
387
  unsigned alias : 1;
388
};
389
 
390
/* Every top level asm statement is put into a cgraph_asm_node.  */
391
 
392
struct GTY(()) cgraph_asm_node {
393
  /* Next asm node.  */
394
  struct cgraph_asm_node *next;
395
  /* String for this asm node.  */
396
  tree asm_str;
397
  /* Ordering of all cgraph nodes.  */
398
  int order;
399
};
400
 
401
extern GTY(()) struct cgraph_node *cgraph_nodes;
402
extern GTY(()) int cgraph_n_nodes;
403
extern GTY(()) int cgraph_max_uid;
404
extern GTY(()) int cgraph_edge_max_uid;
405
extern GTY(()) int cgraph_max_pid;
406
extern bool cgraph_global_info_ready;
407
enum cgraph_state
408
{
409
  /* Callgraph is being constructed.  It is safe to add new functions.  */
410
  CGRAPH_STATE_CONSTRUCTION,
411
  /* Callgraph is built and IPA passes are being run.  */
412
  CGRAPH_STATE_IPA,
413
  /* Callgraph is built and all functions are transformed to SSA form.  */
414
  CGRAPH_STATE_IPA_SSA,
415
  /* Functions are now ordered and being passed to RTL expanders.  */
416
  CGRAPH_STATE_EXPANSION,
417
  /* All cgraph expansion is done.  */
418
  CGRAPH_STATE_FINISHED
419
};
420
extern enum cgraph_state cgraph_state;
421
extern bool cgraph_function_flags_ready;
422
extern GTY(()) struct cgraph_node *cgraph_nodes_queue;
423
extern GTY(()) struct cgraph_node *cgraph_new_nodes;
424
 
425
extern GTY(()) struct cgraph_asm_node *cgraph_asm_nodes;
426
extern GTY(()) int cgraph_order;
427
 
428
/* In cgraph.c  */
429
void dump_cgraph (FILE *);
430
void debug_cgraph (void);
431
void dump_cgraph_node (FILE *, struct cgraph_node *);
432
void debug_cgraph_node (struct cgraph_node *);
433
void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
434
void cgraph_remove_edge (struct cgraph_edge *);
435
void cgraph_remove_node (struct cgraph_node *);
436
void cgraph_remove_node_and_inline_clones (struct cgraph_node *);
437
void cgraph_release_function_body (struct cgraph_node *);
438
void cgraph_node_remove_callees (struct cgraph_node *node);
439
struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
440
                                        struct cgraph_node *,
441
                                        gimple, gcov_type, int, int);
442
 
443
struct cgraph_node * cgraph_get_node (tree);
444
struct cgraph_node *cgraph_node (tree);
445
bool cgraph_same_body_alias (tree, tree);
446
void cgraph_add_thunk (tree, tree, bool, HOST_WIDE_INT, HOST_WIDE_INT, tree, tree);
447
void cgraph_remove_same_body_alias (struct cgraph_node *);
448
struct cgraph_node *cgraph_node_for_asm (tree);
449
struct cgraph_edge *cgraph_edge (struct cgraph_node *, gimple);
450
void cgraph_set_call_stmt (struct cgraph_edge *, gimple);
451
void cgraph_set_call_stmt_including_clones (struct cgraph_node *, gimple, gimple);
452
void cgraph_create_edge_including_clones (struct cgraph_node *,
453
                                          struct cgraph_node *,
454
                                          gimple, gimple, gcov_type, int, int,
455
                                          cgraph_inline_failed_t);
456
void cgraph_update_edges_for_call_stmt (gimple, tree, gimple);
457
struct cgraph_local_info *cgraph_local_info (tree);
458
struct cgraph_global_info *cgraph_global_info (tree);
459
struct cgraph_rtl_info *cgraph_rtl_info (tree);
460
const char * cgraph_node_name (struct cgraph_node *);
461
struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *,
462
                                        struct cgraph_node *, gimple,
463
                                        unsigned, gcov_type, int, int, bool);
464
struct cgraph_node * cgraph_clone_node (struct cgraph_node *, gcov_type, int,
465
                                        int, bool, VEC(cgraph_edge_p,heap) *);
466
 
467
void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *);
468
 
469
struct cgraph_asm_node *cgraph_add_asm_node (tree);
470
 
471
bool cgraph_function_possibly_inlined_p (tree);
472
void cgraph_unnest_node (struct cgraph_node *);
473
 
474
enum availability cgraph_function_body_availability (struct cgraph_node *);
475
void cgraph_add_new_function (tree, bool);
476
const char* cgraph_inline_failed_string (cgraph_inline_failed_t);
477
struct cgraph_node * cgraph_create_virtual_clone (struct cgraph_node *old_node,
478
                                                  VEC(cgraph_edge_p,heap)*,
479
                                                  VEC(ipa_replace_map_p,gc)* tree_map,
480
                                                  bitmap args_to_skip);
481
 
482
void cgraph_set_nothrow_flag (struct cgraph_node *, bool);
483
void cgraph_set_readonly_flag (struct cgraph_node *, bool);
484
void cgraph_set_pure_flag (struct cgraph_node *, bool);
485
void cgraph_set_looping_const_or_pure_flag (struct cgraph_node *, bool);
486
tree clone_function_name (tree);
487
 
488
/* In cgraphunit.c  */
489
void cgraph_finalize_function (tree, bool);
490
void cgraph_mark_if_needed (tree);
491
void cgraph_finalize_compilation_unit (void);
492
void cgraph_optimize (void);
493
void cgraph_mark_needed_node (struct cgraph_node *);
494
void cgraph_mark_address_taken_node (struct cgraph_node *);
495
void cgraph_mark_reachable_node (struct cgraph_node *);
496
bool cgraph_inline_p (struct cgraph_edge *, cgraph_inline_failed_t *reason);
497
bool cgraph_preserve_function_body_p (tree);
498
void verify_cgraph (void);
499
void verify_cgraph_node (struct cgraph_node *);
500
void cgraph_build_static_cdtor (char which, tree body, int priority);
501
void cgraph_reset_static_var_maps (void);
502
void init_cgraph (void);
503
struct cgraph_node *cgraph_function_versioning (struct cgraph_node *,
504
                                                VEC(cgraph_edge_p,heap)*,
505
                                                VEC(ipa_replace_map_p,gc)*,
506
                                                bitmap);
507
void tree_function_versioning (tree, tree, VEC (ipa_replace_map_p,gc)*, bool, bitmap);
508
struct cgraph_node *save_inline_function_body (struct cgraph_node *);
509
void record_references_in_initializer (tree, bool);
510
bool cgraph_process_new_functions (void);
511
 
512
bool cgraph_decide_is_function_needed (struct cgraph_node *, tree);
513
 
514
typedef void (*cgraph_edge_hook)(struct cgraph_edge *, void *);
515
typedef void (*cgraph_node_hook)(struct cgraph_node *, void *);
516
typedef void (*cgraph_2edge_hook)(struct cgraph_edge *, struct cgraph_edge *,
517
                                  void *);
518
typedef void (*cgraph_2node_hook)(struct cgraph_node *, struct cgraph_node *,
519
                                  void *);
520
struct cgraph_edge_hook_list;
521
struct cgraph_node_hook_list;
522
struct cgraph_2edge_hook_list;
523
struct cgraph_2node_hook_list;
524
struct cgraph_edge_hook_list *cgraph_add_edge_removal_hook (cgraph_edge_hook, void *);
525
void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *);
526
struct cgraph_node_hook_list *cgraph_add_node_removal_hook (cgraph_node_hook,
527
                                                            void *);
528
void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *);
529
struct cgraph_node_hook_list *cgraph_add_function_insertion_hook (cgraph_node_hook,
530
                                                                  void *);
531
void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *);
532
void cgraph_call_function_insertion_hooks (struct cgraph_node *node);
533
struct cgraph_2edge_hook_list *cgraph_add_edge_duplication_hook (cgraph_2edge_hook, void *);
534
void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *);
535
struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook (cgraph_2node_hook, void *);
536
void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *);
537
void cgraph_materialize_all_clones (void);
538
gimple cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *);
539
/* In cgraphbuild.c  */
540
unsigned int rebuild_cgraph_edges (void);
541
void reset_inline_failed (struct cgraph_node *);
542
int compute_call_stmt_bb_frequency (tree, basic_block bb);
543
 
544
/* In ipa.c  */
545
bool cgraph_remove_unreachable_nodes (bool, FILE *);
546
int cgraph_postorder (struct cgraph_node **);
547
cgraph_node_set cgraph_node_set_new (void);
548
cgraph_node_set_iterator cgraph_node_set_find (cgraph_node_set,
549
                                               struct cgraph_node *);
550
void cgraph_node_set_add (cgraph_node_set, struct cgraph_node *);
551
void cgraph_node_set_remove (cgraph_node_set, struct cgraph_node *);
552
void dump_cgraph_node_set (FILE *, cgraph_node_set);
553
void debug_cgraph_node_set (cgraph_node_set);
554
 
555
 
556
/* In predict.c  */
557
bool cgraph_maybe_hot_edge_p (struct cgraph_edge *e);
558
 
559
/* In varpool.c  */
560
extern GTY(()) struct varpool_node *varpool_nodes_queue;
561
extern GTY(()) struct varpool_node *varpool_nodes;
562
 
563
struct varpool_node *varpool_node (tree);
564
struct varpool_node *varpool_node_for_asm (tree asmname);
565
void varpool_mark_needed_node (struct varpool_node *);
566
void debug_varpool (void);
567
void dump_varpool (FILE *);
568
void dump_varpool_node (FILE *, struct varpool_node *);
569
 
570
void varpool_finalize_decl (tree);
571
bool decide_is_variable_needed (struct varpool_node *, tree);
572
enum availability cgraph_variable_initializer_availability (struct varpool_node *);
573
void cgraph_make_decl_local (tree);
574
void cgraph_make_node_local (struct cgraph_node *);
575
bool cgraph_node_can_be_local_p (struct cgraph_node *);
576
 
577
bool varpool_assemble_pending_decls (void);
578
bool varpool_assemble_decl (struct varpool_node *node);
579
bool varpool_analyze_pending_decls (void);
580
void varpool_remove_unreferenced_decls (void);
581
void varpool_empty_needed_queue (void);
582
bool varpool_extra_name_alias (tree, tree);
583
const char * varpool_node_name (struct varpool_node *node);
584
 
585
/* Walk all reachable static variables.  */
586
#define FOR_EACH_STATIC_VARIABLE(node) \
587
   for ((node) = varpool_nodes_queue; (node); (node) = (node)->next_needed)
588
 
589
/* Return first reachable static variable with initializer.  */
590
static inline struct varpool_node *
591
varpool_first_static_initializer (void)
592
{
593
  struct varpool_node *node;
594
  for (node = varpool_nodes_queue; node; node = node->next_needed)
595
    {
596
      gcc_assert (TREE_CODE (node->decl) == VAR_DECL);
597
      if (DECL_INITIAL (node->decl))
598
        return node;
599
    }
600
  return NULL;
601
}
602
 
603
/* Return next reachable static variable with initializer after NODE.  */
604
static inline struct varpool_node *
605
varpool_next_static_initializer (struct varpool_node *node)
606
{
607
  for (node = node->next_needed; node; node = node->next_needed)
608
    {
609
      gcc_assert (TREE_CODE (node->decl) == VAR_DECL);
610
      if (DECL_INITIAL (node->decl))
611
        return node;
612
    }
613
  return NULL;
614
}
615
 
616
/* Walk all static variables with initializer set.  */
617
#define FOR_EACH_STATIC_INITIALIZER(node) \
618
   for ((node) = varpool_first_static_initializer (); (node); \
619
        (node) = varpool_next_static_initializer (node))
620
 
621
/* In ipa-inline.c  */
622
void cgraph_clone_inlined_nodes (struct cgraph_edge *, bool, bool);
623
unsigned int compute_inline_parameters (struct cgraph_node *);
624
 
625
 
626
/* Create a new static variable of type TYPE.  */
627
tree add_new_static_var (tree type);
628
 
629
/* lto-cgraph.c */
630
 
631
enum LTO_cgraph_tags
632
{
633
  /* Must leave 0 for the stopper.  */
634
  LTO_cgraph_avail_node = 1,
635
  LTO_cgraph_overwritable_node,
636
  LTO_cgraph_unavail_node,
637
  LTO_cgraph_edge,
638
  LTO_cgraph_last_tag
639
};
640
 
641
extern const char * LTO_cgraph_tag_names[LTO_cgraph_last_tag];
642
 
643
#define LCC_NOT_FOUND   (-1)
644
 
645
 
646
/* Return true if iterator CSI points to nothing.  */
647
static inline bool
648
csi_end_p (cgraph_node_set_iterator csi)
649
{
650
  return csi.index >= VEC_length (cgraph_node_ptr, csi.set->nodes);
651
}
652
 
653
/* Advance iterator CSI.  */
654
static inline void
655
csi_next (cgraph_node_set_iterator *csi)
656
{
657
  csi->index++;
658
}
659
 
660
/* Return the node pointed to by CSI.  */
661
static inline struct cgraph_node *
662
csi_node (cgraph_node_set_iterator csi)
663
{
664
  return VEC_index (cgraph_node_ptr, csi.set->nodes, csi.index);
665
}
666
 
667
/* Return an iterator to the first node in SET.  */
668
static inline cgraph_node_set_iterator
669
csi_start (cgraph_node_set set)
670
{
671
  cgraph_node_set_iterator csi;
672
 
673
  csi.set = set;
674
  csi.index = 0;
675
  return csi;
676
}
677
 
678
/* Return true if SET contains NODE.  */
679
static inline bool
680
cgraph_node_in_set_p (struct cgraph_node *node, cgraph_node_set set)
681
{
682
  cgraph_node_set_iterator csi;
683
  csi = cgraph_node_set_find (set, node);
684
  return !csi_end_p (csi);
685
}
686
 
687
/* Return number of nodes in SET.  */
688
static inline size_t
689
cgraph_node_set_size (cgraph_node_set set)
690
{
691
  return htab_elements (set->hashtab);
692
}
693
 
694
/* Uniquize all constants that appear in memory.
695
   Each constant in memory thus far output is recorded
696
   in `const_desc_table'.  */
697
 
698
struct GTY(()) constant_descriptor_tree {
699
  /* A MEM for the constant.  */
700
  rtx rtl;
701
 
702
  /* The value of the constant.  */
703
  tree value;
704
 
705
  /* Hash of value.  Computing the hash from value each time
706
     hashfn is called can't work properly, as that means recursive
707
     use of the hash table during hash table expansion.  */
708
  hashval_t hash;
709
};
710
 
711
/* Return true when function NODE is only called directly.
712
   i.e. it is not externally visible, address was not taken and
713
   it is not used in any other non-standard way.  */
714
 
715
static inline bool
716
cgraph_only_called_directly_p (struct cgraph_node *node)
717
{
718
  return !node->needed && !node->local.externally_visible;
719
}
720
 
721
/* Return true when function NODE can be removed from callgraph
722
   if all direct calls are eliminated.  */
723
 
724
static inline bool
725
cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node)
726
{
727
  return (!node->needed
728
          && (DECL_COMDAT (node->decl) || !node->local.externally_visible));
729
}
730
 
731
/* Constant pool accessor function.  */
732
htab_t constant_pool_htab (void);
733
 
734
#endif  /* GCC_CGRAPH_H  */

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.