1 // expressions.cc -- Go frontend expression handling.
3 // Copyright 2009 The Go Authors. All rights reserved.
4 // Use of this source code is governed by a BSD-style
5 // license that can be found in the LICENSE file.
11 #ifndef ENABLE_BUILD_WITH_CXX
20 #include "tree-iterator.h"
25 #ifndef ENABLE_BUILD_WITH_CXX
34 #include "statements.h"
36 #include "expressions.h"
40 Expression::Expression(Expression_classification classification
,
41 source_location location
)
42 : classification_(classification
), location_(location
)
46 Expression::~Expression()
50 // If this expression has a constant integer value, return it.
53 Expression::integer_constant_value(bool iota_is_constant
, mpz_t val
,
57 return this->do_integer_constant_value(iota_is_constant
, val
, ptype
);
60 // If this expression has a constant floating point value, return it.
63 Expression::float_constant_value(mpfr_t val
, Type
** ptype
) const
66 if (this->do_float_constant_value(val
, ptype
))
72 if (!this->do_integer_constant_value(false, ival
, &t
))
76 mpfr_set_z(val
, ival
, GMP_RNDN
);
83 // If this expression has a constant complex value, return it.
86 Expression::complex_constant_value(mpfr_t real
, mpfr_t imag
,
90 if (this->do_complex_constant_value(real
, imag
, ptype
))
93 if (this->float_constant_value(real
, &t
))
95 mpfr_set_ui(imag
, 0, GMP_RNDN
);
101 // Traverse the expressions.
104 Expression::traverse(Expression
** pexpr
, Traverse
* traverse
)
106 Expression
* expr
= *pexpr
;
107 if ((traverse
->traverse_mask() & Traverse::traverse_expressions
) != 0)
109 int t
= traverse
->expression(pexpr
);
110 if (t
== TRAVERSE_EXIT
)
111 return TRAVERSE_EXIT
;
112 else if (t
== TRAVERSE_SKIP_COMPONENTS
)
113 return TRAVERSE_CONTINUE
;
115 return expr
->do_traverse(traverse
);
118 // Traverse subexpressions of this expression.
121 Expression::traverse_subexpressions(Traverse
* traverse
)
123 return this->do_traverse(traverse
);
126 // Default implementation for do_traverse for child classes.
129 Expression::do_traverse(Traverse
*)
131 return TRAVERSE_CONTINUE
;
134 // This virtual function is called by the parser if the value of this
135 // expression is being discarded. By default, we warn. Expressions
136 // with side effects override.
139 Expression::do_discarding_value()
141 this->warn_about_unused_value();
144 // This virtual function is called to export expressions. This will
145 // only be used by expressions which may be constant.
148 Expression::do_export(Export
*) const
153 // Warn that the value of the expression is not used.
156 Expression::warn_about_unused_value()
158 warning_at(this->location(), OPT_Wunused_value
, "value computed is not used");
161 // Note that this expression is an error. This is called by children
162 // when they discover an error.
165 Expression::set_is_error()
167 this->classification_
= EXPRESSION_ERROR
;
170 // For children to call to report an error conveniently.
173 Expression::report_error(const char* msg
)
175 error_at(this->location_
, "%s", msg
);
176 this->set_is_error();
179 // Set types of variables and constants. This is implemented by the
183 Expression::determine_type(const Type_context
* context
)
185 this->do_determine_type(context
);
188 // Set types when there is no context.
191 Expression::determine_type_no_context()
193 Type_context context
;
194 this->do_determine_type(&context
);
197 // Return a tree handling any conversions which must be done during
201 Expression::convert_for_assignment(Translate_context
* context
, Type
* lhs_type
,
202 Type
* rhs_type
, tree rhs_tree
,
203 source_location location
)
205 if (lhs_type
== rhs_type
)
208 if (lhs_type
->is_error_type() || rhs_type
->is_error_type())
209 return error_mark_node
;
211 if (lhs_type
->is_undefined() || rhs_type
->is_undefined())
213 // Make sure we report the error.
216 return error_mark_node
;
219 if (rhs_tree
== error_mark_node
|| TREE_TYPE(rhs_tree
) == error_mark_node
)
220 return error_mark_node
;
222 Gogo
* gogo
= context
->gogo();
224 tree lhs_type_tree
= lhs_type
->get_tree(gogo
);
225 if (lhs_type_tree
== error_mark_node
)
226 return error_mark_node
;
228 if (lhs_type
->interface_type() != NULL
)
230 if (rhs_type
->interface_type() == NULL
)
231 return Expression::convert_type_to_interface(context
, lhs_type
,
235 return Expression::convert_interface_to_interface(context
, lhs_type
,
239 else if (rhs_type
->interface_type() != NULL
)
240 return Expression::convert_interface_to_type(context
, lhs_type
, rhs_type
,
242 else if (lhs_type
->is_open_array_type()
243 && rhs_type
->is_nil_type())
245 // Assigning nil to an open array.
246 gcc_assert(TREE_CODE(lhs_type_tree
) == RECORD_TYPE
);
248 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 3);
250 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
251 tree field
= TYPE_FIELDS(lhs_type_tree
);
252 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),
255 elt
->value
= fold_convert(TREE_TYPE(field
), null_pointer_node
);
257 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
258 field
= DECL_CHAIN(field
);
259 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),
262 elt
->value
= fold_convert(TREE_TYPE(field
), integer_zero_node
);
264 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
265 field
= DECL_CHAIN(field
);
266 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),
269 elt
->value
= fold_convert(TREE_TYPE(field
), integer_zero_node
);
271 tree val
= build_constructor(lhs_type_tree
, init
);
272 TREE_CONSTANT(val
) = 1;
276 else if (rhs_type
->is_nil_type())
278 // The left hand side should be a pointer type at the tree
280 gcc_assert(POINTER_TYPE_P(lhs_type_tree
));
281 return fold_convert(lhs_type_tree
, null_pointer_node
);
283 else if (lhs_type_tree
== TREE_TYPE(rhs_tree
))
285 // No conversion is needed.
288 else if (POINTER_TYPE_P(lhs_type_tree
)
289 || INTEGRAL_TYPE_P(lhs_type_tree
)
290 || SCALAR_FLOAT_TYPE_P(lhs_type_tree
)
291 || COMPLEX_FLOAT_TYPE_P(lhs_type_tree
))
292 return fold_convert_loc(location
, lhs_type_tree
, rhs_tree
);
293 else if (TREE_CODE(lhs_type_tree
) == RECORD_TYPE
294 && TREE_CODE(TREE_TYPE(rhs_tree
)) == RECORD_TYPE
)
296 // This conversion must be permitted by Go, or we wouldn't have
298 gcc_assert(int_size_in_bytes(lhs_type_tree
)
299 == int_size_in_bytes(TREE_TYPE(rhs_tree
)));
300 return fold_build1_loc(location
, VIEW_CONVERT_EXPR
, lhs_type_tree
,
305 gcc_assert(useless_type_conversion_p(lhs_type_tree
, TREE_TYPE(rhs_tree
)));
310 // Return a tree for a conversion from a non-interface type to an
314 Expression::convert_type_to_interface(Translate_context
* context
,
315 Type
* lhs_type
, Type
* rhs_type
,
316 tree rhs_tree
, source_location location
)
318 Gogo
* gogo
= context
->gogo();
319 Interface_type
* lhs_interface_type
= lhs_type
->interface_type();
320 bool lhs_is_empty
= lhs_interface_type
->is_empty();
322 // Since RHS_TYPE is a static type, we can create the interface
323 // method table at compile time.
325 // When setting an interface to nil, we just set both fields to
327 if (rhs_type
->is_nil_type())
328 return lhs_type
->get_init_tree(gogo
, false);
330 // This should have been checked already.
331 gcc_assert(lhs_interface_type
->implements_interface(rhs_type
, NULL
));
333 tree lhs_type_tree
= lhs_type
->get_tree(gogo
);
334 if (lhs_type_tree
== error_mark_node
)
335 return error_mark_node
;
337 // An interface is a tuple. If LHS_TYPE is an empty interface type,
338 // then the first field is the type descriptor for RHS_TYPE.
339 // Otherwise it is the interface method table for RHS_TYPE.
340 tree first_field_value
;
342 first_field_value
= rhs_type
->type_descriptor_pointer(gogo
);
345 // Build the interface method table for this interface and this
346 // object type: a list of function pointers for each interface
348 Named_type
* rhs_named_type
= rhs_type
->named_type();
349 bool is_pointer
= false;
350 if (rhs_named_type
== NULL
)
352 rhs_named_type
= rhs_type
->deref()->named_type();
356 if (rhs_named_type
== NULL
)
357 method_table
= null_pointer_node
;
360 rhs_named_type
->interface_method_table(gogo
, lhs_interface_type
,
362 first_field_value
= fold_convert_loc(location
, const_ptr_type_node
,
366 // Start building a constructor for the value we will return.
368 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 2);
370 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
371 tree field
= TYPE_FIELDS(lhs_type_tree
);
372 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),
373 (lhs_is_empty
? "__type_descriptor" : "__methods")) == 0);
375 elt
->value
= fold_convert_loc(location
, TREE_TYPE(field
), first_field_value
);
377 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
378 field
= DECL_CHAIN(field
);
379 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__object") == 0);
382 if (rhs_type
->points_to() != NULL
)
384 // We are assigning a pointer to the interface; the interface
385 // holds the pointer itself.
386 elt
->value
= rhs_tree
;
387 return build_constructor(lhs_type_tree
, init
);
390 // We are assigning a non-pointer value to the interface; the
391 // interface gets a copy of the value in the heap.
393 tree object_size
= TYPE_SIZE_UNIT(TREE_TYPE(rhs_tree
));
395 tree space
= gogo
->allocate_memory(rhs_type
, object_size
, location
);
396 space
= fold_convert_loc(location
, build_pointer_type(TREE_TYPE(rhs_tree
)),
398 space
= save_expr(space
);
400 tree ref
= build_fold_indirect_ref_loc(location
, space
);
401 TREE_THIS_NOTRAP(ref
) = 1;
402 tree set
= fold_build2_loc(location
, MODIFY_EXPR
, void_type_node
,
405 elt
->value
= fold_convert_loc(location
, TREE_TYPE(field
), space
);
407 return build2(COMPOUND_EXPR
, lhs_type_tree
, set
,
408 build_constructor(lhs_type_tree
, init
));
411 // Return a tree for the type descriptor of RHS_TREE, which has
412 // interface type RHS_TYPE. If RHS_TREE is nil the result will be
416 Expression::get_interface_type_descriptor(Translate_context
*,
417 Type
* rhs_type
, tree rhs_tree
,
418 source_location location
)
420 tree rhs_type_tree
= TREE_TYPE(rhs_tree
);
421 gcc_assert(TREE_CODE(rhs_type_tree
) == RECORD_TYPE
);
422 tree rhs_field
= TYPE_FIELDS(rhs_type_tree
);
423 tree v
= build3(COMPONENT_REF
, TREE_TYPE(rhs_field
), rhs_tree
, rhs_field
,
425 if (rhs_type
->interface_type()->is_empty())
427 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(rhs_field
)),
428 "__type_descriptor") == 0);
432 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(rhs_field
)), "__methods")
434 gcc_assert(POINTER_TYPE_P(TREE_TYPE(v
)));
436 tree v1
= build_fold_indirect_ref_loc(location
, v
);
437 gcc_assert(TREE_CODE(TREE_TYPE(v1
)) == RECORD_TYPE
);
438 tree f
= TYPE_FIELDS(TREE_TYPE(v1
));
439 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(f
)), "__type_descriptor")
441 v1
= build3(COMPONENT_REF
, TREE_TYPE(f
), v1
, f
, NULL_TREE
);
443 tree eq
= fold_build2_loc(location
, EQ_EXPR
, boolean_type_node
, v
,
444 fold_convert_loc(location
, TREE_TYPE(v
),
446 tree n
= fold_convert_loc(location
, TREE_TYPE(v1
), null_pointer_node
);
447 return fold_build3_loc(location
, COND_EXPR
, TREE_TYPE(v1
),
451 // Return a tree for the conversion of an interface type to an
455 Expression::convert_interface_to_interface(Translate_context
* context
,
456 Type
*lhs_type
, Type
*rhs_type
,
457 tree rhs_tree
, bool for_type_guard
,
458 source_location location
)
460 Gogo
* gogo
= context
->gogo();
461 Interface_type
* lhs_interface_type
= lhs_type
->interface_type();
462 bool lhs_is_empty
= lhs_interface_type
->is_empty();
464 tree lhs_type_tree
= lhs_type
->get_tree(gogo
);
465 if (lhs_type_tree
== error_mark_node
)
466 return error_mark_node
;
468 // In the general case this requires runtime examination of the type
469 // method table to match it up with the interface methods.
471 // FIXME: If all of the methods in the right hand side interface
472 // also appear in the left hand side interface, then we don't need
473 // to do a runtime check, although we still need to build a new
476 // Get the type descriptor for the right hand side. This will be
477 // NULL for a nil interface.
479 if (!DECL_P(rhs_tree
))
480 rhs_tree
= save_expr(rhs_tree
);
482 tree rhs_type_descriptor
=
483 Expression::get_interface_type_descriptor(context
, rhs_type
, rhs_tree
,
486 // The result is going to be a two element constructor.
488 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 2);
490 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
491 tree field
= TYPE_FIELDS(lhs_type_tree
);
496 // A type assertion fails when converting a nil interface.
497 tree lhs_type_descriptor
= lhs_type
->type_descriptor_pointer(gogo
);
498 static tree assert_interface_decl
;
499 tree call
= Gogo::call_builtin(&assert_interface_decl
,
501 "__go_assert_interface",
504 TREE_TYPE(lhs_type_descriptor
),
506 TREE_TYPE(rhs_type_descriptor
),
507 rhs_type_descriptor
);
508 if (call
== error_mark_node
)
509 return error_mark_node
;
510 // This will panic if the interface conversion fails.
511 TREE_NOTHROW(assert_interface_decl
) = 0;
512 elt
->value
= fold_convert_loc(location
, TREE_TYPE(field
), call
);
514 else if (lhs_is_empty
)
516 // A convertion to an empty interface always succeeds, and the
517 // first field is just the type descriptor of the object.
518 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),
519 "__type_descriptor") == 0);
520 gcc_assert(TREE_TYPE(field
) == TREE_TYPE(rhs_type_descriptor
));
521 elt
->value
= rhs_type_descriptor
;
525 // A conversion to a non-empty interface may fail, but unlike a
526 // type assertion converting nil will always succeed.
527 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__methods")
529 tree lhs_type_descriptor
= lhs_type
->type_descriptor_pointer(gogo
);
530 static tree convert_interface_decl
;
531 tree call
= Gogo::call_builtin(&convert_interface_decl
,
533 "__go_convert_interface",
536 TREE_TYPE(lhs_type_descriptor
),
538 TREE_TYPE(rhs_type_descriptor
),
539 rhs_type_descriptor
);
540 if (call
== error_mark_node
)
541 return error_mark_node
;
542 // This will panic if the interface conversion fails.
543 TREE_NOTHROW(convert_interface_decl
) = 0;
544 elt
->value
= fold_convert_loc(location
, TREE_TYPE(field
), call
);
547 // The second field is simply the object pointer.
549 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
550 field
= DECL_CHAIN(field
);
551 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__object") == 0);
554 tree rhs_type_tree
= TREE_TYPE(rhs_tree
);
555 gcc_assert(TREE_CODE(rhs_type_tree
) == RECORD_TYPE
);
556 tree rhs_field
= DECL_CHAIN(TYPE_FIELDS(rhs_type_tree
));
557 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(rhs_field
)), "__object") == 0);
558 elt
->value
= build3(COMPONENT_REF
, TREE_TYPE(rhs_field
), rhs_tree
, rhs_field
,
561 return build_constructor(lhs_type_tree
, init
);
564 // Return a tree for the conversion of an interface type to a
565 // non-interface type.
568 Expression::convert_interface_to_type(Translate_context
* context
,
569 Type
*lhs_type
, Type
* rhs_type
,
570 tree rhs_tree
, source_location location
)
572 Gogo
* gogo
= context
->gogo();
573 tree rhs_type_tree
= TREE_TYPE(rhs_tree
);
575 tree lhs_type_tree
= lhs_type
->get_tree(gogo
);
576 if (lhs_type_tree
== error_mark_node
)
577 return error_mark_node
;
579 // Call a function to check that the type is valid. The function
580 // will panic with an appropriate runtime type error if the type is
583 tree lhs_type_descriptor
= lhs_type
->type_descriptor_pointer(gogo
);
585 if (!DECL_P(rhs_tree
))
586 rhs_tree
= save_expr(rhs_tree
);
588 tree rhs_type_descriptor
=
589 Expression::get_interface_type_descriptor(context
, rhs_type
, rhs_tree
,
592 tree rhs_inter_descriptor
= rhs_type
->type_descriptor_pointer(gogo
);
594 static tree check_interface_type_decl
;
595 tree call
= Gogo::call_builtin(&check_interface_type_decl
,
597 "__go_check_interface_type",
600 TREE_TYPE(lhs_type_descriptor
),
602 TREE_TYPE(rhs_type_descriptor
),
604 TREE_TYPE(rhs_inter_descriptor
),
605 rhs_inter_descriptor
);
606 if (call
== error_mark_node
)
607 return error_mark_node
;
608 // This call will panic if the conversion is invalid.
609 TREE_NOTHROW(check_interface_type_decl
) = 0;
611 // If the call succeeds, pull out the value.
612 gcc_assert(TREE_CODE(rhs_type_tree
) == RECORD_TYPE
);
613 tree rhs_field
= DECL_CHAIN(TYPE_FIELDS(rhs_type_tree
));
614 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(rhs_field
)), "__object") == 0);
615 tree val
= build3(COMPONENT_REF
, TREE_TYPE(rhs_field
), rhs_tree
, rhs_field
,
618 // If the value is a pointer, then it is the value we want.
619 // Otherwise it points to the value.
620 if (lhs_type
->points_to() == NULL
)
622 val
= fold_convert_loc(location
, build_pointer_type(lhs_type_tree
), val
);
623 val
= build_fold_indirect_ref_loc(location
, val
);
626 return build2(COMPOUND_EXPR
, lhs_type_tree
, call
,
627 fold_convert_loc(location
, lhs_type_tree
, val
));
630 // Convert an expression to a tree. This is implemented by the child
631 // class. Not that it is not in general safe to call this multiple
632 // times for a single expression, but that we don't catch such errors.
635 Expression::get_tree(Translate_context
* context
)
637 // The child may have marked this expression as having an error.
638 if (this->classification_
== EXPRESSION_ERROR
)
639 return error_mark_node
;
641 return this->do_get_tree(context
);
644 // Return a tree for VAL in TYPE.
647 Expression::integer_constant_tree(mpz_t val
, tree type
)
649 if (type
== error_mark_node
)
650 return error_mark_node
;
651 else if (TREE_CODE(type
) == INTEGER_TYPE
)
652 return double_int_to_tree(type
,
653 mpz_get_double_int(type
, val
, true));
654 else if (TREE_CODE(type
) == REAL_TYPE
)
657 mpfr_init_set_z(fval
, val
, GMP_RNDN
);
658 tree ret
= Expression::float_constant_tree(fval
, type
);
662 else if (TREE_CODE(type
) == COMPLEX_TYPE
)
665 mpfr_init_set_z(fval
, val
, GMP_RNDN
);
666 tree real
= Expression::float_constant_tree(fval
, TREE_TYPE(type
));
668 tree imag
= build_real_from_int_cst(TREE_TYPE(type
),
670 return build_complex(type
, real
, imag
);
676 // Return a tree for VAL in TYPE.
679 Expression::float_constant_tree(mpfr_t val
, tree type
)
681 if (type
== error_mark_node
)
682 return error_mark_node
;
683 else if (TREE_CODE(type
) == INTEGER_TYPE
)
687 mpfr_get_z(ival
, val
, GMP_RNDN
);
688 tree ret
= Expression::integer_constant_tree(ival
, type
);
692 else if (TREE_CODE(type
) == REAL_TYPE
)
695 real_from_mpfr(&r1
, val
, type
, GMP_RNDN
);
697 real_convert(&r2
, TYPE_MODE(type
), &r1
);
698 return build_real(type
, r2
);
700 else if (TREE_CODE(type
) == COMPLEX_TYPE
)
703 real_from_mpfr(&r1
, val
, TREE_TYPE(type
), GMP_RNDN
);
705 real_convert(&r2
, TYPE_MODE(TREE_TYPE(type
)), &r1
);
706 tree imag
= build_real_from_int_cst(TREE_TYPE(type
),
708 return build_complex(type
, build_real(TREE_TYPE(type
), r2
), imag
);
714 // Return a tree for REAL/IMAG in TYPE.
717 Expression::complex_constant_tree(mpfr_t real
, mpfr_t imag
, tree type
)
719 if (TREE_CODE(type
) == COMPLEX_TYPE
)
722 real_from_mpfr(&r1
, real
, TREE_TYPE(type
), GMP_RNDN
);
724 real_convert(&r2
, TYPE_MODE(TREE_TYPE(type
)), &r1
);
727 real_from_mpfr(&r3
, imag
, TREE_TYPE(type
), GMP_RNDN
);
729 real_convert(&r4
, TYPE_MODE(TREE_TYPE(type
)), &r3
);
731 return build_complex(type
, build_real(TREE_TYPE(type
), r2
),
732 build_real(TREE_TYPE(type
), r4
));
738 // Return a tree which evaluates to true if VAL, of arbitrary integer
739 // type, is negative or is more than the maximum value of BOUND_TYPE.
740 // If SOFAR is not NULL, it is or'red into the result. The return
741 // value may be NULL if SOFAR is NULL.
744 Expression::check_bounds(tree val
, tree bound_type
, tree sofar
,
747 tree val_type
= TREE_TYPE(val
);
748 tree ret
= NULL_TREE
;
750 if (!TYPE_UNSIGNED(val_type
))
752 ret
= fold_build2_loc(loc
, LT_EXPR
, boolean_type_node
, val
,
753 build_int_cst(val_type
, 0));
754 if (ret
== boolean_false_node
)
758 if ((TYPE_UNSIGNED(val_type
) && !TYPE_UNSIGNED(bound_type
))
759 || TYPE_SIZE(val_type
) > TYPE_SIZE(bound_type
))
761 tree max
= TYPE_MAX_VALUE(bound_type
);
762 tree big
= fold_build2_loc(loc
, GT_EXPR
, boolean_type_node
, val
,
763 fold_convert_loc(loc
, val_type
, max
));
764 if (big
== boolean_false_node
)
766 else if (ret
== NULL_TREE
)
769 ret
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
773 if (ret
== NULL_TREE
)
775 else if (sofar
== NULL_TREE
)
778 return fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
782 // Error expressions. This are used to avoid cascading errors.
784 class Error_expression
: public Expression
787 Error_expression(source_location location
)
788 : Expression(EXPRESSION_ERROR
, location
)
793 do_is_constant() const
797 do_integer_constant_value(bool, mpz_t val
, Type
**) const
804 do_float_constant_value(mpfr_t val
, Type
**) const
806 mpfr_set_ui(val
, 0, GMP_RNDN
);
811 do_complex_constant_value(mpfr_t real
, mpfr_t imag
, Type
**) const
813 mpfr_set_ui(real
, 0, GMP_RNDN
);
814 mpfr_set_ui(imag
, 0, GMP_RNDN
);
819 do_discarding_value()
824 { return Type::make_error_type(); }
827 do_determine_type(const Type_context
*)
835 do_is_addressable() const
839 do_get_tree(Translate_context
*)
840 { return error_mark_node
; }
844 Expression::make_error(source_location location
)
846 return new Error_expression(location
);
849 // An expression which is really a type. This is used during parsing.
850 // It is an error if these survive after lowering.
853 Type_expression
: public Expression
856 Type_expression(Type
* type
, source_location location
)
857 : Expression(EXPRESSION_TYPE
, location
),
863 do_traverse(Traverse
* traverse
)
864 { return Type::traverse(this->type_
, traverse
); }
868 { return this->type_
; }
871 do_determine_type(const Type_context
*)
875 do_check_types(Gogo
*)
876 { this->report_error(_("invalid use of type")); }
883 do_get_tree(Translate_context
*)
884 { gcc_unreachable(); }
887 // The type which we are representing as an expression.
892 Expression::make_type(Type
* type
, source_location location
)
894 return new Type_expression(type
, location
);
897 // Class Parser_expression.
900 Parser_expression::do_type()
902 // We should never really ask for the type of a Parser_expression.
903 // However, it can happen, at least when we have an invalid const
904 // whose initializer refers to the const itself. In that case we
905 // may ask for the type when lowering the const itself.
906 gcc_assert(saw_errors());
907 return Type::make_error_type();
910 // Class Var_expression.
912 // Lower a variable expression. Here we just make sure that the
913 // initialization expression of the variable has been lowered. This
914 // ensures that we will be able to determine the type of the variable
918 Var_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
920 if (this->variable_
->is_variable())
922 Variable
* var
= this->variable_
->var_value();
923 // This is either a local variable or a global variable. A
924 // reference to a variable which is local to an enclosing
925 // function will be a reference to a field in a closure.
926 if (var
->is_global())
928 var
->lower_init_expression(gogo
, function
);
933 // Return the name of the variable.
936 Var_expression::name() const
938 return this->variable_
->name();
941 // Return the type of a reference to a variable.
944 Var_expression::do_type()
946 if (this->variable_
->is_variable())
947 return this->variable_
->var_value()->type();
948 else if (this->variable_
->is_result_variable())
949 return this->variable_
->result_var_value()->type();
954 // Something takes the address of this variable. This means that we
955 // may want to move the variable onto the heap.
958 Var_expression::do_address_taken(bool escapes
)
962 else if (this->variable_
->is_variable())
963 this->variable_
->var_value()->set_address_taken();
964 else if (this->variable_
->is_result_variable())
965 this->variable_
->result_var_value()->set_address_taken();
970 // Get the tree for a reference to a variable.
973 Var_expression::do_get_tree(Translate_context
* context
)
975 return this->variable_
->get_tree(context
->gogo(), context
->function());
978 // Make a reference to a variable in an expression.
981 Expression::make_var_reference(Named_object
* var
, source_location location
)
984 return Expression::make_sink(location
);
986 // FIXME: Creating a new object for each reference to a variable is
988 return new Var_expression(var
, location
);
991 // Class Temporary_reference_expression.
996 Temporary_reference_expression::do_type()
998 return this->statement_
->type();
1001 // Called if something takes the address of this temporary variable.
1002 // We never have to move temporary variables to the heap, but we do
1003 // need to know that they must live in the stack rather than in a
1007 Temporary_reference_expression::do_address_taken(bool)
1009 this->statement_
->set_is_address_taken();
1012 // Get a tree referring to the variable.
1015 Temporary_reference_expression::do_get_tree(Translate_context
*)
1017 return this->statement_
->get_decl();
1020 // Make a reference to a temporary variable.
1023 Expression::make_temporary_reference(Temporary_statement
* statement
,
1024 source_location location
)
1026 return new Temporary_reference_expression(statement
, location
);
1029 // A sink expression--a use of the blank identifier _.
1031 class Sink_expression
: public Expression
1034 Sink_expression(source_location location
)
1035 : Expression(EXPRESSION_SINK
, location
),
1036 type_(NULL
), var_(NULL_TREE
)
1041 do_discarding_value()
1048 do_determine_type(const Type_context
*);
1052 { return new Sink_expression(this->location()); }
1055 do_get_tree(Translate_context
*);
1058 // The type of this sink variable.
1060 // The temporary variable we generate.
1064 // Return the type of a sink expression.
1067 Sink_expression::do_type()
1069 if (this->type_
== NULL
)
1070 return Type::make_sink_type();
1074 // Determine the type of a sink expression.
1077 Sink_expression::do_determine_type(const Type_context
* context
)
1079 if (context
->type
!= NULL
)
1080 this->type_
= context
->type
;
1083 // Return a temporary variable for a sink expression. This will
1084 // presumably be a write-only variable which the middle-end will drop.
1087 Sink_expression::do_get_tree(Translate_context
* context
)
1089 if (this->var_
== NULL_TREE
)
1091 gcc_assert(this->type_
!= NULL
&& !this->type_
->is_sink_type());
1092 this->var_
= create_tmp_var(this->type_
->get_tree(context
->gogo()),
1098 // Make a sink expression.
1101 Expression::make_sink(source_location location
)
1103 return new Sink_expression(location
);
1106 // Class Func_expression.
1108 // FIXME: Can a function expression appear in a constant expression?
1109 // The value is unchanging. Initializing a constant to the address of
1110 // a function seems like it could work, though there might be little
1113 // Return the name of the function.
1116 Func_expression::name() const
1118 return this->function_
->name();
1124 Func_expression::do_traverse(Traverse
* traverse
)
1126 return (this->closure_
== NULL
1128 : Expression::traverse(&this->closure_
, traverse
));
1131 // Return the type of a function expression.
1134 Func_expression::do_type()
1136 if (this->function_
->is_function())
1137 return this->function_
->func_value()->type();
1138 else if (this->function_
->is_function_declaration())
1139 return this->function_
->func_declaration_value()->type();
1144 // Get the tree for a function expression without evaluating the
1148 Func_expression::get_tree_without_closure(Gogo
* gogo
)
1150 Function_type
* fntype
;
1151 if (this->function_
->is_function())
1152 fntype
= this->function_
->func_value()->type();
1153 else if (this->function_
->is_function_declaration())
1154 fntype
= this->function_
->func_declaration_value()->type();
1158 // Builtin functions are handled specially by Call_expression. We
1159 // can't take their address.
1160 if (fntype
->is_builtin())
1162 error_at(this->location(), "invalid use of special builtin function %qs",
1163 this->function_
->name().c_str());
1164 return error_mark_node
;
1167 Named_object
* no
= this->function_
;
1169 tree id
= no
->get_id(gogo
);
1170 if (id
== error_mark_node
)
1171 return error_mark_node
;
1174 if (no
->is_function())
1175 fndecl
= no
->func_value()->get_or_make_decl(gogo
, no
, id
);
1176 else if (no
->is_function_declaration())
1177 fndecl
= no
->func_declaration_value()->get_or_make_decl(gogo
, no
, id
);
1181 if (fndecl
== error_mark_node
)
1182 return error_mark_node
;
1184 return build_fold_addr_expr_loc(this->location(), fndecl
);
1187 // Get the tree for a function expression. This is used when we take
1188 // the address of a function rather than simply calling it. If the
1189 // function has a closure, we must use a trampoline.
1192 Func_expression::do_get_tree(Translate_context
* context
)
1194 Gogo
* gogo
= context
->gogo();
1196 tree fnaddr
= this->get_tree_without_closure(gogo
);
1197 if (fnaddr
== error_mark_node
)
1198 return error_mark_node
;
1200 gcc_assert(TREE_CODE(fnaddr
) == ADDR_EXPR
1201 && TREE_CODE(TREE_OPERAND(fnaddr
, 0)) == FUNCTION_DECL
);
1202 TREE_ADDRESSABLE(TREE_OPERAND(fnaddr
, 0)) = 1;
1204 // For a normal non-nested function call, that is all we have to do.
1205 if (!this->function_
->is_function()
1206 || this->function_
->func_value()->enclosing() == NULL
)
1208 gcc_assert(this->closure_
== NULL
);
1212 // For a nested function call, we have to always allocate a
1213 // trampoline. If we don't always allocate, then closures will not
1214 // be reliably distinct.
1215 Expression
* closure
= this->closure_
;
1217 if (closure
== NULL
)
1218 closure_tree
= null_pointer_node
;
1221 // Get the value of the closure. This will be a pointer to
1222 // space allocated on the heap.
1223 closure_tree
= closure
->get_tree(context
);
1224 if (closure_tree
== error_mark_node
)
1225 return error_mark_node
;
1226 gcc_assert(POINTER_TYPE_P(TREE_TYPE(closure_tree
)));
1229 // Now we need to build some code on the heap. This code will load
1230 // the static chain pointer with the closure and then jump to the
1231 // body of the function. The normal gcc approach is to build the
1232 // code on the stack. Unfortunately we can not do that, as Go
1233 // permits us to return the function pointer.
1235 return gogo
->make_trampoline(fnaddr
, closure_tree
, this->location());
1238 // Make a reference to a function in an expression.
1241 Expression::make_func_reference(Named_object
* function
, Expression
* closure
,
1242 source_location location
)
1244 return new Func_expression(function
, closure
, location
);
1247 // Class Unknown_expression.
1249 // Return the name of an unknown expression.
1252 Unknown_expression::name() const
1254 return this->named_object_
->name();
1257 // Lower a reference to an unknown name.
1260 Unknown_expression::do_lower(Gogo
*, Named_object
*, int)
1262 source_location location
= this->location();
1263 Named_object
* no
= this->named_object_
;
1265 if (!no
->is_unknown())
1269 real
= no
->unknown_value()->real_named_object();
1272 if (this->is_composite_literal_key_
)
1274 error_at(location
, "reference to undefined name %qs",
1275 this->named_object_
->message_name().c_str());
1276 return Expression::make_error(location
);
1279 switch (real
->classification())
1281 case Named_object::NAMED_OBJECT_CONST
:
1282 return Expression::make_const_reference(real
, location
);
1283 case Named_object::NAMED_OBJECT_TYPE
:
1284 return Expression::make_type(real
->type_value(), location
);
1285 case Named_object::NAMED_OBJECT_TYPE_DECLARATION
:
1286 if (this->is_composite_literal_key_
)
1288 error_at(location
, "reference to undefined type %qs",
1289 real
->message_name().c_str());
1290 return Expression::make_error(location
);
1291 case Named_object::NAMED_OBJECT_VAR
:
1292 return Expression::make_var_reference(real
, location
);
1293 case Named_object::NAMED_OBJECT_FUNC
:
1294 case Named_object::NAMED_OBJECT_FUNC_DECLARATION
:
1295 return Expression::make_func_reference(real
, NULL
, location
);
1296 case Named_object::NAMED_OBJECT_PACKAGE
:
1297 if (this->is_composite_literal_key_
)
1299 error_at(location
, "unexpected reference to package");
1300 return Expression::make_error(location
);
1306 // Make a reference to an unknown name.
1309 Expression::make_unknown_reference(Named_object
* no
, source_location location
)
1311 gcc_assert(no
->resolve()->is_unknown());
1312 return new Unknown_expression(no
, location
);
1315 // A boolean expression.
1317 class Boolean_expression
: public Expression
1320 Boolean_expression(bool val
, source_location location
)
1321 : Expression(EXPRESSION_BOOLEAN
, location
),
1322 val_(val
), type_(NULL
)
1330 do_is_constant() const
1337 do_determine_type(const Type_context
*);
1344 do_get_tree(Translate_context
*)
1345 { return this->val_
? boolean_true_node
: boolean_false_node
; }
1348 do_export(Export
* exp
) const
1349 { exp
->write_c_string(this->val_
? "true" : "false"); }
1354 // The type as determined by context.
1361 Boolean_expression::do_type()
1363 if (this->type_
== NULL
)
1364 this->type_
= Type::make_boolean_type();
1368 // Set the type from the context.
1371 Boolean_expression::do_determine_type(const Type_context
* context
)
1373 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1375 else if (context
->type
!= NULL
&& context
->type
->is_boolean_type())
1376 this->type_
= context
->type
;
1377 else if (!context
->may_be_abstract
)
1378 this->type_
= Type::lookup_bool_type();
1381 // Import a boolean constant.
1384 Boolean_expression::do_import(Import
* imp
)
1386 if (imp
->peek_char() == 't')
1388 imp
->require_c_string("true");
1389 return Expression::make_boolean(true, imp
->location());
1393 imp
->require_c_string("false");
1394 return Expression::make_boolean(false, imp
->location());
1398 // Make a boolean expression.
1401 Expression::make_boolean(bool val
, source_location location
)
1403 return new Boolean_expression(val
, location
);
1406 // Class String_expression.
1411 String_expression::do_type()
1413 if (this->type_
== NULL
)
1414 this->type_
= Type::make_string_type();
1418 // Set the type from the context.
1421 String_expression::do_determine_type(const Type_context
* context
)
1423 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1425 else if (context
->type
!= NULL
&& context
->type
->is_string_type())
1426 this->type_
= context
->type
;
1427 else if (!context
->may_be_abstract
)
1428 this->type_
= Type::lookup_string_type();
1431 // Build a string constant.
1434 String_expression::do_get_tree(Translate_context
* context
)
1436 return context
->gogo()->go_string_constant_tree(this->val_
);
1439 // Export a string expression.
1442 String_expression::do_export(Export
* exp
) const
1445 s
.reserve(this->val_
.length() * 4 + 2);
1447 for (std::string::const_iterator p
= this->val_
.begin();
1448 p
!= this->val_
.end();
1451 if (*p
== '\\' || *p
== '"')
1456 else if (*p
>= 0x20 && *p
< 0x7f)
1458 else if (*p
== '\n')
1460 else if (*p
== '\t')
1465 unsigned char c
= *p
;
1466 unsigned int dig
= c
>> 4;
1467 s
+= dig
< 10 ? '0' + dig
: 'A' + dig
- 10;
1469 s
+= dig
< 10 ? '0' + dig
: 'A' + dig
- 10;
1473 exp
->write_string(s
);
1476 // Import a string expression.
1479 String_expression::do_import(Import
* imp
)
1481 imp
->require_c_string("\"");
1485 int c
= imp
->get_char();
1486 if (c
== '"' || c
== -1)
1489 val
+= static_cast<char>(c
);
1492 c
= imp
->get_char();
1493 if (c
== '\\' || c
== '"')
1494 val
+= static_cast<char>(c
);
1501 c
= imp
->get_char();
1502 unsigned int vh
= c
>= '0' && c
<= '9' ? c
- '0' : c
- 'A' + 10;
1503 c
= imp
->get_char();
1504 unsigned int vl
= c
>= '0' && c
<= '9' ? c
- '0' : c
- 'A' + 10;
1505 char v
= (vh
<< 4) | vl
;
1510 error_at(imp
->location(), "bad string constant");
1511 return Expression::make_error(imp
->location());
1515 return Expression::make_string(val
, imp
->location());
1518 // Make a string expression.
1521 Expression::make_string(const std::string
& val
, source_location location
)
1523 return new String_expression(val
, location
);
1526 // Make an integer expression.
1528 class Integer_expression
: public Expression
1531 Integer_expression(const mpz_t
* val
, Type
* type
, source_location location
)
1532 : Expression(EXPRESSION_INTEGER
, location
),
1534 { mpz_init_set(this->val_
, *val
); }
1539 // Return whether VAL fits in the type.
1541 check_constant(mpz_t val
, Type
*, source_location
);
1543 // Write VAL to export data.
1545 export_integer(Export
* exp
, const mpz_t val
);
1549 do_is_constant() const
1553 do_integer_constant_value(bool, mpz_t val
, Type
** ptype
) const;
1559 do_determine_type(const Type_context
* context
);
1562 do_check_types(Gogo
*);
1565 do_get_tree(Translate_context
*);
1569 { return Expression::make_integer(&this->val_
, this->type_
,
1570 this->location()); }
1573 do_export(Export
*) const;
1576 // The integer value.
1582 // Return an integer constant value.
1585 Integer_expression::do_integer_constant_value(bool, mpz_t val
,
1588 if (this->type_
!= NULL
)
1589 *ptype
= this->type_
;
1590 mpz_set(val
, this->val_
);
1594 // Return the current type. If we haven't set the type yet, we return
1595 // an abstract integer type.
1598 Integer_expression::do_type()
1600 if (this->type_
== NULL
)
1601 this->type_
= Type::make_abstract_integer_type();
1605 // Set the type of the integer value. Here we may switch from an
1606 // abstract type to a real type.
1609 Integer_expression::do_determine_type(const Type_context
* context
)
1611 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1613 else if (context
->type
!= NULL
1614 && (context
->type
->integer_type() != NULL
1615 || context
->type
->float_type() != NULL
1616 || context
->type
->complex_type() != NULL
))
1617 this->type_
= context
->type
;
1618 else if (!context
->may_be_abstract
)
1619 this->type_
= Type::lookup_integer_type("int");
1622 // Return true if the integer VAL fits in the range of the type TYPE.
1623 // Otherwise give an error and return false. TYPE may be NULL.
1626 Integer_expression::check_constant(mpz_t val
, Type
* type
,
1627 source_location location
)
1631 Integer_type
* itype
= type
->integer_type();
1632 if (itype
== NULL
|| itype
->is_abstract())
1635 int bits
= mpz_sizeinbase(val
, 2);
1637 if (itype
->is_unsigned())
1639 // For an unsigned type we can only accept a nonnegative number,
1640 // and we must be able to represent at least BITS.
1641 if (mpz_sgn(val
) >= 0
1642 && bits
<= itype
->bits())
1647 // For a signed type we need an extra bit to indicate the sign.
1648 // We have to handle the most negative integer specially.
1649 if (bits
+ 1 <= itype
->bits()
1650 || (bits
<= itype
->bits()
1652 && (mpz_scan1(val
, 0)
1653 == static_cast<unsigned long>(itype
->bits() - 1))
1654 && mpz_scan0(val
, itype
->bits()) == ULONG_MAX
))
1658 error_at(location
, "integer constant overflow");
1662 // Check the type of an integer constant.
1665 Integer_expression::do_check_types(Gogo
*)
1667 if (this->type_
== NULL
)
1669 if (!Integer_expression::check_constant(this->val_
, this->type_
,
1671 this->set_is_error();
1674 // Get a tree for an integer constant.
1677 Integer_expression::do_get_tree(Translate_context
* context
)
1679 Gogo
* gogo
= context
->gogo();
1681 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1682 type
= this->type_
->get_tree(gogo
);
1683 else if (this->type_
!= NULL
&& this->type_
->float_type() != NULL
)
1685 // We are converting to an abstract floating point type.
1686 type
= Type::lookup_float_type("float64")->get_tree(gogo
);
1688 else if (this->type_
!= NULL
&& this->type_
->complex_type() != NULL
)
1690 // We are converting to an abstract complex type.
1691 type
= Type::lookup_complex_type("complex128")->get_tree(gogo
);
1695 // If we still have an abstract type here, then this is being
1696 // used in a constant expression which didn't get reduced for
1697 // some reason. Use a type which will fit the value. We use <,
1698 // not <=, because we need an extra bit for the sign bit.
1699 int bits
= mpz_sizeinbase(this->val_
, 2);
1700 if (bits
< INT_TYPE_SIZE
)
1701 type
= Type::lookup_integer_type("int")->get_tree(gogo
);
1703 type
= Type::lookup_integer_type("int64")->get_tree(gogo
);
1705 type
= long_long_integer_type_node
;
1707 return Expression::integer_constant_tree(this->val_
, type
);
1710 // Write VAL to export data.
1713 Integer_expression::export_integer(Export
* exp
, const mpz_t val
)
1715 char* s
= mpz_get_str(NULL
, 10, val
);
1716 exp
->write_c_string(s
);
1720 // Export an integer in a constant expression.
1723 Integer_expression::do_export(Export
* exp
) const
1725 Integer_expression::export_integer(exp
, this->val_
);
1726 // A trailing space lets us reliably identify the end of the number.
1727 exp
->write_c_string(" ");
1730 // Import an integer, floating point, or complex value. This handles
1731 // all these types because they all start with digits.
1734 Integer_expression::do_import(Import
* imp
)
1736 std::string num
= imp
->read_identifier();
1737 imp
->require_c_string(" ");
1738 if (!num
.empty() && num
[num
.length() - 1] == 'i')
1741 size_t plus_pos
= num
.find('+', 1);
1742 size_t minus_pos
= num
.find('-', 1);
1744 if (plus_pos
== std::string::npos
)
1746 else if (minus_pos
== std::string::npos
)
1750 error_at(imp
->location(), "bad number in import data: %qs",
1752 return Expression::make_error(imp
->location());
1754 if (pos
== std::string::npos
)
1755 mpfr_set_ui(real
, 0, GMP_RNDN
);
1758 std::string real_str
= num
.substr(0, pos
);
1759 if (mpfr_init_set_str(real
, real_str
.c_str(), 10, GMP_RNDN
) != 0)
1761 error_at(imp
->location(), "bad number in import data: %qs",
1763 return Expression::make_error(imp
->location());
1767 std::string imag_str
;
1768 if (pos
== std::string::npos
)
1771 imag_str
= num
.substr(pos
);
1772 imag_str
= imag_str
.substr(0, imag_str
.size() - 1);
1774 if (mpfr_init_set_str(imag
, imag_str
.c_str(), 10, GMP_RNDN
) != 0)
1776 error_at(imp
->location(), "bad number in import data: %qs",
1778 return Expression::make_error(imp
->location());
1780 Expression
* ret
= Expression::make_complex(&real
, &imag
, NULL
,
1786 else if (num
.find('.') == std::string::npos
1787 && num
.find('E') == std::string::npos
)
1790 if (mpz_init_set_str(val
, num
.c_str(), 10) != 0)
1792 error_at(imp
->location(), "bad number in import data: %qs",
1794 return Expression::make_error(imp
->location());
1796 Expression
* ret
= Expression::make_integer(&val
, NULL
, imp
->location());
1803 if (mpfr_init_set_str(val
, num
.c_str(), 10, GMP_RNDN
) != 0)
1805 error_at(imp
->location(), "bad number in import data: %qs",
1807 return Expression::make_error(imp
->location());
1809 Expression
* ret
= Expression::make_float(&val
, NULL
, imp
->location());
1815 // Build a new integer value.
1818 Expression::make_integer(const mpz_t
* val
, Type
* type
,
1819 source_location location
)
1821 return new Integer_expression(val
, type
, location
);
1826 class Float_expression
: public Expression
1829 Float_expression(const mpfr_t
* val
, Type
* type
, source_location location
)
1830 : Expression(EXPRESSION_FLOAT
, location
),
1833 mpfr_init_set(this->val_
, *val
, GMP_RNDN
);
1836 // Constrain VAL to fit into TYPE.
1838 constrain_float(mpfr_t val
, Type
* type
);
1840 // Return whether VAL fits in the type.
1842 check_constant(mpfr_t val
, Type
*, source_location
);
1844 // Write VAL to export data.
1846 export_float(Export
* exp
, const mpfr_t val
);
1850 do_is_constant() const
1854 do_float_constant_value(mpfr_t val
, Type
**) const;
1860 do_determine_type(const Type_context
*);
1863 do_check_types(Gogo
*);
1867 { return Expression::make_float(&this->val_
, this->type_
,
1868 this->location()); }
1871 do_get_tree(Translate_context
*);
1874 do_export(Export
*) const;
1877 // The floating point value.
1883 // Constrain VAL to fit into TYPE.
1886 Float_expression::constrain_float(mpfr_t val
, Type
* type
)
1888 Float_type
* ftype
= type
->float_type();
1889 if (ftype
!= NULL
&& !ftype
->is_abstract())
1891 tree type_tree
= ftype
->type_tree();
1892 REAL_VALUE_TYPE rvt
;
1893 real_from_mpfr(&rvt
, val
, type_tree
, GMP_RNDN
);
1894 real_convert(&rvt
, TYPE_MODE(type_tree
), &rvt
);
1895 mpfr_from_real(val
, &rvt
, GMP_RNDN
);
1899 // Return a floating point constant value.
1902 Float_expression::do_float_constant_value(mpfr_t val
, Type
** ptype
) const
1904 if (this->type_
!= NULL
)
1905 *ptype
= this->type_
;
1906 mpfr_set(val
, this->val_
, GMP_RNDN
);
1910 // Return the current type. If we haven't set the type yet, we return
1911 // an abstract float type.
1914 Float_expression::do_type()
1916 if (this->type_
== NULL
)
1917 this->type_
= Type::make_abstract_float_type();
1921 // Set the type of the float value. Here we may switch from an
1922 // abstract type to a real type.
1925 Float_expression::do_determine_type(const Type_context
* context
)
1927 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1929 else if (context
->type
!= NULL
1930 && (context
->type
->integer_type() != NULL
1931 || context
->type
->float_type() != NULL
1932 || context
->type
->complex_type() != NULL
))
1933 this->type_
= context
->type
;
1934 else if (!context
->may_be_abstract
)
1935 this->type_
= Type::lookup_float_type("float64");
1938 // Return true if the floating point value VAL fits in the range of
1939 // the type TYPE. Otherwise give an error and return false. TYPE may
1943 Float_expression::check_constant(mpfr_t val
, Type
* type
,
1944 source_location location
)
1948 Float_type
* ftype
= type
->float_type();
1949 if (ftype
== NULL
|| ftype
->is_abstract())
1952 // A NaN or Infinity always fits in the range of the type.
1953 if (mpfr_nan_p(val
) || mpfr_inf_p(val
) || mpfr_zero_p(val
))
1956 mp_exp_t exp
= mpfr_get_exp(val
);
1958 switch (ftype
->bits())
1971 error_at(location
, "floating point constant overflow");
1977 // Check the type of a float value.
1980 Float_expression::do_check_types(Gogo
*)
1982 if (this->type_
== NULL
)
1985 if (!Float_expression::check_constant(this->val_
, this->type_
,
1987 this->set_is_error();
1989 Integer_type
* integer_type
= this->type_
->integer_type();
1990 if (integer_type
!= NULL
)
1992 if (!mpfr_integer_p(this->val_
))
1993 this->report_error(_("floating point constant truncated to integer"));
1996 gcc_assert(!integer_type
->is_abstract());
1999 mpfr_get_z(ival
, this->val_
, GMP_RNDN
);
2000 Integer_expression::check_constant(ival
, integer_type
,
2007 // Get a tree for a float constant.
2010 Float_expression::do_get_tree(Translate_context
* context
)
2012 Gogo
* gogo
= context
->gogo();
2014 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
2015 type
= this->type_
->get_tree(gogo
);
2016 else if (this->type_
!= NULL
&& this->type_
->integer_type() != NULL
)
2018 // We have an abstract integer type. We just hope for the best.
2019 type
= Type::lookup_integer_type("int")->get_tree(gogo
);
2023 // If we still have an abstract type here, then this is being
2024 // used in a constant expression which didn't get reduced. We
2025 // just use float64 and hope for the best.
2026 type
= Type::lookup_float_type("float64")->get_tree(gogo
);
2028 return Expression::float_constant_tree(this->val_
, type
);
2031 // Write a floating point number to export data.
2034 Float_expression::export_float(Export
*exp
, const mpfr_t val
)
2037 char* s
= mpfr_get_str(NULL
, &exponent
, 10, 0, val
, GMP_RNDN
);
2039 exp
->write_c_string("-");
2040 exp
->write_c_string("0.");
2041 exp
->write_c_string(*s
== '-' ? s
+ 1 : s
);
2044 snprintf(buf
, sizeof buf
, "E%ld", exponent
);
2045 exp
->write_c_string(buf
);
2048 // Export a floating point number in a constant expression.
2051 Float_expression::do_export(Export
* exp
) const
2053 Float_expression::export_float(exp
, this->val_
);
2054 // A trailing space lets us reliably identify the end of the number.
2055 exp
->write_c_string(" ");
2058 // Make a float expression.
2061 Expression::make_float(const mpfr_t
* val
, Type
* type
, source_location location
)
2063 return new Float_expression(val
, type
, location
);
2068 class Complex_expression
: public Expression
2071 Complex_expression(const mpfr_t
* real
, const mpfr_t
* imag
, Type
* type
,
2072 source_location location
)
2073 : Expression(EXPRESSION_COMPLEX
, location
),
2076 mpfr_init_set(this->real_
, *real
, GMP_RNDN
);
2077 mpfr_init_set(this->imag_
, *imag
, GMP_RNDN
);
2080 // Constrain REAL/IMAG to fit into TYPE.
2082 constrain_complex(mpfr_t real
, mpfr_t imag
, Type
* type
);
2084 // Return whether REAL/IMAG fits in the type.
2086 check_constant(mpfr_t real
, mpfr_t imag
, Type
*, source_location
);
2088 // Write REAL/IMAG to export data.
2090 export_complex(Export
* exp
, const mpfr_t real
, const mpfr_t val
);
2094 do_is_constant() const
2098 do_complex_constant_value(mpfr_t real
, mpfr_t imag
, Type
**) const;
2104 do_determine_type(const Type_context
*);
2107 do_check_types(Gogo
*);
2112 return Expression::make_complex(&this->real_
, &this->imag_
, this->type_
,
2117 do_get_tree(Translate_context
*);
2120 do_export(Export
*) const;
2125 // The imaginary part;
2127 // The type if known.
2131 // Constrain REAL/IMAG to fit into TYPE.
2134 Complex_expression::constrain_complex(mpfr_t real
, mpfr_t imag
, Type
* type
)
2136 Complex_type
* ctype
= type
->complex_type();
2137 if (ctype
!= NULL
&& !ctype
->is_abstract())
2139 tree type_tree
= ctype
->type_tree();
2141 REAL_VALUE_TYPE rvt
;
2142 real_from_mpfr(&rvt
, real
, TREE_TYPE(type_tree
), GMP_RNDN
);
2143 real_convert(&rvt
, TYPE_MODE(TREE_TYPE(type_tree
)), &rvt
);
2144 mpfr_from_real(real
, &rvt
, GMP_RNDN
);
2146 real_from_mpfr(&rvt
, imag
, TREE_TYPE(type_tree
), GMP_RNDN
);
2147 real_convert(&rvt
, TYPE_MODE(TREE_TYPE(type_tree
)), &rvt
);
2148 mpfr_from_real(imag
, &rvt
, GMP_RNDN
);
2152 // Return a complex constant value.
2155 Complex_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
2158 if (this->type_
!= NULL
)
2159 *ptype
= this->type_
;
2160 mpfr_set(real
, this->real_
, GMP_RNDN
);
2161 mpfr_set(imag
, this->imag_
, GMP_RNDN
);
2165 // Return the current type. If we haven't set the type yet, we return
2166 // an abstract complex type.
2169 Complex_expression::do_type()
2171 if (this->type_
== NULL
)
2172 this->type_
= Type::make_abstract_complex_type();
2176 // Set the type of the complex value. Here we may switch from an
2177 // abstract type to a real type.
2180 Complex_expression::do_determine_type(const Type_context
* context
)
2182 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
2184 else if (context
->type
!= NULL
2185 && context
->type
->complex_type() != NULL
)
2186 this->type_
= context
->type
;
2187 else if (!context
->may_be_abstract
)
2188 this->type_
= Type::lookup_complex_type("complex128");
2191 // Return true if the complex value REAL/IMAG fits in the range of the
2192 // type TYPE. Otherwise give an error and return false. TYPE may be
2196 Complex_expression::check_constant(mpfr_t real
, mpfr_t imag
, Type
* type
,
2197 source_location location
)
2201 Complex_type
* ctype
= type
->complex_type();
2202 if (ctype
== NULL
|| ctype
->is_abstract())
2206 switch (ctype
->bits())
2218 // A NaN or Infinity always fits in the range of the type.
2219 if (!mpfr_nan_p(real
) && !mpfr_inf_p(real
) && !mpfr_zero_p(real
))
2221 if (mpfr_get_exp(real
) > max_exp
)
2223 error_at(location
, "complex real part constant overflow");
2228 if (!mpfr_nan_p(imag
) && !mpfr_inf_p(imag
) && !mpfr_zero_p(imag
))
2230 if (mpfr_get_exp(imag
) > max_exp
)
2232 error_at(location
, "complex imaginary part constant overflow");
2240 // Check the type of a complex value.
2243 Complex_expression::do_check_types(Gogo
*)
2245 if (this->type_
== NULL
)
2248 if (!Complex_expression::check_constant(this->real_
, this->imag_
,
2249 this->type_
, this->location()))
2250 this->set_is_error();
2253 // Get a tree for a complex constant.
2256 Complex_expression::do_get_tree(Translate_context
* context
)
2258 Gogo
* gogo
= context
->gogo();
2260 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
2261 type
= this->type_
->get_tree(gogo
);
2264 // If we still have an abstract type here, this this is being
2265 // used in a constant expression which didn't get reduced. We
2266 // just use complex128 and hope for the best.
2267 type
= Type::lookup_complex_type("complex128")->get_tree(gogo
);
2269 return Expression::complex_constant_tree(this->real_
, this->imag_
, type
);
2272 // Write REAL/IMAG to export data.
2275 Complex_expression::export_complex(Export
* exp
, const mpfr_t real
,
2278 if (!mpfr_zero_p(real
))
2280 Float_expression::export_float(exp
, real
);
2281 if (mpfr_sgn(imag
) > 0)
2282 exp
->write_c_string("+");
2284 Float_expression::export_float(exp
, imag
);
2285 exp
->write_c_string("i");
2288 // Export a complex number in a constant expression.
2291 Complex_expression::do_export(Export
* exp
) const
2293 Complex_expression::export_complex(exp
, this->real_
, this->imag_
);
2294 // A trailing space lets us reliably identify the end of the number.
2295 exp
->write_c_string(" ");
2298 // Make a complex expression.
2301 Expression::make_complex(const mpfr_t
* real
, const mpfr_t
* imag
, Type
* type
,
2302 source_location location
)
2304 return new Complex_expression(real
, imag
, type
, location
);
2307 // Find a named object in an expression.
2309 class Find_named_object
: public Traverse
2312 Find_named_object(Named_object
* no
)
2313 : Traverse(traverse_expressions
),
2314 no_(no
), found_(false)
2317 // Whether we found the object.
2320 { return this->found_
; }
2324 expression(Expression
**);
2327 // The object we are looking for.
2329 // Whether we found it.
2333 // A reference to a const in an expression.
2335 class Const_expression
: public Expression
2338 Const_expression(Named_object
* constant
, source_location location
)
2339 : Expression(EXPRESSION_CONST_REFERENCE
, location
),
2340 constant_(constant
), type_(NULL
), seen_(false)
2345 { return this->constant_
; }
2349 { return this->constant_
->name(); }
2351 // Check that the initializer does not refer to the constant itself.
2353 check_for_init_loop();
2357 do_lower(Gogo
*, Named_object
*, int);
2360 do_is_constant() const
2364 do_integer_constant_value(bool, mpz_t val
, Type
**) const;
2367 do_float_constant_value(mpfr_t val
, Type
**) const;
2370 do_complex_constant_value(mpfr_t real
, mpfr_t imag
, Type
**) const;
2373 do_string_constant_value(std::string
* val
) const
2374 { return this->constant_
->const_value()->expr()->string_constant_value(val
); }
2379 // The type of a const is set by the declaration, not the use.
2381 do_determine_type(const Type_context
*);
2384 do_check_types(Gogo
*);
2391 do_get_tree(Translate_context
* context
);
2393 // When exporting a reference to a const as part of a const
2394 // expression, we export the value. We ignore the fact that it has
2397 do_export(Export
* exp
) const
2398 { this->constant_
->const_value()->expr()->export_expression(exp
); }
2402 Named_object
* constant_
;
2403 // The type of this reference. This is used if the constant has an
2406 // Used to prevent infinite recursion when a constant incorrectly
2407 // refers to itself.
2411 // Lower a constant expression. This is where we convert the
2412 // predeclared constant iota into an integer value.
2415 Const_expression::do_lower(Gogo
* gogo
, Named_object
*, int iota_value
)
2417 if (this->constant_
->const_value()->expr()->classification()
2420 if (iota_value
== -1)
2422 error_at(this->location(),
2423 "iota is only defined in const declarations");
2427 mpz_init_set_ui(val
, static_cast<unsigned long>(iota_value
));
2428 Expression
* ret
= Expression::make_integer(&val
, NULL
,
2434 // Make sure that the constant itself has been lowered.
2435 gogo
->lower_constant(this->constant_
);
2440 // Return an integer constant value.
2443 Const_expression::do_integer_constant_value(bool iota_is_constant
, mpz_t val
,
2450 if (this->type_
!= NULL
)
2451 ctype
= this->type_
;
2453 ctype
= this->constant_
->const_value()->type();
2454 if (ctype
!= NULL
&& ctype
->integer_type() == NULL
)
2457 Expression
* e
= this->constant_
->const_value()->expr();
2462 bool r
= e
->integer_constant_value(iota_is_constant
, val
, &t
);
2464 this->seen_
= false;
2468 && !Integer_expression::check_constant(val
, ctype
, this->location()))
2471 *ptype
= ctype
!= NULL
? ctype
: t
;
2475 // Return a floating point constant value.
2478 Const_expression::do_float_constant_value(mpfr_t val
, Type
** ptype
) const
2484 if (this->type_
!= NULL
)
2485 ctype
= this->type_
;
2487 ctype
= this->constant_
->const_value()->type();
2488 if (ctype
!= NULL
&& ctype
->float_type() == NULL
)
2494 bool r
= this->constant_
->const_value()->expr()->float_constant_value(val
,
2497 this->seen_
= false;
2499 if (r
&& ctype
!= NULL
)
2501 if (!Float_expression::check_constant(val
, ctype
, this->location()))
2503 Float_expression::constrain_float(val
, ctype
);
2505 *ptype
= ctype
!= NULL
? ctype
: t
;
2509 // Return a complex constant value.
2512 Const_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
2519 if (this->type_
!= NULL
)
2520 ctype
= this->type_
;
2522 ctype
= this->constant_
->const_value()->type();
2523 if (ctype
!= NULL
&& ctype
->complex_type() == NULL
)
2529 bool r
= this->constant_
->const_value()->expr()->complex_constant_value(real
,
2533 this->seen_
= false;
2535 if (r
&& ctype
!= NULL
)
2537 if (!Complex_expression::check_constant(real
, imag
, ctype
,
2540 Complex_expression::constrain_complex(real
, imag
, ctype
);
2542 *ptype
= ctype
!= NULL
? ctype
: t
;
2546 // Return the type of the const reference.
2549 Const_expression::do_type()
2551 if (this->type_
!= NULL
)
2554 Named_constant
* nc
= this->constant_
->const_value();
2556 if (this->seen_
|| nc
->lowering())
2558 this->report_error(_("constant refers to itself"));
2559 this->type_
= Type::make_error_type();
2565 Type
* ret
= nc
->type();
2569 this->seen_
= false;
2573 // During parsing, a named constant may have a NULL type, but we
2574 // must not return a NULL type here.
2575 ret
= nc
->expr()->type();
2577 this->seen_
= false;
2582 // Set the type of the const reference.
2585 Const_expression::do_determine_type(const Type_context
* context
)
2587 Type
* ctype
= this->constant_
->const_value()->type();
2588 Type
* cetype
= (ctype
!= NULL
2590 : this->constant_
->const_value()->expr()->type());
2591 if (ctype
!= NULL
&& !ctype
->is_abstract())
2593 else if (context
->type
!= NULL
2594 && (context
->type
->integer_type() != NULL
2595 || context
->type
->float_type() != NULL
2596 || context
->type
->complex_type() != NULL
)
2597 && (cetype
->integer_type() != NULL
2598 || cetype
->float_type() != NULL
2599 || cetype
->complex_type() != NULL
))
2600 this->type_
= context
->type
;
2601 else if (context
->type
!= NULL
2602 && context
->type
->is_string_type()
2603 && cetype
->is_string_type())
2604 this->type_
= context
->type
;
2605 else if (context
->type
!= NULL
2606 && context
->type
->is_boolean_type()
2607 && cetype
->is_boolean_type())
2608 this->type_
= context
->type
;
2609 else if (!context
->may_be_abstract
)
2611 if (cetype
->is_abstract())
2612 cetype
= cetype
->make_non_abstract_type();
2613 this->type_
= cetype
;
2617 // Check for a loop in which the initializer of a constant refers to
2618 // the constant itself.
2621 Const_expression::check_for_init_loop()
2623 if (this->type_
!= NULL
&& this->type_
->is_error_type())
2628 this->report_error(_("constant refers to itself"));
2629 this->type_
= Type::make_error_type();
2633 Expression
* init
= this->constant_
->const_value()->expr();
2634 Find_named_object
find_named_object(this->constant_
);
2637 Expression::traverse(&init
, &find_named_object
);
2638 this->seen_
= false;
2640 if (find_named_object
.found())
2642 if (this->type_
== NULL
|| !this->type_
->is_error_type())
2644 this->report_error(_("constant refers to itself"));
2645 this->type_
= Type::make_error_type();
2651 // Check types of a const reference.
2654 Const_expression::do_check_types(Gogo
*)
2656 if (this->type_
!= NULL
&& this->type_
->is_error_type())
2659 this->check_for_init_loop();
2661 if (this->type_
== NULL
|| this->type_
->is_abstract())
2664 // Check for integer overflow.
2665 if (this->type_
->integer_type() != NULL
)
2670 if (!this->integer_constant_value(true, ival
, &dummy
))
2674 Expression
* cexpr
= this->constant_
->const_value()->expr();
2675 if (cexpr
->float_constant_value(fval
, &dummy
))
2677 if (!mpfr_integer_p(fval
))
2678 this->report_error(_("floating point constant "
2679 "truncated to integer"));
2682 mpfr_get_z(ival
, fval
, GMP_RNDN
);
2683 Integer_expression::check_constant(ival
, this->type_
,
2693 // Return a tree for the const reference.
2696 Const_expression::do_get_tree(Translate_context
* context
)
2698 Gogo
* gogo
= context
->gogo();
2700 if (this->type_
== NULL
)
2701 type_tree
= NULL_TREE
;
2704 type_tree
= this->type_
->get_tree(gogo
);
2705 if (type_tree
== error_mark_node
)
2706 return error_mark_node
;
2709 // If the type has been set for this expression, but the underlying
2710 // object is an abstract int or float, we try to get the abstract
2711 // value. Otherwise we may lose something in the conversion.
2712 if (this->type_
!= NULL
2713 && (this->constant_
->const_value()->type() == NULL
2714 || this->constant_
->const_value()->type()->is_abstract()))
2716 Expression
* expr
= this->constant_
->const_value()->expr();
2720 if (expr
->integer_constant_value(true, ival
, &t
))
2722 tree ret
= Expression::integer_constant_tree(ival
, type_tree
);
2730 if (expr
->float_constant_value(fval
, &t
))
2732 tree ret
= Expression::float_constant_tree(fval
, type_tree
);
2739 if (expr
->complex_constant_value(fval
, imag
, &t
))
2741 tree ret
= Expression::complex_constant_tree(fval
, imag
, type_tree
);
2750 tree const_tree
= this->constant_
->get_tree(gogo
, context
->function());
2751 if (this->type_
== NULL
2752 || const_tree
== error_mark_node
2753 || TREE_TYPE(const_tree
) == error_mark_node
)
2757 if (TYPE_MAIN_VARIANT(type_tree
) == TYPE_MAIN_VARIANT(TREE_TYPE(const_tree
)))
2758 ret
= fold_convert(type_tree
, const_tree
);
2759 else if (TREE_CODE(type_tree
) == INTEGER_TYPE
)
2760 ret
= fold(convert_to_integer(type_tree
, const_tree
));
2761 else if (TREE_CODE(type_tree
) == REAL_TYPE
)
2762 ret
= fold(convert_to_real(type_tree
, const_tree
));
2763 else if (TREE_CODE(type_tree
) == COMPLEX_TYPE
)
2764 ret
= fold(convert_to_complex(type_tree
, const_tree
));
2770 // Make a reference to a constant in an expression.
2773 Expression::make_const_reference(Named_object
* constant
,
2774 source_location location
)
2776 return new Const_expression(constant
, location
);
2779 // Find a named object in an expression.
2782 Find_named_object::expression(Expression
** pexpr
)
2784 switch ((*pexpr
)->classification())
2786 case Expression::EXPRESSION_CONST_REFERENCE
:
2788 Const_expression
* ce
= static_cast<Const_expression
*>(*pexpr
);
2789 if (ce
->named_object() == this->no_
)
2792 // We need to check a constant initializer explicitly, as
2793 // loops here will not be caught by the loop checking for
2794 // variable initializers.
2795 ce
->check_for_init_loop();
2797 return TRAVERSE_CONTINUE
;
2800 case Expression::EXPRESSION_VAR_REFERENCE
:
2801 if ((*pexpr
)->var_expression()->named_object() == this->no_
)
2803 return TRAVERSE_CONTINUE
;
2804 case Expression::EXPRESSION_FUNC_REFERENCE
:
2805 if ((*pexpr
)->func_expression()->named_object() == this->no_
)
2807 return TRAVERSE_CONTINUE
;
2809 return TRAVERSE_CONTINUE
;
2811 this->found_
= true;
2812 return TRAVERSE_EXIT
;
2817 class Nil_expression
: public Expression
2820 Nil_expression(source_location location
)
2821 : Expression(EXPRESSION_NIL
, location
)
2829 do_is_constant() const
2834 { return Type::make_nil_type(); }
2837 do_determine_type(const Type_context
*)
2845 do_get_tree(Translate_context
*)
2846 { return null_pointer_node
; }
2849 do_export(Export
* exp
) const
2850 { exp
->write_c_string("nil"); }
2853 // Import a nil expression.
2856 Nil_expression::do_import(Import
* imp
)
2858 imp
->require_c_string("nil");
2859 return Expression::make_nil(imp
->location());
2862 // Make a nil expression.
2865 Expression::make_nil(source_location location
)
2867 return new Nil_expression(location
);
2870 // The value of the predeclared constant iota. This is little more
2871 // than a marker. This will be lowered to an integer in
2872 // Const_expression::do_lower, which is where we know the value that
2875 class Iota_expression
: public Parser_expression
2878 Iota_expression(source_location location
)
2879 : Parser_expression(EXPRESSION_IOTA
, location
)
2884 do_lower(Gogo
*, Named_object
*, int)
2885 { gcc_unreachable(); }
2887 // There should only ever be one of these.
2890 { gcc_unreachable(); }
2893 // Make an iota expression. This is only called for one case: the
2894 // value of the predeclared constant iota.
2897 Expression::make_iota()
2899 static Iota_expression
iota_expression(UNKNOWN_LOCATION
);
2900 return &iota_expression
;
2903 // A type conversion expression.
2905 class Type_conversion_expression
: public Expression
2908 Type_conversion_expression(Type
* type
, Expression
* expr
,
2909 source_location location
)
2910 : Expression(EXPRESSION_CONVERSION
, location
),
2911 type_(type
), expr_(expr
), may_convert_function_types_(false)
2914 // Return the type to which we are converting.
2917 { return this->type_
; }
2919 // Return the expression which we are converting.
2922 { return this->expr_
; }
2924 // Permit converting from one function type to another. This is
2925 // used internally for method expressions.
2927 set_may_convert_function_types()
2929 this->may_convert_function_types_
= true;
2932 // Import a type conversion expression.
2938 do_traverse(Traverse
* traverse
);
2941 do_lower(Gogo
*, Named_object
*, int);
2944 do_is_constant() const
2945 { return this->expr_
->is_constant(); }
2948 do_integer_constant_value(bool, mpz_t
, Type
**) const;
2951 do_float_constant_value(mpfr_t
, Type
**) const;
2954 do_complex_constant_value(mpfr_t
, mpfr_t
, Type
**) const;
2957 do_string_constant_value(std::string
*) const;
2961 { return this->type_
; }
2964 do_determine_type(const Type_context
*)
2966 Type_context
subcontext(this->type_
, false);
2967 this->expr_
->determine_type(&subcontext
);
2971 do_check_types(Gogo
*);
2976 return new Type_conversion_expression(this->type_
, this->expr_
->copy(),
2981 do_get_tree(Translate_context
* context
);
2984 do_export(Export
*) const;
2987 // The type to convert to.
2989 // The expression to convert.
2991 // True if this is permitted to convert function types. This is
2992 // used internally for method expressions.
2993 bool may_convert_function_types_
;
2999 Type_conversion_expression::do_traverse(Traverse
* traverse
)
3001 if (Expression::traverse(&this->expr_
, traverse
) == TRAVERSE_EXIT
3002 || Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
3003 return TRAVERSE_EXIT
;
3004 return TRAVERSE_CONTINUE
;
3007 // Convert to a constant at lowering time.
3010 Type_conversion_expression::do_lower(Gogo
*, Named_object
*, int)
3012 Type
* type
= this->type_
;
3013 Expression
* val
= this->expr_
;
3014 source_location location
= this->location();
3016 if (type
->integer_type() != NULL
)
3021 if (val
->integer_constant_value(false, ival
, &dummy
))
3023 if (!Integer_expression::check_constant(ival
, type
, location
))
3024 mpz_set_ui(ival
, 0);
3025 Expression
* ret
= Expression::make_integer(&ival
, type
, location
);
3032 if (val
->float_constant_value(fval
, &dummy
))
3034 if (!mpfr_integer_p(fval
))
3037 "floating point constant truncated to integer");
3038 return Expression::make_error(location
);
3040 mpfr_get_z(ival
, fval
, GMP_RNDN
);
3041 if (!Integer_expression::check_constant(ival
, type
, location
))
3042 mpz_set_ui(ival
, 0);
3043 Expression
* ret
= Expression::make_integer(&ival
, type
, location
);
3052 if (type
->float_type() != NULL
)
3057 if (val
->float_constant_value(fval
, &dummy
))
3059 if (!Float_expression::check_constant(fval
, type
, location
))
3060 mpfr_set_ui(fval
, 0, GMP_RNDN
);
3061 Float_expression::constrain_float(fval
, type
);
3062 Expression
*ret
= Expression::make_float(&fval
, type
, location
);
3069 if (type
->complex_type() != NULL
)
3076 if (val
->complex_constant_value(real
, imag
, &dummy
))
3078 if (!Complex_expression::check_constant(real
, imag
, type
, location
))
3080 mpfr_set_ui(real
, 0, GMP_RNDN
);
3081 mpfr_set_ui(imag
, 0, GMP_RNDN
);
3083 Complex_expression::constrain_complex(real
, imag
, type
);
3084 Expression
* ret
= Expression::make_complex(&real
, &imag
, type
,
3094 if (type
->is_open_array_type() && type
->named_type() == NULL
)
3096 Type
* element_type
= type
->array_type()->element_type()->forwarded();
3097 bool is_byte
= element_type
== Type::lookup_integer_type("uint8");
3098 bool is_int
= element_type
== Type::lookup_integer_type("int");
3099 if (is_byte
|| is_int
)
3102 if (val
->string_constant_value(&s
))
3104 Expression_list
* vals
= new Expression_list();
3107 for (std::string::const_iterator p
= s
.begin();
3112 mpz_init_set_ui(val
, static_cast<unsigned char>(*p
));
3113 Expression
* v
= Expression::make_integer(&val
,
3122 const char *p
= s
.data();
3123 const char *pend
= s
.data() + s
.length();
3127 int adv
= Lex::fetch_char(p
, &c
);
3130 warning_at(this->location(), 0,
3131 "invalid UTF-8 encoding");
3136 mpz_init_set_ui(val
, c
);
3137 Expression
* v
= Expression::make_integer(&val
,
3145 return Expression::make_slice_composite_literal(type
, vals
,
3154 // Return the constant integer value if there is one.
3157 Type_conversion_expression::do_integer_constant_value(bool iota_is_constant
,
3161 if (this->type_
->integer_type() == NULL
)
3167 if (this->expr_
->integer_constant_value(iota_is_constant
, ival
, &dummy
))
3169 if (!Integer_expression::check_constant(ival
, this->type_
,
3177 *ptype
= this->type_
;
3184 if (this->expr_
->float_constant_value(fval
, &dummy
))
3186 mpfr_get_z(val
, fval
, GMP_RNDN
);
3188 if (!Integer_expression::check_constant(val
, this->type_
,
3191 *ptype
= this->type_
;
3199 // Return the constant floating point value if there is one.
3202 Type_conversion_expression::do_float_constant_value(mpfr_t val
,
3205 if (this->type_
->float_type() == NULL
)
3211 if (this->expr_
->float_constant_value(fval
, &dummy
))
3213 if (!Float_expression::check_constant(fval
, this->type_
,
3219 mpfr_set(val
, fval
, GMP_RNDN
);
3221 Float_expression::constrain_float(val
, this->type_
);
3222 *ptype
= this->type_
;
3230 // Return the constant complex value if there is one.
3233 Type_conversion_expression::do_complex_constant_value(mpfr_t real
,
3237 if (this->type_
->complex_type() == NULL
)
3245 if (this->expr_
->complex_constant_value(rval
, ival
, &dummy
))
3247 if (!Complex_expression::check_constant(rval
, ival
, this->type_
,
3254 mpfr_set(real
, rval
, GMP_RNDN
);
3255 mpfr_set(imag
, ival
, GMP_RNDN
);
3258 Complex_expression::constrain_complex(real
, imag
, this->type_
);
3259 *ptype
= this->type_
;
3268 // Return the constant string value if there is one.
3271 Type_conversion_expression::do_string_constant_value(std::string
* val
) const
3273 if (this->type_
->is_string_type()
3274 && this->expr_
->type()->integer_type() != NULL
)
3279 if (this->expr_
->integer_constant_value(false, ival
, &dummy
))
3281 unsigned long ulval
= mpz_get_ui(ival
);
3282 if (mpz_cmp_ui(ival
, ulval
) == 0)
3284 Lex::append_char(ulval
, true, val
, this->location());
3292 // FIXME: Could handle conversion from const []int here.
3297 // Check that types are convertible.
3300 Type_conversion_expression::do_check_types(Gogo
*)
3302 Type
* type
= this->type_
;
3303 Type
* expr_type
= this->expr_
->type();
3306 if (type
->is_error_type()
3307 || type
->is_undefined()
3308 || expr_type
->is_error_type()
3309 || expr_type
->is_undefined())
3311 // Make sure we emit an error for an undefined type.
3314 this->set_is_error();
3318 if (this->may_convert_function_types_
3319 && type
->function_type() != NULL
3320 && expr_type
->function_type() != NULL
)
3323 if (Type::are_convertible(type
, expr_type
, &reason
))
3326 error_at(this->location(), "%s", reason
.c_str());
3327 this->set_is_error();
3330 // Get a tree for a type conversion.
3333 Type_conversion_expression::do_get_tree(Translate_context
* context
)
3335 Gogo
* gogo
= context
->gogo();
3336 tree type_tree
= this->type_
->get_tree(gogo
);
3337 tree expr_tree
= this->expr_
->get_tree(context
);
3339 if (type_tree
== error_mark_node
3340 || expr_tree
== error_mark_node
3341 || TREE_TYPE(expr_tree
) == error_mark_node
)
3342 return error_mark_node
;
3344 if (TYPE_MAIN_VARIANT(type_tree
) == TYPE_MAIN_VARIANT(TREE_TYPE(expr_tree
)))
3345 return fold_convert(type_tree
, expr_tree
);
3347 Type
* type
= this->type_
;
3348 Type
* expr_type
= this->expr_
->type();
3350 if (type
->interface_type() != NULL
|| expr_type
->interface_type() != NULL
)
3351 ret
= Expression::convert_for_assignment(context
, type
, expr_type
,
3352 expr_tree
, this->location());
3353 else if (type
->integer_type() != NULL
)
3355 if (expr_type
->integer_type() != NULL
3356 || expr_type
->float_type() != NULL
3357 || expr_type
->is_unsafe_pointer_type())
3358 ret
= fold(convert_to_integer(type_tree
, expr_tree
));
3362 else if (type
->float_type() != NULL
)
3364 if (expr_type
->integer_type() != NULL
3365 || expr_type
->float_type() != NULL
)
3366 ret
= fold(convert_to_real(type_tree
, expr_tree
));
3370 else if (type
->complex_type() != NULL
)
3372 if (expr_type
->complex_type() != NULL
)
3373 ret
= fold(convert_to_complex(type_tree
, expr_tree
));
3377 else if (type
->is_string_type()
3378 && expr_type
->integer_type() != NULL
)
3380 expr_tree
= fold_convert(integer_type_node
, expr_tree
);
3381 if (host_integerp(expr_tree
, 0))
3383 HOST_WIDE_INT intval
= tree_low_cst(expr_tree
, 0);
3385 Lex::append_char(intval
, true, &s
, this->location());
3386 Expression
* se
= Expression::make_string(s
, this->location());
3387 return se
->get_tree(context
);
3390 static tree int_to_string_fndecl
;
3391 ret
= Gogo::call_builtin(&int_to_string_fndecl
,
3393 "__go_int_to_string",
3397 fold_convert(integer_type_node
, expr_tree
));
3399 else if (type
->is_string_type()
3400 && (expr_type
->array_type() != NULL
3401 || (expr_type
->points_to() != NULL
3402 && expr_type
->points_to()->array_type() != NULL
)))
3404 Type
* t
= expr_type
;
3405 if (t
->points_to() != NULL
)
3408 expr_tree
= build_fold_indirect_ref(expr_tree
);
3410 if (!DECL_P(expr_tree
))
3411 expr_tree
= save_expr(expr_tree
);
3412 Array_type
* a
= t
->array_type();
3413 Type
* e
= a
->element_type()->forwarded();
3414 gcc_assert(e
->integer_type() != NULL
);
3415 tree valptr
= fold_convert(const_ptr_type_node
,
3416 a
->value_pointer_tree(gogo
, expr_tree
));
3417 tree len
= a
->length_tree(gogo
, expr_tree
);
3418 len
= fold_convert_loc(this->location(), size_type_node
, len
);
3419 if (e
->integer_type()->is_unsigned()
3420 && e
->integer_type()->bits() == 8)
3422 static tree byte_array_to_string_fndecl
;
3423 ret
= Gogo::call_builtin(&byte_array_to_string_fndecl
,
3425 "__go_byte_array_to_string",
3428 const_ptr_type_node
,
3435 gcc_assert(e
== Type::lookup_integer_type("int"));
3436 static tree int_array_to_string_fndecl
;
3437 ret
= Gogo::call_builtin(&int_array_to_string_fndecl
,
3439 "__go_int_array_to_string",
3442 const_ptr_type_node
,
3448 else if (type
->is_open_array_type() && expr_type
->is_string_type())
3450 Type
* e
= type
->array_type()->element_type()->forwarded();
3451 gcc_assert(e
->integer_type() != NULL
);
3452 if (e
->integer_type()->is_unsigned()
3453 && e
->integer_type()->bits() == 8)
3455 static tree string_to_byte_array_fndecl
;
3456 ret
= Gogo::call_builtin(&string_to_byte_array_fndecl
,
3458 "__go_string_to_byte_array",
3461 TREE_TYPE(expr_tree
),
3466 gcc_assert(e
== Type::lookup_integer_type("int"));
3467 static tree string_to_int_array_fndecl
;
3468 ret
= Gogo::call_builtin(&string_to_int_array_fndecl
,
3470 "__go_string_to_int_array",
3473 TREE_TYPE(expr_tree
),
3477 else if ((type
->is_unsafe_pointer_type()
3478 && expr_type
->points_to() != NULL
)
3479 || (expr_type
->is_unsafe_pointer_type()
3480 && type
->points_to() != NULL
))
3481 ret
= fold_convert(type_tree
, expr_tree
);
3482 else if (type
->is_unsafe_pointer_type()
3483 && expr_type
->integer_type() != NULL
)
3484 ret
= convert_to_pointer(type_tree
, expr_tree
);
3485 else if (this->may_convert_function_types_
3486 && type
->function_type() != NULL
3487 && expr_type
->function_type() != NULL
)
3488 ret
= fold_convert_loc(this->location(), type_tree
, expr_tree
);
3490 ret
= Expression::convert_for_assignment(context
, type
, expr_type
,
3491 expr_tree
, this->location());
3496 // Output a type conversion in a constant expression.
3499 Type_conversion_expression::do_export(Export
* exp
) const
3501 exp
->write_c_string("convert(");
3502 exp
->write_type(this->type_
);
3503 exp
->write_c_string(", ");
3504 this->expr_
->export_expression(exp
);
3505 exp
->write_c_string(")");
3508 // Import a type conversion or a struct construction.
3511 Type_conversion_expression::do_import(Import
* imp
)
3513 imp
->require_c_string("convert(");
3514 Type
* type
= imp
->read_type();
3515 imp
->require_c_string(", ");
3516 Expression
* val
= Expression::import_expression(imp
);
3517 imp
->require_c_string(")");
3518 return Expression::make_cast(type
, val
, imp
->location());
3521 // Make a type cast expression.
3524 Expression::make_cast(Type
* type
, Expression
* val
, source_location location
)
3526 if (type
->is_error_type() || val
->is_error_expression())
3527 return Expression::make_error(location
);
3528 return new Type_conversion_expression(type
, val
, location
);
3531 // Unary expressions.
3533 class Unary_expression
: public Expression
3536 Unary_expression(Operator op
, Expression
* expr
, source_location location
)
3537 : Expression(EXPRESSION_UNARY
, location
),
3538 op_(op
), escapes_(true), expr_(expr
)
3541 // Return the operator.
3544 { return this->op_
; }
3546 // Return the operand.
3549 { return this->expr_
; }
3551 // Record that an address expression does not escape.
3553 set_does_not_escape()
3555 gcc_assert(this->op_
== OPERATOR_AND
);
3556 this->escapes_
= false;
3559 // Apply unary opcode OP to UVAL, setting VAL. Return true if this
3560 // could be done, false if not.
3562 eval_integer(Operator op
, Type
* utype
, mpz_t uval
, mpz_t val
,
3565 // Apply unary opcode OP to UVAL, setting VAL. Return true if this
3566 // could be done, false if not.
3568 eval_float(Operator op
, mpfr_t uval
, mpfr_t val
);
3570 // Apply unary opcode OP to UREAL/UIMAG, setting REAL/IMAG. Return
3571 // true if this could be done, false if not.
3573 eval_complex(Operator op
, mpfr_t ureal
, mpfr_t uimag
, mpfr_t real
,
3581 do_traverse(Traverse
* traverse
)
3582 { return Expression::traverse(&this->expr_
, traverse
); }
3585 do_lower(Gogo
*, Named_object
*, int);
3588 do_is_constant() const;
3591 do_integer_constant_value(bool, mpz_t
, Type
**) const;
3594 do_float_constant_value(mpfr_t
, Type
**) const;
3597 do_complex_constant_value(mpfr_t
, mpfr_t
, Type
**) const;
3603 do_determine_type(const Type_context
*);
3606 do_check_types(Gogo
*);
3611 return Expression::make_unary(this->op_
, this->expr_
->copy(),
3616 do_is_addressable() const
3617 { return this->op_
== OPERATOR_MULT
; }
3620 do_get_tree(Translate_context
*);
3623 do_export(Export
*) const;
3626 // The unary operator to apply.
3628 // Normally true. False if this is an address expression which does
3629 // not escape the current function.
3635 // If we are taking the address of a composite literal, and the
3636 // contents are not constant, then we want to make a heap composite
3640 Unary_expression::do_lower(Gogo
*, Named_object
*, int)
3642 source_location loc
= this->location();
3643 Operator op
= this->op_
;
3644 Expression
* expr
= this->expr_
;
3646 if (op
== OPERATOR_MULT
&& expr
->is_type_expression())
3647 return Expression::make_type(Type::make_pointer_type(expr
->type()), loc
);
3649 // *&x simplifies to x. *(*T)(unsafe.Pointer)(&x) does not require
3650 // moving x to the heap. FIXME: Is it worth doing a real escape
3651 // analysis here? This case is found in math/unsafe.go and is
3652 // therefore worth special casing.
3653 if (op
== OPERATOR_MULT
)
3655 Expression
* e
= expr
;
3656 while (e
->classification() == EXPRESSION_CONVERSION
)
3658 Type_conversion_expression
* te
3659 = static_cast<Type_conversion_expression
*>(e
);
3663 if (e
->classification() == EXPRESSION_UNARY
)
3665 Unary_expression
* ue
= static_cast<Unary_expression
*>(e
);
3666 if (ue
->op_
== OPERATOR_AND
)
3673 ue
->set_does_not_escape();
3678 if (op
== OPERATOR_PLUS
|| op
== OPERATOR_MINUS
3679 || op
== OPERATOR_NOT
|| op
== OPERATOR_XOR
)
3681 Expression
* ret
= NULL
;
3686 if (expr
->integer_constant_value(false, eval
, &etype
))
3690 if (Unary_expression::eval_integer(op
, etype
, eval
, val
, loc
))
3691 ret
= Expression::make_integer(&val
, etype
, loc
);
3698 if (op
== OPERATOR_PLUS
|| op
== OPERATOR_MINUS
)
3703 if (expr
->float_constant_value(fval
, &ftype
))
3707 if (Unary_expression::eval_float(op
, fval
, val
))
3708 ret
= Expression::make_float(&val
, ftype
, loc
);
3719 if (expr
->complex_constant_value(fval
, ival
, &ftype
))
3725 if (Unary_expression::eval_complex(op
, fval
, ival
, real
, imag
))
3726 ret
= Expression::make_complex(&real
, &imag
, ftype
, loc
);
3740 // Return whether a unary expression is a constant.
3743 Unary_expression::do_is_constant() const
3745 if (this->op_
== OPERATOR_MULT
)
3747 // Indirecting through a pointer is only constant if the object
3748 // to which the expression points is constant, but we currently
3749 // have no way to determine that.
3752 else if (this->op_
== OPERATOR_AND
)
3754 // Taking the address of a variable is constant if it is a
3755 // global variable, not constant otherwise. In other cases
3756 // taking the address is probably not a constant.
3757 Var_expression
* ve
= this->expr_
->var_expression();
3760 Named_object
* no
= ve
->named_object();
3761 return no
->is_variable() && no
->var_value()->is_global();
3766 return this->expr_
->is_constant();
3769 // Apply unary opcode OP to UVAL, setting VAL. UTYPE is the type of
3770 // UVAL, if known; it may be NULL. Return true if this could be done,
3774 Unary_expression::eval_integer(Operator op
, Type
* utype
, mpz_t uval
, mpz_t val
,
3775 source_location location
)
3782 case OPERATOR_MINUS
:
3784 return Integer_expression::check_constant(val
, utype
, location
);
3786 mpz_set_ui(val
, mpz_cmp_si(uval
, 0) == 0 ? 1 : 0);
3790 || utype
->integer_type() == NULL
3791 || utype
->integer_type()->is_abstract())
3795 // The number of HOST_WIDE_INTs that it takes to represent
3797 size_t count
= ((mpz_sizeinbase(uval
, 2)
3798 + HOST_BITS_PER_WIDE_INT
3800 / HOST_BITS_PER_WIDE_INT
);
3802 unsigned HOST_WIDE_INT
* phwi
= new unsigned HOST_WIDE_INT
[count
];
3803 memset(phwi
, 0, count
* sizeof(HOST_WIDE_INT
));
3806 mpz_export(phwi
, &ecount
, -1, sizeof(HOST_WIDE_INT
), 0, 0, uval
);
3807 gcc_assert(ecount
<= count
);
3809 // Trim down to the number of words required by the type.
3810 size_t obits
= utype
->integer_type()->bits();
3811 if (!utype
->integer_type()->is_unsigned())
3813 size_t ocount
= ((obits
+ HOST_BITS_PER_WIDE_INT
- 1)
3814 / HOST_BITS_PER_WIDE_INT
);
3815 gcc_assert(ocount
<= ocount
);
3817 for (size_t i
= 0; i
< ocount
; ++i
)
3820 size_t clearbits
= ocount
* HOST_BITS_PER_WIDE_INT
- obits
;
3822 phwi
[ocount
- 1] &= (((unsigned HOST_WIDE_INT
) (HOST_WIDE_INT
) -1)
3825 mpz_import(val
, ocount
, -1, sizeof(HOST_WIDE_INT
), 0, 0, phwi
);
3829 return Integer_expression::check_constant(val
, utype
, location
);
3838 // Apply unary opcode OP to UVAL, setting VAL. Return true if this
3839 // could be done, false if not.
3842 Unary_expression::eval_float(Operator op
, mpfr_t uval
, mpfr_t val
)
3847 mpfr_set(val
, uval
, GMP_RNDN
);
3849 case OPERATOR_MINUS
:
3850 mpfr_neg(val
, uval
, GMP_RNDN
);
3862 // Apply unary opcode OP to RVAL/IVAL, setting REAL/IMAG. Return true
3863 // if this could be done, false if not.
3866 Unary_expression::eval_complex(Operator op
, mpfr_t rval
, mpfr_t ival
,
3867 mpfr_t real
, mpfr_t imag
)
3872 mpfr_set(real
, rval
, GMP_RNDN
);
3873 mpfr_set(imag
, ival
, GMP_RNDN
);
3875 case OPERATOR_MINUS
:
3876 mpfr_neg(real
, rval
, GMP_RNDN
);
3877 mpfr_neg(imag
, ival
, GMP_RNDN
);
3889 // Return the integral constant value of a unary expression, if it has one.
3892 Unary_expression::do_integer_constant_value(bool iota_is_constant
, mpz_t val
,
3898 if (!this->expr_
->integer_constant_value(iota_is_constant
, uval
, ptype
))
3901 ret
= Unary_expression::eval_integer(this->op_
, *ptype
, uval
, val
,
3907 // Return the floating point constant value of a unary expression, if
3911 Unary_expression::do_float_constant_value(mpfr_t val
, Type
** ptype
) const
3916 if (!this->expr_
->float_constant_value(uval
, ptype
))
3919 ret
= Unary_expression::eval_float(this->op_
, uval
, val
);
3924 // Return the complex constant value of a unary expression, if it has
3928 Unary_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
3936 if (!this->expr_
->complex_constant_value(rval
, ival
, ptype
))
3939 ret
= Unary_expression::eval_complex(this->op_
, rval
, ival
, real
, imag
);
3945 // Return the type of a unary expression.
3948 Unary_expression::do_type()
3953 case OPERATOR_MINUS
:
3956 return this->expr_
->type();
3959 return Type::make_pointer_type(this->expr_
->type());
3963 Type
* subtype
= this->expr_
->type();
3964 Type
* points_to
= subtype
->points_to();
3965 if (points_to
== NULL
)
3966 return Type::make_error_type();
3975 // Determine abstract types for a unary expression.
3978 Unary_expression::do_determine_type(const Type_context
* context
)
3983 case OPERATOR_MINUS
:
3986 this->expr_
->determine_type(context
);
3990 // Taking the address of something.
3992 Type
* subtype
= (context
->type
== NULL
3994 : context
->type
->points_to());
3995 Type_context
subcontext(subtype
, false);
3996 this->expr_
->determine_type(&subcontext
);
4001 // Indirecting through a pointer.
4003 Type
* subtype
= (context
->type
== NULL
4005 : Type::make_pointer_type(context
->type
));
4006 Type_context
subcontext(subtype
, false);
4007 this->expr_
->determine_type(&subcontext
);
4016 // Check types for a unary expression.
4019 Unary_expression::do_check_types(Gogo
*)
4021 Type
* type
= this->expr_
->type();
4022 if (type
->is_error_type())
4024 this->set_is_error();
4031 case OPERATOR_MINUS
:
4032 if (type
->integer_type() == NULL
4033 && type
->float_type() == NULL
4034 && type
->complex_type() == NULL
)
4035 this->report_error(_("expected numeric type"));
4040 if (type
->integer_type() == NULL
4041 && !type
->is_boolean_type())
4042 this->report_error(_("expected integer or boolean type"));
4046 if (!this->expr_
->is_addressable())
4047 this->report_error(_("invalid operand for unary %<&%>"));
4049 this->expr_
->address_taken(this->escapes_
);
4053 // Indirecting through a pointer.
4054 if (type
->points_to() == NULL
)
4055 this->report_error(_("expected pointer"));
4063 // Get a tree for a unary expression.
4066 Unary_expression::do_get_tree(Translate_context
* context
)
4068 tree expr
= this->expr_
->get_tree(context
);
4069 if (expr
== error_mark_node
)
4070 return error_mark_node
;
4072 source_location loc
= this->location();
4078 case OPERATOR_MINUS
:
4080 tree type
= TREE_TYPE(expr
);
4081 tree compute_type
= excess_precision_type(type
);
4082 if (compute_type
!= NULL_TREE
)
4083 expr
= ::convert(compute_type
, expr
);
4084 tree ret
= fold_build1_loc(loc
, NEGATE_EXPR
,
4085 (compute_type
!= NULL_TREE
4089 if (compute_type
!= NULL_TREE
)
4090 ret
= ::convert(type
, ret
);
4095 if (TREE_CODE(TREE_TYPE(expr
)) == BOOLEAN_TYPE
)
4096 return fold_build1_loc(loc
, TRUTH_NOT_EXPR
, TREE_TYPE(expr
), expr
);
4098 return fold_build2_loc(loc
, NE_EXPR
, boolean_type_node
, expr
,
4099 build_int_cst(TREE_TYPE(expr
), 0));
4102 return fold_build1_loc(loc
, BIT_NOT_EXPR
, TREE_TYPE(expr
), expr
);
4105 // We should not see a non-constant constructor here; cases
4106 // where we would see one should have been moved onto the heap
4107 // at parse time. Taking the address of a nonconstant
4108 // constructor will not do what the programmer expects.
4109 gcc_assert(TREE_CODE(expr
) != CONSTRUCTOR
|| TREE_CONSTANT(expr
));
4110 gcc_assert(TREE_CODE(expr
) != ADDR_EXPR
);
4112 // Build a decl for a constant constructor.
4113 if (TREE_CODE(expr
) == CONSTRUCTOR
&& TREE_CONSTANT(expr
))
4115 tree decl
= build_decl(this->location(), VAR_DECL
,
4116 create_tmp_var_name("C"), TREE_TYPE(expr
));
4117 DECL_EXTERNAL(decl
) = 0;
4118 TREE_PUBLIC(decl
) = 0;
4119 TREE_READONLY(decl
) = 1;
4120 TREE_CONSTANT(decl
) = 1;
4121 TREE_STATIC(decl
) = 1;
4122 TREE_ADDRESSABLE(decl
) = 1;
4123 DECL_ARTIFICIAL(decl
) = 1;
4124 DECL_INITIAL(decl
) = expr
;
4125 rest_of_decl_compilation(decl
, 1, 0);
4129 return build_fold_addr_expr_loc(loc
, expr
);
4133 gcc_assert(POINTER_TYPE_P(TREE_TYPE(expr
)));
4135 // If we are dereferencing the pointer to a large struct, we
4136 // need to check for nil. We don't bother to check for small
4137 // structs because we expect the system to crash on a nil
4138 // pointer dereference.
4139 HOST_WIDE_INT s
= int_size_in_bytes(TREE_TYPE(TREE_TYPE(expr
)));
4140 if (s
== -1 || s
>= 4096)
4143 expr
= save_expr(expr
);
4144 tree compare
= fold_build2_loc(loc
, EQ_EXPR
, boolean_type_node
,
4146 fold_convert(TREE_TYPE(expr
),
4147 null_pointer_node
));
4148 tree crash
= Gogo::runtime_error(RUNTIME_ERROR_NIL_DEREFERENCE
,
4150 expr
= fold_build2_loc(loc
, COMPOUND_EXPR
, TREE_TYPE(expr
),
4151 build3(COND_EXPR
, void_type_node
,
4152 compare
, crash
, NULL_TREE
),
4156 // If the type of EXPR is a recursive pointer type, then we
4157 // need to insert a cast before indirecting.
4158 if (TREE_TYPE(TREE_TYPE(expr
)) == ptr_type_node
)
4160 Type
* pt
= this->expr_
->type()->points_to();
4161 tree ind
= pt
->get_tree(context
->gogo());
4162 expr
= fold_convert_loc(loc
, build_pointer_type(ind
), expr
);
4165 return build_fold_indirect_ref_loc(loc
, expr
);
4173 // Export a unary expression.
4176 Unary_expression::do_export(Export
* exp
) const
4181 exp
->write_c_string("+ ");
4183 case OPERATOR_MINUS
:
4184 exp
->write_c_string("- ");
4187 exp
->write_c_string("! ");
4190 exp
->write_c_string("^ ");
4197 this->expr_
->export_expression(exp
);
4200 // Import a unary expression.
4203 Unary_expression::do_import(Import
* imp
)
4206 switch (imp
->get_char())
4212 op
= OPERATOR_MINUS
;
4223 imp
->require_c_string(" ");
4224 Expression
* expr
= Expression::import_expression(imp
);
4225 return Expression::make_unary(op
, expr
, imp
->location());
4228 // Make a unary expression.
4231 Expression::make_unary(Operator op
, Expression
* expr
, source_location location
)
4233 return new Unary_expression(op
, expr
, location
);
4236 // If this is an indirection through a pointer, return the expression
4237 // being pointed through. Otherwise return this.
4242 if (this->classification_
== EXPRESSION_UNARY
)
4244 Unary_expression
* ue
= static_cast<Unary_expression
*>(this);
4245 if (ue
->op() == OPERATOR_MULT
)
4246 return ue
->operand();
4251 // Class Binary_expression.
4256 Binary_expression::do_traverse(Traverse
* traverse
)
4258 int t
= Expression::traverse(&this->left_
, traverse
);
4259 if (t
== TRAVERSE_EXIT
)
4260 return TRAVERSE_EXIT
;
4261 return Expression::traverse(&this->right_
, traverse
);
4264 // Compare integer constants according to OP.
4267 Binary_expression::compare_integer(Operator op
, mpz_t left_val
,
4270 int i
= mpz_cmp(left_val
, right_val
);
4275 case OPERATOR_NOTEQ
:
4290 // Compare floating point constants according to OP.
4293 Binary_expression::compare_float(Operator op
, Type
* type
, mpfr_t left_val
,
4298 i
= mpfr_cmp(left_val
, right_val
);
4302 mpfr_init_set(lv
, left_val
, GMP_RNDN
);
4304 mpfr_init_set(rv
, right_val
, GMP_RNDN
);
4305 Float_expression::constrain_float(lv
, type
);
4306 Float_expression::constrain_float(rv
, type
);
4307 i
= mpfr_cmp(lv
, rv
);
4315 case OPERATOR_NOTEQ
:
4330 // Compare complex constants according to OP. Complex numbers may
4331 // only be compared for equality.
4334 Binary_expression::compare_complex(Operator op
, Type
* type
,
4335 mpfr_t left_real
, mpfr_t left_imag
,
4336 mpfr_t right_real
, mpfr_t right_imag
)
4340 is_equal
= (mpfr_cmp(left_real
, right_real
) == 0
4341 && mpfr_cmp(left_imag
, right_imag
) == 0);
4346 mpfr_init_set(lr
, left_real
, GMP_RNDN
);
4347 mpfr_init_set(li
, left_imag
, GMP_RNDN
);
4350 mpfr_init_set(rr
, right_real
, GMP_RNDN
);
4351 mpfr_init_set(ri
, right_imag
, GMP_RNDN
);
4352 Complex_expression::constrain_complex(lr
, li
, type
);
4353 Complex_expression::constrain_complex(rr
, ri
, type
);
4354 is_equal
= mpfr_cmp(lr
, rr
) == 0 && mpfr_cmp(li
, ri
) == 0;
4364 case OPERATOR_NOTEQ
:
4371 // Apply binary opcode OP to LEFT_VAL and RIGHT_VAL, setting VAL.
4372 // LEFT_TYPE is the type of LEFT_VAL, RIGHT_TYPE is the type of
4373 // RIGHT_VAL; LEFT_TYPE and/or RIGHT_TYPE may be NULL. Return true if
4374 // this could be done, false if not.
4377 Binary_expression::eval_integer(Operator op
, Type
* left_type
, mpz_t left_val
,
4378 Type
* right_type
, mpz_t right_val
,
4379 source_location location
, mpz_t val
)
4381 bool is_shift_op
= false;
4385 case OPERATOR_ANDAND
:
4387 case OPERATOR_NOTEQ
:
4392 // These return boolean values. We should probably handle them
4393 // anyhow in case a type conversion is used on the result.
4396 mpz_add(val
, left_val
, right_val
);
4398 case OPERATOR_MINUS
:
4399 mpz_sub(val
, left_val
, right_val
);
4402 mpz_ior(val
, left_val
, right_val
);
4405 mpz_xor(val
, left_val
, right_val
);
4408 mpz_mul(val
, left_val
, right_val
);
4411 if (mpz_sgn(right_val
) != 0)
4412 mpz_tdiv_q(val
, left_val
, right_val
);
4415 error_at(location
, "division by zero");
4421 if (mpz_sgn(right_val
) != 0)
4422 mpz_tdiv_r(val
, left_val
, right_val
);
4425 error_at(location
, "division by zero");
4430 case OPERATOR_LSHIFT
:
4432 unsigned long shift
= mpz_get_ui(right_val
);
4433 if (mpz_cmp_ui(right_val
, shift
) != 0)
4435 error_at(location
, "shift count overflow");
4439 mpz_mul_2exp(val
, left_val
, shift
);
4444 case OPERATOR_RSHIFT
:
4446 unsigned long shift
= mpz_get_ui(right_val
);
4447 if (mpz_cmp_ui(right_val
, shift
) != 0)
4449 error_at(location
, "shift count overflow");
4453 if (mpz_cmp_ui(left_val
, 0) >= 0)
4454 mpz_tdiv_q_2exp(val
, left_val
, shift
);
4456 mpz_fdiv_q_2exp(val
, left_val
, shift
);
4462 mpz_and(val
, left_val
, right_val
);
4464 case OPERATOR_BITCLEAR
:
4468 mpz_com(tval
, right_val
);
4469 mpz_and(val
, left_val
, tval
);
4477 Type
* type
= left_type
;
4482 else if (type
!= right_type
&& right_type
!= NULL
)
4484 if (type
->is_abstract())
4486 else if (!right_type
->is_abstract())
4488 // This look like a type error which should be diagnosed
4489 // elsewhere. Don't do anything here, to avoid an
4490 // unhelpful chain of error messages.
4496 if (type
!= NULL
&& !type
->is_abstract())
4498 // We have to check the operands too, as we have implicitly
4499 // coerced them to TYPE.
4500 if ((type
!= left_type
4501 && !Integer_expression::check_constant(left_val
, type
, location
))
4503 && type
!= right_type
4504 && !Integer_expression::check_constant(right_val
, type
,
4506 || !Integer_expression::check_constant(val
, type
, location
))
4513 // Apply binary opcode OP to LEFT_VAL and RIGHT_VAL, setting VAL.
4514 // Return true if this could be done, false if not.
4517 Binary_expression::eval_float(Operator op
, Type
* left_type
, mpfr_t left_val
,
4518 Type
* right_type
, mpfr_t right_val
,
4519 mpfr_t val
, source_location location
)
4524 case OPERATOR_ANDAND
:
4526 case OPERATOR_NOTEQ
:
4531 // These return boolean values. We should probably handle them
4532 // anyhow in case a type conversion is used on the result.
4535 mpfr_add(val
, left_val
, right_val
, GMP_RNDN
);
4537 case OPERATOR_MINUS
:
4538 mpfr_sub(val
, left_val
, right_val
, GMP_RNDN
);
4543 case OPERATOR_BITCLEAR
:
4546 mpfr_mul(val
, left_val
, right_val
, GMP_RNDN
);
4549 if (mpfr_zero_p(right_val
))
4550 error_at(location
, "division by zero");
4551 mpfr_div(val
, left_val
, right_val
, GMP_RNDN
);
4555 case OPERATOR_LSHIFT
:
4556 case OPERATOR_RSHIFT
:
4562 Type
* type
= left_type
;
4565 else if (type
!= right_type
&& right_type
!= NULL
)
4567 if (type
->is_abstract())
4569 else if (!right_type
->is_abstract())
4571 // This looks like a type error which should be diagnosed
4572 // elsewhere. Don't do anything here, to avoid an unhelpful
4573 // chain of error messages.
4578 if (type
!= NULL
&& !type
->is_abstract())
4580 if ((type
!= left_type
4581 && !Float_expression::check_constant(left_val
, type
, location
))
4582 || (type
!= right_type
4583 && !Float_expression::check_constant(right_val
, type
,
4585 || !Float_expression::check_constant(val
, type
, location
))
4586 mpfr_set_ui(val
, 0, GMP_RNDN
);
4592 // Apply binary opcode OP to LEFT_REAL/LEFT_IMAG and
4593 // RIGHT_REAL/RIGHT_IMAG, setting REAL/IMAG. Return true if this
4594 // could be done, false if not.
4597 Binary_expression::eval_complex(Operator op
, Type
* left_type
,
4598 mpfr_t left_real
, mpfr_t left_imag
,
4600 mpfr_t right_real
, mpfr_t right_imag
,
4601 mpfr_t real
, mpfr_t imag
,
4602 source_location location
)
4607 case OPERATOR_ANDAND
:
4609 case OPERATOR_NOTEQ
:
4614 // These return boolean values and must be handled differently.
4617 mpfr_add(real
, left_real
, right_real
, GMP_RNDN
);
4618 mpfr_add(imag
, left_imag
, right_imag
, GMP_RNDN
);
4620 case OPERATOR_MINUS
:
4621 mpfr_sub(real
, left_real
, right_real
, GMP_RNDN
);
4622 mpfr_sub(imag
, left_imag
, right_imag
, GMP_RNDN
);
4627 case OPERATOR_BITCLEAR
:
4631 // You might think that multiplying two complex numbers would
4632 // be simple, and you would be right, until you start to think
4633 // about getting the right answer for infinity. If one
4634 // operand here is infinity and the other is anything other
4635 // than zero or NaN, then we are going to wind up subtracting
4636 // two infinity values. That will give us a NaN, but the
4637 // correct answer is infinity.
4641 mpfr_mul(lrrr
, left_real
, right_real
, GMP_RNDN
);
4645 mpfr_mul(lrri
, left_real
, right_imag
, GMP_RNDN
);
4649 mpfr_mul(lirr
, left_imag
, right_real
, GMP_RNDN
);
4653 mpfr_mul(liri
, left_imag
, right_imag
, GMP_RNDN
);
4655 mpfr_sub(real
, lrrr
, liri
, GMP_RNDN
);
4656 mpfr_add(imag
, lrri
, lirr
, GMP_RNDN
);
4658 // If we get NaN on both sides, check whether it should really
4659 // be infinity. The rule is that if either side of the
4660 // complex number is infinity, then the whole value is
4661 // infinity, even if the other side is NaN. So the only case
4662 // we have to fix is the one in which both sides are NaN.
4663 if (mpfr_nan_p(real
) && mpfr_nan_p(imag
)
4664 && (!mpfr_nan_p(left_real
) || !mpfr_nan_p(left_imag
))
4665 && (!mpfr_nan_p(right_real
) || !mpfr_nan_p(right_imag
)))
4667 bool is_infinity
= false;
4671 mpfr_init_set(lr
, left_real
, GMP_RNDN
);
4672 mpfr_init_set(li
, left_imag
, GMP_RNDN
);
4676 mpfr_init_set(rr
, right_real
, GMP_RNDN
);
4677 mpfr_init_set(ri
, right_imag
, GMP_RNDN
);
4679 // If the left side is infinity, then the result is
4681 if (mpfr_inf_p(lr
) || mpfr_inf_p(li
))
4683 mpfr_set_ui(lr
, mpfr_inf_p(lr
) ? 1 : 0, GMP_RNDN
);
4684 mpfr_copysign(lr
, lr
, left_real
, GMP_RNDN
);
4685 mpfr_set_ui(li
, mpfr_inf_p(li
) ? 1 : 0, GMP_RNDN
);
4686 mpfr_copysign(li
, li
, left_imag
, GMP_RNDN
);
4689 mpfr_set_ui(rr
, 0, GMP_RNDN
);
4690 mpfr_copysign(rr
, rr
, right_real
, GMP_RNDN
);
4694 mpfr_set_ui(ri
, 0, GMP_RNDN
);
4695 mpfr_copysign(ri
, ri
, right_imag
, GMP_RNDN
);
4700 // If the right side is infinity, then the result is
4702 if (mpfr_inf_p(rr
) || mpfr_inf_p(ri
))
4704 mpfr_set_ui(rr
, mpfr_inf_p(rr
) ? 1 : 0, GMP_RNDN
);
4705 mpfr_copysign(rr
, rr
, right_real
, GMP_RNDN
);
4706 mpfr_set_ui(ri
, mpfr_inf_p(ri
) ? 1 : 0, GMP_RNDN
);
4707 mpfr_copysign(ri
, ri
, right_imag
, GMP_RNDN
);
4710 mpfr_set_ui(lr
, 0, GMP_RNDN
);
4711 mpfr_copysign(lr
, lr
, left_real
, GMP_RNDN
);
4715 mpfr_set_ui(li
, 0, GMP_RNDN
);
4716 mpfr_copysign(li
, li
, left_imag
, GMP_RNDN
);
4721 // If we got an overflow in the intermediate computations,
4722 // then the result is infinity.
4724 && (mpfr_inf_p(lrrr
) || mpfr_inf_p(lrri
)
4725 || mpfr_inf_p(lirr
) || mpfr_inf_p(liri
)))
4729 mpfr_set_ui(lr
, 0, GMP_RNDN
);
4730 mpfr_copysign(lr
, lr
, left_real
, GMP_RNDN
);
4734 mpfr_set_ui(li
, 0, GMP_RNDN
);
4735 mpfr_copysign(li
, li
, left_imag
, GMP_RNDN
);
4739 mpfr_set_ui(rr
, 0, GMP_RNDN
);
4740 mpfr_copysign(rr
, rr
, right_real
, GMP_RNDN
);
4744 mpfr_set_ui(ri
, 0, GMP_RNDN
);
4745 mpfr_copysign(ri
, ri
, right_imag
, GMP_RNDN
);
4752 mpfr_mul(lrrr
, lr
, rr
, GMP_RNDN
);
4753 mpfr_mul(lrri
, lr
, ri
, GMP_RNDN
);
4754 mpfr_mul(lirr
, li
, rr
, GMP_RNDN
);
4755 mpfr_mul(liri
, li
, ri
, GMP_RNDN
);
4756 mpfr_sub(real
, lrrr
, liri
, GMP_RNDN
);
4757 mpfr_add(imag
, lrri
, lirr
, GMP_RNDN
);
4758 mpfr_set_inf(real
, mpfr_sgn(real
));
4759 mpfr_set_inf(imag
, mpfr_sgn(imag
));
4776 // For complex division we want to avoid having an
4777 // intermediate overflow turn the whole result in a NaN. We
4778 // scale the values to try to avoid this.
4780 if (mpfr_zero_p(right_real
) && mpfr_zero_p(right_imag
))
4781 error_at(location
, "division by zero");
4787 mpfr_abs(rra
, right_real
, GMP_RNDN
);
4788 mpfr_abs(ria
, right_imag
, GMP_RNDN
);
4791 mpfr_max(t
, rra
, ria
, GMP_RNDN
);
4795 mpfr_init_set(rr
, right_real
, GMP_RNDN
);
4796 mpfr_init_set(ri
, right_imag
, GMP_RNDN
);
4798 if (!mpfr_inf_p(t
) && !mpfr_nan_p(t
) && !mpfr_zero_p(t
))
4800 ilogbw
= mpfr_get_exp(t
);
4801 mpfr_mul_2si(rr
, rr
, - ilogbw
, GMP_RNDN
);
4802 mpfr_mul_2si(ri
, ri
, - ilogbw
, GMP_RNDN
);
4807 mpfr_mul(denom
, rr
, rr
, GMP_RNDN
);
4808 mpfr_mul(t
, ri
, ri
, GMP_RNDN
);
4809 mpfr_add(denom
, denom
, t
, GMP_RNDN
);
4811 mpfr_mul(real
, left_real
, rr
, GMP_RNDN
);
4812 mpfr_mul(t
, left_imag
, ri
, GMP_RNDN
);
4813 mpfr_add(real
, real
, t
, GMP_RNDN
);
4814 mpfr_div(real
, real
, denom
, GMP_RNDN
);
4815 mpfr_mul_2si(real
, real
, - ilogbw
, GMP_RNDN
);
4817 mpfr_mul(imag
, left_imag
, rr
, GMP_RNDN
);
4818 mpfr_mul(t
, left_real
, ri
, GMP_RNDN
);
4819 mpfr_sub(imag
, imag
, t
, GMP_RNDN
);
4820 mpfr_div(imag
, imag
, denom
, GMP_RNDN
);
4821 mpfr_mul_2si(imag
, imag
, - ilogbw
, GMP_RNDN
);
4823 // If we wind up with NaN on both sides, check whether we
4824 // should really have infinity. The rule is that if either
4825 // side of the complex number is infinity, then the whole
4826 // value is infinity, even if the other side is NaN. So the
4827 // only case we have to fix is the one in which both sides are
4829 if (mpfr_nan_p(real
) && mpfr_nan_p(imag
)
4830 && (!mpfr_nan_p(left_real
) || !mpfr_nan_p(left_imag
))
4831 && (!mpfr_nan_p(right_real
) || !mpfr_nan_p(right_imag
)))
4833 if (mpfr_zero_p(denom
))
4835 mpfr_set_inf(real
, mpfr_sgn(rr
));
4836 mpfr_mul(real
, real
, left_real
, GMP_RNDN
);
4837 mpfr_set_inf(imag
, mpfr_sgn(rr
));
4838 mpfr_mul(imag
, imag
, left_imag
, GMP_RNDN
);
4840 else if ((mpfr_inf_p(left_real
) || mpfr_inf_p(left_imag
))
4841 && mpfr_number_p(rr
) && mpfr_number_p(ri
))
4843 mpfr_set_ui(t
, mpfr_inf_p(left_real
) ? 1 : 0, GMP_RNDN
);
4844 mpfr_copysign(t
, t
, left_real
, GMP_RNDN
);
4847 mpfr_init_set_ui(t2
, mpfr_inf_p(left_imag
) ? 1 : 0, GMP_RNDN
);
4848 mpfr_copysign(t2
, t2
, left_imag
, GMP_RNDN
);
4852 mpfr_mul(t3
, t
, rr
, GMP_RNDN
);
4856 mpfr_mul(t4
, t2
, ri
, GMP_RNDN
);
4858 mpfr_add(t3
, t3
, t4
, GMP_RNDN
);
4859 mpfr_set_inf(real
, mpfr_sgn(t3
));
4861 mpfr_mul(t3
, t2
, rr
, GMP_RNDN
);
4862 mpfr_mul(t4
, t
, ri
, GMP_RNDN
);
4863 mpfr_sub(t3
, t3
, t4
, GMP_RNDN
);
4864 mpfr_set_inf(imag
, mpfr_sgn(t3
));
4870 else if ((mpfr_inf_p(right_real
) || mpfr_inf_p(right_imag
))
4871 && mpfr_number_p(left_real
) && mpfr_number_p(left_imag
))
4873 mpfr_set_ui(t
, mpfr_inf_p(rr
) ? 1 : 0, GMP_RNDN
);
4874 mpfr_copysign(t
, t
, rr
, GMP_RNDN
);
4877 mpfr_init_set_ui(t2
, mpfr_inf_p(ri
) ? 1 : 0, GMP_RNDN
);
4878 mpfr_copysign(t2
, t2
, ri
, GMP_RNDN
);
4882 mpfr_mul(t3
, left_real
, t
, GMP_RNDN
);
4886 mpfr_mul(t4
, left_imag
, t2
, GMP_RNDN
);
4888 mpfr_add(t3
, t3
, t4
, GMP_RNDN
);
4889 mpfr_set_ui(real
, 0, GMP_RNDN
);
4890 mpfr_mul(real
, real
, t3
, GMP_RNDN
);
4892 mpfr_mul(t3
, left_imag
, t
, GMP_RNDN
);
4893 mpfr_mul(t4
, left_real
, t2
, GMP_RNDN
);
4894 mpfr_sub(t3
, t3
, t4
, GMP_RNDN
);
4895 mpfr_set_ui(imag
, 0, GMP_RNDN
);
4896 mpfr_mul(imag
, imag
, t3
, GMP_RNDN
);
4914 case OPERATOR_LSHIFT
:
4915 case OPERATOR_RSHIFT
:
4921 Type
* type
= left_type
;
4924 else if (type
!= right_type
&& right_type
!= NULL
)
4926 if (type
->is_abstract())
4928 else if (!right_type
->is_abstract())
4930 // This looks like a type error which should be diagnosed
4931 // elsewhere. Don't do anything here, to avoid an unhelpful
4932 // chain of error messages.
4937 if (type
!= NULL
&& !type
->is_abstract())
4939 if ((type
!= left_type
4940 && !Complex_expression::check_constant(left_real
, left_imag
,
4942 || (type
!= right_type
4943 && !Complex_expression::check_constant(right_real
, right_imag
,
4945 || !Complex_expression::check_constant(real
, imag
, type
,
4948 mpfr_set_ui(real
, 0, GMP_RNDN
);
4949 mpfr_set_ui(imag
, 0, GMP_RNDN
);
4956 // Lower a binary expression. We have to evaluate constant
4957 // expressions now, in order to implement Go's unlimited precision
4961 Binary_expression::do_lower(Gogo
*, Named_object
*, int)
4963 source_location location
= this->location();
4964 Operator op
= this->op_
;
4965 Expression
* left
= this->left_
;
4966 Expression
* right
= this->right_
;
4968 const bool is_comparison
= (op
== OPERATOR_EQEQ
4969 || op
== OPERATOR_NOTEQ
4970 || op
== OPERATOR_LT
4971 || op
== OPERATOR_LE
4972 || op
== OPERATOR_GT
4973 || op
== OPERATOR_GE
);
4975 // Integer constant expressions.
4981 mpz_init(right_val
);
4983 if (left
->integer_constant_value(false, left_val
, &left_type
)
4984 && right
->integer_constant_value(false, right_val
, &right_type
))
4986 Expression
* ret
= NULL
;
4987 if (left_type
!= right_type
4988 && left_type
!= NULL
4989 && right_type
!= NULL
4990 && left_type
->base() != right_type
->base()
4991 && op
!= OPERATOR_LSHIFT
4992 && op
!= OPERATOR_RSHIFT
)
4994 // May be a type error--let it be diagnosed later.
4996 else if (is_comparison
)
4998 bool b
= Binary_expression::compare_integer(op
, left_val
,
5000 ret
= Expression::make_cast(Type::lookup_bool_type(),
5001 Expression::make_boolean(b
, location
),
5009 if (Binary_expression::eval_integer(op
, left_type
, left_val
,
5010 right_type
, right_val
,
5013 gcc_assert(op
!= OPERATOR_OROR
&& op
!= OPERATOR_ANDAND
);
5015 if (op
== OPERATOR_LSHIFT
|| op
== OPERATOR_RSHIFT
)
5017 else if (left_type
== NULL
)
5019 else if (right_type
== NULL
)
5021 else if (!left_type
->is_abstract()
5022 && left_type
->named_type() != NULL
)
5024 else if (!right_type
->is_abstract()
5025 && right_type
->named_type() != NULL
)
5027 else if (!left_type
->is_abstract())
5029 else if (!right_type
->is_abstract())
5031 else if (left_type
->float_type() != NULL
)
5033 else if (right_type
->float_type() != NULL
)
5035 else if (left_type
->complex_type() != NULL
)
5037 else if (right_type
->complex_type() != NULL
)
5041 ret
= Expression::make_integer(&val
, type
, location
);
5049 mpz_clear(right_val
);
5050 mpz_clear(left_val
);
5054 mpz_clear(right_val
);
5055 mpz_clear(left_val
);
5058 // Floating point constant expressions.
5061 mpfr_init(left_val
);
5064 mpfr_init(right_val
);
5066 if (left
->float_constant_value(left_val
, &left_type
)
5067 && right
->float_constant_value(right_val
, &right_type
))
5069 Expression
* ret
= NULL
;
5070 if (left_type
!= right_type
5071 && left_type
!= NULL
5072 && right_type
!= NULL
5073 && left_type
->base() != right_type
->base()
5074 && op
!= OPERATOR_LSHIFT
5075 && op
!= OPERATOR_RSHIFT
)
5077 // May be a type error--let it be diagnosed later.
5079 else if (is_comparison
)
5081 bool b
= Binary_expression::compare_float(op
,
5085 left_val
, right_val
);
5086 ret
= Expression::make_boolean(b
, location
);
5093 if (Binary_expression::eval_float(op
, left_type
, left_val
,
5094 right_type
, right_val
, val
,
5097 gcc_assert(op
!= OPERATOR_OROR
&& op
!= OPERATOR_ANDAND
5098 && op
!= OPERATOR_LSHIFT
&& op
!= OPERATOR_RSHIFT
);
5100 if (left_type
== NULL
)
5102 else if (right_type
== NULL
)
5104 else if (!left_type
->is_abstract()
5105 && left_type
->named_type() != NULL
)
5107 else if (!right_type
->is_abstract()
5108 && right_type
->named_type() != NULL
)
5110 else if (!left_type
->is_abstract())
5112 else if (!right_type
->is_abstract())
5114 else if (left_type
->float_type() != NULL
)
5116 else if (right_type
->float_type() != NULL
)
5120 ret
= Expression::make_float(&val
, type
, location
);
5128 mpfr_clear(right_val
);
5129 mpfr_clear(left_val
);
5133 mpfr_clear(right_val
);
5134 mpfr_clear(left_val
);
5137 // Complex constant expressions.
5141 mpfr_init(left_real
);
5142 mpfr_init(left_imag
);
5147 mpfr_init(right_real
);
5148 mpfr_init(right_imag
);
5151 if (left
->complex_constant_value(left_real
, left_imag
, &left_type
)
5152 && right
->complex_constant_value(right_real
, right_imag
, &right_type
))
5154 Expression
* ret
= NULL
;
5155 if (left_type
!= right_type
5156 && left_type
!= NULL
5157 && right_type
!= NULL
5158 && left_type
->base() != right_type
->base())
5160 // May be a type error--let it be diagnosed later.
5162 else if (op
== OPERATOR_EQEQ
|| op
== OPERATOR_NOTEQ
)
5164 bool b
= Binary_expression::compare_complex(op
,
5172 ret
= Expression::make_boolean(b
, location
);
5181 if (Binary_expression::eval_complex(op
, left_type
,
5182 left_real
, left_imag
,
5184 right_real
, right_imag
,
5188 gcc_assert(op
!= OPERATOR_OROR
&& op
!= OPERATOR_ANDAND
5189 && op
!= OPERATOR_LSHIFT
&& op
!= OPERATOR_RSHIFT
);
5191 if (left_type
== NULL
)
5193 else if (right_type
== NULL
)
5195 else if (!left_type
->is_abstract()
5196 && left_type
->named_type() != NULL
)
5198 else if (!right_type
->is_abstract()
5199 && right_type
->named_type() != NULL
)
5201 else if (!left_type
->is_abstract())
5203 else if (!right_type
->is_abstract())
5205 else if (left_type
->complex_type() != NULL
)
5207 else if (right_type
->complex_type() != NULL
)
5211 ret
= Expression::make_complex(&real
, &imag
, type
,
5220 mpfr_clear(left_real
);
5221 mpfr_clear(left_imag
);
5222 mpfr_clear(right_real
);
5223 mpfr_clear(right_imag
);
5228 mpfr_clear(left_real
);
5229 mpfr_clear(left_imag
);
5230 mpfr_clear(right_real
);
5231 mpfr_clear(right_imag
);
5234 // String constant expressions.
5235 if (op
== OPERATOR_PLUS
5236 && left
->type()->is_string_type()
5237 && right
->type()->is_string_type())
5239 std::string left_string
;
5240 std::string right_string
;
5241 if (left
->string_constant_value(&left_string
)
5242 && right
->string_constant_value(&right_string
))
5243 return Expression::make_string(left_string
+ right_string
, location
);
5249 // Return the integer constant value, if it has one.
5252 Binary_expression::do_integer_constant_value(bool iota_is_constant
, mpz_t val
,
5258 if (!this->left_
->integer_constant_value(iota_is_constant
, left_val
,
5261 mpz_clear(left_val
);
5266 mpz_init(right_val
);
5268 if (!this->right_
->integer_constant_value(iota_is_constant
, right_val
,
5271 mpz_clear(right_val
);
5272 mpz_clear(left_val
);
5277 if (left_type
!= right_type
5278 && left_type
!= NULL
5279 && right_type
!= NULL
5280 && left_type
->base() != right_type
->base()
5281 && this->op_
!= OPERATOR_RSHIFT
5282 && this->op_
!= OPERATOR_LSHIFT
)
5285 ret
= Binary_expression::eval_integer(this->op_
, left_type
, left_val
,
5286 right_type
, right_val
,
5287 this->location(), val
);
5289 mpz_clear(right_val
);
5290 mpz_clear(left_val
);
5298 // Return the floating point constant value, if it has one.
5301 Binary_expression::do_float_constant_value(mpfr_t val
, Type
** ptype
) const
5304 mpfr_init(left_val
);
5306 if (!this->left_
->float_constant_value(left_val
, &left_type
))
5308 mpfr_clear(left_val
);
5313 mpfr_init(right_val
);
5315 if (!this->right_
->float_constant_value(right_val
, &right_type
))
5317 mpfr_clear(right_val
);
5318 mpfr_clear(left_val
);
5323 if (left_type
!= right_type
5324 && left_type
!= NULL
5325 && right_type
!= NULL
5326 && left_type
->base() != right_type
->base())
5329 ret
= Binary_expression::eval_float(this->op_
, left_type
, left_val
,
5330 right_type
, right_val
,
5331 val
, this->location());
5333 mpfr_clear(left_val
);
5334 mpfr_clear(right_val
);
5342 // Return the complex constant value, if it has one.
5345 Binary_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
5350 mpfr_init(left_real
);
5351 mpfr_init(left_imag
);
5353 if (!this->left_
->complex_constant_value(left_real
, left_imag
, &left_type
))
5355 mpfr_clear(left_real
);
5356 mpfr_clear(left_imag
);
5362 mpfr_init(right_real
);
5363 mpfr_init(right_imag
);
5365 if (!this->right_
->complex_constant_value(right_real
, right_imag
,
5368 mpfr_clear(left_real
);
5369 mpfr_clear(left_imag
);
5370 mpfr_clear(right_real
);
5371 mpfr_clear(right_imag
);
5376 if (left_type
!= right_type
5377 && left_type
!= NULL
5378 && right_type
!= NULL
5379 && left_type
->base() != right_type
->base())
5382 ret
= Binary_expression::eval_complex(this->op_
, left_type
,
5383 left_real
, left_imag
,
5385 right_real
, right_imag
,
5388 mpfr_clear(left_real
);
5389 mpfr_clear(left_imag
);
5390 mpfr_clear(right_real
);
5391 mpfr_clear(right_imag
);
5399 // Note that the value is being discarded.
5402 Binary_expression::do_discarding_value()
5404 if (this->op_
== OPERATOR_OROR
|| this->op_
== OPERATOR_ANDAND
)
5405 this->right_
->discarding_value();
5407 this->warn_about_unused_value();
5413 Binary_expression::do_type()
5415 if (this->classification() == EXPRESSION_ERROR
)
5416 return Type::make_error_type();
5421 case OPERATOR_ANDAND
:
5423 case OPERATOR_NOTEQ
:
5428 return Type::lookup_bool_type();
5431 case OPERATOR_MINUS
:
5438 case OPERATOR_BITCLEAR
:
5440 Type
* left_type
= this->left_
->type();
5441 Type
* right_type
= this->right_
->type();
5442 if (left_type
->is_error_type())
5444 else if (right_type
->is_error_type())
5446 else if (!Type::are_compatible_for_binop(left_type
, right_type
))
5448 this->report_error(_("incompatible types in binary expression"));
5449 return Type::make_error_type();
5451 else if (!left_type
->is_abstract() && left_type
->named_type() != NULL
)
5453 else if (!right_type
->is_abstract() && right_type
->named_type() != NULL
)
5455 else if (!left_type
->is_abstract())
5457 else if (!right_type
->is_abstract())
5459 else if (left_type
->complex_type() != NULL
)
5461 else if (right_type
->complex_type() != NULL
)
5463 else if (left_type
->float_type() != NULL
)
5465 else if (right_type
->float_type() != NULL
)
5471 case OPERATOR_LSHIFT
:
5472 case OPERATOR_RSHIFT
:
5473 return this->left_
->type();
5480 // Set type for a binary expression.
5483 Binary_expression::do_determine_type(const Type_context
* context
)
5485 Type
* tleft
= this->left_
->type();
5486 Type
* tright
= this->right_
->type();
5488 // Both sides should have the same type, except for the shift
5489 // operations. For a comparison, we should ignore the incoming
5492 bool is_shift_op
= (this->op_
== OPERATOR_LSHIFT
5493 || this->op_
== OPERATOR_RSHIFT
);
5495 bool is_comparison
= (this->op_
== OPERATOR_EQEQ
5496 || this->op_
== OPERATOR_NOTEQ
5497 || this->op_
== OPERATOR_LT
5498 || this->op_
== OPERATOR_LE
5499 || this->op_
== OPERATOR_GT
5500 || this->op_
== OPERATOR_GE
);
5502 Type_context
subcontext(*context
);
5506 // In a comparison, the context does not determine the types of
5508 subcontext
.type
= NULL
;
5511 // Set the context for the left hand operand.
5514 // The right hand operand plays no role in determining the type
5515 // of the left hand operand. A shift of an abstract integer in
5516 // a string context gets special treatment, which may be a
5518 if (subcontext
.type
!= NULL
5519 && subcontext
.type
->is_string_type()
5520 && tleft
->is_abstract())
5521 error_at(this->location(), "shift of non-integer operand");
5523 else if (!tleft
->is_abstract())
5524 subcontext
.type
= tleft
;
5525 else if (!tright
->is_abstract())
5526 subcontext
.type
= tright
;
5527 else if (subcontext
.type
== NULL
)
5529 if ((tleft
->integer_type() != NULL
&& tright
->integer_type() != NULL
)
5530 || (tleft
->float_type() != NULL
&& tright
->float_type() != NULL
)
5531 || (tleft
->complex_type() != NULL
&& tright
->complex_type() != NULL
))
5533 // Both sides have an abstract integer, abstract float, or
5534 // abstract complex type. Just let CONTEXT determine
5535 // whether they may remain abstract or not.
5537 else if (tleft
->complex_type() != NULL
)
5538 subcontext
.type
= tleft
;
5539 else if (tright
->complex_type() != NULL
)
5540 subcontext
.type
= tright
;
5541 else if (tleft
->float_type() != NULL
)
5542 subcontext
.type
= tleft
;
5543 else if (tright
->float_type() != NULL
)
5544 subcontext
.type
= tright
;
5546 subcontext
.type
= tleft
;
5548 if (subcontext
.type
!= NULL
&& !context
->may_be_abstract
)
5549 subcontext
.type
= subcontext
.type
->make_non_abstract_type();
5552 this->left_
->determine_type(&subcontext
);
5554 // The context for the right hand operand is the same as for the
5555 // left hand operand, except for a shift operator.
5558 subcontext
.type
= Type::lookup_integer_type("uint");
5559 subcontext
.may_be_abstract
= false;
5562 this->right_
->determine_type(&subcontext
);
5565 // Report an error if the binary operator OP does not support TYPE.
5566 // Return whether the operation is OK. This should not be used for
5570 Binary_expression::check_operator_type(Operator op
, Type
* type
,
5571 source_location location
)
5576 case OPERATOR_ANDAND
:
5577 if (!type
->is_boolean_type())
5579 error_at(location
, "expected boolean type");
5585 case OPERATOR_NOTEQ
:
5586 if (type
->integer_type() == NULL
5587 && type
->float_type() == NULL
5588 && type
->complex_type() == NULL
5589 && !type
->is_string_type()
5590 && type
->points_to() == NULL
5591 && !type
->is_nil_type()
5592 && !type
->is_boolean_type()
5593 && type
->interface_type() == NULL
5594 && (type
->array_type() == NULL
5595 || type
->array_type()->length() != NULL
)
5596 && type
->map_type() == NULL
5597 && type
->channel_type() == NULL
5598 && type
->function_type() == NULL
)
5601 ("expected integer, floating, complex, string, pointer, "
5602 "boolean, interface, slice, map, channel, "
5603 "or function type"));
5612 if (type
->integer_type() == NULL
5613 && type
->float_type() == NULL
5614 && !type
->is_string_type())
5616 error_at(location
, "expected integer, floating, or string type");
5622 case OPERATOR_PLUSEQ
:
5623 if (type
->integer_type() == NULL
5624 && type
->float_type() == NULL
5625 && type
->complex_type() == NULL
5626 && !type
->is_string_type())
5629 "expected integer, floating, complex, or string type");
5634 case OPERATOR_MINUS
:
5635 case OPERATOR_MINUSEQ
:
5637 case OPERATOR_MULTEQ
:
5639 case OPERATOR_DIVEQ
:
5640 if (type
->integer_type() == NULL
5641 && type
->float_type() == NULL
5642 && type
->complex_type() == NULL
)
5644 error_at(location
, "expected integer, floating, or complex type");
5650 case OPERATOR_MODEQ
:
5654 case OPERATOR_ANDEQ
:
5656 case OPERATOR_XOREQ
:
5657 case OPERATOR_BITCLEAR
:
5658 case OPERATOR_BITCLEAREQ
:
5659 if (type
->integer_type() == NULL
)
5661 error_at(location
, "expected integer type");
5676 Binary_expression::do_check_types(Gogo
*)
5678 if (this->classification() == EXPRESSION_ERROR
)
5681 Type
* left_type
= this->left_
->type();
5682 Type
* right_type
= this->right_
->type();
5683 if (left_type
->is_error_type() || right_type
->is_error_type())
5685 this->set_is_error();
5689 if (this->op_
== OPERATOR_EQEQ
5690 || this->op_
== OPERATOR_NOTEQ
5691 || this->op_
== OPERATOR_LT
5692 || this->op_
== OPERATOR_LE
5693 || this->op_
== OPERATOR_GT
5694 || this->op_
== OPERATOR_GE
)
5696 if (!Type::are_assignable(left_type
, right_type
, NULL
)
5697 && !Type::are_assignable(right_type
, left_type
, NULL
))
5699 this->report_error(_("incompatible types in binary expression"));
5702 if (!Binary_expression::check_operator_type(this->op_
, left_type
,
5704 || !Binary_expression::check_operator_type(this->op_
, right_type
,
5707 this->set_is_error();
5711 else if (this->op_
!= OPERATOR_LSHIFT
&& this->op_
!= OPERATOR_RSHIFT
)
5713 if (!Type::are_compatible_for_binop(left_type
, right_type
))
5715 this->report_error(_("incompatible types in binary expression"));
5718 if (!Binary_expression::check_operator_type(this->op_
, left_type
,
5721 this->set_is_error();
5727 if (left_type
->integer_type() == NULL
)
5728 this->report_error(_("shift of non-integer operand"));
5730 if (!right_type
->is_abstract()
5731 && (right_type
->integer_type() == NULL
5732 || !right_type
->integer_type()->is_unsigned()))
5733 this->report_error(_("shift count not unsigned integer"));
5739 if (this->right_
->integer_constant_value(true, val
, &type
))
5741 if (mpz_sgn(val
) < 0)
5742 this->report_error(_("negative shift count"));
5749 // Get a tree for a binary expression.
5752 Binary_expression::do_get_tree(Translate_context
* context
)
5754 tree left
= this->left_
->get_tree(context
);
5755 tree right
= this->right_
->get_tree(context
);
5757 if (left
== error_mark_node
|| right
== error_mark_node
)
5758 return error_mark_node
;
5760 enum tree_code code
;
5761 bool use_left_type
= true;
5762 bool is_shift_op
= false;
5766 case OPERATOR_NOTEQ
:
5771 return Expression::comparison_tree(context
, this->op_
,
5772 this->left_
->type(), left
,
5773 this->right_
->type(), right
,
5777 code
= TRUTH_ORIF_EXPR
;
5778 use_left_type
= false;
5780 case OPERATOR_ANDAND
:
5781 code
= TRUTH_ANDIF_EXPR
;
5782 use_left_type
= false;
5787 case OPERATOR_MINUS
:
5791 code
= BIT_IOR_EXPR
;
5794 code
= BIT_XOR_EXPR
;
5801 Type
*t
= this->left_
->type();
5802 if (t
->float_type() != NULL
|| t
->complex_type() != NULL
)
5805 code
= TRUNC_DIV_EXPR
;
5809 code
= TRUNC_MOD_EXPR
;
5811 case OPERATOR_LSHIFT
:
5815 case OPERATOR_RSHIFT
:
5820 code
= BIT_AND_EXPR
;
5822 case OPERATOR_BITCLEAR
:
5823 right
= fold_build1(BIT_NOT_EXPR
, TREE_TYPE(right
), right
);
5824 code
= BIT_AND_EXPR
;
5830 tree type
= use_left_type
? TREE_TYPE(left
) : TREE_TYPE(right
);
5832 if (this->left_
->type()->is_string_type())
5834 gcc_assert(this->op_
== OPERATOR_PLUS
);
5835 tree string_type
= Type::make_string_type()->get_tree(context
->gogo());
5836 static tree string_plus_decl
;
5837 return Gogo::call_builtin(&string_plus_decl
,
5848 tree compute_type
= excess_precision_type(type
);
5849 if (compute_type
!= NULL_TREE
)
5851 left
= ::convert(compute_type
, left
);
5852 right
= ::convert(compute_type
, right
);
5855 tree eval_saved
= NULL_TREE
;
5859 left
= save_expr(left
);
5861 right
= save_expr(right
);
5862 // Make sure the values are evaluated.
5863 eval_saved
= fold_build2_loc(this->location(), COMPOUND_EXPR
,
5864 void_type_node
, left
, right
);
5867 tree ret
= fold_build2_loc(this->location(),
5869 compute_type
!= NULL_TREE
? compute_type
: type
,
5872 if (compute_type
!= NULL_TREE
)
5873 ret
= ::convert(type
, ret
);
5875 // In Go, a shift larger than the size of the type is well-defined.
5876 // This is not true in GENERIC, so we need to insert a conditional.
5879 gcc_assert(INTEGRAL_TYPE_P(TREE_TYPE(left
)));
5880 gcc_assert(this->left_
->type()->integer_type() != NULL
);
5881 int bits
= TYPE_PRECISION(TREE_TYPE(left
));
5883 tree compare
= fold_build2(LT_EXPR
, boolean_type_node
, right
,
5884 build_int_cst_type(TREE_TYPE(right
), bits
));
5886 tree overflow_result
= fold_convert_loc(this->location(),
5889 if (this->op_
== OPERATOR_RSHIFT
5890 && !this->left_
->type()->integer_type()->is_unsigned())
5892 tree neg
= fold_build2_loc(this->location(), LT_EXPR
,
5893 boolean_type_node
, left
,
5894 fold_convert_loc(this->location(),
5896 integer_zero_node
));
5897 tree neg_one
= fold_build2_loc(this->location(),
5898 MINUS_EXPR
, TREE_TYPE(left
),
5899 fold_convert_loc(this->location(),
5902 fold_convert_loc(this->location(),
5905 overflow_result
= fold_build3_loc(this->location(), COND_EXPR
,
5906 TREE_TYPE(left
), neg
, neg_one
,
5910 ret
= fold_build3_loc(this->location(), COND_EXPR
, TREE_TYPE(left
),
5911 compare
, ret
, overflow_result
);
5913 ret
= fold_build2_loc(this->location(), COMPOUND_EXPR
,
5914 TREE_TYPE(ret
), eval_saved
, ret
);
5920 // Export a binary expression.
5923 Binary_expression::do_export(Export
* exp
) const
5925 exp
->write_c_string("(");
5926 this->left_
->export_expression(exp
);
5930 exp
->write_c_string(" || ");
5932 case OPERATOR_ANDAND
:
5933 exp
->write_c_string(" && ");
5936 exp
->write_c_string(" == ");
5938 case OPERATOR_NOTEQ
:
5939 exp
->write_c_string(" != ");
5942 exp
->write_c_string(" < ");
5945 exp
->write_c_string(" <= ");
5948 exp
->write_c_string(" > ");
5951 exp
->write_c_string(" >= ");
5954 exp
->write_c_string(" + ");
5956 case OPERATOR_MINUS
:
5957 exp
->write_c_string(" - ");
5960 exp
->write_c_string(" | ");
5963 exp
->write_c_string(" ^ ");
5966 exp
->write_c_string(" * ");
5969 exp
->write_c_string(" / ");
5972 exp
->write_c_string(" % ");
5974 case OPERATOR_LSHIFT
:
5975 exp
->write_c_string(" << ");
5977 case OPERATOR_RSHIFT
:
5978 exp
->write_c_string(" >> ");
5981 exp
->write_c_string(" & ");
5983 case OPERATOR_BITCLEAR
:
5984 exp
->write_c_string(" &^ ");
5989 this->right_
->export_expression(exp
);
5990 exp
->write_c_string(")");
5993 // Import a binary expression.
5996 Binary_expression::do_import(Import
* imp
)
5998 imp
->require_c_string("(");
6000 Expression
* left
= Expression::import_expression(imp
);
6003 if (imp
->match_c_string(" || "))
6008 else if (imp
->match_c_string(" && "))
6010 op
= OPERATOR_ANDAND
;
6013 else if (imp
->match_c_string(" == "))
6018 else if (imp
->match_c_string(" != "))
6020 op
= OPERATOR_NOTEQ
;
6023 else if (imp
->match_c_string(" < "))
6028 else if (imp
->match_c_string(" <= "))
6033 else if (imp
->match_c_string(" > "))
6038 else if (imp
->match_c_string(" >= "))
6043 else if (imp
->match_c_string(" + "))
6048 else if (imp
->match_c_string(" - "))
6050 op
= OPERATOR_MINUS
;
6053 else if (imp
->match_c_string(" | "))
6058 else if (imp
->match_c_string(" ^ "))
6063 else if (imp
->match_c_string(" * "))
6068 else if (imp
->match_c_string(" / "))
6073 else if (imp
->match_c_string(" % "))
6078 else if (imp
->match_c_string(" << "))
6080 op
= OPERATOR_LSHIFT
;
6083 else if (imp
->match_c_string(" >> "))
6085 op
= OPERATOR_RSHIFT
;
6088 else if (imp
->match_c_string(" & "))
6093 else if (imp
->match_c_string(" &^ "))
6095 op
= OPERATOR_BITCLEAR
;
6100 error_at(imp
->location(), "unrecognized binary operator");
6101 return Expression::make_error(imp
->location());
6104 Expression
* right
= Expression::import_expression(imp
);
6106 imp
->require_c_string(")");
6108 return Expression::make_binary(op
, left
, right
, imp
->location());
6111 // Make a binary expression.
6114 Expression::make_binary(Operator op
, Expression
* left
, Expression
* right
,
6115 source_location location
)
6117 return new Binary_expression(op
, left
, right
, location
);
6120 // Implement a comparison.
6123 Expression::comparison_tree(Translate_context
* context
, Operator op
,
6124 Type
* left_type
, tree left_tree
,
6125 Type
* right_type
, tree right_tree
,
6126 source_location location
)
6128 enum tree_code code
;
6134 case OPERATOR_NOTEQ
:
6153 if (left_type
->is_string_type() && right_type
->is_string_type())
6155 tree string_type
= Type::make_string_type()->get_tree(context
->gogo());
6156 static tree string_compare_decl
;
6157 left_tree
= Gogo::call_builtin(&string_compare_decl
,
6166 right_tree
= build_int_cst_type(integer_type_node
, 0);
6168 else if ((left_type
->interface_type() != NULL
6169 && right_type
->interface_type() == NULL
6170 && !right_type
->is_nil_type())
6171 || (left_type
->interface_type() == NULL
6172 && !left_type
->is_nil_type()
6173 && right_type
->interface_type() != NULL
))
6175 // Comparing an interface value to a non-interface value.
6176 if (left_type
->interface_type() == NULL
)
6178 std::swap(left_type
, right_type
);
6179 std::swap(left_tree
, right_tree
);
6182 // The right operand is not an interface. We need to take its
6183 // address if it is not a pointer.
6186 if (right_type
->points_to() != NULL
)
6188 make_tmp
= NULL_TREE
;
6191 else if (TREE_ADDRESSABLE(TREE_TYPE(right_tree
)) || DECL_P(right_tree
))
6193 make_tmp
= NULL_TREE
;
6194 arg
= build_fold_addr_expr_loc(location
, right_tree
);
6195 if (DECL_P(right_tree
))
6196 TREE_ADDRESSABLE(right_tree
) = 1;
6200 tree tmp
= create_tmp_var(TREE_TYPE(right_tree
),
6201 get_name(right_tree
));
6202 DECL_IGNORED_P(tmp
) = 0;
6203 DECL_INITIAL(tmp
) = right_tree
;
6204 TREE_ADDRESSABLE(tmp
) = 1;
6205 make_tmp
= build1(DECL_EXPR
, void_type_node
, tmp
);
6206 SET_EXPR_LOCATION(make_tmp
, location
);
6207 arg
= build_fold_addr_expr_loc(location
, tmp
);
6209 arg
= fold_convert_loc(location
, ptr_type_node
, arg
);
6211 tree descriptor
= right_type
->type_descriptor_pointer(context
->gogo());
6213 if (left_type
->interface_type()->is_empty())
6215 static tree empty_interface_value_compare_decl
;
6216 left_tree
= Gogo::call_builtin(&empty_interface_value_compare_decl
,
6218 "__go_empty_interface_value_compare",
6221 TREE_TYPE(left_tree
),
6223 TREE_TYPE(descriptor
),
6227 if (left_tree
== error_mark_node
)
6228 return error_mark_node
;
6229 // This can panic if the type is not comparable.
6230 TREE_NOTHROW(empty_interface_value_compare_decl
) = 0;
6234 static tree interface_value_compare_decl
;
6235 left_tree
= Gogo::call_builtin(&interface_value_compare_decl
,
6237 "__go_interface_value_compare",
6240 TREE_TYPE(left_tree
),
6242 TREE_TYPE(descriptor
),
6246 if (left_tree
== error_mark_node
)
6247 return error_mark_node
;
6248 // This can panic if the type is not comparable.
6249 TREE_NOTHROW(interface_value_compare_decl
) = 0;
6251 right_tree
= build_int_cst_type(integer_type_node
, 0);
6253 if (make_tmp
!= NULL_TREE
)
6254 left_tree
= build2(COMPOUND_EXPR
, TREE_TYPE(left_tree
), make_tmp
,
6257 else if (left_type
->interface_type() != NULL
6258 && right_type
->interface_type() != NULL
)
6260 if (left_type
->interface_type()->is_empty())
6262 gcc_assert(right_type
->interface_type()->is_empty());
6263 static tree empty_interface_compare_decl
;
6264 left_tree
= Gogo::call_builtin(&empty_interface_compare_decl
,
6266 "__go_empty_interface_compare",
6269 TREE_TYPE(left_tree
),
6271 TREE_TYPE(right_tree
),
6273 if (left_tree
== error_mark_node
)
6274 return error_mark_node
;
6275 // This can panic if the type is uncomparable.
6276 TREE_NOTHROW(empty_interface_compare_decl
) = 0;
6280 gcc_assert(!right_type
->interface_type()->is_empty());
6281 static tree interface_compare_decl
;
6282 left_tree
= Gogo::call_builtin(&interface_compare_decl
,
6284 "__go_interface_compare",
6287 TREE_TYPE(left_tree
),
6289 TREE_TYPE(right_tree
),
6291 if (left_tree
== error_mark_node
)
6292 return error_mark_node
;
6293 // This can panic if the type is uncomparable.
6294 TREE_NOTHROW(interface_compare_decl
) = 0;
6296 right_tree
= build_int_cst_type(integer_type_node
, 0);
6299 if (left_type
->is_nil_type()
6300 && (op
== OPERATOR_EQEQ
|| op
== OPERATOR_NOTEQ
))
6302 std::swap(left_type
, right_type
);
6303 std::swap(left_tree
, right_tree
);
6306 if (right_type
->is_nil_type())
6308 if (left_type
->array_type() != NULL
6309 && left_type
->array_type()->length() == NULL
)
6311 Array_type
* at
= left_type
->array_type();
6312 left_tree
= at
->value_pointer_tree(context
->gogo(), left_tree
);
6313 right_tree
= fold_convert(TREE_TYPE(left_tree
), null_pointer_node
);
6315 else if (left_type
->interface_type() != NULL
)
6317 // An interface is nil if the first field is nil.
6318 tree left_type_tree
= TREE_TYPE(left_tree
);
6319 gcc_assert(TREE_CODE(left_type_tree
) == RECORD_TYPE
);
6320 tree field
= TYPE_FIELDS(left_type_tree
);
6321 left_tree
= build3(COMPONENT_REF
, TREE_TYPE(field
), left_tree
,
6323 right_tree
= fold_convert(TREE_TYPE(left_tree
), null_pointer_node
);
6327 gcc_assert(POINTER_TYPE_P(TREE_TYPE(left_tree
)));
6328 right_tree
= fold_convert(TREE_TYPE(left_tree
), null_pointer_node
);
6332 if (left_tree
== error_mark_node
|| right_tree
== error_mark_node
)
6333 return error_mark_node
;
6335 tree ret
= fold_build2(code
, boolean_type_node
, left_tree
, right_tree
);
6336 if (CAN_HAVE_LOCATION_P(ret
))
6337 SET_EXPR_LOCATION(ret
, location
);
6341 // Class Bound_method_expression.
6346 Bound_method_expression::do_traverse(Traverse
* traverse
)
6348 if (Expression::traverse(&this->expr_
, traverse
) == TRAVERSE_EXIT
)
6349 return TRAVERSE_EXIT
;
6350 return Expression::traverse(&this->method_
, traverse
);
6353 // Return the type of a bound method expression. The type of this
6354 // object is really the type of the method with no receiver. We
6355 // should be able to get away with just returning the type of the
6359 Bound_method_expression::do_type()
6361 return this->method_
->type();
6364 // Determine the types of a method expression.
6367 Bound_method_expression::do_determine_type(const Type_context
*)
6369 this->method_
->determine_type_no_context();
6370 Type
* mtype
= this->method_
->type();
6371 Function_type
* fntype
= mtype
== NULL
? NULL
: mtype
->function_type();
6372 if (fntype
== NULL
|| !fntype
->is_method())
6373 this->expr_
->determine_type_no_context();
6376 Type_context
subcontext(fntype
->receiver()->type(), false);
6377 this->expr_
->determine_type(&subcontext
);
6381 // Check the types of a method expression.
6384 Bound_method_expression::do_check_types(Gogo
*)
6386 Type
* type
= this->method_
->type()->deref();
6388 || type
->function_type() == NULL
6389 || !type
->function_type()->is_method())
6390 this->report_error(_("object is not a method"));
6393 Type
* rtype
= type
->function_type()->receiver()->type()->deref();
6394 Type
* etype
= (this->expr_type_
!= NULL
6396 : this->expr_
->type());
6397 etype
= etype
->deref();
6398 if (!Type::are_identical(rtype
, etype
, true, NULL
))
6399 this->report_error(_("method type does not match object type"));
6403 // Get the tree for a method expression. There is no standard tree
6404 // representation for this. The only places it may currently be used
6405 // are in a Call_expression or a Go_statement, which will take it
6406 // apart directly. So this has nothing to do at present.
6409 Bound_method_expression::do_get_tree(Translate_context
*)
6411 error_at(this->location(), "reference to method other than calling it");
6412 return error_mark_node
;
6415 // Make a method expression.
6417 Bound_method_expression
*
6418 Expression::make_bound_method(Expression
* expr
, Expression
* method
,
6419 source_location location
)
6421 return new Bound_method_expression(expr
, method
, location
);
6424 // Class Builtin_call_expression. This is used for a call to a
6425 // builtin function.
6427 class Builtin_call_expression
: public Call_expression
6430 Builtin_call_expression(Gogo
* gogo
, Expression
* fn
, Expression_list
* args
,
6431 bool is_varargs
, source_location location
);
6434 // This overrides Call_expression::do_lower.
6436 do_lower(Gogo
*, Named_object
*, int);
6439 do_is_constant() const;
6442 do_integer_constant_value(bool, mpz_t
, Type
**) const;
6445 do_float_constant_value(mpfr_t
, Type
**) const;
6448 do_complex_constant_value(mpfr_t
, mpfr_t
, Type
**) const;
6454 do_determine_type(const Type_context
*);
6457 do_check_types(Gogo
*);
6462 return new Builtin_call_expression(this->gogo_
, this->fn()->copy(),
6463 this->args()->copy(),
6469 do_get_tree(Translate_context
*);
6472 do_export(Export
*) const;
6475 do_is_recover_call() const;
6478 do_set_recover_arg(Expression
*);
6481 // The builtin functions.
6482 enum Builtin_function_code
6486 // Predeclared builtin functions.
6503 // Builtin functions from the unsafe package.
6516 real_imag_type(Type
*);
6519 complex_type(Type
*);
6521 // A pointer back to the general IR structure. This avoids a global
6522 // variable, or passing it around everywhere.
6524 // The builtin function being called.
6525 Builtin_function_code code_
;
6526 // Used to stop endless loops when the length of an array uses len
6527 // or cap of the array itself.
6531 Builtin_call_expression::Builtin_call_expression(Gogo
* gogo
,
6533 Expression_list
* args
,
6535 source_location location
)
6536 : Call_expression(fn
, args
, is_varargs
, location
),
6537 gogo_(gogo
), code_(BUILTIN_INVALID
), seen_(false)
6539 Func_expression
* fnexp
= this->fn()->func_expression();
6540 gcc_assert(fnexp
!= NULL
);
6541 const std::string
& name(fnexp
->named_object()->name());
6542 if (name
== "append")
6543 this->code_
= BUILTIN_APPEND
;
6544 else if (name
== "cap")
6545 this->code_
= BUILTIN_CAP
;
6546 else if (name
== "close")
6547 this->code_
= BUILTIN_CLOSE
;
6548 else if (name
== "closed")
6549 this->code_
= BUILTIN_CLOSED
;
6550 else if (name
== "complex")
6551 this->code_
= BUILTIN_COMPLEX
;
6552 else if (name
== "copy")
6553 this->code_
= BUILTIN_COPY
;
6554 else if (name
== "imag")
6555 this->code_
= BUILTIN_IMAG
;
6556 else if (name
== "len")
6557 this->code_
= BUILTIN_LEN
;
6558 else if (name
== "make")
6559 this->code_
= BUILTIN_MAKE
;
6560 else if (name
== "new")
6561 this->code_
= BUILTIN_NEW
;
6562 else if (name
== "panic")
6563 this->code_
= BUILTIN_PANIC
;
6564 else if (name
== "print")
6565 this->code_
= BUILTIN_PRINT
;
6566 else if (name
== "println")
6567 this->code_
= BUILTIN_PRINTLN
;
6568 else if (name
== "real")
6569 this->code_
= BUILTIN_REAL
;
6570 else if (name
== "recover")
6571 this->code_
= BUILTIN_RECOVER
;
6572 else if (name
== "Alignof")
6573 this->code_
= BUILTIN_ALIGNOF
;
6574 else if (name
== "Offsetof")
6575 this->code_
= BUILTIN_OFFSETOF
;
6576 else if (name
== "Sizeof")
6577 this->code_
= BUILTIN_SIZEOF
;
6582 // Return whether this is a call to recover. This is a virtual
6583 // function called from the parent class.
6586 Builtin_call_expression::do_is_recover_call() const
6588 if (this->classification() == EXPRESSION_ERROR
)
6590 return this->code_
== BUILTIN_RECOVER
;
6593 // Set the argument for a call to recover.
6596 Builtin_call_expression::do_set_recover_arg(Expression
* arg
)
6598 const Expression_list
* args
= this->args();
6599 gcc_assert(args
== NULL
|| args
->empty());
6600 Expression_list
* new_args
= new Expression_list();
6601 new_args
->push_back(arg
);
6602 this->set_args(new_args
);
6605 // A traversal class which looks for a call expression.
6607 class Find_call_expression
: public Traverse
6610 Find_call_expression()
6611 : Traverse(traverse_expressions
),
6616 expression(Expression
**);
6620 { return this->found_
; }
6627 Find_call_expression::expression(Expression
** pexpr
)
6629 if ((*pexpr
)->call_expression() != NULL
)
6631 this->found_
= true;
6632 return TRAVERSE_EXIT
;
6634 return TRAVERSE_CONTINUE
;
6637 // Lower a builtin call expression. This turns new and make into
6638 // specific expressions. We also convert to a constant if we can.
6641 Builtin_call_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
6643 if (this->code_
== BUILTIN_NEW
)
6645 const Expression_list
* args
= this->args();
6646 if (args
== NULL
|| args
->size() < 1)
6647 this->report_error(_("not enough arguments"));
6648 else if (args
->size() > 1)
6649 this->report_error(_("too many arguments"));
6652 Expression
* arg
= args
->front();
6653 if (!arg
->is_type_expression())
6655 error_at(arg
->location(), "expected type");
6656 this->set_is_error();
6659 return Expression::make_allocation(arg
->type(), this->location());
6662 else if (this->code_
== BUILTIN_MAKE
)
6664 const Expression_list
* args
= this->args();
6665 if (args
== NULL
|| args
->size() < 1)
6666 this->report_error(_("not enough arguments"));
6669 Expression
* arg
= args
->front();
6670 if (!arg
->is_type_expression())
6672 error_at(arg
->location(), "expected type");
6673 this->set_is_error();
6677 Expression_list
* newargs
;
6678 if (args
->size() == 1)
6682 newargs
= new Expression_list();
6683 Expression_list::const_iterator p
= args
->begin();
6685 for (; p
!= args
->end(); ++p
)
6686 newargs
->push_back(*p
);
6688 return Expression::make_make(arg
->type(), newargs
,
6693 else if (this->is_constant())
6695 // We can only lower len and cap if there are no function calls
6696 // in the arguments. Otherwise we have to make the call.
6697 if (this->code_
== BUILTIN_LEN
|| this->code_
== BUILTIN_CAP
)
6699 Expression
* arg
= this->one_arg();
6700 if (!arg
->is_constant())
6702 Find_call_expression find_call
;
6703 Expression::traverse(&arg
, &find_call
);
6704 if (find_call
.found())
6712 if (this->integer_constant_value(true, ival
, &type
))
6714 Expression
* ret
= Expression::make_integer(&ival
, type
,
6723 if (this->float_constant_value(rval
, &type
))
6725 Expression
* ret
= Expression::make_float(&rval
, type
,
6733 if (this->complex_constant_value(rval
, imag
, &type
))
6735 Expression
* ret
= Expression::make_complex(&rval
, &imag
, type
,
6744 else if (this->code_
== BUILTIN_RECOVER
)
6746 if (function
!= NULL
)
6747 function
->func_value()->set_calls_recover();
6750 // Calling recover outside of a function always returns the
6751 // nil empty interface.
6752 Type
* eface
= Type::make_interface_type(NULL
, this->location());
6753 return Expression::make_cast(eface
,
6754 Expression::make_nil(this->location()),
6758 else if (this->code_
== BUILTIN_APPEND
)
6760 // Lower the varargs.
6761 const Expression_list
* args
= this->args();
6762 if (args
== NULL
|| args
->empty())
6764 Type
* slice_type
= args
->front()->type();
6765 if (!slice_type
->is_open_array_type())
6767 error_at(args
->front()->location(), "argument 1 must be a slice");
6768 this->set_is_error();
6771 return this->lower_varargs(gogo
, function
, slice_type
, 2);
6777 // Return the type of the real or imag functions, given the type of
6778 // the argument. We need to map complex to float, complex64 to
6779 // float32, and complex128 to float64, so it has to be done by name.
6780 // This returns NULL if it can't figure out the type.
6783 Builtin_call_expression::real_imag_type(Type
* arg_type
)
6785 if (arg_type
== NULL
|| arg_type
->is_abstract())
6787 Named_type
* nt
= arg_type
->named_type();
6790 while (nt
->real_type()->named_type() != NULL
)
6791 nt
= nt
->real_type()->named_type();
6792 if (nt
->name() == "complex64")
6793 return Type::lookup_float_type("float32");
6794 else if (nt
->name() == "complex128")
6795 return Type::lookup_float_type("float64");
6800 // Return the type of the complex function, given the type of one of the
6801 // argments. Like real_imag_type, we have to map by name.
6804 Builtin_call_expression::complex_type(Type
* arg_type
)
6806 if (arg_type
== NULL
|| arg_type
->is_abstract())
6808 Named_type
* nt
= arg_type
->named_type();
6811 while (nt
->real_type()->named_type() != NULL
)
6812 nt
= nt
->real_type()->named_type();
6813 if (nt
->name() == "float32")
6814 return Type::lookup_complex_type("complex64");
6815 else if (nt
->name() == "float64")
6816 return Type::lookup_complex_type("complex128");
6821 // Return a single argument, or NULL if there isn't one.
6824 Builtin_call_expression::one_arg() const
6826 const Expression_list
* args
= this->args();
6827 if (args
->size() != 1)
6829 return args
->front();
6832 // Return whether this is constant: len of a string, or len or cap of
6833 // a fixed array, or unsafe.Sizeof, unsafe.Offsetof, unsafe.Alignof.
6836 Builtin_call_expression::do_is_constant() const
6838 switch (this->code_
)
6846 Expression
* arg
= this->one_arg();
6849 Type
* arg_type
= arg
->type();
6851 if (arg_type
->points_to() != NULL
6852 && arg_type
->points_to()->array_type() != NULL
6853 && !arg_type
->points_to()->is_open_array_type())
6854 arg_type
= arg_type
->points_to();
6856 if (arg_type
->array_type() != NULL
6857 && arg_type
->array_type()->length() != NULL
)
6860 if (this->code_
== BUILTIN_LEN
&& arg_type
->is_string_type())
6863 bool ret
= arg
->is_constant();
6864 this->seen_
= false;
6870 case BUILTIN_SIZEOF
:
6871 case BUILTIN_ALIGNOF
:
6872 return this->one_arg() != NULL
;
6874 case BUILTIN_OFFSETOF
:
6876 Expression
* arg
= this->one_arg();
6879 return arg
->field_reference_expression() != NULL
;
6882 case BUILTIN_COMPLEX
:
6884 const Expression_list
* args
= this->args();
6885 if (args
!= NULL
&& args
->size() == 2)
6886 return args
->front()->is_constant() && args
->back()->is_constant();
6893 Expression
* arg
= this->one_arg();
6894 return arg
!= NULL
&& arg
->is_constant();
6904 // Return an integer constant value if possible.
6907 Builtin_call_expression::do_integer_constant_value(bool iota_is_constant
,
6911 if (this->code_
== BUILTIN_LEN
6912 || this->code_
== BUILTIN_CAP
)
6914 Expression
* arg
= this->one_arg();
6917 Type
* arg_type
= arg
->type();
6919 if (this->code_
== BUILTIN_LEN
&& arg_type
->is_string_type())
6922 if (arg
->string_constant_value(&sval
))
6924 mpz_set_ui(val
, sval
.length());
6925 *ptype
= Type::lookup_integer_type("int");
6930 if (arg_type
->points_to() != NULL
6931 && arg_type
->points_to()->array_type() != NULL
6932 && !arg_type
->points_to()->is_open_array_type())
6933 arg_type
= arg_type
->points_to();
6935 if (arg_type
->array_type() != NULL
6936 && arg_type
->array_type()->length() != NULL
)
6940 Expression
* e
= arg_type
->array_type()->length();
6942 bool r
= e
->integer_constant_value(iota_is_constant
, val
, ptype
);
6943 this->seen_
= false;
6946 *ptype
= Type::lookup_integer_type("int");
6951 else if (this->code_
== BUILTIN_SIZEOF
6952 || this->code_
== BUILTIN_ALIGNOF
)
6954 Expression
* arg
= this->one_arg();
6957 Type
* arg_type
= arg
->type();
6958 if (arg_type
->is_error_type() || arg_type
->is_undefined())
6960 if (arg_type
->is_abstract())
6962 tree arg_type_tree
= arg_type
->get_tree(this->gogo_
);
6963 unsigned long val_long
;
6964 if (this->code_
== BUILTIN_SIZEOF
)
6966 tree type_size
= TYPE_SIZE_UNIT(arg_type_tree
);
6967 gcc_assert(TREE_CODE(type_size
) == INTEGER_CST
);
6968 if (TREE_INT_CST_HIGH(type_size
) != 0)
6970 unsigned HOST_WIDE_INT val_wide
= TREE_INT_CST_LOW(type_size
);
6971 val_long
= static_cast<unsigned long>(val_wide
);
6972 if (val_long
!= val_wide
)
6975 else if (this->code_
== BUILTIN_ALIGNOF
)
6977 if (arg
->field_reference_expression() == NULL
)
6978 val_long
= go_type_alignment(arg_type_tree
);
6981 // Calling unsafe.Alignof(s.f) returns the alignment of
6982 // the type of f when it is used as a field in a struct.
6983 val_long
= go_field_alignment(arg_type_tree
);
6988 mpz_set_ui(val
, val_long
);
6992 else if (this->code_
== BUILTIN_OFFSETOF
)
6994 Expression
* arg
= this->one_arg();
6997 Field_reference_expression
* farg
= arg
->field_reference_expression();
7000 Expression
* struct_expr
= farg
->expr();
7001 Type
* st
= struct_expr
->type();
7002 if (st
->struct_type() == NULL
)
7004 tree struct_tree
= st
->get_tree(this->gogo_
);
7005 gcc_assert(TREE_CODE(struct_tree
) == RECORD_TYPE
);
7006 tree field
= TYPE_FIELDS(struct_tree
);
7007 for (unsigned int index
= farg
->field_index(); index
> 0; --index
)
7009 field
= DECL_CHAIN(field
);
7010 gcc_assert(field
!= NULL_TREE
);
7012 HOST_WIDE_INT offset_wide
= int_byte_position (field
);
7013 if (offset_wide
< 0)
7015 unsigned long offset_long
= static_cast<unsigned long>(offset_wide
);
7016 if (offset_long
!= static_cast<unsigned HOST_WIDE_INT
>(offset_wide
))
7018 mpz_set_ui(val
, offset_long
);
7024 // Return a floating point constant value if possible.
7027 Builtin_call_expression::do_float_constant_value(mpfr_t val
,
7030 if (this->code_
== BUILTIN_REAL
|| this->code_
== BUILTIN_IMAG
)
7032 Expression
* arg
= this->one_arg();
7043 if (arg
->complex_constant_value(real
, imag
, &type
))
7045 if (this->code_
== BUILTIN_REAL
)
7046 mpfr_set(val
, real
, GMP_RNDN
);
7048 mpfr_set(val
, imag
, GMP_RNDN
);
7049 *ptype
= Builtin_call_expression::real_imag_type(type
);
7061 // Return a complex constant value if possible.
7064 Builtin_call_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
7067 if (this->code_
== BUILTIN_COMPLEX
)
7069 const Expression_list
* args
= this->args();
7070 if (args
== NULL
|| args
->size() != 2)
7076 if (!args
->front()->float_constant_value(r
, &rtype
))
7087 if (args
->back()->float_constant_value(i
, &itype
)
7088 && Type::are_identical(rtype
, itype
, false, NULL
))
7090 mpfr_set(real
, r
, GMP_RNDN
);
7091 mpfr_set(imag
, i
, GMP_RNDN
);
7092 *ptype
= Builtin_call_expression::complex_type(rtype
);
7108 Builtin_call_expression::do_type()
7110 switch (this->code_
)
7112 case BUILTIN_INVALID
:
7119 const Expression_list
* args
= this->args();
7120 if (args
== NULL
|| args
->empty())
7121 return Type::make_error_type();
7122 return Type::make_pointer_type(args
->front()->type());
7128 case BUILTIN_ALIGNOF
:
7129 case BUILTIN_OFFSETOF
:
7130 case BUILTIN_SIZEOF
:
7131 return Type::lookup_integer_type("int");
7136 case BUILTIN_PRINTLN
:
7137 return Type::make_void_type();
7139 case BUILTIN_CLOSED
:
7140 return Type::lookup_bool_type();
7142 case BUILTIN_RECOVER
:
7143 return Type::make_interface_type(NULL
, BUILTINS_LOCATION
);
7145 case BUILTIN_APPEND
:
7147 const Expression_list
* args
= this->args();
7148 if (args
== NULL
|| args
->empty())
7149 return Type::make_error_type();
7150 return args
->front()->type();
7156 Expression
* arg
= this->one_arg();
7158 return Type::make_error_type();
7159 Type
* t
= arg
->type();
7160 if (t
->is_abstract())
7161 t
= t
->make_non_abstract_type();
7162 t
= Builtin_call_expression::real_imag_type(t
);
7164 t
= Type::make_error_type();
7168 case BUILTIN_COMPLEX
:
7170 const Expression_list
* args
= this->args();
7171 if (args
== NULL
|| args
->size() != 2)
7172 return Type::make_error_type();
7173 Type
* t
= args
->front()->type();
7174 if (t
->is_abstract())
7176 t
= args
->back()->type();
7177 if (t
->is_abstract())
7178 t
= t
->make_non_abstract_type();
7180 t
= Builtin_call_expression::complex_type(t
);
7182 t
= Type::make_error_type();
7188 // Determine the type.
7191 Builtin_call_expression::do_determine_type(const Type_context
* context
)
7193 this->fn()->determine_type_no_context();
7195 const Expression_list
* args
= this->args();
7198 Type
* arg_type
= NULL
;
7199 switch (this->code_
)
7202 case BUILTIN_PRINTLN
:
7203 // Do not force a large integer constant to "int".
7209 arg_type
= Builtin_call_expression::complex_type(context
->type
);
7213 case BUILTIN_COMPLEX
:
7215 // For the complex function the type of one operand can
7216 // determine the type of the other, as in a binary expression.
7217 arg_type
= Builtin_call_expression::real_imag_type(context
->type
);
7218 if (args
!= NULL
&& args
->size() == 2)
7220 Type
* t1
= args
->front()->type();
7221 Type
* t2
= args
->front()->type();
7222 if (!t1
->is_abstract())
7224 else if (!t2
->is_abstract())
7238 for (Expression_list::const_iterator pa
= args
->begin();
7242 Type_context subcontext
;
7243 subcontext
.type
= arg_type
;
7247 // We want to print large constants, we so can't just
7248 // use the appropriate nonabstract type. Use uint64 for
7249 // an integer if we know it is nonnegative, otherwise
7250 // use int64 for a integer, otherwise use float64 for a
7251 // float or complex128 for a complex.
7252 Type
* want_type
= NULL
;
7253 Type
* atype
= (*pa
)->type();
7254 if (atype
->is_abstract())
7256 if (atype
->integer_type() != NULL
)
7261 if (this->integer_constant_value(true, val
, &dummy
)
7262 && mpz_sgn(val
) >= 0)
7263 want_type
= Type::lookup_integer_type("uint64");
7265 want_type
= Type::lookup_integer_type("int64");
7268 else if (atype
->float_type() != NULL
)
7269 want_type
= Type::lookup_float_type("float64");
7270 else if (atype
->complex_type() != NULL
)
7271 want_type
= Type::lookup_complex_type("complex128");
7272 else if (atype
->is_abstract_string_type())
7273 want_type
= Type::lookup_string_type();
7274 else if (atype
->is_abstract_boolean_type())
7275 want_type
= Type::lookup_bool_type();
7278 subcontext
.type
= want_type
;
7282 (*pa
)->determine_type(&subcontext
);
7287 // If there is exactly one argument, return true. Otherwise give an
7288 // error message and return false.
7291 Builtin_call_expression::check_one_arg()
7293 const Expression_list
* args
= this->args();
7294 if (args
== NULL
|| args
->size() < 1)
7296 this->report_error(_("not enough arguments"));
7299 else if (args
->size() > 1)
7301 this->report_error(_("too many arguments"));
7304 if (args
->front()->is_error_expression()
7305 || args
->front()->type()->is_error_type()
7306 || args
->front()->type()->is_undefined())
7308 this->set_is_error();
7314 // Check argument types for a builtin function.
7317 Builtin_call_expression::do_check_types(Gogo
*)
7319 switch (this->code_
)
7321 case BUILTIN_INVALID
:
7329 // The single argument may be either a string or an array or a
7330 // map or a channel, or a pointer to a closed array.
7331 if (this->check_one_arg())
7333 Type
* arg_type
= this->one_arg()->type();
7334 if (arg_type
->points_to() != NULL
7335 && arg_type
->points_to()->array_type() != NULL
7336 && !arg_type
->points_to()->is_open_array_type())
7337 arg_type
= arg_type
->points_to();
7338 if (this->code_
== BUILTIN_CAP
)
7340 if (!arg_type
->is_error_type()
7341 && arg_type
->array_type() == NULL
7342 && arg_type
->channel_type() == NULL
)
7343 this->report_error(_("argument must be array or slice "
7348 if (!arg_type
->is_error_type()
7349 && !arg_type
->is_string_type()
7350 && arg_type
->array_type() == NULL
7351 && arg_type
->map_type() == NULL
7352 && arg_type
->channel_type() == NULL
)
7353 this->report_error(_("argument must be string or "
7354 "array or slice or map or channel"));
7361 case BUILTIN_PRINTLN
:
7363 const Expression_list
* args
= this->args();
7366 if (this->code_
== BUILTIN_PRINT
)
7367 warning_at(this->location(), 0,
7368 "no arguments for builtin function %<%s%>",
7369 (this->code_
== BUILTIN_PRINT
7375 for (Expression_list::const_iterator p
= args
->begin();
7379 Type
* type
= (*p
)->type();
7380 if (type
->is_error_type()
7381 || type
->is_string_type()
7382 || type
->integer_type() != NULL
7383 || type
->float_type() != NULL
7384 || type
->complex_type() != NULL
7385 || type
->is_boolean_type()
7386 || type
->points_to() != NULL
7387 || type
->interface_type() != NULL
7388 || type
->channel_type() != NULL
7389 || type
->map_type() != NULL
7390 || type
->function_type() != NULL
7391 || type
->is_open_array_type())
7394 this->report_error(_("unsupported argument type to "
7395 "builtin function"));
7402 case BUILTIN_CLOSED
:
7403 if (this->check_one_arg())
7405 if (this->one_arg()->type()->channel_type() == NULL
)
7406 this->report_error(_("argument must be channel"));
7411 case BUILTIN_SIZEOF
:
7412 case BUILTIN_ALIGNOF
:
7413 this->check_one_arg();
7416 case BUILTIN_RECOVER
:
7417 if (this->args() != NULL
&& !this->args()->empty())
7418 this->report_error(_("too many arguments"));
7421 case BUILTIN_OFFSETOF
:
7422 if (this->check_one_arg())
7424 Expression
* arg
= this->one_arg();
7425 if (arg
->field_reference_expression() == NULL
)
7426 this->report_error(_("argument must be a field reference"));
7432 const Expression_list
* args
= this->args();
7433 if (args
== NULL
|| args
->size() < 2)
7435 this->report_error(_("not enough arguments"));
7438 else if (args
->size() > 2)
7440 this->report_error(_("too many arguments"));
7443 Type
* arg1_type
= args
->front()->type();
7444 Type
* arg2_type
= args
->back()->type();
7445 if (arg1_type
->is_error_type() || arg2_type
->is_error_type())
7449 if (arg1_type
->is_open_array_type())
7450 e1
= arg1_type
->array_type()->element_type();
7453 this->report_error(_("left argument must be a slice"));
7458 if (arg2_type
->is_open_array_type())
7459 e2
= arg2_type
->array_type()->element_type();
7460 else if (arg2_type
->is_string_type())
7461 e2
= Type::lookup_integer_type("uint8");
7464 this->report_error(_("right argument must be a slice or a string"));
7468 if (!Type::are_identical(e1
, e2
, true, NULL
))
7469 this->report_error(_("element types must be the same"));
7473 case BUILTIN_APPEND
:
7475 const Expression_list
* args
= this->args();
7476 if (args
== NULL
|| args
->size() < 2)
7478 this->report_error(_("not enough arguments"));
7481 if (args
->size() > 2)
7483 this->report_error(_("too many arguments"));
7487 if (!Type::are_assignable(args
->front()->type(), args
->back()->type(),
7491 this->report_error(_("arguments 1 and 2 have different types"));
7494 error_at(this->location(),
7495 "arguments 1 and 2 have different types (%s)",
7497 this->set_is_error();
7505 if (this->check_one_arg())
7507 if (this->one_arg()->type()->complex_type() == NULL
)
7508 this->report_error(_("argument must have complex type"));
7512 case BUILTIN_COMPLEX
:
7514 const Expression_list
* args
= this->args();
7515 if (args
== NULL
|| args
->size() < 2)
7516 this->report_error(_("not enough arguments"));
7517 else if (args
->size() > 2)
7518 this->report_error(_("too many arguments"));
7519 else if (args
->front()->is_error_expression()
7520 || args
->front()->type()->is_error_type()
7521 || args
->back()->is_error_expression()
7522 || args
->back()->type()->is_error_type())
7523 this->set_is_error();
7524 else if (!Type::are_identical(args
->front()->type(),
7525 args
->back()->type(), true, NULL
))
7526 this->report_error(_("complex arguments must have identical types"));
7527 else if (args
->front()->type()->float_type() == NULL
)
7528 this->report_error(_("complex arguments must have "
7529 "floating-point type"));
7538 // Return the tree for a builtin function.
7541 Builtin_call_expression::do_get_tree(Translate_context
* context
)
7543 Gogo
* gogo
= context
->gogo();
7544 source_location location
= this->location();
7545 switch (this->code_
)
7547 case BUILTIN_INVALID
:
7555 const Expression_list
* args
= this->args();
7556 gcc_assert(args
!= NULL
&& args
->size() == 1);
7557 Expression
* arg
= *args
->begin();
7558 Type
* arg_type
= arg
->type();
7562 gcc_assert(saw_errors());
7563 return error_mark_node
;
7567 tree arg_tree
= arg
->get_tree(context
);
7569 this->seen_
= false;
7571 if (arg_tree
== error_mark_node
)
7572 return error_mark_node
;
7574 if (arg_type
->points_to() != NULL
)
7576 arg_type
= arg_type
->points_to();
7577 gcc_assert(arg_type
->array_type() != NULL
7578 && !arg_type
->is_open_array_type());
7579 gcc_assert(POINTER_TYPE_P(TREE_TYPE(arg_tree
)));
7580 arg_tree
= build_fold_indirect_ref(arg_tree
);
7584 if (this->code_
== BUILTIN_LEN
)
7586 if (arg_type
->is_string_type())
7587 val_tree
= String_type::length_tree(gogo
, arg_tree
);
7588 else if (arg_type
->array_type() != NULL
)
7592 gcc_assert(saw_errors());
7593 return error_mark_node
;
7596 val_tree
= arg_type
->array_type()->length_tree(gogo
, arg_tree
);
7597 this->seen_
= false;
7599 else if (arg_type
->map_type() != NULL
)
7601 static tree map_len_fndecl
;
7602 val_tree
= Gogo::call_builtin(&map_len_fndecl
,
7607 arg_type
->get_tree(gogo
),
7610 else if (arg_type
->channel_type() != NULL
)
7612 static tree chan_len_fndecl
;
7613 val_tree
= Gogo::call_builtin(&chan_len_fndecl
,
7618 arg_type
->get_tree(gogo
),
7626 if (arg_type
->array_type() != NULL
)
7630 gcc_assert(saw_errors());
7631 return error_mark_node
;
7634 val_tree
= arg_type
->array_type()->capacity_tree(gogo
,
7636 this->seen_
= false;
7638 else if (arg_type
->channel_type() != NULL
)
7640 static tree chan_cap_fndecl
;
7641 val_tree
= Gogo::call_builtin(&chan_cap_fndecl
,
7646 arg_type
->get_tree(gogo
),
7653 if (val_tree
== error_mark_node
)
7654 return error_mark_node
;
7656 tree type_tree
= Type::lookup_integer_type("int")->get_tree(gogo
);
7657 if (type_tree
== TREE_TYPE(val_tree
))
7660 return fold(convert_to_integer(type_tree
, val_tree
));
7664 case BUILTIN_PRINTLN
:
7666 const bool is_ln
= this->code_
== BUILTIN_PRINTLN
;
7667 tree stmt_list
= NULL_TREE
;
7669 const Expression_list
* call_args
= this->args();
7670 if (call_args
!= NULL
)
7672 for (Expression_list::const_iterator p
= call_args
->begin();
7673 p
!= call_args
->end();
7676 if (is_ln
&& p
!= call_args
->begin())
7678 static tree print_space_fndecl
;
7679 tree call
= Gogo::call_builtin(&print_space_fndecl
,
7684 if (call
== error_mark_node
)
7685 return error_mark_node
;
7686 append_to_statement_list(call
, &stmt_list
);
7689 Type
* type
= (*p
)->type();
7691 tree arg
= (*p
)->get_tree(context
);
7692 if (arg
== error_mark_node
)
7693 return error_mark_node
;
7697 if (type
->is_string_type())
7699 static tree print_string_fndecl
;
7700 pfndecl
= &print_string_fndecl
;
7701 fnname
= "__go_print_string";
7703 else if (type
->integer_type() != NULL
7704 && type
->integer_type()->is_unsigned())
7706 static tree print_uint64_fndecl
;
7707 pfndecl
= &print_uint64_fndecl
;
7708 fnname
= "__go_print_uint64";
7709 Type
* itype
= Type::lookup_integer_type("uint64");
7710 arg
= fold_convert_loc(location
, itype
->get_tree(gogo
),
7713 else if (type
->integer_type() != NULL
)
7715 static tree print_int64_fndecl
;
7716 pfndecl
= &print_int64_fndecl
;
7717 fnname
= "__go_print_int64";
7718 Type
* itype
= Type::lookup_integer_type("int64");
7719 arg
= fold_convert_loc(location
, itype
->get_tree(gogo
),
7722 else if (type
->float_type() != NULL
)
7724 static tree print_double_fndecl
;
7725 pfndecl
= &print_double_fndecl
;
7726 fnname
= "__go_print_double";
7727 arg
= fold_convert_loc(location
, double_type_node
, arg
);
7729 else if (type
->complex_type() != NULL
)
7731 static tree print_complex_fndecl
;
7732 pfndecl
= &print_complex_fndecl
;
7733 fnname
= "__go_print_complex";
7734 arg
= fold_convert_loc(location
, complex_double_type_node
,
7737 else if (type
->is_boolean_type())
7739 static tree print_bool_fndecl
;
7740 pfndecl
= &print_bool_fndecl
;
7741 fnname
= "__go_print_bool";
7743 else if (type
->points_to() != NULL
7744 || type
->channel_type() != NULL
7745 || type
->map_type() != NULL
7746 || type
->function_type() != NULL
)
7748 static tree print_pointer_fndecl
;
7749 pfndecl
= &print_pointer_fndecl
;
7750 fnname
= "__go_print_pointer";
7751 arg
= fold_convert_loc(location
, ptr_type_node
, arg
);
7753 else if (type
->interface_type() != NULL
)
7755 if (type
->interface_type()->is_empty())
7757 static tree print_empty_interface_fndecl
;
7758 pfndecl
= &print_empty_interface_fndecl
;
7759 fnname
= "__go_print_empty_interface";
7763 static tree print_interface_fndecl
;
7764 pfndecl
= &print_interface_fndecl
;
7765 fnname
= "__go_print_interface";
7768 else if (type
->is_open_array_type())
7770 static tree print_slice_fndecl
;
7771 pfndecl
= &print_slice_fndecl
;
7772 fnname
= "__go_print_slice";
7777 tree call
= Gogo::call_builtin(pfndecl
,
7784 if (call
== error_mark_node
)
7785 return error_mark_node
;
7786 append_to_statement_list(call
, &stmt_list
);
7792 static tree print_nl_fndecl
;
7793 tree call
= Gogo::call_builtin(&print_nl_fndecl
,
7798 if (call
== error_mark_node
)
7799 return error_mark_node
;
7800 append_to_statement_list(call
, &stmt_list
);
7808 const Expression_list
* args
= this->args();
7809 gcc_assert(args
!= NULL
&& args
->size() == 1);
7810 Expression
* arg
= args
->front();
7811 tree arg_tree
= arg
->get_tree(context
);
7812 if (arg_tree
== error_mark_node
)
7813 return error_mark_node
;
7814 Type
*empty
= Type::make_interface_type(NULL
, BUILTINS_LOCATION
);
7815 arg_tree
= Expression::convert_for_assignment(context
, empty
,
7817 arg_tree
, location
);
7818 static tree panic_fndecl
;
7819 tree call
= Gogo::call_builtin(&panic_fndecl
,
7824 TREE_TYPE(arg_tree
),
7826 if (call
== error_mark_node
)
7827 return error_mark_node
;
7828 // This function will throw an exception.
7829 TREE_NOTHROW(panic_fndecl
) = 0;
7830 // This function will not return.
7831 TREE_THIS_VOLATILE(panic_fndecl
) = 1;
7835 case BUILTIN_RECOVER
:
7837 // The argument is set when building recover thunks. It's a
7838 // boolean value which is true if we can recover a value now.
7839 const Expression_list
* args
= this->args();
7840 gcc_assert(args
!= NULL
&& args
->size() == 1);
7841 Expression
* arg
= args
->front();
7842 tree arg_tree
= arg
->get_tree(context
);
7843 if (arg_tree
== error_mark_node
)
7844 return error_mark_node
;
7846 Type
*empty
= Type::make_interface_type(NULL
, BUILTINS_LOCATION
);
7847 tree empty_tree
= empty
->get_tree(context
->gogo());
7849 Type
* nil_type
= Type::make_nil_type();
7850 Expression
* nil
= Expression::make_nil(location
);
7851 tree nil_tree
= nil
->get_tree(context
);
7852 tree empty_nil_tree
= Expression::convert_for_assignment(context
,
7858 // We need to handle a deferred call to recover specially,
7859 // because it changes whether it can recover a panic or not.
7860 // See test7 in test/recover1.go.
7862 if (this->is_deferred())
7864 static tree deferred_recover_fndecl
;
7865 call
= Gogo::call_builtin(&deferred_recover_fndecl
,
7867 "__go_deferred_recover",
7873 static tree recover_fndecl
;
7874 call
= Gogo::call_builtin(&recover_fndecl
,
7880 if (call
== error_mark_node
)
7881 return error_mark_node
;
7882 return fold_build3_loc(location
, COND_EXPR
, empty_tree
, arg_tree
,
7883 call
, empty_nil_tree
);
7887 case BUILTIN_CLOSED
:
7889 const Expression_list
* args
= this->args();
7890 gcc_assert(args
!= NULL
&& args
->size() == 1);
7891 Expression
* arg
= args
->front();
7892 tree arg_tree
= arg
->get_tree(context
);
7893 if (arg_tree
== error_mark_node
)
7894 return error_mark_node
;
7895 if (this->code_
== BUILTIN_CLOSE
)
7897 static tree close_fndecl
;
7898 return Gogo::call_builtin(&close_fndecl
,
7900 "__go_builtin_close",
7903 TREE_TYPE(arg_tree
),
7908 static tree closed_fndecl
;
7909 return Gogo::call_builtin(&closed_fndecl
,
7911 "__go_builtin_closed",
7914 TREE_TYPE(arg_tree
),
7919 case BUILTIN_SIZEOF
:
7920 case BUILTIN_OFFSETOF
:
7921 case BUILTIN_ALIGNOF
:
7926 bool b
= this->integer_constant_value(true, val
, &dummy
);
7928 tree type
= Type::lookup_integer_type("int")->get_tree(gogo
);
7929 tree ret
= Expression::integer_constant_tree(val
, type
);
7936 const Expression_list
* args
= this->args();
7937 gcc_assert(args
!= NULL
&& args
->size() == 2);
7938 Expression
* arg1
= args
->front();
7939 Expression
* arg2
= args
->back();
7941 tree arg1_tree
= arg1
->get_tree(context
);
7942 tree arg2_tree
= arg2
->get_tree(context
);
7943 if (arg1_tree
== error_mark_node
|| arg2_tree
== error_mark_node
)
7944 return error_mark_node
;
7946 Type
* arg1_type
= arg1
->type();
7947 Array_type
* at
= arg1_type
->array_type();
7948 arg1_tree
= save_expr(arg1_tree
);
7949 tree arg1_val
= at
->value_pointer_tree(gogo
, arg1_tree
);
7950 tree arg1_len
= at
->length_tree(gogo
, arg1_tree
);
7951 if (arg1_val
== error_mark_node
|| arg1_len
== error_mark_node
)
7952 return error_mark_node
;
7954 Type
* arg2_type
= arg2
->type();
7957 if (arg2_type
->is_open_array_type())
7959 at
= arg2_type
->array_type();
7960 arg2_tree
= save_expr(arg2_tree
);
7961 arg2_val
= at
->value_pointer_tree(gogo
, arg2_tree
);
7962 arg2_len
= at
->length_tree(gogo
, arg2_tree
);
7966 arg2_tree
= save_expr(arg2_tree
);
7967 arg2_val
= String_type::bytes_tree(gogo
, arg2_tree
);
7968 arg2_len
= String_type::length_tree(gogo
, arg2_tree
);
7970 if (arg2_val
== error_mark_node
|| arg2_len
== error_mark_node
)
7971 return error_mark_node
;
7973 arg1_len
= save_expr(arg1_len
);
7974 arg2_len
= save_expr(arg2_len
);
7975 tree len
= fold_build3_loc(location
, COND_EXPR
, TREE_TYPE(arg1_len
),
7976 fold_build2_loc(location
, LT_EXPR
,
7978 arg1_len
, arg2_len
),
7979 arg1_len
, arg2_len
);
7980 len
= save_expr(len
);
7982 Type
* element_type
= at
->element_type();
7983 tree element_type_tree
= element_type
->get_tree(gogo
);
7984 if (element_type_tree
== error_mark_node
)
7985 return error_mark_node
;
7986 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
7987 tree bytecount
= fold_convert_loc(location
, TREE_TYPE(element_size
),
7989 bytecount
= fold_build2_loc(location
, MULT_EXPR
,
7990 TREE_TYPE(element_size
),
7991 bytecount
, element_size
);
7992 bytecount
= fold_convert_loc(location
, size_type_node
, bytecount
);
7994 arg1_val
= fold_convert_loc(location
, ptr_type_node
, arg1_val
);
7995 arg2_val
= fold_convert_loc(location
, ptr_type_node
, arg2_val
);
7997 static tree copy_fndecl
;
7998 tree call
= Gogo::call_builtin(©_fndecl
,
8009 if (call
== error_mark_node
)
8010 return error_mark_node
;
8012 return fold_build2_loc(location
, COMPOUND_EXPR
, TREE_TYPE(len
),
8016 case BUILTIN_APPEND
:
8018 const Expression_list
* args
= this->args();
8019 gcc_assert(args
!= NULL
&& args
->size() == 2);
8020 Expression
* arg1
= args
->front();
8021 Expression
* arg2
= args
->back();
8023 tree arg1_tree
= arg1
->get_tree(context
);
8024 tree arg2_tree
= arg2
->get_tree(context
);
8025 if (arg1_tree
== error_mark_node
|| arg2_tree
== error_mark_node
)
8026 return error_mark_node
;
8028 Array_type
* at
= arg1
->type()->array_type();
8029 Type
* element_type
= at
->element_type();
8031 arg2_tree
= Expression::convert_for_assignment(context
, at
,
8035 if (arg2_tree
== error_mark_node
)
8036 return error_mark_node
;
8038 arg2_tree
= save_expr(arg2_tree
);
8039 tree arg2_val
= at
->value_pointer_tree(gogo
, arg2_tree
);
8040 tree arg2_len
= at
->length_tree(gogo
, arg2_tree
);
8041 if (arg2_val
== error_mark_node
|| arg2_len
== error_mark_node
)
8042 return error_mark_node
;
8043 arg2_val
= fold_convert_loc(location
, ptr_type_node
, arg2_val
);
8044 arg2_len
= fold_convert_loc(location
, size_type_node
, arg2_len
);
8046 tree element_type_tree
= element_type
->get_tree(gogo
);
8047 if (element_type_tree
== error_mark_node
)
8048 return error_mark_node
;
8049 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
8050 element_size
= fold_convert_loc(location
, size_type_node
,
8053 // We rebuild the decl each time since the slice types may
8055 tree append_fndecl
= NULL_TREE
;
8056 return Gogo::call_builtin(&append_fndecl
,
8060 TREE_TYPE(arg1_tree
),
8061 TREE_TYPE(arg1_tree
),
8074 const Expression_list
* args
= this->args();
8075 gcc_assert(args
!= NULL
&& args
->size() == 1);
8076 Expression
* arg
= args
->front();
8077 tree arg_tree
= arg
->get_tree(context
);
8078 if (arg_tree
== error_mark_node
)
8079 return error_mark_node
;
8080 gcc_assert(COMPLEX_FLOAT_TYPE_P(TREE_TYPE(arg_tree
)));
8081 if (this->code_
== BUILTIN_REAL
)
8082 return fold_build1_loc(location
, REALPART_EXPR
,
8083 TREE_TYPE(TREE_TYPE(arg_tree
)),
8086 return fold_build1_loc(location
, IMAGPART_EXPR
,
8087 TREE_TYPE(TREE_TYPE(arg_tree
)),
8091 case BUILTIN_COMPLEX
:
8093 const Expression_list
* args
= this->args();
8094 gcc_assert(args
!= NULL
&& args
->size() == 2);
8095 tree r
= args
->front()->get_tree(context
);
8096 tree i
= args
->back()->get_tree(context
);
8097 if (r
== error_mark_node
|| i
== error_mark_node
)
8098 return error_mark_node
;
8099 gcc_assert(TYPE_MAIN_VARIANT(TREE_TYPE(r
))
8100 == TYPE_MAIN_VARIANT(TREE_TYPE(i
)));
8101 gcc_assert(SCALAR_FLOAT_TYPE_P(TREE_TYPE(r
)));
8102 return fold_build2_loc(location
, COMPLEX_EXPR
,
8103 build_complex_type(TREE_TYPE(r
)),
8112 // We have to support exporting a builtin call expression, because
8113 // code can set a constant to the result of a builtin expression.
8116 Builtin_call_expression::do_export(Export
* exp
) const
8123 if (this->integer_constant_value(true, val
, &dummy
))
8125 Integer_expression::export_integer(exp
, val
);
8134 if (this->float_constant_value(fval
, &dummy
))
8136 Float_expression::export_float(exp
, fval
);
8148 if (this->complex_constant_value(real
, imag
, &dummy
))
8150 Complex_expression::export_complex(exp
, real
, imag
);
8159 error_at(this->location(), "value is not constant");
8163 // A trailing space lets us reliably identify the end of the number.
8164 exp
->write_c_string(" ");
8167 // Class Call_expression.
8172 Call_expression::do_traverse(Traverse
* traverse
)
8174 if (Expression::traverse(&this->fn_
, traverse
) == TRAVERSE_EXIT
)
8175 return TRAVERSE_EXIT
;
8176 if (this->args_
!= NULL
)
8178 if (this->args_
->traverse(traverse
) == TRAVERSE_EXIT
)
8179 return TRAVERSE_EXIT
;
8181 return TRAVERSE_CONTINUE
;
8184 // Lower a call statement.
8187 Call_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
8189 // A type case can look like a function call.
8190 if (this->fn_
->is_type_expression()
8191 && this->args_
!= NULL
8192 && this->args_
->size() == 1)
8193 return Expression::make_cast(this->fn_
->type(), this->args_
->front(),
8196 // Recognize a call to a builtin function.
8197 Func_expression
* fne
= this->fn_
->func_expression();
8199 && fne
->named_object()->is_function_declaration()
8200 && fne
->named_object()->func_declaration_value()->type()->is_builtin())
8201 return new Builtin_call_expression(gogo
, this->fn_
, this->args_
,
8202 this->is_varargs_
, this->location());
8204 // Handle an argument which is a call to a function which returns
8205 // multiple results.
8206 if (this->args_
!= NULL
8207 && this->args_
->size() == 1
8208 && this->args_
->front()->call_expression() != NULL
8209 && this->fn_
->type()->function_type() != NULL
)
8211 Function_type
* fntype
= this->fn_
->type()->function_type();
8212 size_t rc
= this->args_
->front()->call_expression()->result_count();
8214 && fntype
->parameters() != NULL
8215 && (fntype
->parameters()->size() == rc
8216 || (fntype
->is_varargs()
8217 && fntype
->parameters()->size() - 1 <= rc
)))
8219 Call_expression
* call
= this->args_
->front()->call_expression();
8220 Expression_list
* args
= new Expression_list
;
8221 for (size_t i
= 0; i
< rc
; ++i
)
8222 args
->push_back(Expression::make_call_result(call
, i
));
8223 // We can't return a new call expression here, because this
8224 // one may be referenced by Call_result expressions. FIXME.
8230 // Handle a call to a varargs function by packaging up the extra
8232 if (this->fn_
->type()->function_type() != NULL
8233 && this->fn_
->type()->function_type()->is_varargs())
8235 Function_type
* fntype
= this->fn_
->type()->function_type();
8236 const Typed_identifier_list
* parameters
= fntype
->parameters();
8237 gcc_assert(parameters
!= NULL
&& !parameters
->empty());
8238 Type
* varargs_type
= parameters
->back().type();
8239 return this->lower_varargs(gogo
, function
, varargs_type
,
8240 parameters
->size());
8246 // Lower a call to a varargs function. FUNCTION is the function in
8247 // which the call occurs--it's not the function we are calling.
8248 // VARARGS_TYPE is the type of the varargs parameter, a slice type.
8249 // PARAM_COUNT is the number of parameters of the function we are
8250 // calling; the last of these parameters will be the varargs
8254 Call_expression::lower_varargs(Gogo
* gogo
, Named_object
* function
,
8255 Type
* varargs_type
, size_t param_count
)
8257 if (this->varargs_are_lowered_
)
8260 source_location loc
= this->location();
8262 gcc_assert(param_count
> 0);
8263 gcc_assert(varargs_type
->is_open_array_type());
8265 size_t arg_count
= this->args_
== NULL
? 0 : this->args_
->size();
8266 if (arg_count
< param_count
- 1)
8268 // Not enough arguments; will be caught in check_types.
8272 Expression_list
* old_args
= this->args_
;
8273 Expression_list
* new_args
= new Expression_list();
8274 bool push_empty_arg
= false;
8275 if (old_args
== NULL
|| old_args
->empty())
8277 gcc_assert(param_count
== 1);
8278 push_empty_arg
= true;
8282 Expression_list::const_iterator pa
;
8284 for (pa
= old_args
->begin(); pa
!= old_args
->end(); ++pa
, ++i
)
8286 if (static_cast<size_t>(i
) == param_count
)
8288 new_args
->push_back(*pa
);
8291 // We have reached the varargs parameter.
8293 bool issued_error
= false;
8294 if (pa
== old_args
->end())
8295 push_empty_arg
= true;
8296 else if (pa
+ 1 == old_args
->end() && this->is_varargs_
)
8297 new_args
->push_back(*pa
);
8298 else if (this->is_varargs_
)
8300 this->report_error(_("too many arguments"));
8303 else if (pa
+ 1 == old_args
->end()
8304 && this->is_compatible_varargs_argument(function
, *pa
,
8307 new_args
->push_back(*pa
);
8310 Type
* element_type
= varargs_type
->array_type()->element_type();
8311 Expression_list
* vals
= new Expression_list
;
8312 for (; pa
!= old_args
->end(); ++pa
, ++i
)
8314 // Check types here so that we get a better message.
8315 Type
* patype
= (*pa
)->type();
8316 source_location paloc
= (*pa
)->location();
8317 if (!this->check_argument_type(i
, element_type
, patype
,
8318 paloc
, issued_error
))
8320 vals
->push_back(*pa
);
8323 Expression::make_slice_composite_literal(varargs_type
, vals
, loc
);
8324 new_args
->push_back(val
);
8329 new_args
->push_back(Expression::make_nil(loc
));
8331 // We can't return a new call expression here, because this one may
8332 // be referenced by Call_result expressions. FIXME.
8333 if (old_args
!= NULL
)
8335 this->args_
= new_args
;
8336 this->varargs_are_lowered_
= true;
8338 // Lower all the new subexpressions.
8339 Expression
* ret
= this;
8340 gogo
->lower_expression(function
, &ret
);
8341 gcc_assert(ret
== this);
8345 // Return true if ARG is a varargs argment which should be passed to
8346 // the varargs parameter of type PARAM_TYPE without wrapping. ARG
8347 // will be the last argument passed in the call, and PARAM_TYPE will
8348 // be the type of the last parameter of the varargs function being
8352 Call_expression::is_compatible_varargs_argument(Named_object
* function
,
8357 *issued_error
= false;
8359 Type
* var_type
= NULL
;
8361 // The simple case is passing the varargs parameter of the caller.
8362 Var_expression
* ve
= arg
->var_expression();
8363 if (ve
!= NULL
&& ve
->named_object()->is_variable())
8365 Variable
* var
= ve
->named_object()->var_value();
8366 if (var
->is_varargs_parameter())
8367 var_type
= var
->type();
8370 // The complex case is passing the varargs parameter of some
8371 // enclosing function. This will look like passing down *c.f where
8372 // c is the closure variable and f is a field in the closure.
8373 if (function
!= NULL
8374 && function
->func_value()->needs_closure()
8375 && arg
->classification() == EXPRESSION_UNARY
)
8377 Unary_expression
* ue
= static_cast<Unary_expression
*>(arg
);
8378 if (ue
->op() == OPERATOR_MULT
)
8380 Field_reference_expression
* fre
=
8381 ue
->operand()->deref()->field_reference_expression();
8384 Var_expression
* ve
= fre
->expr()->deref()->var_expression();
8387 Named_object
* no
= ve
->named_object();
8388 Function
* f
= function
->func_value();
8389 if (no
== f
->closure_var())
8391 // At this point we know that this indeed a
8392 // reference to some enclosing variable. Now we
8393 // need to figure out whether that variable is a
8394 // varargs parameter.
8395 Named_object
* enclosing
=
8396 f
->enclosing_var(fre
->field_index());
8397 Variable
* var
= enclosing
->var_value();
8398 if (var
->is_varargs_parameter())
8399 var_type
= var
->type();
8406 if (var_type
== NULL
)
8409 // We only match if the parameter is the same, with an identical
8411 Array_type
* var_at
= var_type
->array_type();
8412 gcc_assert(var_at
!= NULL
);
8413 Array_type
* param_at
= param_type
->array_type();
8414 if (param_at
!= NULL
8415 && Type::are_identical(var_at
->element_type(),
8416 param_at
->element_type(), true, NULL
))
8418 error_at(arg
->location(), "... mismatch: passing ...T as ...");
8419 *issued_error
= true;
8423 // Get the function type. Returns NULL if we don't know the type. If
8424 // this returns NULL, and if_ERROR is true, issues an error.
8427 Call_expression::get_function_type() const
8429 return this->fn_
->type()->function_type();
8432 // Return the number of values which this call will return.
8435 Call_expression::result_count() const
8437 const Function_type
* fntype
= this->get_function_type();
8440 if (fntype
->results() == NULL
)
8442 return fntype
->results()->size();
8445 // Return whether this is a call to the predeclared function recover.
8448 Call_expression::is_recover_call() const
8450 return this->do_is_recover_call();
8453 // Set the argument to the recover function.
8456 Call_expression::set_recover_arg(Expression
* arg
)
8458 this->do_set_recover_arg(arg
);
8461 // Virtual functions also implemented by Builtin_call_expression.
8464 Call_expression::do_is_recover_call() const
8470 Call_expression::do_set_recover_arg(Expression
*)
8478 Call_expression::do_type()
8480 if (this->type_
!= NULL
)
8484 Function_type
* fntype
= this->get_function_type();
8486 return Type::make_error_type();
8488 const Typed_identifier_list
* results
= fntype
->results();
8489 if (results
== NULL
)
8490 ret
= Type::make_void_type();
8491 else if (results
->size() == 1)
8492 ret
= results
->begin()->type();
8494 ret
= Type::make_call_multiple_result_type(this);
8501 // Determine types for a call expression. We can use the function
8502 // parameter types to set the types of the arguments.
8505 Call_expression::do_determine_type(const Type_context
*)
8507 this->fn_
->determine_type_no_context();
8508 Function_type
* fntype
= this->get_function_type();
8509 const Typed_identifier_list
* parameters
= NULL
;
8511 parameters
= fntype
->parameters();
8512 if (this->args_
!= NULL
)
8514 Typed_identifier_list::const_iterator pt
;
8515 if (parameters
!= NULL
)
8516 pt
= parameters
->begin();
8517 for (Expression_list::const_iterator pa
= this->args_
->begin();
8518 pa
!= this->args_
->end();
8521 if (parameters
!= NULL
&& pt
!= parameters
->end())
8523 Type_context
subcontext(pt
->type(), false);
8524 (*pa
)->determine_type(&subcontext
);
8528 (*pa
)->determine_type_no_context();
8533 // Check types for parameter I.
8536 Call_expression::check_argument_type(int i
, const Type
* parameter_type
,
8537 const Type
* argument_type
,
8538 source_location argument_location
,
8542 if (!Type::are_assignable(parameter_type
, argument_type
, &reason
))
8547 error_at(argument_location
, "argument %d has incompatible type", i
);
8549 error_at(argument_location
,
8550 "argument %d has incompatible type (%s)",
8553 this->set_is_error();
8562 Call_expression::do_check_types(Gogo
*)
8564 Function_type
* fntype
= this->get_function_type();
8567 if (!this->fn_
->type()->is_error_type())
8568 this->report_error(_("expected function"));
8572 if (fntype
->is_method())
8574 // We don't support pointers to methods, so the function has to
8575 // be a bound method expression.
8576 Bound_method_expression
* bme
= this->fn_
->bound_method_expression();
8579 this->report_error(_("method call without object"));
8582 Type
* first_arg_type
= bme
->first_argument()->type();
8583 if (first_arg_type
->points_to() == NULL
)
8585 // When passing a value, we need to check that we are
8586 // permitted to copy it.
8588 if (!Type::are_assignable(fntype
->receiver()->type(),
8589 first_arg_type
, &reason
))
8592 this->report_error(_("incompatible type for receiver"));
8595 error_at(this->location(),
8596 "incompatible type for receiver (%s)",
8598 this->set_is_error();
8604 // Note that varargs was handled by the lower_varargs() method, so
8605 // we don't have to worry about it here.
8607 const Typed_identifier_list
* parameters
= fntype
->parameters();
8608 if (this->args_
== NULL
)
8610 if (parameters
!= NULL
&& !parameters
->empty())
8611 this->report_error(_("not enough arguments"));
8613 else if (parameters
== NULL
)
8614 this->report_error(_("too many arguments"));
8618 Typed_identifier_list::const_iterator pt
= parameters
->begin();
8619 for (Expression_list::const_iterator pa
= this->args_
->begin();
8620 pa
!= this->args_
->end();
8623 if (pt
== parameters
->end())
8625 this->report_error(_("too many arguments"));
8628 this->check_argument_type(i
+ 1, pt
->type(), (*pa
)->type(),
8629 (*pa
)->location(), false);
8631 if (pt
!= parameters
->end())
8632 this->report_error(_("not enough arguments"));
8636 // Return whether we have to use a temporary variable to ensure that
8637 // we evaluate this call expression in order. If the call returns no
8638 // results then it will inevitably be executed last. If the call
8639 // returns more than one result then it will be used with Call_result
8640 // expressions. So we only have to use a temporary variable if the
8641 // call returns exactly one result.
8644 Call_expression::do_must_eval_in_order() const
8646 return this->result_count() == 1;
8649 // Get the function and the first argument to use when calling a bound
8653 Call_expression::bound_method_function(Translate_context
* context
,
8654 Bound_method_expression
* bound_method
,
8655 tree
* first_arg_ptr
)
8657 Expression
* first_argument
= bound_method
->first_argument();
8658 tree first_arg
= first_argument
->get_tree(context
);
8659 if (first_arg
== error_mark_node
)
8660 return error_mark_node
;
8662 // We always pass a pointer to the first argument when calling a
8664 if (first_argument
->type()->points_to() == NULL
)
8666 tree pointer_to_arg_type
= build_pointer_type(TREE_TYPE(first_arg
));
8667 if (TREE_ADDRESSABLE(TREE_TYPE(first_arg
))
8668 || DECL_P(first_arg
)
8669 || TREE_CODE(first_arg
) == INDIRECT_REF
8670 || TREE_CODE(first_arg
) == COMPONENT_REF
)
8672 first_arg
= build_fold_addr_expr(first_arg
);
8673 if (DECL_P(first_arg
))
8674 TREE_ADDRESSABLE(first_arg
) = 1;
8678 tree tmp
= create_tmp_var(TREE_TYPE(first_arg
),
8679 get_name(first_arg
));
8680 DECL_IGNORED_P(tmp
) = 0;
8681 DECL_INITIAL(tmp
) = first_arg
;
8682 first_arg
= build2(COMPOUND_EXPR
, pointer_to_arg_type
,
8683 build1(DECL_EXPR
, void_type_node
, tmp
),
8684 build_fold_addr_expr(tmp
));
8685 TREE_ADDRESSABLE(tmp
) = 1;
8687 if (first_arg
== error_mark_node
)
8688 return error_mark_node
;
8691 Type
* fatype
= bound_method
->first_argument_type();
8694 if (fatype
->points_to() == NULL
)
8695 fatype
= Type::make_pointer_type(fatype
);
8696 first_arg
= fold_convert(fatype
->get_tree(context
->gogo()), first_arg
);
8697 if (first_arg
== error_mark_node
8698 || TREE_TYPE(first_arg
) == error_mark_node
)
8699 return error_mark_node
;
8702 *first_arg_ptr
= first_arg
;
8704 return bound_method
->method()->get_tree(context
);
8707 // Get the function and the first argument to use when calling an
8708 // interface method.
8711 Call_expression::interface_method_function(
8712 Translate_context
* context
,
8713 Interface_field_reference_expression
* interface_method
,
8714 tree
* first_arg_ptr
)
8716 tree expr
= interface_method
->expr()->get_tree(context
);
8717 if (expr
== error_mark_node
)
8718 return error_mark_node
;
8719 expr
= save_expr(expr
);
8720 tree first_arg
= interface_method
->get_underlying_object_tree(context
, expr
);
8721 if (first_arg
== error_mark_node
)
8722 return error_mark_node
;
8723 *first_arg_ptr
= first_arg
;
8724 return interface_method
->get_function_tree(context
, expr
);
8727 // Build the call expression.
8730 Call_expression::do_get_tree(Translate_context
* context
)
8732 if (this->tree_
!= NULL_TREE
)
8735 Function_type
* fntype
= this->get_function_type();
8737 return error_mark_node
;
8739 if (this->fn_
->is_error_expression())
8740 return error_mark_node
;
8742 Gogo
* gogo
= context
->gogo();
8743 source_location location
= this->location();
8745 Func_expression
* func
= this->fn_
->func_expression();
8746 Bound_method_expression
* bound_method
= this->fn_
->bound_method_expression();
8747 Interface_field_reference_expression
* interface_method
=
8748 this->fn_
->interface_field_reference_expression();
8749 const bool has_closure
= func
!= NULL
&& func
->closure() != NULL
;
8750 const bool is_method
= bound_method
!= NULL
|| interface_method
!= NULL
;
8751 gcc_assert(!fntype
->is_method() || is_method
);
8755 if (this->args_
== NULL
|| this->args_
->empty())
8757 nargs
= is_method
? 1 : 0;
8758 args
= nargs
== 0 ? NULL
: new tree
[nargs
];
8762 const Typed_identifier_list
* params
= fntype
->parameters();
8763 gcc_assert(params
!= NULL
);
8765 nargs
= this->args_
->size();
8766 int i
= is_method
? 1 : 0;
8768 args
= new tree
[nargs
];
8770 Typed_identifier_list::const_iterator pp
= params
->begin();
8771 Expression_list::const_iterator pe
;
8772 for (pe
= this->args_
->begin();
8773 pe
!= this->args_
->end();
8776 gcc_assert(pp
!= params
->end());
8777 tree arg_val
= (*pe
)->get_tree(context
);
8778 args
[i
] = Expression::convert_for_assignment(context
,
8783 if (args
[i
] == error_mark_node
)
8786 return error_mark_node
;
8789 gcc_assert(pp
== params
->end());
8790 gcc_assert(i
== nargs
);
8793 tree rettype
= TREE_TYPE(TREE_TYPE(fntype
->get_tree(gogo
)));
8794 if (rettype
== error_mark_node
)
8797 return error_mark_node
;
8802 fn
= func
->get_tree_without_closure(gogo
);
8803 else if (!is_method
)
8804 fn
= this->fn_
->get_tree(context
);
8805 else if (bound_method
!= NULL
)
8806 fn
= this->bound_method_function(context
, bound_method
, &args
[0]);
8807 else if (interface_method
!= NULL
)
8808 fn
= this->interface_method_function(context
, interface_method
, &args
[0]);
8812 if (fn
== error_mark_node
|| TREE_TYPE(fn
) == error_mark_node
)
8815 return error_mark_node
;
8818 // This is to support builtin math functions when using 80387 math.
8820 if (TREE_CODE(fndecl
) == ADDR_EXPR
)
8821 fndecl
= TREE_OPERAND(fndecl
, 0);
8822 tree excess_type
= NULL_TREE
;
8824 && DECL_IS_BUILTIN(fndecl
)
8825 && DECL_BUILT_IN_CLASS(fndecl
) == BUILT_IN_NORMAL
8827 && ((SCALAR_FLOAT_TYPE_P(rettype
)
8828 && SCALAR_FLOAT_TYPE_P(TREE_TYPE(args
[0])))
8829 || (COMPLEX_FLOAT_TYPE_P(rettype
)
8830 && COMPLEX_FLOAT_TYPE_P(TREE_TYPE(args
[0])))))
8832 excess_type
= excess_precision_type(TREE_TYPE(args
[0]));
8833 if (excess_type
!= NULL_TREE
)
8835 tree excess_fndecl
= mathfn_built_in(excess_type
,
8836 DECL_FUNCTION_CODE(fndecl
));
8837 if (excess_fndecl
== NULL_TREE
)
8838 excess_type
= NULL_TREE
;
8841 fn
= build_fold_addr_expr_loc(location
, excess_fndecl
);
8842 for (int i
= 0; i
< nargs
; ++i
)
8843 args
[i
] = ::convert(excess_type
, args
[i
]);
8848 tree ret
= build_call_array(excess_type
!= NULL_TREE
? excess_type
: rettype
,
8852 SET_EXPR_LOCATION(ret
, location
);
8856 tree closure_tree
= func
->closure()->get_tree(context
);
8857 if (closure_tree
!= error_mark_node
)
8858 CALL_EXPR_STATIC_CHAIN(ret
) = closure_tree
;
8861 // If this is a recursive function type which returns itself, as in
8863 // we have used ptr_type_node for the return type. Add a cast here
8864 // to the correct type.
8865 if (TREE_TYPE(ret
) == ptr_type_node
)
8867 tree t
= this->type()->get_tree(gogo
);
8868 ret
= fold_convert_loc(location
, t
, ret
);
8871 if (excess_type
!= NULL_TREE
)
8873 // Calling convert here can undo our excess precision change.
8874 // That may or may not be a bug in convert_to_real.
8875 ret
= build1(NOP_EXPR
, rettype
, ret
);
8878 // If there is more than one result, we will refer to the call
8880 if (fntype
->results() != NULL
&& fntype
->results()->size() > 1)
8881 ret
= save_expr(ret
);
8888 // Make a call expression.
8891 Expression::make_call(Expression
* fn
, Expression_list
* args
, bool is_varargs
,
8892 source_location location
)
8894 return new Call_expression(fn
, args
, is_varargs
, location
);
8897 // A single result from a call which returns multiple results.
8899 class Call_result_expression
: public Expression
8902 Call_result_expression(Call_expression
* call
, unsigned int index
)
8903 : Expression(EXPRESSION_CALL_RESULT
, call
->location()),
8904 call_(call
), index_(index
)
8909 do_traverse(Traverse
*);
8915 do_determine_type(const Type_context
*);
8918 do_check_types(Gogo
*);
8923 return new Call_result_expression(this->call_
->call_expression(),
8928 do_must_eval_in_order() const
8932 do_get_tree(Translate_context
*);
8935 // The underlying call expression.
8937 // Which result we want.
8938 unsigned int index_
;
8941 // Traverse a call result.
8944 Call_result_expression::do_traverse(Traverse
* traverse
)
8946 if (traverse
->remember_expression(this->call_
))
8948 // We have already traversed the call expression.
8949 return TRAVERSE_CONTINUE
;
8951 return Expression::traverse(&this->call_
, traverse
);
8957 Call_result_expression::do_type()
8959 if (this->classification() == EXPRESSION_ERROR
)
8960 return Type::make_error_type();
8962 // THIS->CALL_ can be replaced with a temporary reference due to
8963 // Call_expression::do_must_eval_in_order when there is an error.
8964 Call_expression
* ce
= this->call_
->call_expression();
8967 this->set_is_error();
8968 return Type::make_error_type();
8970 Function_type
* fntype
= ce
->get_function_type();
8973 this->set_is_error();
8974 return Type::make_error_type();
8976 const Typed_identifier_list
* results
= fntype
->results();
8977 if (results
== NULL
)
8979 this->report_error(_("number of results does not match "
8980 "number of values"));
8981 return Type::make_error_type();
8983 Typed_identifier_list::const_iterator pr
= results
->begin();
8984 for (unsigned int i
= 0; i
< this->index_
; ++i
)
8986 if (pr
== results
->end())
8990 if (pr
== results
->end())
8992 this->report_error(_("number of results does not match "
8993 "number of values"));
8994 return Type::make_error_type();
8999 // Check the type. Just make sure that we trigger the warning in
9003 Call_result_expression::do_check_types(Gogo
*)
9008 // Determine the type. We have nothing to do here, but the 0 result
9009 // needs to pass down to the caller.
9012 Call_result_expression::do_determine_type(const Type_context
*)
9014 if (this->index_
== 0)
9015 this->call_
->determine_type_no_context();
9021 Call_result_expression::do_get_tree(Translate_context
* context
)
9023 tree call_tree
= this->call_
->get_tree(context
);
9024 if (call_tree
== error_mark_node
)
9025 return error_mark_node
;
9026 if (TREE_CODE(TREE_TYPE(call_tree
)) != RECORD_TYPE
)
9028 gcc_assert(saw_errors());
9029 return error_mark_node
;
9031 tree field
= TYPE_FIELDS(TREE_TYPE(call_tree
));
9032 for (unsigned int i
= 0; i
< this->index_
; ++i
)
9034 gcc_assert(field
!= NULL_TREE
);
9035 field
= DECL_CHAIN(field
);
9037 gcc_assert(field
!= NULL_TREE
);
9038 return build3(COMPONENT_REF
, TREE_TYPE(field
), call_tree
, field
, NULL_TREE
);
9041 // Make a reference to a single result of a call which returns
9042 // multiple results.
9045 Expression::make_call_result(Call_expression
* call
, unsigned int index
)
9047 return new Call_result_expression(call
, index
);
9050 // Class Index_expression.
9055 Index_expression::do_traverse(Traverse
* traverse
)
9057 if (Expression::traverse(&this->left_
, traverse
) == TRAVERSE_EXIT
9058 || Expression::traverse(&this->start_
, traverse
) == TRAVERSE_EXIT
9059 || (this->end_
!= NULL
9060 && Expression::traverse(&this->end_
, traverse
) == TRAVERSE_EXIT
))
9061 return TRAVERSE_EXIT
;
9062 return TRAVERSE_CONTINUE
;
9065 // Lower an index expression. This converts the generic index
9066 // expression into an array index, a string index, or a map index.
9069 Index_expression::do_lower(Gogo
*, Named_object
*, int)
9071 source_location location
= this->location();
9072 Expression
* left
= this->left_
;
9073 Expression
* start
= this->start_
;
9074 Expression
* end
= this->end_
;
9076 Type
* type
= left
->type();
9077 if (type
->is_error_type())
9078 return Expression::make_error(location
);
9079 else if (type
->array_type() != NULL
)
9080 return Expression::make_array_index(left
, start
, end
, location
);
9081 else if (type
->points_to() != NULL
9082 && type
->points_to()->array_type() != NULL
9083 && !type
->points_to()->is_open_array_type())
9085 Expression
* deref
= Expression::make_unary(OPERATOR_MULT
, left
,
9087 return Expression::make_array_index(deref
, start
, end
, location
);
9089 else if (type
->is_string_type())
9090 return Expression::make_string_index(left
, start
, end
, location
);
9091 else if (type
->map_type() != NULL
)
9095 error_at(location
, "invalid slice of map");
9096 return Expression::make_error(location
);
9098 Map_index_expression
* ret
= Expression::make_map_index(left
, start
,
9100 if (this->is_lvalue_
)
9101 ret
->set_is_lvalue();
9107 "attempt to index object which is not array, string, or map");
9108 return Expression::make_error(location
);
9112 // Make an index expression.
9115 Expression::make_index(Expression
* left
, Expression
* start
, Expression
* end
,
9116 source_location location
)
9118 return new Index_expression(left
, start
, end
, location
);
9121 // An array index. This is used for both indexing and slicing.
9123 class Array_index_expression
: public Expression
9126 Array_index_expression(Expression
* array
, Expression
* start
,
9127 Expression
* end
, source_location location
)
9128 : Expression(EXPRESSION_ARRAY_INDEX
, location
),
9129 array_(array
), start_(start
), end_(end
), type_(NULL
)
9134 do_traverse(Traverse
*);
9140 do_determine_type(const Type_context
*);
9143 do_check_types(Gogo
*);
9148 return Expression::make_array_index(this->array_
->copy(),
9149 this->start_
->copy(),
9152 : this->end_
->copy()),
9157 do_is_addressable() const;
9160 do_address_taken(bool escapes
)
9161 { this->array_
->address_taken(escapes
); }
9164 do_get_tree(Translate_context
*);
9167 // The array we are getting a value from.
9169 // The start or only index.
9171 // The end index of a slice. This may be NULL for a simple array
9172 // index, or it may be a nil expression for the length of the array.
9174 // The type of the expression.
9178 // Array index traversal.
9181 Array_index_expression::do_traverse(Traverse
* traverse
)
9183 if (Expression::traverse(&this->array_
, traverse
) == TRAVERSE_EXIT
)
9184 return TRAVERSE_EXIT
;
9185 if (Expression::traverse(&this->start_
, traverse
) == TRAVERSE_EXIT
)
9186 return TRAVERSE_EXIT
;
9187 if (this->end_
!= NULL
)
9189 if (Expression::traverse(&this->end_
, traverse
) == TRAVERSE_EXIT
)
9190 return TRAVERSE_EXIT
;
9192 return TRAVERSE_CONTINUE
;
9195 // Return the type of an array index.
9198 Array_index_expression::do_type()
9200 if (this->type_
== NULL
)
9202 Array_type
* type
= this->array_
->type()->array_type();
9204 this->type_
= Type::make_error_type();
9205 else if (this->end_
== NULL
)
9206 this->type_
= type
->element_type();
9207 else if (type
->is_open_array_type())
9209 // A slice of a slice has the same type as the original
9211 this->type_
= this->array_
->type()->deref();
9215 // A slice of an array is a slice.
9216 this->type_
= Type::make_array_type(type
->element_type(), NULL
);
9222 // Set the type of an array index.
9225 Array_index_expression::do_determine_type(const Type_context
*)
9227 this->array_
->determine_type_no_context();
9228 Type_context
subcontext(NULL
, true);
9229 this->start_
->determine_type(&subcontext
);
9230 if (this->end_
!= NULL
)
9231 this->end_
->determine_type(&subcontext
);
9234 // Check types of an array index.
9237 Array_index_expression::do_check_types(Gogo
*)
9239 if (this->start_
->type()->integer_type() == NULL
)
9240 this->report_error(_("index must be integer"));
9241 if (this->end_
!= NULL
9242 && this->end_
->type()->integer_type() == NULL
9243 && !this->end_
->is_nil_expression())
9244 this->report_error(_("slice end must be integer"));
9246 Array_type
* array_type
= this->array_
->type()->array_type();
9247 if (array_type
== NULL
)
9249 gcc_assert(this->array_
->type()->is_error_type());
9253 unsigned int int_bits
=
9254 Type::lookup_integer_type("int")->integer_type()->bits();
9259 bool lval_valid
= (array_type
->length() != NULL
9260 && array_type
->length()->integer_constant_value(true,
9265 if (this->start_
->integer_constant_value(true, ival
, &dummy
))
9267 if (mpz_sgn(ival
) < 0
9268 || mpz_sizeinbase(ival
, 2) >= int_bits
9270 && (this->end_
== NULL
9271 ? mpz_cmp(ival
, lval
) >= 0
9272 : mpz_cmp(ival
, lval
) > 0)))
9274 error_at(this->start_
->location(), "array index out of bounds");
9275 this->set_is_error();
9278 if (this->end_
!= NULL
&& !this->end_
->is_nil_expression())
9280 if (this->end_
->integer_constant_value(true, ival
, &dummy
))
9282 if (mpz_sgn(ival
) < 0
9283 || mpz_sizeinbase(ival
, 2) >= int_bits
9284 || (lval_valid
&& mpz_cmp(ival
, lval
) > 0))
9286 error_at(this->end_
->location(), "array index out of bounds");
9287 this->set_is_error();
9294 // A slice of an array requires an addressable array. A slice of a
9295 // slice is always possible.
9296 if (this->end_
!= NULL
9297 && !array_type
->is_open_array_type()
9298 && !this->array_
->is_addressable())
9299 this->report_error(_("array is not addressable"));
9302 // Return whether this expression is addressable.
9305 Array_index_expression::do_is_addressable() const
9307 // A slice expression is not addressable.
9308 if (this->end_
!= NULL
)
9311 // An index into a slice is addressable.
9312 if (this->array_
->type()->is_open_array_type())
9315 // An index into an array is addressable if the array is
9317 return this->array_
->is_addressable();
9320 // Get a tree for an array index.
9323 Array_index_expression::do_get_tree(Translate_context
* context
)
9325 Gogo
* gogo
= context
->gogo();
9326 source_location loc
= this->location();
9328 Array_type
* array_type
= this->array_
->type()->array_type();
9329 if (array_type
== NULL
)
9331 gcc_assert(this->array_
->type()->is_error_type());
9332 return error_mark_node
;
9335 tree type_tree
= array_type
->get_tree(gogo
);
9336 if (type_tree
== error_mark_node
)
9337 return error_mark_node
;
9339 tree array_tree
= this->array_
->get_tree(context
);
9340 if (array_tree
== error_mark_node
)
9341 return error_mark_node
;
9343 if (array_type
->length() == NULL
&& !DECL_P(array_tree
))
9344 array_tree
= save_expr(array_tree
);
9345 tree length_tree
= array_type
->length_tree(gogo
, array_tree
);
9346 if (length_tree
== error_mark_node
)
9347 return error_mark_node
;
9348 length_tree
= save_expr(length_tree
);
9349 tree length_type
= TREE_TYPE(length_tree
);
9351 tree bad_index
= boolean_false_node
;
9353 tree start_tree
= this->start_
->get_tree(context
);
9354 if (start_tree
== error_mark_node
)
9355 return error_mark_node
;
9356 if (!DECL_P(start_tree
))
9357 start_tree
= save_expr(start_tree
);
9358 if (!INTEGRAL_TYPE_P(TREE_TYPE(start_tree
)))
9359 start_tree
= convert_to_integer(length_type
, start_tree
);
9361 bad_index
= Expression::check_bounds(start_tree
, length_type
, bad_index
,
9364 start_tree
= fold_convert_loc(loc
, length_type
, start_tree
);
9365 bad_index
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
, bad_index
,
9366 fold_build2_loc(loc
,
9370 boolean_type_node
, start_tree
,
9373 int code
= (array_type
->length() != NULL
9374 ? (this->end_
== NULL
9375 ? RUNTIME_ERROR_ARRAY_INDEX_OUT_OF_BOUNDS
9376 : RUNTIME_ERROR_ARRAY_SLICE_OUT_OF_BOUNDS
)
9377 : (this->end_
== NULL
9378 ? RUNTIME_ERROR_SLICE_INDEX_OUT_OF_BOUNDS
9379 : RUNTIME_ERROR_SLICE_SLICE_OUT_OF_BOUNDS
));
9380 tree crash
= Gogo::runtime_error(code
, loc
);
9382 if (this->end_
== NULL
)
9384 // Simple array indexing. This has to return an l-value, so
9385 // wrap the index check into START_TREE.
9386 start_tree
= build2(COMPOUND_EXPR
, TREE_TYPE(start_tree
),
9387 build3(COND_EXPR
, void_type_node
,
9388 bad_index
, crash
, NULL_TREE
),
9390 start_tree
= fold_convert_loc(loc
, sizetype
, start_tree
);
9392 if (array_type
->length() != NULL
)
9395 return build4(ARRAY_REF
, TREE_TYPE(type_tree
), array_tree
,
9396 start_tree
, NULL_TREE
, NULL_TREE
);
9401 tree values
= array_type
->value_pointer_tree(gogo
, array_tree
);
9402 tree element_type_tree
= array_type
->element_type()->get_tree(gogo
);
9403 if (element_type_tree
== error_mark_node
)
9404 return error_mark_node
;
9405 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
9406 tree offset
= fold_build2_loc(loc
, MULT_EXPR
, sizetype
,
9407 start_tree
, element_size
);
9408 tree ptr
= fold_build2_loc(loc
, POINTER_PLUS_EXPR
,
9409 TREE_TYPE(values
), values
, offset
);
9410 return build_fold_indirect_ref(ptr
);
9416 tree capacity_tree
= array_type
->capacity_tree(gogo
, array_tree
);
9417 if (capacity_tree
== error_mark_node
)
9418 return error_mark_node
;
9419 capacity_tree
= fold_convert_loc(loc
, length_type
, capacity_tree
);
9422 if (this->end_
->is_nil_expression())
9423 end_tree
= length_tree
;
9426 end_tree
= this->end_
->get_tree(context
);
9427 if (end_tree
== error_mark_node
)
9428 return error_mark_node
;
9429 if (!DECL_P(end_tree
))
9430 end_tree
= save_expr(end_tree
);
9431 if (!INTEGRAL_TYPE_P(TREE_TYPE(end_tree
)))
9432 end_tree
= convert_to_integer(length_type
, end_tree
);
9434 bad_index
= Expression::check_bounds(end_tree
, length_type
, bad_index
,
9437 end_tree
= fold_convert_loc(loc
, length_type
, end_tree
);
9439 capacity_tree
= save_expr(capacity_tree
);
9440 tree bad_end
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
9441 fold_build2_loc(loc
, LT_EXPR
,
9443 end_tree
, start_tree
),
9444 fold_build2_loc(loc
, GT_EXPR
,
9446 end_tree
, capacity_tree
));
9447 bad_index
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
9448 bad_index
, bad_end
);
9451 tree element_type_tree
= array_type
->element_type()->get_tree(gogo
);
9452 if (element_type_tree
== error_mark_node
)
9453 return error_mark_node
;
9454 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
9456 tree offset
= fold_build2_loc(loc
, MULT_EXPR
, sizetype
,
9457 fold_convert_loc(loc
, sizetype
, start_tree
),
9460 tree value_pointer
= array_type
->value_pointer_tree(gogo
, array_tree
);
9461 if (value_pointer
== error_mark_node
)
9462 return error_mark_node
;
9464 value_pointer
= fold_build2_loc(loc
, POINTER_PLUS_EXPR
,
9465 TREE_TYPE(value_pointer
),
9466 value_pointer
, offset
);
9468 tree result_length_tree
= fold_build2_loc(loc
, MINUS_EXPR
, length_type
,
9469 end_tree
, start_tree
);
9471 tree result_capacity_tree
= fold_build2_loc(loc
, MINUS_EXPR
, length_type
,
9472 capacity_tree
, start_tree
);
9474 tree struct_tree
= this->type()->get_tree(gogo
);
9475 gcc_assert(TREE_CODE(struct_tree
) == RECORD_TYPE
);
9477 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 3);
9479 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
9480 tree field
= TYPE_FIELDS(struct_tree
);
9481 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__values") == 0);
9483 elt
->value
= value_pointer
;
9485 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
9486 field
= DECL_CHAIN(field
);
9487 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__count") == 0);
9489 elt
->value
= fold_convert_loc(loc
, TREE_TYPE(field
), result_length_tree
);
9491 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
9492 field
= DECL_CHAIN(field
);
9493 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__capacity") == 0);
9495 elt
->value
= fold_convert_loc(loc
, TREE_TYPE(field
), result_capacity_tree
);
9497 tree constructor
= build_constructor(struct_tree
, init
);
9499 if (TREE_CONSTANT(value_pointer
)
9500 && TREE_CONSTANT(result_length_tree
)
9501 && TREE_CONSTANT(result_capacity_tree
))
9502 TREE_CONSTANT(constructor
) = 1;
9504 return fold_build2_loc(loc
, COMPOUND_EXPR
, TREE_TYPE(constructor
),
9505 build3(COND_EXPR
, void_type_node
,
9506 bad_index
, crash
, NULL_TREE
),
9510 // Make an array index expression. END may be NULL.
9513 Expression::make_array_index(Expression
* array
, Expression
* start
,
9514 Expression
* end
, source_location location
)
9516 // Taking a slice of a composite literal requires moving the literal
9518 if (end
!= NULL
&& array
->is_composite_literal())
9520 array
= Expression::make_heap_composite(array
, location
);
9521 array
= Expression::make_unary(OPERATOR_MULT
, array
, location
);
9523 return new Array_index_expression(array
, start
, end
, location
);
9526 // A string index. This is used for both indexing and slicing.
9528 class String_index_expression
: public Expression
9531 String_index_expression(Expression
* string
, Expression
* start
,
9532 Expression
* end
, source_location location
)
9533 : Expression(EXPRESSION_STRING_INDEX
, location
),
9534 string_(string
), start_(start
), end_(end
)
9539 do_traverse(Traverse
*);
9545 do_determine_type(const Type_context
*);
9548 do_check_types(Gogo
*);
9553 return Expression::make_string_index(this->string_
->copy(),
9554 this->start_
->copy(),
9557 : this->end_
->copy()),
9562 do_get_tree(Translate_context
*);
9565 // The string we are getting a value from.
9566 Expression
* string_
;
9567 // The start or only index.
9569 // The end index of a slice. This may be NULL for a single index,
9570 // or it may be a nil expression for the length of the string.
9574 // String index traversal.
9577 String_index_expression::do_traverse(Traverse
* traverse
)
9579 if (Expression::traverse(&this->string_
, traverse
) == TRAVERSE_EXIT
)
9580 return TRAVERSE_EXIT
;
9581 if (Expression::traverse(&this->start_
, traverse
) == TRAVERSE_EXIT
)
9582 return TRAVERSE_EXIT
;
9583 if (this->end_
!= NULL
)
9585 if (Expression::traverse(&this->end_
, traverse
) == TRAVERSE_EXIT
)
9586 return TRAVERSE_EXIT
;
9588 return TRAVERSE_CONTINUE
;
9591 // Return the type of a string index.
9594 String_index_expression::do_type()
9596 if (this->end_
== NULL
)
9597 return Type::lookup_integer_type("uint8");
9599 return this->string_
->type();
9602 // Determine the type of a string index.
9605 String_index_expression::do_determine_type(const Type_context
*)
9607 this->string_
->determine_type_no_context();
9608 Type_context
subcontext(NULL
, true);
9609 this->start_
->determine_type(&subcontext
);
9610 if (this->end_
!= NULL
)
9611 this->end_
->determine_type(&subcontext
);
9614 // Check types of a string index.
9617 String_index_expression::do_check_types(Gogo
*)
9619 if (this->start_
->type()->integer_type() == NULL
)
9620 this->report_error(_("index must be integer"));
9621 if (this->end_
!= NULL
9622 && this->end_
->type()->integer_type() == NULL
9623 && !this->end_
->is_nil_expression())
9624 this->report_error(_("slice end must be integer"));
9627 bool sval_valid
= this->string_
->string_constant_value(&sval
);
9632 if (this->start_
->integer_constant_value(true, ival
, &dummy
))
9634 if (mpz_sgn(ival
) < 0
9635 || (sval_valid
&& mpz_cmp_ui(ival
, sval
.length()) >= 0))
9637 error_at(this->start_
->location(), "string index out of bounds");
9638 this->set_is_error();
9641 if (this->end_
!= NULL
&& !this->end_
->is_nil_expression())
9643 if (this->end_
->integer_constant_value(true, ival
, &dummy
))
9645 if (mpz_sgn(ival
) < 0
9646 || (sval_valid
&& mpz_cmp_ui(ival
, sval
.length()) > 0))
9648 error_at(this->end_
->location(), "string index out of bounds");
9649 this->set_is_error();
9656 // Get a tree for a string index.
9659 String_index_expression::do_get_tree(Translate_context
* context
)
9661 source_location loc
= this->location();
9663 tree string_tree
= this->string_
->get_tree(context
);
9664 if (string_tree
== error_mark_node
)
9665 return error_mark_node
;
9667 if (this->string_
->type()->points_to() != NULL
)
9668 string_tree
= build_fold_indirect_ref(string_tree
);
9669 if (!DECL_P(string_tree
))
9670 string_tree
= save_expr(string_tree
);
9671 tree string_type
= TREE_TYPE(string_tree
);
9673 tree length_tree
= String_type::length_tree(context
->gogo(), string_tree
);
9674 length_tree
= save_expr(length_tree
);
9675 tree length_type
= TREE_TYPE(length_tree
);
9677 tree bad_index
= boolean_false_node
;
9679 tree start_tree
= this->start_
->get_tree(context
);
9680 if (start_tree
== error_mark_node
)
9681 return error_mark_node
;
9682 if (!DECL_P(start_tree
))
9683 start_tree
= save_expr(start_tree
);
9684 if (!INTEGRAL_TYPE_P(TREE_TYPE(start_tree
)))
9685 start_tree
= convert_to_integer(length_type
, start_tree
);
9687 bad_index
= Expression::check_bounds(start_tree
, length_type
, bad_index
,
9690 start_tree
= fold_convert_loc(loc
, length_type
, start_tree
);
9692 int code
= (this->end_
== NULL
9693 ? RUNTIME_ERROR_STRING_INDEX_OUT_OF_BOUNDS
9694 : RUNTIME_ERROR_STRING_SLICE_OUT_OF_BOUNDS
);
9695 tree crash
= Gogo::runtime_error(code
, loc
);
9697 if (this->end_
== NULL
)
9699 bad_index
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
9701 fold_build2_loc(loc
, GE_EXPR
,
9703 start_tree
, length_tree
));
9705 tree bytes_tree
= String_type::bytes_tree(context
->gogo(), string_tree
);
9706 tree ptr
= fold_build2_loc(loc
, POINTER_PLUS_EXPR
, TREE_TYPE(bytes_tree
),
9708 fold_convert_loc(loc
, sizetype
, start_tree
));
9709 tree index
= build_fold_indirect_ref_loc(loc
, ptr
);
9711 return build2(COMPOUND_EXPR
, TREE_TYPE(index
),
9712 build3(COND_EXPR
, void_type_node
,
9713 bad_index
, crash
, NULL_TREE
),
9719 if (this->end_
->is_nil_expression())
9720 end_tree
= build_int_cst(length_type
, -1);
9723 end_tree
= this->end_
->get_tree(context
);
9724 if (end_tree
== error_mark_node
)
9725 return error_mark_node
;
9726 if (!DECL_P(end_tree
))
9727 end_tree
= save_expr(end_tree
);
9728 if (!INTEGRAL_TYPE_P(TREE_TYPE(end_tree
)))
9729 end_tree
= convert_to_integer(length_type
, end_tree
);
9731 bad_index
= Expression::check_bounds(end_tree
, length_type
,
9734 end_tree
= fold_convert_loc(loc
, length_type
, end_tree
);
9737 static tree strslice_fndecl
;
9738 tree ret
= Gogo::call_builtin(&strslice_fndecl
,
9740 "__go_string_slice",
9749 if (ret
== error_mark_node
)
9750 return error_mark_node
;
9751 // This will panic if the bounds are out of range for the
9753 TREE_NOTHROW(strslice_fndecl
) = 0;
9755 if (bad_index
== boolean_false_node
)
9758 return build2(COMPOUND_EXPR
, TREE_TYPE(ret
),
9759 build3(COND_EXPR
, void_type_node
,
9760 bad_index
, crash
, NULL_TREE
),
9765 // Make a string index expression. END may be NULL.
9768 Expression::make_string_index(Expression
* string
, Expression
* start
,
9769 Expression
* end
, source_location location
)
9771 return new String_index_expression(string
, start
, end
, location
);
9776 // Get the type of the map.
9779 Map_index_expression::get_map_type() const
9781 Map_type
* mt
= this->map_
->type()->deref()->map_type();
9783 gcc_assert(saw_errors());
9787 // Map index traversal.
9790 Map_index_expression::do_traverse(Traverse
* traverse
)
9792 if (Expression::traverse(&this->map_
, traverse
) == TRAVERSE_EXIT
)
9793 return TRAVERSE_EXIT
;
9794 return Expression::traverse(&this->index_
, traverse
);
9797 // Return the type of a map index.
9800 Map_index_expression::do_type()
9802 Map_type
* mt
= this->get_map_type();
9804 return Type::make_error_type();
9805 Type
* type
= mt
->val_type();
9806 // If this map index is in a tuple assignment, we actually return a
9807 // pointer to the value type. Tuple_map_assignment_statement is
9808 // responsible for handling this correctly. We need to get the type
9809 // right in case this gets assigned to a temporary variable.
9810 if (this->is_in_tuple_assignment_
)
9811 type
= Type::make_pointer_type(type
);
9815 // Fix the type of a map index.
9818 Map_index_expression::do_determine_type(const Type_context
*)
9820 this->map_
->determine_type_no_context();
9821 Map_type
* mt
= this->get_map_type();
9822 Type
* key_type
= mt
== NULL
? NULL
: mt
->key_type();
9823 Type_context
subcontext(key_type
, false);
9824 this->index_
->determine_type(&subcontext
);
9827 // Check types of a map index.
9830 Map_index_expression::do_check_types(Gogo
*)
9833 Map_type
* mt
= this->get_map_type();
9836 if (!Type::are_assignable(mt
->key_type(), this->index_
->type(), &reason
))
9839 this->report_error(_("incompatible type for map index"));
9842 error_at(this->location(), "incompatible type for map index (%s)",
9844 this->set_is_error();
9849 // Get a tree for a map index.
9852 Map_index_expression::do_get_tree(Translate_context
* context
)
9854 Map_type
* type
= this->get_map_type();
9856 return error_mark_node
;
9858 tree valptr
= this->get_value_pointer(context
, this->is_lvalue_
);
9859 if (valptr
== error_mark_node
)
9860 return error_mark_node
;
9861 valptr
= save_expr(valptr
);
9863 tree val_type_tree
= TREE_TYPE(TREE_TYPE(valptr
));
9865 if (this->is_lvalue_
)
9866 return build_fold_indirect_ref(valptr
);
9867 else if (this->is_in_tuple_assignment_
)
9869 // Tuple_map_assignment_statement is responsible for using this
9875 return fold_build3(COND_EXPR
, val_type_tree
,
9876 fold_build2(EQ_EXPR
, boolean_type_node
, valptr
,
9877 fold_convert(TREE_TYPE(valptr
),
9878 null_pointer_node
)),
9879 type
->val_type()->get_init_tree(context
->gogo(),
9881 build_fold_indirect_ref(valptr
));
9885 // Get a tree for the map index. This returns a tree which evaluates
9886 // to a pointer to a value. The pointer will be NULL if the key is
9890 Map_index_expression::get_value_pointer(Translate_context
* context
,
9893 Map_type
* type
= this->get_map_type();
9895 return error_mark_node
;
9897 tree map_tree
= this->map_
->get_tree(context
);
9898 tree index_tree
= this->index_
->get_tree(context
);
9899 index_tree
= Expression::convert_for_assignment(context
, type
->key_type(),
9900 this->index_
->type(),
9903 if (map_tree
== error_mark_node
|| index_tree
== error_mark_node
)
9904 return error_mark_node
;
9906 if (this->map_
->type()->points_to() != NULL
)
9907 map_tree
= build_fold_indirect_ref(map_tree
);
9909 // We need to pass in a pointer to the key, so stuff it into a
9911 tree tmp
= create_tmp_var(TREE_TYPE(index_tree
), get_name(index_tree
));
9912 DECL_IGNORED_P(tmp
) = 0;
9913 DECL_INITIAL(tmp
) = index_tree
;
9914 tree make_tmp
= build1(DECL_EXPR
, void_type_node
, tmp
);
9915 tree tmpref
= fold_convert(const_ptr_type_node
, build_fold_addr_expr(tmp
));
9916 TREE_ADDRESSABLE(tmp
) = 1;
9918 static tree map_index_fndecl
;
9919 tree call
= Gogo::call_builtin(&map_index_fndecl
,
9923 const_ptr_type_node
,
9924 TREE_TYPE(map_tree
),
9926 const_ptr_type_node
,
9931 : boolean_false_node
));
9932 if (call
== error_mark_node
)
9933 return error_mark_node
;
9934 // This can panic on a map of interface type if the interface holds
9935 // an uncomparable or unhashable type.
9936 TREE_NOTHROW(map_index_fndecl
) = 0;
9938 tree val_type_tree
= type
->val_type()->get_tree(context
->gogo());
9939 if (val_type_tree
== error_mark_node
)
9940 return error_mark_node
;
9941 tree ptr_val_type_tree
= build_pointer_type(val_type_tree
);
9943 return build2(COMPOUND_EXPR
, ptr_val_type_tree
,
9945 fold_convert(ptr_val_type_tree
, call
));
9948 // Make a map index expression.
9950 Map_index_expression
*
9951 Expression::make_map_index(Expression
* map
, Expression
* index
,
9952 source_location location
)
9954 return new Map_index_expression(map
, index
, location
);
9957 // Class Field_reference_expression.
9959 // Return the type of a field reference.
9962 Field_reference_expression::do_type()
9964 Type
* type
= this->expr_
->type();
9965 if (type
->is_error_type())
9967 Struct_type
* struct_type
= type
->struct_type();
9968 gcc_assert(struct_type
!= NULL
);
9969 return struct_type
->field(this->field_index_
)->type();
9972 // Check the types for a field reference.
9975 Field_reference_expression::do_check_types(Gogo
*)
9977 Type
* type
= this->expr_
->type();
9978 if (type
->is_error_type())
9980 Struct_type
* struct_type
= type
->struct_type();
9981 gcc_assert(struct_type
!= NULL
);
9982 gcc_assert(struct_type
->field(this->field_index_
) != NULL
);
9985 // Get a tree for a field reference.
9988 Field_reference_expression::do_get_tree(Translate_context
* context
)
9990 tree struct_tree
= this->expr_
->get_tree(context
);
9991 if (struct_tree
== error_mark_node
9992 || TREE_TYPE(struct_tree
) == error_mark_node
)
9993 return error_mark_node
;
9994 gcc_assert(TREE_CODE(TREE_TYPE(struct_tree
)) == RECORD_TYPE
);
9995 tree field
= TYPE_FIELDS(TREE_TYPE(struct_tree
));
9996 if (field
== NULL_TREE
)
9998 // This can happen for a type which refers to itself indirectly
9999 // and then turns out to be erroneous.
10000 gcc_assert(saw_errors());
10001 return error_mark_node
;
10003 for (unsigned int i
= this->field_index_
; i
> 0; --i
)
10005 field
= DECL_CHAIN(field
);
10006 gcc_assert(field
!= NULL_TREE
);
10008 if (TREE_TYPE(field
) == error_mark_node
)
10009 return error_mark_node
;
10010 return build3(COMPONENT_REF
, TREE_TYPE(field
), struct_tree
, field
,
10014 // Make a reference to a qualified identifier in an expression.
10016 Field_reference_expression
*
10017 Expression::make_field_reference(Expression
* expr
, unsigned int field_index
,
10018 source_location location
)
10020 return new Field_reference_expression(expr
, field_index
, location
);
10023 // Class Interface_field_reference_expression.
10025 // Return a tree for the pointer to the function to call.
10028 Interface_field_reference_expression::get_function_tree(Translate_context
*,
10031 if (this->expr_
->type()->points_to() != NULL
)
10032 expr
= build_fold_indirect_ref(expr
);
10034 tree expr_type
= TREE_TYPE(expr
);
10035 gcc_assert(TREE_CODE(expr_type
) == RECORD_TYPE
);
10037 tree field
= TYPE_FIELDS(expr_type
);
10038 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__methods") == 0);
10040 tree table
= build3(COMPONENT_REF
, TREE_TYPE(field
), expr
, field
, NULL_TREE
);
10041 gcc_assert(POINTER_TYPE_P(TREE_TYPE(table
)));
10043 table
= build_fold_indirect_ref(table
);
10044 gcc_assert(TREE_CODE(TREE_TYPE(table
)) == RECORD_TYPE
);
10046 std::string name
= Gogo::unpack_hidden_name(this->name_
);
10047 for (field
= DECL_CHAIN(TYPE_FIELDS(TREE_TYPE(table
)));
10048 field
!= NULL_TREE
;
10049 field
= DECL_CHAIN(field
))
10051 if (name
== IDENTIFIER_POINTER(DECL_NAME(field
)))
10054 gcc_assert(field
!= NULL_TREE
);
10056 return build3(COMPONENT_REF
, TREE_TYPE(field
), table
, field
, NULL_TREE
);
10059 // Return a tree for the first argument to pass to the interface
10063 Interface_field_reference_expression::get_underlying_object_tree(
10064 Translate_context
*,
10067 if (this->expr_
->type()->points_to() != NULL
)
10068 expr
= build_fold_indirect_ref(expr
);
10070 tree expr_type
= TREE_TYPE(expr
);
10071 gcc_assert(TREE_CODE(expr_type
) == RECORD_TYPE
);
10073 tree field
= DECL_CHAIN(TYPE_FIELDS(expr_type
));
10074 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__object") == 0);
10076 return build3(COMPONENT_REF
, TREE_TYPE(field
), expr
, field
, NULL_TREE
);
10082 Interface_field_reference_expression::do_traverse(Traverse
* traverse
)
10084 return Expression::traverse(&this->expr_
, traverse
);
10087 // Return the type of an interface field reference.
10090 Interface_field_reference_expression::do_type()
10092 Type
* expr_type
= this->expr_
->type();
10094 Type
* points_to
= expr_type
->points_to();
10095 if (points_to
!= NULL
)
10096 expr_type
= points_to
;
10098 Interface_type
* interface_type
= expr_type
->interface_type();
10099 if (interface_type
== NULL
)
10100 return Type::make_error_type();
10102 const Typed_identifier
* method
= interface_type
->find_method(this->name_
);
10103 if (method
== NULL
)
10104 return Type::make_error_type();
10106 return method
->type();
10109 // Determine types.
10112 Interface_field_reference_expression::do_determine_type(const Type_context
*)
10114 this->expr_
->determine_type_no_context();
10117 // Check the types for an interface field reference.
10120 Interface_field_reference_expression::do_check_types(Gogo
*)
10122 Type
* type
= this->expr_
->type();
10124 Type
* points_to
= type
->points_to();
10125 if (points_to
!= NULL
)
10128 Interface_type
* interface_type
= type
->interface_type();
10129 if (interface_type
== NULL
)
10130 this->report_error(_("expected interface or pointer to interface"));
10133 const Typed_identifier
* method
=
10134 interface_type
->find_method(this->name_
);
10135 if (method
== NULL
)
10137 error_at(this->location(), "method %qs not in interface",
10138 Gogo::message_name(this->name_
).c_str());
10139 this->set_is_error();
10144 // Get a tree for a reference to a field in an interface. There is no
10145 // standard tree type representation for this: it's a function
10146 // attached to its first argument, like a Bound_method_expression.
10147 // The only places it may currently be used are in a Call_expression
10148 // or a Go_statement, which will take it apart directly. So this has
10149 // nothing to do at present.
10152 Interface_field_reference_expression::do_get_tree(Translate_context
*)
10157 // Make a reference to a field in an interface.
10160 Expression::make_interface_field_reference(Expression
* expr
,
10161 const std::string
& field
,
10162 source_location location
)
10164 return new Interface_field_reference_expression(expr
, field
, location
);
10167 // A general selector. This is a Parser_expression for LEFT.NAME. It
10168 // is lowered after we know the type of the left hand side.
10170 class Selector_expression
: public Parser_expression
10173 Selector_expression(Expression
* left
, const std::string
& name
,
10174 source_location location
)
10175 : Parser_expression(EXPRESSION_SELECTOR
, location
),
10176 left_(left
), name_(name
)
10181 do_traverse(Traverse
* traverse
)
10182 { return Expression::traverse(&this->left_
, traverse
); }
10185 do_lower(Gogo
*, Named_object
*, int);
10190 return new Selector_expression(this->left_
->copy(), this->name_
,
10196 lower_method_expression(Gogo
*);
10198 // The expression on the left hand side.
10200 // The name on the right hand side.
10204 // Lower a selector expression once we know the real type of the left
10208 Selector_expression::do_lower(Gogo
* gogo
, Named_object
*, int)
10210 Expression
* left
= this->left_
;
10211 if (left
->is_type_expression())
10212 return this->lower_method_expression(gogo
);
10213 return Type::bind_field_or_method(gogo
, left
->type(), left
, this->name_
,
10217 // Lower a method expression T.M or (*T).M. We turn this into a
10218 // function literal.
10221 Selector_expression::lower_method_expression(Gogo
* gogo
)
10223 source_location location
= this->location();
10224 Type
* type
= this->left_
->type();
10225 const std::string
& name(this->name_
);
10228 if (type
->points_to() == NULL
)
10229 is_pointer
= false;
10233 type
= type
->points_to();
10235 Named_type
* nt
= type
->named_type();
10239 ("method expression requires named type or "
10240 "pointer to named type"));
10241 return Expression::make_error(location
);
10245 Method
* method
= nt
->method_function(name
, &is_ambiguous
);
10246 if (method
== NULL
)
10249 error_at(location
, "type %<%s%> has no method %<%s%>",
10250 nt
->message_name().c_str(),
10251 Gogo::message_name(name
).c_str());
10253 error_at(location
, "method %<%s%> is ambiguous in type %<%s%>",
10254 Gogo::message_name(name
).c_str(),
10255 nt
->message_name().c_str());
10256 return Expression::make_error(location
);
10259 if (!is_pointer
&& !method
->is_value_method())
10261 error_at(location
, "method requires pointer (use %<(*%s).%s)%>",
10262 nt
->message_name().c_str(),
10263 Gogo::message_name(name
).c_str());
10264 return Expression::make_error(location
);
10267 // Build a new function type in which the receiver becomes the first
10269 Function_type
* method_type
= method
->type();
10270 gcc_assert(method_type
->is_method());
10272 const char* const receiver_name
= "$this";
10273 Typed_identifier_list
* parameters
= new Typed_identifier_list();
10274 parameters
->push_back(Typed_identifier(receiver_name
, this->left_
->type(),
10277 const Typed_identifier_list
* method_parameters
= method_type
->parameters();
10278 if (method_parameters
!= NULL
)
10280 for (Typed_identifier_list::const_iterator p
= method_parameters
->begin();
10281 p
!= method_parameters
->end();
10283 parameters
->push_back(*p
);
10286 const Typed_identifier_list
* method_results
= method_type
->results();
10287 Typed_identifier_list
* results
;
10288 if (method_results
== NULL
)
10292 results
= new Typed_identifier_list();
10293 for (Typed_identifier_list::const_iterator p
= method_results
->begin();
10294 p
!= method_results
->end();
10296 results
->push_back(*p
);
10299 Function_type
* fntype
= Type::make_function_type(NULL
, parameters
, results
,
10301 if (method_type
->is_varargs())
10302 fntype
->set_is_varargs();
10304 // We generate methods which always takes a pointer to the receiver
10305 // as their first argument. If this is for a pointer type, we can
10306 // simply reuse the existing function. We use an internal hack to
10307 // get the right type.
10311 Named_object
* mno
= (method
->needs_stub_method()
10312 ? method
->stub_object()
10313 : method
->named_object());
10314 Expression
* f
= Expression::make_func_reference(mno
, NULL
, location
);
10315 f
= Expression::make_cast(fntype
, f
, location
);
10316 Type_conversion_expression
* tce
=
10317 static_cast<Type_conversion_expression
*>(f
);
10318 tce
->set_may_convert_function_types();
10322 Named_object
* no
= gogo
->start_function(Gogo::thunk_name(), fntype
, false,
10325 Named_object
* vno
= gogo
->lookup(receiver_name
, NULL
);
10326 gcc_assert(vno
!= NULL
);
10327 Expression
* ve
= Expression::make_var_reference(vno
, location
);
10328 Expression
* bm
= Type::bind_field_or_method(gogo
, nt
, ve
, name
, location
);
10329 gcc_assert(bm
!= NULL
&& !bm
->is_error_expression());
10331 Expression_list
* args
;
10332 if (method_parameters
== NULL
)
10336 args
= new Expression_list();
10337 for (Typed_identifier_list::const_iterator p
= method_parameters
->begin();
10338 p
!= method_parameters
->end();
10341 vno
= gogo
->lookup(p
->name(), NULL
);
10342 gcc_assert(vno
!= NULL
);
10343 args
->push_back(Expression::make_var_reference(vno
, location
));
10347 Call_expression
* call
= Expression::make_call(bm
, args
,
10348 method_type
->is_varargs(),
10351 size_t count
= call
->result_count();
10354 s
= Statement::make_statement(call
);
10357 Expression_list
* retvals
= new Expression_list();
10359 retvals
->push_back(call
);
10362 for (size_t i
= 0; i
< count
; ++i
)
10363 retvals
->push_back(Expression::make_call_result(call
, i
));
10365 s
= Statement::make_return_statement(no
->func_value()->type()->results(),
10366 retvals
, location
);
10368 gogo
->add_statement(s
);
10370 gogo
->finish_function(location
);
10372 return Expression::make_func_reference(no
, NULL
, location
);
10375 // Make a selector expression.
10378 Expression::make_selector(Expression
* left
, const std::string
& name
,
10379 source_location location
)
10381 return new Selector_expression(left
, name
, location
);
10384 // Implement the builtin function new.
10386 class Allocation_expression
: public Expression
10389 Allocation_expression(Type
* type
, source_location location
)
10390 : Expression(EXPRESSION_ALLOCATION
, location
),
10396 do_traverse(Traverse
* traverse
)
10397 { return Type::traverse(this->type_
, traverse
); }
10401 { return Type::make_pointer_type(this->type_
); }
10404 do_determine_type(const Type_context
*)
10408 do_check_types(Gogo
*);
10412 { return new Allocation_expression(this->type_
, this->location()); }
10415 do_get_tree(Translate_context
*);
10418 // The type we are allocating.
10422 // Check the type of an allocation expression.
10425 Allocation_expression::do_check_types(Gogo
*)
10427 if (this->type_
->function_type() != NULL
)
10428 this->report_error(_("invalid new of function type"));
10431 // Return a tree for an allocation expression.
10434 Allocation_expression::do_get_tree(Translate_context
* context
)
10436 tree type_tree
= this->type_
->get_tree(context
->gogo());
10437 if (type_tree
== error_mark_node
)
10438 return error_mark_node
;
10439 tree size_tree
= TYPE_SIZE_UNIT(type_tree
);
10440 tree space
= context
->gogo()->allocate_memory(this->type_
, size_tree
,
10442 if (space
== error_mark_node
)
10443 return error_mark_node
;
10444 return fold_convert(build_pointer_type(type_tree
), space
);
10447 // Make an allocation expression.
10450 Expression::make_allocation(Type
* type
, source_location location
)
10452 return new Allocation_expression(type
, location
);
10455 // Implement the builtin function make.
10457 class Make_expression
: public Expression
10460 Make_expression(Type
* type
, Expression_list
* args
, source_location location
)
10461 : Expression(EXPRESSION_MAKE
, location
),
10462 type_(type
), args_(args
)
10467 do_traverse(Traverse
* traverse
);
10471 { return this->type_
; }
10474 do_determine_type(const Type_context
*);
10477 do_check_types(Gogo
*);
10482 return new Make_expression(this->type_
, this->args_
->copy(),
10487 do_get_tree(Translate_context
*);
10490 // The type we are making.
10492 // The arguments to pass to the make routine.
10493 Expression_list
* args_
;
10499 Make_expression::do_traverse(Traverse
* traverse
)
10501 if (this->args_
!= NULL
10502 && this->args_
->traverse(traverse
) == TRAVERSE_EXIT
)
10503 return TRAVERSE_EXIT
;
10504 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10505 return TRAVERSE_EXIT
;
10506 return TRAVERSE_CONTINUE
;
10509 // Set types of arguments.
10512 Make_expression::do_determine_type(const Type_context
*)
10514 if (this->args_
!= NULL
)
10516 Type_context
context(Type::lookup_integer_type("int"), false);
10517 for (Expression_list::const_iterator pe
= this->args_
->begin();
10518 pe
!= this->args_
->end();
10520 (*pe
)->determine_type(&context
);
10524 // Check types for a make expression.
10527 Make_expression::do_check_types(Gogo
*)
10529 if (this->type_
->channel_type() == NULL
10530 && this->type_
->map_type() == NULL
10531 && (this->type_
->array_type() == NULL
10532 || this->type_
->array_type()->length() != NULL
))
10533 this->report_error(_("invalid type for make function"));
10534 else if (!this->type_
->check_make_expression(this->args_
, this->location()))
10535 this->set_is_error();
10538 // Return a tree for a make expression.
10541 Make_expression::do_get_tree(Translate_context
* context
)
10543 return this->type_
->make_expression_tree(context
, this->args_
,
10547 // Make a make expression.
10550 Expression::make_make(Type
* type
, Expression_list
* args
,
10551 source_location location
)
10553 return new Make_expression(type
, args
, location
);
10556 // Construct a struct.
10558 class Struct_construction_expression
: public Expression
10561 Struct_construction_expression(Type
* type
, Expression_list
* vals
,
10562 source_location location
)
10563 : Expression(EXPRESSION_STRUCT_CONSTRUCTION
, location
),
10564 type_(type
), vals_(vals
)
10567 // Return whether this is a constant initializer.
10569 is_constant_struct() const;
10573 do_traverse(Traverse
* traverse
);
10577 { return this->type_
; }
10580 do_determine_type(const Type_context
*);
10583 do_check_types(Gogo
*);
10588 return new Struct_construction_expression(this->type_
, this->vals_
->copy(),
10593 do_is_addressable() const
10597 do_get_tree(Translate_context
*);
10600 do_export(Export
*) const;
10603 // The type of the struct to construct.
10605 // The list of values, in order of the fields in the struct. A NULL
10606 // entry means that the field should be zero-initialized.
10607 Expression_list
* vals_
;
10613 Struct_construction_expression::do_traverse(Traverse
* traverse
)
10615 if (this->vals_
!= NULL
10616 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
10617 return TRAVERSE_EXIT
;
10618 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10619 return TRAVERSE_EXIT
;
10620 return TRAVERSE_CONTINUE
;
10623 // Return whether this is a constant initializer.
10626 Struct_construction_expression::is_constant_struct() const
10628 if (this->vals_
== NULL
)
10630 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10631 pv
!= this->vals_
->end();
10635 && !(*pv
)->is_constant()
10636 && (!(*pv
)->is_composite_literal()
10637 || (*pv
)->is_nonconstant_composite_literal()))
10641 const Struct_field_list
* fields
= this->type_
->struct_type()->fields();
10642 for (Struct_field_list::const_iterator pf
= fields
->begin();
10643 pf
!= fields
->end();
10646 // There are no constant constructors for interfaces.
10647 if (pf
->type()->interface_type() != NULL
)
10654 // Final type determination.
10657 Struct_construction_expression::do_determine_type(const Type_context
*)
10659 if (this->vals_
== NULL
)
10661 const Struct_field_list
* fields
= this->type_
->struct_type()->fields();
10662 Expression_list::const_iterator pv
= this->vals_
->begin();
10663 for (Struct_field_list::const_iterator pf
= fields
->begin();
10664 pf
!= fields
->end();
10667 if (pv
== this->vals_
->end())
10671 Type_context
subcontext(pf
->type(), false);
10672 (*pv
)->determine_type(&subcontext
);
10675 // Extra values are an error we will report elsewhere; we still want
10676 // to determine the type to avoid knockon errors.
10677 for (; pv
!= this->vals_
->end(); ++pv
)
10678 (*pv
)->determine_type_no_context();
10684 Struct_construction_expression::do_check_types(Gogo
*)
10686 if (this->vals_
== NULL
)
10689 Struct_type
* st
= this->type_
->struct_type();
10690 if (this->vals_
->size() > st
->field_count())
10692 this->report_error(_("too many expressions for struct"));
10696 const Struct_field_list
* fields
= st
->fields();
10697 Expression_list::const_iterator pv
= this->vals_
->begin();
10699 for (Struct_field_list::const_iterator pf
= fields
->begin();
10700 pf
!= fields
->end();
10703 if (pv
== this->vals_
->end())
10705 this->report_error(_("too few expressions for struct"));
10712 std::string reason
;
10713 if (!Type::are_assignable(pf
->type(), (*pv
)->type(), &reason
))
10715 if (reason
.empty())
10716 error_at((*pv
)->location(),
10717 "incompatible type for field %d in struct construction",
10720 error_at((*pv
)->location(),
10721 ("incompatible type for field %d in "
10722 "struct construction (%s)"),
10723 i
+ 1, reason
.c_str());
10724 this->set_is_error();
10727 gcc_assert(pv
== this->vals_
->end());
10730 // Return a tree for constructing a struct.
10733 Struct_construction_expression::do_get_tree(Translate_context
* context
)
10735 Gogo
* gogo
= context
->gogo();
10737 if (this->vals_
== NULL
)
10738 return this->type_
->get_init_tree(gogo
, false);
10740 tree type_tree
= this->type_
->get_tree(gogo
);
10741 if (type_tree
== error_mark_node
)
10742 return error_mark_node
;
10743 gcc_assert(TREE_CODE(type_tree
) == RECORD_TYPE
);
10745 bool is_constant
= true;
10746 const Struct_field_list
* fields
= this->type_
->struct_type()->fields();
10747 VEC(constructor_elt
,gc
)* elts
= VEC_alloc(constructor_elt
, gc
,
10749 Struct_field_list::const_iterator pf
= fields
->begin();
10750 Expression_list::const_iterator pv
= this->vals_
->begin();
10751 for (tree field
= TYPE_FIELDS(type_tree
);
10752 field
!= NULL_TREE
;
10753 field
= DECL_CHAIN(field
), ++pf
)
10755 gcc_assert(pf
!= fields
->end());
10758 if (pv
== this->vals_
->end())
10759 val
= pf
->type()->get_init_tree(gogo
, false);
10760 else if (*pv
== NULL
)
10762 val
= pf
->type()->get_init_tree(gogo
, false);
10767 val
= Expression::convert_for_assignment(context
, pf
->type(),
10769 (*pv
)->get_tree(context
),
10774 if (val
== error_mark_node
|| TREE_TYPE(val
) == error_mark_node
)
10775 return error_mark_node
;
10777 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, elts
, NULL
);
10778 elt
->index
= field
;
10780 if (!TREE_CONSTANT(val
))
10781 is_constant
= false;
10783 gcc_assert(pf
== fields
->end());
10785 tree ret
= build_constructor(type_tree
, elts
);
10787 TREE_CONSTANT(ret
) = 1;
10791 // Export a struct construction.
10794 Struct_construction_expression::do_export(Export
* exp
) const
10796 exp
->write_c_string("convert(");
10797 exp
->write_type(this->type_
);
10798 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10799 pv
!= this->vals_
->end();
10802 exp
->write_c_string(", ");
10804 (*pv
)->export_expression(exp
);
10806 exp
->write_c_string(")");
10809 // Make a struct composite literal. This used by the thunk code.
10812 Expression::make_struct_composite_literal(Type
* type
, Expression_list
* vals
,
10813 source_location location
)
10815 gcc_assert(type
->struct_type() != NULL
);
10816 return new Struct_construction_expression(type
, vals
, location
);
10819 // Construct an array. This class is not used directly; instead we
10820 // use the child classes, Fixed_array_construction_expression and
10821 // Open_array_construction_expression.
10823 class Array_construction_expression
: public Expression
10826 Array_construction_expression(Expression_classification classification
,
10827 Type
* type
, Expression_list
* vals
,
10828 source_location location
)
10829 : Expression(classification
, location
),
10830 type_(type
), vals_(vals
)
10834 // Return whether this is a constant initializer.
10836 is_constant_array() const;
10838 // Return the number of elements.
10840 element_count() const
10841 { return this->vals_
== NULL
? 0 : this->vals_
->size(); }
10845 do_traverse(Traverse
* traverse
);
10849 { return this->type_
; }
10852 do_determine_type(const Type_context
*);
10855 do_check_types(Gogo
*);
10858 do_is_addressable() const
10862 do_export(Export
*) const;
10864 // The list of values.
10867 { return this->vals_
; }
10869 // Get a constructor tree for the array values.
10871 get_constructor_tree(Translate_context
* context
, tree type_tree
);
10874 // The type of the array to construct.
10876 // The list of values.
10877 Expression_list
* vals_
;
10883 Array_construction_expression::do_traverse(Traverse
* traverse
)
10885 if (this->vals_
!= NULL
10886 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
10887 return TRAVERSE_EXIT
;
10888 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10889 return TRAVERSE_EXIT
;
10890 return TRAVERSE_CONTINUE
;
10893 // Return whether this is a constant initializer.
10896 Array_construction_expression::is_constant_array() const
10898 if (this->vals_
== NULL
)
10901 // There are no constant constructors for interfaces.
10902 if (this->type_
->array_type()->element_type()->interface_type() != NULL
)
10905 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10906 pv
!= this->vals_
->end();
10910 && !(*pv
)->is_constant()
10911 && (!(*pv
)->is_composite_literal()
10912 || (*pv
)->is_nonconstant_composite_literal()))
10918 // Final type determination.
10921 Array_construction_expression::do_determine_type(const Type_context
*)
10923 if (this->vals_
== NULL
)
10925 Type_context
subcontext(this->type_
->array_type()->element_type(), false);
10926 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10927 pv
!= this->vals_
->end();
10931 (*pv
)->determine_type(&subcontext
);
10938 Array_construction_expression::do_check_types(Gogo
*)
10940 if (this->vals_
== NULL
)
10943 Array_type
* at
= this->type_
->array_type();
10945 Type
* element_type
= at
->element_type();
10946 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10947 pv
!= this->vals_
->end();
10951 && !Type::are_assignable(element_type
, (*pv
)->type(), NULL
))
10953 error_at((*pv
)->location(),
10954 "incompatible type for element %d in composite literal",
10956 this->set_is_error();
10960 Expression
* length
= at
->length();
10961 if (length
!= NULL
)
10966 if (at
->length()->integer_constant_value(true, val
, &type
))
10968 if (this->vals_
->size() > mpz_get_ui(val
))
10969 this->report_error(_("too many elements in composite literal"));
10975 // Get a constructor tree for the array values.
10978 Array_construction_expression::get_constructor_tree(Translate_context
* context
,
10981 VEC(constructor_elt
,gc
)* values
= VEC_alloc(constructor_elt
, gc
,
10982 (this->vals_
== NULL
10984 : this->vals_
->size()));
10985 Type
* element_type
= this->type_
->array_type()->element_type();
10986 bool is_constant
= true;
10987 if (this->vals_
!= NULL
)
10990 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10991 pv
!= this->vals_
->end();
10994 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, values
, NULL
);
10995 elt
->index
= size_int(i
);
10997 elt
->value
= element_type
->get_init_tree(context
->gogo(), false);
11000 tree value_tree
= (*pv
)->get_tree(context
);
11001 elt
->value
= Expression::convert_for_assignment(context
,
11007 if (elt
->value
== error_mark_node
)
11008 return error_mark_node
;
11009 if (!TREE_CONSTANT(elt
->value
))
11010 is_constant
= false;
11014 tree ret
= build_constructor(type_tree
, values
);
11016 TREE_CONSTANT(ret
) = 1;
11020 // Export an array construction.
11023 Array_construction_expression::do_export(Export
* exp
) const
11025 exp
->write_c_string("convert(");
11026 exp
->write_type(this->type_
);
11027 if (this->vals_
!= NULL
)
11029 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11030 pv
!= this->vals_
->end();
11033 exp
->write_c_string(", ");
11035 (*pv
)->export_expression(exp
);
11038 exp
->write_c_string(")");
11041 // Construct a fixed array.
11043 class Fixed_array_construction_expression
:
11044 public Array_construction_expression
11047 Fixed_array_construction_expression(Type
* type
, Expression_list
* vals
,
11048 source_location location
)
11049 : Array_construction_expression(EXPRESSION_FIXED_ARRAY_CONSTRUCTION
,
11050 type
, vals
, location
)
11052 gcc_assert(type
->array_type() != NULL
11053 && type
->array_type()->length() != NULL
);
11060 return new Fixed_array_construction_expression(this->type(),
11061 (this->vals() == NULL
11063 : this->vals()->copy()),
11068 do_get_tree(Translate_context
*);
11071 // Return a tree for constructing a fixed array.
11074 Fixed_array_construction_expression::do_get_tree(Translate_context
* context
)
11076 return this->get_constructor_tree(context
,
11077 this->type()->get_tree(context
->gogo()));
11080 // Construct an open array.
11082 class Open_array_construction_expression
: public Array_construction_expression
11085 Open_array_construction_expression(Type
* type
, Expression_list
* vals
,
11086 source_location location
)
11087 : Array_construction_expression(EXPRESSION_OPEN_ARRAY_CONSTRUCTION
,
11088 type
, vals
, location
)
11090 gcc_assert(type
->array_type() != NULL
11091 && type
->array_type()->length() == NULL
);
11095 // Note that taking the address of an open array literal is invalid.
11100 return new Open_array_construction_expression(this->type(),
11101 (this->vals() == NULL
11103 : this->vals()->copy()),
11108 do_get_tree(Translate_context
*);
11111 // Return a tree for constructing an open array.
11114 Open_array_construction_expression::do_get_tree(Translate_context
* context
)
11116 Array_type
* array_type
= this->type()->array_type();
11117 if (array_type
== NULL
)
11119 gcc_assert(this->type()->is_error_type());
11120 return error_mark_node
;
11123 Type
* element_type
= array_type
->element_type();
11124 tree element_type_tree
= element_type
->get_tree(context
->gogo());
11125 if (element_type_tree
== error_mark_node
)
11126 return error_mark_node
;
11130 if (this->vals() == NULL
|| this->vals()->empty())
11132 // We need to create a unique value.
11133 tree max
= size_int(0);
11134 tree constructor_type
= build_array_type(element_type_tree
,
11135 build_index_type(max
));
11136 if (constructor_type
== error_mark_node
)
11137 return error_mark_node
;
11138 VEC(constructor_elt
,gc
)* vec
= VEC_alloc(constructor_elt
, gc
, 1);
11139 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, vec
, NULL
);
11140 elt
->index
= size_int(0);
11141 elt
->value
= element_type
->get_init_tree(context
->gogo(), false);
11142 values
= build_constructor(constructor_type
, vec
);
11143 if (TREE_CONSTANT(elt
->value
))
11144 TREE_CONSTANT(values
) = 1;
11145 length_tree
= size_int(0);
11149 tree max
= size_int(this->vals()->size() - 1);
11150 tree constructor_type
= build_array_type(element_type_tree
,
11151 build_index_type(max
));
11152 if (constructor_type
== error_mark_node
)
11153 return error_mark_node
;
11154 values
= this->get_constructor_tree(context
, constructor_type
);
11155 length_tree
= size_int(this->vals()->size());
11158 if (values
== error_mark_node
)
11159 return error_mark_node
;
11161 bool is_constant_initializer
= TREE_CONSTANT(values
);
11163 // We have to copy the initial values into heap memory if we are in
11164 // a function or if the values are not constants. We also have to
11165 // copy them if they may contain pointers in a non-constant context,
11166 // as otherwise the garbage collector won't see them.
11167 bool copy_to_heap
= (context
->function() != NULL
11168 || !is_constant_initializer
11169 || (element_type
->has_pointer()
11170 && !context
->is_const()));
11172 if (is_constant_initializer
)
11174 tree tmp
= build_decl(this->location(), VAR_DECL
,
11175 create_tmp_var_name("C"), TREE_TYPE(values
));
11176 DECL_EXTERNAL(tmp
) = 0;
11177 TREE_PUBLIC(tmp
) = 0;
11178 TREE_STATIC(tmp
) = 1;
11179 DECL_ARTIFICIAL(tmp
) = 1;
11182 // If we are not copying the value to the heap, we will only
11183 // initialize the value once, so we can use this directly
11184 // rather than copying it. In that case we can't make it
11185 // read-only, because the program is permitted to change it.
11186 TREE_READONLY(tmp
) = 1;
11187 TREE_CONSTANT(tmp
) = 1;
11189 DECL_INITIAL(tmp
) = values
;
11190 rest_of_decl_compilation(tmp
, 1, 0);
11198 // the initializer will only run once.
11199 space
= build_fold_addr_expr(values
);
11204 tree memsize
= TYPE_SIZE_UNIT(TREE_TYPE(values
));
11205 space
= context
->gogo()->allocate_memory(element_type
, memsize
,
11207 space
= save_expr(space
);
11209 tree s
= fold_convert(build_pointer_type(TREE_TYPE(values
)), space
);
11210 tree ref
= build_fold_indirect_ref_loc(this->location(), s
);
11211 TREE_THIS_NOTRAP(ref
) = 1;
11212 set
= build2(MODIFY_EXPR
, void_type_node
, ref
, values
);
11215 // Build a constructor for the open array.
11217 tree type_tree
= this->type()->get_tree(context
->gogo());
11218 if (type_tree
== error_mark_node
)
11219 return error_mark_node
;
11220 gcc_assert(TREE_CODE(type_tree
) == RECORD_TYPE
);
11222 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 3);
11224 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
11225 tree field
= TYPE_FIELDS(type_tree
);
11226 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__values") == 0);
11227 elt
->index
= field
;
11228 elt
->value
= fold_convert(TREE_TYPE(field
), space
);
11230 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
11231 field
= DECL_CHAIN(field
);
11232 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__count") == 0);
11233 elt
->index
= field
;
11234 elt
->value
= fold_convert(TREE_TYPE(field
), length_tree
);
11236 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
11237 field
= DECL_CHAIN(field
);
11238 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),"__capacity") == 0);
11239 elt
->index
= field
;
11240 elt
->value
= fold_convert(TREE_TYPE(field
), length_tree
);
11242 tree constructor
= build_constructor(type_tree
, init
);
11243 if (constructor
== error_mark_node
)
11244 return error_mark_node
;
11246 TREE_CONSTANT(constructor
) = 1;
11248 if (set
== NULL_TREE
)
11249 return constructor
;
11251 return build2(COMPOUND_EXPR
, type_tree
, set
, constructor
);
11254 // Make a slice composite literal. This is used by the type
11255 // descriptor code.
11258 Expression::make_slice_composite_literal(Type
* type
, Expression_list
* vals
,
11259 source_location location
)
11261 gcc_assert(type
->is_open_array_type());
11262 return new Open_array_construction_expression(type
, vals
, location
);
11265 // Construct a map.
11267 class Map_construction_expression
: public Expression
11270 Map_construction_expression(Type
* type
, Expression_list
* vals
,
11271 source_location location
)
11272 : Expression(EXPRESSION_MAP_CONSTRUCTION
, location
),
11273 type_(type
), vals_(vals
)
11274 { gcc_assert(vals
== NULL
|| vals
->size() % 2 == 0); }
11278 do_traverse(Traverse
* traverse
);
11282 { return this->type_
; }
11285 do_determine_type(const Type_context
*);
11288 do_check_types(Gogo
*);
11293 return new Map_construction_expression(this->type_
, this->vals_
->copy(),
11298 do_get_tree(Translate_context
*);
11301 do_export(Export
*) const;
11304 // The type of the map to construct.
11306 // The list of values.
11307 Expression_list
* vals_
;
11313 Map_construction_expression::do_traverse(Traverse
* traverse
)
11315 if (this->vals_
!= NULL
11316 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
11317 return TRAVERSE_EXIT
;
11318 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
11319 return TRAVERSE_EXIT
;
11320 return TRAVERSE_CONTINUE
;
11323 // Final type determination.
11326 Map_construction_expression::do_determine_type(const Type_context
*)
11328 if (this->vals_
== NULL
)
11331 Map_type
* mt
= this->type_
->map_type();
11332 Type_context
key_context(mt
->key_type(), false);
11333 Type_context
val_context(mt
->val_type(), false);
11334 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11335 pv
!= this->vals_
->end();
11338 (*pv
)->determine_type(&key_context
);
11340 (*pv
)->determine_type(&val_context
);
11347 Map_construction_expression::do_check_types(Gogo
*)
11349 if (this->vals_
== NULL
)
11352 Map_type
* mt
= this->type_
->map_type();
11354 Type
* key_type
= mt
->key_type();
11355 Type
* val_type
= mt
->val_type();
11356 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11357 pv
!= this->vals_
->end();
11360 if (!Type::are_assignable(key_type
, (*pv
)->type(), NULL
))
11362 error_at((*pv
)->location(),
11363 "incompatible type for element %d key in map construction",
11365 this->set_is_error();
11368 if (!Type::are_assignable(val_type
, (*pv
)->type(), NULL
))
11370 error_at((*pv
)->location(),
11371 ("incompatible type for element %d value "
11372 "in map construction"),
11374 this->set_is_error();
11379 // Return a tree for constructing a map.
11382 Map_construction_expression::do_get_tree(Translate_context
* context
)
11384 Gogo
* gogo
= context
->gogo();
11385 source_location loc
= this->location();
11387 Map_type
* mt
= this->type_
->map_type();
11389 // Build a struct to hold the key and value.
11390 tree struct_type
= make_node(RECORD_TYPE
);
11392 Type
* key_type
= mt
->key_type();
11393 tree id
= get_identifier("__key");
11394 tree key_type_tree
= key_type
->get_tree(gogo
);
11395 if (key_type_tree
== error_mark_node
)
11396 return error_mark_node
;
11397 tree key_field
= build_decl(loc
, FIELD_DECL
, id
, key_type_tree
);
11398 DECL_CONTEXT(key_field
) = struct_type
;
11399 TYPE_FIELDS(struct_type
) = key_field
;
11401 Type
* val_type
= mt
->val_type();
11402 id
= get_identifier("__val");
11403 tree val_type_tree
= val_type
->get_tree(gogo
);
11404 if (val_type_tree
== error_mark_node
)
11405 return error_mark_node
;
11406 tree val_field
= build_decl(loc
, FIELD_DECL
, id
, val_type_tree
);
11407 DECL_CONTEXT(val_field
) = struct_type
;
11408 DECL_CHAIN(key_field
) = val_field
;
11410 layout_type(struct_type
);
11412 bool is_constant
= true;
11417 if (this->vals_
== NULL
|| this->vals_
->empty())
11419 valaddr
= null_pointer_node
;
11420 make_tmp
= NULL_TREE
;
11424 VEC(constructor_elt
,gc
)* values
= VEC_alloc(constructor_elt
, gc
,
11425 this->vals_
->size() / 2);
11427 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11428 pv
!= this->vals_
->end();
11431 bool one_is_constant
= true;
11433 VEC(constructor_elt
,gc
)* one
= VEC_alloc(constructor_elt
, gc
, 2);
11435 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, one
, NULL
);
11436 elt
->index
= key_field
;
11437 tree val_tree
= (*pv
)->get_tree(context
);
11438 elt
->value
= Expression::convert_for_assignment(context
, key_type
,
11441 if (elt
->value
== error_mark_node
)
11442 return error_mark_node
;
11443 if (!TREE_CONSTANT(elt
->value
))
11444 one_is_constant
= false;
11448 elt
= VEC_quick_push(constructor_elt
, one
, NULL
);
11449 elt
->index
= val_field
;
11450 val_tree
= (*pv
)->get_tree(context
);
11451 elt
->value
= Expression::convert_for_assignment(context
, val_type
,
11454 if (elt
->value
== error_mark_node
)
11455 return error_mark_node
;
11456 if (!TREE_CONSTANT(elt
->value
))
11457 one_is_constant
= false;
11459 elt
= VEC_quick_push(constructor_elt
, values
, NULL
);
11460 elt
->index
= size_int(i
);
11461 elt
->value
= build_constructor(struct_type
, one
);
11462 if (one_is_constant
)
11463 TREE_CONSTANT(elt
->value
) = 1;
11465 is_constant
= false;
11468 tree index_type
= build_index_type(size_int(i
- 1));
11469 tree array_type
= build_array_type(struct_type
, index_type
);
11470 tree init
= build_constructor(array_type
, values
);
11472 TREE_CONSTANT(init
) = 1;
11474 if (current_function_decl
!= NULL
)
11476 tmp
= create_tmp_var(array_type
, get_name(array_type
));
11477 DECL_INITIAL(tmp
) = init
;
11478 make_tmp
= fold_build1_loc(loc
, DECL_EXPR
, void_type_node
, tmp
);
11479 TREE_ADDRESSABLE(tmp
) = 1;
11483 tmp
= build_decl(loc
, VAR_DECL
, create_tmp_var_name("M"), array_type
);
11484 DECL_EXTERNAL(tmp
) = 0;
11485 TREE_PUBLIC(tmp
) = 0;
11486 TREE_STATIC(tmp
) = 1;
11487 DECL_ARTIFICIAL(tmp
) = 1;
11488 if (!TREE_CONSTANT(init
))
11489 make_tmp
= fold_build2_loc(loc
, INIT_EXPR
, void_type_node
, tmp
,
11493 TREE_READONLY(tmp
) = 1;
11494 TREE_CONSTANT(tmp
) = 1;
11495 DECL_INITIAL(tmp
) = init
;
11496 make_tmp
= NULL_TREE
;
11498 rest_of_decl_compilation(tmp
, 1, 0);
11501 valaddr
= build_fold_addr_expr(tmp
);
11504 tree descriptor
= gogo
->map_descriptor(mt
);
11506 tree type_tree
= this->type_
->get_tree(gogo
);
11507 if (type_tree
== error_mark_node
)
11508 return error_mark_node
;
11510 static tree construct_map_fndecl
;
11511 tree call
= Gogo::call_builtin(&construct_map_fndecl
,
11513 "__go_construct_map",
11516 TREE_TYPE(descriptor
),
11521 TYPE_SIZE_UNIT(struct_type
),
11523 byte_position(val_field
),
11525 TYPE_SIZE_UNIT(TREE_TYPE(val_field
)),
11526 const_ptr_type_node
,
11527 fold_convert(const_ptr_type_node
, valaddr
));
11528 if (call
== error_mark_node
)
11529 return error_mark_node
;
11532 if (make_tmp
== NULL
)
11535 ret
= fold_build2_loc(loc
, COMPOUND_EXPR
, type_tree
, make_tmp
, call
);
11539 // Export an array construction.
11542 Map_construction_expression::do_export(Export
* exp
) const
11544 exp
->write_c_string("convert(");
11545 exp
->write_type(this->type_
);
11546 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11547 pv
!= this->vals_
->end();
11550 exp
->write_c_string(", ");
11551 (*pv
)->export_expression(exp
);
11553 exp
->write_c_string(")");
11556 // A general composite literal. This is lowered to a type specific
11559 class Composite_literal_expression
: public Parser_expression
11562 Composite_literal_expression(Type
* type
, int depth
, bool has_keys
,
11563 Expression_list
* vals
, source_location location
)
11564 : Parser_expression(EXPRESSION_COMPOSITE_LITERAL
, location
),
11565 type_(type
), depth_(depth
), vals_(vals
), has_keys_(has_keys
)
11570 do_traverse(Traverse
* traverse
);
11573 do_lower(Gogo
*, Named_object
*, int);
11578 return new Composite_literal_expression(this->type_
, this->depth_
,
11580 (this->vals_
== NULL
11582 : this->vals_
->copy()),
11588 lower_struct(Type
*);
11591 lower_array(Type
*);
11594 make_array(Type
*, Expression_list
*);
11597 lower_map(Gogo
*, Named_object
*, Type
*);
11599 // The type of the composite literal.
11601 // The depth within a list of composite literals within a composite
11602 // literal, when the type is omitted.
11604 // The values to put in the composite literal.
11605 Expression_list
* vals_
;
11606 // If this is true, then VALS_ is a list of pairs: a key and a
11607 // value. In an array initializer, a missing key will be NULL.
11614 Composite_literal_expression::do_traverse(Traverse
* traverse
)
11616 if (this->vals_
!= NULL
11617 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
11618 return TRAVERSE_EXIT
;
11619 return Type::traverse(this->type_
, traverse
);
11622 // Lower a generic composite literal into a specific version based on
11626 Composite_literal_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
11628 Type
* type
= this->type_
;
11630 for (int depth
= this->depth_
; depth
> 0; --depth
)
11632 if (type
->array_type() != NULL
)
11633 type
= type
->array_type()->element_type();
11634 else if (type
->map_type() != NULL
)
11635 type
= type
->map_type()->val_type();
11638 if (!type
->is_error_type())
11639 error_at(this->location(),
11640 ("may only omit types within composite literals "
11641 "of slice, array, or map type"));
11642 return Expression::make_error(this->location());
11646 if (type
->is_error_type())
11647 return Expression::make_error(this->location());
11648 else if (type
->struct_type() != NULL
)
11649 return this->lower_struct(type
);
11650 else if (type
->array_type() != NULL
)
11651 return this->lower_array(type
);
11652 else if (type
->map_type() != NULL
)
11653 return this->lower_map(gogo
, function
, type
);
11656 error_at(this->location(),
11657 ("expected struct, slice, array, or map type "
11658 "for composite literal"));
11659 return Expression::make_error(this->location());
11663 // Lower a struct composite literal.
11666 Composite_literal_expression::lower_struct(Type
* type
)
11668 source_location location
= this->location();
11669 Struct_type
* st
= type
->struct_type();
11670 if (this->vals_
== NULL
|| !this->has_keys_
)
11671 return new Struct_construction_expression(type
, this->vals_
, location
);
11673 size_t field_count
= st
->field_count();
11674 std::vector
<Expression
*> vals(field_count
);
11675 Expression_list::const_iterator p
= this->vals_
->begin();
11676 while (p
!= this->vals_
->end())
11678 Expression
* name_expr
= *p
;
11681 gcc_assert(p
!= this->vals_
->end());
11682 Expression
* val
= *p
;
11686 if (name_expr
== NULL
)
11688 error_at(val
->location(), "mixture of field and value initializers");
11689 return Expression::make_error(location
);
11692 bool bad_key
= false;
11694 switch (name_expr
->classification())
11696 case EXPRESSION_UNKNOWN_REFERENCE
:
11697 name
= name_expr
->unknown_expression()->name();
11700 case EXPRESSION_CONST_REFERENCE
:
11701 name
= static_cast<Const_expression
*>(name_expr
)->name();
11704 case EXPRESSION_TYPE
:
11706 Type
* t
= name_expr
->type();
11707 Named_type
* nt
= t
->named_type();
11715 case EXPRESSION_VAR_REFERENCE
:
11716 name
= name_expr
->var_expression()->name();
11719 case EXPRESSION_FUNC_REFERENCE
:
11720 name
= name_expr
->func_expression()->name();
11723 case EXPRESSION_UNARY
:
11724 // If there is a local variable around with the same name as
11725 // the field, and this occurs in the closure, then the
11726 // parser may turn the field reference into an indirection
11727 // through the closure. FIXME: This is a mess.
11730 Unary_expression
* ue
= static_cast<Unary_expression
*>(name_expr
);
11731 if (ue
->op() == OPERATOR_MULT
)
11733 Field_reference_expression
* fre
=
11734 ue
->operand()->field_reference_expression();
11738 fre
->expr()->type()->deref()->struct_type();
11741 const Struct_field
* sf
= st
->field(fre
->field_index());
11742 name
= sf
->field_name();
11744 snprintf(buf
, sizeof buf
, "%u", fre
->field_index());
11745 size_t buflen
= strlen(buf
);
11746 if (name
.compare(name
.length() - buflen
, buflen
, buf
)
11749 name
= name
.substr(0, name
.length() - buflen
);
11764 error_at(name_expr
->location(), "expected struct field name");
11765 return Expression::make_error(location
);
11768 unsigned int index
;
11769 const Struct_field
* sf
= st
->find_local_field(name
, &index
);
11772 error_at(name_expr
->location(), "unknown field %qs in %qs",
11773 Gogo::message_name(name
).c_str(),
11774 (type
->named_type() != NULL
11775 ? type
->named_type()->message_name().c_str()
11776 : "unnamed struct"));
11777 return Expression::make_error(location
);
11779 if (vals
[index
] != NULL
)
11781 error_at(name_expr
->location(),
11782 "duplicate value for field %qs in %qs",
11783 Gogo::message_name(name
).c_str(),
11784 (type
->named_type() != NULL
11785 ? type
->named_type()->message_name().c_str()
11786 : "unnamed struct"));
11787 return Expression::make_error(location
);
11793 Expression_list
* list
= new Expression_list
;
11794 list
->reserve(field_count
);
11795 for (size_t i
= 0; i
< field_count
; ++i
)
11796 list
->push_back(vals
[i
]);
11798 return new Struct_construction_expression(type
, list
, location
);
11801 // Lower an array composite literal.
11804 Composite_literal_expression::lower_array(Type
* type
)
11806 source_location location
= this->location();
11807 if (this->vals_
== NULL
|| !this->has_keys_
)
11808 return this->make_array(type
, this->vals_
);
11810 std::vector
<Expression
*> vals
;
11811 vals
.reserve(this->vals_
->size());
11812 unsigned long index
= 0;
11813 Expression_list::const_iterator p
= this->vals_
->begin();
11814 while (p
!= this->vals_
->end())
11816 Expression
* index_expr
= *p
;
11819 gcc_assert(p
!= this->vals_
->end());
11820 Expression
* val
= *p
;
11824 if (index_expr
!= NULL
)
11829 if (!index_expr
->integer_constant_value(true, ival
, &dummy
))
11832 error_at(index_expr
->location(),
11833 "index expression is not integer constant");
11834 return Expression::make_error(location
);
11836 if (mpz_sgn(ival
) < 0)
11839 error_at(index_expr
->location(), "index expression is negative");
11840 return Expression::make_error(location
);
11842 index
= mpz_get_ui(ival
);
11843 if (mpz_cmp_ui(ival
, index
) != 0)
11846 error_at(index_expr
->location(), "index value overflow");
11847 return Expression::make_error(location
);
11852 if (index
== vals
.size())
11853 vals
.push_back(val
);
11856 if (index
> vals
.size())
11858 vals
.reserve(index
+ 32);
11859 vals
.resize(index
+ 1, static_cast<Expression
*>(NULL
));
11861 if (vals
[index
] != NULL
)
11863 error_at((index_expr
!= NULL
11864 ? index_expr
->location()
11865 : val
->location()),
11866 "duplicate value for index %lu",
11868 return Expression::make_error(location
);
11876 size_t size
= vals
.size();
11877 Expression_list
* list
= new Expression_list
;
11878 list
->reserve(size
);
11879 for (size_t i
= 0; i
< size
; ++i
)
11880 list
->push_back(vals
[i
]);
11882 return this->make_array(type
, list
);
11885 // Actually build the array composite literal. This handles
11889 Composite_literal_expression::make_array(Type
* type
, Expression_list
* vals
)
11891 source_location location
= this->location();
11892 Array_type
* at
= type
->array_type();
11893 if (at
->length() != NULL
&& at
->length()->is_nil_expression())
11895 size_t size
= vals
== NULL
? 0 : vals
->size();
11897 mpz_init_set_ui(vlen
, size
);
11898 Expression
* elen
= Expression::make_integer(&vlen
, NULL
, location
);
11900 at
= Type::make_array_type(at
->element_type(), elen
);
11903 if (at
->length() != NULL
)
11904 return new Fixed_array_construction_expression(type
, vals
, location
);
11906 return new Open_array_construction_expression(type
, vals
, location
);
11909 // Lower a map composite literal.
11912 Composite_literal_expression::lower_map(Gogo
* gogo
, Named_object
* function
,
11915 source_location location
= this->location();
11916 if (this->vals_
!= NULL
)
11918 if (!this->has_keys_
)
11920 error_at(location
, "map composite literal must have keys");
11921 return Expression::make_error(location
);
11924 for (Expression_list::iterator p
= this->vals_
->begin();
11925 p
!= this->vals_
->end();
11931 error_at((*p
)->location(),
11932 "map composite literal must have keys for every value");
11933 return Expression::make_error(location
);
11935 // Make sure we have lowered the key; it may not have been
11936 // lowered in order to handle keys for struct composite
11937 // literals. Lower it now to get the right error message.
11938 if ((*p
)->unknown_expression() != NULL
)
11940 (*p
)->unknown_expression()->clear_is_composite_literal_key();
11941 gogo
->lower_expression(function
, &*p
);
11942 gcc_assert((*p
)->is_error_expression());
11943 return Expression::make_error(location
);
11948 return new Map_construction_expression(type
, this->vals_
, location
);
11951 // Make a composite literal expression.
11954 Expression::make_composite_literal(Type
* type
, int depth
, bool has_keys
,
11955 Expression_list
* vals
,
11956 source_location location
)
11958 return new Composite_literal_expression(type
, depth
, has_keys
, vals
,
11962 // Return whether this expression is a composite literal.
11965 Expression::is_composite_literal() const
11967 switch (this->classification_
)
11969 case EXPRESSION_COMPOSITE_LITERAL
:
11970 case EXPRESSION_STRUCT_CONSTRUCTION
:
11971 case EXPRESSION_FIXED_ARRAY_CONSTRUCTION
:
11972 case EXPRESSION_OPEN_ARRAY_CONSTRUCTION
:
11973 case EXPRESSION_MAP_CONSTRUCTION
:
11980 // Return whether this expression is a composite literal which is not
11984 Expression::is_nonconstant_composite_literal() const
11986 switch (this->classification_
)
11988 case EXPRESSION_STRUCT_CONSTRUCTION
:
11990 const Struct_construction_expression
*psce
=
11991 static_cast<const Struct_construction_expression
*>(this);
11992 return !psce
->is_constant_struct();
11994 case EXPRESSION_FIXED_ARRAY_CONSTRUCTION
:
11996 const Fixed_array_construction_expression
*pace
=
11997 static_cast<const Fixed_array_construction_expression
*>(this);
11998 return !pace
->is_constant_array();
12000 case EXPRESSION_OPEN_ARRAY_CONSTRUCTION
:
12002 const Open_array_construction_expression
*pace
=
12003 static_cast<const Open_array_construction_expression
*>(this);
12004 return !pace
->is_constant_array();
12006 case EXPRESSION_MAP_CONSTRUCTION
:
12013 // Return true if this is a reference to a local variable.
12016 Expression::is_local_variable() const
12018 const Var_expression
* ve
= this->var_expression();
12021 const Named_object
* no
= ve
->named_object();
12022 return (no
->is_result_variable()
12023 || (no
->is_variable() && !no
->var_value()->is_global()));
12026 // Class Type_guard_expression.
12031 Type_guard_expression::do_traverse(Traverse
* traverse
)
12033 if (Expression::traverse(&this->expr_
, traverse
) == TRAVERSE_EXIT
12034 || Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
12035 return TRAVERSE_EXIT
;
12036 return TRAVERSE_CONTINUE
;
12039 // Check types of a type guard expression. The expression must have
12040 // an interface type, but the actual type conversion is checked at run
12044 Type_guard_expression::do_check_types(Gogo
*)
12046 // 6g permits using a type guard with unsafe.pointer; we are
12048 Type
* expr_type
= this->expr_
->type();
12049 if (expr_type
->is_unsafe_pointer_type())
12051 if (this->type_
->points_to() == NULL
12052 && (this->type_
->integer_type() == NULL
12053 || (this->type_
->forwarded()
12054 != Type::lookup_integer_type("uintptr"))))
12055 this->report_error(_("invalid unsafe.Pointer conversion"));
12057 else if (this->type_
->is_unsafe_pointer_type())
12059 if (expr_type
->points_to() == NULL
12060 && (expr_type
->integer_type() == NULL
12061 || (expr_type
->forwarded()
12062 != Type::lookup_integer_type("uintptr"))))
12063 this->report_error(_("invalid unsafe.Pointer conversion"));
12065 else if (expr_type
->interface_type() == NULL
)
12067 if (!expr_type
->is_error_type() && !this->type_
->is_error_type())
12068 this->report_error(_("type assertion only valid for interface types"));
12069 this->set_is_error();
12071 else if (this->type_
->interface_type() == NULL
)
12073 std::string reason
;
12074 if (!expr_type
->interface_type()->implements_interface(this->type_
,
12077 if (!this->type_
->is_error_type())
12079 if (reason
.empty())
12080 this->report_error(_("impossible type assertion: "
12081 "type does not implement interface"));
12083 error_at(this->location(),
12084 ("impossible type assertion: "
12085 "type does not implement interface (%s)"),
12088 this->set_is_error();
12093 // Return a tree for a type guard expression.
12096 Type_guard_expression::do_get_tree(Translate_context
* context
)
12098 Gogo
* gogo
= context
->gogo();
12099 tree expr_tree
= this->expr_
->get_tree(context
);
12100 if (expr_tree
== error_mark_node
)
12101 return error_mark_node
;
12102 Type
* expr_type
= this->expr_
->type();
12103 if ((this->type_
->is_unsafe_pointer_type()
12104 && (expr_type
->points_to() != NULL
12105 || expr_type
->integer_type() != NULL
))
12106 || (expr_type
->is_unsafe_pointer_type()
12107 && this->type_
->points_to() != NULL
))
12108 return convert_to_pointer(this->type_
->get_tree(gogo
), expr_tree
);
12109 else if (expr_type
->is_unsafe_pointer_type()
12110 && this->type_
->integer_type() != NULL
)
12111 return convert_to_integer(this->type_
->get_tree(gogo
), expr_tree
);
12112 else if (this->type_
->interface_type() != NULL
)
12113 return Expression::convert_interface_to_interface(context
, this->type_
,
12114 this->expr_
->type(),
12118 return Expression::convert_for_assignment(context
, this->type_
,
12119 this->expr_
->type(), expr_tree
,
12123 // Make a type guard expression.
12126 Expression::make_type_guard(Expression
* expr
, Type
* type
,
12127 source_location location
)
12129 return new Type_guard_expression(expr
, type
, location
);
12132 // Class Heap_composite_expression.
12134 // When you take the address of a composite literal, it is allocated
12135 // on the heap. This class implements that.
12137 class Heap_composite_expression
: public Expression
12140 Heap_composite_expression(Expression
* expr
, source_location location
)
12141 : Expression(EXPRESSION_HEAP_COMPOSITE
, location
),
12147 do_traverse(Traverse
* traverse
)
12148 { return Expression::traverse(&this->expr_
, traverse
); }
12152 { return Type::make_pointer_type(this->expr_
->type()); }
12155 do_determine_type(const Type_context
*)
12156 { this->expr_
->determine_type_no_context(); }
12161 return Expression::make_heap_composite(this->expr_
->copy(),
12166 do_get_tree(Translate_context
*);
12168 // We only export global objects, and the parser does not generate
12169 // this in global scope.
12171 do_export(Export
*) const
12172 { gcc_unreachable(); }
12175 // The composite literal which is being put on the heap.
12179 // Return a tree which allocates a composite literal on the heap.
12182 Heap_composite_expression::do_get_tree(Translate_context
* context
)
12184 tree expr_tree
= this->expr_
->get_tree(context
);
12185 if (expr_tree
== error_mark_node
)
12186 return error_mark_node
;
12187 tree expr_size
= TYPE_SIZE_UNIT(TREE_TYPE(expr_tree
));
12188 gcc_assert(TREE_CODE(expr_size
) == INTEGER_CST
);
12189 tree space
= context
->gogo()->allocate_memory(this->expr_
->type(),
12190 expr_size
, this->location());
12191 space
= fold_convert(build_pointer_type(TREE_TYPE(expr_tree
)), space
);
12192 space
= save_expr(space
);
12193 tree ref
= build_fold_indirect_ref_loc(this->location(), space
);
12194 TREE_THIS_NOTRAP(ref
) = 1;
12195 tree ret
= build2(COMPOUND_EXPR
, TREE_TYPE(space
),
12196 build2(MODIFY_EXPR
, void_type_node
, ref
, expr_tree
),
12198 SET_EXPR_LOCATION(ret
, this->location());
12202 // Allocate a composite literal on the heap.
12205 Expression::make_heap_composite(Expression
* expr
, source_location location
)
12207 return new Heap_composite_expression(expr
, location
);
12210 // Class Receive_expression.
12212 // Return the type of a receive expression.
12215 Receive_expression::do_type()
12217 Channel_type
* channel_type
= this->channel_
->type()->channel_type();
12218 if (channel_type
== NULL
)
12219 return Type::make_error_type();
12220 return channel_type
->element_type();
12223 // Check types for a receive expression.
12226 Receive_expression::do_check_types(Gogo
*)
12228 Type
* type
= this->channel_
->type();
12229 if (type
->is_error_type())
12231 this->set_is_error();
12234 if (type
->channel_type() == NULL
)
12236 this->report_error(_("expected channel"));
12239 if (!type
->channel_type()->may_receive())
12241 this->report_error(_("invalid receive on send-only channel"));
12246 // Get a tree for a receive expression.
12249 Receive_expression::do_get_tree(Translate_context
* context
)
12251 Channel_type
* channel_type
= this->channel_
->type()->channel_type();
12252 gcc_assert(channel_type
!= NULL
);
12253 Type
* element_type
= channel_type
->element_type();
12254 tree element_type_tree
= element_type
->get_tree(context
->gogo());
12256 tree channel
= this->channel_
->get_tree(context
);
12257 if (element_type_tree
== error_mark_node
|| channel
== error_mark_node
)
12258 return error_mark_node
;
12260 return Gogo::receive_from_channel(element_type_tree
, channel
,
12261 this->for_select_
, this->location());
12264 // Make a receive expression.
12266 Receive_expression
*
12267 Expression::make_receive(Expression
* channel
, source_location location
)
12269 return new Receive_expression(channel
, location
);
12272 // Class Send_expression.
12277 Send_expression::do_traverse(Traverse
* traverse
)
12279 if (Expression::traverse(&this->channel_
, traverse
) == TRAVERSE_EXIT
)
12280 return TRAVERSE_EXIT
;
12281 return Expression::traverse(&this->val_
, traverse
);
12287 Send_expression::do_type()
12289 return Type::lookup_bool_type();
12295 Send_expression::do_determine_type(const Type_context
*)
12297 this->channel_
->determine_type_no_context();
12299 Type
* type
= this->channel_
->type();
12300 Type_context subcontext
;
12301 if (type
->channel_type() != NULL
)
12302 subcontext
.type
= type
->channel_type()->element_type();
12303 this->val_
->determine_type(&subcontext
);
12309 Send_expression::do_check_types(Gogo
*)
12311 Type
* type
= this->channel_
->type();
12312 if (type
->is_error_type())
12314 this->set_is_error();
12317 Channel_type
* channel_type
= type
->channel_type();
12318 if (channel_type
== NULL
)
12320 error_at(this->location(), "left operand of %<<-%> must be channel");
12321 this->set_is_error();
12324 Type
* element_type
= channel_type
->element_type();
12325 if (element_type
!= NULL
12326 && !Type::are_assignable(element_type
, this->val_
->type(), NULL
))
12328 this->report_error(_("incompatible types in send"));
12331 if (!channel_type
->may_send())
12333 this->report_error(_("invalid send on receive-only channel"));
12338 // Get a tree for a send expression.
12341 Send_expression::do_get_tree(Translate_context
* context
)
12343 tree channel
= this->channel_
->get_tree(context
);
12344 tree val
= this->val_
->get_tree(context
);
12345 if (channel
== error_mark_node
|| val
== error_mark_node
)
12346 return error_mark_node
;
12347 Channel_type
* channel_type
= this->channel_
->type()->channel_type();
12348 val
= Expression::convert_for_assignment(context
,
12349 channel_type
->element_type(),
12350 this->val_
->type(),
12353 return Gogo::send_on_channel(channel
, val
, this->is_value_discarded_
,
12354 this->for_select_
, this->location());
12357 // Make a send expression
12360 Expression::make_send(Expression
* channel
, Expression
* val
,
12361 source_location location
)
12363 return new Send_expression(channel
, val
, location
);
12366 // An expression which evaluates to a pointer to the type descriptor
12369 class Type_descriptor_expression
: public Expression
12372 Type_descriptor_expression(Type
* type
, source_location location
)
12373 : Expression(EXPRESSION_TYPE_DESCRIPTOR
, location
),
12380 { return Type::make_type_descriptor_ptr_type(); }
12383 do_determine_type(const Type_context
*)
12391 do_get_tree(Translate_context
* context
)
12392 { return this->type_
->type_descriptor_pointer(context
->gogo()); }
12395 // The type for which this is the descriptor.
12399 // Make a type descriptor expression.
12402 Expression::make_type_descriptor(Type
* type
, source_location location
)
12404 return new Type_descriptor_expression(type
, location
);
12407 // An expression which evaluates to some characteristic of a type.
12408 // This is only used to initialize fields of a type descriptor. Using
12409 // a new expression class is slightly inefficient but gives us a good
12410 // separation between the frontend and the middle-end with regard to
12411 // how types are laid out.
12413 class Type_info_expression
: public Expression
12416 Type_info_expression(Type
* type
, Type_info type_info
)
12417 : Expression(EXPRESSION_TYPE_INFO
, BUILTINS_LOCATION
),
12418 type_(type
), type_info_(type_info
)
12426 do_determine_type(const Type_context
*)
12434 do_get_tree(Translate_context
* context
);
12437 // The type for which we are getting information.
12439 // What information we want.
12440 Type_info type_info_
;
12443 // The type is chosen to match what the type descriptor struct
12447 Type_info_expression::do_type()
12449 switch (this->type_info_
)
12451 case TYPE_INFO_SIZE
:
12452 return Type::lookup_integer_type("uintptr");
12453 case TYPE_INFO_ALIGNMENT
:
12454 case TYPE_INFO_FIELD_ALIGNMENT
:
12455 return Type::lookup_integer_type("uint8");
12461 // Return type information in GENERIC.
12464 Type_info_expression::do_get_tree(Translate_context
* context
)
12466 tree type_tree
= this->type_
->get_tree(context
->gogo());
12467 if (type_tree
== error_mark_node
)
12468 return error_mark_node
;
12470 tree val_type_tree
= this->type()->get_tree(context
->gogo());
12471 gcc_assert(val_type_tree
!= error_mark_node
);
12473 if (this->type_info_
== TYPE_INFO_SIZE
)
12474 return fold_convert_loc(BUILTINS_LOCATION
, val_type_tree
,
12475 TYPE_SIZE_UNIT(type_tree
));
12479 if (this->type_info_
== TYPE_INFO_ALIGNMENT
)
12480 val
= go_type_alignment(type_tree
);
12482 val
= go_field_alignment(type_tree
);
12483 return build_int_cstu(val_type_tree
, val
);
12487 // Make a type info expression.
12490 Expression::make_type_info(Type
* type
, Type_info type_info
)
12492 return new Type_info_expression(type
, type_info
);
12495 // An expression which evaluates to the offset of a field within a
12496 // struct. This, like Type_info_expression, q.v., is only used to
12497 // initialize fields of a type descriptor.
12499 class Struct_field_offset_expression
: public Expression
12502 Struct_field_offset_expression(Struct_type
* type
, const Struct_field
* field
)
12503 : Expression(EXPRESSION_STRUCT_FIELD_OFFSET
, BUILTINS_LOCATION
),
12504 type_(type
), field_(field
)
12510 { return Type::lookup_integer_type("uintptr"); }
12513 do_determine_type(const Type_context
*)
12521 do_get_tree(Translate_context
* context
);
12524 // The type of the struct.
12525 Struct_type
* type_
;
12527 const Struct_field
* field_
;
12530 // Return a struct field offset in GENERIC.
12533 Struct_field_offset_expression::do_get_tree(Translate_context
* context
)
12535 tree type_tree
= this->type_
->get_tree(context
->gogo());
12536 if (type_tree
== error_mark_node
)
12537 return error_mark_node
;
12539 tree val_type_tree
= this->type()->get_tree(context
->gogo());
12540 gcc_assert(val_type_tree
!= error_mark_node
);
12542 const Struct_field_list
* fields
= this->type_
->fields();
12543 tree struct_field_tree
= TYPE_FIELDS(type_tree
);
12544 Struct_field_list::const_iterator p
;
12545 for (p
= fields
->begin();
12546 p
!= fields
->end();
12547 ++p
, struct_field_tree
= DECL_CHAIN(struct_field_tree
))
12549 gcc_assert(struct_field_tree
!= NULL_TREE
);
12550 if (&*p
== this->field_
)
12553 gcc_assert(&*p
== this->field_
);
12555 return fold_convert_loc(BUILTINS_LOCATION
, val_type_tree
,
12556 byte_position(struct_field_tree
));
12559 // Make an expression for a struct field offset.
12562 Expression::make_struct_field_offset(Struct_type
* type
,
12563 const Struct_field
* field
)
12565 return new Struct_field_offset_expression(type
, field
);
12568 // An expression which evaluates to the address of an unnamed label.
12570 class Label_addr_expression
: public Expression
12573 Label_addr_expression(Label
* label
, source_location location
)
12574 : Expression(EXPRESSION_LABEL_ADDR
, location
),
12581 { return Type::make_pointer_type(Type::make_void_type()); }
12584 do_determine_type(const Type_context
*)
12589 { return new Label_addr_expression(this->label_
, this->location()); }
12592 do_get_tree(Translate_context
*)
12593 { return this->label_
->get_addr(this->location()); }
12596 // The label whose address we are taking.
12600 // Make an expression for the address of an unnamed label.
12603 Expression::make_label_addr(Label
* label
, source_location location
)
12605 return new Label_addr_expression(label
, location
);
12608 // Import an expression. This comes at the end in order to see the
12609 // various class definitions.
12612 Expression::import_expression(Import
* imp
)
12614 int c
= imp
->peek_char();
12615 if (imp
->match_c_string("- ")
12616 || imp
->match_c_string("! ")
12617 || imp
->match_c_string("^ "))
12618 return Unary_expression::do_import(imp
);
12620 return Binary_expression::do_import(imp
);
12621 else if (imp
->match_c_string("true")
12622 || imp
->match_c_string("false"))
12623 return Boolean_expression::do_import(imp
);
12625 return String_expression::do_import(imp
);
12626 else if (c
== '-' || (c
>= '0' && c
<= '9'))
12628 // This handles integers, floats and complex constants.
12629 return Integer_expression::do_import(imp
);
12631 else if (imp
->match_c_string("nil"))
12632 return Nil_expression::do_import(imp
);
12633 else if (imp
->match_c_string("convert"))
12634 return Type_conversion_expression::do_import(imp
);
12637 error_at(imp
->location(), "import error: expected expression");
12638 return Expression::make_error(imp
->location());
12642 // Class Expression_list.
12644 // Traverse the list.
12647 Expression_list::traverse(Traverse
* traverse
)
12649 for (Expression_list::iterator p
= this->begin();
12655 if (Expression::traverse(&*p
, traverse
) == TRAVERSE_EXIT
)
12656 return TRAVERSE_EXIT
;
12659 return TRAVERSE_CONTINUE
;
12665 Expression_list::copy()
12667 Expression_list
* ret
= new Expression_list();
12668 for (Expression_list::iterator p
= this->begin();
12673 ret
->push_back(NULL
);
12675 ret
->push_back((*p
)->copy());
12680 // Return whether an expression list has an error expression.
12683 Expression_list::contains_error() const
12685 for (Expression_list::const_iterator p
= this->begin();
12688 if (*p
!= NULL
&& (*p
)->is_error_expression())