1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2010, 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 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 prevent writing more than what the target may hold if this is for
197 an assignment and the case of tagged types is handled in build_binary_op
198 so use the lhs type if it is known to be smaller, or of constant size and
199 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 assignments. */
202 if (TREE_CONSTANT (TYPE_SIZE (t1))
203 && (!TREE_CONSTANT (TYPE_SIZE (t2))
204 || !tree_int_cst_lt (TYPE_SIZE (t2), TYPE_SIZE (t1))))
207 /* Otherwise, if the lhs type is non-BLKmode, use it. Note that we know
208 that we will not have any alignment problems since, if we did, the
209 non-BLKmode type could not have been used. */
210 if (TYPE_MODE (t1) != BLKmode)
213 /* If the rhs type is of constant size, use it whatever the modes. At
214 this point it is known to be smaller, or of constant size and the
216 if (TREE_CONSTANT (TYPE_SIZE (t2)))
219 /* Otherwise, if the rhs type is non-BLKmode, use it. */
220 if (TYPE_MODE (t2) != BLKmode)
223 /* In this case, both types have variable size and BLKmode. It's
224 probably best to leave the "type mismatch" because changing it
225 could cause a bad self-referential reference. */
229 /* Return an expression tree representing an equality comparison of A1 and A2,
230 two objects of type ARRAY_TYPE. The result should be of type RESULT_TYPE.
232 Two arrays are equal in one of two ways: (1) if both have zero length in
233 some dimension (not necessarily the same dimension) or (2) if the lengths
234 in each dimension are equal and the data is equal. We perform the length
235 tests in as efficient a manner as possible. */
238 compare_arrays (tree result_type, tree a1, tree a2)
240 tree result = convert (result_type, boolean_true_node);
241 tree a1_is_null = convert (result_type, boolean_false_node);
242 tree a2_is_null = convert (result_type, boolean_false_node);
243 tree t1 = TREE_TYPE (a1);
244 tree t2 = TREE_TYPE (a2);
245 bool a1_side_effects_p = TREE_SIDE_EFFECTS (a1);
246 bool a2_side_effects_p = TREE_SIDE_EFFECTS (a2);
247 bool length_zero_p = false;
249 /* If either operand has side-effects, they have to be evaluated only once
250 in spite of the multiple references to the operand in the comparison. */
251 if (a1_side_effects_p)
252 a1 = gnat_protect_expr (a1);
254 if (a2_side_effects_p)
255 a2 = gnat_protect_expr (a2);
257 /* Process each dimension separately and compare the lengths. If any
258 dimension has a length known to be zero, set LENGTH_ZERO_P to true
259 in order to suppress the comparison of the data at the end. */
260 while (TREE_CODE (t1) == ARRAY_TYPE && TREE_CODE (t2) == ARRAY_TYPE)
262 tree lb1 = TYPE_MIN_VALUE (TYPE_DOMAIN (t1));
263 tree ub1 = TYPE_MAX_VALUE (TYPE_DOMAIN (t1));
264 tree lb2 = TYPE_MIN_VALUE (TYPE_DOMAIN (t2));
265 tree ub2 = TYPE_MAX_VALUE (TYPE_DOMAIN (t2));
266 tree length1 = size_binop (PLUS_EXPR, size_binop (MINUS_EXPR, ub1, lb1),
268 tree length2 = size_binop (PLUS_EXPR, size_binop (MINUS_EXPR, ub2, lb2),
270 tree comparison, this_a1_is_null, this_a2_is_null;
272 /* If the length of the first array is a constant, swap our operands
273 unless the length of the second array is the constant zero. */
274 if (TREE_CODE (length1) == INTEGER_CST && !integer_zerop (length2))
279 tem = a1, a1 = a2, a2 = tem;
280 tem = t1, t1 = t2, t2 = tem;
281 tem = lb1, lb1 = lb2, lb2 = tem;
282 tem = ub1, ub1 = ub2, ub2 = tem;
283 tem = length1, length1 = length2, length2 = tem;
284 tem = a1_is_null, a1_is_null = a2_is_null, a2_is_null = tem;
285 btem = a1_side_effects_p, a1_side_effects_p = a2_side_effects_p,
286 a2_side_effects_p = btem;
289 /* If the length of the second array is the constant zero, we can just
290 use the original stored bounds for the first array and see whether
291 last < first holds. */
292 if (integer_zerop (length2))
294 length_zero_p = true;
296 ub1 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t1)));
297 lb1 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t1)));
299 comparison = build_binary_op (LT_EXPR, result_type, ub1, lb1);
300 comparison = SUBSTITUTE_PLACEHOLDER_IN_EXPR (comparison, a1);
301 if (EXPR_P (comparison))
302 SET_EXPR_LOCATION (comparison, input_location);
304 this_a1_is_null = comparison;
305 this_a2_is_null = convert (result_type, boolean_true_node);
308 /* Otherwise, if the length is some other constant value, we know that
309 this dimension in the second array cannot be superflat, so we can
310 just use its length computed from the actual stored bounds. */
311 else if (TREE_CODE (length2) == INTEGER_CST)
315 ub1 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t1)));
316 lb1 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t1)));
317 /* Note that we know that UB2 and LB2 are constant and hence
318 cannot contain a PLACEHOLDER_EXPR. */
319 ub2 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t2)));
320 lb2 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (t2)));
321 bt = get_base_type (TREE_TYPE (ub1));
324 = build_binary_op (EQ_EXPR, result_type,
325 build_binary_op (MINUS_EXPR, bt, ub1, lb1),
326 build_binary_op (MINUS_EXPR, bt, ub2, lb2));
327 comparison = SUBSTITUTE_PLACEHOLDER_IN_EXPR (comparison, a1);
328 if (EXPR_P (comparison))
329 SET_EXPR_LOCATION (comparison, input_location);
331 this_a1_is_null = build_binary_op (LT_EXPR, result_type, ub1, lb1);
332 if (EXPR_P (this_a1_is_null))
333 SET_EXPR_LOCATION (this_a1_is_null, input_location);
335 this_a2_is_null = convert (result_type, boolean_false_node);
338 /* Otherwise, compare the computed lengths. */
341 length1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (length1, a1);
342 length2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (length2, a2);
345 = build_binary_op (EQ_EXPR, result_type, length1, length2);
346 if (EXPR_P (comparison))
347 SET_EXPR_LOCATION (comparison, input_location);
349 /* If the length expression is of the form (cond ? val : 0), assume
350 that cond is equivalent to (length != 0). That's guaranteed by
351 construction of the array types in gnat_to_gnu_entity. */
352 if (TREE_CODE (length1) == COND_EXPR
353 && integer_zerop (TREE_OPERAND (length1, 2)))
354 this_a1_is_null = invert_truthvalue (TREE_OPERAND (length1, 0));
356 this_a1_is_null = build_binary_op (EQ_EXPR, result_type, length1,
358 if (EXPR_P (this_a1_is_null))
359 SET_EXPR_LOCATION (this_a1_is_null, input_location);
361 /* Likewise for the second array. */
362 if (TREE_CODE (length2) == COND_EXPR
363 && integer_zerop (TREE_OPERAND (length2, 2)))
364 this_a2_is_null = invert_truthvalue (TREE_OPERAND (length2, 0));
366 this_a2_is_null = build_binary_op (EQ_EXPR, result_type, length2,
368 if (EXPR_P (this_a2_is_null))
369 SET_EXPR_LOCATION (this_a2_is_null, input_location);
372 /* Append expressions for this dimension to the final expressions. */
373 result = build_binary_op (TRUTH_ANDIF_EXPR, result_type,
376 a1_is_null = build_binary_op (TRUTH_ORIF_EXPR, result_type,
377 this_a1_is_null, a1_is_null);
379 a2_is_null = build_binary_op (TRUTH_ORIF_EXPR, result_type,
380 this_a2_is_null, a2_is_null);
386 /* Unless the length of some dimension is known to be zero, compare the
387 data in the array. */
390 tree type = find_common_type (TREE_TYPE (a1), TREE_TYPE (a2));
395 a1 = convert (type, a1),
396 a2 = convert (type, a2);
399 comparison = fold_build2 (EQ_EXPR, result_type, a1, a2);
400 if (EXPR_P (comparison))
401 SET_EXPR_LOCATION (comparison, input_location);
404 = build_binary_op (TRUTH_ANDIF_EXPR, result_type, result, comparison);
407 /* The result is also true if both sizes are zero. */
408 result = build_binary_op (TRUTH_ORIF_EXPR, result_type,
409 build_binary_op (TRUTH_ANDIF_EXPR, result_type,
410 a1_is_null, a2_is_null),
413 /* If either operand has side-effects, they have to be evaluated before
414 starting the comparison above since the place they would be otherwise
415 evaluated could be wrong. */
416 if (a1_side_effects_p)
417 result = build2 (COMPOUND_EXPR, result_type, a1, result);
419 if (a2_side_effects_p)
420 result = build2 (COMPOUND_EXPR, result_type, a2, result);
425 /* Compute the result of applying OP_CODE to LHS and RHS, where both are of
426 type TYPE. We know that TYPE is a modular type with a nonbinary
430 nonbinary_modular_operation (enum tree_code op_code, tree type, tree lhs,
433 tree modulus = TYPE_MODULUS (type);
434 unsigned int needed_precision = tree_floor_log2 (modulus) + 1;
435 unsigned int precision;
436 bool unsignedp = true;
440 /* If this is an addition of a constant, convert it to a subtraction
441 of a constant since we can do that faster. */
442 if (op_code == PLUS_EXPR && TREE_CODE (rhs) == INTEGER_CST)
444 rhs = fold_build2 (MINUS_EXPR, type, modulus, rhs);
445 op_code = MINUS_EXPR;
448 /* For the logical operations, we only need PRECISION bits. For
449 addition and subtraction, we need one more and for multiplication we
450 need twice as many. But we never want to make a size smaller than
452 if (op_code == PLUS_EXPR || op_code == MINUS_EXPR)
453 needed_precision += 1;
454 else if (op_code == MULT_EXPR)
455 needed_precision *= 2;
457 precision = MAX (needed_precision, TYPE_PRECISION (op_type));
459 /* Unsigned will do for everything but subtraction. */
460 if (op_code == MINUS_EXPR)
463 /* If our type is the wrong signedness or isn't wide enough, make a new
464 type and convert both our operands to it. */
465 if (TYPE_PRECISION (op_type) < precision
466 || TYPE_UNSIGNED (op_type) != unsignedp)
468 /* Copy the node so we ensure it can be modified to make it modular. */
469 op_type = copy_node (gnat_type_for_size (precision, unsignedp));
470 modulus = convert (op_type, modulus);
471 SET_TYPE_MODULUS (op_type, modulus);
472 TYPE_MODULAR_P (op_type) = 1;
473 lhs = convert (op_type, lhs);
474 rhs = convert (op_type, rhs);
477 /* Do the operation, then we'll fix it up. */
478 result = fold_build2 (op_code, op_type, lhs, rhs);
480 /* For multiplication, we have no choice but to do a full modulus
481 operation. However, we want to do this in the narrowest
483 if (op_code == MULT_EXPR)
485 tree div_type = copy_node (gnat_type_for_size (needed_precision, 1));
486 modulus = convert (div_type, modulus);
487 SET_TYPE_MODULUS (div_type, modulus);
488 TYPE_MODULAR_P (div_type) = 1;
489 result = convert (op_type,
490 fold_build2 (TRUNC_MOD_EXPR, div_type,
491 convert (div_type, result), modulus));
494 /* For subtraction, add the modulus back if we are negative. */
495 else if (op_code == MINUS_EXPR)
497 result = gnat_protect_expr (result);
498 result = fold_build3 (COND_EXPR, op_type,
499 fold_build2 (LT_EXPR, boolean_type_node, result,
500 convert (op_type, integer_zero_node)),
501 fold_build2 (PLUS_EXPR, op_type, result, modulus),
505 /* For the other operations, subtract the modulus if we are >= it. */
508 result = gnat_protect_expr (result);
509 result = fold_build3 (COND_EXPR, op_type,
510 fold_build2 (GE_EXPR, boolean_type_node,
512 fold_build2 (MINUS_EXPR, op_type,
517 return convert (type, result);
520 /* Make a binary operation of kind OP_CODE. RESULT_TYPE is the type
521 desired for the result. Usually the operation is to be performed
522 in that type. For MODIFY_EXPR and ARRAY_REF, RESULT_TYPE may be 0
523 in which case the type to be used will be derived from the operands.
525 This function is very much unlike the ones for C and C++ since we
526 have already done any type conversion and matching required. All we
527 have to do here is validate the work done by SEM and handle subtypes. */
530 build_binary_op (enum tree_code op_code, tree result_type,
531 tree left_operand, tree right_operand)
533 tree left_type = TREE_TYPE (left_operand);
534 tree right_type = TREE_TYPE (right_operand);
535 tree left_base_type = get_base_type (left_type);
536 tree right_base_type = get_base_type (right_type);
537 tree operation_type = result_type;
538 tree best_type = NULL_TREE;
539 tree modulus, result;
540 bool has_side_effects = false;
543 && TREE_CODE (operation_type) == RECORD_TYPE
544 && TYPE_JUSTIFIED_MODULAR_P (operation_type))
545 operation_type = TREE_TYPE (TYPE_FIELDS (operation_type));
548 && !AGGREGATE_TYPE_P (operation_type)
549 && TYPE_EXTRA_SUBTYPE_P (operation_type))
550 operation_type = get_base_type (operation_type);
552 modulus = (operation_type
553 && TREE_CODE (operation_type) == INTEGER_TYPE
554 && TYPE_MODULAR_P (operation_type)
555 ? TYPE_MODULUS (operation_type) : NULL_TREE);
561 /* If there were integral or pointer conversions on the LHS, remove
562 them; we'll be putting them back below if needed. Likewise for
563 conversions between array and record types, except for justified
564 modular types. But don't do this if the right operand is not
565 BLKmode (for packed arrays) unless we are not changing the mode. */
566 while ((CONVERT_EXPR_P (left_operand)
567 || TREE_CODE (left_operand) == VIEW_CONVERT_EXPR)
568 && (((INTEGRAL_TYPE_P (left_type)
569 || POINTER_TYPE_P (left_type))
570 && (INTEGRAL_TYPE_P (TREE_TYPE
571 (TREE_OPERAND (left_operand, 0)))
572 || POINTER_TYPE_P (TREE_TYPE
573 (TREE_OPERAND (left_operand, 0)))))
574 || (((TREE_CODE (left_type) == RECORD_TYPE
575 && !TYPE_JUSTIFIED_MODULAR_P (left_type))
576 || TREE_CODE (left_type) == ARRAY_TYPE)
577 && ((TREE_CODE (TREE_TYPE
578 (TREE_OPERAND (left_operand, 0)))
580 || (TREE_CODE (TREE_TYPE
581 (TREE_OPERAND (left_operand, 0)))
583 && (TYPE_MODE (right_type) == BLKmode
584 || (TYPE_MODE (left_type)
585 == TYPE_MODE (TREE_TYPE
587 (left_operand, 0))))))))
589 left_operand = TREE_OPERAND (left_operand, 0);
590 left_type = TREE_TYPE (left_operand);
593 /* If a class-wide type may be involved, force use of the RHS type. */
594 if ((TREE_CODE (right_type) == RECORD_TYPE
595 || TREE_CODE (right_type) == UNION_TYPE)
596 && TYPE_ALIGN_OK (right_type))
597 operation_type = right_type;
599 /* If we are copying between padded objects with compatible types, use
600 the padded view of the objects, this is very likely more efficient.
601 Likewise for a padded object that is assigned a constructor, if we
602 can convert the constructor to the inner type, to avoid putting a
603 VIEW_CONVERT_EXPR on the LHS. But don't do so if we wouldn't have
604 actually copied anything. */
605 else if (TYPE_IS_PADDING_P (left_type)
606 && TREE_CONSTANT (TYPE_SIZE (left_type))
607 && ((TREE_CODE (right_operand) == COMPONENT_REF
609 (TREE_TYPE (TREE_OPERAND (right_operand, 0)))
610 && gnat_types_compatible_p
612 TREE_TYPE (TREE_OPERAND (right_operand, 0))))
613 || (TREE_CODE (right_operand) == CONSTRUCTOR
614 && !CONTAINS_PLACEHOLDER_P
615 (DECL_SIZE (TYPE_FIELDS (left_type)))))
616 && !integer_zerop (TYPE_SIZE (right_type)))
617 operation_type = left_type;
619 /* Find the best type to use for copying between aggregate types. */
620 else if (((TREE_CODE (left_type) == ARRAY_TYPE
621 && TREE_CODE (right_type) == ARRAY_TYPE)
622 || (TREE_CODE (left_type) == RECORD_TYPE
623 && TREE_CODE (right_type) == RECORD_TYPE))
624 && (best_type = find_common_type (left_type, right_type)))
625 operation_type = best_type;
627 /* Otherwise use the LHS type. */
628 else if (!operation_type)
629 operation_type = left_type;
631 /* Ensure everything on the LHS is valid. If we have a field reference,
632 strip anything that get_inner_reference can handle. Then remove any
633 conversions between types having the same code and mode. And mark
634 VIEW_CONVERT_EXPRs with TREE_ADDRESSABLE. When done, we must have
635 either an INDIRECT_REF, a NULL_EXPR or a DECL node. */
636 result = left_operand;
639 tree restype = TREE_TYPE (result);
641 if (TREE_CODE (result) == COMPONENT_REF
642 || TREE_CODE (result) == ARRAY_REF
643 || TREE_CODE (result) == ARRAY_RANGE_REF)
644 while (handled_component_p (result))
645 result = TREE_OPERAND (result, 0);
646 else if (TREE_CODE (result) == REALPART_EXPR
647 || TREE_CODE (result) == IMAGPART_EXPR
648 || (CONVERT_EXPR_P (result)
649 && (((TREE_CODE (restype)
650 == TREE_CODE (TREE_TYPE
651 (TREE_OPERAND (result, 0))))
652 && (TYPE_MODE (TREE_TYPE
653 (TREE_OPERAND (result, 0)))
654 == TYPE_MODE (restype)))
655 || TYPE_ALIGN_OK (restype))))
656 result = TREE_OPERAND (result, 0);
657 else if (TREE_CODE (result) == VIEW_CONVERT_EXPR)
659 TREE_ADDRESSABLE (result) = 1;
660 result = TREE_OPERAND (result, 0);
666 gcc_assert (TREE_CODE (result) == INDIRECT_REF
667 || TREE_CODE (result) == NULL_EXPR
670 /* Convert the right operand to the operation type unless it is
671 either already of the correct type or if the type involves a
672 placeholder, since the RHS may not have the same record type. */
673 if (operation_type != right_type
674 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (operation_type)))
676 right_operand = convert (operation_type, right_operand);
677 right_type = operation_type;
680 /* If the left operand is not of the same type as the operation
681 type, wrap it up in a VIEW_CONVERT_EXPR. */
682 if (left_type != operation_type)
683 left_operand = unchecked_convert (operation_type, left_operand, false);
685 has_side_effects = true;
691 operation_type = TREE_TYPE (left_type);
693 /* ... fall through ... */
695 case ARRAY_RANGE_REF:
696 /* First look through conversion between type variants. Note that
697 this changes neither the operation type nor the type domain. */
698 if (TREE_CODE (left_operand) == VIEW_CONVERT_EXPR
699 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (left_operand, 0)))
700 == TYPE_MAIN_VARIANT (left_type))
702 left_operand = TREE_OPERAND (left_operand, 0);
703 left_type = TREE_TYPE (left_operand);
706 /* For a range, make sure the element type is consistent. */
707 if (op_code == ARRAY_RANGE_REF
708 && TREE_TYPE (operation_type) != TREE_TYPE (left_type))
709 operation_type = build_array_type (TREE_TYPE (left_type),
710 TYPE_DOMAIN (operation_type));
712 /* Then convert the right operand to its base type. This will prevent
713 unneeded sign conversions when sizetype is wider than integer. */
714 right_operand = convert (right_base_type, right_operand);
715 right_operand = convert (sizetype, right_operand);
717 if (!TREE_CONSTANT (right_operand)
718 || !TREE_CONSTANT (TYPE_MIN_VALUE (right_type)))
719 gnat_mark_addressable (left_operand);
724 case TRUTH_ANDIF_EXPR:
725 case TRUTH_ORIF_EXPR:
729 #ifdef ENABLE_CHECKING
730 gcc_assert (TREE_CODE (get_base_type (result_type)) == BOOLEAN_TYPE);
732 operation_type = left_base_type;
733 left_operand = convert (operation_type, left_operand);
734 right_operand = convert (operation_type, right_operand);
743 #ifdef ENABLE_CHECKING
744 gcc_assert (TREE_CODE (get_base_type (result_type)) == BOOLEAN_TYPE);
746 /* If either operand is a NULL_EXPR, just return a new one. */
747 if (TREE_CODE (left_operand) == NULL_EXPR)
748 return build2 (op_code, result_type,
749 build1 (NULL_EXPR, integer_type_node,
750 TREE_OPERAND (left_operand, 0)),
753 else if (TREE_CODE (right_operand) == NULL_EXPR)
754 return build2 (op_code, result_type,
755 build1 (NULL_EXPR, integer_type_node,
756 TREE_OPERAND (right_operand, 0)),
759 /* If either object is a justified modular types, get the
760 fields from within. */
761 if (TREE_CODE (left_type) == RECORD_TYPE
762 && TYPE_JUSTIFIED_MODULAR_P (left_type))
764 left_operand = convert (TREE_TYPE (TYPE_FIELDS (left_type)),
766 left_type = TREE_TYPE (left_operand);
767 left_base_type = get_base_type (left_type);
770 if (TREE_CODE (right_type) == RECORD_TYPE
771 && TYPE_JUSTIFIED_MODULAR_P (right_type))
773 right_operand = convert (TREE_TYPE (TYPE_FIELDS (right_type)),
775 right_type = TREE_TYPE (right_operand);
776 right_base_type = get_base_type (right_type);
779 /* If both objects are arrays, compare them specially. */
780 if ((TREE_CODE (left_type) == ARRAY_TYPE
781 || (TREE_CODE (left_type) == INTEGER_TYPE
782 && TYPE_HAS_ACTUAL_BOUNDS_P (left_type)))
783 && (TREE_CODE (right_type) == ARRAY_TYPE
784 || (TREE_CODE (right_type) == INTEGER_TYPE
785 && TYPE_HAS_ACTUAL_BOUNDS_P (right_type))))
787 result = compare_arrays (result_type, left_operand, right_operand);
789 if (op_code == NE_EXPR)
790 result = invert_truthvalue_loc (EXPR_LOCATION (result), result);
792 gcc_assert (op_code == EQ_EXPR);
797 /* Otherwise, the base types must be the same, unless they are both fat
798 pointer types or record types. In the latter case, use the best type
799 and convert both operands to that type. */
800 if (left_base_type != right_base_type)
802 if (TYPE_IS_FAT_POINTER_P (left_base_type)
803 && TYPE_IS_FAT_POINTER_P (right_base_type))
805 gcc_assert (TYPE_MAIN_VARIANT (left_base_type)
806 == TYPE_MAIN_VARIANT (right_base_type));
807 best_type = left_base_type;
810 else if (TREE_CODE (left_base_type) == RECORD_TYPE
811 && TREE_CODE (right_base_type) == RECORD_TYPE)
813 /* The only way this is permitted is if both types have the same
814 name. In that case, one of them must not be self-referential.
815 Use it as the best type. Even better with a fixed size. */
816 gcc_assert (TYPE_NAME (left_base_type)
817 && TYPE_NAME (left_base_type)
818 == TYPE_NAME (right_base_type));
820 if (TREE_CONSTANT (TYPE_SIZE (left_base_type)))
821 best_type = left_base_type;
822 else if (TREE_CONSTANT (TYPE_SIZE (right_base_type)))
823 best_type = right_base_type;
824 else if (!CONTAINS_PLACEHOLDER_P (TYPE_SIZE (left_base_type)))
825 best_type = left_base_type;
826 else if (!CONTAINS_PLACEHOLDER_P (TYPE_SIZE (right_base_type)))
827 best_type = right_base_type;
835 left_operand = convert (best_type, left_operand);
836 right_operand = convert (best_type, right_operand);
840 left_operand = convert (left_base_type, left_operand);
841 right_operand = convert (right_base_type, right_operand);
844 /* If we are comparing a fat pointer against zero, we just need to
845 compare the data pointer. */
846 if (TYPE_IS_FAT_POINTER_P (left_base_type)
847 && TREE_CODE (right_operand) == CONSTRUCTOR
848 && integer_zerop (VEC_index (constructor_elt,
849 CONSTRUCTOR_ELTS (right_operand),
853 = build_component_ref (left_operand, NULL_TREE,
854 TYPE_FIELDS (left_base_type), false);
856 = convert (TREE_TYPE (left_operand), integer_zero_node);
866 /* The RHS of a shift can be any type. Also, ignore any modulus
867 (we used to abort, but this is needed for unchecked conversion
868 to modular types). Otherwise, processing is the same as normal. */
869 gcc_assert (operation_type == left_base_type);
871 left_operand = convert (operation_type, left_operand);
877 /* For binary modulus, if the inputs are in range, so are the
879 if (modulus && integer_pow2p (modulus))
884 gcc_assert (TREE_TYPE (result_type) == left_base_type
885 && TREE_TYPE (result_type) == right_base_type);
886 left_operand = convert (left_base_type, left_operand);
887 right_operand = convert (right_base_type, right_operand);
890 case TRUNC_DIV_EXPR: case TRUNC_MOD_EXPR:
891 case CEIL_DIV_EXPR: case CEIL_MOD_EXPR:
892 case FLOOR_DIV_EXPR: case FLOOR_MOD_EXPR:
893 case ROUND_DIV_EXPR: case ROUND_MOD_EXPR:
894 /* These always produce results lower than either operand. */
898 case POINTER_PLUS_EXPR:
899 gcc_assert (operation_type == left_base_type
900 && sizetype == right_base_type);
901 left_operand = convert (operation_type, left_operand);
902 right_operand = convert (sizetype, right_operand);
905 case PLUS_NOMOD_EXPR:
906 case MINUS_NOMOD_EXPR:
907 if (op_code == PLUS_NOMOD_EXPR)
910 op_code = MINUS_EXPR;
913 /* ... fall through ... */
917 /* Avoid doing arithmetics in ENUMERAL_TYPE or BOOLEAN_TYPE like the
918 other compilers. Contrary to C, Ada doesn't allow arithmetics in
919 these types but can generate addition/subtraction for Succ/Pred. */
921 && (TREE_CODE (operation_type) == ENUMERAL_TYPE
922 || TREE_CODE (operation_type) == BOOLEAN_TYPE))
923 operation_type = left_base_type = right_base_type
924 = gnat_type_for_mode (TYPE_MODE (operation_type),
925 TYPE_UNSIGNED (operation_type));
927 /* ... fall through ... */
931 /* The result type should be the same as the base types of the
932 both operands (and they should be the same). Convert
933 everything to the result type. */
935 gcc_assert (operation_type == left_base_type
936 && left_base_type == right_base_type);
937 left_operand = convert (operation_type, left_operand);
938 right_operand = convert (operation_type, right_operand);
941 if (modulus && !integer_pow2p (modulus))
943 result = nonbinary_modular_operation (op_code, operation_type,
944 left_operand, right_operand);
947 /* If either operand is a NULL_EXPR, just return a new one. */
948 else if (TREE_CODE (left_operand) == NULL_EXPR)
949 return build1 (NULL_EXPR, operation_type, TREE_OPERAND (left_operand, 0));
950 else if (TREE_CODE (right_operand) == NULL_EXPR)
951 return build1 (NULL_EXPR, operation_type, TREE_OPERAND (right_operand, 0));
952 else if (op_code == ARRAY_REF || op_code == ARRAY_RANGE_REF)
953 result = fold (build4 (op_code, operation_type, left_operand,
954 right_operand, NULL_TREE, NULL_TREE));
957 = fold_build2 (op_code, operation_type, left_operand, right_operand);
959 if (TREE_CONSTANT (result))
961 else if (op_code == ARRAY_REF || op_code == ARRAY_RANGE_REF)
963 TREE_THIS_NOTRAP (result) = 1;
964 if (TYPE_VOLATILE (operation_type))
965 TREE_THIS_VOLATILE (result) = 1;
968 TREE_CONSTANT (result)
969 |= (TREE_CONSTANT (left_operand) && TREE_CONSTANT (right_operand));
971 TREE_SIDE_EFFECTS (result) |= has_side_effects;
973 /* If we are working with modular types, perform the MOD operation
974 if something above hasn't eliminated the need for it. */
976 result = fold_build2 (FLOOR_MOD_EXPR, operation_type, result,
977 convert (operation_type, modulus));
979 if (result_type && result_type != operation_type)
980 result = convert (result_type, result);
985 /* Similar, but for unary operations. */
988 build_unary_op (enum tree_code op_code, tree result_type, tree operand)
990 tree type = TREE_TYPE (operand);
991 tree base_type = get_base_type (type);
992 tree operation_type = result_type;
994 bool side_effects = false;
997 && TREE_CODE (operation_type) == RECORD_TYPE
998 && TYPE_JUSTIFIED_MODULAR_P (operation_type))
999 operation_type = TREE_TYPE (TYPE_FIELDS (operation_type));
1002 && !AGGREGATE_TYPE_P (operation_type)
1003 && TYPE_EXTRA_SUBTYPE_P (operation_type))
1004 operation_type = get_base_type (operation_type);
1010 if (!operation_type)
1011 result_type = operation_type = TREE_TYPE (type);
1013 gcc_assert (result_type == TREE_TYPE (type));
1015 result = fold_build1 (op_code, operation_type, operand);
1018 case TRUTH_NOT_EXPR:
1019 #ifdef ENABLE_CHECKING
1020 gcc_assert (TREE_CODE (get_base_type (result_type)) == BOOLEAN_TYPE);
1022 result = invert_truthvalue_loc (EXPR_LOCATION (operand), operand);
1023 /* When not optimizing, fold the result as invert_truthvalue_loc
1024 doesn't fold the result of comparisons. This is intended to undo
1025 the trick used for boolean rvalues in gnat_to_gnu. */
1027 result = fold (result);
1030 case ATTR_ADDR_EXPR:
1032 switch (TREE_CODE (operand))
1035 case UNCONSTRAINED_ARRAY_REF:
1036 result = TREE_OPERAND (operand, 0);
1038 /* Make sure the type here is a pointer, not a reference.
1039 GCC wants pointer types for function addresses. */
1041 result_type = build_pointer_type (type);
1043 /* If the underlying object can alias everything, propagate the
1044 property since we are effectively retrieving the object. */
1045 if (POINTER_TYPE_P (TREE_TYPE (result))
1046 && TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (result)))
1048 if (TREE_CODE (result_type) == POINTER_TYPE
1049 && !TYPE_REF_CAN_ALIAS_ALL (result_type))
1051 = build_pointer_type_for_mode (TREE_TYPE (result_type),
1052 TYPE_MODE (result_type),
1054 else if (TREE_CODE (result_type) == REFERENCE_TYPE
1055 && !TYPE_REF_CAN_ALIAS_ALL (result_type))
1057 = build_reference_type_for_mode (TREE_TYPE (result_type),
1058 TYPE_MODE (result_type),
1065 TREE_TYPE (result) = type = build_pointer_type (type);
1069 /* Fold a compound expression if it has unconstrained array type
1070 since the middle-end cannot handle it. But we don't it in the
1071 general case because it may introduce aliasing issues if the
1072 first operand is an indirect assignment and the second operand
1073 the corresponding address, e.g. for an allocator. */
1074 if (TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE)
1076 result = build_unary_op (ADDR_EXPR, result_type,
1077 TREE_OPERAND (operand, 1));
1078 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
1079 TREE_OPERAND (operand, 0), result);
1085 case ARRAY_RANGE_REF:
1088 /* If this is for 'Address, find the address of the prefix and add
1089 the offset to the field. Otherwise, do this the normal way. */
1090 if (op_code == ATTR_ADDR_EXPR)
1092 HOST_WIDE_INT bitsize;
1093 HOST_WIDE_INT bitpos;
1095 enum machine_mode mode;
1096 int unsignedp, volatilep;
1098 inner = get_inner_reference (operand, &bitsize, &bitpos, &offset,
1099 &mode, &unsignedp, &volatilep,
1102 /* If INNER is a padding type whose field has a self-referential
1103 size, convert to that inner type. We know the offset is zero
1104 and we need to have that type visible. */
1105 if (TYPE_IS_PADDING_P (TREE_TYPE (inner))
1106 && CONTAINS_PLACEHOLDER_P
1107 (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
1108 (TREE_TYPE (inner))))))
1109 inner = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (inner))),
1112 /* Compute the offset as a byte offset from INNER. */
1114 offset = size_zero_node;
1116 offset = size_binop (PLUS_EXPR, offset,
1117 size_int (bitpos / BITS_PER_UNIT));
1119 /* Take the address of INNER, convert the offset to void *, and
1120 add then. It will later be converted to the desired result
1122 inner = build_unary_op (ADDR_EXPR, NULL_TREE, inner);
1123 inner = convert (ptr_void_type_node, inner);
1124 result = build_binary_op (POINTER_PLUS_EXPR, ptr_void_type_node,
1126 result = convert (build_pointer_type (TREE_TYPE (operand)),
1133 /* If this is just a constructor for a padded record, we can
1134 just take the address of the single field and convert it to
1135 a pointer to our type. */
1136 if (TYPE_IS_PADDING_P (type))
1138 result = VEC_index (constructor_elt,
1139 CONSTRUCTOR_ELTS (operand),
1141 result = convert (build_pointer_type (TREE_TYPE (operand)),
1142 build_unary_op (ADDR_EXPR, NULL_TREE, result));
1149 if (AGGREGATE_TYPE_P (type)
1150 && AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (operand, 0))))
1151 return build_unary_op (ADDR_EXPR, result_type,
1152 TREE_OPERAND (operand, 0));
1154 /* ... fallthru ... */
1156 case VIEW_CONVERT_EXPR:
1157 /* If this just a variant conversion or if the conversion doesn't
1158 change the mode, get the result type from this type and go down.
1159 This is needed for conversions of CONST_DECLs, to eventually get
1160 to the address of their CORRESPONDING_VARs. */
1161 if ((TYPE_MAIN_VARIANT (type)
1162 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (operand, 0))))
1163 || (TYPE_MODE (type) != BLKmode
1164 && (TYPE_MODE (type)
1165 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (operand, 0))))))
1166 return build_unary_op (ADDR_EXPR,
1167 (result_type ? result_type
1168 : build_pointer_type (type)),
1169 TREE_OPERAND (operand, 0));
1173 operand = DECL_CONST_CORRESPONDING_VAR (operand);
1175 /* ... fall through ... */
1180 /* If we are taking the address of a padded record whose field is
1181 contains a template, take the address of the template. */
1182 if (TYPE_IS_PADDING_P (type)
1183 && TREE_CODE (TREE_TYPE (TYPE_FIELDS (type))) == RECORD_TYPE
1184 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (TYPE_FIELDS (type))))
1186 type = TREE_TYPE (TYPE_FIELDS (type));
1187 operand = convert (type, operand);
1190 gnat_mark_addressable (operand);
1191 result = build_fold_addr_expr (operand);
1194 TREE_CONSTANT (result) = staticp (operand) || TREE_CONSTANT (operand);
1198 /* If we want to refer to an unconstrained array, use the appropriate
1199 expression to do so. This will never survive down to the back-end.
1200 But if TYPE is a thin pointer, first convert to a fat pointer. */
1201 if (TYPE_IS_THIN_POINTER_P (type)
1202 && TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (type)))
1205 = convert (TREE_TYPE (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (type))),
1207 type = TREE_TYPE (operand);
1210 if (TYPE_IS_FAT_POINTER_P (type))
1212 result = build1 (UNCONSTRAINED_ARRAY_REF,
1213 TYPE_UNCONSTRAINED_ARRAY (type), operand);
1214 TREE_READONLY (result)
1215 = TYPE_READONLY (TYPE_UNCONSTRAINED_ARRAY (type));
1218 /* If we are dereferencing an ADDR_EXPR, return its operand. */
1219 else if (TREE_CODE (operand) == ADDR_EXPR)
1220 result = TREE_OPERAND (operand, 0);
1222 /* Otherwise, build and fold the indirect reference. */
1225 result = build_fold_indirect_ref (operand);
1226 TREE_READONLY (result) = TYPE_READONLY (TREE_TYPE (type));
1230 = (!TYPE_IS_FAT_POINTER_P (type) && TYPE_VOLATILE (TREE_TYPE (type)));
1236 tree modulus = ((operation_type
1237 && TREE_CODE (operation_type) == INTEGER_TYPE
1238 && TYPE_MODULAR_P (operation_type))
1239 ? TYPE_MODULUS (operation_type) : NULL_TREE);
1240 int mod_pow2 = modulus && integer_pow2p (modulus);
1242 /* If this is a modular type, there are various possibilities
1243 depending on the operation and whether the modulus is a
1244 power of two or not. */
1248 gcc_assert (operation_type == base_type);
1249 operand = convert (operation_type, operand);
1251 /* The fastest in the negate case for binary modulus is
1252 the straightforward code; the TRUNC_MOD_EXPR below
1253 is an AND operation. */
1254 if (op_code == NEGATE_EXPR && mod_pow2)
1255 result = fold_build2 (TRUNC_MOD_EXPR, operation_type,
1256 fold_build1 (NEGATE_EXPR, operation_type,
1260 /* For nonbinary negate case, return zero for zero operand,
1261 else return the modulus minus the operand. If the modulus
1262 is a power of two minus one, we can do the subtraction
1263 as an XOR since it is equivalent and faster on most machines. */
1264 else if (op_code == NEGATE_EXPR && !mod_pow2)
1266 if (integer_pow2p (fold_build2 (PLUS_EXPR, operation_type,
1268 convert (operation_type,
1269 integer_one_node))))
1270 result = fold_build2 (BIT_XOR_EXPR, operation_type,
1273 result = fold_build2 (MINUS_EXPR, operation_type,
1276 result = fold_build3 (COND_EXPR, operation_type,
1277 fold_build2 (NE_EXPR,
1282 integer_zero_node)),
1287 /* For the NOT cases, we need a constant equal to
1288 the modulus minus one. For a binary modulus, we
1289 XOR against the constant and subtract the operand from
1290 that constant for nonbinary modulus. */
1292 tree cnst = fold_build2 (MINUS_EXPR, operation_type, modulus,
1293 convert (operation_type,
1297 result = fold_build2 (BIT_XOR_EXPR, operation_type,
1300 result = fold_build2 (MINUS_EXPR, operation_type,
1308 /* ... fall through ... */
1311 gcc_assert (operation_type == base_type);
1312 result = fold_build1 (op_code, operation_type,
1313 convert (operation_type, operand));
1318 TREE_SIDE_EFFECTS (result) = 1;
1319 if (TREE_CODE (result) == INDIRECT_REF)
1320 TREE_THIS_VOLATILE (result) = TYPE_VOLATILE (TREE_TYPE (result));
1323 if (result_type && TREE_TYPE (result) != result_type)
1324 result = convert (result_type, result);
1329 /* Similar, but for COND_EXPR. */
1332 build_cond_expr (tree result_type, tree condition_operand,
1333 tree true_operand, tree false_operand)
1335 bool addr_p = false;
1338 /* The front-end verified that result, true and false operands have
1339 same base type. Convert everything to the result type. */
1340 true_operand = convert (result_type, true_operand);
1341 false_operand = convert (result_type, false_operand);
1343 /* If the result type is unconstrained, take the address of the operands and
1344 then dereference the result. Likewise if the result type is passed by
1345 reference, but this is natively handled in the gimplifier. */
1346 if (TREE_CODE (result_type) == UNCONSTRAINED_ARRAY_TYPE
1347 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (result_type)))
1349 result_type = build_pointer_type (result_type);
1350 true_operand = build_unary_op (ADDR_EXPR, result_type, true_operand);
1351 false_operand = build_unary_op (ADDR_EXPR, result_type, false_operand);
1355 result = fold_build3 (COND_EXPR, result_type, condition_operand,
1356 true_operand, false_operand);
1358 /* If we have a common SAVE_EXPR (possibly surrounded by arithmetics)
1359 in both arms, make sure it gets evaluated by moving it ahead of the
1360 conditional expression. This is necessary because it is evaluated
1361 in only one place at run time and would otherwise be uninitialized
1362 in one of the arms. */
1363 true_operand = skip_simple_arithmetic (true_operand);
1364 false_operand = skip_simple_arithmetic (false_operand);
1366 if (true_operand == false_operand && TREE_CODE (true_operand) == SAVE_EXPR)
1367 result = build2 (COMPOUND_EXPR, result_type, true_operand, result);
1370 result = build_unary_op (INDIRECT_REF, NULL_TREE, result);
1375 /* Similar, but for RETURN_EXPR. If RET_VAL is non-null, build a RETURN_EXPR
1376 around the assignment of RET_VAL to RET_OBJ. Otherwise just build a bare
1377 RETURN_EXPR around RESULT_OBJ, which may be null in this case. */
1380 build_return_expr (tree ret_obj, tree ret_val)
1386 /* The gimplifier explicitly enforces the following invariant:
1395 As a consequence, type consistency dictates that we use the type
1396 of the RET_OBJ as the operation type. */
1397 tree operation_type = TREE_TYPE (ret_obj);
1399 /* Convert the right operand to the operation type. Note that it's the
1400 same transformation as in the MODIFY_EXPR case of build_binary_op,
1401 with the assumption that the type cannot involve a placeholder. */
1402 if (operation_type != TREE_TYPE (ret_val))
1403 ret_val = convert (operation_type, ret_val);
1405 result_expr = build2 (MODIFY_EXPR, operation_type, ret_obj, ret_val);
1408 result_expr = ret_obj;
1410 return build1 (RETURN_EXPR, void_type_node, result_expr);
1413 /* Build a CALL_EXPR to call FUNDECL with one argument, ARG. Return
1417 build_call_1_expr (tree fundecl, tree arg)
1419 tree call = build_call_nary (TREE_TYPE (TREE_TYPE (fundecl)),
1420 build_unary_op (ADDR_EXPR, NULL_TREE, fundecl),
1422 TREE_SIDE_EFFECTS (call) = 1;
1426 /* Build a CALL_EXPR to call FUNDECL with two arguments, ARG1 & ARG2. Return
1430 build_call_2_expr (tree fundecl, tree arg1, tree arg2)
1432 tree call = build_call_nary (TREE_TYPE (TREE_TYPE (fundecl)),
1433 build_unary_op (ADDR_EXPR, NULL_TREE, fundecl),
1435 TREE_SIDE_EFFECTS (call) = 1;
1439 /* Likewise to call FUNDECL with no arguments. */
1442 build_call_0_expr (tree fundecl)
1444 /* We rely on build_call_nary to compute TREE_SIDE_EFFECTS. This makes
1445 it possible to propagate DECL_IS_PURE on parameterless functions. */
1446 tree call = build_call_nary (TREE_TYPE (TREE_TYPE (fundecl)),
1447 build_unary_op (ADDR_EXPR, NULL_TREE, fundecl),
1452 /* Call a function that raises an exception and pass the line number and file
1453 name, if requested. MSG says which exception function to call.
1455 GNAT_NODE is the gnat node conveying the source location for which the
1456 error should be signaled, or Empty in which case the error is signaled on
1457 the current ref_file_name/input_line.
1459 KIND says which kind of exception this is for
1460 (N_Raise_{Constraint,Storage,Program}_Error). */
1463 build_call_raise (int msg, Node_Id gnat_node, char kind)
1465 tree fndecl = gnat_raise_decls[msg];
1466 tree label = get_exception_label (kind);
1472 /* If this is to be done as a goto, handle that case. */
1475 Entity_Id local_raise = Get_Local_Raise_Call_Entity ();
1476 tree gnu_result = build1 (GOTO_EXPR, void_type_node, label);
1478 /* If Local_Raise is present, generate
1479 Local_Raise (exception'Identity); */
1480 if (Present (local_raise))
1482 tree gnu_local_raise
1483 = gnat_to_gnu_entity (local_raise, NULL_TREE, 0);
1484 tree gnu_exception_entity
1485 = gnat_to_gnu_entity (Get_RT_Exception_Entity (msg), NULL_TREE, 0);
1487 = build_call_1_expr (gnu_local_raise,
1488 build_unary_op (ADDR_EXPR, NULL_TREE,
1489 gnu_exception_entity));
1491 gnu_result = build2 (COMPOUND_EXPR, void_type_node,
1492 gnu_call, gnu_result);}
1498 = (Debug_Flag_NN || Exception_Locations_Suppressed)
1500 : (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1501 ? IDENTIFIER_POINTER
1502 (get_identifier (Get_Name_String
1504 (Get_Source_File_Index (Sloc (gnat_node))))))
1508 filename = build_string (len, str);
1510 = (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1511 ? Get_Logical_Line_Number (Sloc(gnat_node)) : input_line;
1513 TREE_TYPE (filename) = build_array_type (unsigned_char_type_node,
1514 build_index_type (size_int (len)));
1517 build_call_2_expr (fndecl,
1519 build_pointer_type (unsigned_char_type_node),
1521 build_int_cst (NULL_TREE, line_number));
1524 /* Similar to build_call_raise, for an index or range check exception as
1525 determined by MSG, with extra information generated of the form
1526 "INDEX out of range FIRST..LAST". */
1529 build_call_raise_range (int msg, Node_Id gnat_node,
1530 tree index, tree first, tree last)
1533 tree fndecl = gnat_raise_decls_ext[msg];
1535 int line_number, column_number;
1540 = (Debug_Flag_NN || Exception_Locations_Suppressed)
1542 : (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1543 ? IDENTIFIER_POINTER
1544 (get_identifier (Get_Name_String
1546 (Get_Source_File_Index (Sloc (gnat_node))))))
1550 filename = build_string (len, str);
1551 if (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1553 line_number = Get_Logical_Line_Number (Sloc (gnat_node));
1554 column_number = Get_Column_Number (Sloc (gnat_node));
1558 line_number = input_line;
1562 TREE_TYPE (filename) = build_array_type (unsigned_char_type_node,
1563 build_index_type (size_int (len)));
1565 call = build_call_nary (TREE_TYPE (TREE_TYPE (fndecl)),
1566 build_unary_op (ADDR_EXPR, NULL_TREE, fndecl),
1569 build_pointer_type (unsigned_char_type_node),
1571 build_int_cst (NULL_TREE, line_number),
1572 build_int_cst (NULL_TREE, column_number),
1573 convert (integer_type_node, index),
1574 convert (integer_type_node, first),
1575 convert (integer_type_node, last));
1576 TREE_SIDE_EFFECTS (call) = 1;
1580 /* Similar to build_call_raise, with extra information about the column
1581 where the check failed. */
1584 build_call_raise_column (int msg, Node_Id gnat_node)
1586 tree fndecl = gnat_raise_decls_ext[msg];
1589 int line_number, column_number;
1594 = (Debug_Flag_NN || Exception_Locations_Suppressed)
1596 : (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1597 ? IDENTIFIER_POINTER
1598 (get_identifier (Get_Name_String
1600 (Get_Source_File_Index (Sloc (gnat_node))))))
1604 filename = build_string (len, str);
1605 if (gnat_node != Empty && Sloc (gnat_node) != No_Location)
1607 line_number = Get_Logical_Line_Number (Sloc (gnat_node));
1608 column_number = Get_Column_Number (Sloc (gnat_node));
1612 line_number = input_line;
1616 TREE_TYPE (filename) = build_array_type (unsigned_char_type_node,
1617 build_index_type (size_int (len)));
1619 call = build_call_nary (TREE_TYPE (TREE_TYPE (fndecl)),
1620 build_unary_op (ADDR_EXPR, NULL_TREE, fndecl),
1623 build_pointer_type (unsigned_char_type_node),
1625 build_int_cst (NULL_TREE, line_number),
1626 build_int_cst (NULL_TREE, column_number));
1627 TREE_SIDE_EFFECTS (call) = 1;
1631 /* qsort comparer for the bit positions of two constructor elements
1632 for record components. */
1635 compare_elmt_bitpos (const PTR rt1, const PTR rt2)
1637 const constructor_elt * const elmt1 = (const constructor_elt const *) rt1;
1638 const constructor_elt * const elmt2 = (const constructor_elt const *) rt2;
1639 const_tree const field1 = elmt1->index;
1640 const_tree const field2 = elmt2->index;
1642 = tree_int_cst_compare (bit_position (field1), bit_position (field2));
1644 return ret ? ret : (int) (DECL_UID (field1) - DECL_UID (field2));
1647 /* Return a CONSTRUCTOR of TYPE whose elements are V. */
1650 gnat_build_constructor (tree type, VEC(constructor_elt,gc) *v)
1652 bool allconstant = (TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST);
1653 bool side_effects = false;
1654 tree result, obj, val;
1655 unsigned int n_elmts;
1657 /* Scan the elements to see if they are all constant or if any has side
1658 effects, to let us set global flags on the resulting constructor. Count
1659 the elements along the way for possible sorting purposes below. */
1660 FOR_EACH_CONSTRUCTOR_ELT (v, n_elmts, obj, val)
1662 /* The predicate must be in keeping with output_constructor. */
1663 if (!TREE_CONSTANT (val)
1664 || (TREE_CODE (type) == RECORD_TYPE
1665 && CONSTRUCTOR_BITFIELD_P (obj)
1666 && !initializer_constant_valid_for_bitfield_p (val))
1667 || !initializer_constant_valid_p (val, TREE_TYPE (val)))
1668 allconstant = false;
1670 if (TREE_SIDE_EFFECTS (val))
1671 side_effects = true;
1674 /* For record types with constant components only, sort field list
1675 by increasing bit position. This is necessary to ensure the
1676 constructor can be output as static data. */
1677 if (allconstant && TREE_CODE (type) == RECORD_TYPE && n_elmts > 1)
1678 VEC_qsort (constructor_elt, v, compare_elmt_bitpos);
1680 result = build_constructor (type, v);
1681 TREE_CONSTANT (result) = TREE_STATIC (result) = allconstant;
1682 TREE_SIDE_EFFECTS (result) = side_effects;
1683 TREE_READONLY (result) = TYPE_READONLY (type) || allconstant;
1687 /* Return a COMPONENT_REF to access a field that is given by COMPONENT,
1688 an IDENTIFIER_NODE giving the name of the field, or FIELD, a FIELD_DECL,
1689 for the field. Don't fold the result if NO_FOLD_P is true.
1691 We also handle the fact that we might have been passed a pointer to the
1692 actual record and know how to look for fields in variant parts. */
1695 build_simple_component_ref (tree record_variable, tree component,
1696 tree field, bool no_fold_p)
1698 tree record_type = TYPE_MAIN_VARIANT (TREE_TYPE (record_variable));
1699 tree ref, inner_variable;
1701 gcc_assert ((TREE_CODE (record_type) == RECORD_TYPE
1702 || TREE_CODE (record_type) == UNION_TYPE
1703 || TREE_CODE (record_type) == QUAL_UNION_TYPE)
1704 && TYPE_SIZE (record_type)
1705 && (component != 0) != (field != 0));
1707 /* If no field was specified, look for a field with the specified name
1708 in the current record only. */
1710 for (field = TYPE_FIELDS (record_type); field;
1711 field = TREE_CHAIN (field))
1712 if (DECL_NAME (field) == component)
1718 /* If this field is not in the specified record, see if we can find a field
1719 in the specified record whose original field is the same as this one. */
1720 if (DECL_CONTEXT (field) != record_type)
1724 /* First loop thru normal components. */
1725 for (new_field = TYPE_FIELDS (record_type); new_field;
1726 new_field = DECL_CHAIN (new_field))
1727 if (SAME_FIELD_P (field, new_field))
1730 /* Next, see if we're looking for an inherited component in an extension.
1731 If so, look thru the extension directly. */
1733 && TREE_CODE (record_variable) == VIEW_CONVERT_EXPR
1734 && TYPE_ALIGN_OK (record_type)
1735 && TREE_CODE (TREE_TYPE (TREE_OPERAND (record_variable, 0)))
1737 && TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (record_variable, 0))))
1739 ref = build_simple_component_ref (TREE_OPERAND (record_variable, 0),
1740 NULL_TREE, field, no_fold_p);
1745 /* Next, loop thru DECL_INTERNAL_P components if we haven't found
1746 the component in the first search. Doing this search in 2 steps
1747 is required to avoiding hidden homonymous fields in the
1750 for (new_field = TYPE_FIELDS (record_type); new_field;
1751 new_field = DECL_CHAIN (new_field))
1752 if (DECL_INTERNAL_P (new_field))
1755 = build_simple_component_ref (record_variable,
1756 NULL_TREE, new_field, no_fold_p);
1757 ref = build_simple_component_ref (field_ref, NULL_TREE, field,
1770 /* If the field's offset has overflowed, do not attempt to access it
1771 as doing so may trigger sanity checks deeper in the back-end.
1772 Note that we don't need to warn since this will be done on trying
1773 to declare the object. */
1774 if (TREE_CODE (DECL_FIELD_OFFSET (field)) == INTEGER_CST
1775 && TREE_OVERFLOW (DECL_FIELD_OFFSET (field)))
1778 /* Look through conversion between type variants. Note that this
1779 is transparent as far as the field is concerned. */
1780 if (TREE_CODE (record_variable) == VIEW_CONVERT_EXPR
1781 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (record_variable, 0)))
1783 inner_variable = TREE_OPERAND (record_variable, 0);
1785 inner_variable = record_variable;
1787 ref = build3 (COMPONENT_REF, TREE_TYPE (field), inner_variable, field,
1790 if (TREE_READONLY (record_variable) || TREE_READONLY (field))
1791 TREE_READONLY (ref) = 1;
1792 if (TREE_THIS_VOLATILE (record_variable) || TREE_THIS_VOLATILE (field)
1793 || TYPE_VOLATILE (record_type))
1794 TREE_THIS_VOLATILE (ref) = 1;
1799 /* The generic folder may punt in this case because the inner array type
1800 can be self-referential, but folding is in fact not problematic. */
1801 else if (TREE_CODE (record_variable) == CONSTRUCTOR
1802 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (record_variable)))
1804 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (record_variable);
1805 unsigned HOST_WIDE_INT idx;
1807 FOR_EACH_CONSTRUCTOR_ELT (elts, idx, index, value)
1817 /* Like build_simple_component_ref, except that we give an error if the
1818 reference could not be found. */
1821 build_component_ref (tree record_variable, tree component,
1822 tree field, bool no_fold_p)
1824 tree ref = build_simple_component_ref (record_variable, component, field,
1830 /* If FIELD was specified, assume this is an invalid user field so raise
1831 Constraint_Error. Otherwise, we have no type to return so abort. */
1833 return build1 (NULL_EXPR, TREE_TYPE (field),
1834 build_call_raise (CE_Discriminant_Check_Failed, Empty,
1835 N_Raise_Constraint_Error));
1838 /* Helper for build_call_alloc_dealloc, with arguments to be interpreted
1839 identically. Process the case where a GNAT_PROC to call is provided. */
1842 build_call_alloc_dealloc_proc (tree gnu_obj, tree gnu_size, tree gnu_type,
1843 Entity_Id gnat_proc, Entity_Id gnat_pool)
1845 tree gnu_proc = gnat_to_gnu (gnat_proc);
1846 tree gnu_proc_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_proc);
1849 /* The storage pools are obviously always tagged types, but the
1850 secondary stack uses the same mechanism and is not tagged. */
1851 if (Is_Tagged_Type (Etype (gnat_pool)))
1853 /* The size is the third parameter; the alignment is the
1855 Entity_Id gnat_size_type
1856 = Etype (Next_Formal (Next_Formal (First_Formal (gnat_proc))));
1857 tree gnu_size_type = gnat_to_gnu_type (gnat_size_type);
1859 tree gnu_pool = gnat_to_gnu (gnat_pool);
1860 tree gnu_pool_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_pool);
1861 tree gnu_align = size_int (TYPE_ALIGN (gnu_type) / BITS_PER_UNIT);
1863 gnu_size = convert (gnu_size_type, gnu_size);
1864 gnu_align = convert (gnu_size_type, gnu_align);
1866 /* The first arg is always the address of the storage pool; next
1867 comes the address of the object, for a deallocator, then the
1868 size and alignment. */
1870 gnu_call = build_call_nary (TREE_TYPE (TREE_TYPE (gnu_proc)),
1871 gnu_proc_addr, 4, gnu_pool_addr,
1872 gnu_obj, gnu_size, gnu_align);
1874 gnu_call = build_call_nary (TREE_TYPE (TREE_TYPE (gnu_proc)),
1875 gnu_proc_addr, 3, gnu_pool_addr,
1876 gnu_size, gnu_align);
1879 /* Secondary stack case. */
1882 /* The size is the second parameter. */
1883 Entity_Id gnat_size_type
1884 = Etype (Next_Formal (First_Formal (gnat_proc)));
1885 tree gnu_size_type = gnat_to_gnu_type (gnat_size_type);
1887 gnu_size = convert (gnu_size_type, gnu_size);
1889 /* The first arg is the address of the object, for a deallocator,
1892 gnu_call = build_call_nary (TREE_TYPE (TREE_TYPE (gnu_proc)),
1893 gnu_proc_addr, 2, gnu_obj, gnu_size);
1895 gnu_call = build_call_nary (TREE_TYPE (TREE_TYPE (gnu_proc)),
1896 gnu_proc_addr, 1, gnu_size);
1899 TREE_SIDE_EFFECTS (gnu_call) = 1;
1903 /* Helper for build_call_alloc_dealloc, to build and return an allocator for
1904 DATA_SIZE bytes aimed at containing a DATA_TYPE object, using the default
1905 __gnat_malloc allocator. Honor DATA_TYPE alignments greater than what the
1909 maybe_wrap_malloc (tree data_size, tree data_type, Node_Id gnat_node)
1911 /* When the DATA_TYPE alignment is stricter than what malloc offers
1912 (super-aligned case), we allocate an "aligning" wrapper type and return
1913 the address of its single data field with the malloc's return value
1914 stored just in front. */
1916 unsigned int data_align = TYPE_ALIGN (data_type);
1917 unsigned int default_allocator_alignment
1918 = get_target_default_allocator_alignment () * BITS_PER_UNIT;
1921 = ((data_align > default_allocator_alignment)
1922 ? make_aligning_type (data_type, data_align, data_size,
1923 default_allocator_alignment,
1924 POINTER_SIZE / BITS_PER_UNIT)
1928 = aligning_type ? TYPE_SIZE_UNIT (aligning_type) : data_size;
1932 /* On VMS, if pointers are 64-bit and the allocator size is 32-bit or
1933 Convention C, allocate 32-bit memory. */
1934 if (TARGET_ABI_OPEN_VMS
1935 && POINTER_SIZE == 64
1936 && Nkind (gnat_node) == N_Allocator
1937 && (UI_To_Int (Esize (Etype (gnat_node))) == 32
1938 || Convention (Etype (gnat_node)) == Convention_C))
1939 malloc_ptr = build_call_1_expr (malloc32_decl, size_to_malloc);
1941 malloc_ptr = build_call_1_expr (malloc_decl, size_to_malloc);
1945 /* Latch malloc's return value and get a pointer to the aligning field
1947 tree storage_ptr = gnat_protect_expr (malloc_ptr);
1949 tree aligning_record_addr
1950 = convert (build_pointer_type (aligning_type), storage_ptr);
1952 tree aligning_record
1953 = build_unary_op (INDIRECT_REF, NULL_TREE, aligning_record_addr);
1956 = build_component_ref (aligning_record, NULL_TREE,
1957 TYPE_FIELDS (aligning_type), false);
1959 tree aligning_field_addr
1960 = build_unary_op (ADDR_EXPR, NULL_TREE, aligning_field);
1962 /* Then arrange to store the allocator's return value ahead
1964 tree storage_ptr_slot_addr
1965 = build_binary_op (POINTER_PLUS_EXPR, ptr_void_type_node,
1966 convert (ptr_void_type_node, aligning_field_addr),
1967 size_int (-(HOST_WIDE_INT) POINTER_SIZE
1970 tree storage_ptr_slot
1971 = build_unary_op (INDIRECT_REF, NULL_TREE,
1972 convert (build_pointer_type (ptr_void_type_node),
1973 storage_ptr_slot_addr));
1976 build2 (COMPOUND_EXPR, TREE_TYPE (aligning_field_addr),
1977 build_binary_op (MODIFY_EXPR, NULL_TREE,
1978 storage_ptr_slot, storage_ptr),
1979 aligning_field_addr);
1985 /* Helper for build_call_alloc_dealloc, to release a DATA_TYPE object
1986 designated by DATA_PTR using the __gnat_free entry point. */
1989 maybe_wrap_free (tree data_ptr, tree data_type)
1991 /* In the regular alignment case, we pass the data pointer straight to free.
1992 In the superaligned case, we need to retrieve the initial allocator
1993 return value, stored in front of the data block at allocation time. */
1995 unsigned int data_align = TYPE_ALIGN (data_type);
1996 unsigned int default_allocator_alignment
1997 = get_target_default_allocator_alignment () * BITS_PER_UNIT;
2001 if (data_align > default_allocator_alignment)
2003 /* DATA_FRONT_PTR (void *)
2004 = (void *)DATA_PTR - (void *)sizeof (void *)) */
2007 (POINTER_PLUS_EXPR, ptr_void_type_node,
2008 convert (ptr_void_type_node, data_ptr),
2009 size_int (-(HOST_WIDE_INT) POINTER_SIZE / BITS_PER_UNIT));
2011 /* FREE_PTR (void *) = *(void **)DATA_FRONT_PTR */
2014 (INDIRECT_REF, NULL_TREE,
2015 convert (build_pointer_type (ptr_void_type_node), data_front_ptr));
2018 free_ptr = data_ptr;
2020 return build_call_1_expr (free_decl, free_ptr);
2023 /* Build a GCC tree to call an allocation or deallocation function.
2024 If GNU_OBJ is nonzero, it is an object to deallocate. Otherwise,
2025 generate an allocator.
2027 GNU_SIZE is the number of bytes to allocate and GNU_TYPE is the contained
2028 object type, used to determine the to-be-honored address alignment.
2029 GNAT_PROC, if present, is a procedure to call and GNAT_POOL is the storage
2030 pool to use. If not present, malloc and free are used. GNAT_NODE is used
2031 to provide an error location for restriction violation messages. */
2034 build_call_alloc_dealloc (tree gnu_obj, tree gnu_size, tree gnu_type,
2035 Entity_Id gnat_proc, Entity_Id gnat_pool,
2038 gnu_size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_size, gnu_obj);
2040 /* Explicit proc to call ? This one is assumed to deal with the type
2041 alignment constraints. */
2042 if (Present (gnat_proc))
2043 return build_call_alloc_dealloc_proc (gnu_obj, gnu_size, gnu_type,
2044 gnat_proc, gnat_pool);
2046 /* Otherwise, object to "free" or "malloc" with possible special processing
2047 for alignments stricter than what the default allocator honors. */
2049 return maybe_wrap_free (gnu_obj, gnu_type);
2052 /* Assert that we no longer can be called with this special pool. */
2053 gcc_assert (gnat_pool != -1);
2055 /* Check that we aren't violating the associated restriction. */
2056 if (!(Nkind (gnat_node) == N_Allocator && Comes_From_Source (gnat_node)))
2057 Check_No_Implicit_Heap_Alloc (gnat_node);
2059 return maybe_wrap_malloc (gnu_size, gnu_type, gnat_node);
2063 /* Build a GCC tree to correspond to allocating an object of TYPE whose
2064 initial value is INIT, if INIT is nonzero. Convert the expression to
2065 RESULT_TYPE, which must be some type of pointer. Return the tree.
2067 GNAT_PROC and GNAT_POOL optionally give the procedure to call and
2068 the storage pool to use. GNAT_NODE is used to provide an error
2069 location for restriction violation messages. If IGNORE_INIT_TYPE is
2070 true, ignore the type of INIT for the purpose of determining the size;
2071 this will cause the maximum size to be allocated if TYPE is of
2072 self-referential size. */
2075 build_allocator (tree type, tree init, tree result_type, Entity_Id gnat_proc,
2076 Entity_Id gnat_pool, Node_Id gnat_node, bool ignore_init_type)
2078 tree size = TYPE_SIZE_UNIT (type);
2081 /* If the initializer, if present, is a NULL_EXPR, just return a new one. */
2082 if (init && TREE_CODE (init) == NULL_EXPR)
2083 return build1 (NULL_EXPR, result_type, TREE_OPERAND (init, 0));
2085 /* If RESULT_TYPE is a fat or thin pointer, set SIZE to be the sum of the
2086 sizes of the object and its template. Allocate the whole thing and
2087 fill in the parts that are known. */
2088 else if (TYPE_IS_FAT_OR_THIN_POINTER_P (result_type))
2091 = build_unc_object_type_from_ptr (result_type, type,
2092 get_identifier ("ALLOC"), false);
2093 tree template_type = TREE_TYPE (TYPE_FIELDS (storage_type));
2094 tree storage_ptr_type = build_pointer_type (storage_type);
2097 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (storage_type),
2100 /* If the size overflows, pass -1 so the allocator will raise
2102 if (TREE_CODE (size) == INTEGER_CST && TREE_OVERFLOW (size))
2103 size = ssize_int (-1);
2105 storage = build_call_alloc_dealloc (NULL_TREE, size, storage_type,
2106 gnat_proc, gnat_pool, gnat_node);
2107 storage = convert (storage_ptr_type, gnat_protect_expr (storage));
2109 if (TYPE_IS_PADDING_P (type))
2111 type = TREE_TYPE (TYPE_FIELDS (type));
2113 init = convert (type, init);
2116 /* If there is an initializing expression, make a constructor for
2117 the entire object including the bounds and copy it into the
2118 object. If there is no initializing expression, just set the
2122 VEC(constructor_elt,gc) *v = VEC_alloc (constructor_elt, gc, 2);
2124 CONSTRUCTOR_APPEND_ELT (v, TYPE_FIELDS (storage_type),
2125 build_template (template_type, type, init));
2126 CONSTRUCTOR_APPEND_ELT (v, DECL_CHAIN (TYPE_FIELDS (storage_type)),
2131 build2 (COMPOUND_EXPR, storage_ptr_type,
2133 (MODIFY_EXPR, storage_type,
2134 build_unary_op (INDIRECT_REF, NULL_TREE,
2135 convert (storage_ptr_type, storage)),
2136 gnat_build_constructor (storage_type, v)),
2137 convert (storage_ptr_type, storage)));
2141 (COMPOUND_EXPR, result_type,
2143 (MODIFY_EXPR, template_type,
2145 (build_unary_op (INDIRECT_REF, NULL_TREE,
2146 convert (storage_ptr_type, storage)),
2147 NULL_TREE, TYPE_FIELDS (storage_type), false),
2148 build_template (template_type, type, NULL_TREE)),
2149 convert (result_type, convert (storage_ptr_type, storage)));
2152 /* If we have an initializing expression, see if its size is simpler
2153 than the size from the type. */
2154 if (!ignore_init_type && init && TYPE_SIZE_UNIT (TREE_TYPE (init))
2155 && (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (init))) == INTEGER_CST
2156 || CONTAINS_PLACEHOLDER_P (size)))
2157 size = TYPE_SIZE_UNIT (TREE_TYPE (init));
2159 /* If the size is still self-referential, reference the initializing
2160 expression, if it is present. If not, this must have been a
2161 call to allocate a library-level object, in which case we use
2162 the maximum size. */
2163 if (CONTAINS_PLACEHOLDER_P (size))
2165 if (!ignore_init_type && init)
2166 size = substitute_placeholder_in_expr (size, init);
2168 size = max_size (size, true);
2171 /* If the size overflows, pass -1 so the allocator will raise
2173 if (TREE_CODE (size) == INTEGER_CST && TREE_OVERFLOW (size))
2174 size = ssize_int (-1);
2176 result = convert (result_type,
2177 build_call_alloc_dealloc (NULL_TREE, size, type,
2178 gnat_proc, gnat_pool,
2181 /* If we have an initial value, protect the new address, assign the value
2182 and return the address with a COMPOUND_EXPR. */
2185 result = gnat_protect_expr (result);
2187 = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2189 (MODIFY_EXPR, NULL_TREE,
2190 build_unary_op (INDIRECT_REF,
2191 TREE_TYPE (TREE_TYPE (result)), result),
2196 return convert (result_type, result);
2199 /* Fill in a VMS descriptor for EXPR and return a constructor for it.
2200 GNAT_FORMAL is how we find the descriptor record. GNAT_ACTUAL is
2201 how we derive the source location to raise C_E on an out of range
2205 fill_vms_descriptor (tree expr, Entity_Id gnat_formal, Node_Id gnat_actual)
2207 tree parm_decl = get_gnu_tree (gnat_formal);
2208 tree record_type = TREE_TYPE (TREE_TYPE (parm_decl));
2210 const bool do_range_check
2212 IDENTIFIER_POINTER (DECL_NAME (TYPE_FIELDS (record_type))));
2213 VEC(constructor_elt,gc) *v = NULL;
2215 expr = maybe_unconstrained_array (expr);
2216 gnat_mark_addressable (expr);
2218 for (field = TYPE_FIELDS (record_type); field; field = DECL_CHAIN (field))
2220 tree conexpr = convert (TREE_TYPE (field),
2221 SUBSTITUTE_PLACEHOLDER_IN_EXPR
2222 (DECL_INITIAL (field), expr));
2224 /* Check to ensure that only 32-bit pointers are passed in
2225 32-bit descriptors */
2227 && strcmp (IDENTIFIER_POINTER (DECL_NAME (field)), "POINTER") == 0)
2230 = build_pointer_type_for_mode (void_type_node, DImode, false);
2231 tree addr64expr = build_unary_op (ADDR_EXPR, pointer64type, expr);
2233 = build_int_cstu (long_integer_type_node, 0x80000000);
2235 add_stmt (build3 (COND_EXPR, void_type_node,
2236 build_binary_op (GE_EXPR, boolean_type_node,
2237 convert (long_integer_type_node,
2240 build_call_raise (CE_Range_Check_Failed,
2242 N_Raise_Constraint_Error),
2245 CONSTRUCTOR_APPEND_ELT (v, field, conexpr);
2248 return gnat_build_constructor (record_type, v);
2251 /* Indicate that we need to take the address of T and that it therefore
2252 should not be allocated in a register. Returns true if successful. */
2255 gnat_mark_addressable (tree t)
2258 switch (TREE_CODE (t))
2263 case ARRAY_RANGE_REF:
2266 case VIEW_CONVERT_EXPR:
2267 case NON_LVALUE_EXPR:
2269 t = TREE_OPERAND (t, 0);
2273 t = TREE_OPERAND (t, 1);
2277 TREE_ADDRESSABLE (t) = 1;
2283 TREE_ADDRESSABLE (t) = 1;
2287 TREE_ADDRESSABLE (t) = 1;
2291 return DECL_CONST_CORRESPONDING_VAR (t)
2292 && gnat_mark_addressable (DECL_CONST_CORRESPONDING_VAR (t));
2299 /* Save EXP for later use or reuse. This is equivalent to save_expr in tree.c
2300 but we know how to handle our own nodes. */
2303 gnat_save_expr (tree exp)
2305 tree type = TREE_TYPE (exp);
2306 enum tree_code code = TREE_CODE (exp);
2308 if (TREE_CONSTANT (exp) || code == SAVE_EXPR || code == NULL_EXPR)
2311 if (code == UNCONSTRAINED_ARRAY_REF)
2313 tree t = build1 (code, type, gnat_save_expr (TREE_OPERAND (exp, 0)));
2314 TREE_READONLY (t) = TYPE_READONLY (type);
2318 /* If this is a COMPONENT_REF of a fat pointer, save the entire fat pointer.
2319 This may be more efficient, but will also allow us to more easily find
2320 the match for the PLACEHOLDER_EXPR. */
2321 if (code == COMPONENT_REF
2322 && TYPE_IS_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
2323 return build3 (code, type, gnat_save_expr (TREE_OPERAND (exp, 0)),
2324 TREE_OPERAND (exp, 1), TREE_OPERAND (exp, 2));
2326 return save_expr (exp);
2329 /* Protect EXP for immediate reuse. This is a variant of gnat_save_expr that
2330 is optimized under the assumption that EXP's value doesn't change before
2331 its subsequent reuse(s) except through its potential reevaluation. */
2334 gnat_protect_expr (tree exp)
2336 tree type = TREE_TYPE (exp);
2337 enum tree_code code = TREE_CODE (exp);
2339 if (TREE_CONSTANT (exp) || code == SAVE_EXPR || code == NULL_EXPR)
2342 /* If EXP has no side effects, we theoritically don't need to do anything.
2343 However, we may be recursively passed more and more complex expressions
2344 involving checks which will be reused multiple times and eventually be
2345 unshared for gimplification; in order to avoid a complexity explosion
2346 at that point, we protect any expressions more complex than a simple
2347 arithmetic expression. */
2348 if (!TREE_SIDE_EFFECTS (exp))
2350 tree inner = skip_simple_arithmetic (exp);
2351 if (!EXPR_P (inner) || REFERENCE_CLASS_P (inner))
2355 /* If this is a conversion, protect what's inside the conversion. */
2356 if (code == NON_LVALUE_EXPR
2357 || CONVERT_EXPR_CODE_P (code)
2358 || code == VIEW_CONVERT_EXPR)
2359 return build1 (code, type, gnat_protect_expr (TREE_OPERAND (exp, 0)));
2361 /* If we're indirectly referencing something, we only need to protect the
2362 address since the data itself can't change in these situations. */
2363 if (code == INDIRECT_REF || code == UNCONSTRAINED_ARRAY_REF)
2365 tree t = build1 (code, type, gnat_protect_expr (TREE_OPERAND (exp, 0)));
2366 TREE_READONLY (t) = TYPE_READONLY (type);
2370 /* If this is a COMPONENT_REF of a fat pointer, save the entire fat pointer.
2371 This may be more efficient, but will also allow us to more easily find
2372 the match for the PLACEHOLDER_EXPR. */
2373 if (code == COMPONENT_REF
2374 && TYPE_IS_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
2375 return build3 (code, type, gnat_protect_expr (TREE_OPERAND (exp, 0)),
2376 TREE_OPERAND (exp, 1), TREE_OPERAND (exp, 2));
2378 /* If this is a fat pointer or something that can be placed in a register,
2379 just make a SAVE_EXPR. Likewise for a CALL_EXPR as large objects are
2380 returned via invisible reference in most ABIs so the temporary will
2381 directly be filled by the callee. */
2382 if (TYPE_IS_FAT_POINTER_P (type)
2383 || TYPE_MODE (type) != BLKmode
2384 || code == CALL_EXPR)
2385 return save_expr (exp);
2387 /* Otherwise reference, protect the address and dereference. */
2389 build_unary_op (INDIRECT_REF, type,
2390 save_expr (build_unary_op (ADDR_EXPR,
2391 build_reference_type (type),
2395 /* This is equivalent to stabilize_reference_1 in tree.c but we take an extra
2396 argument to force evaluation of everything. */
2399 gnat_stabilize_reference_1 (tree e, bool force)
2401 enum tree_code code = TREE_CODE (e);
2402 tree type = TREE_TYPE (e);
2405 /* We cannot ignore const expressions because it might be a reference
2406 to a const array but whose index contains side-effects. But we can
2407 ignore things that are actual constant or that already have been
2408 handled by this function. */
2409 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2412 switch (TREE_CODE_CLASS (code))
2414 case tcc_exceptional:
2415 case tcc_declaration:
2416 case tcc_comparison:
2417 case tcc_expression:
2420 /* If this is a COMPONENT_REF of a fat pointer, save the entire
2421 fat pointer. This may be more efficient, but will also allow
2422 us to more easily find the match for the PLACEHOLDER_EXPR. */
2423 if (code == COMPONENT_REF
2424 && TYPE_IS_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
2426 = build3 (code, type,
2427 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
2428 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
2429 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2430 so that it will only be evaluated once. */
2431 /* The tcc_reference and tcc_comparison classes could be handled as
2432 below, but it is generally faster to only evaluate them once. */
2433 else if (TREE_SIDE_EFFECTS (e) || force)
2434 return save_expr (e);
2440 /* Recursively stabilize each operand. */
2442 = build2 (code, type,
2443 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
2444 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1), force));
2448 /* Recursively stabilize each operand. */
2450 = build1 (code, type,
2451 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force));
2458 /* See similar handling in gnat_stabilize_reference. */
2459 TREE_READONLY (result) = TREE_READONLY (e);
2460 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
2461 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2463 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
2464 TREE_THIS_NOTRAP (result) = TREE_THIS_NOTRAP (e);
2469 /* This is equivalent to stabilize_reference in tree.c but we know how to
2470 handle our own nodes and we take extra arguments. FORCE says whether to
2471 force evaluation of everything. We set SUCCESS to true unless we walk
2472 through something we don't know how to stabilize. */
2475 gnat_stabilize_reference (tree ref, bool force, bool *success)
2477 tree type = TREE_TYPE (ref);
2478 enum tree_code code = TREE_CODE (ref);
2481 /* Assume we'll success unless proven otherwise. */
2491 /* No action is needed in this case. */
2497 case FIX_TRUNC_EXPR:
2498 case VIEW_CONVERT_EXPR:
2500 = build1 (code, type,
2501 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2506 case UNCONSTRAINED_ARRAY_REF:
2507 result = build1 (code, type,
2508 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
2513 result = build3 (COMPONENT_REF, type,
2514 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2516 TREE_OPERAND (ref, 1), NULL_TREE);
2520 result = build3 (BIT_FIELD_REF, type,
2521 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2523 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
2525 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
2530 case ARRAY_RANGE_REF:
2531 result = build4 (code, type,
2532 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2534 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
2536 NULL_TREE, NULL_TREE);
2540 result = gnat_stabilize_reference_1 (ref, force);
2544 result = build2 (COMPOUND_EXPR, type,
2545 gnat_stabilize_reference (TREE_OPERAND (ref, 0), force,
2547 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
2552 /* Constructors with 1 element are used extensively to formally
2553 convert objects to special wrapping types. */
2554 if (TREE_CODE (type) == RECORD_TYPE
2555 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
2558 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
2560 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
2562 = build_constructor_single (type, index,
2563 gnat_stabilize_reference_1 (value,
2575 ref = error_mark_node;
2577 /* ... fall through to failure ... */
2579 /* If arg isn't a kind of lvalue we recognize, make no change.
2580 Caller should recognize the error for an invalid lvalue. */
2587 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS set on the initial expression
2588 may not be sustained across some paths, such as the way via build1 for
2589 INDIRECT_REF. We reset those flags here in the general case, which is
2590 consistent with the GCC version of this routine.
2592 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
2593 paths introduce side-effects where there was none initially (e.g. if a
2594 SAVE_EXPR is built) and we also want to keep track of that. */
2595 TREE_READONLY (result) = TREE_READONLY (ref);
2596 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
2597 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);