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 // This will panic if the interface conversion fails.
509 TREE_NOTHROW(assert_interface_decl
) = 0;
510 elt
->value
= fold_convert_loc(location
, TREE_TYPE(field
), call
);
512 else if (lhs_is_empty
)
514 // A convertion to an empty interface always succeeds, and the
515 // first field is just the type descriptor of the object.
516 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),
517 "__type_descriptor") == 0);
518 gcc_assert(TREE_TYPE(field
) == TREE_TYPE(rhs_type_descriptor
));
519 elt
->value
= rhs_type_descriptor
;
523 // A conversion to a non-empty interface may fail, but unlike a
524 // type assertion converting nil will always succeed.
525 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__methods")
527 tree lhs_type_descriptor
= lhs_type
->type_descriptor_pointer(gogo
);
528 static tree convert_interface_decl
;
529 tree call
= Gogo::call_builtin(&convert_interface_decl
,
531 "__go_convert_interface",
534 TREE_TYPE(lhs_type_descriptor
),
536 TREE_TYPE(rhs_type_descriptor
),
537 rhs_type_descriptor
);
538 // This will panic if the interface conversion fails.
539 TREE_NOTHROW(convert_interface_decl
) = 0;
540 elt
->value
= fold_convert_loc(location
, TREE_TYPE(field
), call
);
543 // The second field is simply the object pointer.
545 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
546 field
= DECL_CHAIN(field
);
547 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__object") == 0);
550 tree rhs_type_tree
= TREE_TYPE(rhs_tree
);
551 gcc_assert(TREE_CODE(rhs_type_tree
) == RECORD_TYPE
);
552 tree rhs_field
= DECL_CHAIN(TYPE_FIELDS(rhs_type_tree
));
553 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(rhs_field
)), "__object") == 0);
554 elt
->value
= build3(COMPONENT_REF
, TREE_TYPE(rhs_field
), rhs_tree
, rhs_field
,
557 return build_constructor(lhs_type_tree
, init
);
560 // Return a tree for the conversion of an interface type to a
561 // non-interface type.
564 Expression::convert_interface_to_type(Translate_context
* context
,
565 Type
*lhs_type
, Type
* rhs_type
,
566 tree rhs_tree
, source_location location
)
568 Gogo
* gogo
= context
->gogo();
569 tree rhs_type_tree
= TREE_TYPE(rhs_tree
);
571 tree lhs_type_tree
= lhs_type
->get_tree(gogo
);
572 if (lhs_type_tree
== error_mark_node
)
573 return error_mark_node
;
575 // Call a function to check that the type is valid. The function
576 // will panic with an appropriate runtime type error if the type is
579 tree lhs_type_descriptor
= lhs_type
->type_descriptor_pointer(gogo
);
581 if (!DECL_P(rhs_tree
))
582 rhs_tree
= save_expr(rhs_tree
);
584 tree rhs_type_descriptor
=
585 Expression::get_interface_type_descriptor(context
, rhs_type
, rhs_tree
,
588 tree rhs_inter_descriptor
= rhs_type
->type_descriptor_pointer(gogo
);
590 static tree check_interface_type_decl
;
591 tree call
= Gogo::call_builtin(&check_interface_type_decl
,
593 "__go_check_interface_type",
596 TREE_TYPE(lhs_type_descriptor
),
598 TREE_TYPE(rhs_type_descriptor
),
600 TREE_TYPE(rhs_inter_descriptor
),
601 rhs_inter_descriptor
);
602 // This call will panic if the conversion is invalid.
603 TREE_NOTHROW(check_interface_type_decl
) = 0;
605 // If the call succeeds, pull out the value.
606 gcc_assert(TREE_CODE(rhs_type_tree
) == RECORD_TYPE
);
607 tree rhs_field
= DECL_CHAIN(TYPE_FIELDS(rhs_type_tree
));
608 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(rhs_field
)), "__object") == 0);
609 tree val
= build3(COMPONENT_REF
, TREE_TYPE(rhs_field
), rhs_tree
, rhs_field
,
612 // If the value is a pointer, then it is the value we want.
613 // Otherwise it points to the value.
614 if (lhs_type
->points_to() == NULL
)
616 val
= fold_convert_loc(location
, build_pointer_type(lhs_type_tree
), val
);
617 val
= build_fold_indirect_ref_loc(location
, val
);
620 return build2(COMPOUND_EXPR
, lhs_type_tree
, call
,
621 fold_convert_loc(location
, lhs_type_tree
, val
));
624 // Convert an expression to a tree. This is implemented by the child
625 // class. Not that it is not in general safe to call this multiple
626 // times for a single expression, but that we don't catch such errors.
629 Expression::get_tree(Translate_context
* context
)
631 // The child may have marked this expression as having an error.
632 if (this->classification_
== EXPRESSION_ERROR
)
633 return error_mark_node
;
635 return this->do_get_tree(context
);
638 // Return a tree for VAL in TYPE.
641 Expression::integer_constant_tree(mpz_t val
, tree type
)
643 if (type
== error_mark_node
)
644 return error_mark_node
;
645 else if (TREE_CODE(type
) == INTEGER_TYPE
)
646 return double_int_to_tree(type
,
647 mpz_get_double_int(type
, val
, true));
648 else if (TREE_CODE(type
) == REAL_TYPE
)
651 mpfr_init_set_z(fval
, val
, GMP_RNDN
);
652 tree ret
= Expression::float_constant_tree(fval
, type
);
656 else if (TREE_CODE(type
) == COMPLEX_TYPE
)
659 mpfr_init_set_z(fval
, val
, GMP_RNDN
);
660 tree real
= Expression::float_constant_tree(fval
, TREE_TYPE(type
));
662 tree imag
= build_real_from_int_cst(TREE_TYPE(type
),
664 return build_complex(type
, real
, imag
);
670 // Return a tree for VAL in TYPE.
673 Expression::float_constant_tree(mpfr_t val
, tree type
)
675 if (type
== error_mark_node
)
676 return error_mark_node
;
677 else if (TREE_CODE(type
) == INTEGER_TYPE
)
681 mpfr_get_z(ival
, val
, GMP_RNDN
);
682 tree ret
= Expression::integer_constant_tree(ival
, type
);
686 else if (TREE_CODE(type
) == REAL_TYPE
)
689 real_from_mpfr(&r1
, val
, type
, GMP_RNDN
);
691 real_convert(&r2
, TYPE_MODE(type
), &r1
);
692 return build_real(type
, r2
);
694 else if (TREE_CODE(type
) == COMPLEX_TYPE
)
697 real_from_mpfr(&r1
, val
, TREE_TYPE(type
), GMP_RNDN
);
699 real_convert(&r2
, TYPE_MODE(TREE_TYPE(type
)), &r1
);
700 tree imag
= build_real_from_int_cst(TREE_TYPE(type
),
702 return build_complex(type
, build_real(TREE_TYPE(type
), r2
), imag
);
708 // Return a tree for REAL/IMAG in TYPE.
711 Expression::complex_constant_tree(mpfr_t real
, mpfr_t imag
, tree type
)
713 if (TREE_CODE(type
) == COMPLEX_TYPE
)
716 real_from_mpfr(&r1
, real
, TREE_TYPE(type
), GMP_RNDN
);
718 real_convert(&r2
, TYPE_MODE(TREE_TYPE(type
)), &r1
);
721 real_from_mpfr(&r3
, imag
, TREE_TYPE(type
), GMP_RNDN
);
723 real_convert(&r4
, TYPE_MODE(TREE_TYPE(type
)), &r3
);
725 return build_complex(type
, build_real(TREE_TYPE(type
), r2
),
726 build_real(TREE_TYPE(type
), r4
));
732 // Return a tree which evaluates to true if VAL, of arbitrary integer
733 // type, is negative or is more than the maximum value of BOUND_TYPE.
734 // If SOFAR is not NULL, it is or'red into the result. The return
735 // value may be NULL if SOFAR is NULL.
738 Expression::check_bounds(tree val
, tree bound_type
, tree sofar
,
741 tree val_type
= TREE_TYPE(val
);
742 tree ret
= NULL_TREE
;
744 if (!TYPE_UNSIGNED(val_type
))
746 ret
= fold_build2_loc(loc
, LT_EXPR
, boolean_type_node
, val
,
747 build_int_cst(val_type
, 0));
748 if (ret
== boolean_false_node
)
752 if ((TYPE_UNSIGNED(val_type
) && !TYPE_UNSIGNED(bound_type
))
753 || TYPE_SIZE(val_type
) > TYPE_SIZE(bound_type
))
755 tree max
= TYPE_MAX_VALUE(bound_type
);
756 tree big
= fold_build2_loc(loc
, GT_EXPR
, boolean_type_node
, val
,
757 fold_convert_loc(loc
, val_type
, max
));
758 if (big
== boolean_false_node
)
760 else if (ret
== NULL_TREE
)
763 ret
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
767 if (ret
== NULL_TREE
)
769 else if (sofar
== NULL_TREE
)
772 return fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
776 // Error expressions. This are used to avoid cascading errors.
778 class Error_expression
: public Expression
781 Error_expression(source_location location
)
782 : Expression(EXPRESSION_ERROR
, location
)
787 do_is_constant() const
791 do_integer_constant_value(bool, mpz_t val
, Type
**) const
798 do_float_constant_value(mpfr_t val
, Type
**) const
800 mpfr_set_ui(val
, 0, GMP_RNDN
);
805 do_complex_constant_value(mpfr_t real
, mpfr_t imag
, Type
**) const
807 mpfr_set_ui(real
, 0, GMP_RNDN
);
808 mpfr_set_ui(imag
, 0, GMP_RNDN
);
813 do_discarding_value()
818 { return Type::make_error_type(); }
821 do_determine_type(const Type_context
*)
829 do_is_addressable() const
833 do_get_tree(Translate_context
*)
834 { return error_mark_node
; }
838 Expression::make_error(source_location location
)
840 return new Error_expression(location
);
843 // An expression which is really a type. This is used during parsing.
844 // It is an error if these survive after lowering.
847 Type_expression
: public Expression
850 Type_expression(Type
* type
, source_location location
)
851 : Expression(EXPRESSION_TYPE
, location
),
857 do_traverse(Traverse
* traverse
)
858 { return Type::traverse(this->type_
, traverse
); }
862 { return this->type_
; }
865 do_determine_type(const Type_context
*)
869 do_check_types(Gogo
*)
870 { this->report_error(_("invalid use of type")); }
877 do_get_tree(Translate_context
*)
878 { gcc_unreachable(); }
881 // The type which we are representing as an expression.
886 Expression::make_type(Type
* type
, source_location location
)
888 return new Type_expression(type
, location
);
891 // Class Var_expression.
893 // Lower a variable expression. Here we just make sure that the
894 // initialization expression of the variable has been lowered. This
895 // ensures that we will be able to determine the type of the variable
899 Var_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
901 if (this->variable_
->is_variable())
903 Variable
* var
= this->variable_
->var_value();
904 // This is either a local variable or a global variable. A
905 // reference to a variable which is local to an enclosing
906 // function will be a reference to a field in a closure.
907 if (var
->is_global())
909 var
->lower_init_expression(gogo
, function
);
914 // Return the name of the variable.
917 Var_expression::name() const
919 return this->variable_
->name();
922 // Return the type of a reference to a variable.
925 Var_expression::do_type()
927 if (this->variable_
->is_variable())
928 return this->variable_
->var_value()->type();
929 else if (this->variable_
->is_result_variable())
930 return this->variable_
->result_var_value()->type();
935 // Something takes the address of this variable. This means that we
936 // may want to move the variable onto the heap.
939 Var_expression::do_address_taken(bool escapes
)
943 else if (this->variable_
->is_variable())
944 this->variable_
->var_value()->set_address_taken();
945 else if (this->variable_
->is_result_variable())
946 this->variable_
->result_var_value()->set_address_taken();
951 // Get the tree for a reference to a variable.
954 Var_expression::do_get_tree(Translate_context
* context
)
956 return this->variable_
->get_tree(context
->gogo(), context
->function());
959 // Make a reference to a variable in an expression.
962 Expression::make_var_reference(Named_object
* var
, source_location location
)
965 return Expression::make_sink(location
);
967 // FIXME: Creating a new object for each reference to a variable is
969 return new Var_expression(var
, location
);
972 // Class Temporary_reference_expression.
977 Temporary_reference_expression::do_type()
979 return this->statement_
->type();
982 // Called if something takes the address of this temporary variable.
983 // We never have to move temporary variables to the heap, but we do
984 // need to know that they must live in the stack rather than in a
988 Temporary_reference_expression::do_address_taken(bool)
990 this->statement_
->set_is_address_taken();
993 // Get a tree referring to the variable.
996 Temporary_reference_expression::do_get_tree(Translate_context
*)
998 return this->statement_
->get_decl();
1001 // Make a reference to a temporary variable.
1004 Expression::make_temporary_reference(Temporary_statement
* statement
,
1005 source_location location
)
1007 return new Temporary_reference_expression(statement
, location
);
1010 // A sink expression--a use of the blank identifier _.
1012 class Sink_expression
: public Expression
1015 Sink_expression(source_location location
)
1016 : Expression(EXPRESSION_SINK
, location
),
1017 type_(NULL
), var_(NULL_TREE
)
1022 do_discarding_value()
1029 do_determine_type(const Type_context
*);
1033 { return new Sink_expression(this->location()); }
1036 do_get_tree(Translate_context
*);
1039 // The type of this sink variable.
1041 // The temporary variable we generate.
1045 // Return the type of a sink expression.
1048 Sink_expression::do_type()
1050 if (this->type_
== NULL
)
1051 return Type::make_sink_type();
1055 // Determine the type of a sink expression.
1058 Sink_expression::do_determine_type(const Type_context
* context
)
1060 if (context
->type
!= NULL
)
1061 this->type_
= context
->type
;
1064 // Return a temporary variable for a sink expression. This will
1065 // presumably be a write-only variable which the middle-end will drop.
1068 Sink_expression::do_get_tree(Translate_context
* context
)
1070 if (this->var_
== NULL_TREE
)
1072 gcc_assert(this->type_
!= NULL
&& !this->type_
->is_sink_type());
1073 this->var_
= create_tmp_var(this->type_
->get_tree(context
->gogo()),
1079 // Make a sink expression.
1082 Expression::make_sink(source_location location
)
1084 return new Sink_expression(location
);
1087 // Class Func_expression.
1089 // FIXME: Can a function expression appear in a constant expression?
1090 // The value is unchanging. Initializing a constant to the address of
1091 // a function seems like it could work, though there might be little
1094 // Return the name of the function.
1097 Func_expression::name() const
1099 return this->function_
->name();
1105 Func_expression::do_traverse(Traverse
* traverse
)
1107 return (this->closure_
== NULL
1109 : Expression::traverse(&this->closure_
, traverse
));
1112 // Return the type of a function expression.
1115 Func_expression::do_type()
1117 if (this->function_
->is_function())
1118 return this->function_
->func_value()->type();
1119 else if (this->function_
->is_function_declaration())
1120 return this->function_
->func_declaration_value()->type();
1125 // Get the tree for a function expression without evaluating the
1129 Func_expression::get_tree_without_closure(Gogo
* gogo
)
1131 Function_type
* fntype
;
1132 if (this->function_
->is_function())
1133 fntype
= this->function_
->func_value()->type();
1134 else if (this->function_
->is_function_declaration())
1135 fntype
= this->function_
->func_declaration_value()->type();
1139 // Builtin functions are handled specially by Call_expression. We
1140 // can't take their address.
1141 if (fntype
->is_builtin())
1143 error_at(this->location(), "invalid use of special builtin function %qs",
1144 this->function_
->name().c_str());
1145 return error_mark_node
;
1148 Named_object
* no
= this->function_
;
1150 tree id
= no
->get_id(gogo
);
1151 if (id
== error_mark_node
)
1152 return error_mark_node
;
1155 if (no
->is_function())
1156 fndecl
= no
->func_value()->get_or_make_decl(gogo
, no
, id
);
1157 else if (no
->is_function_declaration())
1158 fndecl
= no
->func_declaration_value()->get_or_make_decl(gogo
, no
, id
);
1162 if (fndecl
== error_mark_node
)
1163 return error_mark_node
;
1165 return build_fold_addr_expr_loc(this->location(), fndecl
);
1168 // Get the tree for a function expression. This is used when we take
1169 // the address of a function rather than simply calling it. If the
1170 // function has a closure, we must use a trampoline.
1173 Func_expression::do_get_tree(Translate_context
* context
)
1175 Gogo
* gogo
= context
->gogo();
1177 tree fnaddr
= this->get_tree_without_closure(gogo
);
1178 if (fnaddr
== error_mark_node
)
1179 return error_mark_node
;
1181 gcc_assert(TREE_CODE(fnaddr
) == ADDR_EXPR
1182 && TREE_CODE(TREE_OPERAND(fnaddr
, 0)) == FUNCTION_DECL
);
1183 TREE_ADDRESSABLE(TREE_OPERAND(fnaddr
, 0)) = 1;
1185 // For a normal non-nested function call, that is all we have to do.
1186 if (!this->function_
->is_function()
1187 || this->function_
->func_value()->enclosing() == NULL
)
1189 gcc_assert(this->closure_
== NULL
);
1193 // For a nested function call, we have to always allocate a
1194 // trampoline. If we don't always allocate, then closures will not
1195 // be reliably distinct.
1196 Expression
* closure
= this->closure_
;
1198 if (closure
== NULL
)
1199 closure_tree
= null_pointer_node
;
1202 // Get the value of the closure. This will be a pointer to
1203 // space allocated on the heap.
1204 closure_tree
= closure
->get_tree(context
);
1205 if (closure_tree
== error_mark_node
)
1206 return error_mark_node
;
1207 gcc_assert(POINTER_TYPE_P(TREE_TYPE(closure_tree
)));
1210 // Now we need to build some code on the heap. This code will load
1211 // the static chain pointer with the closure and then jump to the
1212 // body of the function. The normal gcc approach is to build the
1213 // code on the stack. Unfortunately we can not do that, as Go
1214 // permits us to return the function pointer.
1216 return gogo
->make_trampoline(fnaddr
, closure_tree
, this->location());
1219 // Make a reference to a function in an expression.
1222 Expression::make_func_reference(Named_object
* function
, Expression
* closure
,
1223 source_location location
)
1225 return new Func_expression(function
, closure
, location
);
1228 // Class Unknown_expression.
1230 // Return the name of an unknown expression.
1233 Unknown_expression::name() const
1235 return this->named_object_
->name();
1238 // Lower a reference to an unknown name.
1241 Unknown_expression::do_lower(Gogo
*, Named_object
*, int)
1243 source_location location
= this->location();
1244 Named_object
* no
= this->named_object_
;
1245 Named_object
* real
= no
->unknown_value()->real_named_object();
1248 if (this->is_composite_literal_key_
)
1250 error_at(location
, "reference to undefined name %qs",
1251 this->named_object_
->message_name().c_str());
1252 return Expression::make_error(location
);
1254 switch (real
->classification())
1256 case Named_object::NAMED_OBJECT_CONST
:
1257 return Expression::make_const_reference(real
, location
);
1258 case Named_object::NAMED_OBJECT_TYPE
:
1259 return Expression::make_type(real
->type_value(), location
);
1260 case Named_object::NAMED_OBJECT_TYPE_DECLARATION
:
1261 if (this->is_composite_literal_key_
)
1263 error_at(location
, "reference to undefined type %qs",
1264 real
->message_name().c_str());
1265 return Expression::make_error(location
);
1266 case Named_object::NAMED_OBJECT_VAR
:
1267 return Expression::make_var_reference(real
, location
);
1268 case Named_object::NAMED_OBJECT_FUNC
:
1269 case Named_object::NAMED_OBJECT_FUNC_DECLARATION
:
1270 return Expression::make_func_reference(real
, NULL
, location
);
1271 case Named_object::NAMED_OBJECT_PACKAGE
:
1272 if (this->is_composite_literal_key_
)
1274 error_at(location
, "unexpected reference to package");
1275 return Expression::make_error(location
);
1281 // Make a reference to an unknown name.
1284 Expression::make_unknown_reference(Named_object
* no
, source_location location
)
1286 gcc_assert(no
->resolve()->is_unknown());
1287 return new Unknown_expression(no
, location
);
1290 // A boolean expression.
1292 class Boolean_expression
: public Expression
1295 Boolean_expression(bool val
, source_location location
)
1296 : Expression(EXPRESSION_BOOLEAN
, location
),
1297 val_(val
), type_(NULL
)
1305 do_is_constant() const
1312 do_determine_type(const Type_context
*);
1319 do_get_tree(Translate_context
*)
1320 { return this->val_
? boolean_true_node
: boolean_false_node
; }
1323 do_export(Export
* exp
) const
1324 { exp
->write_c_string(this->val_
? "true" : "false"); }
1329 // The type as determined by context.
1336 Boolean_expression::do_type()
1338 if (this->type_
== NULL
)
1339 this->type_
= Type::make_boolean_type();
1343 // Set the type from the context.
1346 Boolean_expression::do_determine_type(const Type_context
* context
)
1348 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1350 else if (context
->type
!= NULL
&& context
->type
->is_boolean_type())
1351 this->type_
= context
->type
;
1352 else if (!context
->may_be_abstract
)
1353 this->type_
= Type::lookup_bool_type();
1356 // Import a boolean constant.
1359 Boolean_expression::do_import(Import
* imp
)
1361 if (imp
->peek_char() == 't')
1363 imp
->require_c_string("true");
1364 return Expression::make_boolean(true, imp
->location());
1368 imp
->require_c_string("false");
1369 return Expression::make_boolean(false, imp
->location());
1373 // Make a boolean expression.
1376 Expression::make_boolean(bool val
, source_location location
)
1378 return new Boolean_expression(val
, location
);
1381 // Class String_expression.
1386 String_expression::do_type()
1388 if (this->type_
== NULL
)
1389 this->type_
= Type::make_string_type();
1393 // Set the type from the context.
1396 String_expression::do_determine_type(const Type_context
* context
)
1398 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1400 else if (context
->type
!= NULL
&& context
->type
->is_string_type())
1401 this->type_
= context
->type
;
1402 else if (!context
->may_be_abstract
)
1403 this->type_
= Type::lookup_string_type();
1406 // Build a string constant.
1409 String_expression::do_get_tree(Translate_context
* context
)
1411 return context
->gogo()->go_string_constant_tree(this->val_
);
1414 // Export a string expression.
1417 String_expression::do_export(Export
* exp
) const
1420 s
.reserve(this->val_
.length() * 4 + 2);
1422 for (std::string::const_iterator p
= this->val_
.begin();
1423 p
!= this->val_
.end();
1426 if (*p
== '\\' || *p
== '"')
1431 else if (*p
>= 0x20 && *p
< 0x7f)
1433 else if (*p
== '\n')
1435 else if (*p
== '\t')
1440 unsigned char c
= *p
;
1441 unsigned int dig
= c
>> 4;
1442 s
+= dig
< 10 ? '0' + dig
: 'A' + dig
- 10;
1444 s
+= dig
< 10 ? '0' + dig
: 'A' + dig
- 10;
1448 exp
->write_string(s
);
1451 // Import a string expression.
1454 String_expression::do_import(Import
* imp
)
1456 imp
->require_c_string("\"");
1460 int c
= imp
->get_char();
1461 if (c
== '"' || c
== -1)
1464 val
+= static_cast<char>(c
);
1467 c
= imp
->get_char();
1468 if (c
== '\\' || c
== '"')
1469 val
+= static_cast<char>(c
);
1476 c
= imp
->get_char();
1477 unsigned int vh
= c
>= '0' && c
<= '9' ? c
- '0' : c
- 'A' + 10;
1478 c
= imp
->get_char();
1479 unsigned int vl
= c
>= '0' && c
<= '9' ? c
- '0' : c
- 'A' + 10;
1480 char v
= (vh
<< 4) | vl
;
1485 error_at(imp
->location(), "bad string constant");
1486 return Expression::make_error(imp
->location());
1490 return Expression::make_string(val
, imp
->location());
1493 // Make a string expression.
1496 Expression::make_string(const std::string
& val
, source_location location
)
1498 return new String_expression(val
, location
);
1501 // Make an integer expression.
1503 class Integer_expression
: public Expression
1506 Integer_expression(const mpz_t
* val
, Type
* type
, source_location location
)
1507 : Expression(EXPRESSION_INTEGER
, location
),
1509 { mpz_init_set(this->val_
, *val
); }
1514 // Return whether VAL fits in the type.
1516 check_constant(mpz_t val
, Type
*, source_location
);
1518 // Write VAL to export data.
1520 export_integer(Export
* exp
, const mpz_t val
);
1524 do_is_constant() const
1528 do_integer_constant_value(bool, mpz_t val
, Type
** ptype
) const;
1534 do_determine_type(const Type_context
* context
);
1537 do_check_types(Gogo
*);
1540 do_get_tree(Translate_context
*);
1544 { return Expression::make_integer(&this->val_
, this->type_
,
1545 this->location()); }
1548 do_export(Export
*) const;
1551 // The integer value.
1557 // Return an integer constant value.
1560 Integer_expression::do_integer_constant_value(bool, mpz_t val
,
1563 if (this->type_
!= NULL
)
1564 *ptype
= this->type_
;
1565 mpz_set(val
, this->val_
);
1569 // Return the current type. If we haven't set the type yet, we return
1570 // an abstract integer type.
1573 Integer_expression::do_type()
1575 if (this->type_
== NULL
)
1576 this->type_
= Type::make_abstract_integer_type();
1580 // Set the type of the integer value. Here we may switch from an
1581 // abstract type to a real type.
1584 Integer_expression::do_determine_type(const Type_context
* context
)
1586 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1588 else if (context
->type
!= NULL
1589 && (context
->type
->integer_type() != NULL
1590 || context
->type
->float_type() != NULL
1591 || context
->type
->complex_type() != NULL
))
1592 this->type_
= context
->type
;
1593 else if (!context
->may_be_abstract
)
1594 this->type_
= Type::lookup_integer_type("int");
1597 // Return true if the integer VAL fits in the range of the type TYPE.
1598 // Otherwise give an error and return false. TYPE may be NULL.
1601 Integer_expression::check_constant(mpz_t val
, Type
* type
,
1602 source_location location
)
1606 Integer_type
* itype
= type
->integer_type();
1607 if (itype
== NULL
|| itype
->is_abstract())
1610 int bits
= mpz_sizeinbase(val
, 2);
1612 if (itype
->is_unsigned())
1614 // For an unsigned type we can only accept a nonnegative number,
1615 // and we must be able to represent at least BITS.
1616 if (mpz_sgn(val
) >= 0
1617 && bits
<= itype
->bits())
1622 // For a signed type we need an extra bit to indicate the sign.
1623 // We have to handle the most negative integer specially.
1624 if (bits
+ 1 <= itype
->bits()
1625 || (bits
<= itype
->bits()
1627 && (mpz_scan1(val
, 0)
1628 == static_cast<unsigned long>(itype
->bits() - 1))
1629 && mpz_scan0(val
, itype
->bits()) == ULONG_MAX
))
1633 error_at(location
, "integer constant overflow");
1637 // Check the type of an integer constant.
1640 Integer_expression::do_check_types(Gogo
*)
1642 if (this->type_
== NULL
)
1644 if (!Integer_expression::check_constant(this->val_
, this->type_
,
1646 this->set_is_error();
1649 // Get a tree for an integer constant.
1652 Integer_expression::do_get_tree(Translate_context
* context
)
1654 Gogo
* gogo
= context
->gogo();
1656 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1657 type
= this->type_
->get_tree(gogo
);
1658 else if (this->type_
!= NULL
&& this->type_
->float_type() != NULL
)
1660 // We are converting to an abstract floating point type.
1661 type
= Type::lookup_float_type("float64")->get_tree(gogo
);
1663 else if (this->type_
!= NULL
&& this->type_
->complex_type() != NULL
)
1665 // We are converting to an abstract complex type.
1666 type
= Type::lookup_complex_type("complex128")->get_tree(gogo
);
1670 // If we still have an abstract type here, then this is being
1671 // used in a constant expression which didn't get reduced for
1672 // some reason. Use a type which will fit the value. We use <,
1673 // not <=, because we need an extra bit for the sign bit.
1674 int bits
= mpz_sizeinbase(this->val_
, 2);
1675 if (bits
< INT_TYPE_SIZE
)
1676 type
= Type::lookup_integer_type("int")->get_tree(gogo
);
1678 type
= Type::lookup_integer_type("int64")->get_tree(gogo
);
1680 type
= long_long_integer_type_node
;
1682 return Expression::integer_constant_tree(this->val_
, type
);
1685 // Write VAL to export data.
1688 Integer_expression::export_integer(Export
* exp
, const mpz_t val
)
1690 char* s
= mpz_get_str(NULL
, 10, val
);
1691 exp
->write_c_string(s
);
1695 // Export an integer in a constant expression.
1698 Integer_expression::do_export(Export
* exp
) const
1700 Integer_expression::export_integer(exp
, this->val_
);
1701 // A trailing space lets us reliably identify the end of the number.
1702 exp
->write_c_string(" ");
1705 // Import an integer, floating point, or complex value. This handles
1706 // all these types because they all start with digits.
1709 Integer_expression::do_import(Import
* imp
)
1711 std::string num
= imp
->read_identifier();
1712 imp
->require_c_string(" ");
1713 if (!num
.empty() && num
[num
.length() - 1] == 'i')
1716 size_t plus_pos
= num
.find('+', 1);
1717 size_t minus_pos
= num
.find('-', 1);
1719 if (plus_pos
== std::string::npos
)
1721 else if (minus_pos
== std::string::npos
)
1725 error_at(imp
->location(), "bad number in import data: %qs",
1727 return Expression::make_error(imp
->location());
1729 if (pos
== std::string::npos
)
1730 mpfr_set_ui(real
, 0, GMP_RNDN
);
1733 std::string real_str
= num
.substr(0, pos
);
1734 if (mpfr_init_set_str(real
, real_str
.c_str(), 10, GMP_RNDN
) != 0)
1736 error_at(imp
->location(), "bad number in import data: %qs",
1738 return Expression::make_error(imp
->location());
1742 std::string imag_str
;
1743 if (pos
== std::string::npos
)
1746 imag_str
= num
.substr(pos
);
1747 imag_str
= imag_str
.substr(0, imag_str
.size() - 1);
1749 if (mpfr_init_set_str(imag
, imag_str
.c_str(), 10, GMP_RNDN
) != 0)
1751 error_at(imp
->location(), "bad number in import data: %qs",
1753 return Expression::make_error(imp
->location());
1755 Expression
* ret
= Expression::make_complex(&real
, &imag
, NULL
,
1761 else if (num
.find('.') == std::string::npos
1762 && num
.find('E') == std::string::npos
)
1765 if (mpz_init_set_str(val
, num
.c_str(), 10) != 0)
1767 error_at(imp
->location(), "bad number in import data: %qs",
1769 return Expression::make_error(imp
->location());
1771 Expression
* ret
= Expression::make_integer(&val
, NULL
, imp
->location());
1778 if (mpfr_init_set_str(val
, num
.c_str(), 10, GMP_RNDN
) != 0)
1780 error_at(imp
->location(), "bad number in import data: %qs",
1782 return Expression::make_error(imp
->location());
1784 Expression
* ret
= Expression::make_float(&val
, NULL
, imp
->location());
1790 // Build a new integer value.
1793 Expression::make_integer(const mpz_t
* val
, Type
* type
,
1794 source_location location
)
1796 return new Integer_expression(val
, type
, location
);
1801 class Float_expression
: public Expression
1804 Float_expression(const mpfr_t
* val
, Type
* type
, source_location location
)
1805 : Expression(EXPRESSION_FLOAT
, location
),
1808 mpfr_init_set(this->val_
, *val
, GMP_RNDN
);
1811 // Constrain VAL to fit into TYPE.
1813 constrain_float(mpfr_t val
, Type
* type
);
1815 // Return whether VAL fits in the type.
1817 check_constant(mpfr_t val
, Type
*, source_location
);
1819 // Write VAL to export data.
1821 export_float(Export
* exp
, const mpfr_t val
);
1825 do_is_constant() const
1829 do_float_constant_value(mpfr_t val
, Type
**) const;
1835 do_determine_type(const Type_context
*);
1838 do_check_types(Gogo
*);
1842 { return Expression::make_float(&this->val_
, this->type_
,
1843 this->location()); }
1846 do_get_tree(Translate_context
*);
1849 do_export(Export
*) const;
1852 // The floating point value.
1858 // Constrain VAL to fit into TYPE.
1861 Float_expression::constrain_float(mpfr_t val
, Type
* type
)
1863 Float_type
* ftype
= type
->float_type();
1864 if (ftype
!= NULL
&& !ftype
->is_abstract())
1866 tree type_tree
= ftype
->type_tree();
1867 REAL_VALUE_TYPE rvt
;
1868 real_from_mpfr(&rvt
, val
, type_tree
, GMP_RNDN
);
1869 real_convert(&rvt
, TYPE_MODE(type_tree
), &rvt
);
1870 mpfr_from_real(val
, &rvt
, GMP_RNDN
);
1874 // Return a floating point constant value.
1877 Float_expression::do_float_constant_value(mpfr_t val
, Type
** ptype
) const
1879 if (this->type_
!= NULL
)
1880 *ptype
= this->type_
;
1881 mpfr_set(val
, this->val_
, GMP_RNDN
);
1885 // Return the current type. If we haven't set the type yet, we return
1886 // an abstract float type.
1889 Float_expression::do_type()
1891 if (this->type_
== NULL
)
1892 this->type_
= Type::make_abstract_float_type();
1896 // Set the type of the float value. Here we may switch from an
1897 // abstract type to a real type.
1900 Float_expression::do_determine_type(const Type_context
* context
)
1902 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1904 else if (context
->type
!= NULL
1905 && (context
->type
->integer_type() != NULL
1906 || context
->type
->float_type() != NULL
1907 || context
->type
->complex_type() != NULL
))
1908 this->type_
= context
->type
;
1909 else if (!context
->may_be_abstract
)
1910 this->type_
= Type::lookup_float_type("float");
1913 // Return true if the floating point value VAL fits in the range of
1914 // the type TYPE. Otherwise give an error and return false. TYPE may
1918 Float_expression::check_constant(mpfr_t val
, Type
* type
,
1919 source_location location
)
1923 Float_type
* ftype
= type
->float_type();
1924 if (ftype
== NULL
|| ftype
->is_abstract())
1927 // A NaN or Infinity always fits in the range of the type.
1928 if (mpfr_nan_p(val
) || mpfr_inf_p(val
) || mpfr_zero_p(val
))
1931 mp_exp_t exp
= mpfr_get_exp(val
);
1933 switch (ftype
->bits())
1946 error_at(location
, "floating point constant overflow");
1952 // Check the type of a float value.
1955 Float_expression::do_check_types(Gogo
*)
1957 if (this->type_
== NULL
)
1960 if (!Float_expression::check_constant(this->val_
, this->type_
,
1962 this->set_is_error();
1964 Integer_type
* integer_type
= this->type_
->integer_type();
1965 if (integer_type
!= NULL
)
1967 if (!mpfr_integer_p(this->val_
))
1968 this->report_error(_("floating point constant truncated to integer"));
1971 gcc_assert(!integer_type
->is_abstract());
1974 mpfr_get_z(ival
, this->val_
, GMP_RNDN
);
1975 Integer_expression::check_constant(ival
, integer_type
,
1982 // Get a tree for a float constant.
1985 Float_expression::do_get_tree(Translate_context
* context
)
1987 Gogo
* gogo
= context
->gogo();
1989 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
1990 type
= this->type_
->get_tree(gogo
);
1991 else if (this->type_
!= NULL
&& this->type_
->integer_type() != NULL
)
1993 // We have an abstract integer type. We just hope for the best.
1994 type
= Type::lookup_integer_type("int")->get_tree(gogo
);
1998 // If we still have an abstract type here, then this is being
1999 // used in a constant expression which didn't get reduced. We
2000 // just use float64 and hope for the best.
2001 type
= Type::lookup_float_type("float64")->get_tree(gogo
);
2003 return Expression::float_constant_tree(this->val_
, type
);
2006 // Write a floating point number to export data.
2009 Float_expression::export_float(Export
*exp
, const mpfr_t val
)
2012 char* s
= mpfr_get_str(NULL
, &exponent
, 10, 0, val
, GMP_RNDN
);
2014 exp
->write_c_string("-");
2015 exp
->write_c_string("0.");
2016 exp
->write_c_string(*s
== '-' ? s
+ 1 : s
);
2019 snprintf(buf
, sizeof buf
, "E%ld", exponent
);
2020 exp
->write_c_string(buf
);
2023 // Export a floating point number in a constant expression.
2026 Float_expression::do_export(Export
* exp
) const
2028 Float_expression::export_float(exp
, this->val_
);
2029 // A trailing space lets us reliably identify the end of the number.
2030 exp
->write_c_string(" ");
2033 // Make a float expression.
2036 Expression::make_float(const mpfr_t
* val
, Type
* type
, source_location location
)
2038 return new Float_expression(val
, type
, location
);
2043 class Complex_expression
: public Expression
2046 Complex_expression(const mpfr_t
* real
, const mpfr_t
* imag
, Type
* type
,
2047 source_location location
)
2048 : Expression(EXPRESSION_COMPLEX
, location
),
2051 mpfr_init_set(this->real_
, *real
, GMP_RNDN
);
2052 mpfr_init_set(this->imag_
, *imag
, GMP_RNDN
);
2055 // Constrain REAL/IMAG to fit into TYPE.
2057 constrain_complex(mpfr_t real
, mpfr_t imag
, Type
* type
);
2059 // Return whether REAL/IMAG fits in the type.
2061 check_constant(mpfr_t real
, mpfr_t imag
, Type
*, source_location
);
2063 // Write REAL/IMAG to export data.
2065 export_complex(Export
* exp
, const mpfr_t real
, const mpfr_t val
);
2069 do_is_constant() const
2073 do_complex_constant_value(mpfr_t real
, mpfr_t imag
, Type
**) const;
2079 do_determine_type(const Type_context
*);
2082 do_check_types(Gogo
*);
2087 return Expression::make_complex(&this->real_
, &this->imag_
, this->type_
,
2092 do_get_tree(Translate_context
*);
2095 do_export(Export
*) const;
2100 // The imaginary part;
2102 // The type if known.
2106 // Constrain REAL/IMAG to fit into TYPE.
2109 Complex_expression::constrain_complex(mpfr_t real
, mpfr_t imag
, Type
* type
)
2111 Complex_type
* ctype
= type
->complex_type();
2112 if (ctype
!= NULL
&& !ctype
->is_abstract())
2114 tree type_tree
= ctype
->type_tree();
2116 REAL_VALUE_TYPE rvt
;
2117 real_from_mpfr(&rvt
, real
, TREE_TYPE(type_tree
), GMP_RNDN
);
2118 real_convert(&rvt
, TYPE_MODE(TREE_TYPE(type_tree
)), &rvt
);
2119 mpfr_from_real(real
, &rvt
, GMP_RNDN
);
2121 real_from_mpfr(&rvt
, imag
, TREE_TYPE(type_tree
), GMP_RNDN
);
2122 real_convert(&rvt
, TYPE_MODE(TREE_TYPE(type_tree
)), &rvt
);
2123 mpfr_from_real(imag
, &rvt
, GMP_RNDN
);
2127 // Return a complex constant value.
2130 Complex_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
2133 if (this->type_
!= NULL
)
2134 *ptype
= this->type_
;
2135 mpfr_set(real
, this->real_
, GMP_RNDN
);
2136 mpfr_set(imag
, this->imag_
, GMP_RNDN
);
2140 // Return the current type. If we haven't set the type yet, we return
2141 // an abstract complex type.
2144 Complex_expression::do_type()
2146 if (this->type_
== NULL
)
2147 this->type_
= Type::make_abstract_complex_type();
2151 // Set the type of the complex value. Here we may switch from an
2152 // abstract type to a real type.
2155 Complex_expression::do_determine_type(const Type_context
* context
)
2157 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
2159 else if (context
->type
!= NULL
2160 && context
->type
->complex_type() != NULL
)
2161 this->type_
= context
->type
;
2162 else if (!context
->may_be_abstract
)
2163 this->type_
= Type::lookup_complex_type("complex");
2166 // Return true if the complex value REAL/IMAG fits in the range of the
2167 // type TYPE. Otherwise give an error and return false. TYPE may be
2171 Complex_expression::check_constant(mpfr_t real
, mpfr_t imag
, Type
* type
,
2172 source_location location
)
2176 Complex_type
* ctype
= type
->complex_type();
2177 if (ctype
== NULL
|| ctype
->is_abstract())
2181 switch (ctype
->bits())
2193 // A NaN or Infinity always fits in the range of the type.
2194 if (!mpfr_nan_p(real
) && !mpfr_inf_p(real
) && !mpfr_zero_p(real
))
2196 if (mpfr_get_exp(real
) > max_exp
)
2198 error_at(location
, "complex real part constant overflow");
2203 if (!mpfr_nan_p(imag
) && !mpfr_inf_p(imag
) && !mpfr_zero_p(imag
))
2205 if (mpfr_get_exp(imag
) > max_exp
)
2207 error_at(location
, "complex imaginary part constant overflow");
2215 // Check the type of a complex value.
2218 Complex_expression::do_check_types(Gogo
*)
2220 if (this->type_
== NULL
)
2223 if (!Complex_expression::check_constant(this->real_
, this->imag_
,
2224 this->type_
, this->location()))
2225 this->set_is_error();
2228 // Get a tree for a complex constant.
2231 Complex_expression::do_get_tree(Translate_context
* context
)
2233 Gogo
* gogo
= context
->gogo();
2235 if (this->type_
!= NULL
&& !this->type_
->is_abstract())
2236 type
= this->type_
->get_tree(gogo
);
2239 // If we still have an abstract type here, this this is being
2240 // used in a constant expression which didn't get reduced. We
2241 // just use complex128 and hope for the best.
2242 type
= Type::lookup_complex_type("complex128")->get_tree(gogo
);
2244 return Expression::complex_constant_tree(this->real_
, this->imag_
, type
);
2247 // Write REAL/IMAG to export data.
2250 Complex_expression::export_complex(Export
* exp
, const mpfr_t real
,
2253 if (!mpfr_zero_p(real
))
2255 Float_expression::export_float(exp
, real
);
2256 if (mpfr_sgn(imag
) > 0)
2257 exp
->write_c_string("+");
2259 Float_expression::export_float(exp
, imag
);
2260 exp
->write_c_string("i");
2263 // Export a complex number in a constant expression.
2266 Complex_expression::do_export(Export
* exp
) const
2268 Complex_expression::export_complex(exp
, this->real_
, this->imag_
);
2269 // A trailing space lets us reliably identify the end of the number.
2270 exp
->write_c_string(" ");
2273 // Make a complex expression.
2276 Expression::make_complex(const mpfr_t
* real
, const mpfr_t
* imag
, Type
* type
,
2277 source_location location
)
2279 return new Complex_expression(real
, imag
, type
, location
);
2282 // A reference to a const in an expression.
2284 class Const_expression
: public Expression
2287 Const_expression(Named_object
* constant
, source_location location
)
2288 : Expression(EXPRESSION_CONST_REFERENCE
, location
),
2289 constant_(constant
), type_(NULL
)
2294 { return this->constant_
->name(); }
2298 do_lower(Gogo
*, Named_object
*, int);
2301 do_is_constant() const
2305 do_integer_constant_value(bool, mpz_t val
, Type
**) const;
2308 do_float_constant_value(mpfr_t val
, Type
**) const;
2311 do_complex_constant_value(mpfr_t real
, mpfr_t imag
, Type
**) const;
2314 do_string_constant_value(std::string
* val
) const
2315 { return this->constant_
->const_value()->expr()->string_constant_value(val
); }
2320 // The type of a const is set by the declaration, not the use.
2322 do_determine_type(const Type_context
*);
2325 do_check_types(Gogo
*);
2332 do_get_tree(Translate_context
* context
);
2334 // When exporting a reference to a const as part of a const
2335 // expression, we export the value. We ignore the fact that it has
2338 do_export(Export
* exp
) const
2339 { this->constant_
->const_value()->expr()->export_expression(exp
); }
2343 Named_object
* constant_
;
2344 // The type of this reference. This is used if the constant has an
2349 // Lower a constant expression. This is where we convert the
2350 // predeclared constant iota into an integer value.
2353 Const_expression::do_lower(Gogo
* gogo
, Named_object
*, int iota_value
)
2355 if (this->constant_
->const_value()->expr()->classification()
2358 if (iota_value
== -1)
2360 error_at(this->location(),
2361 "iota is only defined in const declarations");
2365 mpz_init_set_ui(val
, static_cast<unsigned long>(iota_value
));
2366 Expression
* ret
= Expression::make_integer(&val
, NULL
,
2372 // Make sure that the constant itself has been lowered.
2373 gogo
->lower_constant(this->constant_
);
2378 // Return an integer constant value.
2381 Const_expression::do_integer_constant_value(bool iota_is_constant
, mpz_t val
,
2385 if (this->type_
!= NULL
)
2386 ctype
= this->type_
;
2388 ctype
= this->constant_
->const_value()->type();
2389 if (ctype
!= NULL
&& ctype
->integer_type() == NULL
)
2392 Expression
* e
= this->constant_
->const_value()->expr();
2394 bool r
= e
->integer_constant_value(iota_is_constant
, val
, &t
);
2398 && !Integer_expression::check_constant(val
, ctype
, this->location()))
2401 *ptype
= ctype
!= NULL
? ctype
: t
;
2405 // Return a floating point constant value.
2408 Const_expression::do_float_constant_value(mpfr_t val
, Type
** ptype
) const
2411 if (this->type_
!= NULL
)
2412 ctype
= this->type_
;
2414 ctype
= this->constant_
->const_value()->type();
2415 if (ctype
!= NULL
&& ctype
->float_type() == NULL
)
2419 bool r
= this->constant_
->const_value()->expr()->float_constant_value(val
,
2421 if (r
&& ctype
!= NULL
)
2423 if (!Float_expression::check_constant(val
, ctype
, this->location()))
2425 Float_expression::constrain_float(val
, ctype
);
2427 *ptype
= ctype
!= NULL
? ctype
: t
;
2431 // Return a complex constant value.
2434 Const_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
2438 if (this->type_
!= NULL
)
2439 ctype
= this->type_
;
2441 ctype
= this->constant_
->const_value()->type();
2442 if (ctype
!= NULL
&& ctype
->complex_type() == NULL
)
2446 bool r
= this->constant_
->const_value()->expr()->complex_constant_value(real
,
2449 if (r
&& ctype
!= NULL
)
2451 if (!Complex_expression::check_constant(real
, imag
, ctype
,
2454 Complex_expression::constrain_complex(real
, imag
, ctype
);
2456 *ptype
= ctype
!= NULL
? ctype
: t
;
2460 // Return the type of the const reference.
2463 Const_expression::do_type()
2465 if (this->type_
!= NULL
)
2467 Named_constant
* nc
= this->constant_
->const_value();
2468 Type
* ret
= nc
->type();
2471 // During parsing, a named constant may have a NULL type, but we
2472 // must not return a NULL type here.
2473 return nc
->expr()->type();
2476 // Set the type of the const reference.
2479 Const_expression::do_determine_type(const Type_context
* context
)
2481 Type
* ctype
= this->constant_
->const_value()->type();
2482 Type
* cetype
= (ctype
!= NULL
2484 : this->constant_
->const_value()->expr()->type());
2485 if (ctype
!= NULL
&& !ctype
->is_abstract())
2487 else if (context
->type
!= NULL
2488 && (context
->type
->integer_type() != NULL
2489 || context
->type
->float_type() != NULL
2490 || context
->type
->complex_type() != NULL
)
2491 && (cetype
->integer_type() != NULL
2492 || cetype
->float_type() != NULL
2493 || cetype
->complex_type() != NULL
))
2494 this->type_
= context
->type
;
2495 else if (context
->type
!= NULL
2496 && context
->type
->is_string_type()
2497 && cetype
->is_string_type())
2498 this->type_
= context
->type
;
2499 else if (context
->type
!= NULL
2500 && context
->type
->is_boolean_type()
2501 && cetype
->is_boolean_type())
2502 this->type_
= context
->type
;
2503 else if (!context
->may_be_abstract
)
2505 if (cetype
->is_abstract())
2506 cetype
= cetype
->make_non_abstract_type();
2507 this->type_
= cetype
;
2511 // Check types of a const reference.
2514 Const_expression::do_check_types(Gogo
*)
2516 if (this->type_
== NULL
|| this->type_
->is_abstract())
2519 // Check for integer overflow.
2520 if (this->type_
->integer_type() != NULL
)
2525 if (!this->integer_constant_value(true, ival
, &dummy
))
2529 Expression
* cexpr
= this->constant_
->const_value()->expr();
2530 if (cexpr
->float_constant_value(fval
, &dummy
))
2532 if (!mpfr_integer_p(fval
))
2533 this->report_error(_("floating point constant "
2534 "truncated to integer"));
2537 mpfr_get_z(ival
, fval
, GMP_RNDN
);
2538 Integer_expression::check_constant(ival
, this->type_
,
2548 // Return a tree for the const reference.
2551 Const_expression::do_get_tree(Translate_context
* context
)
2553 Gogo
* gogo
= context
->gogo();
2555 if (this->type_
== NULL
)
2556 type_tree
= NULL_TREE
;
2559 type_tree
= this->type_
->get_tree(gogo
);
2560 if (type_tree
== error_mark_node
)
2561 return error_mark_node
;
2564 // If the type has been set for this expression, but the underlying
2565 // object is an abstract int or float, we try to get the abstract
2566 // value. Otherwise we may lose something in the conversion.
2567 if (this->type_
!= NULL
2568 && this->constant_
->const_value()->type()->is_abstract())
2570 Expression
* expr
= this->constant_
->const_value()->expr();
2574 if (expr
->integer_constant_value(true, ival
, &t
))
2576 tree ret
= Expression::integer_constant_tree(ival
, type_tree
);
2584 if (expr
->float_constant_value(fval
, &t
))
2586 tree ret
= Expression::float_constant_tree(fval
, type_tree
);
2593 if (expr
->complex_constant_value(fval
, imag
, &t
))
2595 tree ret
= Expression::complex_constant_tree(fval
, imag
, type_tree
);
2604 tree const_tree
= this->constant_
->get_tree(gogo
, context
->function());
2605 if (this->type_
== NULL
2606 || const_tree
== error_mark_node
2607 || TREE_TYPE(const_tree
) == error_mark_node
)
2611 if (TYPE_MAIN_VARIANT(type_tree
) == TYPE_MAIN_VARIANT(TREE_TYPE(const_tree
)))
2612 ret
= fold_convert(type_tree
, const_tree
);
2613 else if (TREE_CODE(type_tree
) == INTEGER_TYPE
)
2614 ret
= fold(convert_to_integer(type_tree
, const_tree
));
2615 else if (TREE_CODE(type_tree
) == REAL_TYPE
)
2616 ret
= fold(convert_to_real(type_tree
, const_tree
));
2617 else if (TREE_CODE(type_tree
) == COMPLEX_TYPE
)
2618 ret
= fold(convert_to_complex(type_tree
, const_tree
));
2624 // Make a reference to a constant in an expression.
2627 Expression::make_const_reference(Named_object
* constant
,
2628 source_location location
)
2630 return new Const_expression(constant
, location
);
2635 class Nil_expression
: public Expression
2638 Nil_expression(source_location location
)
2639 : Expression(EXPRESSION_NIL
, location
)
2647 do_is_constant() const
2652 { return Type::make_nil_type(); }
2655 do_determine_type(const Type_context
*)
2663 do_get_tree(Translate_context
*)
2664 { return null_pointer_node
; }
2667 do_export(Export
* exp
) const
2668 { exp
->write_c_string("nil"); }
2671 // Import a nil expression.
2674 Nil_expression::do_import(Import
* imp
)
2676 imp
->require_c_string("nil");
2677 return Expression::make_nil(imp
->location());
2680 // Make a nil expression.
2683 Expression::make_nil(source_location location
)
2685 return new Nil_expression(location
);
2688 // The value of the predeclared constant iota. This is little more
2689 // than a marker. This will be lowered to an integer in
2690 // Const_expression::do_lower, which is where we know the value that
2693 class Iota_expression
: public Parser_expression
2696 Iota_expression(source_location location
)
2697 : Parser_expression(EXPRESSION_IOTA
, location
)
2702 do_lower(Gogo
*, Named_object
*, int)
2703 { gcc_unreachable(); }
2705 // There should only ever be one of these.
2708 { gcc_unreachable(); }
2711 // Make an iota expression. This is only called for one case: the
2712 // value of the predeclared constant iota.
2715 Expression::make_iota()
2717 static Iota_expression
iota_expression(UNKNOWN_LOCATION
);
2718 return &iota_expression
;
2721 // A type conversion expression.
2723 class Type_conversion_expression
: public Expression
2726 Type_conversion_expression(Type
* type
, Expression
* expr
,
2727 source_location location
)
2728 : Expression(EXPRESSION_CONVERSION
, location
),
2729 type_(type
), expr_(expr
), may_convert_function_types_(false)
2732 // Return the type to which we are converting.
2735 { return this->type_
; }
2737 // Return the expression which we are converting.
2740 { return this->expr_
; }
2742 // Permit converting from one function type to another. This is
2743 // used internally for method expressions.
2745 set_may_convert_function_types()
2747 this->may_convert_function_types_
= true;
2750 // Import a type conversion expression.
2756 do_traverse(Traverse
* traverse
);
2759 do_lower(Gogo
*, Named_object
*, int);
2762 do_is_constant() const
2763 { return this->expr_
->is_constant(); }
2766 do_integer_constant_value(bool, mpz_t
, Type
**) const;
2769 do_float_constant_value(mpfr_t
, Type
**) const;
2772 do_complex_constant_value(mpfr_t
, mpfr_t
, Type
**) const;
2775 do_string_constant_value(std::string
*) const;
2779 { return this->type_
; }
2782 do_determine_type(const Type_context
*)
2784 Type_context
subcontext(this->type_
, false);
2785 this->expr_
->determine_type(&subcontext
);
2789 do_check_types(Gogo
*);
2794 return new Type_conversion_expression(this->type_
, this->expr_
->copy(),
2799 do_get_tree(Translate_context
* context
);
2802 do_export(Export
*) const;
2805 // The type to convert to.
2807 // The expression to convert.
2809 // True if this is permitted to convert function types. This is
2810 // used internally for method expressions.
2811 bool may_convert_function_types_
;
2817 Type_conversion_expression::do_traverse(Traverse
* traverse
)
2819 if (Expression::traverse(&this->expr_
, traverse
) == TRAVERSE_EXIT
2820 || Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
2821 return TRAVERSE_EXIT
;
2822 return TRAVERSE_CONTINUE
;
2825 // Convert to a constant at lowering time.
2828 Type_conversion_expression::do_lower(Gogo
*, Named_object
*, int)
2830 Type
* type
= this->type_
;
2831 Expression
* val
= this->expr_
;
2832 source_location location
= this->location();
2834 if (type
->integer_type() != NULL
)
2839 if (val
->integer_constant_value(false, ival
, &dummy
))
2841 if (!Integer_expression::check_constant(ival
, type
, location
))
2842 mpz_set_ui(ival
, 0);
2843 Expression
* ret
= Expression::make_integer(&ival
, type
, location
);
2850 if (val
->float_constant_value(fval
, &dummy
))
2852 if (!mpfr_integer_p(fval
))
2855 "floating point constant truncated to integer");
2856 return Expression::make_error(location
);
2858 mpfr_get_z(ival
, fval
, GMP_RNDN
);
2859 if (!Integer_expression::check_constant(ival
, type
, location
))
2860 mpz_set_ui(ival
, 0);
2861 Expression
* ret
= Expression::make_integer(&ival
, type
, location
);
2870 if (type
->float_type() != NULL
)
2875 if (val
->float_constant_value(fval
, &dummy
))
2877 if (!Float_expression::check_constant(fval
, type
, location
))
2878 mpfr_set_ui(fval
, 0, GMP_RNDN
);
2879 Float_expression::constrain_float(fval
, type
);
2880 Expression
*ret
= Expression::make_float(&fval
, type
, location
);
2887 if (type
->complex_type() != NULL
)
2894 if (val
->complex_constant_value(real
, imag
, &dummy
))
2896 if (!Complex_expression::check_constant(real
, imag
, type
, location
))
2898 mpfr_set_ui(real
, 0, GMP_RNDN
);
2899 mpfr_set_ui(imag
, 0, GMP_RNDN
);
2901 Complex_expression::constrain_complex(real
, imag
, type
);
2902 Expression
* ret
= Expression::make_complex(&real
, &imag
, type
,
2912 if (type
->is_open_array_type() && type
->named_type() == NULL
)
2914 Type
* element_type
= type
->array_type()->element_type()->forwarded();
2915 bool is_byte
= element_type
== Type::lookup_integer_type("uint8");
2916 bool is_int
= element_type
== Type::lookup_integer_type("int");
2917 if (is_byte
|| is_int
)
2920 if (val
->string_constant_value(&s
))
2922 Expression_list
* vals
= new Expression_list();
2925 for (std::string::const_iterator p
= s
.begin();
2930 mpz_init_set_ui(val
, static_cast<unsigned char>(*p
));
2931 Expression
* v
= Expression::make_integer(&val
,
2940 const char *p
= s
.data();
2941 const char *pend
= s
.data() + s
.length();
2945 int adv
= Lex::fetch_char(p
, &c
);
2948 warning_at(this->location(), 0,
2949 "invalid UTF-8 encoding");
2954 mpz_init_set_ui(val
, c
);
2955 Expression
* v
= Expression::make_integer(&val
,
2963 return Expression::make_slice_composite_literal(type
, vals
,
2972 // Return the constant integer value if there is one.
2975 Type_conversion_expression::do_integer_constant_value(bool iota_is_constant
,
2979 if (this->type_
->integer_type() == NULL
)
2985 if (this->expr_
->integer_constant_value(iota_is_constant
, ival
, &dummy
))
2987 if (!Integer_expression::check_constant(ival
, this->type_
,
2995 *ptype
= this->type_
;
3002 if (this->expr_
->float_constant_value(fval
, &dummy
))
3004 mpfr_get_z(val
, fval
, GMP_RNDN
);
3006 if (!Integer_expression::check_constant(val
, this->type_
,
3009 *ptype
= this->type_
;
3017 // Return the constant floating point value if there is one.
3020 Type_conversion_expression::do_float_constant_value(mpfr_t val
,
3023 if (this->type_
->float_type() == NULL
)
3029 if (this->expr_
->float_constant_value(fval
, &dummy
))
3031 if (!Float_expression::check_constant(fval
, this->type_
,
3037 mpfr_set(val
, fval
, GMP_RNDN
);
3039 Float_expression::constrain_float(val
, this->type_
);
3040 *ptype
= this->type_
;
3048 // Return the constant complex value if there is one.
3051 Type_conversion_expression::do_complex_constant_value(mpfr_t real
,
3055 if (this->type_
->complex_type() == NULL
)
3063 if (this->expr_
->complex_constant_value(rval
, ival
, &dummy
))
3065 if (!Complex_expression::check_constant(rval
, ival
, this->type_
,
3072 mpfr_set(real
, rval
, GMP_RNDN
);
3073 mpfr_set(imag
, ival
, GMP_RNDN
);
3076 Complex_expression::constrain_complex(real
, imag
, this->type_
);
3077 *ptype
= this->type_
;
3086 // Return the constant string value if there is one.
3089 Type_conversion_expression::do_string_constant_value(std::string
* val
) const
3091 if (this->type_
->is_string_type()
3092 && this->expr_
->type()->integer_type() != NULL
)
3097 if (this->expr_
->integer_constant_value(false, ival
, &dummy
))
3099 unsigned long ulval
= mpz_get_ui(ival
);
3100 if (mpz_cmp_ui(ival
, ulval
) == 0)
3102 Lex::append_char(ulval
, true, val
, this->location());
3110 // FIXME: Could handle conversion from const []int here.
3115 // Check that types are convertible.
3118 Type_conversion_expression::do_check_types(Gogo
*)
3120 Type
* type
= this->type_
;
3121 Type
* expr_type
= this->expr_
->type();
3124 if (this->may_convert_function_types_
3125 && type
->function_type() != NULL
3126 && expr_type
->function_type() != NULL
)
3129 if (Type::are_convertible(type
, expr_type
, &reason
))
3132 error_at(this->location(), "%s", reason
.c_str());
3133 this->set_is_error();
3136 // Get a tree for a type conversion.
3139 Type_conversion_expression::do_get_tree(Translate_context
* context
)
3141 Gogo
* gogo
= context
->gogo();
3142 tree type_tree
= this->type_
->get_tree(gogo
);
3143 tree expr_tree
= this->expr_
->get_tree(context
);
3145 if (type_tree
== error_mark_node
3146 || expr_tree
== error_mark_node
3147 || TREE_TYPE(expr_tree
) == error_mark_node
)
3148 return error_mark_node
;
3150 if (TYPE_MAIN_VARIANT(type_tree
) == TYPE_MAIN_VARIANT(TREE_TYPE(expr_tree
)))
3151 return fold_convert(type_tree
, expr_tree
);
3153 Type
* type
= this->type_
;
3154 Type
* expr_type
= this->expr_
->type();
3156 if (type
->interface_type() != NULL
|| expr_type
->interface_type() != NULL
)
3157 ret
= Expression::convert_for_assignment(context
, type
, expr_type
,
3158 expr_tree
, this->location());
3159 else if (type
->integer_type() != NULL
)
3161 if (expr_type
->integer_type() != NULL
3162 || expr_type
->float_type() != NULL
3163 || expr_type
->is_unsafe_pointer_type())
3164 ret
= fold(convert_to_integer(type_tree
, expr_tree
));
3168 else if (type
->float_type() != NULL
)
3170 if (expr_type
->integer_type() != NULL
3171 || expr_type
->float_type() != NULL
)
3172 ret
= fold(convert_to_real(type_tree
, expr_tree
));
3176 else if (type
->complex_type() != NULL
)
3178 if (expr_type
->complex_type() != NULL
)
3179 ret
= fold(convert_to_complex(type_tree
, expr_tree
));
3183 else if (type
->is_string_type()
3184 && expr_type
->integer_type() != NULL
)
3186 expr_tree
= fold_convert(integer_type_node
, expr_tree
);
3187 if (host_integerp(expr_tree
, 0))
3189 HOST_WIDE_INT intval
= tree_low_cst(expr_tree
, 0);
3191 Lex::append_char(intval
, true, &s
, this->location());
3192 Expression
* se
= Expression::make_string(s
, this->location());
3193 return se
->get_tree(context
);
3196 static tree int_to_string_fndecl
;
3197 ret
= Gogo::call_builtin(&int_to_string_fndecl
,
3199 "__go_int_to_string",
3203 fold_convert(integer_type_node
, expr_tree
));
3205 else if (type
->is_string_type()
3206 && (expr_type
->array_type() != NULL
3207 || (expr_type
->points_to() != NULL
3208 && expr_type
->points_to()->array_type() != NULL
)))
3210 Type
* t
= expr_type
;
3211 if (t
->points_to() != NULL
)
3214 expr_tree
= build_fold_indirect_ref(expr_tree
);
3216 if (!DECL_P(expr_tree
))
3217 expr_tree
= save_expr(expr_tree
);
3218 Array_type
* a
= t
->array_type();
3219 Type
* e
= a
->element_type()->forwarded();
3220 gcc_assert(e
->integer_type() != NULL
);
3221 tree valptr
= fold_convert(const_ptr_type_node
,
3222 a
->value_pointer_tree(gogo
, expr_tree
));
3223 tree len
= a
->length_tree(gogo
, expr_tree
);
3224 len
= fold_convert_loc(this->location(), size_type_node
, len
);
3225 if (e
->integer_type()->is_unsigned()
3226 && e
->integer_type()->bits() == 8)
3228 static tree byte_array_to_string_fndecl
;
3229 ret
= Gogo::call_builtin(&byte_array_to_string_fndecl
,
3231 "__go_byte_array_to_string",
3234 const_ptr_type_node
,
3241 gcc_assert(e
== Type::lookup_integer_type("int"));
3242 static tree int_array_to_string_fndecl
;
3243 ret
= Gogo::call_builtin(&int_array_to_string_fndecl
,
3245 "__go_int_array_to_string",
3248 const_ptr_type_node
,
3254 else if (type
->is_open_array_type() && expr_type
->is_string_type())
3256 Type
* e
= type
->array_type()->element_type()->forwarded();
3257 gcc_assert(e
->integer_type() != NULL
);
3258 if (e
->integer_type()->is_unsigned()
3259 && e
->integer_type()->bits() == 8)
3261 static tree string_to_byte_array_fndecl
;
3262 ret
= Gogo::call_builtin(&string_to_byte_array_fndecl
,
3264 "__go_string_to_byte_array",
3267 TREE_TYPE(expr_tree
),
3272 gcc_assert(e
== Type::lookup_integer_type("int"));
3273 static tree string_to_int_array_fndecl
;
3274 ret
= Gogo::call_builtin(&string_to_int_array_fndecl
,
3276 "__go_string_to_int_array",
3279 TREE_TYPE(expr_tree
),
3283 else if ((type
->is_unsafe_pointer_type()
3284 && expr_type
->points_to() != NULL
)
3285 || (expr_type
->is_unsafe_pointer_type()
3286 && type
->points_to() != NULL
))
3287 ret
= fold_convert(type_tree
, expr_tree
);
3288 else if (type
->is_unsafe_pointer_type()
3289 && expr_type
->integer_type() != NULL
)
3290 ret
= convert_to_pointer(type_tree
, expr_tree
);
3291 else if (this->may_convert_function_types_
3292 && type
->function_type() != NULL
3293 && expr_type
->function_type() != NULL
)
3294 ret
= fold_convert_loc(this->location(), type_tree
, expr_tree
);
3296 ret
= Expression::convert_for_assignment(context
, type
, expr_type
,
3297 expr_tree
, this->location());
3302 // Output a type conversion in a constant expression.
3305 Type_conversion_expression::do_export(Export
* exp
) const
3307 exp
->write_c_string("convert(");
3308 exp
->write_type(this->type_
);
3309 exp
->write_c_string(", ");
3310 this->expr_
->export_expression(exp
);
3311 exp
->write_c_string(")");
3314 // Import a type conversion or a struct construction.
3317 Type_conversion_expression::do_import(Import
* imp
)
3319 imp
->require_c_string("convert(");
3320 Type
* type
= imp
->read_type();
3321 imp
->require_c_string(", ");
3322 Expression
* val
= Expression::import_expression(imp
);
3323 imp
->require_c_string(")");
3324 return Expression::make_cast(type
, val
, imp
->location());
3327 // Make a type cast expression.
3330 Expression::make_cast(Type
* type
, Expression
* val
, source_location location
)
3332 if (type
->is_error_type() || val
->is_error_expression())
3333 return Expression::make_error(location
);
3334 return new Type_conversion_expression(type
, val
, location
);
3337 // Unary expressions.
3339 class Unary_expression
: public Expression
3342 Unary_expression(Operator op
, Expression
* expr
, source_location location
)
3343 : Expression(EXPRESSION_UNARY
, location
),
3344 op_(op
), escapes_(true), expr_(expr
)
3347 // Return the operator.
3350 { return this->op_
; }
3352 // Return the operand.
3355 { return this->expr_
; }
3357 // Record that an address expression does not escape.
3359 set_does_not_escape()
3361 gcc_assert(this->op_
== OPERATOR_AND
);
3362 this->escapes_
= false;
3365 // Apply unary opcode OP to UVAL, setting VAL. Return true if this
3366 // could be done, false if not.
3368 eval_integer(Operator op
, Type
* utype
, mpz_t uval
, mpz_t val
,
3371 // Apply unary opcode OP to UVAL, setting VAL. Return true if this
3372 // could be done, false if not.
3374 eval_float(Operator op
, mpfr_t uval
, mpfr_t val
);
3376 // Apply unary opcode OP to UREAL/UIMAG, setting REAL/IMAG. Return
3377 // true if this could be done, false if not.
3379 eval_complex(Operator op
, mpfr_t ureal
, mpfr_t uimag
, mpfr_t real
,
3387 do_traverse(Traverse
* traverse
)
3388 { return Expression::traverse(&this->expr_
, traverse
); }
3391 do_lower(Gogo
*, Named_object
*, int);
3394 do_is_constant() const;
3397 do_integer_constant_value(bool, mpz_t
, Type
**) const;
3400 do_float_constant_value(mpfr_t
, Type
**) const;
3403 do_complex_constant_value(mpfr_t
, mpfr_t
, Type
**) const;
3409 do_determine_type(const Type_context
*);
3412 do_check_types(Gogo
*);
3417 return Expression::make_unary(this->op_
, this->expr_
->copy(),
3422 do_is_addressable() const
3423 { return this->op_
== OPERATOR_MULT
; }
3426 do_get_tree(Translate_context
*);
3429 do_export(Export
*) const;
3432 // The unary operator to apply.
3434 // Normally true. False if this is an address expression which does
3435 // not escape the current function.
3441 // If we are taking the address of a composite literal, and the
3442 // contents are not constant, then we want to make a heap composite
3446 Unary_expression::do_lower(Gogo
*, Named_object
*, int)
3448 source_location loc
= this->location();
3449 Operator op
= this->op_
;
3450 Expression
* expr
= this->expr_
;
3452 if (op
== OPERATOR_MULT
&& expr
->is_type_expression())
3453 return Expression::make_type(Type::make_pointer_type(expr
->type()), loc
);
3455 // *&x simplifies to x. *(*T)(unsafe.Pointer)(&x) does not require
3456 // moving x to the heap. FIXME: Is it worth doing a real escape
3457 // analysis here? This case is found in math/unsafe.go and is
3458 // therefore worth special casing.
3459 if (op
== OPERATOR_MULT
)
3461 Expression
* e
= expr
;
3462 while (e
->classification() == EXPRESSION_CONVERSION
)
3464 Type_conversion_expression
* te
3465 = static_cast<Type_conversion_expression
*>(e
);
3469 if (e
->classification() == EXPRESSION_UNARY
)
3471 Unary_expression
* ue
= static_cast<Unary_expression
*>(e
);
3472 if (ue
->op_
== OPERATOR_AND
)
3479 ue
->set_does_not_escape();
3484 if (op
== OPERATOR_PLUS
|| op
== OPERATOR_MINUS
3485 || op
== OPERATOR_NOT
|| op
== OPERATOR_XOR
)
3487 Expression
* ret
= NULL
;
3492 if (expr
->integer_constant_value(false, eval
, &etype
))
3496 if (Unary_expression::eval_integer(op
, etype
, eval
, val
, loc
))
3497 ret
= Expression::make_integer(&val
, etype
, loc
);
3504 if (op
== OPERATOR_PLUS
|| op
== OPERATOR_MINUS
)
3509 if (expr
->float_constant_value(fval
, &ftype
))
3513 if (Unary_expression::eval_float(op
, fval
, val
))
3514 ret
= Expression::make_float(&val
, ftype
, loc
);
3525 if (expr
->complex_constant_value(fval
, ival
, &ftype
))
3531 if (Unary_expression::eval_complex(op
, fval
, ival
, real
, imag
))
3532 ret
= Expression::make_complex(&real
, &imag
, ftype
, loc
);
3546 // Return whether a unary expression is a constant.
3549 Unary_expression::do_is_constant() const
3551 if (this->op_
== OPERATOR_MULT
)
3553 // Indirecting through a pointer is only constant if the object
3554 // to which the expression points is constant, but we currently
3555 // have no way to determine that.
3558 else if (this->op_
== OPERATOR_AND
)
3560 // Taking the address of a variable is constant if it is a
3561 // global variable, not constant otherwise. In other cases
3562 // taking the address is probably not a constant.
3563 Var_expression
* ve
= this->expr_
->var_expression();
3566 Named_object
* no
= ve
->named_object();
3567 return no
->is_variable() && no
->var_value()->is_global();
3572 return this->expr_
->is_constant();
3575 // Apply unary opcode OP to UVAL, setting VAL. UTYPE is the type of
3576 // UVAL, if known; it may be NULL. Return true if this could be done,
3580 Unary_expression::eval_integer(Operator op
, Type
* utype
, mpz_t uval
, mpz_t val
,
3581 source_location location
)
3588 case OPERATOR_MINUS
:
3590 return Integer_expression::check_constant(val
, utype
, location
);
3592 mpz_set_ui(val
, mpz_cmp_si(uval
, 0) == 0 ? 1 : 0);
3596 || utype
->integer_type() == NULL
3597 || utype
->integer_type()->is_abstract())
3601 // The number of HOST_WIDE_INTs that it takes to represent
3603 size_t count
= ((mpz_sizeinbase(uval
, 2)
3604 + HOST_BITS_PER_WIDE_INT
3606 / HOST_BITS_PER_WIDE_INT
);
3608 unsigned HOST_WIDE_INT
* phwi
= new unsigned HOST_WIDE_INT
[count
];
3609 memset(phwi
, 0, count
* sizeof(HOST_WIDE_INT
));
3612 mpz_export(phwi
, &ecount
, -1, sizeof(HOST_WIDE_INT
), 0, 0, uval
);
3613 gcc_assert(ecount
<= count
);
3615 // Trim down to the number of words required by the type.
3616 size_t obits
= utype
->integer_type()->bits();
3617 if (!utype
->integer_type()->is_unsigned())
3619 size_t ocount
= ((obits
+ HOST_BITS_PER_WIDE_INT
- 1)
3620 / HOST_BITS_PER_WIDE_INT
);
3621 gcc_assert(ocount
<= ocount
);
3623 for (size_t i
= 0; i
< ocount
; ++i
)
3626 size_t clearbits
= ocount
* HOST_BITS_PER_WIDE_INT
- obits
;
3628 phwi
[ocount
- 1] &= (((unsigned HOST_WIDE_INT
) (HOST_WIDE_INT
) -1)
3631 mpz_import(val
, ocount
, -1, sizeof(HOST_WIDE_INT
), 0, 0, phwi
);
3635 return Integer_expression::check_constant(val
, utype
, location
);
3644 // Apply unary opcode OP to UVAL, setting VAL. Return true if this
3645 // could be done, false if not.
3648 Unary_expression::eval_float(Operator op
, mpfr_t uval
, mpfr_t val
)
3653 mpfr_set(val
, uval
, GMP_RNDN
);
3655 case OPERATOR_MINUS
:
3656 mpfr_neg(val
, uval
, GMP_RNDN
);
3668 // Apply unary opcode OP to RVAL/IVAL, setting REAL/IMAG. Return true
3669 // if this could be done, false if not.
3672 Unary_expression::eval_complex(Operator op
, mpfr_t rval
, mpfr_t ival
,
3673 mpfr_t real
, mpfr_t imag
)
3678 mpfr_set(real
, rval
, GMP_RNDN
);
3679 mpfr_set(imag
, ival
, GMP_RNDN
);
3681 case OPERATOR_MINUS
:
3682 mpfr_neg(real
, rval
, GMP_RNDN
);
3683 mpfr_neg(imag
, ival
, GMP_RNDN
);
3695 // Return the integral constant value of a unary expression, if it has one.
3698 Unary_expression::do_integer_constant_value(bool iota_is_constant
, mpz_t val
,
3704 if (!this->expr_
->integer_constant_value(iota_is_constant
, uval
, ptype
))
3707 ret
= Unary_expression::eval_integer(this->op_
, *ptype
, uval
, val
,
3713 // Return the floating point constant value of a unary expression, if
3717 Unary_expression::do_float_constant_value(mpfr_t val
, Type
** ptype
) const
3722 if (!this->expr_
->float_constant_value(uval
, ptype
))
3725 ret
= Unary_expression::eval_float(this->op_
, uval
, val
);
3730 // Return the complex constant value of a unary expression, if it has
3734 Unary_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
3742 if (!this->expr_
->complex_constant_value(rval
, ival
, ptype
))
3745 ret
= Unary_expression::eval_complex(this->op_
, rval
, ival
, real
, imag
);
3751 // Return the type of a unary expression.
3754 Unary_expression::do_type()
3759 case OPERATOR_MINUS
:
3762 return this->expr_
->type();
3765 return Type::make_pointer_type(this->expr_
->type());
3769 Type
* subtype
= this->expr_
->type();
3770 Type
* points_to
= subtype
->points_to();
3771 if (points_to
== NULL
)
3772 return Type::make_error_type();
3781 // Determine abstract types for a unary expression.
3784 Unary_expression::do_determine_type(const Type_context
* context
)
3789 case OPERATOR_MINUS
:
3792 this->expr_
->determine_type(context
);
3796 // Taking the address of something.
3798 Type
* subtype
= (context
->type
== NULL
3800 : context
->type
->points_to());
3801 Type_context
subcontext(subtype
, false);
3802 this->expr_
->determine_type(&subcontext
);
3807 // Indirecting through a pointer.
3809 Type
* subtype
= (context
->type
== NULL
3811 : Type::make_pointer_type(context
->type
));
3812 Type_context
subcontext(subtype
, false);
3813 this->expr_
->determine_type(&subcontext
);
3822 // Check types for a unary expression.
3825 Unary_expression::do_check_types(Gogo
*)
3827 Type
* type
= this->expr_
->type();
3828 if (type
->is_error_type())
3830 this->set_is_error();
3837 case OPERATOR_MINUS
:
3838 if (type
->integer_type() == NULL
3839 && type
->float_type() == NULL
3840 && type
->complex_type() == NULL
)
3841 this->report_error(_("expected numeric type"));
3846 if (type
->integer_type() == NULL
3847 && !type
->is_boolean_type())
3848 this->report_error(_("expected integer or boolean type"));
3852 if (!this->expr_
->is_addressable())
3853 this->report_error(_("invalid operand for unary %<&%>"));
3855 this->expr_
->address_taken(this->escapes_
);
3859 // Indirecting through a pointer.
3860 if (type
->points_to() == NULL
)
3861 this->report_error(_("expected pointer"));
3869 // Get a tree for a unary expression.
3872 Unary_expression::do_get_tree(Translate_context
* context
)
3874 tree expr
= this->expr_
->get_tree(context
);
3875 if (expr
== error_mark_node
)
3876 return error_mark_node
;
3878 source_location loc
= this->location();
3884 case OPERATOR_MINUS
:
3886 tree type
= TREE_TYPE(expr
);
3887 tree compute_type
= excess_precision_type(type
);
3888 if (compute_type
!= NULL_TREE
)
3889 expr
= ::convert(compute_type
, expr
);
3890 tree ret
= fold_build1_loc(loc
, NEGATE_EXPR
,
3891 (compute_type
!= NULL_TREE
3895 if (compute_type
!= NULL_TREE
)
3896 ret
= ::convert(type
, ret
);
3901 if (TREE_CODE(TREE_TYPE(expr
)) == BOOLEAN_TYPE
)
3902 return fold_build1_loc(loc
, TRUTH_NOT_EXPR
, TREE_TYPE(expr
), expr
);
3904 return fold_build2_loc(loc
, NE_EXPR
, boolean_type_node
, expr
,
3905 build_int_cst(TREE_TYPE(expr
), 0));
3908 return fold_build1_loc(loc
, BIT_NOT_EXPR
, TREE_TYPE(expr
), expr
);
3911 // We should not see a non-constant constructor here; cases
3912 // where we would see one should have been moved onto the heap
3913 // at parse time. Taking the address of a nonconstant
3914 // constructor will not do what the programmer expects.
3915 gcc_assert(TREE_CODE(expr
) != CONSTRUCTOR
|| TREE_CONSTANT(expr
));
3916 gcc_assert(TREE_CODE(expr
) != ADDR_EXPR
);
3918 // Build a decl for a constant constructor.
3919 if (TREE_CODE(expr
) == CONSTRUCTOR
&& TREE_CONSTANT(expr
))
3921 tree decl
= build_decl(this->location(), VAR_DECL
,
3922 create_tmp_var_name("C"), TREE_TYPE(expr
));
3923 DECL_EXTERNAL(decl
) = 0;
3924 TREE_PUBLIC(decl
) = 0;
3925 TREE_READONLY(decl
) = 1;
3926 TREE_CONSTANT(decl
) = 1;
3927 TREE_STATIC(decl
) = 1;
3928 TREE_ADDRESSABLE(decl
) = 1;
3929 DECL_ARTIFICIAL(decl
) = 1;
3930 DECL_INITIAL(decl
) = expr
;
3931 rest_of_decl_compilation(decl
, 1, 0);
3935 return build_fold_addr_expr_loc(loc
, expr
);
3939 gcc_assert(POINTER_TYPE_P(TREE_TYPE(expr
)));
3941 // If we are dereferencing the pointer to a large struct, we
3942 // need to check for nil. We don't bother to check for small
3943 // structs because we expect the system to crash on a nil
3944 // pointer dereference.
3945 HOST_WIDE_INT s
= int_size_in_bytes(TREE_TYPE(TREE_TYPE(expr
)));
3946 if (s
== -1 || s
>= 4096)
3949 expr
= save_expr(expr
);
3950 tree compare
= fold_build2_loc(loc
, EQ_EXPR
, boolean_type_node
,
3952 fold_convert(TREE_TYPE(expr
),
3953 null_pointer_node
));
3954 tree crash
= Gogo::runtime_error(RUNTIME_ERROR_NIL_DEREFERENCE
,
3956 expr
= fold_build2_loc(loc
, COMPOUND_EXPR
, TREE_TYPE(expr
),
3957 build3(COND_EXPR
, void_type_node
,
3958 compare
, crash
, NULL_TREE
),
3962 // If the type of EXPR is a recursive pointer type, then we
3963 // need to insert a cast before indirecting.
3964 if (TREE_TYPE(TREE_TYPE(expr
)) == ptr_type_node
)
3966 Type
* pt
= this->expr_
->type()->points_to();
3967 tree ind
= pt
->get_tree(context
->gogo());
3968 expr
= fold_convert_loc(loc
, build_pointer_type(ind
), expr
);
3971 return build_fold_indirect_ref_loc(loc
, expr
);
3979 // Export a unary expression.
3982 Unary_expression::do_export(Export
* exp
) const
3987 exp
->write_c_string("+ ");
3989 case OPERATOR_MINUS
:
3990 exp
->write_c_string("- ");
3993 exp
->write_c_string("! ");
3996 exp
->write_c_string("^ ");
4003 this->expr_
->export_expression(exp
);
4006 // Import a unary expression.
4009 Unary_expression::do_import(Import
* imp
)
4012 switch (imp
->get_char())
4018 op
= OPERATOR_MINUS
;
4029 imp
->require_c_string(" ");
4030 Expression
* expr
= Expression::import_expression(imp
);
4031 return Expression::make_unary(op
, expr
, imp
->location());
4034 // Make a unary expression.
4037 Expression::make_unary(Operator op
, Expression
* expr
, source_location location
)
4039 return new Unary_expression(op
, expr
, location
);
4042 // If this is an indirection through a pointer, return the expression
4043 // being pointed through. Otherwise return this.
4048 if (this->classification_
== EXPRESSION_UNARY
)
4050 Unary_expression
* ue
= static_cast<Unary_expression
*>(this);
4051 if (ue
->op() == OPERATOR_MULT
)
4052 return ue
->operand();
4057 // Class Binary_expression.
4062 Binary_expression::do_traverse(Traverse
* traverse
)
4064 int t
= Expression::traverse(&this->left_
, traverse
);
4065 if (t
== TRAVERSE_EXIT
)
4066 return TRAVERSE_EXIT
;
4067 return Expression::traverse(&this->right_
, traverse
);
4070 // Compare integer constants according to OP.
4073 Binary_expression::compare_integer(Operator op
, mpz_t left_val
,
4076 int i
= mpz_cmp(left_val
, right_val
);
4081 case OPERATOR_NOTEQ
:
4096 // Compare floating point constants according to OP.
4099 Binary_expression::compare_float(Operator op
, Type
* type
, mpfr_t left_val
,
4104 i
= mpfr_cmp(left_val
, right_val
);
4108 mpfr_init_set(lv
, left_val
, GMP_RNDN
);
4110 mpfr_init_set(rv
, right_val
, GMP_RNDN
);
4111 Float_expression::constrain_float(lv
, type
);
4112 Float_expression::constrain_float(rv
, type
);
4113 i
= mpfr_cmp(lv
, rv
);
4121 case OPERATOR_NOTEQ
:
4136 // Compare complex constants according to OP. Complex numbers may
4137 // only be compared for equality.
4140 Binary_expression::compare_complex(Operator op
, Type
* type
,
4141 mpfr_t left_real
, mpfr_t left_imag
,
4142 mpfr_t right_real
, mpfr_t right_imag
)
4146 is_equal
= (mpfr_cmp(left_real
, right_real
) == 0
4147 && mpfr_cmp(left_imag
, right_imag
) == 0);
4152 mpfr_init_set(lr
, left_real
, GMP_RNDN
);
4153 mpfr_init_set(li
, left_imag
, GMP_RNDN
);
4156 mpfr_init_set(rr
, right_real
, GMP_RNDN
);
4157 mpfr_init_set(ri
, right_imag
, GMP_RNDN
);
4158 Complex_expression::constrain_complex(lr
, li
, type
);
4159 Complex_expression::constrain_complex(rr
, ri
, type
);
4160 is_equal
= mpfr_cmp(lr
, rr
) == 0 && mpfr_cmp(li
, ri
) == 0;
4170 case OPERATOR_NOTEQ
:
4177 // Apply binary opcode OP to LEFT_VAL and RIGHT_VAL, setting VAL.
4178 // LEFT_TYPE is the type of LEFT_VAL, RIGHT_TYPE is the type of
4179 // RIGHT_VAL; LEFT_TYPE and/or RIGHT_TYPE may be NULL. Return true if
4180 // this could be done, false if not.
4183 Binary_expression::eval_integer(Operator op
, Type
* left_type
, mpz_t left_val
,
4184 Type
* right_type
, mpz_t right_val
,
4185 source_location location
, mpz_t val
)
4187 bool is_shift_op
= false;
4191 case OPERATOR_ANDAND
:
4193 case OPERATOR_NOTEQ
:
4198 // These return boolean values. We should probably handle them
4199 // anyhow in case a type conversion is used on the result.
4202 mpz_add(val
, left_val
, right_val
);
4204 case OPERATOR_MINUS
:
4205 mpz_sub(val
, left_val
, right_val
);
4208 mpz_ior(val
, left_val
, right_val
);
4211 mpz_xor(val
, left_val
, right_val
);
4214 mpz_mul(val
, left_val
, right_val
);
4217 if (mpz_sgn(right_val
) != 0)
4218 mpz_tdiv_q(val
, left_val
, right_val
);
4221 error_at(location
, "division by zero");
4227 if (mpz_sgn(right_val
) != 0)
4228 mpz_tdiv_r(val
, left_val
, right_val
);
4231 error_at(location
, "division by zero");
4236 case OPERATOR_LSHIFT
:
4238 unsigned long shift
= mpz_get_ui(right_val
);
4239 if (mpz_cmp_ui(right_val
, shift
) != 0)
4241 error_at(location
, "shift count overflow");
4245 mpz_mul_2exp(val
, left_val
, shift
);
4250 case OPERATOR_RSHIFT
:
4252 unsigned long shift
= mpz_get_ui(right_val
);
4253 if (mpz_cmp_ui(right_val
, shift
) != 0)
4255 error_at(location
, "shift count overflow");
4259 if (mpz_cmp_ui(left_val
, 0) >= 0)
4260 mpz_tdiv_q_2exp(val
, left_val
, shift
);
4262 mpz_fdiv_q_2exp(val
, left_val
, shift
);
4268 mpz_and(val
, left_val
, right_val
);
4270 case OPERATOR_BITCLEAR
:
4274 mpz_com(tval
, right_val
);
4275 mpz_and(val
, left_val
, tval
);
4283 Type
* type
= left_type
;
4288 else if (type
!= right_type
&& right_type
!= NULL
)
4290 if (type
->is_abstract())
4292 else if (!right_type
->is_abstract())
4294 // This look like a type error which should be diagnosed
4295 // elsewhere. Don't do anything here, to avoid an
4296 // unhelpful chain of error messages.
4302 if (type
!= NULL
&& !type
->is_abstract())
4304 // We have to check the operands too, as we have implicitly
4305 // coerced them to TYPE.
4306 if ((type
!= left_type
4307 && !Integer_expression::check_constant(left_val
, type
, location
))
4309 && type
!= right_type
4310 && !Integer_expression::check_constant(right_val
, type
,
4312 || !Integer_expression::check_constant(val
, type
, location
))
4319 // Apply binary opcode OP to LEFT_VAL and RIGHT_VAL, setting VAL.
4320 // Return true if this could be done, false if not.
4323 Binary_expression::eval_float(Operator op
, Type
* left_type
, mpfr_t left_val
,
4324 Type
* right_type
, mpfr_t right_val
,
4325 mpfr_t val
, source_location location
)
4330 case OPERATOR_ANDAND
:
4332 case OPERATOR_NOTEQ
:
4337 // These return boolean values. We should probably handle them
4338 // anyhow in case a type conversion is used on the result.
4341 mpfr_add(val
, left_val
, right_val
, GMP_RNDN
);
4343 case OPERATOR_MINUS
:
4344 mpfr_sub(val
, left_val
, right_val
, GMP_RNDN
);
4349 case OPERATOR_BITCLEAR
:
4352 mpfr_mul(val
, left_val
, right_val
, GMP_RNDN
);
4355 if (mpfr_zero_p(right_val
))
4356 error_at(location
, "division by zero");
4357 mpfr_div(val
, left_val
, right_val
, GMP_RNDN
);
4361 case OPERATOR_LSHIFT
:
4362 case OPERATOR_RSHIFT
:
4368 Type
* type
= left_type
;
4371 else if (type
!= right_type
&& right_type
!= NULL
)
4373 if (type
->is_abstract())
4375 else if (!right_type
->is_abstract())
4377 // This looks like a type error which should be diagnosed
4378 // elsewhere. Don't do anything here, to avoid an unhelpful
4379 // chain of error messages.
4384 if (type
!= NULL
&& !type
->is_abstract())
4386 if ((type
!= left_type
4387 && !Float_expression::check_constant(left_val
, type
, location
))
4388 || (type
!= right_type
4389 && !Float_expression::check_constant(right_val
, type
,
4391 || !Float_expression::check_constant(val
, type
, location
))
4392 mpfr_set_ui(val
, 0, GMP_RNDN
);
4398 // Apply binary opcode OP to LEFT_REAL/LEFT_IMAG and
4399 // RIGHT_REAL/RIGHT_IMAG, setting REAL/IMAG. Return true if this
4400 // could be done, false if not.
4403 Binary_expression::eval_complex(Operator op
, Type
* left_type
,
4404 mpfr_t left_real
, mpfr_t left_imag
,
4406 mpfr_t right_real
, mpfr_t right_imag
,
4407 mpfr_t real
, mpfr_t imag
,
4408 source_location location
)
4413 case OPERATOR_ANDAND
:
4415 case OPERATOR_NOTEQ
:
4420 // These return boolean values and must be handled differently.
4423 mpfr_add(real
, left_real
, right_real
, GMP_RNDN
);
4424 mpfr_add(imag
, left_imag
, right_imag
, GMP_RNDN
);
4426 case OPERATOR_MINUS
:
4427 mpfr_sub(real
, left_real
, right_real
, GMP_RNDN
);
4428 mpfr_sub(imag
, left_imag
, right_imag
, GMP_RNDN
);
4433 case OPERATOR_BITCLEAR
:
4437 // You might think that multiplying two complex numbers would
4438 // be simple, and you would be right, until you start to think
4439 // about getting the right answer for infinity. If one
4440 // operand here is infinity and the other is anything other
4441 // than zero or NaN, then we are going to wind up subtracting
4442 // two infinity values. That will give us a NaN, but the
4443 // correct answer is infinity.
4447 mpfr_mul(lrrr
, left_real
, right_real
, GMP_RNDN
);
4451 mpfr_mul(lrri
, left_real
, right_imag
, GMP_RNDN
);
4455 mpfr_mul(lirr
, left_imag
, right_real
, GMP_RNDN
);
4459 mpfr_mul(liri
, left_imag
, right_imag
, GMP_RNDN
);
4461 mpfr_sub(real
, lrrr
, liri
, GMP_RNDN
);
4462 mpfr_add(imag
, lrri
, lirr
, GMP_RNDN
);
4464 // If we get NaN on both sides, check whether it should really
4465 // be infinity. The rule is that if either side of the
4466 // complex number is infinity, then the whole value is
4467 // infinity, even if the other side is NaN. So the only case
4468 // we have to fix is the one in which both sides are NaN.
4469 if (mpfr_nan_p(real
) && mpfr_nan_p(imag
)
4470 && (!mpfr_nan_p(left_real
) || !mpfr_nan_p(left_imag
))
4471 && (!mpfr_nan_p(right_real
) || !mpfr_nan_p(right_imag
)))
4473 bool is_infinity
= false;
4477 mpfr_init_set(lr
, left_real
, GMP_RNDN
);
4478 mpfr_init_set(li
, left_imag
, GMP_RNDN
);
4482 mpfr_init_set(rr
, right_real
, GMP_RNDN
);
4483 mpfr_init_set(ri
, right_imag
, GMP_RNDN
);
4485 // If the left side is infinity, then the result is
4487 if (mpfr_inf_p(lr
) || mpfr_inf_p(li
))
4489 mpfr_set_ui(lr
, mpfr_inf_p(lr
) ? 1 : 0, GMP_RNDN
);
4490 mpfr_copysign(lr
, lr
, left_real
, GMP_RNDN
);
4491 mpfr_set_ui(li
, mpfr_inf_p(li
) ? 1 : 0, GMP_RNDN
);
4492 mpfr_copysign(li
, li
, left_imag
, GMP_RNDN
);
4495 mpfr_set_ui(rr
, 0, GMP_RNDN
);
4496 mpfr_copysign(rr
, rr
, right_real
, GMP_RNDN
);
4500 mpfr_set_ui(ri
, 0, GMP_RNDN
);
4501 mpfr_copysign(ri
, ri
, right_imag
, GMP_RNDN
);
4506 // If the right side is infinity, then the result is
4508 if (mpfr_inf_p(rr
) || mpfr_inf_p(ri
))
4510 mpfr_set_ui(rr
, mpfr_inf_p(rr
) ? 1 : 0, GMP_RNDN
);
4511 mpfr_copysign(rr
, rr
, right_real
, GMP_RNDN
);
4512 mpfr_set_ui(ri
, mpfr_inf_p(ri
) ? 1 : 0, GMP_RNDN
);
4513 mpfr_copysign(ri
, ri
, right_imag
, GMP_RNDN
);
4516 mpfr_set_ui(lr
, 0, GMP_RNDN
);
4517 mpfr_copysign(lr
, lr
, left_real
, GMP_RNDN
);
4521 mpfr_set_ui(li
, 0, GMP_RNDN
);
4522 mpfr_copysign(li
, li
, left_imag
, GMP_RNDN
);
4527 // If we got an overflow in the intermediate computations,
4528 // then the result is infinity.
4530 && (mpfr_inf_p(lrrr
) || mpfr_inf_p(lrri
)
4531 || mpfr_inf_p(lirr
) || mpfr_inf_p(liri
)))
4535 mpfr_set_ui(lr
, 0, GMP_RNDN
);
4536 mpfr_copysign(lr
, lr
, left_real
, GMP_RNDN
);
4540 mpfr_set_ui(li
, 0, GMP_RNDN
);
4541 mpfr_copysign(li
, li
, left_imag
, GMP_RNDN
);
4545 mpfr_set_ui(rr
, 0, GMP_RNDN
);
4546 mpfr_copysign(rr
, rr
, right_real
, GMP_RNDN
);
4550 mpfr_set_ui(ri
, 0, GMP_RNDN
);
4551 mpfr_copysign(ri
, ri
, right_imag
, GMP_RNDN
);
4558 mpfr_mul(lrrr
, lr
, rr
, GMP_RNDN
);
4559 mpfr_mul(lrri
, lr
, ri
, GMP_RNDN
);
4560 mpfr_mul(lirr
, li
, rr
, GMP_RNDN
);
4561 mpfr_mul(liri
, li
, ri
, GMP_RNDN
);
4562 mpfr_sub(real
, lrrr
, liri
, GMP_RNDN
);
4563 mpfr_add(imag
, lrri
, lirr
, GMP_RNDN
);
4564 mpfr_set_inf(real
, mpfr_sgn(real
));
4565 mpfr_set_inf(imag
, mpfr_sgn(imag
));
4582 // For complex division we want to avoid having an
4583 // intermediate overflow turn the whole result in a NaN. We
4584 // scale the values to try to avoid this.
4586 if (mpfr_zero_p(right_real
) && mpfr_zero_p(right_imag
))
4587 error_at(location
, "division by zero");
4593 mpfr_abs(rra
, right_real
, GMP_RNDN
);
4594 mpfr_abs(ria
, right_imag
, GMP_RNDN
);
4597 mpfr_max(t
, rra
, ria
, GMP_RNDN
);
4601 mpfr_init_set(rr
, right_real
, GMP_RNDN
);
4602 mpfr_init_set(ri
, right_imag
, GMP_RNDN
);
4604 if (!mpfr_inf_p(t
) && !mpfr_nan_p(t
) && !mpfr_zero_p(t
))
4606 ilogbw
= mpfr_get_exp(t
);
4607 mpfr_mul_2si(rr
, rr
, - ilogbw
, GMP_RNDN
);
4608 mpfr_mul_2si(ri
, ri
, - ilogbw
, GMP_RNDN
);
4613 mpfr_mul(denom
, rr
, rr
, GMP_RNDN
);
4614 mpfr_mul(t
, ri
, ri
, GMP_RNDN
);
4615 mpfr_add(denom
, denom
, t
, GMP_RNDN
);
4617 mpfr_mul(real
, left_real
, rr
, GMP_RNDN
);
4618 mpfr_mul(t
, left_imag
, ri
, GMP_RNDN
);
4619 mpfr_add(real
, real
, t
, GMP_RNDN
);
4620 mpfr_div(real
, real
, denom
, GMP_RNDN
);
4621 mpfr_mul_2si(real
, real
, - ilogbw
, GMP_RNDN
);
4623 mpfr_mul(imag
, left_imag
, rr
, GMP_RNDN
);
4624 mpfr_mul(t
, left_real
, ri
, GMP_RNDN
);
4625 mpfr_sub(imag
, imag
, t
, GMP_RNDN
);
4626 mpfr_div(imag
, imag
, denom
, GMP_RNDN
);
4627 mpfr_mul_2si(imag
, imag
, - ilogbw
, GMP_RNDN
);
4629 // If we wind up with NaN on both sides, check whether we
4630 // should really have infinity. The rule is that if either
4631 // side of the complex number is infinity, then the whole
4632 // value is infinity, even if the other side is NaN. So the
4633 // only case we have to fix is the one in which both sides are
4635 if (mpfr_nan_p(real
) && mpfr_nan_p(imag
)
4636 && (!mpfr_nan_p(left_real
) || !mpfr_nan_p(left_imag
))
4637 && (!mpfr_nan_p(right_real
) || !mpfr_nan_p(right_imag
)))
4639 if (mpfr_zero_p(denom
))
4641 mpfr_set_inf(real
, mpfr_sgn(rr
));
4642 mpfr_mul(real
, real
, left_real
, GMP_RNDN
);
4643 mpfr_set_inf(imag
, mpfr_sgn(rr
));
4644 mpfr_mul(imag
, imag
, left_imag
, GMP_RNDN
);
4646 else if ((mpfr_inf_p(left_real
) || mpfr_inf_p(left_imag
))
4647 && mpfr_number_p(rr
) && mpfr_number_p(ri
))
4649 mpfr_set_ui(t
, mpfr_inf_p(left_real
) ? 1 : 0, GMP_RNDN
);
4650 mpfr_copysign(t
, t
, left_real
, GMP_RNDN
);
4653 mpfr_init_set_ui(t2
, mpfr_inf_p(left_imag
) ? 1 : 0, GMP_RNDN
);
4654 mpfr_copysign(t2
, t2
, left_imag
, GMP_RNDN
);
4658 mpfr_mul(t3
, t
, rr
, GMP_RNDN
);
4662 mpfr_mul(t4
, t2
, ri
, GMP_RNDN
);
4664 mpfr_add(t3
, t3
, t4
, GMP_RNDN
);
4665 mpfr_set_inf(real
, mpfr_sgn(t3
));
4667 mpfr_mul(t3
, t2
, rr
, GMP_RNDN
);
4668 mpfr_mul(t4
, t
, ri
, GMP_RNDN
);
4669 mpfr_sub(t3
, t3
, t4
, GMP_RNDN
);
4670 mpfr_set_inf(imag
, mpfr_sgn(t3
));
4676 else if ((mpfr_inf_p(right_real
) || mpfr_inf_p(right_imag
))
4677 && mpfr_number_p(left_real
) && mpfr_number_p(left_imag
))
4679 mpfr_set_ui(t
, mpfr_inf_p(rr
) ? 1 : 0, GMP_RNDN
);
4680 mpfr_copysign(t
, t
, rr
, GMP_RNDN
);
4683 mpfr_init_set_ui(t2
, mpfr_inf_p(ri
) ? 1 : 0, GMP_RNDN
);
4684 mpfr_copysign(t2
, t2
, ri
, GMP_RNDN
);
4688 mpfr_mul(t3
, left_real
, t
, GMP_RNDN
);
4692 mpfr_mul(t4
, left_imag
, t2
, GMP_RNDN
);
4694 mpfr_add(t3
, t3
, t4
, GMP_RNDN
);
4695 mpfr_set_ui(real
, 0, GMP_RNDN
);
4696 mpfr_mul(real
, real
, t3
, GMP_RNDN
);
4698 mpfr_mul(t3
, left_imag
, t
, GMP_RNDN
);
4699 mpfr_mul(t4
, left_real
, t2
, GMP_RNDN
);
4700 mpfr_sub(t3
, t3
, t4
, GMP_RNDN
);
4701 mpfr_set_ui(imag
, 0, GMP_RNDN
);
4702 mpfr_mul(imag
, imag
, t3
, GMP_RNDN
);
4720 case OPERATOR_LSHIFT
:
4721 case OPERATOR_RSHIFT
:
4727 Type
* type
= left_type
;
4730 else if (type
!= right_type
&& right_type
!= NULL
)
4732 if (type
->is_abstract())
4734 else if (!right_type
->is_abstract())
4736 // This looks like a type error which should be diagnosed
4737 // elsewhere. Don't do anything here, to avoid an unhelpful
4738 // chain of error messages.
4743 if (type
!= NULL
&& !type
->is_abstract())
4745 if ((type
!= left_type
4746 && !Complex_expression::check_constant(left_real
, left_imag
,
4748 || (type
!= right_type
4749 && !Complex_expression::check_constant(right_real
, right_imag
,
4751 || !Complex_expression::check_constant(real
, imag
, type
,
4754 mpfr_set_ui(real
, 0, GMP_RNDN
);
4755 mpfr_set_ui(imag
, 0, GMP_RNDN
);
4762 // Lower a binary expression. We have to evaluate constant
4763 // expressions now, in order to implement Go's unlimited precision
4767 Binary_expression::do_lower(Gogo
*, Named_object
*, int)
4769 source_location location
= this->location();
4770 Operator op
= this->op_
;
4771 Expression
* left
= this->left_
;
4772 Expression
* right
= this->right_
;
4774 const bool is_comparison
= (op
== OPERATOR_EQEQ
4775 || op
== OPERATOR_NOTEQ
4776 || op
== OPERATOR_LT
4777 || op
== OPERATOR_LE
4778 || op
== OPERATOR_GT
4779 || op
== OPERATOR_GE
);
4781 // Integer constant expressions.
4787 mpz_init(right_val
);
4789 if (left
->integer_constant_value(false, left_val
, &left_type
)
4790 && right
->integer_constant_value(false, right_val
, &right_type
))
4792 Expression
* ret
= NULL
;
4793 if (left_type
!= right_type
4794 && left_type
!= NULL
4795 && right_type
!= NULL
4796 && left_type
->base() != right_type
->base()
4797 && op
!= OPERATOR_LSHIFT
4798 && op
!= OPERATOR_RSHIFT
)
4800 // May be a type error--let it be diagnosed later.
4802 else if (is_comparison
)
4804 bool b
= Binary_expression::compare_integer(op
, left_val
,
4806 ret
= Expression::make_cast(Type::lookup_bool_type(),
4807 Expression::make_boolean(b
, location
),
4815 if (Binary_expression::eval_integer(op
, left_type
, left_val
,
4816 right_type
, right_val
,
4819 gcc_assert(op
!= OPERATOR_OROR
&& op
!= OPERATOR_ANDAND
);
4821 if (op
== OPERATOR_LSHIFT
|| op
== OPERATOR_RSHIFT
)
4823 else if (left_type
== NULL
)
4825 else if (right_type
== NULL
)
4827 else if (!left_type
->is_abstract()
4828 && left_type
->named_type() != NULL
)
4830 else if (!right_type
->is_abstract()
4831 && right_type
->named_type() != NULL
)
4833 else if (!left_type
->is_abstract())
4835 else if (!right_type
->is_abstract())
4837 else if (left_type
->float_type() != NULL
)
4839 else if (right_type
->float_type() != NULL
)
4841 else if (left_type
->complex_type() != NULL
)
4843 else if (right_type
->complex_type() != NULL
)
4847 ret
= Expression::make_integer(&val
, type
, location
);
4855 mpz_clear(right_val
);
4856 mpz_clear(left_val
);
4860 mpz_clear(right_val
);
4861 mpz_clear(left_val
);
4864 // Floating point constant expressions.
4867 mpfr_init(left_val
);
4870 mpfr_init(right_val
);
4872 if (left
->float_constant_value(left_val
, &left_type
)
4873 && right
->float_constant_value(right_val
, &right_type
))
4875 Expression
* ret
= NULL
;
4876 if (left_type
!= right_type
4877 && left_type
!= NULL
4878 && right_type
!= NULL
4879 && left_type
->base() != right_type
->base()
4880 && op
!= OPERATOR_LSHIFT
4881 && op
!= OPERATOR_RSHIFT
)
4883 // May be a type error--let it be diagnosed later.
4885 else if (is_comparison
)
4887 bool b
= Binary_expression::compare_float(op
,
4891 left_val
, right_val
);
4892 ret
= Expression::make_boolean(b
, location
);
4899 if (Binary_expression::eval_float(op
, left_type
, left_val
,
4900 right_type
, right_val
, val
,
4903 gcc_assert(op
!= OPERATOR_OROR
&& op
!= OPERATOR_ANDAND
4904 && op
!= OPERATOR_LSHIFT
&& op
!= OPERATOR_RSHIFT
);
4906 if (left_type
== NULL
)
4908 else if (right_type
== NULL
)
4910 else if (!left_type
->is_abstract()
4911 && left_type
->named_type() != NULL
)
4913 else if (!right_type
->is_abstract()
4914 && right_type
->named_type() != NULL
)
4916 else if (!left_type
->is_abstract())
4918 else if (!right_type
->is_abstract())
4920 else if (left_type
->float_type() != NULL
)
4922 else if (right_type
->float_type() != NULL
)
4926 ret
= Expression::make_float(&val
, type
, location
);
4934 mpfr_clear(right_val
);
4935 mpfr_clear(left_val
);
4939 mpfr_clear(right_val
);
4940 mpfr_clear(left_val
);
4943 // Complex constant expressions.
4947 mpfr_init(left_real
);
4948 mpfr_init(left_imag
);
4953 mpfr_init(right_real
);
4954 mpfr_init(right_imag
);
4957 if (left
->complex_constant_value(left_real
, left_imag
, &left_type
)
4958 && right
->complex_constant_value(right_real
, right_imag
, &right_type
))
4960 Expression
* ret
= NULL
;
4961 if (left_type
!= right_type
4962 && left_type
!= NULL
4963 && right_type
!= NULL
4964 && left_type
->base() != right_type
->base())
4966 // May be a type error--let it be diagnosed later.
4968 else if (is_comparison
)
4970 bool b
= Binary_expression::compare_complex(op
,
4978 ret
= Expression::make_boolean(b
, location
);
4987 if (Binary_expression::eval_complex(op
, left_type
,
4988 left_real
, left_imag
,
4990 right_real
, right_imag
,
4994 gcc_assert(op
!= OPERATOR_OROR
&& op
!= OPERATOR_ANDAND
4995 && op
!= OPERATOR_LSHIFT
&& op
!= OPERATOR_RSHIFT
);
4997 if (left_type
== NULL
)
4999 else if (right_type
== NULL
)
5001 else if (!left_type
->is_abstract()
5002 && left_type
->named_type() != NULL
)
5004 else if (!right_type
->is_abstract()
5005 && right_type
->named_type() != NULL
)
5007 else if (!left_type
->is_abstract())
5009 else if (!right_type
->is_abstract())
5011 else if (left_type
->complex_type() != NULL
)
5013 else if (right_type
->complex_type() != NULL
)
5017 ret
= Expression::make_complex(&real
, &imag
, type
,
5026 mpfr_clear(left_real
);
5027 mpfr_clear(left_imag
);
5028 mpfr_clear(right_real
);
5029 mpfr_clear(right_imag
);
5034 mpfr_clear(left_real
);
5035 mpfr_clear(left_imag
);
5036 mpfr_clear(right_real
);
5037 mpfr_clear(right_imag
);
5040 // String constant expressions.
5041 if (op
== OPERATOR_PLUS
5042 && left
->type()->is_string_type()
5043 && right
->type()->is_string_type())
5045 std::string left_string
;
5046 std::string right_string
;
5047 if (left
->string_constant_value(&left_string
)
5048 && right
->string_constant_value(&right_string
))
5049 return Expression::make_string(left_string
+ right_string
, location
);
5055 // Return the integer constant value, if it has one.
5058 Binary_expression::do_integer_constant_value(bool iota_is_constant
, mpz_t val
,
5064 if (!this->left_
->integer_constant_value(iota_is_constant
, left_val
,
5067 mpz_clear(left_val
);
5072 mpz_init(right_val
);
5074 if (!this->right_
->integer_constant_value(iota_is_constant
, right_val
,
5077 mpz_clear(right_val
);
5078 mpz_clear(left_val
);
5083 if (left_type
!= right_type
5084 && left_type
!= NULL
5085 && right_type
!= NULL
5086 && left_type
->base() != right_type
->base()
5087 && this->op_
!= OPERATOR_RSHIFT
5088 && this->op_
!= OPERATOR_LSHIFT
)
5091 ret
= Binary_expression::eval_integer(this->op_
, left_type
, left_val
,
5092 right_type
, right_val
,
5093 this->location(), val
);
5095 mpz_clear(right_val
);
5096 mpz_clear(left_val
);
5104 // Return the floating point constant value, if it has one.
5107 Binary_expression::do_float_constant_value(mpfr_t val
, Type
** ptype
) const
5110 mpfr_init(left_val
);
5112 if (!this->left_
->float_constant_value(left_val
, &left_type
))
5114 mpfr_clear(left_val
);
5119 mpfr_init(right_val
);
5121 if (!this->right_
->float_constant_value(right_val
, &right_type
))
5123 mpfr_clear(right_val
);
5124 mpfr_clear(left_val
);
5129 if (left_type
!= right_type
5130 && left_type
!= NULL
5131 && right_type
!= NULL
5132 && left_type
->base() != right_type
->base())
5135 ret
= Binary_expression::eval_float(this->op_
, left_type
, left_val
,
5136 right_type
, right_val
,
5137 val
, this->location());
5139 mpfr_clear(left_val
);
5140 mpfr_clear(right_val
);
5148 // Return the complex constant value, if it has one.
5151 Binary_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
5156 mpfr_init(left_real
);
5157 mpfr_init(left_imag
);
5159 if (!this->left_
->complex_constant_value(left_real
, left_imag
, &left_type
))
5161 mpfr_clear(left_real
);
5162 mpfr_clear(left_imag
);
5168 mpfr_init(right_real
);
5169 mpfr_init(right_imag
);
5171 if (!this->right_
->complex_constant_value(right_real
, right_imag
,
5174 mpfr_clear(left_real
);
5175 mpfr_clear(left_imag
);
5176 mpfr_clear(right_real
);
5177 mpfr_clear(right_imag
);
5182 if (left_type
!= right_type
5183 && left_type
!= NULL
5184 && right_type
!= NULL
5185 && left_type
->base() != right_type
->base())
5188 ret
= Binary_expression::eval_complex(this->op_
, left_type
,
5189 left_real
, left_imag
,
5191 right_real
, right_imag
,
5194 mpfr_clear(left_real
);
5195 mpfr_clear(left_imag
);
5196 mpfr_clear(right_real
);
5197 mpfr_clear(right_imag
);
5205 // Note that the value is being discarded.
5208 Binary_expression::do_discarding_value()
5210 if (this->op_
== OPERATOR_OROR
|| this->op_
== OPERATOR_ANDAND
)
5211 this->right_
->discarding_value();
5213 this->warn_about_unused_value();
5219 Binary_expression::do_type()
5224 case OPERATOR_ANDAND
:
5226 case OPERATOR_NOTEQ
:
5231 return Type::lookup_bool_type();
5234 case OPERATOR_MINUS
:
5241 case OPERATOR_BITCLEAR
:
5243 Type
* left_type
= this->left_
->type();
5244 Type
* right_type
= this->right_
->type();
5245 if (!left_type
->is_abstract() && left_type
->named_type() != NULL
)
5247 else if (!right_type
->is_abstract() && right_type
->named_type() != NULL
)
5249 else if (!left_type
->is_abstract())
5251 else if (!right_type
->is_abstract())
5253 else if (left_type
->complex_type() != NULL
)
5255 else if (right_type
->complex_type() != NULL
)
5257 else if (left_type
->float_type() != NULL
)
5259 else if (right_type
->float_type() != NULL
)
5265 case OPERATOR_LSHIFT
:
5266 case OPERATOR_RSHIFT
:
5267 return this->left_
->type();
5274 // Set type for a binary expression.
5277 Binary_expression::do_determine_type(const Type_context
* context
)
5279 Type
* tleft
= this->left_
->type();
5280 Type
* tright
= this->right_
->type();
5282 // Both sides should have the same type, except for the shift
5283 // operations. For a comparison, we should ignore the incoming
5286 bool is_shift_op
= (this->op_
== OPERATOR_LSHIFT
5287 || this->op_
== OPERATOR_RSHIFT
);
5289 bool is_comparison
= (this->op_
== OPERATOR_EQEQ
5290 || this->op_
== OPERATOR_NOTEQ
5291 || this->op_
== OPERATOR_LT
5292 || this->op_
== OPERATOR_LE
5293 || this->op_
== OPERATOR_GT
5294 || this->op_
== OPERATOR_GE
);
5296 Type_context
subcontext(*context
);
5300 // In a comparison, the context does not determine the types of
5302 subcontext
.type
= NULL
;
5305 // Set the context for the left hand operand.
5308 // The right hand operand plays no role in determining the type
5309 // of the left hand operand. A shift of an abstract integer in
5310 // a string context gets special treatment, which may be a
5312 if (subcontext
.type
!= NULL
5313 && subcontext
.type
->is_string_type()
5314 && tleft
->is_abstract())
5315 error_at(this->location(), "shift of non-integer operand");
5317 else if (!tleft
->is_abstract())
5318 subcontext
.type
= tleft
;
5319 else if (!tright
->is_abstract())
5320 subcontext
.type
= tright
;
5321 else if (subcontext
.type
== NULL
)
5323 if ((tleft
->integer_type() != NULL
&& tright
->integer_type() != NULL
)
5324 || (tleft
->float_type() != NULL
&& tright
->float_type() != NULL
)
5325 || (tleft
->complex_type() != NULL
&& tright
->complex_type() != NULL
))
5327 // Both sides have an abstract integer, abstract float, or
5328 // abstract complex type. Just let CONTEXT determine
5329 // whether they may remain abstract or not.
5331 else if (tleft
->complex_type() != NULL
)
5332 subcontext
.type
= tleft
;
5333 else if (tright
->complex_type() != NULL
)
5334 subcontext
.type
= tright
;
5335 else if (tleft
->float_type() != NULL
)
5336 subcontext
.type
= tleft
;
5337 else if (tright
->float_type() != NULL
)
5338 subcontext
.type
= tright
;
5340 subcontext
.type
= tleft
;
5343 this->left_
->determine_type(&subcontext
);
5345 // The context for the right hand operand is the same as for the
5346 // left hand operand, except for a shift operator.
5349 subcontext
.type
= Type::lookup_integer_type("uint");
5350 subcontext
.may_be_abstract
= false;
5353 this->right_
->determine_type(&subcontext
);
5356 // Report an error if the binary operator OP does not support TYPE.
5357 // Return whether the operation is OK. This should not be used for
5361 Binary_expression::check_operator_type(Operator op
, Type
* type
,
5362 source_location location
)
5367 case OPERATOR_ANDAND
:
5368 if (!type
->is_boolean_type())
5370 error_at(location
, "expected boolean type");
5376 case OPERATOR_NOTEQ
:
5377 if (type
->integer_type() == NULL
5378 && type
->float_type() == NULL
5379 && type
->complex_type() == NULL
5380 && !type
->is_string_type()
5381 && type
->points_to() == NULL
5382 && !type
->is_nil_type()
5383 && !type
->is_boolean_type()
5384 && type
->interface_type() == NULL
5385 && (type
->array_type() == NULL
5386 || type
->array_type()->length() != NULL
)
5387 && type
->map_type() == NULL
5388 && type
->channel_type() == NULL
5389 && type
->function_type() == NULL
)
5392 ("expected integer, floating, complex, string, pointer, "
5393 "boolean, interface, slice, map, channel, "
5394 "or function type"));
5403 if (type
->integer_type() == NULL
5404 && type
->float_type() == NULL
5405 && !type
->is_string_type())
5407 error_at(location
, "expected integer, floating, or string type");
5413 case OPERATOR_PLUSEQ
:
5414 if (type
->integer_type() == NULL
5415 && type
->float_type() == NULL
5416 && type
->complex_type() == NULL
5417 && !type
->is_string_type())
5420 "expected integer, floating, complex, or string type");
5425 case OPERATOR_MINUS
:
5426 case OPERATOR_MINUSEQ
:
5428 case OPERATOR_MULTEQ
:
5430 case OPERATOR_DIVEQ
:
5431 if (type
->integer_type() == NULL
5432 && type
->float_type() == NULL
5433 && type
->complex_type() == NULL
)
5435 error_at(location
, "expected integer, floating, or complex type");
5441 case OPERATOR_MODEQ
:
5445 case OPERATOR_ANDEQ
:
5447 case OPERATOR_XOREQ
:
5448 case OPERATOR_BITCLEAR
:
5449 case OPERATOR_BITCLEAREQ
:
5450 if (type
->integer_type() == NULL
)
5452 error_at(location
, "expected integer type");
5467 Binary_expression::do_check_types(Gogo
*)
5469 Type
* left_type
= this->left_
->type();
5470 Type
* right_type
= this->right_
->type();
5471 if (left_type
->is_error_type() || right_type
->is_error_type())
5473 this->set_is_error();
5477 if (this->op_
== OPERATOR_EQEQ
5478 || this->op_
== OPERATOR_NOTEQ
5479 || this->op_
== OPERATOR_LT
5480 || this->op_
== OPERATOR_LE
5481 || this->op_
== OPERATOR_GT
5482 || this->op_
== OPERATOR_GE
)
5484 if (!Type::are_assignable(left_type
, right_type
, NULL
)
5485 && !Type::are_assignable(right_type
, left_type
, NULL
))
5487 this->report_error(_("incompatible types in binary expression"));
5490 if (!Binary_expression::check_operator_type(this->op_
, left_type
,
5492 || !Binary_expression::check_operator_type(this->op_
, right_type
,
5495 this->set_is_error();
5499 else if (this->op_
!= OPERATOR_LSHIFT
&& this->op_
!= OPERATOR_RSHIFT
)
5501 if (!Type::are_compatible_for_binop(left_type
, right_type
))
5503 this->report_error(_("incompatible types in binary expression"));
5506 if (!Binary_expression::check_operator_type(this->op_
, left_type
,
5509 this->set_is_error();
5515 if (left_type
->integer_type() == NULL
)
5516 this->report_error(_("shift of non-integer operand"));
5518 if (!right_type
->is_abstract()
5519 && (right_type
->integer_type() == NULL
5520 || !right_type
->integer_type()->is_unsigned()))
5521 this->report_error(_("shift count not unsigned integer"));
5527 if (this->right_
->integer_constant_value(true, val
, &type
))
5529 if (mpz_sgn(val
) < 0)
5530 this->report_error(_("negative shift count"));
5537 // Get a tree for a binary expression.
5540 Binary_expression::do_get_tree(Translate_context
* context
)
5542 tree left
= this->left_
->get_tree(context
);
5543 tree right
= this->right_
->get_tree(context
);
5545 if (left
== error_mark_node
|| right
== error_mark_node
)
5546 return error_mark_node
;
5548 enum tree_code code
;
5549 bool use_left_type
= true;
5550 bool is_shift_op
= false;
5554 case OPERATOR_NOTEQ
:
5559 return Expression::comparison_tree(context
, this->op_
,
5560 this->left_
->type(), left
,
5561 this->right_
->type(), right
,
5565 code
= TRUTH_ORIF_EXPR
;
5566 use_left_type
= false;
5568 case OPERATOR_ANDAND
:
5569 code
= TRUTH_ANDIF_EXPR
;
5570 use_left_type
= false;
5575 case OPERATOR_MINUS
:
5579 code
= BIT_IOR_EXPR
;
5582 code
= BIT_XOR_EXPR
;
5589 Type
*t
= this->left_
->type();
5590 if (t
->float_type() != NULL
|| t
->complex_type() != NULL
)
5593 code
= TRUNC_DIV_EXPR
;
5597 code
= TRUNC_MOD_EXPR
;
5599 case OPERATOR_LSHIFT
:
5603 case OPERATOR_RSHIFT
:
5608 code
= BIT_AND_EXPR
;
5610 case OPERATOR_BITCLEAR
:
5611 right
= fold_build1(BIT_NOT_EXPR
, TREE_TYPE(right
), right
);
5612 code
= BIT_AND_EXPR
;
5618 tree type
= use_left_type
? TREE_TYPE(left
) : TREE_TYPE(right
);
5620 if (this->left_
->type()->is_string_type())
5622 gcc_assert(this->op_
== OPERATOR_PLUS
);
5623 tree string_type
= Type::make_string_type()->get_tree(context
->gogo());
5624 static tree string_plus_decl
;
5625 return Gogo::call_builtin(&string_plus_decl
,
5636 tree compute_type
= excess_precision_type(type
);
5637 if (compute_type
!= NULL_TREE
)
5639 left
= ::convert(compute_type
, left
);
5640 right
= ::convert(compute_type
, right
);
5643 tree eval_saved
= NULL_TREE
;
5647 left
= save_expr(left
);
5649 right
= save_expr(right
);
5650 // Make sure the values are evaluated.
5651 eval_saved
= fold_build2_loc(this->location(), COMPOUND_EXPR
,
5652 void_type_node
, left
, right
);
5655 tree ret
= fold_build2_loc(this->location(),
5657 compute_type
!= NULL_TREE
? compute_type
: type
,
5660 if (compute_type
!= NULL_TREE
)
5661 ret
= ::convert(type
, ret
);
5663 // In Go, a shift larger than the size of the type is well-defined.
5664 // This is not true in GENERIC, so we need to insert a conditional.
5667 gcc_assert(INTEGRAL_TYPE_P(TREE_TYPE(left
)));
5668 gcc_assert(this->left_
->type()->integer_type() != NULL
);
5669 int bits
= TYPE_PRECISION(TREE_TYPE(left
));
5671 tree compare
= fold_build2(LT_EXPR
, boolean_type_node
, right
,
5672 build_int_cst_type(TREE_TYPE(right
), bits
));
5674 tree overflow_result
= fold_convert_loc(this->location(),
5677 if (this->op_
== OPERATOR_RSHIFT
5678 && !this->left_
->type()->integer_type()->is_unsigned())
5680 tree neg
= fold_build2_loc(this->location(), LT_EXPR
,
5681 boolean_type_node
, left
,
5682 fold_convert_loc(this->location(),
5684 integer_zero_node
));
5685 tree neg_one
= fold_build2_loc(this->location(),
5686 MINUS_EXPR
, TREE_TYPE(left
),
5687 fold_convert_loc(this->location(),
5690 fold_convert_loc(this->location(),
5693 overflow_result
= fold_build3_loc(this->location(), COND_EXPR
,
5694 TREE_TYPE(left
), neg
, neg_one
,
5698 ret
= fold_build3_loc(this->location(), COND_EXPR
, TREE_TYPE(left
),
5699 compare
, ret
, overflow_result
);
5701 ret
= fold_build2_loc(this->location(), COMPOUND_EXPR
,
5702 TREE_TYPE(ret
), eval_saved
, ret
);
5708 // Export a binary expression.
5711 Binary_expression::do_export(Export
* exp
) const
5713 exp
->write_c_string("(");
5714 this->left_
->export_expression(exp
);
5718 exp
->write_c_string(" || ");
5720 case OPERATOR_ANDAND
:
5721 exp
->write_c_string(" && ");
5724 exp
->write_c_string(" == ");
5726 case OPERATOR_NOTEQ
:
5727 exp
->write_c_string(" != ");
5730 exp
->write_c_string(" < ");
5733 exp
->write_c_string(" <= ");
5736 exp
->write_c_string(" > ");
5739 exp
->write_c_string(" >= ");
5742 exp
->write_c_string(" + ");
5744 case OPERATOR_MINUS
:
5745 exp
->write_c_string(" - ");
5748 exp
->write_c_string(" | ");
5751 exp
->write_c_string(" ^ ");
5754 exp
->write_c_string(" * ");
5757 exp
->write_c_string(" / ");
5760 exp
->write_c_string(" % ");
5762 case OPERATOR_LSHIFT
:
5763 exp
->write_c_string(" << ");
5765 case OPERATOR_RSHIFT
:
5766 exp
->write_c_string(" >> ");
5769 exp
->write_c_string(" & ");
5771 case OPERATOR_BITCLEAR
:
5772 exp
->write_c_string(" &^ ");
5777 this->right_
->export_expression(exp
);
5778 exp
->write_c_string(")");
5781 // Import a binary expression.
5784 Binary_expression::do_import(Import
* imp
)
5786 imp
->require_c_string("(");
5788 Expression
* left
= Expression::import_expression(imp
);
5791 if (imp
->match_c_string(" || "))
5796 else if (imp
->match_c_string(" && "))
5798 op
= OPERATOR_ANDAND
;
5801 else if (imp
->match_c_string(" == "))
5806 else if (imp
->match_c_string(" != "))
5808 op
= OPERATOR_NOTEQ
;
5811 else if (imp
->match_c_string(" < "))
5816 else if (imp
->match_c_string(" <= "))
5821 else if (imp
->match_c_string(" > "))
5826 else if (imp
->match_c_string(" >= "))
5831 else if (imp
->match_c_string(" + "))
5836 else if (imp
->match_c_string(" - "))
5838 op
= OPERATOR_MINUS
;
5841 else if (imp
->match_c_string(" | "))
5846 else if (imp
->match_c_string(" ^ "))
5851 else if (imp
->match_c_string(" * "))
5856 else if (imp
->match_c_string(" / "))
5861 else if (imp
->match_c_string(" % "))
5866 else if (imp
->match_c_string(" << "))
5868 op
= OPERATOR_LSHIFT
;
5871 else if (imp
->match_c_string(" >> "))
5873 op
= OPERATOR_RSHIFT
;
5876 else if (imp
->match_c_string(" & "))
5881 else if (imp
->match_c_string(" &^ "))
5883 op
= OPERATOR_BITCLEAR
;
5888 error_at(imp
->location(), "unrecognized binary operator");
5889 return Expression::make_error(imp
->location());
5892 Expression
* right
= Expression::import_expression(imp
);
5894 imp
->require_c_string(")");
5896 return Expression::make_binary(op
, left
, right
, imp
->location());
5899 // Make a binary expression.
5902 Expression::make_binary(Operator op
, Expression
* left
, Expression
* right
,
5903 source_location location
)
5905 return new Binary_expression(op
, left
, right
, location
);
5908 // Implement a comparison.
5911 Expression::comparison_tree(Translate_context
* context
, Operator op
,
5912 Type
* left_type
, tree left_tree
,
5913 Type
* right_type
, tree right_tree
,
5914 source_location location
)
5916 enum tree_code code
;
5922 case OPERATOR_NOTEQ
:
5941 if (left_type
->is_string_type() && right_type
->is_string_type())
5943 tree string_type
= Type::make_string_type()->get_tree(context
->gogo());
5944 static tree string_compare_decl
;
5945 left_tree
= Gogo::call_builtin(&string_compare_decl
,
5954 right_tree
= build_int_cst_type(integer_type_node
, 0);
5956 else if ((left_type
->interface_type() != NULL
5957 && right_type
->interface_type() == NULL
5958 && !right_type
->is_nil_type())
5959 || (left_type
->interface_type() == NULL
5960 && !left_type
->is_nil_type()
5961 && right_type
->interface_type() != NULL
))
5963 // Comparing an interface value to a non-interface value.
5964 if (left_type
->interface_type() == NULL
)
5966 std::swap(left_type
, right_type
);
5967 std::swap(left_tree
, right_tree
);
5970 // The right operand is not an interface. We need to take its
5971 // address if it is not a pointer.
5974 if (right_type
->points_to() != NULL
)
5976 make_tmp
= NULL_TREE
;
5979 else if (TREE_ADDRESSABLE(TREE_TYPE(right_tree
)) || DECL_P(right_tree
))
5981 make_tmp
= NULL_TREE
;
5982 arg
= build_fold_addr_expr_loc(location
, right_tree
);
5983 if (DECL_P(right_tree
))
5984 TREE_ADDRESSABLE(right_tree
) = 1;
5988 tree tmp
= create_tmp_var(TREE_TYPE(right_tree
),
5989 get_name(right_tree
));
5990 DECL_IGNORED_P(tmp
) = 0;
5991 DECL_INITIAL(tmp
) = right_tree
;
5992 TREE_ADDRESSABLE(tmp
) = 1;
5993 make_tmp
= build1(DECL_EXPR
, void_type_node
, tmp
);
5994 SET_EXPR_LOCATION(make_tmp
, location
);
5995 arg
= build_fold_addr_expr_loc(location
, tmp
);
5997 arg
= fold_convert_loc(location
, ptr_type_node
, arg
);
5999 tree descriptor
= right_type
->type_descriptor_pointer(context
->gogo());
6001 if (left_type
->interface_type()->is_empty())
6003 static tree empty_interface_value_compare_decl
;
6004 left_tree
= Gogo::call_builtin(&empty_interface_value_compare_decl
,
6006 "__go_empty_interface_value_compare",
6009 TREE_TYPE(left_tree
),
6011 TREE_TYPE(descriptor
),
6015 // This can panic if the type is not comparable.
6016 TREE_NOTHROW(empty_interface_value_compare_decl
) = 0;
6020 static tree interface_value_compare_decl
;
6021 left_tree
= Gogo::call_builtin(&interface_value_compare_decl
,
6023 "__go_interface_value_compare",
6026 TREE_TYPE(left_tree
),
6028 TREE_TYPE(descriptor
),
6032 // This can panic if the type is not comparable.
6033 TREE_NOTHROW(interface_value_compare_decl
) = 0;
6035 right_tree
= build_int_cst_type(integer_type_node
, 0);
6037 if (make_tmp
!= NULL_TREE
)
6038 left_tree
= build2(COMPOUND_EXPR
, TREE_TYPE(left_tree
), make_tmp
,
6041 else if (left_type
->interface_type() != NULL
6042 && right_type
->interface_type() != NULL
)
6044 if (left_type
->interface_type()->is_empty())
6046 gcc_assert(right_type
->interface_type()->is_empty());
6047 static tree empty_interface_compare_decl
;
6048 left_tree
= Gogo::call_builtin(&empty_interface_compare_decl
,
6050 "__go_empty_interface_compare",
6053 TREE_TYPE(left_tree
),
6055 TREE_TYPE(right_tree
),
6057 // This can panic if the type is uncomparable.
6058 TREE_NOTHROW(empty_interface_compare_decl
) = 0;
6062 gcc_assert(!right_type
->interface_type()->is_empty());
6063 static tree interface_compare_decl
;
6064 left_tree
= Gogo::call_builtin(&interface_compare_decl
,
6066 "__go_interface_compare",
6069 TREE_TYPE(left_tree
),
6071 TREE_TYPE(right_tree
),
6073 // This can panic if the type is uncomparable.
6074 TREE_NOTHROW(interface_compare_decl
) = 0;
6076 right_tree
= build_int_cst_type(integer_type_node
, 0);
6079 if (left_type
->is_nil_type()
6080 && (op
== OPERATOR_EQEQ
|| op
== OPERATOR_NOTEQ
))
6082 std::swap(left_type
, right_type
);
6083 std::swap(left_tree
, right_tree
);
6086 if (right_type
->is_nil_type())
6088 if (left_type
->array_type() != NULL
6089 && left_type
->array_type()->length() == NULL
)
6091 Array_type
* at
= left_type
->array_type();
6092 left_tree
= at
->value_pointer_tree(context
->gogo(), left_tree
);
6093 right_tree
= fold_convert(TREE_TYPE(left_tree
), null_pointer_node
);
6095 else if (left_type
->interface_type() != NULL
)
6097 // An interface is nil if the first field is nil.
6098 tree left_type_tree
= TREE_TYPE(left_tree
);
6099 gcc_assert(TREE_CODE(left_type_tree
) == RECORD_TYPE
);
6100 tree field
= TYPE_FIELDS(left_type_tree
);
6101 left_tree
= build3(COMPONENT_REF
, TREE_TYPE(field
), left_tree
,
6103 right_tree
= fold_convert(TREE_TYPE(left_tree
), null_pointer_node
);
6107 gcc_assert(POINTER_TYPE_P(TREE_TYPE(left_tree
)));
6108 right_tree
= fold_convert(TREE_TYPE(left_tree
), null_pointer_node
);
6112 if (left_tree
== error_mark_node
|| right_tree
== error_mark_node
)
6113 return error_mark_node
;
6115 tree ret
= fold_build2(code
, boolean_type_node
, left_tree
, right_tree
);
6116 if (CAN_HAVE_LOCATION_P(ret
))
6117 SET_EXPR_LOCATION(ret
, location
);
6121 // Class Bound_method_expression.
6126 Bound_method_expression::do_traverse(Traverse
* traverse
)
6128 if (Expression::traverse(&this->expr_
, traverse
) == TRAVERSE_EXIT
)
6129 return TRAVERSE_EXIT
;
6130 return Expression::traverse(&this->method_
, traverse
);
6133 // Return the type of a bound method expression. The type of this
6134 // object is really the type of the method with no receiver. We
6135 // should be able to get away with just returning the type of the
6139 Bound_method_expression::do_type()
6141 return this->method_
->type();
6144 // Determine the types of a method expression.
6147 Bound_method_expression::do_determine_type(const Type_context
*)
6149 this->method_
->determine_type_no_context();
6150 Type
* mtype
= this->method_
->type();
6151 Function_type
* fntype
= mtype
== NULL
? NULL
: mtype
->function_type();
6152 if (fntype
== NULL
|| !fntype
->is_method())
6153 this->expr_
->determine_type_no_context();
6156 Type_context
subcontext(fntype
->receiver()->type(), false);
6157 this->expr_
->determine_type(&subcontext
);
6161 // Check the types of a method expression.
6164 Bound_method_expression::do_check_types(Gogo
*)
6166 Type
* type
= this->method_
->type()->deref();
6168 || type
->function_type() == NULL
6169 || !type
->function_type()->is_method())
6170 this->report_error(_("object is not a method"));
6173 Type
* rtype
= type
->function_type()->receiver()->type()->deref();
6174 Type
* etype
= (this->expr_type_
!= NULL
6176 : this->expr_
->type());
6177 etype
= etype
->deref();
6178 if (!Type::are_identical(rtype
, etype
, true, NULL
))
6179 this->report_error(_("method type does not match object type"));
6183 // Get the tree for a method expression. There is no standard tree
6184 // representation for this. The only places it may currently be used
6185 // are in a Call_expression or a Go_statement, which will take it
6186 // apart directly. So this has nothing to do at present.
6189 Bound_method_expression::do_get_tree(Translate_context
*)
6194 // Make a method expression.
6196 Bound_method_expression
*
6197 Expression::make_bound_method(Expression
* expr
, Expression
* method
,
6198 source_location location
)
6200 return new Bound_method_expression(expr
, method
, location
);
6203 // Class Builtin_call_expression. This is used for a call to a
6204 // builtin function.
6206 class Builtin_call_expression
: public Call_expression
6209 Builtin_call_expression(Gogo
* gogo
, Expression
* fn
, Expression_list
* args
,
6210 bool is_varargs
, source_location location
);
6213 // This overrides Call_expression::do_lower.
6215 do_lower(Gogo
*, Named_object
*, int);
6218 do_is_constant() const;
6221 do_integer_constant_value(bool, mpz_t
, Type
**) const;
6224 do_float_constant_value(mpfr_t
, Type
**) const;
6227 do_complex_constant_value(mpfr_t
, mpfr_t
, Type
**) const;
6233 do_determine_type(const Type_context
*);
6236 do_check_types(Gogo
*);
6241 return new Builtin_call_expression(this->gogo_
, this->fn()->copy(),
6242 this->args()->copy(),
6248 do_get_tree(Translate_context
*);
6251 do_export(Export
*) const;
6254 do_is_recover_call() const;
6257 do_set_recover_arg(Expression
*);
6260 // The builtin functions.
6261 enum Builtin_function_code
6265 // Predeclared builtin functions.
6282 // Builtin functions from the unsafe package.
6295 real_imag_type(Type
*);
6300 // A pointer back to the general IR structure. This avoids a global
6301 // variable, or passing it around everywhere.
6303 // The builtin function being called.
6304 Builtin_function_code code_
;
6307 Builtin_call_expression::Builtin_call_expression(Gogo
* gogo
,
6309 Expression_list
* args
,
6311 source_location location
)
6312 : Call_expression(fn
, args
, is_varargs
, location
),
6313 gogo_(gogo
), code_(BUILTIN_INVALID
)
6315 Func_expression
* fnexp
= this->fn()->func_expression();
6316 gcc_assert(fnexp
!= NULL
);
6317 const std::string
& name(fnexp
->named_object()->name());
6318 if (name
== "append")
6319 this->code_
= BUILTIN_APPEND
;
6320 else if (name
== "cap")
6321 this->code_
= BUILTIN_CAP
;
6322 else if (name
== "close")
6323 this->code_
= BUILTIN_CLOSE
;
6324 else if (name
== "closed")
6325 this->code_
= BUILTIN_CLOSED
;
6326 else if (name
== "cmplx")
6327 this->code_
= BUILTIN_CMPLX
;
6328 else if (name
== "copy")
6329 this->code_
= BUILTIN_COPY
;
6330 else if (name
== "imag")
6331 this->code_
= BUILTIN_IMAG
;
6332 else if (name
== "len")
6333 this->code_
= BUILTIN_LEN
;
6334 else if (name
== "make")
6335 this->code_
= BUILTIN_MAKE
;
6336 else if (name
== "new")
6337 this->code_
= BUILTIN_NEW
;
6338 else if (name
== "panic")
6339 this->code_
= BUILTIN_PANIC
;
6340 else if (name
== "print")
6341 this->code_
= BUILTIN_PRINT
;
6342 else if (name
== "println")
6343 this->code_
= BUILTIN_PRINTLN
;
6344 else if (name
== "real")
6345 this->code_
= BUILTIN_REAL
;
6346 else if (name
== "recover")
6347 this->code_
= BUILTIN_RECOVER
;
6348 else if (name
== "Alignof")
6349 this->code_
= BUILTIN_ALIGNOF
;
6350 else if (name
== "Offsetof")
6351 this->code_
= BUILTIN_OFFSETOF
;
6352 else if (name
== "Sizeof")
6353 this->code_
= BUILTIN_SIZEOF
;
6358 // Return whether this is a call to recover. This is a virtual
6359 // function called from the parent class.
6362 Builtin_call_expression::do_is_recover_call() const
6364 if (this->classification() == EXPRESSION_ERROR
)
6366 return this->code_
== BUILTIN_RECOVER
;
6369 // Set the argument for a call to recover.
6372 Builtin_call_expression::do_set_recover_arg(Expression
* arg
)
6374 const Expression_list
* args
= this->args();
6375 gcc_assert(args
== NULL
|| args
->empty());
6376 Expression_list
* new_args
= new Expression_list();
6377 new_args
->push_back(arg
);
6378 this->set_args(new_args
);
6381 // A traversal class which looks for a call expression.
6383 class Find_call_expression
: public Traverse
6386 Find_call_expression()
6387 : Traverse(traverse_expressions
),
6392 expression(Expression
**);
6396 { return this->found_
; }
6403 Find_call_expression::expression(Expression
** pexpr
)
6405 if ((*pexpr
)->call_expression() != NULL
)
6407 this->found_
= true;
6408 return TRAVERSE_EXIT
;
6410 return TRAVERSE_CONTINUE
;
6413 // Lower a builtin call expression. This turns new and make into
6414 // specific expressions. We also convert to a constant if we can.
6417 Builtin_call_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
6419 if (this->code_
== BUILTIN_NEW
)
6421 const Expression_list
* args
= this->args();
6422 if (args
== NULL
|| args
->size() < 1)
6423 this->report_error(_("not enough arguments"));
6424 else if (args
->size() > 1)
6425 this->report_error(_("too many arguments"));
6428 Expression
* arg
= args
->front();
6429 if (!arg
->is_type_expression())
6431 error_at(arg
->location(), "expected type");
6432 this->set_is_error();
6435 return Expression::make_allocation(arg
->type(), this->location());
6438 else if (this->code_
== BUILTIN_MAKE
)
6440 const Expression_list
* args
= this->args();
6441 if (args
== NULL
|| args
->size() < 1)
6442 this->report_error(_("not enough arguments"));
6445 Expression
* arg
= args
->front();
6446 if (!arg
->is_type_expression())
6448 error_at(arg
->location(), "expected type");
6449 this->set_is_error();
6453 Expression_list
* newargs
;
6454 if (args
->size() == 1)
6458 newargs
= new Expression_list();
6459 Expression_list::const_iterator p
= args
->begin();
6461 for (; p
!= args
->end(); ++p
)
6462 newargs
->push_back(*p
);
6464 return Expression::make_make(arg
->type(), newargs
,
6469 else if (this->is_constant())
6471 // We can only lower len and cap if there are no function calls
6472 // in the arguments. Otherwise we have to make the call.
6473 if (this->code_
== BUILTIN_LEN
|| this->code_
== BUILTIN_CAP
)
6475 Expression
* arg
= this->one_arg();
6476 if (!arg
->is_constant())
6478 Find_call_expression find_call
;
6479 Expression::traverse(&arg
, &find_call
);
6480 if (find_call
.found())
6488 if (this->integer_constant_value(true, ival
, &type
))
6490 Expression
* ret
= Expression::make_integer(&ival
, type
,
6499 if (this->float_constant_value(rval
, &type
))
6501 Expression
* ret
= Expression::make_float(&rval
, type
,
6509 if (this->complex_constant_value(rval
, imag
, &type
))
6511 Expression
* ret
= Expression::make_complex(&rval
, &imag
, type
,
6520 else if (this->code_
== BUILTIN_RECOVER
)
6522 if (function
!= NULL
)
6523 function
->func_value()->set_calls_recover();
6526 // Calling recover outside of a function always returns the
6527 // nil empty interface.
6528 Type
* eface
= Type::make_interface_type(NULL
, this->location());
6529 return Expression::make_cast(eface
,
6530 Expression::make_nil(this->location()),
6534 else if (this->code_
== BUILTIN_APPEND
)
6536 // Lower the varargs.
6537 const Expression_list
* args
= this->args();
6538 if (args
== NULL
|| args
->empty())
6540 Type
* slice_type
= args
->front()->type();
6541 if (!slice_type
->is_open_array_type())
6543 error_at(args
->front()->location(), "argument 1 must be a slice");
6544 this->set_is_error();
6547 return this->lower_varargs(gogo
, function
, slice_type
, 2);
6553 // Return the type of the real or imag functions, given the type of
6554 // the argument. We need to map complex to float, complex64 to
6555 // float32, and complex128 to float64, so it has to be done by name.
6556 // This returns NULL if it can't figure out the type.
6559 Builtin_call_expression::real_imag_type(Type
* arg_type
)
6561 if (arg_type
== NULL
|| arg_type
->is_abstract())
6563 Named_type
* nt
= arg_type
->named_type();
6566 while (nt
->real_type()->named_type() != NULL
)
6567 nt
= nt
->real_type()->named_type();
6568 if (nt
->name() == "complex")
6569 return Type::lookup_float_type("float");
6570 else if (nt
->name() == "complex64")
6571 return Type::lookup_float_type("float32");
6572 else if (nt
->name() == "complex128")
6573 return Type::lookup_float_type("float64");
6578 // Return the type of the cmplx function, given the type of one of the
6579 // argments. Like real_imag_type, we have to map by name.
6582 Builtin_call_expression::cmplx_type(Type
* arg_type
)
6584 if (arg_type
== NULL
|| arg_type
->is_abstract())
6586 Named_type
* nt
= arg_type
->named_type();
6589 while (nt
->real_type()->named_type() != NULL
)
6590 nt
= nt
->real_type()->named_type();
6591 if (nt
->name() == "float")
6592 return Type::lookup_complex_type("complex");
6593 else if (nt
->name() == "float32")
6594 return Type::lookup_complex_type("complex64");
6595 else if (nt
->name() == "float64")
6596 return Type::lookup_complex_type("complex128");
6601 // Return a single argument, or NULL if there isn't one.
6604 Builtin_call_expression::one_arg() const
6606 const Expression_list
* args
= this->args();
6607 if (args
->size() != 1)
6609 return args
->front();
6612 // Return whether this is constant: len of a string, or len or cap of
6613 // a fixed array, or unsafe.Sizeof, unsafe.Offsetof, unsafe.Alignof.
6616 Builtin_call_expression::do_is_constant() const
6618 switch (this->code_
)
6623 Expression
* arg
= this->one_arg();
6626 Type
* arg_type
= arg
->type();
6628 if (arg_type
->points_to() != NULL
6629 && arg_type
->points_to()->array_type() != NULL
6630 && !arg_type
->points_to()->is_open_array_type())
6631 arg_type
= arg_type
->points_to();
6633 if (arg_type
->array_type() != NULL
6634 && arg_type
->array_type()->length() != NULL
)
6635 return arg_type
->array_type()->length()->is_constant();
6637 if (this->code_
== BUILTIN_LEN
&& arg_type
->is_string_type())
6638 return arg
->is_constant();
6642 case BUILTIN_SIZEOF
:
6643 case BUILTIN_ALIGNOF
:
6644 return this->one_arg() != NULL
;
6646 case BUILTIN_OFFSETOF
:
6648 Expression
* arg
= this->one_arg();
6651 return arg
->field_reference_expression() != NULL
;
6656 const Expression_list
* args
= this->args();
6657 if (args
!= NULL
&& args
->size() == 2)
6658 return args
->front()->is_constant() && args
->back()->is_constant();
6665 Expression
* arg
= this->one_arg();
6666 return arg
!= NULL
&& arg
->is_constant();
6676 // Return an integer constant value if possible.
6679 Builtin_call_expression::do_integer_constant_value(bool iota_is_constant
,
6683 if (this->code_
== BUILTIN_LEN
6684 || this->code_
== BUILTIN_CAP
)
6686 Expression
* arg
= this->one_arg();
6689 Type
* arg_type
= arg
->type();
6691 if (this->code_
== BUILTIN_LEN
&& arg_type
->is_string_type())
6694 if (arg
->string_constant_value(&sval
))
6696 mpz_set_ui(val
, sval
.length());
6697 *ptype
= Type::lookup_integer_type("int");
6702 if (arg_type
->points_to() != NULL
6703 && arg_type
->points_to()->array_type() != NULL
6704 && !arg_type
->points_to()->is_open_array_type())
6705 arg_type
= arg_type
->points_to();
6707 if (arg_type
->array_type() != NULL
6708 && arg_type
->array_type()->length() != NULL
)
6710 Expression
* e
= arg_type
->array_type()->length();
6711 if (e
->integer_constant_value(iota_is_constant
, val
, ptype
))
6713 *ptype
= Type::lookup_integer_type("int");
6718 else if (this->code_
== BUILTIN_SIZEOF
6719 || this->code_
== BUILTIN_ALIGNOF
)
6721 Expression
* arg
= this->one_arg();
6724 Type
* arg_type
= arg
->type();
6725 if (arg_type
->is_error_type() || arg_type
->is_undefined())
6727 if (arg_type
->is_abstract())
6729 tree arg_type_tree
= arg_type
->get_tree(this->gogo_
);
6730 unsigned long val_long
;
6731 if (this->code_
== BUILTIN_SIZEOF
)
6733 tree type_size
= TYPE_SIZE_UNIT(arg_type_tree
);
6734 gcc_assert(TREE_CODE(type_size
) == INTEGER_CST
);
6735 if (TREE_INT_CST_HIGH(type_size
) != 0)
6737 unsigned HOST_WIDE_INT val_wide
= TREE_INT_CST_LOW(type_size
);
6738 val_long
= static_cast<unsigned long>(val_wide
);
6739 if (val_long
!= val_wide
)
6742 else if (this->code_
== BUILTIN_ALIGNOF
)
6744 if (arg
->field_reference_expression() == NULL
)
6745 val_long
= go_type_alignment(arg_type_tree
);
6748 // Calling unsafe.Alignof(s.f) returns the alignment of
6749 // the type of f when it is used as a field in a struct.
6750 val_long
= go_field_alignment(arg_type_tree
);
6755 mpz_set_ui(val
, val_long
);
6759 else if (this->code_
== BUILTIN_OFFSETOF
)
6761 Expression
* arg
= this->one_arg();
6764 Field_reference_expression
* farg
= arg
->field_reference_expression();
6767 Expression
* struct_expr
= farg
->expr();
6768 Type
* st
= struct_expr
->type();
6769 if (st
->struct_type() == NULL
)
6771 tree struct_tree
= st
->get_tree(this->gogo_
);
6772 gcc_assert(TREE_CODE(struct_tree
) == RECORD_TYPE
);
6773 tree field
= TYPE_FIELDS(struct_tree
);
6774 for (unsigned int index
= farg
->field_index(); index
> 0; --index
)
6776 field
= DECL_CHAIN(field
);
6777 gcc_assert(field
!= NULL_TREE
);
6779 HOST_WIDE_INT offset_wide
= int_byte_position (field
);
6780 if (offset_wide
< 0)
6782 unsigned long offset_long
= static_cast<unsigned long>(offset_wide
);
6783 if (offset_long
!= static_cast<unsigned HOST_WIDE_INT
>(offset_wide
))
6785 mpz_set_ui(val
, offset_long
);
6791 // Return a floating point constant value if possible.
6794 Builtin_call_expression::do_float_constant_value(mpfr_t val
,
6797 if (this->code_
== BUILTIN_REAL
|| this->code_
== BUILTIN_IMAG
)
6799 Expression
* arg
= this->one_arg();
6810 if (arg
->complex_constant_value(real
, imag
, &type
))
6812 if (this->code_
== BUILTIN_REAL
)
6813 mpfr_set(val
, real
, GMP_RNDN
);
6815 mpfr_set(val
, imag
, GMP_RNDN
);
6816 *ptype
= Builtin_call_expression::real_imag_type(type
);
6828 // Return a complex constant value if possible.
6831 Builtin_call_expression::do_complex_constant_value(mpfr_t real
, mpfr_t imag
,
6834 if (this->code_
== BUILTIN_CMPLX
)
6836 const Expression_list
* args
= this->args();
6837 if (args
== NULL
|| args
->size() != 2)
6843 if (!args
->front()->float_constant_value(r
, &rtype
))
6854 if (args
->back()->float_constant_value(i
, &itype
)
6855 && Type::are_identical(rtype
, itype
, false, NULL
))
6857 mpfr_set(real
, r
, GMP_RNDN
);
6858 mpfr_set(imag
, i
, GMP_RNDN
);
6859 *ptype
= Builtin_call_expression::cmplx_type(rtype
);
6875 Builtin_call_expression::do_type()
6877 switch (this->code_
)
6879 case BUILTIN_INVALID
:
6886 const Expression_list
* args
= this->args();
6887 if (args
== NULL
|| args
->empty())
6888 return Type::make_error_type();
6889 return Type::make_pointer_type(args
->front()->type());
6895 case BUILTIN_ALIGNOF
:
6896 case BUILTIN_OFFSETOF
:
6897 case BUILTIN_SIZEOF
:
6898 return Type::lookup_integer_type("int");
6903 case BUILTIN_PRINTLN
:
6904 return Type::make_void_type();
6906 case BUILTIN_CLOSED
:
6907 return Type::lookup_bool_type();
6909 case BUILTIN_RECOVER
:
6910 return Type::make_interface_type(NULL
, BUILTINS_LOCATION
);
6912 case BUILTIN_APPEND
:
6914 const Expression_list
* args
= this->args();
6915 if (args
== NULL
|| args
->empty())
6916 return Type::make_error_type();
6917 return args
->front()->type();
6923 Expression
* arg
= this->one_arg();
6925 return Type::make_error_type();
6926 Type
* t
= arg
->type();
6927 if (t
->is_abstract())
6928 t
= t
->make_non_abstract_type();
6929 t
= Builtin_call_expression::real_imag_type(t
);
6931 t
= Type::make_error_type();
6937 const Expression_list
* args
= this->args();
6938 if (args
== NULL
|| args
->size() != 2)
6939 return Type::make_error_type();
6940 Type
* t
= args
->front()->type();
6941 if (t
->is_abstract())
6943 t
= args
->back()->type();
6944 if (t
->is_abstract())
6945 t
= t
->make_non_abstract_type();
6947 t
= Builtin_call_expression::cmplx_type(t
);
6949 t
= Type::make_error_type();
6955 // Determine the type.
6958 Builtin_call_expression::do_determine_type(const Type_context
* context
)
6960 this->fn()->determine_type_no_context();
6962 const Expression_list
* args
= this->args();
6965 Type
* arg_type
= NULL
;
6966 switch (this->code_
)
6969 case BUILTIN_PRINTLN
:
6970 // Do not force a large integer constant to "int".
6976 arg_type
= Builtin_call_expression::cmplx_type(context
->type
);
6982 // For the cmplx function the type of one operand can
6983 // determine the type of the other, as in a binary expression.
6984 arg_type
= Builtin_call_expression::real_imag_type(context
->type
);
6985 if (args
!= NULL
&& args
->size() == 2)
6987 Type
* t1
= args
->front()->type();
6988 Type
* t2
= args
->front()->type();
6989 if (!t1
->is_abstract())
6991 else if (!t2
->is_abstract())
7005 for (Expression_list::const_iterator pa
= args
->begin();
7009 Type_context subcontext
;
7010 subcontext
.type
= arg_type
;
7014 // We want to print large constants, we so can't just
7015 // use the appropriate nonabstract type. Use uint64 for
7016 // an integer if we know it is nonnegative, otherwise
7017 // use int64 for a integer, otherwise use float64 for a
7018 // float or complex128 for a complex.
7019 Type
* want_type
= NULL
;
7020 Type
* atype
= (*pa
)->type();
7021 if (atype
->is_abstract())
7023 if (atype
->integer_type() != NULL
)
7028 if (this->integer_constant_value(true, val
, &dummy
)
7029 && mpz_sgn(val
) >= 0)
7030 want_type
= Type::lookup_integer_type("uint64");
7032 want_type
= Type::lookup_integer_type("int64");
7035 else if (atype
->float_type() != NULL
)
7036 want_type
= Type::lookup_float_type("float64");
7037 else if (atype
->complex_type() != NULL
)
7038 want_type
= Type::lookup_complex_type("complex128");
7039 else if (atype
->is_abstract_string_type())
7040 want_type
= Type::lookup_string_type();
7041 else if (atype
->is_abstract_boolean_type())
7042 want_type
= Type::lookup_bool_type();
7045 subcontext
.type
= want_type
;
7049 (*pa
)->determine_type(&subcontext
);
7054 // If there is exactly one argument, return true. Otherwise give an
7055 // error message and return false.
7058 Builtin_call_expression::check_one_arg()
7060 const Expression_list
* args
= this->args();
7061 if (args
== NULL
|| args
->size() < 1)
7063 this->report_error(_("not enough arguments"));
7066 else if (args
->size() > 1)
7068 this->report_error(_("too many arguments"));
7071 if (args
->front()->is_error_expression()
7072 || args
->front()->type()->is_error_type())
7074 this->set_is_error();
7080 // Check argument types for a builtin function.
7083 Builtin_call_expression::do_check_types(Gogo
*)
7085 switch (this->code_
)
7087 case BUILTIN_INVALID
:
7095 // The single argument may be either a string or an array or a
7096 // map or a channel, or a pointer to a closed array.
7097 if (this->check_one_arg())
7099 Type
* arg_type
= this->one_arg()->type();
7100 if (arg_type
->points_to() != NULL
7101 && arg_type
->points_to()->array_type() != NULL
7102 && !arg_type
->points_to()->is_open_array_type())
7103 arg_type
= arg_type
->points_to();
7104 if (this->code_
== BUILTIN_CAP
)
7106 if (!arg_type
->is_error_type()
7107 && arg_type
->array_type() == NULL
7108 && arg_type
->channel_type() == NULL
)
7109 this->report_error(_("argument must be array or slice "
7114 if (!arg_type
->is_error_type()
7115 && !arg_type
->is_string_type()
7116 && arg_type
->array_type() == NULL
7117 && arg_type
->map_type() == NULL
7118 && arg_type
->channel_type() == NULL
)
7119 this->report_error(_("argument must be string or "
7120 "array or slice or map or channel"));
7127 case BUILTIN_PRINTLN
:
7129 const Expression_list
* args
= this->args();
7132 if (this->code_
== BUILTIN_PRINT
)
7133 warning_at(this->location(), 0,
7134 "no arguments for builtin function %<%s%>",
7135 (this->code_
== BUILTIN_PRINT
7141 for (Expression_list::const_iterator p
= args
->begin();
7145 Type
* type
= (*p
)->type();
7146 if (type
->is_error_type()
7147 || type
->is_string_type()
7148 || type
->integer_type() != NULL
7149 || type
->float_type() != NULL
7150 || type
->complex_type() != NULL
7151 || type
->is_boolean_type()
7152 || type
->points_to() != NULL
7153 || type
->interface_type() != NULL
7154 || type
->channel_type() != NULL
7155 || type
->map_type() != NULL
7156 || type
->function_type() != NULL
7157 || type
->is_open_array_type())
7160 this->report_error(_("unsupported argument type to "
7161 "builtin function"));
7168 case BUILTIN_CLOSED
:
7169 if (this->check_one_arg())
7171 if (this->one_arg()->type()->channel_type() == NULL
)
7172 this->report_error(_("argument must be channel"));
7177 case BUILTIN_SIZEOF
:
7178 case BUILTIN_ALIGNOF
:
7179 this->check_one_arg();
7182 case BUILTIN_RECOVER
:
7183 if (this->args() != NULL
&& !this->args()->empty())
7184 this->report_error(_("too many arguments"));
7187 case BUILTIN_OFFSETOF
:
7188 if (this->check_one_arg())
7190 Expression
* arg
= this->one_arg();
7191 if (arg
->field_reference_expression() == NULL
)
7192 this->report_error(_("argument must be a field reference"));
7198 const Expression_list
* args
= this->args();
7199 if (args
== NULL
|| args
->size() < 2)
7201 this->report_error(_("not enough arguments"));
7204 else if (args
->size() > 2)
7206 this->report_error(_("too many arguments"));
7209 Type
* arg1_type
= args
->front()->type();
7210 Type
* arg2_type
= args
->back()->type();
7211 if (arg1_type
->is_error_type() || arg2_type
->is_error_type())
7215 if (arg1_type
->is_open_array_type())
7216 e1
= arg1_type
->array_type()->element_type();
7219 this->report_error(_("left argument must be a slice"));
7224 if (arg2_type
->is_open_array_type())
7225 e2
= arg2_type
->array_type()->element_type();
7226 else if (arg2_type
->is_string_type())
7227 e2
= Type::lookup_integer_type("uint8");
7230 this->report_error(_("right argument must be a slice or a string"));
7234 if (!Type::are_identical(e1
, e2
, true, NULL
))
7235 this->report_error(_("element types must be the same"));
7239 case BUILTIN_APPEND
:
7241 const Expression_list
* args
= this->args();
7242 if (args
== NULL
|| args
->empty())
7244 this->report_error(_("not enough arguments"));
7247 /* Lowering varargs should have left us with 2 arguments. */
7248 gcc_assert(args
->size() == 2);
7250 if (!Type::are_assignable(args
->front()->type(), args
->back()->type(),
7254 this->report_error(_("arguments 1 and 2 have different types"));
7257 error_at(this->location(),
7258 "arguments 1 and 2 have different types (%s)",
7260 this->set_is_error();
7268 if (this->check_one_arg())
7270 if (this->one_arg()->type()->complex_type() == NULL
)
7271 this->report_error(_("argument must have complex type"));
7277 const Expression_list
* args
= this->args();
7278 if (args
== NULL
|| args
->size() < 2)
7279 this->report_error(_("not enough arguments"));
7280 else if (args
->size() > 2)
7281 this->report_error(_("too many arguments"));
7282 else if (args
->front()->is_error_expression()
7283 || args
->front()->type()->is_error_type()
7284 || args
->back()->is_error_expression()
7285 || args
->back()->type()->is_error_type())
7286 this->set_is_error();
7287 else if (!Type::are_identical(args
->front()->type(),
7288 args
->back()->type(), true, NULL
))
7289 this->report_error(_("cmplx arguments must have identical types"));
7290 else if (args
->front()->type()->float_type() == NULL
)
7291 this->report_error(_("cmplx arguments must have "
7292 "floating-point type"));
7301 // Return the tree for a builtin function.
7304 Builtin_call_expression::do_get_tree(Translate_context
* context
)
7306 Gogo
* gogo
= context
->gogo();
7307 source_location location
= this->location();
7308 switch (this->code_
)
7310 case BUILTIN_INVALID
:
7318 const Expression_list
* args
= this->args();
7319 gcc_assert(args
!= NULL
&& args
->size() == 1);
7320 Expression
* arg
= *args
->begin();
7321 Type
* arg_type
= arg
->type();
7322 tree arg_tree
= arg
->get_tree(context
);
7323 if (arg_tree
== error_mark_node
)
7324 return error_mark_node
;
7326 if (arg_type
->points_to() != NULL
)
7328 arg_type
= arg_type
->points_to();
7329 gcc_assert(arg_type
->array_type() != NULL
7330 && !arg_type
->is_open_array_type());
7331 gcc_assert(POINTER_TYPE_P(TREE_TYPE(arg_tree
)));
7332 arg_tree
= build_fold_indirect_ref(arg_tree
);
7336 if (this->code_
== BUILTIN_LEN
)
7338 if (arg_type
->is_string_type())
7339 val_tree
= String_type::length_tree(gogo
, arg_tree
);
7340 else if (arg_type
->array_type() != NULL
)
7341 val_tree
= arg_type
->array_type()->length_tree(gogo
, arg_tree
);
7342 else if (arg_type
->map_type() != NULL
)
7344 static tree map_len_fndecl
;
7345 val_tree
= Gogo::call_builtin(&map_len_fndecl
,
7350 arg_type
->get_tree(gogo
),
7353 else if (arg_type
->channel_type() != NULL
)
7355 static tree chan_len_fndecl
;
7356 val_tree
= Gogo::call_builtin(&chan_len_fndecl
,
7361 arg_type
->get_tree(gogo
),
7369 if (arg_type
->array_type() != NULL
)
7370 val_tree
= arg_type
->array_type()->capacity_tree(gogo
, arg_tree
);
7371 else if (arg_type
->channel_type() != NULL
)
7373 static tree chan_cap_fndecl
;
7374 val_tree
= Gogo::call_builtin(&chan_cap_fndecl
,
7379 arg_type
->get_tree(gogo
),
7386 if (val_tree
== error_mark_node
)
7387 return error_mark_node
;
7389 tree type_tree
= Type::lookup_integer_type("int")->get_tree(gogo
);
7390 if (type_tree
== TREE_TYPE(val_tree
))
7393 return fold(convert_to_integer(type_tree
, val_tree
));
7397 case BUILTIN_PRINTLN
:
7399 const bool is_ln
= this->code_
== BUILTIN_PRINTLN
;
7400 tree stmt_list
= NULL_TREE
;
7402 const Expression_list
* call_args
= this->args();
7403 if (call_args
!= NULL
)
7405 for (Expression_list::const_iterator p
= call_args
->begin();
7406 p
!= call_args
->end();
7409 if (is_ln
&& p
!= call_args
->begin())
7411 static tree print_space_fndecl
;
7412 tree call
= Gogo::call_builtin(&print_space_fndecl
,
7417 append_to_statement_list(call
, &stmt_list
);
7420 Type
* type
= (*p
)->type();
7422 tree arg
= (*p
)->get_tree(context
);
7423 if (arg
== error_mark_node
)
7424 return error_mark_node
;
7428 if (type
->is_string_type())
7430 static tree print_string_fndecl
;
7431 pfndecl
= &print_string_fndecl
;
7432 fnname
= "__go_print_string";
7434 else if (type
->integer_type() != NULL
7435 && type
->integer_type()->is_unsigned())
7437 static tree print_uint64_fndecl
;
7438 pfndecl
= &print_uint64_fndecl
;
7439 fnname
= "__go_print_uint64";
7440 Type
* itype
= Type::lookup_integer_type("uint64");
7441 arg
= fold_convert_loc(location
, itype
->get_tree(gogo
),
7444 else if (type
->integer_type() != NULL
)
7446 static tree print_int64_fndecl
;
7447 pfndecl
= &print_int64_fndecl
;
7448 fnname
= "__go_print_int64";
7449 Type
* itype
= Type::lookup_integer_type("int64");
7450 arg
= fold_convert_loc(location
, itype
->get_tree(gogo
),
7453 else if (type
->float_type() != NULL
)
7455 static tree print_double_fndecl
;
7456 pfndecl
= &print_double_fndecl
;
7457 fnname
= "__go_print_double";
7458 arg
= fold_convert_loc(location
, double_type_node
, arg
);
7460 else if (type
->complex_type() != NULL
)
7462 static tree print_complex_fndecl
;
7463 pfndecl
= &print_complex_fndecl
;
7464 fnname
= "__go_print_complex";
7465 arg
= fold_convert_loc(location
, complex_double_type_node
,
7468 else if (type
->is_boolean_type())
7470 static tree print_bool_fndecl
;
7471 pfndecl
= &print_bool_fndecl
;
7472 fnname
= "__go_print_bool";
7474 else if (type
->points_to() != NULL
7475 || type
->channel_type() != NULL
7476 || type
->map_type() != NULL
7477 || type
->function_type() != NULL
)
7479 static tree print_pointer_fndecl
;
7480 pfndecl
= &print_pointer_fndecl
;
7481 fnname
= "__go_print_pointer";
7482 arg
= fold_convert_loc(location
, ptr_type_node
, arg
);
7484 else if (type
->interface_type() != NULL
)
7486 if (type
->interface_type()->is_empty())
7488 static tree print_empty_interface_fndecl
;
7489 pfndecl
= &print_empty_interface_fndecl
;
7490 fnname
= "__go_print_empty_interface";
7494 static tree print_interface_fndecl
;
7495 pfndecl
= &print_interface_fndecl
;
7496 fnname
= "__go_print_interface";
7499 else if (type
->is_open_array_type())
7501 static tree print_slice_fndecl
;
7502 pfndecl
= &print_slice_fndecl
;
7503 fnname
= "__go_print_slice";
7508 tree call
= Gogo::call_builtin(pfndecl
,
7515 if (call
!= error_mark_node
)
7516 append_to_statement_list(call
, &stmt_list
);
7522 static tree print_nl_fndecl
;
7523 tree call
= Gogo::call_builtin(&print_nl_fndecl
,
7528 append_to_statement_list(call
, &stmt_list
);
7536 const Expression_list
* args
= this->args();
7537 gcc_assert(args
!= NULL
&& args
->size() == 1);
7538 Expression
* arg
= args
->front();
7539 tree arg_tree
= arg
->get_tree(context
);
7540 if (arg_tree
== error_mark_node
)
7541 return error_mark_node
;
7542 Type
*empty
= Type::make_interface_type(NULL
, BUILTINS_LOCATION
);
7543 arg_tree
= Expression::convert_for_assignment(context
, empty
,
7545 arg_tree
, location
);
7546 static tree panic_fndecl
;
7547 tree call
= Gogo::call_builtin(&panic_fndecl
,
7552 TREE_TYPE(arg_tree
),
7554 // This function will throw an exception.
7555 TREE_NOTHROW(panic_fndecl
) = 0;
7556 // This function will not return.
7557 TREE_THIS_VOLATILE(panic_fndecl
) = 1;
7561 case BUILTIN_RECOVER
:
7563 // The argument is set when building recover thunks. It's a
7564 // boolean value which is true if we can recover a value now.
7565 const Expression_list
* args
= this->args();
7566 gcc_assert(args
!= NULL
&& args
->size() == 1);
7567 Expression
* arg
= args
->front();
7568 tree arg_tree
= arg
->get_tree(context
);
7569 if (arg_tree
== error_mark_node
)
7570 return error_mark_node
;
7572 Type
*empty
= Type::make_interface_type(NULL
, BUILTINS_LOCATION
);
7573 tree empty_tree
= empty
->get_tree(context
->gogo());
7575 Type
* nil_type
= Type::make_nil_type();
7576 Expression
* nil
= Expression::make_nil(location
);
7577 tree nil_tree
= nil
->get_tree(context
);
7578 tree empty_nil_tree
= Expression::convert_for_assignment(context
,
7584 // We need to handle a deferred call to recover specially,
7585 // because it changes whether it can recover a panic or not.
7586 // See test7 in test/recover1.go.
7588 if (this->is_deferred())
7590 static tree deferred_recover_fndecl
;
7591 call
= Gogo::call_builtin(&deferred_recover_fndecl
,
7593 "__go_deferred_recover",
7599 static tree recover_fndecl
;
7600 call
= Gogo::call_builtin(&recover_fndecl
,
7606 return fold_build3_loc(location
, COND_EXPR
, empty_tree
, arg_tree
,
7607 call
, empty_nil_tree
);
7611 case BUILTIN_CLOSED
:
7613 const Expression_list
* args
= this->args();
7614 gcc_assert(args
!= NULL
&& args
->size() == 1);
7615 Expression
* arg
= args
->front();
7616 tree arg_tree
= arg
->get_tree(context
);
7617 if (arg_tree
== error_mark_node
)
7618 return error_mark_node
;
7619 if (this->code_
== BUILTIN_CLOSE
)
7621 static tree close_fndecl
;
7622 return Gogo::call_builtin(&close_fndecl
,
7624 "__go_builtin_close",
7627 TREE_TYPE(arg_tree
),
7632 static tree closed_fndecl
;
7633 return Gogo::call_builtin(&closed_fndecl
,
7635 "__go_builtin_closed",
7638 TREE_TYPE(arg_tree
),
7643 case BUILTIN_SIZEOF
:
7644 case BUILTIN_OFFSETOF
:
7645 case BUILTIN_ALIGNOF
:
7650 bool b
= this->integer_constant_value(true, val
, &dummy
);
7652 tree type
= Type::lookup_integer_type("int")->get_tree(gogo
);
7653 tree ret
= Expression::integer_constant_tree(val
, type
);
7660 const Expression_list
* args
= this->args();
7661 gcc_assert(args
!= NULL
&& args
->size() == 2);
7662 Expression
* arg1
= args
->front();
7663 Expression
* arg2
= args
->back();
7665 tree arg1_tree
= arg1
->get_tree(context
);
7666 tree arg2_tree
= arg2
->get_tree(context
);
7667 if (arg1_tree
== error_mark_node
|| arg2_tree
== error_mark_node
)
7668 return error_mark_node
;
7670 Type
* arg1_type
= arg1
->type();
7671 Array_type
* at
= arg1_type
->array_type();
7672 arg1_tree
= save_expr(arg1_tree
);
7673 tree arg1_val
= at
->value_pointer_tree(gogo
, arg1_tree
);
7674 tree arg1_len
= at
->length_tree(gogo
, arg1_tree
);
7675 if (arg1_val
== error_mark_node
|| arg1_len
== error_mark_node
)
7676 return error_mark_node
;
7678 Type
* arg2_type
= arg2
->type();
7681 if (arg2_type
->is_open_array_type())
7683 at
= arg2_type
->array_type();
7684 arg2_tree
= save_expr(arg2_tree
);
7685 arg2_val
= at
->value_pointer_tree(gogo
, arg2_tree
);
7686 arg2_len
= at
->length_tree(gogo
, arg2_tree
);
7690 arg2_tree
= save_expr(arg2_tree
);
7691 arg2_val
= String_type::bytes_tree(gogo
, arg2_tree
);
7692 arg2_len
= String_type::length_tree(gogo
, arg2_tree
);
7694 if (arg2_val
== error_mark_node
|| arg2_len
== error_mark_node
)
7695 return error_mark_node
;
7697 arg1_len
= save_expr(arg1_len
);
7698 arg2_len
= save_expr(arg2_len
);
7699 tree len
= fold_build3_loc(location
, COND_EXPR
, TREE_TYPE(arg1_len
),
7700 fold_build2_loc(location
, LT_EXPR
,
7702 arg1_len
, arg2_len
),
7703 arg1_len
, arg2_len
);
7704 len
= save_expr(len
);
7706 Type
* element_type
= at
->element_type();
7707 tree element_type_tree
= element_type
->get_tree(gogo
);
7708 if (element_type_tree
== error_mark_node
)
7709 return error_mark_node
;
7710 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
7711 tree bytecount
= fold_convert_loc(location
, TREE_TYPE(element_size
),
7713 bytecount
= fold_build2_loc(location
, MULT_EXPR
,
7714 TREE_TYPE(element_size
),
7715 bytecount
, element_size
);
7716 bytecount
= fold_convert_loc(location
, size_type_node
, bytecount
);
7718 tree call
= build_call_expr_loc(location
,
7719 built_in_decls
[BUILT_IN_MEMMOVE
],
7720 3, arg1_val
, arg2_val
, bytecount
);
7722 return fold_build2_loc(location
, COMPOUND_EXPR
, TREE_TYPE(len
),
7726 case BUILTIN_APPEND
:
7728 const Expression_list
* args
= this->args();
7729 gcc_assert(args
!= NULL
&& args
->size() == 2);
7730 Expression
* arg1
= args
->front();
7731 Expression
* arg2
= args
->back();
7733 tree arg1_tree
= arg1
->get_tree(context
);
7734 tree arg2_tree
= arg2
->get_tree(context
);
7735 if (arg1_tree
== error_mark_node
|| arg2_tree
== error_mark_node
)
7736 return error_mark_node
;
7738 tree descriptor_tree
= arg1
->type()->type_descriptor_pointer(gogo
);
7740 // We rebuild the decl each time since the slice types may
7742 tree append_fndecl
= NULL_TREE
;
7743 return Gogo::call_builtin(&append_fndecl
,
7747 TREE_TYPE(arg1_tree
),
7748 TREE_TYPE(descriptor_tree
),
7750 TREE_TYPE(arg1_tree
),
7752 TREE_TYPE(arg2_tree
),
7759 const Expression_list
* args
= this->args();
7760 gcc_assert(args
!= NULL
&& args
->size() == 1);
7761 Expression
* arg
= args
->front();
7762 tree arg_tree
= arg
->get_tree(context
);
7763 if (arg_tree
== error_mark_node
)
7764 return error_mark_node
;
7765 gcc_assert(COMPLEX_FLOAT_TYPE_P(TREE_TYPE(arg_tree
)));
7766 if (this->code_
== BUILTIN_REAL
)
7767 return fold_build1_loc(location
, REALPART_EXPR
,
7768 TREE_TYPE(TREE_TYPE(arg_tree
)),
7771 return fold_build1_loc(location
, IMAGPART_EXPR
,
7772 TREE_TYPE(TREE_TYPE(arg_tree
)),
7778 const Expression_list
* args
= this->args();
7779 gcc_assert(args
!= NULL
&& args
->size() == 2);
7780 tree r
= args
->front()->get_tree(context
);
7781 tree i
= args
->back()->get_tree(context
);
7782 if (r
== error_mark_node
|| i
== error_mark_node
)
7783 return error_mark_node
;
7784 gcc_assert(TYPE_MAIN_VARIANT(TREE_TYPE(r
))
7785 == TYPE_MAIN_VARIANT(TREE_TYPE(i
)));
7786 gcc_assert(SCALAR_FLOAT_TYPE_P(TREE_TYPE(r
)));
7787 return fold_build2_loc(location
, COMPLEX_EXPR
,
7788 build_complex_type(TREE_TYPE(r
)),
7797 // We have to support exporting a builtin call expression, because
7798 // code can set a constant to the result of a builtin expression.
7801 Builtin_call_expression::do_export(Export
* exp
) const
7808 if (this->integer_constant_value(true, val
, &dummy
))
7810 Integer_expression::export_integer(exp
, val
);
7819 if (this->float_constant_value(fval
, &dummy
))
7821 Float_expression::export_float(exp
, fval
);
7833 if (this->complex_constant_value(real
, imag
, &dummy
))
7835 Complex_expression::export_complex(exp
, real
, imag
);
7844 error_at(this->location(), "value is not constant");
7848 // A trailing space lets us reliably identify the end of the number.
7849 exp
->write_c_string(" ");
7852 // Class Call_expression.
7857 Call_expression::do_traverse(Traverse
* traverse
)
7859 if (Expression::traverse(&this->fn_
, traverse
) == TRAVERSE_EXIT
)
7860 return TRAVERSE_EXIT
;
7861 if (this->args_
!= NULL
)
7863 if (this->args_
->traverse(traverse
) == TRAVERSE_EXIT
)
7864 return TRAVERSE_EXIT
;
7866 return TRAVERSE_CONTINUE
;
7869 // Lower a call statement.
7872 Call_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
7874 // A type case can look like a function call.
7875 if (this->fn_
->is_type_expression()
7876 && this->args_
!= NULL
7877 && this->args_
->size() == 1)
7878 return Expression::make_cast(this->fn_
->type(), this->args_
->front(),
7881 // Recognize a call to a builtin function.
7882 Func_expression
* fne
= this->fn_
->func_expression();
7884 && fne
->named_object()->is_function_declaration()
7885 && fne
->named_object()->func_declaration_value()->type()->is_builtin())
7886 return new Builtin_call_expression(gogo
, this->fn_
, this->args_
,
7887 this->is_varargs_
, this->location());
7889 // Handle an argument which is a call to a function which returns
7890 // multiple results.
7891 if (this->args_
!= NULL
7892 && this->args_
->size() == 1
7893 && this->args_
->front()->call_expression() != NULL
7894 && this->fn_
->type()->function_type() != NULL
)
7896 Function_type
* fntype
= this->fn_
->type()->function_type();
7897 size_t rc
= this->args_
->front()->call_expression()->result_count();
7899 && fntype
->parameters() != NULL
7900 && (fntype
->parameters()->size() == rc
7901 || (fntype
->is_varargs()
7902 && fntype
->parameters()->size() - 1 <= rc
)))
7904 Call_expression
* call
= this->args_
->front()->call_expression();
7905 Expression_list
* args
= new Expression_list
;
7906 for (size_t i
= 0; i
< rc
; ++i
)
7907 args
->push_back(Expression::make_call_result(call
, i
));
7908 // We can't return a new call expression here, because this
7909 // one may be referenced by Call_result expressions. FIXME.
7915 // Handle a call to a varargs function by packaging up the extra
7917 if (this->fn_
->type()->function_type() != NULL
7918 && this->fn_
->type()->function_type()->is_varargs())
7920 Function_type
* fntype
= this->fn_
->type()->function_type();
7921 const Typed_identifier_list
* parameters
= fntype
->parameters();
7922 gcc_assert(parameters
!= NULL
&& !parameters
->empty());
7923 Type
* varargs_type
= parameters
->back().type();
7924 return this->lower_varargs(gogo
, function
, varargs_type
,
7925 parameters
->size());
7931 // Lower a call to a varargs function. FUNCTION is the function in
7932 // which the call occurs--it's not the function we are calling.
7933 // VARARGS_TYPE is the type of the varargs parameter, a slice type.
7934 // PARAM_COUNT is the number of parameters of the function we are
7935 // calling; the last of these parameters will be the varargs
7939 Call_expression::lower_varargs(Gogo
* gogo
, Named_object
* function
,
7940 Type
* varargs_type
, size_t param_count
)
7942 if (this->varargs_are_lowered_
)
7945 source_location loc
= this->location();
7947 gcc_assert(param_count
> 0);
7948 gcc_assert(varargs_type
->is_open_array_type());
7950 size_t arg_count
= this->args_
== NULL
? 0 : this->args_
->size();
7951 if (arg_count
< param_count
- 1)
7953 // Not enough arguments; will be caught in check_types.
7957 Expression_list
* old_args
= this->args_
;
7958 Expression_list
* new_args
= new Expression_list();
7959 bool push_empty_arg
= false;
7960 if (old_args
== NULL
|| old_args
->empty())
7962 gcc_assert(param_count
== 1);
7963 push_empty_arg
= true;
7967 Expression_list::const_iterator pa
;
7969 for (pa
= old_args
->begin(); pa
!= old_args
->end(); ++pa
, ++i
)
7971 if (static_cast<size_t>(i
) == param_count
)
7973 new_args
->push_back(*pa
);
7976 // We have reached the varargs parameter.
7978 bool issued_error
= false;
7979 if (pa
== old_args
->end())
7980 push_empty_arg
= true;
7981 else if (pa
+ 1 == old_args
->end() && this->is_varargs_
)
7982 new_args
->push_back(*pa
);
7983 else if (this->is_varargs_
)
7985 this->report_error(_("too many arguments"));
7988 else if (pa
+ 1 == old_args
->end()
7989 && this->is_compatible_varargs_argument(function
, *pa
,
7992 new_args
->push_back(*pa
);
7995 Type
* element_type
= varargs_type
->array_type()->element_type();
7996 Expression_list
* vals
= new Expression_list
;
7997 for (; pa
!= old_args
->end(); ++pa
, ++i
)
7999 // Check types here so that we get a better message.
8000 Type
* patype
= (*pa
)->type();
8001 source_location paloc
= (*pa
)->location();
8002 if (!this->check_argument_type(i
, element_type
, patype
,
8003 paloc
, issued_error
))
8005 vals
->push_back(*pa
);
8008 Expression::make_slice_composite_literal(varargs_type
, vals
, loc
);
8009 new_args
->push_back(val
);
8014 new_args
->push_back(Expression::make_nil(loc
));
8016 // We can't return a new call expression here, because this one may
8017 // be referenced by Call_result expressions. FIXME.
8018 if (old_args
!= NULL
)
8020 this->args_
= new_args
;
8021 this->varargs_are_lowered_
= true;
8023 // Lower all the new subexpressions.
8024 Expression
* ret
= this;
8025 gogo
->lower_expression(function
, &ret
);
8026 gcc_assert(ret
== this);
8030 // Return true if ARG is a varargs argment which should be passed to
8031 // the varargs parameter of type PARAM_TYPE without wrapping. ARG
8032 // will be the last argument passed in the call, and PARAM_TYPE will
8033 // be the type of the last parameter of the varargs function being
8037 Call_expression::is_compatible_varargs_argument(Named_object
* function
,
8042 *issued_error
= false;
8044 Type
* var_type
= NULL
;
8046 // The simple case is passing the varargs parameter of the caller.
8047 Var_expression
* ve
= arg
->var_expression();
8048 if (ve
!= NULL
&& ve
->named_object()->is_variable())
8050 Variable
* var
= ve
->named_object()->var_value();
8051 if (var
->is_varargs_parameter())
8052 var_type
= var
->type();
8055 // The complex case is passing the varargs parameter of some
8056 // enclosing function. This will look like passing down *c.f where
8057 // c is the closure variable and f is a field in the closure.
8058 if (function
!= NULL
8059 && function
->func_value()->needs_closure()
8060 && arg
->classification() == EXPRESSION_UNARY
)
8062 Unary_expression
* ue
= static_cast<Unary_expression
*>(arg
);
8063 if (ue
->op() == OPERATOR_MULT
)
8065 Field_reference_expression
* fre
=
8066 ue
->operand()->deref()->field_reference_expression();
8069 Var_expression
* ve
= fre
->expr()->deref()->var_expression();
8072 Named_object
* no
= ve
->named_object();
8073 Function
* f
= function
->func_value();
8074 if (no
== f
->closure_var())
8076 // At this point we know that this indeed a
8077 // reference to some enclosing variable. Now we
8078 // need to figure out whether that variable is a
8079 // varargs parameter.
8080 Named_object
* enclosing
=
8081 f
->enclosing_var(fre
->field_index());
8082 Variable
* var
= enclosing
->var_value();
8083 if (var
->is_varargs_parameter())
8084 var_type
= var
->type();
8091 if (var_type
== NULL
)
8094 // We only match if the parameter is the same, with an identical
8096 Array_type
* var_at
= var_type
->array_type();
8097 gcc_assert(var_at
!= NULL
);
8098 Array_type
* param_at
= param_type
->array_type();
8099 if (param_at
!= NULL
8100 && Type::are_identical(var_at
->element_type(),
8101 param_at
->element_type(), true, NULL
))
8103 error_at(arg
->location(), "... mismatch: passing ...T as ...");
8104 *issued_error
= true;
8108 // Get the function type. Returns NULL if we don't know the type. If
8109 // this returns NULL, and if_ERROR is true, issues an error.
8112 Call_expression::get_function_type() const
8114 return this->fn_
->type()->function_type();
8117 // Return the number of values which this call will return.
8120 Call_expression::result_count() const
8122 const Function_type
* fntype
= this->get_function_type();
8125 if (fntype
->results() == NULL
)
8127 return fntype
->results()->size();
8130 // Return whether this is a call to the predeclared function recover.
8133 Call_expression::is_recover_call() const
8135 return this->do_is_recover_call();
8138 // Set the argument to the recover function.
8141 Call_expression::set_recover_arg(Expression
* arg
)
8143 this->do_set_recover_arg(arg
);
8146 // Virtual functions also implemented by Builtin_call_expression.
8149 Call_expression::do_is_recover_call() const
8155 Call_expression::do_set_recover_arg(Expression
*)
8163 Call_expression::do_type()
8165 if (this->type_
!= NULL
)
8169 Function_type
* fntype
= this->get_function_type();
8171 return Type::make_error_type();
8173 const Typed_identifier_list
* results
= fntype
->results();
8174 if (results
== NULL
)
8175 ret
= Type::make_void_type();
8176 else if (results
->size() == 1)
8177 ret
= results
->begin()->type();
8179 ret
= Type::make_call_multiple_result_type(this);
8186 // Determine types for a call expression. We can use the function
8187 // parameter types to set the types of the arguments.
8190 Call_expression::do_determine_type(const Type_context
*)
8192 this->fn_
->determine_type_no_context();
8193 Function_type
* fntype
= this->get_function_type();
8194 const Typed_identifier_list
* parameters
= NULL
;
8196 parameters
= fntype
->parameters();
8197 if (this->args_
!= NULL
)
8199 Typed_identifier_list::const_iterator pt
;
8200 if (parameters
!= NULL
)
8201 pt
= parameters
->begin();
8202 for (Expression_list::const_iterator pa
= this->args_
->begin();
8203 pa
!= this->args_
->end();
8206 if (parameters
!= NULL
&& pt
!= parameters
->end())
8208 Type_context
subcontext(pt
->type(), false);
8209 (*pa
)->determine_type(&subcontext
);
8213 (*pa
)->determine_type_no_context();
8218 // Check types for parameter I.
8221 Call_expression::check_argument_type(int i
, const Type
* parameter_type
,
8222 const Type
* argument_type
,
8223 source_location argument_location
,
8227 if (!Type::are_assignable(parameter_type
, argument_type
, &reason
))
8232 error_at(argument_location
, "argument %d has incompatible type", i
);
8234 error_at(argument_location
,
8235 "argument %d has incompatible type (%s)",
8238 this->set_is_error();
8247 Call_expression::do_check_types(Gogo
*)
8249 Function_type
* fntype
= this->get_function_type();
8252 if (!this->fn_
->type()->is_error_type())
8253 this->report_error(_("expected function"));
8257 if (fntype
->is_method())
8259 // We don't support pointers to methods, so the function has to
8260 // be a bound method expression.
8261 Bound_method_expression
* bme
= this->fn_
->bound_method_expression();
8264 this->report_error(_("method call without object"));
8267 Type
* first_arg_type
= bme
->first_argument()->type();
8268 if (first_arg_type
->points_to() == NULL
)
8270 // When passing a value, we need to check that we are
8271 // permitted to copy it.
8273 if (!Type::are_assignable(fntype
->receiver()->type(),
8274 first_arg_type
, &reason
))
8277 this->report_error(_("incompatible type for receiver"));
8280 error_at(this->location(),
8281 "incompatible type for receiver (%s)",
8283 this->set_is_error();
8289 // Note that varargs was handled by the lower_varargs() method, so
8290 // we don't have to worry about it here.
8292 const Typed_identifier_list
* parameters
= fntype
->parameters();
8293 if (this->args_
== NULL
)
8295 if (parameters
!= NULL
&& !parameters
->empty())
8296 this->report_error(_("not enough arguments"));
8298 else if (parameters
== NULL
)
8299 this->report_error(_("too many arguments"));
8303 Typed_identifier_list::const_iterator pt
= parameters
->begin();
8304 for (Expression_list::const_iterator pa
= this->args_
->begin();
8305 pa
!= this->args_
->end();
8308 if (pt
== parameters
->end())
8310 this->report_error(_("too many arguments"));
8313 this->check_argument_type(i
+ 1, pt
->type(), (*pa
)->type(),
8314 (*pa
)->location(), false);
8316 if (pt
!= parameters
->end())
8317 this->report_error(_("not enough arguments"));
8321 // Return whether we have to use a temporary variable to ensure that
8322 // we evaluate this call expression in order. If the call returns no
8323 // results then it will inevitably be executed last. If the call
8324 // returns more than one result then it will be used with Call_result
8325 // expressions. So we only have to use a temporary variable if the
8326 // call returns exactly one result.
8329 Call_expression::do_must_eval_in_order() const
8331 return this->result_count() == 1;
8334 // Get the function and the first argument to use when calling a bound
8338 Call_expression::bound_method_function(Translate_context
* context
,
8339 Bound_method_expression
* bound_method
,
8340 tree
* first_arg_ptr
)
8342 Expression
* first_argument
= bound_method
->first_argument();
8343 tree first_arg
= first_argument
->get_tree(context
);
8344 if (first_arg
== error_mark_node
)
8345 return error_mark_node
;
8347 // We always pass a pointer to the first argument when calling a
8349 if (first_argument
->type()->points_to() == NULL
)
8351 tree pointer_to_arg_type
= build_pointer_type(TREE_TYPE(first_arg
));
8352 if (TREE_ADDRESSABLE(TREE_TYPE(first_arg
))
8353 || DECL_P(first_arg
)
8354 || TREE_CODE(first_arg
) == INDIRECT_REF
8355 || TREE_CODE(first_arg
) == COMPONENT_REF
)
8357 first_arg
= build_fold_addr_expr(first_arg
);
8358 if (DECL_P(first_arg
))
8359 TREE_ADDRESSABLE(first_arg
) = 1;
8363 tree tmp
= create_tmp_var(TREE_TYPE(first_arg
),
8364 get_name(first_arg
));
8365 DECL_IGNORED_P(tmp
) = 0;
8366 DECL_INITIAL(tmp
) = first_arg
;
8367 first_arg
= build2(COMPOUND_EXPR
, pointer_to_arg_type
,
8368 build1(DECL_EXPR
, void_type_node
, tmp
),
8369 build_fold_addr_expr(tmp
));
8370 TREE_ADDRESSABLE(tmp
) = 1;
8372 if (first_arg
== error_mark_node
)
8373 return error_mark_node
;
8376 Type
* fatype
= bound_method
->first_argument_type();
8379 if (fatype
->points_to() == NULL
)
8380 fatype
= Type::make_pointer_type(fatype
);
8381 first_arg
= fold_convert(fatype
->get_tree(context
->gogo()), first_arg
);
8382 if (first_arg
== error_mark_node
8383 || TREE_TYPE(first_arg
) == error_mark_node
)
8384 return error_mark_node
;
8387 *first_arg_ptr
= first_arg
;
8389 return bound_method
->method()->get_tree(context
);
8392 // Get the function and the first argument to use when calling an
8393 // interface method.
8396 Call_expression::interface_method_function(
8397 Translate_context
* context
,
8398 Interface_field_reference_expression
* interface_method
,
8399 tree
* first_arg_ptr
)
8401 tree expr
= interface_method
->expr()->get_tree(context
);
8402 if (expr
== error_mark_node
)
8403 return error_mark_node
;
8404 expr
= save_expr(expr
);
8405 tree first_arg
= interface_method
->get_underlying_object_tree(context
, expr
);
8406 if (first_arg
== error_mark_node
)
8407 return error_mark_node
;
8408 *first_arg_ptr
= first_arg
;
8409 return interface_method
->get_function_tree(context
, expr
);
8412 // Build the call expression.
8415 Call_expression::do_get_tree(Translate_context
* context
)
8417 if (this->tree_
!= NULL_TREE
)
8420 Function_type
* fntype
= this->get_function_type();
8422 return error_mark_node
;
8424 if (this->fn_
->is_error_expression())
8425 return error_mark_node
;
8427 Gogo
* gogo
= context
->gogo();
8428 source_location location
= this->location();
8430 Func_expression
* func
= this->fn_
->func_expression();
8431 Bound_method_expression
* bound_method
= this->fn_
->bound_method_expression();
8432 Interface_field_reference_expression
* interface_method
=
8433 this->fn_
->interface_field_reference_expression();
8434 const bool has_closure
= func
!= NULL
&& func
->closure() != NULL
;
8435 const bool is_method
= bound_method
!= NULL
|| interface_method
!= NULL
;
8436 gcc_assert(!fntype
->is_method() || is_method
);
8440 if (this->args_
== NULL
|| this->args_
->empty())
8442 nargs
= is_method
? 1 : 0;
8443 args
= nargs
== 0 ? NULL
: new tree
[nargs
];
8447 const Typed_identifier_list
* params
= fntype
->parameters();
8448 gcc_assert(params
!= NULL
);
8450 nargs
= this->args_
->size();
8451 int i
= is_method
? 1 : 0;
8453 args
= new tree
[nargs
];
8455 Typed_identifier_list::const_iterator pp
= params
->begin();
8456 Expression_list::const_iterator pe
;
8457 for (pe
= this->args_
->begin();
8458 pe
!= this->args_
->end();
8461 tree arg_val
= (*pe
)->get_tree(context
);
8462 args
[i
] = Expression::convert_for_assignment(context
,
8467 if (args
[i
] == error_mark_node
)
8468 return error_mark_node
;
8470 gcc_assert(pp
== params
->end());
8471 gcc_assert(i
== nargs
);
8474 tree rettype
= TREE_TYPE(TREE_TYPE(fntype
->get_tree(gogo
)));
8475 if (rettype
== error_mark_node
)
8476 return error_mark_node
;
8480 fn
= func
->get_tree_without_closure(gogo
);
8481 else if (!is_method
)
8482 fn
= this->fn_
->get_tree(context
);
8483 else if (bound_method
!= NULL
)
8484 fn
= this->bound_method_function(context
, bound_method
, &args
[0]);
8485 else if (interface_method
!= NULL
)
8486 fn
= this->interface_method_function(context
, interface_method
, &args
[0]);
8490 if (fn
== error_mark_node
|| TREE_TYPE(fn
) == error_mark_node
)
8491 return error_mark_node
;
8493 // This is to support builtin math functions when using 80387 math.
8495 if (TREE_CODE(fndecl
) == ADDR_EXPR
)
8496 fndecl
= TREE_OPERAND(fndecl
, 0);
8497 tree excess_type
= NULL_TREE
;
8499 && DECL_IS_BUILTIN(fndecl
)
8500 && DECL_BUILT_IN_CLASS(fndecl
) == BUILT_IN_NORMAL
8502 && ((SCALAR_FLOAT_TYPE_P(rettype
)
8503 && SCALAR_FLOAT_TYPE_P(TREE_TYPE(args
[0])))
8504 || (COMPLEX_FLOAT_TYPE_P(rettype
)
8505 && COMPLEX_FLOAT_TYPE_P(TREE_TYPE(args
[0])))))
8507 excess_type
= excess_precision_type(TREE_TYPE(args
[0]));
8508 if (excess_type
!= NULL_TREE
)
8510 tree excess_fndecl
= mathfn_built_in(excess_type
,
8511 DECL_FUNCTION_CODE(fndecl
));
8512 if (excess_fndecl
== NULL_TREE
)
8513 excess_type
= NULL_TREE
;
8516 fn
= build_fold_addr_expr_loc(location
, excess_fndecl
);
8517 for (int i
= 0; i
< nargs
; ++i
)
8518 args
[i
] = ::convert(excess_type
, args
[i
]);
8523 tree ret
= build_call_array(excess_type
!= NULL_TREE
? excess_type
: rettype
,
8527 SET_EXPR_LOCATION(ret
, location
);
8531 tree closure_tree
= func
->closure()->get_tree(context
);
8532 if (closure_tree
!= error_mark_node
)
8533 CALL_EXPR_STATIC_CHAIN(ret
) = closure_tree
;
8536 // If this is a recursive function type which returns itself, as in
8538 // we have used ptr_type_node for the return type. Add a cast here
8539 // to the correct type.
8540 if (TREE_TYPE(ret
) == ptr_type_node
)
8542 tree t
= this->type()->get_tree(gogo
);
8543 ret
= fold_convert_loc(location
, t
, ret
);
8546 if (excess_type
!= NULL_TREE
)
8548 // Calling convert here can undo our excess precision change.
8549 // That may or may not be a bug in convert_to_real.
8550 ret
= build1(NOP_EXPR
, rettype
, ret
);
8553 // If there is more than one result, we will refer to the call
8555 if (fntype
->results() != NULL
&& fntype
->results()->size() > 1)
8556 ret
= save_expr(ret
);
8563 // Make a call expression.
8566 Expression::make_call(Expression
* fn
, Expression_list
* args
, bool is_varargs
,
8567 source_location location
)
8569 return new Call_expression(fn
, args
, is_varargs
, location
);
8572 // A single result from a call which returns multiple results.
8574 class Call_result_expression
: public Expression
8577 Call_result_expression(Call_expression
* call
, unsigned int index
)
8578 : Expression(EXPRESSION_CALL_RESULT
, call
->location()),
8579 call_(call
), index_(index
)
8584 do_traverse(Traverse
*);
8590 do_determine_type(const Type_context
*);
8593 do_check_types(Gogo
*);
8598 return new Call_result_expression(this->call_
->call_expression(),
8603 do_must_eval_in_order() const
8607 do_get_tree(Translate_context
*);
8610 // The underlying call expression.
8612 // Which result we want.
8613 unsigned int index_
;
8616 // Traverse a call result.
8619 Call_result_expression::do_traverse(Traverse
* traverse
)
8621 if (traverse
->remember_expression(this->call_
))
8623 // We have already traversed the call expression.
8624 return TRAVERSE_CONTINUE
;
8626 return Expression::traverse(&this->call_
, traverse
);
8632 Call_result_expression::do_type()
8634 // THIS->CALL_ can be replaced with a temporary reference due to
8635 // Call_expression::do_must_eval_in_order when there is an error.
8636 Call_expression
* ce
= this->call_
->call_expression();
8638 return Type::make_error_type();
8639 Function_type
* fntype
= ce
->get_function_type();
8641 return Type::make_error_type();
8642 const Typed_identifier_list
* results
= fntype
->results();
8643 Typed_identifier_list::const_iterator pr
= results
->begin();
8644 for (unsigned int i
= 0; i
< this->index_
; ++i
)
8646 if (pr
== results
->end())
8647 return Type::make_error_type();
8650 if (pr
== results
->end())
8651 return Type::make_error_type();
8655 // Check the type. This is where we give an error if we're trying to
8656 // extract too many values from a call.
8659 Call_result_expression::do_check_types(Gogo
*)
8662 Call_expression
* ce
= this->call_
->call_expression();
8664 ok
= this->index_
< ce
->result_count();
8667 // This can happen when the call returns a single value but we
8668 // are asking for the second result.
8669 if (this->call_
->is_error_expression())
8674 this->report_error(_("number of results does not match number of values"));
8677 // Determine the type. We have nothing to do here, but the 0 result
8678 // needs to pass down to the caller.
8681 Call_result_expression::do_determine_type(const Type_context
*)
8683 if (this->index_
== 0)
8684 this->call_
->determine_type_no_context();
8690 Call_result_expression::do_get_tree(Translate_context
* context
)
8692 tree call_tree
= this->call_
->get_tree(context
);
8693 if (call_tree
== error_mark_node
)
8694 return error_mark_node
;
8695 gcc_assert(TREE_CODE(TREE_TYPE(call_tree
)) == RECORD_TYPE
);
8696 tree field
= TYPE_FIELDS(TREE_TYPE(call_tree
));
8697 for (unsigned int i
= 0; i
< this->index_
; ++i
)
8699 gcc_assert(field
!= NULL_TREE
);
8700 field
= DECL_CHAIN(field
);
8702 gcc_assert(field
!= NULL_TREE
);
8703 return build3(COMPONENT_REF
, TREE_TYPE(field
), call_tree
, field
, NULL_TREE
);
8706 // Make a reference to a single result of a call which returns
8707 // multiple results.
8710 Expression::make_call_result(Call_expression
* call
, unsigned int index
)
8712 return new Call_result_expression(call
, index
);
8715 // Class Index_expression.
8720 Index_expression::do_traverse(Traverse
* traverse
)
8722 if (Expression::traverse(&this->left_
, traverse
) == TRAVERSE_EXIT
8723 || Expression::traverse(&this->start_
, traverse
) == TRAVERSE_EXIT
8724 || (this->end_
!= NULL
8725 && Expression::traverse(&this->end_
, traverse
) == TRAVERSE_EXIT
))
8726 return TRAVERSE_EXIT
;
8727 return TRAVERSE_CONTINUE
;
8730 // Lower an index expression. This converts the generic index
8731 // expression into an array index, a string index, or a map index.
8734 Index_expression::do_lower(Gogo
*, Named_object
*, int)
8736 source_location location
= this->location();
8737 Expression
* left
= this->left_
;
8738 Expression
* start
= this->start_
;
8739 Expression
* end
= this->end_
;
8741 Type
* type
= left
->type();
8742 if (type
->is_error_type())
8743 return Expression::make_error(location
);
8744 else if (type
->array_type() != NULL
)
8745 return Expression::make_array_index(left
, start
, end
, location
);
8746 else if (type
->points_to() != NULL
8747 && type
->points_to()->array_type() != NULL
8748 && !type
->points_to()->is_open_array_type())
8750 Expression
* deref
= Expression::make_unary(OPERATOR_MULT
, left
,
8752 return Expression::make_array_index(deref
, start
, end
, location
);
8754 else if (type
->is_string_type())
8755 return Expression::make_string_index(left
, start
, end
, location
);
8756 else if (type
->map_type() != NULL
)
8760 error_at(location
, "invalid slice of map");
8761 return Expression::make_error(location
);
8763 Map_index_expression
* ret
= Expression::make_map_index(left
, start
,
8765 if (this->is_lvalue_
)
8766 ret
->set_is_lvalue();
8772 "attempt to index object which is not array, string, or map");
8773 return Expression::make_error(location
);
8777 // Make an index expression.
8780 Expression::make_index(Expression
* left
, Expression
* start
, Expression
* end
,
8781 source_location location
)
8783 return new Index_expression(left
, start
, end
, location
);
8786 // An array index. This is used for both indexing and slicing.
8788 class Array_index_expression
: public Expression
8791 Array_index_expression(Expression
* array
, Expression
* start
,
8792 Expression
* end
, source_location location
)
8793 : Expression(EXPRESSION_ARRAY_INDEX
, location
),
8794 array_(array
), start_(start
), end_(end
), type_(NULL
)
8799 do_traverse(Traverse
*);
8805 do_determine_type(const Type_context
*);
8808 do_check_types(Gogo
*);
8813 return Expression::make_array_index(this->array_
->copy(),
8814 this->start_
->copy(),
8817 : this->end_
->copy()),
8822 do_is_addressable() const;
8825 do_address_taken(bool escapes
)
8826 { this->array_
->address_taken(escapes
); }
8829 do_get_tree(Translate_context
*);
8832 // The array we are getting a value from.
8834 // The start or only index.
8836 // The end index of a slice. This may be NULL for a simple array
8837 // index, or it may be a nil expression for the length of the array.
8839 // The type of the expression.
8843 // Array index traversal.
8846 Array_index_expression::do_traverse(Traverse
* traverse
)
8848 if (Expression::traverse(&this->array_
, traverse
) == TRAVERSE_EXIT
)
8849 return TRAVERSE_EXIT
;
8850 if (Expression::traverse(&this->start_
, traverse
) == TRAVERSE_EXIT
)
8851 return TRAVERSE_EXIT
;
8852 if (this->end_
!= NULL
)
8854 if (Expression::traverse(&this->end_
, traverse
) == TRAVERSE_EXIT
)
8855 return TRAVERSE_EXIT
;
8857 return TRAVERSE_CONTINUE
;
8860 // Return the type of an array index.
8863 Array_index_expression::do_type()
8865 if (this->type_
== NULL
)
8867 Array_type
* type
= this->array_
->type()->array_type();
8869 this->type_
= Type::make_error_type();
8870 else if (this->end_
== NULL
)
8871 this->type_
= type
->element_type();
8872 else if (type
->is_open_array_type())
8874 // A slice of a slice has the same type as the original
8876 this->type_
= this->array_
->type()->deref();
8880 // A slice of an array is a slice.
8881 this->type_
= Type::make_array_type(type
->element_type(), NULL
);
8887 // Set the type of an array index.
8890 Array_index_expression::do_determine_type(const Type_context
*)
8892 this->array_
->determine_type_no_context();
8893 Type_context
subcontext(NULL
, true);
8894 this->start_
->determine_type(&subcontext
);
8895 if (this->end_
!= NULL
)
8896 this->end_
->determine_type(&subcontext
);
8899 // Check types of an array index.
8902 Array_index_expression::do_check_types(Gogo
*)
8904 if (this->start_
->type()->integer_type() == NULL
)
8905 this->report_error(_("index must be integer"));
8906 if (this->end_
!= NULL
8907 && this->end_
->type()->integer_type() == NULL
8908 && !this->end_
->is_nil_expression())
8909 this->report_error(_("slice end must be integer"));
8911 Array_type
* array_type
= this->array_
->type()->array_type();
8912 gcc_assert(array_type
!= NULL
);
8914 unsigned int int_bits
=
8915 Type::lookup_integer_type("int")->integer_type()->bits();
8920 bool lval_valid
= (array_type
->length() != NULL
8921 && array_type
->length()->integer_constant_value(true,
8926 if (this->start_
->integer_constant_value(true, ival
, &dummy
))
8928 if (mpz_sgn(ival
) < 0
8929 || mpz_sizeinbase(ival
, 2) >= int_bits
8931 && (this->end_
== NULL
8932 ? mpz_cmp(ival
, lval
) >= 0
8933 : mpz_cmp(ival
, lval
) > 0)))
8935 error_at(this->start_
->location(), "array index out of bounds");
8936 this->set_is_error();
8939 if (this->end_
!= NULL
&& !this->end_
->is_nil_expression())
8941 if (this->end_
->integer_constant_value(true, ival
, &dummy
))
8943 if (mpz_sgn(ival
) < 0
8944 || mpz_sizeinbase(ival
, 2) >= int_bits
8945 || (lval_valid
&& mpz_cmp(ival
, lval
) > 0))
8947 error_at(this->end_
->location(), "array index out of bounds");
8948 this->set_is_error();
8955 // A slice of an array requires an addressable array. A slice of a
8956 // slice is always possible.
8957 if (this->end_
!= NULL
8958 && !array_type
->is_open_array_type()
8959 && !this->array_
->is_addressable())
8960 this->report_error(_("array is not addressable"));
8963 // Return whether this expression is addressable.
8966 Array_index_expression::do_is_addressable() const
8968 // A slice expression is not addressable.
8969 if (this->end_
!= NULL
)
8972 // An index into a slice is addressable.
8973 if (this->array_
->type()->is_open_array_type())
8976 // An index into an array is addressable if the array is
8978 return this->array_
->is_addressable();
8981 // Get a tree for an array index.
8984 Array_index_expression::do_get_tree(Translate_context
* context
)
8986 Gogo
* gogo
= context
->gogo();
8987 source_location loc
= this->location();
8989 Array_type
* array_type
= this->array_
->type()->array_type();
8990 gcc_assert(array_type
!= NULL
);
8992 tree type_tree
= array_type
->get_tree(gogo
);
8993 if (type_tree
== error_mark_node
)
8994 return error_mark_node
;
8996 tree array_tree
= this->array_
->get_tree(context
);
8997 if (array_tree
== error_mark_node
)
8998 return error_mark_node
;
9000 if (array_type
->length() == NULL
&& !DECL_P(array_tree
))
9001 array_tree
= save_expr(array_tree
);
9002 tree length_tree
= array_type
->length_tree(gogo
, array_tree
);
9003 if (length_tree
== error_mark_node
)
9004 return error_mark_node
;
9005 length_tree
= save_expr(length_tree
);
9006 tree length_type
= TREE_TYPE(length_tree
);
9008 tree bad_index
= boolean_false_node
;
9010 tree start_tree
= this->start_
->get_tree(context
);
9011 if (start_tree
== error_mark_node
)
9012 return error_mark_node
;
9013 if (!DECL_P(start_tree
))
9014 start_tree
= save_expr(start_tree
);
9015 if (!INTEGRAL_TYPE_P(TREE_TYPE(start_tree
)))
9016 start_tree
= convert_to_integer(length_type
, start_tree
);
9018 bad_index
= Expression::check_bounds(start_tree
, length_type
, bad_index
,
9021 start_tree
= fold_convert_loc(loc
, length_type
, start_tree
);
9022 bad_index
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
, bad_index
,
9023 fold_build2_loc(loc
,
9027 boolean_type_node
, start_tree
,
9030 int code
= (array_type
->length() != NULL
9031 ? (this->end_
== NULL
9032 ? RUNTIME_ERROR_ARRAY_INDEX_OUT_OF_BOUNDS
9033 : RUNTIME_ERROR_ARRAY_SLICE_OUT_OF_BOUNDS
)
9034 : (this->end_
== NULL
9035 ? RUNTIME_ERROR_SLICE_INDEX_OUT_OF_BOUNDS
9036 : RUNTIME_ERROR_SLICE_SLICE_OUT_OF_BOUNDS
));
9037 tree crash
= Gogo::runtime_error(code
, loc
);
9039 if (this->end_
== NULL
)
9041 // Simple array indexing. This has to return an l-value, so
9042 // wrap the index check into START_TREE.
9043 start_tree
= build2(COMPOUND_EXPR
, TREE_TYPE(start_tree
),
9044 build3(COND_EXPR
, void_type_node
,
9045 bad_index
, crash
, NULL_TREE
),
9047 start_tree
= fold_convert_loc(loc
, sizetype
, start_tree
);
9049 if (array_type
->length() != NULL
)
9052 return build4(ARRAY_REF
, TREE_TYPE(type_tree
), array_tree
,
9053 start_tree
, NULL_TREE
, NULL_TREE
);
9058 tree values
= array_type
->value_pointer_tree(gogo
, array_tree
);
9059 tree element_type_tree
= array_type
->element_type()->get_tree(gogo
);
9060 if (element_type_tree
== error_mark_node
)
9061 return error_mark_node
;
9062 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
9063 tree offset
= fold_build2_loc(loc
, MULT_EXPR
, sizetype
,
9064 start_tree
, element_size
);
9065 tree ptr
= fold_build2_loc(loc
, POINTER_PLUS_EXPR
,
9066 TREE_TYPE(values
), values
, offset
);
9067 return build_fold_indirect_ref(ptr
);
9073 tree capacity_tree
= array_type
->capacity_tree(gogo
, array_tree
);
9074 if (capacity_tree
== error_mark_node
)
9075 return error_mark_node
;
9076 capacity_tree
= fold_convert_loc(loc
, length_type
, capacity_tree
);
9079 if (this->end_
->is_nil_expression())
9080 end_tree
= length_tree
;
9083 end_tree
= this->end_
->get_tree(context
);
9084 if (end_tree
== error_mark_node
)
9085 return error_mark_node
;
9086 if (!DECL_P(end_tree
))
9087 end_tree
= save_expr(end_tree
);
9088 if (!INTEGRAL_TYPE_P(TREE_TYPE(end_tree
)))
9089 end_tree
= convert_to_integer(length_type
, end_tree
);
9091 bad_index
= Expression::check_bounds(end_tree
, length_type
, bad_index
,
9094 end_tree
= fold_convert_loc(loc
, length_type
, end_tree
);
9096 capacity_tree
= save_expr(capacity_tree
);
9097 tree bad_end
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
9098 fold_build2_loc(loc
, LT_EXPR
,
9100 end_tree
, start_tree
),
9101 fold_build2_loc(loc
, GT_EXPR
,
9103 end_tree
, capacity_tree
));
9104 bad_index
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
9105 bad_index
, bad_end
);
9108 tree element_type_tree
= array_type
->element_type()->get_tree(gogo
);
9109 if (element_type_tree
== error_mark_node
)
9110 return error_mark_node
;
9111 tree element_size
= TYPE_SIZE_UNIT(element_type_tree
);
9113 tree offset
= fold_build2_loc(loc
, MULT_EXPR
, sizetype
,
9114 fold_convert_loc(loc
, sizetype
, start_tree
),
9117 tree value_pointer
= array_type
->value_pointer_tree(gogo
, array_tree
);
9118 if (value_pointer
== error_mark_node
)
9119 return error_mark_node
;
9121 value_pointer
= fold_build2_loc(loc
, POINTER_PLUS_EXPR
,
9122 TREE_TYPE(value_pointer
),
9123 value_pointer
, offset
);
9125 tree result_length_tree
= fold_build2_loc(loc
, MINUS_EXPR
, length_type
,
9126 end_tree
, start_tree
);
9128 tree result_capacity_tree
= fold_build2_loc(loc
, MINUS_EXPR
, length_type
,
9129 capacity_tree
, start_tree
);
9131 tree struct_tree
= this->type()->get_tree(gogo
);
9132 gcc_assert(TREE_CODE(struct_tree
) == RECORD_TYPE
);
9134 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 3);
9136 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
9137 tree field
= TYPE_FIELDS(struct_tree
);
9138 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__values") == 0);
9140 elt
->value
= value_pointer
;
9142 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
9143 field
= DECL_CHAIN(field
);
9144 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__count") == 0);
9146 elt
->value
= fold_convert_loc(loc
, TREE_TYPE(field
), result_length_tree
);
9148 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
9149 field
= DECL_CHAIN(field
);
9150 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__capacity") == 0);
9152 elt
->value
= fold_convert_loc(loc
, TREE_TYPE(field
), result_capacity_tree
);
9154 tree constructor
= build_constructor(struct_tree
, init
);
9156 if (TREE_CONSTANT(value_pointer
)
9157 && TREE_CONSTANT(result_length_tree
)
9158 && TREE_CONSTANT(result_capacity_tree
))
9159 TREE_CONSTANT(constructor
) = 1;
9161 return fold_build2_loc(loc
, COMPOUND_EXPR
, TREE_TYPE(constructor
),
9162 build3(COND_EXPR
, void_type_node
,
9163 bad_index
, crash
, NULL_TREE
),
9167 // Make an array index expression. END may be NULL.
9170 Expression::make_array_index(Expression
* array
, Expression
* start
,
9171 Expression
* end
, source_location location
)
9173 // Taking a slice of a composite literal requires moving the literal
9175 if (end
!= NULL
&& array
->is_composite_literal())
9177 array
= Expression::make_heap_composite(array
, location
);
9178 array
= Expression::make_unary(OPERATOR_MULT
, array
, location
);
9180 return new Array_index_expression(array
, start
, end
, location
);
9183 // A string index. This is used for both indexing and slicing.
9185 class String_index_expression
: public Expression
9188 String_index_expression(Expression
* string
, Expression
* start
,
9189 Expression
* end
, source_location location
)
9190 : Expression(EXPRESSION_STRING_INDEX
, location
),
9191 string_(string
), start_(start
), end_(end
)
9196 do_traverse(Traverse
*);
9202 do_determine_type(const Type_context
*);
9205 do_check_types(Gogo
*);
9210 return Expression::make_string_index(this->string_
->copy(),
9211 this->start_
->copy(),
9214 : this->end_
->copy()),
9219 do_get_tree(Translate_context
*);
9222 // The string we are getting a value from.
9223 Expression
* string_
;
9224 // The start or only index.
9226 // The end index of a slice. This may be NULL for a single index,
9227 // or it may be a nil expression for the length of the string.
9231 // String index traversal.
9234 String_index_expression::do_traverse(Traverse
* traverse
)
9236 if (Expression::traverse(&this->string_
, traverse
) == TRAVERSE_EXIT
)
9237 return TRAVERSE_EXIT
;
9238 if (Expression::traverse(&this->start_
, traverse
) == TRAVERSE_EXIT
)
9239 return TRAVERSE_EXIT
;
9240 if (this->end_
!= NULL
)
9242 if (Expression::traverse(&this->end_
, traverse
) == TRAVERSE_EXIT
)
9243 return TRAVERSE_EXIT
;
9245 return TRAVERSE_CONTINUE
;
9248 // Return the type of a string index.
9251 String_index_expression::do_type()
9253 if (this->end_
== NULL
)
9254 return Type::lookup_integer_type("uint8");
9256 return Type::make_string_type();
9259 // Determine the type of a string index.
9262 String_index_expression::do_determine_type(const Type_context
*)
9264 this->string_
->determine_type_no_context();
9265 Type_context
subcontext(NULL
, true);
9266 this->start_
->determine_type(&subcontext
);
9267 if (this->end_
!= NULL
)
9268 this->end_
->determine_type(&subcontext
);
9271 // Check types of a string index.
9274 String_index_expression::do_check_types(Gogo
*)
9276 if (this->start_
->type()->integer_type() == NULL
)
9277 this->report_error(_("index must be integer"));
9278 if (this->end_
!= NULL
9279 && this->end_
->type()->integer_type() == NULL
9280 && !this->end_
->is_nil_expression())
9281 this->report_error(_("slice end must be integer"));
9284 bool sval_valid
= this->string_
->string_constant_value(&sval
);
9289 if (this->start_
->integer_constant_value(true, ival
, &dummy
))
9291 if (mpz_sgn(ival
) < 0
9292 || (sval_valid
&& mpz_cmp_ui(ival
, sval
.length()) >= 0))
9294 error_at(this->start_
->location(), "string index out of bounds");
9295 this->set_is_error();
9298 if (this->end_
!= NULL
&& !this->end_
->is_nil_expression())
9300 if (this->end_
->integer_constant_value(true, ival
, &dummy
))
9302 if (mpz_sgn(ival
) < 0
9303 || (sval_valid
&& mpz_cmp_ui(ival
, sval
.length()) > 0))
9305 error_at(this->end_
->location(), "string index out of bounds");
9306 this->set_is_error();
9313 // Get a tree for a string index.
9316 String_index_expression::do_get_tree(Translate_context
* context
)
9318 source_location loc
= this->location();
9320 tree string_tree
= this->string_
->get_tree(context
);
9321 if (string_tree
== error_mark_node
)
9322 return error_mark_node
;
9324 if (this->string_
->type()->points_to() != NULL
)
9325 string_tree
= build_fold_indirect_ref(string_tree
);
9326 if (!DECL_P(string_tree
))
9327 string_tree
= save_expr(string_tree
);
9328 tree string_type
= TREE_TYPE(string_tree
);
9330 tree length_tree
= String_type::length_tree(context
->gogo(), string_tree
);
9331 length_tree
= save_expr(length_tree
);
9332 tree length_type
= TREE_TYPE(length_tree
);
9334 tree bad_index
= boolean_false_node
;
9336 tree start_tree
= this->start_
->get_tree(context
);
9337 if (start_tree
== error_mark_node
)
9338 return error_mark_node
;
9339 if (!DECL_P(start_tree
))
9340 start_tree
= save_expr(start_tree
);
9341 if (!INTEGRAL_TYPE_P(TREE_TYPE(start_tree
)))
9342 start_tree
= convert_to_integer(length_type
, start_tree
);
9344 bad_index
= Expression::check_bounds(start_tree
, length_type
, bad_index
,
9347 start_tree
= fold_convert_loc(loc
, length_type
, start_tree
);
9349 int code
= (this->end_
== NULL
9350 ? RUNTIME_ERROR_STRING_INDEX_OUT_OF_BOUNDS
9351 : RUNTIME_ERROR_STRING_SLICE_OUT_OF_BOUNDS
);
9352 tree crash
= Gogo::runtime_error(code
, loc
);
9354 if (this->end_
== NULL
)
9356 bad_index
= fold_build2_loc(loc
, TRUTH_OR_EXPR
, boolean_type_node
,
9358 fold_build2_loc(loc
, GE_EXPR
,
9360 start_tree
, length_tree
));
9362 tree bytes_tree
= String_type::bytes_tree(context
->gogo(), string_tree
);
9363 tree ptr
= fold_build2_loc(loc
, POINTER_PLUS_EXPR
, TREE_TYPE(bytes_tree
),
9365 fold_convert_loc(loc
, sizetype
, start_tree
));
9366 tree index
= build_fold_indirect_ref_loc(loc
, ptr
);
9368 return build2(COMPOUND_EXPR
, TREE_TYPE(index
),
9369 build3(COND_EXPR
, void_type_node
,
9370 bad_index
, crash
, NULL_TREE
),
9376 if (this->end_
->is_nil_expression())
9377 end_tree
= build_int_cst(length_type
, -1);
9380 end_tree
= this->end_
->get_tree(context
);
9381 if (end_tree
== error_mark_node
)
9382 return error_mark_node
;
9383 if (!DECL_P(end_tree
))
9384 end_tree
= save_expr(end_tree
);
9385 if (!INTEGRAL_TYPE_P(TREE_TYPE(end_tree
)))
9386 end_tree
= convert_to_integer(length_type
, end_tree
);
9388 bad_index
= Expression::check_bounds(end_tree
, length_type
,
9391 end_tree
= fold_convert_loc(loc
, length_type
, end_tree
);
9394 static tree strslice_fndecl
;
9395 tree ret
= Gogo::call_builtin(&strslice_fndecl
,
9397 "__go_string_slice",
9406 // This will panic if the bounds are out of range for the
9408 TREE_NOTHROW(strslice_fndecl
) = 0;
9410 if (bad_index
== boolean_false_node
)
9413 return build2(COMPOUND_EXPR
, TREE_TYPE(ret
),
9414 build3(COND_EXPR
, void_type_node
,
9415 bad_index
, crash
, NULL_TREE
),
9420 // Make a string index expression. END may be NULL.
9423 Expression::make_string_index(Expression
* string
, Expression
* start
,
9424 Expression
* end
, source_location location
)
9426 return new String_index_expression(string
, start
, end
, location
);
9431 // Get the type of the map.
9434 Map_index_expression::get_map_type() const
9436 Map_type
* mt
= this->map_
->type()->deref()->map_type();
9437 gcc_assert(mt
!= NULL
);
9441 // Map index traversal.
9444 Map_index_expression::do_traverse(Traverse
* traverse
)
9446 if (Expression::traverse(&this->map_
, traverse
) == TRAVERSE_EXIT
)
9447 return TRAVERSE_EXIT
;
9448 return Expression::traverse(&this->index_
, traverse
);
9451 // Return the type of a map index.
9454 Map_index_expression::do_type()
9456 Type
* type
= this->get_map_type()->val_type();
9457 // If this map index is in a tuple assignment, we actually return a
9458 // pointer to the value type. Tuple_map_assignment_statement is
9459 // responsible for handling this correctly. We need to get the type
9460 // right in case this gets assigned to a temporary variable.
9461 if (this->is_in_tuple_assignment_
)
9462 type
= Type::make_pointer_type(type
);
9466 // Fix the type of a map index.
9469 Map_index_expression::do_determine_type(const Type_context
*)
9471 this->map_
->determine_type_no_context();
9472 Type_context
subcontext(this->get_map_type()->key_type(), false);
9473 this->index_
->determine_type(&subcontext
);
9476 // Check types of a map index.
9479 Map_index_expression::do_check_types(Gogo
*)
9482 if (!Type::are_assignable(this->get_map_type()->key_type(),
9483 this->index_
->type(), &reason
))
9486 this->report_error(_("incompatible type for map index"));
9489 error_at(this->location(), "incompatible type for map index (%s)",
9491 this->set_is_error();
9496 // Get a tree for a map index.
9499 Map_index_expression::do_get_tree(Translate_context
* context
)
9501 Map_type
* type
= this->get_map_type();
9503 tree valptr
= this->get_value_pointer(context
, this->is_lvalue_
);
9504 if (valptr
== error_mark_node
)
9505 return error_mark_node
;
9506 valptr
= save_expr(valptr
);
9508 tree val_type_tree
= TREE_TYPE(TREE_TYPE(valptr
));
9510 if (this->is_lvalue_
)
9511 return build_fold_indirect_ref(valptr
);
9512 else if (this->is_in_tuple_assignment_
)
9514 // Tuple_map_assignment_statement is responsible for using this
9520 return fold_build3(COND_EXPR
, val_type_tree
,
9521 fold_build2(EQ_EXPR
, boolean_type_node
, valptr
,
9522 fold_convert(TREE_TYPE(valptr
),
9523 null_pointer_node
)),
9524 type
->val_type()->get_init_tree(context
->gogo(),
9526 build_fold_indirect_ref(valptr
));
9530 // Get a tree for the map index. This returns a tree which evaluates
9531 // to a pointer to a value. The pointer will be NULL if the key is
9535 Map_index_expression::get_value_pointer(Translate_context
* context
,
9538 Map_type
* type
= this->get_map_type();
9540 tree map_tree
= this->map_
->get_tree(context
);
9541 tree index_tree
= this->index_
->get_tree(context
);
9542 index_tree
= Expression::convert_for_assignment(context
, type
->key_type(),
9543 this->index_
->type(),
9546 if (map_tree
== error_mark_node
|| index_tree
== error_mark_node
)
9547 return error_mark_node
;
9549 if (this->map_
->type()->points_to() != NULL
)
9550 map_tree
= build_fold_indirect_ref(map_tree
);
9552 // We need to pass in a pointer to the key, so stuff it into a
9554 tree tmp
= create_tmp_var(TREE_TYPE(index_tree
), get_name(index_tree
));
9555 DECL_IGNORED_P(tmp
) = 0;
9556 DECL_INITIAL(tmp
) = index_tree
;
9557 tree make_tmp
= build1(DECL_EXPR
, void_type_node
, tmp
);
9558 tree tmpref
= fold_convert(const_ptr_type_node
, build_fold_addr_expr(tmp
));
9559 TREE_ADDRESSABLE(tmp
) = 1;
9561 static tree map_index_fndecl
;
9562 tree call
= Gogo::call_builtin(&map_index_fndecl
,
9566 const_ptr_type_node
,
9567 TREE_TYPE(map_tree
),
9569 const_ptr_type_node
,
9574 : boolean_false_node
));
9575 // This can panic on a map of interface type if the interface holds
9576 // an uncomparable or unhashable type.
9577 TREE_NOTHROW(map_index_fndecl
) = 0;
9579 tree val_type_tree
= type
->val_type()->get_tree(context
->gogo());
9580 if (val_type_tree
== error_mark_node
)
9581 return error_mark_node
;
9582 tree ptr_val_type_tree
= build_pointer_type(val_type_tree
);
9584 return build2(COMPOUND_EXPR
, ptr_val_type_tree
,
9586 fold_convert(ptr_val_type_tree
, call
));
9589 // Make a map index expression.
9591 Map_index_expression
*
9592 Expression::make_map_index(Expression
* map
, Expression
* index
,
9593 source_location location
)
9595 return new Map_index_expression(map
, index
, location
);
9598 // Class Field_reference_expression.
9600 // Return the type of a field reference.
9603 Field_reference_expression::do_type()
9605 Struct_type
* struct_type
= this->expr_
->type()->struct_type();
9606 gcc_assert(struct_type
!= NULL
);
9607 return struct_type
->field(this->field_index_
)->type();
9610 // Check the types for a field reference.
9613 Field_reference_expression::do_check_types(Gogo
*)
9615 Struct_type
* struct_type
= this->expr_
->type()->struct_type();
9616 gcc_assert(struct_type
!= NULL
);
9617 gcc_assert(struct_type
->field(this->field_index_
) != NULL
);
9620 // Get a tree for a field reference.
9623 Field_reference_expression::do_get_tree(Translate_context
* context
)
9625 tree struct_tree
= this->expr_
->get_tree(context
);
9626 if (struct_tree
== error_mark_node
9627 || TREE_TYPE(struct_tree
) == error_mark_node
)
9628 return error_mark_node
;
9629 gcc_assert(TREE_CODE(TREE_TYPE(struct_tree
)) == RECORD_TYPE
);
9630 tree field
= TYPE_FIELDS(TREE_TYPE(struct_tree
));
9631 if (field
== NULL_TREE
)
9633 // This can happen for a type which refers to itself indirectly
9634 // and then turns out to be erroneous.
9635 gcc_assert(saw_errors());
9636 return error_mark_node
;
9638 for (unsigned int i
= this->field_index_
; i
> 0; --i
)
9640 field
= DECL_CHAIN(field
);
9641 gcc_assert(field
!= NULL_TREE
);
9643 return build3(COMPONENT_REF
, TREE_TYPE(field
), struct_tree
, field
,
9647 // Make a reference to a qualified identifier in an expression.
9649 Field_reference_expression
*
9650 Expression::make_field_reference(Expression
* expr
, unsigned int field_index
,
9651 source_location location
)
9653 return new Field_reference_expression(expr
, field_index
, location
);
9656 // Class Interface_field_reference_expression.
9658 // Return a tree for the pointer to the function to call.
9661 Interface_field_reference_expression::get_function_tree(Translate_context
*,
9664 if (this->expr_
->type()->points_to() != NULL
)
9665 expr
= build_fold_indirect_ref(expr
);
9667 tree expr_type
= TREE_TYPE(expr
);
9668 gcc_assert(TREE_CODE(expr_type
) == RECORD_TYPE
);
9670 tree field
= TYPE_FIELDS(expr_type
);
9671 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__methods") == 0);
9673 tree table
= build3(COMPONENT_REF
, TREE_TYPE(field
), expr
, field
, NULL_TREE
);
9674 gcc_assert(POINTER_TYPE_P(TREE_TYPE(table
)));
9676 table
= build_fold_indirect_ref(table
);
9677 gcc_assert(TREE_CODE(TREE_TYPE(table
)) == RECORD_TYPE
);
9679 std::string name
= Gogo::unpack_hidden_name(this->name_
);
9680 for (field
= DECL_CHAIN(TYPE_FIELDS(TREE_TYPE(table
)));
9682 field
= DECL_CHAIN(field
))
9684 if (name
== IDENTIFIER_POINTER(DECL_NAME(field
)))
9687 gcc_assert(field
!= NULL_TREE
);
9689 return build3(COMPONENT_REF
, TREE_TYPE(field
), table
, field
, NULL_TREE
);
9692 // Return a tree for the first argument to pass to the interface
9696 Interface_field_reference_expression::get_underlying_object_tree(
9700 if (this->expr_
->type()->points_to() != NULL
)
9701 expr
= build_fold_indirect_ref(expr
);
9703 tree expr_type
= TREE_TYPE(expr
);
9704 gcc_assert(TREE_CODE(expr_type
) == RECORD_TYPE
);
9706 tree field
= DECL_CHAIN(TYPE_FIELDS(expr_type
));
9707 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__object") == 0);
9709 return build3(COMPONENT_REF
, TREE_TYPE(field
), expr
, field
, NULL_TREE
);
9715 Interface_field_reference_expression::do_traverse(Traverse
* traverse
)
9717 return Expression::traverse(&this->expr_
, traverse
);
9720 // Return the type of an interface field reference.
9723 Interface_field_reference_expression::do_type()
9725 Type
* expr_type
= this->expr_
->type();
9727 Type
* points_to
= expr_type
->points_to();
9728 if (points_to
!= NULL
)
9729 expr_type
= points_to
;
9731 Interface_type
* interface_type
= expr_type
->interface_type();
9732 if (interface_type
== NULL
)
9733 return Type::make_error_type();
9735 const Typed_identifier
* method
= interface_type
->find_method(this->name_
);
9737 return Type::make_error_type();
9739 return method
->type();
9745 Interface_field_reference_expression::do_determine_type(const Type_context
*)
9747 this->expr_
->determine_type_no_context();
9750 // Check the types for an interface field reference.
9753 Interface_field_reference_expression::do_check_types(Gogo
*)
9755 Type
* type
= this->expr_
->type();
9757 Type
* points_to
= type
->points_to();
9758 if (points_to
!= NULL
)
9761 Interface_type
* interface_type
= type
->interface_type();
9762 if (interface_type
== NULL
)
9763 this->report_error(_("expected interface or pointer to interface"));
9766 const Typed_identifier
* method
=
9767 interface_type
->find_method(this->name_
);
9770 error_at(this->location(), "method %qs not in interface",
9771 Gogo::message_name(this->name_
).c_str());
9772 this->set_is_error();
9777 // Get a tree for a reference to a field in an interface. There is no
9778 // standard tree type representation for this: it's a function
9779 // attached to its first argument, like a Bound_method_expression.
9780 // The only places it may currently be used are in a Call_expression
9781 // or a Go_statement, which will take it apart directly. So this has
9782 // nothing to do at present.
9785 Interface_field_reference_expression::do_get_tree(Translate_context
*)
9790 // Make a reference to a field in an interface.
9793 Expression::make_interface_field_reference(Expression
* expr
,
9794 const std::string
& field
,
9795 source_location location
)
9797 return new Interface_field_reference_expression(expr
, field
, location
);
9800 // A general selector. This is a Parser_expression for LEFT.NAME. It
9801 // is lowered after we know the type of the left hand side.
9803 class Selector_expression
: public Parser_expression
9806 Selector_expression(Expression
* left
, const std::string
& name
,
9807 source_location location
)
9808 : Parser_expression(EXPRESSION_SELECTOR
, location
),
9809 left_(left
), name_(name
)
9814 do_traverse(Traverse
* traverse
)
9815 { return Expression::traverse(&this->left_
, traverse
); }
9818 do_lower(Gogo
*, Named_object
*, int);
9823 return new Selector_expression(this->left_
->copy(), this->name_
,
9829 lower_method_expression(Gogo
*);
9831 // The expression on the left hand side.
9833 // The name on the right hand side.
9837 // Lower a selector expression once we know the real type of the left
9841 Selector_expression::do_lower(Gogo
* gogo
, Named_object
*, int)
9843 Expression
* left
= this->left_
;
9844 if (left
->is_type_expression())
9845 return this->lower_method_expression(gogo
);
9846 return Type::bind_field_or_method(gogo
, left
->type(), left
, this->name_
,
9850 // Lower a method expression T.M or (*T).M. We turn this into a
9851 // function literal.
9854 Selector_expression::lower_method_expression(Gogo
* gogo
)
9856 source_location location
= this->location();
9857 Type
* type
= this->left_
->type();
9858 const std::string
& name(this->name_
);
9861 if (type
->points_to() == NULL
)
9866 type
= type
->points_to();
9868 Named_type
* nt
= type
->named_type();
9872 ("method expression requires named type or "
9873 "pointer to named type"));
9874 return Expression::make_error(location
);
9878 Method
* method
= nt
->method_function(name
, &is_ambiguous
);
9882 error_at(location
, "type %<%s%> has no method %<%s%>",
9883 nt
->message_name().c_str(),
9884 Gogo::message_name(name
).c_str());
9886 error_at(location
, "method %<%s%> is ambiguous in type %<%s%>",
9887 Gogo::message_name(name
).c_str(),
9888 nt
->message_name().c_str());
9889 return Expression::make_error(location
);
9892 if (!is_pointer
&& !method
->is_value_method())
9894 error_at(location
, "method requires pointer (use %<(*%s).%s)%>",
9895 nt
->message_name().c_str(),
9896 Gogo::message_name(name
).c_str());
9897 return Expression::make_error(location
);
9900 // Build a new function type in which the receiver becomes the first
9902 Function_type
* method_type
= method
->type();
9903 gcc_assert(method_type
->is_method());
9905 const char* const receiver_name
= "$this";
9906 Typed_identifier_list
* parameters
= new Typed_identifier_list();
9907 parameters
->push_back(Typed_identifier(receiver_name
, this->left_
->type(),
9910 const Typed_identifier_list
* method_parameters
= method_type
->parameters();
9911 if (method_parameters
!= NULL
)
9913 for (Typed_identifier_list::const_iterator p
= method_parameters
->begin();
9914 p
!= method_parameters
->end();
9916 parameters
->push_back(*p
);
9919 const Typed_identifier_list
* method_results
= method_type
->results();
9920 Typed_identifier_list
* results
;
9921 if (method_results
== NULL
)
9925 results
= new Typed_identifier_list();
9926 for (Typed_identifier_list::const_iterator p
= method_results
->begin();
9927 p
!= method_results
->end();
9929 results
->push_back(*p
);
9932 Function_type
* fntype
= Type::make_function_type(NULL
, parameters
, results
,
9934 if (method_type
->is_varargs())
9935 fntype
->set_is_varargs();
9937 // We generate methods which always takes a pointer to the receiver
9938 // as their first argument. If this is for a pointer type, we can
9939 // simply reuse the existing function. We use an internal hack to
9940 // get the right type.
9944 Named_object
* mno
= (method
->needs_stub_method()
9945 ? method
->stub_object()
9946 : method
->named_object());
9947 Expression
* f
= Expression::make_func_reference(mno
, NULL
, location
);
9948 f
= Expression::make_cast(fntype
, f
, location
);
9949 Type_conversion_expression
* tce
=
9950 static_cast<Type_conversion_expression
*>(f
);
9951 tce
->set_may_convert_function_types();
9955 Named_object
* no
= gogo
->start_function(Gogo::thunk_name(), fntype
, false,
9958 Named_object
* vno
= gogo
->lookup(receiver_name
, NULL
);
9959 gcc_assert(vno
!= NULL
);
9960 Expression
* ve
= Expression::make_var_reference(vno
, location
);
9961 Expression
* bm
= Type::bind_field_or_method(gogo
, nt
, ve
, name
, location
);
9962 gcc_assert(bm
!= NULL
&& !bm
->is_error_expression());
9964 Expression_list
* args
;
9965 if (method_parameters
== NULL
)
9969 args
= new Expression_list();
9970 for (Typed_identifier_list::const_iterator p
= method_parameters
->begin();
9971 p
!= method_parameters
->end();
9974 vno
= gogo
->lookup(p
->name(), NULL
);
9975 gcc_assert(vno
!= NULL
);
9976 args
->push_back(Expression::make_var_reference(vno
, location
));
9980 Call_expression
* call
= Expression::make_call(bm
, args
,
9981 method_type
->is_varargs(),
9984 size_t count
= call
->result_count();
9987 s
= Statement::make_statement(call
);
9990 Expression_list
* retvals
= new Expression_list();
9992 retvals
->push_back(call
);
9995 for (size_t i
= 0; i
< count
; ++i
)
9996 retvals
->push_back(Expression::make_call_result(call
, i
));
9998 s
= Statement::make_return_statement(no
->func_value()->type()->results(),
10001 gogo
->add_statement(s
);
10003 gogo
->finish_function(location
);
10005 return Expression::make_func_reference(no
, NULL
, location
);
10008 // Make a selector expression.
10011 Expression::make_selector(Expression
* left
, const std::string
& name
,
10012 source_location location
)
10014 return new Selector_expression(left
, name
, location
);
10017 // Implement the builtin function new.
10019 class Allocation_expression
: public Expression
10022 Allocation_expression(Type
* type
, source_location location
)
10023 : Expression(EXPRESSION_ALLOCATION
, location
),
10029 do_traverse(Traverse
* traverse
)
10030 { return Type::traverse(this->type_
, traverse
); }
10034 { return Type::make_pointer_type(this->type_
); }
10037 do_determine_type(const Type_context
*)
10041 do_check_types(Gogo
*);
10045 { return new Allocation_expression(this->type_
, this->location()); }
10048 do_get_tree(Translate_context
*);
10051 // The type we are allocating.
10055 // Check the type of an allocation expression.
10058 Allocation_expression::do_check_types(Gogo
*)
10060 if (this->type_
->function_type() != NULL
)
10061 this->report_error(_("invalid new of function type"));
10064 // Return a tree for an allocation expression.
10067 Allocation_expression::do_get_tree(Translate_context
* context
)
10069 tree type_tree
= this->type_
->get_tree(context
->gogo());
10070 tree size_tree
= TYPE_SIZE_UNIT(type_tree
);
10071 tree space
= context
->gogo()->allocate_memory(this->type_
, size_tree
,
10073 return fold_convert(build_pointer_type(type_tree
), space
);
10076 // Make an allocation expression.
10079 Expression::make_allocation(Type
* type
, source_location location
)
10081 return new Allocation_expression(type
, location
);
10084 // Implement the builtin function make.
10086 class Make_expression
: public Expression
10089 Make_expression(Type
* type
, Expression_list
* args
, source_location location
)
10090 : Expression(EXPRESSION_MAKE
, location
),
10091 type_(type
), args_(args
)
10096 do_traverse(Traverse
* traverse
);
10100 { return this->type_
; }
10103 do_determine_type(const Type_context
*);
10106 do_check_types(Gogo
*);
10111 return new Make_expression(this->type_
, this->args_
->copy(),
10116 do_get_tree(Translate_context
*);
10119 // The type we are making.
10121 // The arguments to pass to the make routine.
10122 Expression_list
* args_
;
10128 Make_expression::do_traverse(Traverse
* traverse
)
10130 if (this->args_
!= NULL
10131 && this->args_
->traverse(traverse
) == TRAVERSE_EXIT
)
10132 return TRAVERSE_EXIT
;
10133 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10134 return TRAVERSE_EXIT
;
10135 return TRAVERSE_CONTINUE
;
10138 // Set types of arguments.
10141 Make_expression::do_determine_type(const Type_context
*)
10143 if (this->args_
!= NULL
)
10145 Type_context
context(Type::lookup_integer_type("int"), false);
10146 for (Expression_list::const_iterator pe
= this->args_
->begin();
10147 pe
!= this->args_
->end();
10149 (*pe
)->determine_type(&context
);
10153 // Check types for a make expression.
10156 Make_expression::do_check_types(Gogo
*)
10158 if (this->type_
->channel_type() == NULL
10159 && this->type_
->map_type() == NULL
10160 && (this->type_
->array_type() == NULL
10161 || this->type_
->array_type()->length() != NULL
))
10162 this->report_error(_("invalid type for make function"));
10163 else if (!this->type_
->check_make_expression(this->args_
, this->location()))
10164 this->set_is_error();
10167 // Return a tree for a make expression.
10170 Make_expression::do_get_tree(Translate_context
* context
)
10172 return this->type_
->make_expression_tree(context
, this->args_
,
10176 // Make a make expression.
10179 Expression::make_make(Type
* type
, Expression_list
* args
,
10180 source_location location
)
10182 return new Make_expression(type
, args
, location
);
10185 // Construct a struct.
10187 class Struct_construction_expression
: public Expression
10190 Struct_construction_expression(Type
* type
, Expression_list
* vals
,
10191 source_location location
)
10192 : Expression(EXPRESSION_STRUCT_CONSTRUCTION
, location
),
10193 type_(type
), vals_(vals
)
10196 // Return whether this is a constant initializer.
10198 is_constant_struct() const;
10202 do_traverse(Traverse
* traverse
);
10206 { return this->type_
; }
10209 do_determine_type(const Type_context
*);
10212 do_check_types(Gogo
*);
10217 return new Struct_construction_expression(this->type_
, this->vals_
->copy(),
10222 do_is_addressable() const
10226 do_get_tree(Translate_context
*);
10229 do_export(Export
*) const;
10232 // The type of the struct to construct.
10234 // The list of values, in order of the fields in the struct. A NULL
10235 // entry means that the field should be zero-initialized.
10236 Expression_list
* vals_
;
10242 Struct_construction_expression::do_traverse(Traverse
* traverse
)
10244 if (this->vals_
!= NULL
10245 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
10246 return TRAVERSE_EXIT
;
10247 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10248 return TRAVERSE_EXIT
;
10249 return TRAVERSE_CONTINUE
;
10252 // Return whether this is a constant initializer.
10255 Struct_construction_expression::is_constant_struct() const
10257 if (this->vals_
== NULL
)
10259 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10260 pv
!= this->vals_
->end();
10264 && !(*pv
)->is_constant()
10265 && (!(*pv
)->is_composite_literal()
10266 || (*pv
)->is_nonconstant_composite_literal()))
10270 const Struct_field_list
* fields
= this->type_
->struct_type()->fields();
10271 for (Struct_field_list::const_iterator pf
= fields
->begin();
10272 pf
!= fields
->end();
10275 // There are no constant constructors for interfaces.
10276 if (pf
->type()->interface_type() != NULL
)
10283 // Final type determination.
10286 Struct_construction_expression::do_determine_type(const Type_context
*)
10288 if (this->vals_
== NULL
)
10290 const Struct_field_list
* fields
= this->type_
->struct_type()->fields();
10291 Expression_list::const_iterator pv
= this->vals_
->begin();
10292 for (Struct_field_list::const_iterator pf
= fields
->begin();
10293 pf
!= fields
->end();
10296 if (pv
== this->vals_
->end())
10300 Type_context
subcontext(pf
->type(), false);
10301 (*pv
)->determine_type(&subcontext
);
10309 Struct_construction_expression::do_check_types(Gogo
*)
10311 if (this->vals_
== NULL
)
10314 Struct_type
* st
= this->type_
->struct_type();
10315 if (this->vals_
->size() > st
->field_count())
10317 this->report_error(_("too many expressions for struct"));
10321 const Struct_field_list
* fields
= st
->fields();
10322 Expression_list::const_iterator pv
= this->vals_
->begin();
10324 for (Struct_field_list::const_iterator pf
= fields
->begin();
10325 pf
!= fields
->end();
10328 if (pv
== this->vals_
->end())
10330 this->report_error(_("too few expressions for struct"));
10337 std::string reason
;
10338 if (!Type::are_assignable(pf
->type(), (*pv
)->type(), &reason
))
10340 if (reason
.empty())
10341 error_at((*pv
)->location(),
10342 "incompatible type for field %d in struct construction",
10345 error_at((*pv
)->location(),
10346 ("incompatible type for field %d in "
10347 "struct construction (%s)"),
10348 i
+ 1, reason
.c_str());
10349 this->set_is_error();
10352 gcc_assert(pv
== this->vals_
->end());
10355 // Return a tree for constructing a struct.
10358 Struct_construction_expression::do_get_tree(Translate_context
* context
)
10360 Gogo
* gogo
= context
->gogo();
10362 if (this->vals_
== NULL
)
10363 return this->type_
->get_init_tree(gogo
, false);
10365 tree type_tree
= this->type_
->get_tree(gogo
);
10366 if (type_tree
== error_mark_node
)
10367 return error_mark_node
;
10368 gcc_assert(TREE_CODE(type_tree
) == RECORD_TYPE
);
10370 bool is_constant
= true;
10371 const Struct_field_list
* fields
= this->type_
->struct_type()->fields();
10372 VEC(constructor_elt
,gc
)* elts
= VEC_alloc(constructor_elt
, gc
,
10374 Struct_field_list::const_iterator pf
= fields
->begin();
10375 Expression_list::const_iterator pv
= this->vals_
->begin();
10376 for (tree field
= TYPE_FIELDS(type_tree
);
10377 field
!= NULL_TREE
;
10378 field
= DECL_CHAIN(field
), ++pf
)
10380 gcc_assert(pf
!= fields
->end());
10383 if (pv
== this->vals_
->end())
10384 val
= pf
->type()->get_init_tree(gogo
, false);
10385 else if (*pv
== NULL
)
10387 val
= pf
->type()->get_init_tree(gogo
, false);
10392 val
= Expression::convert_for_assignment(context
, pf
->type(),
10394 (*pv
)->get_tree(context
),
10399 if (val
== error_mark_node
|| TREE_TYPE(val
) == error_mark_node
)
10400 return error_mark_node
;
10402 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, elts
, NULL
);
10403 elt
->index
= field
;
10405 if (!TREE_CONSTANT(val
))
10406 is_constant
= false;
10408 gcc_assert(pf
== fields
->end());
10410 tree ret
= build_constructor(type_tree
, elts
);
10412 TREE_CONSTANT(ret
) = 1;
10416 // Export a struct construction.
10419 Struct_construction_expression::do_export(Export
* exp
) const
10421 exp
->write_c_string("convert(");
10422 exp
->write_type(this->type_
);
10423 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10424 pv
!= this->vals_
->end();
10427 exp
->write_c_string(", ");
10429 (*pv
)->export_expression(exp
);
10431 exp
->write_c_string(")");
10434 // Make a struct composite literal. This used by the thunk code.
10437 Expression::make_struct_composite_literal(Type
* type
, Expression_list
* vals
,
10438 source_location location
)
10440 gcc_assert(type
->struct_type() != NULL
);
10441 return new Struct_construction_expression(type
, vals
, location
);
10444 // Construct an array. This class is not used directly; instead we
10445 // use the child classes, Fixed_array_construction_expression and
10446 // Open_array_construction_expression.
10448 class Array_construction_expression
: public Expression
10451 Array_construction_expression(Expression_classification classification
,
10452 Type
* type
, Expression_list
* vals
,
10453 source_location location
)
10454 : Expression(classification
, location
),
10455 type_(type
), vals_(vals
)
10459 // Return whether this is a constant initializer.
10461 is_constant_array() const;
10463 // Return the number of elements.
10465 element_count() const
10466 { return this->vals_
== NULL
? 0 : this->vals_
->size(); }
10470 do_traverse(Traverse
* traverse
);
10474 { return this->type_
; }
10477 do_determine_type(const Type_context
*);
10480 do_check_types(Gogo
*);
10483 do_is_addressable() const
10487 do_export(Export
*) const;
10489 // The list of values.
10492 { return this->vals_
; }
10494 // Get a constructor tree for the array values.
10496 get_constructor_tree(Translate_context
* context
, tree type_tree
);
10499 // The type of the array to construct.
10501 // The list of values.
10502 Expression_list
* vals_
;
10508 Array_construction_expression::do_traverse(Traverse
* traverse
)
10510 if (this->vals_
!= NULL
10511 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
10512 return TRAVERSE_EXIT
;
10513 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10514 return TRAVERSE_EXIT
;
10515 return TRAVERSE_CONTINUE
;
10518 // Return whether this is a constant initializer.
10521 Array_construction_expression::is_constant_array() const
10523 if (this->vals_
== NULL
)
10526 // There are no constant constructors for interfaces.
10527 if (this->type_
->array_type()->element_type()->interface_type() != NULL
)
10530 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10531 pv
!= this->vals_
->end();
10535 && !(*pv
)->is_constant()
10536 && (!(*pv
)->is_composite_literal()
10537 || (*pv
)->is_nonconstant_composite_literal()))
10543 // Final type determination.
10546 Array_construction_expression::do_determine_type(const Type_context
*)
10548 if (this->vals_
== NULL
)
10550 Type_context
subcontext(this->type_
->array_type()->element_type(), false);
10551 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10552 pv
!= this->vals_
->end();
10556 (*pv
)->determine_type(&subcontext
);
10563 Array_construction_expression::do_check_types(Gogo
*)
10565 if (this->vals_
== NULL
)
10568 Array_type
* at
= this->type_
->array_type();
10570 Type
* element_type
= at
->element_type();
10571 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10572 pv
!= this->vals_
->end();
10576 && !Type::are_assignable(element_type
, (*pv
)->type(), NULL
))
10578 error_at((*pv
)->location(),
10579 "incompatible type for element %d in composite literal",
10581 this->set_is_error();
10585 Expression
* length
= at
->length();
10586 if (length
!= NULL
)
10591 if (at
->length()->integer_constant_value(true, val
, &type
))
10593 if (this->vals_
->size() > mpz_get_ui(val
))
10594 this->report_error(_("too many elements in composite literal"));
10600 // Get a constructor tree for the array values.
10603 Array_construction_expression::get_constructor_tree(Translate_context
* context
,
10606 VEC(constructor_elt
,gc
)* values
= VEC_alloc(constructor_elt
, gc
,
10607 (this->vals_
== NULL
10609 : this->vals_
->size()));
10610 Type
* element_type
= this->type_
->array_type()->element_type();
10611 bool is_constant
= true;
10612 if (this->vals_
!= NULL
)
10615 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10616 pv
!= this->vals_
->end();
10619 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, values
, NULL
);
10620 elt
->index
= size_int(i
);
10622 elt
->value
= element_type
->get_init_tree(context
->gogo(), false);
10625 tree value_tree
= (*pv
)->get_tree(context
);
10626 elt
->value
= Expression::convert_for_assignment(context
,
10632 if (elt
->value
== error_mark_node
)
10633 return error_mark_node
;
10634 if (!TREE_CONSTANT(elt
->value
))
10635 is_constant
= false;
10639 tree ret
= build_constructor(type_tree
, values
);
10641 TREE_CONSTANT(ret
) = 1;
10645 // Export an array construction.
10648 Array_construction_expression::do_export(Export
* exp
) const
10650 exp
->write_c_string("convert(");
10651 exp
->write_type(this->type_
);
10652 if (this->vals_
!= NULL
)
10654 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10655 pv
!= this->vals_
->end();
10658 exp
->write_c_string(", ");
10660 (*pv
)->export_expression(exp
);
10663 exp
->write_c_string(")");
10666 // Construct a fixed array.
10668 class Fixed_array_construction_expression
:
10669 public Array_construction_expression
10672 Fixed_array_construction_expression(Type
* type
, Expression_list
* vals
,
10673 source_location location
)
10674 : Array_construction_expression(EXPRESSION_FIXED_ARRAY_CONSTRUCTION
,
10675 type
, vals
, location
)
10677 gcc_assert(type
->array_type() != NULL
10678 && type
->array_type()->length() != NULL
);
10685 return new Fixed_array_construction_expression(this->type(),
10686 (this->vals() == NULL
10688 : this->vals()->copy()),
10693 do_get_tree(Translate_context
*);
10696 // Return a tree for constructing a fixed array.
10699 Fixed_array_construction_expression::do_get_tree(Translate_context
* context
)
10701 return this->get_constructor_tree(context
,
10702 this->type()->get_tree(context
->gogo()));
10705 // Construct an open array.
10707 class Open_array_construction_expression
: public Array_construction_expression
10710 Open_array_construction_expression(Type
* type
, Expression_list
* vals
,
10711 source_location location
)
10712 : Array_construction_expression(EXPRESSION_OPEN_ARRAY_CONSTRUCTION
,
10713 type
, vals
, location
)
10715 gcc_assert(type
->array_type() != NULL
10716 && type
->array_type()->length() == NULL
);
10720 // Note that taking the address of an open array literal is invalid.
10725 return new Open_array_construction_expression(this->type(),
10726 (this->vals() == NULL
10728 : this->vals()->copy()),
10733 do_get_tree(Translate_context
*);
10736 // Return a tree for constructing an open array.
10739 Open_array_construction_expression::do_get_tree(Translate_context
* context
)
10741 Type
* element_type
= this->type()->array_type()->element_type();
10742 tree element_type_tree
= element_type
->get_tree(context
->gogo());
10743 if (element_type_tree
== error_mark_node
)
10744 return error_mark_node
;
10748 if (this->vals() == NULL
|| this->vals()->empty())
10750 // We need to create a unique value.
10751 tree max
= size_int(0);
10752 tree constructor_type
= build_array_type(element_type_tree
,
10753 build_index_type(max
));
10754 if (constructor_type
== error_mark_node
)
10755 return error_mark_node
;
10756 VEC(constructor_elt
,gc
)* vec
= VEC_alloc(constructor_elt
, gc
, 1);
10757 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, vec
, NULL
);
10758 elt
->index
= size_int(0);
10759 elt
->value
= element_type
->get_init_tree(context
->gogo(), false);
10760 values
= build_constructor(constructor_type
, vec
);
10761 if (TREE_CONSTANT(elt
->value
))
10762 TREE_CONSTANT(values
) = 1;
10763 length_tree
= size_int(0);
10767 tree max
= size_int(this->vals()->size() - 1);
10768 tree constructor_type
= build_array_type(element_type_tree
,
10769 build_index_type(max
));
10770 if (constructor_type
== error_mark_node
)
10771 return error_mark_node
;
10772 values
= this->get_constructor_tree(context
, constructor_type
);
10773 length_tree
= size_int(this->vals()->size());
10776 if (values
== error_mark_node
)
10777 return error_mark_node
;
10779 bool is_constant_initializer
= TREE_CONSTANT(values
);
10780 bool is_in_function
= context
->function() != NULL
;
10782 if (is_constant_initializer
)
10784 tree tmp
= build_decl(this->location(), VAR_DECL
,
10785 create_tmp_var_name("C"), TREE_TYPE(values
));
10786 DECL_EXTERNAL(tmp
) = 0;
10787 TREE_PUBLIC(tmp
) = 0;
10788 TREE_STATIC(tmp
) = 1;
10789 DECL_ARTIFICIAL(tmp
) = 1;
10790 if (is_in_function
)
10792 // If this is not a function, we will only initialize the
10793 // value once, so we can use this directly rather than
10794 // copying it. In that case we can't make it read-only,
10795 // because the program is permitted to change it.
10796 TREE_READONLY(tmp
) = 1;
10797 TREE_CONSTANT(tmp
) = 1;
10799 DECL_INITIAL(tmp
) = values
;
10800 rest_of_decl_compilation(tmp
, 1, 0);
10806 if (!is_in_function
&& is_constant_initializer
)
10808 // Outside of a function, we know the initializer will only run
10810 space
= build_fold_addr_expr(values
);
10815 tree memsize
= TYPE_SIZE_UNIT(TREE_TYPE(values
));
10816 space
= context
->gogo()->allocate_memory(element_type
, memsize
,
10818 space
= save_expr(space
);
10820 tree s
= fold_convert(build_pointer_type(TREE_TYPE(values
)), space
);
10821 tree ref
= build_fold_indirect_ref_loc(this->location(), s
);
10822 TREE_THIS_NOTRAP(ref
) = 1;
10823 set
= build2(MODIFY_EXPR
, void_type_node
, ref
, values
);
10826 // Build a constructor for the open array.
10828 tree type_tree
= this->type()->get_tree(context
->gogo());
10829 if (type_tree
== error_mark_node
)
10830 return error_mark_node
;
10831 gcc_assert(TREE_CODE(type_tree
) == RECORD_TYPE
);
10833 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 3);
10835 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
10836 tree field
= TYPE_FIELDS(type_tree
);
10837 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__values") == 0);
10838 elt
->index
= field
;
10839 elt
->value
= fold_convert(TREE_TYPE(field
), space
);
10841 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
10842 field
= DECL_CHAIN(field
);
10843 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__count") == 0);
10844 elt
->index
= field
;
10845 elt
->value
= fold_convert(TREE_TYPE(field
), length_tree
);
10847 elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
10848 field
= DECL_CHAIN(field
);
10849 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),"__capacity") == 0);
10850 elt
->index
= field
;
10851 elt
->value
= fold_convert(TREE_TYPE(field
), length_tree
);
10853 tree constructor
= build_constructor(type_tree
, init
);
10854 if (constructor
== error_mark_node
)
10855 return error_mark_node
;
10856 if (!is_in_function
&& is_constant_initializer
)
10857 TREE_CONSTANT(constructor
) = 1;
10859 if (set
== NULL_TREE
)
10860 return constructor
;
10862 return build2(COMPOUND_EXPR
, type_tree
, set
, constructor
);
10865 // Make a slice composite literal. This is used by the type
10866 // descriptor code.
10869 Expression::make_slice_composite_literal(Type
* type
, Expression_list
* vals
,
10870 source_location location
)
10872 gcc_assert(type
->is_open_array_type());
10873 return new Open_array_construction_expression(type
, vals
, location
);
10876 // Construct a map.
10878 class Map_construction_expression
: public Expression
10881 Map_construction_expression(Type
* type
, Expression_list
* vals
,
10882 source_location location
)
10883 : Expression(EXPRESSION_MAP_CONSTRUCTION
, location
),
10884 type_(type
), vals_(vals
)
10885 { gcc_assert(vals
== NULL
|| vals
->size() % 2 == 0); }
10889 do_traverse(Traverse
* traverse
);
10893 { return this->type_
; }
10896 do_determine_type(const Type_context
*);
10899 do_check_types(Gogo
*);
10904 return new Map_construction_expression(this->type_
, this->vals_
->copy(),
10909 do_get_tree(Translate_context
*);
10912 do_export(Export
*) const;
10915 // The type of the map to construct.
10917 // The list of values.
10918 Expression_list
* vals_
;
10924 Map_construction_expression::do_traverse(Traverse
* traverse
)
10926 if (this->vals_
!= NULL
10927 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
10928 return TRAVERSE_EXIT
;
10929 if (Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
10930 return TRAVERSE_EXIT
;
10931 return TRAVERSE_CONTINUE
;
10934 // Final type determination.
10937 Map_construction_expression::do_determine_type(const Type_context
*)
10939 if (this->vals_
== NULL
)
10942 Map_type
* mt
= this->type_
->map_type();
10943 Type_context
key_context(mt
->key_type(), false);
10944 Type_context
val_context(mt
->val_type(), false);
10945 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10946 pv
!= this->vals_
->end();
10949 (*pv
)->determine_type(&key_context
);
10951 (*pv
)->determine_type(&val_context
);
10958 Map_construction_expression::do_check_types(Gogo
*)
10960 if (this->vals_
== NULL
)
10963 Map_type
* mt
= this->type_
->map_type();
10965 Type
* key_type
= mt
->key_type();
10966 Type
* val_type
= mt
->val_type();
10967 for (Expression_list::const_iterator pv
= this->vals_
->begin();
10968 pv
!= this->vals_
->end();
10971 if (!Type::are_assignable(key_type
, (*pv
)->type(), NULL
))
10973 error_at((*pv
)->location(),
10974 "incompatible type for element %d key in map construction",
10976 this->set_is_error();
10979 if (!Type::are_assignable(val_type
, (*pv
)->type(), NULL
))
10981 error_at((*pv
)->location(),
10982 ("incompatible type for element %d value "
10983 "in map construction"),
10985 this->set_is_error();
10990 // Return a tree for constructing a map.
10993 Map_construction_expression::do_get_tree(Translate_context
* context
)
10995 Gogo
* gogo
= context
->gogo();
10996 source_location loc
= this->location();
10998 Map_type
* mt
= this->type_
->map_type();
11000 // Build a struct to hold the key and value.
11001 tree struct_type
= make_node(RECORD_TYPE
);
11003 Type
* key_type
= mt
->key_type();
11004 tree id
= get_identifier("__key");
11005 tree key_field
= build_decl(loc
, FIELD_DECL
, id
, key_type
->get_tree(gogo
));
11006 DECL_CONTEXT(key_field
) = struct_type
;
11007 TYPE_FIELDS(struct_type
) = key_field
;
11009 Type
* val_type
= mt
->val_type();
11010 id
= get_identifier("__val");
11011 tree val_field
= build_decl(loc
, FIELD_DECL
, id
, val_type
->get_tree(gogo
));
11012 DECL_CONTEXT(val_field
) = struct_type
;
11013 DECL_CHAIN(key_field
) = val_field
;
11015 layout_type(struct_type
);
11017 bool is_constant
= true;
11022 if (this->vals_
== NULL
|| this->vals_
->empty())
11024 valaddr
= null_pointer_node
;
11025 make_tmp
= NULL_TREE
;
11029 VEC(constructor_elt
,gc
)* values
= VEC_alloc(constructor_elt
, gc
,
11030 this->vals_
->size() / 2);
11032 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11033 pv
!= this->vals_
->end();
11036 bool one_is_constant
= true;
11038 VEC(constructor_elt
,gc
)* one
= VEC_alloc(constructor_elt
, gc
, 2);
11040 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, one
, NULL
);
11041 elt
->index
= key_field
;
11042 tree val_tree
= (*pv
)->get_tree(context
);
11043 elt
->value
= Expression::convert_for_assignment(context
, key_type
,
11046 if (elt
->value
== error_mark_node
)
11047 return error_mark_node
;
11048 if (!TREE_CONSTANT(elt
->value
))
11049 one_is_constant
= false;
11053 elt
= VEC_quick_push(constructor_elt
, one
, NULL
);
11054 elt
->index
= val_field
;
11055 val_tree
= (*pv
)->get_tree(context
);
11056 elt
->value
= Expression::convert_for_assignment(context
, val_type
,
11059 if (elt
->value
== error_mark_node
)
11060 return error_mark_node
;
11061 if (!TREE_CONSTANT(elt
->value
))
11062 one_is_constant
= false;
11064 elt
= VEC_quick_push(constructor_elt
, values
, NULL
);
11065 elt
->index
= size_int(i
);
11066 elt
->value
= build_constructor(struct_type
, one
);
11067 if (one_is_constant
)
11068 TREE_CONSTANT(elt
->value
) = 1;
11070 is_constant
= false;
11073 tree index_type
= build_index_type(size_int(i
- 1));
11074 tree array_type
= build_array_type(struct_type
, index_type
);
11075 tree init
= build_constructor(array_type
, values
);
11077 TREE_CONSTANT(init
) = 1;
11079 if (current_function_decl
!= NULL
)
11081 tmp
= create_tmp_var(array_type
, get_name(array_type
));
11082 DECL_INITIAL(tmp
) = init
;
11083 make_tmp
= fold_build1_loc(loc
, DECL_EXPR
, void_type_node
, tmp
);
11084 TREE_ADDRESSABLE(tmp
) = 1;
11088 tmp
= build_decl(loc
, VAR_DECL
, create_tmp_var_name("M"), array_type
);
11089 DECL_EXTERNAL(tmp
) = 0;
11090 TREE_PUBLIC(tmp
) = 0;
11091 TREE_STATIC(tmp
) = 1;
11092 DECL_ARTIFICIAL(tmp
) = 1;
11093 if (!TREE_CONSTANT(init
))
11094 make_tmp
= fold_build2_loc(loc
, INIT_EXPR
, void_type_node
, tmp
,
11098 TREE_READONLY(tmp
) = 1;
11099 TREE_CONSTANT(tmp
) = 1;
11100 DECL_INITIAL(tmp
) = init
;
11101 make_tmp
= NULL_TREE
;
11103 rest_of_decl_compilation(tmp
, 1, 0);
11106 valaddr
= build_fold_addr_expr(tmp
);
11109 tree descriptor
= gogo
->map_descriptor(mt
);
11111 tree type_tree
= this->type_
->get_tree(gogo
);
11113 static tree construct_map_fndecl
;
11114 tree call
= Gogo::call_builtin(&construct_map_fndecl
,
11116 "__go_construct_map",
11119 TREE_TYPE(descriptor
),
11124 TYPE_SIZE_UNIT(struct_type
),
11126 byte_position(val_field
),
11128 TYPE_SIZE_UNIT(TREE_TYPE(val_field
)),
11129 const_ptr_type_node
,
11130 fold_convert(const_ptr_type_node
, valaddr
));
11133 if (make_tmp
== NULL
)
11136 ret
= fold_build2_loc(loc
, COMPOUND_EXPR
, type_tree
, make_tmp
, call
);
11140 // Export an array construction.
11143 Map_construction_expression::do_export(Export
* exp
) const
11145 exp
->write_c_string("convert(");
11146 exp
->write_type(this->type_
);
11147 for (Expression_list::const_iterator pv
= this->vals_
->begin();
11148 pv
!= this->vals_
->end();
11151 exp
->write_c_string(", ");
11152 (*pv
)->export_expression(exp
);
11154 exp
->write_c_string(")");
11157 // A general composite literal. This is lowered to a type specific
11160 class Composite_literal_expression
: public Parser_expression
11163 Composite_literal_expression(Type
* type
, int depth
, bool has_keys
,
11164 Expression_list
* vals
, source_location location
)
11165 : Parser_expression(EXPRESSION_COMPOSITE_LITERAL
, location
),
11166 type_(type
), depth_(depth
), vals_(vals
), has_keys_(has_keys
)
11171 do_traverse(Traverse
* traverse
);
11174 do_lower(Gogo
*, Named_object
*, int);
11179 return new Composite_literal_expression(this->type_
, this->depth_
,
11181 (this->vals_
== NULL
11183 : this->vals_
->copy()),
11189 lower_struct(Type
*);
11192 lower_array(Type
*);
11195 make_array(Type
*, Expression_list
*);
11198 lower_map(Gogo
*, Named_object
*, Type
*);
11200 // The type of the composite literal.
11202 // The depth within a list of composite literals within a composite
11203 // literal, when the type is omitted.
11205 // The values to put in the composite literal.
11206 Expression_list
* vals_
;
11207 // If this is true, then VALS_ is a list of pairs: a key and a
11208 // value. In an array initializer, a missing key will be NULL.
11215 Composite_literal_expression::do_traverse(Traverse
* traverse
)
11217 if (this->vals_
!= NULL
11218 && this->vals_
->traverse(traverse
) == TRAVERSE_EXIT
)
11219 return TRAVERSE_EXIT
;
11220 return Type::traverse(this->type_
, traverse
);
11223 // Lower a generic composite literal into a specific version based on
11227 Composite_literal_expression::do_lower(Gogo
* gogo
, Named_object
* function
, int)
11229 Type
* type
= this->type_
;
11231 for (int depth
= this->depth_
; depth
> 0; --depth
)
11233 if (type
->array_type() != NULL
)
11234 type
= type
->array_type()->element_type();
11235 else if (type
->map_type() != NULL
)
11236 type
= type
->map_type()->val_type();
11239 if (!type
->is_error_type())
11240 error_at(this->location(),
11241 ("may only omit types within composite literals "
11242 "of slice, array, or map type"));
11243 return Expression::make_error(this->location());
11247 if (type
->is_error_type())
11248 return Expression::make_error(this->location());
11249 else if (type
->struct_type() != NULL
)
11250 return this->lower_struct(type
);
11251 else if (type
->array_type() != NULL
)
11252 return this->lower_array(type
);
11253 else if (type
->map_type() != NULL
)
11254 return this->lower_map(gogo
, function
, type
);
11257 error_at(this->location(),
11258 ("expected struct, slice, array, or map type "
11259 "for composite literal"));
11260 return Expression::make_error(this->location());
11264 // Lower a struct composite literal.
11267 Composite_literal_expression::lower_struct(Type
* type
)
11269 source_location location
= this->location();
11270 Struct_type
* st
= type
->struct_type();
11271 if (this->vals_
== NULL
|| !this->has_keys_
)
11272 return new Struct_construction_expression(type
, this->vals_
, location
);
11274 size_t field_count
= st
->field_count();
11275 std::vector
<Expression
*> vals(field_count
);
11276 Expression_list::const_iterator p
= this->vals_
->begin();
11277 while (p
!= this->vals_
->end())
11279 Expression
* name_expr
= *p
;
11282 gcc_assert(p
!= this->vals_
->end());
11283 Expression
* val
= *p
;
11287 if (name_expr
== NULL
)
11289 error_at(val
->location(), "mixture of field and value initializers");
11290 return Expression::make_error(location
);
11293 bool bad_key
= false;
11295 switch (name_expr
->classification())
11297 case EXPRESSION_UNKNOWN_REFERENCE
:
11298 name
= name_expr
->unknown_expression()->name();
11301 case EXPRESSION_CONST_REFERENCE
:
11302 name
= static_cast<Const_expression
*>(name_expr
)->name();
11305 case EXPRESSION_TYPE
:
11307 Type
* t
= name_expr
->type();
11308 Named_type
* nt
= t
->named_type();
11316 case EXPRESSION_VAR_REFERENCE
:
11317 name
= name_expr
->var_expression()->name();
11320 case EXPRESSION_FUNC_REFERENCE
:
11321 name
= name_expr
->func_expression()->name();
11324 case EXPRESSION_UNARY
:
11325 // If there is a local variable around with the same name as
11326 // the field, and this occurs in the closure, then the
11327 // parser may turn the field reference into an indirection
11328 // through the closure. FIXME: This is a mess.
11331 Unary_expression
* ue
= static_cast<Unary_expression
*>(name_expr
);
11332 if (ue
->op() == OPERATOR_MULT
)
11334 Field_reference_expression
* fre
=
11335 ue
->operand()->field_reference_expression();
11339 fre
->expr()->type()->deref()->struct_type();
11342 const Struct_field
* sf
= st
->field(fre
->field_index());
11343 name
= sf
->field_name();
11345 snprintf(buf
, sizeof buf
, "%u", fre
->field_index());
11346 size_t buflen
= strlen(buf
);
11347 if (name
.compare(name
.length() - buflen
, buflen
, buf
)
11350 name
= name
.substr(0, name
.length() - buflen
);
11365 error_at(name_expr
->location(), "expected struct field name");
11366 return Expression::make_error(location
);
11369 unsigned int index
;
11370 const Struct_field
* sf
= st
->find_local_field(name
, &index
);
11373 error_at(name_expr
->location(), "unknown field %qs in %qs",
11374 Gogo::message_name(name
).c_str(),
11375 (type
->named_type() != NULL
11376 ? type
->named_type()->message_name().c_str()
11377 : "unnamed struct"));
11378 return Expression::make_error(location
);
11380 if (vals
[index
] != NULL
)
11382 error_at(name_expr
->location(),
11383 "duplicate value for field %qs in %qs",
11384 Gogo::message_name(name
).c_str(),
11385 (type
->named_type() != NULL
11386 ? type
->named_type()->message_name().c_str()
11387 : "unnamed struct"));
11388 return Expression::make_error(location
);
11394 Expression_list
* list
= new Expression_list
;
11395 list
->reserve(field_count
);
11396 for (size_t i
= 0; i
< field_count
; ++i
)
11397 list
->push_back(vals
[i
]);
11399 return new Struct_construction_expression(type
, list
, location
);
11402 // Lower an array composite literal.
11405 Composite_literal_expression::lower_array(Type
* type
)
11407 source_location location
= this->location();
11408 if (this->vals_
== NULL
|| !this->has_keys_
)
11409 return this->make_array(type
, this->vals_
);
11411 std::vector
<Expression
*> vals
;
11412 vals
.reserve(this->vals_
->size());
11413 unsigned long index
= 0;
11414 Expression_list::const_iterator p
= this->vals_
->begin();
11415 while (p
!= this->vals_
->end())
11417 Expression
* index_expr
= *p
;
11420 gcc_assert(p
!= this->vals_
->end());
11421 Expression
* val
= *p
;
11425 if (index_expr
!= NULL
)
11430 if (!index_expr
->integer_constant_value(true, ival
, &dummy
))
11433 error_at(index_expr
->location(),
11434 "index expression is not integer constant");
11435 return Expression::make_error(location
);
11437 if (mpz_sgn(ival
) < 0)
11440 error_at(index_expr
->location(), "index expression is negative");
11441 return Expression::make_error(location
);
11443 index
= mpz_get_ui(ival
);
11444 if (mpz_cmp_ui(ival
, index
) != 0)
11447 error_at(index_expr
->location(), "index value overflow");
11448 return Expression::make_error(location
);
11453 if (index
== vals
.size())
11454 vals
.push_back(val
);
11457 if (index
> vals
.size())
11459 vals
.reserve(index
+ 32);
11460 vals
.resize(index
+ 1, static_cast<Expression
*>(NULL
));
11462 if (vals
[index
] != NULL
)
11464 error_at((index_expr
!= NULL
11465 ? index_expr
->location()
11466 : val
->location()),
11467 "duplicate value for index %lu",
11469 return Expression::make_error(location
);
11477 size_t size
= vals
.size();
11478 Expression_list
* list
= new Expression_list
;
11479 list
->reserve(size
);
11480 for (size_t i
= 0; i
< size
; ++i
)
11481 list
->push_back(vals
[i
]);
11483 return this->make_array(type
, list
);
11486 // Actually build the array composite literal. This handles
11490 Composite_literal_expression::make_array(Type
* type
, Expression_list
* vals
)
11492 source_location location
= this->location();
11493 Array_type
* at
= type
->array_type();
11494 if (at
->length() != NULL
&& at
->length()->is_nil_expression())
11496 size_t size
= vals
== NULL
? 0 : vals
->size();
11498 mpz_init_set_ui(vlen
, size
);
11499 Expression
* elen
= Expression::make_integer(&vlen
, NULL
, location
);
11501 at
= Type::make_array_type(at
->element_type(), elen
);
11504 if (at
->length() != NULL
)
11505 return new Fixed_array_construction_expression(type
, vals
, location
);
11507 return new Open_array_construction_expression(type
, vals
, location
);
11510 // Lower a map composite literal.
11513 Composite_literal_expression::lower_map(Gogo
* gogo
, Named_object
* function
,
11516 source_location location
= this->location();
11517 if (this->vals_
!= NULL
)
11519 if (!this->has_keys_
)
11521 error_at(location
, "map composite literal must have keys");
11522 return Expression::make_error(location
);
11525 for (Expression_list::iterator p
= this->vals_
->begin();
11526 p
!= this->vals_
->end();
11532 error_at((*p
)->location(),
11533 "map composite literal must have keys for every value");
11534 return Expression::make_error(location
);
11536 // Make sure we have lowered the key; it may not have been
11537 // lowered in order to handle keys for struct composite
11538 // literals. Lower it now to get the right error message.
11539 if ((*p
)->unknown_expression() != NULL
)
11541 (*p
)->unknown_expression()->clear_is_composite_literal_key();
11542 gogo
->lower_expression(function
, &*p
);
11543 gcc_assert((*p
)->is_error_expression());
11544 return Expression::make_error(location
);
11549 return new Map_construction_expression(type
, this->vals_
, location
);
11552 // Make a composite literal expression.
11555 Expression::make_composite_literal(Type
* type
, int depth
, bool has_keys
,
11556 Expression_list
* vals
,
11557 source_location location
)
11559 return new Composite_literal_expression(type
, depth
, has_keys
, vals
,
11563 // Return whether this expression is a composite literal.
11566 Expression::is_composite_literal() const
11568 switch (this->classification_
)
11570 case EXPRESSION_COMPOSITE_LITERAL
:
11571 case EXPRESSION_STRUCT_CONSTRUCTION
:
11572 case EXPRESSION_FIXED_ARRAY_CONSTRUCTION
:
11573 case EXPRESSION_OPEN_ARRAY_CONSTRUCTION
:
11574 case EXPRESSION_MAP_CONSTRUCTION
:
11581 // Return whether this expression is a composite literal which is not
11585 Expression::is_nonconstant_composite_literal() const
11587 switch (this->classification_
)
11589 case EXPRESSION_STRUCT_CONSTRUCTION
:
11591 const Struct_construction_expression
*psce
=
11592 static_cast<const Struct_construction_expression
*>(this);
11593 return !psce
->is_constant_struct();
11595 case EXPRESSION_FIXED_ARRAY_CONSTRUCTION
:
11597 const Fixed_array_construction_expression
*pace
=
11598 static_cast<const Fixed_array_construction_expression
*>(this);
11599 return !pace
->is_constant_array();
11601 case EXPRESSION_OPEN_ARRAY_CONSTRUCTION
:
11603 const Open_array_construction_expression
*pace
=
11604 static_cast<const Open_array_construction_expression
*>(this);
11605 return !pace
->is_constant_array();
11607 case EXPRESSION_MAP_CONSTRUCTION
:
11614 // Return true if this is a reference to a local variable.
11617 Expression::is_local_variable() const
11619 const Var_expression
* ve
= this->var_expression();
11622 const Named_object
* no
= ve
->named_object();
11623 return (no
->is_result_variable()
11624 || (no
->is_variable() && !no
->var_value()->is_global()));
11627 // Class Type_guard_expression.
11632 Type_guard_expression::do_traverse(Traverse
* traverse
)
11634 if (Expression::traverse(&this->expr_
, traverse
) == TRAVERSE_EXIT
11635 || Type::traverse(this->type_
, traverse
) == TRAVERSE_EXIT
)
11636 return TRAVERSE_EXIT
;
11637 return TRAVERSE_CONTINUE
;
11640 // Check types of a type guard expression. The expression must have
11641 // an interface type, but the actual type conversion is checked at run
11645 Type_guard_expression::do_check_types(Gogo
*)
11647 // 6g permits using a type guard with unsafe.pointer; we are
11649 Type
* expr_type
= this->expr_
->type();
11650 if (expr_type
->is_unsafe_pointer_type())
11652 if (this->type_
->points_to() == NULL
11653 && (this->type_
->integer_type() == NULL
11654 || (this->type_
->forwarded()
11655 != Type::lookup_integer_type("uintptr"))))
11656 this->report_error(_("invalid unsafe.Pointer conversion"));
11658 else if (this->type_
->is_unsafe_pointer_type())
11660 if (expr_type
->points_to() == NULL
11661 && (expr_type
->integer_type() == NULL
11662 || (expr_type
->forwarded()
11663 != Type::lookup_integer_type("uintptr"))))
11664 this->report_error(_("invalid unsafe.Pointer conversion"));
11666 else if (expr_type
->interface_type() == NULL
)
11668 if (!expr_type
->is_error_type() && !this->type_
->is_error_type())
11669 this->report_error(_("type assertion only valid for interface types"));
11670 this->set_is_error();
11672 else if (this->type_
->interface_type() == NULL
)
11674 std::string reason
;
11675 if (!expr_type
->interface_type()->implements_interface(this->type_
,
11678 if (!this->type_
->is_error_type())
11680 if (reason
.empty())
11681 this->report_error(_("impossible type assertion: "
11682 "type does not implement interface"));
11684 error_at(this->location(),
11685 ("impossible type assertion: "
11686 "type does not implement interface (%s)"),
11689 this->set_is_error();
11694 // Return a tree for a type guard expression.
11697 Type_guard_expression::do_get_tree(Translate_context
* context
)
11699 Gogo
* gogo
= context
->gogo();
11700 tree expr_tree
= this->expr_
->get_tree(context
);
11701 if (expr_tree
== error_mark_node
)
11702 return error_mark_node
;
11703 Type
* expr_type
= this->expr_
->type();
11704 if ((this->type_
->is_unsafe_pointer_type()
11705 && (expr_type
->points_to() != NULL
11706 || expr_type
->integer_type() != NULL
))
11707 || (expr_type
->is_unsafe_pointer_type()
11708 && this->type_
->points_to() != NULL
))
11709 return convert_to_pointer(this->type_
->get_tree(gogo
), expr_tree
);
11710 else if (expr_type
->is_unsafe_pointer_type()
11711 && this->type_
->integer_type() != NULL
)
11712 return convert_to_integer(this->type_
->get_tree(gogo
), expr_tree
);
11713 else if (this->type_
->interface_type() != NULL
)
11714 return Expression::convert_interface_to_interface(context
, this->type_
,
11715 this->expr_
->type(),
11719 return Expression::convert_for_assignment(context
, this->type_
,
11720 this->expr_
->type(), expr_tree
,
11724 // Make a type guard expression.
11727 Expression::make_type_guard(Expression
* expr
, Type
* type
,
11728 source_location location
)
11730 return new Type_guard_expression(expr
, type
, location
);
11733 // Class Heap_composite_expression.
11735 // When you take the address of a composite literal, it is allocated
11736 // on the heap. This class implements that.
11738 class Heap_composite_expression
: public Expression
11741 Heap_composite_expression(Expression
* expr
, source_location location
)
11742 : Expression(EXPRESSION_HEAP_COMPOSITE
, location
),
11748 do_traverse(Traverse
* traverse
)
11749 { return Expression::traverse(&this->expr_
, traverse
); }
11753 { return Type::make_pointer_type(this->expr_
->type()); }
11756 do_determine_type(const Type_context
*)
11757 { this->expr_
->determine_type_no_context(); }
11762 return Expression::make_heap_composite(this->expr_
->copy(),
11767 do_get_tree(Translate_context
*);
11769 // We only export global objects, and the parser does not generate
11770 // this in global scope.
11772 do_export(Export
*) const
11773 { gcc_unreachable(); }
11776 // The composite literal which is being put on the heap.
11780 // Return a tree which allocates a composite literal on the heap.
11783 Heap_composite_expression::do_get_tree(Translate_context
* context
)
11785 tree expr_tree
= this->expr_
->get_tree(context
);
11786 if (expr_tree
== error_mark_node
)
11787 return error_mark_node
;
11788 tree expr_size
= TYPE_SIZE_UNIT(TREE_TYPE(expr_tree
));
11789 gcc_assert(TREE_CODE(expr_size
) == INTEGER_CST
);
11790 tree space
= context
->gogo()->allocate_memory(this->expr_
->type(),
11791 expr_size
, this->location());
11792 space
= fold_convert(build_pointer_type(TREE_TYPE(expr_tree
)), space
);
11793 space
= save_expr(space
);
11794 tree ref
= build_fold_indirect_ref_loc(this->location(), space
);
11795 TREE_THIS_NOTRAP(ref
) = 1;
11796 tree ret
= build2(COMPOUND_EXPR
, TREE_TYPE(space
),
11797 build2(MODIFY_EXPR
, void_type_node
, ref
, expr_tree
),
11799 SET_EXPR_LOCATION(ret
, this->location());
11803 // Allocate a composite literal on the heap.
11806 Expression::make_heap_composite(Expression
* expr
, source_location location
)
11808 return new Heap_composite_expression(expr
, location
);
11811 // Class Receive_expression.
11813 // Return the type of a receive expression.
11816 Receive_expression::do_type()
11818 Channel_type
* channel_type
= this->channel_
->type()->channel_type();
11819 if (channel_type
== NULL
)
11820 return Type::make_error_type();
11821 return channel_type
->element_type();
11824 // Check types for a receive expression.
11827 Receive_expression::do_check_types(Gogo
*)
11829 Type
* type
= this->channel_
->type();
11830 if (type
->is_error_type())
11832 this->set_is_error();
11835 if (type
->channel_type() == NULL
)
11837 this->report_error(_("expected channel"));
11840 if (!type
->channel_type()->may_receive())
11842 this->report_error(_("invalid receive on send-only channel"));
11847 // Get a tree for a receive expression.
11850 Receive_expression::do_get_tree(Translate_context
* context
)
11852 Channel_type
* channel_type
= this->channel_
->type()->channel_type();
11853 gcc_assert(channel_type
!= NULL
);
11854 Type
* element_type
= channel_type
->element_type();
11855 tree element_type_tree
= element_type
->get_tree(context
->gogo());
11857 tree channel
= this->channel_
->get_tree(context
);
11858 if (element_type_tree
== error_mark_node
|| channel
== error_mark_node
)
11859 return error_mark_node
;
11861 return Gogo::receive_from_channel(element_type_tree
, channel
,
11862 this->for_select_
, this->location());
11865 // Make a receive expression.
11867 Receive_expression
*
11868 Expression::make_receive(Expression
* channel
, source_location location
)
11870 return new Receive_expression(channel
, location
);
11873 // Class Send_expression.
11878 Send_expression::do_traverse(Traverse
* traverse
)
11880 if (Expression::traverse(&this->channel_
, traverse
) == TRAVERSE_EXIT
)
11881 return TRAVERSE_EXIT
;
11882 return Expression::traverse(&this->val_
, traverse
);
11888 Send_expression::do_type()
11890 return Type::lookup_bool_type();
11896 Send_expression::do_determine_type(const Type_context
*)
11898 this->channel_
->determine_type_no_context();
11900 Type
* type
= this->channel_
->type();
11901 Type_context subcontext
;
11902 if (type
->channel_type() != NULL
)
11903 subcontext
.type
= type
->channel_type()->element_type();
11904 this->val_
->determine_type(&subcontext
);
11910 Send_expression::do_check_types(Gogo
*)
11912 Type
* type
= this->channel_
->type();
11913 if (type
->is_error_type())
11915 this->set_is_error();
11918 Channel_type
* channel_type
= type
->channel_type();
11919 if (channel_type
== NULL
)
11921 error_at(this->location(), "left operand of %<<-%> must be channel");
11922 this->set_is_error();
11925 Type
* element_type
= channel_type
->element_type();
11926 if (element_type
!= NULL
11927 && !Type::are_assignable(element_type
, this->val_
->type(), NULL
))
11929 this->report_error(_("incompatible types in send"));
11932 if (!channel_type
->may_send())
11934 this->report_error(_("invalid send on receive-only channel"));
11939 // Get a tree for a send expression.
11942 Send_expression::do_get_tree(Translate_context
* context
)
11944 tree channel
= this->channel_
->get_tree(context
);
11945 tree val
= this->val_
->get_tree(context
);
11946 if (channel
== error_mark_node
|| val
== error_mark_node
)
11947 return error_mark_node
;
11948 Channel_type
* channel_type
= this->channel_
->type()->channel_type();
11949 val
= Expression::convert_for_assignment(context
,
11950 channel_type
->element_type(),
11951 this->val_
->type(),
11954 return Gogo::send_on_channel(channel
, val
, this->is_value_discarded_
,
11955 this->for_select_
, this->location());
11958 // Make a send expression
11961 Expression::make_send(Expression
* channel
, Expression
* val
,
11962 source_location location
)
11964 return new Send_expression(channel
, val
, location
);
11967 // An expression which evaluates to a pointer to the type descriptor
11970 class Type_descriptor_expression
: public Expression
11973 Type_descriptor_expression(Type
* type
, source_location location
)
11974 : Expression(EXPRESSION_TYPE_DESCRIPTOR
, location
),
11981 { return Type::make_type_descriptor_ptr_type(); }
11984 do_determine_type(const Type_context
*)
11992 do_get_tree(Translate_context
* context
)
11993 { return this->type_
->type_descriptor_pointer(context
->gogo()); }
11996 // The type for which this is the descriptor.
12000 // Make a type descriptor expression.
12003 Expression::make_type_descriptor(Type
* type
, source_location location
)
12005 return new Type_descriptor_expression(type
, location
);
12008 // An expression which evaluates to some characteristic of a type.
12009 // This is only used to initialize fields of a type descriptor. Using
12010 // a new expression class is slightly inefficient but gives us a good
12011 // separation between the frontend and the middle-end with regard to
12012 // how types are laid out.
12014 class Type_info_expression
: public Expression
12017 Type_info_expression(Type
* type
, Type_info type_info
)
12018 : Expression(EXPRESSION_TYPE_INFO
, BUILTINS_LOCATION
),
12019 type_(type
), type_info_(type_info
)
12027 do_determine_type(const Type_context
*)
12035 do_get_tree(Translate_context
* context
);
12038 // The type for which we are getting information.
12040 // What information we want.
12041 Type_info type_info_
;
12044 // The type is chosen to match what the type descriptor struct
12048 Type_info_expression::do_type()
12050 switch (this->type_info_
)
12052 case TYPE_INFO_SIZE
:
12053 return Type::lookup_integer_type("uintptr");
12054 case TYPE_INFO_ALIGNMENT
:
12055 case TYPE_INFO_FIELD_ALIGNMENT
:
12056 return Type::lookup_integer_type("uint8");
12062 // Return type information in GENERIC.
12065 Type_info_expression::do_get_tree(Translate_context
* context
)
12067 tree type_tree
= this->type_
->get_tree(context
->gogo());
12068 if (type_tree
== error_mark_node
)
12069 return error_mark_node
;
12071 tree val_type_tree
= this->type()->get_tree(context
->gogo());
12072 gcc_assert(val_type_tree
!= error_mark_node
);
12074 if (this->type_info_
== TYPE_INFO_SIZE
)
12075 return fold_convert_loc(BUILTINS_LOCATION
, val_type_tree
,
12076 TYPE_SIZE_UNIT(type_tree
));
12080 if (this->type_info_
== TYPE_INFO_ALIGNMENT
)
12081 val
= go_type_alignment(type_tree
);
12083 val
= go_field_alignment(type_tree
);
12084 return build_int_cstu(val_type_tree
, val
);
12088 // Make a type info expression.
12091 Expression::make_type_info(Type
* type
, Type_info type_info
)
12093 return new Type_info_expression(type
, type_info
);
12096 // An expression which evaluates to the offset of a field within a
12097 // struct. This, like Type_info_expression, q.v., is only used to
12098 // initialize fields of a type descriptor.
12100 class Struct_field_offset_expression
: public Expression
12103 Struct_field_offset_expression(Struct_type
* type
, const Struct_field
* field
)
12104 : Expression(EXPRESSION_STRUCT_FIELD_OFFSET
, BUILTINS_LOCATION
),
12105 type_(type
), field_(field
)
12111 { return Type::lookup_integer_type("uintptr"); }
12114 do_determine_type(const Type_context
*)
12122 do_get_tree(Translate_context
* context
);
12125 // The type of the struct.
12126 Struct_type
* type_
;
12128 const Struct_field
* field_
;
12131 // Return a struct field offset in GENERIC.
12134 Struct_field_offset_expression::do_get_tree(Translate_context
* context
)
12136 tree type_tree
= this->type_
->get_tree(context
->gogo());
12137 if (type_tree
== error_mark_node
)
12138 return error_mark_node
;
12140 tree val_type_tree
= this->type()->get_tree(context
->gogo());
12141 gcc_assert(val_type_tree
!= error_mark_node
);
12143 const Struct_field_list
* fields
= this->type_
->fields();
12144 tree struct_field_tree
= TYPE_FIELDS(type_tree
);
12145 Struct_field_list::const_iterator p
;
12146 for (p
= fields
->begin();
12147 p
!= fields
->end();
12148 ++p
, struct_field_tree
= DECL_CHAIN(struct_field_tree
))
12150 gcc_assert(struct_field_tree
!= NULL_TREE
);
12151 if (&*p
== this->field_
)
12154 gcc_assert(&*p
== this->field_
);
12156 return fold_convert_loc(BUILTINS_LOCATION
, val_type_tree
,
12157 byte_position(struct_field_tree
));
12160 // Make an expression for a struct field offset.
12163 Expression::make_struct_field_offset(Struct_type
* type
,
12164 const Struct_field
* field
)
12166 return new Struct_field_offset_expression(type
, field
);
12169 // An expression which evaluates to the address of an unnamed label.
12171 class Label_addr_expression
: public Expression
12174 Label_addr_expression(Label
* label
, source_location location
)
12175 : Expression(EXPRESSION_LABEL_ADDR
, location
),
12182 { return Type::make_pointer_type(Type::make_void_type()); }
12185 do_determine_type(const Type_context
*)
12190 { return new Label_addr_expression(this->label_
, this->location()); }
12193 do_get_tree(Translate_context
*)
12194 { return this->label_
->get_addr(this->location()); }
12197 // The label whose address we are taking.
12201 // Make an expression for the address of an unnamed label.
12204 Expression::make_label_addr(Label
* label
, source_location location
)
12206 return new Label_addr_expression(label
, location
);
12209 // Import an expression. This comes at the end in order to see the
12210 // various class definitions.
12213 Expression::import_expression(Import
* imp
)
12215 int c
= imp
->peek_char();
12216 if (imp
->match_c_string("- ")
12217 || imp
->match_c_string("! ")
12218 || imp
->match_c_string("^ "))
12219 return Unary_expression::do_import(imp
);
12221 return Binary_expression::do_import(imp
);
12222 else if (imp
->match_c_string("true")
12223 || imp
->match_c_string("false"))
12224 return Boolean_expression::do_import(imp
);
12226 return String_expression::do_import(imp
);
12227 else if (c
== '-' || (c
>= '0' && c
<= '9'))
12229 // This handles integers, floats and complex constants.
12230 return Integer_expression::do_import(imp
);
12232 else if (imp
->match_c_string("nil"))
12233 return Nil_expression::do_import(imp
);
12234 else if (imp
->match_c_string("convert"))
12235 return Type_conversion_expression::do_import(imp
);
12238 error_at(imp
->location(), "import error: expected expression");
12239 return Expression::make_error(imp
->location());
12243 // Class Expression_list.
12245 // Traverse the list.
12248 Expression_list::traverse(Traverse
* traverse
)
12250 for (Expression_list::iterator p
= this->begin();
12256 if (Expression::traverse(&*p
, traverse
) == TRAVERSE_EXIT
)
12257 return TRAVERSE_EXIT
;
12260 return TRAVERSE_CONTINUE
;
12266 Expression_list::copy()
12268 Expression_list
* ret
= new Expression_list();
12269 for (Expression_list::iterator p
= this->begin();
12274 ret
->push_back(NULL
);
12276 ret
->push_back((*p
)->copy());
12281 // Return whether an expression list has an error expression.
12284 Expression_list::contains_error() const
12286 for (Expression_list::const_iterator p
= this->begin();
12289 if (*p
!= NULL
&& (*p
)->is_error_expression())