1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2011, Free Software Foundation, Inc. *
11 * GNAT is free software; you can redistribute it and/or modify it under *
12 * terms of the GNU General Public License as published by the Free Soft- *
13 * ware Foundation; either version 3, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License along with GCC; see the file COPYING3. If not see *
19 * <http://www.gnu.org/licenses/>. *
21 * GNAT was originally developed by the GNAT team at New York University. *
22 * Extensive contributions were provided by Ada Core Technologies Inc. *
24 ****************************************************************************/
28 #include "coretypes.h"
34 #include "tree-inline.h"
51 /* Return the base type of TYPE. */
54 get_base_type (tree type)
56 if (TREE_CODE (type) == RECORD_TYPE
57 && TYPE_JUSTIFIED_MODULAR_P (type))
58 type = TREE_TYPE (TYPE_FIELDS (type));
60 while (TREE_TYPE (type)
61 && (TREE_CODE (type) == INTEGER_TYPE
62 || TREE_CODE (type) == REAL_TYPE))
63 type = TREE_TYPE (type);
68 /* EXP is a GCC tree representing an address. See if we can find how
69 strictly the object at that address is aligned. Return that alignment
70 in bits. If we don't know anything about the alignment, return 0. */
73 known_alignment (tree exp)
75 unsigned int this_alignment;
76 unsigned int lhs, rhs;
78 switch (TREE_CODE (exp))
81 case VIEW_CONVERT_EXPR:
83 /* Conversions between pointers and integers don't change the alignment
84 of the underlying object. */
85 this_alignment = known_alignment (TREE_OPERAND (exp, 0));
89 /* The value of a COMPOUND_EXPR is that of it's second operand. */
90 this_alignment = known_alignment (TREE_OPERAND (exp, 1));
95 /* If two address are added, the alignment of the result is the
96 minimum of the two alignments. */
97 lhs = known_alignment (TREE_OPERAND (exp, 0));
98 rhs = known_alignment (TREE_OPERAND (exp, 1));
99 this_alignment = MIN (lhs, rhs);
102 case POINTER_PLUS_EXPR:
103 lhs = known_alignment (TREE_OPERAND (exp, 0));
104 rhs = known_alignment (TREE_OPERAND (exp, 1));
105 /* If we don't know the alignment of the offset, we assume that
108 this_alignment = lhs;
110 this_alignment = MIN (lhs, rhs);
114 /* If there is a choice between two values, use the smallest one. */
115 lhs = known_alignment (TREE_OPERAND (exp, 1));
116 rhs = known_alignment (TREE_OPERAND (exp, 2));
117 this_alignment = MIN (lhs, rhs);
122 unsigned HOST_WIDE_INT c = TREE_INT_CST_LOW (exp);
123 /* The first part of this represents the lowest bit in the constant,
124 but it is originally in bytes, not bits. */
125 this_alignment = MIN (BITS_PER_UNIT * (c & -c), BIGGEST_ALIGNMENT);
130 /* If we know the alignment of just one side, use it. Otherwise,
131 use the product of the alignments. */
132 lhs = known_alignment (TREE_OPERAND (exp, 0));
133 rhs = known_alignment (TREE_OPERAND (exp, 1));
136 this_alignment = rhs;
138 this_alignment = lhs;
140 this_alignment = MIN (lhs * rhs, BIGGEST_ALIGNMENT);
144 /* A bit-and expression is as aligned as the maximum alignment of the
145 operands. We typically get here for a complex lhs and a constant
146 negative power of two on the rhs to force an explicit alignment, so
147 don't bother looking at the lhs. */
148 this_alignment = known_alignment (TREE_OPERAND (exp, 1));
152 this_alignment = expr_align (TREE_OPERAND (exp, 0));
157 tree t = maybe_inline_call_in_expr (exp);
159 return known_alignment (t);
162 /* Fall through... */
165 /* For other pointer expressions, we assume that the pointed-to object
166 is at least as aligned as the pointed-to type. Beware that we can
167 have a dummy type here (e.g. a Taft Amendment type), for which the
168 alignment is meaningless and should be ignored. */
169 if (POINTER_TYPE_P (TREE_TYPE (exp))
170 && !TYPE_IS_DUMMY_P (TREE_TYPE (TREE_TYPE (exp))))
171 this_alignment = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp)));
177 return this_alignment;
180 /* We have a comparison or assignment operation on two types, T1 and T2, which
181 are either both array types or both record types. T1 is assumed to be for
182 the left hand side operand, and T2 for the right hand side. Return the
183 type that both operands should be converted to for the operation, if any.
184 Otherwise return zero. */
187 find_common_type (tree t1, tree t2)
189 /* ??? As of today, various constructs lead to here with types of different
190 sizes even when both constants (e.g. tagged types, packable vs regular
191 component types, padded vs unpadded types, ...). While some of these
192 would better be handled upstream (types should be made consistent before
193 calling into build_binary_op), some others are really expected and we
194 have to be careful. */
196 /* We must avoid writing more than what the target can hold if this is for
197 an assignment and the case of tagged types is handled in build_binary_op
198 so we use the lhs type if it is known to be smaller or of constant size
199 and the rhs type is not, whatever the modes. We also force t1 in case of
200 constant size equality to minimize occurrences of view conversions on the
201 lhs of an assignment, except for the case of record types with a variant
202 part on the lhs but not on the rhs to make the conversion simpler. */
203 if (TREE_CONSTANT (TYPE_SIZE (t1))
204 && (!TREE_CONSTANT (TYPE_SIZE (t2))
205 || tree_int_cst_lt (TYPE_SIZE (t1), TYPE_SIZE (t2))
206 || (TYPE_SIZE (t1) == TYPE_SIZE (t2)
207 && !(TREE_CODE (t1) == RECORD_TYPE
208 && TREE_CODE (t2) == RECORD_TYPE
209 && get_variant_part (t1) != NULL_TREE
210 && get_variant_part (t2) == NULL_TREE))))
213 /* Otherwise, if the lhs type is non-BLKmode, use it. Note that we know
214 that we will not have any alignment problems since, if we did, the
215 non-BLKmode type could not have been used. */
216 if (TYPE_MODE (t1) != BLKmode)
219 /* If the rhs type is of constant size, use it whatever the modes. At
220 this point it is known to be smaller, or of constant size and the
222 if (TREE_CONSTANT (TYPE_SIZE (t2)))
225 /* Otherwise, if the rhs type is non-BLKmode, use it. */
226 if (TYPE_MODE (t2) != BLKmode)
229 /* In this case, both types have variable size and BLKmode. It's
230 probably best to leave the "type mismatch" because changing it
231 could cause a bad self-referential reference. */
235 /* Return an expression tree representing an equality comparison of A1 and A2,
236 two objects of type ARRAY_TYPE. The result should be of type RESULT_TYPE.
238 Two arrays are equal in one of two ways: (1) if both have zero length in
239 some dimension (not necessarily the same dimension) or (2) if the lengths
240 in each dimension are equal and the data is equal. We perform the length
241 tests in as efficient a manner as possible. */
244 compare_arrays (location_t loc, tree result_type, tree a1, tree a2)
246 tree result = convert (result_type, boolean_true_node);
247 tree a1_is_null = convert (result_type, boolean_false_node);
248 tree a2_is_null = convert (result_type, boolean_false_node);
249 tree t1 = TREE_TYPE (a1);
250 tree t2 = TREE_TYPE (a2);
251 bool a1_side_effects_p = TREE_SIDE_EFFECTS (a1);
252 bool a2_side_effects_p = TREE_SIDE_EFFECTS (a2);
253 bool length_zero_p = false;
255 /* If either operand has side-effects, they have to be evaluated only once
256 in spite of the multiple references to the operand in the comparison. */
257 if (a1_side_effects_p)
258 a1 = gnat_protect_expr (a1);
260 if (a2_side_effects_p)
261 a2 = gnat_protect_expr (a2);
263 /* Process each dimension separately and compare the lengths. If any
264 dimension has a length known to be zero, set LENGTH_ZERO_P to true
265 in order to suppress the comparison of the data at the end. */
266 while (TREE_CODE (t1) == ARRAY_TYPE && TREE_CODE (t2) == ARRAY_TYPE)
268 tree lb1 = TYPE_MIN_VALUE (TYPE_DOMAIN (t1));
269 tree ub1 = TYPE_MAX_VALUE (TYPE_DOMAIN (t1));
270 tree lb2 = TYPE_MIN_VALUE (TYPE_DOMAIN (t2));
271 tree ub2 = TYPE_MAX_VALUE (TYPE_DOMAIN (t2));
272 tree length1 = size_binop (PLUS_EXPR, size_binop (MINUS_EXPR, ub1, lb1),
274 tree length2 = size_binop (PLUS_EXPR, size_binop (MINUS_EXPR, ub2, lb2),
276 tree comparison, this_a1_is_null, this_a2_is_null;
278 /* If the length of the first array is a constant, swap our operands
279 unless the length of the second array is the constant zero. */
280 if (TREE_CODE (length1) == INTEGER_CST && !integer_zerop (length2))
285 tem = a1, a1 = a2, a2 = tem;
286 tem = t1, t1 = t2, t2 = tem;
287 tem = lb1, lb1 = lb2, lb2 = tem;
288 tem = ub1, ub1 = ub2, ub2 = tem;
289 tem = length1, length1 = length2, length2 = tem;
290 tem = a1_is_null, a1_is_null = a2_is_null, a2_is_null = tem;
291 btem = a1_side_effects_p, a1_side_effects_p = a2_side_effects_p,
292 a2_side_effects_p = btem;
295 /* If the length of the second array is the constant zero, we can just
296 use the original stored bounds for the first array and see whether
297 last < first holds. */
298 if (integer_zerop (length2))
300 length_zero_p = true;
302 ub1 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t1)));
303 lb1 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t1)));
305 comparison = fold_build2_loc (loc, LT_EXPR, result_type, ub1, lb1);
306 comparison = SUBSTITUTE_PLACEHOLDER_IN_EXPR (comparison, a1);
307 if (EXPR_P (comparison))
308 SET_EXPR_LOCATION (comparison, loc);
310 this_a1_is_null = comparison;
311 this_a2_is_null = convert (result_type, boolean_true_node);
314 /* Otherwise, if the length is some other constant value, we know that
315 this dimension in the second array cannot be superflat, so we can
316 just use its length computed from the actual stored bounds. */
317 else if (TREE_CODE (length2) == INTEGER_CST)
321 ub1 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t1)));
322 lb1 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t1)));
323 /* Note that we know that UB2 and LB2 are constant and hence
324 cannot contain a PLACEHOLDER_EXPR. */
325 ub2 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t2)));
326 lb2 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t2)));
327 bt = get_base_type (TREE_TYPE (ub1));
330 = fold_build2_loc (loc, EQ_EXPR, result_type,
331 build_binary_op (MINUS_EXPR, bt, ub1, lb1),
332 build_binary_op (MINUS_EXPR, bt, ub2, lb2));
333 comparison = SUBSTITUTE_PLACEHOLDER_IN_EXPR (comparison, a1);
334 if (EXPR_P (comparison))
335 SET_EXPR_LOCATION (comparison, loc);
338 = fold_build2_loc (loc, LT_EXPR, result_type, ub1, lb1);
340 this_a2_is_null = convert (result_type, boolean_false_node);
343 /* Otherwise, compare the computed lengths. */
346 length1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (length1, a1);
347 length2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (length2, a2);
350 = fold_build2_loc (loc, EQ_EXPR, result_type, length1, length2);
352 /* If the length expression is of the form (cond ? val : 0), assume
353 that cond is equivalent to (length != 0). That's guaranteed by
354 construction of the array types in gnat_to_gnu_entity. */
355 if (TREE_CODE (length1) == COND_EXPR
356 && integer_zerop (TREE_OPERAND (length1, 2)))
358 = invert_truthvalue_loc (loc, TREE_OPERAND (length1, 0));
360 this_a1_is_null = fold_build2_loc (loc, EQ_EXPR, result_type,
361 length1, size_zero_node);
363 /* Likewise for the second array. */
364 if (TREE_CODE (length2) == COND_EXPR
365 && integer_zerop (TREE_OPERAND (length2, 2)))
367 = invert_truthvalue_loc (loc, TREE_OPERAND (length2, 0));
369 this_a2_is_null = fold_build2_loc (loc, EQ_EXPR, result_type,
370 length2, size_zero_node);
373 /* Append expressions for this dimension to the final expressions. */
374 result = build_binary_op (TRUTH_ANDIF_EXPR, result_type,
377 a1_is_null = build_binary_op (TRUTH_ORIF_EXPR, result_type,
378 this_a1_is_null, a1_is_null);
380 a2_is_null = build_binary_op (TRUTH_ORIF_EXPR, result_type,
381 this_a2_is_null, a2_is_null);
387 /* Unless the length of some dimension is known to be zero, compare the
388 data in the array. */
391 tree type = find_common_type (TREE_TYPE (a1), TREE_TYPE (a2));
396 a1 = convert (type, a1),
397 a2 = convert (type, a2);
400 comparison = fold_build2_loc (loc, EQ_EXPR, result_type, a1, a2);
403 = build_binary_op (TRUTH_ANDIF_EXPR, result_type, result, comparison);
406 /* The result is also true if both sizes are zero. */
407 result = build_binary_op (TRUTH_ORIF_EXPR, result_type,
408 build_binary_op (TRUTH_ANDIF_EXPR, result_type,
409 a1_is_null, a2_is_null),
412 /* If either operand has side-effects, they have to be evaluated before
413 starting the comparison above since the place they would be otherwise
414 evaluated could be wrong. */
415 if (a1_side_effects_p)
416 result = build2 (COMPOUND_EXPR, result_type, a1, result);
418 if (a2_side_effects_p)
419 result = build2 (COMPOUND_EXPR, result_type, a2, result);
424 /* Compute the result of applying OP_CODE to LHS and RHS, where both are of
425 type TYPE. We know that TYPE is a modular type with a nonbinary
429 nonbinary_modular_operation (enum tree_code op_code, tree type, tree lhs,
432 tree modulus = TYPE_MODULUS (type);
433 unsigned int needed_precision = tree_floor_log2 (modulus) + 1;
434 unsigned int precision;
435 bool unsignedp = true;
439 /* If this is an addition of a constant, convert it to a subtraction
440 of a constant since we can do that faster. */
441 if (op_code == PLUS_EXPR && TREE_CODE (rhs) == INTEGER_CST)
443 rhs = fold_build2 (MINUS_EXPR, type, modulus, rhs);
444 op_code = MINUS_EXPR;
447 /* For the logical operations, we only need PRECISION bits. For
448 addition and subtraction, we need one more and for multiplication we
449 need twice as many. But we never want to make a size smaller than
451 if (op_code == PLUS_EXPR || op_code == MINUS_EXPR)
452 needed_precision += 1;
453 else if (op_code == MULT_EXPR)
454 needed_precision *= 2;
456 precision = MAX (needed_precision, TYPE_PRECISION (op_type));
458 /* Unsigned will do for everything but subtraction. */
459 if (op_code == MINUS_EXPR)
462 /* If our type is the wrong signedness or isn't wide enough, make a new
463 type and convert both our operands to it. */
464 if (TYPE_PRECISION (op_type) < precision
465 || TYPE_UNSIGNED (op_type) != unsignedp)
467 /* Copy the node so we ensure it can be modified to make it modular. */
468 op_type = copy_node (gnat_type_for_size (precision, unsignedp));
469 modulus = convert (op_type, modulus);
470 SET_TYPE_MODULUS (op_type, modulus);
471 TYPE_MODULAR_P (op_type) = 1;
472 lhs = convert (op_type, lhs);
473 rhs = convert (op_type, rhs);
476 /* Do the operation, then we'll fix it up. */
477 result = fold_build2 (op_code, op_type, lhs, rhs);
479 /* For multiplication, we have no choice but to do a full modulus
480 operation. However, we want to do this in the narrowest
482 if (op_code == MULT_EXPR)
484 tree div_type = copy_node (gnat_type_for_size (needed_precision, 1));
485 modulus = convert (div_type, modulus);
486 SET_TYPE_MODULUS (div_type, modulus);
487 TYPE_MODULAR_P (div_type) = 1;
488 result = convert (op_type,
489 fold_build2 (TRUNC_MOD_EXPR, div_type,
490 convert (div_type, result), modulus));
493 /* For subtraction, add the modulus back if we are negative. */
494 else if (op_code == MINUS_EXPR)
496 result = gnat_protect_expr (result);
497 result = fold_build3 (COND_EXPR, op_type,
498 fold_build2 (LT_EXPR, boolean_type_node, result,
499 convert (op_type, integer_zero_node)),
500 fold_build2 (PLUS_EXPR, op_type, result, modulus),
504 /* For the other operations, subtract the modulus if we are >= it. */
507 result = gnat_protect_expr (result);
508 result = fold_build3 (COND_EXPR, op_type,
509 fold_build2 (GE_EXPR, boolean_type_node,
511 fold_build2 (MINUS_EXPR, op_type,
516 return convert (type, result);
519 /* Make a binary operation of kind OP_CODE. RESULT_TYPE is the type
520 desired for the result. Usually the operation is to be performed
521 in that type. For MODIFY_EXPR and ARRAY_REF, RESULT_TYPE may be 0
522 in which case the type to be used will be derived from the operands.
524 This function is very much unlike the ones for C and C++ since we
525 have already done any type conversion and matching required. All we
526 have to do here is validate the work done by SEM and handle subtypes. */
529 build_binary_op (enum tree_code op_code, tree result_type,
530 tree left_operand, tree right_operand)
532 tree left_type = TREE_TYPE (left_operand);
533 tree right_type = TREE_TYPE (right_operand);
534 tree left_base_type = get_base_type (left_type);
535 tree right_base_type = get_base_type (right_type);
536 tree operation_type = result_type;
537 tree best_type = NULL_TREE;
538 tree modulus, result;
539 bool has_side_effects = false;
542 && TREE_CODE (operation_type) == RECORD_TYPE
543 && TYPE_JUSTIFIED_MODULAR_P (operation_type))
544 operation_type = TREE_TYPE (TYPE_FIELDS (operation_type));
547 && !AGGREGATE_TYPE_P (operation_type)
548 && TYPE_EXTRA_SUBTYPE_P (operation_type))
549 operation_type = get_base_type (operation_type);
551 modulus = (operation_type
552 && TREE_CODE (operation_type) == INTEGER_TYPE
553 && TYPE_MODULAR_P (operation_type)
554 ? TYPE_MODULUS (operation_type) : NULL_TREE);
560 /* If there were integral or pointer conversions on the LHS, remove
561 them; we'll be putting them back below if needed. Likewise for
562 conversions between array and record types, except for justified
563 modular types. But don't do this if the right operand is not
564 BLKmode (for packed arrays) unless we are not changing the mode. */
565 while ((CONVERT_EXPR_P (left_operand)
566 || TREE_CODE (left_operand) == VIEW_CONVERT_EXPR)
567 && (((INTEGRAL_TYPE_P (left_type)
568 || POINTER_TYPE_P (left_type))
569 && (INTEGRAL_TYPE_P (TREE_TYPE
570 (TREE_OPERAND (left_operand, 0)))
571 || POINTER_TYPE_P (TREE_TYPE
572 (TREE_OPERAND (left_operand, 0)))))
573 || (((TREE_CODE (left_type) == RECORD_TYPE
574 && !TYPE_JUSTIFIED_MODULAR_P (left_type))
575 || TREE_CODE (left_type) == ARRAY_TYPE)
576 && ((TREE_CODE (TREE_TYPE
577 (TREE_OPERAND (left_operand, 0)))
579 || (TREE_CODE (TREE_TYPE
580 (TREE_OPERAND (left_operand, 0)))
582 && (TYPE_MODE (right_type) == BLKmode
583 || (TYPE_MODE (left_type)
584 == TYPE_MODE (TREE_TYPE
586 (left_operand, 0))))))))
588 left_operand = TREE_OPERAND (left_operand, 0);
589 left_type = TREE_TYPE (left_operand);
592 /* If a class-wide type may be involved, force use of the RHS type. */
593 if ((TREE_CODE (right_type) == RECORD_TYPE
594 || TREE_CODE (right_type) == UNION_TYPE)
595 && TYPE_ALIGN_OK (right_type))
596 operation_type = right_type;
598 /* If we are copying between padded objects with compatible types, use
599 the padded view of the objects, this is very likely more efficient.
600 Likewise for a padded object that is assigned a constructor, if we
601 can convert the constructor to the inner type, to avoid putting a
602 VIEW_CONVERT_EXPR on the LHS. But don't do so if we wouldn't have
603 actually copied anything. */
604 else if (TYPE_IS_PADDING_P (left_type)
605 && TREE_CONSTANT (TYPE_SIZE (left_type))
606 && ((TREE_CODE (right_operand) == COMPONENT_REF
608 (TREE_TYPE (TREE_OPERAND (right_operand, 0)))
609 && gnat_types_compatible_p
611 TREE_TYPE (TREE_OPERAND (right_operand, 0))))
612 || (TREE_CODE (right_operand) == CONSTRUCTOR
613 && !CONTAINS_PLACEHOLDER_P
614 (DECL_SIZE (TYPE_FIELDS (left_type)))))
615 && !integer_zerop (TYPE_SIZE (right_type)))
616 operation_type = left_type;
618 /* If we have a call to a function that returns an unconstrained type
619 with default discriminant on the RHS, use the RHS type (which is
620 padded) as we cannot compute the size of the actual assignment. */
621 else if (TREE_CODE (right_operand) == CALL_EXPR
622 && TYPE_IS_PADDING_P (right_type)
623 && CONTAINS_PLACEHOLDER_P
624 (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS (right_type)))))
625 operation_type = right_type;
627 /* Find the best type to use for copying between aggregate types. */
628 else if (((TREE_CODE (left_type) == ARRAY_TYPE
629 && TREE_CODE (right_type) == ARRAY_TYPE)
630 || (TREE_CODE (left_type) == RECORD_TYPE
631 && TREE_CODE (right_type) == RECORD_TYPE))
632 && (best_type = find_common_type (left_type, right_type)))
633 operation_type = best_type;
635 /* Otherwise use the LHS type. */
636 else if (!operation_type)
637 operation_type = left_type;
639 /* Ensure everything on the LHS is valid. If we have a field reference,
640 strip anything that get_inner_reference can handle. Then remove any
641 conversions between types having the same code and mode. And mark
642 VIEW_CONVERT_EXPRs with TREE_ADDRESSABLE. When done, we must have
643 either an INDIRECT_REF, a NULL_EXPR or a DECL node. */
644 result = left_operand;
647 tree restype = TREE_TYPE (result);
649 if (TREE_CODE (result) == COMPONENT_REF
650 || TREE_CODE (result) == ARRAY_REF
651 || TREE_CODE (result) == ARRAY_RANGE_REF)
652 while (handled_component_p (result))
653 result = TREE_OPERAND (result, 0);
654 else if (TREE_CODE (result) == REALPART_EXPR
655 || TREE_CODE (result) == IMAGPART_EXPR
656 || (CONVERT_EXPR_P (result)
657 && (((TREE_CODE (restype)
658 == TREE_CODE (TREE_TYPE
659 (TREE_OPERAND (result, 0))))
660 && (TYPE_MODE (TREE_TYPE
661 (TREE_OPERAND (result, 0)))
662 == TYPE_MODE (restype)))
663 || TYPE_ALIGN_OK (restype))))
664 result = TREE_OPERAND (result, 0);
665 else if (TREE_CODE (result) == VIEW_CONVERT_EXPR)
667 TREE_ADDRESSABLE (result) = 1;
668 result = TREE_OPERAND (result, 0);
674 gcc_assert (TREE_CODE (result) == INDIRECT_REF
675 || TREE_CODE (result) == NULL_EXPR
678 /* Convert the right operand to the operation type unless it is
679 either already of the correct type or if the type involves a
680 placeholder, since the RHS may not have the same record type. */
681 if (operation_type != right_type
682 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (operation_type)))
684 right_operand = convert (operation_type, right_operand);
685 right_type = operation_type;
688 /* If the left operand is not of the same type as the operation
689 type, wrap it up in a VIEW_CONVERT_EXPR. */
690 if (left_type != operation_type)
691 left_operand = unchecked_convert (operation_type, left_operand, false);
693 has_side_effects = true;
699 operation_type = TREE_TYPE (left_type);
701 /* ... fall through ... */
703 case ARRAY_RANGE_REF:
704 /* First look through conversion between type variants. Note that
705 this changes neither the operation type nor the type domain. */
706 if (TREE_CODE (left_operand) == VIEW_CONVERT_EXPR
707 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (left_operand, 0)))
708 == TYPE_MAIN_VARIANT (left_type))
710 left_operand = TREE_OPERAND (left_operand, 0);
711 left_type = TREE_TYPE (left_operand);
714 /* For a range, make sure the element type is consistent. */
715 if (op_code == ARRAY_RANGE_REF
716 && TREE_TYPE (operation_type) != TREE_TYPE (left_type))
717 operation_type = build_array_type (TREE_TYPE (left_type),
718 TYPE_DOMAIN (operation_type));
720 /* Then convert the right operand to its base type. This will prevent
721 unneeded sign conversions when sizetype is wider than integer. */
722 right_operand = convert (right_base_type, right_operand);
723 right_operand = convert (sizetype, right_operand);
727 case TRUTH_ANDIF_EXPR:
728 case TRUTH_ORIF_EXPR:
732 #ifdef ENABLE_CHECKING
733 gcc_assert (TREE_CODE (get_base_type (result_type)) == BOOLEAN_TYPE);
735 operation_type = left_base_type;
736 left_operand = convert (operation_type, left_operand);
737 right_operand = convert (operation_type, right_operand);
746 #ifdef ENABLE_CHECKING
747 gcc_assert (TREE_CODE (get_base_type (result_type)) == BOOLEAN_TYPE);
749 /* If either operand is a NULL_EXPR, just return a new one. */
750 if (TREE_CODE (left_operand) == NULL_EXPR)
751 return build2 (op_code, result_type,
752 build1 (NULL_EXPR, integer_type_node,
753 TREE_OPERAND (left_operand, 0)),
756 else if (TREE_CODE (right_operand) == NULL_EXPR)
757 return build2 (op_code, result_type,
758 build1 (NULL_EXPR, integer_type_node,
759 TREE_OPERAND (right_operand, 0)),
762 /* If either object is a justified modular types, get the
763 fields from within. */
764 if (TREE_CODE (left_type) == RECORD_TYPE
765 && TYPE_JUSTIFIED_MODULAR_P (left_type))
767 left_operand = convert (TREE_TYPE (TYPE_FIELDS (left_type)),
769 left_type = TREE_TYPE (left_operand);
770 left_base_type = get_base_type (left_type);
773 if (TREE_CODE (right_type) == RECORD_TYPE
774 && TYPE_JUSTIFIED_MODULAR_P (right_type))
776 right_operand = convert (TREE_TYPE (TYPE_FIELDS (right_type)),
778 right_type = TREE_TYPE (right_operand);
779 right_base_type = get_base_type (right_type);
782 /* If both objects are arrays, compare them specially. */
783 if ((TREE_CODE (left_type) == ARRAY_TYPE
784 || (TREE_CODE (left_type) == INTEGER_TYPE
785 && TYPE_HAS_ACTUAL_BOUNDS_P (left_type)))
786 && (TREE_CODE (right_type) == ARRAY_TYPE
787 || (TREE_CODE (right_type) == INTEGER_TYPE
788 && TYPE_HAS_ACTUAL_BOUNDS_P (right_type))))
790 result = compare_arrays (input_location,
791 result_type, left_operand, right_operand);
792 if (op_code == NE_EXPR)
793 result = invert_truthvalue_loc (EXPR_LOCATION (result), result);
795 gcc_assert (op_code == EQ_EXPR);
800 /* Otherwise, the base types must be the same, unless they are both fat
801 pointer types or record types. In the latter case, use the best type
802 and convert both operands to that type. */
803 if (left_base_type != right_base_type)
805 if (TYPE_IS_FAT_POINTER_P (left_base_type)
806 && TYPE_IS_FAT_POINTER_P (right_base_type))
808 gcc_assert (TYPE_MAIN_VARIANT (left_base_type)
809 == TYPE_MAIN_VARIANT (right_base_type));
810 best_type = left_base_type;
813 else if (TREE_CODE (left_base_type) == RECORD_TYPE
814 && TREE_CODE (right_base_type) == RECORD_TYPE)
816 /* The only way this is permitted is if both types have the same
817 name. In that case, one of them must not be self-referential.
818 Use it as the best type. Even better with a fixed size. */
819 gcc_assert (TYPE_NAME (left_base_type)
820 && TYPE_NAME (left_base_type)
821 == TYPE_NAME (right_base_type));
823 if (TREE_CONSTANT (TYPE_SIZE (left_base_type)))
824 best_type = left_base_type;
825 else if (TREE_CONSTANT (TYPE_SIZE (right_base_type)))
826 best_type = right_base_type;
827 else if (!CONTAINS_PLACEHOLDER_P (TYPE_SIZE (left_base_type)))
828 best_type = left_base_type;
829 else if (!CONTAINS_PLACEHOLDER_P (TYPE_SIZE (right_base_type)))
830 best_type = right_base_type;
838 left_operand = convert (best_type, left_operand);
839 right_operand = convert (best_type, right_operand);
843 left_operand = convert (left_base_type, left_operand);
844 right_operand = convert (right_base_type, right_operand);
847 /* If we are comparing a fat pointer against zero, we just need to
848 compare the data pointer. */
849 if (TYPE_IS_FAT_POINTER_P (left_base_type)
850 && TREE_CODE (right_operand) == CONSTRUCTOR
851 && integer_zerop (VEC_index (constructor_elt,
852 CONSTRUCTOR_ELTS (right_operand),
856 = build_component_ref (left_operand, NULL_TREE,
857 TYPE_FIELDS (left_base_type), false);
859 = convert (TREE_TYPE (left_operand), integer_zero_node);
869 /* The RHS of a shift can be any type. Also, ignore any modulus
870 (we used to abort, but this is needed for unchecked conversion
871 to modular types). Otherwise, processing is the same as normal. */
872 gcc_assert (operation_type == left_base_type);
874 left_operand = convert (operation_type, left_operand);
880 /* For binary modulus, if the inputs are in range, so are the
882 if (modulus && integer_pow2p (modulus))
887 gcc_assert (TREE_TYPE (result_type) == left_base_type
888 && TREE_TYPE (result_type) == right_base_type);
889 left_operand = convert (left_base_type, left_operand);
890 right_operand = convert (right_base_type, right_operand);
893 case TRUNC_DIV_EXPR: case TRUNC_MOD_EXPR:
894 case CEIL_DIV_EXPR: case CEIL_MOD_EXPR:
895 case FLOOR_DIV_EXPR: case FLOOR_MOD_EXPR:
896 case ROUND_DIV_EXPR: case ROUND_MOD_EXPR:
897 /* These always produce results lower than either operand. */
901 case POINTER_PLUS_EXPR:
902 gcc_assert (operation_type == left_base_type
903 && sizetype == right_base_type);
904 left_operand = convert (operation_type, left_operand);
905 right_operand = convert (sizetype, right_operand);
908 case PLUS_NOMOD_EXPR:
909 case MINUS_NOMOD_EXPR:
910 if (op_code == PLUS_NOMOD_EXPR)
913 op_code = MINUS_EXPR;
916 /* ... fall through ... */
920 /* Avoid doing arithmetics in ENUMERAL_TYPE or BOOLEAN_TYPE like the
921 other compilers. Contrary to C, Ada doesn't allow arithmetics in
922 these types but can generate addition/subtraction for Succ/Pred. */
924 && (TREE_CODE (operation_type) == ENUMERAL_TYPE
925 || TREE_CODE (operation_type) == BOOLEAN_TYPE))
926 operation_type = left_base_type = right_base_type
927 = gnat_type_for_mode (TYPE_MODE (operation_type),
928 TYPE_UNSIGNED (operation_type));
930 /* ... fall through ... */
934 /* The result type should be the same as the base types of the
935 both operands (and they should be the same). Convert
936 everything to the result type. */
938 gcc_assert (operation_type == left_base_type
939 && left_base_type == right_base_type);
940 left_operand = convert (operation_type, left_operand);
941 right_operand = convert (operation_type, right_operand);
944 if (modulus && !integer_pow2p (modulus))
946 result = nonbinary_modular_operation (op_code, operation_type,
947 left_operand, right_operand);
950 /* If either operand is a NULL_EXPR, just return a new one. */
951 else if (TREE_CODE (left_operand) == NULL_EXPR)
952 return build1 (NULL_EXPR, operation_type, TREE_OPERAND (left_operand, 0));
953 else if (TREE_CODE (right_operand) == NULL_EXPR)
954 return build1 (NULL_EXPR, operation_type, TREE_OPERAND (right_operand, 0));
955 else if (op_code == ARRAY_REF || op_code == ARRAY_RANGE_REF)
956 result = fold (build4 (op_code, operation_type, left_operand,
957 right_operand, NULL_TREE, NULL_TREE));
960 = fold_build2 (op_code, operation_type, left_operand, right_operand);
962 if (TREE_CONSTANT (result))
964 else if (op_code == ARRAY_REF || op_code == ARRAY_RANGE_REF)
966 TREE_THIS_NOTRAP (result) = 1;
967 if (TYPE_VOLATILE (operation_type))
968 TREE_THIS_VOLATILE (result) = 1;
971 TREE_CONSTANT (result)
972 |= (TREE_CONSTANT (left_operand) && TREE_CONSTANT (right_operand));
974 TREE_SIDE_EFFECTS (result) |= has_side_effects;
976 /* If we are working with modular types, perform the MOD operation
977 if something above hasn't eliminated the need for it. */
979 result = fold_build2 (FLOOR_MOD_EXPR, operation_type, result,
980 convert (operation_type, modulus));
982 if (result_type && result_type != operation_type)
983 result = convert (result_type, result);
988 /* Similar, but for unary operations. */
991 build_unary_op (enum tree_code op_code, tree result_type, tree operand)
993 tree type = TREE_TYPE (operand);
994 tree base_type = get_base_type (type);
995 tree operation_type = result_type;
997 bool side_effects = false;
1000 && TREE_CODE (operation_type) == RECORD_TYPE
1001 && TYPE_JUSTIFIED_MODULAR_P (operation_type))
1002 operation_type = TREE_TYPE (TYPE_FIELDS (operation_type));
1005 && !AGGREGATE_TYPE_P (operation_type)
1006 && TYPE_EXTRA_SUBTYPE_P (operation_type))
1007 operation_type = get_base_type (operation_type);
1013 if (!operation_type)
1014 result_type = operation_type = TREE_TYPE (type);
1016 gcc_assert (result_type == TREE_TYPE (type));
1018 result = fold_build1 (op_code, operation_type, operand);
1021 case TRUTH_NOT_EXPR:
1022 #ifdef ENABLE_CHECKING
1023 gcc_assert (TREE_CODE (get_base_type (result_type)) == BOOLEAN_TYPE);
1025 result = invert_truthvalue_loc (EXPR_LOCATION (operand), operand);
1026 /* When not optimizing, fold the result as invert_truthvalue_loc
1027 doesn't fold the result of comparisons. This is intended to undo
1028 the trick used for boolean rvalues in gnat_to_gnu. */
1030 result = fold (result);
1033 case ATTR_ADDR_EXPR:
1035 switch (TREE_CODE (operand))
1038 case UNCONSTRAINED_ARRAY_REF:
1039 result = TREE_OPERAND (operand, 0);
1041 /* Make sure the type here is a pointer, not a reference.
1042 GCC wants pointer types for function addresses. */
1044 result_type = build_pointer_type (type);
1046 /* If the underlying object can alias everything, propagate the
1047 property since we are effectively retrieving the object. */
1048 if (POINTER_TYPE_P (TREE_TYPE (result))
1049 && TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (result)))
1051 if (TREE_CODE (result_type) == POINTER_TYPE
1052 && !TYPE_REF_CAN_ALIAS_ALL (result_type))
1054 = build_pointer_type_for_mode (TREE_TYPE (result_type),
1055 TYPE_MODE (result_type),
1057 else if (TREE_CODE (result_type) == REFERENCE_TYPE
1058 && !TYPE_REF_CAN_ALIAS_ALL (result_type))
1060 = build_reference_type_for_mode (TREE_TYPE (result_type),
1061 TYPE_MODE (result_type),
1068 TREE_TYPE (result) = type = build_pointer_type (type);
1072 /* Fold a compound expression if it has unconstrained array type
1073 since the middle-end cannot handle it. But we don't it in the
1074 general case because it may introduce aliasing issues if the
1075 first operand is an indirect assignment and the second operand
1076 the corresponding address, e.g. for an allocator. */
1077 if (TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE)
1079 result = build_unary_op (ADDR_EXPR, result_type,
1080 TREE_OPERAND (operand, 1));
1081 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
1082 TREE_OPERAND (operand, 0), result);
1088 case ARRAY_RANGE_REF:
1091 /* If this is for 'Address, find the address of the prefix and add
1092 the offset to the field. Otherwise, do this the normal way. */
1093 if (op_code == ATTR_ADDR_EXPR)
1095 HOST_WIDE_INT bitsize;
1096 HOST_WIDE_INT bitpos;
1098 enum machine_mode mode;
1099 int unsignedp, volatilep;
1101 inner = get_inner_reference (operand, &bitsize, &bitpos, &offset,
1102 &mode, &unsignedp, &volatilep,
1105 /* If INNER is a padding type whose field has a self-referential
1106 size, convert to that inner type. We know the offset is zero
1107 and we need to have that type visible. */
1108 if (TYPE_IS_PADDING_P (TREE_TYPE (inner))
1109 && CONTAINS_PLACEHOLDER_P
1110 (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
1111 (TREE_TYPE (inner))))))
1112 inner = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (inner))),
1115 /* Compute the offset as a byte offset from INNER. */
1117 offset = size_zero_node;
1119 offset = size_binop (PLUS_EXPR, offset,
1120 size_int (bitpos / BITS_PER_UNIT));
1122 /* Take the address of INNER, convert the offset to void *, and
1123 add then. It will later be converted to the desired result
1125 inner = build_unary_op (ADDR_EXPR, NULL_TREE, inner);
1126 inner = convert (ptr_void_type_node, inner);
1127 result = build_binary_op (POINTER_PLUS_EXPR, ptr_void_type_node,
1129 result = convert (build_pointer_type (TREE_TYPE (operand)),
1136 /* If this is just a constructor for a padded record, we can
1137 just take the address of the single field and convert it to
1138 a pointer to our type. */
1139 if (TYPE_IS_PADDING_P (type))
1141 result = VEC_index (constructor_elt,
1142 CONSTRUCTOR_ELTS (operand),
1144 result = convert (build_pointer_type (TREE_TYPE (operand)),
1145 build_unary_op (ADDR_EXPR, NULL_TREE, result));
1152 if (AGGREGATE_TYPE_P (type)
1153 && AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (operand, 0))))
1154 return build_unary_op (ADDR_EXPR, result_type,
1155 TREE_OPERAND (operand, 0));
1157 /* ... fallthru ... */
1159 case VIEW_CONVERT_EXPR:
1160 /* If this just a variant conversion or if the conversion doesn't
1161 change the mode, get the result type from this type and go down.
1162 This is needed for conversions of CONST_DECLs, to eventually get
1163 to the address of their CORRESPONDING_VARs. */
1164 if ((TYPE_MAIN_VARIANT (type)
1165 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (operand, 0))))
1166 || (TYPE_MODE (type) != BLKmode
1167 && (TYPE_MODE (type)
1168 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (operand, 0))))))
1169 return build_unary_op (ADDR_EXPR,
1170 (result_type ? result_type
1171 : build_pointer_type (type)),
1172 TREE_OPERAND (operand, 0));
1176 operand = DECL_CONST_CORRESPONDING_VAR (operand);
1178 /* ... fall through ... */
1183 /* If we are taking the address of a padded record whose field is
1184 contains a template, take the address of the template. */
1185 if (TYPE_IS_PADDING_P (type)
1186 && TREE_CODE (TREE_TYPE (TYPE_FIELDS (type))) == RECORD_TYPE
1187 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (TYPE_FIELDS (type))))
1189 type = TREE_TYPE (TYPE_FIELDS (type));
1190 operand = convert (type, operand);
1193 gnat_mark_addressable (operand);
1194 result = build_fold_addr_expr (operand);
1197 TREE_CONSTANT (result) = staticp (operand) || TREE_CONSTANT (operand);
1201 /* If we want to refer to an unconstrained array, use the appropriate
1202 expression to do so. This will never survive down to the back-end.
1203 But if TYPE is a thin pointer, first convert to a fat pointer. */
1204 if (TYPE_IS_THIN_POINTER_P (type)
1205 && TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (type)))
1208 = convert (TREE_TYPE (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (type))),
1210 type = TREE_TYPE (operand);
1213 if (TYPE_IS_FAT_POINTER_P (type))
1215 result = build1 (UNCONSTRAINED_ARRAY_REF,
1216 TYPE_UNCONSTRAINED_ARRAY (type), operand);
1217 TREE_READONLY (result)
1218 = TYPE_READONLY (TYPE_UNCONSTRAINED_ARRAY (type));
1221 /* If we are dereferencing an ADDR_EXPR, return its operand. */
1222 else if (TREE_CODE (operand) == ADDR_EXPR)
1223 result = TREE_OPERAND (operand, 0);
1225 /* Otherwise, build and fold the indirect reference. */
1228 result = build_fold_indirect_ref (operand);
1229 TREE_READONLY (result) = TYPE_READONLY (TREE_TYPE (type));
1233 = (!TYPE_IS_FAT_POINTER_P (type) && TYPE_VOLATILE (TREE_TYPE (type)));
1239 tree modulus = ((operation_type
1240 && TREE_CODE (operation_type) == INTEGER_TYPE
1241 && TYPE_MODULAR_P (operation_type))
1242 ? TYPE_MODULUS (operation_type) : NULL_TREE);
1243 int mod_pow2 = modulus && integer_pow2p (modulus);
1245 /* If this is a modular type, there are various possibilities
1246 depending on the operation and whether the modulus is a
1247 power of two or not. */
1251 gcc_assert (operation_type == base_type);
1252 operand = convert (operation_type, operand);
1254 /* The fastest in the negate case for binary modulus is
1255 the straightforward code; the TRUNC_MOD_EXPR below
1256 is an AND operation. */
1257 if (op_code == NEGATE_EXPR && mod_pow2)
1258 result = fold_build2 (TRUNC_MOD_EXPR, operation_type,
1259 fold_build1 (NEGATE_EXPR, operation_type,
1263 /* For nonbinary negate case, return zero for zero operand,
1264 else return the modulus minus the operand. If the modulus
1265 is a power of two minus one, we can do the subtraction
1266 as an XOR since it is equivalent and faster on most machines. */
1267 else if (op_code == NEGATE_EXPR && !mod_pow2)
1269 if (integer_pow2p (fold_build2 (PLUS_EXPR, operation_type,
1271 convert (operation_type,
1272 integer_one_node))))
1273 result = fold_build2 (BIT_XOR_EXPR, operation_type,
1276 result = fold_build2 (MINUS_EXPR, operation_type,
1279 result = fold_build3 (COND_EXPR, operation_type,
1280 fold_build2 (NE_EXPR,
1285 integer_zero_node)),
1290 /* For the NOT cases, we need a constant equal to
1291 the modulus minus one. For a binary modulus, we
1292 XOR against the constant and subtract the operand from
1293 that constant for nonbinary modulus. */
1295 tree cnst = fold_build2 (MINUS_EXPR, operation_type, modulus,
1296 convert (operation_type,
1300 result = fold_build2 (BIT_XOR_EXPR, operation_type,
1303 result = fold_build2 (MINUS_EXPR, operation_type,
1311 /* ... fall through ... */
1314 gcc_assert (operation_type == base_type);
1315 result = fold_build1 (op_code, operation_type,
1316 convert (operation_type, operand));
1321 TREE_SIDE_EFFECTS (result) = 1;
1322 if (TREE_CODE (result) == INDIRECT_REF)
1323 TREE_THIS_VOLATILE (result) = TYPE_VOLATILE (TREE_TYPE (result));
1326 if (result_type && TREE_TYPE (result) != result_type)
1327 result = convert (result_type, result);
1332 /* Similar, but for COND_EXPR. */
1335 build_cond_expr (tree result_type, tree condition_operand,
1336 tree true_operand, tree false_operand)
1338 bool addr_p = false;
1341 /* The front-end verified that result, true and false operands have
1342 same base type. Convert everything to the result type. */
1343 true_operand = convert (result_type, true_operand);
1344 false_operand = convert (result_type, false_operand);
1346 /* If the result type is unconstrained, take the address of the operands and
1347 then dereference the result. Likewise if the result type is passed by
1348 reference, but this is natively handled in the gimplifier. */
1349 if (TREE_CODE (result_type) == UNCONSTRAINED_ARRAY_TYPE
1350 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (result_type)))
1352 result_type = build_pointer_type (result_type);
1353 true_operand = build_unary_op (ADDR_EXPR, result_type, true_operand);
1354 false_operand = build_unary_op (ADDR_EXPR, result_type, false_operand);
1358 result = fold_build3 (COND_EXPR, result_type, condition_operand,
1359 true_operand, false_operand);
1361 /* If we have a common SAVE_EXPR (possibly surrounded by arithmetics)
1362 in both arms, make sure it gets evaluated by moving it ahead of the
1363 conditional expression. This is necessary because it is evaluated
1364 in only one place at run time and would otherwise be uninitialized
1365 in one of the arms. */
1366 true_operand = skip_simple_arithmetic (true_operand);
1367 false_operand = skip_simple_arithmetic (false_operand);
1369 if (true_operand == false_operand && TREE_CODE (true_operand) == SAVE_EXPR)
1370 result = build2 (COMPOUND_EXPR, result_type, true_operand, result);
1373 result = build_unary_op (INDIRECT_REF, NULL_TREE, result);
1378 /* Similar, but for COMPOUND_EXPR. */
1381 build_compound_expr (tree result_type, tree stmt_operand, tree expr_operand)
1383 bool addr_p = false;
1386 /* If the result type is unconstrained, take the address of the operand and
1387 then dereference the result. Likewise if the result type is passed by
1388 reference, but this is natively handled in the gimplifier. */
1389 if (TREE_CODE (result_type) == UNCONSTRAINED_ARRAY_TYPE
1390 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (result_type)))
1392 result_type = build_pointer_type (result_type);
1393 expr_operand = build_unary_op (ADDR_EXPR, result_type, expr_operand);
1397 result = fold_build2 (COMPOUND_EXPR, result_type, stmt_operand,
1401 result = build_unary_op (INDIRECT_REF, NULL_TREE, result);
1406 /* Build a CALL_EXPR to call FUNDECL with one argument, ARG. Return
1410 build_call_1_expr (tree fundecl, tree arg)
1412 tree call = build_call_nary (TREE_TYPE (TREE_TYPE (fundecl)),
1413 build_unary_op (ADDR_EXPR, NULL_TREE, fundecl),
1415 TREE_SIDE_EFFECTS (call) = 1;
1419 /* Build a CALL_EXPR to call FUNDECL with two arguments, ARG1 & ARG2. Return
1423 build_call_2_expr (tree fundecl, tree arg1, tree arg2)
1425 tree call = build_call_nary (TREE_TYPE (TREE_TYPE (fundecl)),
1426 build_unary_op (ADDR_EXPR, NULL_TREE, fundecl),
1428 TREE_SIDE_EFFECTS (call) = 1;
1432 /* Likewise to call FUNDECL with no arguments. */
1435 build_call_0_expr (tree fundecl)
1437 /* We rely on build_call_nary to compute TREE_SIDE_EFFECTS. This makes
1438 it possible to propagate DECL_IS_PURE on parameterless functions. */
1439 tree call = build_call_nary (TREE_TYPE (TREE_TYPE (fundecl)),
1440 build_unary_op (ADDR_EXPR, NULL_TREE, fundecl),
1445 /* Call a function that raises an exception and pass the line number and file
1446 name, if requested. MSG says which exception function to call.
1448 GNAT_NODE is the gnat node conveying the source location for which the
1449 error should be signaled, or Empty in which case the error is signaled on
1450 the current ref_file_name/input_line.
1452 KIND says which kind of exception this is for
1453 (N_Raise_{Constraint,Storage,Program}_Error). */
1456 build_call_raise (int msg, Node_Id gnat_node, char kind)
1458 tree fndecl = gnat_raise_decls[msg];
1459 tree label = get_exception_label (kind);
1465 /* If this is to be done as a goto, handle that case. */
1468 Entity_Id local_raise = Get_Local_Raise_Call_Entity ();
1469 tree gnu_result = build1 (GOTO_EXPR, void_type_node, label);
1471 /* If Local_Raise is present, generate
1472 Local_Raise (exception'Identity); */
1473 if (Present (local_raise))
1475 tree gnu_local_raise
1476 = gnat_to_gnu_entity (local_raise, NULL_TREE, 0);
1477 tree gnu_exception_entity
1478 = gnat_to_gnu_entity (Get_RT_Exception_Entity (msg), NULL_TREE, 0);
1480 = build_call_1_expr (gnu_local_raise,
1481 build_unary_op (ADDR_EXPR, NULL_TREE,
1482 gnu_exception_entity));
1484 gnu_result = build2 (COMPOUND_EXPR, void_type_node,
1485 gnu_call, gnu_result);}
1491 = (Debug_Flag_NN || Exception_Locations_Suppressed)
1493 : (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1494 ? IDENTIFIER_POINTER
1495 (get_identifier (Get_Name_String
1497 (Get_Source_File_Index (Sloc (gnat_node))))))
1501 filename = build_string (len, str);
1503 = (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1504 ? Get_Logical_Line_Number (Sloc(gnat_node)) : input_line;
1506 TREE_TYPE (filename) = build_array_type (unsigned_char_type_node,
1507 build_index_type (size_int (len)));
1510 build_call_2_expr (fndecl,
1512 build_pointer_type (unsigned_char_type_node),
1514 build_int_cst (NULL_TREE, line_number));
1517 /* Similar to build_call_raise, for an index or range check exception as
1518 determined by MSG, with extra information generated of the form
1519 "INDEX out of range FIRST..LAST". */
1522 build_call_raise_range (int msg, Node_Id gnat_node,
1523 tree index, tree first, tree last)
1526 tree fndecl = gnat_raise_decls_ext[msg];
1528 int line_number, column_number;
1533 = (Debug_Flag_NN || Exception_Locations_Suppressed)
1535 : (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1536 ? IDENTIFIER_POINTER
1537 (get_identifier (Get_Name_String
1539 (Get_Source_File_Index (Sloc (gnat_node))))))
1543 filename = build_string (len, str);
1544 if (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1546 line_number = Get_Logical_Line_Number (Sloc (gnat_node));
1547 column_number = Get_Column_Number (Sloc (gnat_node));
1551 line_number = input_line;
1555 TREE_TYPE (filename) = build_array_type (unsigned_char_type_node,
1556 build_index_type (size_int (len)));
1558 call = build_call_nary (TREE_TYPE (TREE_TYPE (fndecl)),
1559 build_unary_op (ADDR_EXPR, NULL_TREE, fndecl),
1562 build_pointer_type (unsigned_char_type_node),
1564 build_int_cst (NULL_TREE, line_number),
1565 build_int_cst (NULL_TREE, column_number),
1566 convert (integer_type_node, index),
1567 convert (integer_type_node, first),
1568 convert (integer_type_node, last));
1569 TREE_SIDE_EFFECTS (call) = 1;
1573 /* Similar to build_call_raise, with extra information about the column
1574 where the check failed. */
1577 build_call_raise_column (int msg, Node_Id gnat_node)
1579 tree fndecl = gnat_raise_decls_ext[msg];
1582 int line_number, column_number;
1587 = (Debug_Flag_NN || Exception_Locations_Suppressed)
1589 : (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1590 ? IDENTIFIER_POINTER
1591 (get_identifier (Get_Name_String
1593 (Get_Source_File_Index (Sloc (gnat_node))))))
1597 filename = build_string (len, str);
1598 if (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1600 line_number = Get_Logical_Line_Number (Sloc (gnat_node));
1601 column_number = Get_Column_Number (Sloc (gnat_node));
1605 line_number = input_line;
1609 TREE_TYPE (filename) = build_array_type (unsigned_char_type_node,
1610 build_index_type (size_int (len)));
1612 call = build_call_nary (TREE_TYPE (TREE_TYPE (fndecl)),
1613 build_unary_op (ADDR_EXPR, NULL_TREE, fndecl),
1616 build_pointer_type (unsigned_char_type_node),
1618 build_int_cst (NULL_TREE, line_number),
1619 build_int_cst (NULL_TREE, column_number));
1620 TREE_SIDE_EFFECTS (call) = 1;
1624 /* qsort comparer for the bit positions of two constructor elements
1625 for record components. */
1628 compare_elmt_bitpos (const PTR rt1, const PTR rt2)
1630 const constructor_elt * const elmt1 = (const constructor_elt * const) rt1;
1631 const constructor_elt * const elmt2 = (const constructor_elt * const) rt2;
1632 const_tree const field1 = elmt1->index;
1633 const_tree const field2 = elmt2->index;
1635 = tree_int_cst_compare (bit_position (field1), bit_position (field2));
1637 return ret ? ret : (int) (DECL_UID (field1) - DECL_UID (field2));
1640 /* Return a CONSTRUCTOR of TYPE whose elements are V. */
1643 gnat_build_constructor (tree type, VEC(constructor_elt,gc) *v)
1645 bool allconstant = (TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST);
1646 bool side_effects = false;
1647 tree result, obj, val;
1648 unsigned int n_elmts;
1650 /* Scan the elements to see if they are all constant or if any has side
1651 effects, to let us set global flags on the resulting constructor. Count
1652 the elements along the way for possible sorting purposes below. */
1653 FOR_EACH_CONSTRUCTOR_ELT (v, n_elmts, obj, val)
1655 /* The predicate must be in keeping with output_constructor. */
1656 if (!TREE_CONSTANT (val)
1657 || (TREE_CODE (type) == RECORD_TYPE
1658 && CONSTRUCTOR_BITFIELD_P (obj)
1659 && !initializer_constant_valid_for_bitfield_p (val))
1660 || !initializer_constant_valid_p (val, TREE_TYPE (val)))
1661 allconstant = false;
1663 if (TREE_SIDE_EFFECTS (val))
1664 side_effects = true;
1667 /* For record types with constant components only, sort field list
1668 by increasing bit position. This is necessary to ensure the
1669 constructor can be output as static data. */
1670 if (allconstant && TREE_CODE (type) == RECORD_TYPE && n_elmts > 1)
1671 VEC_qsort (constructor_elt, v, compare_elmt_bitpos);
1673 result = build_constructor (type, v);
1674 TREE_CONSTANT (result) = TREE_STATIC (result) = allconstant;
1675 TREE_SIDE_EFFECTS (result) = side_effects;
1676 TREE_READONLY (result) = TYPE_READONLY (type) || allconstant;
1680 /* Return a COMPONENT_REF to access a field that is given by COMPONENT,
1681 an IDENTIFIER_NODE giving the name of the field, or FIELD, a FIELD_DECL,
1682 for the field. Don't fold the result if NO_FOLD_P is true.
1684 We also handle the fact that we might have been passed a pointer to the
1685 actual record and know how to look for fields in variant parts. */
1688 build_simple_component_ref (tree record_variable, tree component,
1689 tree field, bool no_fold_p)
1691 tree record_type = TYPE_MAIN_VARIANT (TREE_TYPE (record_variable));
1692 tree ref, inner_variable;
1694 gcc_assert ((TREE_CODE (record_type) == RECORD_TYPE
1695 || TREE_CODE (record_type) == UNION_TYPE
1696 || TREE_CODE (record_type) == QUAL_UNION_TYPE)
1697 && TYPE_SIZE (record_type)
1698 && (component != 0) != (field != 0));
1700 /* If no field was specified, look for a field with the specified name
1701 in the current record only. */
1703 for (field = TYPE_FIELDS (record_type); field;
1704 field = TREE_CHAIN (field))
1705 if (DECL_NAME (field) == component)
1711 /* If this field is not in the specified record, see if we can find a field
1712 in the specified record whose original field is the same as this one. */
1713 if (DECL_CONTEXT (field) != record_type)
1717 /* First loop thru normal components. */
1718 for (new_field = TYPE_FIELDS (record_type); new_field;
1719 new_field = DECL_CHAIN (new_field))
1720 if (SAME_FIELD_P (field, new_field))
1723 /* Next, see if we're looking for an inherited component in an extension.
1724 If so, look thru the extension directly. */
1726 && TREE_CODE (record_variable) == VIEW_CONVERT_EXPR
1727 && TYPE_ALIGN_OK (record_type)
1728 && TREE_CODE (TREE_TYPE (TREE_OPERAND (record_variable, 0)))
1730 && TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (record_variable, 0))))
1732 ref = build_simple_component_ref (TREE_OPERAND (record_variable, 0),
1733 NULL_TREE, field, no_fold_p);
1738 /* Next, loop thru DECL_INTERNAL_P components if we haven't found
1739 the component in the first search. Doing this search in 2 steps
1740 is required to avoiding hidden homonymous fields in the
1743 for (new_field = TYPE_FIELDS (record_type); new_field;
1744 new_field = DECL_CHAIN (new_field))
1745 if (DECL_INTERNAL_P (new_field))
1748 = build_simple_component_ref (record_variable,
1749 NULL_TREE, new_field, no_fold_p);
1750 ref = build_simple_component_ref (field_ref, NULL_TREE, field,
1763 /* If the field's offset has overflowed, do not attempt to access it
1764 as doing so may trigger sanity checks deeper in the back-end.
1765 Note that we don't need to warn since this will be done on trying
1766 to declare the object. */
1767 if (TREE_CODE (DECL_FIELD_OFFSET (field)) == INTEGER_CST
1768 && TREE_OVERFLOW (DECL_FIELD_OFFSET (field)))
1771 /* Look through conversion between type variants. Note that this
1772 is transparent as far as the field is concerned. */
1773 if (TREE_CODE (record_variable) == VIEW_CONVERT_EXPR
1774 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (record_variable, 0)))
1776 inner_variable = TREE_OPERAND (record_variable, 0);
1778 inner_variable = record_variable;
1780 ref = build3 (COMPONENT_REF, TREE_TYPE (field), inner_variable, field,
1783 if (TREE_READONLY (record_variable) || TREE_READONLY (field))
1784 TREE_READONLY (ref) = 1;
1785 if (TREE_THIS_VOLATILE (record_variable) || TREE_THIS_VOLATILE (field)
1786 || TYPE_VOLATILE (record_type))
1787 TREE_THIS_VOLATILE (ref) = 1;
1792 /* The generic folder may punt in this case because the inner array type
1793 can be self-referential, but folding is in fact not problematic. */
1794 else if (TREE_CODE (record_variable) == CONSTRUCTOR
1795 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (record_variable)))
1797 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (record_variable);
1798 unsigned HOST_WIDE_INT idx;
1800 FOR_EACH_CONSTRUCTOR_ELT (elts, idx, index, value)
1810 /* Like build_simple_component_ref, except that we give an error if the
1811 reference could not be found. */
1814 build_component_ref (tree record_variable, tree component,
1815 tree field, bool no_fold_p)
1817 tree ref = build_simple_component_ref (record_variable, component, field,
1823 /* If FIELD was specified, assume this is an invalid user field so raise
1824 Constraint_Error. Otherwise, we have no type to return so abort. */
1826 return build1 (NULL_EXPR, TREE_TYPE (field),
1827 build_call_raise (CE_Discriminant_Check_Failed, Empty,
1828 N_Raise_Constraint_Error));
1831 /* Helper for build_call_alloc_dealloc, with arguments to be interpreted
1832 identically. Process the case where a GNAT_PROC to call is provided. */
1835 build_call_alloc_dealloc_proc (tree gnu_obj, tree gnu_size, tree gnu_type,
1836 Entity_Id gnat_proc, Entity_Id gnat_pool)
1838 tree gnu_proc = gnat_to_gnu (gnat_proc);
1839 tree gnu_proc_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_proc);
1842 /* The storage pools are obviously always tagged types, but the
1843 secondary stack uses the same mechanism and is not tagged. */
1844 if (Is_Tagged_Type (Etype (gnat_pool)))
1846 /* The size is the third parameter; the alignment is the
1848 Entity_Id gnat_size_type
1849 = Etype (Next_Formal (Next_Formal (First_Formal (gnat_proc))));
1850 tree gnu_size_type = gnat_to_gnu_type (gnat_size_type);
1852 tree gnu_pool = gnat_to_gnu (gnat_pool);
1853 tree gnu_pool_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_pool);
1854 tree gnu_align = size_int (TYPE_ALIGN (gnu_type) / BITS_PER_UNIT);
1856 gnu_size = convert (gnu_size_type, gnu_size);
1857 gnu_align = convert (gnu_size_type, gnu_align);
1859 /* The first arg is always the address of the storage pool; next
1860 comes the address of the object, for a deallocator, then the
1861 size and alignment. */
1863 gnu_call = build_call_nary (TREE_TYPE (TREE_TYPE (gnu_proc)),
1864 gnu_proc_addr, 4, gnu_pool_addr,
1865 gnu_obj, gnu_size, gnu_align);
1867 gnu_call = build_call_nary (TREE_TYPE (TREE_TYPE (gnu_proc)),
1868 gnu_proc_addr, 3, gnu_pool_addr,
1869 gnu_size, gnu_align);
1872 /* Secondary stack case. */
1875 /* The size is the second parameter. */
1876 Entity_Id gnat_size_type
1877 = Etype (Next_Formal (First_Formal (gnat_proc)));
1878 tree gnu_size_type = gnat_to_gnu_type (gnat_size_type);
1880 gnu_size = convert (gnu_size_type, gnu_size);
1882 /* The first arg is the address of the object, for a deallocator,
1885 gnu_call = build_call_nary (TREE_TYPE (TREE_TYPE (gnu_proc)),
1886 gnu_proc_addr, 2, gnu_obj, gnu_size);
1888 gnu_call = build_call_nary (TREE_TYPE (TREE_TYPE (gnu_proc)),
1889 gnu_proc_addr, 1, gnu_size);
1892 TREE_SIDE_EFFECTS (gnu_call) = 1;
1896 /* Helper for build_call_alloc_dealloc, to build and return an allocator for
1897 DATA_SIZE bytes aimed at containing a DATA_TYPE object, using the default
1898 __gnat_malloc allocator. Honor DATA_TYPE alignments greater than what the
1902 maybe_wrap_malloc (tree data_size, tree data_type, Node_Id gnat_node)
1904 /* When the DATA_TYPE alignment is stricter than what malloc offers
1905 (super-aligned case), we allocate an "aligning" wrapper type and return
1906 the address of its single data field with the malloc's return value
1907 stored just in front. */
1909 unsigned int data_align = TYPE_ALIGN (data_type);
1910 unsigned int system_allocator_alignment
1911 = get_target_system_allocator_alignment () * BITS_PER_UNIT;
1914 = ((data_align > system_allocator_alignment)
1915 ? make_aligning_type (data_type, data_align, data_size,
1916 system_allocator_alignment,
1917 POINTER_SIZE / BITS_PER_UNIT)
1921 = aligning_type ? TYPE_SIZE_UNIT (aligning_type) : data_size;
1925 /* On VMS, if pointers are 64-bit and the allocator size is 32-bit or
1926 Convention C, allocate 32-bit memory. */
1927 if (TARGET_ABI_OPEN_VMS
1928 && POINTER_SIZE == 64
1929 && Nkind (gnat_node) == N_Allocator
1930 && (UI_To_Int (Esize (Etype (gnat_node))) == 32
1931 || Convention (Etype (gnat_node)) == Convention_C))
1932 malloc_ptr = build_call_1_expr (malloc32_decl, size_to_malloc);
1934 malloc_ptr = build_call_1_expr (malloc_decl, size_to_malloc);
1938 /* Latch malloc's return value and get a pointer to the aligning field
1940 tree storage_ptr = gnat_protect_expr (malloc_ptr);
1942 tree aligning_record_addr
1943 = convert (build_pointer_type (aligning_type), storage_ptr);
1945 tree aligning_record
1946 = build_unary_op (INDIRECT_REF, NULL_TREE, aligning_record_addr);
1949 = build_component_ref (aligning_record, NULL_TREE,
1950 TYPE_FIELDS (aligning_type), false);
1952 tree aligning_field_addr
1953 = build_unary_op (ADDR_EXPR, NULL_TREE, aligning_field);
1955 /* Then arrange to store the allocator's return value ahead
1957 tree storage_ptr_slot_addr
1958 = build_binary_op (POINTER_PLUS_EXPR, ptr_void_type_node,
1959 convert (ptr_void_type_node, aligning_field_addr),
1960 size_int (-(HOST_WIDE_INT) POINTER_SIZE
1963 tree storage_ptr_slot
1964 = build_unary_op (INDIRECT_REF, NULL_TREE,
1965 convert (build_pointer_type (ptr_void_type_node),
1966 storage_ptr_slot_addr));
1969 build2 (COMPOUND_EXPR, TREE_TYPE (aligning_field_addr),
1970 build_binary_op (MODIFY_EXPR, NULL_TREE,
1971 storage_ptr_slot, storage_ptr),
1972 aligning_field_addr);
1978 /* Helper for build_call_alloc_dealloc, to release a DATA_TYPE object
1979 designated by DATA_PTR using the __gnat_free entry point. */
1982 maybe_wrap_free (tree data_ptr, tree data_type)
1984 /* In the regular alignment case, we pass the data pointer straight to free.
1985 In the superaligned case, we need to retrieve the initial allocator
1986 return value, stored in front of the data block at allocation time. */
1988 unsigned int data_align = TYPE_ALIGN (data_type);
1989 unsigned int system_allocator_alignment
1990 = get_target_system_allocator_alignment () * BITS_PER_UNIT;
1994 if (data_align > system_allocator_alignment)
1996 /* DATA_FRONT_PTR (void *)
1997 = (void *)DATA_PTR - (void *)sizeof (void *)) */
2000 (POINTER_PLUS_EXPR, ptr_void_type_node,
2001 convert (ptr_void_type_node, data_ptr),
2002 size_int (-(HOST_WIDE_INT) POINTER_SIZE / BITS_PER_UNIT));
2004 /* FREE_PTR (void *) = *(void **)DATA_FRONT_PTR */
2007 (INDIRECT_REF, NULL_TREE,
2008 convert (build_pointer_type (ptr_void_type_node), data_front_ptr));
2011 free_ptr = data_ptr;
2013 return build_call_1_expr (free_decl, free_ptr);
2016 /* Build a GCC tree to call an allocation or deallocation function.
2017 If GNU_OBJ is nonzero, it is an object to deallocate. Otherwise,
2018 generate an allocator.
2020 GNU_SIZE is the number of bytes to allocate and GNU_TYPE is the contained
2021 object type, used to determine the to-be-honored address alignment.
2022 GNAT_PROC, if present, is a procedure to call and GNAT_POOL is the storage
2023 pool to use. If not present, malloc and free are used. GNAT_NODE is used
2024 to provide an error location for restriction violation messages. */
2027 build_call_alloc_dealloc (tree gnu_obj, tree gnu_size, tree gnu_type,
2028 Entity_Id gnat_proc, Entity_Id gnat_pool,
2031 gnu_size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_size, gnu_obj);
2033 /* Explicit proc to call ? This one is assumed to deal with the type
2034 alignment constraints. */
2035 if (Present (gnat_proc))
2036 return build_call_alloc_dealloc_proc (gnu_obj, gnu_size, gnu_type,
2037 gnat_proc, gnat_pool);
2039 /* Otherwise, object to "free" or "malloc" with possible special processing
2040 for alignments stricter than what the default allocator honors. */
2042 return maybe_wrap_free (gnu_obj, gnu_type);
2045 /* Assert that we no longer can be called with this special pool. */
2046 gcc_assert (gnat_pool != -1);
2048 /* Check that we aren't violating the associated restriction. */
2049 if (!(Nkind (gnat_node) == N_Allocator && Comes_From_Source (gnat_node)))
2050 Check_No_Implicit_Heap_Alloc (gnat_node);
2052 return maybe_wrap_malloc (gnu_size, gnu_type, gnat_node);
2056 /* Build a GCC tree to correspond to allocating an object of TYPE whose
2057 initial value is INIT, if INIT is nonzero. Convert the expression to
2058 RESULT_TYPE, which must be some type of pointer. Return the tree.
2060 GNAT_PROC and GNAT_POOL optionally give the procedure to call and
2061 the storage pool to use. GNAT_NODE is used to provide an error
2062 location for restriction violation messages. If IGNORE_INIT_TYPE is
2063 true, ignore the type of INIT for the purpose of determining the size;
2064 this will cause the maximum size to be allocated if TYPE is of
2065 self-referential size. */
2068 build_allocator (tree type, tree init, tree result_type, Entity_Id gnat_proc,
2069 Entity_Id gnat_pool, Node_Id gnat_node, bool ignore_init_type)
2071 tree size = TYPE_SIZE_UNIT (type);
2074 /* If the initializer, if present, is a NULL_EXPR, just return a new one. */
2075 if (init && TREE_CODE (init) == NULL_EXPR)
2076 return build1 (NULL_EXPR, result_type, TREE_OPERAND (init, 0));
2078 /* If RESULT_TYPE is a fat or thin pointer, set SIZE to be the sum of the
2079 sizes of the object and its template. Allocate the whole thing and
2080 fill in the parts that are known. */
2081 else if (TYPE_IS_FAT_OR_THIN_POINTER_P (result_type))
2084 = build_unc_object_type_from_ptr (result_type, type,
2085 get_identifier ("ALLOC"), false);
2086 tree template_type = TREE_TYPE (TYPE_FIELDS (storage_type));
2087 tree storage_ptr_type = build_pointer_type (storage_type);
2090 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (storage_type),
2093 /* If the size overflows, pass -1 so the allocator will raise
2095 if (TREE_CODE (size) == INTEGER_CST && TREE_OVERFLOW (size))
2096 size = ssize_int (-1);
2098 storage = build_call_alloc_dealloc (NULL_TREE, size, storage_type,
2099 gnat_proc, gnat_pool, gnat_node);
2100 storage = convert (storage_ptr_type, gnat_protect_expr (storage));
2102 /* If there is an initializing expression, then make a constructor for
2103 the entire object including the bounds and copy it into the object.
2104 If there is no initializing expression, just set the bounds. */
2107 VEC(constructor_elt,gc) *v = VEC_alloc (constructor_elt, gc, 2);
2109 CONSTRUCTOR_APPEND_ELT (v, TYPE_FIELDS (storage_type),
2110 build_template (template_type, type, init));
2111 CONSTRUCTOR_APPEND_ELT (v, DECL_CHAIN (TYPE_FIELDS (storage_type)),
2115 build2 (COMPOUND_EXPR, storage_ptr_type,
2117 (MODIFY_EXPR, storage_type,
2118 build_unary_op (INDIRECT_REF, NULL_TREE,
2119 convert (storage_ptr_type, storage)),
2120 gnat_build_constructor (storage_type, v)),
2121 convert (storage_ptr_type, storage)));
2125 (COMPOUND_EXPR, result_type,
2127 (MODIFY_EXPR, template_type,
2129 (build_unary_op (INDIRECT_REF, NULL_TREE,
2130 convert (storage_ptr_type, storage)),
2131 NULL_TREE, TYPE_FIELDS (storage_type), false),
2132 build_template (template_type, type, NULL_TREE)),
2133 convert (result_type, convert (storage_ptr_type, storage)));
2136 /* If we have an initializing expression, see if its size is simpler
2137 than the size from the type. */
2138 if (!ignore_init_type && init && TYPE_SIZE_UNIT (TREE_TYPE (init))
2139 && (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (init))) == INTEGER_CST
2140 || CONTAINS_PLACEHOLDER_P (size)))
2141 size = TYPE_SIZE_UNIT (TREE_TYPE (init));
2143 /* If the size is still self-referential, reference the initializing
2144 expression, if it is present. If not, this must have been a
2145 call to allocate a library-level object, in which case we use
2146 the maximum size. */
2147 if (CONTAINS_PLACEHOLDER_P (size))
2149 if (!ignore_init_type && init)
2150 size = substitute_placeholder_in_expr (size, init);
2152 size = max_size (size, true);
2155 /* If the size overflows, pass -1 so the allocator will raise
2157 if (TREE_CODE (size) == INTEGER_CST && TREE_OVERFLOW (size))
2158 size = ssize_int (-1);
2160 result = convert (result_type,
2161 build_call_alloc_dealloc (NULL_TREE, size, type,
2162 gnat_proc, gnat_pool,
2165 /* If we have an initial value, protect the new address, assign the value
2166 and return the address with a COMPOUND_EXPR. */
2169 result = gnat_protect_expr (result);
2171 = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2173 (MODIFY_EXPR, NULL_TREE,
2174 build_unary_op (INDIRECT_REF,
2175 TREE_TYPE (TREE_TYPE (result)), result),
2180 return convert (result_type, result);
2183 /* Indicate that we need to take the address of T and that it therefore
2184 should not be allocated in a register. Returns true if successful. */
2187 gnat_mark_addressable (tree t)
2190 switch (TREE_CODE (t))
2195 case ARRAY_RANGE_REF:
2198 case VIEW_CONVERT_EXPR:
2199 case NON_LVALUE_EXPR:
2201 t = TREE_OPERAND (t, 0);
2205 t = TREE_OPERAND (t, 1);
2209 TREE_ADDRESSABLE (t) = 1;
2215 TREE_ADDRESSABLE (t) = 1;
2219 TREE_ADDRESSABLE (t) = 1;
2223 return DECL_CONST_CORRESPONDING_VAR (t)
2224 && gnat_mark_addressable (DECL_CONST_CORRESPONDING_VAR (t));
2231 /* Save EXP for later use or reuse. This is equivalent to save_expr in tree.c
2232 but we know how to handle our own nodes. */
2235 gnat_save_expr (tree exp)
2237 tree type = TREE_TYPE (exp);
2238 enum tree_code code = TREE_CODE (exp);
2240 if (TREE_CONSTANT (exp) || code == SAVE_EXPR || code == NULL_EXPR)
2243 if (code == UNCONSTRAINED_ARRAY_REF)
2245 tree t = build1 (code, type, gnat_save_expr (TREE_OPERAND (exp, 0)));
2246 TREE_READONLY (t) = TYPE_READONLY (type);
2250 /* If this is a COMPONENT_REF of a fat pointer, save the entire fat pointer.
2251 This may be more efficient, but will also allow us to more easily find
2252 the match for the PLACEHOLDER_EXPR. */
2253 if (code == COMPONENT_REF
2254 && TYPE_IS_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
2255 return build3 (code, type, gnat_save_expr (TREE_OPERAND (exp, 0)),
2256 TREE_OPERAND (exp, 1), TREE_OPERAND (exp, 2));
2258 return save_expr (exp);
2261 /* Protect EXP for immediate reuse. This is a variant of gnat_save_expr that
2262 is optimized under the assumption that EXP's value doesn't change before
2263 its subsequent reuse(s) except through its potential reevaluation. */
2266 gnat_protect_expr (tree exp)
2268 tree type = TREE_TYPE (exp);
2269 enum tree_code code = TREE_CODE (exp);
2271 if (TREE_CONSTANT (exp) || code == SAVE_EXPR || code == NULL_EXPR)
2274 /* If EXP has no side effects, we theoretically don't need to do anything.
2275 However, we may be recursively passed more and more complex expressions
2276 involving checks which will be reused multiple times and eventually be
2277 unshared for gimplification; in order to avoid a complexity explosion
2278 at that point, we protect any expressions more complex than a simple
2279 arithmetic expression. */
2280 if (!TREE_SIDE_EFFECTS (exp))
2282 tree inner = skip_simple_arithmetic (exp);
2283 if (!EXPR_P (inner) || REFERENCE_CLASS_P (inner))
2287 /* If this is a conversion, protect what's inside the conversion. */
2288 if (code == NON_LVALUE_EXPR
2289 || CONVERT_EXPR_CODE_P (code)
2290 || code == VIEW_CONVERT_EXPR)
2291 return build1 (code, type, gnat_protect_expr (TREE_OPERAND (exp, 0)));
2293 /* If we're indirectly referencing something, we only need to protect the
2294 address since the data itself can't change in these situations. */
2295 if (code == INDIRECT_REF || code == UNCONSTRAINED_ARRAY_REF)
2297 tree t = build1 (code, type, gnat_protect_expr (TREE_OPERAND (exp, 0)));
2298 TREE_READONLY (t) = TYPE_READONLY (type);
2302 /* If this is a COMPONENT_REF of a fat pointer, save the entire fat pointer.
2303 This may be more efficient, but will also allow us to more easily find
2304 the match for the PLACEHOLDER_EXPR. */
2305 if (code == COMPONENT_REF
2306 && TYPE_IS_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
2307 return build3 (code, type, gnat_protect_expr (TREE_OPERAND (exp, 0)),
2308 TREE_OPERAND (exp, 1), TREE_OPERAND (exp, 2));
2310 /* If this is a fat pointer or something that can be placed in a register,
2311 just make a SAVE_EXPR. Likewise for a CALL_EXPR as large objects are
2312 returned via invisible reference in most ABIs so the temporary will
2313 directly be filled by the callee. */
2314 if (TYPE_IS_FAT_POINTER_P (type)
2315 || TYPE_MODE (type) != BLKmode
2316 || code == CALL_EXPR)
2317 return save_expr (exp);
2319 /* Otherwise reference, protect the address and dereference. */
2321 build_unary_op (INDIRECT_REF, type,
2322 save_expr (build_unary_op (ADDR_EXPR,
2323 build_reference_type (type),
2327 /* This is equivalent to stabilize_reference_1 in tree.c but we take an extra
2328 argument to force evaluation of everything. */
2331 gnat_stabilize_reference_1 (tree e, bool force)
2333 enum tree_code code = TREE_CODE (e);
2334 tree type = TREE_TYPE (e);
2337 /* We cannot ignore const expressions because it might be a reference
2338 to a const array but whose index contains side-effects. But we can
2339 ignore things that are actual constant or that already have been
2340 handled by this function. */
2341 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2344 switch (TREE_CODE_CLASS (code))
2346 case tcc_exceptional:
2347 case tcc_declaration:
2348 case tcc_comparison:
2349 case tcc_expression:
2352 /* If this is a COMPONENT_REF of a fat pointer, save the entire
2353 fat pointer. This may be more efficient, but will also allow
2354 us to more easily find the match for the PLACEHOLDER_EXPR. */
2355 if (code == COMPONENT_REF
2356 && TYPE_IS_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
2358 = build3 (code, type,
2359 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
2360 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
2361 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2362 so that it will only be evaluated once. */
2363 /* The tcc_reference and tcc_comparison classes could be handled as
2364 below, but it is generally faster to only evaluate them once. */
2365 else if (TREE_SIDE_EFFECTS (e) || force)
2366 return save_expr (e);
2372 /* Recursively stabilize each operand. */
2374 = build2 (code, type,
2375 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
2376 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1), force));
2380 /* Recursively stabilize each operand. */
2382 = build1 (code, type,
2383 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force));
2390 /* See similar handling in gnat_stabilize_reference. */
2391 TREE_READONLY (result) = TREE_READONLY (e);
2392 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
2393 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2395 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
2396 TREE_THIS_NOTRAP (result) = TREE_THIS_NOTRAP (e);
2401 /* This is equivalent to stabilize_reference in tree.c but we know how to
2402 handle our own nodes and we take extra arguments. FORCE says whether to
2403 force evaluation of everything. We set SUCCESS to true unless we walk
2404 through something we don't know how to stabilize. */
2407 gnat_stabilize_reference (tree ref, bool force, bool *success)
2409 tree type = TREE_TYPE (ref);
2410 enum tree_code code = TREE_CODE (ref);
2413 /* Assume we'll success unless proven otherwise. */
2423 /* No action is needed in this case. */
2429 case FIX_TRUNC_EXPR:
2430 case VIEW_CONVERT_EXPR:
2432 = build1 (code, type,
2433 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2438 case UNCONSTRAINED_ARRAY_REF:
2439 result = build1 (code, type,
2440 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
2445 result = build3 (COMPONENT_REF, type,
2446 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2448 TREE_OPERAND (ref, 1), NULL_TREE);
2452 result = build3 (BIT_FIELD_REF, type,
2453 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2455 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
2457 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
2462 case ARRAY_RANGE_REF:
2463 result = build4 (code, type,
2464 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2466 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
2468 NULL_TREE, NULL_TREE);
2472 result = gnat_stabilize_reference_1 (ref, force);
2476 result = build2 (COMPOUND_EXPR, type,
2477 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2479 gnat_stabilize_reference (TREE_OPERAND (ref, 1), force,
2484 /* Constructors with 1 element are used extensively to formally
2485 convert objects to special wrapping types. */
2486 if (TREE_CODE (type) == RECORD_TYPE
2487 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
2490 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
2492 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
2494 = build_constructor_single (type, index,
2495 gnat_stabilize_reference_1 (value,
2507 ref = error_mark_node;
2509 /* ... fall through to failure ... */
2511 /* If arg isn't a kind of lvalue we recognize, make no change.
2512 Caller should recognize the error for an invalid lvalue. */
2519 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS set on the initial expression
2520 may not be sustained across some paths, such as the way via build1 for
2521 INDIRECT_REF. We reset those flags here in the general case, which is
2522 consistent with the GCC version of this routine.
2524 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
2525 paths introduce side-effects where there was none initially (e.g. if a
2526 SAVE_EXPR is built) and we also want to keep track of that. */
2527 TREE_READONLY (result) = TREE_READONLY (ref);
2528 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
2529 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2531 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
2532 TREE_THIS_NOTRAP (result) = TREE_THIS_NOTRAP (ref);