]>
Commit | Line | Data |
---|---|---|
11bb4b27 | 1 | /* Some code common to C++ and ObjC++ front ends. |
68599f33 | 2 | Copyright (C) 2004, 2007, 2008, 2009 Free Software Foundation, Inc. |
11bb4b27 ZL |
3 | Contributed by Ziemowit Laski <zlaski@apple.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 | |
e77f031d | 9 | Software Foundation; either version 3, or (at your option) any later |
11bb4b27 ZL |
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 | |
e77f031d NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
11bb4b27 ZL |
20 | |
21 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
24 | #include "tm.h" | |
25 | #include "tree.h" | |
26 | #include "cp-tree.h" | |
27 | #include "c-common.h" | |
28 | #include "toplev.h" | |
29 | #include "langhooks.h" | |
30 | #include "langhooks-def.h" | |
31 | #include "diagnostic.h" | |
32 | #include "debug.h" | |
33 | #include "cxx-pretty-print.h" | |
34 | #include "cp-objcp-common.h" | |
35 | ||
36 | /* Special routine to get the alias set for C++. */ | |
37 | ||
4862826d | 38 | alias_set_type |
11bb4b27 ZL |
39 | cxx_get_alias_set (tree t) |
40 | { | |
41 | if (IS_FAKE_BASE_TYPE (t)) | |
42 | /* The base variant of a type must be in the same alias set as the | |
43 | complete type. */ | |
44 | return get_alias_set (TYPE_CONTEXT (t)); | |
45 | ||
46 | /* Punt on PMFs until we canonicalize functions properly. */ | |
a489b1f0 RG |
47 | if (TYPE_PTRMEMFUNC_P (t) |
48 | || (POINTER_TYPE_P (t) | |
49 | && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))) | |
11bb4b27 ZL |
50 | return 0; |
51 | ||
52 | return c_common_get_alias_set (t); | |
53 | } | |
54 | ||
55 | /* Called from check_global_declarations. */ | |
56 | ||
57 | bool | |
ac7d7749 | 58 | cxx_warn_unused_global_decl (const_tree decl) |
11bb4b27 ZL |
59 | { |
60 | if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)) | |
61 | return false; | |
62 | if (DECL_IN_SYSTEM_HEADER (decl)) | |
63 | return false; | |
64 | ||
65 | /* Const variables take the place of #defines in C++. */ | |
66 | if (TREE_CODE (decl) == VAR_DECL && TREE_READONLY (decl)) | |
67 | return false; | |
68 | ||
69 | return true; | |
70 | } | |
71 | ||
3b426391 | 72 | /* Langhook for expr_size: Tell the back end that the value of an expression |
11bb4b27 ZL |
73 | of non-POD class type does not include any tail padding; a derived class |
74 | might have allocated something there. */ | |
75 | ||
76 | tree | |
ac7d7749 | 77 | cp_expr_size (const_tree exp) |
11bb4b27 | 78 | { |
acb3f79a MM |
79 | tree type = TREE_TYPE (exp); |
80 | ||
81 | if (CLASS_TYPE_P (type)) | |
11bb4b27 | 82 | { |
3b426391 | 83 | /* The back end should not be interested in the size of an expression |
11bb4b27 ZL |
84 | of a type with both of these set; all copies of such types must go |
85 | through a constructor or assignment op. */ | |
26979bc2 JH |
86 | if (!TYPE_HAS_COMPLEX_INIT_REF (type) |
87 | || !TYPE_HAS_COMPLEX_ASSIGN_REF (type) | |
88 | /* But storing a CONSTRUCTOR isn't a copy. */ | |
89 | || TREE_CODE (exp) == CONSTRUCTOR | |
90 | /* And, the gimplifier will sometimes make a copy of | |
91 | an aggregate. In particular, for a case like: | |
92 | ||
93 | struct S { S(); }; | |
94 | struct X { int a; S s; }; | |
95 | X x = { 0 }; | |
96 | ||
97 | the gimplifier will create a temporary with | |
98 | static storage duration, perform static | |
99 | initialization of the temporary, and then copy | |
100 | the result. Since the "s" subobject is never | |
101 | constructed, this is a valid transformation. */ | |
102 | || CP_AGGREGATE_TYPE_P (type)) | |
103 | /* This would be wrong for a type with virtual bases. */ | |
2588c9e9 | 104 | return (is_really_empty_class (type) |
26979bc2 JH |
105 | ? size_zero_node |
106 | : CLASSTYPE_SIZE_UNIT (type)); | |
107 | else | |
108 | return NULL_TREE; | |
11bb4b27 ZL |
109 | } |
110 | else | |
111 | /* Use the default code. */ | |
71c00b5c | 112 | return tree_expr_size (exp); |
11bb4b27 ZL |
113 | } |
114 | ||
115 | /* Langhook for tree_size: determine size of our 'x' and 'c' nodes. */ | |
116 | size_t | |
117 | cp_tree_size (enum tree_code code) | |
118 | { | |
119 | switch (code) | |
120 | { | |
0cbd7506 | 121 | case PTRMEM_CST: return sizeof (struct ptrmem_cst); |
11bb4b27 | 122 | case BASELINK: return sizeof (struct tree_baselink); |
0cbd7506 | 123 | case TEMPLATE_PARM_INDEX: return sizeof (template_parm_index); |
11bb4b27 ZL |
124 | case DEFAULT_ARG: return sizeof (struct tree_default_arg); |
125 | case OVERLOAD: return sizeof (struct tree_overload); | |
55a3debe | 126 | case STATIC_ASSERT: return sizeof (struct tree_static_assert); |
5d80a306 DG |
127 | case TYPE_ARGUMENT_PACK: |
128 | case TYPE_PACK_EXPANSION: | |
129 | return sizeof (struct tree_common); | |
130 | ||
131 | case NONTYPE_ARGUMENT_PACK: | |
132 | case EXPR_PACK_EXPANSION: | |
133 | return sizeof (struct tree_exp); | |
134 | ||
135 | case ARGUMENT_PACK_SELECT: | |
136 | return sizeof (struct tree_argument_pack_select); | |
137 | ||
cb68ec50 PC |
138 | case TRAIT_EXPR: |
139 | return sizeof (struct tree_trait_expr); | |
140 | ||
d5f4eddd JM |
141 | case LAMBDA_EXPR: return sizeof (struct tree_lambda_expr); |
142 | ||
11bb4b27 ZL |
143 | default: |
144 | gcc_unreachable (); | |
145 | } | |
146 | /* NOTREACHED */ | |
147 | } | |
148 | ||
149 | /* Returns true if T is a variably modified type, in the sense of C99. | |
150 | FN is as passed to variably_modified_p. | |
151 | This routine needs only check cases that cannot be handled by the | |
152 | language-independent logic in tree.c. */ | |
153 | ||
154 | bool | |
155 | cp_var_mod_type_p (tree type, tree fn) | |
156 | { | |
157 | /* If TYPE is a pointer-to-member, it is variably modified if either | |
158 | the class or the member are variably modified. */ | |
159 | if (TYPE_PTR_TO_MEMBER_P (type)) | |
160 | return (variably_modified_type_p (TYPE_PTRMEM_CLASS_TYPE (type), fn) | |
161 | || variably_modified_type_p (TYPE_PTRMEM_POINTED_TO_TYPE (type), | |
162 | fn)); | |
163 | ||
164 | /* All other types are not variably modified. */ | |
165 | return false; | |
166 | } | |
167 | ||
168 | /* Construct a C++-aware pretty-printer for CONTEXT. It is assumed | |
169 | that CONTEXT->printer is an already constructed basic pretty_printer. */ | |
170 | void | |
171 | cxx_initialize_diagnostics (diagnostic_context *context) | |
172 | { | |
173 | pretty_printer *base = context->printer; | |
0ac1b889 | 174 | cxx_pretty_printer *pp = XNEW (cxx_pretty_printer); |
11bb4b27 ZL |
175 | memcpy (pp_base (pp), base, sizeof (pretty_printer)); |
176 | pp_cxx_pretty_printer_init (pp); | |
177 | context->printer = (pretty_printer *) pp; | |
178 | ||
179 | /* It is safe to free this object because it was previously malloc()'d. */ | |
180 | free (base); | |
181 | } | |
182 | ||
65958285 ZL |
183 | /* This compares two types for equivalence ("compatible" in C-based languages). |
184 | This routine should only return 1 if it is sure. It should not be used | |
185 | in contexts where erroneously returning 0 causes problems. */ | |
186 | ||
187 | int | |
188 | cxx_types_compatible_p (tree x, tree y) | |
189 | { | |
cf7bc668 | 190 | return same_type_ignoring_top_level_qualifiers_p (x, y); |
65958285 ZL |
191 | } |
192 | ||
68599f33 DS |
193 | /* Return true if DECL is explicit member function. */ |
194 | ||
195 | bool | |
196 | cp_function_decl_explicit_p (tree decl) | |
197 | { | |
198 | return (decl | |
199 | && FUNCTION_FIRST_USER_PARMTYPE (decl) != void_list_node | |
200 | && DECL_NONCONVERTING_P (decl)); | |
201 | } | |
202 | ||
11bb4b27 ZL |
203 | /* Stubs to keep c-opts.c happy. */ |
204 | void | |
205 | push_file_scope (void) | |
206 | { | |
207 | } | |
208 | ||
209 | void | |
210 | pop_file_scope (void) | |
211 | { | |
212 | } | |
213 | ||
214 | /* c-pragma.c needs to query whether a decl has extern "C" linkage. */ | |
215 | bool | |
58f9752a | 216 | has_c_linkage (const_tree decl) |
11bb4b27 ZL |
217 | { |
218 | return DECL_EXTERN_C_P (decl); | |
219 | } | |
3ed8593d | 220 | |
3db45ab5 | 221 | static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map))) |
3ed8593d AP |
222 | htab_t shadowed_var_for_decl; |
223 | ||
224 | /* Lookup a shadowed var for FROM, and return it if we find one. */ | |
225 | ||
3db45ab5 | 226 | tree |
3ed8593d AP |
227 | decl_shadowed_for_var_lookup (tree from) |
228 | { | |
229 | struct tree_map *h, in; | |
fc8600f9 | 230 | in.base.from = from; |
3ed8593d | 231 | |
3db45ab5 MS |
232 | h = (struct tree_map *) htab_find_with_hash (shadowed_var_for_decl, &in, |
233 | htab_hash_pointer (from)); | |
3ed8593d AP |
234 | if (h) |
235 | return h->to; | |
236 | return NULL_TREE; | |
237 | } | |
238 | ||
239 | /* Insert a mapping FROM->TO in the shadowed var hashtable. */ | |
240 | ||
241 | void | |
242 | decl_shadowed_for_var_insert (tree from, tree to) | |
243 | { | |
244 | struct tree_map *h; | |
245 | void **loc; | |
246 | ||
0ac1b889 | 247 | h = GGC_NEW (struct tree_map); |
3ed8593d | 248 | h->hash = htab_hash_pointer (from); |
fc8600f9 | 249 | h->base.from = from; |
3ed8593d AP |
250 | h->to = to; |
251 | loc = htab_find_slot_with_hash (shadowed_var_for_decl, h, h->hash, INSERT); | |
252 | *(struct tree_map **) loc = h; | |
253 | } | |
254 | ||
255 | void | |
256 | init_shadowed_var_for_decl (void) | |
257 | { | |
258 | shadowed_var_for_decl = htab_create_ggc (512, tree_map_hash, | |
259 | tree_map_eq, 0); | |
260 | } | |
261 | ||
262 | ||
263 | #include "gt-cp-cp-objcp-common.h" |