]>
Commit | Line | Data |
---|---|---|
8d08fdba MS |
1 | /* Language-dependent node constructors for parse phase of GNU compiler. |
2 | Copyright (C) 1987, 1988, 1992, 1993 Free Software Foundation, Inc. | |
3 | Hacked by Michael Tiemann (tiemann@cygnus.com) | |
4 | ||
5 | This file is part of GNU CC. | |
6 | ||
7 | GNU CC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GNU CC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU CC; see the file COPYING. If not, write to | |
19 | the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
20 | ||
21 | #include "config.h" | |
22 | #include <stdio.h> | |
23 | #include "obstack.h" | |
24 | #include "tree.h" | |
25 | #include "cp-tree.h" | |
26 | #include "flags.h" | |
27 | ||
28 | #define CEIL(x,y) (((x) + (y) - 1) / (y)) | |
29 | ||
30 | /* Return nonzero if REF is an lvalue valid for this language. | |
31 | Lvalues can be assigned, unless they have TREE_READONLY. | |
32 | Lvalues can have their address taken, unless they have DECL_REGISTER. */ | |
33 | ||
34 | int | |
35 | lvalue_p (ref) | |
36 | tree ref; | |
37 | { | |
38 | register enum tree_code code = TREE_CODE (ref); | |
39 | ||
40 | if (language_lvalue_valid (ref)) | |
39211cd5 MS |
41 | { |
42 | if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE) | |
8d08fdba | 43 | return 1; |
39211cd5 MS |
44 | |
45 | switch (code) | |
46 | { | |
47 | /* preincrements and predecrements are valid lvals, provided | |
48 | what they refer to are valid lvals. */ | |
49 | case PREINCREMENT_EXPR: | |
50 | case PREDECREMENT_EXPR: | |
51 | case COMPONENT_REF: | |
52 | case SAVE_EXPR: | |
53 | return lvalue_p (TREE_OPERAND (ref, 0)); | |
54 | ||
55 | case STRING_CST: | |
8d08fdba | 56 | return 1; |
8d08fdba | 57 | |
39211cd5 MS |
58 | case VAR_DECL: |
59 | if (TREE_READONLY (ref) && ! TREE_STATIC (ref) | |
60 | && DECL_LANG_SPECIFIC (ref) | |
61 | && DECL_IN_AGGR_P (ref)) | |
62 | return 0; | |
63 | case INDIRECT_REF: | |
64 | case ARRAY_REF: | |
65 | case PARM_DECL: | |
66 | case RESULT_DECL: | |
67 | case ERROR_MARK: | |
68 | if (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE | |
69 | && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE) | |
70 | return 1; | |
71 | break; | |
72 | ||
73 | case TARGET_EXPR: | |
74 | case WITH_CLEANUP_EXPR: | |
8d08fdba | 75 | return 1; |
8d08fdba | 76 | |
39211cd5 MS |
77 | case CALL_EXPR: |
78 | /* unary_complex_lvalue knows how to deal with this case. */ | |
79 | if (TREE_ADDRESSABLE (TREE_TYPE (ref))) | |
80 | return 1; | |
81 | break; | |
82 | ||
83 | /* A currently unresolved scope ref. */ | |
84 | case SCOPE_REF: | |
85 | my_friendly_abort (103); | |
86 | case OFFSET_REF: | |
87 | if (TREE_CODE (TREE_OPERAND (ref, 1)) == FUNCTION_DECL) | |
88 | return 1; | |
89 | return lvalue_p (TREE_OPERAND (ref, 0)) | |
90 | && lvalue_p (TREE_OPERAND (ref, 1)); | |
91 | break; | |
92 | ||
93 | case COND_EXPR: | |
94 | return (lvalue_p (TREE_OPERAND (ref, 1)) | |
95 | && lvalue_p (TREE_OPERAND (ref, 2))); | |
96 | ||
39211cd5 MS |
97 | case COMPOUND_EXPR: |
98 | return lvalue_p (TREE_OPERAND (ref, 1)); | |
99 | } | |
100 | } | |
8d08fdba MS |
101 | return 0; |
102 | } | |
103 | ||
104 | /* Return nonzero if REF is an lvalue valid for this language; | |
105 | otherwise, print an error message and return zero. */ | |
106 | ||
107 | int | |
108 | lvalue_or_else (ref, string) | |
109 | tree ref; | |
110 | char *string; | |
111 | { | |
112 | int win = lvalue_p (ref); | |
113 | if (! win) | |
114 | error ("invalid lvalue in %s", string); | |
115 | return win; | |
116 | } | |
117 | ||
118 | /* INIT is a CALL_EXPR which needs info about its target. | |
119 | TYPE is the type that this initialization should appear to have. | |
120 | ||
121 | Build an encapsulation of the initialization to perform | |
122 | and return it so that it can be processed by language-independent | |
123 | and language-specific expression expanders. | |
124 | ||
125 | If WITH_CLEANUP_P is nonzero, we build a cleanup for this expression. | |
126 | Otherwise, cleanups are not built here. For example, when building | |
127 | an initialization for a stack slot, since the called function handles | |
128 | the cleanup, we would not want to do it here. */ | |
129 | tree | |
130 | build_cplus_new (type, init, with_cleanup_p) | |
131 | tree type; | |
132 | tree init; | |
133 | int with_cleanup_p; | |
134 | { | |
135 | tree slot = build (VAR_DECL, type); | |
136 | tree rval = build (NEW_EXPR, type, | |
137 | TREE_OPERAND (init, 0), TREE_OPERAND (init, 1), slot); | |
138 | TREE_SIDE_EFFECTS (rval) = 1; | |
139 | TREE_ADDRESSABLE (rval) = 1; | |
140 | rval = build (TARGET_EXPR, type, slot, rval, 0); | |
141 | TREE_SIDE_EFFECTS (rval) = 1; | |
142 | TREE_ADDRESSABLE (rval) = 1; | |
143 | ||
144 | if (with_cleanup_p && TYPE_NEEDS_DESTRUCTOR (type)) | |
145 | { | |
146 | TREE_OPERAND (rval, 2) = error_mark_node; | |
147 | rval = build (WITH_CLEANUP_EXPR, type, rval, 0, | |
148 | build_delete (TYPE_POINTER_TO (type), | |
149 | build_unary_op (ADDR_EXPR, slot, 0), | |
150 | integer_two_node, | |
151 | LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0)); | |
152 | TREE_SIDE_EFFECTS (rval) = 1; | |
153 | TREE_ADDRESSABLE (rval) = 1; | |
154 | } | |
155 | return rval; | |
156 | } | |
157 | ||
158 | /* Recursively search EXP for CALL_EXPRs that need cleanups and replace | |
159 | these CALL_EXPRs with tree nodes that will perform the cleanups. */ | |
160 | ||
161 | tree | |
162 | break_out_cleanups (exp) | |
163 | tree exp; | |
164 | { | |
165 | tree tmp = exp; | |
166 | ||
167 | if (TREE_CODE (tmp) == CALL_EXPR | |
168 | && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (tmp))) | |
169 | return build_cplus_new (TREE_TYPE (tmp), tmp, 1); | |
170 | ||
171 | while (TREE_CODE (tmp) == NOP_EXPR | |
172 | || TREE_CODE (tmp) == CONVERT_EXPR | |
173 | || TREE_CODE (tmp) == NON_LVALUE_EXPR) | |
174 | { | |
175 | if (TREE_CODE (TREE_OPERAND (tmp, 0)) == CALL_EXPR | |
176 | && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (TREE_OPERAND (tmp, 0)))) | |
177 | { | |
178 | TREE_OPERAND (tmp, 0) | |
179 | = build_cplus_new (TREE_TYPE (TREE_OPERAND (tmp, 0)), | |
180 | TREE_OPERAND (tmp, 0), 1); | |
181 | break; | |
182 | } | |
183 | else | |
184 | tmp = TREE_OPERAND (tmp, 0); | |
185 | } | |
186 | return exp; | |
187 | } | |
188 | ||
189 | /* Recursively perform a preorder search EXP for CALL_EXPRs, making | |
190 | copies where they are found. Returns a deep copy all nodes transitively | |
191 | containing CALL_EXPRs. */ | |
192 | ||
193 | tree | |
194 | break_out_calls (exp) | |
195 | tree exp; | |
196 | { | |
197 | register tree t1, t2; | |
198 | register enum tree_code code; | |
199 | register int changed = 0; | |
200 | register int i; | |
201 | ||
202 | if (exp == NULL_TREE) | |
203 | return exp; | |
204 | ||
205 | code = TREE_CODE (exp); | |
206 | ||
207 | if (code == CALL_EXPR) | |
208 | return copy_node (exp); | |
209 | ||
210 | /* Don't try and defeat a save_expr, as it should only be done once. */ | |
211 | if (code == SAVE_EXPR) | |
212 | return exp; | |
213 | ||
214 | switch (TREE_CODE_CLASS (code)) | |
215 | { | |
216 | default: | |
217 | abort (); | |
218 | ||
219 | case 'c': /* a constant */ | |
220 | case 't': /* a type node */ | |
221 | case 'x': /* something random, like an identifier or an ERROR_MARK. */ | |
222 | return exp; | |
223 | ||
224 | case 'd': /* A decl node */ | |
225 | t1 = break_out_calls (DECL_INITIAL (exp)); | |
226 | if (t1 != DECL_INITIAL (exp)) | |
227 | { | |
228 | exp = copy_node (exp); | |
229 | DECL_INITIAL (exp) = t1; | |
230 | } | |
231 | return exp; | |
232 | ||
233 | case 'b': /* A block node */ | |
234 | { | |
235 | /* Don't know how to handle these correctly yet. Must do a | |
236 | break_out_calls on all DECL_INITIAL values for local variables, | |
237 | and also break_out_calls on all sub-blocks and sub-statements. */ | |
238 | abort (); | |
239 | } | |
240 | return exp; | |
241 | ||
242 | case 'e': /* an expression */ | |
243 | case 'r': /* a reference */ | |
244 | case 's': /* an expression with side effects */ | |
245 | for (i = tree_code_length[(int) code] - 1; i >= 0; i--) | |
246 | { | |
247 | t1 = break_out_calls (TREE_OPERAND (exp, i)); | |
248 | if (t1 != TREE_OPERAND (exp, i)) | |
249 | { | |
250 | exp = copy_node (exp); | |
251 | TREE_OPERAND (exp, i) = t1; | |
252 | } | |
253 | } | |
254 | return exp; | |
255 | ||
256 | case '<': /* a comparison expression */ | |
257 | case '2': /* a binary arithmetic expression */ | |
258 | t2 = break_out_calls (TREE_OPERAND (exp, 1)); | |
259 | if (t2 != TREE_OPERAND (exp, 1)) | |
260 | changed = 1; | |
261 | case '1': /* a unary arithmetic expression */ | |
262 | t1 = break_out_calls (TREE_OPERAND (exp, 0)); | |
263 | if (t1 != TREE_OPERAND (exp, 0)) | |
264 | changed = 1; | |
265 | if (changed) | |
266 | { | |
267 | if (tree_code_length[(int) code] == 1) | |
268 | return build1 (code, TREE_TYPE (exp), t1); | |
269 | else | |
270 | return build (code, TREE_TYPE (exp), t1, t2); | |
271 | } | |
272 | return exp; | |
273 | } | |
274 | ||
275 | } | |
276 | \f | |
277 | extern struct obstack *current_obstack; | |
278 | extern struct obstack permanent_obstack, class_obstack; | |
279 | extern struct obstack *saveable_obstack; | |
280 | ||
281 | /* Here is how primitive or already-canonicalized types' hash | |
282 | codes are made. MUST BE CONSISTENT WITH tree.c !!! */ | |
283 | #define TYPE_HASH(TYPE) ((HOST_WIDE_INT) (TYPE) & 0777777) | |
284 | ||
285 | /* Construct, lay out and return the type of methods belonging to class | |
286 | BASETYPE and whose arguments are described by ARGTYPES and whose values | |
287 | are described by RETTYPE. If each type exists already, reuse it. */ | |
288 | tree | |
289 | build_cplus_method_type (basetype, rettype, argtypes) | |
290 | tree basetype, rettype, argtypes; | |
291 | { | |
292 | register tree t; | |
293 | tree ptype; | |
294 | int hashcode; | |
295 | ||
296 | /* Make a node of the sort we want. */ | |
297 | t = make_node (METHOD_TYPE); | |
298 | ||
299 | TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); | |
300 | TREE_TYPE (t) = rettype; | |
301 | if (IS_SIGNATURE (basetype)) | |
302 | ptype = build_signature_pointer_type (TYPE_MAIN_VARIANT (basetype), | |
303 | TYPE_READONLY (basetype), | |
304 | TYPE_VOLATILE (basetype)); | |
305 | else | |
306 | { | |
307 | ptype = build_pointer_type (basetype); | |
308 | #if 0 | |
309 | /* it is wrong to flag the object the pointer points to as readonly | |
310 | when flag_this_is_variable is 0. */ | |
311 | ptype = build_type_variant (ptype, flag_this_is_variable <= 0, 0); | |
312 | #else | |
313 | ptype = build_type_variant (ptype, 0, 0); | |
314 | #endif | |
315 | } | |
316 | /* The actual arglist for this function includes a "hidden" argument | |
317 | which is "this". Put it into the list of argument types. */ | |
318 | ||
319 | argtypes = tree_cons (NULL_TREE, ptype, argtypes); | |
320 | TYPE_ARG_TYPES (t) = argtypes; | |
321 | TREE_SIDE_EFFECTS (argtypes) = 1; /* Mark first argtype as "artificial". */ | |
322 | ||
323 | /* If we already have such a type, use the old one and free this one. | |
324 | Note that it also frees up the above cons cell if found. */ | |
325 | hashcode = TYPE_HASH (basetype) + TYPE_HASH (rettype) + type_hash_list (argtypes); | |
326 | t = type_hash_canon (hashcode, t); | |
327 | ||
328 | if (TYPE_SIZE (t) == 0) | |
329 | layout_type (t); | |
330 | ||
331 | return t; | |
332 | } | |
333 | ||
334 | tree | |
335 | build_cplus_staticfn_type (basetype, rettype, argtypes) | |
336 | tree basetype, rettype, argtypes; | |
337 | { | |
338 | register tree t; | |
339 | int hashcode; | |
340 | ||
341 | /* Make a node of the sort we want. */ | |
342 | t = make_node (FUNCTION_TYPE); | |
343 | ||
344 | TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); | |
345 | TREE_TYPE (t) = rettype; | |
346 | ||
347 | /* The actual arglist for this function includes a "hidden" argument | |
348 | which is "this". Put it into the list of argument types. */ | |
349 | ||
350 | TYPE_ARG_TYPES (t) = argtypes; | |
351 | ||
352 | /* If we already have such a type, use the old one and free this one. | |
353 | Note that it also frees up the above cons cell if found. */ | |
354 | hashcode = TYPE_HASH (basetype) + TYPE_HASH (rettype) + type_hash_list (argtypes); | |
355 | t = type_hash_canon (hashcode, t); | |
356 | ||
357 | if (TYPE_SIZE (t) == 0) | |
358 | layout_type (t); | |
359 | ||
360 | return t; | |
361 | } | |
362 | ||
363 | tree | |
364 | build_cplus_array_type (elt_type, index_type) | |
365 | tree elt_type; | |
366 | tree index_type; | |
367 | { | |
368 | register struct obstack *ambient_obstack = current_obstack; | |
369 | register struct obstack *ambient_saveable_obstack = saveable_obstack; | |
370 | tree t; | |
371 | ||
372 | /* We need a new one. If both ELT_TYPE and INDEX_TYPE are permanent, | |
373 | make this permanent too. */ | |
374 | if (TREE_PERMANENT (elt_type) | |
375 | && (index_type == 0 || TREE_PERMANENT (index_type))) | |
376 | { | |
377 | current_obstack = &permanent_obstack; | |
378 | saveable_obstack = &permanent_obstack; | |
379 | } | |
380 | ||
381 | t = build_array_type (elt_type, index_type); | |
382 | ||
383 | /* Push these needs up so that initialization takes place | |
384 | more easily. */ | |
385 | TYPE_NEEDS_CONSTRUCTING (t) = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type)); | |
386 | TYPE_NEEDS_DESTRUCTOR (t) = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type)); | |
387 | current_obstack = ambient_obstack; | |
388 | saveable_obstack = ambient_saveable_obstack; | |
389 | return t; | |
390 | } | |
391 | \f | |
392 | /* Add OFFSET to all base types of T. | |
393 | ||
394 | OFFSET, which is a type offset, is number of bytes. | |
395 | ||
396 | Note that we don't have to worry about having two paths to the | |
397 | same base type, since this type owns its association list. */ | |
398 | void | |
399 | propagate_binfo_offsets (binfo, offset) | |
400 | tree binfo; | |
401 | tree offset; | |
402 | { | |
403 | tree binfos = BINFO_BASETYPES (binfo); | |
404 | int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0; | |
405 | ||
406 | for (i = 0; i < n_baselinks; /* note increment is done in the loop. */) | |
407 | { | |
408 | tree base_binfo = TREE_VEC_ELT (binfos, i); | |
409 | ||
410 | if (TREE_VIA_VIRTUAL (base_binfo)) | |
411 | i += 1; | |
412 | else | |
413 | { | |
414 | int j; | |
415 | tree base_binfos = BINFO_BASETYPES (base_binfo); | |
416 | tree delta; | |
417 | ||
418 | for (j = i+1; j < n_baselinks; j++) | |
419 | if (! TREE_VIA_VIRTUAL (TREE_VEC_ELT (binfos, j))) | |
420 | { | |
421 | /* The next basetype offset must take into account the space | |
422 | between the classes, not just the size of each class. */ | |
423 | delta = size_binop (MINUS_EXPR, | |
424 | BINFO_OFFSET (TREE_VEC_ELT (binfos, j)), | |
425 | BINFO_OFFSET (base_binfo)); | |
426 | break; | |
427 | } | |
428 | ||
429 | #if 0 | |
430 | if (BINFO_OFFSET_ZEROP (base_binfo)) | |
431 | BINFO_OFFSET (base_binfo) = offset; | |
432 | else | |
433 | BINFO_OFFSET (base_binfo) | |
434 | = size_binop (PLUS_EXPR, BINFO_OFFSET (base_binfo), offset); | |
435 | #else | |
436 | BINFO_OFFSET (base_binfo) = offset; | |
437 | #endif | |
438 | if (base_binfos) | |
439 | { | |
440 | int k; | |
441 | tree chain = NULL_TREE; | |
442 | ||
443 | /* Now unshare the structure beneath BASE_BINFO. */ | |
444 | for (k = TREE_VEC_LENGTH (base_binfos)-1; | |
445 | k >= 0; k--) | |
446 | { | |
447 | tree base_base_binfo = TREE_VEC_ELT (base_binfos, k); | |
448 | if (! TREE_VIA_VIRTUAL (base_base_binfo)) | |
449 | TREE_VEC_ELT (base_binfos, k) | |
450 | = make_binfo (BINFO_OFFSET (base_base_binfo), | |
8926095f | 451 | base_base_binfo, |
8d08fdba MS |
452 | BINFO_VTABLE (base_base_binfo), |
453 | BINFO_VIRTUALS (base_base_binfo), | |
454 | chain); | |
455 | chain = TREE_VEC_ELT (base_binfos, k); | |
456 | TREE_VIA_PUBLIC (chain) = TREE_VIA_PUBLIC (base_base_binfo); | |
457 | TREE_VIA_PROTECTED (chain) = TREE_VIA_PROTECTED (base_base_binfo); | |
458 | } | |
459 | /* Now propagate the offset to the base types. */ | |
460 | propagate_binfo_offsets (base_binfo, offset); | |
461 | } | |
462 | ||
463 | /* Go to our next class that counts for offset propagation. */ | |
464 | i = j; | |
465 | if (i < n_baselinks) | |
466 | offset = size_binop (PLUS_EXPR, offset, delta); | |
467 | } | |
468 | } | |
469 | } | |
470 | ||
471 | /* Compute the actual offsets that our virtual base classes | |
472 | will have *for this type*. This must be performed after | |
473 | the fields are laid out, since virtual baseclasses must | |
474 | lay down at the end of the record. | |
475 | ||
476 | Returns the maximum number of virtual functions any of the virtual | |
477 | baseclasses provide. */ | |
478 | int | |
479 | layout_vbasetypes (rec, max) | |
480 | tree rec; | |
481 | int max; | |
482 | { | |
483 | /* Get all the virtual base types that this type uses. | |
484 | The TREE_VALUE slot holds the virtual baseclass type. */ | |
485 | tree vbase_types = get_vbase_types (rec); | |
486 | ||
487 | #ifdef STRUCTURE_SIZE_BOUNDARY | |
488 | unsigned record_align = MAX (STRUCTURE_SIZE_BOUNDARY, TYPE_ALIGN (rec)); | |
489 | #else | |
490 | unsigned record_align = MAX (BITS_PER_UNIT, TYPE_ALIGN (rec)); | |
491 | #endif | |
492 | ||
493 | /* Record size so far is CONST_SIZE + VAR_SIZE bits, | |
494 | where CONST_SIZE is an integer | |
495 | and VAR_SIZE is a tree expression. | |
496 | If VAR_SIZE is null, the size is just CONST_SIZE. | |
497 | Naturally we try to avoid using VAR_SIZE. */ | |
498 | register unsigned const_size = 0; | |
499 | register tree var_size = 0; | |
500 | int nonvirtual_const_size; | |
501 | tree nonvirtual_var_size; | |
502 | ||
503 | CLASSTYPE_VBASECLASSES (rec) = vbase_types; | |
504 | ||
505 | if (TREE_CODE (TYPE_SIZE (rec)) == INTEGER_CST) | |
506 | const_size = TREE_INT_CST_LOW (TYPE_SIZE (rec)); | |
507 | else | |
508 | var_size = TYPE_SIZE (rec); | |
509 | ||
510 | nonvirtual_const_size = const_size; | |
511 | nonvirtual_var_size = var_size; | |
512 | ||
513 | while (vbase_types) | |
514 | { | |
515 | tree basetype = BINFO_TYPE (vbase_types); | |
516 | tree offset; | |
517 | ||
518 | if (const_size == 0) | |
519 | offset = integer_zero_node; | |
520 | else | |
521 | offset = size_int ((const_size + BITS_PER_UNIT - 1) / BITS_PER_UNIT); | |
522 | ||
523 | if (CLASSTYPE_VSIZE (basetype) > max) | |
524 | max = CLASSTYPE_VSIZE (basetype); | |
525 | BINFO_OFFSET (vbase_types) = offset; | |
526 | ||
527 | if (TREE_CODE (TYPE_SIZE (basetype)) == INTEGER_CST) | |
528 | const_size += MAX (record_align, | |
529 | TREE_INT_CST_LOW (TYPE_SIZE (basetype)) | |
530 | - TREE_INT_CST_LOW (CLASSTYPE_VBASE_SIZE (basetype))); | |
531 | else if (var_size == 0) | |
532 | var_size = TYPE_SIZE (basetype); | |
533 | else | |
534 | var_size = size_binop (PLUS_EXPR, var_size, TYPE_SIZE (basetype)); | |
535 | ||
536 | vbase_types = TREE_CHAIN (vbase_types); | |
537 | } | |
538 | ||
539 | if (const_size != nonvirtual_const_size) | |
540 | { | |
541 | CLASSTYPE_VBASE_SIZE (rec) | |
542 | = size_int (const_size - nonvirtual_const_size); | |
543 | TYPE_SIZE (rec) = size_int (const_size); | |
544 | } | |
545 | ||
546 | /* Now propagate offset information throughout the lattice | |
547 | under the vbase type. */ | |
548 | for (vbase_types = CLASSTYPE_VBASECLASSES (rec); vbase_types; | |
549 | vbase_types = TREE_CHAIN (vbase_types)) | |
550 | { | |
551 | tree base_binfos = BINFO_BASETYPES (vbase_types); | |
552 | ||
553 | if (base_binfos) | |
554 | { | |
555 | tree chain = NULL_TREE; | |
556 | int j; | |
557 | /* Now unshare the structure beneath BASE_BINFO. */ | |
558 | ||
559 | for (j = TREE_VEC_LENGTH (base_binfos)-1; | |
560 | j >= 0; j--) | |
561 | { | |
562 | tree base_base_binfo = TREE_VEC_ELT (base_binfos, j); | |
563 | if (! TREE_VIA_VIRTUAL (base_base_binfo)) | |
564 | TREE_VEC_ELT (base_binfos, j) | |
565 | = make_binfo (BINFO_OFFSET (base_base_binfo), | |
8926095f | 566 | base_base_binfo, |
8d08fdba MS |
567 | BINFO_VTABLE (base_base_binfo), |
568 | BINFO_VIRTUALS (base_base_binfo), | |
569 | chain); | |
570 | chain = TREE_VEC_ELT (base_binfos, j); | |
571 | TREE_VIA_PUBLIC (chain) = TREE_VIA_PUBLIC (base_base_binfo); | |
572 | TREE_VIA_PROTECTED (chain) = TREE_VIA_PROTECTED (base_base_binfo); | |
573 | } | |
574 | ||
575 | propagate_binfo_offsets (vbase_types, BINFO_OFFSET (vbase_types)); | |
576 | } | |
577 | } | |
578 | ||
579 | return max; | |
580 | } | |
581 | ||
582 | /* Lay out the base types of a record type, REC. | |
583 | Tentatively set the size and alignment of REC | |
584 | according to the base types alone. | |
585 | ||
586 | Offsets for immediate nonvirtual baseclasses are also computed here. | |
587 | ||
7177d104 MS |
588 | TYPE_BINFO (REC) should be NULL_TREE on entry, and this routine |
589 | creates a list of base_binfos in TYPE_BINFO (REC) from BINFOS. | |
590 | ||
8d08fdba MS |
591 | Returns list of virtual base classes in a FIELD_DECL chain. */ |
592 | tree | |
593 | layout_basetypes (rec, binfos) | |
594 | tree rec, binfos; | |
595 | { | |
596 | /* Chain to hold all the new FIELD_DECLs which point at virtual | |
597 | base classes. */ | |
598 | tree vbase_decls = NULL_TREE; | |
599 | ||
600 | #ifdef STRUCTURE_SIZE_BOUNDARY | |
601 | unsigned record_align = MAX (STRUCTURE_SIZE_BOUNDARY, TYPE_ALIGN (rec)); | |
602 | #else | |
603 | unsigned record_align = MAX (BITS_PER_UNIT, TYPE_ALIGN (rec)); | |
604 | #endif | |
605 | ||
8926095f MS |
606 | /* Record size so far is CONST_SIZE + VAR_SIZE bits, where CONST_SIZE is |
607 | an integer and VAR_SIZE is a tree expression. If VAR_SIZE is null, | |
608 | the size is just CONST_SIZE. Naturally we try to avoid using | |
609 | VAR_SIZE. And so far, we've been sucessful. */ | |
610 | #if 0 | |
8d08fdba | 611 | register tree var_size = 0; |
8926095f MS |
612 | #endif |
613 | ||
614 | register unsigned const_size = 0; | |
8d08fdba MS |
615 | int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0; |
616 | ||
617 | /* Handle basetypes almost like fields, but record their | |
618 | offsets differently. */ | |
619 | ||
620 | for (i = 0; i < n_baseclasses; i++) | |
621 | { | |
622 | int inc, desired_align, int_vbase_size; | |
623 | register tree base_binfo = TREE_VEC_ELT (binfos, i); | |
624 | register tree basetype = BINFO_TYPE (base_binfo); | |
625 | tree decl, offset; | |
626 | ||
627 | if (TYPE_SIZE (basetype) == 0) | |
628 | { | |
629 | #if 0 | |
630 | /* This error is now reported in xref_tag, thus giving better | |
631 | location information. */ | |
632 | error_with_aggr_type (base_binfo, | |
633 | "base class `%s' has incomplete type"); | |
634 | ||
635 | TREE_VIA_PUBLIC (base_binfo) = 1; | |
636 | TREE_VIA_PROTECTED (base_binfo) = 0; | |
637 | TREE_VIA_VIRTUAL (base_binfo) = 0; | |
638 | ||
639 | /* Should handle this better so that | |
640 | ||
641 | class A; | |
642 | class B: private A { virtual void F(); }; | |
643 | ||
644 | does not dump core when compiled. */ | |
645 | my_friendly_abort (121); | |
646 | #endif | |
647 | continue; | |
648 | } | |
649 | ||
650 | /* All basetypes are recorded in the association list of the | |
651 | derived type. */ | |
652 | ||
653 | if (TREE_VIA_VIRTUAL (base_binfo)) | |
654 | { | |
655 | int j; | |
656 | char *name = (char *)alloca (TYPE_NAME_LENGTH (basetype) | |
657 | + sizeof (VBASE_NAME) + 1); | |
658 | ||
659 | /* The offset for a virtual base class is only used in computing | |
660 | virtual function tables and for initializing virtual base | |
661 | pointers. It is built once `get_vbase_types' is called. */ | |
662 | ||
663 | /* If this basetype can come from another vbase pointer | |
664 | without an additional indirection, we will share | |
665 | that pointer. If an indirection is involved, we | |
666 | make our own pointer. */ | |
667 | for (j = 0; j < n_baseclasses; j++) | |
668 | { | |
669 | tree other_base_binfo = TREE_VEC_ELT (binfos, j); | |
670 | if (! TREE_VIA_VIRTUAL (other_base_binfo) | |
671 | && binfo_member (basetype, | |
672 | CLASSTYPE_VBASECLASSES (BINFO_TYPE (other_base_binfo)))) | |
673 | goto got_it; | |
674 | } | |
675 | sprintf (name, VBASE_NAME_FORMAT, TYPE_NAME_STRING (basetype)); | |
676 | decl = build_lang_decl (FIELD_DECL, get_identifier (name), | |
677 | build_pointer_type (basetype)); | |
678 | /* If you change any of the below, take a look at all the | |
679 | other VFIELD_BASEs and VTABLE_BASEs in the code, and change | |
680 | them too. */ | |
681 | DECL_ASSEMBLER_NAME (decl) = get_identifier (VTABLE_BASE); | |
682 | DECL_VIRTUAL_P (decl) = 1; | |
683 | DECL_FIELD_CONTEXT (decl) = rec; | |
684 | DECL_CLASS_CONTEXT (decl) = rec; | |
685 | DECL_FCONTEXT (decl) = basetype; | |
686 | DECL_FIELD_SIZE (decl) = 0; | |
687 | DECL_ALIGN (decl) = TYPE_ALIGN (ptr_type_node); | |
688 | TREE_CHAIN (decl) = vbase_decls; | |
689 | BINFO_VPTR_FIELD (base_binfo) = decl; | |
690 | vbase_decls = decl; | |
691 | ||
692 | if (warn_nonvdtor && TYPE_HAS_DESTRUCTOR (basetype) | |
693 | && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 0)) == NULL_TREE) | |
694 | { | |
695 | warning_with_decl (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 0), | |
696 | "destructor `%s' non-virtual"); | |
697 | warning ("in inheritance relationship `%s: virtual %s'", | |
698 | TYPE_NAME_STRING (rec), | |
699 | TYPE_NAME_STRING (basetype)); | |
700 | } | |
701 | got_it: | |
702 | /* The space this decl occupies has already been accounted for. */ | |
703 | continue; | |
704 | } | |
705 | ||
706 | if (const_size == 0) | |
707 | offset = integer_zero_node; | |
708 | else | |
709 | { | |
710 | /* Give each base type the alignment it wants. */ | |
711 | const_size = CEIL (const_size, TYPE_ALIGN (basetype)) | |
712 | * TYPE_ALIGN (basetype); | |
713 | offset = size_int ((const_size + BITS_PER_UNIT - 1) / BITS_PER_UNIT); | |
714 | ||
715 | #if 0 | |
716 | /* bpk: Disabled this check until someone is willing to | |
717 | claim it as theirs and explain exactly what circumstances | |
718 | warrant the warning. */ | |
719 | if (warn_nonvdtor && TYPE_HAS_DESTRUCTOR (basetype) | |
720 | && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 0)) == NULL_TREE) | |
721 | { | |
722 | warning_with_decl (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 0), | |
723 | "destructor `%s' non-virtual"); | |
724 | warning ("in inheritance relationship `%s:%s %s'", | |
725 | TYPE_NAME_STRING (rec), | |
726 | TREE_VIA_VIRTUAL (base_binfo) ? " virtual" : "", | |
727 | TYPE_NAME_STRING (basetype)); | |
728 | } | |
729 | #endif | |
730 | } | |
731 | BINFO_OFFSET (base_binfo) = offset; | |
732 | if (CLASSTYPE_VSIZE (basetype)) | |
733 | { | |
734 | BINFO_VTABLE (base_binfo) = TYPE_BINFO_VTABLE (basetype); | |
735 | BINFO_VIRTUALS (base_binfo) = TYPE_BINFO_VIRTUALS (basetype); | |
736 | } | |
737 | TREE_CHAIN (base_binfo) = TYPE_BINFO (rec); | |
738 | TYPE_BINFO (rec) = base_binfo; | |
739 | ||
740 | /* Add only the amount of storage not present in | |
741 | the virtual baseclasses. */ | |
742 | ||
743 | int_vbase_size = TREE_INT_CST_LOW (CLASSTYPE_VBASE_SIZE (basetype)); | |
744 | if (TREE_INT_CST_LOW (TYPE_SIZE (basetype)) > int_vbase_size) | |
745 | { | |
746 | inc = MAX (record_align, | |
747 | (TREE_INT_CST_LOW (TYPE_SIZE (basetype)) | |
748 | - int_vbase_size)); | |
749 | ||
750 | /* Record must have at least as much alignment as any field. */ | |
751 | desired_align = TYPE_ALIGN (basetype); | |
752 | record_align = MAX (record_align, desired_align); | |
753 | ||
754 | const_size += inc; | |
755 | } | |
756 | } | |
757 | ||
758 | if (const_size) | |
759 | CLASSTYPE_SIZE (rec) = size_int (const_size); | |
760 | else | |
761 | CLASSTYPE_SIZE (rec) = integer_zero_node; | |
762 | CLASSTYPE_ALIGN (rec) = record_align; | |
763 | ||
764 | return vbase_decls; | |
765 | } | |
766 | \f | |
767 | /* Hashing of lists so that we don't make duplicates. | |
768 | The entry point is `list_hash_canon'. */ | |
769 | ||
770 | /* Each hash table slot is a bucket containing a chain | |
771 | of these structures. */ | |
772 | ||
773 | struct list_hash | |
774 | { | |
775 | struct list_hash *next; /* Next structure in the bucket. */ | |
776 | int hashcode; /* Hash code of this list. */ | |
777 | tree list; /* The list recorded here. */ | |
778 | }; | |
779 | ||
780 | /* Now here is the hash table. When recording a list, it is added | |
781 | to the slot whose index is the hash code mod the table size. | |
782 | Note that the hash table is used for several kinds of lists. | |
783 | While all these live in the same table, they are completely independent, | |
784 | and the hash code is computed differently for each of these. */ | |
785 | ||
786 | #define TYPE_HASH_SIZE 59 | |
787 | struct list_hash *list_hash_table[TYPE_HASH_SIZE]; | |
788 | ||
789 | /* Compute a hash code for a list (chain of TREE_LIST nodes | |
790 | with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the | |
791 | TREE_COMMON slots), by adding the hash codes of the individual entries. */ | |
792 | ||
793 | int | |
794 | list_hash (list) | |
795 | tree list; | |
796 | { | |
797 | register int hashcode = 0; | |
798 | ||
799 | if (TREE_CHAIN (list)) | |
800 | hashcode += TYPE_HASH (TREE_CHAIN (list)); | |
801 | ||
802 | if (TREE_VALUE (list)) | |
803 | hashcode += TYPE_HASH (TREE_VALUE (list)); | |
804 | else | |
805 | hashcode += 1007; | |
806 | if (TREE_PURPOSE (list)) | |
807 | hashcode += TYPE_HASH (TREE_PURPOSE (list)); | |
808 | else | |
809 | hashcode += 1009; | |
810 | return hashcode; | |
811 | } | |
812 | ||
813 | /* Look in the type hash table for a type isomorphic to TYPE. | |
814 | If one is found, return it. Otherwise return 0. */ | |
815 | ||
816 | tree | |
817 | list_hash_lookup (hashcode, list) | |
818 | int hashcode; | |
819 | tree list; | |
820 | { | |
821 | register struct list_hash *h; | |
822 | for (h = list_hash_table[hashcode % TYPE_HASH_SIZE]; h; h = h->next) | |
823 | if (h->hashcode == hashcode | |
824 | && TREE_VIA_VIRTUAL (h->list) == TREE_VIA_VIRTUAL (list) | |
825 | && TREE_VIA_PUBLIC (h->list) == TREE_VIA_PUBLIC (list) | |
826 | && TREE_VIA_PROTECTED (h->list) == TREE_VIA_PROTECTED (list) | |
827 | && TREE_PURPOSE (h->list) == TREE_PURPOSE (list) | |
828 | && TREE_VALUE (h->list) == TREE_VALUE (list) | |
829 | && TREE_CHAIN (h->list) == TREE_CHAIN (list)) | |
830 | { | |
831 | my_friendly_assert (TREE_TYPE (h->list) == TREE_TYPE (list), 299); | |
832 | return h->list; | |
833 | } | |
834 | return 0; | |
835 | } | |
836 | ||
837 | /* Add an entry to the list-hash-table | |
838 | for a list TYPE whose hash code is HASHCODE. */ | |
839 | ||
840 | void | |
841 | list_hash_add (hashcode, list) | |
842 | int hashcode; | |
843 | tree list; | |
844 | { | |
845 | register struct list_hash *h; | |
846 | ||
847 | h = (struct list_hash *) obstack_alloc (&class_obstack, sizeof (struct list_hash)); | |
848 | h->hashcode = hashcode; | |
849 | h->list = list; | |
850 | h->next = list_hash_table[hashcode % TYPE_HASH_SIZE]; | |
851 | list_hash_table[hashcode % TYPE_HASH_SIZE] = h; | |
852 | } | |
853 | ||
854 | /* Given TYPE, and HASHCODE its hash code, return the canonical | |
855 | object for an identical list if one already exists. | |
856 | Otherwise, return TYPE, and record it as the canonical object | |
857 | if it is a permanent object. | |
858 | ||
859 | To use this function, first create a list of the sort you want. | |
860 | Then compute its hash code from the fields of the list that | |
861 | make it different from other similar lists. | |
862 | Then call this function and use the value. | |
863 | This function frees the list you pass in if it is a duplicate. */ | |
864 | ||
865 | /* Set to 1 to debug without canonicalization. Never set by program. */ | |
866 | int debug_no_list_hash = 0; | |
867 | ||
868 | tree | |
869 | list_hash_canon (hashcode, list) | |
870 | int hashcode; | |
871 | tree list; | |
872 | { | |
873 | tree t1; | |
874 | ||
875 | if (debug_no_list_hash) | |
876 | return list; | |
877 | ||
878 | t1 = list_hash_lookup (hashcode, list); | |
879 | if (t1 != 0) | |
880 | { | |
881 | obstack_free (&class_obstack, list); | |
882 | return t1; | |
883 | } | |
884 | ||
885 | /* If this is a new list, record it for later reuse. */ | |
886 | list_hash_add (hashcode, list); | |
887 | ||
888 | return list; | |
889 | } | |
890 | ||
891 | tree | |
892 | hash_tree_cons (via_public, via_virtual, via_protected, purpose, value, chain) | |
893 | int via_public, via_virtual, via_protected; | |
894 | tree purpose, value, chain; | |
895 | { | |
896 | struct obstack *ambient_obstack = current_obstack; | |
897 | tree t; | |
898 | int hashcode; | |
899 | ||
900 | current_obstack = &class_obstack; | |
901 | t = tree_cons (purpose, value, chain); | |
902 | TREE_VIA_PUBLIC (t) = via_public; | |
903 | TREE_VIA_PROTECTED (t) = via_protected; | |
904 | TREE_VIA_VIRTUAL (t) = via_virtual; | |
905 | hashcode = list_hash (t); | |
906 | t = list_hash_canon (hashcode, t); | |
907 | current_obstack = ambient_obstack; | |
908 | return t; | |
909 | } | |
910 | ||
911 | /* Constructor for hashed lists. */ | |
912 | tree | |
913 | hash_tree_chain (value, chain) | |
914 | tree value, chain; | |
915 | { | |
916 | struct obstack *ambient_obstack = current_obstack; | |
917 | tree t; | |
918 | int hashcode; | |
919 | ||
920 | current_obstack = &class_obstack; | |
921 | t = tree_cons (NULL_TREE, value, chain); | |
922 | hashcode = list_hash (t); | |
923 | t = list_hash_canon (hashcode, t); | |
924 | current_obstack = ambient_obstack; | |
925 | return t; | |
926 | } | |
927 | ||
928 | /* Similar, but used for concatenating two lists. */ | |
929 | tree | |
930 | hash_chainon (list1, list2) | |
931 | tree list1, list2; | |
932 | { | |
933 | if (list2 == 0) | |
934 | return list1; | |
935 | if (list1 == 0) | |
936 | return list2; | |
937 | if (TREE_CHAIN (list1) == NULL_TREE) | |
938 | return hash_tree_chain (TREE_VALUE (list1), list2); | |
939 | return hash_tree_chain (TREE_VALUE (list1), | |
940 | hash_chainon (TREE_CHAIN (list1), list2)); | |
941 | } | |
942 | ||
51c184be MS |
943 | static tree |
944 | get_identifier_list (value) | |
8d08fdba MS |
945 | tree value; |
946 | { | |
51c184be MS |
947 | tree list = IDENTIFIER_AS_LIST (value); |
948 | if (list != NULL_TREE | |
949 | && (TREE_CODE (list) != TREE_LIST | |
950 | || TREE_VALUE (list) != value)) | |
951 | list = NULL_TREE; | |
952 | else if (IDENTIFIER_HAS_TYPE_VALUE (value) | |
8926095f MS |
953 | && TREE_CODE (IDENTIFIER_TYPE_VALUE (value)) == RECORD_TYPE |
954 | && IDENTIFIER_TYPE_VALUE (value) | |
955 | == TYPE_MAIN_VARIANT (IDENTIFIER_TYPE_VALUE (value))) | |
8d08fdba | 956 | { |
51c184be MS |
957 | tree type = IDENTIFIER_TYPE_VALUE (value); |
958 | ||
959 | if (TYPE_PTRMEMFUNC_P (type)) | |
8d08fdba | 960 | list = NULL_TREE; |
51c184be MS |
961 | else if (type == current_class_type) |
962 | /* Don't mess up the constructor name. */ | |
963 | list = tree_cons (NULL_TREE, value, NULL_TREE); | |
964 | else | |
8d08fdba MS |
965 | { |
966 | register tree id; | |
51c184be MS |
967 | /* This will return the correct thing for regular types, |
968 | nested types, and templates. Yay! */ | |
969 | if (TYPE_NESTED_NAME (type)) | |
970 | id = TYPE_NESTED_NAME (type); | |
8d08fdba | 971 | else |
51c184be MS |
972 | id = TYPE_IDENTIFIER (type); |
973 | ||
974 | if (CLASSTYPE_ID_AS_LIST (type) == NULL_TREE) | |
975 | CLASSTYPE_ID_AS_LIST (type) | |
976 | = perm_tree_cons (NULL_TREE, id, NULL_TREE); | |
977 | list = CLASSTYPE_ID_AS_LIST (type); | |
8d08fdba MS |
978 | } |
979 | } | |
51c184be MS |
980 | return list; |
981 | } | |
982 | ||
983 | tree | |
984 | get_decl_list (value) | |
985 | tree value; | |
986 | { | |
987 | tree list = NULL_TREE; | |
988 | ||
989 | if (TREE_CODE (value) == IDENTIFIER_NODE) | |
990 | list = get_identifier_list (value); | |
8d08fdba MS |
991 | else if (TREE_CODE (value) == RECORD_TYPE |
992 | && TYPE_LANG_SPECIFIC (value)) | |
993 | list = CLASSTYPE_AS_LIST (value); | |
994 | ||
995 | if (list != NULL_TREE) | |
996 | { | |
997 | my_friendly_assert (TREE_CHAIN (list) == NULL_TREE, 301); | |
998 | return list; | |
999 | } | |
1000 | ||
1001 | return build_decl_list (NULL_TREE, value); | |
1002 | } | |
1003 | ||
1004 | /* Look in the type hash table for a type isomorphic to | |
1005 | `build_tree_list (NULL_TREE, VALUE)'. | |
1006 | If one is found, return it. Otherwise return 0. */ | |
1007 | ||
1008 | tree | |
1009 | list_hash_lookup_or_cons (value) | |
1010 | tree value; | |
1011 | { | |
1012 | register int hashcode = TYPE_HASH (value); | |
1013 | register struct list_hash *h; | |
1014 | struct obstack *ambient_obstack; | |
1015 | tree list = NULL_TREE; | |
1016 | ||
1017 | if (TREE_CODE (value) == IDENTIFIER_NODE) | |
51c184be | 1018 | list = get_identifier_list (value); |
8d08fdba MS |
1019 | else if (TREE_CODE (value) == TYPE_DECL |
1020 | && TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE | |
1021 | && TYPE_LANG_SPECIFIC (TREE_TYPE (value))) | |
1022 | list = CLASSTYPE_ID_AS_LIST (TREE_TYPE (value)); | |
1023 | else if (TREE_CODE (value) == RECORD_TYPE | |
1024 | && TYPE_LANG_SPECIFIC (value)) | |
1025 | list = CLASSTYPE_AS_LIST (value); | |
1026 | ||
1027 | if (list != NULL_TREE) | |
1028 | { | |
1029 | my_friendly_assert (TREE_CHAIN (list) == NULL_TREE, 302); | |
1030 | return list; | |
1031 | } | |
1032 | ||
1033 | if (debug_no_list_hash) | |
1034 | return hash_tree_chain (value, NULL_TREE); | |
1035 | ||
1036 | for (h = list_hash_table[hashcode % TYPE_HASH_SIZE]; h; h = h->next) | |
1037 | if (h->hashcode == hashcode | |
1038 | && TREE_VIA_VIRTUAL (h->list) == 0 | |
1039 | && TREE_VIA_PUBLIC (h->list) == 0 | |
1040 | && TREE_VIA_PROTECTED (h->list) == 0 | |
1041 | && TREE_PURPOSE (h->list) == 0 | |
1042 | && TREE_VALUE (h->list) == value) | |
1043 | { | |
1044 | my_friendly_assert (TREE_TYPE (h->list) == 0, 303); | |
1045 | my_friendly_assert (TREE_CHAIN (h->list) == 0, 304); | |
1046 | return h->list; | |
1047 | } | |
1048 | ||
1049 | ambient_obstack = current_obstack; | |
1050 | current_obstack = &class_obstack; | |
1051 | list = build_tree_list (NULL_TREE, value); | |
1052 | list_hash_add (hashcode, list); | |
1053 | current_obstack = ambient_obstack; | |
1054 | return list; | |
1055 | } | |
1056 | \f | |
1057 | /* Build an association between TYPE and some parameters: | |
1058 | ||
1059 | OFFSET is the offset added to `this' to convert it to a pointer | |
1060 | of type `TYPE *' | |
1061 | ||
8926095f MS |
1062 | BINFO is the base binfo to use, if we are deriving from one. This |
1063 | is necessary, as we want specialized parent binfos from base | |
1064 | classes, so that the VTABLE_NAMEs of bases are for the most derived | |
1065 | type, instead of of the simple type. | |
1066 | ||
8d08fdba MS |
1067 | VTABLE is the virtual function table with which to initialize |
1068 | sub-objects of type TYPE. | |
1069 | ||
1070 | VIRTUALS are the virtual functions sitting in VTABLE. | |
1071 | ||
1072 | CHAIN are more associations we must retain. */ | |
1073 | ||
1074 | tree | |
8926095f MS |
1075 | make_binfo (offset, binfo, vtable, virtuals, chain) |
1076 | tree offset, binfo; | |
8d08fdba MS |
1077 | tree vtable, virtuals; |
1078 | tree chain; | |
1079 | { | |
8926095f MS |
1080 | tree new_binfo = make_tree_vec (6); |
1081 | tree type; | |
8d08fdba | 1082 | |
8926095f MS |
1083 | if (TREE_CODE (binfo) == TREE_VEC) |
1084 | type = BINFO_TYPE (binfo); | |
1085 | else | |
1086 | { | |
1087 | type = binfo; | |
1088 | binfo = TYPE_BINFO (binfo); | |
1089 | } | |
8d08fdba | 1090 | |
8926095f MS |
1091 | TREE_CHAIN (new_binfo) = chain; |
1092 | if (chain) | |
1093 | TREE_USED (new_binfo) = TREE_USED (chain); | |
8d08fdba | 1094 | |
8926095f MS |
1095 | TREE_TYPE (new_binfo) = TYPE_MAIN_VARIANT (type); |
1096 | BINFO_OFFSET (new_binfo) = offset; | |
1097 | BINFO_VTABLE (new_binfo) = vtable; | |
1098 | BINFO_VIRTUALS (new_binfo) = virtuals; | |
1099 | BINFO_VPTR_FIELD (new_binfo) = NULL_TREE; | |
8d08fdba | 1100 | |
8926095f MS |
1101 | if (binfo && BINFO_BASETYPES (binfo) != NULL_TREE) |
1102 | BINFO_BASETYPES (new_binfo) = copy_node (BINFO_BASETYPES (binfo)); | |
1103 | return new_binfo; | |
8d08fdba MS |
1104 | } |
1105 | ||
1106 | tree | |
1107 | copy_binfo (list) | |
1108 | tree list; | |
1109 | { | |
1110 | tree binfo = copy_list (list); | |
1111 | tree rval = binfo; | |
1112 | while (binfo) | |
1113 | { | |
1114 | TREE_USED (binfo) = 0; | |
1115 | if (BINFO_BASETYPES (binfo)) | |
1116 | BINFO_BASETYPES (binfo) = copy_node (BINFO_BASETYPES (binfo)); | |
1117 | binfo = TREE_CHAIN (binfo); | |
1118 | } | |
1119 | return rval; | |
1120 | } | |
1121 | ||
1122 | /* Return the binfo value for ELEM in TYPE. */ | |
1123 | ||
1124 | tree | |
1125 | binfo_value (elem, type) | |
1126 | tree elem; | |
1127 | tree type; | |
1128 | { | |
1129 | if (get_base_distance (elem, type, 0, (tree *)0) == -2) | |
1130 | compiler_error ("base class `%s' ambiguous in binfo_value", | |
1131 | TYPE_NAME_STRING (elem)); | |
1132 | if (elem == type) | |
1133 | return TYPE_BINFO (type); | |
1134 | if (TREE_CODE (elem) == RECORD_TYPE && TYPE_BINFO (elem) == type) | |
1135 | return type; | |
1136 | return get_binfo (elem, type, 0); | |
1137 | } | |
1138 | ||
1139 | tree | |
1140 | reverse_path (path) | |
1141 | tree path; | |
1142 | { | |
1143 | register tree prev = 0, tmp, next; | |
1144 | for (tmp = path; tmp; tmp = next) | |
1145 | { | |
1146 | next = BINFO_INHERITANCE_CHAIN (tmp); | |
1147 | BINFO_INHERITANCE_CHAIN (tmp) = prev; | |
1148 | prev = tmp; | |
1149 | } | |
1150 | return prev; | |
1151 | } | |
1152 | ||
1153 | tree | |
1154 | virtual_member (elem, list) | |
1155 | tree elem; | |
1156 | tree list; | |
1157 | { | |
1158 | tree t; | |
1159 | tree rval, nval; | |
1160 | ||
1161 | for (t = list; t; t = TREE_CHAIN (t)) | |
1162 | if (elem == BINFO_TYPE (t)) | |
1163 | return t; | |
1164 | rval = 0; | |
1165 | for (t = list; t; t = TREE_CHAIN (t)) | |
1166 | { | |
1167 | tree binfos = BINFO_BASETYPES (t); | |
1168 | int i; | |
1169 | ||
1170 | if (binfos != NULL_TREE) | |
1171 | for (i = TREE_VEC_LENGTH (binfos)-1; i >= 0; i--) | |
1172 | { | |
1173 | nval = binfo_value (elem, BINFO_TYPE (TREE_VEC_ELT (binfos, i))); | |
1174 | if (nval) | |
1175 | { | |
1176 | if (rval && BINFO_OFFSET (nval) != BINFO_OFFSET (rval)) | |
1177 | my_friendly_abort (104); | |
1178 | rval = nval; | |
1179 | } | |
1180 | } | |
1181 | } | |
1182 | return rval; | |
1183 | } | |
1184 | ||
1185 | /* Return the offset (as an INTEGER_CST) for ELEM in LIST. | |
1186 | INITIAL_OFFSET is the value to add to the offset that ELEM's | |
1187 | binfo entry in LIST provides. | |
1188 | ||
1189 | Returns NULL if ELEM does not have an binfo value in LIST. */ | |
1190 | ||
1191 | tree | |
1192 | virtual_offset (elem, list, initial_offset) | |
1193 | tree elem; | |
1194 | tree list; | |
1195 | tree initial_offset; | |
1196 | { | |
1197 | tree vb, offset; | |
1198 | tree rval, nval; | |
1199 | ||
1200 | for (vb = list; vb; vb = TREE_CHAIN (vb)) | |
1201 | if (elem == BINFO_TYPE (vb)) | |
1202 | return size_binop (PLUS_EXPR, initial_offset, BINFO_OFFSET (vb)); | |
1203 | rval = 0; | |
1204 | for (vb = list; vb; vb = TREE_CHAIN (vb)) | |
1205 | { | |
1206 | tree binfos = BINFO_BASETYPES (vb); | |
1207 | int i; | |
1208 | ||
1209 | if (binfos == NULL_TREE) | |
1210 | continue; | |
1211 | ||
1212 | for (i = TREE_VEC_LENGTH (binfos)-1; i >= 0; i--) | |
1213 | { | |
1214 | nval = binfo_value (elem, BINFO_TYPE (TREE_VEC_ELT (binfos, i))); | |
1215 | if (nval) | |
1216 | { | |
1217 | if (rval && BINFO_OFFSET (nval) != BINFO_OFFSET (rval)) | |
1218 | my_friendly_abort (105); | |
1219 | offset = BINFO_OFFSET (vb); | |
1220 | rval = nval; | |
1221 | } | |
1222 | } | |
1223 | } | |
1224 | if (rval == NULL_TREE) | |
1225 | return rval; | |
1226 | return size_binop (PLUS_EXPR, offset, BINFO_OFFSET (rval)); | |
1227 | } | |
1228 | ||
1229 | void | |
1230 | debug_binfo (elem) | |
1231 | tree elem; | |
1232 | { | |
1233 | int i; | |
1234 | tree virtuals; | |
1235 | ||
1236 | fprintf (stderr, "type \"%s\"; offset = %d\n", | |
1237 | TYPE_NAME_STRING (BINFO_TYPE (elem)), | |
1238 | TREE_INT_CST_LOW (BINFO_OFFSET (elem))); | |
1239 | fprintf (stderr, "vtable type:\n"); | |
1240 | debug_tree (BINFO_TYPE (elem)); | |
1241 | if (BINFO_VTABLE (elem)) | |
1242 | fprintf (stderr, "vtable decl \"%s\"\n", IDENTIFIER_POINTER (DECL_NAME (BINFO_VTABLE (elem)))); | |
1243 | else | |
1244 | fprintf (stderr, "no vtable decl yet\n"); | |
1245 | fprintf (stderr, "virtuals:\n"); | |
1246 | virtuals = BINFO_VIRTUALS (elem); | |
1247 | if (virtuals != 0) | |
1248 | { | |
1249 | virtuals = TREE_CHAIN (virtuals); | |
1250 | if (flag_dossier) | |
1251 | virtuals = TREE_CHAIN (virtuals); | |
1252 | } | |
1253 | i = 1; | |
1254 | while (virtuals) | |
1255 | { | |
1256 | tree fndecl = TREE_OPERAND (FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (virtuals)), 0); | |
1257 | fprintf (stderr, "%s [%d =? %d]\n", | |
1258 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)), | |
1259 | i, TREE_INT_CST_LOW (DECL_VINDEX (fndecl))); | |
1260 | virtuals = TREE_CHAIN (virtuals); | |
1261 | i += 1; | |
1262 | } | |
1263 | } | |
1264 | ||
1265 | /* Return the length of a chain of nodes chained through DECL_CHAIN. | |
1266 | We expect a null pointer to mark the end of the chain. | |
1267 | This is the Lisp primitive `length'. */ | |
1268 | ||
1269 | int | |
1270 | decl_list_length (t) | |
1271 | tree t; | |
1272 | { | |
1273 | register tree tail; | |
1274 | register int len = 0; | |
1275 | ||
1276 | my_friendly_assert (TREE_CODE (t) == FUNCTION_DECL | |
1277 | || TREE_CODE (t) == TEMPLATE_DECL, 300); | |
1278 | for (tail = t; tail; tail = DECL_CHAIN (tail)) | |
1279 | len++; | |
1280 | ||
1281 | return len; | |
1282 | } | |
1283 | ||
1284 | int | |
1285 | count_functions (t) | |
1286 | tree t; | |
1287 | { | |
1288 | if (TREE_CODE (t) == FUNCTION_DECL) | |
1289 | return 1; | |
1290 | ||
1291 | return decl_list_length (TREE_VALUE (t)); | |
1292 | } | |
1293 | ||
1294 | /* Like value_member, but for DECL_CHAINs. */ | |
1295 | tree | |
1296 | decl_value_member (elem, list) | |
1297 | tree elem, list; | |
1298 | { | |
1299 | while (list) | |
1300 | { | |
1301 | if (elem == list) | |
1302 | return list; | |
1303 | list = DECL_CHAIN (list); | |
1304 | } | |
1305 | return NULL_TREE; | |
1306 | } | |
1307 | ||
1308 | int | |
1309 | is_overloaded_fn (x) | |
1310 | tree x; | |
1311 | { | |
1312 | if (TREE_CODE (x) == FUNCTION_DECL) | |
1313 | return 1; | |
1314 | ||
1315 | if (TREE_CODE (x) == TREE_LIST | |
1316 | && (TREE_CODE (TREE_VALUE (x)) == FUNCTION_DECL | |
1317 | || TREE_CODE (TREE_VALUE (x)) == TEMPLATE_DECL)) | |
1318 | return 1; | |
1319 | ||
1320 | return 0; | |
1321 | } | |
1322 | ||
8926095f MS |
1323 | int |
1324 | really_overloaded_fn (x) | |
1325 | tree x; | |
1326 | { | |
1327 | if (TREE_CODE (x) == TREE_LIST | |
1328 | && (TREE_CODE (TREE_VALUE (x)) == FUNCTION_DECL | |
1329 | || TREE_CODE (TREE_VALUE (x)) == TEMPLATE_DECL)) | |
1330 | return 1; | |
1331 | ||
1332 | return 0; | |
1333 | } | |
1334 | ||
8d08fdba MS |
1335 | tree |
1336 | get_first_fn (from) | |
1337 | tree from; | |
1338 | { | |
1339 | if (TREE_CODE (from) == FUNCTION_DECL) | |
1340 | return from; | |
1341 | ||
1342 | my_friendly_assert (TREE_CODE (from) == TREE_LIST, 9); | |
1343 | ||
1344 | return TREE_VALUE (from); | |
1345 | } | |
1346 | ||
1347 | tree | |
1348 | fnaddr_from_vtable_entry (entry) | |
1349 | tree entry; | |
1350 | { | |
8926095f MS |
1351 | if (flag_vtable_thunks) |
1352 | { | |
1353 | tree func = entry; | |
1354 | if (TREE_CODE (func) == ADDR_EXPR) | |
1355 | func = TREE_OPERAND (func, 0); | |
1356 | if (TREE_CODE (func) == THUNK_DECL) | |
1357 | return DECL_INITIAL (func); | |
1358 | else | |
1359 | return entry; | |
1360 | } | |
1361 | else | |
1362 | return TREE_VALUE (TREE_CHAIN (TREE_CHAIN (CONSTRUCTOR_ELTS (entry)))); | |
8d08fdba MS |
1363 | } |
1364 | ||
1365 | void | |
1366 | set_fnaddr_from_vtable_entry (entry, value) | |
1367 | tree entry, value; | |
1368 | { | |
8926095f MS |
1369 | if (flag_vtable_thunks) |
1370 | abort (); | |
1371 | else | |
8d08fdba MS |
1372 | TREE_VALUE (TREE_CHAIN (TREE_CHAIN (CONSTRUCTOR_ELTS (entry)))) = value; |
1373 | } | |
1374 | ||
1375 | tree | |
1376 | function_arg_chain (t) | |
1377 | tree t; | |
1378 | { | |
1379 | return TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (t))); | |
1380 | } | |
1381 | ||
1382 | int | |
1383 | promotes_to_aggr_type (t, code) | |
1384 | tree t; | |
1385 | enum tree_code code; | |
1386 | { | |
1387 | if (TREE_CODE (t) == code) | |
1388 | t = TREE_TYPE (t); | |
1389 | return IS_AGGR_TYPE (t); | |
1390 | } | |
1391 | ||
1392 | int | |
1393 | is_aggr_type_2 (t1, t2) | |
1394 | tree t1, t2; | |
1395 | { | |
1396 | if (TREE_CODE (t1) != TREE_CODE (t2)) | |
1397 | return 0; | |
1398 | return IS_AGGR_TYPE (t1) && IS_AGGR_TYPE (t2); | |
1399 | } | |
1400 | ||
1401 | /* Give message using types TYPE1 and TYPE2 as arguments. | |
1402 | PFN is the function which will print the message; | |
1403 | S is the format string for PFN to use. */ | |
1404 | void | |
1405 | message_2_types (pfn, s, type1, type2) | |
1406 | void (*pfn) (); | |
1407 | char *s; | |
1408 | tree type1, type2; | |
1409 | { | |
1410 | tree name1 = TYPE_NAME (type1); | |
1411 | tree name2 = TYPE_NAME (type2); | |
1412 | if (TREE_CODE (name1) == TYPE_DECL) | |
1413 | name1 = DECL_NAME (name1); | |
1414 | if (TREE_CODE (name2) == TYPE_DECL) | |
1415 | name2 = DECL_NAME (name2); | |
1416 | (*pfn) (s, IDENTIFIER_POINTER (name1), IDENTIFIER_POINTER (name2)); | |
1417 | } | |
1418 | \f | |
1419 | #define PRINT_RING_SIZE 4 | |
1420 | ||
1421 | char * | |
1422 | lang_printable_name (decl) | |
1423 | tree decl; | |
1424 | { | |
1425 | static tree decl_ring[PRINT_RING_SIZE]; | |
1426 | static char *print_ring[PRINT_RING_SIZE]; | |
1427 | static int ring_counter; | |
1428 | int i; | |
1429 | ||
1430 | /* Only cache functions. */ | |
1431 | if (TREE_CODE (decl) != FUNCTION_DECL | |
1432 | || DECL_LANG_SPECIFIC (decl) == 0) | |
1433 | return decl_as_string (decl, 1); | |
1434 | ||
1435 | /* See if this print name is lying around. */ | |
1436 | for (i = 0; i < PRINT_RING_SIZE; i++) | |
1437 | if (decl_ring[i] == decl) | |
1438 | /* yes, so return it. */ | |
1439 | return print_ring[i]; | |
1440 | ||
1441 | if (++ring_counter == PRINT_RING_SIZE) | |
1442 | ring_counter = 0; | |
1443 | ||
1444 | if (current_function_decl != NULL_TREE) | |
1445 | { | |
1446 | if (decl_ring[ring_counter] == current_function_decl) | |
1447 | ring_counter += 1; | |
1448 | if (ring_counter == PRINT_RING_SIZE) | |
1449 | ring_counter = 0; | |
1450 | if (decl_ring[ring_counter] == current_function_decl) | |
1451 | my_friendly_abort (106); | |
1452 | } | |
1453 | ||
1454 | if (print_ring[ring_counter]) | |
1455 | free (print_ring[ring_counter]); | |
1456 | ||
1457 | { | |
1458 | int print_ret_type_p | |
1459 | = (!DECL_CONSTRUCTOR_P (decl) | |
1460 | && !DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl))); | |
1461 | ||
1462 | char *name = (char *)decl_as_string (decl, print_ret_type_p); | |
1463 | print_ring[ring_counter] = (char *)malloc (strlen (name) + 1); | |
1464 | strcpy (print_ring[ring_counter], name); | |
1465 | decl_ring[ring_counter] = decl; | |
1466 | } | |
1467 | return print_ring[ring_counter]; | |
1468 | } | |
1469 | \f | |
1470 | /* Comparison function for sorting identifiers in RAISES lists. | |
1471 | Note that because IDENTIFIER_NODEs are unique, we can sort | |
1472 | them by address, saving an indirection. */ | |
1473 | static int | |
1474 | id_cmp (p1, p2) | |
1475 | tree *p1, *p2; | |
1476 | { | |
1477 | return (HOST_WIDE_INT)TREE_VALUE (*p1) - (HOST_WIDE_INT)TREE_VALUE (*p2); | |
1478 | } | |
1479 | ||
1480 | /* Build the FUNCTION_TYPE or METHOD_TYPE which may raise exceptions | |
1481 | listed in RAISES. */ | |
1482 | tree | |
1483 | build_exception_variant (ctype, type, raises) | |
1484 | tree ctype, type; | |
1485 | tree raises; | |
1486 | { | |
1487 | int i; | |
1488 | tree v = TYPE_MAIN_VARIANT (type); | |
1489 | tree t, t2, cname; | |
1490 | tree *a = (tree *)alloca ((list_length (raises)+1) * sizeof (tree)); | |
1491 | int constp = TYPE_READONLY (type); | |
1492 | int volatilep = TYPE_VOLATILE (type); | |
1493 | ||
8d08fdba MS |
1494 | for (v = TYPE_NEXT_VARIANT (v); v; v = TYPE_NEXT_VARIANT (v)) |
1495 | { | |
1496 | if (TYPE_READONLY (v) != constp | |
1497 | || TYPE_VOLATILE (v) != volatilep) | |
1498 | continue; | |
1499 | ||
1500 | t = raises; | |
1501 | t2 = TYPE_RAISES_EXCEPTIONS (v); | |
1502 | while (t && t2) | |
1503 | { | |
1504 | if (TREE_TYPE (t) == TREE_TYPE (t2)) | |
1505 | { | |
1506 | t = TREE_CHAIN (t); | |
1507 | t2 = TREE_CHAIN (t2); | |
1508 | } | |
1509 | else break; | |
1510 | } | |
1511 | if (t || t2) | |
1512 | continue; | |
1513 | /* List of exceptions raised matches previously found list. | |
1514 | ||
1515 | @@ Nice to free up storage used in consing up the | |
1516 | @@ list of exceptions raised. */ | |
1517 | return v; | |
1518 | } | |
1519 | ||
1520 | /* Need to build a new variant. */ | |
1521 | v = copy_node (type); | |
1522 | TYPE_NEXT_VARIANT (v) = TYPE_NEXT_VARIANT (type); | |
1523 | TYPE_NEXT_VARIANT (type) = v; | |
1524 | if (raises && ! TREE_PERMANENT (raises)) | |
1525 | { | |
1526 | push_obstacks_nochange (); | |
1527 | end_temporary_allocation (); | |
1528 | raises = copy_list (raises); | |
1529 | pop_obstacks (); | |
1530 | } | |
1531 | TYPE_RAISES_EXCEPTIONS (v) = raises; | |
1532 | return v; | |
1533 | } | |
1534 | ||
1535 | /* Subroutine of copy_to_permanent | |
1536 | ||
1537 | Assuming T is a node build bottom-up, make it all exist on | |
1538 | permanent obstack, if it is not permanent already. */ | |
1539 | static tree | |
1540 | make_deep_copy (t) | |
1541 | tree t; | |
1542 | { | |
1543 | enum tree_code code; | |
1544 | ||
1545 | if (t == NULL_TREE || TREE_PERMANENT (t)) | |
1546 | return t; | |
1547 | ||
1548 | switch (code = TREE_CODE (t)) | |
1549 | { | |
1550 | case ERROR_MARK: | |
1551 | return error_mark_node; | |
1552 | ||
1553 | case VAR_DECL: | |
1554 | case FUNCTION_DECL: | |
1555 | case CONST_DECL: | |
1556 | break; | |
1557 | ||
1558 | case PARM_DECL: | |
1559 | { | |
1560 | tree chain = TREE_CHAIN (t); | |
1561 | t = copy_node (t); | |
1562 | TREE_CHAIN (t) = make_deep_copy (chain); | |
1563 | TREE_TYPE (t) = make_deep_copy (TREE_TYPE (t)); | |
1564 | DECL_INITIAL (t) = make_deep_copy (DECL_INITIAL (t)); | |
1565 | DECL_SIZE (t) = make_deep_copy (DECL_SIZE (t)); | |
1566 | return t; | |
1567 | } | |
1568 | ||
1569 | case TREE_LIST: | |
1570 | { | |
1571 | tree chain = TREE_CHAIN (t); | |
1572 | t = copy_node (t); | |
1573 | TREE_PURPOSE (t) = make_deep_copy (TREE_PURPOSE (t)); | |
1574 | TREE_VALUE (t) = make_deep_copy (TREE_VALUE (t)); | |
1575 | TREE_CHAIN (t) = make_deep_copy (chain); | |
1576 | return t; | |
1577 | } | |
1578 | ||
1579 | case TREE_VEC: | |
1580 | { | |
1581 | int len = TREE_VEC_LENGTH (t); | |
1582 | ||
1583 | t = copy_node (t); | |
1584 | while (len--) | |
1585 | TREE_VEC_ELT (t, len) = make_deep_copy (TREE_VEC_ELT (t, len)); | |
1586 | return t; | |
1587 | } | |
1588 | ||
1589 | case INTEGER_CST: | |
1590 | case REAL_CST: | |
1591 | case STRING_CST: | |
1592 | return copy_node (t); | |
1593 | ||
1594 | case COND_EXPR: | |
1595 | case TARGET_EXPR: | |
1596 | case NEW_EXPR: | |
1597 | t = copy_node (t); | |
1598 | TREE_OPERAND (t, 0) = make_deep_copy (TREE_OPERAND (t, 0)); | |
1599 | TREE_OPERAND (t, 1) = make_deep_copy (TREE_OPERAND (t, 1)); | |
1600 | TREE_OPERAND (t, 2) = make_deep_copy (TREE_OPERAND (t, 2)); | |
1601 | return t; | |
1602 | ||
1603 | case SAVE_EXPR: | |
1604 | t = copy_node (t); | |
1605 | TREE_OPERAND (t, 0) = make_deep_copy (TREE_OPERAND (t, 0)); | |
1606 | return t; | |
1607 | ||
1608 | case MODIFY_EXPR: | |
1609 | case PLUS_EXPR: | |
1610 | case MINUS_EXPR: | |
1611 | case MULT_EXPR: | |
1612 | case TRUNC_DIV_EXPR: | |
1613 | case TRUNC_MOD_EXPR: | |
1614 | case MIN_EXPR: | |
1615 | case MAX_EXPR: | |
1616 | case LSHIFT_EXPR: | |
1617 | case RSHIFT_EXPR: | |
1618 | case BIT_IOR_EXPR: | |
1619 | case BIT_XOR_EXPR: | |
1620 | case BIT_AND_EXPR: | |
1621 | case BIT_ANDTC_EXPR: | |
1622 | case TRUTH_ANDIF_EXPR: | |
1623 | case TRUTH_ORIF_EXPR: | |
1624 | case LT_EXPR: | |
1625 | case LE_EXPR: | |
1626 | case GT_EXPR: | |
1627 | case GE_EXPR: | |
1628 | case EQ_EXPR: | |
1629 | case NE_EXPR: | |
1630 | case CEIL_DIV_EXPR: | |
1631 | case FLOOR_DIV_EXPR: | |
1632 | case ROUND_DIV_EXPR: | |
1633 | case CEIL_MOD_EXPR: | |
1634 | case FLOOR_MOD_EXPR: | |
1635 | case ROUND_MOD_EXPR: | |
1636 | case COMPOUND_EXPR: | |
1637 | case PREDECREMENT_EXPR: | |
1638 | case PREINCREMENT_EXPR: | |
1639 | case POSTDECREMENT_EXPR: | |
1640 | case POSTINCREMENT_EXPR: | |
1641 | case CALL_EXPR: | |
1642 | t = copy_node (t); | |
1643 | TREE_OPERAND (t, 0) = make_deep_copy (TREE_OPERAND (t, 0)); | |
1644 | TREE_OPERAND (t, 1) = make_deep_copy (TREE_OPERAND (t, 1)); | |
1645 | return t; | |
1646 | ||
1647 | case CONVERT_EXPR: | |
1648 | case ADDR_EXPR: | |
1649 | case INDIRECT_REF: | |
1650 | case NEGATE_EXPR: | |
1651 | case BIT_NOT_EXPR: | |
1652 | case TRUTH_NOT_EXPR: | |
1653 | case NOP_EXPR: | |
1654 | case COMPONENT_REF: | |
1655 | t = copy_node (t); | |
1656 | TREE_OPERAND (t, 0) = make_deep_copy (TREE_OPERAND (t, 0)); | |
1657 | return t; | |
1658 | ||
1659 | /* This list is incomplete, but should suffice for now. | |
1660 | It is very important that `sorry' does not call | |
1661 | `report_error_function'. That could cause an infinite loop. */ | |
1662 | default: | |
1663 | sorry ("initializer contains unrecognized tree code"); | |
1664 | return error_mark_node; | |
1665 | ||
1666 | } | |
1667 | my_friendly_abort (107); | |
1668 | /* NOTREACHED */ | |
1669 | return NULL_TREE; | |
1670 | } | |
1671 | ||
1672 | /* Assuming T is a node built bottom-up, make it all exist on | |
1673 | permanent obstack, if it is not permanent already. */ | |
1674 | tree | |
1675 | copy_to_permanent (t) | |
1676 | tree t; | |
1677 | { | |
1678 | register struct obstack *ambient_obstack = current_obstack; | |
1679 | register struct obstack *ambient_saveable_obstack = saveable_obstack; | |
1680 | ||
1681 | if (t == NULL_TREE || TREE_PERMANENT (t)) | |
1682 | return t; | |
1683 | ||
1684 | saveable_obstack = &permanent_obstack; | |
1685 | current_obstack = saveable_obstack; | |
1686 | ||
1687 | t = make_deep_copy (t); | |
1688 | ||
1689 | current_obstack = ambient_obstack; | |
1690 | saveable_obstack = ambient_saveable_obstack; | |
1691 | ||
1692 | return t; | |
1693 | } | |
1694 | ||
1695 | void | |
1696 | print_lang_statistics () | |
1697 | { | |
1698 | extern struct obstack maybepermanent_obstack; | |
1699 | print_obstack_statistics ("class_obstack", &class_obstack); | |
1700 | print_obstack_statistics ("permanent_obstack", &permanent_obstack); | |
1701 | print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack); | |
1702 | print_search_statistics (); | |
1703 | print_class_statistics (); | |
1704 | } | |
1705 | ||
1706 | /* This is used by the `assert' macro. It is provided in libgcc.a, | |
1707 | which `cc' doesn't know how to link. Note that the C++ front-end | |
1708 | no longer actually uses the `assert' macro (instead, it calls | |
1709 | my_friendly_assert). But all of the back-end files still need this. */ | |
1710 | void | |
1711 | __eprintf (string, expression, line, filename) | |
1712 | #ifdef __STDC__ | |
1713 | const char *string; | |
1714 | const char *expression; | |
1715 | unsigned line; | |
1716 | const char *filename; | |
1717 | #else | |
1718 | char *string; | |
1719 | char *expression; | |
1720 | unsigned line; | |
1721 | char *filename; | |
1722 | #endif | |
1723 | { | |
1724 | fprintf (stderr, string, expression, line, filename); | |
1725 | fflush (stderr); | |
1726 | abort (); | |
1727 | } | |
1728 | ||
1729 | /* Return, as an INTEGER_CST node, the number of elements for | |
1730 | TYPE (which is an ARRAY_TYPE). This counts only elements of the top array. */ | |
1731 | ||
1732 | tree | |
1733 | array_type_nelts_top (type) | |
1734 | tree type; | |
1735 | { | |
1736 | return fold (build (PLUS_EXPR, integer_type_node, | |
1737 | array_type_nelts (type), | |
1738 | integer_one_node)); | |
1739 | } | |
1740 | ||
1741 | /* Return, as an INTEGER_CST node, the number of elements for | |
1742 | TYPE (which is an ARRAY_TYPE). This one is a recursive count of all | |
1743 | ARRAY_TYPEs that are clumped together. */ | |
1744 | ||
1745 | tree | |
1746 | array_type_nelts_total (type) | |
1747 | tree type; | |
1748 | { | |
1749 | tree sz = array_type_nelts_top (type); | |
1750 | type = TREE_TYPE (type); | |
1751 | while (TREE_CODE (type) == ARRAY_TYPE) | |
1752 | { | |
1753 | tree n = array_type_nelts_top (type); | |
1754 | sz = fold (build (MULT_EXPR, integer_type_node, sz, n)); | |
1755 | type = TREE_TYPE (type); | |
1756 | } | |
1757 | return sz; | |
1758 | } |