gcc/ipa-utils.h

   1 /* Utilities for ipa analysis.
   2    Copyright (C) 2004-2013 Free Software Foundation, Inc.
   3    Contributed by Kenneth Zadeck <zadeck@naturalbridge.com>
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify it under
   8 the terms of the GNU General Public License as published by the Free
   9 Software Foundation; either version 3, or (at your option) any later
  10 version.
  11
  12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15 for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.  */
  20
  21 #ifndef GCC_IPA_UTILS_H
  22 #define GCC_IPA_UTILS_H
  23 #include "tree-core.h"
  24 #include "cgraph.h"
  25
  26 struct ipa_dfs_info {
  27   int dfn_number;
  28   int low_link;
  29   /* This field will have the samy value for any two nodes in the same strongly
  30      connected component.  */
  31   int scc_no;
  32   bool new_node;
  33   bool on_stack;
  34   struct cgraph_node* next_cycle;
  35   PTR aux;
  36 };
  37
  38
  39 /* In ipa-utils.c  */
  40 void ipa_print_order (FILE*, const char *, struct cgraph_node**, int);
  41 int ipa_reduced_postorder (struct cgraph_node **, bool, bool,
  42                           bool (*ignore_edge) (struct cgraph_edge *));
  43 void ipa_free_postorder_info (void);
  44 vec<cgraph_node_ptr> ipa_get_nodes_in_cycle (struct cgraph_node *);
  45 bool ipa_edge_within_scc (struct cgraph_edge *);
  46 int ipa_reverse_postorder (struct cgraph_node **);
  47 tree get_base_var (tree);
  48 void ipa_merge_profiles (struct cgraph_node *dst,
  49                          struct cgraph_node *src);
  50 bool recursive_call_p (tree, tree);
  51
  52 /* In ipa-profile.c  */
  53 bool ipa_propagate_frequency (struct cgraph_node *node);
  54
  55 /* In ipa-devirt.c  */
  56
  57 struct odr_type_d;
  58 typedef odr_type_d *odr_type;
  59 void build_type_inheritance_graph (void);
  60 void update_type_inheritance_graph (void);
  61 vec <cgraph_node *>
  62 possible_polymorphic_call_targets (tree, HOST_WIDE_INT,
  63                                    bool *final = NULL,
  64                                    void **cache_token = NULL);
  65 odr_type get_odr_type (tree, bool insert = false);
  66 void dump_possible_polymorphic_call_targets (FILE *, tree, HOST_WIDE_INT);
  67 bool possible_polymorphic_call_target_p (tree, HOST_WIDE_INT,
  68                                          struct cgraph_node *n);
  69 tree method_class_type (tree);
  70
  71 /* Return vector containing possible targets of polymorphic call E.
  72    If FINALP is non-NULL, store true if the list is complette.
  73    CACHE_TOKEN (if non-NULL) will get stored to an unique ID of entry
  74    in the target cache.  If user needs to visit every target list
  75    just once, it can memoize them.
  76
  77    Returned vector is placed into cache.  It is NOT caller's responsibility
  78    to free it.  The vector can be freed on cgraph_remove_node call if
  79    the particular node is a virtual function present in the cache.  */
  80
  81 inline vec <cgraph_node *>
  82 possible_polymorphic_call_targets (struct cgraph_edge *e,
  83                                    bool *final = NULL,
  84                                    void **cache_token = NULL)
  85 {
  86   gcc_checking_assert (e->indirect_info->polymorphic);
  87   return possible_polymorphic_call_targets (e->indirect_info->otr_type,
  88                                             e->indirect_info->otr_token,
  89                                             final, cache_token);
  90 }
  91
  92 /* Dump possible targets of a polymorphic call E into F.  */
  93
  94 inline void
  95 dump_possible_polymorphic_call_targets (FILE *f, struct cgraph_edge *e)
  96 {
  97   gcc_checking_assert (e->indirect_info->polymorphic);
  98   dump_possible_polymorphic_call_targets (f, e->indirect_info->otr_type,
  99                                           e->indirect_info->otr_token);
 100 }
 101
 102 /* Return true if N can be possibly target of a polymorphic call of
 103    E.  */
 104
 105 inline bool
 106 possible_polymorphic_call_target_p (struct cgraph_edge *e,
 107                                     struct cgraph_node *n)
 108 {
 109   return possible_polymorphic_call_target_p (e->indirect_info->otr_type,
 110                                              e->indirect_info->otr_token, n);
 111 }
 112
 113 /* Return true if N can be possibly target of a polymorphic call of
 114    OBJ_TYPE_REF expression CALL.  */
 115
 116 inline bool
 117 possible_polymorphic_call_target_p (tree call,
 118                                     struct cgraph_node *n)
 119 {
 120   return possible_polymorphic_call_target_p (obj_type_ref_class (call),
 121                                              tree_low_cst
 122                                                 (OBJ_TYPE_REF_TOKEN (call), 1),
 123                                              n);
 124 }
 125 #endif  /* GCC_IPA_UTILS_H  */
 126
 127