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 (is_comparison
)
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()
5418 case OPERATOR_ANDAND
:
5420 case OPERATOR_NOTEQ
:
5425 return Type::lookup_bool_type();
5428 case OPERATOR_MINUS
:
5435 case OPERATOR_BITCLEAR
:
5437 Type
* left_type
= this->left_
->type();
5438 Type
* right_type
= this->right_
->type();
5439 if (left_type
->is_error_type())
5441 else if (right_type
->is_error_type())
5443 else if (!left_type
->is_abstract() && left_type
->named_type() != NULL
)
5445 else if (!right_type
->is_abstract() && right_type
->named_type() != NULL
)
5447 else if (!left_type
->is_abstract())
5449 else if (!right_type
->is_abstract())
5451 else if (left_type
->complex_type() != NULL
)
5453 else if (right_type
->complex_type() != NULL
)
5455 else if (left_type
->float_type() != NULL
)
5457 else if (right_type
->float_type() != NULL
)
5463 case OPERATOR_LSHIFT
:
5464 case OPERATOR_RSHIFT
:
5465 return this->left_
->type();
5472 // Set type for a binary expression.
5475 Binary_expression::do_determine_type(const Type_context
* context
)
5477 Type
* tleft
= this->left_
->type();
5478 Type
* tright
= this->right_
->type();
5480 // Both sides should have the same type, except for the shift
5481 // operations. For a comparison, we should ignore the incoming
5484 bool is_shift_op
= (this->op_
== OPERATOR_LSHIFT
5485 || this->op_
== OPERATOR_RSHIFT
);
5487 bool is_comparison
= (this->op_
== OPERATOR_EQEQ
5488 || this->op_
== OPERATOR_NOTEQ
5489 || this->op_
== OPERATOR_LT
5490 || this->op_
== OPERATOR_LE
5491 || this->op_
== OPERATOR_GT
5492 || this->op_
== OPERATOR_GE
);
5494 Type_context
subcontext(*context
);
5498 // In a comparison, the context does not determine the types of
5500 subcontext
.type
= NULL
;
5503 // Set the context for the left hand operand.
5506 // The right hand operand plays no role in determining the type
5507 // of the left hand operand. A shift of an abstract integer in
5508 // a string context gets special treatment, which may be a
5510 if (subcontext
.type
!= NULL
5511 && subcontext
.type
->is_string_type()
5512 && tleft
->is_abstract())
5513 error_at(this->location(), "shift of non-integer operand");
5515 else if (!tleft
->is_abstract())
5516 subcontext
.type
= tleft
;
5517 else if (!tright
->is_abstract())
5518 subcontext
.type
= tright
;
5519 else if (subcontext
.type
== NULL
)
5521 if ((tleft
->integer_type() != NULL
&& tright
->integer_type() != NULL
)
5522 || (tleft
->float_type() != NULL
&& tright
->float_type() != NULL
)
5523 || (tleft
->complex_type() != NULL
&& tright
->complex_type() != NULL
))
5525 // Both sides have an abstract integer, abstract float, or
5526 // abstract complex type. Just let CONTEXT determine
5527 // whether they may remain abstract or not.
5529 else if (tleft
->complex_type() != NULL
)
5530 subcontext
.type
= tleft
;
5531 else if (tright
->complex_type() != NULL
)
5532 subcontext
.type
= tright
;
5533 else if (tleft
->float_type() != NULL
)
5534 subcontext
.type
= tleft
;
5535 else if (tright
->float_type() != NULL
)
5536 subcontext
.type
= tright
;
5538 subcontext
.type
= tleft
;
5540 if (subcontext
.type
!= NULL
&& !context
->may_be_abstract
)
5541 subcontext
.type
= subcontext
.type
->make_non_abstract_type();
5544 this->left_
->determine_type(&subcontext
);
5546 // The context for the right hand operand is the same as for the
5547 // left hand operand, except for a shift operator.
5550 subcontext
.type
= Type::lookup_integer_type("uint");
5551 subcontext
.may_be_abstract
= false;
5554 this->right_
->determine_type(&subcontext
);
5557 // Report an error if the binary operator OP does not support TYPE.
5558 // Return whether the operation is OK. This should not be used for
5562 Binary_expression::check_operator_type(Operator op
, Type
* type
,
5563 source_location location
)
5568 case OPERATOR_ANDAND
:
5569 if (!type
->is_boolean_type())
5571 error_at(location
, "expected boolean type");
5577 case OPERATOR_NOTEQ
:
5578 if (type
->integer_type() == NULL
5579 && type
->float_type() == NULL
5580 && type
->complex_type() == NULL
5581 && !type
->is_string_type()
5582 && type
->points_to() == NULL
5583 && !type
->is_nil_type()
5584 && !type
->is_boolean_type()
5585 && type
->interface_type() == NULL
5586 && (type
->array_type() == NULL
5587 || type
->array_type()->length() != NULL
)
5588 && type
->map_type() == NULL
5589 && type
->channel_type() == NULL
5590 && type
->function_type() == NULL
)
5593 ("expected integer, floating, complex, string, pointer, "
5594 "boolean, interface, slice, map, channel, "
5595 "or function type"));
5604 if (type
->integer_type() == NULL
5605 && type
->float_type() == NULL
5606 && !type
->is_string_type())
5608 error_at(location
, "expected integer, floating, or string type");
5614 case OPERATOR_PLUSEQ
:
5615 if (type
->integer_type() == NULL
5616 && type
->float_type() == NULL
5617 && type
->complex_type() == NULL
5618 && !type
->is_string_type())
5621 "expected integer, floating, complex, or string type");
5626 case OPERATOR_MINUS
:
5627 case OPERATOR_MINUSEQ
:
5629 case OPERATOR_MULTEQ
:
5631 case OPERATOR_DIVEQ
:
5632 if (type
->integer_type() == NULL
5633 && type
->float_type() == NULL
5634 && type
->complex_type() == NULL
)
5636 error_at(location
, "expected integer, floating, or complex type");
5642 case OPERATOR_MODEQ
:
5646 case OPERATOR_ANDEQ
:
5648 case OPERATOR_XOREQ
:
5649 case OPERATOR_BITCLEAR
:
5650 case OPERATOR_BITCLEAREQ
:
5651 if (type
->integer_type() == NULL
)
5653 error_at(location
, "expected integer type");
5668 Binary_expression::do_check_types(Gogo
*)
5670 Type
* left_type
= this->left_
->type();
5671 Type
* right_type
= this->right_
->type();
5672 if (left_type
->is_error_type() || right_type
->is_error_type())
5674 this->set_is_error();
5678 if (this->op_
== OPERATOR_EQEQ
5679 || this->op_
== OPERATOR_NOTEQ
5680 || this->op_
== OPERATOR_LT
5681 || this->op_
== OPERATOR_LE
5682 || this->op_
== OPERATOR_GT
5683 || this->op_
== OPERATOR_GE
)
5685 if (!Type::are_assignable(left_type
, right_type
, NULL
)
5686 && !Type::are_assignable(right_type
, left_type
, NULL
))
5688 this->report_error(_("incompatible types in binary expression"));
5691 if (!Binary_expression::check_operator_type(this->op_
, left_type
,
5693 || !Binary_expression::check_operator_type(this->op_
, right_type
,
5696 this->set_is_error();
5700 else if (this->op_
!= OPERATOR_LSHIFT
&& this->op_
!= OPERATOR_RSHIFT
)
5702 if (!Type::are_compatible_for_binop(left_type
, right_type
))
5704 this->report_error(_("incompatible types in binary expression"));
5707 if (!Binary_expression::check_operator_type(this->op_
, left_type
,
5710 this->set_is_error();
5716 if (left_type
->integer_type() == NULL
)
5717 this->report_error(_("shift of non-integer operand"));
5719 if (!right_type
->is_abstract()
5720 && (right_type
->integer_type() == NULL
5721 || !right_type
->integer_type()->is_unsigned()))
5722 this->report_error(_("shift count not unsigned integer"));
5728 if (this->right_
->integer_constant_value(true, val
, &type
))
5730 if (mpz_sgn(val
) < 0)
5731 this->report_error(_("negative shift count"));
5738 // Get a tree for a binary expression.
5741 Binary_expression::do_get_tree(Translate_context
* context
)
5743 tree left
= this->left_
->get_tree(context
);
5744 tree right
= this->right_
->get_tree(context
);
5746 if (left
== error_mark_node
|| right
== error_mark_node
)
5747 return error_mark_node
;
5749 enum tree_code code
;
5750 bool use_left_type
= true;
5751 bool is_shift_op
= false;
5755 case OPERATOR_NOTEQ
:
5760 return Expression::comparison_tree(context
, this->op_
,
5761 this->left_
->type(), left
,
5762 this->right_
->type(), right
,
5766 code
= TRUTH_ORIF_EXPR
;
5767 use_left_type
= false;
5769 case OPERATOR_ANDAND
:
5770 code
= TRUTH_ANDIF_EXPR
;
5771 use_left_type
= false;
5776 case OPERATOR_MINUS
:
5780 code
= BIT_IOR_EXPR
;
5783 code
= BIT_XOR_EXPR
;
5790 Type
*t
= this->left_
->type();
5791 if (t
->float_type() != NULL
|| t
->complex_type() != NULL
)
5794 code
= TRUNC_DIV_EXPR
;
5798 code
= TRUNC_MOD_EXPR
;
5800 case OPERATOR_LSHIFT
:
5804 case OPERATOR_RSHIFT
:
5809 code
= BIT_AND_EXPR
;
5811 case OPERATOR_BITCLEAR
:
5812 right
= fold_build1(BIT_NOT_EXPR
, TREE_TYPE(right
), right
);
5813 code
= BIT_AND_EXPR
;
5819 tree type
= use_left_type
? TREE_TYPE(left
) : TREE_TYPE(right
);
5821 if (this->left_
->type()->is_string_type())
5823 gcc_assert(this->op_
== OPERATOR_PLUS
);
5824 tree string_type
= Type::make_string_type()->get_tree(context
->gogo());
5825 static tree string_plus_decl
;
5826 return Gogo::call_builtin(&string_plus_decl
,
5837 tree compute_type
= excess_precision_type(type
);
5838 if (compute_type
!= NULL_TREE
)
5840 left
= ::convert(compute_type
, left
);
5841 right
= ::convert(compute_type
, right
);
5844 tree eval_saved
= NULL_TREE
;
5848 left
= save_expr(left
);
5850 right
= save_expr(right
);
5851 // Make sure the values are evaluated.
5852 eval_saved
= fold_build2_loc(this->location(), COMPOUND_EXPR
,
5853 void_type_node
, left
, right
);
5856 tree ret
= fold_build2_loc(this->location(),
5858 compute_type
!= NULL_TREE
? compute_type
: type
,
5861 if (compute_type
!= NULL_TREE
)
5862 ret
= ::convert(type
, ret
);
5864 // In Go, a shift larger than the size of the type is well-defined.
5865 // This is not true in GENERIC, so we need to insert a conditional.
5868 gcc_assert(INTEGRAL_TYPE_P(TREE_TYPE(left
)));
5869 gcc_assert(this->left_
->type()->integer_type() != NULL
);
5870 int bits
= TYPE_PRECISION(TREE_TYPE(left
));
5872 tree compare
= fold_build2(LT_EXPR
, boolean_type_node
, right
,
5873 build_int_cst_type(TREE_TYPE(right
), bits
));
5875 tree overflow_result
= fold_convert_loc(this->location(),
5878 if (this->op_
== OPERATOR_RSHIFT
5879 && !this->left_
->type()->integer_type()->is_unsigned())
5881 tree neg
= fold_build2_loc(this->location(), LT_EXPR
,
5882 boolean_type_node
, left
,
5883 fold_convert_loc(this->location(),
5885 integer_zero_node
));
5886 tree neg_one
= fold_build2_loc(this->location(),
5887 MINUS_EXPR
, TREE_TYPE(left
),
5888 fold_convert_loc(this->location(),
5891 fold_convert_loc(this->location(),
5894 overflow_result
= fold_build3_loc(this->location(), COND_EXPR
,
5895 TREE_TYPE(left
), neg
, neg_one
,
5899 ret
= fold_build3_loc(this->location(), COND_EXPR
, TREE_TYPE(left
),
5900 compare
, ret
, overflow_result
);
5902 ret
= fold_build2_loc(this->location(), COMPOUND_EXPR
,
5903 TREE_TYPE(ret
), eval_saved
, ret
);
5909 // Export a binary expression.
5912 Binary_expression::do_export(Export
* exp
) const
5914 exp
->write_c_string("(");
5915 this->left_
->export_expression(exp
);
5919 exp
->write_c_string(" || ");
5921 case OPERATOR_ANDAND
:
5922 exp
->write_c_string(" && ");
5925 exp
->write_c_string(" == ");
5927 case OPERATOR_NOTEQ
:
5928 exp
->write_c_string(" != ");
5931 exp
->write_c_string(" < ");
5934 exp
->write_c_string(" <= ");
5937 exp
->write_c_string(" > ");
5940 exp
->write_c_string(" >= ");
5943 exp
->write_c_string(" + ");
5945 case OPERATOR_MINUS
:
5946 exp
->write_c_string(" - ");
5949 exp
->write_c_string(" | ");
5952 exp
->write_c_string(" ^ ");
5955 exp
->write_c_string(" * ");
5958 exp
->write_c_string(" / ");
5961 exp
->write_c_string(" % ");
5963 case OPERATOR_LSHIFT
:
5964 exp
->write_c_string(" << ");
5966 case OPERATOR_RSHIFT
:
5967 exp
->write_c_string(" >> ");
5970 exp
->write_c_string(" & ");
5972 case OPERATOR_BITCLEAR
:
5973 exp
->write_c_string(" &^ ");
5978 this->right_
->export_expression(exp
);
5979 exp
->write_c_string(")");
5982 // Import a binary expression.
5985 Binary_expression::do_import(Import
* imp
)
5987 imp
->require_c_string("(");
5989 Expression
* left
= Expression::import_expression(imp
);
5992 if (imp
->match_c_string(" || "))
5997 else if (imp
->match_c_string(" && "))
5999 op
= OPERATOR_ANDAND
;
6002 else if (imp
->match_c_string(" == "))
6007 else if (imp
->match_c_string(" != "))
6009 op
= OPERATOR_NOTEQ
;
6012 else if (imp
->match_c_string(" < "))
6017 else if (imp
->match_c_string(" <= "))
6022 else if (imp
->match_c_string(" > "))
6027 else if (imp
->match_c_string(" >= "))
6032 else if (imp
->match_c_string(" + "))
6037 else if (imp
->match_c_string(" - "))
6039 op
= OPERATOR_MINUS
;
6042 else if (imp
->match_c_string(" | "))
6047 else if (imp
->match_c_string(" ^ "))
6052 else if (imp
->match_c_string(" * "))
6057 else if (imp
->match_c_string(" / "))
6062 else if (imp
->match_c_string(" % "))
6067 else if (imp
->match_c_string(" << "))
6069 op
= OPERATOR_LSHIFT
;
6072 else if (imp
->match_c_string(" >> "))
6074 op
= OPERATOR_RSHIFT
;
6077 else if (imp
->match_c_string(" & "))
6082 else if (imp
->match_c_string(" &^ "))
6084 op
= OPERATOR_BITCLEAR
;
6089 error_at(imp
->location(), "unrecognized binary operator");
6090 return Expression::make_error(imp
->location());
6093 Expression
* right
= Expression::import_expression(imp
);
6095 imp
->require_c_string(")");
6097 return Expression::make_binary(op
, left
, right
, imp
->location());
6100 // Make a binary expression.
6103 Expression::make_binary(Operator op
, Expression
* left
, Expression
* right
,
6104 source_location location
)
6106 return new Binary_expression(op
, left
, right
, location
);
6109 // Implement a comparison.
6112 Expression::comparison_tree(Translate_context
* context
, Operator op
,
6113 Type
* left_type
, tree left_tree
,
6114 Type
* right_type
, tree right_tree
,
6115 source_location location
)
6117 enum tree_code code
;
6123 case OPERATOR_NOTEQ
:
6142 if (left_type
->is_string_type() && right_type
->is_string_type())
6144 tree string_type
= Type::make_string_type()->get_tree(context
->gogo());
6145 static tree string_compare_decl
;
6146 left_tree
= Gogo::call_builtin(&string_compare_decl
,
6155 right_tree
= build_int_cst_type(integer_type_node
, 0);
6157 else if ((left_type
->interface_type() != NULL
6158 && right_type
->interface_type() == NULL
6159 && !right_type
->is_nil_type())
6160 || (left_type
->interface_type() == NULL
6161 && !left_type
->is_nil_type()
6162 && right_type
->interface_type() != NULL
))
6164 // Comparing an interface value to a non-interface value.
6165 if (left_type
->interface_type() == NULL
)
6167 std::swap(left_type
, right_type
);
6168 std::swap(left_tree
, right_tree
);
6171 // The right operand is not an interface. We need to take its
6172 // address if it is not a pointer.
6175 if (right_type
->points_to() != NULL
)
6177 make_tmp
= NULL_TREE
;
6180 else if (TREE_ADDRESSABLE(TREE_TYPE(right_tree
)) || DECL_P(right_tree
))
6182 make_tmp
= NULL_TREE
;
6183 arg
= build_fold_addr_expr_loc(location
, right_tree
);
6184 if (DECL_P(right_tree
))
6185 TREE_ADDRESSABLE(right_tree
) = 1;
6189 tree tmp
= create_tmp_var(TREE_TYPE(right_tree
),
6190 get_name(right_tree
));
6191 DECL_IGNORED_P(tmp
) = 0;
6192 DECL_INITIAL(tmp
) = right_tree
;
6193 TREE_ADDRESSABLE(tmp
) = 1;
6194 make_tmp
= build1(DECL_EXPR
, void_type_node
, tmp
);
6195 SET_EXPR_LOCATION(make_tmp
, location
);
6196 arg
= build_fold_addr_expr_loc(location
, tmp
);
6198 arg
= fold_convert_loc(location
, ptr_type_node
, arg
);
6200 tree descriptor
= right_type
->type_descriptor_pointer(context
->gogo());
6202 if (left_type
->interface_type()->is_empty())
6204 static tree empty_interface_value_compare_decl
;
6205 left_tree
= Gogo::call_builtin(&empty_interface_value_compare_decl
,
6207 "__go_empty_interface_value_compare",
6210 TREE_TYPE(left_tree
),
6212 TREE_TYPE(descriptor
),
6216 if (left_tree
== error_mark_node
)
6217 return error_mark_node
;
6218 // This can panic if the type is not comparable.
6219 TREE_NOTHROW(empty_interface_value_compare_decl
) = 0;
6223 static tree interface_value_compare_decl
;
6224 left_tree
= Gogo::call_builtin(&interface_value_compare_decl
,
6226 "__go_interface_value_compare",
6229 TREE_TYPE(left_tree
),
6231 TREE_TYPE(descriptor
),
6235 if (left_tree
== error_mark_node
)
6236 return error_mark_node
;
6237 // This can panic if the type is not comparable.
6238 TREE_NOTHROW(interface_value_compare_decl
) = 0;
6240 right_tree
= build_int_cst_type(integer_type_node
, 0);
6242 if (make_tmp
!= NULL_TREE
)
6243 left_tree
= build2(COMPOUND_EXPR
, TREE_TYPE(left_tree
), make_tmp
,
6246 else if (left_type
->interface_type() != NULL
6247 && right_type
->interface_type() != NULL
)
6249 if (left_type
->interface_type()->is_empty())
6251 gcc_assert(right_type
->interface_type()->is_empty());
6252 static tree empty_interface_compare_decl
;
6253 left_tree
= Gogo::call_builtin(&empty_interface_compare_decl
,
6255 "__go_empty_interface_compare",
6258 TREE_TYPE(left_tree
),
6260 TREE_TYPE(right_tree
),
6262 if (left_tree
== error_mark_node
)
6263 return error_mark_node
;
6264 // This can panic if the type is uncomparable.
6265 TREE_NOTHROW(empty_interface_compare_decl
) = 0;
6269 gcc_assert(!right_type
->interface_type()->is_empty());
6270 static tree interface_compare_decl
;
6271 left_tree
= Gogo::call_builtin(&interface_compare_decl
,
6273 "__go_interface_compare",
6276 TREE_TYPE(left_tree
),
6278 TREE_TYPE(right_tree
),
6280 if (left_tree
== error_mark_node
)
6281 return error_mark_node
;
6282 // This can panic if the type is uncomparable.
6283 TREE_NOTHROW(interface_compare_decl
) = 0;
6285 right_tree
= build_int_cst_type(integer_type_node
, 0);
6288 if (left_type
->is_nil_type()
6289 && (op
== OPERATOR_EQEQ
|| op
== OPERATOR_NOTEQ
))
6291 std::swap(left_type
, right_type
);
6292 std::swap(left_tree
, right_tree
);
6295 if (right_type
->is_nil_type())
6297 if (left_type
->array_type() != NULL
6298 && left_type
->array_type()->length() == NULL
)
6300 Array_type
* at
= left_type
->array_type();
6301 left_tree
= at
->value_pointer_tree(context
->gogo(), left_tree
);
6302 right_tree
= fold_convert(TREE_TYPE(left_tree
), null_pointer_node
);
6304 else if (left_type
->interface_type() != NULL
)
6306 // An interface is nil if the first field is nil.
6307 tree left_type_tree
= TREE_TYPE(left_tree
);
6308 gcc_assert(TREE_CODE(left_type_tree
) == RECORD_TYPE
);
6309 tree field
= TYPE_FIELDS(left_type_tree
);
6310 left_tree
= build3(COMPONENT_REF
, TREE_TYPE(field
), left_tree
,
6312 right_tree
= fold_convert(TREE_TYPE(left_tree
), null_pointer_node
);
6316 gcc_assert(POINTER_TYPE_P(TREE_TYPE(left_tree
)));
6317 right_tree
= fold_convert(TREE_TYPE(left_tree
), null_pointer_node
);
6321 if (left_tree
== error_mark_node
|| right_tree
== error_mark_node
)
6322 return error_mark_node
;
6324 tree ret
= fold_build2(code
, boolean_type_node
, left_tree
, right_tree
);
6325 if (CAN_HAVE_LOCATION_P(ret
))
6326 SET_EXPR_LOCATION(ret
, location
);
6330 // Class Bound_method_expression.
6335 Bound_method_expression::do_traverse(Traverse
* traverse
)
6337 if (Expression::traverse(&this->expr_
, traverse
) == TRAVERSE_EXIT
)
6338 return TRAVERSE_EXIT
;
6339 return Expression::traverse(&this->method_
, traverse
);
6342 // Return the type of a bound method expression. The type of this
6343 // object is really the type of the method with no receiver. We
6344 // should be able to get away with just returning the type of the
6348 Bound_method_expression::do_type()
6350 return this->method_
->type();
6353 // Determine the types of a method expression.
6356 Bound_method_expression::do_determine_type(const Type_context
*)
6358 this->method_
->determine_type_no_context();
6359 Type
* mtype
= this->method_
->type();
6360 Function_type
* fntype
= mtype
== NULL
? NULL
: mtype
->function_type();
6361 if (fntype
== NULL
|| !fntype
->is_method())
6362 this->expr_
->determine_type_no_context();
6365 Type_context
subcontext(fntype
->receiver()->type(), false);
6366 this->expr_
->determine_type(&subcontext
);
6370 // Check the types of a method expression.
6373 Bound_method_expression::do_check_types(Gogo
*)
6375 Type
* type
= this->method_
->type()->deref();
6377 || type
->function_type() == NULL
6378 || !type
->function_type()->is_method())
6379 this->report_error(_("object is not a method"));
6382 Type
* rtype
= type
->function_type()->receiver()->type()->deref();
6383 Type
* etype
= (this->expr_type_
!= NULL
6385 : this->expr_
->type());
6386 etype
= etype
->deref();
6387 if (!Type::are_identical(rtype
, etype
, true, NULL
))
6388 this->report_error(_("method type does not match object type"));
6392 // Get the tree for a method expression. There is no standard tree
6393 // representation for this. The only places it may currently be used
6394 // are in a Call_expression or a Go_statement, which will take it
6395 // apart directly. So this has nothing to do at present.
6398 Bound_method_expression::do_get_tree(Translate_context
*)
6403 // Make a method expression.
6405 Bound_method_expression
*
6406 Expression::make_bound_method(Expression
* expr
, Expression
* method
,
6407 source_location location
)
6409 return new Bound_method_expression(expr
, method
, location
);
6412 // Class Builtin_call_expression. This is used for a call to a
6413 // builtin function.
6415 class Builtin_call_expression
: public Call_expression
6418 Builtin_call_expression(Gogo
* gogo
, Expression
* fn
, Expression_list
* args
,
6419 bool is_varargs
, source_location location
);
6422 // This overrides Call_expression::do_lower.
6424 do_lower(Gogo
*, Named_object
*, int);
6427 do_is_constant() const;
6430 do_integer_constant_value(bool, mpz_t
, Type
**) const;
6433 do_float_constant_value(mpfr_t
, Type
**) const;
6436 do_complex_constant_value(mpfr_t
, mpfr_t
, Type
**) const;
6442 do_determine_type(const Type_context
*);
6445 do_check_types(Gogo
*);
6450 return new Builtin_call_expression(this->gogo_
, this->fn()->copy(),
6451 this->args()->copy(),
6457 do_get_tree(Translate_context
*);
6460 do_export(Export
*) const;
6463 do_is_recover_call() const;
6466 do_set_recover_arg(Expression
*);
6469 // The builtin functions.
6470 enum Builtin_function_code
6474 // Predeclared builtin functions.
6491 // Builtin functions from the unsafe package.
6504 real_imag_type(Type
*);
6507 complex_type(Type
*);
6509 // A pointer back to the general IR structure. This avoids a global
6510 // variable, or passing it around everywhere.
6512 // The builtin function being called.
6513 Builtin_function_code code_
;
6514 // Used to stop endless loops when the length of an array uses len
6515 // or cap of the array itself.
6519 Builtin_call_expression::Builtin_call_expression(Gogo
* gogo
,
6521 Expression_list
* args
,
6523 source_location location
)
6524 : Call_expression(fn
, args
, is_varargs
, location
),
6525 gogo_(gogo
), code_(BUILTIN_INVALID
), seen_(false)
6527 Func_expression
* fnexp
= this->fn()->func_expression();
6528 gcc_assert(fnexp
!= NULL
);
6529 const std::string
& name(fnexp
->named_object()->name());
6530 if (name
== "append")
6531 this->code_
= BUILTIN_APPEND
;
6532 else if (name
== "cap")
6533 this->code_
= BUILTIN_CAP
;
6534 else if (name
== "close")
6535 this->code_
= BUILTIN_CLOSE
;
6536 else if (name
== "closed")
6537 this->code_
= BUILTIN_CLOSED
;
6538 else if (name
== "complex")
6539 this->code_
= BUILTIN_COMPLEX
;
6540 else if (name
== "copy")
6541 this->code_
= BUILTIN_COPY
;
6542 else if (name
== "imag")
6543 this->code_
= BUILTIN_IMAG
;
6544 else if (name
== "len")
6545 this->code_
= BUILTIN_LEN
;
6546 else if (name
== "make")
6547 this->code_
= BUILTIN_MAKE
;
6548 else if (name
== "new")
6549 this->code_
= BUILTIN_NEW
;
6550 else if (name
== "panic")
6551 this->code_
= BUILTIN_PANIC
;
6552 else if (name
== "print")
6553 this->code_
= BUILTIN_PRINT
;
6554 else if (name
== "println")
6555 this->code_
= BUILTIN_PRINTLN
;
6556 else if (name
== "real")
6557 this->code_
= BUILTIN_REAL
;
6558 else if (name
== "recover")
6559 this->code_
= BUILTIN_RECOVER
;
6560 else if (name
== "Alignof")
6561 this->code_
= BUILTIN_ALIGNOF
;
6562 else if (name
== "Offsetof")
6563 this->code_
= BUILTIN_OFFSETOF
;
6564 else if (name
== "Sizeof")
6565 this->code_
= BUILTIN_SIZEOF
;
6570 // Return whether this is a call to recover. This is a virtual
6571 // function called from the parent class.
6574 Builtin_call_expression::do_is_recover_call() const
6576 if (this->classification() == EXPRESSION_ERROR
)
6578 return this->code_
== BUILTIN_RECOVER
;
6581 // Set the argument for a call to recover.
6584 Builtin_call_expression::do_set_recover_arg(Expression
* arg
)
6586 const Expression_list
* args
= this->args();
6587 gcc_assert(args
== NULL
|| args
->empty());
6588 Expression_list
* new_args
= new Expression_list();
6589 new_args
->push_back(arg
);
6590 this->set_args(new_args
);
6593 // A traversal class which looks for a call expression.
6595 class Find_call_expression
: public Traverse
6598 Find_call_expression()
6599 : Traverse(traverse_expressions
),
6604 expression(Expression
**);
6608 { return this->found_
; }
6615 Find_call_expression::expression(Expression
** pexpr
)
6617 if ((*pexpr
)->call_expression() != NULL
)
6619 this->found_
= true;
6620 return TRAVERSE_EXIT
;
6622 return TRAVERSE_CONTINUE
;
6625 // Lower a builtin call expression. This turns new and make into
6626 // specific expressions. We also convert to a constant if we can.
6629 Builtin_call_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
6631 if (this->code_
== BUILTIN_NEW
)
6633 const Expression_list
* args
= this->args();
6634 if (args
== NULL
|| args
->size() < 1)
6635 this->report_error(_("not enough arguments"));
6636 else if (args
->size() > 1)
6637 this->report_error(_("too many arguments"));
6640 Expression
* arg
= args
->front();
6641 if (!arg
->is_type_expression())
6643 error_at(arg
->location(), "expected type");
6644 this->set_is_error();
6647 return Expression::make_allocation(arg
->type(), this->location());
6650 else if (this->code_
== BUILTIN_MAKE
)
6652 const Expression_list
* args
= this->args();
6653 if (args
== NULL
|| args
->size() < 1)
6654 this->report_error(_("not enough arguments"));
6657 Expression
* arg
= args
->front();
6658 if (!arg
->is_type_expression())
6660 error_at(arg
->location(), "expected type");
6661 this->set_is_error();
6665 Expression_list
* newargs
;
6666 if (args
->size() == 1)
6670 newargs
= new Expression_list();
6671 Expression_list::const_iterator p
= args
->begin();
6673 for (; p
!= args
->end(); ++p
)
6674 newargs
->push_back(*p
);
6676 return Expression::make_make(arg
->type(), newargs
,
6681 else if (this->is_constant())
6683 // We can only lower len and cap if there are no function calls
6684 // in the arguments. Otherwise we have to make the call.
6685 if (this->code_
== BUILTIN_LEN
|| this->code_
== BUILTIN_CAP
)
6687 Expression
* arg
= this->one_arg();
6688 if (!arg
->is_constant())
6690 Find_call_expression find_call
;
6691 Expression::traverse(&arg
, &find_call
);
6692 if (find_call
.found())
6700 if (this->integer_constant_value(true, ival
, &type
))
6702 Expression
* ret
= Expression::make_integer(&ival
, type
,
6711 if (this->float_constant_value(rval
, &type
))
6713 Expression
* ret
= Expression::make_float(&rval
, type
,
6721 if (this->complex_constant_value(rval
, imag
, &type
))
6723 Expression
* ret
= Expression::make_complex(&rval
, &imag
, type
,
6732 else if (this->code_
== BUILTIN_RECOVER
)
6734 if (function
!= NULL
)
6735 function
->func_value()->set_calls_recover();
6738 // Calling recover outside of a function always returns the
6739 // nil empty interface.
6740 Type
* eface
= Type::make_interface_type(NULL
, this->location());
6741 return Expression::make_cast(eface
,
6742 Expression::make_nil(this->location()),
6746 else if (this->code_
== BUILTIN_APPEND
)
6748 // Lower the varargs.
6749 const Expression_list
* args
= this->args();
6750 if (args
== NULL
|| args
->empty())
6752 Type
* slice_type
= args
->front()->type();
6753 if (!slice_type
->is_open_array_type())
6755 error_at(args
->front()->location(), "argument 1 must be a slice");
6756 this->set_is_error();
6759 return this->lower_varargs(gogo
, function
, slice_type
, 2);
6765 // Return the type of the real or imag functions, given the type of
6766 // the argument. We need to map complex to float, complex64 to
6767 // float32, and complex128 to float64, so it has to be done by name.
6768 // This returns NULL if it can't figure out the type.
6771 Builtin_call_expression::real_imag_type(Type
* arg_type
)
6773 if (arg_type
== NULL
|| arg_type
->is_abstract())
6775 Named_type
* nt
= arg_type
->named_type();
6778 while (nt
->real_type()->named_type() != NULL
)
6779 nt
= nt
->real_type()->named_type();
6780 if (nt
->name() == "complex64")
6781 return Type::lookup_float_type("float32");
6782 else if (nt
->name() == "complex128")
6783 return Type::lookup_float_type("float64");
6788 // Return the type of the complex function, given the type of one of the
6789 // argments. Like real_imag_type, we have to map by name.
6792 Builtin_call_expression::complex_type(Type
* arg_type
)
6794 if (arg_type
== NULL
|| arg_type
->is_abstract())
6796 Named_type
* nt
= arg_type
->named_type();
6799 while (nt
->real_type()->named_type() != NULL
)
6800 nt
= nt
->real_type()->named_type();
6801 if (nt
->name() == "float32")
6802 return Type::lookup_complex_type("complex64");
6803 else if (nt
->name() == "float64")
6804 return Type::lookup_complex_type("complex128");
6809 // Return a single argument, or NULL if there isn't one.
6812 Builtin_call_expression::one_arg() const
6814 const Expression_list
* args
= this->args();
6815 if (args
->size() != 1)
6817 return args
->front();
6820 // Return whether this is constant: len of a string, or len or cap of
6821 // a fixed array, or unsafe.Sizeof, unsafe.Offsetof, unsafe.Alignof.
6824 Builtin_call_expression::do_is_constant() const
6826 switch (this->code_
)
6834 Expression
* arg
= this->one_arg();
6837 Type
* arg_type
= arg
->type();
6839 if (arg_type
->points_to() != NULL
6840 && arg_type
->points_to()->array_type() != NULL
6841 && !arg_type
->points_to()->is_open_array_type())
6842 arg_type
= arg_type
->points_to();
6844 if (arg_type
->array_type() != NULL
6845 && arg_type
->array_type()->length() != NULL
)
6848 if (this->code_
== BUILTIN_LEN
&& arg_type
->is_string_type())
6851 bool ret
= arg
->is_constant();
6852 this->seen_
= false;
6858 case BUILTIN_SIZEOF
:
6859 case BUILTIN_ALIGNOF
:
6860 return this->one_arg() != NULL
;
6862 case BUILTIN_OFFSETOF
:
6864 Expression
* arg
= this->one_arg();
6867 return arg
->field_reference_expression() != NULL
;
6870 case BUILTIN_COMPLEX
:
6872 const Expression_list
* args
= this->args();
6873 if (args
!= NULL
&& args
->size() == 2)
6874 return args
->front()->is_constant() && args
->back()->is_constant();
6881 Expression
* arg
= this->one_arg();
6882 return arg
!= NULL
&& arg
->is_constant();
6892 // Return an integer constant value if possible.
6895 Builtin_call_expression::do_integer_constant_value(bool iota_is_constant
,
6899 if (this->code_
== BUILTIN_LEN
6900 || this->code_
== BUILTIN_CAP
)
6902 Expression
* arg
= this->one_arg();
6905 Type
* arg_type
= arg
->type();
6907 if (this->code_
== BUILTIN_LEN
&& arg_type
->is_string_type())
6910 if (arg
->string_constant_value(&sval
))
6912 mpz_set_ui(val
, sval
.length());
6913 *ptype
= Type::lookup_integer_type("int");
6918 if (arg_type
->points_to() != NULL
6919 && arg_type
->points_to()->array_type() != NULL
6920 && !arg_type
->points_to()->is_open_array_type())
6921 arg_type
= arg_type
->points_to();
6923 if (arg_type
->array_type() != NULL
6924 && arg_type
->array_type()->length() != NULL
)
6928 Expression
* e
= arg_type
->array_type()->length();
6930 bool r
= e
->integer_constant_value(iota_is_constant
, val
, ptype
);
6931 this->seen_
= false;
6934 *ptype
= Type::lookup_integer_type("int");
6939 else if (this->code_
== BUILTIN_SIZEOF
6940 || this->code_
== BUILTIN_ALIGNOF
)
6942 Expression
* arg
= this->one_arg();
6945 Type
* arg_type
= arg
->type();
6946 if (arg_type
->is_error_type() || arg_type
->is_undefined())
6948 if (arg_type
->is_abstract())
6950 tree arg_type_tree
= arg_type
->get_tree(this->gogo_
);
6951 unsigned long val_long
;
6952 if (this->code_
== BUILTIN_SIZEOF
)
6954 tree type_size
= TYPE_SIZE_UNIT(arg_type_tree
);
6955 gcc_assert(TREE_CODE(type_size
) == INTEGER_CST
);
6956 if (TREE_INT_CST_HIGH(type_size
) != 0)
6958 unsigned HOST_WIDE_INT val_wide
= TREE_INT_CST_LOW(type_size
);
6959 val_long
= static_cast<unsigned long>(val_wide
);
6960 if (val_long
!= val_wide
)
6963 else if (this->code_
== BUILTIN_ALIGNOF
)
6965 if (arg
->field_reference_expression() == NULL
)
6966 val_long
= go_type_alignment(arg_type_tree
);
6969 // Calling unsafe.Alignof(s.f) returns the alignment of
6970 // the type of f when it is used as a field in a struct.
6971 val_long
= go_field_alignment(arg_type_tree
);
6976 mpz_set_ui(val
, val_long
);
6980 else if (this->code_
== BUILTIN_OFFSETOF
)
6982 Expression
* arg
= this->one_arg();
6985 Field_reference_expression
* farg
= arg
->field_reference_expression();
6988 Expression
* struct_expr
= farg
->expr();
6989 Type
* st
= struct_expr
->type();
6990 if (st
->struct_type() == NULL
)
6992 tree struct_tree
= st
->get_tree(this->gogo_
);
6993 gcc_assert(TREE_CODE(struct_tree
) == RECORD_TYPE
);
6994 tree field
= TYPE_FIELDS(struct_tree
);
6995 for (unsigned int index
= farg
->field_index(); index
> 0; --index
)
6997 field
= DECL_CHAIN(field
);
6998 gcc_assert(field
!= NULL_TREE
);
7000 HOST_WIDE_INT offset_wide
= int_byte_position (field
);
7001 if (offset_wide
< 0)
7003 unsigned long offset_long
= static_cast<unsigned long>(offset_wide
);
7004 if (offset_long
!= static_cast<unsigned HOST_WIDE_INT
>(offset_wide
))
7006 mpz_set_ui(val
, offset_long
);
7012 // Return a floating point constant value if possible.
7015 Builtin_call_expression::do_float_constant_value(mpfr_t val
,
7018 if (this->code_
== BUILTIN_REAL
|| this->code_
== BUILTIN_IMAG
)
7020 Expression
* arg
= this->one_arg();
7031 if (arg
->complex_constant_value(real
, imag
, &type
))
7033 if (this->code_
== BUILTIN_REAL
)
7034 mpfr_set(val
, real
, GMP_RNDN
);
7036 mpfr_set(val
, imag
, GMP_RNDN
);
7037 *ptype
= Builtin_call_expression::real_imag_type(type
);
7049 // Return a complex constant value if possible.
7052 Builtin_call_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
7055 if (this->code_
== BUILTIN_COMPLEX
)
7057 const Expression_list
* args
= this->args();
7058 if (args
== NULL
|| args
->size() != 2)
7064 if (!args
->front()->float_constant_value(r
, &rtype
))
7075 if (args
->back()->float_constant_value(i
, &itype
)
7076 && Type::are_identical(rtype
, itype
, false, NULL
))
7078 mpfr_set(real
, r
, GMP_RNDN
);
7079 mpfr_set(imag
, i
, GMP_RNDN
);
7080 *ptype
= Builtin_call_expression::complex_type(rtype
);
7096 Builtin_call_expression::do_type()
7098 switch (this->code_
)
7100 case BUILTIN_INVALID
:
7107 const Expression_list
* args
= this->args();
7108 if (args
== NULL
|| args
->empty())
7109 return Type::make_error_type();
7110 return Type::make_pointer_type(args
->front()->type());
7116 case BUILTIN_ALIGNOF
:
7117 case BUILTIN_OFFSETOF
:
7118 case BUILTIN_SIZEOF
:
7119 return Type::lookup_integer_type("int");
7124 case BUILTIN_PRINTLN
:
7125 return Type::make_void_type();
7127 case BUILTIN_CLOSED
:
7128 return Type::lookup_bool_type();
7130 case BUILTIN_RECOVER
:
7131 return Type::make_interface_type(NULL
, BUILTINS_LOCATION
);
7133 case BUILTIN_APPEND
:
7135 const Expression_list
* args
= this->args();
7136 if (args
== NULL
|| args
->empty())
7137 return Type::make_error_type();
7138 return args
->front()->type();
7144 Expression
* arg
= this->one_arg();
7146 return Type::make_error_type();
7147 Type
* t
= arg
->type();
7148 if (t
->is_abstract())
7149 t
= t
->make_non_abstract_type();
7150 t
= Builtin_call_expression::real_imag_type(t
);
7152 t
= Type::make_error_type();
7156 case BUILTIN_COMPLEX
:
7158 const Expression_list
* args
= this->args();
7159 if (args
== NULL
|| args
->size() != 2)
7160 return Type::make_error_type();
7161 Type
* t
= args
->front()->type();
7162 if (t
->is_abstract())
7164 t
= args
->back()->type();
7165 if (t
->is_abstract())
7166 t
= t
->make_non_abstract_type();
7168 t
= Builtin_call_expression::complex_type(t
);
7170 t
= Type::make_error_type();
7176 // Determine the type.
7179 Builtin_call_expression::do_determine_type(const Type_context
* context
)
7181 this->fn()->determine_type_no_context();
7183 const Expression_list
* args
= this->args();
7186 Type
* arg_type
= NULL
;
7187 switch (this->code_
)
7190 case BUILTIN_PRINTLN
:
7191 // Do not force a large integer constant to "int".
7197 arg_type
= Builtin_call_expression::complex_type(context
->type
);
7201 case BUILTIN_COMPLEX
:
7203 // For the complex function the type of one operand can
7204 // determine the type of the other, as in a binary expression.
7205 arg_type
= Builtin_call_expression::real_imag_type(context
->type
);
7206 if (args
!= NULL
&& args
->size() == 2)
7208 Type
* t1
= args
->front()->type();
7209 Type
* t2
= args
->front()->type();
7210 if (!t1
->is_abstract())
7212 else if (!t2
->is_abstract())
7226 for (Expression_list::const_iterator pa
= args
->begin();
7230 Type_context subcontext
;
7231 subcontext
.type
= arg_type
;
7235 // We want to print large constants, we so can't just
7236 // use the appropriate nonabstract type. Use uint64 for
7237 // an integer if we know it is nonnegative, otherwise
7238 // use int64 for a integer, otherwise use float64 for a
7239 // float or complex128 for a complex.
7240 Type
* want_type
= NULL
;
7241 Type
* atype
= (*pa
)->type();
7242 if (atype
->is_abstract())
7244 if (atype
->integer_type() != NULL
)
7249 if (this->integer_constant_value(true, val
, &dummy
)
7250 && mpz_sgn(val
) >= 0)
7251 want_type
= Type::lookup_integer_type("uint64");
7253 want_type
= Type::lookup_integer_type("int64");
7256 else if (atype
->float_type() != NULL
)
7257 want_type
= Type::lookup_float_type("float64");
7258 else if (atype
->complex_type() != NULL
)
7259 want_type
= Type::lookup_complex_type("complex128");
7260 else if (atype
->is_abstract_string_type())
7261 want_type
= Type::lookup_string_type();
7262 else if (atype
->is_abstract_boolean_type())
7263 want_type
= Type::lookup_bool_type();
7266 subcontext
.type
= want_type
;
7270 (*pa
)->determine_type(&subcontext
);
7275 // If there is exactly one argument, return true. Otherwise give an
7276 // error message and return false.
7279 Builtin_call_expression::check_one_arg()
7281 const Expression_list
* args
= this->args();
7282 if (args
== NULL
|| args
->size() < 1)
7284 this->report_error(_("not enough arguments"));
7287 else if (args
->size() > 1)
7289 this->report_error(_("too many arguments"));
7292 if (args
->front()->is_error_expression()
7293 || args
->front()->type()->is_error_type()
7294 || args
->front()->type()->is_undefined())
7296 this->set_is_error();
7302 // Check argument types for a builtin function.
7305 Builtin_call_expression::do_check_types(Gogo
*)
7307 switch (this->code_
)
7309 case BUILTIN_INVALID
:
7317 // The single argument may be either a string or an array or a
7318 // map or a channel, or a pointer to a closed array.
7319 if (this->check_one_arg())
7321 Type
* arg_type
= this->one_arg()->type();
7322 if (arg_type
->points_to() != NULL
7323 && arg_type
->points_to()->array_type() != NULL
7324 && !arg_type
->points_to()->is_open_array_type())
7325 arg_type
= arg_type
->points_to();
7326 if (this->code_
== BUILTIN_CAP
)
7328 if (!arg_type
->is_error_type()
7329 && arg_type
->array_type() == NULL
7330 && arg_type
->channel_type() == NULL
)
7331 this->report_error(_("argument must be array or slice "
7336 if (!arg_type
->is_error_type()
7337 && !arg_type
->is_string_type()
7338 && arg_type
->array_type() == NULL
7339 && arg_type
->map_type() == NULL
7340 && arg_type
->channel_type() == NULL
)
7341 this->report_error(_("argument must be string or "
7342 "array or slice or map or channel"));
7349 case BUILTIN_PRINTLN
:
7351 const Expression_list
* args
= this->args();
7354 if (this->code_
== BUILTIN_PRINT
)
7355 warning_at(this->location(), 0,
7356 "no arguments for builtin function %<%s%>",
7357 (this->code_
== BUILTIN_PRINT
7363 for (Expression_list::const_iterator p
= args
->begin();
7367 Type
* type
= (*p
)->type();
7368 if (type
->is_error_type()
7369 || type
->is_string_type()
7370 || type
->integer_type() != NULL
7371 || type
->float_type() != NULL
7372 || type
->complex_type() != NULL
7373 || type
->is_boolean_type()
7374 || type
->points_to() != NULL
7375 || type
->interface_type() != NULL
7376 || type
->channel_type() != NULL
7377 || type
->map_type() != NULL
7378 || type
->function_type() != NULL
7379 || type
->is_open_array_type())
7382 this->report_error(_("unsupported argument type to "
7383 "builtin function"));
7390 case BUILTIN_CLOSED
:
7391 if (this->check_one_arg())
7393 if (this->one_arg()->type()->channel_type() == NULL
)
7394 this->report_error(_("argument must be channel"));
7399 case BUILTIN_SIZEOF
:
7400 case BUILTIN_ALIGNOF
:
7401 this->check_one_arg();
7404 case BUILTIN_RECOVER
:
7405 if (this->args() != NULL
&& !this->args()->empty())
7406 this->report_error(_("too many arguments"));
7409 case BUILTIN_OFFSETOF
:
7410 if (this->check_one_arg())
7412 Expression
* arg
= this->one_arg();
7413 if (arg
->field_reference_expression() == NULL
)
7414 this->report_error(_("argument must be a field reference"));
7420 const Expression_list
* args
= this->args();
7421 if (args
== NULL
|| args
->size() < 2)
7423 this->report_error(_("not enough arguments"));
7426 else if (args
->size() > 2)
7428 this->report_error(_("too many arguments"));
7431 Type
* arg1_type
= args
->front()->type();
7432 Type
* arg2_type
= args
->back()->type();
7433 if (arg1_type
->is_error_type() || arg2_type
->is_error_type())
7437 if (arg1_type
->is_open_array_type())
7438 e1
= arg1_type
->array_type()->element_type();
7441 this->report_error(_("left argument must be a slice"));
7446 if (arg2_type
->is_open_array_type())
7447 e2
= arg2_type
->array_type()->element_type();
7448 else if (arg2_type
->is_string_type())
7449 e2
= Type::lookup_integer_type("uint8");
7452 this->report_error(_("right argument must be a slice or a string"));
7456 if (!Type::are_identical(e1
, e2
, true, NULL
))
7457 this->report_error(_("element types must be the same"));
7461 case BUILTIN_APPEND
:
7463 const Expression_list
* args
= this->args();
7464 if (args
== NULL
|| args
->size() < 2)
7466 this->report_error(_("not enough arguments"));
7469 if (args
->size() > 2)
7471 this->report_error(_("too many arguments"));
7475 if (!Type::are_assignable(args
->front()->type(), args
->back()->type(),
7479 this->report_error(_("arguments 1 and 2 have different types"));
7482 error_at(this->location(),
7483 "arguments 1 and 2 have different types (%s)",
7485 this->set_is_error();
7493 if (this->check_one_arg())
7495 if (this->one_arg()->type()->complex_type() == NULL
)
7496 this->report_error(_("argument must have complex type"));
7500 case BUILTIN_COMPLEX
:
7502 const Expression_list
* args
= this->args();
7503 if (args
== NULL
|| args
->size() < 2)
7504 this->report_error(_("not enough arguments"));
7505 else if (args
->size() > 2)
7506 this->report_error(_("too many arguments"));
7507 else if (args
->front()->is_error_expression()
7508 || args
->front()->type()->is_error_type()
7509 || args
->back()->is_error_expression()
7510 || args
->back()->type()->is_error_type())
7511 this->set_is_error();
7512 else if (!Type::are_identical(args
->front()->type(),
7513 args
->back()->type(), true, NULL
))
7514 this->report_error(_("complex arguments must have identical types"));
7515 else if (args
->front()->type()->float_type() == NULL
)
7516 this->report_error(_("complex arguments must have "
7517 "floating-point type"));
7526 // Return the tree for a builtin function.
7529 Builtin_call_expression::do_get_tree(Translate_context
* context
)
7531 Gogo
* gogo
= context
->gogo();
7532 source_location location
= this->location();
7533 switch (this->code_
)
7535 case BUILTIN_INVALID
:
7543 const Expression_list
* args
= this->args();
7544 gcc_assert(args
!= NULL
&& args
->size() == 1);
7545 Expression
* arg
= *args
->begin();
7546 Type
* arg_type
= arg
->type();
7550 gcc_assert(saw_errors());
7551 return error_mark_node
;
7555 tree arg_tree
= arg
->get_tree(context
);
7557 this->seen_
= false;
7559 if (arg_tree
== error_mark_node
)
7560 return error_mark_node
;
7562 if (arg_type
->points_to() != NULL
)
7564 arg_type
= arg_type
->points_to();
7565 gcc_assert(arg_type
->array_type() != NULL
7566 && !arg_type
->is_open_array_type());
7567 gcc_assert(POINTER_TYPE_P(TREE_TYPE(arg_tree
)));
7568 arg_tree
= build_fold_indirect_ref(arg_tree
);
7572 if (this->code_
== BUILTIN_LEN
)
7574 if (arg_type
->is_string_type())
7575 val_tree
= String_type::length_tree(gogo
, arg_tree
);
7576 else if (arg_type
->array_type() != NULL
)
7580 gcc_assert(saw_errors());
7581 return error_mark_node
;
7584 val_tree
= arg_type
->array_type()->length_tree(gogo
, arg_tree
);
7585 this->seen_
= false;
7587 else if (arg_type
->map_type() != NULL
)
7589 static tree map_len_fndecl
;
7590 val_tree
= Gogo::call_builtin(&map_len_fndecl
,
7595 arg_type
->get_tree(gogo
),
7598 else if (arg_type
->channel_type() != NULL
)
7600 static tree chan_len_fndecl
;
7601 val_tree
= Gogo::call_builtin(&chan_len_fndecl
,
7606 arg_type
->get_tree(gogo
),
7614 if (arg_type
->array_type() != NULL
)
7618 gcc_assert(saw_errors());
7619 return error_mark_node
;
7622 val_tree
= arg_type
->array_type()->capacity_tree(gogo
,
7624 this->seen_
= false;
7626 else if (arg_type
->channel_type() != NULL
)
7628 static tree chan_cap_fndecl
;
7629 val_tree
= Gogo::call_builtin(&chan_cap_fndecl
,
7634 arg_type
->get_tree(gogo
),
7641 if (val_tree
== error_mark_node
)
7642 return error_mark_node
;
7644 tree type_tree
= Type::lookup_integer_type("int")->get_tree(gogo
);
7645 if (type_tree
== TREE_TYPE(val_tree
))
7648 return fold(convert_to_integer(type_tree
, val_tree
));
7652 case BUILTIN_PRINTLN
:
7654 const bool is_ln
= this->code_
== BUILTIN_PRINTLN
;
7655 tree stmt_list
= NULL_TREE
;
7657 const Expression_list
* call_args
= this->args();
7658 if (call_args
!= NULL
)
7660 for (Expression_list::const_iterator p
= call_args
->begin();
7661 p
!= call_args
->end();
7664 if (is_ln
&& p
!= call_args
->begin())
7666 static tree print_space_fndecl
;
7667 tree call
= Gogo::call_builtin(&print_space_fndecl
,
7672 if (call
== error_mark_node
)
7673 return error_mark_node
;
7674 append_to_statement_list(call
, &stmt_list
);
7677 Type
* type
= (*p
)->type();
7679 tree arg
= (*p
)->get_tree(context
);
7680 if (arg
== error_mark_node
)
7681 return error_mark_node
;
7685 if (type
->is_string_type())
7687 static tree print_string_fndecl
;
7688 pfndecl
= &print_string_fndecl
;
7689 fnname
= "__go_print_string";
7691 else if (type
->integer_type() != NULL
7692 && type
->integer_type()->is_unsigned())
7694 static tree print_uint64_fndecl
;
7695 pfndecl
= &print_uint64_fndecl
;
7696 fnname
= "__go_print_uint64";
7697 Type
* itype
= Type::lookup_integer_type("uint64");
7698 arg
= fold_convert_loc(location
, itype
->get_tree(gogo
),
7701 else if (type
->integer_type() != NULL
)
7703 static tree print_int64_fndecl
;
7704 pfndecl
= &print_int64_fndecl
;
7705 fnname
= "__go_print_int64";
7706 Type
* itype
= Type::lookup_integer_type("int64");
7707 arg
= fold_convert_loc(location
, itype
->get_tree(gogo
),
7710 else if (type
->float_type() != NULL
)
7712 static tree print_double_fndecl
;
7713 pfndecl
= &print_double_fndecl
;
7714 fnname
= "__go_print_double";
7715 arg
= fold_convert_loc(location
, double_type_node
, arg
);
7717 else if (type
->complex_type() != NULL
)
7719 static tree print_complex_fndecl
;
7720 pfndecl
= &print_complex_fndecl
;
7721 fnname
= "__go_print_complex";
7722 arg
= fold_convert_loc(location
, complex_double_type_node
,
7725 else if (type
->is_boolean_type())
7727 static tree print_bool_fndecl
;
7728 pfndecl
= &print_bool_fndecl
;
7729 fnname
= "__go_print_bool";
7731 else if (type
->points_to() != NULL
7732 || type
->channel_type() != NULL
7733 || type
->map_type() != NULL
7734 || type
->function_type() != NULL
)
7736 static tree print_pointer_fndecl
;
7737 pfndecl
= &print_pointer_fndecl
;
7738 fnname
= "__go_print_pointer";
7739 arg
= fold_convert_loc(location
, ptr_type_node
, arg
);
7741 else if (type
->interface_type() != NULL
)
7743 if (type
->interface_type()->is_empty())
7745 static tree print_empty_interface_fndecl
;
7746 pfndecl
= &print_empty_interface_fndecl
;
7747 fnname
= "__go_print_empty_interface";
7751 static tree print_interface_fndecl
;
7752 pfndecl
= &print_interface_fndecl
;
7753 fnname
= "__go_print_interface";
7756 else if (type
->is_open_array_type())
7758 static tree print_slice_fndecl
;
7759 pfndecl
= &print_slice_fndecl
;
7760 fnname
= "__go_print_slice";
7765 tree call
= Gogo::call_builtin(pfndecl
,
7772 if (call
== error_mark_node
)
7773 return error_mark_node
;
7774 append_to_statement_list(call
, &stmt_list
);
7780 static tree print_nl_fndecl
;
7781 tree call
= Gogo::call_builtin(&print_nl_fndecl
,
7786 if (call
== error_mark_node
)
7787 return error_mark_node
;
7788 append_to_statement_list(call
, &stmt_list
);
7796 const Expression_list
* args
= this->args();
7797 gcc_assert(args
!= NULL
&& args
->size() == 1);
7798 Expression
* arg
= args
->front();
7799 tree arg_tree
= arg
->get_tree(context
);
7800 if (arg_tree
== error_mark_node
)
7801 return error_mark_node
;
7802 Type
*empty
= Type::make_interface_type(NULL
, BUILTINS_LOCATION
);
7803 arg_tree
= Expression::convert_for_assignment(context
, empty
,
7805 arg_tree
, location
);
7806 static tree panic_fndecl
;
7807 tree call
= Gogo::call_builtin(&panic_fndecl
,
7812 TREE_TYPE(arg_tree
),
7814 if (call
== error_mark_node
)
7815 return error_mark_node
;
7816 // This function will throw an exception.
7817 TREE_NOTHROW(panic_fndecl
) = 0;
7818 // This function will not return.
7819 TREE_THIS_VOLATILE(panic_fndecl
) = 1;
7823 case BUILTIN_RECOVER
:
7825 // The argument is set when building recover thunks. It's a
7826 // boolean value which is true if we can recover a value now.
7827 const Expression_list
* args
= this->args();
7828 gcc_assert(args
!= NULL
&& args
->size() == 1);
7829 Expression
* arg
= args
->front();
7830 tree arg_tree
= arg
->get_tree(context
);
7831 if (arg_tree
== error_mark_node
)
7832 return error_mark_node
;
7834 Type
*empty
= Type::make_interface_type(NULL
, BUILTINS_LOCATION
);
7835 tree empty_tree
= empty
->get_tree(context
->gogo());
7837 Type
* nil_type
= Type::make_nil_type();
7838 Expression
* nil
= Expression::make_nil(location
);
7839 tree nil_tree
= nil
->get_tree(context
);
7840 tree empty_nil_tree
= Expression::convert_for_assignment(context
,
7846 // We need to handle a deferred call to recover specially,
7847 // because it changes whether it can recover a panic or not.
7848 // See test7 in test/recover1.go.
7850 if (this->is_deferred())
7852 static tree deferred_recover_fndecl
;
7853 call
= Gogo::call_builtin(&deferred_recover_fndecl
,
7855 "__go_deferred_recover",
7861 static tree recover_fndecl
;
7862 call
= Gogo::call_builtin(&recover_fndecl
,
7868 if (call
== error_mark_node
)
7869 return error_mark_node
;
7870 return fold_build3_loc(location
, COND_EXPR
, empty_tree
, arg_tree
,
7871 call
, empty_nil_tree
);
7875 case BUILTIN_CLOSED
:
7877 const Expression_list
* args
= this->args();
7878 gcc_assert(args
!= NULL
&& args
->size() == 1);
7879 Expression
* arg
= args
->front();
7880 tree arg_tree
= arg
->get_tree(context
);
7881 if (arg_tree
== error_mark_node
)
7882 return error_mark_node
;
7883 if (this->code_
== BUILTIN_CLOSE
)
7885 static tree close_fndecl
;
7886 return Gogo::call_builtin(&close_fndecl
,
7888 "__go_builtin_close",
7891 TREE_TYPE(arg_tree
),
7896 static tree closed_fndecl
;
7897 return Gogo::call_builtin(&closed_fndecl
,
7899 "__go_builtin_closed",
7902 TREE_TYPE(arg_tree
),
7907 case BUILTIN_SIZEOF
:
7908 case BUILTIN_OFFSETOF
:
7909 case BUILTIN_ALIGNOF
:
7914 bool b
= this->integer_constant_value(true, val
, &dummy
);
7916 tree type
= Type::lookup_integer_type("int")->get_tree(gogo
);
7917 tree ret
= Expression::integer_constant_tree(val
, type
);
7924 const Expression_list
* args
= this->args();
7925 gcc_assert(args
!= NULL
&& args
->size() == 2);
7926 Expression
* arg1
= args
->front();
7927 Expression
* arg2
= args
->back();
7929 tree arg1_tree
= arg1
->get_tree(context
);
7930 tree arg2_tree
= arg2
->get_tree(context
);
7931 if (arg1_tree
== error_mark_node
|| arg2_tree
== error_mark_node
)
7932 return error_mark_node
;
7934 Type
* arg1_type
= arg1
->type();
7935 Array_type
* at
= arg1_type
->array_type();
7936 arg1_tree
= save_expr(arg1_tree
);
7937 tree arg1_val
= at
->value_pointer_tree(gogo
, arg1_tree
);
7938 tree arg1_len
= at
->length_tree(gogo
, arg1_tree
);
7939 if (arg1_val
== error_mark_node
|| arg1_len
== error_mark_node
)
7940 return error_mark_node
;
7942 Type
* arg2_type
= arg2
->type();
7945 if (arg2_type
->is_open_array_type())
7947 at
= arg2_type
->array_type();
7948 arg2_tree
= save_expr(arg2_tree
);
7949 arg2_val
= at
->value_pointer_tree(gogo
, arg2_tree
);
7950 arg2_len
= at
->length_tree(gogo
, arg2_tree
);
7954 arg2_tree
= save_expr(arg2_tree
);
7955 arg2_val
= String_type::bytes_tree(gogo
, arg2_tree
);
7956 arg2_len
= String_type::length_tree(gogo
, arg2_tree
);
7958 if (arg2_val
== error_mark_node
|| arg2_len
== error_mark_node
)
7959 return error_mark_node
;
7961 arg1_len
= save_expr(arg1_len
);
7962 arg2_len
= save_expr(arg2_len
);
7963 tree len
= fold_build3_loc(location
, COND_EXPR
, TREE_TYPE(arg1_len
),
7964 fold_build2_loc(location
, LT_EXPR
,
7966 arg1_len
, arg2_len
),
7967 arg1_len
, arg2_len
);
7968 len
= save_expr(len
);
7970 Type
* element_type
= at
->element_type();
7971 tree element_type_tree
= element_type
->get_tree(gogo
);
7972 if (element_type_tree
== error_mark_node
)
7973 return error_mark_node
;
7974 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
7975 tree bytecount
= fold_convert_loc(location
, TREE_TYPE(element_size
),
7977 bytecount
= fold_build2_loc(location
, MULT_EXPR
,
7978 TREE_TYPE(element_size
),
7979 bytecount
, element_size
);
7980 bytecount
= fold_convert_loc(location
, size_type_node
, bytecount
);
7982 arg1_val
= fold_convert_loc(location
, ptr_type_node
, arg1_val
);
7983 arg2_val
= fold_convert_loc(location
, ptr_type_node
, arg2_val
);
7985 static tree copy_fndecl
;
7986 tree call
= Gogo::call_builtin(©_fndecl
,
7997 if (call
== error_mark_node
)
7998 return error_mark_node
;
8000 return fold_build2_loc(location
, COMPOUND_EXPR
, TREE_TYPE(len
),
8004 case BUILTIN_APPEND
:
8006 const Expression_list
* args
= this->args();
8007 gcc_assert(args
!= NULL
&& args
->size() == 2);
8008 Expression
* arg1
= args
->front();
8009 Expression
* arg2
= args
->back();
8011 tree arg1_tree
= arg1
->get_tree(context
);
8012 tree arg2_tree
= arg2
->get_tree(context
);
8013 if (arg1_tree
== error_mark_node
|| arg2_tree
== error_mark_node
)
8014 return error_mark_node
;
8016 Array_type
* at
= arg1
->type()->array_type();
8017 Type
* element_type
= at
->element_type();
8019 arg2_tree
= Expression::convert_for_assignment(context
, at
,
8023 if (arg2_tree
== error_mark_node
)
8024 return error_mark_node
;
8026 arg2_tree
= save_expr(arg2_tree
);
8027 tree arg2_val
= at
->value_pointer_tree(gogo
, arg2_tree
);
8028 tree arg2_len
= at
->length_tree(gogo
, arg2_tree
);
8029 if (arg2_val
== error_mark_node
|| arg2_len
== error_mark_node
)
8030 return error_mark_node
;
8031 arg2_val
= fold_convert_loc(location
, ptr_type_node
, arg2_val
);
8032 arg2_len
= fold_convert_loc(location
, size_type_node
, arg2_len
);
8034 tree element_type_tree
= element_type
->get_tree(gogo
);
8035 if (element_type_tree
== error_mark_node
)
8036 return error_mark_node
;
8037 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
8038 element_size
= fold_convert_loc(location
, size_type_node
,
8041 // We rebuild the decl each time since the slice types may
8043 tree append_fndecl
= NULL_TREE
;
8044 return Gogo::call_builtin(&append_fndecl
,
8048 TREE_TYPE(arg1_tree
),
8049 TREE_TYPE(arg1_tree
),
8062 const Expression_list
* args
= this->args();
8063 gcc_assert(args
!= NULL
&& args
->size() == 1);
8064 Expression
* arg
= args
->front();
8065 tree arg_tree
= arg
->get_tree(context
);
8066 if (arg_tree
== error_mark_node
)
8067 return error_mark_node
;
8068 gcc_assert(COMPLEX_FLOAT_TYPE_P(TREE_TYPE(arg_tree
)));
8069 if (this->code_
== BUILTIN_REAL
)
8070 return fold_build1_loc(location
, REALPART_EXPR
,
8071 TREE_TYPE(TREE_TYPE(arg_tree
)),
8074 return fold_build1_loc(location
, IMAGPART_EXPR
,
8075 TREE_TYPE(TREE_TYPE(arg_tree
)),
8079 case BUILTIN_COMPLEX
:
8081 const Expression_list
* args
= this->args();
8082 gcc_assert(args
!= NULL
&& args
->size() == 2);
8083 tree r
= args
->front()->get_tree(context
);
8084 tree i
= args
->back()->get_tree(context
);
8085 if (r
== error_mark_node
|| i
== error_mark_node
)
8086 return error_mark_node
;
8087 gcc_assert(TYPE_MAIN_VARIANT(TREE_TYPE(r
))
8088 == TYPE_MAIN_VARIANT(TREE_TYPE(i
)));
8089 gcc_assert(SCALAR_FLOAT_TYPE_P(TREE_TYPE(r
)));
8090 return fold_build2_loc(location
, COMPLEX_EXPR
,
8091 build_complex_type(TREE_TYPE(r
)),
8100 // We have to support exporting a builtin call expression, because
8101 // code can set a constant to the result of a builtin expression.
8104 Builtin_call_expression::do_export(Export
* exp
) const
8111 if (this->integer_constant_value(true, val
, &dummy
))
8113 Integer_expression::export_integer(exp
, val
);
8122 if (this->float_constant_value(fval
, &dummy
))
8124 Float_expression::export_float(exp
, fval
);
8136 if (this->complex_constant_value(real
, imag
, &dummy
))
8138 Complex_expression::export_complex(exp
, real
, imag
);
8147 error_at(this->location(), "value is not constant");
8151 // A trailing space lets us reliably identify the end of the number.
8152 exp
->write_c_string(" ");
8155 // Class Call_expression.
8160 Call_expression::do_traverse(Traverse
* traverse
)
8162 if (Expression::traverse(&this->fn_
, traverse
) == TRAVERSE_EXIT
)
8163 return TRAVERSE_EXIT
;
8164 if (this->args_
!= NULL
)
8166 if (this->args_
->traverse(traverse
) == TRAVERSE_EXIT
)
8167 return TRAVERSE_EXIT
;
8169 return TRAVERSE_CONTINUE
;
8172 // Lower a call statement.
8175 Call_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
8177 // A type case can look like a function call.
8178 if (this->fn_
->is_type_expression()
8179 && this->args_
!= NULL
8180 && this->args_
->size() == 1)
8181 return Expression::make_cast(this->fn_
->type(), this->args_
->front(),
8184 // Recognize a call to a builtin function.
8185 Func_expression
* fne
= this->fn_
->func_expression();
8187 && fne
->named_object()->is_function_declaration()
8188 && fne
->named_object()->func_declaration_value()->type()->is_builtin())
8189 return new Builtin_call_expression(gogo
, this->fn_
, this->args_
,
8190 this->is_varargs_
, this->location());
8192 // Handle an argument which is a call to a function which returns
8193 // multiple results.
8194 if (this->args_
!= NULL
8195 && this->args_
->size() == 1
8196 && this->args_
->front()->call_expression() != NULL
8197 && this->fn_
->type()->function_type() != NULL
)
8199 Function_type
* fntype
= this->fn_
->type()->function_type();
8200 size_t rc
= this->args_
->front()->call_expression()->result_count();
8202 && fntype
->parameters() != NULL
8203 && (fntype
->parameters()->size() == rc
8204 || (fntype
->is_varargs()
8205 && fntype
->parameters()->size() - 1 <= rc
)))
8207 Call_expression
* call
= this->args_
->front()->call_expression();
8208 Expression_list
* args
= new Expression_list
;
8209 for (size_t i
= 0; i
< rc
; ++i
)
8210 args
->push_back(Expression::make_call_result(call
, i
));
8211 // We can't return a new call expression here, because this
8212 // one may be referenced by Call_result expressions. FIXME.
8218 // Handle a call to a varargs function by packaging up the extra
8220 if (this->fn_
->type()->function_type() != NULL
8221 && this->fn_
->type()->function_type()->is_varargs())
8223 Function_type
* fntype
= this->fn_
->type()->function_type();
8224 const Typed_identifier_list
* parameters
= fntype
->parameters();
8225 gcc_assert(parameters
!= NULL
&& !parameters
->empty());
8226 Type
* varargs_type
= parameters
->back().type();
8227 return this->lower_varargs(gogo
, function
, varargs_type
,
8228 parameters
->size());
8234 // Lower a call to a varargs function. FUNCTION is the function in
8235 // which the call occurs--it's not the function we are calling.
8236 // VARARGS_TYPE is the type of the varargs parameter, a slice type.
8237 // PARAM_COUNT is the number of parameters of the function we are
8238 // calling; the last of these parameters will be the varargs
8242 Call_expression::lower_varargs(Gogo
* gogo
, Named_object
* function
,
8243 Type
* varargs_type
, size_t param_count
)
8245 if (this->varargs_are_lowered_
)
8248 source_location loc
= this->location();
8250 gcc_assert(param_count
> 0);
8251 gcc_assert(varargs_type
->is_open_array_type());
8253 size_t arg_count
= this->args_
== NULL
? 0 : this->args_
->size();
8254 if (arg_count
< param_count
- 1)
8256 // Not enough arguments; will be caught in check_types.
8260 Expression_list
* old_args
= this->args_
;
8261 Expression_list
* new_args
= new Expression_list();
8262 bool push_empty_arg
= false;
8263 if (old_args
== NULL
|| old_args
->empty())
8265 gcc_assert(param_count
== 1);
8266 push_empty_arg
= true;
8270 Expression_list::const_iterator pa
;
8272 for (pa
= old_args
->begin(); pa
!= old_args
->end(); ++pa
, ++i
)
8274 if (static_cast<size_t>(i
) == param_count
)
8276 new_args
->push_back(*pa
);
8279 // We have reached the varargs parameter.
8281 bool issued_error
= false;
8282 if (pa
== old_args
->end())
8283 push_empty_arg
= true;
8284 else if (pa
+ 1 == old_args
->end() && this->is_varargs_
)
8285 new_args
->push_back(*pa
);
8286 else if (this->is_varargs_
)
8288 this->report_error(_("too many arguments"));
8291 else if (pa
+ 1 == old_args
->end()
8292 && this->is_compatible_varargs_argument(function
, *pa
,
8295 new_args
->push_back(*pa
);
8298 Type
* element_type
= varargs_type
->array_type()->element_type();
8299 Expression_list
* vals
= new Expression_list
;
8300 for (; pa
!= old_args
->end(); ++pa
, ++i
)
8302 // Check types here so that we get a better message.
8303 Type
* patype
= (*pa
)->type();
8304 source_location paloc
= (*pa
)->location();
8305 if (!this->check_argument_type(i
, element_type
, patype
,
8306 paloc
, issued_error
))
8308 vals
->push_back(*pa
);
8311 Expression::make_slice_composite_literal(varargs_type
, vals
, loc
);
8312 new_args
->push_back(val
);
8317 new_args
->push_back(Expression::make_nil(loc
));
8319 // We can't return a new call expression here, because this one may
8320 // be referenced by Call_result expressions. FIXME.
8321 if (old_args
!= NULL
)
8323 this->args_
= new_args
;
8324 this->varargs_are_lowered_
= true;
8326 // Lower all the new subexpressions.
8327 Expression
* ret
= this;
8328 gogo
->lower_expression(function
, &ret
);
8329 gcc_assert(ret
== this);
8333 // Return true if ARG is a varargs argment which should be passed to
8334 // the varargs parameter of type PARAM_TYPE without wrapping. ARG
8335 // will be the last argument passed in the call, and PARAM_TYPE will
8336 // be the type of the last parameter of the varargs function being
8340 Call_expression::is_compatible_varargs_argument(Named_object
* function
,
8345 *issued_error
= false;
8347 Type
* var_type
= NULL
;
8349 // The simple case is passing the varargs parameter of the caller.
8350 Var_expression
* ve
= arg
->var_expression();
8351 if (ve
!= NULL
&& ve
->named_object()->is_variable())
8353 Variable
* var
= ve
->named_object()->var_value();
8354 if (var
->is_varargs_parameter())
8355 var_type
= var
->type();
8358 // The complex case is passing the varargs parameter of some
8359 // enclosing function. This will look like passing down *c.f where
8360 // c is the closure variable and f is a field in the closure.
8361 if (function
!= NULL
8362 && function
->func_value()->needs_closure()
8363 && arg
->classification() == EXPRESSION_UNARY
)
8365 Unary_expression
* ue
= static_cast<Unary_expression
*>(arg
);
8366 if (ue
->op() == OPERATOR_MULT
)
8368 Field_reference_expression
* fre
=
8369 ue
->operand()->deref()->field_reference_expression();
8372 Var_expression
* ve
= fre
->expr()->deref()->var_expression();
8375 Named_object
* no
= ve
->named_object();
8376 Function
* f
= function
->func_value();
8377 if (no
== f
->closure_var())
8379 // At this point we know that this indeed a
8380 // reference to some enclosing variable. Now we
8381 // need to figure out whether that variable is a
8382 // varargs parameter.
8383 Named_object
* enclosing
=
8384 f
->enclosing_var(fre
->field_index());
8385 Variable
* var
= enclosing
->var_value();
8386 if (var
->is_varargs_parameter())
8387 var_type
= var
->type();
8394 if (var_type
== NULL
)
8397 // We only match if the parameter is the same, with an identical
8399 Array_type
* var_at
= var_type
->array_type();
8400 gcc_assert(var_at
!= NULL
);
8401 Array_type
* param_at
= param_type
->array_type();
8402 if (param_at
!= NULL
8403 && Type::are_identical(var_at
->element_type(),
8404 param_at
->element_type(), true, NULL
))
8406 error_at(arg
->location(), "... mismatch: passing ...T as ...");
8407 *issued_error
= true;
8411 // Get the function type. Returns NULL if we don't know the type. If
8412 // this returns NULL, and if_ERROR is true, issues an error.
8415 Call_expression::get_function_type() const
8417 return this->fn_
->type()->function_type();
8420 // Return the number of values which this call will return.
8423 Call_expression::result_count() const
8425 const Function_type
* fntype
= this->get_function_type();
8428 if (fntype
->results() == NULL
)
8430 return fntype
->results()->size();
8433 // Return whether this is a call to the predeclared function recover.
8436 Call_expression::is_recover_call() const
8438 return this->do_is_recover_call();
8441 // Set the argument to the recover function.
8444 Call_expression::set_recover_arg(Expression
* arg
)
8446 this->do_set_recover_arg(arg
);
8449 // Virtual functions also implemented by Builtin_call_expression.
8452 Call_expression::do_is_recover_call() const
8458 Call_expression::do_set_recover_arg(Expression
*)
8466 Call_expression::do_type()
8468 if (this->type_
!= NULL
)
8472 Function_type
* fntype
= this->get_function_type();
8474 return Type::make_error_type();
8476 const Typed_identifier_list
* results
= fntype
->results();
8477 if (results
== NULL
)
8478 ret
= Type::make_void_type();
8479 else if (results
->size() == 1)
8480 ret
= results
->begin()->type();
8482 ret
= Type::make_call_multiple_result_type(this);
8489 // Determine types for a call expression. We can use the function
8490 // parameter types to set the types of the arguments.
8493 Call_expression::do_determine_type(const Type_context
*)
8495 this->fn_
->determine_type_no_context();
8496 Function_type
* fntype
= this->get_function_type();
8497 const Typed_identifier_list
* parameters
= NULL
;
8499 parameters
= fntype
->parameters();
8500 if (this->args_
!= NULL
)
8502 Typed_identifier_list::const_iterator pt
;
8503 if (parameters
!= NULL
)
8504 pt
= parameters
->begin();
8505 for (Expression_list::const_iterator pa
= this->args_
->begin();
8506 pa
!= this->args_
->end();
8509 if (parameters
!= NULL
&& pt
!= parameters
->end())
8511 Type_context
subcontext(pt
->type(), false);
8512 (*pa
)->determine_type(&subcontext
);
8516 (*pa
)->determine_type_no_context();
8521 // Check types for parameter I.
8524 Call_expression::check_argument_type(int i
, const Type
* parameter_type
,
8525 const Type
* argument_type
,
8526 source_location argument_location
,
8530 if (!Type::are_assignable(parameter_type
, argument_type
, &reason
))
8535 error_at(argument_location
, "argument %d has incompatible type", i
);
8537 error_at(argument_location
,
8538 "argument %d has incompatible type (%s)",
8541 this->set_is_error();
8550 Call_expression::do_check_types(Gogo
*)
8552 Function_type
* fntype
= this->get_function_type();
8555 if (!this->fn_
->type()->is_error_type())
8556 this->report_error(_("expected function"));
8560 if (fntype
->is_method())
8562 // We don't support pointers to methods, so the function has to
8563 // be a bound method expression.
8564 Bound_method_expression
* bme
= this->fn_
->bound_method_expression();
8567 this->report_error(_("method call without object"));
8570 Type
* first_arg_type
= bme
->first_argument()->type();
8571 if (first_arg_type
->points_to() == NULL
)
8573 // When passing a value, we need to check that we are
8574 // permitted to copy it.
8576 if (!Type::are_assignable(fntype
->receiver()->type(),
8577 first_arg_type
, &reason
))
8580 this->report_error(_("incompatible type for receiver"));
8583 error_at(this->location(),
8584 "incompatible type for receiver (%s)",
8586 this->set_is_error();
8592 // Note that varargs was handled by the lower_varargs() method, so
8593 // we don't have to worry about it here.
8595 const Typed_identifier_list
* parameters
= fntype
->parameters();
8596 if (this->args_
== NULL
)
8598 if (parameters
!= NULL
&& !parameters
->empty())
8599 this->report_error(_("not enough arguments"));
8601 else if (parameters
== NULL
)
8602 this->report_error(_("too many arguments"));
8606 Typed_identifier_list::const_iterator pt
= parameters
->begin();
8607 for (Expression_list::const_iterator pa
= this->args_
->begin();
8608 pa
!= this->args_
->end();
8611 if (pt
== parameters
->end())
8613 this->report_error(_("too many arguments"));
8616 this->check_argument_type(i
+ 1, pt
->type(), (*pa
)->type(),
8617 (*pa
)->location(), false);
8619 if (pt
!= parameters
->end())
8620 this->report_error(_("not enough arguments"));
8624 // Return whether we have to use a temporary variable to ensure that
8625 // we evaluate this call expression in order. If the call returns no
8626 // results then it will inevitably be executed last. If the call
8627 // returns more than one result then it will be used with Call_result
8628 // expressions. So we only have to use a temporary variable if the
8629 // call returns exactly one result.
8632 Call_expression::do_must_eval_in_order() const
8634 return this->result_count() == 1;
8637 // Get the function and the first argument to use when calling a bound
8641 Call_expression::bound_method_function(Translate_context
* context
,
8642 Bound_method_expression
* bound_method
,
8643 tree
* first_arg_ptr
)
8645 Expression
* first_argument
= bound_method
->first_argument();
8646 tree first_arg
= first_argument
->get_tree(context
);
8647 if (first_arg
== error_mark_node
)
8648 return error_mark_node
;
8650 // We always pass a pointer to the first argument when calling a
8652 if (first_argument
->type()->points_to() == NULL
)
8654 tree pointer_to_arg_type
= build_pointer_type(TREE_TYPE(first_arg
));
8655 if (TREE_ADDRESSABLE(TREE_TYPE(first_arg
))
8656 || DECL_P(first_arg
)
8657 || TREE_CODE(first_arg
) == INDIRECT_REF
8658 || TREE_CODE(first_arg
) == COMPONENT_REF
)
8660 first_arg
= build_fold_addr_expr(first_arg
);
8661 if (DECL_P(first_arg
))
8662 TREE_ADDRESSABLE(first_arg
) = 1;
8666 tree tmp
= create_tmp_var(TREE_TYPE(first_arg
),
8667 get_name(first_arg
));
8668 DECL_IGNORED_P(tmp
) = 0;
8669 DECL_INITIAL(tmp
) = first_arg
;
8670 first_arg
= build2(COMPOUND_EXPR
, pointer_to_arg_type
,
8671 build1(DECL_EXPR
, void_type_node
, tmp
),
8672 build_fold_addr_expr(tmp
));
8673 TREE_ADDRESSABLE(tmp
) = 1;
8675 if (first_arg
== error_mark_node
)
8676 return error_mark_node
;
8679 Type
* fatype
= bound_method
->first_argument_type();
8682 if (fatype
->points_to() == NULL
)
8683 fatype
= Type::make_pointer_type(fatype
);
8684 first_arg
= fold_convert(fatype
->get_tree(context
->gogo()), first_arg
);
8685 if (first_arg
== error_mark_node
8686 || TREE_TYPE(first_arg
) == error_mark_node
)
8687 return error_mark_node
;
8690 *first_arg_ptr
= first_arg
;
8692 return bound_method
->method()->get_tree(context
);
8695 // Get the function and the first argument to use when calling an
8696 // interface method.
8699 Call_expression::interface_method_function(
8700 Translate_context
* context
,
8701 Interface_field_reference_expression
* interface_method
,
8702 tree
* first_arg_ptr
)
8704 tree expr
= interface_method
->expr()->get_tree(context
);
8705 if (expr
== error_mark_node
)
8706 return error_mark_node
;
8707 expr
= save_expr(expr
);
8708 tree first_arg
= interface_method
->get_underlying_object_tree(context
, expr
);
8709 if (first_arg
== error_mark_node
)
8710 return error_mark_node
;
8711 *first_arg_ptr
= first_arg
;
8712 return interface_method
->get_function_tree(context
, expr
);
8715 // Build the call expression.
8718 Call_expression::do_get_tree(Translate_context
* context
)
8720 if (this->tree_
!= NULL_TREE
)
8723 Function_type
* fntype
= this->get_function_type();
8725 return error_mark_node
;
8727 if (this->fn_
->is_error_expression())
8728 return error_mark_node
;
8730 Gogo
* gogo
= context
->gogo();
8731 source_location location
= this->location();
8733 Func_expression
* func
= this->fn_
->func_expression();
8734 Bound_method_expression
* bound_method
= this->fn_
->bound_method_expression();
8735 Interface_field_reference_expression
* interface_method
=
8736 this->fn_
->interface_field_reference_expression();
8737 const bool has_closure
= func
!= NULL
&& func
->closure() != NULL
;
8738 const bool is_method
= bound_method
!= NULL
|| interface_method
!= NULL
;
8739 gcc_assert(!fntype
->is_method() || is_method
);
8743 if (this->args_
== NULL
|| this->args_
->empty())
8745 nargs
= is_method
? 1 : 0;
8746 args
= nargs
== 0 ? NULL
: new tree
[nargs
];
8750 const Typed_identifier_list
* params
= fntype
->parameters();
8751 gcc_assert(params
!= NULL
);
8753 nargs
= this->args_
->size();
8754 int i
= is_method
? 1 : 0;
8756 args
= new tree
[nargs
];
8758 Typed_identifier_list::const_iterator pp
= params
->begin();
8759 Expression_list::const_iterator pe
;
8760 for (pe
= this->args_
->begin();
8761 pe
!= this->args_
->end();
8764 gcc_assert(pp
!= params
->end());
8765 tree arg_val
= (*pe
)->get_tree(context
);
8766 args
[i
] = Expression::convert_for_assignment(context
,
8771 if (args
[i
] == error_mark_node
)
8774 return error_mark_node
;
8777 gcc_assert(pp
== params
->end());
8778 gcc_assert(i
== nargs
);
8781 tree rettype
= TREE_TYPE(TREE_TYPE(fntype
->get_tree(gogo
)));
8782 if (rettype
== error_mark_node
)
8785 return error_mark_node
;
8790 fn
= func
->get_tree_without_closure(gogo
);
8791 else if (!is_method
)
8792 fn
= this->fn_
->get_tree(context
);
8793 else if (bound_method
!= NULL
)
8794 fn
= this->bound_method_function(context
, bound_method
, &args
[0]);
8795 else if (interface_method
!= NULL
)
8796 fn
= this->interface_method_function(context
, interface_method
, &args
[0]);
8800 if (fn
== error_mark_node
|| TREE_TYPE(fn
) == error_mark_node
)
8803 return error_mark_node
;
8806 // This is to support builtin math functions when using 80387 math.
8808 if (TREE_CODE(fndecl
) == ADDR_EXPR
)
8809 fndecl
= TREE_OPERAND(fndecl
, 0);
8810 tree excess_type
= NULL_TREE
;
8812 && DECL_IS_BUILTIN(fndecl
)
8813 && DECL_BUILT_IN_CLASS(fndecl
) == BUILT_IN_NORMAL
8815 && ((SCALAR_FLOAT_TYPE_P(rettype
)
8816 && SCALAR_FLOAT_TYPE_P(TREE_TYPE(args
[0])))
8817 || (COMPLEX_FLOAT_TYPE_P(rettype
)
8818 && COMPLEX_FLOAT_TYPE_P(TREE_TYPE(args
[0])))))
8820 excess_type
= excess_precision_type(TREE_TYPE(args
[0]));
8821 if (excess_type
!= NULL_TREE
)
8823 tree excess_fndecl
= mathfn_built_in(excess_type
,
8824 DECL_FUNCTION_CODE(fndecl
));
8825 if (excess_fndecl
== NULL_TREE
)
8826 excess_type
= NULL_TREE
;
8829 fn
= build_fold_addr_expr_loc(location
, excess_fndecl
);
8830 for (int i
= 0; i
< nargs
; ++i
)
8831 args
[i
] = ::convert(excess_type
, args
[i
]);
8836 tree ret
= build_call_array(excess_type
!= NULL_TREE
? excess_type
: rettype
,
8840 SET_EXPR_LOCATION(ret
, location
);
8844 tree closure_tree
= func
->closure()->get_tree(context
);
8845 if (closure_tree
!= error_mark_node
)
8846 CALL_EXPR_STATIC_CHAIN(ret
) = closure_tree
;
8849 // If this is a recursive function type which returns itself, as in
8851 // we have used ptr_type_node for the return type. Add a cast here
8852 // to the correct type.
8853 if (TREE_TYPE(ret
) == ptr_type_node
)
8855 tree t
= this->type()->get_tree(gogo
);
8856 ret
= fold_convert_loc(location
, t
, ret
);
8859 if (excess_type
!= NULL_TREE
)
8861 // Calling convert here can undo our excess precision change.
8862 // That may or may not be a bug in convert_to_real.
8863 ret
= build1(NOP_EXPR
, rettype
, ret
);
8866 // If there is more than one result, we will refer to the call
8868 if (fntype
->results() != NULL
&& fntype
->results()->size() > 1)
8869 ret
= save_expr(ret
);
8876 // Make a call expression.
8879 Expression::make_call(Expression
* fn
, Expression_list
* args
, bool is_varargs
,
8880 source_location location
)
8882 return new Call_expression(fn
, args
, is_varargs
, location
);
8885 // A single result from a call which returns multiple results.
8887 class Call_result_expression
: public Expression
8890 Call_result_expression(Call_expression
* call
, unsigned int index
)
8891 : Expression(EXPRESSION_CALL_RESULT
, call
->location()),
8892 call_(call
), index_(index
)
8897 do_traverse(Traverse
*);
8903 do_determine_type(const Type_context
*);
8906 do_check_types(Gogo
*);
8911 return new Call_result_expression(this->call_
->call_expression(),
8916 do_must_eval_in_order() const
8920 do_get_tree(Translate_context
*);
8923 // The underlying call expression.
8925 // Which result we want.
8926 unsigned int index_
;
8929 // Traverse a call result.
8932 Call_result_expression::do_traverse(Traverse
* traverse
)
8934 if (traverse
->remember_expression(this->call_
))
8936 // We have already traversed the call expression.
8937 return TRAVERSE_CONTINUE
;
8939 return Expression::traverse(&this->call_
, traverse
);
8945 Call_result_expression::do_type()
8947 if (this->classification() == EXPRESSION_ERROR
)
8948 return Type::make_error_type();
8950 // THIS->CALL_ can be replaced with a temporary reference due to
8951 // Call_expression::do_must_eval_in_order when there is an error.
8952 Call_expression
* ce
= this->call_
->call_expression();
8955 this->set_is_error();
8956 return Type::make_error_type();
8958 Function_type
* fntype
= ce
->get_function_type();
8961 this->set_is_error();
8962 return Type::make_error_type();
8964 const Typed_identifier_list
* results
= fntype
->results();
8965 if (results
== NULL
)
8967 this->report_error(_("number of results does not match "
8968 "number of values"));
8969 return Type::make_error_type();
8971 Typed_identifier_list::const_iterator pr
= results
->begin();
8972 for (unsigned int i
= 0; i
< this->index_
; ++i
)
8974 if (pr
== results
->end())
8978 if (pr
== results
->end())
8980 this->report_error(_("number of results does not match "
8981 "number of values"));
8982 return Type::make_error_type();
8987 // Check the type. Just make sure that we trigger the warning in
8991 Call_result_expression::do_check_types(Gogo
*)
8996 // Determine the type. We have nothing to do here, but the 0 result
8997 // needs to pass down to the caller.
9000 Call_result_expression::do_determine_type(const Type_context
*)
9002 if (this->index_
== 0)
9003 this->call_
->determine_type_no_context();
9009 Call_result_expression::do_get_tree(Translate_context
* context
)
9011 tree call_tree
= this->call_
->get_tree(context
);
9012 if (call_tree
== error_mark_node
)
9013 return error_mark_node
;
9014 if (TREE_CODE(TREE_TYPE(call_tree
)) != RECORD_TYPE
)
9016 gcc_assert(saw_errors());
9017 return error_mark_node
;
9019 tree field
= TYPE_FIELDS(TREE_TYPE(call_tree
));
9020 for (unsigned int i
= 0; i
< this->index_
; ++i
)
9022 gcc_assert(field
!= NULL_TREE
);
9023 field
= DECL_CHAIN(field
);
9025 gcc_assert(field
!= NULL_TREE
);
9026 return build3(COMPONENT_REF
, TREE_TYPE(field
), call_tree
, field
, NULL_TREE
);
9029 // Make a reference to a single result of a call which returns
9030 // multiple results.
9033 Expression::make_call_result(Call_expression
* call
, unsigned int index
)
9035 return new Call_result_expression(call
, index
);
9038 // Class Index_expression.
9043 Index_expression::do_traverse(Traverse
* traverse
)
9045 if (Expression::traverse(&this->left_
, traverse
) == TRAVERSE_EXIT
9046 || Expression::traverse(&this->start_
, traverse
) == TRAVERSE_EXIT
9047 || (this->end_
!= NULL
9048 && Expression::traverse(&this->end_
, traverse
) == TRAVERSE_EXIT
))
9049 return TRAVERSE_EXIT
;
9050 return TRAVERSE_CONTINUE
;
9053 // Lower an index expression. This converts the generic index
9054 // expression into an array index, a string index, or a map index.
9057 Index_expression::do_lower(Gogo
*, Named_object
*, int)
9059 source_location location
= this->location();
9060 Expression
* left
= this->left_
;
9061 Expression
* start
= this->start_
;
9062 Expression
* end
= this->end_
;
9064 Type
* type
= left
->type();
9065 if (type
->is_error_type())
9066 return Expression::make_error(location
);
9067 else if (type
->array_type() != NULL
)
9068 return Expression::make_array_index(left
, start
, end
, location
);
9069 else if (type
->points_to() != NULL
9070 && type
->points_to()->array_type() != NULL
9071 && !type
->points_to()->is_open_array_type())
9073 Expression
* deref
= Expression::make_unary(OPERATOR_MULT
, left
,
9075 return Expression::make_array_index(deref
, start
, end
, location
);
9077 else if (type
->is_string_type())
9078 return Expression::make_string_index(left
, start
, end
, location
);
9079 else if (type
->map_type() != NULL
)
9083 error_at(location
, "invalid slice of map");
9084 return Expression::make_error(location
);
9086 Map_index_expression
* ret
= Expression::make_map_index(left
, start
,
9088 if (this->is_lvalue_
)
9089 ret
->set_is_lvalue();
9095 "attempt to index object which is not array, string, or map");
9096 return Expression::make_error(location
);
9100 // Make an index expression.
9103 Expression::make_index(Expression
* left
, Expression
* start
, Expression
* end
,
9104 source_location location
)
9106 return new Index_expression(left
, start
, end
, location
);
9109 // An array index. This is used for both indexing and slicing.
9111 class Array_index_expression
: public Expression
9114 Array_index_expression(Expression
* array
, Expression
* start
,
9115 Expression
* end
, source_location location
)
9116 : Expression(EXPRESSION_ARRAY_INDEX
, location
),
9117 array_(array
), start_(start
), end_(end
), type_(NULL
)
9122 do_traverse(Traverse
*);
9128 do_determine_type(const Type_context
*);
9131 do_check_types(Gogo
*);
9136 return Expression::make_array_index(this->array_
->copy(),
9137 this->start_
->copy(),
9140 : this->end_
->copy()),
9145 do_is_addressable() const;
9148 do_address_taken(bool escapes
)
9149 { this->array_
->address_taken(escapes
); }
9152 do_get_tree(Translate_context
*);
9155 // The array we are getting a value from.
9157 // The start or only index.
9159 // The end index of a slice. This may be NULL for a simple array
9160 // index, or it may be a nil expression for the length of the array.
9162 // The type of the expression.
9166 // Array index traversal.
9169 Array_index_expression::do_traverse(Traverse
* traverse
)
9171 if (Expression::traverse(&this->array_
, traverse
) == TRAVERSE_EXIT
)
9172 return TRAVERSE_EXIT
;
9173 if (Expression::traverse(&this->start_
, traverse
) == TRAVERSE_EXIT
)
9174 return TRAVERSE_EXIT
;
9175 if (this->end_
!= NULL
)
9177 if (Expression::traverse(&this->end_
, traverse
) == TRAVERSE_EXIT
)
9178 return TRAVERSE_EXIT
;
9180 return TRAVERSE_CONTINUE
;
9183 // Return the type of an array index.
9186 Array_index_expression::do_type()
9188 if (this->type_
== NULL
)
9190 Array_type
* type
= this->array_
->type()->array_type();
9192 this->type_
= Type::make_error_type();
9193 else if (this->end_
== NULL
)
9194 this->type_
= type
->element_type();
9195 else if (type
->is_open_array_type())
9197 // A slice of a slice has the same type as the original
9199 this->type_
= this->array_
->type()->deref();
9203 // A slice of an array is a slice.
9204 this->type_
= Type::make_array_type(type
->element_type(), NULL
);
9210 // Set the type of an array index.
9213 Array_index_expression::do_determine_type(const Type_context
*)
9215 this->array_
->determine_type_no_context();
9216 Type_context
subcontext(NULL
, true);
9217 this->start_
->determine_type(&subcontext
);
9218 if (this->end_
!= NULL
)
9219 this->end_
->determine_type(&subcontext
);
9222 // Check types of an array index.
9225 Array_index_expression::do_check_types(Gogo
*)
9227 if (this->start_
->type()->integer_type() == NULL
)
9228 this->report_error(_("index must be integer"));
9229 if (this->end_
!= NULL
9230 && this->end_
->type()->integer_type() == NULL
9231 && !this->end_
->is_nil_expression())
9232 this->report_error(_("slice end must be integer"));
9234 Array_type
* array_type
= this->array_
->type()->array_type();
9235 if (array_type
== NULL
)
9237 gcc_assert(this->array_
->type()->is_error_type());
9241 unsigned int int_bits
=
9242 Type::lookup_integer_type("int")->integer_type()->bits();
9247 bool lval_valid
= (array_type
->length() != NULL
9248 && array_type
->length()->integer_constant_value(true,
9253 if (this->start_
->integer_constant_value(true, ival
, &dummy
))
9255 if (mpz_sgn(ival
) < 0
9256 || mpz_sizeinbase(ival
, 2) >= int_bits
9258 && (this->end_
== NULL
9259 ? mpz_cmp(ival
, lval
) >= 0
9260 : mpz_cmp(ival
, lval
) > 0)))
9262 error_at(this->start_
->location(), "array index out of bounds");
9263 this->set_is_error();
9266 if (this->end_
!= NULL
&& !this->end_
->is_nil_expression())
9268 if (this->end_
->integer_constant_value(true, ival
, &dummy
))
9270 if (mpz_sgn(ival
) < 0
9271 || mpz_sizeinbase(ival
, 2) >= int_bits
9272 || (lval_valid
&& mpz_cmp(ival
, lval
) > 0))
9274 error_at(this->end_
->location(), "array index out of bounds");
9275 this->set_is_error();
9282 // A slice of an array requires an addressable array. A slice of a
9283 // slice is always possible.
9284 if (this->end_
!= NULL
9285 && !array_type
->is_open_array_type()
9286 && !this->array_
->is_addressable())
9287 this->report_error(_("array is not addressable"));
9290 // Return whether this expression is addressable.
9293 Array_index_expression::do_is_addressable() const
9295 // A slice expression is not addressable.
9296 if (this->end_
!= NULL
)
9299 // An index into a slice is addressable.
9300 if (this->array_
->type()->is_open_array_type())
9303 // An index into an array is addressable if the array is
9305 return this->array_
->is_addressable();
9308 // Get a tree for an array index.
9311 Array_index_expression::do_get_tree(Translate_context
* context
)
9313 Gogo
* gogo
= context
->gogo();
9314 source_location loc
= this->location();
9316 Array_type
* array_type
= this->array_
->type()->array_type();
9317 if (array_type
== NULL
)
9319 gcc_assert(this->array_
->type()->is_error_type());
9320 return error_mark_node
;
9323 tree type_tree
= array_type
->get_tree(gogo
);
9324 if (type_tree
== error_mark_node
)
9325 return error_mark_node
;
9327 tree array_tree
= this->array_
->get_tree(context
);
9328 if (array_tree
== error_mark_node
)
9329 return error_mark_node
;
9331 if (array_type
->length() == NULL
&& !DECL_P(array_tree
))
9332 array_tree
= save_expr(array_tree
);
9333 tree length_tree
= array_type
->length_tree(gogo
, array_tree
);
9334 if (length_tree
== error_mark_node
)
9335 return error_mark_node
;
9336 length_tree
= save_expr(length_tree
);
9337 tree length_type
= TREE_TYPE(length_tree
);
9339 tree bad_index
= boolean_false_node
;
9341 tree start_tree
= this->start_
->get_tree(context
);
9342 if (start_tree
== error_mark_node
)
9343 return error_mark_node
;
9344 if (!DECL_P(start_tree
))
9345 start_tree
= save_expr(start_tree
);
9346 if (!INTEGRAL_TYPE_P(TREE_TYPE(start_tree
)))
9347 start_tree
= convert_to_integer(length_type
, start_tree
);
9349 bad_index
= Expression::check_bounds(start_tree
, length_type
, bad_index
,
9352 start_tree
= fold_convert_loc(loc
, length_type
, start_tree
);
9353 bad_index
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
, bad_index
,
9354 fold_build2_loc(loc
,
9358 boolean_type_node
, start_tree
,
9361 int code
= (array_type
->length() != NULL
9362 ? (this->end_
== NULL
9363 ? RUNTIME_ERROR_ARRAY_INDEX_OUT_OF_BOUNDS
9364 : RUNTIME_ERROR_ARRAY_SLICE_OUT_OF_BOUNDS
)
9365 : (this->end_
== NULL
9366 ? RUNTIME_ERROR_SLICE_INDEX_OUT_OF_BOUNDS
9367 : RUNTIME_ERROR_SLICE_SLICE_OUT_OF_BOUNDS
));
9368 tree crash
= Gogo::runtime_error(code
, loc
);
9370 if (this->end_
== NULL
)
9372 // Simple array indexing. This has to return an l-value, so
9373 // wrap the index check into START_TREE.
9374 start_tree
= build2(COMPOUND_EXPR
, TREE_TYPE(start_tree
),
9375 build3(COND_EXPR
, void_type_node
,
9376 bad_index
, crash
, NULL_TREE
),
9378 start_tree
= fold_convert_loc(loc
, sizetype
, start_tree
);
9380 if (array_type
->length() != NULL
)
9383 return build4(ARRAY_REF
, TREE_TYPE(type_tree
), array_tree
,
9384 start_tree
, NULL_TREE
, NULL_TREE
);
9389 tree values
= array_type
->value_pointer_tree(gogo
, array_tree
);
9390 tree element_type_tree
= array_type
->element_type()->get_tree(gogo
);
9391 if (element_type_tree
== error_mark_node
)
9392 return error_mark_node
;
9393 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
9394 tree offset
= fold_build2_loc(loc
, MULT_EXPR
, sizetype
,
9395 start_tree
, element_size
);
9396 tree ptr
= fold_build2_loc(loc
, POINTER_PLUS_EXPR
,
9397 TREE_TYPE(values
), values
, offset
);
9398 return build_fold_indirect_ref(ptr
);
9404 tree capacity_tree
= array_type
->capacity_tree(gogo
, array_tree
);
9405 if (capacity_tree
== error_mark_node
)
9406 return error_mark_node
;
9407 capacity_tree
= fold_convert_loc(loc
, length_type
, capacity_tree
);
9410 if (this->end_
->is_nil_expression())
9411 end_tree
= length_tree
;
9414 end_tree
= this->end_
->get_tree(context
);
9415 if (end_tree
== error_mark_node
)
9416 return error_mark_node
;
9417 if (!DECL_P(end_tree
))
9418 end_tree
= save_expr(end_tree
);
9419 if (!INTEGRAL_TYPE_P(TREE_TYPE(end_tree
)))
9420 end_tree
= convert_to_integer(length_type
, end_tree
);
9422 bad_index
= Expression::check_bounds(end_tree
, length_type
, bad_index
,
9425 end_tree
= fold_convert_loc(loc
, length_type
, end_tree
);
9427 capacity_tree
= save_expr(capacity_tree
);
9428 tree bad_end
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
9429 fold_build2_loc(loc
, LT_EXPR
,
9431 end_tree
, start_tree
),
9432 fold_build2_loc(loc
, GT_EXPR
,
9434 end_tree
, capacity_tree
));
9435 bad_index
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
9436 bad_index
, bad_end
);
9439 tree element_type_tree
= array_type
->element_type()->get_tree(gogo
);
9440 if (element_type_tree
== error_mark_node
)
9441 return error_mark_node
;
9442 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
9444 tree offset
= fold_build2_loc(loc
, MULT_EXPR
, sizetype
,
9445 fold_convert_loc(loc
, sizetype
, start_tree
),
9448 tree value_pointer
= array_type
->value_pointer_tree(gogo
, array_tree
);
9449 if (value_pointer
== error_mark_node
)
9450 return error_mark_node
;
9452 value_pointer
= fold_build2_loc(loc
, POINTER_PLUS_EXPR
,
9453 TREE_TYPE(value_pointer
),
9454 value_pointer
, offset
);
9456 tree result_length_tree
= fold_build2_loc(loc
, MINUS_EXPR
, length_type
,
9457 end_tree
, start_tree
);
9459 tree result_capacity_tree
= fold_build2_loc(loc
, MINUS_EXPR
, length_type
,
9460 capacity_tree
, start_tree
);
9462 tree struct_tree
= this->type()->get_tree(gogo
);
9463 gcc_assert(TREE_CODE(struct_tree
) == RECORD_TYPE
);
9465 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 3);
9467 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
9468 tree field
= TYPE_FIELDS(struct_tree
);
9469 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__values") == 0);
9471 elt
->value
= value_pointer
;
9473 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
9474 field
= DECL_CHAIN(field
);
9475 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__count") == 0);
9477 elt
->value
= fold_convert_loc(loc
, TREE_TYPE(field
), result_length_tree
);
9479 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
9480 field
= DECL_CHAIN(field
);
9481 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__capacity") == 0);
9483 elt
->value
= fold_convert_loc(loc
, TREE_TYPE(field
), result_capacity_tree
);
9485 tree constructor
= build_constructor(struct_tree
, init
);
9487 if (TREE_CONSTANT(value_pointer
)
9488 && TREE_CONSTANT(result_length_tree
)
9489 && TREE_CONSTANT(result_capacity_tree
))
9490 TREE_CONSTANT(constructor
) = 1;
9492 return fold_build2_loc(loc
, COMPOUND_EXPR
, TREE_TYPE(constructor
),
9493 build3(COND_EXPR
, void_type_node
,
9494 bad_index
, crash
, NULL_TREE
),
9498 // Make an array index expression. END may be NULL.
9501 Expression::make_array_index(Expression
* array
, Expression
* start
,
9502 Expression
* end
, source_location location
)
9504 // Taking a slice of a composite literal requires moving the literal
9506 if (end
!= NULL
&& array
->is_composite_literal())
9508 array
= Expression::make_heap_composite(array
, location
);
9509 array
= Expression::make_unary(OPERATOR_MULT
, array
, location
);
9511 return new Array_index_expression(array
, start
, end
, location
);
9514 // A string index. This is used for both indexing and slicing.
9516 class String_index_expression
: public Expression
9519 String_index_expression(Expression
* string
, Expression
* start
,
9520 Expression
* end
, source_location location
)
9521 : Expression(EXPRESSION_STRING_INDEX
, location
),
9522 string_(string
), start_(start
), end_(end
)
9527 do_traverse(Traverse
*);
9533 do_determine_type(const Type_context
*);
9536 do_check_types(Gogo
*);
9541 return Expression::make_string_index(this->string_
->copy(),
9542 this->start_
->copy(),
9545 : this->end_
->copy()),
9550 do_get_tree(Translate_context
*);
9553 // The string we are getting a value from.
9554 Expression
* string_
;
9555 // The start or only index.
9557 // The end index of a slice. This may be NULL for a single index,
9558 // or it may be a nil expression for the length of the string.
9562 // String index traversal.
9565 String_index_expression::do_traverse(Traverse
* traverse
)
9567 if (Expression::traverse(&this->string_
, traverse
) == TRAVERSE_EXIT
)
9568 return TRAVERSE_EXIT
;
9569 if (Expression::traverse(&this->start_
, traverse
) == TRAVERSE_EXIT
)
9570 return TRAVERSE_EXIT
;
9571 if (this->end_
!= NULL
)
9573 if (Expression::traverse(&this->end_
, traverse
) == TRAVERSE_EXIT
)
9574 return TRAVERSE_EXIT
;
9576 return TRAVERSE_CONTINUE
;
9579 // Return the type of a string index.
9582 String_index_expression::do_type()
9584 if (this->end_
== NULL
)
9585 return Type::lookup_integer_type("uint8");
9587 return this->string_
->type();
9590 // Determine the type of a string index.
9593 String_index_expression::do_determine_type(const Type_context
*)
9595 this->string_
->determine_type_no_context();
9596 Type_context
subcontext(NULL
, true);
9597 this->start_
->determine_type(&subcontext
);
9598 if (this->end_
!= NULL
)
9599 this->end_
->determine_type(&subcontext
);
9602 // Check types of a string index.
9605 String_index_expression::do_check_types(Gogo
*)
9607 if (this->start_
->type()->integer_type() == NULL
)
9608 this->report_error(_("index must be integer"));
9609 if (this->end_
!= NULL
9610 && this->end_
->type()->integer_type() == NULL
9611 && !this->end_
->is_nil_expression())
9612 this->report_error(_("slice end must be integer"));
9615 bool sval_valid
= this->string_
->string_constant_value(&sval
);
9620 if (this->start_
->integer_constant_value(true, ival
, &dummy
))
9622 if (mpz_sgn(ival
) < 0
9623 || (sval_valid
&& mpz_cmp_ui(ival
, sval
.length()) >= 0))
9625 error_at(this->start_
->location(), "string index out of bounds");
9626 this->set_is_error();
9629 if (this->end_
!= NULL
&& !this->end_
->is_nil_expression())
9631 if (this->end_
->integer_constant_value(true, ival
, &dummy
))
9633 if (mpz_sgn(ival
) < 0
9634 || (sval_valid
&& mpz_cmp_ui(ival
, sval
.length()) > 0))
9636 error_at(this->end_
->location(), "string index out of bounds");
9637 this->set_is_error();
9644 // Get a tree for a string index.
9647 String_index_expression::do_get_tree(Translate_context
* context
)
9649 source_location loc
= this->location();
9651 tree string_tree
= this->string_
->get_tree(context
);
9652 if (string_tree
== error_mark_node
)
9653 return error_mark_node
;
9655 if (this->string_
->type()->points_to() != NULL
)
9656 string_tree
= build_fold_indirect_ref(string_tree
);
9657 if (!DECL_P(string_tree
))
9658 string_tree
= save_expr(string_tree
);
9659 tree string_type
= TREE_TYPE(string_tree
);
9661 tree length_tree
= String_type::length_tree(context
->gogo(), string_tree
);
9662 length_tree
= save_expr(length_tree
);
9663 tree length_type
= TREE_TYPE(length_tree
);
9665 tree bad_index
= boolean_false_node
;
9667 tree start_tree
= this->start_
->get_tree(context
);
9668 if (start_tree
== error_mark_node
)
9669 return error_mark_node
;
9670 if (!DECL_P(start_tree
))
9671 start_tree
= save_expr(start_tree
);
9672 if (!INTEGRAL_TYPE_P(TREE_TYPE(start_tree
)))
9673 start_tree
= convert_to_integer(length_type
, start_tree
);
9675 bad_index
= Expression::check_bounds(start_tree
, length_type
, bad_index
,
9678 start_tree
= fold_convert_loc(loc
, length_type
, start_tree
);
9680 int code
= (this->end_
== NULL
9681 ? RUNTIME_ERROR_STRING_INDEX_OUT_OF_BOUNDS
9682 : RUNTIME_ERROR_STRING_SLICE_OUT_OF_BOUNDS
);
9683 tree crash
= Gogo::runtime_error(code
, loc
);
9685 if (this->end_
== NULL
)
9687 bad_index
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
9689 fold_build2_loc(loc
, GE_EXPR
,
9691 start_tree
, length_tree
));
9693 tree bytes_tree
= String_type::bytes_tree(context
->gogo(), string_tree
);
9694 tree ptr
= fold_build2_loc(loc
, POINTER_PLUS_EXPR
, TREE_TYPE(bytes_tree
),
9696 fold_convert_loc(loc
, sizetype
, start_tree
));
9697 tree index
= build_fold_indirect_ref_loc(loc
, ptr
);
9699 return build2(COMPOUND_EXPR
, TREE_TYPE(index
),
9700 build3(COND_EXPR
, void_type_node
,
9701 bad_index
, crash
, NULL_TREE
),
9707 if (this->end_
->is_nil_expression())
9708 end_tree
= build_int_cst(length_type
, -1);
9711 end_tree
= this->end_
->get_tree(context
);
9712 if (end_tree
== error_mark_node
)
9713 return error_mark_node
;
9714 if (!DECL_P(end_tree
))
9715 end_tree
= save_expr(end_tree
);
9716 if (!INTEGRAL_TYPE_P(TREE_TYPE(end_tree
)))
9717 end_tree
= convert_to_integer(length_type
, end_tree
);
9719 bad_index
= Expression::check_bounds(end_tree
, length_type
,
9722 end_tree
= fold_convert_loc(loc
, length_type
, end_tree
);
9725 static tree strslice_fndecl
;
9726 tree ret
= Gogo::call_builtin(&strslice_fndecl
,
9728 "__go_string_slice",
9737 if (ret
== error_mark_node
)
9738 return error_mark_node
;
9739 // This will panic if the bounds are out of range for the
9741 TREE_NOTHROW(strslice_fndecl
) = 0;
9743 if (bad_index
== boolean_false_node
)
9746 return build2(COMPOUND_EXPR
, TREE_TYPE(ret
),
9747 build3(COND_EXPR
, void_type_node
,
9748 bad_index
, crash
, NULL_TREE
),
9753 // Make a string index expression. END may be NULL.
9756 Expression::make_string_index(Expression
* string
, Expression
* start
,
9757 Expression
* end
, source_location location
)
9759 return new String_index_expression(string
, start
, end
, location
);
9764 // Get the type of the map.
9767 Map_index_expression::get_map_type() const
9769 Map_type
* mt
= this->map_
->type()->deref()->map_type();
9771 gcc_assert(saw_errors());
9775 // Map index traversal.
9778 Map_index_expression::do_traverse(Traverse
* traverse
)
9780 if (Expression::traverse(&this->map_
, traverse
) == TRAVERSE_EXIT
)
9781 return TRAVERSE_EXIT
;
9782 return Expression::traverse(&this->index_
, traverse
);
9785 // Return the type of a map index.
9788 Map_index_expression::do_type()
9790 Map_type
* mt
= this->get_map_type();
9792 return Type::make_error_type();
9793 Type
* type
= mt
->val_type();
9794 // If this map index is in a tuple assignment, we actually return a
9795 // pointer to the value type. Tuple_map_assignment_statement is
9796 // responsible for handling this correctly. We need to get the type
9797 // right in case this gets assigned to a temporary variable.
9798 if (this->is_in_tuple_assignment_
)
9799 type
= Type::make_pointer_type(type
);
9803 // Fix the type of a map index.
9806 Map_index_expression::do_determine_type(const Type_context
*)
9808 this->map_
->determine_type_no_context();
9809 Map_type
* mt
= this->get_map_type();
9810 Type
* key_type
= mt
== NULL
? NULL
: mt
->key_type();
9811 Type_context
subcontext(key_type
, false);
9812 this->index_
->determine_type(&subcontext
);
9815 // Check types of a map index.
9818 Map_index_expression::do_check_types(Gogo
*)
9821 Map_type
* mt
= this->get_map_type();
9824 if (!Type::are_assignable(mt
->key_type(), this->index_
->type(), &reason
))
9827 this->report_error(_("incompatible type for map index"));
9830 error_at(this->location(), "incompatible type for map index (%s)",
9832 this->set_is_error();
9837 // Get a tree for a map index.
9840 Map_index_expression::do_get_tree(Translate_context
* context
)
9842 Map_type
* type
= this->get_map_type();
9844 return error_mark_node
;
9846 tree valptr
= this->get_value_pointer(context
, this->is_lvalue_
);
9847 if (valptr
== error_mark_node
)
9848 return error_mark_node
;
9849 valptr
= save_expr(valptr
);
9851 tree val_type_tree
= TREE_TYPE(TREE_TYPE(valptr
));
9853 if (this->is_lvalue_
)
9854 return build_fold_indirect_ref(valptr
);
9855 else if (this->is_in_tuple_assignment_
)
9857 // Tuple_map_assignment_statement is responsible for using this
9863 return fold_build3(COND_EXPR
, val_type_tree
,
9864 fold_build2(EQ_EXPR
, boolean_type_node
, valptr
,
9865 fold_convert(TREE_TYPE(valptr
),
9866 null_pointer_node
)),
9867 type
->val_type()->get_init_tree(context
->gogo(),
9869 build_fold_indirect_ref(valptr
));
9873 // Get a tree for the map index. This returns a tree which evaluates
9874 // to a pointer to a value. The pointer will be NULL if the key is
9878 Map_index_expression::get_value_pointer(Translate_context
* context
,
9881 Map_type
* type
= this->get_map_type();
9883 return error_mark_node
;
9885 tree map_tree
= this->map_
->get_tree(context
);
9886 tree index_tree
= this->index_
->get_tree(context
);
9887 index_tree
= Expression::convert_for_assignment(context
, type
->key_type(),
9888 this->index_
->type(),
9891 if (map_tree
== error_mark_node
|| index_tree
== error_mark_node
)
9892 return error_mark_node
;
9894 if (this->map_
->type()->points_to() != NULL
)
9895 map_tree
= build_fold_indirect_ref(map_tree
);
9897 // We need to pass in a pointer to the key, so stuff it into a
9899 tree tmp
= create_tmp_var(TREE_TYPE(index_tree
), get_name(index_tree
));
9900 DECL_IGNORED_P(tmp
) = 0;
9901 DECL_INITIAL(tmp
) = index_tree
;
9902 tree make_tmp
= build1(DECL_EXPR
, void_type_node
, tmp
);
9903 tree tmpref
= fold_convert(const_ptr_type_node
, build_fold_addr_expr(tmp
));
9904 TREE_ADDRESSABLE(tmp
) = 1;
9906 static tree map_index_fndecl
;
9907 tree call
= Gogo::call_builtin(&map_index_fndecl
,
9911 const_ptr_type_node
,
9912 TREE_TYPE(map_tree
),
9914 const_ptr_type_node
,
9919 : boolean_false_node
));
9920 if (call
== error_mark_node
)
9921 return error_mark_node
;
9922 // This can panic on a map of interface type if the interface holds
9923 // an uncomparable or unhashable type.
9924 TREE_NOTHROW(map_index_fndecl
) = 0;
9926 tree val_type_tree
= type
->val_type()->get_tree(context
->gogo());
9927 if (val_type_tree
== error_mark_node
)
9928 return error_mark_node
;
9929 tree ptr_val_type_tree
= build_pointer_type(val_type_tree
);
9931 return build2(COMPOUND_EXPR
, ptr_val_type_tree
,
9933 fold_convert(ptr_val_type_tree
, call
));
9936 // Make a map index expression.
9938 Map_index_expression
*
9939 Expression::make_map_index(Expression
* map
, Expression
* index
,
9940 source_location location
)
9942 return new Map_index_expression(map
, index
, location
);
9945 // Class Field_reference_expression.
9947 // Return the type of a field reference.
9950 Field_reference_expression::do_type()
9952 Type
* type
= this->expr_
->type();
9953 if (type
->is_error_type())
9955 Struct_type
* struct_type
= type
->struct_type();
9956 gcc_assert(struct_type
!= NULL
);
9957 return struct_type
->field(this->field_index_
)->type();
9960 // Check the types for a field reference.
9963 Field_reference_expression::do_check_types(Gogo
*)
9965 Type
* type
= this->expr_
->type();
9966 if (type
->is_error_type())
9968 Struct_type
* struct_type
= type
->struct_type();
9969 gcc_assert(struct_type
!= NULL
);
9970 gcc_assert(struct_type
->field(this->field_index_
) != NULL
);
9973 // Get a tree for a field reference.
9976 Field_reference_expression::do_get_tree(Translate_context
* context
)
9978 tree struct_tree
= this->expr_
->get_tree(context
);
9979 if (struct_tree
== error_mark_node
9980 || TREE_TYPE(struct_tree
) == error_mark_node
)
9981 return error_mark_node
;
9982 gcc_assert(TREE_CODE(TREE_TYPE(struct_tree
)) == RECORD_TYPE
);
9983 tree field
= TYPE_FIELDS(TREE_TYPE(struct_tree
));
9984 if (field
== NULL_TREE
)
9986 // This can happen for a type which refers to itself indirectly
9987 // and then turns out to be erroneous.
9988 gcc_assert(saw_errors());
9989 return error_mark_node
;
9991 for (unsigned int i
= this->field_index_
; i
> 0; --i
)
9993 field
= DECL_CHAIN(field
);
9994 gcc_assert(field
!= NULL_TREE
);
9996 if (TREE_TYPE(field
) == error_mark_node
)
9997 return error_mark_node
;
9998 return build3(COMPONENT_REF
, TREE_TYPE(field
), struct_tree
, field
,
10002 // Make a reference to a qualified identifier in an expression.
10004 Field_reference_expression
*
10005 Expression::make_field_reference(Expression
* expr
, unsigned int field_index
,
10006 source_location location
)
10008 return new Field_reference_expression(expr
, field_index
, location
);
10011 // Class Interface_field_reference_expression.
10013 // Return a tree for the pointer to the function to call.
10016 Interface_field_reference_expression::get_function_tree(Translate_context
*,
10019 if (this->expr_
->type()->points_to() != NULL
)
10020 expr
= build_fold_indirect_ref(expr
);
10022 tree expr_type
= TREE_TYPE(expr
);
10023 gcc_assert(TREE_CODE(expr_type
) == RECORD_TYPE
);
10025 tree field
= TYPE_FIELDS(expr_type
);
10026 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__methods") == 0);
10028 tree table
= build3(COMPONENT_REF
, TREE_TYPE(field
), expr
, field
, NULL_TREE
);
10029 gcc_assert(POINTER_TYPE_P(TREE_TYPE(table
)));
10031 table
= build_fold_indirect_ref(table
);
10032 gcc_assert(TREE_CODE(TREE_TYPE(table
)) == RECORD_TYPE
);
10034 std::string name
= Gogo::unpack_hidden_name(this->name_
);
10035 for (field
= DECL_CHAIN(TYPE_FIELDS(TREE_TYPE(table
)));
10036 field
!= NULL_TREE
;
10037 field
= DECL_CHAIN(field
))
10039 if (name
== IDENTIFIER_POINTER(DECL_NAME(field
)))
10042 gcc_assert(field
!= NULL_TREE
);
10044 return build3(COMPONENT_REF
, TREE_TYPE(field
), table
, field
, NULL_TREE
);
10047 // Return a tree for the first argument to pass to the interface
10051 Interface_field_reference_expression::get_underlying_object_tree(
10052 Translate_context
*,
10055 if (this->expr_
->type()->points_to() != NULL
)
10056 expr
= build_fold_indirect_ref(expr
);
10058 tree expr_type
= TREE_TYPE(expr
);
10059 gcc_assert(TREE_CODE(expr_type
) == RECORD_TYPE
);
10061 tree field
= DECL_CHAIN(TYPE_FIELDS(expr_type
));
10062 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__object") == 0);
10064 return build3(COMPONENT_REF
, TREE_TYPE(field
), expr
, field
, NULL_TREE
);
10070 Interface_field_reference_expression::do_traverse(Traverse
* traverse
)
10072 return Expression::traverse(&this->expr_
, traverse
);
10075 // Return the type of an interface field reference.
10078 Interface_field_reference_expression::do_type()
10080 Type
* expr_type
= this->expr_
->type();
10082 Type
* points_to
= expr_type
->points_to();
10083 if (points_to
!= NULL
)
10084 expr_type
= points_to
;
10086 Interface_type
* interface_type
= expr_type
->interface_type();
10087 if (interface_type
== NULL
)
10088 return Type::make_error_type();
10090 const Typed_identifier
* method
= interface_type
->find_method(this->name_
);
10091 if (method
== NULL
)
10092 return Type::make_error_type();
10094 return method
->type();
10097 // Determine types.
10100 Interface_field_reference_expression::do_determine_type(const Type_context
*)
10102 this->expr_
->determine_type_no_context();
10105 // Check the types for an interface field reference.
10108 Interface_field_reference_expression::do_check_types(Gogo
*)
10110 Type
* type
= this->expr_
->type();
10112 Type
* points_to
= type
->points_to();
10113 if (points_to
!= NULL
)
10116 Interface_type
* interface_type
= type
->interface_type();
10117 if (interface_type
== NULL
)
10118 this->report_error(_("expected interface or pointer to interface"));
10121 const Typed_identifier
* method
=
10122 interface_type
->find_method(this->name_
);
10123 if (method
== NULL
)
10125 error_at(this->location(), "method %qs not in interface",
10126 Gogo::message_name(this->name_
).c_str());
10127 this->set_is_error();
10132 // Get a tree for a reference to a field in an interface. There is no
10133 // standard tree type representation for this: it's a function
10134 // attached to its first argument, like a Bound_method_expression.
10135 // The only places it may currently be used are in a Call_expression
10136 // or a Go_statement, which will take it apart directly. So this has
10137 // nothing to do at present.
10140 Interface_field_reference_expression::do_get_tree(Translate_context
*)
10145 // Make a reference to a field in an interface.
10148 Expression::make_interface_field_reference(Expression
* expr
,
10149 const std::string
& field
,
10150 source_location location
)
10152 return new Interface_field_reference_expression(expr
, field
, location
);
10155 // A general selector. This is a Parser_expression for LEFT.NAME. It
10156 // is lowered after we know the type of the left hand side.
10158 class Selector_expression
: public Parser_expression
10161 Selector_expression(Expression
* left
, const std::string
& name
,
10162 source_location location
)
10163 : Parser_expression(EXPRESSION_SELECTOR
, location
),
10164 left_(left
), name_(name
)
10169 do_traverse(Traverse
* traverse
)
10170 { return Expression::traverse(&this->left_
, traverse
); }
10173 do_lower(Gogo
*, Named_object
*, int);
10178 return new Selector_expression(this->left_
->copy(), this->name_
,
10184 lower_method_expression(Gogo
*);
10186 // The expression on the left hand side.
10188 // The name on the right hand side.
10192 // Lower a selector expression once we know the real type of the left
10196 Selector_expression::do_lower(Gogo
* gogo
, Named_object
*, int)
10198 Expression
* left
= this->left_
;
10199 if (left
->is_type_expression())
10200 return this->lower_method_expression(gogo
);
10201 return Type::bind_field_or_method(gogo
, left
->type(), left
, this->name_
,
10205 // Lower a method expression T.M or (*T).M. We turn this into a
10206 // function literal.
10209 Selector_expression::lower_method_expression(Gogo
* gogo
)
10211 source_location location
= this->location();
10212 Type
* type
= this->left_
->type();
10213 const std::string
& name(this->name_
);
10216 if (type
->points_to() == NULL
)
10217 is_pointer
= false;
10221 type
= type
->points_to();
10223 Named_type
* nt
= type
->named_type();
10227 ("method expression requires named type or "
10228 "pointer to named type"));
10229 return Expression::make_error(location
);
10233 Method
* method
= nt
->method_function(name
, &is_ambiguous
);
10234 if (method
== NULL
)
10237 error_at(location
, "type %<%s%> has no method %<%s%>",
10238 nt
->message_name().c_str(),
10239 Gogo::message_name(name
).c_str());
10241 error_at(location
, "method %<%s%> is ambiguous in type %<%s%>",
10242 Gogo::message_name(name
).c_str(),
10243 nt
->message_name().c_str());
10244 return Expression::make_error(location
);
10247 if (!is_pointer
&& !method
->is_value_method())
10249 error_at(location
, "method requires pointer (use %<(*%s).%s)%>",
10250 nt
->message_name().c_str(),
10251 Gogo::message_name(name
).c_str());
10252 return Expression::make_error(location
);
10255 // Build a new function type in which the receiver becomes the first
10257 Function_type
* method_type
= method
->type();
10258 gcc_assert(method_type
->is_method());
10260 const char* const receiver_name
= "$this";
10261 Typed_identifier_list
* parameters
= new Typed_identifier_list();
10262 parameters
->push_back(Typed_identifier(receiver_name
, this->left_
->type(),
10265 const Typed_identifier_list
* method_parameters
= method_type
->parameters();
10266 if (method_parameters
!= NULL
)
10268 for (Typed_identifier_list::const_iterator p
= method_parameters
->begin();
10269 p
!= method_parameters
->end();
10271 parameters
->push_back(*p
);
10274 const Typed_identifier_list
* method_results
= method_type
->results();
10275 Typed_identifier_list
* results
;
10276 if (method_results
== NULL
)
10280 results
= new Typed_identifier_list();
10281 for (Typed_identifier_list::const_iterator p
= method_results
->begin();
10282 p
!= method_results
->end();
10284 results
->push_back(*p
);
10287 Function_type
* fntype
= Type::make_function_type(NULL
, parameters
, results
,
10289 if (method_type
->is_varargs())
10290 fntype
->set_is_varargs();
10292 // We generate methods which always takes a pointer to the receiver
10293 // as their first argument. If this is for a pointer type, we can
10294 // simply reuse the existing function. We use an internal hack to
10295 // get the right type.
10299 Named_object
* mno
= (method
->needs_stub_method()
10300 ? method
->stub_object()
10301 : method
->named_object());
10302 Expression
* f
= Expression::make_func_reference(mno
, NULL
, location
);
10303 f
= Expression::make_cast(fntype
, f
, location
);
10304 Type_conversion_expression
* tce
=
10305 static_cast<Type_conversion_expression
*>(f
);
10306 tce
->set_may_convert_function_types();
10310 Named_object
* no
= gogo
->start_function(Gogo::thunk_name(), fntype
, false,
10313 Named_object
* vno
= gogo
->lookup(receiver_name
, NULL
);
10314 gcc_assert(vno
!= NULL
);
10315 Expression
* ve
= Expression::make_var_reference(vno
, location
);
10316 Expression
* bm
= Type::bind_field_or_method(gogo
, nt
, ve
, name
, location
);
10317 gcc_assert(bm
!= NULL
&& !bm
->is_error_expression());
10319 Expression_list
* args
;
10320 if (method_parameters
== NULL
)
10324 args
= new Expression_list();
10325 for (Typed_identifier_list::const_iterator p
= method_parameters
->begin();
10326 p
!= method_parameters
->end();
10329 vno
= gogo
->lookup(p
->name(), NULL
);
10330 gcc_assert(vno
!= NULL
);
10331 args
->push_back(Expression::make_var_reference(vno
, location
));
10335 Call_expression
* call
= Expression::make_call(bm
, args
,
10336 method_type
->is_varargs(),
10339 size_t count
= call
->result_count();
10342 s
= Statement::make_statement(call
);
10345 Expression_list
* retvals
= new Expression_list();
10347 retvals
->push_back(call
);
10350 for (size_t i
= 0; i
< count
; ++i
)
10351 retvals
->push_back(Expression::make_call_result(call
, i
));
10353 s
= Statement::make_return_statement(no
->func_value()->type()->results(),
10354 retvals
, location
);
10356 gogo
->add_statement(s
);
10358 gogo
->finish_function(location
);
10360 return Expression::make_func_reference(no
, NULL
, location
);
10363 // Make a selector expression.
10366 Expression::make_selector(Expression
* left
, const std::string
& name
,
10367 source_location location
)
10369 return new Selector_expression(left
, name
, location
);
10372 // Implement the builtin function new.
10374 class Allocation_expression
: public Expression
10377 Allocation_expression(Type
* type
, source_location location
)
10378 : Expression(EXPRESSION_ALLOCATION
, location
),
10384 do_traverse(Traverse
* traverse
)
10385 { return Type::traverse(this->type_
, traverse
); }
10389 { return Type::make_pointer_type(this->type_
); }
10392 do_determine_type(const Type_context
*)
10396 do_check_types(Gogo
*);
10400 { return new Allocation_expression(this->type_
, this->location()); }
10403 do_get_tree(Translate_context
*);
10406 // The type we are allocating.
10410 // Check the type of an allocation expression.
10413 Allocation_expression::do_check_types(Gogo
*)
10415 if (this->type_
->function_type() != NULL
)
10416 this->report_error(_("invalid new of function type"));
10419 // Return a tree for an allocation expression.
10422 Allocation_expression::do_get_tree(Translate_context
* context
)
10424 tree type_tree
= this->type_
->get_tree(context
->gogo());
10425 if (type_tree
== error_mark_node
)
10426 return error_mark_node
;
10427 tree size_tree
= TYPE_SIZE_UNIT(type_tree
);
10428 tree space
= context
->gogo()->allocate_memory(this->type_
, size_tree
,
10430 if (space
== error_mark_node
)
10431 return error_mark_node
;
10432 return fold_convert(build_pointer_type(type_tree
), space
);
10435 // Make an allocation expression.
10438 Expression::make_allocation(Type
* type
, source_location location
)
10440 return new Allocation_expression(type
, location
);
10443 // Implement the builtin function make.
10445 class Make_expression
: public Expression
10448 Make_expression(Type
* type
, Expression_list
* args
, source_location location
)
10449 : Expression(EXPRESSION_MAKE
, location
),
10450 type_(type
), args_(args
)
10455 do_traverse(Traverse
* traverse
);
10459 { return this->type_
; }
10462 do_determine_type(const Type_context
*);
10465 do_check_types(Gogo
*);
10470 return new Make_expression(this->type_
, this->args_
->copy(),
10475 do_get_tree(Translate_context
*);
10478 // The type we are making.
10480 // The arguments to pass to the make routine.
10481 Expression_list
* args_
;
10487 Make_expression::do_traverse(Traverse
* traverse
)
10489 if (this->args_
!= NULL
10490 && this->args_
->traverse(traverse
) == TRAVERSE_EXIT
)
10491 return TRAVERSE_EXIT
;
10492 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10493 return TRAVERSE_EXIT
;
10494 return TRAVERSE_CONTINUE
;
10497 // Set types of arguments.
10500 Make_expression::do_determine_type(const Type_context
*)
10502 if (this->args_
!= NULL
)
10504 Type_context
context(Type::lookup_integer_type("int"), false);
10505 for (Expression_list::const_iterator pe
= this->args_
->begin();
10506 pe
!= this->args_
->end();
10508 (*pe
)->determine_type(&context
);
10512 // Check types for a make expression.
10515 Make_expression::do_check_types(Gogo
*)
10517 if (this->type_
->channel_type() == NULL
10518 && this->type_
->map_type() == NULL
10519 && (this->type_
->array_type() == NULL
10520 || this->type_
->array_type()->length() != NULL
))
10521 this->report_error(_("invalid type for make function"));
10522 else if (!this->type_
->check_make_expression(this->args_
, this->location()))
10523 this->set_is_error();
10526 // Return a tree for a make expression.
10529 Make_expression::do_get_tree(Translate_context
* context
)
10531 return this->type_
->make_expression_tree(context
, this->args_
,
10535 // Make a make expression.
10538 Expression::make_make(Type
* type
, Expression_list
* args
,
10539 source_location location
)
10541 return new Make_expression(type
, args
, location
);
10544 // Construct a struct.
10546 class Struct_construction_expression
: public Expression
10549 Struct_construction_expression(Type
* type
, Expression_list
* vals
,
10550 source_location location
)
10551 : Expression(EXPRESSION_STRUCT_CONSTRUCTION
, location
),
10552 type_(type
), vals_(vals
)
10555 // Return whether this is a constant initializer.
10557 is_constant_struct() const;
10561 do_traverse(Traverse
* traverse
);
10565 { return this->type_
; }
10568 do_determine_type(const Type_context
*);
10571 do_check_types(Gogo
*);
10576 return new Struct_construction_expression(this->type_
, this->vals_
->copy(),
10581 do_is_addressable() const
10585 do_get_tree(Translate_context
*);
10588 do_export(Export
*) const;
10591 // The type of the struct to construct.
10593 // The list of values, in order of the fields in the struct. A NULL
10594 // entry means that the field should be zero-initialized.
10595 Expression_list
* vals_
;
10601 Struct_construction_expression::do_traverse(Traverse
* traverse
)
10603 if (this->vals_
!= NULL
10604 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
10605 return TRAVERSE_EXIT
;
10606 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10607 return TRAVERSE_EXIT
;
10608 return TRAVERSE_CONTINUE
;
10611 // Return whether this is a constant initializer.
10614 Struct_construction_expression::is_constant_struct() const
10616 if (this->vals_
== NULL
)
10618 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10619 pv
!= this->vals_
->end();
10623 && !(*pv
)->is_constant()
10624 && (!(*pv
)->is_composite_literal()
10625 || (*pv
)->is_nonconstant_composite_literal()))
10629 const Struct_field_list
* fields
= this->type_
->struct_type()->fields();
10630 for (Struct_field_list::const_iterator pf
= fields
->begin();
10631 pf
!= fields
->end();
10634 // There are no constant constructors for interfaces.
10635 if (pf
->type()->interface_type() != NULL
)
10642 // Final type determination.
10645 Struct_construction_expression::do_determine_type(const Type_context
*)
10647 if (this->vals_
== NULL
)
10649 const Struct_field_list
* fields
= this->type_
->struct_type()->fields();
10650 Expression_list::const_iterator pv
= this->vals_
->begin();
10651 for (Struct_field_list::const_iterator pf
= fields
->begin();
10652 pf
!= fields
->end();
10655 if (pv
== this->vals_
->end())
10659 Type_context
subcontext(pf
->type(), false);
10660 (*pv
)->determine_type(&subcontext
);
10663 // Extra values are an error we will report elsewhere; we still want
10664 // to determine the type to avoid knockon errors.
10665 for (; pv
!= this->vals_
->end(); ++pv
)
10666 (*pv
)->determine_type_no_context();
10672 Struct_construction_expression::do_check_types(Gogo
*)
10674 if (this->vals_
== NULL
)
10677 Struct_type
* st
= this->type_
->struct_type();
10678 if (this->vals_
->size() > st
->field_count())
10680 this->report_error(_("too many expressions for struct"));
10684 const Struct_field_list
* fields
= st
->fields();
10685 Expression_list::const_iterator pv
= this->vals_
->begin();
10687 for (Struct_field_list::const_iterator pf
= fields
->begin();
10688 pf
!= fields
->end();
10691 if (pv
== this->vals_
->end())
10693 this->report_error(_("too few expressions for struct"));
10700 std::string reason
;
10701 if (!Type::are_assignable(pf
->type(), (*pv
)->type(), &reason
))
10703 if (reason
.empty())
10704 error_at((*pv
)->location(),
10705 "incompatible type for field %d in struct construction",
10708 error_at((*pv
)->location(),
10709 ("incompatible type for field %d in "
10710 "struct construction (%s)"),
10711 i
+ 1, reason
.c_str());
10712 this->set_is_error();
10715 gcc_assert(pv
== this->vals_
->end());
10718 // Return a tree for constructing a struct.
10721 Struct_construction_expression::do_get_tree(Translate_context
* context
)
10723 Gogo
* gogo
= context
->gogo();
10725 if (this->vals_
== NULL
)
10726 return this->type_
->get_init_tree(gogo
, false);
10728 tree type_tree
= this->type_
->get_tree(gogo
);
10729 if (type_tree
== error_mark_node
)
10730 return error_mark_node
;
10731 gcc_assert(TREE_CODE(type_tree
) == RECORD_TYPE
);
10733 bool is_constant
= true;
10734 const Struct_field_list
* fields
= this->type_
->struct_type()->fields();
10735 VEC(constructor_elt
,gc
)* elts
= VEC_alloc(constructor_elt
, gc
,
10737 Struct_field_list::const_iterator pf
= fields
->begin();
10738 Expression_list::const_iterator pv
= this->vals_
->begin();
10739 for (tree field
= TYPE_FIELDS(type_tree
);
10740 field
!= NULL_TREE
;
10741 field
= DECL_CHAIN(field
), ++pf
)
10743 gcc_assert(pf
!= fields
->end());
10746 if (pv
== this->vals_
->end())
10747 val
= pf
->type()->get_init_tree(gogo
, false);
10748 else if (*pv
== NULL
)
10750 val
= pf
->type()->get_init_tree(gogo
, false);
10755 val
= Expression::convert_for_assignment(context
, pf
->type(),
10757 (*pv
)->get_tree(context
),
10762 if (val
== error_mark_node
|| TREE_TYPE(val
) == error_mark_node
)
10763 return error_mark_node
;
10765 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, elts
, NULL
);
10766 elt
->index
= field
;
10768 if (!TREE_CONSTANT(val
))
10769 is_constant
= false;
10771 gcc_assert(pf
== fields
->end());
10773 tree ret
= build_constructor(type_tree
, elts
);
10775 TREE_CONSTANT(ret
) = 1;
10779 // Export a struct construction.
10782 Struct_construction_expression::do_export(Export
* exp
) const
10784 exp
->write_c_string("convert(");
10785 exp
->write_type(this->type_
);
10786 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10787 pv
!= this->vals_
->end();
10790 exp
->write_c_string(", ");
10792 (*pv
)->export_expression(exp
);
10794 exp
->write_c_string(")");
10797 // Make a struct composite literal. This used by the thunk code.
10800 Expression::make_struct_composite_literal(Type
* type
, Expression_list
* vals
,
10801 source_location location
)
10803 gcc_assert(type
->struct_type() != NULL
);
10804 return new Struct_construction_expression(type
, vals
, location
);
10807 // Construct an array. This class is not used directly; instead we
10808 // use the child classes, Fixed_array_construction_expression and
10809 // Open_array_construction_expression.
10811 class Array_construction_expression
: public Expression
10814 Array_construction_expression(Expression_classification classification
,
10815 Type
* type
, Expression_list
* vals
,
10816 source_location location
)
10817 : Expression(classification
, location
),
10818 type_(type
), vals_(vals
)
10822 // Return whether this is a constant initializer.
10824 is_constant_array() const;
10826 // Return the number of elements.
10828 element_count() const
10829 { return this->vals_
== NULL
? 0 : this->vals_
->size(); }
10833 do_traverse(Traverse
* traverse
);
10837 { return this->type_
; }
10840 do_determine_type(const Type_context
*);
10843 do_check_types(Gogo
*);
10846 do_is_addressable() const
10850 do_export(Export
*) const;
10852 // The list of values.
10855 { return this->vals_
; }
10857 // Get a constructor tree for the array values.
10859 get_constructor_tree(Translate_context
* context
, tree type_tree
);
10862 // The type of the array to construct.
10864 // The list of values.
10865 Expression_list
* vals_
;
10871 Array_construction_expression::do_traverse(Traverse
* traverse
)
10873 if (this->vals_
!= NULL
10874 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
10875 return TRAVERSE_EXIT
;
10876 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10877 return TRAVERSE_EXIT
;
10878 return TRAVERSE_CONTINUE
;
10881 // Return whether this is a constant initializer.
10884 Array_construction_expression::is_constant_array() const
10886 if (this->vals_
== NULL
)
10889 // There are no constant constructors for interfaces.
10890 if (this->type_
->array_type()->element_type()->interface_type() != NULL
)
10893 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10894 pv
!= this->vals_
->end();
10898 && !(*pv
)->is_constant()
10899 && (!(*pv
)->is_composite_literal()
10900 || (*pv
)->is_nonconstant_composite_literal()))
10906 // Final type determination.
10909 Array_construction_expression::do_determine_type(const Type_context
*)
10911 if (this->vals_
== NULL
)
10913 Type_context
subcontext(this->type_
->array_type()->element_type(), false);
10914 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10915 pv
!= this->vals_
->end();
10919 (*pv
)->determine_type(&subcontext
);
10926 Array_construction_expression::do_check_types(Gogo
*)
10928 if (this->vals_
== NULL
)
10931 Array_type
* at
= this->type_
->array_type();
10933 Type
* element_type
= at
->element_type();
10934 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10935 pv
!= this->vals_
->end();
10939 && !Type::are_assignable(element_type
, (*pv
)->type(), NULL
))
10941 error_at((*pv
)->location(),
10942 "incompatible type for element %d in composite literal",
10944 this->set_is_error();
10948 Expression
* length
= at
->length();
10949 if (length
!= NULL
)
10954 if (at
->length()->integer_constant_value(true, val
, &type
))
10956 if (this->vals_
->size() > mpz_get_ui(val
))
10957 this->report_error(_("too many elements in composite literal"));
10963 // Get a constructor tree for the array values.
10966 Array_construction_expression::get_constructor_tree(Translate_context
* context
,
10969 VEC(constructor_elt
,gc
)* values
= VEC_alloc(constructor_elt
, gc
,
10970 (this->vals_
== NULL
10972 : this->vals_
->size()));
10973 Type
* element_type
= this->type_
->array_type()->element_type();
10974 bool is_constant
= true;
10975 if (this->vals_
!= NULL
)
10978 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10979 pv
!= this->vals_
->end();
10982 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, values
, NULL
);
10983 elt
->index
= size_int(i
);
10985 elt
->value
= element_type
->get_init_tree(context
->gogo(), false);
10988 tree value_tree
= (*pv
)->get_tree(context
);
10989 elt
->value
= Expression::convert_for_assignment(context
,
10995 if (elt
->value
== error_mark_node
)
10996 return error_mark_node
;
10997 if (!TREE_CONSTANT(elt
->value
))
10998 is_constant
= false;
11002 tree ret
= build_constructor(type_tree
, values
);
11004 TREE_CONSTANT(ret
) = 1;
11008 // Export an array construction.
11011 Array_construction_expression::do_export(Export
* exp
) const
11013 exp
->write_c_string("convert(");
11014 exp
->write_type(this->type_
);
11015 if (this->vals_
!= NULL
)
11017 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11018 pv
!= this->vals_
->end();
11021 exp
->write_c_string(", ");
11023 (*pv
)->export_expression(exp
);
11026 exp
->write_c_string(")");
11029 // Construct a fixed array.
11031 class Fixed_array_construction_expression
:
11032 public Array_construction_expression
11035 Fixed_array_construction_expression(Type
* type
, Expression_list
* vals
,
11036 source_location location
)
11037 : Array_construction_expression(EXPRESSION_FIXED_ARRAY_CONSTRUCTION
,
11038 type
, vals
, location
)
11040 gcc_assert(type
->array_type() != NULL
11041 && type
->array_type()->length() != NULL
);
11048 return new Fixed_array_construction_expression(this->type(),
11049 (this->vals() == NULL
11051 : this->vals()->copy()),
11056 do_get_tree(Translate_context
*);
11059 // Return a tree for constructing a fixed array.
11062 Fixed_array_construction_expression::do_get_tree(Translate_context
* context
)
11064 return this->get_constructor_tree(context
,
11065 this->type()->get_tree(context
->gogo()));
11068 // Construct an open array.
11070 class Open_array_construction_expression
: public Array_construction_expression
11073 Open_array_construction_expression(Type
* type
, Expression_list
* vals
,
11074 source_location location
)
11075 : Array_construction_expression(EXPRESSION_OPEN_ARRAY_CONSTRUCTION
,
11076 type
, vals
, location
)
11078 gcc_assert(type
->array_type() != NULL
11079 && type
->array_type()->length() == NULL
);
11083 // Note that taking the address of an open array literal is invalid.
11088 return new Open_array_construction_expression(this->type(),
11089 (this->vals() == NULL
11091 : this->vals()->copy()),
11096 do_get_tree(Translate_context
*);
11099 // Return a tree for constructing an open array.
11102 Open_array_construction_expression::do_get_tree(Translate_context
* context
)
11104 Array_type
* array_type
= this->type()->array_type();
11105 if (array_type
== NULL
)
11107 gcc_assert(this->type()->is_error_type());
11108 return error_mark_node
;
11111 Type
* element_type
= array_type
->element_type();
11112 tree element_type_tree
= element_type
->get_tree(context
->gogo());
11113 if (element_type_tree
== error_mark_node
)
11114 return error_mark_node
;
11118 if (this->vals() == NULL
|| this->vals()->empty())
11120 // We need to create a unique value.
11121 tree max
= size_int(0);
11122 tree constructor_type
= build_array_type(element_type_tree
,
11123 build_index_type(max
));
11124 if (constructor_type
== error_mark_node
)
11125 return error_mark_node
;
11126 VEC(constructor_elt
,gc
)* vec
= VEC_alloc(constructor_elt
, gc
, 1);
11127 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, vec
, NULL
);
11128 elt
->index
= size_int(0);
11129 elt
->value
= element_type
->get_init_tree(context
->gogo(), false);
11130 values
= build_constructor(constructor_type
, vec
);
11131 if (TREE_CONSTANT(elt
->value
))
11132 TREE_CONSTANT(values
) = 1;
11133 length_tree
= size_int(0);
11137 tree max
= size_int(this->vals()->size() - 1);
11138 tree constructor_type
= build_array_type(element_type_tree
,
11139 build_index_type(max
));
11140 if (constructor_type
== error_mark_node
)
11141 return error_mark_node
;
11142 values
= this->get_constructor_tree(context
, constructor_type
);
11143 length_tree
= size_int(this->vals()->size());
11146 if (values
== error_mark_node
)
11147 return error_mark_node
;
11149 bool is_constant_initializer
= TREE_CONSTANT(values
);
11151 // We have to copy the initial values into heap memory if we are in
11152 // a function or if the values are not constants. We also have to
11153 // copy them if they may contain pointers in a non-constant context,
11154 // as otherwise the garbage collector won't see them.
11155 bool copy_to_heap
= (context
->function() != NULL
11156 || !is_constant_initializer
11157 || (element_type
->has_pointer()
11158 && !context
->is_const()));
11160 if (is_constant_initializer
)
11162 tree tmp
= build_decl(this->location(), VAR_DECL
,
11163 create_tmp_var_name("C"), TREE_TYPE(values
));
11164 DECL_EXTERNAL(tmp
) = 0;
11165 TREE_PUBLIC(tmp
) = 0;
11166 TREE_STATIC(tmp
) = 1;
11167 DECL_ARTIFICIAL(tmp
) = 1;
11170 // If we are not copying the value to the heap, we will only
11171 // initialize the value once, so we can use this directly
11172 // rather than copying it. In that case we can't make it
11173 // read-only, because the program is permitted to change it.
11174 TREE_READONLY(tmp
) = 1;
11175 TREE_CONSTANT(tmp
) = 1;
11177 DECL_INITIAL(tmp
) = values
;
11178 rest_of_decl_compilation(tmp
, 1, 0);
11186 // the initializer will only run once.
11187 space
= build_fold_addr_expr(values
);
11192 tree memsize
= TYPE_SIZE_UNIT(TREE_TYPE(values
));
11193 space
= context
->gogo()->allocate_memory(element_type
, memsize
,
11195 space
= save_expr(space
);
11197 tree s
= fold_convert(build_pointer_type(TREE_TYPE(values
)), space
);
11198 tree ref
= build_fold_indirect_ref_loc(this->location(), s
);
11199 TREE_THIS_NOTRAP(ref
) = 1;
11200 set
= build2(MODIFY_EXPR
, void_type_node
, ref
, values
);
11203 // Build a constructor for the open array.
11205 tree type_tree
= this->type()->get_tree(context
->gogo());
11206 if (type_tree
== error_mark_node
)
11207 return error_mark_node
;
11208 gcc_assert(TREE_CODE(type_tree
) == RECORD_TYPE
);
11210 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 3);
11212 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
11213 tree field
= TYPE_FIELDS(type_tree
);
11214 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__values") == 0);
11215 elt
->index
= field
;
11216 elt
->value
= fold_convert(TREE_TYPE(field
), space
);
11218 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
11219 field
= DECL_CHAIN(field
);
11220 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__count") == 0);
11221 elt
->index
= field
;
11222 elt
->value
= fold_convert(TREE_TYPE(field
), length_tree
);
11224 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
11225 field
= DECL_CHAIN(field
);
11226 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),"__capacity") == 0);
11227 elt
->index
= field
;
11228 elt
->value
= fold_convert(TREE_TYPE(field
), length_tree
);
11230 tree constructor
= build_constructor(type_tree
, init
);
11231 if (constructor
== error_mark_node
)
11232 return error_mark_node
;
11234 TREE_CONSTANT(constructor
) = 1;
11236 if (set
== NULL_TREE
)
11237 return constructor
;
11239 return build2(COMPOUND_EXPR
, type_tree
, set
, constructor
);
11242 // Make a slice composite literal. This is used by the type
11243 // descriptor code.
11246 Expression::make_slice_composite_literal(Type
* type
, Expression_list
* vals
,
11247 source_location location
)
11249 gcc_assert(type
->is_open_array_type());
11250 return new Open_array_construction_expression(type
, vals
, location
);
11253 // Construct a map.
11255 class Map_construction_expression
: public Expression
11258 Map_construction_expression(Type
* type
, Expression_list
* vals
,
11259 source_location location
)
11260 : Expression(EXPRESSION_MAP_CONSTRUCTION
, location
),
11261 type_(type
), vals_(vals
)
11262 { gcc_assert(vals
== NULL
|| vals
->size() % 2 == 0); }
11266 do_traverse(Traverse
* traverse
);
11270 { return this->type_
; }
11273 do_determine_type(const Type_context
*);
11276 do_check_types(Gogo
*);
11281 return new Map_construction_expression(this->type_
, this->vals_
->copy(),
11286 do_get_tree(Translate_context
*);
11289 do_export(Export
*) const;
11292 // The type of the map to construct.
11294 // The list of values.
11295 Expression_list
* vals_
;
11301 Map_construction_expression::do_traverse(Traverse
* traverse
)
11303 if (this->vals_
!= NULL
11304 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
11305 return TRAVERSE_EXIT
;
11306 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
11307 return TRAVERSE_EXIT
;
11308 return TRAVERSE_CONTINUE
;
11311 // Final type determination.
11314 Map_construction_expression::do_determine_type(const Type_context
*)
11316 if (this->vals_
== NULL
)
11319 Map_type
* mt
= this->type_
->map_type();
11320 Type_context
key_context(mt
->key_type(), false);
11321 Type_context
val_context(mt
->val_type(), false);
11322 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11323 pv
!= this->vals_
->end();
11326 (*pv
)->determine_type(&key_context
);
11328 (*pv
)->determine_type(&val_context
);
11335 Map_construction_expression::do_check_types(Gogo
*)
11337 if (this->vals_
== NULL
)
11340 Map_type
* mt
= this->type_
->map_type();
11342 Type
* key_type
= mt
->key_type();
11343 Type
* val_type
= mt
->val_type();
11344 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11345 pv
!= this->vals_
->end();
11348 if (!Type::are_assignable(key_type
, (*pv
)->type(), NULL
))
11350 error_at((*pv
)->location(),
11351 "incompatible type for element %d key in map construction",
11353 this->set_is_error();
11356 if (!Type::are_assignable(val_type
, (*pv
)->type(), NULL
))
11358 error_at((*pv
)->location(),
11359 ("incompatible type for element %d value "
11360 "in map construction"),
11362 this->set_is_error();
11367 // Return a tree for constructing a map.
11370 Map_construction_expression::do_get_tree(Translate_context
* context
)
11372 Gogo
* gogo
= context
->gogo();
11373 source_location loc
= this->location();
11375 Map_type
* mt
= this->type_
->map_type();
11377 // Build a struct to hold the key and value.
11378 tree struct_type
= make_node(RECORD_TYPE
);
11380 Type
* key_type
= mt
->key_type();
11381 tree id
= get_identifier("__key");
11382 tree key_type_tree
= key_type
->get_tree(gogo
);
11383 if (key_type_tree
== error_mark_node
)
11384 return error_mark_node
;
11385 tree key_field
= build_decl(loc
, FIELD_DECL
, id
, key_type_tree
);
11386 DECL_CONTEXT(key_field
) = struct_type
;
11387 TYPE_FIELDS(struct_type
) = key_field
;
11389 Type
* val_type
= mt
->val_type();
11390 id
= get_identifier("__val");
11391 tree val_type_tree
= val_type
->get_tree(gogo
);
11392 if (val_type_tree
== error_mark_node
)
11393 return error_mark_node
;
11394 tree val_field
= build_decl(loc
, FIELD_DECL
, id
, val_type_tree
);
11395 DECL_CONTEXT(val_field
) = struct_type
;
11396 DECL_CHAIN(key_field
) = val_field
;
11398 layout_type(struct_type
);
11400 bool is_constant
= true;
11405 if (this->vals_
== NULL
|| this->vals_
->empty())
11407 valaddr
= null_pointer_node
;
11408 make_tmp
= NULL_TREE
;
11412 VEC(constructor_elt
,gc
)* values
= VEC_alloc(constructor_elt
, gc
,
11413 this->vals_
->size() / 2);
11415 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11416 pv
!= this->vals_
->end();
11419 bool one_is_constant
= true;
11421 VEC(constructor_elt
,gc
)* one
= VEC_alloc(constructor_elt
, gc
, 2);
11423 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, one
, NULL
);
11424 elt
->index
= key_field
;
11425 tree val_tree
= (*pv
)->get_tree(context
);
11426 elt
->value
= Expression::convert_for_assignment(context
, key_type
,
11429 if (elt
->value
== error_mark_node
)
11430 return error_mark_node
;
11431 if (!TREE_CONSTANT(elt
->value
))
11432 one_is_constant
= false;
11436 elt
= VEC_quick_push(constructor_elt
, one
, NULL
);
11437 elt
->index
= val_field
;
11438 val_tree
= (*pv
)->get_tree(context
);
11439 elt
->value
= Expression::convert_for_assignment(context
, val_type
,
11442 if (elt
->value
== error_mark_node
)
11443 return error_mark_node
;
11444 if (!TREE_CONSTANT(elt
->value
))
11445 one_is_constant
= false;
11447 elt
= VEC_quick_push(constructor_elt
, values
, NULL
);
11448 elt
->index
= size_int(i
);
11449 elt
->value
= build_constructor(struct_type
, one
);
11450 if (one_is_constant
)
11451 TREE_CONSTANT(elt
->value
) = 1;
11453 is_constant
= false;
11456 tree index_type
= build_index_type(size_int(i
- 1));
11457 tree array_type
= build_array_type(struct_type
, index_type
);
11458 tree init
= build_constructor(array_type
, values
);
11460 TREE_CONSTANT(init
) = 1;
11462 if (current_function_decl
!= NULL
)
11464 tmp
= create_tmp_var(array_type
, get_name(array_type
));
11465 DECL_INITIAL(tmp
) = init
;
11466 make_tmp
= fold_build1_loc(loc
, DECL_EXPR
, void_type_node
, tmp
);
11467 TREE_ADDRESSABLE(tmp
) = 1;
11471 tmp
= build_decl(loc
, VAR_DECL
, create_tmp_var_name("M"), array_type
);
11472 DECL_EXTERNAL(tmp
) = 0;
11473 TREE_PUBLIC(tmp
) = 0;
11474 TREE_STATIC(tmp
) = 1;
11475 DECL_ARTIFICIAL(tmp
) = 1;
11476 if (!TREE_CONSTANT(init
))
11477 make_tmp
= fold_build2_loc(loc
, INIT_EXPR
, void_type_node
, tmp
,
11481 TREE_READONLY(tmp
) = 1;
11482 TREE_CONSTANT(tmp
) = 1;
11483 DECL_INITIAL(tmp
) = init
;
11484 make_tmp
= NULL_TREE
;
11486 rest_of_decl_compilation(tmp
, 1, 0);
11489 valaddr
= build_fold_addr_expr(tmp
);
11492 tree descriptor
= gogo
->map_descriptor(mt
);
11494 tree type_tree
= this->type_
->get_tree(gogo
);
11495 if (type_tree
== error_mark_node
)
11496 return error_mark_node
;
11498 static tree construct_map_fndecl
;
11499 tree call
= Gogo::call_builtin(&construct_map_fndecl
,
11501 "__go_construct_map",
11504 TREE_TYPE(descriptor
),
11509 TYPE_SIZE_UNIT(struct_type
),
11511 byte_position(val_field
),
11513 TYPE_SIZE_UNIT(TREE_TYPE(val_field
)),
11514 const_ptr_type_node
,
11515 fold_convert(const_ptr_type_node
, valaddr
));
11516 if (call
== error_mark_node
)
11517 return error_mark_node
;
11520 if (make_tmp
== NULL
)
11523 ret
= fold_build2_loc(loc
, COMPOUND_EXPR
, type_tree
, make_tmp
, call
);
11527 // Export an array construction.
11530 Map_construction_expression::do_export(Export
* exp
) const
11532 exp
->write_c_string("convert(");
11533 exp
->write_type(this->type_
);
11534 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11535 pv
!= this->vals_
->end();
11538 exp
->write_c_string(", ");
11539 (*pv
)->export_expression(exp
);
11541 exp
->write_c_string(")");
11544 // A general composite literal. This is lowered to a type specific
11547 class Composite_literal_expression
: public Parser_expression
11550 Composite_literal_expression(Type
* type
, int depth
, bool has_keys
,
11551 Expression_list
* vals
, source_location location
)
11552 : Parser_expression(EXPRESSION_COMPOSITE_LITERAL
, location
),
11553 type_(type
), depth_(depth
), vals_(vals
), has_keys_(has_keys
)
11558 do_traverse(Traverse
* traverse
);
11561 do_lower(Gogo
*, Named_object
*, int);
11566 return new Composite_literal_expression(this->type_
, this->depth_
,
11568 (this->vals_
== NULL
11570 : this->vals_
->copy()),
11576 lower_struct(Type
*);
11579 lower_array(Type
*);
11582 make_array(Type
*, Expression_list
*);
11585 lower_map(Gogo
*, Named_object
*, Type
*);
11587 // The type of the composite literal.
11589 // The depth within a list of composite literals within a composite
11590 // literal, when the type is omitted.
11592 // The values to put in the composite literal.
11593 Expression_list
* vals_
;
11594 // If this is true, then VALS_ is a list of pairs: a key and a
11595 // value. In an array initializer, a missing key will be NULL.
11602 Composite_literal_expression::do_traverse(Traverse
* traverse
)
11604 if (this->vals_
!= NULL
11605 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
11606 return TRAVERSE_EXIT
;
11607 return Type::traverse(this->type_
, traverse
);
11610 // Lower a generic composite literal into a specific version based on
11614 Composite_literal_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
11616 Type
* type
= this->type_
;
11618 for (int depth
= this->depth_
; depth
> 0; --depth
)
11620 if (type
->array_type() != NULL
)
11621 type
= type
->array_type()->element_type();
11622 else if (type
->map_type() != NULL
)
11623 type
= type
->map_type()->val_type();
11626 if (!type
->is_error_type())
11627 error_at(this->location(),
11628 ("may only omit types within composite literals "
11629 "of slice, array, or map type"));
11630 return Expression::make_error(this->location());
11634 if (type
->is_error_type())
11635 return Expression::make_error(this->location());
11636 else if (type
->struct_type() != NULL
)
11637 return this->lower_struct(type
);
11638 else if (type
->array_type() != NULL
)
11639 return this->lower_array(type
);
11640 else if (type
->map_type() != NULL
)
11641 return this->lower_map(gogo
, function
, type
);
11644 error_at(this->location(),
11645 ("expected struct, slice, array, or map type "
11646 "for composite literal"));
11647 return Expression::make_error(this->location());
11651 // Lower a struct composite literal.
11654 Composite_literal_expression::lower_struct(Type
* type
)
11656 source_location location
= this->location();
11657 Struct_type
* st
= type
->struct_type();
11658 if (this->vals_
== NULL
|| !this->has_keys_
)
11659 return new Struct_construction_expression(type
, this->vals_
, location
);
11661 size_t field_count
= st
->field_count();
11662 std::vector
<Expression
*> vals(field_count
);
11663 Expression_list::const_iterator p
= this->vals_
->begin();
11664 while (p
!= this->vals_
->end())
11666 Expression
* name_expr
= *p
;
11669 gcc_assert(p
!= this->vals_
->end());
11670 Expression
* val
= *p
;
11674 if (name_expr
== NULL
)
11676 error_at(val
->location(), "mixture of field and value initializers");
11677 return Expression::make_error(location
);
11680 bool bad_key
= false;
11682 switch (name_expr
->classification())
11684 case EXPRESSION_UNKNOWN_REFERENCE
:
11685 name
= name_expr
->unknown_expression()->name();
11688 case EXPRESSION_CONST_REFERENCE
:
11689 name
= static_cast<Const_expression
*>(name_expr
)->name();
11692 case EXPRESSION_TYPE
:
11694 Type
* t
= name_expr
->type();
11695 Named_type
* nt
= t
->named_type();
11703 case EXPRESSION_VAR_REFERENCE
:
11704 name
= name_expr
->var_expression()->name();
11707 case EXPRESSION_FUNC_REFERENCE
:
11708 name
= name_expr
->func_expression()->name();
11711 case EXPRESSION_UNARY
:
11712 // If there is a local variable around with the same name as
11713 // the field, and this occurs in the closure, then the
11714 // parser may turn the field reference into an indirection
11715 // through the closure. FIXME: This is a mess.
11718 Unary_expression
* ue
= static_cast<Unary_expression
*>(name_expr
);
11719 if (ue
->op() == OPERATOR_MULT
)
11721 Field_reference_expression
* fre
=
11722 ue
->operand()->field_reference_expression();
11726 fre
->expr()->type()->deref()->struct_type();
11729 const Struct_field
* sf
= st
->field(fre
->field_index());
11730 name
= sf
->field_name();
11732 snprintf(buf
, sizeof buf
, "%u", fre
->field_index());
11733 size_t buflen
= strlen(buf
);
11734 if (name
.compare(name
.length() - buflen
, buflen
, buf
)
11737 name
= name
.substr(0, name
.length() - buflen
);
11752 error_at(name_expr
->location(), "expected struct field name");
11753 return Expression::make_error(location
);
11756 unsigned int index
;
11757 const Struct_field
* sf
= st
->find_local_field(name
, &index
);
11760 error_at(name_expr
->location(), "unknown field %qs in %qs",
11761 Gogo::message_name(name
).c_str(),
11762 (type
->named_type() != NULL
11763 ? type
->named_type()->message_name().c_str()
11764 : "unnamed struct"));
11765 return Expression::make_error(location
);
11767 if (vals
[index
] != NULL
)
11769 error_at(name_expr
->location(),
11770 "duplicate value for field %qs in %qs",
11771 Gogo::message_name(name
).c_str(),
11772 (type
->named_type() != NULL
11773 ? type
->named_type()->message_name().c_str()
11774 : "unnamed struct"));
11775 return Expression::make_error(location
);
11781 Expression_list
* list
= new Expression_list
;
11782 list
->reserve(field_count
);
11783 for (size_t i
= 0; i
< field_count
; ++i
)
11784 list
->push_back(vals
[i
]);
11786 return new Struct_construction_expression(type
, list
, location
);
11789 // Lower an array composite literal.
11792 Composite_literal_expression::lower_array(Type
* type
)
11794 source_location location
= this->location();
11795 if (this->vals_
== NULL
|| !this->has_keys_
)
11796 return this->make_array(type
, this->vals_
);
11798 std::vector
<Expression
*> vals
;
11799 vals
.reserve(this->vals_
->size());
11800 unsigned long index
= 0;
11801 Expression_list::const_iterator p
= this->vals_
->begin();
11802 while (p
!= this->vals_
->end())
11804 Expression
* index_expr
= *p
;
11807 gcc_assert(p
!= this->vals_
->end());
11808 Expression
* val
= *p
;
11812 if (index_expr
!= NULL
)
11817 if (!index_expr
->integer_constant_value(true, ival
, &dummy
))
11820 error_at(index_expr
->location(),
11821 "index expression is not integer constant");
11822 return Expression::make_error(location
);
11824 if (mpz_sgn(ival
) < 0)
11827 error_at(index_expr
->location(), "index expression is negative");
11828 return Expression::make_error(location
);
11830 index
= mpz_get_ui(ival
);
11831 if (mpz_cmp_ui(ival
, index
) != 0)
11834 error_at(index_expr
->location(), "index value overflow");
11835 return Expression::make_error(location
);
11840 if (index
== vals
.size())
11841 vals
.push_back(val
);
11844 if (index
> vals
.size())
11846 vals
.reserve(index
+ 32);
11847 vals
.resize(index
+ 1, static_cast<Expression
*>(NULL
));
11849 if (vals
[index
] != NULL
)
11851 error_at((index_expr
!= NULL
11852 ? index_expr
->location()
11853 : val
->location()),
11854 "duplicate value for index %lu",
11856 return Expression::make_error(location
);
11864 size_t size
= vals
.size();
11865 Expression_list
* list
= new Expression_list
;
11866 list
->reserve(size
);
11867 for (size_t i
= 0; i
< size
; ++i
)
11868 list
->push_back(vals
[i
]);
11870 return this->make_array(type
, list
);
11873 // Actually build the array composite literal. This handles
11877 Composite_literal_expression::make_array(Type
* type
, Expression_list
* vals
)
11879 source_location location
= this->location();
11880 Array_type
* at
= type
->array_type();
11881 if (at
->length() != NULL
&& at
->length()->is_nil_expression())
11883 size_t size
= vals
== NULL
? 0 : vals
->size();
11885 mpz_init_set_ui(vlen
, size
);
11886 Expression
* elen
= Expression::make_integer(&vlen
, NULL
, location
);
11888 at
= Type::make_array_type(at
->element_type(), elen
);
11891 if (at
->length() != NULL
)
11892 return new Fixed_array_construction_expression(type
, vals
, location
);
11894 return new Open_array_construction_expression(type
, vals
, location
);
11897 // Lower a map composite literal.
11900 Composite_literal_expression::lower_map(Gogo
* gogo
, Named_object
* function
,
11903 source_location location
= this->location();
11904 if (this->vals_
!= NULL
)
11906 if (!this->has_keys_
)
11908 error_at(location
, "map composite literal must have keys");
11909 return Expression::make_error(location
);
11912 for (Expression_list::iterator p
= this->vals_
->begin();
11913 p
!= this->vals_
->end();
11919 error_at((*p
)->location(),
11920 "map composite literal must have keys for every value");
11921 return Expression::make_error(location
);
11923 // Make sure we have lowered the key; it may not have been
11924 // lowered in order to handle keys for struct composite
11925 // literals. Lower it now to get the right error message.
11926 if ((*p
)->unknown_expression() != NULL
)
11928 (*p
)->unknown_expression()->clear_is_composite_literal_key();
11929 gogo
->lower_expression(function
, &*p
);
11930 gcc_assert((*p
)->is_error_expression());
11931 return Expression::make_error(location
);
11936 return new Map_construction_expression(type
, this->vals_
, location
);
11939 // Make a composite literal expression.
11942 Expression::make_composite_literal(Type
* type
, int depth
, bool has_keys
,
11943 Expression_list
* vals
,
11944 source_location location
)
11946 return new Composite_literal_expression(type
, depth
, has_keys
, vals
,
11950 // Return whether this expression is a composite literal.
11953 Expression::is_composite_literal() const
11955 switch (this->classification_
)
11957 case EXPRESSION_COMPOSITE_LITERAL
:
11958 case EXPRESSION_STRUCT_CONSTRUCTION
:
11959 case EXPRESSION_FIXED_ARRAY_CONSTRUCTION
:
11960 case EXPRESSION_OPEN_ARRAY_CONSTRUCTION
:
11961 case EXPRESSION_MAP_CONSTRUCTION
:
11968 // Return whether this expression is a composite literal which is not
11972 Expression::is_nonconstant_composite_literal() const
11974 switch (this->classification_
)
11976 case EXPRESSION_STRUCT_CONSTRUCTION
:
11978 const Struct_construction_expression
*psce
=
11979 static_cast<const Struct_construction_expression
*>(this);
11980 return !psce
->is_constant_struct();
11982 case EXPRESSION_FIXED_ARRAY_CONSTRUCTION
:
11984 const Fixed_array_construction_expression
*pace
=
11985 static_cast<const Fixed_array_construction_expression
*>(this);
11986 return !pace
->is_constant_array();
11988 case EXPRESSION_OPEN_ARRAY_CONSTRUCTION
:
11990 const Open_array_construction_expression
*pace
=
11991 static_cast<const Open_array_construction_expression
*>(this);
11992 return !pace
->is_constant_array();
11994 case EXPRESSION_MAP_CONSTRUCTION
:
12001 // Return true if this is a reference to a local variable.
12004 Expression::is_local_variable() const
12006 const Var_expression
* ve
= this->var_expression();
12009 const Named_object
* no
= ve
->named_object();
12010 return (no
->is_result_variable()
12011 || (no
->is_variable() && !no
->var_value()->is_global()));
12014 // Class Type_guard_expression.
12019 Type_guard_expression::do_traverse(Traverse
* traverse
)
12021 if (Expression::traverse(&this->expr_
, traverse
) == TRAVERSE_EXIT
12022 || Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
12023 return TRAVERSE_EXIT
;
12024 return TRAVERSE_CONTINUE
;
12027 // Check types of a type guard expression. The expression must have
12028 // an interface type, but the actual type conversion is checked at run
12032 Type_guard_expression::do_check_types(Gogo
*)
12034 // 6g permits using a type guard with unsafe.pointer; we are
12036 Type
* expr_type
= this->expr_
->type();
12037 if (expr_type
->is_unsafe_pointer_type())
12039 if (this->type_
->points_to() == NULL
12040 && (this->type_
->integer_type() == NULL
12041 || (this->type_
->forwarded()
12042 != Type::lookup_integer_type("uintptr"))))
12043 this->report_error(_("invalid unsafe.Pointer conversion"));
12045 else if (this->type_
->is_unsafe_pointer_type())
12047 if (expr_type
->points_to() == NULL
12048 && (expr_type
->integer_type() == NULL
12049 || (expr_type
->forwarded()
12050 != Type::lookup_integer_type("uintptr"))))
12051 this->report_error(_("invalid unsafe.Pointer conversion"));
12053 else if (expr_type
->interface_type() == NULL
)
12055 if (!expr_type
->is_error_type() && !this->type_
->is_error_type())
12056 this->report_error(_("type assertion only valid for interface types"));
12057 this->set_is_error();
12059 else if (this->type_
->interface_type() == NULL
)
12061 std::string reason
;
12062 if (!expr_type
->interface_type()->implements_interface(this->type_
,
12065 if (!this->type_
->is_error_type())
12067 if (reason
.empty())
12068 this->report_error(_("impossible type assertion: "
12069 "type does not implement interface"));
12071 error_at(this->location(),
12072 ("impossible type assertion: "
12073 "type does not implement interface (%s)"),
12076 this->set_is_error();
12081 // Return a tree for a type guard expression.
12084 Type_guard_expression::do_get_tree(Translate_context
* context
)
12086 Gogo
* gogo
= context
->gogo();
12087 tree expr_tree
= this->expr_
->get_tree(context
);
12088 if (expr_tree
== error_mark_node
)
12089 return error_mark_node
;
12090 Type
* expr_type
= this->expr_
->type();
12091 if ((this->type_
->is_unsafe_pointer_type()
12092 && (expr_type
->points_to() != NULL
12093 || expr_type
->integer_type() != NULL
))
12094 || (expr_type
->is_unsafe_pointer_type()
12095 && this->type_
->points_to() != NULL
))
12096 return convert_to_pointer(this->type_
->get_tree(gogo
), expr_tree
);
12097 else if (expr_type
->is_unsafe_pointer_type()
12098 && this->type_
->integer_type() != NULL
)
12099 return convert_to_integer(this->type_
->get_tree(gogo
), expr_tree
);
12100 else if (this->type_
->interface_type() != NULL
)
12101 return Expression::convert_interface_to_interface(context
, this->type_
,
12102 this->expr_
->type(),
12106 return Expression::convert_for_assignment(context
, this->type_
,
12107 this->expr_
->type(), expr_tree
,
12111 // Make a type guard expression.
12114 Expression::make_type_guard(Expression
* expr
, Type
* type
,
12115 source_location location
)
12117 return new Type_guard_expression(expr
, type
, location
);
12120 // Class Heap_composite_expression.
12122 // When you take the address of a composite literal, it is allocated
12123 // on the heap. This class implements that.
12125 class Heap_composite_expression
: public Expression
12128 Heap_composite_expression(Expression
* expr
, source_location location
)
12129 : Expression(EXPRESSION_HEAP_COMPOSITE
, location
),
12135 do_traverse(Traverse
* traverse
)
12136 { return Expression::traverse(&this->expr_
, traverse
); }
12140 { return Type::make_pointer_type(this->expr_
->type()); }
12143 do_determine_type(const Type_context
*)
12144 { this->expr_
->determine_type_no_context(); }
12149 return Expression::make_heap_composite(this->expr_
->copy(),
12154 do_get_tree(Translate_context
*);
12156 // We only export global objects, and the parser does not generate
12157 // this in global scope.
12159 do_export(Export
*) const
12160 { gcc_unreachable(); }
12163 // The composite literal which is being put on the heap.
12167 // Return a tree which allocates a composite literal on the heap.
12170 Heap_composite_expression::do_get_tree(Translate_context
* context
)
12172 tree expr_tree
= this->expr_
->get_tree(context
);
12173 if (expr_tree
== error_mark_node
)
12174 return error_mark_node
;
12175 tree expr_size
= TYPE_SIZE_UNIT(TREE_TYPE(expr_tree
));
12176 gcc_assert(TREE_CODE(expr_size
) == INTEGER_CST
);
12177 tree space
= context
->gogo()->allocate_memory(this->expr_
->type(),
12178 expr_size
, this->location());
12179 space
= fold_convert(build_pointer_type(TREE_TYPE(expr_tree
)), space
);
12180 space
= save_expr(space
);
12181 tree ref
= build_fold_indirect_ref_loc(this->location(), space
);
12182 TREE_THIS_NOTRAP(ref
) = 1;
12183 tree ret
= build2(COMPOUND_EXPR
, TREE_TYPE(space
),
12184 build2(MODIFY_EXPR
, void_type_node
, ref
, expr_tree
),
12186 SET_EXPR_LOCATION(ret
, this->location());
12190 // Allocate a composite literal on the heap.
12193 Expression::make_heap_composite(Expression
* expr
, source_location location
)
12195 return new Heap_composite_expression(expr
, location
);
12198 // Class Receive_expression.
12200 // Return the type of a receive expression.
12203 Receive_expression::do_type()
12205 Channel_type
* channel_type
= this->channel_
->type()->channel_type();
12206 if (channel_type
== NULL
)
12207 return Type::make_error_type();
12208 return channel_type
->element_type();
12211 // Check types for a receive expression.
12214 Receive_expression::do_check_types(Gogo
*)
12216 Type
* type
= this->channel_
->type();
12217 if (type
->is_error_type())
12219 this->set_is_error();
12222 if (type
->channel_type() == NULL
)
12224 this->report_error(_("expected channel"));
12227 if (!type
->channel_type()->may_receive())
12229 this->report_error(_("invalid receive on send-only channel"));
12234 // Get a tree for a receive expression.
12237 Receive_expression::do_get_tree(Translate_context
* context
)
12239 Channel_type
* channel_type
= this->channel_
->type()->channel_type();
12240 gcc_assert(channel_type
!= NULL
);
12241 Type
* element_type
= channel_type
->element_type();
12242 tree element_type_tree
= element_type
->get_tree(context
->gogo());
12244 tree channel
= this->channel_
->get_tree(context
);
12245 if (element_type_tree
== error_mark_node
|| channel
== error_mark_node
)
12246 return error_mark_node
;
12248 return Gogo::receive_from_channel(element_type_tree
, channel
,
12249 this->for_select_
, this->location());
12252 // Make a receive expression.
12254 Receive_expression
*
12255 Expression::make_receive(Expression
* channel
, source_location location
)
12257 return new Receive_expression(channel
, location
);
12260 // Class Send_expression.
12265 Send_expression::do_traverse(Traverse
* traverse
)
12267 if (Expression::traverse(&this->channel_
, traverse
) == TRAVERSE_EXIT
)
12268 return TRAVERSE_EXIT
;
12269 return Expression::traverse(&this->val_
, traverse
);
12275 Send_expression::do_type()
12277 return Type::lookup_bool_type();
12283 Send_expression::do_determine_type(const Type_context
*)
12285 this->channel_
->determine_type_no_context();
12287 Type
* type
= this->channel_
->type();
12288 Type_context subcontext
;
12289 if (type
->channel_type() != NULL
)
12290 subcontext
.type
= type
->channel_type()->element_type();
12291 this->val_
->determine_type(&subcontext
);
12297 Send_expression::do_check_types(Gogo
*)
12299 Type
* type
= this->channel_
->type();
12300 if (type
->is_error_type())
12302 this->set_is_error();
12305 Channel_type
* channel_type
= type
->channel_type();
12306 if (channel_type
== NULL
)
12308 error_at(this->location(), "left operand of %<<-%> must be channel");
12309 this->set_is_error();
12312 Type
* element_type
= channel_type
->element_type();
12313 if (element_type
!= NULL
12314 && !Type::are_assignable(element_type
, this->val_
->type(), NULL
))
12316 this->report_error(_("incompatible types in send"));
12319 if (!channel_type
->may_send())
12321 this->report_error(_("invalid send on receive-only channel"));
12326 // Get a tree for a send expression.
12329 Send_expression::do_get_tree(Translate_context
* context
)
12331 tree channel
= this->channel_
->get_tree(context
);
12332 tree val
= this->val_
->get_tree(context
);
12333 if (channel
== error_mark_node
|| val
== error_mark_node
)
12334 return error_mark_node
;
12335 Channel_type
* channel_type
= this->channel_
->type()->channel_type();
12336 val
= Expression::convert_for_assignment(context
,
12337 channel_type
->element_type(),
12338 this->val_
->type(),
12341 return Gogo::send_on_channel(channel
, val
, this->is_value_discarded_
,
12342 this->for_select_
, this->location());
12345 // Make a send expression
12348 Expression::make_send(Expression
* channel
, Expression
* val
,
12349 source_location location
)
12351 return new Send_expression(channel
, val
, location
);
12354 // An expression which evaluates to a pointer to the type descriptor
12357 class Type_descriptor_expression
: public Expression
12360 Type_descriptor_expression(Type
* type
, source_location location
)
12361 : Expression(EXPRESSION_TYPE_DESCRIPTOR
, location
),
12368 { return Type::make_type_descriptor_ptr_type(); }
12371 do_determine_type(const Type_context
*)
12379 do_get_tree(Translate_context
* context
)
12380 { return this->type_
->type_descriptor_pointer(context
->gogo()); }
12383 // The type for which this is the descriptor.
12387 // Make a type descriptor expression.
12390 Expression::make_type_descriptor(Type
* type
, source_location location
)
12392 return new Type_descriptor_expression(type
, location
);
12395 // An expression which evaluates to some characteristic of a type.
12396 // This is only used to initialize fields of a type descriptor. Using
12397 // a new expression class is slightly inefficient but gives us a good
12398 // separation between the frontend and the middle-end with regard to
12399 // how types are laid out.
12401 class Type_info_expression
: public Expression
12404 Type_info_expression(Type
* type
, Type_info type_info
)
12405 : Expression(EXPRESSION_TYPE_INFO
, BUILTINS_LOCATION
),
12406 type_(type
), type_info_(type_info
)
12414 do_determine_type(const Type_context
*)
12422 do_get_tree(Translate_context
* context
);
12425 // The type for which we are getting information.
12427 // What information we want.
12428 Type_info type_info_
;
12431 // The type is chosen to match what the type descriptor struct
12435 Type_info_expression::do_type()
12437 switch (this->type_info_
)
12439 case TYPE_INFO_SIZE
:
12440 return Type::lookup_integer_type("uintptr");
12441 case TYPE_INFO_ALIGNMENT
:
12442 case TYPE_INFO_FIELD_ALIGNMENT
:
12443 return Type::lookup_integer_type("uint8");
12449 // Return type information in GENERIC.
12452 Type_info_expression::do_get_tree(Translate_context
* context
)
12454 tree type_tree
= this->type_
->get_tree(context
->gogo());
12455 if (type_tree
== error_mark_node
)
12456 return error_mark_node
;
12458 tree val_type_tree
= this->type()->get_tree(context
->gogo());
12459 gcc_assert(val_type_tree
!= error_mark_node
);
12461 if (this->type_info_
== TYPE_INFO_SIZE
)
12462 return fold_convert_loc(BUILTINS_LOCATION
, val_type_tree
,
12463 TYPE_SIZE_UNIT(type_tree
));
12467 if (this->type_info_
== TYPE_INFO_ALIGNMENT
)
12468 val
= go_type_alignment(type_tree
);
12470 val
= go_field_alignment(type_tree
);
12471 return build_int_cstu(val_type_tree
, val
);
12475 // Make a type info expression.
12478 Expression::make_type_info(Type
* type
, Type_info type_info
)
12480 return new Type_info_expression(type
, type_info
);
12483 // An expression which evaluates to the offset of a field within a
12484 // struct. This, like Type_info_expression, q.v., is only used to
12485 // initialize fields of a type descriptor.
12487 class Struct_field_offset_expression
: public Expression
12490 Struct_field_offset_expression(Struct_type
* type
, const Struct_field
* field
)
12491 : Expression(EXPRESSION_STRUCT_FIELD_OFFSET
, BUILTINS_LOCATION
),
12492 type_(type
), field_(field
)
12498 { return Type::lookup_integer_type("uintptr"); }
12501 do_determine_type(const Type_context
*)
12509 do_get_tree(Translate_context
* context
);
12512 // The type of the struct.
12513 Struct_type
* type_
;
12515 const Struct_field
* field_
;
12518 // Return a struct field offset in GENERIC.
12521 Struct_field_offset_expression::do_get_tree(Translate_context
* context
)
12523 tree type_tree
= this->type_
->get_tree(context
->gogo());
12524 if (type_tree
== error_mark_node
)
12525 return error_mark_node
;
12527 tree val_type_tree
= this->type()->get_tree(context
->gogo());
12528 gcc_assert(val_type_tree
!= error_mark_node
);
12530 const Struct_field_list
* fields
= this->type_
->fields();
12531 tree struct_field_tree
= TYPE_FIELDS(type_tree
);
12532 Struct_field_list::const_iterator p
;
12533 for (p
= fields
->begin();
12534 p
!= fields
->end();
12535 ++p
, struct_field_tree
= DECL_CHAIN(struct_field_tree
))
12537 gcc_assert(struct_field_tree
!= NULL_TREE
);
12538 if (&*p
== this->field_
)
12541 gcc_assert(&*p
== this->field_
);
12543 return fold_convert_loc(BUILTINS_LOCATION
, val_type_tree
,
12544 byte_position(struct_field_tree
));
12547 // Make an expression for a struct field offset.
12550 Expression::make_struct_field_offset(Struct_type
* type
,
12551 const Struct_field
* field
)
12553 return new Struct_field_offset_expression(type
, field
);
12556 // An expression which evaluates to the address of an unnamed label.
12558 class Label_addr_expression
: public Expression
12561 Label_addr_expression(Label
* label
, source_location location
)
12562 : Expression(EXPRESSION_LABEL_ADDR
, location
),
12569 { return Type::make_pointer_type(Type::make_void_type()); }
12572 do_determine_type(const Type_context
*)
12577 { return new Label_addr_expression(this->label_
, this->location()); }
12580 do_get_tree(Translate_context
*)
12581 { return this->label_
->get_addr(this->location()); }
12584 // The label whose address we are taking.
12588 // Make an expression for the address of an unnamed label.
12591 Expression::make_label_addr(Label
* label
, source_location location
)
12593 return new Label_addr_expression(label
, location
);
12596 // Import an expression. This comes at the end in order to see the
12597 // various class definitions.
12600 Expression::import_expression(Import
* imp
)
12602 int c
= imp
->peek_char();
12603 if (imp
->match_c_string("- ")
12604 || imp
->match_c_string("! ")
12605 || imp
->match_c_string("^ "))
12606 return Unary_expression::do_import(imp
);
12608 return Binary_expression::do_import(imp
);
12609 else if (imp
->match_c_string("true")
12610 || imp
->match_c_string("false"))
12611 return Boolean_expression::do_import(imp
);
12613 return String_expression::do_import(imp
);
12614 else if (c
== '-' || (c
>= '0' && c
<= '9'))
12616 // This handles integers, floats and complex constants.
12617 return Integer_expression::do_import(imp
);
12619 else if (imp
->match_c_string("nil"))
12620 return Nil_expression::do_import(imp
);
12621 else if (imp
->match_c_string("convert"))
12622 return Type_conversion_expression::do_import(imp
);
12625 error_at(imp
->location(), "import error: expected expression");
12626 return Expression::make_error(imp
->location());
12630 // Class Expression_list.
12632 // Traverse the list.
12635 Expression_list::traverse(Traverse
* traverse
)
12637 for (Expression_list::iterator p
= this->begin();
12643 if (Expression::traverse(&*p
, traverse
) == TRAVERSE_EXIT
)
12644 return TRAVERSE_EXIT
;
12647 return TRAVERSE_CONTINUE
;
12653 Expression_list::copy()
12655 Expression_list
* ret
= new Expression_list();
12656 for (Expression_list::iterator p
= this->begin();
12661 ret
->push_back(NULL
);
12663 ret
->push_back((*p
)->copy());
12668 // Return whether an expression list has an error expression.
12671 Expression_list::contains_error() const
12673 for (Expression_list::const_iterator p
= this->begin();
12676 if (*p
!= NULL
&& (*p
)->is_error_expression())