]>
Commit | Line | Data |
---|---|---|
c6a1db6c | 1 | /* Language-independent node constructors for parse phase of GNU compiler. |
06ceef4e | 2 | Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
32e8bb8e | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 |
71d59383 | 4 | Free Software Foundation, Inc. |
c6a1db6c | 5 | |
1322177d | 6 | This file is part of GCC. |
c6a1db6c | 7 | |
1322177d LB |
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 | |
9dcd6f09 | 10 | Software Foundation; either version 3, or (at your option) any later |
1322177d | 11 | version. |
c6a1db6c | 12 | |
1322177d LB |
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. | |
c6a1db6c RS |
17 | |
18 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
c6a1db6c | 21 | |
c6a1db6c RS |
22 | /* This file contains the low level primitives for operating on tree nodes, |
23 | including allocation, list operations, interning of identifiers, | |
24 | construction of data type nodes and statement nodes, | |
25 | and construction of type conversion nodes. It also contains | |
26 | tables index by tree code that describe how to take apart | |
27 | nodes of that code. | |
28 | ||
29 | It is intended to be language-independent, but occasionally | |
6d9f628e | 30 | calls language-dependent routines defined (for C) in typecheck.c. */ |
c6a1db6c RS |
31 | |
32 | #include "config.h" | |
670ee920 | 33 | #include "system.h" |
4977bab6 ZW |
34 | #include "coretypes.h" |
35 | #include "tm.h" | |
c6a1db6c | 36 | #include "flags.h" |
c6a1db6c | 37 | #include "tree.h" |
11ad4784 | 38 | #include "real.h" |
6baf1cc8 | 39 | #include "tm_p.h" |
d69c4bd1 | 40 | #include "function.h" |
c6a1db6c | 41 | #include "obstack.h" |
10f0ad3d | 42 | #include "toplev.h" |
87ff9c8e | 43 | #include "ggc.h" |
d88f311b | 44 | #include "hashtab.h" |
3b304f5b | 45 | #include "output.h" |
672a6f42 | 46 | #include "target.h" |
5d69f816 | 47 | #include "langhooks.h" |
f82a627c | 48 | #include "tree-inline.h" |
6de9cd9a DN |
49 | #include "tree-iterator.h" |
50 | #include "basic-block.h" | |
51 | #include "tree-flow.h" | |
89b0433e | 52 | #include "params.h" |
b8c4a565 | 53 | #include "pointer-set.h" |
325217ed | 54 | #include "fixed-value.h" |
4537ec0c DN |
55 | #include "tree-pass.h" |
56 | #include "langhooks-def.h" | |
57 | #include "diagnostic.h" | |
58 | #include "cgraph.h" | |
59 | #include "timevar.h" | |
60 | #include "except.h" | |
61 | #include "debug.h" | |
96c169e1 | 62 | #include "intl.h" |
956d6950 | 63 | |
c0ed0531 ILT |
64 | /* Tree code classes. */ |
65 | ||
66 | #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE, | |
67 | #define END_OF_BASE_TREE_CODES tcc_exceptional, | |
68 | ||
69 | const enum tree_code_class tree_code_type[] = { | |
70 | #include "all-tree.def" | |
71 | }; | |
72 | ||
73 | #undef DEFTREECODE | |
74 | #undef END_OF_BASE_TREE_CODES | |
75 | ||
76 | /* Table indexed by tree code giving number of expression | |
77 | operands beyond the fixed part of the node structure. | |
78 | Not used for types or decls. */ | |
79 | ||
80 | #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH, | |
81 | #define END_OF_BASE_TREE_CODES 0, | |
82 | ||
83 | const unsigned char tree_code_length[] = { | |
84 | #include "all-tree.def" | |
85 | }; | |
86 | ||
87 | #undef DEFTREECODE | |
88 | #undef END_OF_BASE_TREE_CODES | |
89 | ||
90 | /* Names of tree components. | |
91 | Used for printing out the tree and error messages. */ | |
92 | #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME, | |
93 | #define END_OF_BASE_TREE_CODES "@dummy", | |
94 | ||
95 | const char *const tree_code_name[] = { | |
96 | #include "all-tree.def" | |
97 | }; | |
98 | ||
99 | #undef DEFTREECODE | |
100 | #undef END_OF_BASE_TREE_CODES | |
101 | ||
6615c446 JO |
102 | /* Each tree code class has an associated string representation. |
103 | These must correspond to the tree_code_class entries. */ | |
104 | ||
b85e3643 ZW |
105 | const char *const tree_code_class_strings[] = |
106 | { | |
107 | "exceptional", | |
108 | "constant", | |
109 | "type", | |
110 | "declaration", | |
111 | "reference", | |
112 | "comparison", | |
113 | "unary", | |
114 | "binary", | |
115 | "statement", | |
5039610b | 116 | "vl_exp", |
726a989a | 117 | "expression" |
b85e3643 | 118 | }; |
6615c446 | 119 | |
dc478a5d | 120 | /* obstack.[ch] explicitly declined to prototype this. */ |
46c5ad27 | 121 | extern int _obstack_allocated_p (struct obstack *h, void *obj); |
c6a1db6c | 122 | |
3e16bfe2 | 123 | #ifdef GATHER_STATISTICS |
c6a1db6c | 124 | /* Statistics-gathering stuff. */ |
03646189 | 125 | |
dc478a5d KH |
126 | int tree_node_counts[(int) all_kinds]; |
127 | int tree_node_sizes[(int) all_kinds]; | |
03646189 | 128 | |
938d968e | 129 | /* Keep in sync with tree.h:enum tree_node_kind. */ |
341a243e | 130 | static const char * const tree_node_kind_names[] = { |
03646189 RS |
131 | "decls", |
132 | "types", | |
133 | "blocks", | |
134 | "stmts", | |
135 | "refs", | |
136 | "exprs", | |
137 | "constants", | |
138 | "identifiers", | |
03646189 RS |
139 | "perm_tree_lists", |
140 | "temp_tree_lists", | |
141 | "vecs", | |
95b4aca6 | 142 | "binfos", |
6de9cd9a | 143 | "ssa names", |
4038c495 | 144 | "constructors", |
03646189 RS |
145 | "random kinds", |
146 | "lang_decl kinds", | |
aaf46ef9 | 147 | "lang_type kinds", |
07beea0d | 148 | "omp clauses", |
03646189 | 149 | }; |
3e16bfe2 | 150 | #endif /* GATHER_STATISTICS */ |
c6a1db6c | 151 | |
0e77444b | 152 | /* Unique id for next decl created. */ |
03907fbd | 153 | static GTY(()) int next_decl_uid; |
579f50b6 | 154 | /* Unique id for next type created. */ |
03907fbd | 155 | static GTY(()) int next_type_uid = 1; |
0ca5af51 AO |
156 | /* Unique id for next debug decl created. Use negative numbers, |
157 | to catch erroneous uses. */ | |
158 | static GTY(()) int next_debug_decl_uid; | |
0e77444b | 159 | |
d88f311b ML |
160 | /* Since we cannot rehash a type after it is in the table, we have to |
161 | keep the hash code. */ | |
87ff9c8e | 162 | |
d1b38208 | 163 | struct GTY(()) type_hash { |
d88f311b ML |
164 | unsigned long hash; |
165 | tree type; | |
87ff9c8e RH |
166 | }; |
167 | ||
dc478a5d | 168 | /* Initial size of the hash table (rounded to next prime). */ |
d88f311b | 169 | #define TYPE_HASH_INITIAL_SIZE 1000 |
87ff9c8e | 170 | |
d88f311b ML |
171 | /* Now here is the hash table. When recording a type, it is added to |
172 | the slot whose index is the hash code. Note that the hash table is | |
173 | used for several kinds of types (function types, array types and | |
174 | array index range types, for now). While all these live in the | |
175 | same table, they are completely independent, and the hash code is | |
176 | computed differently for each of these. */ | |
177 | ||
e2500fed GK |
178 | static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash))) |
179 | htab_t type_hash_table; | |
87ff9c8e | 180 | |
b66a64f1 NS |
181 | /* Hash table and temporary node for larger integer const values. */ |
182 | static GTY (()) tree int_cst_node; | |
183 | static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node))) | |
184 | htab_t int_cst_hash_table; | |
185 | ||
ab442df7 MM |
186 | /* Hash table for optimization flags and target option flags. Use the same |
187 | hash table for both sets of options. Nodes for building the current | |
188 | optimization and target option nodes. The assumption is most of the time | |
189 | the options created will already be in the hash table, so we avoid | |
190 | allocating and freeing up a node repeatably. */ | |
191 | static GTY (()) tree cl_optimization_node; | |
192 | static GTY (()) tree cl_target_option_node; | |
193 | static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node))) | |
194 | htab_t cl_option_hash_table; | |
195 | ||
f991abd1 DB |
196 | /* General tree->tree mapping structure for use in hash tables. */ |
197 | ||
f991abd1 | 198 | |
b8698a0f | 199 | static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map))) |
f991abd1 DB |
200 | htab_t debug_expr_for_decl; |
201 | ||
b8698a0f | 202 | static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map))) |
833b3afe DB |
203 | htab_t value_expr_for_decl; |
204 | ||
b8698a0f | 205 | static GTY ((if_marked ("tree_priority_map_marked_p"), |
fc8600f9 | 206 | param_is (struct tree_priority_map))) |
820cc88f DB |
207 | htab_t init_priority_for_decl; |
208 | ||
46c5ad27 | 209 | static void set_type_quals (tree, int); |
46c5ad27 AJ |
210 | static int type_hash_eq (const void *, const void *); |
211 | static hashval_t type_hash_hash (const void *); | |
b66a64f1 NS |
212 | static hashval_t int_cst_hash_hash (const void *); |
213 | static int int_cst_hash_eq (const void *, const void *); | |
ab442df7 MM |
214 | static hashval_t cl_option_hash_hash (const void *); |
215 | static int cl_option_hash_eq (const void *, const void *); | |
46c5ad27 | 216 | static void print_type_hash_statistics (void); |
f991abd1 | 217 | static void print_debug_expr_statistics (void); |
833b3afe | 218 | static void print_value_expr_statistics (void); |
46c5ad27 | 219 | static int type_hash_marked_p (const void *); |
9566a759 KG |
220 | static unsigned int type_hash_list (const_tree, hashval_t); |
221 | static unsigned int attribute_hash_list (const_tree, hashval_t); | |
0a818f84 | 222 | |
81b3411c | 223 | tree global_trees[TI_MAX]; |
7145ef21 | 224 | tree integer_types[itk_none]; |
f991abd1 | 225 | |
00ffc97c | 226 | unsigned char tree_contains_struct[MAX_TREE_CODES][64]; |
aaf46ef9 DN |
227 | |
228 | /* Number of operands for each OpenMP clause. */ | |
229 | unsigned const char omp_clause_num_ops[] = | |
230 | { | |
231 | 0, /* OMP_CLAUSE_ERROR */ | |
232 | 1, /* OMP_CLAUSE_PRIVATE */ | |
233 | 1, /* OMP_CLAUSE_SHARED */ | |
234 | 1, /* OMP_CLAUSE_FIRSTPRIVATE */ | |
a68ab351 | 235 | 2, /* OMP_CLAUSE_LASTPRIVATE */ |
aaf46ef9 DN |
236 | 4, /* OMP_CLAUSE_REDUCTION */ |
237 | 1, /* OMP_CLAUSE_COPYIN */ | |
238 | 1, /* OMP_CLAUSE_COPYPRIVATE */ | |
239 | 1, /* OMP_CLAUSE_IF */ | |
240 | 1, /* OMP_CLAUSE_NUM_THREADS */ | |
241 | 1, /* OMP_CLAUSE_SCHEDULE */ | |
242 | 0, /* OMP_CLAUSE_NOWAIT */ | |
243 | 0, /* OMP_CLAUSE_ORDERED */ | |
a68ab351 JJ |
244 | 0, /* OMP_CLAUSE_DEFAULT */ |
245 | 3, /* OMP_CLAUSE_COLLAPSE */ | |
246 | 0 /* OMP_CLAUSE_UNTIED */ | |
aaf46ef9 DN |
247 | }; |
248 | ||
249 | const char * const omp_clause_code_name[] = | |
250 | { | |
251 | "error_clause", | |
252 | "private", | |
253 | "shared", | |
254 | "firstprivate", | |
255 | "lastprivate", | |
256 | "reduction", | |
257 | "copyin", | |
258 | "copyprivate", | |
259 | "if", | |
260 | "num_threads", | |
261 | "schedule", | |
262 | "nowait", | |
263 | "ordered", | |
a68ab351 JJ |
264 | "default", |
265 | "collapse", | |
266 | "untied" | |
aaf46ef9 | 267 | }; |
d251bfca DN |
268 | |
269 | ||
270 | /* Return the tree node structure used by tree code CODE. */ | |
271 | ||
272 | static inline enum tree_node_structure_enum | |
273 | tree_node_structure_for_code (enum tree_code code) | |
274 | { | |
275 | switch (TREE_CODE_CLASS (code)) | |
b8698a0f | 276 | { |
d251bfca DN |
277 | case tcc_declaration: |
278 | { | |
279 | switch (code) | |
280 | { | |
281 | case FIELD_DECL: | |
282 | return TS_FIELD_DECL; | |
283 | case PARM_DECL: | |
284 | return TS_PARM_DECL; | |
285 | case VAR_DECL: | |
286 | return TS_VAR_DECL; | |
287 | case LABEL_DECL: | |
288 | return TS_LABEL_DECL; | |
289 | case RESULT_DECL: | |
290 | return TS_RESULT_DECL; | |
a83f5409 AO |
291 | case DEBUG_EXPR_DECL: |
292 | return TS_DECL_WRTL; | |
d251bfca DN |
293 | case CONST_DECL: |
294 | return TS_CONST_DECL; | |
295 | case TYPE_DECL: | |
296 | return TS_TYPE_DECL; | |
297 | case FUNCTION_DECL: | |
298 | return TS_FUNCTION_DECL; | |
299 | default: | |
300 | return TS_DECL_NON_COMMON; | |
301 | } | |
302 | } | |
303 | case tcc_type: | |
304 | return TS_TYPE; | |
305 | case tcc_reference: | |
306 | case tcc_comparison: | |
307 | case tcc_unary: | |
308 | case tcc_binary: | |
309 | case tcc_expression: | |
310 | case tcc_statement: | |
311 | case tcc_vl_exp: | |
312 | return TS_EXP; | |
313 | default: /* tcc_constant and tcc_exceptional */ | |
314 | break; | |
315 | } | |
316 | switch (code) | |
317 | { | |
318 | /* tcc_constant cases. */ | |
319 | case INTEGER_CST: return TS_INT_CST; | |
320 | case REAL_CST: return TS_REAL_CST; | |
321 | case FIXED_CST: return TS_FIXED_CST; | |
322 | case COMPLEX_CST: return TS_COMPLEX; | |
323 | case VECTOR_CST: return TS_VECTOR; | |
324 | case STRING_CST: return TS_STRING; | |
325 | /* tcc_exceptional cases. */ | |
326 | case ERROR_MARK: return TS_COMMON; | |
327 | case IDENTIFIER_NODE: return TS_IDENTIFIER; | |
328 | case TREE_LIST: return TS_LIST; | |
329 | case TREE_VEC: return TS_VEC; | |
330 | case SSA_NAME: return TS_SSA_NAME; | |
331 | case PLACEHOLDER_EXPR: return TS_COMMON; | |
332 | case STATEMENT_LIST: return TS_STATEMENT_LIST; | |
333 | case BLOCK: return TS_BLOCK; | |
334 | case CONSTRUCTOR: return TS_CONSTRUCTOR; | |
335 | case TREE_BINFO: return TS_BINFO; | |
336 | case OMP_CLAUSE: return TS_OMP_CLAUSE; | |
337 | case OPTIMIZATION_NODE: return TS_OPTIMIZATION; | |
338 | case TARGET_OPTION_NODE: return TS_TARGET_OPTION; | |
339 | ||
340 | default: | |
341 | gcc_unreachable (); | |
342 | } | |
343 | } | |
344 | ||
345 | ||
346 | /* Initialize tree_contains_struct to describe the hierarchy of tree | |
347 | nodes. */ | |
348 | ||
349 | static void | |
350 | initialize_tree_contains_struct (void) | |
351 | { | |
352 | unsigned i; | |
353 | ||
354 | #define MARK_TS_BASE(C) \ | |
355 | do { \ | |
356 | tree_contains_struct[C][TS_BASE] = 1; \ | |
357 | } while (0) | |
358 | ||
359 | #define MARK_TS_COMMON(C) \ | |
360 | do { \ | |
361 | MARK_TS_BASE (C); \ | |
362 | tree_contains_struct[C][TS_COMMON] = 1; \ | |
363 | } while (0) | |
364 | ||
365 | #define MARK_TS_DECL_MINIMAL(C) \ | |
366 | do { \ | |
367 | MARK_TS_COMMON (C); \ | |
368 | tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \ | |
369 | } while (0) | |
b8698a0f | 370 | |
d251bfca DN |
371 | #define MARK_TS_DECL_COMMON(C) \ |
372 | do { \ | |
373 | MARK_TS_DECL_MINIMAL (C); \ | |
374 | tree_contains_struct[C][TS_DECL_COMMON] = 1; \ | |
375 | } while (0) | |
376 | ||
377 | #define MARK_TS_DECL_WRTL(C) \ | |
378 | do { \ | |
379 | MARK_TS_DECL_COMMON (C); \ | |
380 | tree_contains_struct[C][TS_DECL_WRTL] = 1; \ | |
381 | } while (0) | |
382 | ||
383 | #define MARK_TS_DECL_WITH_VIS(C) \ | |
384 | do { \ | |
385 | MARK_TS_DECL_WRTL (C); \ | |
386 | tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \ | |
387 | } while (0) | |
388 | ||
389 | #define MARK_TS_DECL_NON_COMMON(C) \ | |
390 | do { \ | |
391 | MARK_TS_DECL_WITH_VIS (C); \ | |
392 | tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \ | |
393 | } while (0) | |
394 | ||
395 | for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++) | |
396 | { | |
397 | enum tree_code code; | |
398 | enum tree_node_structure_enum ts_code; | |
399 | ||
400 | code = (enum tree_code) i; | |
401 | ts_code = tree_node_structure_for_code (code); | |
402 | ||
403 | /* Mark the TS structure itself. */ | |
404 | tree_contains_struct[code][ts_code] = 1; | |
405 | ||
406 | /* Mark all the structures that TS is derived from. */ | |
407 | switch (ts_code) | |
408 | { | |
409 | case TS_COMMON: | |
410 | MARK_TS_BASE (code); | |
411 | break; | |
412 | ||
413 | case TS_INT_CST: | |
414 | case TS_REAL_CST: | |
415 | case TS_FIXED_CST: | |
416 | case TS_VECTOR: | |
417 | case TS_STRING: | |
418 | case TS_COMPLEX: | |
419 | case TS_IDENTIFIER: | |
420 | case TS_DECL_MINIMAL: | |
421 | case TS_TYPE: | |
422 | case TS_LIST: | |
423 | case TS_VEC: | |
424 | case TS_EXP: | |
425 | case TS_SSA_NAME: | |
426 | case TS_BLOCK: | |
427 | case TS_BINFO: | |
428 | case TS_STATEMENT_LIST: | |
429 | case TS_CONSTRUCTOR: | |
430 | case TS_OMP_CLAUSE: | |
431 | case TS_OPTIMIZATION: | |
432 | case TS_TARGET_OPTION: | |
433 | MARK_TS_COMMON (code); | |
434 | break; | |
435 | ||
436 | case TS_DECL_COMMON: | |
437 | MARK_TS_DECL_MINIMAL (code); | |
438 | break; | |
439 | ||
440 | case TS_DECL_WRTL: | |
441 | MARK_TS_DECL_COMMON (code); | |
442 | break; | |
443 | ||
444 | case TS_DECL_NON_COMMON: | |
445 | MARK_TS_DECL_WITH_VIS (code); | |
446 | break; | |
447 | ||
448 | case TS_DECL_WITH_VIS: | |
449 | case TS_PARM_DECL: | |
450 | case TS_LABEL_DECL: | |
451 | case TS_RESULT_DECL: | |
452 | case TS_CONST_DECL: | |
453 | MARK_TS_DECL_WRTL (code); | |
454 | break; | |
455 | ||
456 | case TS_FIELD_DECL: | |
457 | MARK_TS_DECL_COMMON (code); | |
458 | break; | |
459 | ||
460 | case TS_VAR_DECL: | |
461 | MARK_TS_DECL_WITH_VIS (code); | |
462 | break; | |
463 | ||
464 | case TS_TYPE_DECL: | |
465 | case TS_FUNCTION_DECL: | |
466 | MARK_TS_DECL_NON_COMMON (code); | |
467 | break; | |
468 | ||
469 | default: | |
470 | gcc_unreachable (); | |
471 | } | |
472 | } | |
473 | ||
474 | /* Basic consistency checks for attributes used in fold. */ | |
475 | gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]); | |
476 | gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON]); | |
477 | gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]); | |
478 | gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]); | |
479 | gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]); | |
480 | gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]); | |
481 | gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]); | |
482 | gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]); | |
483 | gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]); | |
484 | gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]); | |
485 | gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]); | |
486 | gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]); | |
487 | gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]); | |
488 | gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]); | |
489 | gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]); | |
490 | gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]); | |
491 | gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]); | |
492 | gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]); | |
493 | gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]); | |
494 | gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]); | |
495 | gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]); | |
496 | gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]); | |
497 | gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]); | |
498 | gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]); | |
499 | gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]); | |
500 | gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]); | |
501 | gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]); | |
502 | gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]); | |
503 | gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]); | |
504 | gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]); | |
505 | gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS]); | |
506 | gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]); | |
507 | gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]); | |
508 | gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]); | |
509 | gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]); | |
510 | gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]); | |
511 | gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]); | |
512 | gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]); | |
513 | gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]); | |
514 | gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]); | |
515 | gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]); | |
516 | ||
517 | #undef MARK_TS_BASE | |
518 | #undef MARK_TS_COMMON | |
519 | #undef MARK_TS_DECL_MINIMAL | |
520 | #undef MARK_TS_DECL_COMMON | |
521 | #undef MARK_TS_DECL_WRTL | |
522 | #undef MARK_TS_DECL_WITH_VIS | |
523 | #undef MARK_TS_DECL_NON_COMMON | |
524 | } | |
525 | ||
526 | ||
6d9f628e | 527 | /* Init tree.c. */ |
c6a1db6c RS |
528 | |
529 | void | |
46c5ad27 | 530 | init_ttree (void) |
c6a1db6c | 531 | { |
d4b60170 | 532 | /* Initialize the hash table of types. */ |
17211ab5 GK |
533 | type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash, |
534 | type_hash_eq, 0); | |
f991abd1 DB |
535 | |
536 | debug_expr_for_decl = htab_create_ggc (512, tree_map_hash, | |
537 | tree_map_eq, 0); | |
538 | ||
833b3afe DB |
539 | value_expr_for_decl = htab_create_ggc (512, tree_map_hash, |
540 | tree_map_eq, 0); | |
fc8600f9 MM |
541 | init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash, |
542 | tree_priority_map_eq, 0); | |
833b3afe | 543 | |
b66a64f1 NS |
544 | int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash, |
545 | int_cst_hash_eq, NULL); | |
b8698a0f | 546 | |
b66a64f1 | 547 | int_cst_node = make_node (INTEGER_CST); |
f991abd1 | 548 | |
ab442df7 MM |
549 | cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash, |
550 | cl_option_hash_eq, NULL); | |
551 | ||
552 | cl_optimization_node = make_node (OPTIMIZATION_NODE); | |
553 | cl_target_option_node = make_node (TARGET_OPTION_NODE); | |
554 | ||
d251bfca DN |
555 | /* Initialize the tree_contains_struct array. */ |
556 | initialize_tree_contains_struct (); | |
820cc88f | 557 | lang_hooks.init_ts (); |
c6a1db6c RS |
558 | } |
559 | ||
c6a1db6c | 560 | \f |
599bba86 NB |
561 | /* The name of the object as the assembler will see it (but before any |
562 | translations made by ASM_OUTPUT_LABELREF). Often this is the same | |
563 | as DECL_NAME. It is an IDENTIFIER_NODE. */ | |
564 | tree | |
46c5ad27 | 565 | decl_assembler_name (tree decl) |
599bba86 NB |
566 | { |
567 | if (!DECL_ASSEMBLER_NAME_SET_P (decl)) | |
ae2bcd98 | 568 | lang_hooks.set_decl_assembler_name (decl); |
820cc88f | 569 | return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name; |
599bba86 NB |
570 | } |
571 | ||
8a4a83ed JH |
572 | /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */ |
573 | ||
574 | bool | |
266ad5c8 | 575 | decl_assembler_name_equal (tree decl, const_tree asmname) |
8a4a83ed JH |
576 | { |
577 | tree decl_asmname = DECL_ASSEMBLER_NAME (decl); | |
4d16a7b7 JH |
578 | const char *decl_str; |
579 | const char *asmname_str; | |
580 | bool test = false; | |
8a4a83ed JH |
581 | |
582 | if (decl_asmname == asmname) | |
583 | return true; | |
584 | ||
4d16a7b7 JH |
585 | decl_str = IDENTIFIER_POINTER (decl_asmname); |
586 | asmname_str = IDENTIFIER_POINTER (asmname); | |
b8698a0f | 587 | |
4d16a7b7 | 588 | |
8a4a83ed JH |
589 | /* If the target assembler name was set by the user, things are trickier. |
590 | We have a leading '*' to begin with. After that, it's arguable what | |
591 | is the correct thing to do with -fleading-underscore. Arguably, we've | |
592 | historically been doing the wrong thing in assemble_alias by always | |
593 | printing the leading underscore. Since we're not changing that, make | |
594 | sure user_label_prefix follows the '*' before matching. */ | |
4d16a7b7 | 595 | if (decl_str[0] == '*') |
8a4a83ed | 596 | { |
8a4a83ed JH |
597 | size_t ulp_len = strlen (user_label_prefix); |
598 | ||
4d16a7b7 JH |
599 | decl_str ++; |
600 | ||
8a4a83ed | 601 | if (ulp_len == 0) |
4d16a7b7 | 602 | test = true; |
8a4a83ed | 603 | else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0) |
4d16a7b7 | 604 | decl_str += ulp_len, test=true; |
8a4a83ed | 605 | else |
4d16a7b7 JH |
606 | decl_str --; |
607 | } | |
608 | if (asmname_str[0] == '*') | |
609 | { | |
610 | size_t ulp_len = strlen (user_label_prefix); | |
611 | ||
612 | asmname_str ++; | |
8a4a83ed | 613 | |
4d16a7b7 JH |
614 | if (ulp_len == 0) |
615 | test = true; | |
616 | else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0) | |
617 | asmname_str += ulp_len, test=true; | |
618 | else | |
619 | asmname_str --; | |
8a4a83ed JH |
620 | } |
621 | ||
4d16a7b7 JH |
622 | if (!test) |
623 | return false; | |
624 | return strcmp (decl_str, asmname_str) == 0; | |
8a4a83ed JH |
625 | } |
626 | ||
266ad5c8 JH |
627 | /* Hash asmnames ignoring the user specified marks. */ |
628 | ||
629 | hashval_t | |
630 | decl_assembler_name_hash (const_tree asmname) | |
631 | { | |
632 | if (IDENTIFIER_POINTER (asmname)[0] == '*') | |
633 | { | |
634 | const char *decl_str = IDENTIFIER_POINTER (asmname) + 1; | |
635 | size_t ulp_len = strlen (user_label_prefix); | |
636 | ||
637 | if (ulp_len == 0) | |
638 | ; | |
639 | else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0) | |
640 | decl_str += ulp_len; | |
641 | ||
642 | return htab_hash_string (decl_str); | |
643 | } | |
644 | ||
645 | return htab_hash_string (IDENTIFIER_POINTER (asmname)); | |
646 | } | |
647 | ||
a396f8ae | 648 | /* Compute the number of bytes occupied by a tree with code CODE. |
5039610b | 649 | This function cannot be used for nodes that have variable sizes, |
726a989a | 650 | including TREE_VEC, STRING_CST, and CALL_EXPR. */ |
c5620996 | 651 | size_t |
a38b644b | 652 | tree_code_size (enum tree_code code) |
c5620996 | 653 | { |
c5620996 GK |
654 | switch (TREE_CODE_CLASS (code)) |
655 | { | |
6615c446 | 656 | case tcc_declaration: /* A decl node */ |
820cc88f DB |
657 | { |
658 | switch (code) | |
659 | { | |
660 | case FIELD_DECL: | |
661 | return sizeof (struct tree_field_decl); | |
662 | case PARM_DECL: | |
663 | return sizeof (struct tree_parm_decl); | |
664 | case VAR_DECL: | |
665 | return sizeof (struct tree_var_decl); | |
666 | case LABEL_DECL: | |
667 | return sizeof (struct tree_label_decl); | |
668 | case RESULT_DECL: | |
669 | return sizeof (struct tree_result_decl); | |
670 | case CONST_DECL: | |
671 | return sizeof (struct tree_const_decl); | |
672 | case TYPE_DECL: | |
673 | return sizeof (struct tree_type_decl); | |
674 | case FUNCTION_DECL: | |
675 | return sizeof (struct tree_function_decl); | |
a83f5409 AO |
676 | case DEBUG_EXPR_DECL: |
677 | return sizeof (struct tree_decl_with_rtl); | |
820cc88f DB |
678 | default: |
679 | return sizeof (struct tree_decl_non_common); | |
680 | } | |
681 | } | |
c5620996 | 682 | |
6615c446 | 683 | case tcc_type: /* a type node */ |
c5620996 GK |
684 | return sizeof (struct tree_type); |
685 | ||
6615c446 JO |
686 | case tcc_reference: /* a reference */ |
687 | case tcc_expression: /* an expression */ | |
688 | case tcc_statement: /* an expression with side effects */ | |
689 | case tcc_comparison: /* a comparison expression */ | |
690 | case tcc_unary: /* a unary arithmetic expression */ | |
691 | case tcc_binary: /* a binary arithmetic expression */ | |
c5620996 | 692 | return (sizeof (struct tree_exp) |
5039610b | 693 | + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree)); |
c5620996 | 694 | |
6615c446 | 695 | case tcc_constant: /* a constant */ |
d78e771d ZW |
696 | switch (code) |
697 | { | |
698 | case INTEGER_CST: return sizeof (struct tree_int_cst); | |
699 | case REAL_CST: return sizeof (struct tree_real_cst); | |
325217ed | 700 | case FIXED_CST: return sizeof (struct tree_fixed_cst); |
d78e771d ZW |
701 | case COMPLEX_CST: return sizeof (struct tree_complex); |
702 | case VECTOR_CST: return sizeof (struct tree_vector); | |
a396f8ae | 703 | case STRING_CST: gcc_unreachable (); |
d78e771d | 704 | default: |
ae2bcd98 | 705 | return lang_hooks.tree_size (code); |
d78e771d | 706 | } |
c5620996 | 707 | |
6615c446 | 708 | case tcc_exceptional: /* something random, like an identifier. */ |
d78e771d ZW |
709 | switch (code) |
710 | { | |
711 | case IDENTIFIER_NODE: return lang_hooks.identifier_size; | |
712 | case TREE_LIST: return sizeof (struct tree_list); | |
d78e771d ZW |
713 | |
714 | case ERROR_MARK: | |
715 | case PLACEHOLDER_EXPR: return sizeof (struct tree_common); | |
716 | ||
a396f8ae | 717 | case TREE_VEC: |
726a989a | 718 | case OMP_CLAUSE: gcc_unreachable (); |
6de9cd9a | 719 | |
6de9cd9a | 720 | case SSA_NAME: return sizeof (struct tree_ssa_name); |
6de9cd9a DN |
721 | |
722 | case STATEMENT_LIST: return sizeof (struct tree_statement_list); | |
90afe2c9 | 723 | case BLOCK: return sizeof (struct tree_block); |
4038c495 | 724 | case CONSTRUCTOR: return sizeof (struct tree_constructor); |
ab442df7 MM |
725 | case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option); |
726 | case TARGET_OPTION_NODE: return sizeof (struct tree_target_option); | |
6de9cd9a | 727 | |
d78e771d | 728 | default: |
ae2bcd98 | 729 | return lang_hooks.tree_size (code); |
d78e771d | 730 | } |
c5620996 GK |
731 | |
732 | default: | |
1e128c5f | 733 | gcc_unreachable (); |
c5620996 GK |
734 | } |
735 | } | |
736 | ||
a38b644b | 737 | /* Compute the number of bytes occupied by NODE. This routine only |
5039610b | 738 | looks at TREE_CODE, except for those nodes that have variable sizes. */ |
a38b644b | 739 | size_t |
9566a759 | 740 | tree_size (const_tree node) |
a38b644b | 741 | { |
9566a759 | 742 | const enum tree_code code = TREE_CODE (node); |
a38b644b ZW |
743 | switch (code) |
744 | { | |
0ebfd2c9 RS |
745 | case TREE_BINFO: |
746 | return (offsetof (struct tree_binfo, base_binfos) | |
747 | + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node))); | |
a38b644b ZW |
748 | |
749 | case TREE_VEC: | |
750 | return (sizeof (struct tree_vec) | |
5039610b | 751 | + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree)); |
a38b644b | 752 | |
a396f8ae | 753 | case STRING_CST: |
43b50eb2 | 754 | return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1; |
a396f8ae | 755 | |
aaf46ef9 DN |
756 | case OMP_CLAUSE: |
757 | return (sizeof (struct tree_omp_clause) | |
758 | + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1) | |
759 | * sizeof (tree)); | |
760 | ||
a38b644b | 761 | default: |
5039610b SL |
762 | if (TREE_CODE_CLASS (code) == tcc_vl_exp) |
763 | return (sizeof (struct tree_exp) | |
764 | + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree)); | |
765 | else | |
766 | return tree_code_size (code); | |
a38b644b ZW |
767 | } |
768 | } | |
769 | ||
770 | /* Return a newly allocated node of code CODE. For decl and type | |
771 | nodes, some other fields are initialized. The rest of the node is | |
726a989a RB |
772 | initialized to zero. This function cannot be used for TREE_VEC or |
773 | OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size. | |
c6a1db6c RS |
774 | |
775 | Achoo! I got a code in the node. */ | |
776 | ||
777 | tree | |
b9dcdee4 | 778 | make_node_stat (enum tree_code code MEM_STAT_DECL) |
c6a1db6c | 779 | { |
b3694847 | 780 | tree t; |
6615c446 | 781 | enum tree_code_class type = TREE_CODE_CLASS (code); |
a38b644b | 782 | size_t length = tree_code_size (code); |
5e9defae | 783 | #ifdef GATHER_STATISTICS |
b3694847 | 784 | tree_node_kind kind; |
3b03c671 | 785 | |
c6a1db6c RS |
786 | switch (type) |
787 | { | |
6615c446 | 788 | case tcc_declaration: /* A decl node */ |
c6a1db6c | 789 | kind = d_kind; |
c6a1db6c RS |
790 | break; |
791 | ||
6615c446 | 792 | case tcc_type: /* a type node */ |
c6a1db6c | 793 | kind = t_kind; |
c6a1db6c RS |
794 | break; |
795 | ||
6615c446 | 796 | case tcc_statement: /* an expression with side effects */ |
c6a1db6c | 797 | kind = s_kind; |
c5620996 GK |
798 | break; |
799 | ||
6615c446 | 800 | case tcc_reference: /* a reference */ |
c6a1db6c | 801 | kind = r_kind; |
c5620996 GK |
802 | break; |
803 | ||
6615c446 JO |
804 | case tcc_expression: /* an expression */ |
805 | case tcc_comparison: /* a comparison expression */ | |
806 | case tcc_unary: /* a unary arithmetic expression */ | |
807 | case tcc_binary: /* a binary arithmetic expression */ | |
c6a1db6c | 808 | kind = e_kind; |
c6a1db6c RS |
809 | break; |
810 | ||
6615c446 | 811 | case tcc_constant: /* a constant */ |
c6a1db6c | 812 | kind = c_kind; |
66212c2f | 813 | break; |
c6a1db6c | 814 | |
6615c446 | 815 | case tcc_exceptional: /* something random, like an identifier. */ |
c4b3f0eb NS |
816 | switch (code) |
817 | { | |
818 | case IDENTIFIER_NODE: | |
819 | kind = id_kind; | |
820 | break; | |
821 | ||
4038c495 | 822 | case TREE_VEC: |
c4b3f0eb NS |
823 | kind = vec_kind; |
824 | break; | |
825 | ||
826 | case TREE_BINFO: | |
827 | kind = binfo_kind; | |
828 | break; | |
829 | ||
c4b3f0eb NS |
830 | case SSA_NAME: |
831 | kind = ssa_name_kind; | |
832 | break; | |
833 | ||
834 | case BLOCK: | |
835 | kind = b_kind; | |
836 | break; | |
837 | ||
4038c495 GB |
838 | case CONSTRUCTOR: |
839 | kind = constr_kind; | |
840 | break; | |
841 | ||
c4b3f0eb NS |
842 | default: |
843 | kind = x_kind; | |
844 | break; | |
845 | } | |
a7fcb968 | 846 | break; |
b8698a0f | 847 | |
c4b3f0eb NS |
848 | default: |
849 | gcc_unreachable (); | |
c6a1db6c RS |
850 | } |
851 | ||
dc478a5d KH |
852 | tree_node_counts[(int) kind]++; |
853 | tree_node_sizes[(int) kind] += length; | |
c6a1db6c RS |
854 | #endif |
855 | ||
08cee789 | 856 | if (code == IDENTIFIER_NODE) |
3d9a9f94 | 857 | t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone); |
08cee789 | 858 | else |
3d9a9f94 | 859 | t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone); |
c5620996 | 860 | |
fad205ff | 861 | memset (t, 0, length); |
c5620996 | 862 | |
c6a1db6c | 863 | TREE_SET_CODE (t, code); |
c6a1db6c RS |
864 | |
865 | switch (type) | |
866 | { | |
6615c446 | 867 | case tcc_statement: |
c6a1db6c | 868 | TREE_SIDE_EFFECTS (t) = 1; |
c6a1db6c RS |
869 | break; |
870 | ||
6615c446 | 871 | case tcc_declaration: |
326eda4b DB |
872 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) |
873 | { | |
d872ada0 GK |
874 | if (code == FUNCTION_DECL) |
875 | { | |
876 | DECL_ALIGN (t) = FUNCTION_BOUNDARY; | |
877 | DECL_MODE (t) = FUNCTION_MODE; | |
878 | } | |
879 | else | |
326eda4b | 880 | DECL_ALIGN (t) = 1; |
326eda4b | 881 | } |
f31686a3 | 882 | DECL_SOURCE_LOCATION (t) = input_location; |
0ca5af51 AO |
883 | if (TREE_CODE (t) == DEBUG_EXPR_DECL) |
884 | DECL_UID (t) = --next_debug_decl_uid; | |
885 | else | |
886 | DECL_UID (t) = next_decl_uid++; | |
5b21f0f3 RG |
887 | if (TREE_CODE (t) == LABEL_DECL) |
888 | LABEL_DECL_UID (t) = -1; | |
128e8aa9 | 889 | |
c6a1db6c RS |
890 | break; |
891 | ||
6615c446 | 892 | case tcc_type: |
579f50b6 | 893 | TYPE_UID (t) = next_type_uid++; |
490272b4 | 894 | TYPE_ALIGN (t) = BITS_PER_UNIT; |
11cf4d18 | 895 | TYPE_USER_ALIGN (t) = 0; |
c6a1db6c | 896 | TYPE_MAIN_VARIANT (t) = t; |
06d40de8 | 897 | TYPE_CANONICAL (t) = t; |
128e8aa9 RK |
898 | |
899 | /* Default to no attributes for type, but let target change that. */ | |
91e97eb8 | 900 | TYPE_ATTRIBUTES (t) = NULL_TREE; |
5fd9b178 | 901 | targetm.set_default_type_attributes (t); |
128e8aa9 RK |
902 | |
903 | /* We have not yet computed the alias set for this type. */ | |
41472af8 | 904 | TYPE_ALIAS_SET (t) = -1; |
c6a1db6c RS |
905 | break; |
906 | ||
6615c446 | 907 | case tcc_constant: |
c6a1db6c RS |
908 | TREE_CONSTANT (t) = 1; |
909 | break; | |
783feeb0 | 910 | |
6615c446 | 911 | case tcc_expression: |
783feeb0 MM |
912 | switch (code) |
913 | { | |
914 | case INIT_EXPR: | |
915 | case MODIFY_EXPR: | |
916 | case VA_ARG_EXPR: | |
783feeb0 MM |
917 | case PREDECREMENT_EXPR: |
918 | case PREINCREMENT_EXPR: | |
919 | case POSTDECREMENT_EXPR: | |
920 | case POSTINCREMENT_EXPR: | |
921 | /* All of these have side-effects, no matter what their | |
922 | operands are. */ | |
923 | TREE_SIDE_EFFECTS (t) = 1; | |
924 | break; | |
dc478a5d | 925 | |
783feeb0 MM |
926 | default: |
927 | break; | |
928 | } | |
929 | break; | |
6615c446 JO |
930 | |
931 | default: | |
932 | /* Other classes need no special treatment. */ | |
933 | break; | |
c6a1db6c RS |
934 | } |
935 | ||
936 | return t; | |
937 | } | |
938 | \f | |
c3da6f12 | 939 | /* Return a new node with the same contents as NODE except that its |
3af4c257 | 940 | TREE_CHAIN is zero and it has a fresh uid. */ |
c6a1db6c RS |
941 | |
942 | tree | |
b9dcdee4 | 943 | copy_node_stat (tree node MEM_STAT_DECL) |
c6a1db6c | 944 | { |
b3694847 SS |
945 | tree t; |
946 | enum tree_code code = TREE_CODE (node); | |
947 | size_t length; | |
c6a1db6c | 948 | |
1e128c5f | 949 | gcc_assert (code != STATEMENT_LIST); |
6de9cd9a | 950 | |
c5620996 | 951 | length = tree_size (node); |
3d9a9f94 | 952 | t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone); |
2e28f042 | 953 | memcpy (t, node, length); |
c6a1db6c | 954 | |
726a989a | 955 | TREE_CHAIN (t) = 0; |
69b7087e | 956 | TREE_ASM_WRITTEN (t) = 0; |
6de9cd9a | 957 | TREE_VISITED (t) = 0; |
a5883ba0 MM |
958 | if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL) |
959 | *DECL_VAR_ANN_PTR (t) = 0; | |
c6a1db6c | 960 | |
6615c446 | 961 | if (TREE_CODE_CLASS (code) == tcc_declaration) |
833b3afe | 962 | { |
0ca5af51 AO |
963 | if (code == DEBUG_EXPR_DECL) |
964 | DECL_UID (t) = --next_debug_decl_uid; | |
965 | else | |
966 | DECL_UID (t) = next_decl_uid++; | |
833b3afe DB |
967 | if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL) |
968 | && DECL_HAS_VALUE_EXPR_P (node)) | |
969 | { | |
970 | SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node)); | |
971 | DECL_HAS_VALUE_EXPR_P (t) = 1; | |
972 | } | |
820cc88f DB |
973 | if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node)) |
974 | { | |
975 | SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node)); | |
976 | DECL_HAS_INIT_PRIORITY_P (t) = 1; | |
977 | } | |
833b3afe | 978 | } |
6615c446 | 979 | else if (TREE_CODE_CLASS (code) == tcc_type) |
d9cbc259 RK |
980 | { |
981 | TYPE_UID (t) = next_type_uid++; | |
28238567 PB |
982 | /* The following is so that the debug code for |
983 | the copy is different from the original type. | |
984 | The two statements usually duplicate each other | |
985 | (because they clear fields of the same union), | |
0f41302f | 986 | but the optimizer should catch that. */ |
28238567 PB |
987 | TYPE_SYMTAB_POINTER (t) = 0; |
988 | TYPE_SYMTAB_ADDRESS (t) = 0; | |
b8698a0f | 989 | |
8c1d6d62 NS |
990 | /* Do not copy the values cache. */ |
991 | if (TYPE_CACHED_VALUES_P(t)) | |
992 | { | |
993 | TYPE_CACHED_VALUES_P (t) = 0; | |
994 | TYPE_CACHED_VALUES (t) = NULL_TREE; | |
995 | } | |
d9cbc259 | 996 | } |
579f50b6 | 997 | |
c6a1db6c RS |
998 | return t; |
999 | } | |
1000 | ||
1001 | /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field. | |
1002 | For example, this can copy a list made of TREE_LIST nodes. */ | |
1003 | ||
1004 | tree | |
46c5ad27 | 1005 | copy_list (tree list) |
c6a1db6c RS |
1006 | { |
1007 | tree head; | |
b3694847 | 1008 | tree prev, next; |
c6a1db6c RS |
1009 | |
1010 | if (list == 0) | |
1011 | return 0; | |
1012 | ||
1013 | head = prev = copy_node (list); | |
1014 | next = TREE_CHAIN (list); | |
1015 | while (next) | |
1016 | { | |
1017 | TREE_CHAIN (prev) = copy_node (next); | |
1018 | prev = TREE_CHAIN (prev); | |
1019 | next = TREE_CHAIN (next); | |
1020 | } | |
1021 | return head; | |
1022 | } | |
a94dbf2c | 1023 | |
c6a1db6c | 1024 | \f |
7d60be94 NS |
1025 | /* Create an INT_CST node with a LOW value sign extended. */ |
1026 | ||
d938569c RK |
1027 | tree |
1028 | build_int_cst (tree type, HOST_WIDE_INT low) | |
7d60be94 | 1029 | { |
7fb41a42 RG |
1030 | /* Support legacy code. */ |
1031 | if (!type) | |
1032 | type = integer_type_node; | |
1033 | ||
69fbfdd8 | 1034 | return build_int_cst_wide (type, low, low < 0 ? -1 : 0); |
7d60be94 NS |
1035 | } |
1036 | ||
1037 | /* Create an INT_CST node with a LOW value zero extended. */ | |
1038 | ||
d938569c RK |
1039 | tree |
1040 | build_int_cstu (tree type, unsigned HOST_WIDE_INT low) | |
7d60be94 NS |
1041 | { |
1042 | return build_int_cst_wide (type, low, 0); | |
1043 | } | |
1044 | ||
89d12f5d ZD |
1045 | /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended |
1046 | if it is negative. This function is similar to build_int_cst, but | |
1047 | the extra bits outside of the type precision are cleared. Constants | |
1048 | with these extra bits may confuse the fold so that it detects overflows | |
1049 | even in cases when they do not occur, and in general should be avoided. | |
1050 | We cannot however make this a default behavior of build_int_cst without | |
1051 | more intrusive changes, since there are parts of gcc that rely on the extra | |
1052 | precision of the integer constants. */ | |
8b11a64c ZD |
1053 | |
1054 | tree | |
1055 | build_int_cst_type (tree type, HOST_WIDE_INT low) | |
1056 | { | |
2b60792f RG |
1057 | unsigned HOST_WIDE_INT low1; |
1058 | HOST_WIDE_INT hi; | |
8b11a64c | 1059 | |
2b60792f | 1060 | gcc_assert (type); |
89d12f5d | 1061 | |
2b60792f | 1062 | fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type); |
8b11a64c | 1063 | |
2b60792f | 1064 | return build_int_cst_wide (type, low1, hi); |
8b11a64c ZD |
1065 | } |
1066 | ||
2ac7cbb5 RG |
1067 | /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated |
1068 | and sign extended according to the value range of TYPE. */ | |
1069 | ||
1070 | tree | |
1071 | build_int_cst_wide_type (tree type, | |
1072 | unsigned HOST_WIDE_INT low, HOST_WIDE_INT high) | |
1073 | { | |
1074 | fit_double_type (low, high, &low, &high, type); | |
1075 | return build_int_cst_wide (type, low, high); | |
1076 | } | |
1077 | ||
b66a64f1 NS |
1078 | /* These are the hash table functions for the hash table of INTEGER_CST |
1079 | nodes of a sizetype. */ | |
1080 | ||
1081 | /* Return the hash code code X, an INTEGER_CST. */ | |
1082 | ||
1083 | static hashval_t | |
1084 | int_cst_hash_hash (const void *x) | |
1085 | { | |
741ac903 | 1086 | const_tree const t = (const_tree) x; |
b66a64f1 NS |
1087 | |
1088 | return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t) | |
1089 | ^ htab_hash_pointer (TREE_TYPE (t))); | |
1090 | } | |
1091 | ||
1092 | /* Return nonzero if the value represented by *X (an INTEGER_CST tree node) | |
1093 | is the same as that given by *Y, which is the same. */ | |
1094 | ||
1095 | static int | |
1096 | int_cst_hash_eq (const void *x, const void *y) | |
1097 | { | |
741ac903 KG |
1098 | const_tree const xt = (const_tree) x; |
1099 | const_tree const yt = (const_tree) y; | |
b66a64f1 NS |
1100 | |
1101 | return (TREE_TYPE (xt) == TREE_TYPE (yt) | |
1102 | && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt) | |
1103 | && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt)); | |
1104 | } | |
1105 | ||
2ac7cbb5 RG |
1106 | /* Create an INT_CST node of TYPE and value HI:LOW. |
1107 | The returned node is always shared. For small integers we use a | |
1108 | per-type vector cache, for larger ones we use a single hash table. */ | |
c6a1db6c RS |
1109 | |
1110 | tree | |
7d60be94 | 1111 | build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi) |
c6a1db6c | 1112 | { |
4a90aeeb | 1113 | tree t; |
89b0433e NS |
1114 | int ix = -1; |
1115 | int limit = 0; | |
4a90aeeb | 1116 | |
7fb41a42 | 1117 | gcc_assert (type); |
19114537 | 1118 | |
89b0433e NS |
1119 | switch (TREE_CODE (type)) |
1120 | { | |
1121 | case POINTER_TYPE: | |
1122 | case REFERENCE_TYPE: | |
1123 | /* Cache NULL pointer. */ | |
1124 | if (!hi && !low) | |
1125 | { | |
1126 | limit = 1; | |
1127 | ix = 0; | |
1128 | } | |
1129 | break; | |
19114537 | 1130 | |
89b0433e NS |
1131 | case BOOLEAN_TYPE: |
1132 | /* Cache false or true. */ | |
1133 | limit = 2; | |
1134 | if (!hi && low < 2) | |
1135 | ix = low; | |
1136 | break; | |
19114537 | 1137 | |
89b0433e | 1138 | case INTEGER_TYPE: |
89b0433e NS |
1139 | case OFFSET_TYPE: |
1140 | if (TYPE_UNSIGNED (type)) | |
1141 | { | |
1142 | /* Cache 0..N */ | |
1143 | limit = INTEGER_SHARE_LIMIT; | |
1144 | if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT) | |
1145 | ix = low; | |
1146 | } | |
1147 | else | |
1148 | { | |
1149 | /* Cache -1..N */ | |
1150 | limit = INTEGER_SHARE_LIMIT + 1; | |
1151 | if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT) | |
1152 | ix = low + 1; | |
1153 | else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1) | |
1154 | ix = 0; | |
1155 | } | |
1156 | break; | |
b8b7f162 RS |
1157 | |
1158 | case ENUMERAL_TYPE: | |
89b0433e | 1159 | break; |
b8b7f162 RS |
1160 | |
1161 | default: | |
1162 | gcc_unreachable (); | |
89b0433e | 1163 | } |
19114537 | 1164 | |
89b0433e NS |
1165 | if (ix >= 0) |
1166 | { | |
b66a64f1 | 1167 | /* Look for it in the type's vector of small shared ints. */ |
89b0433e NS |
1168 | if (!TYPE_CACHED_VALUES_P (type)) |
1169 | { | |
1170 | TYPE_CACHED_VALUES_P (type) = 1; | |
1171 | TYPE_CACHED_VALUES (type) = make_tree_vec (limit); | |
1172 | } | |
19114537 | 1173 | |
89b0433e NS |
1174 | t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix); |
1175 | if (t) | |
1176 | { | |
1177 | /* Make sure no one is clobbering the shared constant. */ | |
1e128c5f GB |
1178 | gcc_assert (TREE_TYPE (t) == type); |
1179 | gcc_assert (TREE_INT_CST_LOW (t) == low); | |
1180 | gcc_assert (TREE_INT_CST_HIGH (t) == hi); | |
b66a64f1 NS |
1181 | } |
1182 | else | |
1183 | { | |
1184 | /* Create a new shared int. */ | |
1185 | t = make_node (INTEGER_CST); | |
1186 | ||
1187 | TREE_INT_CST_LOW (t) = low; | |
1188 | TREE_INT_CST_HIGH (t) = hi; | |
1189 | TREE_TYPE (t) = type; | |
b8698a0f | 1190 | |
b66a64f1 | 1191 | TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t; |
89b0433e NS |
1192 | } |
1193 | } | |
b66a64f1 NS |
1194 | else |
1195 | { | |
1196 | /* Use the cache of larger shared ints. */ | |
1197 | void **slot; | |
19114537 | 1198 | |
b66a64f1 NS |
1199 | TREE_INT_CST_LOW (int_cst_node) = low; |
1200 | TREE_INT_CST_HIGH (int_cst_node) = hi; | |
1201 | TREE_TYPE (int_cst_node) = type; | |
89b0433e | 1202 | |
b66a64f1 | 1203 | slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT); |
3d9a9f94 | 1204 | t = (tree) *slot; |
b66a64f1 NS |
1205 | if (!t) |
1206 | { | |
1207 | /* Insert this one into the hash table. */ | |
1208 | t = int_cst_node; | |
1209 | *slot = t; | |
1210 | /* Make a new node for next time round. */ | |
1211 | int_cst_node = make_node (INTEGER_CST); | |
1212 | } | |
1213 | } | |
19114537 | 1214 | |
c6a1db6c RS |
1215 | return t; |
1216 | } | |
1217 | ||
38b0dcb8 ZD |
1218 | /* Builds an integer constant in TYPE such that lowest BITS bits are ones |
1219 | and the rest are zeros. */ | |
1220 | ||
1221 | tree | |
1222 | build_low_bits_mask (tree type, unsigned bits) | |
1223 | { | |
1224 | unsigned HOST_WIDE_INT low; | |
1225 | HOST_WIDE_INT high; | |
1226 | unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0; | |
1227 | ||
1228 | gcc_assert (bits <= TYPE_PRECISION (type)); | |
1229 | ||
1230 | if (bits == TYPE_PRECISION (type) | |
1231 | && !TYPE_UNSIGNED (type)) | |
1232 | { | |
1233 | /* Sign extended all-ones mask. */ | |
1234 | low = all_ones; | |
1235 | high = -1; | |
1236 | } | |
1237 | else if (bits <= HOST_BITS_PER_WIDE_INT) | |
1238 | { | |
1239 | low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits); | |
1240 | high = 0; | |
1241 | } | |
1242 | else | |
1243 | { | |
1244 | bits -= HOST_BITS_PER_WIDE_INT; | |
1245 | low = all_ones; | |
1246 | high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits); | |
1247 | } | |
1248 | ||
1249 | return build_int_cst_wide (type, low, high); | |
1250 | } | |
1251 | ||
8b11a64c ZD |
1252 | /* Checks that X is integer constant that can be expressed in (unsigned) |
1253 | HOST_WIDE_INT without loss of precision. */ | |
1254 | ||
1255 | bool | |
9566a759 | 1256 | cst_and_fits_in_hwi (const_tree x) |
8b11a64c ZD |
1257 | { |
1258 | if (TREE_CODE (x) != INTEGER_CST) | |
1259 | return false; | |
1260 | ||
1261 | if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT) | |
1262 | return false; | |
1263 | ||
1264 | return (TREE_INT_CST_HIGH (x) == 0 | |
1265 | || TREE_INT_CST_HIGH (x) == -1); | |
1266 | } | |
1267 | ||
69ef87e2 | 1268 | /* Return a new VECTOR_CST node whose type is TYPE and whose values |
206048bd | 1269 | are in a list pointed to by VALS. */ |
69ef87e2 AH |
1270 | |
1271 | tree | |
46c5ad27 | 1272 | build_vector (tree type, tree vals) |
69ef87e2 AH |
1273 | { |
1274 | tree v = make_node (VECTOR_CST); | |
455f14dd | 1275 | int over = 0; |
69ef87e2 AH |
1276 | tree link; |
1277 | ||
1278 | TREE_VECTOR_CST_ELTS (v) = vals; | |
1279 | TREE_TYPE (v) = type; | |
1280 | ||
1281 | /* Iterate through elements and check for overflow. */ | |
1282 | for (link = vals; link; link = TREE_CHAIN (link)) | |
1283 | { | |
1284 | tree value = TREE_VALUE (link); | |
1285 | ||
84816907 JM |
1286 | /* Don't crash if we get an address constant. */ |
1287 | if (!CONSTANT_CLASS_P (value)) | |
1288 | continue; | |
1289 | ||
455f14dd | 1290 | over |= TREE_OVERFLOW (value); |
69ef87e2 | 1291 | } |
3b03c671 | 1292 | |
455f14dd | 1293 | TREE_OVERFLOW (v) = over; |
69ef87e2 AH |
1294 | return v; |
1295 | } | |
1296 | ||
4038c495 GB |
1297 | /* Return a new VECTOR_CST node whose type is TYPE and whose values |
1298 | are extracted from V, a vector of CONSTRUCTOR_ELT. */ | |
1299 | ||
1300 | tree | |
1301 | build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v) | |
1302 | { | |
1303 | tree list = NULL_TREE; | |
1304 | unsigned HOST_WIDE_INT idx; | |
1305 | tree value; | |
1306 | ||
1307 | FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value) | |
1308 | list = tree_cons (NULL_TREE, value, list); | |
1309 | return build_vector (type, nreverse (list)); | |
1310 | } | |
1311 | ||
dcf92453 | 1312 | /* Return a new CONSTRUCTOR node whose type is TYPE and whose values |
206048bd | 1313 | are in the VEC pointed to by VALS. */ |
dcf92453 | 1314 | tree |
4038c495 | 1315 | build_constructor (tree type, VEC(constructor_elt,gc) *vals) |
dcf92453 ZW |
1316 | { |
1317 | tree c = make_node (CONSTRUCTOR); | |
1318 | TREE_TYPE (c) = type; | |
1319 | CONSTRUCTOR_ELTS (c) = vals; | |
4038c495 GB |
1320 | return c; |
1321 | } | |
1322 | ||
1323 | /* Build a CONSTRUCTOR node made of a single initializer, with the specified | |
1324 | INDEX and VALUE. */ | |
1325 | tree | |
1326 | build_constructor_single (tree type, tree index, tree value) | |
1327 | { | |
1328 | VEC(constructor_elt,gc) *v; | |
1329 | constructor_elt *elt; | |
1000b34d | 1330 | tree t; |
4038c495 GB |
1331 | |
1332 | v = VEC_alloc (constructor_elt, gc, 1); | |
1333 | elt = VEC_quick_push (constructor_elt, v, NULL); | |
1334 | elt->index = index; | |
1335 | elt->value = value; | |
1336 | ||
1000b34d RS |
1337 | t = build_constructor (type, v); |
1338 | TREE_CONSTANT (t) = TREE_CONSTANT (value); | |
1339 | return t; | |
4038c495 GB |
1340 | } |
1341 | ||
1342 | ||
1343 | /* Return a new CONSTRUCTOR node whose type is TYPE and whose values | |
1344 | are in a list pointed to by VALS. */ | |
1345 | tree | |
1346 | build_constructor_from_list (tree type, tree vals) | |
1347 | { | |
1000b34d | 1348 | tree t, val; |
4038c495 | 1349 | VEC(constructor_elt,gc) *v = NULL; |
1000b34d | 1350 | bool constant_p = true; |
dcf92453 | 1351 | |
dcf92453 ZW |
1352 | if (vals) |
1353 | { | |
4038c495 GB |
1354 | v = VEC_alloc (constructor_elt, gc, list_length (vals)); |
1355 | for (t = vals; t; t = TREE_CHAIN (t)) | |
1356 | { | |
1357 | constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL); | |
1000b34d | 1358 | val = TREE_VALUE (t); |
4038c495 | 1359 | elt->index = TREE_PURPOSE (t); |
1000b34d RS |
1360 | elt->value = val; |
1361 | if (!TREE_CONSTANT (val)) | |
1362 | constant_p = false; | |
4038c495 | 1363 | } |
dcf92453 | 1364 | } |
dcf92453 | 1365 | |
1000b34d RS |
1366 | t = build_constructor (type, v); |
1367 | TREE_CONSTANT (t) = constant_p; | |
1368 | return t; | |
dcf92453 ZW |
1369 | } |
1370 | ||
325217ed CF |
1371 | /* Return a new FIXED_CST node whose type is TYPE and value is F. */ |
1372 | ||
1373 | tree | |
1374 | build_fixed (tree type, FIXED_VALUE_TYPE f) | |
1375 | { | |
1376 | tree v; | |
1377 | FIXED_VALUE_TYPE *fp; | |
1378 | ||
1379 | v = make_node (FIXED_CST); | |
3d9a9f94 | 1380 | fp = GGC_NEW (FIXED_VALUE_TYPE); |
325217ed CF |
1381 | memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE)); |
1382 | ||
1383 | TREE_TYPE (v) = type; | |
1384 | TREE_FIXED_CST_PTR (v) = fp; | |
1385 | return v; | |
1386 | } | |
4038c495 | 1387 | |
c6a1db6c RS |
1388 | /* Return a new REAL_CST node whose type is TYPE and value is D. */ |
1389 | ||
1390 | tree | |
46c5ad27 | 1391 | build_real (tree type, REAL_VALUE_TYPE d) |
c6a1db6c RS |
1392 | { |
1393 | tree v; | |
11ad4784 | 1394 | REAL_VALUE_TYPE *dp; |
0afbe93d | 1395 | int overflow = 0; |
c6a1db6c | 1396 | |
efdc7e19 RH |
1397 | /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE. |
1398 | Consider doing it via real_convert now. */ | |
c6a1db6c RS |
1399 | |
1400 | v = make_node (REAL_CST); | |
3d9a9f94 | 1401 | dp = GGC_NEW (REAL_VALUE_TYPE); |
11ad4784 | 1402 | memcpy (dp, &d, sizeof (REAL_VALUE_TYPE)); |
41077ce4 | 1403 | |
c6a1db6c | 1404 | TREE_TYPE (v) = type; |
11ad4784 | 1405 | TREE_REAL_CST_PTR (v) = dp; |
455f14dd | 1406 | TREE_OVERFLOW (v) = overflow; |
c6a1db6c RS |
1407 | return v; |
1408 | } | |
1409 | ||
1410 | /* Return a new REAL_CST node whose type is TYPE | |
1411 | and whose value is the integer value of the INTEGER_CST node I. */ | |
1412 | ||
c6a1db6c | 1413 | REAL_VALUE_TYPE |
9566a759 | 1414 | real_value_from_int_cst (const_tree type, const_tree i) |
c6a1db6c RS |
1415 | { |
1416 | REAL_VALUE_TYPE d; | |
2026444a | 1417 | |
e545d37f RK |
1418 | /* Clear all bits of the real value type so that we can later do |
1419 | bitwise comparisons to see if two values are the same. */ | |
703ad42b | 1420 | memset (&d, 0, sizeof d); |
e545d37f | 1421 | |
875eda9c RS |
1422 | real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode, |
1423 | TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i), | |
8df83eae | 1424 | TYPE_UNSIGNED (TREE_TYPE (i))); |
c6a1db6c RS |
1425 | return d; |
1426 | } | |
1427 | ||
d4b60170 | 1428 | /* Given a tree representing an integer constant I, return a tree |
15e5ad76 | 1429 | representing the same value as a floating-point constant of type TYPE. */ |
c6a1db6c RS |
1430 | |
1431 | tree | |
9566a759 | 1432 | build_real_from_int_cst (tree type, const_tree i) |
c6a1db6c RS |
1433 | { |
1434 | tree v; | |
53d74c3c | 1435 | int overflow = TREE_OVERFLOW (i); |
c6a1db6c | 1436 | |
11ad4784 | 1437 | v = build_real (type, real_value_from_int_cst (type, i)); |
c6a1db6c | 1438 | |
11ad4784 | 1439 | TREE_OVERFLOW (v) |= overflow; |
c6a1db6c RS |
1440 | return v; |
1441 | } | |
1442 | ||
c6a1db6c RS |
1443 | /* Return a newly constructed STRING_CST node whose value is |
1444 | the LEN characters at STR. | |
1445 | The TREE_TYPE is not initialized. */ | |
1446 | ||
1447 | tree | |
46c5ad27 | 1448 | build_string (int len, const char *str) |
c6a1db6c | 1449 | { |
a396f8ae GK |
1450 | tree s; |
1451 | size_t length; | |
28df01ac RG |
1452 | |
1453 | /* Do not waste bytes provided by padding of struct tree_string. */ | |
1454 | length = len + offsetof (struct tree_string, str) + 1; | |
a396f8ae GK |
1455 | |
1456 | #ifdef GATHER_STATISTICS | |
1457 | tree_node_counts[(int) c_kind]++; | |
1458 | tree_node_sizes[(int) c_kind] += length; | |
b8698a0f | 1459 | #endif |
a396f8ae GK |
1460 | |
1461 | s = ggc_alloc_tree (length); | |
d4b60170 | 1462 | |
a396f8ae GK |
1463 | memset (s, 0, sizeof (struct tree_common)); |
1464 | TREE_SET_CODE (s, STRING_CST); | |
1595ec20 | 1465 | TREE_CONSTANT (s) = 1; |
c6a1db6c | 1466 | TREE_STRING_LENGTH (s) = len; |
b1d5455a KG |
1467 | memcpy (s->string.str, str, len); |
1468 | s->string.str[len] = '\0'; | |
d4b60170 | 1469 | |
c6a1db6c RS |
1470 | return s; |
1471 | } | |
1472 | ||
1473 | /* Return a newly constructed COMPLEX_CST node whose value is | |
1474 | specified by the real and imaginary parts REAL and IMAG. | |
b217d7fe RK |
1475 | Both REAL and IMAG should be constant nodes. TYPE, if specified, |
1476 | will be the type of the COMPLEX_CST; otherwise a new type will be made. */ | |
c6a1db6c RS |
1477 | |
1478 | tree | |
46c5ad27 | 1479 | build_complex (tree type, tree real, tree imag) |
c6a1db6c | 1480 | { |
b3694847 | 1481 | tree t = make_node (COMPLEX_CST); |
53d74c3c | 1482 | |
c6a1db6c RS |
1483 | TREE_REALPART (t) = real; |
1484 | TREE_IMAGPART (t) = imag; | |
b217d7fe | 1485 | TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real)); |
53d74c3c | 1486 | TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag); |
c6a1db6c RS |
1487 | return t; |
1488 | } | |
1489 | ||
bfabddb6 | 1490 | /* Return a constant of arithmetic type TYPE which is the |
5f89204e | 1491 | multiplicative identity of the set TYPE. */ |
bfabddb6 RG |
1492 | |
1493 | tree | |
1494 | build_one_cst (tree type) | |
1495 | { | |
1496 | switch (TREE_CODE (type)) | |
1497 | { | |
1498 | case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE: | |
1499 | case POINTER_TYPE: case REFERENCE_TYPE: | |
1500 | case OFFSET_TYPE: | |
1501 | return build_int_cst (type, 1); | |
1502 | ||
1503 | case REAL_TYPE: | |
1504 | return build_real (type, dconst1); | |
1505 | ||
325217ed CF |
1506 | case FIXED_POINT_TYPE: |
1507 | /* We can only generate 1 for accum types. */ | |
1508 | gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type))); | |
1509 | return build_fixed (type, FCONST1(TYPE_MODE (type))); | |
1510 | ||
bfabddb6 RG |
1511 | case VECTOR_TYPE: |
1512 | { | |
1513 | tree scalar, cst; | |
1514 | int i; | |
1515 | ||
1516 | scalar = build_one_cst (TREE_TYPE (type)); | |
1517 | ||
1518 | /* Create 'vect_cst_ = {cst,cst,...,cst}' */ | |
1519 | cst = NULL_TREE; | |
1520 | for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; ) | |
1521 | cst = tree_cons (NULL_TREE, scalar, cst); | |
1522 | ||
1523 | return build_vector (type, cst); | |
1524 | } | |
1525 | ||
1526 | case COMPLEX_TYPE: | |
1527 | return build_complex (type, | |
1528 | build_one_cst (TREE_TYPE (type)), | |
1529 | fold_convert (TREE_TYPE (type), integer_zero_node)); | |
1530 | ||
1531 | default: | |
1532 | gcc_unreachable (); | |
1533 | } | |
1534 | } | |
1535 | ||
95b4aca6 NS |
1536 | /* Build a BINFO with LEN language slots. */ |
1537 | ||
1538 | tree | |
fa743e8c | 1539 | make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL) |
95b4aca6 NS |
1540 | { |
1541 | tree t; | |
fa743e8c NS |
1542 | size_t length = (offsetof (struct tree_binfo, base_binfos) |
1543 | + VEC_embedded_size (tree, base_binfos)); | |
9f63daea | 1544 | |
95b4aca6 NS |
1545 | #ifdef GATHER_STATISTICS |
1546 | tree_node_counts[(int) binfo_kind]++; | |
1547 | tree_node_sizes[(int) binfo_kind] += length; | |
1548 | #endif | |
1549 | ||
3d9a9f94 | 1550 | t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone); |
95b4aca6 | 1551 | |
fa743e8c | 1552 | memset (t, 0, offsetof (struct tree_binfo, base_binfos)); |
95b4aca6 NS |
1553 | |
1554 | TREE_SET_CODE (t, TREE_BINFO); | |
9f63daea | 1555 | |
fa743e8c | 1556 | VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos); |
95b4aca6 NS |
1557 | |
1558 | return t; | |
1559 | } | |
1560 | ||
1561 | ||
c6a1db6c | 1562 | /* Build a newly constructed TREE_VEC node of length LEN. */ |
0f41302f | 1563 | |
c6a1db6c | 1564 | tree |
b9dcdee4 | 1565 | make_tree_vec_stat (int len MEM_STAT_DECL) |
c6a1db6c | 1566 | { |
b3694847 | 1567 | tree t; |
3b03c671 | 1568 | int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec); |
c6a1db6c RS |
1569 | |
1570 | #ifdef GATHER_STATISTICS | |
3b03c671 KH |
1571 | tree_node_counts[(int) vec_kind]++; |
1572 | tree_node_sizes[(int) vec_kind] += length; | |
c6a1db6c RS |
1573 | #endif |
1574 | ||
3d9a9f94 | 1575 | t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone); |
508f8149 | 1576 | |
fad205ff | 1577 | memset (t, 0, length); |
b9dcdee4 | 1578 | |
c6a1db6c RS |
1579 | TREE_SET_CODE (t, TREE_VEC); |
1580 | TREE_VEC_LENGTH (t) = len; | |
c6a1db6c RS |
1581 | |
1582 | return t; | |
1583 | } | |
1584 | \f | |
9ad265b0 RK |
1585 | /* Return 1 if EXPR is the integer constant zero or a complex constant |
1586 | of zero. */ | |
c6a1db6c RS |
1587 | |
1588 | int | |
9566a759 | 1589 | integer_zerop (const_tree expr) |
c6a1db6c | 1590 | { |
d964285c | 1591 | STRIP_NOPS (expr); |
c6a1db6c | 1592 | |
9ad265b0 RK |
1593 | return ((TREE_CODE (expr) == INTEGER_CST |
1594 | && TREE_INT_CST_LOW (expr) == 0 | |
1595 | && TREE_INT_CST_HIGH (expr) == 0) | |
1596 | || (TREE_CODE (expr) == COMPLEX_CST | |
1597 | && integer_zerop (TREE_REALPART (expr)) | |
1598 | && integer_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1599 | } |
1600 | ||
9ad265b0 RK |
1601 | /* Return 1 if EXPR is the integer constant one or the corresponding |
1602 | complex constant. */ | |
c6a1db6c RS |
1603 | |
1604 | int | |
9566a759 | 1605 | integer_onep (const_tree expr) |
c6a1db6c | 1606 | { |
d964285c | 1607 | STRIP_NOPS (expr); |
c6a1db6c | 1608 | |
9ad265b0 RK |
1609 | return ((TREE_CODE (expr) == INTEGER_CST |
1610 | && TREE_INT_CST_LOW (expr) == 1 | |
1611 | && TREE_INT_CST_HIGH (expr) == 0) | |
1612 | || (TREE_CODE (expr) == COMPLEX_CST | |
1613 | && integer_onep (TREE_REALPART (expr)) | |
1614 | && integer_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1615 | } |
1616 | ||
9ad265b0 RK |
1617 | /* Return 1 if EXPR is an integer containing all 1's in as much precision as |
1618 | it contains. Likewise for the corresponding complex constant. */ | |
c6a1db6c RS |
1619 | |
1620 | int | |
9566a759 | 1621 | integer_all_onesp (const_tree expr) |
c6a1db6c | 1622 | { |
b3694847 SS |
1623 | int prec; |
1624 | int uns; | |
c6a1db6c | 1625 | |
d964285c | 1626 | STRIP_NOPS (expr); |
c6a1db6c | 1627 | |
9ad265b0 RK |
1628 | if (TREE_CODE (expr) == COMPLEX_CST |
1629 | && integer_all_onesp (TREE_REALPART (expr)) | |
1630 | && integer_zerop (TREE_IMAGPART (expr))) | |
1631 | return 1; | |
1632 | ||
7fe25d1a | 1633 | else if (TREE_CODE (expr) != INTEGER_CST) |
c6a1db6c RS |
1634 | return 0; |
1635 | ||
8df83eae | 1636 | uns = TYPE_UNSIGNED (TREE_TYPE (expr)); |
d7d93837 AH |
1637 | if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0 |
1638 | && TREE_INT_CST_HIGH (expr) == -1) | |
1639 | return 1; | |
c6a1db6c | 1640 | if (!uns) |
d7d93837 | 1641 | return 0; |
c6a1db6c | 1642 | |
8980b5a3 RK |
1643 | /* Note that using TYPE_PRECISION here is wrong. We care about the |
1644 | actual bits, not the (arbitrary) range of the type. */ | |
1645 | prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr))); | |
37366632 | 1646 | if (prec >= HOST_BITS_PER_WIDE_INT) |
c6a1db6c | 1647 | { |
05bccae2 RK |
1648 | HOST_WIDE_INT high_value; |
1649 | int shift_amount; | |
c6a1db6c | 1650 | |
37366632 | 1651 | shift_amount = prec - HOST_BITS_PER_WIDE_INT; |
c6a1db6c | 1652 | |
1e128c5f GB |
1653 | /* Can not handle precisions greater than twice the host int size. */ |
1654 | gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT); | |
1655 | if (shift_amount == HOST_BITS_PER_WIDE_INT) | |
c6a1db6c RS |
1656 | /* Shifting by the host word size is undefined according to the ANSI |
1657 | standard, so we must handle this as a special case. */ | |
1658 | high_value = -1; | |
1659 | else | |
37366632 | 1660 | high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1; |
c6a1db6c | 1661 | |
dc478a5d | 1662 | return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0 |
05bccae2 | 1663 | && TREE_INT_CST_HIGH (expr) == high_value); |
c6a1db6c RS |
1664 | } |
1665 | else | |
05bccae2 | 1666 | return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1; |
c6a1db6c RS |
1667 | } |
1668 | ||
1669 | /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only | |
1670 | one bit on). */ | |
1671 | ||
1672 | int | |
9566a759 | 1673 | integer_pow2p (const_tree expr) |
c6a1db6c | 1674 | { |
5cb1f2fa | 1675 | int prec; |
37366632 | 1676 | HOST_WIDE_INT high, low; |
c6a1db6c | 1677 | |
d964285c | 1678 | STRIP_NOPS (expr); |
c6a1db6c | 1679 | |
9ad265b0 RK |
1680 | if (TREE_CODE (expr) == COMPLEX_CST |
1681 | && integer_pow2p (TREE_REALPART (expr)) | |
1682 | && integer_zerop (TREE_IMAGPART (expr))) | |
1683 | return 1; | |
1684 | ||
7fe25d1a | 1685 | if (TREE_CODE (expr) != INTEGER_CST) |
c6a1db6c RS |
1686 | return 0; |
1687 | ||
d4ebfa65 | 1688 | prec = int_or_pointer_precision (TREE_TYPE (expr)); |
c6a1db6c RS |
1689 | high = TREE_INT_CST_HIGH (expr); |
1690 | low = TREE_INT_CST_LOW (expr); | |
1691 | ||
5cb1f2fa RK |
1692 | /* First clear all bits that are beyond the type's precision in case |
1693 | we've been sign extended. */ | |
1694 | ||
1695 | if (prec == 2 * HOST_BITS_PER_WIDE_INT) | |
1696 | ; | |
1697 | else if (prec > HOST_BITS_PER_WIDE_INT) | |
1698 | high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT)); | |
1699 | else | |
1700 | { | |
1701 | high = 0; | |
1702 | if (prec < HOST_BITS_PER_WIDE_INT) | |
1703 | low &= ~((HOST_WIDE_INT) (-1) << prec); | |
1704 | } | |
1705 | ||
c6a1db6c RS |
1706 | if (high == 0 && low == 0) |
1707 | return 0; | |
1708 | ||
1709 | return ((high == 0 && (low & (low - 1)) == 0) | |
1710 | || (low == 0 && (high & (high - 1)) == 0)); | |
1711 | } | |
1712 | ||
4977bab6 ZW |
1713 | /* Return 1 if EXPR is an integer constant other than zero or a |
1714 | complex constant other than zero. */ | |
1715 | ||
1716 | int | |
9566a759 | 1717 | integer_nonzerop (const_tree expr) |
4977bab6 ZW |
1718 | { |
1719 | STRIP_NOPS (expr); | |
1720 | ||
1721 | return ((TREE_CODE (expr) == INTEGER_CST | |
4977bab6 ZW |
1722 | && (TREE_INT_CST_LOW (expr) != 0 |
1723 | || TREE_INT_CST_HIGH (expr) != 0)) | |
1724 | || (TREE_CODE (expr) == COMPLEX_CST | |
1725 | && (integer_nonzerop (TREE_REALPART (expr)) | |
1726 | || integer_nonzerop (TREE_IMAGPART (expr))))); | |
1727 | } | |
1728 | ||
325217ed CF |
1729 | /* Return 1 if EXPR is the fixed-point constant zero. */ |
1730 | ||
1731 | int | |
3eb0da77 | 1732 | fixed_zerop (const_tree expr) |
325217ed CF |
1733 | { |
1734 | return (TREE_CODE (expr) == FIXED_CST | |
1735 | && double_int_zero_p (TREE_FIXED_CST (expr).data)); | |
1736 | } | |
1737 | ||
5cb1f2fa RK |
1738 | /* Return the power of two represented by a tree node known to be a |
1739 | power of two. */ | |
1740 | ||
1741 | int | |
9566a759 | 1742 | tree_log2 (const_tree expr) |
5cb1f2fa RK |
1743 | { |
1744 | int prec; | |
1745 | HOST_WIDE_INT high, low; | |
1746 | ||
1747 | STRIP_NOPS (expr); | |
1748 | ||
1749 | if (TREE_CODE (expr) == COMPLEX_CST) | |
1750 | return tree_log2 (TREE_REALPART (expr)); | |
1751 | ||
d4ebfa65 | 1752 | prec = int_or_pointer_precision (TREE_TYPE (expr)); |
5cb1f2fa RK |
1753 | high = TREE_INT_CST_HIGH (expr); |
1754 | low = TREE_INT_CST_LOW (expr); | |
1755 | ||
1756 | /* First clear all bits that are beyond the type's precision in case | |
1757 | we've been sign extended. */ | |
1758 | ||
1759 | if (prec == 2 * HOST_BITS_PER_WIDE_INT) | |
1760 | ; | |
1761 | else if (prec > HOST_BITS_PER_WIDE_INT) | |
1762 | high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT)); | |
1763 | else | |
1764 | { | |
1765 | high = 0; | |
1766 | if (prec < HOST_BITS_PER_WIDE_INT) | |
1767 | low &= ~((HOST_WIDE_INT) (-1) << prec); | |
1768 | } | |
1769 | ||
1770 | return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high) | |
dc478a5d | 1771 | : exact_log2 (low)); |
5cb1f2fa RK |
1772 | } |
1773 | ||
05bccae2 RK |
1774 | /* Similar, but return the largest integer Y such that 2 ** Y is less |
1775 | than or equal to EXPR. */ | |
1776 | ||
1777 | int | |
9566a759 | 1778 | tree_floor_log2 (const_tree expr) |
05bccae2 RK |
1779 | { |
1780 | int prec; | |
1781 | HOST_WIDE_INT high, low; | |
1782 | ||
1783 | STRIP_NOPS (expr); | |
1784 | ||
1785 | if (TREE_CODE (expr) == COMPLEX_CST) | |
1786 | return tree_log2 (TREE_REALPART (expr)); | |
1787 | ||
d4ebfa65 | 1788 | prec = int_or_pointer_precision (TREE_TYPE (expr)); |
05bccae2 RK |
1789 | high = TREE_INT_CST_HIGH (expr); |
1790 | low = TREE_INT_CST_LOW (expr); | |
1791 | ||
1792 | /* First clear all bits that are beyond the type's precision in case | |
1793 | we've been sign extended. Ignore if type's precision hasn't been set | |
1794 | since what we are doing is setting it. */ | |
1795 | ||
1796 | if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0) | |
1797 | ; | |
1798 | else if (prec > HOST_BITS_PER_WIDE_INT) | |
1799 | high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT)); | |
1800 | else | |
1801 | { | |
1802 | high = 0; | |
1803 | if (prec < HOST_BITS_PER_WIDE_INT) | |
1804 | low &= ~((HOST_WIDE_INT) (-1) << prec); | |
1805 | } | |
1806 | ||
1807 | return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high) | |
1808 | : floor_log2 (low)); | |
1809 | } | |
1810 | ||
4b6e55df JJ |
1811 | /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for |
1812 | decimal float constants, so don't return 1 for them. */ | |
c6a1db6c RS |
1813 | |
1814 | int | |
9566a759 | 1815 | real_zerop (const_tree expr) |
c6a1db6c | 1816 | { |
d964285c | 1817 | STRIP_NOPS (expr); |
c6a1db6c | 1818 | |
9ad265b0 | 1819 | return ((TREE_CODE (expr) == REAL_CST |
4b6e55df JJ |
1820 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0) |
1821 | && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))))) | |
9ad265b0 RK |
1822 | || (TREE_CODE (expr) == COMPLEX_CST |
1823 | && real_zerop (TREE_REALPART (expr)) | |
1824 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1825 | } |
1826 | ||
4b6e55df JJ |
1827 | /* Return 1 if EXPR is the real constant one in real or complex form. |
1828 | Trailing zeroes matter for decimal float constants, so don't return | |
1829 | 1 for them. */ | |
c6a1db6c RS |
1830 | |
1831 | int | |
9566a759 | 1832 | real_onep (const_tree expr) |
c6a1db6c | 1833 | { |
d964285c | 1834 | STRIP_NOPS (expr); |
c6a1db6c | 1835 | |
9ad265b0 | 1836 | return ((TREE_CODE (expr) == REAL_CST |
4b6e55df JJ |
1837 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1) |
1838 | && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))))) | |
9ad265b0 RK |
1839 | || (TREE_CODE (expr) == COMPLEX_CST |
1840 | && real_onep (TREE_REALPART (expr)) | |
1841 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1842 | } |
1843 | ||
4b6e55df JJ |
1844 | /* Return 1 if EXPR is the real constant two. Trailing zeroes matter |
1845 | for decimal float constants, so don't return 1 for them. */ | |
c6a1db6c RS |
1846 | |
1847 | int | |
9566a759 | 1848 | real_twop (const_tree expr) |
c6a1db6c | 1849 | { |
d964285c | 1850 | STRIP_NOPS (expr); |
c6a1db6c | 1851 | |
9ad265b0 | 1852 | return ((TREE_CODE (expr) == REAL_CST |
4b6e55df JJ |
1853 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2) |
1854 | && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))))) | |
9ad265b0 RK |
1855 | || (TREE_CODE (expr) == COMPLEX_CST |
1856 | && real_twop (TREE_REALPART (expr)) | |
1857 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1858 | } |
1859 | ||
4b6e55df JJ |
1860 | /* Return 1 if EXPR is the real constant minus one. Trailing zeroes |
1861 | matter for decimal float constants, so don't return 1 for them. */ | |
378393da RS |
1862 | |
1863 | int | |
9566a759 | 1864 | real_minus_onep (const_tree expr) |
378393da RS |
1865 | { |
1866 | STRIP_NOPS (expr); | |
1867 | ||
1868 | return ((TREE_CODE (expr) == REAL_CST | |
4b6e55df JJ |
1869 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1) |
1870 | && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))))) | |
378393da RS |
1871 | || (TREE_CODE (expr) == COMPLEX_CST |
1872 | && real_minus_onep (TREE_REALPART (expr)) | |
1873 | && real_zerop (TREE_IMAGPART (expr)))); | |
1874 | } | |
1875 | ||
c6a1db6c | 1876 | /* Nonzero if EXP is a constant or a cast of a constant. */ |
dc478a5d | 1877 | |
c6a1db6c | 1878 | int |
9566a759 | 1879 | really_constant_p (const_tree exp) |
c6a1db6c | 1880 | { |
d964285c | 1881 | /* This is not quite the same as STRIP_NOPS. It does more. */ |
1043771b | 1882 | while (CONVERT_EXPR_P (exp) |
c6a1db6c RS |
1883 | || TREE_CODE (exp) == NON_LVALUE_EXPR) |
1884 | exp = TREE_OPERAND (exp, 0); | |
1885 | return TREE_CONSTANT (exp); | |
1886 | } | |
1887 | \f | |
1888 | /* Return first list element whose TREE_VALUE is ELEM. | |
2a3c15b5 | 1889 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1890 | |
1891 | tree | |
46c5ad27 | 1892 | value_member (tree elem, tree list) |
c6a1db6c RS |
1893 | { |
1894 | while (list) | |
1895 | { | |
1896 | if (elem == TREE_VALUE (list)) | |
1897 | return list; | |
1898 | list = TREE_CHAIN (list); | |
1899 | } | |
1900 | return NULL_TREE; | |
1901 | } | |
1902 | ||
1903 | /* Return first list element whose TREE_PURPOSE is ELEM. | |
2a3c15b5 | 1904 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1905 | |
1906 | tree | |
9566a759 | 1907 | purpose_member (const_tree elem, tree list) |
c6a1db6c RS |
1908 | { |
1909 | while (list) | |
1910 | { | |
1911 | if (elem == TREE_PURPOSE (list)) | |
1912 | return list; | |
1913 | list = TREE_CHAIN (list); | |
c6a1db6c RS |
1914 | } |
1915 | return NULL_TREE; | |
1916 | } | |
1917 | ||
ad42ff1e JM |
1918 | /* Returns element number IDX (zero-origin) of chain CHAIN, or |
1919 | NULL_TREE. */ | |
1920 | ||
1921 | tree | |
1922 | chain_index (int idx, tree chain) | |
1923 | { | |
1924 | for (; chain && idx > 0; --idx) | |
1925 | chain = TREE_CHAIN (chain); | |
1926 | return chain; | |
1927 | } | |
1928 | ||
0f41302f | 1929 | /* Return nonzero if ELEM is part of the chain CHAIN. */ |
c6a1db6c RS |
1930 | |
1931 | int | |
9566a759 | 1932 | chain_member (const_tree elem, const_tree chain) |
c6a1db6c RS |
1933 | { |
1934 | while (chain) | |
1935 | { | |
1936 | if (elem == chain) | |
1937 | return 1; | |
1938 | chain = TREE_CHAIN (chain); | |
1939 | } | |
1940 | ||
1941 | return 0; | |
1942 | } | |
1943 | ||
1944 | /* Return the length of a chain of nodes chained through TREE_CHAIN. | |
1945 | We expect a null pointer to mark the end of the chain. | |
1946 | This is the Lisp primitive `length'. */ | |
1947 | ||
1948 | int | |
9566a759 | 1949 | list_length (const_tree t) |
c6a1db6c | 1950 | { |
9566a759 | 1951 | const_tree p = t; |
f75fbaf7 | 1952 | #ifdef ENABLE_TREE_CHECKING |
9566a759 | 1953 | const_tree q = t; |
f75fbaf7 | 1954 | #endif |
b3694847 | 1955 | int len = 0; |
c6a1db6c | 1956 | |
f75fbaf7 ZW |
1957 | while (p) |
1958 | { | |
1959 | p = TREE_CHAIN (p); | |
1960 | #ifdef ENABLE_TREE_CHECKING | |
1961 | if (len % 2) | |
1962 | q = TREE_CHAIN (q); | |
1e128c5f | 1963 | gcc_assert (p != q); |
f75fbaf7 ZW |
1964 | #endif |
1965 | len++; | |
1966 | } | |
c6a1db6c RS |
1967 | |
1968 | return len; | |
1969 | } | |
1970 | ||
c3b247b4 JM |
1971 | /* Returns the number of FIELD_DECLs in TYPE. */ |
1972 | ||
1973 | int | |
9566a759 | 1974 | fields_length (const_tree type) |
c3b247b4 JM |
1975 | { |
1976 | tree t = TYPE_FIELDS (type); | |
1977 | int count = 0; | |
1978 | ||
1979 | for (; t; t = TREE_CHAIN (t)) | |
1980 | if (TREE_CODE (t) == FIELD_DECL) | |
1981 | ++count; | |
1982 | ||
1983 | return count; | |
1984 | } | |
1985 | ||
c6a1db6c RS |
1986 | /* Concatenate two chains of nodes (chained through TREE_CHAIN) |
1987 | by modifying the last node in chain 1 to point to chain 2. | |
1988 | This is the Lisp primitive `nconc'. */ | |
1989 | ||
1990 | tree | |
46c5ad27 | 1991 | chainon (tree op1, tree op2) |
c6a1db6c | 1992 | { |
66ea6f4c | 1993 | tree t1; |
c6a1db6c | 1994 | |
66ea6f4c RH |
1995 | if (!op1) |
1996 | return op2; | |
1997 | if (!op2) | |
1998 | return op1; | |
1999 | ||
2000 | for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1)) | |
2001 | continue; | |
2002 | TREE_CHAIN (t1) = op2; | |
1810c3fa | 2003 | |
f4524c9e | 2004 | #ifdef ENABLE_TREE_CHECKING |
66ea6f4c RH |
2005 | { |
2006 | tree t2; | |
2007 | for (t2 = op2; t2; t2 = TREE_CHAIN (t2)) | |
1e128c5f | 2008 | gcc_assert (t2 != t1); |
66ea6f4c | 2009 | } |
0f4668ef | 2010 | #endif |
66ea6f4c RH |
2011 | |
2012 | return op1; | |
c6a1db6c RS |
2013 | } |
2014 | ||
2015 | /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */ | |
2016 | ||
2017 | tree | |
46c5ad27 | 2018 | tree_last (tree chain) |
c6a1db6c | 2019 | { |
b3694847 | 2020 | tree next; |
c6a1db6c | 2021 | if (chain) |
5e9defae | 2022 | while ((next = TREE_CHAIN (chain))) |
c6a1db6c RS |
2023 | chain = next; |
2024 | return chain; | |
2025 | } | |
2026 | ||
2027 | /* Reverse the order of elements in the chain T, | |
2028 | and return the new head of the chain (old last element). */ | |
2029 | ||
2030 | tree | |
46c5ad27 | 2031 | nreverse (tree t) |
c6a1db6c | 2032 | { |
b3694847 | 2033 | tree prev = 0, decl, next; |
c6a1db6c RS |
2034 | for (decl = t; decl; decl = next) |
2035 | { | |
2036 | next = TREE_CHAIN (decl); | |
2037 | TREE_CHAIN (decl) = prev; | |
2038 | prev = decl; | |
2039 | } | |
2040 | return prev; | |
2041 | } | |
c6a1db6c RS |
2042 | \f |
2043 | /* Return a newly created TREE_LIST node whose | |
2044 | purpose and value fields are PARM and VALUE. */ | |
2045 | ||
2046 | tree | |
b9dcdee4 | 2047 | build_tree_list_stat (tree parm, tree value MEM_STAT_DECL) |
c6a1db6c | 2048 | { |
b9dcdee4 | 2049 | tree t = make_node_stat (TREE_LIST PASS_MEM_STAT); |
c6a1db6c RS |
2050 | TREE_PURPOSE (t) = parm; |
2051 | TREE_VALUE (t) = value; | |
2052 | return t; | |
2053 | } | |
2054 | ||
c166b898 ILT |
2055 | /* Build a chain of TREE_LIST nodes from a vector. */ |
2056 | ||
2057 | tree | |
2058 | build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL) | |
2059 | { | |
2060 | tree ret = NULL_TREE; | |
2061 | tree *pp = &ret; | |
2062 | unsigned int i; | |
2063 | tree t; | |
2064 | for (i = 0; VEC_iterate (tree, vec, i, t); ++i) | |
2065 | { | |
2066 | *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT); | |
2067 | pp = &TREE_CHAIN (*pp); | |
2068 | } | |
2069 | return ret; | |
2070 | } | |
2071 | ||
c6a1db6c | 2072 | /* Return a newly created TREE_LIST node whose |
411e2759 | 2073 | purpose and value fields are PURPOSE and VALUE |
c6a1db6c RS |
2074 | and whose TREE_CHAIN is CHAIN. */ |
2075 | ||
2076 | tree | |
b9dcdee4 | 2077 | tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL) |
c6a1db6c | 2078 | { |
b3694847 | 2079 | tree node; |
a3770a81 | 2080 | |
3d9a9f94 | 2081 | node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone); |
f8a83ee3 ZW |
2082 | |
2083 | memset (node, 0, sizeof (struct tree_common)); | |
a3770a81 | 2084 | |
c6a1db6c | 2085 | #ifdef GATHER_STATISTICS |
ad41cc2a RK |
2086 | tree_node_counts[(int) x_kind]++; |
2087 | tree_node_sizes[(int) x_kind] += sizeof (struct tree_list); | |
c6a1db6c RS |
2088 | #endif |
2089 | ||
c6a1db6c | 2090 | TREE_SET_CODE (node, TREE_LIST); |
c6a1db6c RS |
2091 | TREE_CHAIN (node) = chain; |
2092 | TREE_PURPOSE (node) = purpose; | |
2093 | TREE_VALUE (node) = value; | |
2094 | return node; | |
2095 | } | |
2096 | ||
09357846 JM |
2097 | /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */ |
2098 | ||
2099 | tree | |
2100 | ctor_to_list (tree ctor) | |
2101 | { | |
2102 | tree list = NULL_TREE; | |
2103 | tree *p = &list; | |
2104 | unsigned ix; | |
6010fae7 | 2105 | tree purpose, val; |
09357846 | 2106 | |
6010fae7 | 2107 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val) |
09357846 | 2108 | { |
6010fae7 | 2109 | *p = build_tree_list (purpose, val); |
09357846 JM |
2110 | p = &TREE_CHAIN (*p); |
2111 | } | |
2112 | ||
2113 | return list; | |
2114 | } | |
c166b898 ILT |
2115 | |
2116 | /* Return the values of the elements of a CONSTRUCTOR as a vector of | |
2117 | trees. */ | |
2118 | ||
2119 | VEC(tree,gc) * | |
2120 | ctor_to_vec (tree ctor) | |
2121 | { | |
2122 | VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor)); | |
2123 | unsigned int ix; | |
2124 | tree val; | |
2125 | ||
2126 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val) | |
2127 | VEC_quick_push (tree, vec, val); | |
2128 | ||
2129 | return vec; | |
2130 | } | |
c6a1db6c RS |
2131 | \f |
2132 | /* Return the size nominally occupied by an object of type TYPE | |
2133 | when it resides in memory. The value is measured in units of bytes, | |
2134 | and its data type is that normally used for type sizes | |
2135 | (which is the first type created by make_signed_type or | |
2136 | make_unsigned_type). */ | |
2137 | ||
2138 | tree | |
ac7d7749 | 2139 | size_in_bytes (const_tree type) |
c6a1db6c | 2140 | { |
cdc5a032 RS |
2141 | tree t; |
2142 | ||
c6a1db6c RS |
2143 | if (type == error_mark_node) |
2144 | return integer_zero_node; | |
ead17059 | 2145 | |
c6a1db6c | 2146 | type = TYPE_MAIN_VARIANT (type); |
ead17059 | 2147 | t = TYPE_SIZE_UNIT (type); |
d4b60170 | 2148 | |
ead17059 | 2149 | if (t == 0) |
c6a1db6c | 2150 | { |
ae2bcd98 | 2151 | lang_hooks.types.incomplete_type_error (NULL_TREE, type); |
dc397323 | 2152 | return size_zero_node; |
c6a1db6c | 2153 | } |
d4b60170 | 2154 | |
cdc5a032 | 2155 | return t; |
c6a1db6c RS |
2156 | } |
2157 | ||
e5e809f4 JL |
2158 | /* Return the size of TYPE (in bytes) as a wide integer |
2159 | or return -1 if the size can vary or is larger than an integer. */ | |
c6a1db6c | 2160 | |
e5e809f4 | 2161 | HOST_WIDE_INT |
9566a759 | 2162 | int_size_in_bytes (const_tree type) |
c6a1db6c | 2163 | { |
e5e809f4 JL |
2164 | tree t; |
2165 | ||
c6a1db6c RS |
2166 | if (type == error_mark_node) |
2167 | return 0; | |
e5e809f4 | 2168 | |
c6a1db6c | 2169 | type = TYPE_MAIN_VARIANT (type); |
ead17059 RH |
2170 | t = TYPE_SIZE_UNIT (type); |
2171 | if (t == 0 | |
2172 | || TREE_CODE (t) != INTEGER_CST | |
665f2503 RK |
2173 | || TREE_INT_CST_HIGH (t) != 0 |
2174 | /* If the result would appear negative, it's too big to represent. */ | |
2175 | || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0) | |
c6a1db6c | 2176 | return -1; |
e5e809f4 JL |
2177 | |
2178 | return TREE_INT_CST_LOW (t); | |
c6a1db6c | 2179 | } |
a441447f OH |
2180 | |
2181 | /* Return the maximum size of TYPE (in bytes) as a wide integer | |
2182 | or return -1 if the size can vary or is larger than an integer. */ | |
2183 | ||
2184 | HOST_WIDE_INT | |
ac7d7749 | 2185 | max_int_size_in_bytes (const_tree type) |
a441447f OH |
2186 | { |
2187 | HOST_WIDE_INT size = -1; | |
2188 | tree size_tree; | |
2189 | ||
2190 | /* If this is an array type, check for a possible MAX_SIZE attached. */ | |
2191 | ||
2192 | if (TREE_CODE (type) == ARRAY_TYPE) | |
2193 | { | |
2194 | size_tree = TYPE_ARRAY_MAX_SIZE (type); | |
2195 | ||
2196 | if (size_tree && host_integerp (size_tree, 1)) | |
2197 | size = tree_low_cst (size_tree, 1); | |
2198 | } | |
2199 | ||
2200 | /* If we still haven't been able to get a size, see if the language | |
2201 | can compute a maximum size. */ | |
2202 | ||
2203 | if (size == -1) | |
2204 | { | |
2205 | size_tree = lang_hooks.types.max_size (type); | |
2206 | ||
2207 | if (size_tree && host_integerp (size_tree, 1)) | |
2208 | size = tree_low_cst (size_tree, 1); | |
2209 | } | |
2210 | ||
2211 | return size; | |
2212 | } | |
71c00b5c RG |
2213 | |
2214 | /* Returns a tree for the size of EXP in bytes. */ | |
2215 | ||
2216 | tree | |
2217 | tree_expr_size (const_tree exp) | |
2218 | { | |
2219 | if (DECL_P (exp) | |
2220 | && DECL_SIZE_UNIT (exp) != 0) | |
2221 | return DECL_SIZE_UNIT (exp); | |
2222 | else | |
2223 | return size_in_bytes (TREE_TYPE (exp)); | |
2224 | } | |
665f2503 RK |
2225 | \f |
2226 | /* Return the bit position of FIELD, in bits from the start of the record. | |
2227 | This is a tree of type bitsizetype. */ | |
2228 | ||
2229 | tree | |
9566a759 | 2230 | bit_position (const_tree field) |
665f2503 | 2231 | { |
f2704b9f RK |
2232 | return bit_from_pos (DECL_FIELD_OFFSET (field), |
2233 | DECL_FIELD_BIT_OFFSET (field)); | |
665f2503 | 2234 | } |
729a2125 | 2235 | |
0e61db61 NS |
2236 | /* Likewise, but return as an integer. It must be representable in |
2237 | that way (since it could be a signed value, we don't have the | |
2238 | option of returning -1 like int_size_in_byte can. */ | |
665f2503 RK |
2239 | |
2240 | HOST_WIDE_INT | |
9566a759 | 2241 | int_bit_position (const_tree field) |
665f2503 RK |
2242 | { |
2243 | return tree_low_cst (bit_position (field), 0); | |
2244 | } | |
2245 | \f | |
770ae6cc RK |
2246 | /* Return the byte position of FIELD, in bytes from the start of the record. |
2247 | This is a tree of type sizetype. */ | |
2248 | ||
2249 | tree | |
9566a759 | 2250 | byte_position (const_tree field) |
770ae6cc | 2251 | { |
f2704b9f RK |
2252 | return byte_from_pos (DECL_FIELD_OFFSET (field), |
2253 | DECL_FIELD_BIT_OFFSET (field)); | |
770ae6cc RK |
2254 | } |
2255 | ||
0e61db61 NS |
2256 | /* Likewise, but return as an integer. It must be representable in |
2257 | that way (since it could be a signed value, we don't have the | |
2258 | option of returning -1 like int_size_in_byte can. */ | |
770ae6cc RK |
2259 | |
2260 | HOST_WIDE_INT | |
9566a759 | 2261 | int_byte_position (const_tree field) |
770ae6cc RK |
2262 | { |
2263 | return tree_low_cst (byte_position (field), 0); | |
2264 | } | |
2265 | \f | |
665f2503 | 2266 | /* Return the strictest alignment, in bits, that T is known to have. */ |
729a2125 RK |
2267 | |
2268 | unsigned int | |
9566a759 | 2269 | expr_align (const_tree t) |
729a2125 RK |
2270 | { |
2271 | unsigned int align0, align1; | |
2272 | ||
2273 | switch (TREE_CODE (t)) | |
2274 | { | |
1043771b | 2275 | CASE_CONVERT: case NON_LVALUE_EXPR: |
729a2125 RK |
2276 | /* If we have conversions, we know that the alignment of the |
2277 | object must meet each of the alignments of the types. */ | |
2278 | align0 = expr_align (TREE_OPERAND (t, 0)); | |
2279 | align1 = TYPE_ALIGN (TREE_TYPE (t)); | |
2280 | return MAX (align0, align1); | |
2281 | ||
939409af | 2282 | case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR: |
729a2125 | 2283 | case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR: |
9f63daea | 2284 | case CLEANUP_POINT_EXPR: |
729a2125 RK |
2285 | /* These don't change the alignment of an object. */ |
2286 | return expr_align (TREE_OPERAND (t, 0)); | |
2287 | ||
2288 | case COND_EXPR: | |
2289 | /* The best we can do is say that the alignment is the least aligned | |
2290 | of the two arms. */ | |
2291 | align0 = expr_align (TREE_OPERAND (t, 1)); | |
2292 | align1 = expr_align (TREE_OPERAND (t, 2)); | |
2293 | return MIN (align0, align1); | |
2294 | ||
d872ada0 GK |
2295 | /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set |
2296 | meaningfully, it's always 1. */ | |
06ceef4e | 2297 | case LABEL_DECL: case CONST_DECL: |
729a2125 | 2298 | case VAR_DECL: case PARM_DECL: case RESULT_DECL: |
06ceef4e | 2299 | case FUNCTION_DECL: |
d872ada0 GK |
2300 | gcc_assert (DECL_ALIGN (t) != 0); |
2301 | return DECL_ALIGN (t); | |
06ceef4e | 2302 | |
729a2125 RK |
2303 | default: |
2304 | break; | |
2305 | } | |
2306 | ||
2307 | /* Otherwise take the alignment from that of the type. */ | |
2308 | return TYPE_ALIGN (TREE_TYPE (t)); | |
2309 | } | |
c0560b8b RK |
2310 | \f |
2311 | /* Return, as a tree node, the number of elements for TYPE (which is an | |
d26f8097 | 2312 | ARRAY_TYPE) minus one. This counts only elements of the top array. */ |
c6a1db6c RS |
2313 | |
2314 | tree | |
9566a759 | 2315 | array_type_nelts (const_tree type) |
c6a1db6c | 2316 | { |
7671d67b BK |
2317 | tree index_type, min, max; |
2318 | ||
2319 | /* If they did it with unspecified bounds, then we should have already | |
2320 | given an error about it before we got here. */ | |
2321 | if (! TYPE_DOMAIN (type)) | |
2322 | return error_mark_node; | |
2323 | ||
2324 | index_type = TYPE_DOMAIN (type); | |
2325 | min = TYPE_MIN_VALUE (index_type); | |
2326 | max = TYPE_MAX_VALUE (index_type); | |
83b853c9 | 2327 | |
83b853c9 JM |
2328 | return (integer_zerop (min) |
2329 | ? max | |
987b67bc | 2330 | : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min)); |
c6a1db6c RS |
2331 | } |
2332 | \f | |
dc700f49 RH |
2333 | /* If arg is static -- a reference to an object in static storage -- then |
2334 | return the object. This is not the same as the C meaning of `static'. | |
2335 | If arg isn't static, return NULL. */ | |
c6a1db6c | 2336 | |
525c6bf5 | 2337 | tree |
46c5ad27 | 2338 | staticp (tree arg) |
c6a1db6c RS |
2339 | { |
2340 | switch (TREE_CODE (arg)) | |
2341 | { | |
c6a1db6c | 2342 | case FUNCTION_DECL: |
269b7526 AP |
2343 | /* Nested functions are static, even though taking their address will |
2344 | involve a trampoline as we unnest the nested function and create | |
2345 | the trampoline on the tree level. */ | |
2346 | return arg; | |
27da1b4d | 2347 | |
86270344 | 2348 | case VAR_DECL: |
3d78f2e9 | 2349 | return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg)) |
c2f7fa15 | 2350 | && ! DECL_THREAD_LOCAL_P (arg) |
43d9ad1d | 2351 | && ! DECL_DLLIMPORT_P (arg) |
525c6bf5 | 2352 | ? arg : NULL); |
c6a1db6c | 2353 | |
943db347 AP |
2354 | case CONST_DECL: |
2355 | return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg)) | |
2356 | ? arg : NULL); | |
2357 | ||
492c86a4 | 2358 | case CONSTRUCTOR: |
525c6bf5 | 2359 | return TREE_STATIC (arg) ? arg : NULL; |
492c86a4 | 2360 | |
1c12c179 | 2361 | case LABEL_DECL: |
c6a1db6c | 2362 | case STRING_CST: |
525c6bf5 | 2363 | return arg; |
c6a1db6c | 2364 | |
6de9cd9a | 2365 | case COMPONENT_REF: |
270c60bb DB |
2366 | /* If the thing being referenced is not a field, then it is |
2367 | something language specific. */ | |
2ec5deb5 | 2368 | gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL); |
6de9cd9a | 2369 | |
f7fa6ef9 RK |
2370 | /* If we are referencing a bitfield, we can't evaluate an |
2371 | ADDR_EXPR at compile time and so it isn't a constant. */ | |
6de9cd9a | 2372 | if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1))) |
525c6bf5 | 2373 | return NULL; |
6de9cd9a DN |
2374 | |
2375 | return staticp (TREE_OPERAND (arg, 0)); | |
f7fa6ef9 | 2376 | |
c6a1db6c | 2377 | case BIT_FIELD_REF: |
525c6bf5 | 2378 | return NULL; |
c6a1db6c | 2379 | |
7ccf35ed DN |
2380 | case MISALIGNED_INDIRECT_REF: |
2381 | case ALIGN_INDIRECT_REF: | |
c6a1db6c | 2382 | case INDIRECT_REF: |
525c6bf5 | 2383 | return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL; |
c6a1db6c RS |
2384 | |
2385 | case ARRAY_REF: | |
b4e3fabb | 2386 | case ARRAY_RANGE_REF: |
c6a1db6c RS |
2387 | if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST |
2388 | && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST) | |
2389 | return staticp (TREE_OPERAND (arg, 0)); | |
6de9cd9a | 2390 | else |
2ec5deb5 PB |
2391 | return NULL; |
2392 | ||
2393 | case COMPOUND_LITERAL_EXPR: | |
2394 | return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL; | |
c6a1db6c | 2395 | |
e9a25f70 | 2396 | default: |
2ec5deb5 | 2397 | return NULL; |
e9a25f70 | 2398 | } |
c6a1db6c | 2399 | } |
51eed280 | 2400 | |
c6a1db6c | 2401 | \f |
51eed280 PB |
2402 | |
2403 | ||
2404 | /* Return whether OP is a DECL whose address is function-invariant. */ | |
2405 | ||
2406 | bool | |
2407 | decl_address_invariant_p (const_tree op) | |
2408 | { | |
2409 | /* The conditions below are slightly less strict than the one in | |
2410 | staticp. */ | |
2411 | ||
2412 | switch (TREE_CODE (op)) | |
2413 | { | |
2414 | case PARM_DECL: | |
2415 | case RESULT_DECL: | |
2416 | case LABEL_DECL: | |
2417 | case FUNCTION_DECL: | |
2418 | return true; | |
2419 | ||
2420 | case VAR_DECL: | |
2421 | if (((TREE_STATIC (op) || DECL_EXTERNAL (op)) | |
2422 | && !DECL_DLLIMPORT_P (op)) | |
2423 | || DECL_THREAD_LOCAL_P (op) | |
2424 | || DECL_CONTEXT (op) == current_function_decl | |
2425 | || decl_function_context (op) == current_function_decl) | |
2426 | return true; | |
2427 | break; | |
2428 | ||
2429 | case CONST_DECL: | |
2430 | if ((TREE_STATIC (op) || DECL_EXTERNAL (op)) | |
2431 | || decl_function_context (op) == current_function_decl) | |
2432 | return true; | |
2433 | break; | |
2434 | ||
2435 | default: | |
2436 | break; | |
2437 | } | |
2438 | ||
2439 | return false; | |
2440 | } | |
2441 | ||
00fc2333 JH |
2442 | /* Return whether OP is a DECL whose address is interprocedural-invariant. */ |
2443 | ||
2444 | bool | |
2445 | decl_address_ip_invariant_p (const_tree op) | |
2446 | { | |
2447 | /* The conditions below are slightly less strict than the one in | |
2448 | staticp. */ | |
2449 | ||
2450 | switch (TREE_CODE (op)) | |
2451 | { | |
2452 | case LABEL_DECL: | |
2453 | case FUNCTION_DECL: | |
2454 | case STRING_CST: | |
2455 | return true; | |
2456 | ||
2457 | case VAR_DECL: | |
2458 | if (((TREE_STATIC (op) || DECL_EXTERNAL (op)) | |
2459 | && !DECL_DLLIMPORT_P (op)) | |
2460 | || DECL_THREAD_LOCAL_P (op)) | |
2461 | return true; | |
2462 | break; | |
2463 | ||
2464 | case CONST_DECL: | |
2465 | if ((TREE_STATIC (op) || DECL_EXTERNAL (op))) | |
2466 | return true; | |
2467 | break; | |
2468 | ||
2469 | default: | |
2470 | break; | |
2471 | } | |
2472 | ||
2473 | return false; | |
2474 | } | |
2475 | ||
51eed280 PB |
2476 | |
2477 | /* Return true if T is function-invariant (internal function, does | |
2478 | not handle arithmetic; that's handled in skip_simple_arithmetic and | |
2479 | tree_invariant_p). */ | |
2480 | ||
2481 | static bool tree_invariant_p (tree t); | |
2482 | ||
2483 | static bool | |
2484 | tree_invariant_p_1 (tree t) | |
2485 | { | |
2486 | tree op; | |
2487 | ||
2488 | if (TREE_CONSTANT (t) | |
2489 | || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t))) | |
2490 | return true; | |
2491 | ||
2492 | switch (TREE_CODE (t)) | |
2493 | { | |
2494 | case SAVE_EXPR: | |
2495 | return true; | |
2496 | ||
2497 | case ADDR_EXPR: | |
2498 | op = TREE_OPERAND (t, 0); | |
2499 | while (handled_component_p (op)) | |
2500 | { | |
2501 | switch (TREE_CODE (op)) | |
2502 | { | |
2503 | case ARRAY_REF: | |
2504 | case ARRAY_RANGE_REF: | |
2505 | if (!tree_invariant_p (TREE_OPERAND (op, 1)) | |
2506 | || TREE_OPERAND (op, 2) != NULL_TREE | |
2507 | || TREE_OPERAND (op, 3) != NULL_TREE) | |
2508 | return false; | |
2509 | break; | |
2510 | ||
2511 | case COMPONENT_REF: | |
2512 | if (TREE_OPERAND (op, 2) != NULL_TREE) | |
2513 | return false; | |
2514 | break; | |
2515 | ||
2516 | default:; | |
2517 | } | |
2518 | op = TREE_OPERAND (op, 0); | |
2519 | } | |
2520 | ||
2521 | return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op); | |
2522 | ||
2523 | default: | |
2524 | break; | |
2525 | } | |
2526 | ||
2527 | return false; | |
2528 | } | |
2529 | ||
2530 | /* Return true if T is function-invariant. */ | |
2531 | ||
2532 | static bool | |
2533 | tree_invariant_p (tree t) | |
2534 | { | |
2535 | tree inner = skip_simple_arithmetic (t); | |
2536 | return tree_invariant_p_1 (inner); | |
2537 | } | |
2538 | ||
3aa77500 RS |
2539 | /* Wrap a SAVE_EXPR around EXPR, if appropriate. |
2540 | Do this to any expression which may be used in more than one place, | |
2541 | but must be evaluated only once. | |
2542 | ||
2543 | Normally, expand_expr would reevaluate the expression each time. | |
2544 | Calling save_expr produces something that is evaluated and recorded | |
2545 | the first time expand_expr is called on it. Subsequent calls to | |
2546 | expand_expr just reuse the recorded value. | |
2547 | ||
2548 | The call to expand_expr that generates code that actually computes | |
2549 | the value is the first call *at compile time*. Subsequent calls | |
2550 | *at compile time* generate code to use the saved value. | |
2551 | This produces correct result provided that *at run time* control | |
2552 | always flows through the insns made by the first expand_expr | |
2553 | before reaching the other places where the save_expr was evaluated. | |
2554 | You, the caller of save_expr, must make sure this is so. | |
2555 | ||
2556 | Constants, and certain read-only nodes, are returned with no | |
2557 | SAVE_EXPR because that is safe. Expressions containing placeholders | |
c5af9901 RK |
2558 | are not touched; see tree.def for an explanation of what these |
2559 | are used for. */ | |
c6a1db6c RS |
2560 | |
2561 | tree | |
46c5ad27 | 2562 | save_expr (tree expr) |
c6a1db6c | 2563 | { |
7a6cdb44 | 2564 | tree t = fold (expr); |
84d8756d RK |
2565 | tree inner; |
2566 | ||
c6a1db6c RS |
2567 | /* If the tree evaluates to a constant, then we don't want to hide that |
2568 | fact (i.e. this allows further folding, and direct checks for constants). | |
af929c62 | 2569 | However, a read-only object that has side effects cannot be bypassed. |
dc478a5d | 2570 | Since it is no problem to reevaluate literals, we just return the |
0f41302f | 2571 | literal node. */ |
84d8756d | 2572 | inner = skip_simple_arithmetic (t); |
51eed280 PB |
2573 | if (TREE_CODE (inner) == ERROR_MARK) |
2574 | return inner; | |
6de9cd9a | 2575 | |
51eed280 | 2576 | if (tree_invariant_p_1 (inner)) |
c6a1db6c RS |
2577 | return t; |
2578 | ||
a9ecacf6 | 2579 | /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since |
dec20b4b RK |
2580 | it means that the size or offset of some field of an object depends on |
2581 | the value within another field. | |
2582 | ||
2583 | Note that it must not be the case that T contains both a PLACEHOLDER_EXPR | |
2584 | and some variable since it would then need to be both evaluated once and | |
2585 | evaluated more than once. Front-ends must assure this case cannot | |
2586 | happen by surrounding any such subexpressions in their own SAVE_EXPR | |
2587 | and forcing evaluation at the proper time. */ | |
a9ecacf6 | 2588 | if (contains_placeholder_p (inner)) |
dec20b4b RK |
2589 | return t; |
2590 | ||
82c82743 | 2591 | t = build1 (SAVE_EXPR, TREE_TYPE (expr), t); |
c2255bc4 | 2592 | SET_EXPR_LOCATION (t, EXPR_LOCATION (expr)); |
c6a1db6c RS |
2593 | |
2594 | /* This expression might be placed ahead of a jump to ensure that the | |
2595 | value was computed on both sides of the jump. So make sure it isn't | |
2596 | eliminated as dead. */ | |
2597 | TREE_SIDE_EFFECTS (t) = 1; | |
2598 | return t; | |
2599 | } | |
679163cf | 2600 | |
a9ecacf6 OH |
2601 | /* Look inside EXPR and into any simple arithmetic operations. Return |
2602 | the innermost non-arithmetic node. */ | |
2603 | ||
2604 | tree | |
46c5ad27 | 2605 | skip_simple_arithmetic (tree expr) |
a9ecacf6 OH |
2606 | { |
2607 | tree inner; | |
46c5ad27 | 2608 | |
a9ecacf6 OH |
2609 | /* We don't care about whether this can be used as an lvalue in this |
2610 | context. */ | |
2611 | while (TREE_CODE (expr) == NON_LVALUE_EXPR) | |
2612 | expr = TREE_OPERAND (expr, 0); | |
2613 | ||
2614 | /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and | |
2615 | a constant, it will be more efficient to not make another SAVE_EXPR since | |
2616 | it will allow better simplification and GCSE will be able to merge the | |
2617 | computations if they actually occur. */ | |
2618 | inner = expr; | |
2619 | while (1) | |
2620 | { | |
6615c446 | 2621 | if (UNARY_CLASS_P (inner)) |
a9ecacf6 | 2622 | inner = TREE_OPERAND (inner, 0); |
6615c446 | 2623 | else if (BINARY_CLASS_P (inner)) |
a9ecacf6 | 2624 | { |
51eed280 | 2625 | if (tree_invariant_p (TREE_OPERAND (inner, 1))) |
a9ecacf6 | 2626 | inner = TREE_OPERAND (inner, 0); |
51eed280 | 2627 | else if (tree_invariant_p (TREE_OPERAND (inner, 0))) |
a9ecacf6 OH |
2628 | inner = TREE_OPERAND (inner, 1); |
2629 | else | |
2630 | break; | |
2631 | } | |
2632 | else | |
2633 | break; | |
2634 | } | |
2635 | ||
2636 | return inner; | |
2637 | } | |
2638 | ||
d251bfca | 2639 | |
e2500fed GK |
2640 | /* Return which tree structure is used by T. */ |
2641 | ||
2642 | enum tree_node_structure_enum | |
9566a759 | 2643 | tree_node_structure (const_tree t) |
e2500fed | 2644 | { |
9566a759 | 2645 | const enum tree_code code = TREE_CODE (t); |
d251bfca | 2646 | return tree_node_structure_for_code (code); |
e2500fed | 2647 | } |
6569d386 EB |
2648 | |
2649 | /* Set various status flags when building a CALL_EXPR object T. */ | |
2650 | ||
2651 | static void | |
2652 | process_call_operands (tree t) | |
2653 | { | |
2654 | bool side_effects = TREE_SIDE_EFFECTS (t); | |
96da8066 EB |
2655 | bool read_only = false; |
2656 | int i = call_expr_flags (t); | |
6569d386 | 2657 | |
96da8066 EB |
2658 | /* Calls have side-effects, except those to const or pure functions. */ |
2659 | if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE))) | |
2660 | side_effects = true; | |
2661 | /* Propagate TREE_READONLY of arguments for const functions. */ | |
2662 | if (i & ECF_CONST) | |
2663 | read_only = true; | |
2664 | ||
2665 | if (!side_effects || read_only) | |
6569d386 EB |
2666 | for (i = 1; i < TREE_OPERAND_LENGTH (t); i++) |
2667 | { | |
2668 | tree op = TREE_OPERAND (t, i); | |
2669 | if (op && TREE_SIDE_EFFECTS (op)) | |
96da8066 EB |
2670 | side_effects = true; |
2671 | if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op)) | |
2672 | read_only = false; | |
6569d386 EB |
2673 | } |
2674 | ||
6569d386 | 2675 | TREE_SIDE_EFFECTS (t) = side_effects; |
96da8066 | 2676 | TREE_READONLY (t) = read_only; |
6569d386 | 2677 | } |
dec20b4b RK |
2678 | \f |
2679 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size | |
3910a7cb | 2680 | or offset that depends on a field within a record. */ |
dec20b4b | 2681 | |
7a6cdb44 | 2682 | bool |
fa233e34 | 2683 | contains_placeholder_p (const_tree exp) |
dec20b4b | 2684 | { |
b3694847 | 2685 | enum tree_code code; |
dec20b4b | 2686 | |
8f17b5c5 MM |
2687 | if (!exp) |
2688 | return 0; | |
2689 | ||
8f17b5c5 | 2690 | code = TREE_CODE (exp); |
6fce44af | 2691 | if (code == PLACEHOLDER_EXPR) |
cc3c7c13 | 2692 | return 1; |
67c8d7de | 2693 | |
dec20b4b RK |
2694 | switch (TREE_CODE_CLASS (code)) |
2695 | { | |
6615c446 | 2696 | case tcc_reference: |
cc3c7c13 RK |
2697 | /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit |
2698 | position computations since they will be converted into a | |
2699 | WITH_RECORD_EXPR involving the reference, which will assume | |
2700 | here will be valid. */ | |
7a6cdb44 | 2701 | return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0)); |
dec20b4b | 2702 | |
6615c446 | 2703 | case tcc_exceptional: |
e9a25f70 | 2704 | if (code == TREE_LIST) |
7a6cdb44 RK |
2705 | return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp)) |
2706 | || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp))); | |
e9a25f70 | 2707 | break; |
dc478a5d | 2708 | |
6615c446 JO |
2709 | case tcc_unary: |
2710 | case tcc_binary: | |
2711 | case tcc_comparison: | |
2712 | case tcc_expression: | |
3910a7cb RK |
2713 | switch (code) |
2714 | { | |
2715 | case COMPOUND_EXPR: | |
dc478a5d | 2716 | /* Ignoring the first operand isn't quite right, but works best. */ |
7a6cdb44 | 2717 | return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)); |
3910a7cb | 2718 | |
3910a7cb | 2719 | case COND_EXPR: |
7a6cdb44 RK |
2720 | return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0)) |
2721 | || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)) | |
2722 | || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2))); | |
3910a7cb | 2723 | |
522aa637 GB |
2724 | case SAVE_EXPR: |
2725 | /* The save_expr function never wraps anything containing | |
2726 | a PLACEHOLDER_EXPR. */ | |
2727 | return 0; | |
2728 | ||
e9a25f70 JL |
2729 | default: |
2730 | break; | |
3910a7cb RK |
2731 | } |
2732 | ||
54e4aedb | 2733 | switch (TREE_CODE_LENGTH (code)) |
dec20b4b RK |
2734 | { |
2735 | case 1: | |
7a6cdb44 | 2736 | return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0)); |
dec20b4b | 2737 | case 2: |
7a6cdb44 RK |
2738 | return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0)) |
2739 | || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))); | |
e9a25f70 JL |
2740 | default: |
2741 | return 0; | |
dec20b4b | 2742 | } |
dec20b4b | 2743 | |
5039610b SL |
2744 | case tcc_vl_exp: |
2745 | switch (code) | |
2746 | { | |
2747 | case CALL_EXPR: | |
2748 | { | |
fa233e34 KG |
2749 | const_tree arg; |
2750 | const_call_expr_arg_iterator iter; | |
2751 | FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp) | |
5039610b SL |
2752 | if (CONTAINS_PLACEHOLDER_P (arg)) |
2753 | return 1; | |
2754 | return 0; | |
2755 | } | |
2756 | default: | |
2757 | return 0; | |
2758 | } | |
2759 | ||
e9a25f70 JL |
2760 | default: |
2761 | return 0; | |
2762 | } | |
1160f9ec | 2763 | return 0; |
dec20b4b | 2764 | } |
b7f6588d | 2765 | |
a5bfe141 RH |
2766 | /* Return true if any part of the computation of TYPE involves a |
2767 | PLACEHOLDER_EXPR. This includes size, bounds, qualifiers | |
2768 | (for QUAL_UNION_TYPE) and field positions. */ | |
7a6cdb44 | 2769 | |
a5bfe141 | 2770 | static bool |
9566a759 | 2771 | type_contains_placeholder_1 (const_tree type) |
7a6cdb44 RK |
2772 | { |
2773 | /* If the size contains a placeholder or the parent type (component type in | |
2774 | the case of arrays) type involves a placeholder, this type does. */ | |
2775 | if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type)) | |
2776 | || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type)) | |
2777 | || (TREE_TYPE (type) != 0 | |
2778 | && type_contains_placeholder_p (TREE_TYPE (type)))) | |
a5bfe141 | 2779 | return true; |
7a6cdb44 RK |
2780 | |
2781 | /* Now do type-specific checks. Note that the last part of the check above | |
2782 | greatly limits what we have to do below. */ | |
2783 | switch (TREE_CODE (type)) | |
2784 | { | |
2785 | case VOID_TYPE: | |
2786 | case COMPLEX_TYPE: | |
7a6cdb44 RK |
2787 | case ENUMERAL_TYPE: |
2788 | case BOOLEAN_TYPE: | |
7a6cdb44 RK |
2789 | case POINTER_TYPE: |
2790 | case OFFSET_TYPE: | |
2791 | case REFERENCE_TYPE: | |
2792 | case METHOD_TYPE: | |
7a6cdb44 | 2793 | case FUNCTION_TYPE: |
a65735cd | 2794 | case VECTOR_TYPE: |
a5bfe141 | 2795 | return false; |
7a6cdb44 RK |
2796 | |
2797 | case INTEGER_TYPE: | |
2798 | case REAL_TYPE: | |
325217ed | 2799 | case FIXED_POINT_TYPE: |
7a6cdb44 RK |
2800 | /* Here we just check the bounds. */ |
2801 | return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type)) | |
2802 | || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type))); | |
2803 | ||
2804 | case ARRAY_TYPE: | |
7a6cdb44 RK |
2805 | /* We're already checked the component type (TREE_TYPE), so just check |
2806 | the index type. */ | |
2807 | return type_contains_placeholder_p (TYPE_DOMAIN (type)); | |
2808 | ||
2809 | case RECORD_TYPE: | |
2810 | case UNION_TYPE: | |
2811 | case QUAL_UNION_TYPE: | |
2812 | { | |
7a6cdb44 | 2813 | tree field; |
7a6cdb44 RK |
2814 | |
2815 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
2816 | if (TREE_CODE (field) == FIELD_DECL | |
2817 | && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field)) | |
2818 | || (TREE_CODE (type) == QUAL_UNION_TYPE | |
2819 | && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field))) | |
2820 | || type_contains_placeholder_p (TREE_TYPE (field)))) | |
a5bfe141 RH |
2821 | return true; |
2822 | ||
2823 | return false; | |
7a6cdb44 RK |
2824 | } |
2825 | ||
2826 | default: | |
1e128c5f | 2827 | gcc_unreachable (); |
7a6cdb44 RK |
2828 | } |
2829 | } | |
a5bfe141 RH |
2830 | |
2831 | bool | |
2832 | type_contains_placeholder_p (tree type) | |
2833 | { | |
2834 | bool result; | |
2835 | ||
2836 | /* If the contains_placeholder_bits field has been initialized, | |
2837 | then we know the answer. */ | |
2838 | if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0) | |
2839 | return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1; | |
2840 | ||
2841 | /* Indicate that we've seen this type node, and the answer is false. | |
2842 | This is what we want to return if we run into recursion via fields. */ | |
2843 | TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1; | |
2844 | ||
2845 | /* Compute the real value. */ | |
2846 | result = type_contains_placeholder_1 (type); | |
2847 | ||
2848 | /* Store the real value. */ | |
2849 | TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1; | |
2850 | ||
2851 | return result; | |
2852 | } | |
dec20b4b | 2853 | \f |
f82a627c EB |
2854 | /* Push tree EXP onto vector QUEUE if it is not already present. */ |
2855 | ||
2856 | static void | |
2857 | push_without_duplicates (tree exp, VEC (tree, heap) **queue) | |
2858 | { | |
2859 | unsigned int i; | |
2860 | tree iter; | |
2861 | ||
2862 | for (i = 0; VEC_iterate (tree, *queue, i, iter); i++) | |
2863 | if (simple_cst_equal (iter, exp) == 1) | |
2864 | break; | |
2865 | ||
2866 | if (!iter) | |
2867 | VEC_safe_push (tree, heap, *queue, exp); | |
2868 | } | |
2869 | ||
2870 | /* Given a tree EXP, find all occurences of references to fields | |
2871 | in a PLACEHOLDER_EXPR and place them in vector REFS without | |
2872 | duplicates. Also record VAR_DECLs and CONST_DECLs. Note that | |
2873 | we assume here that EXP contains only arithmetic expressions | |
2874 | or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their | |
2875 | argument list. */ | |
2876 | ||
2877 | void | |
2878 | find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs) | |
2879 | { | |
2880 | enum tree_code code = TREE_CODE (exp); | |
2881 | tree inner; | |
2882 | int i; | |
2883 | ||
2884 | /* We handle TREE_LIST and COMPONENT_REF separately. */ | |
2885 | if (code == TREE_LIST) | |
2886 | { | |
2887 | FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs); | |
2888 | FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs); | |
2889 | } | |
2890 | else if (code == COMPONENT_REF) | |
2891 | { | |
2892 | for (inner = TREE_OPERAND (exp, 0); | |
2893 | REFERENCE_CLASS_P (inner); | |
2894 | inner = TREE_OPERAND (inner, 0)) | |
2895 | ; | |
2896 | ||
2897 | if (TREE_CODE (inner) == PLACEHOLDER_EXPR) | |
2898 | push_without_duplicates (exp, refs); | |
2899 | else | |
2900 | FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs); | |
2901 | } | |
2902 | else | |
2903 | switch (TREE_CODE_CLASS (code)) | |
2904 | { | |
2905 | case tcc_constant: | |
2906 | break; | |
2907 | ||
2908 | case tcc_declaration: | |
2909 | /* Variables allocated to static storage can stay. */ | |
2910 | if (!TREE_STATIC (exp)) | |
2911 | push_without_duplicates (exp, refs); | |
2912 | break; | |
2913 | ||
2914 | case tcc_expression: | |
2915 | /* This is the pattern built in ada/make_aligning_type. */ | |
2916 | if (code == ADDR_EXPR | |
2917 | && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR) | |
2918 | { | |
2919 | push_without_duplicates (exp, refs); | |
2920 | break; | |
2921 | } | |
2922 | ||
2923 | /* Fall through... */ | |
2924 | ||
2925 | case tcc_exceptional: | |
2926 | case tcc_unary: | |
2927 | case tcc_binary: | |
2928 | case tcc_comparison: | |
2929 | case tcc_reference: | |
2930 | for (i = 0; i < TREE_CODE_LENGTH (code); i++) | |
2931 | FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs); | |
2932 | break; | |
2933 | ||
2934 | case tcc_vl_exp: | |
2935 | for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++) | |
2936 | FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs); | |
2937 | break; | |
2938 | ||
2939 | default: | |
2940 | gcc_unreachable (); | |
2941 | } | |
2942 | } | |
2943 | ||
dec20b4b RK |
2944 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, |
2945 | return a tree with all occurrences of references to F in a | |
f82a627c EB |
2946 | PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and |
2947 | CONST_DECLs. Note that we assume here that EXP contains only | |
2948 | arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs | |
2949 | occurring only in their argument list. */ | |
dec20b4b RK |
2950 | |
2951 | tree | |
46c5ad27 | 2952 | substitute_in_expr (tree exp, tree f, tree r) |
dec20b4b RK |
2953 | { |
2954 | enum tree_code code = TREE_CODE (exp); | |
7ad00e13 | 2955 | tree op0, op1, op2, op3; |
6569d386 | 2956 | tree new_tree; |
dec20b4b | 2957 | |
9d2a492d RK |
2958 | /* We handle TREE_LIST and COMPONENT_REF separately. */ |
2959 | if (code == TREE_LIST) | |
dec20b4b | 2960 | { |
6fce44af RK |
2961 | op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r); |
2962 | op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r); | |
9d2a492d | 2963 | if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp)) |
dec20b4b | 2964 | return exp; |
e9a25f70 | 2965 | |
9d2a492d RK |
2966 | return tree_cons (TREE_PURPOSE (exp), op1, op0); |
2967 | } | |
2968 | else if (code == COMPONENT_REF) | |
6569d386 EB |
2969 | { |
2970 | tree inner; | |
2971 | ||
2972 | /* If this expression is getting a value from a PLACEHOLDER_EXPR | |
2973 | and it is the right field, replace it with R. */ | |
2974 | for (inner = TREE_OPERAND (exp, 0); | |
2975 | REFERENCE_CLASS_P (inner); | |
2976 | inner = TREE_OPERAND (inner, 0)) | |
2977 | ; | |
2978 | ||
2979 | /* The field. */ | |
2980 | op1 = TREE_OPERAND (exp, 1); | |
2981 | ||
2982 | if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f) | |
2983 | return r; | |
2984 | ||
2985 | /* If this expression hasn't been completed let, leave it alone. */ | |
2986 | if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner)) | |
2987 | return exp; | |
2988 | ||
2989 | op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r); | |
2990 | if (op0 == TREE_OPERAND (exp, 0)) | |
2991 | return exp; | |
2992 | ||
2993 | new_tree | |
2994 | = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE); | |
9d2a492d RK |
2995 | } |
2996 | else | |
2997 | switch (TREE_CODE_CLASS (code)) | |
2998 | { | |
6615c446 | 2999 | case tcc_constant: |
9d2a492d | 3000 | return exp; |
dec20b4b | 3001 | |
f82a627c EB |
3002 | case tcc_declaration: |
3003 | if (exp == f) | |
3004 | return r; | |
3005 | else | |
3006 | return exp; | |
3007 | ||
3008 | case tcc_expression: | |
3009 | if (exp == f) | |
3010 | return r; | |
3011 | ||
3012 | /* Fall through... */ | |
3013 | ||
6615c446 JO |
3014 | case tcc_exceptional: |
3015 | case tcc_unary: | |
3016 | case tcc_binary: | |
3017 | case tcc_comparison: | |
6615c446 | 3018 | case tcc_reference: |
54e4aedb | 3019 | switch (TREE_CODE_LENGTH (code)) |
9d2a492d RK |
3020 | { |
3021 | case 0: | |
9b594acf | 3022 | return exp; |
dc478a5d | 3023 | |
9d2a492d | 3024 | case 1: |
6fce44af | 3025 | op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r); |
9d2a492d RK |
3026 | if (op0 == TREE_OPERAND (exp, 0)) |
3027 | return exp; | |
235783d1 | 3028 | |
82d6e6fc | 3029 | new_tree = fold_build1 (code, TREE_TYPE (exp), op0); |
9d2a492d | 3030 | break; |
dec20b4b | 3031 | |
9d2a492d | 3032 | case 2: |
6fce44af RK |
3033 | op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r); |
3034 | op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r); | |
784fb70e | 3035 | |
9d2a492d RK |
3036 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)) |
3037 | return exp; | |
9b594acf | 3038 | |
82d6e6fc | 3039 | new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1); |
9d2a492d | 3040 | break; |
dec20b4b | 3041 | |
9d2a492d | 3042 | case 3: |
6fce44af RK |
3043 | op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r); |
3044 | op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r); | |
3045 | op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r); | |
6a22e3a7 | 3046 | |
9d2a492d RK |
3047 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1) |
3048 | && op2 == TREE_OPERAND (exp, 2)) | |
3049 | return exp; | |
e9a25f70 | 3050 | |
82d6e6fc | 3051 | new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2); |
9d2a492d | 3052 | break; |
e9a25f70 | 3053 | |
7ad00e13 EB |
3054 | case 4: |
3055 | op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r); | |
3056 | op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r); | |
3057 | op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r); | |
3058 | op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r); | |
3059 | ||
3060 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1) | |
3061 | && op2 == TREE_OPERAND (exp, 2) | |
3062 | && op3 == TREE_OPERAND (exp, 3)) | |
3063 | return exp; | |
3064 | ||
6569d386 EB |
3065 | new_tree |
3066 | = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3)); | |
7ad00e13 EB |
3067 | break; |
3068 | ||
9d2a492d | 3069 | default: |
1e128c5f | 3070 | gcc_unreachable (); |
9d2a492d RK |
3071 | } |
3072 | break; | |
dec20b4b | 3073 | |
5039610b SL |
3074 | case tcc_vl_exp: |
3075 | { | |
5039610b | 3076 | int i; |
9328dd57 | 3077 | |
6569d386 EB |
3078 | new_tree = NULL_TREE; |
3079 | ||
f82a627c EB |
3080 | /* If we are trying to replace F with a constant, inline back |
3081 | functions which do nothing else than computing a value from | |
3082 | the arguments they are passed. This makes it possible to | |
3083 | fold partially or entirely the replacement expression. */ | |
3084 | if (CONSTANT_CLASS_P (r) && code == CALL_EXPR) | |
3085 | { | |
3086 | tree t = maybe_inline_call_in_expr (exp); | |
3087 | if (t) | |
3088 | return SUBSTITUTE_IN_EXPR (t, f, r); | |
3089 | } | |
3090 | ||
9328dd57 | 3091 | for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++) |
5039610b SL |
3092 | { |
3093 | tree op = TREE_OPERAND (exp, i); | |
df8e1fdc EB |
3094 | tree new_op = SUBSTITUTE_IN_EXPR (op, f, r); |
3095 | if (new_op != op) | |
5039610b | 3096 | { |
6569d386 EB |
3097 | if (!new_tree) |
3098 | new_tree = copy_node (exp); | |
3099 | TREE_OPERAND (new_tree, i) = new_op; | |
5039610b SL |
3100 | } |
3101 | } | |
df8e1fdc | 3102 | |
6569d386 EB |
3103 | if (new_tree) |
3104 | { | |
3105 | new_tree = fold (new_tree); | |
3106 | if (TREE_CODE (new_tree) == CALL_EXPR) | |
3107 | process_call_operands (new_tree); | |
3108 | } | |
5039610b SL |
3109 | else |
3110 | return exp; | |
3111 | } | |
9328dd57 | 3112 | break; |
5039610b | 3113 | |
9d2a492d | 3114 | default: |
1e128c5f | 3115 | gcc_unreachable (); |
9d2a492d | 3116 | } |
dec20b4b | 3117 | |
6569d386 | 3118 | TREE_READONLY (new_tree) |= TREE_READONLY (exp); |
82d6e6fc | 3119 | return new_tree; |
dec20b4b | 3120 | } |
6fce44af RK |
3121 | |
3122 | /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement | |
3123 | for it within OBJ, a tree that is an object or a chain of references. */ | |
3124 | ||
3125 | tree | |
3126 | substitute_placeholder_in_expr (tree exp, tree obj) | |
3127 | { | |
3128 | enum tree_code code = TREE_CODE (exp); | |
95df09f0 | 3129 | tree op0, op1, op2, op3; |
6569d386 | 3130 | tree new_tree; |
6fce44af RK |
3131 | |
3132 | /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type | |
3133 | in the chain of OBJ. */ | |
3134 | if (code == PLACEHOLDER_EXPR) | |
3135 | { | |
3136 | tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp)); | |
3137 | tree elt; | |
3138 | ||
3139 | for (elt = obj; elt != 0; | |
3140 | elt = ((TREE_CODE (elt) == COMPOUND_EXPR | |
3141 | || TREE_CODE (elt) == COND_EXPR) | |
3142 | ? TREE_OPERAND (elt, 1) | |
6615c446 JO |
3143 | : (REFERENCE_CLASS_P (elt) |
3144 | || UNARY_CLASS_P (elt) | |
3145 | || BINARY_CLASS_P (elt) | |
5039610b | 3146 | || VL_EXP_CLASS_P (elt) |
6615c446 | 3147 | || EXPRESSION_CLASS_P (elt)) |
6fce44af RK |
3148 | ? TREE_OPERAND (elt, 0) : 0)) |
3149 | if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type) | |
3150 | return elt; | |
3151 | ||
3152 | for (elt = obj; elt != 0; | |
3153 | elt = ((TREE_CODE (elt) == COMPOUND_EXPR | |
3154 | || TREE_CODE (elt) == COND_EXPR) | |
3155 | ? TREE_OPERAND (elt, 1) | |
6615c446 JO |
3156 | : (REFERENCE_CLASS_P (elt) |
3157 | || UNARY_CLASS_P (elt) | |
3158 | || BINARY_CLASS_P (elt) | |
5039610b | 3159 | || VL_EXP_CLASS_P (elt) |
6615c446 | 3160 | || EXPRESSION_CLASS_P (elt)) |
6fce44af RK |
3161 | ? TREE_OPERAND (elt, 0) : 0)) |
3162 | if (POINTER_TYPE_P (TREE_TYPE (elt)) | |
3163 | && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt))) | |
3164 | == need_type)) | |
987b67bc | 3165 | return fold_build1 (INDIRECT_REF, need_type, elt); |
6fce44af RK |
3166 | |
3167 | /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it | |
3168 | survives until RTL generation, there will be an error. */ | |
3169 | return exp; | |
3170 | } | |
3171 | ||
3172 | /* TREE_LIST is special because we need to look at TREE_VALUE | |
3173 | and TREE_CHAIN, not TREE_OPERANDS. */ | |
3174 | else if (code == TREE_LIST) | |
3175 | { | |
3176 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj); | |
3177 | op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj); | |
3178 | if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp)) | |
3179 | return exp; | |
3180 | ||
3181 | return tree_cons (TREE_PURPOSE (exp), op1, op0); | |
3182 | } | |
3183 | else | |
3184 | switch (TREE_CODE_CLASS (code)) | |
3185 | { | |
6615c446 JO |
3186 | case tcc_constant: |
3187 | case tcc_declaration: | |
6fce44af RK |
3188 | return exp; |
3189 | ||
6615c446 JO |
3190 | case tcc_exceptional: |
3191 | case tcc_unary: | |
3192 | case tcc_binary: | |
3193 | case tcc_comparison: | |
3194 | case tcc_expression: | |
3195 | case tcc_reference: | |
3196 | case tcc_statement: | |
54e4aedb | 3197 | switch (TREE_CODE_LENGTH (code)) |
6fce44af RK |
3198 | { |
3199 | case 0: | |
3200 | return exp; | |
3201 | ||
3202 | case 1: | |
3203 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj); | |
3204 | if (op0 == TREE_OPERAND (exp, 0)) | |
3205 | return exp; | |
6569d386 EB |
3206 | |
3207 | new_tree = fold_build1 (code, TREE_TYPE (exp), op0); | |
3208 | break; | |
6fce44af RK |
3209 | |
3210 | case 2: | |
3211 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj); | |
3212 | op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj); | |
3213 | ||
3214 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)) | |
3215 | return exp; | |
6569d386 EB |
3216 | |
3217 | new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1); | |
3218 | break; | |
6fce44af RK |
3219 | |
3220 | case 3: | |
3221 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj); | |
3222 | op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj); | |
3223 | op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj); | |
3224 | ||
3225 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1) | |
3226 | && op2 == TREE_OPERAND (exp, 2)) | |
3227 | return exp; | |
6569d386 EB |
3228 | |
3229 | new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2); | |
3230 | break; | |
6fce44af | 3231 | |
95df09f0 RK |
3232 | case 4: |
3233 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj); | |
3234 | op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj); | |
3235 | op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj); | |
3236 | op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj); | |
3237 | ||
3238 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1) | |
3239 | && op2 == TREE_OPERAND (exp, 2) | |
3240 | && op3 == TREE_OPERAND (exp, 3)) | |
3241 | return exp; | |
6569d386 EB |
3242 | |
3243 | new_tree | |
3244 | = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3)); | |
3245 | break; | |
95df09f0 | 3246 | |
6fce44af | 3247 | default: |
1e128c5f | 3248 | gcc_unreachable (); |
6fce44af RK |
3249 | } |
3250 | break; | |
3251 | ||
5039610b SL |
3252 | case tcc_vl_exp: |
3253 | { | |
5039610b | 3254 | int i; |
fa74fa39 | 3255 | |
6569d386 EB |
3256 | new_tree = NULL_TREE; |
3257 | ||
fa74fa39 | 3258 | for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++) |
5039610b SL |
3259 | { |
3260 | tree op = TREE_OPERAND (exp, i); | |
fa74fa39 EB |
3261 | tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj); |
3262 | if (new_op != op) | |
5039610b | 3263 | { |
6569d386 EB |
3264 | if (!new_tree) |
3265 | new_tree = copy_node (exp); | |
3266 | TREE_OPERAND (new_tree, i) = new_op; | |
5039610b SL |
3267 | } |
3268 | } | |
fa74fa39 | 3269 | |
6569d386 EB |
3270 | if (new_tree) |
3271 | { | |
3272 | new_tree = fold (new_tree); | |
3273 | if (TREE_CODE (new_tree) == CALL_EXPR) | |
3274 | process_call_operands (new_tree); | |
3275 | } | |
5039610b SL |
3276 | else |
3277 | return exp; | |
3278 | } | |
6569d386 | 3279 | break; |
5039610b | 3280 | |
6fce44af | 3281 | default: |
1e128c5f | 3282 | gcc_unreachable (); |
6fce44af | 3283 | } |
6569d386 EB |
3284 | |
3285 | TREE_READONLY (new_tree) |= TREE_READONLY (exp); | |
3286 | return new_tree; | |
6fce44af | 3287 | } |
dec20b4b | 3288 | \f |
c6a1db6c RS |
3289 | /* Stabilize a reference so that we can use it any number of times |
3290 | without causing its operands to be evaluated more than once. | |
4b1d0fea RS |
3291 | Returns the stabilized reference. This works by means of save_expr, |
3292 | so see the caveats in the comments about save_expr. | |
c6a1db6c RS |
3293 | |
3294 | Also allows conversion expressions whose operands are references. | |
3295 | Any other kind of expression is returned unchanged. */ | |
3296 | ||
3297 | tree | |
46c5ad27 | 3298 | stabilize_reference (tree ref) |
c6a1db6c | 3299 | { |
b3694847 SS |
3300 | tree result; |
3301 | enum tree_code code = TREE_CODE (ref); | |
c6a1db6c RS |
3302 | |
3303 | switch (code) | |
3304 | { | |
3305 | case VAR_DECL: | |
3306 | case PARM_DECL: | |
3307 | case RESULT_DECL: | |
3308 | /* No action is needed in this case. */ | |
3309 | return ref; | |
3310 | ||
1043771b | 3311 | CASE_CONVERT: |
c6a1db6c RS |
3312 | case FLOAT_EXPR: |
3313 | case FIX_TRUNC_EXPR: | |
c6a1db6c RS |
3314 | result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0))); |
3315 | break; | |
3316 | ||
3317 | case INDIRECT_REF: | |
3318 | result = build_nt (INDIRECT_REF, | |
3319 | stabilize_reference_1 (TREE_OPERAND (ref, 0))); | |
3320 | break; | |
3321 | ||
3322 | case COMPONENT_REF: | |
3323 | result = build_nt (COMPONENT_REF, | |
3324 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
44de5aeb | 3325 | TREE_OPERAND (ref, 1), NULL_TREE); |
c6a1db6c RS |
3326 | break; |
3327 | ||
3328 | case BIT_FIELD_REF: | |
3329 | result = build_nt (BIT_FIELD_REF, | |
3330 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
3331 | stabilize_reference_1 (TREE_OPERAND (ref, 1)), | |
3332 | stabilize_reference_1 (TREE_OPERAND (ref, 2))); | |
3333 | break; | |
3334 | ||
3335 | case ARRAY_REF: | |
3336 | result = build_nt (ARRAY_REF, | |
3337 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
44de5aeb RK |
3338 | stabilize_reference_1 (TREE_OPERAND (ref, 1)), |
3339 | TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3)); | |
c6a1db6c RS |
3340 | break; |
3341 | ||
b4e3fabb RK |
3342 | case ARRAY_RANGE_REF: |
3343 | result = build_nt (ARRAY_RANGE_REF, | |
3344 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
44de5aeb RK |
3345 | stabilize_reference_1 (TREE_OPERAND (ref, 1)), |
3346 | TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3)); | |
b4e3fabb RK |
3347 | break; |
3348 | ||
c451a7a0 | 3349 | case COMPOUND_EXPR: |
7b8b9722 MS |
3350 | /* We cannot wrap the first expression in a SAVE_EXPR, as then |
3351 | it wouldn't be ignored. This matters when dealing with | |
3352 | volatiles. */ | |
3353 | return stabilize_reference_1 (ref); | |
c451a7a0 | 3354 | |
c6a1db6c RS |
3355 | /* If arg isn't a kind of lvalue we recognize, make no change. |
3356 | Caller should recognize the error for an invalid lvalue. */ | |
3357 | default: | |
3358 | return ref; | |
3359 | ||
3360 | case ERROR_MARK: | |
3361 | return error_mark_node; | |
3362 | } | |
3363 | ||
3364 | TREE_TYPE (result) = TREE_TYPE (ref); | |
3365 | TREE_READONLY (result) = TREE_READONLY (ref); | |
3366 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref); | |
3367 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref); | |
c6a1db6c RS |
3368 | |
3369 | return result; | |
3370 | } | |
3371 | ||
3372 | /* Subroutine of stabilize_reference; this is called for subtrees of | |
3373 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
3374 | to ensure that it is only evaluated once. | |
3375 | ||
3376 | We don't put SAVE_EXPR nodes around everything, because assigning very | |
3377 | simple expressions to temporaries causes us to miss good opportunities | |
3378 | for optimizations. Among other things, the opportunity to fold in the | |
3379 | addition of a constant into an addressing mode often gets lost, e.g. | |
3380 | "y[i+1] += x;". In general, we take the approach that we should not make | |
3381 | an assignment unless we are forced into it - i.e., that any non-side effect | |
3382 | operator should be allowed, and that cse should take care of coalescing | |
3383 | multiple utterances of the same expression should that prove fruitful. */ | |
3384 | ||
4745ddae | 3385 | tree |
46c5ad27 | 3386 | stabilize_reference_1 (tree e) |
c6a1db6c | 3387 | { |
b3694847 SS |
3388 | tree result; |
3389 | enum tree_code code = TREE_CODE (e); | |
c6a1db6c | 3390 | |
af929c62 RK |
3391 | /* We cannot ignore const expressions because it might be a reference |
3392 | to a const array but whose index contains side-effects. But we can | |
3393 | ignore things that are actual constant or that already have been | |
3394 | handled by this function. */ | |
3395 | ||
51eed280 | 3396 | if (tree_invariant_p (e)) |
c6a1db6c RS |
3397 | return e; |
3398 | ||
3399 | switch (TREE_CODE_CLASS (code)) | |
3400 | { | |
6615c446 JO |
3401 | case tcc_exceptional: |
3402 | case tcc_type: | |
3403 | case tcc_declaration: | |
3404 | case tcc_comparison: | |
3405 | case tcc_statement: | |
3406 | case tcc_expression: | |
3407 | case tcc_reference: | |
5039610b | 3408 | case tcc_vl_exp: |
c6a1db6c RS |
3409 | /* If the expression has side-effects, then encase it in a SAVE_EXPR |
3410 | so that it will only be evaluated once. */ | |
3411 | /* The reference (r) and comparison (<) classes could be handled as | |
3412 | below, but it is generally faster to only evaluate them once. */ | |
3413 | if (TREE_SIDE_EFFECTS (e)) | |
3414 | return save_expr (e); | |
3415 | return e; | |
3416 | ||
6615c446 | 3417 | case tcc_constant: |
c6a1db6c RS |
3418 | /* Constants need no processing. In fact, we should never reach |
3419 | here. */ | |
3420 | return e; | |
dc478a5d | 3421 | |
6615c446 | 3422 | case tcc_binary: |
ae698e41 RS |
3423 | /* Division is slow and tends to be compiled with jumps, |
3424 | especially the division by powers of 2 that is often | |
3425 | found inside of an array reference. So do it just once. */ | |
3426 | if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR | |
3427 | || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR | |
3428 | || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR | |
3429 | || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR) | |
3430 | return save_expr (e); | |
c6a1db6c RS |
3431 | /* Recursively stabilize each operand. */ |
3432 | result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)), | |
3433 | stabilize_reference_1 (TREE_OPERAND (e, 1))); | |
3434 | break; | |
3435 | ||
6615c446 | 3436 | case tcc_unary: |
c6a1db6c RS |
3437 | /* Recursively stabilize each operand. */ |
3438 | result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0))); | |
3439 | break; | |
a7fcb968 RK |
3440 | |
3441 | default: | |
1e128c5f | 3442 | gcc_unreachable (); |
c6a1db6c | 3443 | } |
dc478a5d | 3444 | |
c6a1db6c RS |
3445 | TREE_TYPE (result) = TREE_TYPE (e); |
3446 | TREE_READONLY (result) = TREE_READONLY (e); | |
3447 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e); | |
3448 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e); | |
c6a1db6c RS |
3449 | |
3450 | return result; | |
3451 | } | |
3452 | \f | |
3453 | /* Low-level constructors for expressions. */ | |
3454 | ||
44de5aeb | 3455 | /* A helper function for build1 and constant folders. Set TREE_CONSTANT, |
51eed280 | 3456 | and TREE_SIDE_EFFECTS for an ADDR_EXPR. */ |
6de9cd9a DN |
3457 | |
3458 | void | |
127203ac | 3459 | recompute_tree_invariant_for_addr_expr (tree t) |
6de9cd9a | 3460 | { |
44de5aeb | 3461 | tree node; |
51eed280 | 3462 | bool tc = true, se = false; |
6de9cd9a | 3463 | |
44de5aeb RK |
3464 | /* We started out assuming this address is both invariant and constant, but |
3465 | does not have side effects. Now go down any handled components and see if | |
3466 | any of them involve offsets that are either non-constant or non-invariant. | |
3467 | Also check for side-effects. | |
3468 | ||
3469 | ??? Note that this code makes no attempt to deal with the case where | |
3470 | taking the address of something causes a copy due to misalignment. */ | |
3471 | ||
51eed280 | 3472 | #define UPDATE_FLAGS(NODE) \ |
44de5aeb | 3473 | do { tree _node = (NODE); \ |
44de5aeb RK |
3474 | if (_node && !TREE_CONSTANT (_node)) tc = false; \ |
3475 | if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0) | |
3476 | ||
3477 | for (node = TREE_OPERAND (t, 0); handled_component_p (node); | |
3478 | node = TREE_OPERAND (node, 0)) | |
6de9cd9a | 3479 | { |
44de5aeb RK |
3480 | /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus |
3481 | array reference (probably made temporarily by the G++ front end), | |
3482 | so ignore all the operands. */ | |
3483 | if ((TREE_CODE (node) == ARRAY_REF | |
3484 | || TREE_CODE (node) == ARRAY_RANGE_REF) | |
3485 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE) | |
6de9cd9a | 3486 | { |
51eed280 | 3487 | UPDATE_FLAGS (TREE_OPERAND (node, 1)); |
bc482be4 | 3488 | if (TREE_OPERAND (node, 2)) |
51eed280 | 3489 | UPDATE_FLAGS (TREE_OPERAND (node, 2)); |
bc482be4 | 3490 | if (TREE_OPERAND (node, 3)) |
51eed280 | 3491 | UPDATE_FLAGS (TREE_OPERAND (node, 3)); |
6de9cd9a | 3492 | } |
44de5aeb RK |
3493 | /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a |
3494 | FIELD_DECL, apparently. The G++ front end can put something else | |
3495 | there, at least temporarily. */ | |
3496 | else if (TREE_CODE (node) == COMPONENT_REF | |
3497 | && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL) | |
bc482be4 RH |
3498 | { |
3499 | if (TREE_OPERAND (node, 2)) | |
51eed280 | 3500 | UPDATE_FLAGS (TREE_OPERAND (node, 2)); |
bc482be4 | 3501 | } |
44de5aeb | 3502 | else if (TREE_CODE (node) == BIT_FIELD_REF) |
51eed280 | 3503 | UPDATE_FLAGS (TREE_OPERAND (node, 2)); |
44de5aeb | 3504 | } |
9f63daea | 3505 | |
51eed280 | 3506 | node = lang_hooks.expr_to_decl (node, &tc, &se); |
73f397d4 | 3507 | |
44de5aeb | 3508 | /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from |
51eed280 PB |
3509 | the address, since &(*a)->b is a form of addition. If it's a constant, the |
3510 | address is constant too. If it's a decl, its address is constant if the | |
3511 | decl is static. Everything else is not constant and, furthermore, | |
3512 | taking the address of a volatile variable is not volatile. */ | |
44de5aeb | 3513 | if (TREE_CODE (node) == INDIRECT_REF) |
51eed280 | 3514 | UPDATE_FLAGS (TREE_OPERAND (node, 0)); |
6615c446 | 3515 | else if (CONSTANT_CLASS_P (node)) |
44de5aeb | 3516 | ; |
51eed280 PB |
3517 | else if (DECL_P (node)) |
3518 | tc &= (staticp (node) != NULL_TREE); | |
44de5aeb RK |
3519 | else |
3520 | { | |
51eed280 | 3521 | tc = false; |
44de5aeb | 3522 | se |= TREE_SIDE_EFFECTS (node); |
6de9cd9a DN |
3523 | } |
3524 | ||
51eed280 | 3525 | |
6de9cd9a | 3526 | TREE_CONSTANT (t) = tc; |
44de5aeb | 3527 | TREE_SIDE_EFFECTS (t) = se; |
51eed280 | 3528 | #undef UPDATE_FLAGS |
6de9cd9a DN |
3529 | } |
3530 | ||
4221057e RH |
3531 | /* Build an expression of code CODE, data type TYPE, and operands as |
3532 | specified. Expressions and reference nodes can be created this way. | |
3533 | Constants, decls, types and misc nodes cannot be. | |
3534 | ||
3535 | We define 5 non-variadic functions, from 0 to 4 arguments. This is | |
d82dd39a | 3536 | enough for all extant tree codes. */ |
c6a1db6c RS |
3537 | |
3538 | tree | |
b9dcdee4 | 3539 | build0_stat (enum tree_code code, tree tt MEM_STAT_DECL) |
c6a1db6c | 3540 | { |
b3694847 | 3541 | tree t; |
c6a1db6c | 3542 | |
1e128c5f | 3543 | gcc_assert (TREE_CODE_LENGTH (code) == 0); |
ba63ed56 | 3544 | |
b9dcdee4 | 3545 | t = make_node_stat (code PASS_MEM_STAT); |
ba63ed56 | 3546 | TREE_TYPE (t) = tt; |
c6a1db6c | 3547 | |
c6a1db6c RS |
3548 | return t; |
3549 | } | |
3550 | ||
c6a1db6c | 3551 | tree |
b9dcdee4 | 3552 | build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL) |
c6a1db6c | 3553 | { |
9ec22713 | 3554 | int length = sizeof (struct tree_exp); |
5e9defae | 3555 | #ifdef GATHER_STATISTICS |
b3694847 | 3556 | tree_node_kind kind; |
5e9defae | 3557 | #endif |
b3694847 | 3558 | tree t; |
c6a1db6c RS |
3559 | |
3560 | #ifdef GATHER_STATISTICS | |
9ec22713 JM |
3561 | switch (TREE_CODE_CLASS (code)) |
3562 | { | |
6615c446 | 3563 | case tcc_statement: /* an expression with side effects */ |
9ec22713 JM |
3564 | kind = s_kind; |
3565 | break; | |
6615c446 | 3566 | case tcc_reference: /* a reference */ |
9ec22713 JM |
3567 | kind = r_kind; |
3568 | break; | |
3569 | default: | |
3570 | kind = e_kind; | |
3571 | break; | |
3572 | } | |
3573 | ||
3574 | tree_node_counts[(int) kind]++; | |
3575 | tree_node_sizes[(int) kind] += length; | |
c6a1db6c RS |
3576 | #endif |
3577 | ||
1e128c5f | 3578 | gcc_assert (TREE_CODE_LENGTH (code) == 1); |
3af4c257 | 3579 | |
3d9a9f94 | 3580 | t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone); |
f8a83ee3 | 3581 | |
fad205ff | 3582 | memset (t, 0, sizeof (struct tree_common)); |
c6a1db6c | 3583 | |
c6a1db6c | 3584 | TREE_SET_CODE (t, code); |
235783d1 | 3585 | |
f8a83ee3 | 3586 | TREE_TYPE (t) = type; |
c1667470 | 3587 | SET_EXPR_LOCATION (t, UNKNOWN_LOCATION); |
c6a1db6c | 3588 | TREE_OPERAND (t, 0) = node; |
6de9cd9a | 3589 | TREE_BLOCK (t) = NULL_TREE; |
ac1b13f4 | 3590 | if (node && !TYPE_P (node)) |
235783d1 RK |
3591 | { |
3592 | TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node); | |
3593 | TREE_READONLY (t) = TREE_READONLY (node); | |
3594 | } | |
c6a1db6c | 3595 | |
6615c446 | 3596 | if (TREE_CODE_CLASS (code) == tcc_statement) |
4f7c4327 | 3597 | TREE_SIDE_EFFECTS (t) = 1; |
9ec22713 | 3598 | else switch (code) |
1fef02f6 | 3599 | { |
1fef02f6 | 3600 | case VA_ARG_EXPR: |
1fef02f6 RH |
3601 | /* All of these have side-effects, no matter what their |
3602 | operands are. */ | |
3603 | TREE_SIDE_EFFECTS (t) = 1; | |
235783d1 | 3604 | TREE_READONLY (t) = 0; |
1fef02f6 | 3605 | break; |
f893c16e | 3606 | |
7ccf35ed DN |
3607 | case MISALIGNED_INDIRECT_REF: |
3608 | case ALIGN_INDIRECT_REF: | |
f893c16e JM |
3609 | case INDIRECT_REF: |
3610 | /* Whether a dereference is readonly has nothing to do with whether | |
3611 | its operand is readonly. */ | |
3612 | TREE_READONLY (t) = 0; | |
3613 | break; | |
dc478a5d | 3614 | |
2038bd69 JM |
3615 | case ADDR_EXPR: |
3616 | if (node) | |
127203ac | 3617 | recompute_tree_invariant_for_addr_expr (t); |
2038bd69 JM |
3618 | break; |
3619 | ||
1fef02f6 | 3620 | default: |
5d5995f1 | 3621 | if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR) |
6615c446 | 3622 | && node && !TYPE_P (node) |
4f976745 | 3623 | && TREE_CONSTANT (node)) |
1796dff4 | 3624 | TREE_CONSTANT (t) = 1; |
6615c446 JO |
3625 | if (TREE_CODE_CLASS (code) == tcc_reference |
3626 | && node && TREE_THIS_VOLATILE (node)) | |
497be978 | 3627 | TREE_THIS_VOLATILE (t) = 1; |
1fef02f6 RH |
3628 | break; |
3629 | } | |
3630 | ||
c6a1db6c RS |
3631 | return t; |
3632 | } | |
3633 | ||
96da8066 EB |
3634 | #define PROCESS_ARG(N) \ |
3635 | do { \ | |
3636 | TREE_OPERAND (t, N) = arg##N; \ | |
3637 | if (arg##N &&!TYPE_P (arg##N)) \ | |
3638 | { \ | |
3639 | if (TREE_SIDE_EFFECTS (arg##N)) \ | |
3640 | side_effects = 1; \ | |
3641 | if (!TREE_READONLY (arg##N) \ | |
3642 | && !CONSTANT_CLASS_P (arg##N)) \ | |
3643 | read_only = 0; \ | |
3644 | if (!TREE_CONSTANT (arg##N)) \ | |
3645 | constant = 0; \ | |
3646 | } \ | |
4221057e RH |
3647 | } while (0) |
3648 | ||
3649 | tree | |
b9dcdee4 | 3650 | build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL) |
4221057e | 3651 | { |
51eed280 | 3652 | bool constant, read_only, side_effects; |
4221057e | 3653 | tree t; |
4221057e | 3654 | |
1e128c5f | 3655 | gcc_assert (TREE_CODE_LENGTH (code) == 2); |
4221057e | 3656 | |
5be014d5 | 3657 | if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR) |
98665861 RG |
3658 | && arg0 && arg1 && tt && POINTER_TYPE_P (tt) |
3659 | /* When sizetype precision doesn't match that of pointers | |
3660 | we need to be able to build explicit extensions or truncations | |
3661 | of the offset argument. */ | |
3662 | && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt)) | |
3663 | gcc_assert (TREE_CODE (arg0) == INTEGER_CST | |
3664 | && TREE_CODE (arg1) == INTEGER_CST); | |
5be014d5 AP |
3665 | |
3666 | if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt) | |
3667 | gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0)) | |
49271fc0 | 3668 | && INTEGRAL_TYPE_P (TREE_TYPE (arg1)) |
36618b93 | 3669 | && useless_type_conversion_p (sizetype, TREE_TYPE (arg1))); |
5be014d5 | 3670 | |
b9dcdee4 | 3671 | t = make_node_stat (code PASS_MEM_STAT); |
4221057e RH |
3672 | TREE_TYPE (t) = tt; |
3673 | ||
3674 | /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the | |
3675 | result based on those same flags for the arguments. But if the | |
3676 | arguments aren't really even `tree' expressions, we shouldn't be trying | |
3677 | to do this. */ | |
4221057e RH |
3678 | |
3679 | /* Expressions without side effects may be constant if their | |
3680 | arguments are as well. */ | |
6615c446 JO |
3681 | constant = (TREE_CODE_CLASS (code) == tcc_comparison |
3682 | || TREE_CODE_CLASS (code) == tcc_binary); | |
4221057e RH |
3683 | read_only = 1; |
3684 | side_effects = TREE_SIDE_EFFECTS (t); | |
3685 | ||
3686 | PROCESS_ARG(0); | |
3687 | PROCESS_ARG(1); | |
3688 | ||
4221057e RH |
3689 | TREE_READONLY (t) = read_only; |
3690 | TREE_CONSTANT (t) = constant; | |
9f63daea | 3691 | TREE_SIDE_EFFECTS (t) = side_effects; |
44de5aeb | 3692 | TREE_THIS_VOLATILE (t) |
6615c446 JO |
3693 | = (TREE_CODE_CLASS (code) == tcc_reference |
3694 | && arg0 && TREE_THIS_VOLATILE (arg0)); | |
4221057e RH |
3695 | |
3696 | return t; | |
3697 | } | |
3698 | ||
07beea0d | 3699 | |
4221057e | 3700 | tree |
b9dcdee4 JH |
3701 | build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1, |
3702 | tree arg2 MEM_STAT_DECL) | |
4221057e | 3703 | { |
51eed280 | 3704 | bool constant, read_only, side_effects; |
4221057e | 3705 | tree t; |
4221057e | 3706 | |
1e128c5f | 3707 | gcc_assert (TREE_CODE_LENGTH (code) == 3); |
5039610b | 3708 | gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp); |
4221057e | 3709 | |
b9dcdee4 | 3710 | t = make_node_stat (code PASS_MEM_STAT); |
4221057e RH |
3711 | TREE_TYPE (t) = tt; |
3712 | ||
96da8066 EB |
3713 | read_only = 1; |
3714 | ||
a9b77cd1 ZD |
3715 | /* As a special exception, if COND_EXPR has NULL branches, we |
3716 | assume that it is a gimple statement and always consider | |
3717 | it to have side effects. */ | |
3718 | if (code == COND_EXPR | |
3719 | && tt == void_type_node | |
3720 | && arg1 == NULL_TREE | |
3721 | && arg2 == NULL_TREE) | |
3722 | side_effects = true; | |
3723 | else | |
3724 | side_effects = TREE_SIDE_EFFECTS (t); | |
4221057e RH |
3725 | |
3726 | PROCESS_ARG(0); | |
3727 | PROCESS_ARG(1); | |
3728 | PROCESS_ARG(2); | |
3729 | ||
96da8066 EB |
3730 | if (code == COND_EXPR) |
3731 | TREE_READONLY (t) = read_only; | |
3732 | ||
9f63daea | 3733 | TREE_SIDE_EFFECTS (t) = side_effects; |
44de5aeb | 3734 | TREE_THIS_VOLATILE (t) |
6615c446 JO |
3735 | = (TREE_CODE_CLASS (code) == tcc_reference |
3736 | && arg0 && TREE_THIS_VOLATILE (arg0)); | |
4221057e RH |
3737 | |
3738 | return t; | |
3739 | } | |
3740 | ||
3741 | tree | |
b9dcdee4 JH |
3742 | build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1, |
3743 | tree arg2, tree arg3 MEM_STAT_DECL) | |
4221057e | 3744 | { |
51eed280 | 3745 | bool constant, read_only, side_effects; |
4221057e | 3746 | tree t; |
4221057e | 3747 | |
1e128c5f | 3748 | gcc_assert (TREE_CODE_LENGTH (code) == 4); |
4221057e | 3749 | |
b9dcdee4 | 3750 | t = make_node_stat (code PASS_MEM_STAT); |
4221057e RH |
3751 | TREE_TYPE (t) = tt; |
3752 | ||
4221057e RH |
3753 | side_effects = TREE_SIDE_EFFECTS (t); |
3754 | ||
3755 | PROCESS_ARG(0); | |
3756 | PROCESS_ARG(1); | |
3757 | PROCESS_ARG(2); | |
3758 | PROCESS_ARG(3); | |
3759 | ||
9f63daea | 3760 | TREE_SIDE_EFFECTS (t) = side_effects; |
44de5aeb | 3761 | TREE_THIS_VOLATILE (t) |
6615c446 JO |
3762 | = (TREE_CODE_CLASS (code) == tcc_reference |
3763 | && arg0 && TREE_THIS_VOLATILE (arg0)); | |
4221057e RH |
3764 | |
3765 | return t; | |
3766 | } | |
3767 | ||
953ff289 DN |
3768 | tree |
3769 | build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1, | |
3770 | tree arg2, tree arg3, tree arg4 MEM_STAT_DECL) | |
3771 | { | |
51eed280 | 3772 | bool constant, read_only, side_effects; |
953ff289 DN |
3773 | tree t; |
3774 | ||
3775 | gcc_assert (TREE_CODE_LENGTH (code) == 5); | |
3776 | ||
3777 | t = make_node_stat (code PASS_MEM_STAT); | |
3778 | TREE_TYPE (t) = tt; | |
3779 | ||
3780 | side_effects = TREE_SIDE_EFFECTS (t); | |
3781 | ||
3782 | PROCESS_ARG(0); | |
3783 | PROCESS_ARG(1); | |
3784 | PROCESS_ARG(2); | |
3785 | PROCESS_ARG(3); | |
3786 | PROCESS_ARG(4); | |
3787 | ||
3788 | TREE_SIDE_EFFECTS (t) = side_effects; | |
3789 | TREE_THIS_VOLATILE (t) | |
3790 | = (TREE_CODE_CLASS (code) == tcc_reference | |
3791 | && arg0 && TREE_THIS_VOLATILE (arg0)); | |
3792 | ||
3793 | return t; | |
3794 | } | |
3795 | ||
ac182688 | 3796 | tree |
5006671f RG |
3797 | build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1, |
3798 | tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL) | |
ac182688 | 3799 | { |
51eed280 | 3800 | bool constant, read_only, side_effects; |
ac182688 ZD |
3801 | tree t; |
3802 | ||
3803 | gcc_assert (code == TARGET_MEM_REF); | |
3804 | ||
3805 | t = make_node_stat (code PASS_MEM_STAT); | |
3806 | TREE_TYPE (t) = tt; | |
3807 | ||
3808 | side_effects = TREE_SIDE_EFFECTS (t); | |
3809 | ||
3810 | PROCESS_ARG(0); | |
3811 | PROCESS_ARG(1); | |
3812 | PROCESS_ARG(2); | |
3813 | PROCESS_ARG(3); | |
3814 | PROCESS_ARG(4); | |
3815 | PROCESS_ARG(5); | |
ac182688 ZD |
3816 | |
3817 | TREE_SIDE_EFFECTS (t) = side_effects; | |
3818 | TREE_THIS_VOLATILE (t) = 0; | |
3819 | ||
3820 | return t; | |
3821 | } | |
3822 | ||
c6a1db6c RS |
3823 | /* Similar except don't specify the TREE_TYPE |
3824 | and leave the TREE_SIDE_EFFECTS as 0. | |
3825 | It is permissible for arguments to be null, | |
3826 | or even garbage if their values do not matter. */ | |
3827 | ||
3828 | tree | |
e34d07f2 | 3829 | build_nt (enum tree_code code, ...) |
c6a1db6c | 3830 | { |
b3694847 SS |
3831 | tree t; |
3832 | int length; | |
3833 | int i; | |
e34d07f2 | 3834 | va_list p; |
c6a1db6c | 3835 | |
5039610b SL |
3836 | gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp); |
3837 | ||
e34d07f2 | 3838 | va_start (p, code); |
ba63ed56 | 3839 | |
c6a1db6c | 3840 | t = make_node (code); |
8d5e6e25 | 3841 | length = TREE_CODE_LENGTH (code); |
c6a1db6c RS |
3842 | |
3843 | for (i = 0; i < length; i++) | |
3844 | TREE_OPERAND (t, i) = va_arg (p, tree); | |
3845 | ||
e34d07f2 | 3846 | va_end (p); |
c6a1db6c RS |
3847 | return t; |
3848 | } | |
5039610b SL |
3849 | |
3850 | /* Similar to build_nt, but for creating a CALL_EXPR object with | |
3851 | ARGLIST passed as a list. */ | |
3852 | ||
3853 | tree | |
3854 | build_nt_call_list (tree fn, tree arglist) | |
3855 | { | |
3856 | tree t; | |
3857 | int i; | |
3858 | ||
3859 | t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3); | |
3860 | CALL_EXPR_FN (t) = fn; | |
3861 | CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE; | |
3862 | for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++) | |
3863 | CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist); | |
3864 | return t; | |
3865 | } | |
c166b898 ILT |
3866 | |
3867 | /* Similar to build_nt, but for creating a CALL_EXPR object with a | |
3868 | tree VEC. */ | |
3869 | ||
3870 | tree | |
3871 | build_nt_call_vec (tree fn, VEC(tree,gc) *args) | |
3872 | { | |
3873 | tree ret, t; | |
3874 | unsigned int ix; | |
3875 | ||
3876 | ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3); | |
3877 | CALL_EXPR_FN (ret) = fn; | |
3878 | CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE; | |
3879 | for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix) | |
3880 | CALL_EXPR_ARG (ret, ix) = t; | |
3881 | return ret; | |
3882 | } | |
c6a1db6c RS |
3883 | \f |
3884 | /* Create a DECL_... node of code CODE, name NAME and data type TYPE. | |
3885 | We do NOT enter this node in any sort of symbol table. | |
3886 | ||
c2255bc4 AH |
3887 | LOC is the location of the decl. |
3888 | ||
c6a1db6c RS |
3889 | layout_decl is used to set up the decl's storage layout. |
3890 | Other slots are initialized to 0 or null pointers. */ | |
3891 | ||
3892 | tree | |
c2255bc4 AH |
3893 | build_decl_stat (location_t loc, enum tree_code code, tree name, |
3894 | tree type MEM_STAT_DECL) | |
c6a1db6c | 3895 | { |
b3694847 | 3896 | tree t; |
c6a1db6c | 3897 | |
b9dcdee4 | 3898 | t = make_node_stat (code PASS_MEM_STAT); |
c2255bc4 | 3899 | DECL_SOURCE_LOCATION (t) = loc; |
c6a1db6c RS |
3900 | |
3901 | /* if (type == error_mark_node) | |
3902 | type = integer_type_node; */ | |
3903 | /* That is not done, deliberately, so that having error_mark_node | |
3904 | as the type can suppress useless errors in the use of this variable. */ | |
3905 | ||
3906 | DECL_NAME (t) = name; | |
c6a1db6c RS |
3907 | TREE_TYPE (t) = type; |
3908 | ||
3909 | if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL) | |
3910 | layout_decl (t, 0); | |
9f63daea | 3911 | |
c6a1db6c RS |
3912 | return t; |
3913 | } | |
9885da8e ZD |
3914 | |
3915 | /* Builds and returns function declaration with NAME and TYPE. */ | |
3916 | ||
3917 | tree | |
3918 | build_fn_decl (const char *name, tree type) | |
3919 | { | |
3920 | tree id = get_identifier (name); | |
c2255bc4 | 3921 | tree decl = build_decl (input_location, FUNCTION_DECL, id, type); |
9885da8e ZD |
3922 | |
3923 | DECL_EXTERNAL (decl) = 1; | |
3924 | TREE_PUBLIC (decl) = 1; | |
3925 | DECL_ARTIFICIAL (decl) = 1; | |
3926 | TREE_NOTHROW (decl) = 1; | |
3927 | ||
3928 | return decl; | |
3929 | } | |
3930 | ||
c6a1db6c RS |
3931 | \f |
3932 | /* BLOCK nodes are used to represent the structure of binding contours | |
3933 | and declarations, once those contours have been exited and their contents | |
52d2830e | 3934 | compiled. This information is used for outputting debugging info. */ |
c6a1db6c RS |
3935 | |
3936 | tree | |
22e8617b | 3937 | build_block (tree vars, tree subblocks, tree supercontext, tree chain) |
c6a1db6c | 3938 | { |
b3694847 | 3939 | tree block = make_node (BLOCK); |
d4b60170 | 3940 | |
c6a1db6c | 3941 | BLOCK_VARS (block) = vars; |
c6a1db6c RS |
3942 | BLOCK_SUBBLOCKS (block) = subblocks; |
3943 | BLOCK_SUPERCONTEXT (block) = supercontext; | |
3944 | BLOCK_CHAIN (block) = chain; | |
3945 | return block; | |
3946 | } | |
bf1e5319 | 3947 | |
c1667470 PB |
3948 | expanded_location |
3949 | expand_location (source_location loc) | |
3950 | { | |
3951 | expanded_location xloc; | |
96c169e1 | 3952 | if (loc <= BUILTINS_LOCATION) |
428aba16 | 3953 | { |
96c169e1 | 3954 | xloc.file = loc == UNKNOWN_LOCATION ? NULL : _("<built-in>"); |
428aba16 RS |
3955 | xloc.line = 0; |
3956 | xloc.column = 0; | |
aa14403d | 3957 | xloc.sysp = 0; |
428aba16 | 3958 | } |
c1667470 PB |
3959 | else |
3960 | { | |
5ffeb913 | 3961 | const struct line_map *map = linemap_lookup (line_table, loc); |
c1667470 PB |
3962 | xloc.file = map->to_file; |
3963 | xloc.line = SOURCE_LINE (map, loc); | |
aa3c6dc1 | 3964 | xloc.column = SOURCE_COLUMN (map, loc); |
aa14403d | 3965 | xloc.sysp = map->sysp != 0; |
c1667470 PB |
3966 | }; |
3967 | return xloc; | |
3968 | } | |
3969 | ||
c6a1db6c | 3970 | \f |
6a3799eb AH |
3971 | /* Like SET_EXPR_LOCATION, but make sure the tree can have a location. |
3972 | ||
3973 | LOC is the location to use in tree T. */ | |
3974 | ||
9db4cdd3 EB |
3975 | void |
3976 | protected_set_expr_location (tree t, location_t loc) | |
6a3799eb | 3977 | { |
6847a754 | 3978 | if (t && CAN_HAVE_LOCATION_P (t)) |
6a3799eb AH |
3979 | SET_EXPR_LOCATION (t, loc); |
3980 | } | |
07beea0d | 3981 | \f |
91d231cb | 3982 | /* Return a declaration like DDECL except that its DECL_ATTRIBUTES |
0f41302f | 3983 | is ATTRIBUTE. */ |
1a2927d2 RK |
3984 | |
3985 | tree | |
46c5ad27 | 3986 | build_decl_attribute_variant (tree ddecl, tree attribute) |
1a2927d2 | 3987 | { |
91d231cb | 3988 | DECL_ATTRIBUTES (ddecl) = attribute; |
1a2927d2 RK |
3989 | return ddecl; |
3990 | } | |
3991 | ||
caf29de7 JH |
3992 | /* Borrowed from hashtab.c iterative_hash implementation. */ |
3993 | #define mix(a,b,c) \ | |
3994 | { \ | |
3995 | a -= b; a -= c; a ^= (c>>13); \ | |
3996 | b -= c; b -= a; b ^= (a<< 8); \ | |
3997 | c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \ | |
3998 | a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \ | |
3999 | b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \ | |
4000 | c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \ | |
4001 | a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \ | |
4002 | b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \ | |
4003 | c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \ | |
4004 | } | |
4005 | ||
4006 | ||
4007 | /* Produce good hash value combining VAL and VAL2. */ | |
c9145754 | 4008 | hashval_t |
caf29de7 JH |
4009 | iterative_hash_hashval_t (hashval_t val, hashval_t val2) |
4010 | { | |
4011 | /* the golden ratio; an arbitrary value. */ | |
4012 | hashval_t a = 0x9e3779b9; | |
4013 | ||
4014 | mix (a, val, val2); | |
4015 | return val2; | |
4016 | } | |
4017 | ||
caf29de7 | 4018 | /* Produce good hash value combining VAL and VAL2. */ |
8bc88f25 | 4019 | hashval_t |
caf29de7 JH |
4020 | iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2) |
4021 | { | |
4022 | if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t)) | |
4023 | return iterative_hash_hashval_t (val, val2); | |
4024 | else | |
4025 | { | |
4026 | hashval_t a = (hashval_t) val; | |
4027 | /* Avoid warnings about shifting of more than the width of the type on | |
4028 | hosts that won't execute this path. */ | |
4029 | int zero = 0; | |
4030 | hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero)); | |
4031 | mix (a, b, val2); | |
4032 | if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t)) | |
4033 | { | |
4034 | hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero)); | |
4035 | hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero)); | |
4036 | mix (a, b, val2); | |
4037 | } | |
4038 | return val2; | |
4039 | } | |
4040 | } | |
4041 | ||
91e97eb8 | 4042 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTE |
ca58211b | 4043 | is ATTRIBUTE and its qualifiers are QUALS. |
91e97eb8 | 4044 | |
f8a89236 | 4045 | Record such modified types already made so we don't make duplicates. */ |
91e97eb8 | 4046 | |
040c6d51 | 4047 | tree |
ca58211b | 4048 | build_type_attribute_qual_variant (tree ttype, tree attribute, int quals) |
91e97eb8 | 4049 | { |
3b03c671 | 4050 | if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute)) |
91e97eb8 | 4051 | { |
fd917e0d | 4052 | hashval_t hashcode = 0; |
91e97eb8 | 4053 | tree ntype; |
fd917e0d | 4054 | enum tree_code code = TREE_CODE (ttype); |
91e97eb8 | 4055 | |
4009f2e7 JM |
4056 | /* Building a distinct copy of a tagged type is inappropriate; it |
4057 | causes breakage in code that expects there to be a one-to-one | |
4058 | relationship between a struct and its fields. | |
4059 | build_duplicate_type is another solution (as used in | |
4060 | handle_transparent_union_attribute), but that doesn't play well | |
4061 | with the stronger C++ type identity model. */ | |
4062 | if (TREE_CODE (ttype) == RECORD_TYPE | |
4063 | || TREE_CODE (ttype) == UNION_TYPE | |
4064 | || TREE_CODE (ttype) == QUAL_UNION_TYPE | |
4065 | || TREE_CODE (ttype) == ENUMERAL_TYPE) | |
4066 | { | |
4067 | warning (OPT_Wattributes, | |
4068 | "ignoring attributes applied to %qT after definition", | |
4069 | TYPE_MAIN_VARIANT (ttype)); | |
4070 | return build_qualified_type (ttype, quals); | |
4071 | } | |
91e97eb8 | 4072 | |
9c880618 | 4073 | ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED); |
4009f2e7 | 4074 | ntype = build_distinct_type_copy (ttype); |
91e97eb8 | 4075 | |
4009f2e7 | 4076 | TYPE_ATTRIBUTES (ntype) = attribute; |
91e97eb8 | 4077 | |
fd917e0d JM |
4078 | hashcode = iterative_hash_object (code, hashcode); |
4079 | if (TREE_TYPE (ntype)) | |
4080 | hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)), | |
4081 | hashcode); | |
4082 | hashcode = attribute_hash_list (attribute, hashcode); | |
91e97eb8 RK |
4083 | |
4084 | switch (TREE_CODE (ntype)) | |
dc478a5d | 4085 | { |
e9a25f70 | 4086 | case FUNCTION_TYPE: |
fd917e0d | 4087 | hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode); |
e9a25f70 JL |
4088 | break; |
4089 | case ARRAY_TYPE: | |
2ae7b972 RH |
4090 | if (TYPE_DOMAIN (ntype)) |
4091 | hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)), | |
4092 | hashcode); | |
e9a25f70 JL |
4093 | break; |
4094 | case INTEGER_TYPE: | |
fd917e0d JM |
4095 | hashcode = iterative_hash_object |
4096 | (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode); | |
4097 | hashcode = iterative_hash_object | |
4098 | (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode); | |
e9a25f70 JL |
4099 | break; |
4100 | case REAL_TYPE: | |
325217ed | 4101 | case FIXED_POINT_TYPE: |
fd917e0d JM |
4102 | { |
4103 | unsigned int precision = TYPE_PRECISION (ntype); | |
4104 | hashcode = iterative_hash_object (precision, hashcode); | |
4105 | } | |
e9a25f70 JL |
4106 | break; |
4107 | default: | |
4108 | break; | |
dc478a5d | 4109 | } |
91e97eb8 RK |
4110 | |
4111 | ntype = type_hash_canon (hashcode, ntype); | |
06d40de8 DG |
4112 | |
4113 | /* If the target-dependent attributes make NTYPE different from | |
4114 | its canonical type, we will need to use structural equality | |
9c880618 | 4115 | checks for this type. */ |
31fa4998 DG |
4116 | if (TYPE_STRUCTURAL_EQUALITY_P (ttype) |
4117 | || !targetm.comp_type_attributes (ntype, ttype)) | |
06d40de8 | 4118 | SET_TYPE_STRUCTURAL_EQUALITY (ntype); |
9c880618 | 4119 | else if (TYPE_CANONICAL (ntype) == ntype) |
31fa4998 | 4120 | TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype); |
06d40de8 | 4121 | |
ca58211b | 4122 | ttype = build_qualified_type (ntype, quals); |
91e97eb8 | 4123 | } |
42a89d2d JJ |
4124 | else if (TYPE_QUALS (ttype) != quals) |
4125 | ttype = build_qualified_type (ttype, quals); | |
91e97eb8 RK |
4126 | |
4127 | return ttype; | |
4128 | } | |
1a2927d2 | 4129 | |
e5410ba7 | 4130 | |
ca58211b PB |
4131 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTE |
4132 | is ATTRIBUTE. | |
4133 | ||
4134 | Record such modified types already made so we don't make duplicates. */ | |
4135 | ||
4136 | tree | |
4137 | build_type_attribute_variant (tree ttype, tree attribute) | |
4138 | { | |
4139 | return build_type_attribute_qual_variant (ttype, attribute, | |
4140 | TYPE_QUALS (ttype)); | |
4141 | } | |
4142 | ||
d7f09764 DN |
4143 | |
4144 | /* Reset all the fields in a binfo node BINFO. We only keep | |
4145 | BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */ | |
4146 | ||
4147 | static void | |
4148 | free_lang_data_in_binfo (tree binfo) | |
4149 | { | |
4150 | unsigned i; | |
4151 | tree t; | |
4152 | ||
4153 | gcc_assert (TREE_CODE (binfo) == TREE_BINFO); | |
4154 | ||
4155 | BINFO_OFFSET (binfo) = NULL_TREE; | |
4156 | BINFO_VTABLE (binfo) = NULL_TREE; | |
4157 | BINFO_VPTR_FIELD (binfo) = NULL_TREE; | |
4158 | BINFO_BASE_ACCESSES (binfo) = NULL; | |
4159 | BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE; | |
4160 | BINFO_SUBVTT_INDEX (binfo) = NULL_TREE; | |
4161 | BINFO_VPTR_FIELD (binfo) = NULL_TREE; | |
4162 | ||
4163 | for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++) | |
4164 | free_lang_data_in_binfo (t); | |
4165 | } | |
4166 | ||
4167 | ||
4537ec0c DN |
4168 | /* Reset all language specific information still present in TYPE. */ |
4169 | ||
4170 | static void | |
4171 | free_lang_data_in_type (tree type) | |
4172 | { | |
4173 | gcc_assert (TYPE_P (type)); | |
4174 | ||
4537ec0c DN |
4175 | /* Give the FE a chance to remove its own data first. */ |
4176 | lang_hooks.free_lang_data (type); | |
4177 | ||
4178 | TREE_LANG_FLAG_0 (type) = 0; | |
4179 | TREE_LANG_FLAG_1 (type) = 0; | |
4180 | TREE_LANG_FLAG_2 (type) = 0; | |
4181 | TREE_LANG_FLAG_3 (type) = 0; | |
4182 | TREE_LANG_FLAG_4 (type) = 0; | |
4183 | TREE_LANG_FLAG_5 (type) = 0; | |
4184 | TREE_LANG_FLAG_6 (type) = 0; | |
4185 | ||
4186 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
4187 | { | |
4188 | /* Remove the const and volatile qualifiers from arguments. The | |
4189 | C++ front end removes them, but the C front end does not, | |
4190 | leading to false ODR violation errors when merging two | |
4191 | instances of the same function signature compiled by | |
4192 | different front ends. */ | |
4193 | tree p; | |
4194 | ||
4195 | for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p)) | |
4196 | { | |
4197 | tree arg_type = TREE_VALUE (p); | |
4198 | ||
4199 | if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type)) | |
4200 | { | |
4201 | int quals = TYPE_QUALS (arg_type) | |
4202 | & ~TYPE_QUAL_CONST | |
4203 | & ~TYPE_QUAL_VOLATILE; | |
4204 | TREE_VALUE (p) = build_qualified_type (arg_type, quals); | |
4205 | free_lang_data_in_type (TREE_VALUE (p)); | |
4206 | } | |
4207 | } | |
4208 | } | |
b8698a0f | 4209 | |
4537ec0c DN |
4210 | /* Remove members that are not actually FIELD_DECLs from the field |
4211 | list of an aggregate. These occur in C++. */ | |
d7f09764 | 4212 | if (RECORD_OR_UNION_TYPE_P (type)) |
4537ec0c DN |
4213 | { |
4214 | tree prev, member; | |
4215 | ||
4216 | /* Note that TYPE_FIELDS can be shared across distinct | |
4217 | TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is | |
4218 | to be removed, we cannot set its TREE_CHAIN to NULL. | |
4219 | Otherwise, we would not be able to find all the other fields | |
4220 | in the other instances of this TREE_TYPE. | |
b8698a0f | 4221 | |
4537ec0c DN |
4222 | This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */ |
4223 | prev = NULL_TREE; | |
4224 | member = TYPE_FIELDS (type); | |
4225 | while (member) | |
4226 | { | |
4227 | if (TREE_CODE (member) == FIELD_DECL) | |
4228 | { | |
4229 | if (prev) | |
4230 | TREE_CHAIN (prev) = member; | |
4231 | else | |
4232 | TYPE_FIELDS (type) = member; | |
4233 | prev = member; | |
4234 | } | |
4235 | ||
4236 | member = TREE_CHAIN (member); | |
4237 | } | |
4238 | ||
4239 | if (prev) | |
4240 | TREE_CHAIN (prev) = NULL_TREE; | |
4241 | else | |
4242 | TYPE_FIELDS (type) = NULL_TREE; | |
4243 | ||
4244 | TYPE_METHODS (type) = NULL_TREE; | |
4245 | if (TYPE_BINFO (type)) | |
d7f09764 | 4246 | free_lang_data_in_binfo (TYPE_BINFO (type)); |
4537ec0c DN |
4247 | } |
4248 | else | |
4249 | { | |
4250 | /* For non-aggregate types, clear out the language slot (which | |
4251 | overloads TYPE_BINFO). */ | |
4252 | TYPE_LANG_SLOT_1 (type) = NULL_TREE; | |
4253 | } | |
4254 | ||
4255 | TYPE_CONTEXT (type) = NULL_TREE; | |
4256 | TYPE_STUB_DECL (type) = NULL_TREE; | |
4537ec0c DN |
4257 | } |
4258 | ||
4259 | ||
4260 | /* Return true if DECL may need an assembler name to be set. */ | |
4261 | ||
4262 | static inline bool | |
4263 | need_assembler_name_p (tree decl) | |
4264 | { | |
4265 | /* Only FUNCTION_DECLs and VAR_DECLs are considered. */ | |
4266 | if (TREE_CODE (decl) != FUNCTION_DECL | |
4267 | && TREE_CODE (decl) != VAR_DECL) | |
4268 | return false; | |
4269 | ||
4270 | /* If DECL already has its assembler name set, it does not need a | |
4271 | new one. */ | |
4272 | if (!HAS_DECL_ASSEMBLER_NAME_P (decl) | |
4273 | || DECL_ASSEMBLER_NAME_SET_P (decl)) | |
4274 | return false; | |
4275 | ||
4276 | /* For VAR_DECLs, only static, public and external symbols need an | |
4277 | assembler name. */ | |
4278 | if (TREE_CODE (decl) == VAR_DECL | |
4279 | && !TREE_STATIC (decl) | |
4280 | && !TREE_PUBLIC (decl) | |
4281 | && !DECL_EXTERNAL (decl)) | |
4282 | return false; | |
4283 | ||
d7f09764 DN |
4284 | if (TREE_CODE (decl) == FUNCTION_DECL) |
4285 | { | |
4286 | /* Do not set assembler name on builtins. Allow RTL expansion to | |
4287 | decide whether to expand inline or via a regular call. */ | |
4288 | if (DECL_BUILT_IN (decl) | |
4289 | && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND) | |
4290 | return false; | |
4537ec0c | 4291 | |
d7f09764 | 4292 | /* Functions represented in the callgraph need an assembler name. */ |
986ad133 | 4293 | if (cgraph_get_node (decl) != NULL) |
d7f09764 DN |
4294 | return true; |
4295 | ||
4296 | /* Unused and not public functions don't need an assembler name. */ | |
4297 | if (!TREE_USED (decl) && !TREE_PUBLIC (decl)) | |
4298 | return false; | |
4299 | } | |
4537ec0c DN |
4300 | |
4301 | return true; | |
4302 | } | |
4303 | ||
4304 | ||
4305 | /* Remove all the non-variable decls from BLOCK. LOCALS is the set of | |
4306 | variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl | |
4307 | in BLOCK that is not in LOCALS is removed. */ | |
4308 | ||
4309 | static void | |
4310 | free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals) | |
4311 | { | |
4312 | tree *tp, t; | |
4313 | ||
4314 | tp = &BLOCK_VARS (block); | |
4315 | while (*tp) | |
4316 | { | |
4317 | if (!pointer_set_contains (locals, *tp)) | |
4318 | *tp = TREE_CHAIN (*tp); | |
4319 | else | |
4320 | tp = &TREE_CHAIN (*tp); | |
4321 | } | |
4322 | ||
4323 | for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t)) | |
4324 | free_lang_data_in_block (fn, t, locals); | |
4325 | } | |
4326 | ||
4327 | ||
4328 | /* Reset all language specific information still present in symbol | |
4329 | DECL. */ | |
4330 | ||
4331 | static void | |
4332 | free_lang_data_in_decl (tree decl) | |
4333 | { | |
4334 | gcc_assert (DECL_P (decl)); | |
4335 | ||
4336 | /* Give the FE a chance to remove its own data first. */ | |
4337 | lang_hooks.free_lang_data (decl); | |
4338 | ||
4339 | TREE_LANG_FLAG_0 (decl) = 0; | |
4340 | TREE_LANG_FLAG_1 (decl) = 0; | |
4341 | TREE_LANG_FLAG_2 (decl) = 0; | |
4342 | TREE_LANG_FLAG_3 (decl) = 0; | |
4343 | TREE_LANG_FLAG_4 (decl) = 0; | |
4344 | TREE_LANG_FLAG_5 (decl) = 0; | |
4345 | TREE_LANG_FLAG_6 (decl) = 0; | |
4346 | ||
4347 | /* Identifiers need not have a type. */ | |
4348 | if (DECL_NAME (decl)) | |
4349 | TREE_TYPE (DECL_NAME (decl)) = NULL_TREE; | |
4350 | ||
4537ec0c DN |
4351 | /* Ignore any intervening types, because we are going to clear their |
4352 | TYPE_CONTEXT fields. */ | |
4353 | if (TREE_CODE (decl) != FIELD_DECL) | |
4354 | DECL_CONTEXT (decl) = decl_function_context (decl); | |
4355 | ||
4356 | if (DECL_CONTEXT (decl) | |
4357 | && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL) | |
4358 | DECL_CONTEXT (decl) = NULL_TREE; | |
4359 | ||
4360 | if (TREE_CODE (decl) == VAR_DECL) | |
4361 | { | |
4362 | tree context = DECL_CONTEXT (decl); | |
4363 | ||
4364 | if (context) | |
4365 | { | |
4366 | enum tree_code code = TREE_CODE (context); | |
4367 | if (code == FUNCTION_DECL && DECL_ABSTRACT (context)) | |
4368 | { | |
4369 | /* Do not clear the decl context here, that will promote | |
4370 | all vars to global ones. */ | |
4371 | DECL_INITIAL (decl) = NULL_TREE; | |
4372 | } | |
4373 | ||
4374 | if (TREE_STATIC (decl)) | |
4375 | DECL_CONTEXT (decl) = NULL_TREE; | |
4376 | } | |
4377 | } | |
4378 | ||
4379 | if (TREE_CODE (decl) == PARM_DECL | |
4380 | || TREE_CODE (decl) == FIELD_DECL | |
4381 | || TREE_CODE (decl) == RESULT_DECL) | |
4382 | { | |
4383 | tree unit_size = DECL_SIZE_UNIT (decl); | |
4384 | tree size = DECL_SIZE (decl); | |
4385 | if ((unit_size && TREE_CODE (unit_size) != INTEGER_CST) | |
4386 | || (size && TREE_CODE (size) != INTEGER_CST)) | |
4387 | { | |
4388 | DECL_SIZE_UNIT (decl) = NULL_TREE; | |
4389 | DECL_SIZE (decl) = NULL_TREE; | |
4390 | } | |
4391 | ||
4392 | if (TREE_CODE (decl) == FIELD_DECL | |
4393 | && DECL_FIELD_OFFSET (decl) | |
4394 | && TREE_CODE (DECL_FIELD_OFFSET (decl)) != INTEGER_CST) | |
4395 | DECL_FIELD_OFFSET (decl) = NULL_TREE; | |
23503efc RG |
4396 | |
4397 | /* DECL_FCONTEXT is only used for debug info generation. */ | |
4398 | if (TREE_CODE (decl) == FIELD_DECL) | |
4399 | DECL_FCONTEXT (decl) = NULL_TREE; | |
4537ec0c DN |
4400 | } |
4401 | else if (TREE_CODE (decl) == FUNCTION_DECL) | |
4402 | { | |
4403 | if (gimple_has_body_p (decl)) | |
4404 | { | |
4405 | tree t; | |
4406 | struct pointer_set_t *locals; | |
4407 | ||
4408 | /* If DECL has a gimple body, then the context for its | |
4409 | arguments must be DECL. Otherwise, it doesn't really | |
4410 | matter, as we will not be emitting any code for DECL. In | |
4411 | general, there may be other instances of DECL created by | |
4412 | the front end and since PARM_DECLs are generally shared, | |
4413 | their DECL_CONTEXT changes as the replicas of DECL are | |
4414 | created. The only time where DECL_CONTEXT is important | |
4415 | is for the FUNCTION_DECLs that have a gimple body (since | |
4416 | the PARM_DECL will be used in the function's body). */ | |
4417 | for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t)) | |
4418 | DECL_CONTEXT (t) = decl; | |
4419 | ||
4420 | /* Collect all the symbols declared in DECL. */ | |
4421 | locals = pointer_set_create (); | |
4422 | t = DECL_STRUCT_FUNCTION (decl)->local_decls; | |
4423 | for (; t; t = TREE_CHAIN (t)) | |
4424 | { | |
4425 | pointer_set_insert (locals, TREE_VALUE (t)); | |
4426 | ||
4427 | /* All the local symbols should have DECL as their | |
4428 | context. */ | |
4429 | DECL_CONTEXT (TREE_VALUE (t)) = decl; | |
4430 | } | |
4431 | ||
4432 | /* Get rid of any decl not in local_decls. */ | |
4433 | free_lang_data_in_block (decl, DECL_INITIAL (decl), locals); | |
4434 | ||
4435 | pointer_set_destroy (locals); | |
4436 | } | |
4437 | ||
4438 | /* DECL_SAVED_TREE holds the GENERIC representation for DECL. | |
4439 | At this point, it is not needed anymore. */ | |
4440 | DECL_SAVED_TREE (decl) = NULL_TREE; | |
4441 | } | |
4442 | else if (TREE_CODE (decl) == VAR_DECL) | |
4443 | { | |
4444 | tree expr = DECL_DEBUG_EXPR (decl); | |
4445 | if (expr | |
4446 | && TREE_CODE (expr) == VAR_DECL | |
4447 | && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr)) | |
4448 | SET_DECL_DEBUG_EXPR (decl, NULL_TREE); | |
4449 | ||
6728ee79 MM |
4450 | if (DECL_EXTERNAL (decl) |
4451 | && (!TREE_STATIC (decl) || !TREE_READONLY (decl))) | |
4537ec0c DN |
4452 | DECL_INITIAL (decl) = NULL_TREE; |
4453 | } | |
4454 | else if (TREE_CODE (decl) == TYPE_DECL) | |
4455 | { | |
4456 | DECL_INITIAL (decl) = NULL_TREE; | |
b8698a0f | 4457 | |
4537ec0c DN |
4458 | /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for |
4459 | FIELD_DECLs, which should be preserved. Otherwise, | |
4460 | we shouldn't be concerned with source-level lexical | |
4461 | nesting beyond this point. */ | |
4462 | DECL_CONTEXT (decl) = NULL_TREE; | |
4463 | } | |
4464 | } | |
4465 | ||
4466 | ||
4467 | /* Data used when collecting DECLs and TYPEs for language data removal. */ | |
4468 | ||
4469 | struct free_lang_data_d | |
4470 | { | |
c7a3980a RG |
4471 | /* Worklist to avoid excessive recursion. */ |
4472 | VEC(tree,heap) *worklist; | |
4473 | ||
4537ec0c DN |
4474 | /* Set of traversed objects. Used to avoid duplicate visits. */ |
4475 | struct pointer_set_t *pset; | |
4476 | ||
4477 | /* Array of symbols to process with free_lang_data_in_decl. */ | |
4478 | VEC(tree,heap) *decls; | |
4479 | ||
4480 | /* Array of types to process with free_lang_data_in_type. */ | |
4481 | VEC(tree,heap) *types; | |
4482 | }; | |
4483 | ||
4484 | ||
4485 | /* Save all language fields needed to generate proper debug information | |
4486 | for DECL. This saves most fields cleared out by free_lang_data_in_decl. */ | |
4487 | ||
4488 | static void | |
4489 | save_debug_info_for_decl (tree t) | |
4490 | { | |
4491 | /*struct saved_debug_info_d *sdi;*/ | |
4492 | ||
4493 | gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t)); | |
4494 | ||
4495 | /* FIXME. Partial implementation for saving debug info removed. */ | |
4496 | } | |
4497 | ||
4498 | ||
4499 | /* Save all language fields needed to generate proper debug information | |
4500 | for TYPE. This saves most fields cleared out by free_lang_data_in_type. */ | |
4501 | ||
4502 | static void | |
4503 | save_debug_info_for_type (tree t) | |
4504 | { | |
4505 | /*struct saved_debug_info_d *sdi;*/ | |
4506 | ||
4507 | gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t)); | |
4508 | ||
4509 | /* FIXME. Partial implementation for saving debug info removed. */ | |
4510 | } | |
4511 | ||
4512 | ||
4513 | /* Add type or decl T to one of the list of tree nodes that need their | |
4514 | language data removed. The lists are held inside FLD. */ | |
4515 | ||
4516 | static void | |
4517 | add_tree_to_fld_list (tree t, struct free_lang_data_d *fld) | |
4518 | { | |
4519 | if (DECL_P (t)) | |
4520 | { | |
4521 | VEC_safe_push (tree, heap, fld->decls, t); | |
4522 | if (debug_info_level > DINFO_LEVEL_TERSE) | |
4523 | save_debug_info_for_decl (t); | |
4524 | } | |
4525 | else if (TYPE_P (t)) | |
4526 | { | |
4527 | VEC_safe_push (tree, heap, fld->types, t); | |
4528 | if (debug_info_level > DINFO_LEVEL_TERSE) | |
4529 | save_debug_info_for_type (t); | |
4530 | } | |
4531 | else | |
4532 | gcc_unreachable (); | |
4533 | } | |
4534 | ||
d7f09764 DN |
4535 | /* Push tree node T into FLD->WORKLIST. */ |
4536 | ||
4537 | static inline void | |
4538 | fld_worklist_push (tree t, struct free_lang_data_d *fld) | |
4539 | { | |
4540 | if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t)) | |
4541 | VEC_safe_push (tree, heap, fld->worklist, (t)); | |
4542 | } | |
4543 | ||
4537ec0c DN |
4544 | |
4545 | /* Operand callback helper for free_lang_data_in_node. *TP is the | |
4546 | subtree operand being considered. */ | |
4547 | ||
4548 | static tree | |
d7f09764 | 4549 | find_decls_types_r (tree *tp, int *ws, void *data) |
4537ec0c DN |
4550 | { |
4551 | tree t = *tp; | |
4552 | struct free_lang_data_d *fld = (struct free_lang_data_d *) data; | |
4553 | ||
c7a3980a RG |
4554 | if (TREE_CODE (t) == TREE_LIST) |
4555 | return NULL_TREE; | |
4556 | ||
d7f09764 DN |
4557 | /* Language specific nodes will be removed, so there is no need |
4558 | to gather anything under them. */ | |
4559 | if (is_lang_specific (t)) | |
4560 | { | |
4561 | *ws = 0; | |
4562 | return NULL_TREE; | |
4563 | } | |
4564 | ||
4537ec0c DN |
4565 | if (DECL_P (t)) |
4566 | { | |
4567 | /* Note that walk_tree does not traverse every possible field in | |
4568 | decls, so we have to do our own traversals here. */ | |
4569 | add_tree_to_fld_list (t, fld); | |
4570 | ||
d7f09764 DN |
4571 | fld_worklist_push (DECL_NAME (t), fld); |
4572 | fld_worklist_push (DECL_CONTEXT (t), fld); | |
4573 | fld_worklist_push (DECL_SIZE (t), fld); | |
4574 | fld_worklist_push (DECL_SIZE_UNIT (t), fld); | |
4575 | ||
4576 | /* We are going to remove everything under DECL_INITIAL for | |
4577 | TYPE_DECLs. No point walking them. */ | |
4578 | if (TREE_CODE (t) != TYPE_DECL) | |
4579 | fld_worklist_push (DECL_INITIAL (t), fld); | |
4580 | ||
4581 | fld_worklist_push (DECL_ATTRIBUTES (t), fld); | |
4582 | fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld); | |
4537ec0c DN |
4583 | |
4584 | if (TREE_CODE (t) == FUNCTION_DECL) | |
4585 | { | |
d7f09764 DN |
4586 | fld_worklist_push (DECL_ARGUMENTS (t), fld); |
4587 | fld_worklist_push (DECL_RESULT (t), fld); | |
4537ec0c DN |
4588 | } |
4589 | else if (TREE_CODE (t) == TYPE_DECL) | |
4590 | { | |
d7f09764 DN |
4591 | fld_worklist_push (DECL_ARGUMENT_FLD (t), fld); |
4592 | fld_worklist_push (DECL_VINDEX (t), fld); | |
4537ec0c DN |
4593 | } |
4594 | else if (TREE_CODE (t) == FIELD_DECL) | |
4595 | { | |
d7f09764 DN |
4596 | fld_worklist_push (DECL_FIELD_OFFSET (t), fld); |
4597 | fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld); | |
4598 | fld_worklist_push (DECL_QUALIFIER (t), fld); | |
4599 | fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld); | |
4600 | fld_worklist_push (DECL_FCONTEXT (t), fld); | |
4537ec0c DN |
4601 | } |
4602 | else if (TREE_CODE (t) == VAR_DECL) | |
4603 | { | |
d7f09764 DN |
4604 | fld_worklist_push (DECL_SECTION_NAME (t), fld); |
4605 | fld_worklist_push (DECL_COMDAT_GROUP (t), fld); | |
4537ec0c | 4606 | } |
c7a3980a | 4607 | |
d7f09764 DN |
4608 | if (TREE_CODE (t) != FIELD_DECL) |
4609 | fld_worklist_push (TREE_CHAIN (t), fld); | |
c7a3980a | 4610 | *ws = 0; |
4537ec0c DN |
4611 | } |
4612 | else if (TYPE_P (t)) | |
4613 | { | |
4614 | /* Note that walk_tree does not traverse every possible field in | |
4615 | types, so we have to do our own traversals here. */ | |
4616 | add_tree_to_fld_list (t, fld); | |
4617 | ||
d7f09764 DN |
4618 | if (!RECORD_OR_UNION_TYPE_P (t)) |
4619 | fld_worklist_push (TYPE_CACHED_VALUES (t), fld); | |
4620 | fld_worklist_push (TYPE_SIZE (t), fld); | |
4621 | fld_worklist_push (TYPE_SIZE_UNIT (t), fld); | |
4622 | fld_worklist_push (TYPE_ATTRIBUTES (t), fld); | |
4623 | fld_worklist_push (TYPE_POINTER_TO (t), fld); | |
4624 | fld_worklist_push (TYPE_REFERENCE_TO (t), fld); | |
4625 | fld_worklist_push (TYPE_NAME (t), fld); | |
4626 | fld_worklist_push (TYPE_MINVAL (t), fld); | |
4627 | if (!RECORD_OR_UNION_TYPE_P (t)) | |
4628 | fld_worklist_push (TYPE_MAXVAL (t), fld); | |
4629 | fld_worklist_push (TYPE_MAIN_VARIANT (t), fld); | |
4630 | fld_worklist_push (TYPE_NEXT_VARIANT (t), fld); | |
4631 | fld_worklist_push (TYPE_CONTEXT (t), fld); | |
4632 | fld_worklist_push (TYPE_CANONICAL (t), fld); | |
4633 | ||
4634 | if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t)) | |
c7a3980a RG |
4635 | { |
4636 | unsigned i; | |
4637 | tree tem; | |
4638 | for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)), | |
4639 | i, tem); ++i) | |
d7f09764 DN |
4640 | fld_worklist_push (TREE_TYPE (tem), fld); |
4641 | tem = BINFO_VIRTUALS (TYPE_BINFO (t)); | |
22dfb60e RG |
4642 | if (tem |
4643 | /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */ | |
4644 | && TREE_CODE (tem) == TREE_LIST) | |
4645 | do | |
4646 | { | |
4647 | fld_worklist_push (TREE_VALUE (tem), fld); | |
4648 | tem = TREE_CHAIN (tem); | |
4649 | } | |
4650 | while (tem); | |
d7f09764 DN |
4651 | } |
4652 | if (RECORD_OR_UNION_TYPE_P (t)) | |
4653 | { | |
4654 | tree tem; | |
4655 | /* Push all TYPE_FIELDS - there can be interleaving interesting | |
4656 | and non-interesting things. */ | |
4657 | tem = TYPE_FIELDS (t); | |
4658 | while (tem) | |
4659 | { | |
4660 | if (TREE_CODE (tem) == FIELD_DECL) | |
4661 | fld_worklist_push (tem, fld); | |
4662 | tem = TREE_CHAIN (tem); | |
4663 | } | |
c7a3980a | 4664 | } |
4537ec0c | 4665 | |
d7f09764 | 4666 | fld_worklist_push (TREE_CHAIN (t), fld); |
c7a3980a | 4667 | *ws = 0; |
4537ec0c DN |
4668 | } |
4669 | ||
d7f09764 | 4670 | fld_worklist_push (TREE_TYPE (t), fld); |
c7a3980a | 4671 | |
4537ec0c DN |
4672 | return NULL_TREE; |
4673 | } | |
4674 | ||
c7a3980a RG |
4675 | |
4676 | /* Find decls and types in T. */ | |
4677 | ||
4678 | static void | |
4679 | find_decls_types (tree t, struct free_lang_data_d *fld) | |
4680 | { | |
4681 | while (1) | |
4682 | { | |
4683 | if (!pointer_set_contains (fld->pset, t)) | |
4684 | walk_tree (&t, find_decls_types_r, fld, fld->pset); | |
4685 | if (VEC_empty (tree, fld->worklist)) | |
4686 | break; | |
4687 | t = VEC_pop (tree, fld->worklist); | |
4688 | } | |
4689 | } | |
4537ec0c DN |
4690 | |
4691 | /* Translate all the types in LIST with the corresponding runtime | |
4692 | types. */ | |
4693 | ||
4694 | static tree | |
4695 | get_eh_types_for_runtime (tree list) | |
4696 | { | |
4697 | tree head, prev; | |
4698 | ||
4699 | if (list == NULL_TREE) | |
4700 | return NULL_TREE; | |
4701 | ||
4702 | head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list))); | |
4703 | prev = head; | |
4704 | list = TREE_CHAIN (list); | |
4705 | while (list) | |
4706 | { | |
4707 | tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list))); | |
4708 | TREE_CHAIN (prev) = n; | |
4709 | prev = TREE_CHAIN (prev); | |
4710 | list = TREE_CHAIN (list); | |
4711 | } | |
4712 | ||
4713 | return head; | |
4714 | } | |
4715 | ||
4716 | ||
4717 | /* Find decls and types referenced in EH region R and store them in | |
4718 | FLD->DECLS and FLD->TYPES. */ | |
4719 | ||
4720 | static void | |
4721 | find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld) | |
4722 | { | |
1d65f45c | 4723 | switch (r->type) |
4537ec0c | 4724 | { |
1d65f45c RH |
4725 | case ERT_CLEANUP: |
4726 | break; | |
4727 | ||
4728 | case ERT_TRY: | |
4729 | { | |
4730 | eh_catch c; | |
4731 | ||
4732 | /* The types referenced in each catch must first be changed to the | |
4733 | EH types used at runtime. This removes references to FE types | |
4734 | in the region. */ | |
4735 | for (c = r->u.eh_try.first_catch; c ; c = c->next_catch) | |
4736 | { | |
4737 | c->type_list = get_eh_types_for_runtime (c->type_list); | |
4738 | walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset); | |
4739 | } | |
4740 | } | |
4741 | break; | |
4742 | ||
4743 | case ERT_ALLOWED_EXCEPTIONS: | |
4744 | r->u.allowed.type_list | |
4745 | = get_eh_types_for_runtime (r->u.allowed.type_list); | |
4746 | walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset); | |
4747 | break; | |
4748 | ||
4749 | case ERT_MUST_NOT_THROW: | |
4750 | walk_tree (&r->u.must_not_throw.failure_decl, | |
4751 | find_decls_types_r, fld, fld->pset); | |
4752 | break; | |
4537ec0c DN |
4753 | } |
4754 | } | |
4755 | ||
4756 | ||
4757 | /* Find decls and types referenced in cgraph node N and store them in | |
4758 | FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will | |
4759 | look for *every* kind of DECL and TYPE node reachable from N, | |
4760 | including those embedded inside types and decls (i.e,, TYPE_DECLs, | |
4761 | NAMESPACE_DECLs, etc). */ | |
4762 | ||
4763 | static void | |
4764 | find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld) | |
4765 | { | |
4766 | basic_block bb; | |
4767 | struct function *fn; | |
4768 | tree t; | |
4769 | ||
c7a3980a | 4770 | find_decls_types (n->decl, fld); |
4537ec0c DN |
4771 | |
4772 | if (!gimple_has_body_p (n->decl)) | |
4773 | return; | |
4774 | ||
4775 | gcc_assert (current_function_decl == NULL_TREE && cfun == NULL); | |
4776 | ||
4777 | fn = DECL_STRUCT_FUNCTION (n->decl); | |
4778 | ||
4779 | /* Traverse locals. */ | |
4780 | for (t = fn->local_decls; t; t = TREE_CHAIN (t)) | |
c7a3980a | 4781 | find_decls_types (TREE_VALUE (t), fld); |
4537ec0c DN |
4782 | |
4783 | /* Traverse EH regions in FN. */ | |
1d65f45c RH |
4784 | { |
4785 | eh_region r; | |
4786 | FOR_ALL_EH_REGION_FN (r, fn) | |
4787 | find_decls_types_in_eh_region (r, fld); | |
4788 | } | |
4537ec0c DN |
4789 | |
4790 | /* Traverse every statement in FN. */ | |
4791 | FOR_EACH_BB_FN (bb, fn) | |
4792 | { | |
4793 | gimple_stmt_iterator si; | |
4794 | unsigned i; | |
4795 | ||
4796 | for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si)) | |
4797 | { | |
4798 | gimple phi = gsi_stmt (si); | |
4799 | ||
4800 | for (i = 0; i < gimple_phi_num_args (phi); i++) | |
4801 | { | |
4802 | tree *arg_p = gimple_phi_arg_def_ptr (phi, i); | |
c7a3980a | 4803 | find_decls_types (*arg_p, fld); |
4537ec0c DN |
4804 | } |
4805 | } | |
4806 | ||
4807 | for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si)) | |
4808 | { | |
4809 | gimple stmt = gsi_stmt (si); | |
4810 | ||
4811 | for (i = 0; i < gimple_num_ops (stmt); i++) | |
4812 | { | |
c7a3980a RG |
4813 | tree arg = gimple_op (stmt, i); |
4814 | find_decls_types (arg, fld); | |
4537ec0c DN |
4815 | } |
4816 | } | |
4817 | } | |
4818 | } | |
4819 | ||
4820 | ||
4821 | /* Find decls and types referenced in varpool node N and store them in | |
4822 | FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will | |
4823 | look for *every* kind of DECL and TYPE node reachable from N, | |
4824 | including those embedded inside types and decls (i.e,, TYPE_DECLs, | |
4825 | NAMESPACE_DECLs, etc). */ | |
4826 | ||
4827 | static void | |
4828 | find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld) | |
4829 | { | |
c7a3980a | 4830 | find_decls_types (v->decl, fld); |
4537ec0c DN |
4831 | } |
4832 | ||
4833 | ||
4834 | /* Free language specific information for every operand and expression | |
4835 | in every node of the call graph. This process operates in three stages: | |
4836 | ||
4837 | 1- Every callgraph node and varpool node is traversed looking for | |
4838 | decls and types embedded in them. This is a more exhaustive | |
4839 | search than that done by find_referenced_vars, because it will | |
4840 | also collect individual fields, decls embedded in types, etc. | |
4841 | ||
4842 | 2- All the decls found are sent to free_lang_data_in_decl. | |
4843 | ||
4844 | 3- All the types found are sent to free_lang_data_in_type. | |
4845 | ||
4846 | The ordering between decls and types is important because | |
4847 | free_lang_data_in_decl sets assembler names, which includes | |
4848 | mangling. So types cannot be freed up until assembler names have | |
4849 | been set up. */ | |
4850 | ||
4851 | static void | |
4852 | free_lang_data_in_cgraph (void) | |
4853 | { | |
4854 | struct cgraph_node *n; | |
4855 | struct varpool_node *v; | |
4856 | struct free_lang_data_d fld; | |
4857 | tree t; | |
4858 | unsigned i; | |
4859 | alias_pair *p; | |
4860 | ||
4861 | /* Initialize sets and arrays to store referenced decls and types. */ | |
4862 | fld.pset = pointer_set_create (); | |
c7a3980a | 4863 | fld.worklist = NULL; |
4537ec0c DN |
4864 | fld.decls = VEC_alloc (tree, heap, 100); |
4865 | fld.types = VEC_alloc (tree, heap, 100); | |
4866 | ||
4867 | /* Find decls and types in the body of every function in the callgraph. */ | |
4868 | for (n = cgraph_nodes; n; n = n->next) | |
4869 | find_decls_types_in_node (n, &fld); | |
4870 | ||
4871 | for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++) | |
c7a3980a | 4872 | find_decls_types (p->decl, &fld); |
4537ec0c DN |
4873 | |
4874 | /* Find decls and types in every varpool symbol. */ | |
4875 | for (v = varpool_nodes_queue; v; v = v->next_needed) | |
4876 | find_decls_types_in_var (v, &fld); | |
4877 | ||
4878 | /* Set the assembler name on every decl found. We need to do this | |
4879 | now because free_lang_data_in_decl will invalidate data needed | |
4880 | for mangling. This breaks mangling on interdependent decls. */ | |
4881 | for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++) | |
4882 | if (need_assembler_name_p (t)) | |
4883 | { | |
4884 | /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit | |
4885 | diagnostics that use input_location to show locus | |
4886 | information. The problem here is that, at this point, | |
4887 | input_location is generally anchored to the end of the file | |
4888 | (since the parser is long gone), so we don't have a good | |
4889 | position to pin it to. | |
4890 | ||
4891 | To alleviate this problem, this uses the location of T's | |
4892 | declaration. Examples of this are | |
4893 | testsuite/g++.dg/template/cond2.C and | |
4894 | testsuite/g++.dg/template/pr35240.C. */ | |
4895 | location_t saved_location = input_location; | |
4896 | input_location = DECL_SOURCE_LOCATION (t); | |
4897 | ||
4898 | decl_assembler_name (t); | |
4899 | ||
4900 | input_location = saved_location; | |
4901 | } | |
4902 | ||
4903 | /* Traverse every decl found freeing its language data. */ | |
4904 | for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++) | |
4905 | free_lang_data_in_decl (t); | |
4906 | ||
4907 | /* Traverse every type found freeing its language data. */ | |
4908 | for (i = 0; VEC_iterate (tree, fld.types, i, t); i++) | |
4909 | free_lang_data_in_type (t); | |
4910 | ||
4911 | pointer_set_destroy (fld.pset); | |
c7a3980a | 4912 | VEC_free (tree, heap, fld.worklist); |
4537ec0c DN |
4913 | VEC_free (tree, heap, fld.decls); |
4914 | VEC_free (tree, heap, fld.types); | |
4915 | } | |
4916 | ||
4917 | ||
4918 | /* Free resources that are used by FE but are not needed once they are done. */ | |
4919 | ||
4920 | static unsigned | |
4921 | free_lang_data (void) | |
4922 | { | |
14cf68d9 RG |
4923 | unsigned i; |
4924 | ||
b66a1bac RG |
4925 | /* If we are the LTO frontend we have freed lang-specific data already. */ |
4926 | if (in_lto_p) | |
4927 | return 0; | |
4928 | ||
14cf68d9 RG |
4929 | /* Allocate and assign alias sets to the standard integer types |
4930 | while the slots are still in the way the frontends generated them. */ | |
4931 | for (i = 0; i < itk_none; ++i) | |
4932 | if (integer_types[i]) | |
4933 | TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]); | |
4934 | ||
4935 | /* FIXME. Remove after save_debug_info is working. */ | |
4936 | if (!(flag_generate_lto | |
b66a1bac | 4937 | || (!flag_gtoggle && debug_info_level <= DINFO_LEVEL_TERSE))) |
14cf68d9 RG |
4938 | return 0; |
4939 | ||
4537ec0c DN |
4940 | /* Traverse the IL resetting language specific information for |
4941 | operands, expressions, etc. */ | |
4942 | free_lang_data_in_cgraph (); | |
4943 | ||
4944 | /* Create gimple variants for common types. */ | |
4945 | ptrdiff_type_node = integer_type_node; | |
4946 | fileptr_type_node = ptr_type_node; | |
4947 | if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE | |
4948 | || (TYPE_MODE (boolean_type_node) | |
4949 | != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0)) | |
4950 | || TYPE_PRECISION (boolean_type_node) != 1 | |
4951 | || !TYPE_UNSIGNED (boolean_type_node)) | |
4952 | { | |
4953 | boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE); | |
4954 | TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE); | |
4955 | TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1); | |
4956 | TYPE_PRECISION (boolean_type_node) = 1; | |
4957 | boolean_false_node = TYPE_MIN_VALUE (boolean_type_node); | |
4958 | boolean_true_node = TYPE_MAX_VALUE (boolean_type_node); | |
4959 | } | |
4960 | ||
ccffb755 RG |
4961 | /* Unify char_type_node with its properly signed variant. */ |
4962 | if (TYPE_UNSIGNED (char_type_node)) | |
4963 | unsigned_char_type_node = char_type_node; | |
4964 | else | |
4965 | signed_char_type_node = char_type_node; | |
4966 | ||
14cf68d9 RG |
4967 | /* Reset some langhooks. Do not reset types_compatible_p, it may |
4968 | still be used indirectly via the get_alias_set langhook. */ | |
4537ec0c | 4969 | lang_hooks.callgraph.analyze_expr = NULL; |
4537ec0c DN |
4970 | lang_hooks.dwarf_name = lhd_dwarf_name; |
4971 | lang_hooks.decl_printable_name = gimple_decl_printable_name; | |
4972 | lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name; | |
4973 | lang_hooks.fold_obj_type_ref = gimple_fold_obj_type_ref; | |
4974 | ||
4975 | /* Reset diagnostic machinery. */ | |
4976 | diagnostic_starter (global_dc) = default_diagnostic_starter; | |
4977 | diagnostic_finalizer (global_dc) = default_diagnostic_finalizer; | |
4978 | diagnostic_format_decoder (global_dc) = default_tree_printer; | |
4979 | ||
d7f09764 DN |
4980 | /* FIXME. We remove sufficient language data that the debug |
4981 | info writer gets completely confused. Disable debug information | |
4982 | for now. */ | |
4983 | debug_info_level = DINFO_LEVEL_NONE; | |
4984 | write_symbols = NO_DEBUG; | |
4985 | debug_hooks = &do_nothing_debug_hooks; | |
4986 | ||
4537ec0c DN |
4987 | return 0; |
4988 | } | |
4989 | ||
4990 | ||
b8698a0f | 4991 | struct simple_ipa_opt_pass pass_ipa_free_lang_data = |
4537ec0c DN |
4992 | { |
4993 | { | |
4994 | SIMPLE_IPA_PASS, | |
e0a42b0f | 4995 | "*free_lang_data", /* name */ |
14cf68d9 | 4996 | NULL, /* gate */ |
4537ec0c DN |
4997 | free_lang_data, /* execute */ |
4998 | NULL, /* sub */ | |
4999 | NULL, /* next */ | |
5000 | 0, /* static_pass_number */ | |
5001 | TV_IPA_FREE_LANG_DATA, /* tv_id */ | |
5002 | 0, /* properties_required */ | |
5003 | 0, /* properties_provided */ | |
5004 | 0, /* properties_destroyed */ | |
5005 | 0, /* todo_flags_start */ | |
ccffb755 | 5006 | TODO_ggc_collect /* todo_flags_finish */ |
4537ec0c DN |
5007 | } |
5008 | }; | |
5009 | ||
0e9e1e0a | 5010 | /* Return nonzero if IDENT is a valid name for attribute ATTR, |
2a3c15b5 DE |
5011 | or zero if not. |
5012 | ||
5013 | We try both `text' and `__text__', ATTR may be either one. */ | |
5014 | /* ??? It might be a reasonable simplification to require ATTR to be only | |
5015 | `text'. One might then also require attribute lists to be stored in | |
5016 | their canonicalized form. */ | |
5017 | ||
e5410ba7 | 5018 | static int |
9566a759 | 5019 | is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident) |
2a3c15b5 | 5020 | { |
e5410ba7 | 5021 | int ident_len; |
63ad61ed | 5022 | const char *p; |
2a3c15b5 DE |
5023 | |
5024 | if (TREE_CODE (ident) != IDENTIFIER_NODE) | |
5025 | return 0; | |
b8698a0f | 5026 | |
2a3c15b5 | 5027 | p = IDENTIFIER_POINTER (ident); |
e5410ba7 | 5028 | ident_len = IDENTIFIER_LENGTH (ident); |
b8698a0f | 5029 | |
e5410ba7 AP |
5030 | if (ident_len == attr_len |
5031 | && strcmp (attr, p) == 0) | |
5032 | return 1; | |
2a3c15b5 DE |
5033 | |
5034 | /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */ | |
5035 | if (attr[0] == '_') | |
5036 | { | |
1e128c5f GB |
5037 | gcc_assert (attr[1] == '_'); |
5038 | gcc_assert (attr[attr_len - 2] == '_'); | |
5039 | gcc_assert (attr[attr_len - 1] == '_'); | |
2a3c15b5 DE |
5040 | if (ident_len == attr_len - 4 |
5041 | && strncmp (attr + 2, p, attr_len - 4) == 0) | |
5042 | return 1; | |
5043 | } | |
5044 | else | |
5045 | { | |
5046 | if (ident_len == attr_len + 4 | |
5047 | && p[0] == '_' && p[1] == '_' | |
5048 | && p[ident_len - 2] == '_' && p[ident_len - 1] == '_' | |
5049 | && strncmp (attr, p + 2, attr_len) == 0) | |
5050 | return 1; | |
5051 | } | |
5052 | ||
5053 | return 0; | |
5054 | } | |
5055 | ||
e5410ba7 AP |
5056 | /* Return nonzero if IDENT is a valid name for attribute ATTR, |
5057 | or zero if not. | |
5058 | ||
5059 | We try both `text' and `__text__', ATTR may be either one. */ | |
5060 | ||
5061 | int | |
9566a759 | 5062 | is_attribute_p (const char *attr, const_tree ident) |
e5410ba7 AP |
5063 | { |
5064 | return is_attribute_with_length_p (attr, strlen (attr), ident); | |
5065 | } | |
5066 | ||
2a3c15b5 DE |
5067 | /* Given an attribute name and a list of attributes, return a pointer to the |
5068 | attribute's list element if the attribute is part of the list, or NULL_TREE | |
91d231cb | 5069 | if not found. If the attribute appears more than once, this only |
ff7cc307 JM |
5070 | returns the first occurrence; the TREE_CHAIN of the return value should |
5071 | be passed back in if further occurrences are wanted. */ | |
2a3c15b5 DE |
5072 | |
5073 | tree | |
46c5ad27 | 5074 | lookup_attribute (const char *attr_name, tree list) |
2a3c15b5 | 5075 | { |
75547801 KG |
5076 | tree l; |
5077 | size_t attr_len = strlen (attr_name); | |
2a3c15b5 | 5078 | |
75547801 KG |
5079 | for (l = list; l; l = TREE_CHAIN (l)) |
5080 | { | |
5081 | gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE); | |
5082 | if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l))) | |
5083 | return l; | |
5084 | } | |
5085 | return NULL_TREE; | |
2a3c15b5 | 5086 | } |
f3209e2f | 5087 | |
b70f0f48 JM |
5088 | /* Remove any instances of attribute ATTR_NAME in LIST and return the |
5089 | modified list. */ | |
5090 | ||
5091 | tree | |
5092 | remove_attribute (const char *attr_name, tree list) | |
5093 | { | |
5094 | tree *p; | |
5095 | size_t attr_len = strlen (attr_name); | |
5096 | ||
5097 | for (p = &list; *p; ) | |
5098 | { | |
5099 | tree l = *p; | |
5100 | gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE); | |
5101 | if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l))) | |
5102 | *p = TREE_CHAIN (l); | |
5103 | else | |
5104 | p = &TREE_CHAIN (l); | |
5105 | } | |
5106 | ||
5107 | return list; | |
5108 | } | |
5109 | ||
f3209e2f DE |
5110 | /* Return an attribute list that is the union of a1 and a2. */ |
5111 | ||
5112 | tree | |
46c5ad27 | 5113 | merge_attributes (tree a1, tree a2) |
f3209e2f DE |
5114 | { |
5115 | tree attributes; | |
5116 | ||
5117 | /* Either one unset? Take the set one. */ | |
5118 | ||
d4b60170 | 5119 | if ((attributes = a1) == 0) |
f3209e2f DE |
5120 | attributes = a2; |
5121 | ||
5122 | /* One that completely contains the other? Take it. */ | |
5123 | ||
d4b60170 | 5124 | else if (a2 != 0 && ! attribute_list_contained (a1, a2)) |
dc478a5d KH |
5125 | { |
5126 | if (attribute_list_contained (a2, a1)) | |
5127 | attributes = a2; | |
5128 | else | |
5129 | { | |
5130 | /* Pick the longest list, and hang on the other list. */ | |
dc478a5d KH |
5131 | |
5132 | if (list_length (a1) < list_length (a2)) | |
5133 | attributes = a2, a2 = a1; | |
5134 | ||
5135 | for (; a2 != 0; a2 = TREE_CHAIN (a2)) | |
91d231cb JM |
5136 | { |
5137 | tree a; | |
5138 | for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)), | |
5139 | attributes); | |
5140 | a != NULL_TREE; | |
5141 | a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)), | |
5142 | TREE_CHAIN (a))) | |
5143 | { | |
fcb99e7b JJ |
5144 | if (TREE_VALUE (a) != NULL |
5145 | && TREE_CODE (TREE_VALUE (a)) == TREE_LIST | |
5146 | && TREE_VALUE (a2) != NULL | |
5147 | && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST) | |
5148 | { | |
5149 | if (simple_cst_list_equal (TREE_VALUE (a), | |
5150 | TREE_VALUE (a2)) == 1) | |
5151 | break; | |
5152 | } | |
5153 | else if (simple_cst_equal (TREE_VALUE (a), | |
5154 | TREE_VALUE (a2)) == 1) | |
91d231cb JM |
5155 | break; |
5156 | } | |
5157 | if (a == NULL_TREE) | |
5158 | { | |
5159 | a1 = copy_node (a2); | |
5160 | TREE_CHAIN (a1) = attributes; | |
5161 | attributes = a1; | |
5162 | } | |
5163 | } | |
dc478a5d KH |
5164 | } |
5165 | } | |
f3209e2f DE |
5166 | return attributes; |
5167 | } | |
d9525bec BK |
5168 | |
5169 | /* Given types T1 and T2, merge their attributes and return | |
672a6f42 | 5170 | the result. */ |
d9525bec BK |
5171 | |
5172 | tree | |
46c5ad27 | 5173 | merge_type_attributes (tree t1, tree t2) |
d9525bec | 5174 | { |
d9525bec BK |
5175 | return merge_attributes (TYPE_ATTRIBUTES (t1), |
5176 | TYPE_ATTRIBUTES (t2)); | |
d9525bec BK |
5177 | } |
5178 | ||
5179 | /* Given decls OLDDECL and NEWDECL, merge their attributes and return | |
5180 | the result. */ | |
5181 | ||
5182 | tree | |
46c5ad27 | 5183 | merge_decl_attributes (tree olddecl, tree newdecl) |
d9525bec | 5184 | { |
91d231cb JM |
5185 | return merge_attributes (DECL_ATTRIBUTES (olddecl), |
5186 | DECL_ATTRIBUTES (newdecl)); | |
d9525bec | 5187 | } |
672a6f42 | 5188 | |
b2ca3702 | 5189 | #if TARGET_DLLIMPORT_DECL_ATTRIBUTES |
672a6f42 NB |
5190 | |
5191 | /* Specialization of merge_decl_attributes for various Windows targets. | |
5192 | ||
5193 | This handles the following situation: | |
5194 | ||
5195 | __declspec (dllimport) int foo; | |
5196 | int foo; | |
5197 | ||
5198 | The second instance of `foo' nullifies the dllimport. */ | |
5199 | ||
5200 | tree | |
0a2aaacc | 5201 | merge_dllimport_decl_attributes (tree old, tree new_tree) |
672a6f42 NB |
5202 | { |
5203 | tree a; | |
43d9ad1d | 5204 | int delete_dllimport_p = 1; |
672a6f42 NB |
5205 | |
5206 | /* What we need to do here is remove from `old' dllimport if it doesn't | |
5207 | appear in `new'. dllimport behaves like extern: if a declaration is | |
5208 | marked dllimport and a definition appears later, then the object | |
43d9ad1d DS |
5209 | is not dllimport'd. We also remove a `new' dllimport if the old list |
5210 | contains dllexport: dllexport always overrides dllimport, regardless | |
b8698a0f | 5211 | of the order of declaration. */ |
0a2aaacc | 5212 | if (!VAR_OR_FUNCTION_DECL_P (new_tree)) |
43d9ad1d | 5213 | delete_dllimport_p = 0; |
0a2aaacc | 5214 | else if (DECL_DLLIMPORT_P (new_tree) |
43d9ad1d | 5215 | && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old))) |
b8698a0f | 5216 | { |
0a2aaacc | 5217 | DECL_DLLIMPORT_P (new_tree) = 0; |
43d9ad1d | 5218 | warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: " |
0a2aaacc | 5219 | "dllimport ignored", new_tree); |
43d9ad1d | 5220 | } |
0a2aaacc | 5221 | else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree)) |
43d9ad1d | 5222 | { |
fa10beec | 5223 | /* Warn about overriding a symbol that has already been used, e.g.: |
43d9ad1d DS |
5224 | extern int __attribute__ ((dllimport)) foo; |
5225 | int* bar () {return &foo;} | |
5226 | int foo; | |
5227 | */ | |
5228 | if (TREE_USED (old)) | |
5229 | { | |
5230 | warning (0, "%q+D redeclared without dllimport attribute " | |
0a2aaacc | 5231 | "after being referenced with dll linkage", new_tree); |
43d9ad1d DS |
5232 | /* If we have used a variable's address with dllimport linkage, |
5233 | keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the | |
51eed280 | 5234 | decl may already have had TREE_CONSTANT computed. |
43d9ad1d DS |
5235 | We still remove the attribute so that assembler code refers |
5236 | to '&foo rather than '_imp__foo'. */ | |
5237 | if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old)) | |
0a2aaacc | 5238 | DECL_DLLIMPORT_P (new_tree) = 1; |
43d9ad1d DS |
5239 | } |
5240 | ||
5241 | /* Let an inline definition silently override the external reference, | |
b8698a0f | 5242 | but otherwise warn about attribute inconsistency. */ |
0a2aaacc KG |
5243 | else if (TREE_CODE (new_tree) == VAR_DECL |
5244 | || !DECL_DECLARED_INLINE_P (new_tree)) | |
43d9ad1d | 5245 | warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: " |
0a2aaacc | 5246 | "previous dllimport ignored", new_tree); |
43d9ad1d | 5247 | } |
672a6f42 NB |
5248 | else |
5249 | delete_dllimport_p = 0; | |
5250 | ||
0a2aaacc | 5251 | a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree)); |
672a6f42 | 5252 | |
b8698a0f | 5253 | if (delete_dllimport_p) |
672a6f42 | 5254 | { |
a01da83b | 5255 | tree prev, t; |
b8698a0f L |
5256 | const size_t attr_len = strlen ("dllimport"); |
5257 | ||
672a6f42 NB |
5258 | /* Scan the list for dllimport and delete it. */ |
5259 | for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t)) | |
5260 | { | |
43d9ad1d DS |
5261 | if (is_attribute_with_length_p ("dllimport", attr_len, |
5262 | TREE_PURPOSE (t))) | |
672a6f42 NB |
5263 | { |
5264 | if (prev == NULL_TREE) | |
5265 | a = TREE_CHAIN (a); | |
5266 | else | |
5267 | TREE_CHAIN (prev) = TREE_CHAIN (t); | |
5268 | break; | |
5269 | } | |
5270 | } | |
5271 | } | |
5272 | ||
5273 | return a; | |
5274 | } | |
5275 | ||
b2ca3702 MM |
5276 | /* Handle a "dllimport" or "dllexport" attribute; arguments as in |
5277 | struct attribute_spec.handler. */ | |
5278 | ||
5279 | tree | |
5280 | handle_dll_attribute (tree * pnode, tree name, tree args, int flags, | |
5281 | bool *no_add_attrs) | |
5282 | { | |
5283 | tree node = *pnode; | |
fe2978fb | 5284 | bool is_dllimport; |
b2ca3702 MM |
5285 | |
5286 | /* These attributes may apply to structure and union types being created, | |
5287 | but otherwise should pass to the declaration involved. */ | |
5288 | if (!DECL_P (node)) | |
5289 | { | |
5290 | if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT | |
5291 | | (int) ATTR_FLAG_ARRAY_NEXT)) | |
5292 | { | |
5293 | *no_add_attrs = true; | |
5294 | return tree_cons (name, args, NULL_TREE); | |
5295 | } | |
3a687f8b MM |
5296 | if (TREE_CODE (node) == RECORD_TYPE |
5297 | || TREE_CODE (node) == UNION_TYPE) | |
5298 | { | |
5299 | node = TYPE_NAME (node); | |
5300 | if (!node) | |
5301 | return NULL_TREE; | |
5302 | } | |
5303 | else | |
b2ca3702 | 5304 | { |
4f1e4960 JM |
5305 | warning (OPT_Wattributes, "%qE attribute ignored", |
5306 | name); | |
b2ca3702 | 5307 | *no_add_attrs = true; |
3a687f8b | 5308 | return NULL_TREE; |
b2ca3702 | 5309 | } |
b2ca3702 MM |
5310 | } |
5311 | ||
09416794 | 5312 | if (TREE_CODE (node) != FUNCTION_DECL |
3a687f8b MM |
5313 | && TREE_CODE (node) != VAR_DECL |
5314 | && TREE_CODE (node) != TYPE_DECL) | |
09416794 DS |
5315 | { |
5316 | *no_add_attrs = true; | |
4f1e4960 JM |
5317 | warning (OPT_Wattributes, "%qE attribute ignored", |
5318 | name); | |
09416794 DS |
5319 | return NULL_TREE; |
5320 | } | |
5321 | ||
dde75838 JM |
5322 | if (TREE_CODE (node) == TYPE_DECL |
5323 | && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE | |
5324 | && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE) | |
5325 | { | |
5326 | *no_add_attrs = true; | |
4f1e4960 JM |
5327 | warning (OPT_Wattributes, "%qE attribute ignored", |
5328 | name); | |
dde75838 JM |
5329 | return NULL_TREE; |
5330 | } | |
5331 | ||
fe2978fb MM |
5332 | is_dllimport = is_attribute_p ("dllimport", name); |
5333 | ||
b2ca3702 MM |
5334 | /* Report error on dllimport ambiguities seen now before they cause |
5335 | any damage. */ | |
fe2978fb | 5336 | if (is_dllimport) |
b2ca3702 | 5337 | { |
b8698a0f | 5338 | /* Honor any target-specific overrides. */ |
43d9ad1d DS |
5339 | if (!targetm.valid_dllimport_attribute_p (node)) |
5340 | *no_add_attrs = true; | |
5341 | ||
5342 | else if (TREE_CODE (node) == FUNCTION_DECL | |
5343 | && DECL_DECLARED_INLINE_P (node)) | |
5344 | { | |
5345 | warning (OPT_Wattributes, "inline function %q+D declared as " | |
b8698a0f | 5346 | " dllimport: attribute ignored", node); |
43d9ad1d DS |
5347 | *no_add_attrs = true; |
5348 | } | |
b2ca3702 | 5349 | /* Like MS, treat definition of dllimported variables and |
43d9ad1d DS |
5350 | non-inlined functions on declaration as syntax errors. */ |
5351 | else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node)) | |
b2ca3702 | 5352 | { |
c85ce869 | 5353 | error ("function %q+D definition is marked dllimport", node); |
b2ca3702 MM |
5354 | *no_add_attrs = true; |
5355 | } | |
5356 | ||
43d9ad1d | 5357 | else if (TREE_CODE (node) == VAR_DECL) |
b2ca3702 MM |
5358 | { |
5359 | if (DECL_INITIAL (node)) | |
5360 | { | |
c85ce869 | 5361 | error ("variable %q+D definition is marked dllimport", |
dee15844 | 5362 | node); |
b2ca3702 MM |
5363 | *no_add_attrs = true; |
5364 | } | |
5365 | ||
5366 | /* `extern' needn't be specified with dllimport. | |
5367 | Specify `extern' now and hope for the best. Sigh. */ | |
5368 | DECL_EXTERNAL (node) = 1; | |
5369 | /* Also, implicitly give dllimport'd variables declared within | |
5370 | a function global scope, unless declared static. */ | |
5371 | if (current_function_decl != NULL_TREE && !TREE_STATIC (node)) | |
5372 | TREE_PUBLIC (node) = 1; | |
5373 | } | |
43d9ad1d DS |
5374 | |
5375 | if (*no_add_attrs == false) | |
5376 | DECL_DLLIMPORT_P (node) = 1; | |
b2ca3702 | 5377 | } |
055df276 KT |
5378 | else if (TREE_CODE (node) == FUNCTION_DECL |
5379 | && DECL_DECLARED_INLINE_P (node)) | |
fe2978fb MM |
5380 | /* An exported function, even if inline, must be emitted. */ |
5381 | DECL_EXTERNAL (node) = 0; | |
b2ca3702 MM |
5382 | |
5383 | /* Report error if symbol is not accessible at global scope. */ | |
5384 | if (!TREE_PUBLIC (node) | |
5385 | && (TREE_CODE (node) == VAR_DECL | |
5386 | || TREE_CODE (node) == FUNCTION_DECL)) | |
5387 | { | |
dee15844 | 5388 | error ("external linkage required for symbol %q+D because of " |
4f1e4960 | 5389 | "%qE attribute", node, name); |
b2ca3702 MM |
5390 | *no_add_attrs = true; |
5391 | } | |
5392 | ||
3a687f8b MM |
5393 | /* A dllexport'd entity must have default visibility so that other |
5394 | program units (shared libraries or the main executable) can see | |
5395 | it. A dllimport'd entity must have default visibility so that | |
5396 | the linker knows that undefined references within this program | |
5397 | unit can be resolved by the dynamic linker. */ | |
5398 | if (!*no_add_attrs) | |
5399 | { | |
5400 | if (DECL_VISIBILITY_SPECIFIED (node) | |
5401 | && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT) | |
4f1e4960 | 5402 | error ("%qE implies default visibility, but %qD has already " |
b8698a0f | 5403 | "been declared with a different visibility", |
4f1e4960 | 5404 | name, node); |
3a687f8b MM |
5405 | DECL_VISIBILITY (node) = VISIBILITY_DEFAULT; |
5406 | DECL_VISIBILITY_SPECIFIED (node) = 1; | |
5407 | } | |
5408 | ||
b2ca3702 MM |
5409 | return NULL_TREE; |
5410 | } | |
5411 | ||
672a6f42 | 5412 | #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */ |
91e97eb8 | 5413 | \f |
3932261a MM |
5414 | /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask |
5415 | of the various TYPE_QUAL values. */ | |
c6a1db6c | 5416 | |
3932261a | 5417 | static void |
46c5ad27 | 5418 | set_type_quals (tree type, int type_quals) |
3932261a MM |
5419 | { |
5420 | TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0; | |
5421 | TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0; | |
5422 | TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0; | |
09e881c9 | 5423 | TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals); |
3932261a | 5424 | } |
c6a1db6c | 5425 | |
1d4f5374 | 5426 | /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */ |
896c3aa3 JM |
5427 | |
5428 | bool | |
9566a759 | 5429 | check_qualified_type (const_tree cand, const_tree base, int type_quals) |
896c3aa3 JM |
5430 | { |
5431 | return (TYPE_QUALS (cand) == type_quals | |
5432 | && TYPE_NAME (cand) == TYPE_NAME (base) | |
5433 | /* Apparently this is needed for Objective-C. */ | |
5434 | && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base) | |
5435 | && attribute_list_equal (TYPE_ATTRIBUTES (cand), | |
5436 | TYPE_ATTRIBUTES (base))); | |
5437 | } | |
5438 | ||
5101b304 MM |
5439 | /* Return a version of the TYPE, qualified as indicated by the |
5440 | TYPE_QUALS, if one exists. If no qualified version exists yet, | |
5441 | return NULL_TREE. */ | |
c6a1db6c RS |
5442 | |
5443 | tree | |
46c5ad27 | 5444 | get_qualified_type (tree type, int type_quals) |
c6a1db6c | 5445 | { |
5101b304 | 5446 | tree t; |
dc478a5d | 5447 | |
896c3aa3 JM |
5448 | if (TYPE_QUALS (type) == type_quals) |
5449 | return type; | |
5450 | ||
e24fa534 JW |
5451 | /* Search the chain of variants to see if there is already one there just |
5452 | like the one we need to have. If so, use that existing one. We must | |
5453 | preserve the TYPE_NAME, since there is code that depends on this. */ | |
b217d7fe | 5454 | for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) |
896c3aa3 | 5455 | if (check_qualified_type (t, type, type_quals)) |
e24fa534 | 5456 | return t; |
c6a1db6c | 5457 | |
5101b304 MM |
5458 | return NULL_TREE; |
5459 | } | |
5460 | ||
5461 | /* Like get_qualified_type, but creates the type if it does not | |
5462 | exist. This function never returns NULL_TREE. */ | |
5463 | ||
5464 | tree | |
46c5ad27 | 5465 | build_qualified_type (tree type, int type_quals) |
5101b304 MM |
5466 | { |
5467 | tree t; | |
5468 | ||
5469 | /* See if we already have the appropriate qualified variant. */ | |
5470 | t = get_qualified_type (type, type_quals); | |
5471 | ||
5472 | /* If not, build it. */ | |
5473 | if (!t) | |
5474 | { | |
8dd16ecc | 5475 | t = build_variant_type_copy (type); |
5101b304 | 5476 | set_type_quals (t, type_quals); |
06d40de8 DG |
5477 | |
5478 | if (TYPE_STRUCTURAL_EQUALITY_P (type)) | |
5479 | /* Propagate structural equality. */ | |
5480 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
5481 | else if (TYPE_CANONICAL (type) != type) | |
5482 | /* Build the underlying canonical type, since it is different | |
5483 | from TYPE. */ | |
5484 | TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type), | |
5485 | type_quals); | |
5486 | else | |
5487 | /* T is its own canonical type. */ | |
5488 | TYPE_CANONICAL (t) = t; | |
b8698a0f | 5489 | |
5101b304 MM |
5490 | } |
5491 | ||
c6a1db6c RS |
5492 | return t; |
5493 | } | |
b4ac57ab | 5494 | |
8dd16ecc | 5495 | /* Create a new distinct copy of TYPE. The new type is made its own |
06d40de8 DG |
5496 | MAIN_VARIANT. If TYPE requires structural equality checks, the |
5497 | resulting type requires structural equality checks; otherwise, its | |
5498 | TYPE_CANONICAL points to itself. */ | |
b4ac57ab RS |
5499 | |
5500 | tree | |
8dd16ecc | 5501 | build_distinct_type_copy (tree type) |
b4ac57ab | 5502 | { |
8dd16ecc | 5503 | tree t = copy_node (type); |
b8698a0f | 5504 | |
b4ac57ab RS |
5505 | TYPE_POINTER_TO (t) = 0; |
5506 | TYPE_REFERENCE_TO (t) = 0; | |
5507 | ||
06d40de8 DG |
5508 | /* Set the canonical type either to a new equivalence class, or |
5509 | propagate the need for structural equality checks. */ | |
5510 | if (TYPE_STRUCTURAL_EQUALITY_P (type)) | |
5511 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
5512 | else | |
5513 | TYPE_CANONICAL (t) = t; | |
5514 | ||
8dd16ecc NS |
5515 | /* Make it its own variant. */ |
5516 | TYPE_MAIN_VARIANT (t) = t; | |
5517 | TYPE_NEXT_VARIANT (t) = 0; | |
e1f28918 ILT |
5518 | |
5519 | /* Note that it is now possible for TYPE_MIN_VALUE to be a value | |
5520 | whose TREE_TYPE is not t. This can also happen in the Ada | |
5521 | frontend when using subtypes. */ | |
093b203b | 5522 | |
8dd16ecc NS |
5523 | return t; |
5524 | } | |
5525 | ||
06d40de8 DG |
5526 | /* Create a new variant of TYPE, equivalent but distinct. This is so |
5527 | the caller can modify it. TYPE_CANONICAL for the return type will | |
5528 | be equivalent to TYPE_CANONICAL of TYPE, indicating that the types | |
5529 | are considered equal by the language itself (or that both types | |
5530 | require structural equality checks). */ | |
8dd16ecc NS |
5531 | |
5532 | tree | |
5533 | build_variant_type_copy (tree type) | |
5534 | { | |
5535 | tree t, m = TYPE_MAIN_VARIANT (type); | |
5536 | ||
5537 | t = build_distinct_type_copy (type); | |
06d40de8 DG |
5538 | |
5539 | /* Since we're building a variant, assume that it is a non-semantic | |
5540 | variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */ | |
5541 | TYPE_CANONICAL (t) = TYPE_CANONICAL (type); | |
b8698a0f | 5542 | |
8dd16ecc | 5543 | /* Add the new type to the chain of variants of TYPE. */ |
b4ac57ab RS |
5544 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m); |
5545 | TYPE_NEXT_VARIANT (m) = t; | |
8dd16ecc | 5546 | TYPE_MAIN_VARIANT (t) = m; |
b4ac57ab | 5547 | |
b4ac57ab RS |
5548 | return t; |
5549 | } | |
c6a1db6c | 5550 | \f |
f991abd1 DB |
5551 | /* Return true if the from tree in both tree maps are equal. */ |
5552 | ||
820cc88f | 5553 | int |
fc8600f9 | 5554 | tree_map_base_eq (const void *va, const void *vb) |
f991abd1 | 5555 | { |
3d9a9f94 KG |
5556 | const struct tree_map_base *const a = (const struct tree_map_base *) va, |
5557 | *const b = (const struct tree_map_base *) vb; | |
f991abd1 DB |
5558 | return (a->from == b->from); |
5559 | } | |
5560 | ||
5561 | /* Hash a from tree in a tree_map. */ | |
5562 | ||
820cc88f | 5563 | unsigned int |
fc8600f9 | 5564 | tree_map_base_hash (const void *item) |
f991abd1 | 5565 | { |
fc8600f9 | 5566 | return htab_hash_pointer (((const struct tree_map_base *)item)->from); |
f991abd1 DB |
5567 | } |
5568 | ||
5569 | /* Return true if this tree map structure is marked for garbage collection | |
5570 | purposes. We simply return true if the from tree is marked, so that this | |
5571 | structure goes away when the from tree goes away. */ | |
5572 | ||
820cc88f | 5573 | int |
fc8600f9 | 5574 | tree_map_base_marked_p (const void *p) |
f991abd1 | 5575 | { |
741ac903 | 5576 | return ggc_marked_p (((const struct tree_map_base *) p)->from); |
fc8600f9 | 5577 | } |
f991abd1 | 5578 | |
fc8600f9 MM |
5579 | unsigned int |
5580 | tree_map_hash (const void *item) | |
5581 | { | |
5582 | return (((const struct tree_map *) item)->hash); | |
f991abd1 DB |
5583 | } |
5584 | ||
fc8600f9 | 5585 | /* Return the initialization priority for DECL. */ |
820cc88f | 5586 | |
fc8600f9 MM |
5587 | priority_type |
5588 | decl_init_priority_lookup (tree decl) | |
820cc88f | 5589 | { |
fc8600f9 MM |
5590 | struct tree_priority_map *h; |
5591 | struct tree_map_base in; | |
5592 | ||
5593 | gcc_assert (VAR_OR_FUNCTION_DECL_P (decl)); | |
fc8600f9 | 5594 | in.from = decl; |
3d9a9f94 | 5595 | h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in); |
fc8600f9 | 5596 | return h ? h->init : DEFAULT_INIT_PRIORITY; |
820cc88f DB |
5597 | } |
5598 | ||
fc8600f9 | 5599 | /* Return the finalization priority for DECL. */ |
820cc88f | 5600 | |
fc8600f9 MM |
5601 | priority_type |
5602 | decl_fini_priority_lookup (tree decl) | |
820cc88f | 5603 | { |
fc8600f9 MM |
5604 | struct tree_priority_map *h; |
5605 | struct tree_map_base in; | |
5606 | ||
5607 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); | |
fc8600f9 | 5608 | in.from = decl; |
3d9a9f94 | 5609 | h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in); |
fc8600f9 | 5610 | return h ? h->fini : DEFAULT_INIT_PRIORITY; |
820cc88f DB |
5611 | } |
5612 | ||
fc8600f9 MM |
5613 | /* Return the initialization and finalization priority information for |
5614 | DECL. If there is no previous priority information, a freshly | |
5615 | allocated structure is returned. */ | |
820cc88f | 5616 | |
fc8600f9 MM |
5617 | static struct tree_priority_map * |
5618 | decl_priority_info (tree decl) | |
820cc88f | 5619 | { |
fc8600f9 MM |
5620 | struct tree_priority_map in; |
5621 | struct tree_priority_map *h; | |
5622 | void **loc; | |
5623 | ||
5624 | in.base.from = decl; | |
5625 | loc = htab_find_slot (init_priority_for_decl, &in, INSERT); | |
3d9a9f94 | 5626 | h = (struct tree_priority_map *) *loc; |
fc8600f9 MM |
5627 | if (!h) |
5628 | { | |
5629 | h = GGC_CNEW (struct tree_priority_map); | |
5630 | *loc = h; | |
5631 | h->base.from = decl; | |
5632 | h->init = DEFAULT_INIT_PRIORITY; | |
5633 | h->fini = DEFAULT_INIT_PRIORITY; | |
5634 | } | |
820cc88f | 5635 | |
fc8600f9 | 5636 | return h; |
820cc88f | 5637 | } |
820cc88f | 5638 | |
fc8600f9 MM |
5639 | /* Set the initialization priority for DECL to PRIORITY. */ |
5640 | ||
5641 | void | |
5642 | decl_init_priority_insert (tree decl, priority_type priority) | |
820cc88f | 5643 | { |
fc8600f9 | 5644 | struct tree_priority_map *h; |
820cc88f | 5645 | |
fc8600f9 MM |
5646 | gcc_assert (VAR_OR_FUNCTION_DECL_P (decl)); |
5647 | h = decl_priority_info (decl); | |
5648 | h->init = priority; | |
b8698a0f | 5649 | } |
820cc88f | 5650 | |
fc8600f9 | 5651 | /* Set the finalization priority for DECL to PRIORITY. */ |
820cc88f DB |
5652 | |
5653 | void | |
fc8600f9 | 5654 | decl_fini_priority_insert (tree decl, priority_type priority) |
820cc88f | 5655 | { |
fc8600f9 | 5656 | struct tree_priority_map *h; |
820cc88f | 5657 | |
fc8600f9 MM |
5658 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
5659 | h = decl_priority_info (decl); | |
5660 | h->fini = priority; | |
b8698a0f | 5661 | } |
820cc88f | 5662 | |
f991abd1 DB |
5663 | /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */ |
5664 | ||
5665 | static void | |
5666 | print_debug_expr_statistics (void) | |
5667 | { | |
5668 | fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n", | |
5669 | (long) htab_size (debug_expr_for_decl), | |
5670 | (long) htab_elements (debug_expr_for_decl), | |
5671 | htab_collisions (debug_expr_for_decl)); | |
5672 | } | |
5673 | ||
833b3afe DB |
5674 | /* Print out the statistics for the DECL_VALUE_EXPR hash table. */ |
5675 | ||
5676 | static void | |
5677 | print_value_expr_statistics (void) | |
5678 | { | |
5679 | fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n", | |
5680 | (long) htab_size (value_expr_for_decl), | |
5681 | (long) htab_elements (value_expr_for_decl), | |
5682 | htab_collisions (value_expr_for_decl)); | |
5683 | } | |
0b494699 | 5684 | |
f991abd1 DB |
5685 | /* Lookup a debug expression for FROM, and return it if we find one. */ |
5686 | ||
b8698a0f | 5687 | tree |
f991abd1 DB |
5688 | decl_debug_expr_lookup (tree from) |
5689 | { | |
5690 | struct tree_map *h, in; | |
fc8600f9 | 5691 | in.base.from = from; |
f991abd1 | 5692 | |
3d9a9f94 KG |
5693 | h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in, |
5694 | htab_hash_pointer (from)); | |
f991abd1 DB |
5695 | if (h) |
5696 | return h->to; | |
5697 | return NULL_TREE; | |
5698 | } | |
5699 | ||
5700 | /* Insert a mapping FROM->TO in the debug expression hashtable. */ | |
5701 | ||
5702 | void | |
5703 | decl_debug_expr_insert (tree from, tree to) | |
5704 | { | |
5705 | struct tree_map *h; | |
5706 | void **loc; | |
5707 | ||
3d9a9f94 | 5708 | h = GGC_NEW (struct tree_map); |
f991abd1 | 5709 | h->hash = htab_hash_pointer (from); |
fc8600f9 | 5710 | h->base.from = from; |
f991abd1 DB |
5711 | h->to = to; |
5712 | loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT); | |
5713 | *(struct tree_map **) loc = h; | |
b8698a0f | 5714 | } |
833b3afe DB |
5715 | |
5716 | /* Lookup a value expression for FROM, and return it if we find one. */ | |
5717 | ||
b8698a0f | 5718 | tree |
833b3afe DB |
5719 | decl_value_expr_lookup (tree from) |
5720 | { | |
5721 | struct tree_map *h, in; | |
fc8600f9 | 5722 | in.base.from = from; |
833b3afe | 5723 | |
3d9a9f94 KG |
5724 | h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in, |
5725 | htab_hash_pointer (from)); | |
833b3afe DB |
5726 | if (h) |
5727 | return h->to; | |
5728 | return NULL_TREE; | |
5729 | } | |
5730 | ||
5731 | /* Insert a mapping FROM->TO in the value expression hashtable. */ | |
5732 | ||
5733 | void | |
5734 | decl_value_expr_insert (tree from, tree to) | |
5735 | { | |
5736 | struct tree_map *h; | |
5737 | void **loc; | |
5738 | ||
3d9a9f94 | 5739 | h = GGC_NEW (struct tree_map); |
833b3afe | 5740 | h->hash = htab_hash_pointer (from); |
fc8600f9 | 5741 | h->base.from = from; |
833b3afe DB |
5742 | h->to = to; |
5743 | loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT); | |
5744 | *(struct tree_map **) loc = h; | |
5745 | } | |
5746 | ||
c6a1db6c RS |
5747 | /* Hashing of types so that we don't make duplicates. |
5748 | The entry point is `type_hash_canon'. */ | |
5749 | ||
c6a1db6c RS |
5750 | /* Compute a hash code for a list of types (chain of TREE_LIST nodes |
5751 | with types in the TREE_VALUE slots), by adding the hash codes | |
5752 | of the individual types. */ | |
5753 | ||
9566a759 KG |
5754 | static unsigned int |
5755 | type_hash_list (const_tree list, hashval_t hashcode) | |
c6a1db6c | 5756 | { |
9566a759 | 5757 | const_tree tail; |
d4b60170 | 5758 | |
fd917e0d JM |
5759 | for (tail = list; tail; tail = TREE_CHAIN (tail)) |
5760 | if (TREE_VALUE (tail) != error_mark_node) | |
5761 | hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)), | |
5762 | hashcode); | |
d4b60170 | 5763 | |
c6a1db6c RS |
5764 | return hashcode; |
5765 | } | |
5766 | ||
d88f311b ML |
5767 | /* These are the Hashtable callback functions. */ |
5768 | ||
eb34af89 | 5769 | /* Returns true iff the types are equivalent. */ |
d88f311b ML |
5770 | |
5771 | static int | |
46c5ad27 | 5772 | type_hash_eq (const void *va, const void *vb) |
d88f311b | 5773 | { |
3d9a9f94 KG |
5774 | const struct type_hash *const a = (const struct type_hash *) va, |
5775 | *const b = (const struct type_hash *) vb; | |
eb34af89 RK |
5776 | |
5777 | /* First test the things that are the same for all types. */ | |
5778 | if (a->hash != b->hash | |
5779 | || TREE_CODE (a->type) != TREE_CODE (b->type) | |
5780 | || TREE_TYPE (a->type) != TREE_TYPE (b->type) | |
5781 | || !attribute_list_equal (TYPE_ATTRIBUTES (a->type), | |
5782 | TYPE_ATTRIBUTES (b->type)) | |
5783 | || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type) | |
9c880618 | 5784 | || TYPE_MODE (a->type) != TYPE_MODE (b->type) |
b8698a0f | 5785 | || (TREE_CODE (a->type) != COMPLEX_TYPE |
9c880618 | 5786 | && TYPE_NAME (a->type) != TYPE_NAME (b->type))) |
eb34af89 RK |
5787 | return 0; |
5788 | ||
5789 | switch (TREE_CODE (a->type)) | |
5790 | { | |
5791 | case VOID_TYPE: | |
5792 | case COMPLEX_TYPE: | |
eb34af89 RK |
5793 | case POINTER_TYPE: |
5794 | case REFERENCE_TYPE: | |
5795 | return 1; | |
5796 | ||
d70b8c3a PB |
5797 | case VECTOR_TYPE: |
5798 | return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type); | |
5799 | ||
eb34af89 RK |
5800 | case ENUMERAL_TYPE: |
5801 | if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type) | |
5802 | && !(TYPE_VALUES (a->type) | |
5803 | && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST | |
5804 | && TYPE_VALUES (b->type) | |
5805 | && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST | |
5806 | && type_list_equal (TYPE_VALUES (a->type), | |
5807 | TYPE_VALUES (b->type)))) | |
5808 | return 0; | |
5809 | ||
5810 | /* ... fall through ... */ | |
5811 | ||
5812 | case INTEGER_TYPE: | |
5813 | case REAL_TYPE: | |
5814 | case BOOLEAN_TYPE: | |
eb34af89 RK |
5815 | return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type) |
5816 | || tree_int_cst_equal (TYPE_MAX_VALUE (a->type), | |
5817 | TYPE_MAX_VALUE (b->type))) | |
5818 | && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type) | |
614ed70a | 5819 | || tree_int_cst_equal (TYPE_MIN_VALUE (a->type), |
eb34af89 RK |
5820 | TYPE_MIN_VALUE (b->type)))); |
5821 | ||
325217ed CF |
5822 | case FIXED_POINT_TYPE: |
5823 | return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type); | |
5824 | ||
eb34af89 RK |
5825 | case OFFSET_TYPE: |
5826 | return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type); | |
5827 | ||
5828 | case METHOD_TYPE: | |
5829 | return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type) | |
5830 | && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type) | |
5831 | || (TYPE_ARG_TYPES (a->type) | |
5832 | && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST | |
5833 | && TYPE_ARG_TYPES (b->type) | |
5834 | && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST | |
5835 | && type_list_equal (TYPE_ARG_TYPES (a->type), | |
5836 | TYPE_ARG_TYPES (b->type))))); | |
9f63daea | 5837 | |
eb34af89 | 5838 | case ARRAY_TYPE: |
eb34af89 RK |
5839 | return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type); |
5840 | ||
5841 | case RECORD_TYPE: | |
5842 | case UNION_TYPE: | |
5843 | case QUAL_UNION_TYPE: | |
5844 | return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type) | |
5845 | || (TYPE_FIELDS (a->type) | |
5846 | && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST | |
5847 | && TYPE_FIELDS (b->type) | |
5848 | && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST | |
5849 | && type_list_equal (TYPE_FIELDS (a->type), | |
5850 | TYPE_FIELDS (b->type)))); | |
5851 | ||
5852 | case FUNCTION_TYPE: | |
2dff8956 JJ |
5853 | if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type) |
5854 | || (TYPE_ARG_TYPES (a->type) | |
5855 | && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST | |
5856 | && TYPE_ARG_TYPES (b->type) | |
5857 | && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST | |
5858 | && type_list_equal (TYPE_ARG_TYPES (a->type), | |
5859 | TYPE_ARG_TYPES (b->type)))) | |
5860 | break; | |
5861 | return 0; | |
eb34af89 RK |
5862 | |
5863 | default: | |
5864 | return 0; | |
5865 | } | |
2dff8956 JJ |
5866 | |
5867 | if (lang_hooks.types.type_hash_eq != NULL) | |
5868 | return lang_hooks.types.type_hash_eq (a->type, b->type); | |
5869 | ||
5870 | return 1; | |
d88f311b ML |
5871 | } |
5872 | ||
5873 | /* Return the cached hash value. */ | |
5874 | ||
fb7e6024 | 5875 | static hashval_t |
46c5ad27 | 5876 | type_hash_hash (const void *item) |
d88f311b | 5877 | { |
dc478a5d | 5878 | return ((const struct type_hash *) item)->hash; |
d88f311b ML |
5879 | } |
5880 | ||
c6a1db6c RS |
5881 | /* Look in the type hash table for a type isomorphic to TYPE. |
5882 | If one is found, return it. Otherwise return 0. */ | |
5883 | ||
5884 | tree | |
fd917e0d | 5885 | type_hash_lookup (hashval_t hashcode, tree type) |
c6a1db6c | 5886 | { |
d88f311b | 5887 | struct type_hash *h, in; |
da48638e AH |
5888 | |
5889 | /* The TYPE_ALIGN field of a type is set by layout_type(), so we | |
dc478a5d | 5890 | must call that routine before comparing TYPE_ALIGNs. */ |
da48638e AH |
5891 | layout_type (type); |
5892 | ||
d88f311b ML |
5893 | in.hash = hashcode; |
5894 | in.type = type; | |
d4b60170 | 5895 | |
3d9a9f94 KG |
5896 | h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in, |
5897 | hashcode); | |
d88f311b ML |
5898 | if (h) |
5899 | return h->type; | |
5900 | return NULL_TREE; | |
c6a1db6c RS |
5901 | } |
5902 | ||
5903 | /* Add an entry to the type-hash-table | |
5904 | for a type TYPE whose hash code is HASHCODE. */ | |
5905 | ||
5906 | void | |
fd917e0d | 5907 | type_hash_add (hashval_t hashcode, tree type) |
c6a1db6c | 5908 | { |
d88f311b ML |
5909 | struct type_hash *h; |
5910 | void **loc; | |
c6a1db6c | 5911 | |
3d9a9f94 | 5912 | h = GGC_NEW (struct type_hash); |
d88f311b | 5913 | h->hash = hashcode; |
c6a1db6c | 5914 | h->type = type; |
f64bedbd | 5915 | loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT); |
b0d667cb | 5916 | *loc = (void *)h; |
c6a1db6c RS |
5917 | } |
5918 | ||
5919 | /* Given TYPE, and HASHCODE its hash code, return the canonical | |
5920 | object for an identical type if one already exists. | |
7548281d | 5921 | Otherwise, return TYPE, and record it as the canonical object. |
c6a1db6c RS |
5922 | |
5923 | To use this function, first create a type of the sort you want. | |
5924 | Then compute its hash code from the fields of the type that | |
5925 | make it different from other similar types. | |
7548281d | 5926 | Then call this function and use the value. */ |
c6a1db6c RS |
5927 | |
5928 | tree | |
46c5ad27 | 5929 | type_hash_canon (unsigned int hashcode, tree type) |
c6a1db6c RS |
5930 | { |
5931 | tree t1; | |
5932 | ||
7548281d RK |
5933 | /* The hash table only contains main variants, so ensure that's what we're |
5934 | being passed. */ | |
1e128c5f | 5935 | gcc_assert (TYPE_MAIN_VARIANT (type) == type); |
7548281d RK |
5936 | |
5937 | if (!lang_hooks.types.hash_types) | |
c6a1db6c RS |
5938 | return type; |
5939 | ||
4c160717 RK |
5940 | /* See if the type is in the hash table already. If so, return it. |
5941 | Otherwise, add the type. */ | |
c6a1db6c RS |
5942 | t1 = type_hash_lookup (hashcode, type); |
5943 | if (t1 != 0) | |
5944 | { | |
c6a1db6c | 5945 | #ifdef GATHER_STATISTICS |
770ae6cc RK |
5946 | tree_node_counts[(int) t_kind]--; |
5947 | tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type); | |
c6a1db6c RS |
5948 | #endif |
5949 | return t1; | |
5950 | } | |
4c160717 RK |
5951 | else |
5952 | { | |
5953 | type_hash_add (hashcode, type); | |
5954 | return type; | |
5955 | } | |
c6a1db6c RS |
5956 | } |
5957 | ||
6abba055 RK |
5958 | /* See if the data pointed to by the type hash table is marked. We consider |
5959 | it marked if the type is marked or if a debug type number or symbol | |
5960 | table entry has been made for the type. This reduces the amount of | |
5961 | debugging output and eliminates that dependency of the debug output on | |
5962 | the number of garbage collections. */ | |
d88f311b ML |
5963 | |
5964 | static int | |
46c5ad27 | 5965 | type_hash_marked_p (const void *p) |
d88f311b | 5966 | { |
741ac903 | 5967 | const_tree const type = ((const struct type_hash *) p)->type; |
6abba055 RK |
5968 | |
5969 | return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type); | |
d88f311b ML |
5970 | } |
5971 | ||
d88f311b | 5972 | static void |
46c5ad27 | 5973 | print_type_hash_statistics (void) |
d88f311b | 5974 | { |
770ae6cc RK |
5975 | fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n", |
5976 | (long) htab_size (type_hash_table), | |
5977 | (long) htab_elements (type_hash_table), | |
d88f311b | 5978 | htab_collisions (type_hash_table)); |
87ff9c8e RH |
5979 | } |
5980 | ||
2a3c15b5 DE |
5981 | /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes |
5982 | with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots), | |
5983 | by adding the hash codes of the individual attributes. */ | |
3e3d7e77 | 5984 | |
9566a759 KG |
5985 | static unsigned int |
5986 | attribute_hash_list (const_tree list, hashval_t hashcode) | |
3e3d7e77 | 5987 | { |
9566a759 | 5988 | const_tree tail; |
d4b60170 | 5989 | |
fd917e0d | 5990 | for (tail = list; tail; tail = TREE_CHAIN (tail)) |
2a3c15b5 | 5991 | /* ??? Do we want to add in TREE_VALUE too? */ |
fd917e0d JM |
5992 | hashcode = iterative_hash_object |
5993 | (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode); | |
2a3c15b5 | 5994 | return hashcode; |
3e3d7e77 RK |
5995 | } |
5996 | ||
91e97eb8 RK |
5997 | /* Given two lists of attributes, return true if list l2 is |
5998 | equivalent to l1. */ | |
5999 | ||
6000 | int | |
9678086d | 6001 | attribute_list_equal (const_tree l1, const_tree l2) |
91e97eb8 | 6002 | { |
3b03c671 KH |
6003 | return attribute_list_contained (l1, l2) |
6004 | && attribute_list_contained (l2, l1); | |
91e97eb8 RK |
6005 | } |
6006 | ||
2a3c15b5 DE |
6007 | /* Given two lists of attributes, return true if list L2 is |
6008 | completely contained within L1. */ | |
6009 | /* ??? This would be faster if attribute names were stored in a canonicalized | |
6010 | form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method | |
6011 | must be used to show these elements are equivalent (which they are). */ | |
6012 | /* ??? It's not clear that attributes with arguments will always be handled | |
6013 | correctly. */ | |
91e97eb8 RK |
6014 | |
6015 | int | |
9678086d | 6016 | attribute_list_contained (const_tree l1, const_tree l2) |
91e97eb8 | 6017 | { |
9678086d | 6018 | const_tree t1, t2; |
91e97eb8 RK |
6019 | |
6020 | /* First check the obvious, maybe the lists are identical. */ | |
6021 | if (l1 == l2) | |
dc478a5d | 6022 | return 1; |
91e97eb8 | 6023 | |
2a3c15b5 | 6024 | /* Maybe the lists are similar. */ |
91e97eb8 | 6025 | for (t1 = l1, t2 = l2; |
d4b60170 | 6026 | t1 != 0 && t2 != 0 |
2a3c15b5 | 6027 | && TREE_PURPOSE (t1) == TREE_PURPOSE (t2) |
91e97eb8 RK |
6028 | && TREE_VALUE (t1) == TREE_VALUE (t2); |
6029 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)); | |
6030 | ||
6031 | /* Maybe the lists are equal. */ | |
6032 | if (t1 == 0 && t2 == 0) | |
a01da83b | 6033 | return 1; |
91e97eb8 | 6034 | |
d4b60170 | 6035 | for (; t2 != 0; t2 = TREE_CHAIN (t2)) |
2a3c15b5 | 6036 | { |
9678086d | 6037 | const_tree attr; |
75547801 KG |
6038 | /* This CONST_CAST is okay because lookup_attribute does not |
6039 | modify its argument and the return value is assigned to a | |
6040 | const_tree. */ | |
6041 | for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), | |
b1d5455a | 6042 | CONST_CAST_TREE(l1)); |
91d231cb | 6043 | attr != NULL_TREE; |
75547801 KG |
6044 | attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), |
6045 | TREE_CHAIN (attr))) | |
91d231cb | 6046 | { |
fcb99e7b JJ |
6047 | if (TREE_VALUE (t2) != NULL |
6048 | && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST | |
6049 | && TREE_VALUE (attr) != NULL | |
6050 | && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST) | |
6051 | { | |
6052 | if (simple_cst_list_equal (TREE_VALUE (t2), | |
6053 | TREE_VALUE (attr)) == 1) | |
6054 | break; | |
6055 | } | |
6056 | else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1) | |
91d231cb JM |
6057 | break; |
6058 | } | |
2a3c15b5 | 6059 | |
d4b60170 | 6060 | if (attr == 0) |
91e97eb8 | 6061 | return 0; |
2a3c15b5 | 6062 | } |
3e3d7e77 | 6063 | |
91e97eb8 RK |
6064 | return 1; |
6065 | } | |
6066 | ||
c6a1db6c RS |
6067 | /* Given two lists of types |
6068 | (chains of TREE_LIST nodes with types in the TREE_VALUE slots) | |
6069 | return 1 if the lists contain the same types in the same order. | |
6070 | Also, the TREE_PURPOSEs must match. */ | |
6071 | ||
6072 | int | |
fa233e34 | 6073 | type_list_equal (const_tree l1, const_tree l2) |
c6a1db6c | 6074 | { |
fa233e34 | 6075 | const_tree t1, t2; |
364e1f1c | 6076 | |
c6a1db6c | 6077 | for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)) |
364e1f1c RK |
6078 | if (TREE_VALUE (t1) != TREE_VALUE (t2) |
6079 | || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2) | |
bbda4250 JM |
6080 | && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)) |
6081 | && (TREE_TYPE (TREE_PURPOSE (t1)) | |
6082 | == TREE_TYPE (TREE_PURPOSE (t2)))))) | |
364e1f1c | 6083 | return 0; |
c6a1db6c RS |
6084 | |
6085 | return t1 == t2; | |
6086 | } | |
6087 | ||
f5d6a24c MM |
6088 | /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE |
6089 | given by TYPE. If the argument list accepts variable arguments, | |
6090 | then this function counts only the ordinary arguments. */ | |
6091 | ||
6092 | int | |
9566a759 | 6093 | type_num_arguments (const_tree type) |
f5d6a24c MM |
6094 | { |
6095 | int i = 0; | |
6096 | tree t; | |
6097 | ||
6098 | for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t)) | |
6099 | /* If the function does not take a variable number of arguments, | |
6100 | the last element in the list will have type `void'. */ | |
6101 | if (VOID_TYPE_P (TREE_VALUE (t))) | |
6102 | break; | |
6103 | else | |
6104 | ++i; | |
6105 | ||
6106 | return i; | |
6107 | } | |
6108 | ||
c6a1db6c RS |
6109 | /* Nonzero if integer constants T1 and T2 |
6110 | represent the same constant value. */ | |
6111 | ||
6112 | int | |
9566a759 | 6113 | tree_int_cst_equal (const_tree t1, const_tree t2) |
c6a1db6c RS |
6114 | { |
6115 | if (t1 == t2) | |
6116 | return 1; | |
d4b60170 | 6117 | |
c6a1db6c RS |
6118 | if (t1 == 0 || t2 == 0) |
6119 | return 0; | |
d4b60170 | 6120 | |
c6a1db6c RS |
6121 | if (TREE_CODE (t1) == INTEGER_CST |
6122 | && TREE_CODE (t2) == INTEGER_CST | |
6123 | && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) | |
6124 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2)) | |
6125 | return 1; | |
d4b60170 | 6126 | |
c6a1db6c RS |
6127 | return 0; |
6128 | } | |
6129 | ||
6130 | /* Nonzero if integer constants T1 and T2 represent values that satisfy <. | |
6131 | The precise way of comparison depends on their data type. */ | |
6132 | ||
6133 | int | |
9566a759 | 6134 | tree_int_cst_lt (const_tree t1, const_tree t2) |
c6a1db6c RS |
6135 | { |
6136 | if (t1 == t2) | |
6137 | return 0; | |
6138 | ||
8df83eae | 6139 | if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2))) |
b13ab42c AO |
6140 | { |
6141 | int t1_sgn = tree_int_cst_sgn (t1); | |
6142 | int t2_sgn = tree_int_cst_sgn (t2); | |
6143 | ||
6144 | if (t1_sgn < t2_sgn) | |
6145 | return 1; | |
6146 | else if (t1_sgn > t2_sgn) | |
6147 | return 0; | |
6148 | /* Otherwise, both are non-negative, so we compare them as | |
6149 | unsigned just in case one of them would overflow a signed | |
6150 | type. */ | |
6151 | } | |
8df83eae | 6152 | else if (!TYPE_UNSIGNED (TREE_TYPE (t1))) |
c6a1db6c | 6153 | return INT_CST_LT (t1, t2); |
d4b60170 | 6154 | |
c6a1db6c RS |
6155 | return INT_CST_LT_UNSIGNED (t1, t2); |
6156 | } | |
6157 | ||
56cb9733 MM |
6158 | /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */ |
6159 | ||
6160 | int | |
9566a759 | 6161 | tree_int_cst_compare (const_tree t1, const_tree t2) |
56cb9733 MM |
6162 | { |
6163 | if (tree_int_cst_lt (t1, t2)) | |
6164 | return -1; | |
6165 | else if (tree_int_cst_lt (t2, t1)) | |
6166 | return 1; | |
3b03c671 | 6167 | else |
56cb9733 MM |
6168 | return 0; |
6169 | } | |
6170 | ||
4636c87e JJ |
6171 | /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on |
6172 | the host. If POS is zero, the value can be represented in a single | |
9f36bc49 | 6173 | HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can |
4636c87e | 6174 | be represented in a single unsigned HOST_WIDE_INT. */ |
665f2503 RK |
6175 | |
6176 | int | |
9566a759 | 6177 | host_integerp (const_tree t, int pos) |
665f2503 | 6178 | { |
4537ec0c DN |
6179 | if (t == NULL_TREE) |
6180 | return 0; | |
6181 | ||
665f2503 | 6182 | return (TREE_CODE (t) == INTEGER_CST |
665f2503 RK |
6183 | && ((TREE_INT_CST_HIGH (t) == 0 |
6184 | && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0) | |
6185 | || (! pos && TREE_INT_CST_HIGH (t) == -1 | |
4636c87e | 6186 | && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0 |
ab5b8382 | 6187 | && (!TYPE_UNSIGNED (TREE_TYPE (t)) |
cbad2e09 RG |
6188 | || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE |
6189 | && TYPE_IS_SIZETYPE (TREE_TYPE (t))))) | |
4636c87e | 6190 | || (pos && TREE_INT_CST_HIGH (t) == 0))); |
665f2503 RK |
6191 | } |
6192 | ||
6193 | /* Return the HOST_WIDE_INT least significant bits of T if it is an | |
6194 | INTEGER_CST and there is no overflow. POS is nonzero if the result must | |
9f36bc49 | 6195 | be non-negative. We must be able to satisfy the above conditions. */ |
665f2503 RK |
6196 | |
6197 | HOST_WIDE_INT | |
9566a759 | 6198 | tree_low_cst (const_tree t, int pos) |
665f2503 | 6199 | { |
1e128c5f GB |
6200 | gcc_assert (host_integerp (t, pos)); |
6201 | return TREE_INT_CST_LOW (t); | |
dc478a5d | 6202 | } |
665f2503 | 6203 | |
4694840a OH |
6204 | /* Return the most significant bit of the integer constant T. */ |
6205 | ||
6206 | int | |
9566a759 | 6207 | tree_int_cst_msb (const_tree t) |
4694840a OH |
6208 | { |
6209 | int prec; | |
6210 | HOST_WIDE_INT h; | |
6211 | unsigned HOST_WIDE_INT l; | |
6212 | ||
6213 | /* Note that using TYPE_PRECISION here is wrong. We care about the | |
6214 | actual bits, not the (arbitrary) range of the type. */ | |
6215 | prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1; | |
6216 | rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec, | |
6217 | 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0); | |
6218 | return (l & 1) == 1; | |
6219 | } | |
6220 | ||
6d9cb074 RK |
6221 | /* Return an indication of the sign of the integer constant T. |
6222 | The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0. | |
f85f1ca7 | 6223 | Note that -1 will never be returned if T's type is unsigned. */ |
6d9cb074 RK |
6224 | |
6225 | int | |
9566a759 | 6226 | tree_int_cst_sgn (const_tree t) |
6d9cb074 RK |
6227 | { |
6228 | if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0) | |
6229 | return 0; | |
8df83eae | 6230 | else if (TYPE_UNSIGNED (TREE_TYPE (t))) |
6d9cb074 RK |
6231 | return 1; |
6232 | else if (TREE_INT_CST_HIGH (t) < 0) | |
6233 | return -1; | |
6234 | else | |
6235 | return 1; | |
6236 | } | |
6237 | ||
cdd6a337 MLI |
6238 | /* Return the minimum number of bits needed to represent VALUE in a |
6239 | signed or unsigned type, UNSIGNEDP says which. */ | |
6240 | ||
6241 | unsigned int | |
6242 | tree_int_cst_min_precision (tree value, bool unsignedp) | |
6243 | { | |
6244 | int log; | |
6245 | ||
6246 | /* If the value is negative, compute its negative minus 1. The latter | |
6247 | adjustment is because the absolute value of the largest negative value | |
6248 | is one larger than the largest positive value. This is equivalent to | |
6249 | a bit-wise negation, so use that operation instead. */ | |
6250 | ||
6251 | if (tree_int_cst_sgn (value) < 0) | |
6252 | value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value); | |
6253 | ||
6254 | /* Return the number of bits needed, taking into account the fact | |
6255 | that we need one more bit for a signed than unsigned type. */ | |
6256 | ||
6257 | if (integer_zerop (value)) | |
6258 | log = 0; | |
6259 | else | |
6260 | log = tree_floor_log2 (value); | |
6261 | ||
6262 | return log + 1 + !unsignedp; | |
6263 | } | |
6264 | ||
364e1f1c RK |
6265 | /* Compare two constructor-element-type constants. Return 1 if the lists |
6266 | are known to be equal; otherwise return 0. */ | |
6267 | ||
c6a1db6c | 6268 | int |
9566a759 | 6269 | simple_cst_list_equal (const_tree l1, const_tree l2) |
c6a1db6c RS |
6270 | { |
6271 | while (l1 != NULL_TREE && l2 != NULL_TREE) | |
6272 | { | |
364e1f1c | 6273 | if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1) |
c6a1db6c | 6274 | return 0; |
364e1f1c | 6275 | |
c6a1db6c RS |
6276 | l1 = TREE_CHAIN (l1); |
6277 | l2 = TREE_CHAIN (l2); | |
6278 | } | |
364e1f1c | 6279 | |
d4b60170 | 6280 | return l1 == l2; |
c6a1db6c RS |
6281 | } |
6282 | ||
6283 | /* Return truthvalue of whether T1 is the same tree structure as T2. | |
6284 | Return 1 if they are the same. | |
6285 | Return 0 if they are understandably different. | |
6286 | Return -1 if either contains tree structure not understood by | |
6287 | this function. */ | |
6288 | ||
6289 | int | |
fa233e34 | 6290 | simple_cst_equal (const_tree t1, const_tree t2) |
c6a1db6c | 6291 | { |
b3694847 | 6292 | enum tree_code code1, code2; |
c6a1db6c | 6293 | int cmp; |
d4b60170 | 6294 | int i; |
c6a1db6c RS |
6295 | |
6296 | if (t1 == t2) | |
6297 | return 1; | |
6298 | if (t1 == 0 || t2 == 0) | |
6299 | return 0; | |
6300 | ||
6301 | code1 = TREE_CODE (t1); | |
6302 | code2 = TREE_CODE (t2); | |
6303 | ||
1a87cf0c | 6304 | if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR) |
af79bb86 | 6305 | { |
1a87cf0c | 6306 | if (CONVERT_EXPR_CODE_P (code2) |
af79bb86 JM |
6307 | || code2 == NON_LVALUE_EXPR) |
6308 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
6309 | else | |
6310 | return simple_cst_equal (TREE_OPERAND (t1, 0), t2); | |
6311 | } | |
d4b60170 | 6312 | |
1a87cf0c | 6313 | else if (CONVERT_EXPR_CODE_P (code2) |
c6a1db6c RS |
6314 | || code2 == NON_LVALUE_EXPR) |
6315 | return simple_cst_equal (t1, TREE_OPERAND (t2, 0)); | |
6316 | ||
6317 | if (code1 != code2) | |
6318 | return 0; | |
6319 | ||
6320 | switch (code1) | |
6321 | { | |
6322 | case INTEGER_CST: | |
d4b60170 RK |
6323 | return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) |
6324 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2)); | |
c6a1db6c RS |
6325 | |
6326 | case REAL_CST: | |
41c9120b | 6327 | return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2)); |
c6a1db6c | 6328 | |
325217ed CF |
6329 | case FIXED_CST: |
6330 | return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2)); | |
6331 | ||
c6a1db6c | 6332 | case STRING_CST: |
d4b60170 | 6333 | return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) |
da61dec9 | 6334 | && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), |
d4b60170 | 6335 | TREE_STRING_LENGTH (t1))); |
c6a1db6c RS |
6336 | |
6337 | case CONSTRUCTOR: | |
4038c495 GB |
6338 | { |
6339 | unsigned HOST_WIDE_INT idx; | |
6340 | VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1); | |
6341 | VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2); | |
6342 | ||
6343 | if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2)) | |
6344 | return false; | |
6345 | ||
6346 | for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx) | |
6347 | /* ??? Should we handle also fields here? */ | |
6348 | if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value, | |
6349 | VEC_index (constructor_elt, v2, idx)->value)) | |
6350 | return false; | |
6351 | return true; | |
6352 | } | |
c6a1db6c RS |
6353 | |
6354 | case SAVE_EXPR: | |
6355 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
6356 | ||
6357 | case CALL_EXPR: | |
5039610b | 6358 | cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)); |
c6a1db6c RS |
6359 | if (cmp <= 0) |
6360 | return cmp; | |
5039610b SL |
6361 | if (call_expr_nargs (t1) != call_expr_nargs (t2)) |
6362 | return 0; | |
6363 | { | |
fa233e34 KG |
6364 | const_tree arg1, arg2; |
6365 | const_call_expr_arg_iterator iter1, iter2; | |
6366 | for (arg1 = first_const_call_expr_arg (t1, &iter1), | |
6367 | arg2 = first_const_call_expr_arg (t2, &iter2); | |
5039610b | 6368 | arg1 && arg2; |
fa233e34 KG |
6369 | arg1 = next_const_call_expr_arg (&iter1), |
6370 | arg2 = next_const_call_expr_arg (&iter2)) | |
5039610b SL |
6371 | { |
6372 | cmp = simple_cst_equal (arg1, arg2); | |
6373 | if (cmp <= 0) | |
6374 | return cmp; | |
6375 | } | |
6376 | return arg1 == arg2; | |
6377 | } | |
c6a1db6c RS |
6378 | |
6379 | case TARGET_EXPR: | |
6380 | /* Special case: if either target is an unallocated VAR_DECL, | |
6381 | it means that it's going to be unified with whatever the | |
6382 | TARGET_EXPR is really supposed to initialize, so treat it | |
6383 | as being equivalent to anything. */ | |
6384 | if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL | |
6385 | && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE | |
19e7881c | 6386 | && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0))) |
c6a1db6c RS |
6387 | || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL |
6388 | && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE | |
19e7881c | 6389 | && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0)))) |
c6a1db6c RS |
6390 | cmp = 1; |
6391 | else | |
6392 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
d4b60170 | 6393 | |
c6a1db6c RS |
6394 | if (cmp <= 0) |
6395 | return cmp; | |
d4b60170 | 6396 | |
c6a1db6c RS |
6397 | return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); |
6398 | ||
6399 | case WITH_CLEANUP_EXPR: | |
6400 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
6401 | if (cmp <= 0) | |
6402 | return cmp; | |
d4b60170 | 6403 | |
6ad7895a | 6404 | return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1)); |
c6a1db6c RS |
6405 | |
6406 | case COMPONENT_REF: | |
6407 | if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1)) | |
6408 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
d4b60170 | 6409 | |
c6a1db6c RS |
6410 | return 0; |
6411 | ||
c6a1db6c RS |
6412 | case VAR_DECL: |
6413 | case PARM_DECL: | |
6414 | case CONST_DECL: | |
6415 | case FUNCTION_DECL: | |
6416 | return 0; | |
dc478a5d | 6417 | |
e9a25f70 JL |
6418 | default: |
6419 | break; | |
86aed40b | 6420 | } |
c6a1db6c | 6421 | |
8ae49a28 RK |
6422 | /* This general rule works for most tree codes. All exceptions should be |
6423 | handled above. If this is a language-specific tree code, we can't | |
6424 | trust what might be in the operand, so say we don't know | |
6425 | the situation. */ | |
0a6969ad | 6426 | if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE) |
8ae49a28 | 6427 | return -1; |
c6a1db6c | 6428 | |
86aed40b RS |
6429 | switch (TREE_CODE_CLASS (code1)) |
6430 | { | |
6615c446 JO |
6431 | case tcc_unary: |
6432 | case tcc_binary: | |
6433 | case tcc_comparison: | |
6434 | case tcc_expression: | |
6435 | case tcc_reference: | |
6436 | case tcc_statement: | |
86aed40b | 6437 | cmp = 1; |
8d5e6e25 | 6438 | for (i = 0; i < TREE_CODE_LENGTH (code1); i++) |
86aed40b RS |
6439 | { |
6440 | cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)); | |
6441 | if (cmp <= 0) | |
6442 | return cmp; | |
6443 | } | |
d4b60170 | 6444 | |
86aed40b | 6445 | return cmp; |
86aed40b | 6446 | |
e9a25f70 JL |
6447 | default: |
6448 | return -1; | |
6449 | } | |
c6a1db6c | 6450 | } |
05bccae2 RK |
6451 | |
6452 | /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value. | |
6453 | Return -1, 0, or 1 if the value of T is less than, equal to, or greater | |
6454 | than U, respectively. */ | |
6455 | ||
6456 | int | |
9566a759 | 6457 | compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u) |
05bccae2 RK |
6458 | { |
6459 | if (tree_int_cst_sgn (t) < 0) | |
6460 | return -1; | |
6461 | else if (TREE_INT_CST_HIGH (t) != 0) | |
6462 | return 1; | |
6463 | else if (TREE_INT_CST_LOW (t) == u) | |
6464 | return 0; | |
6465 | else if (TREE_INT_CST_LOW (t) < u) | |
6466 | return -1; | |
6467 | else | |
6468 | return 1; | |
6469 | } | |
03307888 | 6470 | |
3168cb99 JL |
6471 | /* Return true if CODE represents an associative tree code. Otherwise |
6472 | return false. */ | |
6473 | bool | |
6474 | associative_tree_code (enum tree_code code) | |
6475 | { | |
6476 | switch (code) | |
6477 | { | |
6478 | case BIT_IOR_EXPR: | |
6479 | case BIT_AND_EXPR: | |
6480 | case BIT_XOR_EXPR: | |
6481 | case PLUS_EXPR: | |
3168cb99 | 6482 | case MULT_EXPR: |
3168cb99 JL |
6483 | case MIN_EXPR: |
6484 | case MAX_EXPR: | |
6485 | return true; | |
6486 | ||
6487 | default: | |
6488 | break; | |
6489 | } | |
6490 | return false; | |
6491 | } | |
6492 | ||
1f838355 | 6493 | /* Return true if CODE represents a commutative tree code. Otherwise |
3168cb99 JL |
6494 | return false. */ |
6495 | bool | |
6496 | commutative_tree_code (enum tree_code code) | |
6497 | { | |
6498 | switch (code) | |
6499 | { | |
6500 | case PLUS_EXPR: | |
6501 | case MULT_EXPR: | |
6502 | case MIN_EXPR: | |
6503 | case MAX_EXPR: | |
6504 | case BIT_IOR_EXPR: | |
6505 | case BIT_XOR_EXPR: | |
6506 | case BIT_AND_EXPR: | |
6507 | case NE_EXPR: | |
6508 | case EQ_EXPR: | |
54d581a2 RS |
6509 | case UNORDERED_EXPR: |
6510 | case ORDERED_EXPR: | |
6511 | case UNEQ_EXPR: | |
6512 | case LTGT_EXPR: | |
6513 | case TRUTH_AND_EXPR: | |
6514 | case TRUTH_XOR_EXPR: | |
6515 | case TRUTH_OR_EXPR: | |
3168cb99 JL |
6516 | return true; |
6517 | ||
6518 | default: | |
6519 | break; | |
6520 | } | |
6521 | return false; | |
6522 | } | |
6523 | ||
03307888 | 6524 | /* Generate a hash value for an expression. This can be used iteratively |
726a989a | 6525 | by passing a previous result as the VAL argument. |
03307888 JM |
6526 | |
6527 | This function is intended to produce the same hash for expressions which | |
6528 | would compare equal using operand_equal_p. */ | |
6529 | ||
6530 | hashval_t | |
9566a759 | 6531 | iterative_hash_expr (const_tree t, hashval_t val) |
03307888 JM |
6532 | { |
6533 | int i; | |
6534 | enum tree_code code; | |
82d6e6fc | 6535 | char tclass; |
03307888 JM |
6536 | |
6537 | if (t == NULL_TREE) | |
72b9acff | 6538 | return iterative_hash_hashval_t (0, val); |
03307888 JM |
6539 | |
6540 | code = TREE_CODE (t); | |
03307888 | 6541 | |
caf29de7 | 6542 | switch (code) |
03307888 | 6543 | { |
caf29de7 JH |
6544 | /* Alas, constants aren't shared, so we can't rely on pointer |
6545 | identity. */ | |
6546 | case INTEGER_CST: | |
6547 | val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val); | |
6548 | return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val); | |
6549 | case REAL_CST: | |
6550 | { | |
6551 | unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t)); | |
f29b9db9 | 6552 | |
325217ed CF |
6553 | return iterative_hash_hashval_t (val2, val); |
6554 | } | |
6555 | case FIXED_CST: | |
6556 | { | |
6557 | unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t)); | |
6558 | ||
caf29de7 JH |
6559 | return iterative_hash_hashval_t (val2, val); |
6560 | } | |
6561 | case STRING_CST: | |
6562 | return iterative_hash (TREE_STRING_POINTER (t), | |
6563 | TREE_STRING_LENGTH (t), val); | |
6564 | case COMPLEX_CST: | |
6565 | val = iterative_hash_expr (TREE_REALPART (t), val); | |
6566 | return iterative_hash_expr (TREE_IMAGPART (t), val); | |
6567 | case VECTOR_CST: | |
6568 | return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val); | |
6569 | ||
6570 | case SSA_NAME: | |
caf29de7 | 6571 | /* we can just compare by pointer. */ |
72b9acff | 6572 | return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val); |
caf29de7 JH |
6573 | |
6574 | case TREE_LIST: | |
6575 | /* A list of expressions, for a CALL_EXPR or as the elements of a | |
6576 | VECTOR_CST. */ | |
6577 | for (; t; t = TREE_CHAIN (t)) | |
6578 | val = iterative_hash_expr (TREE_VALUE (t), val); | |
6579 | return val; | |
4038c495 GB |
6580 | case CONSTRUCTOR: |
6581 | { | |
6582 | unsigned HOST_WIDE_INT idx; | |
6583 | tree field, value; | |
6584 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value) | |
6585 | { | |
6586 | val = iterative_hash_expr (field, val); | |
6587 | val = iterative_hash_expr (value, val); | |
6588 | } | |
6589 | return val; | |
6590 | } | |
d070d4fd | 6591 | case FUNCTION_DECL: |
d021d274 MM |
6592 | /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form. |
6593 | Otherwise nodes that compare equal according to operand_equal_p might | |
6594 | get different hash codes. However, don't do this for machine specific | |
6595 | or front end builtins, since the function code is overloaded in those | |
6596 | cases. */ | |
6597 | if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL | |
6598 | && built_in_decls[DECL_FUNCTION_CODE (t)]) | |
d070d4fd | 6599 | { |
72b9acff AO |
6600 | t = built_in_decls[DECL_FUNCTION_CODE (t)]; |
6601 | code = TREE_CODE (t); | |
d070d4fd | 6602 | } |
72b9acff | 6603 | /* FALL THROUGH */ |
caf29de7 | 6604 | default: |
82d6e6fc | 6605 | tclass = TREE_CODE_CLASS (code); |
03307888 | 6606 | |
82d6e6fc | 6607 | if (tclass == tcc_declaration) |
6de9cd9a | 6608 | { |
27840768 DB |
6609 | /* DECL's have a unique ID */ |
6610 | val = iterative_hash_host_wide_int (DECL_UID (t), val); | |
6de9cd9a | 6611 | } |
1a2caa7a | 6612 | else |
066f50a9 | 6613 | { |
82d6e6fc | 6614 | gcc_assert (IS_EXPR_CODE_CLASS (tclass)); |
b8698a0f | 6615 | |
caf29de7 JH |
6616 | val = iterative_hash_object (code, val); |
6617 | ||
6618 | /* Don't hash the type, that can lead to having nodes which | |
6619 | compare equal according to operand_equal_p, but which | |
6620 | have different hash codes. */ | |
1a87cf0c | 6621 | if (CONVERT_EXPR_CODE_P (code) |
caf29de7 JH |
6622 | || code == NON_LVALUE_EXPR) |
6623 | { | |
6624 | /* Make sure to include signness in the hash computation. */ | |
6625 | val += TYPE_UNSIGNED (TREE_TYPE (t)); | |
6626 | val = iterative_hash_expr (TREE_OPERAND (t, 0), val); | |
6627 | } | |
6628 | ||
6629 | else if (commutative_tree_code (code)) | |
6630 | { | |
6631 | /* It's a commutative expression. We want to hash it the same | |
6632 | however it appears. We do this by first hashing both operands | |
6633 | and then rehashing based on the order of their independent | |
6634 | hashes. */ | |
6635 | hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0); | |
6636 | hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0); | |
6637 | hashval_t t; | |
6638 | ||
6639 | if (one > two) | |
6640 | t = one, one = two, two = t; | |
6641 | ||
6642 | val = iterative_hash_hashval_t (one, val); | |
6643 | val = iterative_hash_hashval_t (two, val); | |
6644 | } | |
6645 | else | |
5039610b | 6646 | for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i) |
caf29de7 | 6647 | val = iterative_hash_expr (TREE_OPERAND (t, i), val); |
066f50a9 | 6648 | } |
caf29de7 JH |
6649 | return val; |
6650 | break; | |
6de9cd9a | 6651 | } |
03307888 | 6652 | } |
726a989a RB |
6653 | |
6654 | /* Generate a hash value for a pair of expressions. This can be used | |
6655 | iteratively by passing a previous result as the VAL argument. | |
6656 | ||
6657 | The same hash value is always returned for a given pair of expressions, | |
6658 | regardless of the order in which they are presented. This is useful in | |
6659 | hashing the operands of commutative functions. */ | |
6660 | ||
6661 | hashval_t | |
6662 | iterative_hash_exprs_commutative (const_tree t1, | |
6663 | const_tree t2, hashval_t val) | |
6664 | { | |
6665 | hashval_t one = iterative_hash_expr (t1, 0); | |
6666 | hashval_t two = iterative_hash_expr (t2, 0); | |
6667 | hashval_t t; | |
6668 | ||
6669 | if (one > two) | |
6670 | t = one, one = two, two = t; | |
6671 | val = iterative_hash_hashval_t (one, val); | |
6672 | val = iterative_hash_hashval_t (two, val); | |
6673 | ||
6674 | return val; | |
6675 | } | |
c6a1db6c RS |
6676 | \f |
6677 | /* Constructors for pointer, array and function types. | |
6678 | (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are | |
6679 | constructed by language-dependent code, not here.) */ | |
6680 | ||
22421b79 RK |
6681 | /* Construct, lay out and return the type of pointers to TO_TYPE with |
6682 | mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can | |
6683 | reference all of memory. If such a type has already been | |
6684 | constructed, reuse it. */ | |
c6a1db6c RS |
6685 | |
6686 | tree | |
22421b79 RK |
6687 | build_pointer_type_for_mode (tree to_type, enum machine_mode mode, |
6688 | bool can_alias_all) | |
c6a1db6c | 6689 | { |
22421b79 RK |
6690 | tree t; |
6691 | ||
a4faac50 JM |
6692 | if (to_type == error_mark_node) |
6693 | return error_mark_node; | |
6694 | ||
ac7ee6ad RG |
6695 | /* If the pointed-to type has the may_alias attribute set, force |
6696 | a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */ | |
6697 | if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type))) | |
6698 | can_alias_all = true; | |
6699 | ||
22421b79 RK |
6700 | /* In some cases, languages will have things that aren't a POINTER_TYPE |
6701 | (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO. | |
6702 | In that case, return that type without regard to the rest of our | |
6703 | operands. | |
6704 | ||
6705 | ??? This is a kludge, but consistent with the way this function has | |
6706 | always operated and there doesn't seem to be a good way to avoid this | |
6707 | at the moment. */ | |
6708 | if (TYPE_POINTER_TO (to_type) != 0 | |
6709 | && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE) | |
6710 | return TYPE_POINTER_TO (to_type); | |
c6a1db6c | 6711 | |
3f0dc66b EB |
6712 | /* First, if we already have a type for pointers to TO_TYPE and it's |
6713 | the proper mode, use it. */ | |
22421b79 | 6714 | for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t)) |
3f0dc66b | 6715 | if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all) |
22421b79 | 6716 | return t; |
c6a1db6c | 6717 | |
c6a1db6c | 6718 | t = make_node (POINTER_TYPE); |
d9cbc259 | 6719 | |
c6a1db6c | 6720 | TREE_TYPE (t) = to_type; |
179d2f74 | 6721 | SET_TYPE_MODE (t, mode); |
22421b79 RK |
6722 | TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all; |
6723 | TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type); | |
6724 | TYPE_POINTER_TO (to_type) = t; | |
c6a1db6c | 6725 | |
06d40de8 DG |
6726 | if (TYPE_STRUCTURAL_EQUALITY_P (to_type)) |
6727 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
6728 | else if (TYPE_CANONICAL (to_type) != to_type) | |
6729 | TYPE_CANONICAL (t) | |
6730 | = build_pointer_type_for_mode (TYPE_CANONICAL (to_type), | |
6731 | mode, can_alias_all); | |
6732 | ||
c6a1db6c | 6733 | /* Lay out the type. This function has many callers that are concerned |
20475e78 | 6734 | with expression-construction, and this simplifies them all. */ |
c6a1db6c RS |
6735 | layout_type (t); |
6736 | ||
c6a1db6c RS |
6737 | return t; |
6738 | } | |
6739 | ||
4977bab6 | 6740 | /* By default build pointers in ptr_mode. */ |
d4b60170 RK |
6741 | |
6742 | tree | |
46c5ad27 | 6743 | build_pointer_type (tree to_type) |
4977bab6 | 6744 | { |
d4ebfa65 BE |
6745 | addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC |
6746 | : TYPE_ADDR_SPACE (to_type); | |
6747 | enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as); | |
6748 | return build_pointer_type_for_mode (to_type, pointer_mode, false); | |
4977bab6 ZW |
6749 | } |
6750 | ||
22421b79 | 6751 | /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */ |
4977bab6 ZW |
6752 | |
6753 | tree | |
22421b79 RK |
6754 | build_reference_type_for_mode (tree to_type, enum machine_mode mode, |
6755 | bool can_alias_all) | |
d4b60170 | 6756 | { |
22421b79 | 6757 | tree t; |
d4b60170 | 6758 | |
ac7ee6ad RG |
6759 | if (to_type == error_mark_node) |
6760 | return error_mark_node; | |
6761 | ||
6762 | /* If the pointed-to type has the may_alias attribute set, force | |
6763 | a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */ | |
6764 | if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type))) | |
6765 | can_alias_all = true; | |
6766 | ||
22421b79 RK |
6767 | /* In some cases, languages will have things that aren't a REFERENCE_TYPE |
6768 | (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO. | |
6769 | In that case, return that type without regard to the rest of our | |
6770 | operands. | |
6771 | ||
6772 | ??? This is a kludge, but consistent with the way this function has | |
6773 | always operated and there doesn't seem to be a good way to avoid this | |
6774 | at the moment. */ | |
6775 | if (TYPE_REFERENCE_TO (to_type) != 0 | |
6776 | && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE) | |
6777 | return TYPE_REFERENCE_TO (to_type); | |
6778 | ||
3f0dc66b EB |
6779 | /* First, if we already have a type for pointers to TO_TYPE and it's |
6780 | the proper mode, use it. */ | |
22421b79 | 6781 | for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t)) |
3f0dc66b | 6782 | if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all) |
22421b79 | 6783 | return t; |
d4b60170 | 6784 | |
d4b60170 | 6785 | t = make_node (REFERENCE_TYPE); |
d4b60170 RK |
6786 | |
6787 | TREE_TYPE (t) = to_type; | |
179d2f74 | 6788 | SET_TYPE_MODE (t, mode); |
22421b79 RK |
6789 | TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all; |
6790 | TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type); | |
d4b60170 RK |
6791 | TYPE_REFERENCE_TO (to_type) = t; |
6792 | ||
06d40de8 DG |
6793 | if (TYPE_STRUCTURAL_EQUALITY_P (to_type)) |
6794 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
6795 | else if (TYPE_CANONICAL (to_type) != to_type) | |
b8698a0f | 6796 | TYPE_CANONICAL (t) |
06d40de8 DG |
6797 | = build_reference_type_for_mode (TYPE_CANONICAL (to_type), |
6798 | mode, can_alias_all); | |
6799 | ||
d4b60170 RK |
6800 | layout_type (t); |
6801 | ||
6802 | return t; | |
6803 | } | |
6804 | ||
4977bab6 ZW |
6805 | |
6806 | /* Build the node for the type of references-to-TO_TYPE by default | |
6807 | in ptr_mode. */ | |
6808 | ||
6809 | tree | |
46c5ad27 | 6810 | build_reference_type (tree to_type) |
4977bab6 | 6811 | { |
d4ebfa65 BE |
6812 | addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC |
6813 | : TYPE_ADDR_SPACE (to_type); | |
6814 | enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as); | |
6815 | return build_reference_type_for_mode (to_type, pointer_mode, false); | |
4977bab6 ZW |
6816 | } |
6817 | ||
12e1243e AH |
6818 | /* Build a type that is compatible with t but has no cv quals anywhere |
6819 | in its type, thus | |
6820 | ||
6821 | const char *const *const * -> char ***. */ | |
6822 | ||
6823 | tree | |
46c5ad27 | 6824 | build_type_no_quals (tree t) |
12e1243e AH |
6825 | { |
6826 | switch (TREE_CODE (t)) | |
6827 | { | |
6828 | case POINTER_TYPE: | |
7548281d | 6829 | return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)), |
22421b79 RK |
6830 | TYPE_MODE (t), |
6831 | TYPE_REF_CAN_ALIAS_ALL (t)); | |
12e1243e | 6832 | case REFERENCE_TYPE: |
7548281d RK |
6833 | return |
6834 | build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)), | |
22421b79 RK |
6835 | TYPE_MODE (t), |
6836 | TYPE_REF_CAN_ALIAS_ALL (t)); | |
12e1243e AH |
6837 | default: |
6838 | return TYPE_MAIN_VARIANT (t); | |
6839 | } | |
6840 | } | |
6841 | ||
c6a1db6c RS |
6842 | /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE. |
6843 | MAXVAL should be the maximum value in the domain | |
e9a25f70 JL |
6844 | (one less than the length of the array). |
6845 | ||
6846 | The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT. | |
6847 | We don't enforce this limit, that is up to caller (e.g. language front end). | |
6848 | The limit exists because the result is a signed type and we don't handle | |
6849 | sizes that use more than one HOST_WIDE_INT. */ | |
c6a1db6c RS |
6850 | |
6851 | tree | |
46c5ad27 | 6852 | build_index_type (tree maxval) |
c6a1db6c | 6853 | { |
b3694847 | 6854 | tree itype = make_node (INTEGER_TYPE); |
0fd17968 | 6855 | |
770ae6cc | 6856 | TREE_TYPE (itype) = sizetype; |
c6a1db6c | 6857 | TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype); |
967e627a | 6858 | TYPE_MIN_VALUE (itype) = size_zero_node; |
455f19cb | 6859 | TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval); |
179d2f74 | 6860 | SET_TYPE_MODE (itype, TYPE_MODE (sizetype)); |
c6a1db6c | 6861 | TYPE_SIZE (itype) = TYPE_SIZE (sizetype); |
def9b006 | 6862 | TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype); |
c6a1db6c | 6863 | TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype); |
11cf4d18 | 6864 | TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype); |
05bccae2 | 6865 | |
967e627a | 6866 | if (host_integerp (maxval, 1)) |
770ae6cc | 6867 | return type_hash_canon (tree_low_cst (maxval, 1), itype); |
c6a1db6c | 6868 | else |
06d40de8 DG |
6869 | { |
6870 | /* Since we cannot hash this type, we need to compare it using | |
6871 | structural equality checks. */ | |
6872 | SET_TYPE_STRUCTURAL_EQUALITY (itype); | |
6873 | return itype; | |
6874 | } | |
c6a1db6c RS |
6875 | } |
6876 | ||
bc15d0ef JM |
6877 | /* Builds a signed or unsigned integer type of precision PRECISION. |
6878 | Used for C bitfields whose precision does not match that of | |
6879 | built-in target types. */ | |
6880 | tree | |
6881 | build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision, | |
6882 | int unsignedp) | |
6883 | { | |
6884 | tree itype = make_node (INTEGER_TYPE); | |
6885 | ||
6886 | TYPE_PRECISION (itype) = precision; | |
6887 | ||
6888 | if (unsignedp) | |
6889 | fixup_unsigned_type (itype); | |
6890 | else | |
6891 | fixup_signed_type (itype); | |
6892 | ||
6893 | if (host_integerp (TYPE_MAX_VALUE (itype), 1)) | |
6894 | return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype); | |
6895 | ||
6896 | return itype; | |
6897 | } | |
6898 | ||
742e43a2 | 6899 | /* Create a range of some discrete type TYPE (an INTEGER_TYPE, |
71d59383 RS |
6900 | ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and |
6901 | high bound HIGHVAL. If TYPE is NULL, sizetype is used. */ | |
c6a1db6c RS |
6902 | |
6903 | tree | |
46c5ad27 | 6904 | build_range_type (tree type, tree lowval, tree highval) |
c6a1db6c | 6905 | { |
b3694847 | 6906 | tree itype = make_node (INTEGER_TYPE); |
0fd17968 | 6907 | |
742e43a2 PB |
6908 | TREE_TYPE (itype) = type; |
6909 | if (type == NULL_TREE) | |
6910 | type = sizetype; | |
0fd17968 | 6911 | |
3967bc2d RS |
6912 | TYPE_MIN_VALUE (itype) = fold_convert (type, lowval); |
6913 | TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL; | |
0fd17968 RK |
6914 | |
6915 | TYPE_PRECISION (itype) = TYPE_PRECISION (type); | |
179d2f74 | 6916 | SET_TYPE_MODE (itype, TYPE_MODE (type)); |
742e43a2 | 6917 | TYPE_SIZE (itype) = TYPE_SIZE (type); |
28372f41 | 6918 | TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type); |
742e43a2 | 6919 | TYPE_ALIGN (itype) = TYPE_ALIGN (type); |
11cf4d18 | 6920 | TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type); |
e1ee5cdc | 6921 | |
770ae6cc RK |
6922 | if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0)) |
6923 | return type_hash_canon (tree_low_cst (highval, 0) | |
6924 | - tree_low_cst (lowval, 0), | |
6925 | itype); | |
c6a1db6c RS |
6926 | else |
6927 | return itype; | |
6928 | } | |
6929 | ||
84fb43a1 EB |
6930 | /* Return true if the debug information for TYPE, a subtype, should be emitted |
6931 | as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the | |
6932 | high bound, respectively. Sometimes doing so unnecessarily obfuscates the | |
6933 | debug info and doesn't reflect the source code. */ | |
6934 | ||
6935 | bool | |
6936 | subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval) | |
6937 | { | |
6938 | tree base_type = TREE_TYPE (type), low, high; | |
6939 | ||
6940 | /* Subrange types have a base type which is an integral type. */ | |
6941 | if (!INTEGRAL_TYPE_P (base_type)) | |
6942 | return false; | |
6943 | ||
6944 | /* Get the real bounds of the subtype. */ | |
6945 | if (lang_hooks.types.get_subrange_bounds) | |
6946 | lang_hooks.types.get_subrange_bounds (type, &low, &high); | |
6947 | else | |
6948 | { | |
6949 | low = TYPE_MIN_VALUE (type); | |
6950 | high = TYPE_MAX_VALUE (type); | |
6951 | } | |
6952 | ||
6953 | /* If the type and its base type have the same representation and the same | |
6954 | name, then the type is not a subrange but a copy of the base type. */ | |
6955 | if ((TREE_CODE (base_type) == INTEGER_TYPE | |
6956 | || TREE_CODE (base_type) == BOOLEAN_TYPE) | |
6957 | && int_size_in_bytes (type) == int_size_in_bytes (base_type) | |
6958 | && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type)) | |
6959 | && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type))) | |
6960 | { | |
6961 | tree type_name = TYPE_NAME (type); | |
6962 | tree base_type_name = TYPE_NAME (base_type); | |
6963 | ||
6964 | if (type_name && TREE_CODE (type_name) == TYPE_DECL) | |
6965 | type_name = DECL_NAME (type_name); | |
6966 | ||
6967 | if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL) | |
6968 | base_type_name = DECL_NAME (base_type_name); | |
6969 | ||
6970 | if (type_name == base_type_name) | |
6971 | return false; | |
6972 | } | |
6973 | ||
6974 | if (lowval) | |
6975 | *lowval = low; | |
6976 | if (highval) | |
6977 | *highval = high; | |
6978 | return true; | |
6979 | } | |
6980 | ||
742e43a2 | 6981 | /* Just like build_index_type, but takes lowval and highval instead |
0f41302f | 6982 | of just highval (maxval). */ |
742e43a2 PB |
6983 | |
6984 | tree | |
46c5ad27 | 6985 | build_index_2_type (tree lowval, tree highval) |
742e43a2 | 6986 | { |
770ae6cc | 6987 | return build_range_type (sizetype, lowval, highval); |
742e43a2 PB |
6988 | } |
6989 | ||
c6a1db6c RS |
6990 | /* Construct, lay out and return the type of arrays of elements with ELT_TYPE |
6991 | and number of elements specified by the range of values of INDEX_TYPE. | |
6992 | If such a type has already been constructed, reuse it. */ | |
6993 | ||
6994 | tree | |
46c5ad27 | 6995 | build_array_type (tree elt_type, tree index_type) |
c6a1db6c | 6996 | { |
b3694847 | 6997 | tree t; |
fd917e0d | 6998 | hashval_t hashcode = 0; |
c6a1db6c RS |
6999 | |
7000 | if (TREE_CODE (elt_type) == FUNCTION_TYPE) | |
7001 | { | |
7002 | error ("arrays of functions are not meaningful"); | |
7003 | elt_type = integer_type_node; | |
7004 | } | |
7005 | ||
c6a1db6c RS |
7006 | t = make_node (ARRAY_TYPE); |
7007 | TREE_TYPE (t) = elt_type; | |
7008 | TYPE_DOMAIN (t) = index_type; | |
09e881c9 | 7009 | TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type); |
3797a0ff | 7010 | layout_type (t); |
06d40de8 | 7011 | |
3797a0ff RG |
7012 | /* If the element type is incomplete at this point we get marked for |
7013 | structural equality. Do not record these types in the canonical | |
7014 | type hashtable. */ | |
7015 | if (TYPE_STRUCTURAL_EQUALITY_P (t)) | |
7016 | return t; | |
c6a1db6c | 7017 | |
fd917e0d | 7018 | hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode); |
3797a0ff RG |
7019 | if (index_type) |
7020 | hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode); | |
c6a1db6c RS |
7021 | t = type_hash_canon (hashcode, t); |
7022 | ||
06d40de8 DG |
7023 | if (TYPE_CANONICAL (t) == t) |
7024 | { | |
7025 | if (TYPE_STRUCTURAL_EQUALITY_P (elt_type) | |
3797a0ff | 7026 | || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type))) |
06d40de8 DG |
7027 | SET_TYPE_STRUCTURAL_EQUALITY (t); |
7028 | else if (TYPE_CANONICAL (elt_type) != elt_type | |
3797a0ff | 7029 | || (index_type && TYPE_CANONICAL (index_type) != index_type)) |
b8698a0f | 7030 | TYPE_CANONICAL (t) |
06d40de8 | 7031 | = build_array_type (TYPE_CANONICAL (elt_type), |
3797a0ff | 7032 | index_type ? TYPE_CANONICAL (index_type) : NULL); |
06d40de8 DG |
7033 | } |
7034 | ||
c6a1db6c RS |
7035 | return t; |
7036 | } | |
7037 | ||
dd25a747 AM |
7038 | /* Recursively examines the array elements of TYPE, until a non-array |
7039 | element type is found. */ | |
a260abc9 DE |
7040 | |
7041 | tree | |
dd25a747 | 7042 | strip_array_types (tree type) |
a260abc9 | 7043 | { |
a260abc9 DE |
7044 | while (TREE_CODE (type) == ARRAY_TYPE) |
7045 | type = TREE_TYPE (type); | |
7046 | ||
7047 | return type; | |
7048 | } | |
7049 | ||
8de08f4c | 7050 | /* Computes the canonical argument types from the argument type list |
b8698a0f | 7051 | ARGTYPES. |
8de08f4c | 7052 | |
c92b8515 DG |
7053 | Upon return, *ANY_STRUCTURAL_P will be true iff either it was true |
7054 | on entry to this function, or if any of the ARGTYPES are | |
8de08f4c DG |
7055 | structural. |
7056 | ||
c92b8515 DG |
7057 | Upon return, *ANY_NONCANONICAL_P will be true iff either it was |
7058 | true on entry to this function, or if any of the ARGTYPES are | |
7059 | non-canonical. | |
8de08f4c DG |
7060 | |
7061 | Returns a canonical argument list, which may be ARGTYPES when the | |
7062 | canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is | |
7063 | true) or would not differ from ARGTYPES. */ | |
7064 | ||
b8698a0f L |
7065 | static tree |
7066 | maybe_canonicalize_argtypes(tree argtypes, | |
8de08f4c DG |
7067 | bool *any_structural_p, |
7068 | bool *any_noncanonical_p) | |
7069 | { | |
7070 | tree arg; | |
7071 | bool any_noncanonical_argtypes_p = false; | |
b8698a0f | 7072 | |
8de08f4c DG |
7073 | for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg)) |
7074 | { | |
7075 | if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node) | |
7076 | /* Fail gracefully by stating that the type is structural. */ | |
7077 | *any_structural_p = true; | |
7078 | else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg))) | |
7079 | *any_structural_p = true; | |
7080 | else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg) | |
7081 | || TREE_PURPOSE (arg)) | |
7082 | /* If the argument has a default argument, we consider it | |
7083 | non-canonical even though the type itself is canonical. | |
7084 | That way, different variants of function and method types | |
7085 | with default arguments will all point to the variant with | |
7086 | no defaults as their canonical type. */ | |
7087 | any_noncanonical_argtypes_p = true; | |
7088 | } | |
7089 | ||
7090 | if (*any_structural_p) | |
7091 | return argtypes; | |
7092 | ||
7093 | if (any_noncanonical_argtypes_p) | |
7094 | { | |
7095 | /* Build the canonical list of argument types. */ | |
7096 | tree canon_argtypes = NULL_TREE; | |
7097 | bool is_void = false; | |
7098 | ||
7099 | for (arg = argtypes; arg; arg = TREE_CHAIN (arg)) | |
7100 | { | |
7101 | if (arg == void_list_node) | |
7102 | is_void = true; | |
7103 | else | |
7104 | canon_argtypes = tree_cons (NULL_TREE, | |
7105 | TYPE_CANONICAL (TREE_VALUE (arg)), | |
7106 | canon_argtypes); | |
7107 | } | |
7108 | ||
7109 | canon_argtypes = nreverse (canon_argtypes); | |
7110 | if (is_void) | |
7111 | canon_argtypes = chainon (canon_argtypes, void_list_node); | |
7112 | ||
7113 | /* There is a non-canonical type. */ | |
7114 | *any_noncanonical_p = true; | |
7115 | return canon_argtypes; | |
7116 | } | |
7117 | ||
7118 | /* The canonical argument types are the same as ARGTYPES. */ | |
7119 | return argtypes; | |
7120 | } | |
7121 | ||
c6a1db6c RS |
7122 | /* Construct, lay out and return |
7123 | the type of functions returning type VALUE_TYPE | |
7124 | given arguments of types ARG_TYPES. | |
7125 | ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs | |
7126 | are data type nodes for the arguments of the function. | |
7127 | If such a type has already been constructed, reuse it. */ | |
7128 | ||
7129 | tree | |
46c5ad27 | 7130 | build_function_type (tree value_type, tree arg_types) |
c6a1db6c | 7131 | { |
b3694847 | 7132 | tree t; |
fd917e0d | 7133 | hashval_t hashcode = 0; |
8de08f4c DG |
7134 | bool any_structural_p, any_noncanonical_p; |
7135 | tree canon_argtypes; | |
c6a1db6c | 7136 | |
c0560b8b | 7137 | if (TREE_CODE (value_type) == FUNCTION_TYPE) |
c6a1db6c | 7138 | { |
c0560b8b | 7139 | error ("function return type cannot be function"); |
c6a1db6c RS |
7140 | value_type = integer_type_node; |
7141 | } | |
7142 | ||
7143 | /* Make a node of the sort we want. */ | |
7144 | t = make_node (FUNCTION_TYPE); | |
7145 | TREE_TYPE (t) = value_type; | |
7146 | TYPE_ARG_TYPES (t) = arg_types; | |
7147 | ||
7548281d | 7148 | /* If we already have such a type, use the old one. */ |
fd917e0d JM |
7149 | hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode); |
7150 | hashcode = type_hash_list (arg_types, hashcode); | |
c6a1db6c RS |
7151 | t = type_hash_canon (hashcode, t); |
7152 | ||
8de08f4c DG |
7153 | /* Set up the canonical type. */ |
7154 | any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type); | |
7155 | any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type; | |
b8698a0f | 7156 | canon_argtypes = maybe_canonicalize_argtypes (arg_types, |
8de08f4c DG |
7157 | &any_structural_p, |
7158 | &any_noncanonical_p); | |
7159 | if (any_structural_p) | |
7160 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
7161 | else if (any_noncanonical_p) | |
7162 | TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type), | |
7163 | canon_argtypes); | |
b8698a0f | 7164 | |
d0f062fb | 7165 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
7166 | layout_type (t); |
7167 | return t; | |
7168 | } | |
7169 | ||
c6f7cfc1 JH |
7170 | /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */ |
7171 | ||
7172 | tree | |
7173 | build_function_type_skip_args (tree orig_type, bitmap args_to_skip) | |
7174 | { | |
7175 | tree new_type = NULL; | |
7176 | tree args, new_args = NULL, t; | |
7177 | tree new_reversed; | |
7178 | int i = 0; | |
7179 | ||
7180 | for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node; | |
7181 | args = TREE_CHAIN (args), i++) | |
7182 | if (!bitmap_bit_p (args_to_skip, i)) | |
7183 | new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args); | |
7184 | ||
7185 | new_reversed = nreverse (new_args); | |
7186 | if (args) | |
7187 | { | |
7188 | if (new_reversed) | |
7189 | TREE_CHAIN (new_args) = void_list_node; | |
7190 | else | |
7191 | new_reversed = void_list_node; | |
7192 | } | |
c6f7cfc1 JH |
7193 | |
7194 | /* Use copy_node to preserve as much as possible from original type | |
7195 | (debug info, attribute lists etc.) | |
7196 | Exception is METHOD_TYPEs must have THIS argument. | |
7197 | When we are asked to remove it, we need to build new FUNCTION_TYPE | |
7198 | instead. */ | |
7199 | if (TREE_CODE (orig_type) != METHOD_TYPE | |
7200 | || !bitmap_bit_p (args_to_skip, 0)) | |
7201 | { | |
7202 | new_type = copy_node (orig_type); | |
7203 | TYPE_ARG_TYPES (new_type) = new_reversed; | |
7204 | } | |
7205 | else | |
4db15d75 JH |
7206 | { |
7207 | new_type | |
7208 | = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type), | |
7209 | new_reversed)); | |
7210 | TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type); | |
7211 | } | |
c6f7cfc1 JH |
7212 | |
7213 | /* This is a new type, not a copy of an old type. Need to reassociate | |
7214 | variants. We can handle everything except the main variant lazily. */ | |
7215 | t = TYPE_MAIN_VARIANT (orig_type); | |
7216 | if (orig_type != t) | |
7217 | { | |
7218 | TYPE_MAIN_VARIANT (new_type) = t; | |
7219 | TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t); | |
7220 | TYPE_NEXT_VARIANT (t) = new_type; | |
7221 | } | |
7222 | else | |
7223 | { | |
7224 | TYPE_MAIN_VARIANT (new_type) = new_type; | |
7225 | TYPE_NEXT_VARIANT (new_type) = NULL; | |
7226 | } | |
7227 | return new_type; | |
7228 | } | |
7229 | ||
b8698a0f L |
7230 | /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. |
7231 | ||
c6f7cfc1 JH |
7232 | Arguments from DECL_ARGUMENTS list can't be removed now, since they are |
7233 | linked by TREE_CHAIN directly. It is caller responsibility to eliminate | |
7234 | them when they are being duplicated (i.e. copy_arguments_for_versioning). */ | |
7235 | ||
7236 | tree | |
7237 | build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip) | |
7238 | { | |
7239 | tree new_decl = copy_node (orig_decl); | |
7240 | tree new_type; | |
7241 | ||
7242 | new_type = TREE_TYPE (orig_decl); | |
7243 | if (prototype_p (new_type)) | |
7244 | new_type = build_function_type_skip_args (new_type, args_to_skip); | |
4db15d75 JH |
7245 | TREE_TYPE (new_decl) = new_type; |
7246 | ||
7247 | /* For declarations setting DECL_VINDEX (i.e. methods) | |
7248 | we expect first argument to be THIS pointer. */ | |
7249 | if (bitmap_bit_p (args_to_skip, 0)) | |
7250 | DECL_VINDEX (new_decl) = NULL_TREE; | |
c6f7cfc1 JH |
7251 | return new_decl; |
7252 | } | |
7253 | ||
a98ebe2e | 7254 | /* Build a function type. The RETURN_TYPE is the type returned by the |
ff1c393b KT |
7255 | function. If VAARGS is set, no void_type_node is appended to the |
7256 | the list. ARGP muse be alway be terminated be a NULL_TREE. */ | |
b4de2f7d | 7257 | |
ff1c393b KT |
7258 | static tree |
7259 | build_function_type_list_1 (bool vaargs, tree return_type, va_list argp) | |
b4de2f7d AH |
7260 | { |
7261 | tree t, args, last; | |
b4de2f7d | 7262 | |
ff1c393b KT |
7263 | t = va_arg (argp, tree); |
7264 | for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree)) | |
b4de2f7d AH |
7265 | args = tree_cons (NULL_TREE, t, args); |
7266 | ||
ff1c393b KT |
7267 | if (vaargs) |
7268 | { | |
c6f7cfc1 JH |
7269 | last = args; |
7270 | if (args != NULL_TREE) | |
7271 | args = nreverse (args); | |
ff1c393b KT |
7272 | gcc_assert (args != NULL_TREE && last != void_list_node); |
7273 | } | |
7274 | else if (args == NULL_TREE) | |
f6254da4 ILT |
7275 | args = void_list_node; |
7276 | else | |
7277 | { | |
7278 | last = args; | |
7279 | args = nreverse (args); | |
7280 | TREE_CHAIN (last) = void_list_node; | |
7281 | } | |
97ebc06f | 7282 | args = build_function_type (return_type, args); |
b4de2f7d | 7283 | |
ff1c393b KT |
7284 | return args; |
7285 | } | |
7286 | ||
7287 | /* Build a function type. The RETURN_TYPE is the type returned by the | |
7288 | function. If additional arguments are provided, they are | |
7289 | additional argument types. The list of argument types must always | |
7290 | be terminated by NULL_TREE. */ | |
7291 | ||
7292 | tree | |
7293 | build_function_type_list (tree return_type, ...) | |
7294 | { | |
7295 | tree args; | |
7296 | va_list p; | |
7297 | ||
7298 | va_start (p, return_type); | |
7299 | args = build_function_type_list_1 (false, return_type, p); | |
7300 | va_end (p); | |
7301 | return args; | |
7302 | } | |
7303 | ||
7304 | /* Build a variable argument function type. The RETURN_TYPE is the | |
7305 | type returned by the function. If additional arguments are provided, | |
7306 | they are additional argument types. The list of argument types must | |
7307 | always be terminated by NULL_TREE. */ | |
7308 | ||
7309 | tree | |
7310 | build_varargs_function_type_list (tree return_type, ...) | |
7311 | { | |
7312 | tree args; | |
7313 | va_list p; | |
7314 | ||
7315 | va_start (p, return_type); | |
7316 | args = build_function_type_list_1 (true, return_type, p); | |
e34d07f2 | 7317 | va_end (p); |
ff1c393b | 7318 | |
b4de2f7d AH |
7319 | return args; |
7320 | } | |
7321 | ||
1281fe11 MM |
7322 | /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE) |
7323 | and ARGTYPES (a TREE_LIST) are the return type and arguments types | |
7324 | for the method. An implicit additional parameter (of type | |
7325 | pointer-to-BASETYPE) is added to the ARGTYPES. */ | |
c6a1db6c RS |
7326 | |
7327 | tree | |
1281fe11 MM |
7328 | build_method_type_directly (tree basetype, |
7329 | tree rettype, | |
7330 | tree argtypes) | |
c6a1db6c | 7331 | { |
b3694847 | 7332 | tree t; |
1281fe11 | 7333 | tree ptype; |
fd917e0d | 7334 | int hashcode = 0; |
8de08f4c DG |
7335 | bool any_structural_p, any_noncanonical_p; |
7336 | tree canon_argtypes; | |
c6a1db6c RS |
7337 | |
7338 | /* Make a node of the sort we want. */ | |
7339 | t = make_node (METHOD_TYPE); | |
7340 | ||
c6a1db6c | 7341 | TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); |
1281fe11 MM |
7342 | TREE_TYPE (t) = rettype; |
7343 | ptype = build_pointer_type (basetype); | |
c6a1db6c RS |
7344 | |
7345 | /* The actual arglist for this function includes a "hidden" argument | |
7346 | which is "this". Put it into the list of argument types. */ | |
1281fe11 MM |
7347 | argtypes = tree_cons (NULL_TREE, ptype, argtypes); |
7348 | TYPE_ARG_TYPES (t) = argtypes; | |
c6a1db6c | 7349 | |
7548281d | 7350 | /* If we already have such a type, use the old one. */ |
fd917e0d JM |
7351 | hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode); |
7352 | hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode); | |
7353 | hashcode = type_hash_list (argtypes, hashcode); | |
c6a1db6c RS |
7354 | t = type_hash_canon (hashcode, t); |
7355 | ||
8de08f4c DG |
7356 | /* Set up the canonical type. */ |
7357 | any_structural_p | |
7358 | = (TYPE_STRUCTURAL_EQUALITY_P (basetype) | |
7359 | || TYPE_STRUCTURAL_EQUALITY_P (rettype)); | |
7360 | any_noncanonical_p | |
7361 | = (TYPE_CANONICAL (basetype) != basetype | |
7362 | || TYPE_CANONICAL (rettype) != rettype); | |
7363 | canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes), | |
7364 | &any_structural_p, | |
7365 | &any_noncanonical_p); | |
7366 | if (any_structural_p) | |
7367 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
7368 | else if (any_noncanonical_p) | |
b8698a0f | 7369 | TYPE_CANONICAL (t) |
8de08f4c DG |
7370 | = build_method_type_directly (TYPE_CANONICAL (basetype), |
7371 | TYPE_CANONICAL (rettype), | |
7372 | canon_argtypes); | |
d0f062fb | 7373 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
7374 | layout_type (t); |
7375 | ||
7376 | return t; | |
7377 | } | |
7378 | ||
1281fe11 MM |
7379 | /* Construct, lay out and return the type of methods belonging to class |
7380 | BASETYPE and whose arguments and values are described by TYPE. | |
7381 | If that type exists already, reuse it. | |
7382 | TYPE must be a FUNCTION_TYPE node. */ | |
7383 | ||
7384 | tree | |
7385 | build_method_type (tree basetype, tree type) | |
7386 | { | |
1e128c5f | 7387 | gcc_assert (TREE_CODE (type) == FUNCTION_TYPE); |
1281fe11 | 7388 | |
9f63daea | 7389 | return build_method_type_directly (basetype, |
1281fe11 MM |
7390 | TREE_TYPE (type), |
7391 | TYPE_ARG_TYPES (type)); | |
7392 | } | |
7393 | ||
86aed40b RS |
7394 | /* Construct, lay out and return the type of offsets to a value |
7395 | of type TYPE, within an object of type BASETYPE. | |
7396 | If a suitable offset type exists already, reuse it. */ | |
c6a1db6c RS |
7397 | |
7398 | tree | |
46c5ad27 | 7399 | build_offset_type (tree basetype, tree type) |
c6a1db6c | 7400 | { |
b3694847 | 7401 | tree t; |
fd917e0d | 7402 | hashval_t hashcode = 0; |
c6a1db6c RS |
7403 | |
7404 | /* Make a node of the sort we want. */ | |
7405 | t = make_node (OFFSET_TYPE); | |
7406 | ||
7407 | TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); | |
7408 | TREE_TYPE (t) = type; | |
7409 | ||
7548281d | 7410 | /* If we already have such a type, use the old one. */ |
fd917e0d JM |
7411 | hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode); |
7412 | hashcode = iterative_hash_object (TYPE_HASH (type), hashcode); | |
c6a1db6c RS |
7413 | t = type_hash_canon (hashcode, t); |
7414 | ||
d0f062fb | 7415 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
7416 | layout_type (t); |
7417 | ||
06d40de8 DG |
7418 | if (TYPE_CANONICAL (t) == t) |
7419 | { | |
7420 | if (TYPE_STRUCTURAL_EQUALITY_P (basetype) | |
7421 | || TYPE_STRUCTURAL_EQUALITY_P (type)) | |
7422 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
4552f5a2 | 7423 | else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype |
06d40de8 | 7424 | || TYPE_CANONICAL (type) != type) |
b8698a0f | 7425 | TYPE_CANONICAL (t) |
4552f5a2 | 7426 | = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)), |
06d40de8 DG |
7427 | TYPE_CANONICAL (type)); |
7428 | } | |
7429 | ||
c6a1db6c RS |
7430 | return t; |
7431 | } | |
7432 | ||
7433 | /* Create a complex type whose components are COMPONENT_TYPE. */ | |
7434 | ||
7435 | tree | |
46c5ad27 | 7436 | build_complex_type (tree component_type) |
c6a1db6c | 7437 | { |
b3694847 | 7438 | tree t; |
fd917e0d | 7439 | hashval_t hashcode; |
c6a1db6c | 7440 | |
51c869ca RG |
7441 | gcc_assert (INTEGRAL_TYPE_P (component_type) |
7442 | || SCALAR_FLOAT_TYPE_P (component_type) | |
7443 | || FIXED_POINT_TYPE_P (component_type)); | |
7444 | ||
c6a1db6c RS |
7445 | /* Make a node of the sort we want. */ |
7446 | t = make_node (COMPLEX_TYPE); | |
7447 | ||
7448 | TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type); | |
c6a1db6c | 7449 | |
7548281d | 7450 | /* If we already have such a type, use the old one. */ |
fd917e0d | 7451 | hashcode = iterative_hash_object (TYPE_HASH (component_type), 0); |
c6a1db6c RS |
7452 | t = type_hash_canon (hashcode, t); |
7453 | ||
d0f062fb | 7454 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
7455 | layout_type (t); |
7456 | ||
06d40de8 DG |
7457 | if (TYPE_CANONICAL (t) == t) |
7458 | { | |
7459 | if (TYPE_STRUCTURAL_EQUALITY_P (component_type)) | |
7460 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
7461 | else if (TYPE_CANONICAL (component_type) != component_type) | |
b8698a0f | 7462 | TYPE_CANONICAL (t) |
06d40de8 DG |
7463 | = build_complex_type (TYPE_CANONICAL (component_type)); |
7464 | } | |
7465 | ||
05af427c RG |
7466 | /* We need to create a name, since complex is a fundamental type. */ |
7467 | if (! TYPE_NAME (t)) | |
405f63da | 7468 | { |
ec0ce6e2 | 7469 | const char *name; |
405f63da MM |
7470 | if (component_type == char_type_node) |
7471 | name = "complex char"; | |
7472 | else if (component_type == signed_char_type_node) | |
7473 | name = "complex signed char"; | |
7474 | else if (component_type == unsigned_char_type_node) | |
7475 | name = "complex unsigned char"; | |
7476 | else if (component_type == short_integer_type_node) | |
7477 | name = "complex short int"; | |
7478 | else if (component_type == short_unsigned_type_node) | |
7479 | name = "complex short unsigned int"; | |
7480 | else if (component_type == integer_type_node) | |
7481 | name = "complex int"; | |
7482 | else if (component_type == unsigned_type_node) | |
7483 | name = "complex unsigned int"; | |
7484 | else if (component_type == long_integer_type_node) | |
7485 | name = "complex long int"; | |
7486 | else if (component_type == long_unsigned_type_node) | |
7487 | name = "complex long unsigned int"; | |
7488 | else if (component_type == long_long_integer_type_node) | |
7489 | name = "complex long long int"; | |
7490 | else if (component_type == long_long_unsigned_type_node) | |
7491 | name = "complex long long unsigned int"; | |
7492 | else | |
d4b60170 | 7493 | name = 0; |
405f63da | 7494 | |
d4b60170 | 7495 | if (name != 0) |
c2255bc4 AH |
7496 | TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL, |
7497 | get_identifier (name), t); | |
405f63da MM |
7498 | } |
7499 | ||
7548281d | 7500 | return build_qualified_type (t, TYPE_QUALS (component_type)); |
c6a1db6c | 7501 | } |
8ce94e44 JM |
7502 | |
7503 | /* If TYPE is a real or complex floating-point type and the target | |
7504 | does not directly support arithmetic on TYPE then return the wider | |
7505 | type to be used for arithmetic on TYPE. Otherwise, return | |
7506 | NULL_TREE. */ | |
7507 | ||
7508 | tree | |
7509 | excess_precision_type (tree type) | |
7510 | { | |
7511 | if (flag_excess_precision != EXCESS_PRECISION_FAST) | |
7512 | { | |
7513 | int flt_eval_method = TARGET_FLT_EVAL_METHOD; | |
7514 | switch (TREE_CODE (type)) | |
7515 | { | |
7516 | case REAL_TYPE: | |
7517 | switch (flt_eval_method) | |
7518 | { | |
7519 | case 1: | |
7520 | if (TYPE_MODE (type) == TYPE_MODE (float_type_node)) | |
7521 | return double_type_node; | |
7522 | break; | |
7523 | case 2: | |
7524 | if (TYPE_MODE (type) == TYPE_MODE (float_type_node) | |
7525 | || TYPE_MODE (type) == TYPE_MODE (double_type_node)) | |
7526 | return long_double_type_node; | |
7527 | break; | |
7528 | default: | |
7529 | gcc_unreachable (); | |
7530 | } | |
7531 | break; | |
7532 | case COMPLEX_TYPE: | |
7533 | if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE) | |
7534 | return NULL_TREE; | |
7535 | switch (flt_eval_method) | |
7536 | { | |
7537 | case 1: | |
7538 | if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)) | |
7539 | return complex_double_type_node; | |
7540 | break; | |
7541 | case 2: | |
7542 | if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node) | |
7543 | || (TYPE_MODE (TREE_TYPE (type)) | |
7544 | == TYPE_MODE (double_type_node))) | |
7545 | return complex_long_double_type_node; | |
7546 | break; | |
7547 | default: | |
7548 | gcc_unreachable (); | |
7549 | } | |
7550 | break; | |
7551 | default: | |
7552 | break; | |
7553 | } | |
7554 | } | |
7555 | return NULL_TREE; | |
7556 | } | |
c6a1db6c RS |
7557 | \f |
7558 | /* Return OP, stripped of any conversions to wider types as much as is safe. | |
7559 | Converting the value back to OP's type makes a value equivalent to OP. | |
7560 | ||
7561 | If FOR_TYPE is nonzero, we return a value which, if converted to | |
7562 | type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE. | |
7563 | ||
c6a1db6c RS |
7564 | OP must have integer, real or enumeral type. Pointers are not allowed! |
7565 | ||
7566 | There are some cases where the obvious value we could return | |
dc478a5d | 7567 | would regenerate to OP if converted to OP's type, |
c6a1db6c RS |
7568 | but would not extend like OP to wider types. |
7569 | If FOR_TYPE indicates such extension is contemplated, we eschew such values. | |
7570 | For example, if OP is (unsigned short)(signed char)-1, | |
7571 | we avoid returning (signed char)-1 if FOR_TYPE is int, | |
7572 | even though extending that to an unsigned short would regenerate OP, | |
7573 | since the result of extending (signed char)-1 to (int) | |
7574 | is different from (int) OP. */ | |
7575 | ||
7576 | tree | |
46c5ad27 | 7577 | get_unwidened (tree op, tree for_type) |
c6a1db6c RS |
7578 | { |
7579 | /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */ | |
b3694847 SS |
7580 | tree type = TREE_TYPE (op); |
7581 | unsigned final_prec | |
c6a1db6c | 7582 | = TYPE_PRECISION (for_type != 0 ? for_type : type); |
b3694847 | 7583 | int uns |
c6a1db6c RS |
7584 | = (for_type != 0 && for_type != type |
7585 | && final_prec > TYPE_PRECISION (type) | |
8df83eae | 7586 | && TYPE_UNSIGNED (type)); |
b3694847 | 7587 | tree win = op; |
c6a1db6c | 7588 | |
1043771b | 7589 | while (CONVERT_EXPR_P (op)) |
c6a1db6c | 7590 | { |
145357a4 JJ |
7591 | int bitschange; |
7592 | ||
7593 | /* TYPE_PRECISION on vector types has different meaning | |
7594 | (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions, | |
7595 | so avoid them here. */ | |
7596 | if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE) | |
7597 | break; | |
7598 | ||
7599 | bitschange = TYPE_PRECISION (TREE_TYPE (op)) | |
7600 | - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))); | |
c6a1db6c RS |
7601 | |
7602 | /* Truncations are many-one so cannot be removed. | |
7603 | Unless we are later going to truncate down even farther. */ | |
7604 | if (bitschange < 0 | |
7605 | && final_prec > TYPE_PRECISION (TREE_TYPE (op))) | |
7606 | break; | |
7607 | ||
7608 | /* See what's inside this conversion. If we decide to strip it, | |
7609 | we will set WIN. */ | |
7610 | op = TREE_OPERAND (op, 0); | |
7611 | ||
7612 | /* If we have not stripped any zero-extensions (uns is 0), | |
7613 | we can strip any kind of extension. | |
7614 | If we have previously stripped a zero-extension, | |
7615 | only zero-extensions can safely be stripped. | |
7616 | Any extension can be stripped if the bits it would produce | |
7617 | are all going to be discarded later by truncating to FOR_TYPE. */ | |
7618 | ||
7619 | if (bitschange > 0) | |
7620 | { | |
7621 | if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op))) | |
7622 | win = op; | |
8df83eae | 7623 | /* TYPE_UNSIGNED says whether this is a zero-extension. |
c6a1db6c RS |
7624 | Let's avoid computing it if it does not affect WIN |
7625 | and if UNS will not be needed again. */ | |
362cb1bb | 7626 | if ((uns |
1043771b | 7627 | || CONVERT_EXPR_P (op)) |
8df83eae | 7628 | && TYPE_UNSIGNED (TREE_TYPE (op))) |
c6a1db6c RS |
7629 | { |
7630 | uns = 1; | |
7631 | win = op; | |
7632 | } | |
7633 | } | |
7634 | } | |
7635 | ||
c6a1db6c RS |
7636 | return win; |
7637 | } | |
7638 | \f | |
7639 | /* Return OP or a simpler expression for a narrower value | |
7640 | which can be sign-extended or zero-extended to give back OP. | |
7641 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
7642 | or 0 if the value should be sign-extended. */ | |
7643 | ||
7644 | tree | |
46c5ad27 | 7645 | get_narrower (tree op, int *unsignedp_ptr) |
c6a1db6c | 7646 | { |
b3694847 | 7647 | int uns = 0; |
c6a1db6c | 7648 | int first = 1; |
b3694847 | 7649 | tree win = op; |
beed8fc0 | 7650 | bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op)); |
c6a1db6c RS |
7651 | |
7652 | while (TREE_CODE (op) == NOP_EXPR) | |
7653 | { | |
b3694847 | 7654 | int bitschange |
d4b60170 RK |
7655 | = (TYPE_PRECISION (TREE_TYPE (op)) |
7656 | - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)))); | |
c6a1db6c RS |
7657 | |
7658 | /* Truncations are many-one so cannot be removed. */ | |
7659 | if (bitschange < 0) | |
7660 | break; | |
7661 | ||
7662 | /* See what's inside this conversion. If we decide to strip it, | |
7663 | we will set WIN. */ | |
c6a1db6c RS |
7664 | |
7665 | if (bitschange > 0) | |
7666 | { | |
0a71919d | 7667 | op = TREE_OPERAND (op, 0); |
c6a1db6c RS |
7668 | /* An extension: the outermost one can be stripped, |
7669 | but remember whether it is zero or sign extension. */ | |
7670 | if (first) | |
8df83eae | 7671 | uns = TYPE_UNSIGNED (TREE_TYPE (op)); |
c6a1db6c RS |
7672 | /* Otherwise, if a sign extension has been stripped, |
7673 | only sign extensions can now be stripped; | |
7674 | if a zero extension has been stripped, only zero-extensions. */ | |
8df83eae | 7675 | else if (uns != TYPE_UNSIGNED (TREE_TYPE (op))) |
c6a1db6c RS |
7676 | break; |
7677 | first = 0; | |
7678 | } | |
e02b9957 DE |
7679 | else /* bitschange == 0 */ |
7680 | { | |
7681 | /* A change in nominal type can always be stripped, but we must | |
7682 | preserve the unsignedness. */ | |
7683 | if (first) | |
8df83eae | 7684 | uns = TYPE_UNSIGNED (TREE_TYPE (op)); |
e02b9957 | 7685 | first = 0; |
0a71919d | 7686 | op = TREE_OPERAND (op, 0); |
beed8fc0 AO |
7687 | /* Keep trying to narrow, but don't assign op to win if it |
7688 | would turn an integral type into something else. */ | |
7689 | if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p) | |
7690 | continue; | |
e02b9957 | 7691 | } |
c6a1db6c RS |
7692 | |
7693 | win = op; | |
7694 | } | |
7695 | ||
7696 | if (TREE_CODE (op) == COMPONENT_REF | |
7697 | /* Since type_for_size always gives an integer type. */ | |
0fba7208 | 7698 | && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE |
325217ed | 7699 | && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE |
0fba7208 | 7700 | /* Ensure field is laid out already. */ |
44de5aeb RK |
7701 | && DECL_SIZE (TREE_OPERAND (op, 1)) != 0 |
7702 | && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1)) | |
c6a1db6c | 7703 | { |
0fba7208 RK |
7704 | unsigned HOST_WIDE_INT innerprec |
7705 | = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1); | |
a150de29 | 7706 | int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1)) |
8df83eae | 7707 | || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1)))); |
ae2bcd98 | 7708 | tree type = lang_hooks.types.type_for_size (innerprec, unsignedp); |
c6a1db6c RS |
7709 | |
7710 | /* We can get this structure field in a narrower type that fits it, | |
7711 | but the resulting extension to its nominal type (a fullword type) | |
7712 | must satisfy the same conditions as for other extensions. | |
7713 | ||
7714 | Do this only for fields that are aligned (not bit-fields), | |
7715 | because when bit-field insns will be used there is no | |
7716 | advantage in doing this. */ | |
7717 | ||
7718 | if (innerprec < TYPE_PRECISION (TREE_TYPE (op)) | |
7719 | && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)) | |
a150de29 | 7720 | && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1))) |
c6a1db6c RS |
7721 | && type != 0) |
7722 | { | |
7723 | if (first) | |
a150de29 | 7724 | uns = DECL_UNSIGNED (TREE_OPERAND (op, 1)); |
afe1a916 | 7725 | win = fold_convert (type, op); |
c6a1db6c RS |
7726 | } |
7727 | } | |
afe1a916 | 7728 | |
c6a1db6c RS |
7729 | *unsignedp_ptr = uns; |
7730 | return win; | |
7731 | } | |
7732 | \f | |
c6a1db6c RS |
7733 | /* Nonzero if integer constant C has a value that is permissible |
7734 | for type TYPE (an INTEGER_TYPE). */ | |
7735 | ||
7736 | int | |
9566a759 | 7737 | int_fits_type_p (const_tree c, const_tree type) |
c6a1db6c | 7738 | { |
5b429886 JJ |
7739 | tree type_low_bound, type_high_bound; |
7740 | bool ok_for_low_bound, ok_for_high_bound, unsc; | |
7741 | double_int dc, dd; | |
7742 | ||
7743 | dc = tree_to_double_int (c); | |
7744 | unsc = TYPE_UNSIGNED (TREE_TYPE (c)); | |
7745 | ||
7746 | if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE | |
7747 | && TYPE_IS_SIZETYPE (TREE_TYPE (c)) | |
7748 | && unsc) | |
7749 | /* So c is an unsigned integer whose type is sizetype and type is not. | |
7750 | sizetype'd integers are sign extended even though they are | |
7751 | unsigned. If the integer value fits in the lower end word of c, | |
7752 | and if the higher end word has all its bits set to 1, that | |
7753 | means the higher end bits are set to 1 only for sign extension. | |
7754 | So let's convert c into an equivalent zero extended unsigned | |
7755 | integer. */ | |
7756 | dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c))); | |
7757 | ||
7758 | retry: | |
7759 | type_low_bound = TYPE_MIN_VALUE (type); | |
7760 | type_high_bound = TYPE_MAX_VALUE (type); | |
4694840a OH |
7761 | |
7762 | /* If at least one bound of the type is a constant integer, we can check | |
7763 | ourselves and maybe make a decision. If no such decision is possible, but | |
7764 | this type is a subtype, try checking against that. Otherwise, use | |
2b60792f | 7765 | fit_double_type, which checks against the precision. |
4694840a OH |
7766 | |
7767 | Compute the status for each possibly constant bound, and return if we see | |
7768 | one does not match. Use ok_for_xxx_bound for this purpose, assigning -1 | |
7769 | for "unknown if constant fits", 0 for "constant known *not* to fit" and 1 | |
7770 | for "constant known to fit". */ | |
7771 | ||
5b429886 | 7772 | /* Check if c >= type_low_bound. */ |
4694840a | 7773 | if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST) |
3401c26b | 7774 | { |
5b429886 JJ |
7775 | dd = tree_to_double_int (type_low_bound); |
7776 | if (TREE_CODE (type) == INTEGER_TYPE | |
7777 | && TYPE_IS_SIZETYPE (type) | |
7778 | && TYPE_UNSIGNED (type)) | |
7779 | dd = double_int_zext (dd, TYPE_PRECISION (type)); | |
7780 | if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound))) | |
7781 | { | |
7782 | int c_neg = (!unsc && double_int_negative_p (dc)); | |
7783 | int t_neg = (unsc && double_int_negative_p (dd)); | |
7784 | ||
7785 | if (c_neg && !t_neg) | |
7786 | return 0; | |
7787 | if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0) | |
7788 | return 0; | |
7789 | } | |
7790 | else if (double_int_cmp (dc, dd, unsc) < 0) | |
4694840a | 7791 | return 0; |
4634cf7e | 7792 | ok_for_low_bound = true; |
3401c26b | 7793 | } |
4634cf7e RS |
7794 | else |
7795 | ok_for_low_bound = false; | |
4694840a OH |
7796 | |
7797 | /* Check if c <= type_high_bound. */ | |
7798 | if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST) | |
7799 | { | |
5b429886 JJ |
7800 | dd = tree_to_double_int (type_high_bound); |
7801 | if (TREE_CODE (type) == INTEGER_TYPE | |
7802 | && TYPE_IS_SIZETYPE (type) | |
7803 | && TYPE_UNSIGNED (type)) | |
7804 | dd = double_int_zext (dd, TYPE_PRECISION (type)); | |
7805 | if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound))) | |
7806 | { | |
7807 | int c_neg = (!unsc && double_int_negative_p (dc)); | |
7808 | int t_neg = (unsc && double_int_negative_p (dd)); | |
7809 | ||
7810 | if (t_neg && !c_neg) | |
7811 | return 0; | |
7812 | if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0) | |
7813 | return 0; | |
7814 | } | |
7815 | else if (double_int_cmp (dc, dd, unsc) > 0) | |
4694840a | 7816 | return 0; |
4634cf7e | 7817 | ok_for_high_bound = true; |
4694840a | 7818 | } |
4634cf7e RS |
7819 | else |
7820 | ok_for_high_bound = false; | |
4694840a OH |
7821 | |
7822 | /* If the constant fits both bounds, the result is known. */ | |
4634cf7e | 7823 | if (ok_for_low_bound && ok_for_high_bound) |
4694840a OH |
7824 | return 1; |
7825 | ||
4634cf7e RS |
7826 | /* Perform some generic filtering which may allow making a decision |
7827 | even if the bounds are not constant. First, negative integers | |
7828 | never fit in unsigned types, */ | |
5b429886 | 7829 | if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc)) |
4634cf7e RS |
7830 | return 0; |
7831 | ||
7832 | /* Second, narrower types always fit in wider ones. */ | |
7833 | if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c))) | |
7834 | return 1; | |
7835 | ||
7836 | /* Third, unsigned integers with top bit set never fit signed types. */ | |
5b429886 JJ |
7837 | if (! TYPE_UNSIGNED (type) && unsc) |
7838 | { | |
7839 | int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1; | |
7840 | if (prec < HOST_BITS_PER_WIDE_INT) | |
7841 | { | |
7842 | if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0) | |
7843 | return 0; | |
7844 | } | |
7845 | else if (((((unsigned HOST_WIDE_INT) 1) | |
7846 | << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0) | |
7847 | return 0; | |
7848 | } | |
4634cf7e | 7849 | |
4694840a | 7850 | /* If we haven't been able to decide at this point, there nothing more we |
d25f3b83 EB |
7851 | can check ourselves here. Look at the base type if we have one and it |
7852 | has the same precision. */ | |
7853 | if (TREE_CODE (type) == INTEGER_TYPE | |
7854 | && TREE_TYPE (type) != 0 | |
7855 | && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type))) | |
5b429886 JJ |
7856 | { |
7857 | type = TREE_TYPE (type); | |
7858 | goto retry; | |
7859 | } | |
46c5ad27 | 7860 | |
2b60792f | 7861 | /* Or to fit_double_type, if nothing else. */ |
5b429886 | 7862 | return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type); |
c6a1db6c RS |
7863 | } |
7864 | ||
e4fd22c6 BM |
7865 | /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant |
7866 | bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be | |
7867 | represented (assuming two's-complement arithmetic) within the bit | |
7868 | precision of the type are returned instead. */ | |
7869 | ||
7870 | void | |
22ea9ec0 | 7871 | get_type_static_bounds (const_tree type, mpz_t min, mpz_t max) |
e4fd22c6 BM |
7872 | { |
7873 | if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type) | |
7874 | && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST) | |
7875 | mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)), | |
7876 | TYPE_UNSIGNED (type)); | |
7877 | else | |
7878 | { | |
7879 | if (TYPE_UNSIGNED (type)) | |
7880 | mpz_set_ui (min, 0); | |
7881 | else | |
7882 | { | |
7883 | double_int mn; | |
7884 | mn = double_int_mask (TYPE_PRECISION (type) - 1); | |
7885 | mn = double_int_sext (double_int_add (mn, double_int_one), | |
7886 | TYPE_PRECISION (type)); | |
7887 | mpz_set_double_int (min, mn, false); | |
7888 | } | |
7889 | } | |
7890 | ||
b8698a0f | 7891 | if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type) |
e4fd22c6 BM |
7892 | && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST) |
7893 | mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)), | |
7894 | TYPE_UNSIGNED (type)); | |
7895 | else | |
7896 | { | |
7897 | if (TYPE_UNSIGNED (type)) | |
7898 | mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)), | |
7899 | true); | |
7900 | else | |
7901 | mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1), | |
7902 | true); | |
7903 | } | |
7904 | } | |
7905 | ||
726a989a | 7906 | /* Return true if VAR is an automatic variable defined in function FN. */ |
50886bf1 RG |
7907 | |
7908 | bool | |
58f9752a | 7909 | auto_var_in_fn_p (const_tree var, const_tree fn) |
50886bf1 RG |
7910 | { |
7911 | return (DECL_P (var) && DECL_CONTEXT (var) == fn | |
7912 | && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL) | |
7913 | && ! TREE_STATIC (var)) | |
7914 | || TREE_CODE (var) == LABEL_DECL | |
7915 | || TREE_CODE (var) == RESULT_DECL)); | |
7916 | } | |
7917 | ||
5377d5ba RK |
7918 | /* Subprogram of following function. Called by walk_tree. |
7919 | ||
7920 | Return *TP if it is an automatic variable or parameter of the | |
7921 | function passed in as DATA. */ | |
7922 | ||
7923 | static tree | |
7924 | find_var_from_fn (tree *tp, int *walk_subtrees, void *data) | |
7925 | { | |
7926 | tree fn = (tree) data; | |
7927 | ||
7928 | if (TYPE_P (*tp)) | |
7929 | *walk_subtrees = 0; | |
7930 | ||
6615c446 | 7931 | else if (DECL_P (*tp) |
50886bf1 | 7932 | && auto_var_in_fn_p (*tp, fn)) |
5377d5ba RK |
7933 | return *tp; |
7934 | ||
7935 | return NULL_TREE; | |
7936 | } | |
7937 | ||
8bcefb43 | 7938 | /* Returns true if T is, contains, or refers to a type with variable |
ca84a9a2 MS |
7939 | size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the |
7940 | arguments, but not the return type. If FN is nonzero, only return | |
7941 | true if a modifier of the type or position of FN is a variable or | |
7942 | parameter inside FN. | |
5377d5ba RK |
7943 | |
7944 | This concept is more general than that of C99 'variably modified types': | |
7945 | in C99, a struct type is never variably modified because a VLA may not | |
7946 | appear as a structure member. However, in GNU C code like: | |
46c5ad27 | 7947 | |
8bcefb43 ZW |
7948 | struct S { int i[f()]; }; |
7949 | ||
7950 | is valid, and other languages may define similar constructs. */ | |
7951 | ||
7952 | bool | |
5377d5ba | 7953 | variably_modified_type_p (tree type, tree fn) |
8bcefb43 | 7954 | { |
3c2a7a6a RH |
7955 | tree t; |
7956 | ||
5377d5ba RK |
7957 | /* Test if T is either variable (if FN is zero) or an expression containing |
7958 | a variable in FN. */ | |
7959 | #define RETURN_TRUE_IF_VAR(T) \ | |
7960 | do { tree _t = (T); \ | |
7961 | if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \ | |
7962 | && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \ | |
7963 | return true; } while (0) | |
7964 | ||
c246c65d JM |
7965 | if (type == error_mark_node) |
7966 | return false; | |
7967 | ||
52ffd86e | 7968 | /* If TYPE itself has variable size, it is variably modified. */ |
5377d5ba | 7969 | RETURN_TRUE_IF_VAR (TYPE_SIZE (type)); |
2e3b8fe7 | 7970 | RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type)); |
8bcefb43 | 7971 | |
3c2a7a6a RH |
7972 | switch (TREE_CODE (type)) |
7973 | { | |
7974 | case POINTER_TYPE: | |
7975 | case REFERENCE_TYPE: | |
1c9766da | 7976 | case VECTOR_TYPE: |
5377d5ba | 7977 | if (variably_modified_type_p (TREE_TYPE (type), fn)) |
1c9766da RK |
7978 | return true; |
7979 | break; | |
46c5ad27 | 7980 | |
3c2a7a6a RH |
7981 | case FUNCTION_TYPE: |
7982 | case METHOD_TYPE: | |
ca84a9a2 MS |
7983 | /* If TYPE is a function type, it is variably modified if the |
7984 | return type is variably modified. */ | |
5377d5ba | 7985 | if (variably_modified_type_p (TREE_TYPE (type), fn)) |
1c9766da | 7986 | return true; |
3c2a7a6a | 7987 | break; |
8bcefb43 | 7988 | |
3c2a7a6a | 7989 | case INTEGER_TYPE: |
1c9766da | 7990 | case REAL_TYPE: |
325217ed | 7991 | case FIXED_POINT_TYPE: |
1c9766da RK |
7992 | case ENUMERAL_TYPE: |
7993 | case BOOLEAN_TYPE: | |
3c2a7a6a RH |
7994 | /* Scalar types are variably modified if their end points |
7995 | aren't constant. */ | |
5377d5ba RK |
7996 | RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type)); |
7997 | RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type)); | |
1c9766da RK |
7998 | break; |
7999 | ||
8000 | case RECORD_TYPE: | |
8001 | case UNION_TYPE: | |
8002 | case QUAL_UNION_TYPE: | |
52ffd86e | 8003 | /* We can't see if any of the fields are variably-modified by the |
1c9766da RK |
8004 | definition we normally use, since that would produce infinite |
8005 | recursion via pointers. */ | |
8006 | /* This is variably modified if some field's type is. */ | |
8007 | for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t)) | |
8008 | if (TREE_CODE (t) == FIELD_DECL) | |
8009 | { | |
5377d5ba RK |
8010 | RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t)); |
8011 | RETURN_TRUE_IF_VAR (DECL_SIZE (t)); | |
8012 | RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t)); | |
1c9766da | 8013 | |
5377d5ba RK |
8014 | if (TREE_CODE (type) == QUAL_UNION_TYPE) |
8015 | RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t)); | |
1c9766da RK |
8016 | } |
8017 | break; | |
3c2a7a6a | 8018 | |
2e3b8fe7 EB |
8019 | case ARRAY_TYPE: |
8020 | /* Do not call ourselves to avoid infinite recursion. This is | |
8021 | variably modified if the element type is. */ | |
8022 | RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type))); | |
8023 | RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type))); | |
8024 | break; | |
8025 | ||
3c2a7a6a RH |
8026 | default: |
8027 | break; | |
8bcefb43 ZW |
8028 | } |
8029 | ||
8030 | /* The current language may have other cases to check, but in general, | |
8031 | all other types are not variably modified. */ | |
5377d5ba RK |
8032 | return lang_hooks.tree_inlining.var_mod_type_p (type, fn); |
8033 | ||
8034 | #undef RETURN_TRUE_IF_VAR | |
8bcefb43 ZW |
8035 | } |
8036 | ||
140b60b4 | 8037 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
77a02dba | 8038 | NULL_TREE if there is no containing scope. */ |
140b60b4 MM |
8039 | |
8040 | tree | |
9566a759 | 8041 | get_containing_scope (const_tree t) |
140b60b4 MM |
8042 | { |
8043 | return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t)); | |
8044 | } | |
8045 | ||
bfa30b22 | 8046 | /* Return the innermost context enclosing DECL that is |
c6a1db6c RS |
8047 | a FUNCTION_DECL, or zero if none. */ |
8048 | ||
8049 | tree | |
9566a759 | 8050 | decl_function_context (const_tree decl) |
c6a1db6c RS |
8051 | { |
8052 | tree context; | |
8053 | ||
bfa30b22 | 8054 | if (TREE_CODE (decl) == ERROR_MARK) |
c6a1db6c RS |
8055 | return 0; |
8056 | ||
6ff7fb95 JM |
8057 | /* C++ virtual functions use DECL_CONTEXT for the class of the vtable |
8058 | where we look up the function at runtime. Such functions always take | |
8059 | a first argument of type 'pointer to real context'. | |
8060 | ||
8061 | C++ should really be fixed to use DECL_CONTEXT for the real context, | |
8062 | and use something else for the "virtual context". */ | |
8063 | else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl)) | |
77a02dba RK |
8064 | context |
8065 | = TYPE_MAIN_VARIANT | |
8066 | (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl))))); | |
c6a1db6c | 8067 | else |
bfa30b22 | 8068 | context = DECL_CONTEXT (decl); |
c6a1db6c RS |
8069 | |
8070 | while (context && TREE_CODE (context) != FUNCTION_DECL) | |
8071 | { | |
140b60b4 | 8072 | if (TREE_CODE (context) == BLOCK) |
c6a1db6c | 8073 | context = BLOCK_SUPERCONTEXT (context); |
dc478a5d | 8074 | else |
140b60b4 | 8075 | context = get_containing_scope (context); |
c6a1db6c RS |
8076 | } |
8077 | ||
8078 | return context; | |
8079 | } | |
8080 | ||
bfa30b22 | 8081 | /* Return the innermost context enclosing DECL that is |
c0560b8b | 8082 | a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none. |
c6a1db6c RS |
8083 | TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */ |
8084 | ||
8085 | tree | |
9566a759 | 8086 | decl_type_context (const_tree decl) |
c6a1db6c | 8087 | { |
bfa30b22 | 8088 | tree context = DECL_CONTEXT (decl); |
c6a1db6c RS |
8089 | |
8090 | while (context) | |
d1bd0ded GK |
8091 | switch (TREE_CODE (context)) |
8092 | { | |
8093 | case NAMESPACE_DECL: | |
8094 | case TRANSLATION_UNIT_DECL: | |
41077ce4 | 8095 | return NULL_TREE; |
7efda054 | 8096 | |
d1bd0ded GK |
8097 | case RECORD_TYPE: |
8098 | case UNION_TYPE: | |
8099 | case QUAL_UNION_TYPE: | |
c6a1db6c | 8100 | return context; |
9f63daea | 8101 | |
d1bd0ded GK |
8102 | case TYPE_DECL: |
8103 | case FUNCTION_DECL: | |
c6a1db6c | 8104 | context = DECL_CONTEXT (context); |
d1bd0ded | 8105 | break; |
9f63daea | 8106 | |
d1bd0ded | 8107 | case BLOCK: |
c6a1db6c | 8108 | context = BLOCK_SUPERCONTEXT (context); |
d1bd0ded | 8109 | break; |
9f63daea | 8110 | |
d1bd0ded | 8111 | default: |
1e128c5f | 8112 | gcc_unreachable (); |
d1bd0ded GK |
8113 | } |
8114 | ||
c6a1db6c RS |
8115 | return NULL_TREE; |
8116 | } | |
8117 | ||
582db8e4 | 8118 | /* CALL is a CALL_EXPR. Return the declaration for the function |
dc478a5d | 8119 | called, or NULL_TREE if the called function cannot be |
582db8e4 MM |
8120 | determined. */ |
8121 | ||
8122 | tree | |
fa233e34 | 8123 | get_callee_fndecl (const_tree call) |
582db8e4 MM |
8124 | { |
8125 | tree addr; | |
8126 | ||
3c9bb46e | 8127 | if (call == error_mark_node) |
fa233e34 | 8128 | return error_mark_node; |
3c9bb46e | 8129 | |
582db8e4 MM |
8130 | /* It's invalid to call this function with anything but a |
8131 | CALL_EXPR. */ | |
1e128c5f | 8132 | gcc_assert (TREE_CODE (call) == CALL_EXPR); |
582db8e4 MM |
8133 | |
8134 | /* The first operand to the CALL is the address of the function | |
8135 | called. */ | |
5039610b | 8136 | addr = CALL_EXPR_FN (call); |
582db8e4 | 8137 | |
c083cf9a JM |
8138 | STRIP_NOPS (addr); |
8139 | ||
8140 | /* If this is a readonly function pointer, extract its initial value. */ | |
8141 | if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL | |
8142 | && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr) | |
8143 | && DECL_INITIAL (addr)) | |
8144 | addr = DECL_INITIAL (addr); | |
8145 | ||
582db8e4 MM |
8146 | /* If the address is just `&f' for some function `f', then we know |
8147 | that `f' is being called. */ | |
8148 | if (TREE_CODE (addr) == ADDR_EXPR | |
8149 | && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL) | |
a1a0fd4e | 8150 | return TREE_OPERAND (addr, 0); |
9f63daea | 8151 | |
2700cb86 AP |
8152 | /* We couldn't figure out what was being called. */ |
8153 | return NULL_TREE; | |
582db8e4 MM |
8154 | } |
8155 | ||
d1485032 JM |
8156 | /* Print debugging information about tree nodes generated during the compile, |
8157 | and any language-specific information. */ | |
8158 | ||
c6a1db6c | 8159 | void |
46c5ad27 | 8160 | dump_tree_statistics (void) |
c6a1db6c | 8161 | { |
5e9defae | 8162 | #ifdef GATHER_STATISTICS |
c6a1db6c RS |
8163 | int i; |
8164 | int total_nodes, total_bytes; | |
5e9defae | 8165 | #endif |
c6a1db6c RS |
8166 | |
8167 | fprintf (stderr, "\n??? tree nodes created\n\n"); | |
8168 | #ifdef GATHER_STATISTICS | |
adc4adcd GP |
8169 | fprintf (stderr, "Kind Nodes Bytes\n"); |
8170 | fprintf (stderr, "---------------------------------------\n"); | |
c6a1db6c RS |
8171 | total_nodes = total_bytes = 0; |
8172 | for (i = 0; i < (int) all_kinds; i++) | |
8173 | { | |
adc4adcd | 8174 | fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i], |
c6a1db6c RS |
8175 | tree_node_counts[i], tree_node_sizes[i]); |
8176 | total_nodes += tree_node_counts[i]; | |
8177 | total_bytes += tree_node_sizes[i]; | |
8178 | } | |
adc4adcd GP |
8179 | fprintf (stderr, "---------------------------------------\n"); |
8180 | fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes); | |
8181 | fprintf (stderr, "---------------------------------------\n"); | |
6de9cd9a DN |
8182 | ssanames_print_statistics (); |
8183 | phinodes_print_statistics (); | |
c6a1db6c RS |
8184 | #else |
8185 | fprintf (stderr, "(No per-node statistics)\n"); | |
8186 | #endif | |
d88f311b | 8187 | print_type_hash_statistics (); |
f991abd1 | 8188 | print_debug_expr_statistics (); |
833b3afe | 8189 | print_value_expr_statistics (); |
ae2bcd98 | 8190 | lang_hooks.print_statistics (); |
c6a1db6c | 8191 | } |
bb288278 | 8192 | \f |
2ce3c6c6 | 8193 | #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s" |
bb288278 | 8194 | |
2aab7ceb | 8195 | /* Generate a crc32 of a string. */ |
e2c31432 | 8196 | |
2aab7ceb NS |
8197 | unsigned |
8198 | crc32_string (unsigned chksum, const char *string) | |
e2c31432 | 8199 | { |
2aab7ceb NS |
8200 | do |
8201 | { | |
8202 | unsigned value = *string << 24; | |
8203 | unsigned ix; | |
9f63daea | 8204 | |
2aab7ceb NS |
8205 | for (ix = 8; ix--; value <<= 1) |
8206 | { | |
8207 | unsigned feedback; | |
9f63daea | 8208 | |
2aab7ceb NS |
8209 | feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0; |
8210 | chksum <<= 1; | |
8211 | chksum ^= feedback; | |
8212 | } | |
8213 | } | |
8214 | while (*string++); | |
8215 | return chksum; | |
e2c31432 JM |
8216 | } |
8217 | ||
881c6935 JM |
8218 | /* P is a string that will be used in a symbol. Mask out any characters |
8219 | that are not valid in that context. */ | |
8220 | ||
8221 | void | |
46c5ad27 | 8222 | clean_symbol_name (char *p) |
881c6935 JM |
8223 | { |
8224 | for (; *p; p++) | |
0df6c2c7 | 8225 | if (! (ISALNUM (*p) |
881c6935 JM |
8226 | #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */ |
8227 | || *p == '$' | |
8228 | #endif | |
8229 | #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */ | |
8230 | || *p == '.' | |
8231 | #endif | |
0df6c2c7 | 8232 | )) |
881c6935 JM |
8233 | *p = '_'; |
8234 | } | |
3b03c671 | 8235 | |
5880f14f GK |
8236 | /* Generate a name for a special-purpose function function. |
8237 | The generated name may need to be unique across the whole link. | |
e2c31432 | 8238 | TYPE is some string to identify the purpose of this function to the |
5880f14f GK |
8239 | linker or collect2; it must start with an uppercase letter, |
8240 | one of: | |
8241 | I - for constructors | |
8242 | D - for destructors | |
8243 | N - for C++ anonymous namespaces | |
8244 | F - for DWARF unwind frame information. */ | |
bb288278 PB |
8245 | |
8246 | tree | |
5880f14f | 8247 | get_file_function_name (const char *type) |
bb288278 PB |
8248 | { |
8249 | char *buf; | |
3b304f5b ZW |
8250 | const char *p; |
8251 | char *q; | |
bb288278 | 8252 | |
5880f14f | 8253 | /* If we already have a name we know to be unique, just use that. */ |
bb288278 | 8254 | if (first_global_object_name) |
3b8031bb | 8255 | p = q = ASTRDUP (first_global_object_name); |
5880f14f GK |
8256 | /* If the target is handling the constructors/destructors, they |
8257 | will be local to this file and the name is only necessary for | |
8258 | debugging purposes. */ | |
8259 | else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors) | |
e21d6c60 | 8260 | { |
5880f14f GK |
8261 | const char *file = main_input_filename; |
8262 | if (! file) | |
8263 | file = input_filename; | |
8264 | /* Just use the file's basename, because the full pathname | |
8265 | might be quite long. */ | |
8266 | p = strrchr (file, '/'); | |
8267 | if (p) | |
8268 | p++; | |
8269 | else | |
8270 | p = file; | |
8271 | p = q = ASTRDUP (p); | |
e21d6c60 | 8272 | } |
bb288278 | 8273 | else |
e2c31432 | 8274 | { |
5880f14f GK |
8275 | /* Otherwise, the name must be unique across the entire link. |
8276 | We don't have anything that we know to be unique to this translation | |
e2c31432 | 8277 | unit, so use what we do have and throw in some randomness. */ |
2aab7ceb | 8278 | unsigned len; |
37b37199 KG |
8279 | const char *name = weak_global_object_name; |
8280 | const char *file = main_input_filename; | |
e2c31432 JM |
8281 | |
8282 | if (! name) | |
8283 | name = ""; | |
8284 | if (! file) | |
8285 | file = input_filename; | |
8286 | ||
2aab7ceb | 8287 | len = strlen (file); |
3d9a9f94 | 8288 | q = (char *) alloca (9 * 2 + len + 1); |
2aab7ceb | 8289 | memcpy (q, file, len + 1); |
2aab7ceb | 8290 | |
2aab7ceb | 8291 | sprintf (q + len, "_%08X_%08X", crc32_string (0, name), |
403d4851 | 8292 | crc32_string (0, get_random_seed (false))); |
e2c31432 | 8293 | |
3b304f5b | 8294 | p = q; |
e2c31432 | 8295 | } |
bb288278 | 8296 | |
3b8031bb | 8297 | clean_symbol_name (q); |
3d9a9f94 KG |
8298 | buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) |
8299 | + strlen (type)); | |
bb288278 | 8300 | |
dc478a5d | 8301 | /* Set up the name of the file-level functions we may need. |
d4b60170 | 8302 | Use a global object (which is already required to be unique over |
bb288278 | 8303 | the program) rather than the file name (which imposes extra |
d4b60170 | 8304 | constraints). */ |
2ce3c6c6 | 8305 | sprintf (buf, FILE_FUNCTION_FORMAT, type, p); |
bb288278 | 8306 | |
bb288278 PB |
8307 | return get_identifier (buf); |
8308 | } | |
bca949e2 | 8309 | \f |
f4524c9e | 8310 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
eb34af89 | 8311 | |
086e3095 | 8312 | /* Complain that the tree code of NODE does not match the expected 0 |
ea1763b1 NS |
8313 | terminated list of trailing codes. The trailing code list can be |
8314 | empty, for a more vague error message. FILE, LINE, and FUNCTION | |
8315 | are of the caller. */ | |
dc478a5d | 8316 | |
8f985ec4 | 8317 | void |
741ac903 | 8318 | tree_check_failed (const_tree node, const char *file, |
086e3095 NS |
8319 | int line, const char *function, ...) |
8320 | { | |
8321 | va_list args; | |
741ac903 | 8322 | const char *buffer; |
086e3095 NS |
8323 | unsigned length = 0; |
8324 | int code; | |
8325 | ||
8326 | va_start (args, function); | |
8327 | while ((code = va_arg (args, int))) | |
8328 | length += 4 + strlen (tree_code_name[code]); | |
8329 | va_end (args); | |
ea1763b1 | 8330 | if (length) |
086e3095 | 8331 | { |
741ac903 | 8332 | char *tmp; |
ea1763b1 NS |
8333 | va_start (args, function); |
8334 | length += strlen ("expected "); | |
3d9a9f94 | 8335 | buffer = tmp = (char *) alloca (length); |
ea1763b1 NS |
8336 | length = 0; |
8337 | while ((code = va_arg (args, int))) | |
086e3095 | 8338 | { |
ea1763b1 | 8339 | const char *prefix = length ? " or " : "expected "; |
b8698a0f | 8340 | |
741ac903 | 8341 | strcpy (tmp + length, prefix); |
ea1763b1 | 8342 | length += strlen (prefix); |
741ac903 | 8343 | strcpy (tmp + length, tree_code_name[code]); |
ea1763b1 | 8344 | length += strlen (tree_code_name[code]); |
086e3095 | 8345 | } |
ea1763b1 | 8346 | va_end (args); |
086e3095 | 8347 | } |
ea1763b1 | 8348 | else |
741ac903 | 8349 | buffer = "unexpected node"; |
9f63daea | 8350 | |
ea1763b1 | 8351 | internal_error ("tree check: %s, have %s in %s, at %s:%d", |
086e3095 | 8352 | buffer, tree_code_name[TREE_CODE (node)], |
eb34af89 RK |
8353 | function, trim_filename (file), line); |
8354 | } | |
8355 | ||
086e3095 NS |
8356 | /* Complain that the tree code of NODE does match the expected 0 |
8357 | terminated list of trailing codes. FILE, LINE, and FUNCTION are of | |
8358 | the caller. */ | |
eb34af89 RK |
8359 | |
8360 | void | |
741ac903 | 8361 | tree_not_check_failed (const_tree node, const char *file, |
086e3095 NS |
8362 | int line, const char *function, ...) |
8363 | { | |
8364 | va_list args; | |
8365 | char *buffer; | |
8366 | unsigned length = 0; | |
8367 | int code; | |
8368 | ||
8369 | va_start (args, function); | |
8370 | while ((code = va_arg (args, int))) | |
8371 | length += 4 + strlen (tree_code_name[code]); | |
8372 | va_end (args); | |
8373 | va_start (args, function); | |
3d9a9f94 | 8374 | buffer = (char *) alloca (length); |
086e3095 NS |
8375 | length = 0; |
8376 | while ((code = va_arg (args, int))) | |
8377 | { | |
8378 | if (length) | |
8379 | { | |
8380 | strcpy (buffer + length, " or "); | |
8381 | length += 4; | |
8382 | } | |
8383 | strcpy (buffer + length, tree_code_name[code]); | |
8384 | length += strlen (tree_code_name[code]); | |
8385 | } | |
8386 | va_end (args); | |
9f63daea | 8387 | |
086e3095 NS |
8388 | internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d", |
8389 | buffer, tree_code_name[TREE_CODE (node)], | |
eb34af89 RK |
8390 | function, trim_filename (file), line); |
8391 | } | |
8392 | ||
eb34af89 | 8393 | /* Similar to tree_check_failed, except that we check for a class of tree |
9ec36da5 | 8394 | code, given in CL. */ |
dc478a5d | 8395 | |
8f985ec4 | 8396 | void |
741ac903 | 8397 | tree_class_check_failed (const_tree node, const enum tree_code_class cl, |
6615c446 | 8398 | const char *file, int line, const char *function) |
12b195d9 | 8399 | { |
fce687f8 | 8400 | internal_error |
6615c446 JO |
8401 | ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d", |
8402 | TREE_CODE_CLASS_STRING (cl), | |
8403 | TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))), | |
fce687f8 | 8404 | tree_code_name[TREE_CODE (node)], function, trim_filename (file), line); |
8f985ec4 | 8405 | } |
dd5827cb | 8406 | |
953ff289 DN |
8407 | /* Similar to tree_check_failed, except that instead of specifying a |
8408 | dozen codes, use the knowledge that they're all sequential. */ | |
8409 | ||
8410 | void | |
741ac903 | 8411 | tree_range_check_failed (const_tree node, const char *file, int line, |
953ff289 DN |
8412 | const char *function, enum tree_code c1, |
8413 | enum tree_code c2) | |
8414 | { | |
8415 | char *buffer; | |
8416 | unsigned length = 0; | |
09639a83 | 8417 | unsigned int c; |
953ff289 DN |
8418 | |
8419 | for (c = c1; c <= c2; ++c) | |
8420 | length += 4 + strlen (tree_code_name[c]); | |
8421 | ||
8422 | length += strlen ("expected "); | |
3d9a9f94 | 8423 | buffer = (char *) alloca (length); |
953ff289 DN |
8424 | length = 0; |
8425 | ||
8426 | for (c = c1; c <= c2; ++c) | |
8427 | { | |
8428 | const char *prefix = length ? " or " : "expected "; | |
8429 | ||
8430 | strcpy (buffer + length, prefix); | |
8431 | length += strlen (prefix); | |
8432 | strcpy (buffer + length, tree_code_name[c]); | |
8433 | length += strlen (tree_code_name[c]); | |
8434 | } | |
8435 | ||
8436 | internal_error ("tree check: %s, have %s in %s, at %s:%d", | |
8437 | buffer, tree_code_name[TREE_CODE (node)], | |
8438 | function, trim_filename (file), line); | |
8439 | } | |
8440 | ||
8441 | ||
dd5827cb ILT |
8442 | /* Similar to tree_check_failed, except that we check that a tree does |
8443 | not have the specified code, given in CL. */ | |
8444 | ||
8445 | void | |
741ac903 | 8446 | tree_not_class_check_failed (const_tree node, const enum tree_code_class cl, |
dd5827cb ILT |
8447 | const char *file, int line, const char *function) |
8448 | { | |
8449 | internal_error | |
8450 | ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d", | |
8451 | TREE_CODE_CLASS_STRING (cl), | |
8452 | TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))), | |
8453 | tree_code_name[TREE_CODE (node)], function, trim_filename (file), line); | |
8454 | } | |
8455 | ||
aaf46ef9 DN |
8456 | |
8457 | /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */ | |
8458 | ||
8459 | void | |
741ac903 | 8460 | omp_clause_check_failed (const_tree node, const char *file, int line, |
aaf46ef9 DN |
8461 | const char *function, enum omp_clause_code code) |
8462 | { | |
8463 | internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d", | |
8464 | omp_clause_code_name[code], tree_code_name[TREE_CODE (node)], | |
8465 | function, trim_filename (file), line); | |
8466 | } | |
8467 | ||
8468 | ||
8469 | /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */ | |
8470 | ||
8471 | void | |
741ac903 | 8472 | omp_clause_range_check_failed (const_tree node, const char *file, int line, |
aaf46ef9 DN |
8473 | const char *function, enum omp_clause_code c1, |
8474 | enum omp_clause_code c2) | |
8475 | { | |
8476 | char *buffer; | |
8477 | unsigned length = 0; | |
09639a83 | 8478 | unsigned int c; |
aaf46ef9 DN |
8479 | |
8480 | for (c = c1; c <= c2; ++c) | |
8481 | length += 4 + strlen (omp_clause_code_name[c]); | |
8482 | ||
8483 | length += strlen ("expected "); | |
3d9a9f94 | 8484 | buffer = (char *) alloca (length); |
aaf46ef9 DN |
8485 | length = 0; |
8486 | ||
8487 | for (c = c1; c <= c2; ++c) | |
8488 | { | |
8489 | const char *prefix = length ? " or " : "expected "; | |
8490 | ||
8491 | strcpy (buffer + length, prefix); | |
8492 | length += strlen (prefix); | |
8493 | strcpy (buffer + length, omp_clause_code_name[c]); | |
8494 | length += strlen (omp_clause_code_name[c]); | |
8495 | } | |
8496 | ||
8497 | internal_error ("tree check: %s, have %s in %s, at %s:%d", | |
8498 | buffer, omp_clause_code_name[TREE_CODE (node)], | |
8499 | function, trim_filename (file), line); | |
8500 | } | |
8501 | ||
8502 | ||
820cc88f DB |
8503 | #undef DEFTREESTRUCT |
8504 | #define DEFTREESTRUCT(VAL, NAME) NAME, | |
8505 | ||
8506 | static const char *ts_enum_names[] = { | |
8507 | #include "treestruct.def" | |
8508 | }; | |
8509 | #undef DEFTREESTRUCT | |
8510 | ||
8511 | #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)]) | |
8512 | ||
8513 | /* Similar to tree_class_check_failed, except that we check for | |
8514 | whether CODE contains the tree structure identified by EN. */ | |
8515 | ||
8516 | void | |
b8698a0f | 8517 | tree_contains_struct_check_failed (const_tree node, |
820cc88f | 8518 | const enum tree_node_structure_enum en, |
b8698a0f | 8519 | const char *file, int line, |
820cc88f DB |
8520 | const char *function) |
8521 | { | |
8522 | internal_error | |
23204428 | 8523 | ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d", |
820cc88f DB |
8524 | TS_ENUM_NAME(en), |
8525 | tree_code_name[TREE_CODE (node)], function, trim_filename (file), line); | |
8526 | } | |
8527 | ||
8f985ec4 | 8528 | |
fa7b533b ZW |
8529 | /* Similar to above, except that the check is for the bounds of a TREE_VEC's |
8530 | (dynamically sized) vector. */ | |
8531 | ||
8532 | void | |
46c5ad27 AJ |
8533 | tree_vec_elt_check_failed (int idx, int len, const char *file, int line, |
8534 | const char *function) | |
fa7b533b ZW |
8535 | { |
8536 | internal_error | |
8537 | ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d", | |
8538 | idx + 1, len, function, trim_filename (file), line); | |
8539 | } | |
8540 | ||
06790e5f | 8541 | /* Similar to above, except that the check is for the bounds of the operand |
5039610b | 8542 | vector of an expression node EXP. */ |
06790e5f ZW |
8543 | |
8544 | void | |
741ac903 | 8545 | tree_operand_check_failed (int idx, const_tree exp, const char *file, |
46c5ad27 | 8546 | int line, const char *function) |
06790e5f | 8547 | { |
5039610b | 8548 | int code = TREE_CODE (exp); |
06790e5f ZW |
8549 | internal_error |
8550 | ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d", | |
5039610b | 8551 | idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp), |
06790e5f ZW |
8552 | function, trim_filename (file), line); |
8553 | } | |
aaf46ef9 DN |
8554 | |
8555 | /* Similar to above, except that the check is for the number of | |
8556 | operands of an OMP_CLAUSE node. */ | |
8557 | ||
8558 | void | |
9566a759 | 8559 | omp_clause_operand_check_failed (int idx, const_tree t, const char *file, |
aaf46ef9 DN |
8560 | int line, const char *function) |
8561 | { | |
8562 | internal_error | |
8563 | ("tree check: accessed operand %d of omp_clause %s with %d operands " | |
8564 | "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)], | |
8565 | omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function, | |
8566 | trim_filename (file), line); | |
8567 | } | |
f4524c9e | 8568 | #endif /* ENABLE_TREE_CHECKING */ |
81b3411c | 8569 | \f |
26277d41 PB |
8570 | /* Create a new vector type node holding SUBPARTS units of type INNERTYPE, |
8571 | and mapped to the machine mode MODE. Initialize its fields and build | |
8572 | the information necessary for debugging output. */ | |
dc478a5d | 8573 | |
26277d41 PB |
8574 | static tree |
8575 | make_vector_type (tree innertype, int nunits, enum machine_mode mode) | |
4061f623 | 8576 | { |
ca58211b PB |
8577 | tree t; |
8578 | hashval_t hashcode = 0; | |
8579 | ||
ca58211b | 8580 | t = make_node (VECTOR_TYPE); |
d70b8c3a | 8581 | TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype); |
a4e8ea7f | 8582 | SET_TYPE_VECTOR_SUBPARTS (t, nunits); |
179d2f74 | 8583 | SET_TYPE_MODE (t, mode); |
d70b8c3a | 8584 | |
06d40de8 DG |
8585 | if (TYPE_STRUCTURAL_EQUALITY_P (innertype)) |
8586 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
8587 | else if (TYPE_CANONICAL (innertype) != innertype | |
8588 | || mode != VOIDmode) | |
b8698a0f | 8589 | TYPE_CANONICAL (t) |
06d40de8 DG |
8590 | = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode); |
8591 | ||
4061f623 BS |
8592 | layout_type (t); |
8593 | ||
8594 | { | |
7d60be94 | 8595 | tree index = build_int_cst (NULL_TREE, nunits - 1); |
b842d478 RG |
8596 | tree array = build_array_type (TYPE_MAIN_VARIANT (innertype), |
8597 | build_index_type (index)); | |
4061f623 BS |
8598 | tree rt = make_node (RECORD_TYPE); |
8599 | ||
c2255bc4 AH |
8600 | TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL, |
8601 | get_identifier ("f"), array); | |
4061f623 BS |
8602 | DECL_CONTEXT (TYPE_FIELDS (rt)) = rt; |
8603 | layout_type (rt); | |
8604 | TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt; | |
8605 | /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output | |
8606 | the representation type, and we want to find that die when looking up | |
8607 | the vector type. This is most easily achieved by making the TYPE_UID | |
8608 | numbers equal. */ | |
8609 | TYPE_UID (rt) = TYPE_UID (t); | |
8610 | } | |
26277d41 | 8611 | |
ca58211b | 8612 | hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode); |
907dd6ae | 8613 | hashcode = iterative_hash_host_wide_int (nunits, hashcode); |
ca58211b | 8614 | hashcode = iterative_hash_host_wide_int (mode, hashcode); |
907dd6ae RG |
8615 | hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode); |
8616 | t = type_hash_canon (hashcode, t); | |
8617 | ||
8618 | /* We have built a main variant, based on the main variant of the | |
8619 | inner type. Use it to build the variant we return. */ | |
8620 | if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype)) | |
8621 | && TREE_TYPE (t) != innertype) | |
8622 | return build_type_attribute_qual_variant (t, | |
8623 | TYPE_ATTRIBUTES (innertype), | |
8624 | TYPE_QUALS (innertype)); | |
8625 | ||
8626 | return t; | |
4061f623 BS |
8627 | } |
8628 | ||
cc27e657 PB |
8629 | static tree |
8630 | make_or_reuse_type (unsigned size, int unsignedp) | |
8631 | { | |
8632 | if (size == INT_TYPE_SIZE) | |
8633 | return unsignedp ? unsigned_type_node : integer_type_node; | |
8634 | if (size == CHAR_TYPE_SIZE) | |
8635 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
8636 | if (size == SHORT_TYPE_SIZE) | |
8637 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
8638 | if (size == LONG_TYPE_SIZE) | |
8639 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
8640 | if (size == LONG_LONG_TYPE_SIZE) | |
8641 | return (unsignedp ? long_long_unsigned_type_node | |
8642 | : long_long_integer_type_node); | |
8643 | ||
8644 | if (unsignedp) | |
8645 | return make_unsigned_type (size); | |
8646 | else | |
8647 | return make_signed_type (size); | |
8648 | } | |
8649 | ||
325217ed CF |
8650 | /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */ |
8651 | ||
8652 | static tree | |
8653 | make_or_reuse_fract_type (unsigned size, int unsignedp, int satp) | |
8654 | { | |
8655 | if (satp) | |
8656 | { | |
8657 | if (size == SHORT_FRACT_TYPE_SIZE) | |
8658 | return unsignedp ? sat_unsigned_short_fract_type_node | |
8659 | : sat_short_fract_type_node; | |
8660 | if (size == FRACT_TYPE_SIZE) | |
8661 | return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node; | |
8662 | if (size == LONG_FRACT_TYPE_SIZE) | |
8663 | return unsignedp ? sat_unsigned_long_fract_type_node | |
8664 | : sat_long_fract_type_node; | |
8665 | if (size == LONG_LONG_FRACT_TYPE_SIZE) | |
8666 | return unsignedp ? sat_unsigned_long_long_fract_type_node | |
8667 | : sat_long_long_fract_type_node; | |
8668 | } | |
8669 | else | |
8670 | { | |
8671 | if (size == SHORT_FRACT_TYPE_SIZE) | |
8672 | return unsignedp ? unsigned_short_fract_type_node | |
8673 | : short_fract_type_node; | |
8674 | if (size == FRACT_TYPE_SIZE) | |
8675 | return unsignedp ? unsigned_fract_type_node : fract_type_node; | |
8676 | if (size == LONG_FRACT_TYPE_SIZE) | |
8677 | return unsignedp ? unsigned_long_fract_type_node | |
8678 | : long_fract_type_node; | |
8679 | if (size == LONG_LONG_FRACT_TYPE_SIZE) | |
8680 | return unsignedp ? unsigned_long_long_fract_type_node | |
8681 | : long_long_fract_type_node; | |
8682 | } | |
8683 | ||
8684 | return make_fract_type (size, unsignedp, satp); | |
8685 | } | |
8686 | ||
8687 | /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */ | |
8688 | ||
8689 | static tree | |
8690 | make_or_reuse_accum_type (unsigned size, int unsignedp, int satp) | |
8691 | { | |
8692 | if (satp) | |
8693 | { | |
8694 | if (size == SHORT_ACCUM_TYPE_SIZE) | |
8695 | return unsignedp ? sat_unsigned_short_accum_type_node | |
8696 | : sat_short_accum_type_node; | |
8697 | if (size == ACCUM_TYPE_SIZE) | |
8698 | return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node; | |
8699 | if (size == LONG_ACCUM_TYPE_SIZE) | |
8700 | return unsignedp ? sat_unsigned_long_accum_type_node | |
8701 | : sat_long_accum_type_node; | |
8702 | if (size == LONG_LONG_ACCUM_TYPE_SIZE) | |
8703 | return unsignedp ? sat_unsigned_long_long_accum_type_node | |
8704 | : sat_long_long_accum_type_node; | |
8705 | } | |
8706 | else | |
8707 | { | |
8708 | if (size == SHORT_ACCUM_TYPE_SIZE) | |
8709 | return unsignedp ? unsigned_short_accum_type_node | |
8710 | : short_accum_type_node; | |
8711 | if (size == ACCUM_TYPE_SIZE) | |
8712 | return unsignedp ? unsigned_accum_type_node : accum_type_node; | |
8713 | if (size == LONG_ACCUM_TYPE_SIZE) | |
8714 | return unsignedp ? unsigned_long_accum_type_node | |
8715 | : long_accum_type_node; | |
8716 | if (size == LONG_LONG_ACCUM_TYPE_SIZE) | |
8717 | return unsignedp ? unsigned_long_long_accum_type_node | |
8718 | : long_long_accum_type_node; | |
8719 | } | |
8720 | ||
8721 | return make_accum_type (size, unsignedp, satp); | |
8722 | } | |
8723 | ||
81b3411c BS |
8724 | /* Create nodes for all integer types (and error_mark_node) using the sizes |
8725 | of C datatypes. The caller should call set_sizetype soon after calling | |
8726 | this function to select one of the types as sizetype. */ | |
dc478a5d | 8727 | |
81b3411c | 8728 | void |
8c1d6d62 | 8729 | build_common_tree_nodes (bool signed_char, bool signed_sizetype) |
81b3411c BS |
8730 | { |
8731 | error_mark_node = make_node (ERROR_MARK); | |
8732 | TREE_TYPE (error_mark_node) = error_mark_node; | |
8733 | ||
8c1d6d62 | 8734 | initialize_sizetypes (signed_sizetype); |
fed3cef0 | 8735 | |
81b3411c BS |
8736 | /* Define both `signed char' and `unsigned char'. */ |
8737 | signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE); | |
05fa7d54 | 8738 | TYPE_STRING_FLAG (signed_char_type_node) = 1; |
81b3411c | 8739 | unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE); |
05fa7d54 | 8740 | TYPE_STRING_FLAG (unsigned_char_type_node) = 1; |
81b3411c BS |
8741 | |
8742 | /* Define `char', which is like either `signed char' or `unsigned char' | |
8743 | but not the same as either. */ | |
8744 | char_type_node | |
8745 | = (signed_char | |
8746 | ? make_signed_type (CHAR_TYPE_SIZE) | |
8747 | : make_unsigned_type (CHAR_TYPE_SIZE)); | |
05fa7d54 | 8748 | TYPE_STRING_FLAG (char_type_node) = 1; |
81b3411c BS |
8749 | |
8750 | short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE); | |
8751 | short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE); | |
8752 | integer_type_node = make_signed_type (INT_TYPE_SIZE); | |
81b3411c BS |
8753 | unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE); |
8754 | long_integer_type_node = make_signed_type (LONG_TYPE_SIZE); | |
8755 | long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE); | |
8756 | long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE); | |
8757 | long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE); | |
8758 | ||
de7df9eb JM |
8759 | /* Define a boolean type. This type only represents boolean values but |
8760 | may be larger than char depending on the value of BOOL_TYPE_SIZE. | |
8761 | Front ends which want to override this size (i.e. Java) can redefine | |
8762 | boolean_type_node before calling build_common_tree_nodes_2. */ | |
8763 | boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE); | |
8764 | TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE); | |
7d60be94 | 8765 | TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1); |
de7df9eb JM |
8766 | TYPE_PRECISION (boolean_type_node) = 1; |
8767 | ||
cc27e657 PB |
8768 | /* Fill in the rest of the sized types. Reuse existing type nodes |
8769 | when possible. */ | |
8770 | intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0); | |
8771 | intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0); | |
8772 | intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0); | |
8773 | intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0); | |
8774 | intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0); | |
8775 | ||
8776 | unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1); | |
8777 | unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1); | |
8778 | unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1); | |
8779 | unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1); | |
8780 | unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1); | |
9f63daea | 8781 | |
5a98fa7b MM |
8782 | access_public_node = get_identifier ("public"); |
8783 | access_protected_node = get_identifier ("protected"); | |
8784 | access_private_node = get_identifier ("private"); | |
81b3411c BS |
8785 | } |
8786 | ||
81b3411c | 8787 | /* Call this function after calling build_common_tree_nodes and set_sizetype. |
fed3cef0 | 8788 | It will create several other common tree nodes. */ |
d4b60170 | 8789 | |
81b3411c | 8790 | void |
46c5ad27 | 8791 | build_common_tree_nodes_2 (int short_double) |
81b3411c | 8792 | { |
05bccae2 | 8793 | /* Define these next since types below may used them. */ |
7d60be94 NS |
8794 | integer_zero_node = build_int_cst (NULL_TREE, 0); |
8795 | integer_one_node = build_int_cst (NULL_TREE, 1); | |
8796 | integer_minus_one_node = build_int_cst (NULL_TREE, -1); | |
81b3411c | 8797 | |
770ae6cc RK |
8798 | size_zero_node = size_int (0); |
8799 | size_one_node = size_int (1); | |
8800 | bitsize_zero_node = bitsize_int (0); | |
8801 | bitsize_one_node = bitsize_int (1); | |
8802 | bitsize_unit_node = bitsize_int (BITS_PER_UNIT); | |
81b3411c | 8803 | |
de7df9eb JM |
8804 | boolean_false_node = TYPE_MIN_VALUE (boolean_type_node); |
8805 | boolean_true_node = TYPE_MAX_VALUE (boolean_type_node); | |
8806 | ||
81b3411c | 8807 | void_type_node = make_node (VOID_TYPE); |
05bccae2 | 8808 | layout_type (void_type_node); |
d4b60170 | 8809 | |
81b3411c BS |
8810 | /* We are not going to have real types in C with less than byte alignment, |
8811 | so we might as well not have any types that claim to have it. */ | |
8812 | TYPE_ALIGN (void_type_node) = BITS_PER_UNIT; | |
11cf4d18 | 8813 | TYPE_USER_ALIGN (void_type_node) = 0; |
81b3411c | 8814 | |
7d60be94 | 8815 | null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0); |
81b3411c BS |
8816 | layout_type (TREE_TYPE (null_pointer_node)); |
8817 | ||
8818 | ptr_type_node = build_pointer_type (void_type_node); | |
8819 | const_ptr_type_node | |
8820 | = build_pointer_type (build_type_variant (void_type_node, 1, 0)); | |
498c0f27 | 8821 | fileptr_type_node = ptr_type_node; |
81b3411c BS |
8822 | |
8823 | float_type_node = make_node (REAL_TYPE); | |
8824 | TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE; | |
8825 | layout_type (float_type_node); | |
8826 | ||
8827 | double_type_node = make_node (REAL_TYPE); | |
8828 | if (short_double) | |
8829 | TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE; | |
8830 | else | |
8831 | TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE; | |
8832 | layout_type (double_type_node); | |
8833 | ||
8834 | long_double_type_node = make_node (REAL_TYPE); | |
8835 | TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE; | |
8836 | layout_type (long_double_type_node); | |
8837 | ||
a2a919aa KG |
8838 | float_ptr_type_node = build_pointer_type (float_type_node); |
8839 | double_ptr_type_node = build_pointer_type (double_type_node); | |
8840 | long_double_ptr_type_node = build_pointer_type (long_double_type_node); | |
8841 | integer_ptr_type_node = build_pointer_type (integer_type_node); | |
8842 | ||
167fa32c EC |
8843 | /* Fixed size integer types. */ |
8844 | uint32_type_node = build_nonstandard_integer_type (32, true); | |
8845 | uint64_type_node = build_nonstandard_integer_type (64, true); | |
8846 | ||
9a8ce21f JG |
8847 | /* Decimal float types. */ |
8848 | dfloat32_type_node = make_node (REAL_TYPE); | |
b8698a0f | 8849 | TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE; |
9a8ce21f | 8850 | layout_type (dfloat32_type_node); |
179d2f74 | 8851 | SET_TYPE_MODE (dfloat32_type_node, SDmode); |
9a8ce21f JG |
8852 | dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node); |
8853 | ||
8854 | dfloat64_type_node = make_node (REAL_TYPE); | |
8855 | TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE; | |
8856 | layout_type (dfloat64_type_node); | |
179d2f74 | 8857 | SET_TYPE_MODE (dfloat64_type_node, DDmode); |
9a8ce21f JG |
8858 | dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node); |
8859 | ||
8860 | dfloat128_type_node = make_node (REAL_TYPE); | |
b8698a0f | 8861 | TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE; |
9a8ce21f | 8862 | layout_type (dfloat128_type_node); |
179d2f74 | 8863 | SET_TYPE_MODE (dfloat128_type_node, TDmode); |
9a8ce21f JG |
8864 | dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node); |
8865 | ||
e89886a0 DG |
8866 | complex_integer_type_node = build_complex_type (integer_type_node); |
8867 | complex_float_type_node = build_complex_type (float_type_node); | |
8868 | complex_double_type_node = build_complex_type (double_type_node); | |
8869 | complex_long_double_type_node = build_complex_type (long_double_type_node); | |
81b3411c | 8870 | |
325217ed | 8871 | /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */ |
70d3fcab AH |
8872 | #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \ |
8873 | sat_ ## KIND ## _type_node = \ | |
8874 | make_sat_signed_ ## KIND ## _type (SIZE); \ | |
8875 | sat_unsigned_ ## KIND ## _type_node = \ | |
8876 | make_sat_unsigned_ ## KIND ## _type (SIZE); \ | |
8877 | KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \ | |
8878 | unsigned_ ## KIND ## _type_node = \ | |
8879 | make_unsigned_ ## KIND ## _type (SIZE); | |
8880 | ||
8881 | #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \ | |
325217ed CF |
8882 | sat_ ## WIDTH ## KIND ## _type_node = \ |
8883 | make_sat_signed_ ## KIND ## _type (SIZE); \ | |
8884 | sat_unsigned_ ## WIDTH ## KIND ## _type_node = \ | |
8885 | make_sat_unsigned_ ## KIND ## _type (SIZE); \ | |
8886 | WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \ | |
8887 | unsigned_ ## WIDTH ## KIND ## _type_node = \ | |
8888 | make_unsigned_ ## KIND ## _type (SIZE); | |
8889 | ||
8890 | /* Make fixed-point type nodes based on four different widths. */ | |
8891 | #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \ | |
70d3fcab AH |
8892 | MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \ |
8893 | MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \ | |
8894 | MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \ | |
8895 | MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE) | |
325217ed CF |
8896 | |
8897 | /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */ | |
8898 | #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \ | |
8899 | NAME ## _type_node = \ | |
8900 | make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \ | |
8901 | u ## NAME ## _type_node = \ | |
8902 | make_or_reuse_unsigned_ ## KIND ## _type \ | |
8903 | (GET_MODE_BITSIZE (U ## MODE ## mode)); \ | |
8904 | sat_ ## NAME ## _type_node = \ | |
8905 | make_or_reuse_sat_signed_ ## KIND ## _type \ | |
8906 | (GET_MODE_BITSIZE (MODE ## mode)); \ | |
8907 | sat_u ## NAME ## _type_node = \ | |
8908 | make_or_reuse_sat_unsigned_ ## KIND ## _type \ | |
8909 | (GET_MODE_BITSIZE (U ## MODE ## mode)); | |
8910 | ||
8911 | /* Fixed-point type and mode nodes. */ | |
8912 | MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT) | |
8913 | MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM) | |
8914 | MAKE_FIXED_MODE_NODE (fract, qq, QQ) | |
8915 | MAKE_FIXED_MODE_NODE (fract, hq, HQ) | |
8916 | MAKE_FIXED_MODE_NODE (fract, sq, SQ) | |
8917 | MAKE_FIXED_MODE_NODE (fract, dq, DQ) | |
8918 | MAKE_FIXED_MODE_NODE (fract, tq, TQ) | |
8919 | MAKE_FIXED_MODE_NODE (accum, ha, HA) | |
8920 | MAKE_FIXED_MODE_NODE (accum, sa, SA) | |
8921 | MAKE_FIXED_MODE_NODE (accum, da, DA) | |
8922 | MAKE_FIXED_MODE_NODE (accum, ta, TA) | |
8923 | ||
2df88e9f | 8924 | { |
5fd9b178 | 8925 | tree t = targetm.build_builtin_va_list (); |
066c84df | 8926 | |
4d6922ee | 8927 | /* Many back-ends define record types without setting TYPE_NAME. |
066c84df AO |
8928 | If we copied the record type here, we'd keep the original |
8929 | record type without a name. This breaks name mangling. So, | |
8930 | don't copy record types and let c_common_nodes_and_builtins() | |
8931 | declare the type to be __builtin_va_list. */ | |
8932 | if (TREE_CODE (t) != RECORD_TYPE) | |
8dd16ecc | 8933 | t = build_variant_type_copy (t); |
b8698a0f | 8934 | |
066c84df | 8935 | va_list_type_node = t; |
2df88e9f | 8936 | } |
0afeef64 AH |
8937 | } |
8938 | ||
c6a912da RH |
8939 | /* A subroutine of build_common_builtin_nodes. Define a builtin function. */ |
8940 | ||
8941 | static void | |
8942 | local_define_builtin (const char *name, tree type, enum built_in_function code, | |
8943 | const char *library_name, int ecf_flags) | |
8944 | { | |
8945 | tree decl; | |
8946 | ||
c79efc4d RÁE |
8947 | decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL, |
8948 | library_name, NULL_TREE); | |
c6a912da RH |
8949 | if (ecf_flags & ECF_CONST) |
8950 | TREE_READONLY (decl) = 1; | |
8951 | if (ecf_flags & ECF_PURE) | |
becfd6e5 KZ |
8952 | DECL_PURE_P (decl) = 1; |
8953 | if (ecf_flags & ECF_LOOPING_CONST_OR_PURE) | |
8954 | DECL_LOOPING_CONST_OR_PURE_P (decl) = 1; | |
c6a912da RH |
8955 | if (ecf_flags & ECF_NORETURN) |
8956 | TREE_THIS_VOLATILE (decl) = 1; | |
8957 | if (ecf_flags & ECF_NOTHROW) | |
8958 | TREE_NOTHROW (decl) = 1; | |
8959 | if (ecf_flags & ECF_MALLOC) | |
8960 | DECL_IS_MALLOC (decl) = 1; | |
8961 | ||
8962 | built_in_decls[code] = decl; | |
8963 | implicit_built_in_decls[code] = decl; | |
8964 | } | |
8965 | ||
8966 | /* Call this function after instantiating all builtins that the language | |
8967 | front end cares about. This will build the rest of the builtins that | |
384c400a | 8968 | are relied upon by the tree optimizers and the middle-end. */ |
c6a912da RH |
8969 | |
8970 | void | |
384c400a | 8971 | build_common_builtin_nodes (void) |
c6a912da | 8972 | { |
1d65f45c | 8973 | tree tmp, tmp2, ftype; |
c6a912da RH |
8974 | |
8975 | if (built_in_decls[BUILT_IN_MEMCPY] == NULL | |
8976 | || built_in_decls[BUILT_IN_MEMMOVE] == NULL) | |
8977 | { | |
8978 | tmp = tree_cons (NULL_TREE, size_type_node, void_list_node); | |
8979 | tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp); | |
8980 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
8981 | ftype = build_function_type (ptr_type_node, tmp); | |
8982 | ||
8983 | if (built_in_decls[BUILT_IN_MEMCPY] == NULL) | |
8984 | local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY, | |
8985 | "memcpy", ECF_NOTHROW); | |
8986 | if (built_in_decls[BUILT_IN_MEMMOVE] == NULL) | |
8987 | local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE, | |
8988 | "memmove", ECF_NOTHROW); | |
8989 | } | |
8990 | ||
8991 | if (built_in_decls[BUILT_IN_MEMCMP] == NULL) | |
8992 | { | |
8993 | tmp = tree_cons (NULL_TREE, size_type_node, void_list_node); | |
8994 | tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp); | |
8995 | tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp); | |
d1604bc5 | 8996 | ftype = build_function_type (integer_type_node, tmp); |
c6a912da RH |
8997 | local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP, |
8998 | "memcmp", ECF_PURE | ECF_NOTHROW); | |
8999 | } | |
9000 | ||
9001 | if (built_in_decls[BUILT_IN_MEMSET] == NULL) | |
9002 | { | |
9003 | tmp = tree_cons (NULL_TREE, size_type_node, void_list_node); | |
9004 | tmp = tree_cons (NULL_TREE, integer_type_node, tmp); | |
9005 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
9006 | ftype = build_function_type (ptr_type_node, tmp); | |
9007 | local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET, | |
9008 | "memset", ECF_NOTHROW); | |
9009 | } | |
9010 | ||
9011 | if (built_in_decls[BUILT_IN_ALLOCA] == NULL) | |
9012 | { | |
9013 | tmp = tree_cons (NULL_TREE, size_type_node, void_list_node); | |
9014 | ftype = build_function_type (ptr_type_node, tmp); | |
9015 | local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA, | |
d809253a EB |
9016 | "alloca", |
9017 | ECF_MALLOC | (flag_stack_check ? 0 : ECF_NOTHROW)); | |
c6a912da RH |
9018 | } |
9019 | ||
9020 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
9021 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
9022 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
9023 | ftype = build_function_type (void_type_node, tmp); | |
9024 | local_define_builtin ("__builtin_init_trampoline", ftype, | |
9025 | BUILT_IN_INIT_TRAMPOLINE, | |
9026 | "__builtin_init_trampoline", ECF_NOTHROW); | |
9027 | ||
9028 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
9029 | ftype = build_function_type (ptr_type_node, tmp); | |
9030 | local_define_builtin ("__builtin_adjust_trampoline", ftype, | |
9031 | BUILT_IN_ADJUST_TRAMPOLINE, | |
9032 | "__builtin_adjust_trampoline", | |
9033 | ECF_CONST | ECF_NOTHROW); | |
9034 | ||
9035 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
9036 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
9037 | ftype = build_function_type (void_type_node, tmp); | |
9038 | local_define_builtin ("__builtin_nonlocal_goto", ftype, | |
9039 | BUILT_IN_NONLOCAL_GOTO, | |
9040 | "__builtin_nonlocal_goto", | |
9041 | ECF_NORETURN | ECF_NOTHROW); | |
9042 | ||
4f6c2131 EB |
9043 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); |
9044 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
9045 | ftype = build_function_type (void_type_node, tmp); | |
9046 | local_define_builtin ("__builtin_setjmp_setup", ftype, | |
9047 | BUILT_IN_SETJMP_SETUP, | |
9048 | "__builtin_setjmp_setup", ECF_NOTHROW); | |
9049 | ||
9050 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
9051 | ftype = build_function_type (ptr_type_node, tmp); | |
9052 | local_define_builtin ("__builtin_setjmp_dispatcher", ftype, | |
9053 | BUILT_IN_SETJMP_DISPATCHER, | |
9054 | "__builtin_setjmp_dispatcher", | |
9055 | ECF_PURE | ECF_NOTHROW); | |
9056 | ||
9057 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
9058 | ftype = build_function_type (void_type_node, tmp); | |
9059 | local_define_builtin ("__builtin_setjmp_receiver", ftype, | |
9060 | BUILT_IN_SETJMP_RECEIVER, | |
9061 | "__builtin_setjmp_receiver", ECF_NOTHROW); | |
9062 | ||
c6a912da RH |
9063 | ftype = build_function_type (ptr_type_node, void_list_node); |
9064 | local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE, | |
9065 | "__builtin_stack_save", ECF_NOTHROW); | |
9066 | ||
9067 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
9068 | ftype = build_function_type (void_type_node, tmp); | |
9069 | local_define_builtin ("__builtin_stack_restore", ftype, | |
9070 | BUILT_IN_STACK_RESTORE, | |
9071 | "__builtin_stack_restore", ECF_NOTHROW); | |
9072 | ||
9073 | ftype = build_function_type (void_type_node, void_list_node); | |
9074 | local_define_builtin ("__builtin_profile_func_enter", ftype, | |
9075 | BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0); | |
9076 | local_define_builtin ("__builtin_profile_func_exit", ftype, | |
9077 | BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0); | |
7e7e470f | 9078 | |
384c400a RH |
9079 | /* If there's a possibility that we might use the ARM EABI, build the |
9080 | alternate __cxa_end_cleanup node used to resume from C++ and Java. */ | |
9081 | if (targetm.arm_eabi_unwinder) | |
1d65f45c RH |
9082 | { |
9083 | ftype = build_function_type (void_type_node, void_list_node); | |
384c400a RH |
9084 | local_define_builtin ("__builtin_cxa_end_cleanup", ftype, |
9085 | BUILT_IN_CXA_END_CLEANUP, | |
1d65f45c RH |
9086 | "__cxa_end_cleanup", ECF_NORETURN); |
9087 | } | |
384c400a RH |
9088 | |
9089 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
9090 | ftype = build_function_type (void_type_node, tmp); | |
9091 | local_define_builtin ("__builtin_unwind_resume", ftype, | |
9092 | BUILT_IN_UNWIND_RESUME, | |
9093 | (USING_SJLJ_EXCEPTIONS | |
9094 | ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"), | |
9095 | ECF_NORETURN); | |
1d65f45c RH |
9096 | |
9097 | /* The exception object and filter values from the runtime. The argument | |
9098 | must be zero before exception lowering, i.e. from the front end. After | |
9099 | exception lowering, it will be the region number for the exception | |
9100 | landing pad. These functions are PURE instead of CONST to prevent | |
9101 | them from being hoisted past the exception edge that will initialize | |
9102 | its value in the landing pad. */ | |
9103 | tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node); | |
9104 | ftype = build_function_type (ptr_type_node, tmp); | |
9105 | local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER, | |
9106 | "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW); | |
9107 | ||
9108 | tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0); | |
9109 | ftype = build_function_type (tmp2, tmp); | |
9110 | local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER, | |
9111 | "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW); | |
9112 | ||
9113 | tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node); | |
9114 | tmp = tree_cons (NULL_TREE, integer_type_node, tmp); | |
9115 | ftype = build_function_type (void_type_node, tmp); | |
9116 | local_define_builtin ("__builtin_eh_copy_values", ftype, | |
9117 | BUILT_IN_EH_COPY_VALUES, | |
9118 | "__builtin_eh_copy_values", ECF_NOTHROW); | |
9119 | ||
7e7e470f RH |
9120 | /* Complex multiplication and division. These are handled as builtins |
9121 | rather than optabs because emit_library_call_value doesn't support | |
b8698a0f | 9122 | complex. Further, we can do slightly better with folding these |
7e7e470f RH |
9123 | beasties if the real and complex parts of the arguments are separate. */ |
9124 | { | |
09639a83 | 9125 | int mode; |
7e7e470f RH |
9126 | |
9127 | for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode) | |
9128 | { | |
9129 | char mode_name_buf[4], *q; | |
9130 | const char *p; | |
9131 | enum built_in_function mcode, dcode; | |
9132 | tree type, inner_type; | |
9133 | ||
09639a83 | 9134 | type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0); |
7e7e470f RH |
9135 | if (type == NULL) |
9136 | continue; | |
9137 | inner_type = TREE_TYPE (type); | |
9138 | ||
9139 | tmp = tree_cons (NULL_TREE, inner_type, void_list_node); | |
9140 | tmp = tree_cons (NULL_TREE, inner_type, tmp); | |
9141 | tmp = tree_cons (NULL_TREE, inner_type, tmp); | |
9142 | tmp = tree_cons (NULL_TREE, inner_type, tmp); | |
9143 | ftype = build_function_type (type, tmp); | |
9144 | ||
32e8bb8e ILT |
9145 | mcode = ((enum built_in_function) |
9146 | (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT)); | |
9147 | dcode = ((enum built_in_function) | |
9148 | (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT)); | |
7e7e470f RH |
9149 | |
9150 | for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++) | |
9151 | *q = TOLOWER (*p); | |
9152 | *q = '\0'; | |
9153 | ||
9154 | built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL); | |
9155 | local_define_builtin (built_in_names[mcode], ftype, mcode, | |
9156 | built_in_names[mcode], ECF_CONST | ECF_NOTHROW); | |
9157 | ||
9158 | built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL); | |
9159 | local_define_builtin (built_in_names[dcode], ftype, dcode, | |
9160 | built_in_names[dcode], ECF_CONST | ECF_NOTHROW); | |
9161 | } | |
9162 | } | |
c6a912da RH |
9163 | } |
9164 | ||
b34417a4 ZL |
9165 | /* HACK. GROSS. This is absolutely disgusting. I wish there was a |
9166 | better way. | |
9167 | ||
9168 | If we requested a pointer to a vector, build up the pointers that | |
9169 | we stripped off while looking for the inner type. Similarly for | |
9170 | return values from functions. | |
9171 | ||
9172 | The argument TYPE is the top of the chain, and BOTTOM is the | |
9173 | new type which we will point to. */ | |
9174 | ||
9175 | tree | |
9176 | reconstruct_complex_type (tree type, tree bottom) | |
9177 | { | |
9178 | tree inner, outer; | |
b8698a0f | 9179 | |
ab44f281 AP |
9180 | if (TREE_CODE (type) == POINTER_TYPE) |
9181 | { | |
9182 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); | |
9183 | outer = build_pointer_type_for_mode (inner, TYPE_MODE (type), | |
9184 | TYPE_REF_CAN_ALIAS_ALL (type)); | |
9185 | } | |
9186 | else if (TREE_CODE (type) == REFERENCE_TYPE) | |
b34417a4 ZL |
9187 | { |
9188 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); | |
ab44f281 AP |
9189 | outer = build_reference_type_for_mode (inner, TYPE_MODE (type), |
9190 | TYPE_REF_CAN_ALIAS_ALL (type)); | |
b34417a4 ZL |
9191 | } |
9192 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
9193 | { | |
9194 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); | |
9195 | outer = build_array_type (inner, TYPE_DOMAIN (type)); | |
9196 | } | |
9197 | else if (TREE_CODE (type) == FUNCTION_TYPE) | |
9198 | { | |
9199 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); | |
9200 | outer = build_function_type (inner, TYPE_ARG_TYPES (type)); | |
9201 | } | |
9202 | else if (TREE_CODE (type) == METHOD_TYPE) | |
9203 | { | |
9204 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); | |
037cc9c5 FJ |
9205 | /* The build_method_type_directly() routine prepends 'this' to argument list, |
9206 | so we must compensate by getting rid of it. */ | |
b8698a0f L |
9207 | outer |
9208 | = build_method_type_directly | |
8de08f4c DG |
9209 | (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))), |
9210 | inner, | |
9211 | TREE_CHAIN (TYPE_ARG_TYPES (type))); | |
b34417a4 | 9212 | } |
270e749d JJ |
9213 | else if (TREE_CODE (type) == OFFSET_TYPE) |
9214 | { | |
9215 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); | |
9216 | outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner); | |
9217 | } | |
b34417a4 ZL |
9218 | else |
9219 | return bottom; | |
9220 | ||
b5fcfe89 JM |
9221 | return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type), |
9222 | TYPE_QUALS (type)); | |
b34417a4 ZL |
9223 | } |
9224 | ||
26277d41 PB |
9225 | /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and |
9226 | the inner type. */ | |
b34417a4 | 9227 | tree |
4a5eab38 | 9228 | build_vector_type_for_mode (tree innertype, enum machine_mode mode) |
0afeef64 | 9229 | { |
26277d41 | 9230 | int nunits; |
27b41650 | 9231 | |
1e128c5f | 9232 | switch (GET_MODE_CLASS (mode)) |
26277d41 | 9233 | { |
1e128c5f GB |
9234 | case MODE_VECTOR_INT: |
9235 | case MODE_VECTOR_FLOAT: | |
325217ed CF |
9236 | case MODE_VECTOR_FRACT: |
9237 | case MODE_VECTOR_UFRACT: | |
9238 | case MODE_VECTOR_ACCUM: | |
9239 | case MODE_VECTOR_UACCUM: | |
1e128c5f GB |
9240 | nunits = GET_MODE_NUNITS (mode); |
9241 | break; | |
9242 | ||
9243 | case MODE_INT: | |
26277d41 | 9244 | /* Check that there are no leftover bits. */ |
1e128c5f GB |
9245 | gcc_assert (GET_MODE_BITSIZE (mode) |
9246 | % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0); | |
4a5eab38 | 9247 | |
26277d41 PB |
9248 | nunits = GET_MODE_BITSIZE (mode) |
9249 | / TREE_INT_CST_LOW (TYPE_SIZE (innertype)); | |
1e128c5f GB |
9250 | break; |
9251 | ||
9252 | default: | |
9253 | gcc_unreachable (); | |
26277d41 | 9254 | } |
4a5eab38 | 9255 | |
26277d41 PB |
9256 | return make_vector_type (innertype, nunits, mode); |
9257 | } | |
4a5eab38 | 9258 | |
26277d41 PB |
9259 | /* Similarly, but takes the inner type and number of units, which must be |
9260 | a power of two. */ | |
9261 | ||
9262 | tree | |
9263 | build_vector_type (tree innertype, int nunits) | |
9264 | { | |
9265 | return make_vector_type (innertype, nunits, VOIDmode); | |
4a5eab38 PB |
9266 | } |
9267 | ||
b6fc2cdb PB |
9268 | /* Similarly, but takes the inner type and number of units, which must be |
9269 | a power of two. */ | |
9270 | ||
9271 | tree | |
9272 | build_opaque_vector_type (tree innertype, int nunits) | |
9273 | { | |
9274 | tree t; | |
9275 | innertype = build_distinct_type_copy (innertype); | |
9276 | t = make_vector_type (innertype, nunits, VOIDmode); | |
9277 | TYPE_VECTOR_OPAQUE (t) = true; | |
9278 | return t; | |
9279 | } | |
9280 | ||
ca58211b | 9281 | |
27b41650 KG |
9282 | /* Given an initializer INIT, return TRUE if INIT is zero or some |
9283 | aggregate of zeros. Otherwise return FALSE. */ | |
27b41650 | 9284 | bool |
9566a759 | 9285 | initializer_zerop (const_tree init) |
27b41650 | 9286 | { |
6de9cd9a DN |
9287 | tree elt; |
9288 | ||
27b41650 KG |
9289 | STRIP_NOPS (init); |
9290 | ||
9291 | switch (TREE_CODE (init)) | |
9292 | { | |
9293 | case INTEGER_CST: | |
9294 | return integer_zerop (init); | |
6de9cd9a | 9295 | |
27b41650 | 9296 | case REAL_CST: |
6de9cd9a DN |
9297 | /* ??? Note that this is not correct for C4X float formats. There, |
9298 | a bit pattern of all zeros is 1.0; 0.0 is encoded with the most | |
9299 | negative exponent. */ | |
27b41650 KG |
9300 | return real_zerop (init) |
9301 | && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init)); | |
6de9cd9a | 9302 | |
325217ed CF |
9303 | case FIXED_CST: |
9304 | return fixed_zerop (init); | |
9305 | ||
27b41650 KG |
9306 | case COMPLEX_CST: |
9307 | return integer_zerop (init) | |
9308 | || (real_zerop (init) | |
9309 | && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init))) | |
9310 | && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init)))); | |
6de9cd9a DN |
9311 | |
9312 | case VECTOR_CST: | |
9313 | for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt)) | |
9314 | if (!initializer_zerop (TREE_VALUE (elt))) | |
e8423af9 | 9315 | return false; |
6de9cd9a | 9316 | return true; |
e8423af9 | 9317 | |
6de9cd9a | 9318 | case CONSTRUCTOR: |
4038c495 GB |
9319 | { |
9320 | unsigned HOST_WIDE_INT idx; | |
6de9cd9a | 9321 | |
4038c495 GB |
9322 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt) |
9323 | if (!initializer_zerop (elt)) | |
9324 | return false; | |
9325 | return true; | |
9326 | } | |
6de9cd9a | 9327 | |
27b41650 KG |
9328 | default: |
9329 | return false; | |
9330 | } | |
9331 | } | |
e2500fed | 9332 | |
c2255bc4 | 9333 | /* Build an empty statement at location LOC. */ |
6de9cd9a DN |
9334 | |
9335 | tree | |
c2255bc4 | 9336 | build_empty_stmt (location_t loc) |
6de9cd9a | 9337 | { |
c2255bc4 AH |
9338 | tree t = build1 (NOP_EXPR, void_type_node, size_zero_node); |
9339 | SET_EXPR_LOCATION (t, loc); | |
9340 | return t; | |
6de9cd9a DN |
9341 | } |
9342 | ||
6de9cd9a | 9343 | |
c2255bc4 AH |
9344 | /* Build an OpenMP clause with code CODE. LOC is the location of the |
9345 | clause. */ | |
aaf46ef9 DN |
9346 | |
9347 | tree | |
c2255bc4 | 9348 | build_omp_clause (location_t loc, enum omp_clause_code code) |
aaf46ef9 DN |
9349 | { |
9350 | tree t; | |
9351 | int size, length; | |
9352 | ||
9353 | length = omp_clause_num_ops[code]; | |
9354 | size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree)); | |
9355 | ||
3d9a9f94 | 9356 | t = GGC_NEWVAR (union tree_node, size); |
aaf46ef9 DN |
9357 | memset (t, 0, size); |
9358 | TREE_SET_CODE (t, OMP_CLAUSE); | |
9359 | OMP_CLAUSE_SET_CODE (t, code); | |
c2255bc4 | 9360 | OMP_CLAUSE_LOCATION (t) = loc; |
aaf46ef9 DN |
9361 | |
9362 | #ifdef GATHER_STATISTICS | |
9363 | tree_node_counts[(int) omp_clause_kind]++; | |
9364 | tree_node_sizes[(int) omp_clause_kind] += size; | |
9365 | #endif | |
b8698a0f | 9366 | |
aaf46ef9 DN |
9367 | return t; |
9368 | } | |
9369 | ||
5039610b SL |
9370 | /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN |
9371 | includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1. | |
9372 | Except for the CODE and operand count field, other storage for the | |
9373 | object is initialized to zeros. */ | |
9374 | ||
9375 | tree | |
9376 | build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL) | |
9377 | { | |
9378 | tree t; | |
9379 | int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp); | |
9380 | ||
9381 | gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp); | |
9382 | gcc_assert (len >= 1); | |
9383 | ||
9384 | #ifdef GATHER_STATISTICS | |
9385 | tree_node_counts[(int) e_kind]++; | |
9386 | tree_node_sizes[(int) e_kind] += length; | |
9387 | #endif | |
9388 | ||
3d9a9f94 | 9389 | t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone); |
5039610b SL |
9390 | |
9391 | memset (t, 0, length); | |
9392 | ||
9393 | TREE_SET_CODE (t, code); | |
9394 | ||
9395 | /* Can't use TREE_OPERAND to store the length because if checking is | |
9396 | enabled, it will try to check the length before we store it. :-P */ | |
9397 | t->exp.operands[0] = build_int_cst (sizetype, len); | |
9398 | ||
9399 | return t; | |
9400 | } | |
9401 | ||
9402 | ||
9403 | /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE | |
9404 | and FN and a null static chain slot. ARGLIST is a TREE_LIST of the | |
9405 | arguments. */ | |
9406 | ||
9407 | tree | |
9408 | build_call_list (tree return_type, tree fn, tree arglist) | |
9409 | { | |
9410 | tree t; | |
9411 | int i; | |
9412 | ||
9413 | t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3); | |
9414 | TREE_TYPE (t) = return_type; | |
9415 | CALL_EXPR_FN (t) = fn; | |
9416 | CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE; | |
9417 | for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++) | |
9418 | CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist); | |
9419 | process_call_operands (t); | |
9420 | return t; | |
9421 | } | |
9422 | ||
9423 | /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and | |
9424 | FN and a null static chain slot. NARGS is the number of call arguments | |
9425 | which are specified as "..." arguments. */ | |
9426 | ||
9427 | tree | |
9428 | build_call_nary (tree return_type, tree fn, int nargs, ...) | |
9429 | { | |
9430 | tree ret; | |
9431 | va_list args; | |
9432 | va_start (args, nargs); | |
9433 | ret = build_call_valist (return_type, fn, nargs, args); | |
9434 | va_end (args); | |
9435 | return ret; | |
9436 | } | |
9437 | ||
9438 | /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and | |
9439 | FN and a null static chain slot. NARGS is the number of call arguments | |
9440 | which are specified as a va_list ARGS. */ | |
9441 | ||
9442 | tree | |
9443 | build_call_valist (tree return_type, tree fn, int nargs, va_list args) | |
9444 | { | |
9445 | tree t; | |
9446 | int i; | |
9447 | ||
9448 | t = build_vl_exp (CALL_EXPR, nargs + 3); | |
9449 | TREE_TYPE (t) = return_type; | |
9450 | CALL_EXPR_FN (t) = fn; | |
9451 | CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE; | |
9452 | for (i = 0; i < nargs; i++) | |
9453 | CALL_EXPR_ARG (t, i) = va_arg (args, tree); | |
9454 | process_call_operands (t); | |
9455 | return t; | |
9456 | } | |
9457 | ||
9458 | /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and | |
9459 | FN and a null static chain slot. NARGS is the number of call arguments | |
9460 | which are specified as a tree array ARGS. */ | |
9461 | ||
9462 | tree | |
db3927fb AH |
9463 | build_call_array_loc (location_t loc, tree return_type, tree fn, |
9464 | int nargs, const tree *args) | |
5039610b SL |
9465 | { |
9466 | tree t; | |
9467 | int i; | |
9468 | ||
9469 | t = build_vl_exp (CALL_EXPR, nargs + 3); | |
9470 | TREE_TYPE (t) = return_type; | |
9471 | CALL_EXPR_FN (t) = fn; | |
9472 | CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE; | |
9473 | for (i = 0; i < nargs; i++) | |
9474 | CALL_EXPR_ARG (t, i) = args[i]; | |
9475 | process_call_operands (t); | |
db3927fb | 9476 | SET_EXPR_LOCATION (t, loc); |
5039610b SL |
9477 | return t; |
9478 | } | |
9479 | ||
c166b898 ILT |
9480 | /* Like build_call_array, but takes a VEC. */ |
9481 | ||
9482 | tree | |
9483 | build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args) | |
9484 | { | |
9485 | tree ret, t; | |
9486 | unsigned int ix; | |
9487 | ||
9488 | ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3); | |
9489 | TREE_TYPE (ret) = return_type; | |
9490 | CALL_EXPR_FN (ret) = fn; | |
9491 | CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE; | |
9492 | for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix) | |
9493 | CALL_EXPR_ARG (ret, ix) = t; | |
9494 | process_call_operands (ret); | |
9495 | return ret; | |
9496 | } | |
9497 | ||
aaf46ef9 | 9498 | |
a7e5372d ZD |
9499 | /* Returns true if it is possible to prove that the index of |
9500 | an array access REF (an ARRAY_REF expression) falls into the | |
9501 | array bounds. */ | |
9502 | ||
9503 | bool | |
9504 | in_array_bounds_p (tree ref) | |
9505 | { | |
9506 | tree idx = TREE_OPERAND (ref, 1); | |
9507 | tree min, max; | |
9508 | ||
9509 | if (TREE_CODE (idx) != INTEGER_CST) | |
9510 | return false; | |
9f63daea | 9511 | |
a7e5372d ZD |
9512 | min = array_ref_low_bound (ref); |
9513 | max = array_ref_up_bound (ref); | |
9514 | if (!min | |
9515 | || !max | |
9516 | || TREE_CODE (min) != INTEGER_CST | |
9517 | || TREE_CODE (max) != INTEGER_CST) | |
9518 | return false; | |
9519 | ||
9520 | if (tree_int_cst_lt (idx, min) | |
9521 | || tree_int_cst_lt (max, idx)) | |
9522 | return false; | |
9523 | ||
9524 | return true; | |
9525 | } | |
9526 | ||
11fc4275 EB |
9527 | /* Returns true if it is possible to prove that the range of |
9528 | an array access REF (an ARRAY_RANGE_REF expression) falls | |
9529 | into the array bounds. */ | |
9530 | ||
9531 | bool | |
9532 | range_in_array_bounds_p (tree ref) | |
9533 | { | |
9534 | tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref)); | |
9535 | tree range_min, range_max, min, max; | |
9536 | ||
9537 | range_min = TYPE_MIN_VALUE (domain_type); | |
9538 | range_max = TYPE_MAX_VALUE (domain_type); | |
9539 | if (!range_min | |
9540 | || !range_max | |
9541 | || TREE_CODE (range_min) != INTEGER_CST | |
9542 | || TREE_CODE (range_max) != INTEGER_CST) | |
9543 | return false; | |
9544 | ||
9545 | min = array_ref_low_bound (ref); | |
9546 | max = array_ref_up_bound (ref); | |
9547 | if (!min | |
9548 | || !max | |
9549 | || TREE_CODE (min) != INTEGER_CST | |
9550 | || TREE_CODE (max) != INTEGER_CST) | |
9551 | return false; | |
9552 | ||
9553 | if (tree_int_cst_lt (range_min, min) | |
9554 | || tree_int_cst_lt (max, range_max)) | |
9555 | return false; | |
9556 | ||
9557 | return true; | |
9558 | } | |
9559 | ||
6de9cd9a DN |
9560 | /* Return true if T (assumed to be a DECL) must be assigned a memory |
9561 | location. */ | |
9562 | ||
9563 | bool | |
586de218 | 9564 | needs_to_live_in_memory (const_tree t) |
6de9cd9a | 9565 | { |
cfaab3a9 DN |
9566 | if (TREE_CODE (t) == SSA_NAME) |
9567 | t = SSA_NAME_VAR (t); | |
9568 | ||
c597ef4e DN |
9569 | return (TREE_ADDRESSABLE (t) |
9570 | || is_global_var (t) | |
6de9cd9a | 9571 | || (TREE_CODE (t) == RESULT_DECL |
ab8907ef | 9572 | && aggregate_value_p (t, current_function_decl))); |
6de9cd9a DN |
9573 | } |
9574 | ||
fa27426e RH |
9575 | /* There are situations in which a language considers record types |
9576 | compatible which have different field lists. Decide if two fields | |
9577 | are compatible. It is assumed that the parent records are compatible. */ | |
9578 | ||
9579 | bool | |
6ea2b70d | 9580 | fields_compatible_p (const_tree f1, const_tree f2) |
fa27426e RH |
9581 | { |
9582 | if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1), | |
9583 | DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST)) | |
9584 | return false; | |
9585 | ||
9586 | if (!operand_equal_p (DECL_FIELD_OFFSET (f1), | |
9587 | DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST)) | |
9588 | return false; | |
9589 | ||
f4088621 | 9590 | if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2))) |
9f63daea | 9591 | return false; |
fa27426e RH |
9592 | |
9593 | return true; | |
9594 | } | |
9595 | ||
9596 | /* Locate within RECORD a field that is compatible with ORIG_FIELD. */ | |
9597 | ||
9598 | tree | |
9599 | find_compatible_field (tree record, tree orig_field) | |
9600 | { | |
9601 | tree f; | |
9602 | ||
9603 | for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f)) | |
9604 | if (TREE_CODE (f) == FIELD_DECL | |
9605 | && fields_compatible_p (f, orig_field)) | |
9606 | return f; | |
9607 | ||
9608 | /* ??? Why isn't this on the main fields list? */ | |
9609 | f = TYPE_VFIELD (record); | |
9610 | if (f && TREE_CODE (f) == FIELD_DECL | |
9611 | && fields_compatible_p (f, orig_field)) | |
9612 | return f; | |
9613 | ||
9614 | /* ??? We should abort here, but Java appears to do Bad Things | |
9615 | with inherited fields. */ | |
9616 | return orig_field; | |
9617 | } | |
9618 | ||
a1a5996d | 9619 | /* Return value of a constant X and sign-extend it. */ |
56cf8686 SP |
9620 | |
9621 | HOST_WIDE_INT | |
9566a759 | 9622 | int_cst_value (const_tree x) |
56cf8686 SP |
9623 | { |
9624 | unsigned bits = TYPE_PRECISION (TREE_TYPE (x)); | |
9625 | unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x); | |
56cf8686 | 9626 | |
a1a5996d RG |
9627 | /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */ |
9628 | gcc_assert (TREE_INT_CST_HIGH (x) == 0 | |
9629 | || TREE_INT_CST_HIGH (x) == -1); | |
56cf8686 | 9630 | |
a1a5996d RG |
9631 | if (bits < HOST_BITS_PER_WIDE_INT) |
9632 | { | |
9633 | bool negative = ((val >> (bits - 1)) & 1) != 0; | |
9634 | if (negative) | |
9635 | val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1; | |
9636 | else | |
9637 | val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1); | |
9638 | } | |
56cf8686 SP |
9639 | |
9640 | return val; | |
9641 | } | |
9642 | ||
03bd2f1a AK |
9643 | /* Return value of a constant X and sign-extend it. */ |
9644 | ||
9645 | HOST_WIDEST_INT | |
9646 | widest_int_cst_value (const_tree x) | |
9647 | { | |
9648 | unsigned bits = TYPE_PRECISION (TREE_TYPE (x)); | |
9649 | unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x); | |
9650 | ||
9651 | #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT | |
9652 | gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT); | |
0eb92735 RG |
9653 | val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x)) |
9654 | << HOST_BITS_PER_WIDE_INT); | |
03bd2f1a AK |
9655 | #else |
9656 | /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */ | |
9657 | gcc_assert (TREE_INT_CST_HIGH (x) == 0 | |
9658 | || TREE_INT_CST_HIGH (x) == -1); | |
9659 | #endif | |
9660 | ||
9661 | if (bits < HOST_BITS_PER_WIDEST_INT) | |
9662 | { | |
9663 | bool negative = ((val >> (bits - 1)) & 1) != 0; | |
9664 | if (negative) | |
9665 | val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1; | |
9666 | else | |
9667 | val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1); | |
9668 | } | |
9669 | ||
9670 | return val; | |
9671 | } | |
9672 | ||
12753674 RE |
9673 | /* If TYPE is an integral type, return an equivalent type which is |
9674 | unsigned iff UNSIGNEDP is true. If TYPE is not an integral type, | |
9675 | return TYPE itself. */ | |
fa27426e | 9676 | |
12753674 RE |
9677 | tree |
9678 | signed_or_unsigned_type_for (int unsignedp, tree type) | |
ca5ba2a3 | 9679 | { |
12753674 RE |
9680 | tree t = type; |
9681 | if (POINTER_TYPE_P (type)) | |
d4ebfa65 BE |
9682 | { |
9683 | /* If the pointer points to the normal address space, use the | |
9684 | size_type_node. Otherwise use an appropriate size for the pointer | |
9685 | based on the named address space it points to. */ | |
9686 | if (!TYPE_ADDR_SPACE (TREE_TYPE (t))) | |
9687 | t = size_type_node; | |
9688 | ||
9689 | else | |
9690 | { | |
9691 | int prec = int_or_pointer_precision (t); | |
9692 | return lang_hooks.types.type_for_size (prec, unsignedp); | |
9693 | } | |
9694 | } | |
12753674 RE |
9695 | |
9696 | if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp) | |
9697 | return t; | |
b8698a0f | 9698 | |
12753674 | 9699 | return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp); |
ca5ba2a3 RAE |
9700 | } |
9701 | ||
2f4675b4 ZD |
9702 | /* Returns unsigned variant of TYPE. */ |
9703 | ||
9704 | tree | |
9705 | unsigned_type_for (tree type) | |
9706 | { | |
12753674 | 9707 | return signed_or_unsigned_type_for (1, type); |
2f4675b4 ZD |
9708 | } |
9709 | ||
9710 | /* Returns signed variant of TYPE. */ | |
9711 | ||
9712 | tree | |
9713 | signed_type_for (tree type) | |
9714 | { | |
12753674 | 9715 | return signed_or_unsigned_type_for (0, type); |
2f4675b4 ZD |
9716 | } |
9717 | ||
18522563 ZD |
9718 | /* Returns the largest value obtainable by casting something in INNER type to |
9719 | OUTER type. */ | |
9720 | ||
9721 | tree | |
9722 | upper_bound_in_type (tree outer, tree inner) | |
9723 | { | |
9724 | unsigned HOST_WIDE_INT lo, hi; | |
ea9a5df4 KH |
9725 | unsigned int det = 0; |
9726 | unsigned oprec = TYPE_PRECISION (outer); | |
9727 | unsigned iprec = TYPE_PRECISION (inner); | |
9728 | unsigned prec; | |
9729 | ||
9730 | /* Compute a unique number for every combination. */ | |
9731 | det |= (oprec > iprec) ? 4 : 0; | |
9732 | det |= TYPE_UNSIGNED (outer) ? 2 : 0; | |
9733 | det |= TYPE_UNSIGNED (inner) ? 1 : 0; | |
9734 | ||
9735 | /* Determine the exponent to use. */ | |
9736 | switch (det) | |
9737 | { | |
9738 | case 0: | |
9739 | case 1: | |
9740 | /* oprec <= iprec, outer: signed, inner: don't care. */ | |
9741 | prec = oprec - 1; | |
9742 | break; | |
9743 | case 2: | |
9744 | case 3: | |
9745 | /* oprec <= iprec, outer: unsigned, inner: don't care. */ | |
9746 | prec = oprec; | |
9747 | break; | |
9748 | case 4: | |
9749 | /* oprec > iprec, outer: signed, inner: signed. */ | |
9750 | prec = iprec - 1; | |
9751 | break; | |
9752 | case 5: | |
9753 | /* oprec > iprec, outer: signed, inner: unsigned. */ | |
9754 | prec = iprec; | |
9755 | break; | |
9756 | case 6: | |
9757 | /* oprec > iprec, outer: unsigned, inner: signed. */ | |
9758 | prec = oprec; | |
9759 | break; | |
9760 | case 7: | |
9761 | /* oprec > iprec, outer: unsigned, inner: unsigned. */ | |
9762 | prec = iprec; | |
9763 | break; | |
9764 | default: | |
9765 | gcc_unreachable (); | |
9766 | } | |
18522563 | 9767 | |
ea9a5df4 KH |
9768 | /* Compute 2^^prec - 1. */ |
9769 | if (prec <= HOST_BITS_PER_WIDE_INT) | |
18522563 | 9770 | { |
ea9a5df4 KH |
9771 | hi = 0; |
9772 | lo = ((~(unsigned HOST_WIDE_INT) 0) | |
9773 | >> (HOST_BITS_PER_WIDE_INT - prec)); | |
18522563 ZD |
9774 | } |
9775 | else | |
9776 | { | |
ea9a5df4 KH |
9777 | hi = ((~(unsigned HOST_WIDE_INT) 0) |
9778 | >> (2 * HOST_BITS_PER_WIDE_INT - prec)); | |
9779 | lo = ~(unsigned HOST_WIDE_INT) 0; | |
18522563 ZD |
9780 | } |
9781 | ||
ea9a5df4 | 9782 | return build_int_cst_wide (outer, lo, hi); |
18522563 ZD |
9783 | } |
9784 | ||
9785 | /* Returns the smallest value obtainable by casting something in INNER type to | |
9786 | OUTER type. */ | |
9787 | ||
9788 | tree | |
9789 | lower_bound_in_type (tree outer, tree inner) | |
9790 | { | |
9791 | unsigned HOST_WIDE_INT lo, hi; | |
ea9a5df4 KH |
9792 | unsigned oprec = TYPE_PRECISION (outer); |
9793 | unsigned iprec = TYPE_PRECISION (inner); | |
9794 | ||
9795 | /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type | |
9796 | and obtain 0. */ | |
9797 | if (TYPE_UNSIGNED (outer) | |
9798 | /* If we are widening something of an unsigned type, OUTER type | |
9799 | contains all values of INNER type. In particular, both INNER | |
9800 | and OUTER types have zero in common. */ | |
9801 | || (oprec > iprec && TYPE_UNSIGNED (inner))) | |
18522563 | 9802 | lo = hi = 0; |
18522563 ZD |
9803 | else |
9804 | { | |
ea9a5df4 KH |
9805 | /* If we are widening a signed type to another signed type, we |
9806 | want to obtain -2^^(iprec-1). If we are keeping the | |
9807 | precision or narrowing to a signed type, we want to obtain | |
9808 | -2^(oprec-1). */ | |
9809 | unsigned prec = oprec > iprec ? iprec : oprec; | |
9810 | ||
9811 | if (prec <= HOST_BITS_PER_WIDE_INT) | |
9812 | { | |
9813 | hi = ~(unsigned HOST_WIDE_INT) 0; | |
9814 | lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1); | |
9815 | } | |
9816 | else | |
9817 | { | |
9818 | hi = ((~(unsigned HOST_WIDE_INT) 0) | |
9819 | << (prec - HOST_BITS_PER_WIDE_INT - 1)); | |
9820 | lo = 0; | |
9821 | } | |
18522563 ZD |
9822 | } |
9823 | ||
ea9a5df4 | 9824 | return build_int_cst_wide (outer, lo, hi); |
18522563 ZD |
9825 | } |
9826 | ||
cdef8bc6 KH |
9827 | /* Return nonzero if two operands that are suitable for PHI nodes are |
9828 | necessarily equal. Specifically, both ARG0 and ARG1 must be either | |
9829 | SSA_NAME or invariant. Note that this is strictly an optimization. | |
9830 | That is, callers of this function can directly call operand_equal_p | |
9831 | and get the same result, only slower. */ | |
9832 | ||
9833 | int | |
fa233e34 | 9834 | operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1) |
cdef8bc6 KH |
9835 | { |
9836 | if (arg0 == arg1) | |
9837 | return 1; | |
9838 | if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME) | |
9839 | return 0; | |
9840 | return operand_equal_p (arg0, arg1, 0); | |
9841 | } | |
9842 | ||
ca4c3169 | 9843 | /* Returns number of zeros at the end of binary representation of X. |
b8698a0f | 9844 | |
ca4c3169 ZD |
9845 | ??? Use ffs if available? */ |
9846 | ||
9847 | tree | |
9566a759 | 9848 | num_ending_zeros (const_tree x) |
ca4c3169 ZD |
9849 | { |
9850 | unsigned HOST_WIDE_INT fr, nfr; | |
9851 | unsigned num, abits; | |
9852 | tree type = TREE_TYPE (x); | |
9853 | ||
9854 | if (TREE_INT_CST_LOW (x) == 0) | |
9855 | { | |
9856 | num = HOST_BITS_PER_WIDE_INT; | |
9857 | fr = TREE_INT_CST_HIGH (x); | |
9858 | } | |
9859 | else | |
9860 | { | |
9861 | num = 0; | |
9862 | fr = TREE_INT_CST_LOW (x); | |
9863 | } | |
9864 | ||
9865 | for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2) | |
9866 | { | |
9867 | nfr = fr >> abits; | |
9868 | if (nfr << abits == fr) | |
9869 | { | |
9870 | num += abits; | |
9871 | fr = nfr; | |
9872 | } | |
9873 | } | |
9874 | ||
9875 | if (num > TYPE_PRECISION (type)) | |
9876 | num = TYPE_PRECISION (type); | |
9877 | ||
9878 | return build_int_cst_type (type, num); | |
9879 | } | |
9880 | ||
b8c4a565 SB |
9881 | |
9882 | #define WALK_SUBTREE(NODE) \ | |
9883 | do \ | |
9884 | { \ | |
14588106 | 9885 | result = walk_tree_1 (&(NODE), func, data, pset, lh); \ |
b8c4a565 SB |
9886 | if (result) \ |
9887 | return result; \ | |
9888 | } \ | |
9889 | while (0) | |
9890 | ||
9891 | /* This is a subroutine of walk_tree that walks field of TYPE that are to | |
9892 | be walked whenever a type is seen in the tree. Rest of operands and return | |
9893 | value are as for walk_tree. */ | |
9894 | ||
9895 | static tree | |
9896 | walk_type_fields (tree type, walk_tree_fn func, void *data, | |
14588106 | 9897 | struct pointer_set_t *pset, walk_tree_lh lh) |
b8c4a565 SB |
9898 | { |
9899 | tree result = NULL_TREE; | |
9900 | ||
9901 | switch (TREE_CODE (type)) | |
9902 | { | |
9903 | case POINTER_TYPE: | |
9904 | case REFERENCE_TYPE: | |
9905 | /* We have to worry about mutually recursive pointers. These can't | |
9906 | be written in C. They can in Ada. It's pathological, but | |
9907 | there's an ACATS test (c38102a) that checks it. Deal with this | |
9908 | by checking if we're pointing to another pointer, that one | |
9909 | points to another pointer, that one does too, and we have no htab. | |
9910 | If so, get a hash table. We check three levels deep to avoid | |
9911 | the cost of the hash table if we don't need one. */ | |
9912 | if (POINTER_TYPE_P (TREE_TYPE (type)) | |
9913 | && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type))) | |
9914 | && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type)))) | |
9915 | && !pset) | |
9916 | { | |
9917 | result = walk_tree_without_duplicates (&TREE_TYPE (type), | |
9918 | func, data); | |
9919 | if (result) | |
9920 | return result; | |
9921 | ||
9922 | break; | |
9923 | } | |
9924 | ||
9925 | /* ... fall through ... */ | |
9926 | ||
9927 | case COMPLEX_TYPE: | |
9928 | WALK_SUBTREE (TREE_TYPE (type)); | |
9929 | break; | |
9930 | ||
9931 | case METHOD_TYPE: | |
9932 | WALK_SUBTREE (TYPE_METHOD_BASETYPE (type)); | |
9933 | ||
9934 | /* Fall through. */ | |
9935 | ||
9936 | case FUNCTION_TYPE: | |
9937 | WALK_SUBTREE (TREE_TYPE (type)); | |
9938 | { | |
9939 | tree arg; | |
9940 | ||
9941 | /* We never want to walk into default arguments. */ | |
9942 | for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg)) | |
9943 | WALK_SUBTREE (TREE_VALUE (arg)); | |
9944 | } | |
9945 | break; | |
9946 | ||
9947 | case ARRAY_TYPE: | |
222725d0 MM |
9948 | /* Don't follow this nodes's type if a pointer for fear that |
9949 | we'll have infinite recursion. If we have a PSET, then we | |
9950 | need not fear. */ | |
9951 | if (pset | |
9952 | || (!POINTER_TYPE_P (TREE_TYPE (type)) | |
9953 | && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE)) | |
b8c4a565 SB |
9954 | WALK_SUBTREE (TREE_TYPE (type)); |
9955 | WALK_SUBTREE (TYPE_DOMAIN (type)); | |
9956 | break; | |
9957 | ||
b8c4a565 SB |
9958 | case OFFSET_TYPE: |
9959 | WALK_SUBTREE (TREE_TYPE (type)); | |
9960 | WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type)); | |
9961 | break; | |
9962 | ||
9963 | default: | |
9964 | break; | |
9965 | } | |
9966 | ||
9967 | return NULL_TREE; | |
9968 | } | |
9969 | ||
9970 | /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is | |
9971 | called with the DATA and the address of each sub-tree. If FUNC returns a | |
0e61db61 | 9972 | non-NULL value, the traversal is stopped, and the value returned by FUNC |
b8c4a565 SB |
9973 | is returned. If PSET is non-NULL it is used to record the nodes visited, |
9974 | and to avoid visiting a node more than once. */ | |
9975 | ||
9976 | tree | |
14588106 RG |
9977 | walk_tree_1 (tree *tp, walk_tree_fn func, void *data, |
9978 | struct pointer_set_t *pset, walk_tree_lh lh) | |
b8c4a565 SB |
9979 | { |
9980 | enum tree_code code; | |
9981 | int walk_subtrees; | |
9982 | tree result; | |
9983 | ||
9984 | #define WALK_SUBTREE_TAIL(NODE) \ | |
9985 | do \ | |
9986 | { \ | |
9987 | tp = & (NODE); \ | |
9988 | goto tail_recurse; \ | |
9989 | } \ | |
9990 | while (0) | |
9991 | ||
9992 | tail_recurse: | |
9993 | /* Skip empty subtrees. */ | |
9994 | if (!*tp) | |
9995 | return NULL_TREE; | |
9996 | ||
9997 | /* Don't walk the same tree twice, if the user has requested | |
9998 | that we avoid doing so. */ | |
9999 | if (pset && pointer_set_insert (pset, *tp)) | |
10000 | return NULL_TREE; | |
10001 | ||
10002 | /* Call the function. */ | |
10003 | walk_subtrees = 1; | |
10004 | result = (*func) (tp, &walk_subtrees, data); | |
10005 | ||
10006 | /* If we found something, return it. */ | |
10007 | if (result) | |
10008 | return result; | |
10009 | ||
10010 | code = TREE_CODE (*tp); | |
10011 | ||
10012 | /* Even if we didn't, FUNC may have decided that there was nothing | |
10013 | interesting below this point in the tree. */ | |
10014 | if (!walk_subtrees) | |
10015 | { | |
953ff289 | 10016 | /* But we still need to check our siblings. */ |
b8c4a565 | 10017 | if (code == TREE_LIST) |
b8c4a565 | 10018 | WALK_SUBTREE_TAIL (TREE_CHAIN (*tp)); |
aaf46ef9 | 10019 | else if (code == OMP_CLAUSE) |
953ff289 | 10020 | WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp)); |
b8c4a565 SB |
10021 | else |
10022 | return NULL_TREE; | |
10023 | } | |
10024 | ||
14588106 RG |
10025 | if (lh) |
10026 | { | |
10027 | result = (*lh) (tp, &walk_subtrees, func, data, pset); | |
10028 | if (result || !walk_subtrees) | |
10029 | return result; | |
10030 | } | |
b8c4a565 | 10031 | |
953ff289 | 10032 | switch (code) |
b8c4a565 | 10033 | { |
953ff289 DN |
10034 | case ERROR_MARK: |
10035 | case IDENTIFIER_NODE: | |
10036 | case INTEGER_CST: | |
10037 | case REAL_CST: | |
325217ed | 10038 | case FIXED_CST: |
953ff289 DN |
10039 | case VECTOR_CST: |
10040 | case STRING_CST: | |
10041 | case BLOCK: | |
10042 | case PLACEHOLDER_EXPR: | |
10043 | case SSA_NAME: | |
10044 | case FIELD_DECL: | |
10045 | case RESULT_DECL: | |
10046 | /* None of these have subtrees other than those already walked | |
10047 | above. */ | |
10048 | break; | |
b8c4a565 | 10049 | |
953ff289 DN |
10050 | case TREE_LIST: |
10051 | WALK_SUBTREE (TREE_VALUE (*tp)); | |
10052 | WALK_SUBTREE_TAIL (TREE_CHAIN (*tp)); | |
10053 | break; | |
b8c4a565 | 10054 | |
953ff289 DN |
10055 | case TREE_VEC: |
10056 | { | |
10057 | int len = TREE_VEC_LENGTH (*tp); | |
b8c4a565 | 10058 | |
953ff289 DN |
10059 | if (len == 0) |
10060 | break; | |
b8c4a565 | 10061 | |
953ff289 DN |
10062 | /* Walk all elements but the first. */ |
10063 | while (--len) | |
10064 | WALK_SUBTREE (TREE_VEC_ELT (*tp, len)); | |
b8c4a565 | 10065 | |
953ff289 DN |
10066 | /* Now walk the first one as a tail call. */ |
10067 | WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0)); | |
10068 | } | |
b8c4a565 | 10069 | |
953ff289 DN |
10070 | case COMPLEX_CST: |
10071 | WALK_SUBTREE (TREE_REALPART (*tp)); | |
10072 | WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp)); | |
b8c4a565 | 10073 | |
953ff289 DN |
10074 | case CONSTRUCTOR: |
10075 | { | |
10076 | unsigned HOST_WIDE_INT idx; | |
10077 | constructor_elt *ce; | |
b8c4a565 | 10078 | |
953ff289 DN |
10079 | for (idx = 0; |
10080 | VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce); | |
10081 | idx++) | |
10082 | WALK_SUBTREE (ce->value); | |
10083 | } | |
10084 | break; | |
b8c4a565 | 10085 | |
953ff289 DN |
10086 | case SAVE_EXPR: |
10087 | WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0)); | |
b8c4a565 | 10088 | |
953ff289 DN |
10089 | case BIND_EXPR: |
10090 | { | |
10091 | tree decl; | |
10092 | for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl)) | |
b8c4a565 | 10093 | { |
953ff289 DN |
10094 | /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk |
10095 | into declarations that are just mentioned, rather than | |
10096 | declared; they don't really belong to this part of the tree. | |
10097 | And, we can see cycles: the initializer for a declaration | |
10098 | can refer to the declaration itself. */ | |
10099 | WALK_SUBTREE (DECL_INITIAL (decl)); | |
10100 | WALK_SUBTREE (DECL_SIZE (decl)); | |
10101 | WALK_SUBTREE (DECL_SIZE_UNIT (decl)); | |
10102 | } | |
10103 | WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp)); | |
10104 | } | |
b8c4a565 | 10105 | |
953ff289 DN |
10106 | case STATEMENT_LIST: |
10107 | { | |
10108 | tree_stmt_iterator i; | |
10109 | for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i)) | |
10110 | WALK_SUBTREE (*tsi_stmt_ptr (i)); | |
10111 | } | |
10112 | break; | |
b8c4a565 | 10113 | |
aaf46ef9 DN |
10114 | case OMP_CLAUSE: |
10115 | switch (OMP_CLAUSE_CODE (*tp)) | |
10116 | { | |
10117 | case OMP_CLAUSE_PRIVATE: | |
10118 | case OMP_CLAUSE_SHARED: | |
10119 | case OMP_CLAUSE_FIRSTPRIVATE: | |
aaf46ef9 DN |
10120 | case OMP_CLAUSE_COPYIN: |
10121 | case OMP_CLAUSE_COPYPRIVATE: | |
10122 | case OMP_CLAUSE_IF: | |
10123 | case OMP_CLAUSE_NUM_THREADS: | |
10124 | case OMP_CLAUSE_SCHEDULE: | |
10125 | WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0)); | |
10126 | /* FALLTHRU */ | |
10127 | ||
10128 | case OMP_CLAUSE_NOWAIT: | |
10129 | case OMP_CLAUSE_ORDERED: | |
10130 | case OMP_CLAUSE_DEFAULT: | |
a68ab351 | 10131 | case OMP_CLAUSE_UNTIED: |
aaf46ef9 DN |
10132 | WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp)); |
10133 | ||
a68ab351 JJ |
10134 | case OMP_CLAUSE_LASTPRIVATE: |
10135 | WALK_SUBTREE (OMP_CLAUSE_DECL (*tp)); | |
10136 | WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp)); | |
10137 | WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp)); | |
10138 | ||
10139 | case OMP_CLAUSE_COLLAPSE: | |
10140 | { | |
10141 | int i; | |
10142 | for (i = 0; i < 3; i++) | |
10143 | WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i)); | |
10144 | WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp)); | |
10145 | } | |
10146 | ||
aaf46ef9 DN |
10147 | case OMP_CLAUSE_REDUCTION: |
10148 | { | |
10149 | int i; | |
10150 | for (i = 0; i < 4; i++) | |
10151 | WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i)); | |
10152 | WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp)); | |
10153 | } | |
10154 | ||
10155 | default: | |
10156 | gcc_unreachable (); | |
10157 | } | |
10158 | break; | |
b8c4a565 | 10159 | |
953ff289 DN |
10160 | case TARGET_EXPR: |
10161 | { | |
10162 | int i, len; | |
10163 | ||
10164 | /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same. | |
10165 | But, we only want to walk once. */ | |
10166 | len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3; | |
10167 | for (i = 0; i < len; ++i) | |
10168 | WALK_SUBTREE (TREE_OPERAND (*tp, i)); | |
10169 | WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len)); | |
10170 | } | |
b8c4a565 | 10171 | |
953ff289 | 10172 | case DECL_EXPR: |
8f6e6bf3 EB |
10173 | /* If this is a TYPE_DECL, walk into the fields of the type that it's |
10174 | defining. We only want to walk into these fields of a type in this | |
10175 | case and not in the general case of a mere reference to the type. | |
10176 | ||
10177 | The criterion is as follows: if the field can be an expression, it | |
10178 | must be walked only here. This should be in keeping with the fields | |
10179 | that are directly gimplified in gimplify_type_sizes in order for the | |
10180 | mark/copy-if-shared/unmark machinery of the gimplifier to work with | |
10181 | variable-sized types. | |
b8698a0f | 10182 | |
8f6e6bf3 EB |
10183 | Note that DECLs get walked as part of processing the BIND_EXPR. */ |
10184 | if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL) | |
953ff289 DN |
10185 | { |
10186 | tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp)); | |
8f6e6bf3 EB |
10187 | if (TREE_CODE (*type_p) == ERROR_MARK) |
10188 | return NULL_TREE; | |
4038c495 | 10189 | |
953ff289 DN |
10190 | /* Call the function for the type. See if it returns anything or |
10191 | doesn't want us to continue. If we are to continue, walk both | |
10192 | the normal fields and those for the declaration case. */ | |
10193 | result = (*func) (type_p, &walk_subtrees, data); | |
10194 | if (result || !walk_subtrees) | |
8f6e6bf3 | 10195 | return result; |
b8c4a565 | 10196 | |
14588106 | 10197 | result = walk_type_fields (*type_p, func, data, pset, lh); |
953ff289 DN |
10198 | if (result) |
10199 | return result; | |
b8c4a565 | 10200 | |
953ff289 | 10201 | /* If this is a record type, also walk the fields. */ |
d7f09764 | 10202 | if (RECORD_OR_UNION_TYPE_P (*type_p)) |
953ff289 DN |
10203 | { |
10204 | tree field; | |
b8c4a565 | 10205 | |
953ff289 DN |
10206 | for (field = TYPE_FIELDS (*type_p); field; |
10207 | field = TREE_CHAIN (field)) | |
10208 | { | |
10209 | /* We'd like to look at the type of the field, but we can | |
10210 | easily get infinite recursion. So assume it's pointed | |
10211 | to elsewhere in the tree. Also, ignore things that | |
10212 | aren't fields. */ | |
10213 | if (TREE_CODE (field) != FIELD_DECL) | |
10214 | continue; | |
10215 | ||
10216 | WALK_SUBTREE (DECL_FIELD_OFFSET (field)); | |
10217 | WALK_SUBTREE (DECL_SIZE (field)); | |
10218 | WALK_SUBTREE (DECL_SIZE_UNIT (field)); | |
10219 | if (TREE_CODE (*type_p) == QUAL_UNION_TYPE) | |
10220 | WALK_SUBTREE (DECL_QUALIFIER (field)); | |
10221 | } | |
10222 | } | |
b8c4a565 | 10223 | |
8f6e6bf3 EB |
10224 | /* Same for scalar types. */ |
10225 | else if (TREE_CODE (*type_p) == BOOLEAN_TYPE | |
10226 | || TREE_CODE (*type_p) == ENUMERAL_TYPE | |
10227 | || TREE_CODE (*type_p) == INTEGER_TYPE | |
325217ed | 10228 | || TREE_CODE (*type_p) == FIXED_POINT_TYPE |
8f6e6bf3 EB |
10229 | || TREE_CODE (*type_p) == REAL_TYPE) |
10230 | { | |
10231 | WALK_SUBTREE (TYPE_MIN_VALUE (*type_p)); | |
10232 | WALK_SUBTREE (TYPE_MAX_VALUE (*type_p)); | |
10233 | } | |
10234 | ||
953ff289 DN |
10235 | WALK_SUBTREE (TYPE_SIZE (*type_p)); |
10236 | WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p)); | |
b8c4a565 | 10237 | } |
953ff289 DN |
10238 | /* FALLTHRU */ |
10239 | ||
10240 | default: | |
726a989a | 10241 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))) |
953ff289 DN |
10242 | { |
10243 | int i, len; | |
10244 | ||
10245 | /* Walk over all the sub-trees of this operand. */ | |
5039610b | 10246 | len = TREE_OPERAND_LENGTH (*tp); |
953ff289 DN |
10247 | |
10248 | /* Go through the subtrees. We need to do this in forward order so | |
10249 | that the scope of a FOR_EXPR is handled properly. */ | |
10250 | if (len) | |
10251 | { | |
10252 | for (i = 0; i < len - 1; ++i) | |
726a989a RB |
10253 | WALK_SUBTREE (TREE_OPERAND (*tp, i)); |
10254 | WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1)); | |
953ff289 DN |
10255 | } |
10256 | } | |
953ff289 DN |
10257 | /* If this is a type, walk the needed fields in the type. */ |
10258 | else if (TYPE_P (*tp)) | |
14588106 | 10259 | return walk_type_fields (*tp, func, data, pset, lh); |
953ff289 | 10260 | break; |
b8c4a565 SB |
10261 | } |
10262 | ||
10263 | /* We didn't find what we were looking for. */ | |
10264 | return NULL_TREE; | |
10265 | ||
10266 | #undef WALK_SUBTREE_TAIL | |
10267 | } | |
10268 | #undef WALK_SUBTREE | |
10269 | ||
10270 | /* Like walk_tree, but does not walk duplicate nodes more than once. */ | |
10271 | ||
10272 | tree | |
14588106 RG |
10273 | walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data, |
10274 | walk_tree_lh lh) | |
b8c4a565 SB |
10275 | { |
10276 | tree result; | |
10277 | struct pointer_set_t *pset; | |
10278 | ||
10279 | pset = pointer_set_create (); | |
14588106 | 10280 | result = walk_tree_1 (tp, func, data, pset, lh); |
b8c4a565 SB |
10281 | pointer_set_destroy (pset); |
10282 | return result; | |
10283 | } | |
10284 | ||
953ff289 | 10285 | |
07beea0d AH |
10286 | tree * |
10287 | tree_block (tree t) | |
10288 | { | |
10289 | char const c = TREE_CODE_CLASS (TREE_CODE (t)); | |
10290 | ||
10291 | if (IS_EXPR_CODE_CLASS (c)) | |
10292 | return &t->exp.block; | |
07beea0d AH |
10293 | gcc_unreachable (); |
10294 | return NULL; | |
10295 | } | |
10296 | ||
5039610b SL |
10297 | /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp. |
10298 | FIXME: don't use this function. It exists for compatibility with | |
10299 | the old representation of CALL_EXPRs where a list was used to hold the | |
10300 | arguments. Places that currently extract the arglist from a CALL_EXPR | |
10301 | ought to be rewritten to use the CALL_EXPR itself. */ | |
10302 | tree | |
10303 | call_expr_arglist (tree exp) | |
10304 | { | |
10305 | tree arglist = NULL_TREE; | |
10306 | int i; | |
10307 | for (i = call_expr_nargs (exp) - 1; i >= 0; i--) | |
10308 | arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist); | |
10309 | return arglist; | |
10310 | } | |
10311 | ||
726a989a | 10312 | |
c2255bc4 AH |
10313 | /* Create a nameless artificial label and put it in the current |
10314 | function context. The label has a location of LOC. Returns the | |
10315 | newly created label. */ | |
726a989a RB |
10316 | |
10317 | tree | |
c2255bc4 | 10318 | create_artificial_label (location_t loc) |
726a989a | 10319 | { |
c2255bc4 AH |
10320 | tree lab = build_decl (loc, |
10321 | LABEL_DECL, NULL_TREE, void_type_node); | |
726a989a RB |
10322 | |
10323 | DECL_ARTIFICIAL (lab) = 1; | |
10324 | DECL_IGNORED_P (lab) = 1; | |
10325 | DECL_CONTEXT (lab) = current_function_decl; | |
10326 | return lab; | |
10327 | } | |
10328 | ||
10329 | /* Given a tree, try to return a useful variable name that we can use | |
10330 | to prefix a temporary that is being assigned the value of the tree. | |
10331 | I.E. given <temp> = &A, return A. */ | |
10332 | ||
10333 | const char * | |
10334 | get_name (tree t) | |
10335 | { | |
10336 | tree stripped_decl; | |
10337 | ||
10338 | stripped_decl = t; | |
10339 | STRIP_NOPS (stripped_decl); | |
10340 | if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl)) | |
10341 | return IDENTIFIER_POINTER (DECL_NAME (stripped_decl)); | |
10342 | else | |
10343 | { | |
10344 | switch (TREE_CODE (stripped_decl)) | |
10345 | { | |
10346 | case ADDR_EXPR: | |
10347 | return get_name (TREE_OPERAND (stripped_decl, 0)); | |
10348 | default: | |
10349 | return NULL; | |
10350 | } | |
10351 | } | |
10352 | } | |
10353 | ||
04e1d06b MM |
10354 | /* Return true if TYPE has a variable argument list. */ |
10355 | ||
10356 | bool | |
10357 | stdarg_p (tree fntype) | |
10358 | { | |
10359 | function_args_iterator args_iter; | |
10360 | tree n = NULL_TREE, t; | |
10361 | ||
10362 | if (!fntype) | |
10363 | return false; | |
10364 | ||
10365 | FOREACH_FUNCTION_ARGS(fntype, t, args_iter) | |
10366 | { | |
10367 | n = t; | |
10368 | } | |
10369 | ||
10370 | return n != NULL_TREE && n != void_type_node; | |
10371 | } | |
10372 | ||
10373 | /* Return true if TYPE has a prototype. */ | |
10374 | ||
10375 | bool | |
10376 | prototype_p (tree fntype) | |
10377 | { | |
10378 | tree t; | |
10379 | ||
10380 | gcc_assert (fntype != NULL_TREE); | |
10381 | ||
10382 | t = TYPE_ARG_TYPES (fntype); | |
10383 | return (t != NULL_TREE); | |
10384 | } | |
10385 | ||
d752cfdb JJ |
10386 | /* If BLOCK is inlined from an __attribute__((__artificial__)) |
10387 | routine, return pointer to location from where it has been | |
10388 | called. */ | |
10389 | location_t * | |
10390 | block_nonartificial_location (tree block) | |
10391 | { | |
10392 | location_t *ret = NULL; | |
10393 | ||
10394 | while (block && TREE_CODE (block) == BLOCK | |
10395 | && BLOCK_ABSTRACT_ORIGIN (block)) | |
10396 | { | |
10397 | tree ao = BLOCK_ABSTRACT_ORIGIN (block); | |
10398 | ||
e92cbe3a JJ |
10399 | while (TREE_CODE (ao) == BLOCK |
10400 | && BLOCK_ABSTRACT_ORIGIN (ao) | |
10401 | && BLOCK_ABSTRACT_ORIGIN (ao) != ao) | |
d752cfdb JJ |
10402 | ao = BLOCK_ABSTRACT_ORIGIN (ao); |
10403 | ||
10404 | if (TREE_CODE (ao) == FUNCTION_DECL) | |
10405 | { | |
10406 | /* If AO is an artificial inline, point RET to the | |
10407 | call site locus at which it has been inlined and continue | |
10408 | the loop, in case AO's caller is also an artificial | |
10409 | inline. */ | |
10410 | if (DECL_DECLARED_INLINE_P (ao) | |
10411 | && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao))) | |
10412 | ret = &BLOCK_SOURCE_LOCATION (block); | |
10413 | else | |
10414 | break; | |
10415 | } | |
10416 | else if (TREE_CODE (ao) != BLOCK) | |
10417 | break; | |
10418 | ||
10419 | block = BLOCK_SUPERCONTEXT (block); | |
10420 | } | |
10421 | return ret; | |
10422 | } | |
10423 | ||
9bd9f738 RG |
10424 | |
10425 | /* If EXP is inlined from an __attribute__((__artificial__)) | |
10426 | function, return the location of the original call expression. */ | |
10427 | ||
10428 | location_t | |
10429 | tree_nonartificial_location (tree exp) | |
10430 | { | |
9f706f23 | 10431 | location_t *loc = block_nonartificial_location (TREE_BLOCK (exp)); |
9bd9f738 | 10432 | |
9f706f23 JJ |
10433 | if (loc) |
10434 | return *loc; | |
10435 | else | |
10436 | return EXPR_LOCATION (exp); | |
9bd9f738 RG |
10437 | } |
10438 | ||
10439 | ||
ab442df7 MM |
10440 | /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq |
10441 | nodes. */ | |
10442 | ||
10443 | /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */ | |
10444 | ||
10445 | static hashval_t | |
10446 | cl_option_hash_hash (const void *x) | |
10447 | { | |
10448 | const_tree const t = (const_tree) x; | |
10449 | const char *p; | |
10450 | size_t i; | |
10451 | size_t len = 0; | |
10452 | hashval_t hash = 0; | |
10453 | ||
10454 | if (TREE_CODE (t) == OPTIMIZATION_NODE) | |
10455 | { | |
10456 | p = (const char *)TREE_OPTIMIZATION (t); | |
10457 | len = sizeof (struct cl_optimization); | |
10458 | } | |
10459 | ||
10460 | else if (TREE_CODE (t) == TARGET_OPTION_NODE) | |
10461 | { | |
10462 | p = (const char *)TREE_TARGET_OPTION (t); | |
10463 | len = sizeof (struct cl_target_option); | |
10464 | } | |
10465 | ||
10466 | else | |
10467 | gcc_unreachable (); | |
10468 | ||
10469 | /* assume most opt flags are just 0/1, some are 2-3, and a few might be | |
10470 | something else. */ | |
10471 | for (i = 0; i < len; i++) | |
10472 | if (p[i]) | |
10473 | hash = (hash << 4) ^ ((i << 2) | p[i]); | |
10474 | ||
10475 | return hash; | |
10476 | } | |
10477 | ||
10478 | /* Return nonzero if the value represented by *X (an OPTIMIZATION or | |
10479 | TARGET_OPTION tree node) is the same as that given by *Y, which is the | |
10480 | same. */ | |
10481 | ||
10482 | static int | |
10483 | cl_option_hash_eq (const void *x, const void *y) | |
10484 | { | |
10485 | const_tree const xt = (const_tree) x; | |
10486 | const_tree const yt = (const_tree) y; | |
10487 | const char *xp; | |
10488 | const char *yp; | |
10489 | size_t len; | |
10490 | ||
10491 | if (TREE_CODE (xt) != TREE_CODE (yt)) | |
10492 | return 0; | |
10493 | ||
10494 | if (TREE_CODE (xt) == OPTIMIZATION_NODE) | |
10495 | { | |
10496 | xp = (const char *)TREE_OPTIMIZATION (xt); | |
10497 | yp = (const char *)TREE_OPTIMIZATION (yt); | |
10498 | len = sizeof (struct cl_optimization); | |
10499 | } | |
10500 | ||
10501 | else if (TREE_CODE (xt) == TARGET_OPTION_NODE) | |
10502 | { | |
10503 | xp = (const char *)TREE_TARGET_OPTION (xt); | |
10504 | yp = (const char *)TREE_TARGET_OPTION (yt); | |
10505 | len = sizeof (struct cl_target_option); | |
10506 | } | |
10507 | ||
10508 | else | |
10509 | gcc_unreachable (); | |
10510 | ||
10511 | return (memcmp (xp, yp, len) == 0); | |
10512 | } | |
10513 | ||
10514 | /* Build an OPTIMIZATION_NODE based on the current options. */ | |
10515 | ||
10516 | tree | |
10517 | build_optimization_node (void) | |
10518 | { | |
10519 | tree t; | |
10520 | void **slot; | |
10521 | ||
10522 | /* Use the cache of optimization nodes. */ | |
10523 | ||
10524 | cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node)); | |
10525 | ||
10526 | slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT); | |
10527 | t = (tree) *slot; | |
10528 | if (!t) | |
10529 | { | |
10530 | /* Insert this one into the hash table. */ | |
10531 | t = cl_optimization_node; | |
10532 | *slot = t; | |
10533 | ||
10534 | /* Make a new node for next time round. */ | |
10535 | cl_optimization_node = make_node (OPTIMIZATION_NODE); | |
10536 | } | |
10537 | ||
10538 | return t; | |
10539 | } | |
10540 | ||
10541 | /* Build a TARGET_OPTION_NODE based on the current options. */ | |
10542 | ||
10543 | tree | |
10544 | build_target_option_node (void) | |
10545 | { | |
10546 | tree t; | |
10547 | void **slot; | |
10548 | ||
10549 | /* Use the cache of optimization nodes. */ | |
10550 | ||
10551 | cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node)); | |
10552 | ||
10553 | slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT); | |
10554 | t = (tree) *slot; | |
10555 | if (!t) | |
10556 | { | |
10557 | /* Insert this one into the hash table. */ | |
10558 | t = cl_target_option_node; | |
10559 | *slot = t; | |
10560 | ||
10561 | /* Make a new node for next time round. */ | |
10562 | cl_target_option_node = make_node (TARGET_OPTION_NODE); | |
10563 | } | |
10564 | ||
10565 | return t; | |
10566 | } | |
10567 | ||
d4ebfa65 BE |
10568 | /* Return the size in bits of an integer or pointer type. TYPE_PRECISION |
10569 | contains the bits, but in the past it was not set in some cases and there | |
10570 | was special purpose code that checked for POINTER_TYPE_P or OFFSET_TYPE, so | |
10571 | check that it is consitant when assertion checking is used. */ | |
10572 | ||
10573 | unsigned int | |
10574 | int_or_pointer_precision (const_tree type) | |
10575 | { | |
10576 | #if ENABLE_ASSERT_CHECKING | |
10577 | unsigned int prec; | |
10578 | ||
10579 | if (POINTER_TYPE_P (type)) | |
10580 | { | |
10581 | addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (type)); | |
10582 | prec = GET_MODE_BITSIZE (targetm.addr_space.pointer_mode (as)); | |
10583 | gcc_assert (prec == TYPE_PRECISION (type)); | |
10584 | } | |
10585 | else if (TREE_CODE (type) == OFFSET_TYPE) | |
10586 | { | |
10587 | prec = POINTER_SIZE; | |
10588 | gcc_assert (prec == TYPE_PRECISION (type)); | |
10589 | } | |
10590 | else | |
10591 | { | |
10592 | prec = TYPE_PRECISION (type); | |
10593 | gcc_assert (prec != 0); | |
10594 | } | |
10595 | ||
10596 | return prec; | |
10597 | ||
10598 | #else | |
10599 | return TYPE_PRECISION (type); | |
10600 | #endif | |
10601 | } | |
10602 | ||
61e04322 JH |
10603 | /* Determine the "ultimate origin" of a block. The block may be an inlined |
10604 | instance of an inlined instance of a block which is local to an inline | |
10605 | function, so we have to trace all of the way back through the origin chain | |
10606 | to find out what sort of node actually served as the original seed for the | |
10607 | given block. */ | |
10608 | ||
10609 | tree | |
10610 | block_ultimate_origin (const_tree block) | |
10611 | { | |
10612 | tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block); | |
10613 | ||
10614 | /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the | |
10615 | nodes in the function to point to themselves; ignore that if | |
10616 | we're trying to output the abstract instance of this function. */ | |
10617 | if (BLOCK_ABSTRACT (block) && immediate_origin == block) | |
10618 | return NULL_TREE; | |
10619 | ||
10620 | if (immediate_origin == NULL_TREE) | |
10621 | return NULL_TREE; | |
10622 | else | |
10623 | { | |
10624 | tree ret_val; | |
10625 | tree lookahead = immediate_origin; | |
10626 | ||
10627 | do | |
10628 | { | |
10629 | ret_val = lookahead; | |
10630 | lookahead = (TREE_CODE (ret_val) == BLOCK | |
10631 | ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL); | |
10632 | } | |
10633 | while (lookahead != NULL && lookahead != ret_val); | |
10634 | ||
10635 | /* The block's abstract origin chain may not be the *ultimate* origin of | |
10636 | the block. It could lead to a DECL that has an abstract origin set. | |
10637 | If so, we want that DECL's abstract origin (which is what DECL_ORIGIN | |
10638 | will give us if it has one). Note that DECL's abstract origins are | |
10639 | supposed to be the most distant ancestor (or so decl_ultimate_origin | |
10640 | claims), so we don't need to loop following the DECL origins. */ | |
10641 | if (DECL_P (ret_val)) | |
10642 | return DECL_ORIGIN (ret_val); | |
10643 | ||
10644 | return ret_val; | |
10645 | } | |
10646 | } | |
10647 | ||
a3710436 JH |
10648 | /* Return true if T1 and T2 are equivalent lists. */ |
10649 | ||
10650 | bool | |
10651 | list_equal_p (const_tree t1, const_tree t2) | |
10652 | { | |
10653 | for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2)) | |
10654 | if (TREE_VALUE (t1) != TREE_VALUE (t2)) | |
10655 | return false; | |
10656 | return !t1 && !t2; | |
10657 | } | |
10658 | ||
23314e77 AN |
10659 | /* Return true iff conversion in EXP generates no instruction. Mark |
10660 | it inline so that we fully inline into the stripping functions even | |
10661 | though we have two uses of this function. */ | |
10662 | ||
10663 | static inline bool | |
10664 | tree_nop_conversion (const_tree exp) | |
10665 | { | |
10666 | tree outer_type, inner_type; | |
10667 | ||
10668 | if (!CONVERT_EXPR_P (exp) | |
10669 | && TREE_CODE (exp) != NON_LVALUE_EXPR) | |
10670 | return false; | |
10671 | if (TREE_OPERAND (exp, 0) == error_mark_node) | |
10672 | return false; | |
10673 | ||
10674 | outer_type = TREE_TYPE (exp); | |
10675 | inner_type = TREE_TYPE (TREE_OPERAND (exp, 0)); | |
10676 | ||
10677 | /* Use precision rather then machine mode when we can, which gives | |
10678 | the correct answer even for submode (bit-field) types. */ | |
10679 | if ((INTEGRAL_TYPE_P (outer_type) | |
10680 | || POINTER_TYPE_P (outer_type) | |
10681 | || TREE_CODE (outer_type) == OFFSET_TYPE) | |
10682 | && (INTEGRAL_TYPE_P (inner_type) | |
10683 | || POINTER_TYPE_P (inner_type) | |
10684 | || TREE_CODE (inner_type) == OFFSET_TYPE)) | |
10685 | return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type); | |
10686 | ||
10687 | /* Otherwise fall back on comparing machine modes (e.g. for | |
10688 | aggregate types, floats). */ | |
10689 | return TYPE_MODE (outer_type) == TYPE_MODE (inner_type); | |
10690 | } | |
10691 | ||
10692 | /* Return true iff conversion in EXP generates no instruction. Don't | |
10693 | consider conversions changing the signedness. */ | |
10694 | ||
10695 | static bool | |
10696 | tree_sign_nop_conversion (const_tree exp) | |
10697 | { | |
10698 | tree outer_type, inner_type; | |
10699 | ||
10700 | if (!tree_nop_conversion (exp)) | |
10701 | return false; | |
10702 | ||
10703 | outer_type = TREE_TYPE (exp); | |
10704 | inner_type = TREE_TYPE (TREE_OPERAND (exp, 0)); | |
10705 | ||
10706 | return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type) | |
10707 | && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type)); | |
10708 | } | |
10709 | ||
10710 | /* Strip conversions from EXP according to tree_nop_conversion and | |
10711 | return the resulting expression. */ | |
10712 | ||
10713 | tree | |
10714 | tree_strip_nop_conversions (tree exp) | |
10715 | { | |
10716 | while (tree_nop_conversion (exp)) | |
10717 | exp = TREE_OPERAND (exp, 0); | |
10718 | return exp; | |
10719 | } | |
10720 | ||
10721 | /* Strip conversions from EXP according to tree_sign_nop_conversion | |
10722 | and return the resulting expression. */ | |
10723 | ||
10724 | tree | |
10725 | tree_strip_sign_nop_conversions (tree exp) | |
10726 | { | |
10727 | while (tree_sign_nop_conversion (exp)) | |
10728 | exp = TREE_OPERAND (exp, 0); | |
10729 | return exp; | |
10730 | } | |
10731 | ||
f9417da1 RG |
10732 | static GTY(()) tree gcc_eh_personality_decl; |
10733 | ||
10734 | /* Return the GCC personality function decl. */ | |
10735 | ||
10736 | tree | |
10737 | lhd_gcc_personality (void) | |
10738 | { | |
10739 | if (!gcc_eh_personality_decl) | |
10740 | gcc_eh_personality_decl | |
10741 | = build_personality_function (USING_SJLJ_EXCEPTIONS | |
10742 | ? "__gcc_personality_sj0" | |
10743 | : "__gcc_personality_v0"); | |
10744 | ||
10745 | return gcc_eh_personality_decl; | |
10746 | } | |
a3710436 | 10747 | |
e2500fed | 10748 | #include "gt-tree.h" |