1 // types.cc -- Go frontend types.
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
23 #ifndef ENABLE_BUILD_WITH_CXX
30 #include "expressions.h"
31 #include "statements.h"
38 Type::Type(Type_classification classification
)
39 : classification_(classification
), tree_(NULL_TREE
),
40 type_descriptor_decl_(NULL_TREE
)
48 // Get the base type for a type--skip names and forward declarations.
53 switch (this->classification_
)
56 return this->named_type()->named_base();
58 return this->forward_declaration_type()->real_type()->base();
67 switch (this->classification_
)
70 return this->named_type()->named_base();
72 return this->forward_declaration_type()->real_type()->base();
78 // Skip defined forward declarations.
84 Forward_declaration_type
* ftype
= t
->forward_declaration_type();
85 while (ftype
!= NULL
&& ftype
->is_defined())
87 t
= ftype
->real_type();
88 ftype
= t
->forward_declaration_type();
94 Type::forwarded() const
97 const Forward_declaration_type
* ftype
= t
->forward_declaration_type();
98 while (ftype
!= NULL
&& ftype
->is_defined())
100 t
= ftype
->real_type();
101 ftype
= t
->forward_declaration_type();
106 // If this is a named type, return it. Otherwise, return NULL.
111 return this->forwarded()->convert_no_base
<Named_type
, TYPE_NAMED
>();
115 Type::named_type() const
117 return this->forwarded()->convert_no_base
<const Named_type
, TYPE_NAMED
>();
120 // Return true if this type is not defined.
123 Type::is_undefined() const
125 return this->forwarded()->forward_declaration_type() != NULL
;
128 // Return true if this is a basic type: a type which is not composed
129 // of other types, and is not void.
132 Type::is_basic_type() const
134 switch (this->classification_
)
157 return this->base()->is_basic_type();
164 // Return true if this is an abstract type.
167 Type::is_abstract() const
169 switch (this->classification())
172 return this->integer_type()->is_abstract();
174 return this->float_type()->is_abstract();
176 return this->complex_type()->is_abstract();
178 return this->is_abstract_string_type();
180 return this->is_abstract_boolean_type();
186 // Return a non-abstract version of an abstract type.
189 Type::make_non_abstract_type()
191 gcc_assert(this->is_abstract());
192 switch (this->classification())
195 return Type::lookup_integer_type("int");
197 return Type::lookup_float_type("float64");
199 return Type::lookup_complex_type("complex128");
201 return Type::lookup_string_type();
203 return Type::lookup_bool_type();
209 // Return true if this is an error type. Don't give an error if we
210 // try to dereference an undefined forwarding type, as this is called
211 // in the parser when the type may legitimately be undefined.
214 Type::is_error_type() const
216 const Type
* t
= this->forwarded();
217 // Note that we return false for an undefined forward type.
218 switch (t
->classification_
)
223 return t
->named_type()->is_named_error_type();
229 // If this is a pointer type, return the type to which it points.
230 // Otherwise, return NULL.
233 Type::points_to() const
235 const Pointer_type
* ptype
= this->convert
<const Pointer_type
,
237 return ptype
== NULL
? NULL
: ptype
->points_to();
240 // Return whether this is an open array type.
243 Type::is_open_array_type() const
245 return this->array_type() != NULL
&& this->array_type()->length() == NULL
;
248 // Return whether this is the predeclared constant nil being used as a
252 Type::is_nil_constant_as_type() const
254 const Type
* t
= this->forwarded();
255 if (t
->forward_declaration_type() != NULL
)
257 const Named_object
* no
= t
->forward_declaration_type()->named_object();
258 if (no
->is_unknown())
259 no
= no
->unknown_value()->real_named_object();
262 && no
->const_value()->expr()->is_nil_expression())
271 Type::traverse(Type
* type
, Traverse
* traverse
)
273 gcc_assert((traverse
->traverse_mask() & Traverse::traverse_types
) != 0
274 || (traverse
->traverse_mask()
275 & Traverse::traverse_expressions
) != 0);
276 if (traverse
->remember_type(type
))
278 // We have already traversed this type.
279 return TRAVERSE_CONTINUE
;
281 if ((traverse
->traverse_mask() & Traverse::traverse_types
) != 0)
283 int t
= traverse
->type(type
);
284 if (t
== TRAVERSE_EXIT
)
285 return TRAVERSE_EXIT
;
286 else if (t
== TRAVERSE_SKIP_COMPONENTS
)
287 return TRAVERSE_CONTINUE
;
289 // An array type has an expression which we need to traverse if
290 // traverse_expressions is set.
291 if (type
->do_traverse(traverse
) == TRAVERSE_EXIT
)
292 return TRAVERSE_EXIT
;
293 return TRAVERSE_CONTINUE
;
296 // Default implementation for do_traverse for child class.
299 Type::do_traverse(Traverse
*)
301 return TRAVERSE_CONTINUE
;
304 // Return whether two types are identical. If ERRORS_ARE_IDENTICAL,
305 // then return true for all erroneous types; this is used to avoid
306 // cascading errors. If REASON is not NULL, optionally set *REASON to
307 // the reason the types are not identical.
310 Type::are_identical(const Type
* t1
, const Type
* t2
, bool errors_are_identical
,
313 if (t1
== NULL
|| t2
== NULL
)
315 // Something is wrong.
316 return errors_are_identical
? true : t1
== t2
;
319 // Skip defined forward declarations.
320 t1
= t1
->forwarded();
321 t2
= t2
->forwarded();
326 // An undefined forward declaration is an error.
327 if (t1
->forward_declaration_type() != NULL
328 || t2
->forward_declaration_type() != NULL
)
329 return errors_are_identical
;
331 // Avoid cascading errors with error types.
332 if (t1
->is_error_type() || t2
->is_error_type())
334 if (errors_are_identical
)
336 return t1
->is_error_type() && t2
->is_error_type();
339 // Get a good reason for the sink type. Note that the sink type on
340 // the left hand side of an assignment is handled in are_assignable.
341 if (t1
->is_sink_type() || t2
->is_sink_type())
344 *reason
= "invalid use of _";
348 // A named type is only identical to itself.
349 if (t1
->named_type() != NULL
|| t2
->named_type() != NULL
)
352 // Check type shapes.
353 if (t1
->classification() != t2
->classification())
356 switch (t1
->classification())
362 // These types are always identical.
366 return t1
->integer_type()->is_identical(t2
->integer_type());
369 return t1
->float_type()->is_identical(t2
->float_type());
372 return t1
->complex_type()->is_identical(t2
->complex_type());
375 return t1
->function_type()->is_identical(t2
->function_type(),
377 errors_are_identical
,
381 return Type::are_identical(t1
->points_to(), t2
->points_to(),
382 errors_are_identical
, reason
);
385 return t1
->struct_type()->is_identical(t2
->struct_type(),
386 errors_are_identical
);
389 return t1
->array_type()->is_identical(t2
->array_type(),
390 errors_are_identical
);
393 return t1
->map_type()->is_identical(t2
->map_type(),
394 errors_are_identical
);
397 return t1
->channel_type()->is_identical(t2
->channel_type(),
398 errors_are_identical
);
401 return t1
->interface_type()->is_identical(t2
->interface_type(),
402 errors_are_identical
);
404 case TYPE_CALL_MULTIPLE_RESULT
:
406 *reason
= "invalid use of multiple value function call";
414 // Return true if it's OK to have a binary operation with types LHS
415 // and RHS. This is not used for shifts or comparisons.
418 Type::are_compatible_for_binop(const Type
* lhs
, const Type
* rhs
)
420 if (Type::are_identical(lhs
, rhs
, true, NULL
))
423 // A constant of abstract bool type may be mixed with any bool type.
424 if ((rhs
->is_abstract_boolean_type() && lhs
->is_boolean_type())
425 || (lhs
->is_abstract_boolean_type() && rhs
->is_boolean_type()))
428 // A constant of abstract string type may be mixed with any string
430 if ((rhs
->is_abstract_string_type() && lhs
->is_string_type())
431 || (lhs
->is_abstract_string_type() && rhs
->is_string_type()))
437 // A constant of abstract integer, float, or complex type may be
438 // mixed with an integer, float, or complex type.
439 if ((rhs
->is_abstract()
440 && (rhs
->integer_type() != NULL
441 || rhs
->float_type() != NULL
442 || rhs
->complex_type() != NULL
)
443 && (lhs
->integer_type() != NULL
444 || lhs
->float_type() != NULL
445 || lhs
->complex_type() != NULL
))
446 || (lhs
->is_abstract()
447 && (lhs
->integer_type() != NULL
448 || lhs
->float_type() != NULL
449 || lhs
->complex_type() != NULL
)
450 && (rhs
->integer_type() != NULL
451 || rhs
->float_type() != NULL
452 || rhs
->complex_type() != NULL
)))
455 // The nil type may be compared to a pointer, an interface type, a
456 // slice type, a channel type, a map type, or a function type.
457 if (lhs
->is_nil_type()
458 && (rhs
->points_to() != NULL
459 || rhs
->interface_type() != NULL
460 || rhs
->is_open_array_type()
461 || rhs
->map_type() != NULL
462 || rhs
->channel_type() != NULL
463 || rhs
->function_type() != NULL
))
465 if (rhs
->is_nil_type()
466 && (lhs
->points_to() != NULL
467 || lhs
->interface_type() != NULL
468 || lhs
->is_open_array_type()
469 || lhs
->map_type() != NULL
470 || lhs
->channel_type() != NULL
471 || lhs
->function_type() != NULL
))
477 // Return true if a value with type RHS may be assigned to a variable
478 // with type LHS. If REASON is not NULL, set *REASON to the reason
479 // the types are not assignable.
482 Type::are_assignable(const Type
* lhs
, const Type
* rhs
, std::string
* reason
)
484 // Do some checks first. Make sure the types are defined.
486 && rhs
->forwarded()->forward_declaration_type() == NULL
487 && rhs
->is_void_type())
490 *reason
= "non-value used as value";
494 if (lhs
!= NULL
&& lhs
->forwarded()->forward_declaration_type() == NULL
)
496 // Any value may be assigned to the blank identifier.
497 if (lhs
->is_sink_type())
500 // All fields of a struct must be exported, or the assignment
501 // must be in the same package.
502 if (rhs
!= NULL
&& rhs
->forwarded()->forward_declaration_type() == NULL
)
504 if (lhs
->has_hidden_fields(NULL
, reason
)
505 || rhs
->has_hidden_fields(NULL
, reason
))
510 // Identical types are assignable.
511 if (Type::are_identical(lhs
, rhs
, true, reason
))
514 // The types are assignable if they have identical underlying types
515 // and either LHS or RHS is not a named type.
516 if (((lhs
->named_type() != NULL
&& rhs
->named_type() == NULL
)
517 || (rhs
->named_type() != NULL
&& lhs
->named_type() == NULL
))
518 && Type::are_identical(lhs
->base(), rhs
->base(), true, reason
))
521 // The types are assignable if LHS is an interface type and RHS
522 // implements the required methods.
523 const Interface_type
* lhs_interface_type
= lhs
->interface_type();
524 if (lhs_interface_type
!= NULL
)
526 if (lhs_interface_type
->implements_interface(rhs
, reason
))
528 const Interface_type
* rhs_interface_type
= rhs
->interface_type();
529 if (rhs_interface_type
!= NULL
530 && lhs_interface_type
->is_compatible_for_assign(rhs_interface_type
,
535 // The type are assignable if RHS is a bidirectional channel type,
536 // LHS is a channel type, they have identical element types, and
537 // either LHS or RHS is not a named type.
538 if (lhs
->channel_type() != NULL
539 && rhs
->channel_type() != NULL
540 && rhs
->channel_type()->may_send()
541 && rhs
->channel_type()->may_receive()
542 && (lhs
->named_type() == NULL
|| rhs
->named_type() == NULL
)
543 && Type::are_identical(lhs
->channel_type()->element_type(),
544 rhs
->channel_type()->element_type(),
549 // The nil type may be assigned to a pointer, function, slice, map,
550 // channel, or interface type.
551 if (rhs
->is_nil_type()
552 && (lhs
->points_to() != NULL
553 || lhs
->function_type() != NULL
554 || lhs
->is_open_array_type()
555 || lhs
->map_type() != NULL
556 || lhs
->channel_type() != NULL
557 || lhs
->interface_type() != NULL
))
560 // An untyped numeric constant may be assigned to a numeric type if
561 // it is representable in that type.
562 if ((rhs
->is_abstract()
563 && (rhs
->integer_type() != NULL
564 || rhs
->float_type() != NULL
565 || rhs
->complex_type() != NULL
))
566 && (lhs
->integer_type() != NULL
567 || lhs
->float_type() != NULL
568 || lhs
->complex_type() != NULL
))
571 // Give some better error messages.
572 if (reason
!= NULL
&& reason
->empty())
574 if (rhs
->interface_type() != NULL
)
575 reason
->assign(_("need explicit conversion"));
576 else if (rhs
->is_call_multiple_result_type())
577 reason
->assign(_("multiple value function call in "
578 "single value context"));
579 else if (lhs
->named_type() != NULL
&& rhs
->named_type() != NULL
)
581 size_t len
= (lhs
->named_type()->name().length()
582 + rhs
->named_type()->name().length()
584 char* buf
= new char[len
];
585 snprintf(buf
, len
, _("cannot use type %s as type %s"),
586 rhs
->named_type()->message_name().c_str(),
587 lhs
->named_type()->message_name().c_str());
596 // Return true if a value with type RHS may be converted to type LHS.
597 // If REASON is not NULL, set *REASON to the reason the types are not
601 Type::are_convertible(const Type
* lhs
, const Type
* rhs
, std::string
* reason
)
603 // The types are convertible if they are assignable.
604 if (Type::are_assignable(lhs
, rhs
, reason
))
607 // The types are convertible if they have identical underlying
609 if ((lhs
->named_type() != NULL
|| rhs
->named_type() != NULL
)
610 && Type::are_identical(lhs
->base(), rhs
->base(), true, reason
))
613 // The types are convertible if they are both unnamed pointer types
614 // and their pointer base types have identical underlying types.
615 if (lhs
->named_type() == NULL
616 && rhs
->named_type() == NULL
617 && lhs
->points_to() != NULL
618 && rhs
->points_to() != NULL
619 && (lhs
->points_to()->named_type() != NULL
620 || rhs
->points_to()->named_type() != NULL
)
621 && Type::are_identical(lhs
->points_to()->base(),
622 rhs
->points_to()->base(),
627 // Integer and floating point types are convertible to each other.
628 if ((lhs
->integer_type() != NULL
|| lhs
->float_type() != NULL
)
629 && (rhs
->integer_type() != NULL
|| rhs
->float_type() != NULL
))
632 // Complex types are convertible to each other.
633 if (lhs
->complex_type() != NULL
&& rhs
->complex_type() != NULL
)
636 // An integer, or []byte, or []int, may be converted to a string.
637 if (lhs
->is_string_type())
639 if (rhs
->integer_type() != NULL
)
641 if (rhs
->is_open_array_type() && rhs
->named_type() == NULL
)
643 const Type
* e
= rhs
->array_type()->element_type()->forwarded();
644 if (e
->integer_type() != NULL
645 && (e
== Type::lookup_integer_type("uint8")
646 || e
== Type::lookup_integer_type("int")))
651 // A string may be converted to []byte or []int.
652 if (rhs
->is_string_type()
653 && lhs
->is_open_array_type()
654 && lhs
->named_type() == NULL
)
656 const Type
* e
= lhs
->array_type()->element_type()->forwarded();
657 if (e
->integer_type() != NULL
658 && (e
== Type::lookup_integer_type("uint8")
659 || e
== Type::lookup_integer_type("int")))
663 // An unsafe.Pointer type may be converted to any pointer type or to
664 // uintptr, and vice-versa.
665 if (lhs
->is_unsafe_pointer_type()
666 && (rhs
->points_to() != NULL
667 || (rhs
->integer_type() != NULL
668 && rhs
->forwarded() == Type::lookup_integer_type("uintptr"))))
670 if (rhs
->is_unsafe_pointer_type()
671 && (lhs
->points_to() != NULL
672 || (lhs
->integer_type() != NULL
673 && lhs
->forwarded() == Type::lookup_integer_type("uintptr"))))
676 // Give a better error message.
680 *reason
= "invalid type conversion";
683 std::string s
= "invalid type conversion (";
693 // Return whether this type has any hidden fields. This is only a
694 // possibility for a few types.
697 Type::has_hidden_fields(const Named_type
* within
, std::string
* reason
) const
699 switch (this->forwarded()->classification_
)
702 return this->named_type()->named_type_has_hidden_fields(reason
);
704 return this->struct_type()->struct_has_hidden_fields(within
, reason
);
706 return this->array_type()->array_has_hidden_fields(within
, reason
);
712 // Return a hash code for the type to be used for method lookup.
715 Type::hash_for_method(Gogo
* gogo
) const
717 unsigned int ret
= 0;
718 if (this->classification_
!= TYPE_FORWARD
)
719 ret
+= this->classification_
;
720 return ret
+ this->do_hash_for_method(gogo
);
723 // Default implementation of do_hash_for_method. This is appropriate
724 // for types with no subfields.
727 Type::do_hash_for_method(Gogo
*) const
732 // Return a hash code for a string, given a starting hash.
735 Type::hash_string(const std::string
& s
, unsigned int h
)
737 const char* p
= s
.data();
738 size_t len
= s
.length();
739 for (; len
> 0; --len
)
747 // Default check for the expression passed to make. Any type which
748 // may be used with make implements its own version of this.
751 Type::do_check_make_expression(Expression_list
*, source_location
)
756 // Return whether an expression has an integer value. Report an error
757 // if not. This is used when handling calls to the predeclared make
761 Type::check_int_value(Expression
* e
, const char* errmsg
,
762 source_location location
)
764 if (e
->type()->integer_type() != NULL
)
767 // Check for a floating point constant with integer value.
772 if (e
->float_constant_value(fval
, &dummy
) && mpfr_integer_p(fval
))
779 mpfr_clear_overflow();
780 mpfr_clear_erangeflag();
781 mpfr_get_z(ival
, fval
, GMP_RNDN
);
782 if (!mpfr_overflow_p()
783 && !mpfr_erangeflag_p()
784 && mpz_sgn(ival
) >= 0)
786 Named_type
* ntype
= Type::lookup_integer_type("int");
787 Integer_type
* inttype
= ntype
->integer_type();
789 mpz_init_set_ui(max
, 1);
790 mpz_mul_2exp(max
, max
, inttype
->bits() - 1);
791 ok
= mpz_cmp(ival
, max
) < 0;
805 error_at(location
, "%s", errmsg
);
809 // A hash table mapping unnamed types to trees.
811 Type::Type_trees
Type::type_trees
;
813 // Return a tree representing this type.
816 Type::get_tree(Gogo
* gogo
)
818 if (this->tree_
!= NULL
)
821 if (this->forward_declaration_type() != NULL
822 || this->named_type() != NULL
)
823 return this->get_tree_without_hash(gogo
);
825 if (this->is_error_type())
826 return error_mark_node
;
828 // To avoid confusing GIMPLE, we need to translate all identical Go
829 // types to the same GIMPLE type. We use a hash table to do that.
830 // There is no need to use the hash table for named types, as named
831 // types are only identical to themselves.
833 std::pair
<Type
*, tree
> val(this, NULL
);
834 std::pair
<Type_trees::iterator
, bool> ins
=
835 Type::type_trees
.insert(val
);
836 if (!ins
.second
&& ins
.first
->second
!= NULL_TREE
)
838 if (gogo
!= NULL
&& gogo
->named_types_are_converted())
839 this->tree_
= ins
.first
->second
;
840 return ins
.first
->second
;
843 tree t
= this->get_tree_without_hash(gogo
);
845 if (ins
.first
->second
== NULL_TREE
)
846 ins
.first
->second
= t
;
849 // We have already created a tree for this type. This can
850 // happen when an unnamed type is defined using a named type
851 // which in turns uses an identical unnamed type. Use the tree
852 // we created earlier and ignore the one we just built.
853 t
= ins
.first
->second
;
854 if (gogo
== NULL
|| !gogo
->named_types_are_converted())
862 // Return a tree for a type without looking in the hash table for
863 // identical types. This is used for named types, since there is no
864 // point to looking in the hash table for them.
867 Type::get_tree_without_hash(Gogo
* gogo
)
869 if (this->tree_
== NULL_TREE
)
871 tree t
= this->do_get_tree(gogo
);
873 // For a recursive function or pointer type, we will temporarily
874 // return ptr_type_node during the recursion. We don't want to
875 // record that for a forwarding type, as it may confuse us
877 if (t
== ptr_type_node
&& this->forward_declaration_type() != NULL
)
880 if (gogo
== NULL
|| !gogo
->named_types_are_converted())
884 go_preserve_from_gc(t
);
890 // Return a tree representing a zero initialization for this type.
893 Type::get_init_tree(Gogo
* gogo
, bool is_clear
)
895 tree type_tree
= this->get_tree(gogo
);
896 if (type_tree
== error_mark_node
)
897 return error_mark_node
;
898 return this->do_get_init_tree(gogo
, type_tree
, is_clear
);
901 // Any type which supports the builtin make function must implement
905 Type::do_make_expression_tree(Translate_context
*, Expression_list
*,
911 // Return a pointer to the type descriptor for this type.
914 Type::type_descriptor_pointer(Gogo
* gogo
)
916 Type
* t
= this->forwarded();
917 if (t
->type_descriptor_decl_
== NULL_TREE
)
919 Expression
* e
= t
->do_type_descriptor(gogo
, NULL
);
920 gogo
->build_type_descriptor_decl(t
, e
, &t
->type_descriptor_decl_
);
921 gcc_assert(t
->type_descriptor_decl_
!= NULL_TREE
922 && (t
->type_descriptor_decl_
== error_mark_node
923 || DECL_P(t
->type_descriptor_decl_
)));
925 if (t
->type_descriptor_decl_
== error_mark_node
)
926 return error_mark_node
;
927 return build_fold_addr_expr(t
->type_descriptor_decl_
);
930 // Return a composite literal for a type descriptor.
933 Type::type_descriptor(Gogo
* gogo
, Type
* type
)
935 return type
->do_type_descriptor(gogo
, NULL
);
938 // Return a composite literal for a type descriptor with a name.
941 Type::named_type_descriptor(Gogo
* gogo
, Type
* type
, Named_type
* name
)
943 gcc_assert(name
!= NULL
&& type
->named_type() != name
);
944 return type
->do_type_descriptor(gogo
, name
);
947 // Make a builtin struct type from a list of fields. The fields are
948 // pairs of a name and a type.
951 Type::make_builtin_struct_type(int nfields
, ...)
954 va_start(ap
, nfields
);
956 source_location bloc
= BUILTINS_LOCATION
;
957 Struct_field_list
* sfl
= new Struct_field_list();
958 for (int i
= 0; i
< nfields
; i
++)
960 const char* field_name
= va_arg(ap
, const char *);
961 Type
* type
= va_arg(ap
, Type
*);
962 sfl
->push_back(Struct_field(Typed_identifier(field_name
, type
, bloc
)));
967 return Type::make_struct_type(sfl
, bloc
);
970 // A list of builtin named types.
972 std::vector
<Named_type
*> Type::named_builtin_types
;
974 // Make a builtin named type.
977 Type::make_builtin_named_type(const char* name
, Type
* type
)
979 source_location bloc
= BUILTINS_LOCATION
;
980 Named_object
* no
= Named_object::make_type(name
, NULL
, type
, bloc
);
981 Named_type
* ret
= no
->type_value();
982 Type::named_builtin_types
.push_back(ret
);
986 // Convert the named builtin types.
989 Type::convert_builtin_named_types(Gogo
* gogo
)
991 for (std::vector
<Named_type
*>::const_iterator p
=
992 Type::named_builtin_types
.begin();
993 p
!= Type::named_builtin_types
.end();
996 bool r
= (*p
)->verify();
1002 // Return the type of a type descriptor. We should really tie this to
1003 // runtime.Type rather than copying it. This must match commonType in
1004 // libgo/go/runtime/type.go.
1007 Type::make_type_descriptor_type()
1012 source_location bloc
= BUILTINS_LOCATION
;
1014 Type
* uint8_type
= Type::lookup_integer_type("uint8");
1015 Type
* uint32_type
= Type::lookup_integer_type("uint32");
1016 Type
* uintptr_type
= Type::lookup_integer_type("uintptr");
1017 Type
* string_type
= Type::lookup_string_type();
1018 Type
* pointer_string_type
= Type::make_pointer_type(string_type
);
1020 // This is an unnamed version of unsafe.Pointer. Perhaps we
1021 // should use the named version instead, although that would
1022 // require us to create the unsafe package if it has not been
1023 // imported. It probably doesn't matter.
1024 Type
* void_type
= Type::make_void_type();
1025 Type
* unsafe_pointer_type
= Type::make_pointer_type(void_type
);
1027 // Forward declaration for the type descriptor type.
1028 Named_object
* named_type_descriptor_type
=
1029 Named_object::make_type_declaration("commonType", NULL
, bloc
);
1030 Type
* ft
= Type::make_forward_declaration(named_type_descriptor_type
);
1031 Type
* pointer_type_descriptor_type
= Type::make_pointer_type(ft
);
1033 // The type of a method on a concrete type.
1034 Struct_type
* method_type
=
1035 Type::make_builtin_struct_type(5,
1036 "name", pointer_string_type
,
1037 "pkgPath", pointer_string_type
,
1038 "mtyp", pointer_type_descriptor_type
,
1039 "typ", pointer_type_descriptor_type
,
1040 "tfn", unsafe_pointer_type
);
1041 Named_type
* named_method_type
=
1042 Type::make_builtin_named_type("method", method_type
);
1044 // Information for types with a name or methods.
1045 Type
* slice_named_method_type
=
1046 Type::make_array_type(named_method_type
, NULL
);
1047 Struct_type
* uncommon_type
=
1048 Type::make_builtin_struct_type(3,
1049 "name", pointer_string_type
,
1050 "pkgPath", pointer_string_type
,
1051 "methods", slice_named_method_type
);
1052 Named_type
* named_uncommon_type
=
1053 Type::make_builtin_named_type("uncommonType", uncommon_type
);
1055 Type
* pointer_uncommon_type
=
1056 Type::make_pointer_type(named_uncommon_type
);
1058 // The type descriptor type.
1060 Typed_identifier_list
* params
= new Typed_identifier_list();
1061 params
->push_back(Typed_identifier("", unsafe_pointer_type
, bloc
));
1062 params
->push_back(Typed_identifier("", uintptr_type
, bloc
));
1064 Typed_identifier_list
* results
= new Typed_identifier_list();
1065 results
->push_back(Typed_identifier("", uintptr_type
, bloc
));
1067 Type
* hashfn_type
= Type::make_function_type(NULL
, params
, results
, bloc
);
1069 params
= new Typed_identifier_list();
1070 params
->push_back(Typed_identifier("", unsafe_pointer_type
, bloc
));
1071 params
->push_back(Typed_identifier("", unsafe_pointer_type
, bloc
));
1072 params
->push_back(Typed_identifier("", uintptr_type
, bloc
));
1074 results
= new Typed_identifier_list();
1075 results
->push_back(Typed_identifier("", Type::lookup_bool_type(), bloc
));
1077 Type
* equalfn_type
= Type::make_function_type(NULL
, params
, results
,
1080 Struct_type
* type_descriptor_type
=
1081 Type::make_builtin_struct_type(9,
1083 "align", uint8_type
,
1084 "fieldAlign", uint8_type
,
1085 "size", uintptr_type
,
1086 "hash", uint32_type
,
1087 "hashfn", hashfn_type
,
1088 "equalfn", equalfn_type
,
1089 "string", pointer_string_type
,
1090 "", pointer_uncommon_type
);
1092 Named_type
* named
= Type::make_builtin_named_type("commonType",
1093 type_descriptor_type
);
1095 named_type_descriptor_type
->set_type_value(named
);
1103 // Make the type of a pointer to a type descriptor as represented in
1107 Type::make_type_descriptor_ptr_type()
1111 ret
= Type::make_pointer_type(Type::make_type_descriptor_type());
1115 // Return the names of runtime functions which compute a hash code for
1116 // this type and which compare whether two values of this type are
1120 Type::type_functions(const char** hash_fn
, const char** equal_fn
) const
1122 switch (this->base()->classification())
1124 case Type::TYPE_ERROR
:
1125 case Type::TYPE_VOID
:
1126 case Type::TYPE_NIL
:
1127 // These types can not be hashed or compared.
1128 *hash_fn
= "__go_type_hash_error";
1129 *equal_fn
= "__go_type_equal_error";
1132 case Type::TYPE_BOOLEAN
:
1133 case Type::TYPE_INTEGER
:
1134 case Type::TYPE_FLOAT
:
1135 case Type::TYPE_COMPLEX
:
1136 case Type::TYPE_POINTER
:
1137 case Type::TYPE_FUNCTION
:
1138 case Type::TYPE_MAP
:
1139 case Type::TYPE_CHANNEL
:
1140 *hash_fn
= "__go_type_hash_identity";
1141 *equal_fn
= "__go_type_equal_identity";
1144 case Type::TYPE_STRING
:
1145 *hash_fn
= "__go_type_hash_string";
1146 *equal_fn
= "__go_type_equal_string";
1149 case Type::TYPE_STRUCT
:
1150 case Type::TYPE_ARRAY
:
1151 // These types can not be hashed or compared.
1152 *hash_fn
= "__go_type_hash_error";
1153 *equal_fn
= "__go_type_equal_error";
1156 case Type::TYPE_INTERFACE
:
1157 if (this->interface_type()->is_empty())
1159 *hash_fn
= "__go_type_hash_empty_interface";
1160 *equal_fn
= "__go_type_equal_empty_interface";
1164 *hash_fn
= "__go_type_hash_interface";
1165 *equal_fn
= "__go_type_equal_interface";
1169 case Type::TYPE_NAMED
:
1170 case Type::TYPE_FORWARD
:
1178 // Return a composite literal for the type descriptor for a plain type
1179 // of kind RUNTIME_TYPE_KIND named NAME.
1182 Type::type_descriptor_constructor(Gogo
* gogo
, int runtime_type_kind
,
1183 Named_type
* name
, const Methods
* methods
,
1184 bool only_value_methods
)
1186 source_location bloc
= BUILTINS_LOCATION
;
1188 Type
* td_type
= Type::make_type_descriptor_type();
1189 const Struct_field_list
* fields
= td_type
->struct_type()->fields();
1191 Expression_list
* vals
= new Expression_list();
1194 Struct_field_list::const_iterator p
= fields
->begin();
1195 gcc_assert(p
->field_name() == "Kind");
1197 mpz_init_set_ui(iv
, runtime_type_kind
);
1198 vals
->push_back(Expression::make_integer(&iv
, p
->type(), bloc
));
1201 gcc_assert(p
->field_name() == "align");
1202 Expression::Type_info type_info
= Expression::TYPE_INFO_ALIGNMENT
;
1203 vals
->push_back(Expression::make_type_info(this, type_info
));
1206 gcc_assert(p
->field_name() == "fieldAlign");
1207 type_info
= Expression::TYPE_INFO_FIELD_ALIGNMENT
;
1208 vals
->push_back(Expression::make_type_info(this, type_info
));
1211 gcc_assert(p
->field_name() == "size");
1212 type_info
= Expression::TYPE_INFO_SIZE
;
1213 vals
->push_back(Expression::make_type_info(this, type_info
));
1216 gcc_assert(p
->field_name() == "hash");
1217 mpz_set_ui(iv
, this->hash_for_method(gogo
));
1218 vals
->push_back(Expression::make_integer(&iv
, p
->type(), bloc
));
1220 const char* hash_fn
;
1221 const char* equal_fn
;
1222 this->type_functions(&hash_fn
, &equal_fn
);
1225 gcc_assert(p
->field_name() == "hashfn");
1226 Function_type
* fntype
= p
->type()->function_type();
1227 Named_object
* no
= Named_object::make_function_declaration(hash_fn
, NULL
,
1230 no
->func_declaration_value()->set_asm_name(hash_fn
);
1231 vals
->push_back(Expression::make_func_reference(no
, NULL
, bloc
));
1234 gcc_assert(p
->field_name() == "equalfn");
1235 fntype
= p
->type()->function_type();
1236 no
= Named_object::make_function_declaration(equal_fn
, NULL
, fntype
, bloc
);
1237 no
->func_declaration_value()->set_asm_name(equal_fn
);
1238 vals
->push_back(Expression::make_func_reference(no
, NULL
, bloc
));
1241 gcc_assert(p
->field_name() == "string");
1242 Expression
* s
= Expression::make_string((name
!= NULL
1243 ? name
->reflection(gogo
)
1244 : this->reflection(gogo
)),
1246 vals
->push_back(Expression::make_unary(OPERATOR_AND
, s
, bloc
));
1249 gcc_assert(p
->field_name() == "uncommonType");
1250 if (name
== NULL
&& methods
== NULL
)
1251 vals
->push_back(Expression::make_nil(bloc
));
1254 if (methods
== NULL
)
1255 methods
= name
->methods();
1256 vals
->push_back(this->uncommon_type_constructor(gogo
,
1259 only_value_methods
));
1263 gcc_assert(p
== fields
->end());
1267 return Expression::make_struct_composite_literal(td_type
, vals
, bloc
);
1270 // Return a composite literal for the uncommon type information for
1271 // this type. UNCOMMON_STRUCT_TYPE is the type of the uncommon type
1272 // struct. If name is not NULL, it is the name of the type. If
1273 // METHODS is not NULL, it is the list of methods. ONLY_VALUE_METHODS
1274 // is true if only value methods should be included. At least one of
1275 // NAME and METHODS must not be NULL.
1278 Type::uncommon_type_constructor(Gogo
* gogo
, Type
* uncommon_type
,
1279 Named_type
* name
, const Methods
* methods
,
1280 bool only_value_methods
) const
1282 source_location bloc
= BUILTINS_LOCATION
;
1284 const Struct_field_list
* fields
= uncommon_type
->struct_type()->fields();
1286 Expression_list
* vals
= new Expression_list();
1289 Struct_field_list::const_iterator p
= fields
->begin();
1290 gcc_assert(p
->field_name() == "name");
1293 gcc_assert(p
->field_name() == "pkgPath");
1297 vals
->push_back(Expression::make_nil(bloc
));
1298 vals
->push_back(Expression::make_nil(bloc
));
1302 Named_object
* no
= name
->named_object();
1303 std::string n
= Gogo::unpack_hidden_name(no
->name());
1304 Expression
* s
= Expression::make_string(n
, bloc
);
1305 vals
->push_back(Expression::make_unary(OPERATOR_AND
, s
, bloc
));
1307 if (name
->is_builtin())
1308 vals
->push_back(Expression::make_nil(bloc
));
1311 const Package
* package
= no
->package();
1312 const std::string
& unique_prefix(package
== NULL
1313 ? gogo
->unique_prefix()
1314 : package
->unique_prefix());
1315 const std::string
& package_name(package
== NULL
1316 ? gogo
->package_name()
1318 n
.assign(unique_prefix
);
1320 n
.append(package_name
);
1321 if (name
->in_function() != NULL
)
1324 n
.append(Gogo::unpack_hidden_name(name
->in_function()->name()));
1326 s
= Expression::make_string(n
, bloc
);
1327 vals
->push_back(Expression::make_unary(OPERATOR_AND
, s
, bloc
));
1332 gcc_assert(p
->field_name() == "methods");
1333 vals
->push_back(this->methods_constructor(gogo
, p
->type(), methods
,
1334 only_value_methods
));
1337 gcc_assert(p
== fields
->end());
1339 Expression
* r
= Expression::make_struct_composite_literal(uncommon_type
,
1341 return Expression::make_unary(OPERATOR_AND
, r
, bloc
);
1344 // Sort methods by name.
1350 operator()(const std::pair
<std::string
, const Method
*>& m1
,
1351 const std::pair
<std::string
, const Method
*>& m2
) const
1352 { return m1
.first
< m2
.first
; }
1355 // Return a composite literal for the type method table for this type.
1356 // METHODS_TYPE is the type of the table, and is a slice type.
1357 // METHODS is the list of methods. If ONLY_VALUE_METHODS is true,
1358 // then only value methods are used.
1361 Type::methods_constructor(Gogo
* gogo
, Type
* methods_type
,
1362 const Methods
* methods
,
1363 bool only_value_methods
) const
1365 source_location bloc
= BUILTINS_LOCATION
;
1367 std::vector
<std::pair
<std::string
, const Method
*> > smethods
;
1368 if (methods
!= NULL
)
1370 smethods
.reserve(methods
->count());
1371 for (Methods::const_iterator p
= methods
->begin();
1372 p
!= methods
->end();
1375 if (p
->second
->is_ambiguous())
1377 if (only_value_methods
&& !p
->second
->is_value_method())
1379 smethods
.push_back(std::make_pair(p
->first
, p
->second
));
1383 if (smethods
.empty())
1384 return Expression::make_slice_composite_literal(methods_type
, NULL
, bloc
);
1386 std::sort(smethods
.begin(), smethods
.end(), Sort_methods());
1388 Type
* method_type
= methods_type
->array_type()->element_type();
1390 Expression_list
* vals
= new Expression_list();
1391 vals
->reserve(smethods
.size());
1392 for (std::vector
<std::pair
<std::string
, const Method
*> >::const_iterator p
1394 p
!= smethods
.end();
1396 vals
->push_back(this->method_constructor(gogo
, method_type
, p
->first
,
1399 return Expression::make_slice_composite_literal(methods_type
, vals
, bloc
);
1402 // Return a composite literal for a single method. METHOD_TYPE is the
1403 // type of the entry. METHOD_NAME is the name of the method and M is
1404 // the method information.
1407 Type::method_constructor(Gogo
*, Type
* method_type
,
1408 const std::string
& method_name
,
1409 const Method
* m
) const
1411 source_location bloc
= BUILTINS_LOCATION
;
1413 const Struct_field_list
* fields
= method_type
->struct_type()->fields();
1415 Expression_list
* vals
= new Expression_list();
1418 Struct_field_list::const_iterator p
= fields
->begin();
1419 gcc_assert(p
->field_name() == "name");
1420 const std::string n
= Gogo::unpack_hidden_name(method_name
);
1421 Expression
* s
= Expression::make_string(n
, bloc
);
1422 vals
->push_back(Expression::make_unary(OPERATOR_AND
, s
, bloc
));
1425 gcc_assert(p
->field_name() == "pkgPath");
1426 if (!Gogo::is_hidden_name(method_name
))
1427 vals
->push_back(Expression::make_nil(bloc
));
1430 s
= Expression::make_string(Gogo::hidden_name_prefix(method_name
), bloc
);
1431 vals
->push_back(Expression::make_unary(OPERATOR_AND
, s
, bloc
));
1434 Named_object
* no
= (m
->needs_stub_method()
1436 : m
->named_object());
1438 Function_type
* mtype
;
1439 if (no
->is_function())
1440 mtype
= no
->func_value()->type();
1442 mtype
= no
->func_declaration_value()->type();
1443 gcc_assert(mtype
->is_method());
1444 Type
* nonmethod_type
= mtype
->copy_without_receiver();
1447 gcc_assert(p
->field_name() == "mtyp");
1448 vals
->push_back(Expression::make_type_descriptor(nonmethod_type
, bloc
));
1451 gcc_assert(p
->field_name() == "typ");
1452 vals
->push_back(Expression::make_type_descriptor(mtype
, bloc
));
1455 gcc_assert(p
->field_name() == "tfn");
1456 vals
->push_back(Expression::make_func_reference(no
, NULL
, bloc
));
1459 gcc_assert(p
== fields
->end());
1461 return Expression::make_struct_composite_literal(method_type
, vals
, bloc
);
1464 // Return a composite literal for the type descriptor of a plain type.
1465 // RUNTIME_TYPE_KIND is the value of the kind field. If NAME is not
1466 // NULL, it is the name to use as well as the list of methods.
1469 Type::plain_type_descriptor(Gogo
* gogo
, int runtime_type_kind
,
1472 return this->type_descriptor_constructor(gogo
, runtime_type_kind
,
1476 // Return the type reflection string for this type.
1479 Type::reflection(Gogo
* gogo
) const
1483 // The do_reflection virtual function should set RET to the
1484 // reflection string.
1485 this->do_reflection(gogo
, &ret
);
1490 // Return a mangled name for the type.
1493 Type::mangled_name(Gogo
* gogo
) const
1497 // The do_mangled_name virtual function should set RET to the
1498 // mangled name. For a composite type it should append a code for
1499 // the composition and then call do_mangled_name on the components.
1500 this->do_mangled_name(gogo
, &ret
);
1505 // Default function to export a type.
1508 Type::do_export(Export
*) const
1516 Type::import_type(Import
* imp
)
1518 if (imp
->match_c_string("("))
1519 return Function_type::do_import(imp
);
1520 else if (imp
->match_c_string("*"))
1521 return Pointer_type::do_import(imp
);
1522 else if (imp
->match_c_string("struct "))
1523 return Struct_type::do_import(imp
);
1524 else if (imp
->match_c_string("["))
1525 return Array_type::do_import(imp
);
1526 else if (imp
->match_c_string("map "))
1527 return Map_type::do_import(imp
);
1528 else if (imp
->match_c_string("chan "))
1529 return Channel_type::do_import(imp
);
1530 else if (imp
->match_c_string("interface"))
1531 return Interface_type::do_import(imp
);
1534 error_at(imp
->location(), "import error: expected type");
1535 return Type::make_error_type();
1539 // A type used to indicate a parsing error. This exists to simplify
1540 // later error detection.
1542 class Error_type
: public Type
1552 { return error_mark_node
; }
1555 do_get_init_tree(Gogo
*, tree
, bool)
1556 { return error_mark_node
; }
1559 do_type_descriptor(Gogo
*, Named_type
*)
1560 { return Expression::make_error(BUILTINS_LOCATION
); }
1563 do_reflection(Gogo
*, std::string
*) const
1564 { gcc_assert(saw_errors()); }
1567 do_mangled_name(Gogo
*, std::string
* ret
) const
1568 { ret
->push_back('E'); }
1572 Type::make_error_type()
1574 static Error_type singleton_error_type
;
1575 return &singleton_error_type
;
1580 class Void_type
: public Type
1590 { return void_type_node
; }
1593 do_get_init_tree(Gogo
*, tree
, bool)
1594 { gcc_unreachable(); }
1597 do_type_descriptor(Gogo
*, Named_type
*)
1598 { gcc_unreachable(); }
1601 do_reflection(Gogo
*, std::string
*) const
1605 do_mangled_name(Gogo
*, std::string
* ret
) const
1606 { ret
->push_back('v'); }
1610 Type::make_void_type()
1612 static Void_type singleton_void_type
;
1613 return &singleton_void_type
;
1616 // The boolean type.
1618 class Boolean_type
: public Type
1622 : Type(TYPE_BOOLEAN
)
1628 { return boolean_type_node
; }
1631 do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
1632 { return is_clear
? NULL
: fold_convert(type_tree
, boolean_false_node
); }
1635 do_type_descriptor(Gogo
*, Named_type
* name
);
1637 // We should not be asked for the reflection string of a basic type.
1639 do_reflection(Gogo
*, std::string
* ret
) const
1640 { ret
->append("bool"); }
1643 do_mangled_name(Gogo
*, std::string
* ret
) const
1644 { ret
->push_back('b'); }
1647 // Make the type descriptor.
1650 Boolean_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
1653 return this->plain_type_descriptor(gogo
, RUNTIME_TYPE_KIND_BOOL
, name
);
1656 Named_object
* no
= gogo
->lookup_global("bool");
1657 gcc_assert(no
!= NULL
);
1658 return Type::type_descriptor(gogo
, no
->type_value());
1663 Type::make_boolean_type()
1665 static Boolean_type boolean_type
;
1666 return &boolean_type
;
1669 // The named type "bool".
1671 static Named_type
* named_bool_type
;
1673 // Get the named type "bool".
1676 Type::lookup_bool_type()
1678 return named_bool_type
;
1681 // Make the named type "bool".
1684 Type::make_named_bool_type()
1686 Type
* bool_type
= Type::make_boolean_type();
1687 Named_object
* named_object
= Named_object::make_type("bool", NULL
,
1690 Named_type
* named_type
= named_object
->type_value();
1691 named_bool_type
= named_type
;
1695 // Class Integer_type.
1697 Integer_type::Named_integer_types
Integer_type::named_integer_types
;
1699 // Create a new integer type. Non-abstract integer types always have
1703 Integer_type::create_integer_type(const char* name
, bool is_unsigned
,
1704 int bits
, int runtime_type_kind
)
1706 Integer_type
* integer_type
= new Integer_type(false, is_unsigned
, bits
,
1708 std::string
sname(name
);
1709 Named_object
* named_object
= Named_object::make_type(sname
, NULL
,
1712 Named_type
* named_type
= named_object
->type_value();
1713 std::pair
<Named_integer_types::iterator
, bool> ins
=
1714 Integer_type::named_integer_types
.insert(std::make_pair(sname
, named_type
));
1715 gcc_assert(ins
.second
);
1719 // Look up an existing integer type.
1722 Integer_type::lookup_integer_type(const char* name
)
1724 Named_integer_types::const_iterator p
=
1725 Integer_type::named_integer_types
.find(name
);
1726 gcc_assert(p
!= Integer_type::named_integer_types
.end());
1730 // Create a new abstract integer type.
1733 Integer_type::create_abstract_integer_type()
1735 static Integer_type
* abstract_type
;
1736 if (abstract_type
== NULL
)
1737 abstract_type
= new Integer_type(true, false, INT_TYPE_SIZE
,
1738 RUNTIME_TYPE_KIND_INT
);
1739 return abstract_type
;
1742 // Integer type compatibility.
1745 Integer_type::is_identical(const Integer_type
* t
) const
1747 if (this->is_unsigned_
!= t
->is_unsigned_
|| this->bits_
!= t
->bits_
)
1749 return this->is_abstract_
== t
->is_abstract_
;
1755 Integer_type::do_hash_for_method(Gogo
*) const
1757 return ((this->bits_
<< 4)
1758 + ((this->is_unsigned_
? 1 : 0) << 8)
1759 + ((this->is_abstract_
? 1 : 0) << 9));
1762 // Get the tree for an Integer_type.
1765 Integer_type::do_get_tree(Gogo
*)
1767 if (this->is_abstract_
)
1769 gcc_assert(saw_errors());
1770 return error_mark_node
;
1773 if (this->is_unsigned_
)
1775 if (this->bits_
== INT_TYPE_SIZE
)
1776 return unsigned_type_node
;
1777 else if (this->bits_
== CHAR_TYPE_SIZE
)
1778 return unsigned_char_type_node
;
1779 else if (this->bits_
== SHORT_TYPE_SIZE
)
1780 return short_unsigned_type_node
;
1781 else if (this->bits_
== LONG_TYPE_SIZE
)
1782 return long_unsigned_type_node
;
1783 else if (this->bits_
== LONG_LONG_TYPE_SIZE
)
1784 return long_long_unsigned_type_node
;
1786 return make_unsigned_type(this->bits_
);
1790 if (this->bits_
== INT_TYPE_SIZE
)
1791 return integer_type_node
;
1792 else if (this->bits_
== CHAR_TYPE_SIZE
)
1793 return signed_char_type_node
;
1794 else if (this->bits_
== SHORT_TYPE_SIZE
)
1795 return short_integer_type_node
;
1796 else if (this->bits_
== LONG_TYPE_SIZE
)
1797 return long_integer_type_node
;
1798 else if (this->bits_
== LONG_LONG_TYPE_SIZE
)
1799 return long_long_integer_type_node
;
1801 return make_signed_type(this->bits_
);
1806 Integer_type::do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
1808 return is_clear
? NULL
: build_int_cst(type_tree
, 0);
1811 // The type descriptor for an integer type. Integer types are always
1815 Integer_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
1817 gcc_assert(name
!= NULL
);
1818 return this->plain_type_descriptor(gogo
, this->runtime_type_kind_
, name
);
1821 // We should not be asked for the reflection string of a basic type.
1824 Integer_type::do_reflection(Gogo
*, std::string
*) const
1826 gcc_assert(saw_errors());
1832 Integer_type::do_mangled_name(Gogo
*, std::string
* ret
) const
1835 snprintf(buf
, sizeof buf
, "i%s%s%de",
1836 this->is_abstract_
? "a" : "",
1837 this->is_unsigned_
? "u" : "",
1842 // Make an integer type.
1845 Type::make_integer_type(const char* name
, bool is_unsigned
, int bits
,
1846 int runtime_type_kind
)
1848 return Integer_type::create_integer_type(name
, is_unsigned
, bits
,
1852 // Make an abstract integer type.
1855 Type::make_abstract_integer_type()
1857 return Integer_type::create_abstract_integer_type();
1860 // Look up an integer type.
1863 Type::lookup_integer_type(const char* name
)
1865 return Integer_type::lookup_integer_type(name
);
1868 // Class Float_type.
1870 Float_type::Named_float_types
Float_type::named_float_types
;
1872 // Create a new float type. Non-abstract float types always have
1876 Float_type::create_float_type(const char* name
, int bits
,
1877 int runtime_type_kind
)
1879 Float_type
* float_type
= new Float_type(false, bits
, runtime_type_kind
);
1880 std::string
sname(name
);
1881 Named_object
* named_object
= Named_object::make_type(sname
, NULL
, float_type
,
1883 Named_type
* named_type
= named_object
->type_value();
1884 std::pair
<Named_float_types::iterator
, bool> ins
=
1885 Float_type::named_float_types
.insert(std::make_pair(sname
, named_type
));
1886 gcc_assert(ins
.second
);
1890 // Look up an existing float type.
1893 Float_type::lookup_float_type(const char* name
)
1895 Named_float_types::const_iterator p
=
1896 Float_type::named_float_types
.find(name
);
1897 gcc_assert(p
!= Float_type::named_float_types
.end());
1901 // Create a new abstract float type.
1904 Float_type::create_abstract_float_type()
1906 static Float_type
* abstract_type
;
1907 if (abstract_type
== NULL
)
1908 abstract_type
= new Float_type(true, 64, RUNTIME_TYPE_KIND_FLOAT64
);
1909 return abstract_type
;
1912 // Whether this type is identical with T.
1915 Float_type::is_identical(const Float_type
* t
) const
1917 if (this->bits_
!= t
->bits_
)
1919 return this->is_abstract_
== t
->is_abstract_
;
1925 Float_type::do_hash_for_method(Gogo
*) const
1927 return (this->bits_
<< 4) + ((this->is_abstract_
? 1 : 0) << 8);
1930 // Get a tree without using a Gogo*.
1933 Float_type::type_tree() const
1935 if (this->bits_
== FLOAT_TYPE_SIZE
)
1936 return float_type_node
;
1937 else if (this->bits_
== DOUBLE_TYPE_SIZE
)
1938 return double_type_node
;
1939 else if (this->bits_
== LONG_DOUBLE_TYPE_SIZE
)
1940 return long_double_type_node
;
1943 tree ret
= make_node(REAL_TYPE
);
1944 TYPE_PRECISION(ret
) = this->bits_
;
1953 Float_type::do_get_tree(Gogo
*)
1955 return this->type_tree();
1959 Float_type::do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
1964 real_from_integer(&r
, TYPE_MODE(type_tree
), 0, 0, 0);
1965 return build_real(type_tree
, r
);
1968 // The type descriptor for a float type. Float types are always named.
1971 Float_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
1973 gcc_assert(name
!= NULL
);
1974 return this->plain_type_descriptor(gogo
, this->runtime_type_kind_
, name
);
1977 // We should not be asked for the reflection string of a basic type.
1980 Float_type::do_reflection(Gogo
*, std::string
*) const
1982 gcc_assert(saw_errors());
1988 Float_type::do_mangled_name(Gogo
*, std::string
* ret
) const
1991 snprintf(buf
, sizeof buf
, "f%s%de",
1992 this->is_abstract_
? "a" : "",
1997 // Make a floating point type.
2000 Type::make_float_type(const char* name
, int bits
, int runtime_type_kind
)
2002 return Float_type::create_float_type(name
, bits
, runtime_type_kind
);
2005 // Make an abstract float type.
2008 Type::make_abstract_float_type()
2010 return Float_type::create_abstract_float_type();
2013 // Look up a float type.
2016 Type::lookup_float_type(const char* name
)
2018 return Float_type::lookup_float_type(name
);
2021 // Class Complex_type.
2023 Complex_type::Named_complex_types
Complex_type::named_complex_types
;
2025 // Create a new complex type. Non-abstract complex types always have
2029 Complex_type::create_complex_type(const char* name
, int bits
,
2030 int runtime_type_kind
)
2032 Complex_type
* complex_type
= new Complex_type(false, bits
,
2034 std::string
sname(name
);
2035 Named_object
* named_object
= Named_object::make_type(sname
, NULL
,
2038 Named_type
* named_type
= named_object
->type_value();
2039 std::pair
<Named_complex_types::iterator
, bool> ins
=
2040 Complex_type::named_complex_types
.insert(std::make_pair(sname
,
2042 gcc_assert(ins
.second
);
2046 // Look up an existing complex type.
2049 Complex_type::lookup_complex_type(const char* name
)
2051 Named_complex_types::const_iterator p
=
2052 Complex_type::named_complex_types
.find(name
);
2053 gcc_assert(p
!= Complex_type::named_complex_types
.end());
2057 // Create a new abstract complex type.
2060 Complex_type::create_abstract_complex_type()
2062 static Complex_type
* abstract_type
;
2063 if (abstract_type
== NULL
)
2064 abstract_type
= new Complex_type(true, 128, RUNTIME_TYPE_KIND_COMPLEX128
);
2065 return abstract_type
;
2068 // Whether this type is identical with T.
2071 Complex_type::is_identical(const Complex_type
*t
) const
2073 if (this->bits_
!= t
->bits_
)
2075 return this->is_abstract_
== t
->is_abstract_
;
2081 Complex_type::do_hash_for_method(Gogo
*) const
2083 return (this->bits_
<< 4) + ((this->is_abstract_
? 1 : 0) << 8);
2086 // Get a tree without using a Gogo*.
2089 Complex_type::type_tree() const
2091 if (this->bits_
== FLOAT_TYPE_SIZE
* 2)
2092 return complex_float_type_node
;
2093 else if (this->bits_
== DOUBLE_TYPE_SIZE
* 2)
2094 return complex_double_type_node
;
2095 else if (this->bits_
== LONG_DOUBLE_TYPE_SIZE
* 2)
2096 return complex_long_double_type_node
;
2099 tree ret
= make_node(REAL_TYPE
);
2100 TYPE_PRECISION(ret
) = this->bits_
/ 2;
2102 return build_complex_type(ret
);
2109 Complex_type::do_get_tree(Gogo
*)
2111 return this->type_tree();
2114 // Zero initializer.
2117 Complex_type::do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
2122 real_from_integer(&r
, TYPE_MODE(TREE_TYPE(type_tree
)), 0, 0, 0);
2123 return build_complex(type_tree
, build_real(TREE_TYPE(type_tree
), r
),
2124 build_real(TREE_TYPE(type_tree
), r
));
2127 // The type descriptor for a complex type. Complex types are always
2131 Complex_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
2133 gcc_assert(name
!= NULL
);
2134 return this->plain_type_descriptor(gogo
, this->runtime_type_kind_
, name
);
2137 // We should not be asked for the reflection string of a basic type.
2140 Complex_type::do_reflection(Gogo
*, std::string
*) const
2142 gcc_assert(saw_errors());
2148 Complex_type::do_mangled_name(Gogo
*, std::string
* ret
) const
2151 snprintf(buf
, sizeof buf
, "c%s%de",
2152 this->is_abstract_
? "a" : "",
2157 // Make a complex type.
2160 Type::make_complex_type(const char* name
, int bits
, int runtime_type_kind
)
2162 return Complex_type::create_complex_type(name
, bits
, runtime_type_kind
);
2165 // Make an abstract complex type.
2168 Type::make_abstract_complex_type()
2170 return Complex_type::create_abstract_complex_type();
2173 // Look up a complex type.
2176 Type::lookup_complex_type(const char* name
)
2178 return Complex_type::lookup_complex_type(name
);
2181 // Class String_type.
2183 // Return the tree for String_type. A string is a struct with two
2184 // fields: a pointer to the characters and a length.
2187 String_type::do_get_tree(Gogo
*)
2189 static tree struct_type
;
2190 return Gogo::builtin_struct(&struct_type
, "__go_string", NULL_TREE
, 2,
2192 build_pointer_type(unsigned_char_type_node
),
2197 // Return a tree for the length of STRING.
2200 String_type::length_tree(Gogo
*, tree string
)
2202 tree string_type
= TREE_TYPE(string
);
2203 gcc_assert(TREE_CODE(string_type
) == RECORD_TYPE
);
2204 tree length_field
= DECL_CHAIN(TYPE_FIELDS(string_type
));
2205 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(length_field
)),
2207 return fold_build3(COMPONENT_REF
, integer_type_node
, string
,
2208 length_field
, NULL_TREE
);
2211 // Return a tree for a pointer to the bytes of STRING.
2214 String_type::bytes_tree(Gogo
*, tree string
)
2216 tree string_type
= TREE_TYPE(string
);
2217 gcc_assert(TREE_CODE(string_type
) == RECORD_TYPE
);
2218 tree bytes_field
= TYPE_FIELDS(string_type
);
2219 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(bytes_field
)),
2221 return fold_build3(COMPONENT_REF
, TREE_TYPE(bytes_field
), string
,
2222 bytes_field
, NULL_TREE
);
2225 // We initialize a string to { NULL, 0 }.
2228 String_type::do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
2233 gcc_assert(TREE_CODE(type_tree
) == RECORD_TYPE
);
2235 VEC(constructor_elt
, gc
)* init
= VEC_alloc(constructor_elt
, gc
, 2);
2237 for (tree field
= TYPE_FIELDS(type_tree
);
2239 field
= DECL_CHAIN(field
))
2241 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
2243 elt
->value
= fold_convert(TREE_TYPE(field
), size_zero_node
);
2246 tree ret
= build_constructor(type_tree
, init
);
2247 TREE_CONSTANT(ret
) = 1;
2251 // The type descriptor for the string type.
2254 String_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
2257 return this->plain_type_descriptor(gogo
, RUNTIME_TYPE_KIND_STRING
, name
);
2260 Named_object
* no
= gogo
->lookup_global("string");
2261 gcc_assert(no
!= NULL
);
2262 return Type::type_descriptor(gogo
, no
->type_value());
2266 // We should not be asked for the reflection string of a basic type.
2269 String_type::do_reflection(Gogo
*, std::string
* ret
) const
2271 ret
->append("string");
2274 // Mangled name of a string type.
2277 String_type::do_mangled_name(Gogo
*, std::string
* ret
) const
2279 ret
->push_back('z');
2282 // Make a string type.
2285 Type::make_string_type()
2287 static String_type string_type
;
2288 return &string_type
;
2291 // The named type "string".
2293 static Named_type
* named_string_type
;
2295 // Get the named type "string".
2298 Type::lookup_string_type()
2300 return named_string_type
;
2303 // Make the named type string.
2306 Type::make_named_string_type()
2308 Type
* string_type
= Type::make_string_type();
2309 Named_object
* named_object
= Named_object::make_type("string", NULL
,
2312 Named_type
* named_type
= named_object
->type_value();
2313 named_string_type
= named_type
;
2317 // The sink type. This is the type of the blank identifier _. Any
2318 // type may be assigned to it.
2320 class Sink_type
: public Type
2330 { gcc_unreachable(); }
2333 do_get_init_tree(Gogo
*, tree
, bool)
2334 { gcc_unreachable(); }
2337 do_type_descriptor(Gogo
*, Named_type
*)
2338 { gcc_unreachable(); }
2341 do_reflection(Gogo
*, std::string
*) const
2342 { gcc_unreachable(); }
2345 do_mangled_name(Gogo
*, std::string
*) const
2346 { gcc_unreachable(); }
2349 // Make the sink type.
2352 Type::make_sink_type()
2354 static Sink_type sink_type
;
2358 // Class Function_type.
2363 Function_type::do_traverse(Traverse
* traverse
)
2365 if (this->receiver_
!= NULL
2366 && Type::traverse(this->receiver_
->type(), traverse
) == TRAVERSE_EXIT
)
2367 return TRAVERSE_EXIT
;
2368 if (this->parameters_
!= NULL
2369 && this->parameters_
->traverse(traverse
) == TRAVERSE_EXIT
)
2370 return TRAVERSE_EXIT
;
2371 if (this->results_
!= NULL
2372 && this->results_
->traverse(traverse
) == TRAVERSE_EXIT
)
2373 return TRAVERSE_EXIT
;
2374 return TRAVERSE_CONTINUE
;
2377 // Returns whether T is a valid redeclaration of this type. If this
2378 // returns false, and REASON is not NULL, *REASON may be set to a
2379 // brief explanation of why it returned false.
2382 Function_type::is_valid_redeclaration(const Function_type
* t
,
2383 std::string
* reason
) const
2385 if (!this->is_identical(t
, false, true, reason
))
2388 // A redeclaration of a function is required to use the same names
2389 // for the receiver and parameters.
2390 if (this->receiver() != NULL
2391 && this->receiver()->name() != t
->receiver()->name()
2392 && this->receiver()->name() != Import::import_marker
2393 && t
->receiver()->name() != Import::import_marker
)
2396 *reason
= "receiver name changed";
2400 const Typed_identifier_list
* parms1
= this->parameters();
2401 const Typed_identifier_list
* parms2
= t
->parameters();
2404 Typed_identifier_list::const_iterator p1
= parms1
->begin();
2405 for (Typed_identifier_list::const_iterator p2
= parms2
->begin();
2406 p2
!= parms2
->end();
2409 if (p1
->name() != p2
->name()
2410 && p1
->name() != Import::import_marker
2411 && p2
->name() != Import::import_marker
)
2414 *reason
= "parameter name changed";
2418 // This is called at parse time, so we may have unknown
2420 Type
* t1
= p1
->type()->forwarded();
2421 Type
* t2
= p2
->type()->forwarded();
2423 && t1
->forward_declaration_type() != NULL
2424 && (t2
->forward_declaration_type() == NULL
2425 || (t1
->forward_declaration_type()->named_object()
2426 != t2
->forward_declaration_type()->named_object())))
2431 const Typed_identifier_list
* results1
= this->results();
2432 const Typed_identifier_list
* results2
= t
->results();
2433 if (results1
!= NULL
)
2435 Typed_identifier_list::const_iterator res1
= results1
->begin();
2436 for (Typed_identifier_list::const_iterator res2
= results2
->begin();
2437 res2
!= results2
->end();
2440 if (res1
->name() != res2
->name()
2441 && res1
->name() != Import::import_marker
2442 && res2
->name() != Import::import_marker
)
2445 *reason
= "result name changed";
2449 // This is called at parse time, so we may have unknown
2451 Type
* t1
= res1
->type()->forwarded();
2452 Type
* t2
= res2
->type()->forwarded();
2454 && t1
->forward_declaration_type() != NULL
2455 && (t2
->forward_declaration_type() == NULL
2456 || (t1
->forward_declaration_type()->named_object()
2457 != t2
->forward_declaration_type()->named_object())))
2465 // Check whether T is the same as this type.
2468 Function_type::is_identical(const Function_type
* t
, bool ignore_receiver
,
2469 bool errors_are_identical
,
2470 std::string
* reason
) const
2472 if (!ignore_receiver
)
2474 const Typed_identifier
* r1
= this->receiver();
2475 const Typed_identifier
* r2
= t
->receiver();
2476 if ((r1
!= NULL
) != (r2
!= NULL
))
2479 *reason
= _("different receiver types");
2484 if (!Type::are_identical(r1
->type(), r2
->type(), errors_are_identical
,
2487 if (reason
!= NULL
&& !reason
->empty())
2488 *reason
= "receiver: " + *reason
;
2494 const Typed_identifier_list
* parms1
= this->parameters();
2495 const Typed_identifier_list
* parms2
= t
->parameters();
2496 if ((parms1
!= NULL
) != (parms2
!= NULL
))
2499 *reason
= _("different number of parameters");
2504 Typed_identifier_list::const_iterator p1
= parms1
->begin();
2505 for (Typed_identifier_list::const_iterator p2
= parms2
->begin();
2506 p2
!= parms2
->end();
2509 if (p1
== parms1
->end())
2512 *reason
= _("different number of parameters");
2516 if (!Type::are_identical(p1
->type(), p2
->type(),
2517 errors_are_identical
, NULL
))
2520 *reason
= _("different parameter types");
2524 if (p1
!= parms1
->end())
2527 *reason
= _("different number of parameters");
2532 if (this->is_varargs() != t
->is_varargs())
2535 *reason
= _("different varargs");
2539 const Typed_identifier_list
* results1
= this->results();
2540 const Typed_identifier_list
* results2
= t
->results();
2541 if ((results1
!= NULL
) != (results2
!= NULL
))
2544 *reason
= _("different number of results");
2547 if (results1
!= NULL
)
2549 Typed_identifier_list::const_iterator res1
= results1
->begin();
2550 for (Typed_identifier_list::const_iterator res2
= results2
->begin();
2551 res2
!= results2
->end();
2554 if (res1
== results1
->end())
2557 *reason
= _("different number of results");
2561 if (!Type::are_identical(res1
->type(), res2
->type(),
2562 errors_are_identical
, NULL
))
2565 *reason
= _("different result types");
2569 if (res1
!= results1
->end())
2572 *reason
= _("different number of results");
2583 Function_type::do_hash_for_method(Gogo
* gogo
) const
2585 unsigned int ret
= 0;
2586 // We ignore the receiver type for hash codes, because we need to
2587 // get the same hash code for a method in an interface and a method
2588 // declared for a type. The former will not have a receiver.
2589 if (this->parameters_
!= NULL
)
2592 for (Typed_identifier_list::const_iterator p
= this->parameters_
->begin();
2593 p
!= this->parameters_
->end();
2595 ret
+= p
->type()->hash_for_method(gogo
) << shift
;
2597 if (this->results_
!= NULL
)
2600 for (Typed_identifier_list::const_iterator p
= this->results_
->begin();
2601 p
!= this->results_
->end();
2603 ret
+= p
->type()->hash_for_method(gogo
) << shift
;
2605 if (this->is_varargs_
)
2611 // Get the tree for a function type.
2614 Function_type::do_get_tree(Gogo
* gogo
)
2616 tree args
= NULL_TREE
;
2619 if (this->receiver_
!= NULL
)
2621 Type
* rtype
= this->receiver_
->type();
2622 tree ptype
= rtype
->get_tree(gogo
);
2623 if (ptype
== error_mark_node
)
2624 return error_mark_node
;
2626 // We always pass the address of the receiver parameter, in
2627 // order to make interface calls work with unknown types.
2628 if (rtype
->points_to() == NULL
)
2629 ptype
= build_pointer_type(ptype
);
2631 *pp
= tree_cons (NULL_TREE
, ptype
, NULL_TREE
);
2632 pp
= &TREE_CHAIN (*pp
);
2635 if (this->parameters_
!= NULL
)
2637 for (Typed_identifier_list::const_iterator p
= this->parameters_
->begin();
2638 p
!= this->parameters_
->end();
2641 tree ptype
= p
->type()->get_tree(gogo
);
2642 if (ptype
== error_mark_node
)
2643 return error_mark_node
;
2644 *pp
= tree_cons (NULL_TREE
, ptype
, NULL_TREE
);
2645 pp
= &TREE_CHAIN (*pp
);
2649 // Varargs is handled entirely at the Go level. At the tree level,
2650 // functions are not varargs.
2651 *pp
= void_list_node
;
2654 if (this->results_
== NULL
)
2655 result
= void_type_node
;
2656 else if (this->results_
->size() == 1)
2657 result
= this->results_
->begin()->type()->get_tree(gogo
);
2660 result
= make_node(RECORD_TYPE
);
2661 tree field_trees
= NULL_TREE
;
2662 tree
* pp
= &field_trees
;
2663 for (Typed_identifier_list::const_iterator p
= this->results_
->begin();
2664 p
!= this->results_
->end();
2667 const std::string name
= (p
->name().empty()
2669 : Gogo::unpack_hidden_name(p
->name()));
2670 tree name_tree
= get_identifier_with_length(name
.data(),
2672 tree field_type_tree
= p
->type()->get_tree(gogo
);
2673 if (field_type_tree
== error_mark_node
)
2674 return error_mark_node
;
2675 tree field
= build_decl(this->location_
, FIELD_DECL
, name_tree
,
2677 DECL_CONTEXT(field
) = result
;
2679 pp
= &DECL_CHAIN(field
);
2681 TYPE_FIELDS(result
) = field_trees
;
2682 layout_type(result
);
2685 if (result
== error_mark_node
)
2686 return error_mark_node
;
2688 tree fntype
= build_function_type(result
, args
);
2689 if (fntype
== error_mark_node
)
2692 return build_pointer_type(fntype
);
2695 // Functions are initialized to NULL.
2698 Function_type::do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
2702 return fold_convert(type_tree
, null_pointer_node
);
2705 // The type of a function type descriptor.
2708 Function_type::make_function_type_descriptor_type()
2713 Type
* tdt
= Type::make_type_descriptor_type();
2714 Type
* ptdt
= Type::make_type_descriptor_ptr_type();
2716 Type
* bool_type
= Type::lookup_bool_type();
2718 Type
* slice_type
= Type::make_array_type(ptdt
, NULL
);
2720 Struct_type
* s
= Type::make_builtin_struct_type(4,
2722 "dotdotdot", bool_type
,
2726 ret
= Type::make_builtin_named_type("FuncType", s
);
2732 // The type descriptor for a function type.
2735 Function_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
2737 source_location bloc
= BUILTINS_LOCATION
;
2739 Type
* ftdt
= Function_type::make_function_type_descriptor_type();
2741 const Struct_field_list
* fields
= ftdt
->struct_type()->fields();
2743 Expression_list
* vals
= new Expression_list();
2746 Struct_field_list::const_iterator p
= fields
->begin();
2747 gcc_assert(p
->field_name() == "commonType");
2748 vals
->push_back(this->type_descriptor_constructor(gogo
,
2749 RUNTIME_TYPE_KIND_FUNC
,
2753 gcc_assert(p
->field_name() == "dotdotdot");
2754 vals
->push_back(Expression::make_boolean(this->is_varargs(), bloc
));
2757 gcc_assert(p
->field_name() == "in");
2758 vals
->push_back(this->type_descriptor_params(p
->type(), this->receiver(),
2759 this->parameters()));
2762 gcc_assert(p
->field_name() == "out");
2763 vals
->push_back(this->type_descriptor_params(p
->type(), NULL
,
2767 gcc_assert(p
== fields
->end());
2769 return Expression::make_struct_composite_literal(ftdt
, vals
, bloc
);
2772 // Return a composite literal for the parameters or results of a type
2776 Function_type::type_descriptor_params(Type
* params_type
,
2777 const Typed_identifier
* receiver
,
2778 const Typed_identifier_list
* params
)
2780 source_location bloc
= BUILTINS_LOCATION
;
2782 if (receiver
== NULL
&& params
== NULL
)
2783 return Expression::make_slice_composite_literal(params_type
, NULL
, bloc
);
2785 Expression_list
* vals
= new Expression_list();
2786 vals
->reserve((params
== NULL
? 0 : params
->size())
2787 + (receiver
!= NULL
? 1 : 0));
2789 if (receiver
!= NULL
)
2791 Type
* rtype
= receiver
->type();
2792 // The receiver is always passed as a pointer. FIXME: Is this
2793 // right? Should that fact affect the type descriptor?
2794 if (rtype
->points_to() == NULL
)
2795 rtype
= Type::make_pointer_type(rtype
);
2796 vals
->push_back(Expression::make_type_descriptor(rtype
, bloc
));
2801 for (Typed_identifier_list::const_iterator p
= params
->begin();
2804 vals
->push_back(Expression::make_type_descriptor(p
->type(), bloc
));
2807 return Expression::make_slice_composite_literal(params_type
, vals
, bloc
);
2810 // The reflection string.
2813 Function_type::do_reflection(Gogo
* gogo
, std::string
* ret
) const
2815 // FIXME: Turn this off until we straighten out the type of the
2816 // struct field used in a go statement which calls a method.
2817 // gcc_assert(this->receiver_ == NULL);
2819 ret
->append("func");
2821 if (this->receiver_
!= NULL
)
2823 ret
->push_back('(');
2824 this->append_reflection(this->receiver_
->type(), gogo
, ret
);
2825 ret
->push_back(')');
2828 ret
->push_back('(');
2829 const Typed_identifier_list
* params
= this->parameters();
2832 bool is_varargs
= this->is_varargs_
;
2833 for (Typed_identifier_list::const_iterator p
= params
->begin();
2837 if (p
!= params
->begin())
2839 if (!is_varargs
|| p
+ 1 != params
->end())
2840 this->append_reflection(p
->type(), gogo
, ret
);
2844 this->append_reflection(p
->type()->array_type()->element_type(),
2849 ret
->push_back(')');
2851 const Typed_identifier_list
* results
= this->results();
2852 if (results
!= NULL
&& !results
->empty())
2854 if (results
->size() == 1)
2855 ret
->push_back(' ');
2858 for (Typed_identifier_list::const_iterator p
= results
->begin();
2859 p
!= results
->end();
2862 if (p
!= results
->begin())
2864 this->append_reflection(p
->type(), gogo
, ret
);
2866 if (results
->size() > 1)
2867 ret
->push_back(')');
2874 Function_type::do_mangled_name(Gogo
* gogo
, std::string
* ret
) const
2876 ret
->push_back('F');
2878 if (this->receiver_
!= NULL
)
2880 ret
->push_back('m');
2881 this->append_mangled_name(this->receiver_
->type(), gogo
, ret
);
2884 const Typed_identifier_list
* params
= this->parameters();
2887 ret
->push_back('p');
2888 for (Typed_identifier_list::const_iterator p
= params
->begin();
2891 this->append_mangled_name(p
->type(), gogo
, ret
);
2892 if (this->is_varargs_
)
2893 ret
->push_back('V');
2894 ret
->push_back('e');
2897 const Typed_identifier_list
* results
= this->results();
2898 if (results
!= NULL
)
2900 ret
->push_back('r');
2901 for (Typed_identifier_list::const_iterator p
= results
->begin();
2902 p
!= results
->end();
2904 this->append_mangled_name(p
->type(), gogo
, ret
);
2905 ret
->push_back('e');
2908 ret
->push_back('e');
2911 // Export a function type.
2914 Function_type::do_export(Export
* exp
) const
2916 // We don't write out the receiver. The only function types which
2917 // should have a receiver are the ones associated with explicitly
2918 // defined methods. For those the receiver type is written out by
2919 // Function::export_func.
2921 exp
->write_c_string("(");
2923 if (this->parameters_
!= NULL
)
2925 bool is_varargs
= this->is_varargs_
;
2926 for (Typed_identifier_list::const_iterator p
=
2927 this->parameters_
->begin();
2928 p
!= this->parameters_
->end();
2934 exp
->write_c_string(", ");
2935 if (!is_varargs
|| p
+ 1 != this->parameters_
->end())
2936 exp
->write_type(p
->type());
2939 exp
->write_c_string("...");
2940 exp
->write_type(p
->type()->array_type()->element_type());
2944 exp
->write_c_string(")");
2946 const Typed_identifier_list
* results
= this->results_
;
2947 if (results
!= NULL
)
2949 exp
->write_c_string(" ");
2950 if (results
->size() == 1)
2951 exp
->write_type(results
->begin()->type());
2955 exp
->write_c_string("(");
2956 for (Typed_identifier_list::const_iterator p
= results
->begin();
2957 p
!= results
->end();
2963 exp
->write_c_string(", ");
2964 exp
->write_type(p
->type());
2966 exp
->write_c_string(")");
2971 // Import a function type.
2974 Function_type::do_import(Import
* imp
)
2976 imp
->require_c_string("(");
2977 Typed_identifier_list
* parameters
;
2978 bool is_varargs
= false;
2979 if (imp
->peek_char() == ')')
2983 parameters
= new Typed_identifier_list();
2986 if (imp
->match_c_string("..."))
2992 Type
* ptype
= imp
->read_type();
2994 ptype
= Type::make_array_type(ptype
, NULL
);
2995 parameters
->push_back(Typed_identifier(Import::import_marker
,
2996 ptype
, imp
->location()));
2997 if (imp
->peek_char() != ',')
2999 gcc_assert(!is_varargs
);
3000 imp
->require_c_string(", ");
3003 imp
->require_c_string(")");
3005 Typed_identifier_list
* results
;
3006 if (imp
->peek_char() != ' ')
3011 results
= new Typed_identifier_list
;
3012 if (imp
->peek_char() != '(')
3014 Type
* rtype
= imp
->read_type();
3015 results
->push_back(Typed_identifier(Import::import_marker
, rtype
,
3023 Type
* rtype
= imp
->read_type();
3024 results
->push_back(Typed_identifier(Import::import_marker
,
3025 rtype
, imp
->location()));
3026 if (imp
->peek_char() != ',')
3028 imp
->require_c_string(", ");
3030 imp
->require_c_string(")");
3034 Function_type
* ret
= Type::make_function_type(NULL
, parameters
, results
,
3037 ret
->set_is_varargs();
3041 // Make a copy of a function type without a receiver.
3044 Function_type::copy_without_receiver() const
3046 gcc_assert(this->is_method());
3047 Function_type
*ret
= Type::make_function_type(NULL
, this->parameters_
,
3050 if (this->is_varargs())
3051 ret
->set_is_varargs();
3052 if (this->is_builtin())
3053 ret
->set_is_builtin();
3057 // Make a copy of a function type with a receiver.
3060 Function_type::copy_with_receiver(Type
* receiver_type
) const
3062 gcc_assert(!this->is_method());
3063 Typed_identifier
* receiver
= new Typed_identifier("", receiver_type
,
3065 return Type::make_function_type(receiver
, this->parameters_
,
3066 this->results_
, this->location_
);
3069 // Make a function type.
3072 Type::make_function_type(Typed_identifier
* receiver
,
3073 Typed_identifier_list
* parameters
,
3074 Typed_identifier_list
* results
,
3075 source_location location
)
3077 return new Function_type(receiver
, parameters
, results
, location
);
3080 // Class Pointer_type.
3085 Pointer_type::do_traverse(Traverse
* traverse
)
3087 return Type::traverse(this->to_type_
, traverse
);
3093 Pointer_type::do_hash_for_method(Gogo
* gogo
) const
3095 return this->to_type_
->hash_for_method(gogo
) << 4;
3098 // The tree for a pointer type.
3101 Pointer_type::do_get_tree(Gogo
* gogo
)
3103 return build_pointer_type(this->to_type_
->get_tree(gogo
));
3106 // Initialize a pointer type.
3109 Pointer_type::do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
3113 return fold_convert(type_tree
, null_pointer_node
);
3116 // The type of a pointer type descriptor.
3119 Pointer_type::make_pointer_type_descriptor_type()
3124 Type
* tdt
= Type::make_type_descriptor_type();
3125 Type
* ptdt
= Type::make_type_descriptor_ptr_type();
3127 Struct_type
* s
= Type::make_builtin_struct_type(2,
3131 ret
= Type::make_builtin_named_type("PtrType", s
);
3137 // The type descriptor for a pointer type.
3140 Pointer_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
3142 if (this->is_unsafe_pointer_type())
3144 gcc_assert(name
!= NULL
);
3145 return this->plain_type_descriptor(gogo
,
3146 RUNTIME_TYPE_KIND_UNSAFE_POINTER
,
3151 source_location bloc
= BUILTINS_LOCATION
;
3153 const Methods
* methods
;
3154 Type
* deref
= this->points_to();
3155 if (deref
->named_type() != NULL
)
3156 methods
= deref
->named_type()->methods();
3157 else if (deref
->struct_type() != NULL
)
3158 methods
= deref
->struct_type()->methods();
3162 Type
* ptr_tdt
= Pointer_type::make_pointer_type_descriptor_type();
3164 const Struct_field_list
* fields
= ptr_tdt
->struct_type()->fields();
3166 Expression_list
* vals
= new Expression_list();
3169 Struct_field_list::const_iterator p
= fields
->begin();
3170 gcc_assert(p
->field_name() == "commonType");
3171 vals
->push_back(this->type_descriptor_constructor(gogo
,
3172 RUNTIME_TYPE_KIND_PTR
,
3173 name
, methods
, false));
3176 gcc_assert(p
->field_name() == "elem");
3177 vals
->push_back(Expression::make_type_descriptor(deref
, bloc
));
3179 return Expression::make_struct_composite_literal(ptr_tdt
, vals
, bloc
);
3183 // Reflection string.
3186 Pointer_type::do_reflection(Gogo
* gogo
, std::string
* ret
) const
3188 ret
->push_back('*');
3189 this->append_reflection(this->to_type_
, gogo
, ret
);
3195 Pointer_type::do_mangled_name(Gogo
* gogo
, std::string
* ret
) const
3197 ret
->push_back('p');
3198 this->append_mangled_name(this->to_type_
, gogo
, ret
);
3204 Pointer_type::do_export(Export
* exp
) const
3206 exp
->write_c_string("*");
3207 if (this->is_unsafe_pointer_type())
3208 exp
->write_c_string("any");
3210 exp
->write_type(this->to_type_
);
3216 Pointer_type::do_import(Import
* imp
)
3218 imp
->require_c_string("*");
3219 if (imp
->match_c_string("any"))
3222 return Type::make_pointer_type(Type::make_void_type());
3224 Type
* to
= imp
->read_type();
3225 return Type::make_pointer_type(to
);
3228 // Make a pointer type.
3231 Type::make_pointer_type(Type
* to_type
)
3233 typedef Unordered_map(Type
*, Pointer_type
*) Hashtable
;
3234 static Hashtable pointer_types
;
3235 Hashtable::const_iterator p
= pointer_types
.find(to_type
);
3236 if (p
!= pointer_types
.end())
3238 Pointer_type
* ret
= new Pointer_type(to_type
);
3239 pointer_types
[to_type
] = ret
;
3243 // The nil type. We use a special type for nil because it is not the
3244 // same as any other type. In C term nil has type void*, but there is
3245 // no such type in Go.
3247 class Nil_type
: public Type
3257 { return ptr_type_node
; }
3260 do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
3261 { return is_clear
? NULL
: fold_convert(type_tree
, null_pointer_node
); }
3264 do_type_descriptor(Gogo
*, Named_type
*)
3265 { gcc_unreachable(); }
3268 do_reflection(Gogo
*, std::string
*) const
3269 { gcc_unreachable(); }
3272 do_mangled_name(Gogo
*, std::string
* ret
) const
3273 { ret
->push_back('n'); }
3276 // Make the nil type.
3279 Type::make_nil_type()
3281 static Nil_type singleton_nil_type
;
3282 return &singleton_nil_type
;
3285 // The type of a function call which returns multiple values. This is
3286 // really a struct, but we don't want to confuse a function call which
3287 // returns a struct with a function call which returns multiple
3290 class Call_multiple_result_type
: public Type
3293 Call_multiple_result_type(Call_expression
* call
)
3294 : Type(TYPE_CALL_MULTIPLE_RESULT
),
3300 do_has_pointer() const
3302 gcc_assert(saw_errors());
3310 do_get_init_tree(Gogo
*, tree
, bool)
3312 gcc_assert(saw_errors());
3313 return error_mark_node
;
3317 do_type_descriptor(Gogo
*, Named_type
*)
3319 gcc_assert(saw_errors());
3320 return Expression::make_error(UNKNOWN_LOCATION
);
3324 do_reflection(Gogo
*, std::string
*) const
3325 { gcc_assert(saw_errors()); }
3328 do_mangled_name(Gogo
*, std::string
*) const
3329 { gcc_assert(saw_errors()); }
3332 // The expression being called.
3333 Call_expression
* call_
;
3336 // Return the tree for a call result.
3339 Call_multiple_result_type::do_get_tree(Gogo
* gogo
)
3341 Function_type
* fntype
= this->call_
->get_function_type();
3342 gcc_assert(fntype
!= NULL
);
3343 const Typed_identifier_list
* results
= fntype
->results();
3344 gcc_assert(results
!= NULL
&& results
->size() > 1);
3345 tree fntype_tree
= fntype
->get_tree(gogo
);
3346 if (fntype_tree
== error_mark_node
)
3347 return error_mark_node
;
3348 return TREE_TYPE(fntype_tree
);
3351 // Make a call result type.
3354 Type::make_call_multiple_result_type(Call_expression
* call
)
3356 return new Call_multiple_result_type(call
);
3359 // Class Struct_field.
3361 // Get the name of a field.
3364 Struct_field::field_name() const
3366 const std::string
& name(this->typed_identifier_
.name());
3371 // This is called during parsing, before anything is lowered, so
3372 // we have to be pretty careful to avoid dereferencing an
3373 // unknown type name.
3374 Type
* t
= this->typed_identifier_
.type();
3376 if (t
->classification() == Type::TYPE_POINTER
)
3379 Pointer_type
* ptype
= static_cast<Pointer_type
*>(t
);
3380 dt
= ptype
->points_to();
3382 if (dt
->forward_declaration_type() != NULL
)
3383 return dt
->forward_declaration_type()->name();
3384 else if (dt
->named_type() != NULL
)
3385 return dt
->named_type()->name();
3386 else if (t
->is_error_type() || dt
->is_error_type())
3388 static const std::string error_string
= "*error*";
3389 return error_string
;
3393 // Avoid crashing in the erroneous case where T is named but
3395 gcc_assert(t
!= dt
);
3396 if (t
->forward_declaration_type() != NULL
)
3397 return t
->forward_declaration_type()->name();
3398 else if (t
->named_type() != NULL
)
3399 return t
->named_type()->name();
3406 // Class Struct_type.
3411 Struct_type::do_traverse(Traverse
* traverse
)
3413 Struct_field_list
* fields
= this->fields_
;
3416 for (Struct_field_list::iterator p
= fields
->begin();
3420 if (Type::traverse(p
->type(), traverse
) == TRAVERSE_EXIT
)
3421 return TRAVERSE_EXIT
;
3424 return TRAVERSE_CONTINUE
;
3427 // Verify that the struct type is complete and valid.
3430 Struct_type::do_verify()
3432 Struct_field_list
* fields
= this->fields_
;
3436 for (Struct_field_list::iterator p
= fields
->begin();
3440 Type
* t
= p
->type();
3441 if (t
->is_undefined())
3443 error_at(p
->location(), "struct field type is incomplete");
3444 p
->set_type(Type::make_error_type());
3447 else if (p
->is_anonymous())
3449 if (t
->named_type() != NULL
&& t
->points_to() != NULL
)
3451 error_at(p
->location(), "embedded type may not be a pointer");
3452 p
->set_type(Type::make_error_type());
3460 // Whether this contains a pointer.
3463 Struct_type::do_has_pointer() const
3465 const Struct_field_list
* fields
= this->fields();
3468 for (Struct_field_list::const_iterator p
= fields
->begin();
3472 if (p
->type()->has_pointer())
3478 // Whether this type is identical to T.
3481 Struct_type::is_identical(const Struct_type
* t
,
3482 bool errors_are_identical
) const
3484 const Struct_field_list
* fields1
= this->fields();
3485 const Struct_field_list
* fields2
= t
->fields();
3486 if (fields1
== NULL
|| fields2
== NULL
)
3487 return fields1
== fields2
;
3488 Struct_field_list::const_iterator pf2
= fields2
->begin();
3489 for (Struct_field_list::const_iterator pf1
= fields1
->begin();
3490 pf1
!= fields1
->end();
3493 if (pf2
== fields2
->end())
3495 if (pf1
->field_name() != pf2
->field_name())
3497 if (pf1
->is_anonymous() != pf2
->is_anonymous()
3498 || !Type::are_identical(pf1
->type(), pf2
->type(),
3499 errors_are_identical
, NULL
))
3501 if (!pf1
->has_tag())
3508 if (!pf2
->has_tag())
3510 if (pf1
->tag() != pf2
->tag())
3514 if (pf2
!= fields2
->end())
3519 // Whether this struct type has any hidden fields.
3522 Struct_type::struct_has_hidden_fields(const Named_type
* within
,
3523 std::string
* reason
) const
3525 const Struct_field_list
* fields
= this->fields();
3528 const Package
* within_package
= (within
== NULL
3530 : within
->named_object()->package());
3531 for (Struct_field_list::const_iterator pf
= fields
->begin();
3532 pf
!= fields
->end();
3535 if (within_package
!= NULL
3536 && !pf
->is_anonymous()
3537 && Gogo::is_hidden_name(pf
->field_name()))
3541 std::string within_name
= within
->named_object()->message_name();
3542 std::string name
= Gogo::message_name(pf
->field_name());
3543 size_t bufsize
= 200 + within_name
.length() + name
.length();
3544 char* buf
= new char[bufsize
];
3545 snprintf(buf
, bufsize
,
3546 _("implicit assignment of %s%s%s hidden field %s%s%s"),
3547 open_quote
, within_name
.c_str(), close_quote
,
3548 open_quote
, name
.c_str(), close_quote
);
3549 reason
->assign(buf
);
3555 if (pf
->type()->has_hidden_fields(within
, reason
))
3565 Struct_type::do_hash_for_method(Gogo
* gogo
) const
3567 unsigned int ret
= 0;
3568 if (this->fields() != NULL
)
3570 for (Struct_field_list::const_iterator pf
= this->fields()->begin();
3571 pf
!= this->fields()->end();
3573 ret
= (ret
<< 1) + pf
->type()->hash_for_method(gogo
);
3578 // Find the local field NAME.
3581 Struct_type::find_local_field(const std::string
& name
,
3582 unsigned int *pindex
) const
3584 const Struct_field_list
* fields
= this->fields_
;
3588 for (Struct_field_list::const_iterator pf
= fields
->begin();
3589 pf
!= fields
->end();
3592 if (pf
->field_name() == name
)
3602 // Return an expression for field NAME in STRUCT_EXPR, or NULL.
3604 Field_reference_expression
*
3605 Struct_type::field_reference(Expression
* struct_expr
, const std::string
& name
,
3606 source_location location
) const
3609 return this->field_reference_depth(struct_expr
, name
, location
, NULL
,
3613 // Return an expression for a field, along with the depth at which it
3616 Field_reference_expression
*
3617 Struct_type::field_reference_depth(Expression
* struct_expr
,
3618 const std::string
& name
,
3619 source_location location
,
3620 Saw_named_type
* saw
,
3621 unsigned int* depth
) const
3623 const Struct_field_list
* fields
= this->fields_
;
3627 // Look for a field with this name.
3629 for (Struct_field_list::const_iterator pf
= fields
->begin();
3630 pf
!= fields
->end();
3633 if (pf
->field_name() == name
)
3636 return Expression::make_field_reference(struct_expr
, i
, location
);
3640 // Look for an anonymous field which contains a field with this
3642 unsigned int found_depth
= 0;
3643 Field_reference_expression
* ret
= NULL
;
3645 for (Struct_field_list::const_iterator pf
= fields
->begin();
3646 pf
!= fields
->end();
3649 if (!pf
->is_anonymous())
3652 Struct_type
* st
= pf
->type()->deref()->struct_type();
3656 Saw_named_type
* hold_saw
= saw
;
3657 Saw_named_type saw_here
;
3658 Named_type
* nt
= pf
->type()->named_type();
3660 nt
= pf
->type()->deref()->named_type();
3664 for (q
= saw
; q
!= NULL
; q
= q
->next
)
3668 // If this is an error, it will be reported
3675 saw_here
.next
= saw
;
3680 // Look for a reference using a NULL struct expression. If we
3681 // find one, fill in the struct expression with a reference to
3683 unsigned int subdepth
;
3684 Field_reference_expression
* sub
= st
->field_reference_depth(NULL
, name
,
3694 if (ret
== NULL
|| subdepth
< found_depth
)
3699 found_depth
= subdepth
;
3700 Expression
* here
= Expression::make_field_reference(struct_expr
, i
,
3702 if (pf
->type()->points_to() != NULL
)
3703 here
= Expression::make_unary(OPERATOR_MULT
, here
, location
);
3704 while (sub
->expr() != NULL
)
3706 sub
= sub
->expr()->deref()->field_reference_expression();
3707 gcc_assert(sub
!= NULL
);
3709 sub
->set_struct_expression(here
);
3711 else if (subdepth
> found_depth
)
3715 // We do not handle ambiguity here--it should be handled by
3716 // Type::bind_field_or_method.
3724 *depth
= found_depth
+ 1;
3729 // Return the total number of fields, including embedded fields.
3732 Struct_type::total_field_count() const
3734 if (this->fields_
== NULL
)
3736 unsigned int ret
= 0;
3737 for (Struct_field_list::const_iterator pf
= this->fields_
->begin();
3738 pf
!= this->fields_
->end();
3741 if (!pf
->is_anonymous() || pf
->type()->deref()->struct_type() == NULL
)
3744 ret
+= pf
->type()->struct_type()->total_field_count();
3749 // Return whether NAME is an unexported field, for better error reporting.
3752 Struct_type::is_unexported_local_field(Gogo
* gogo
,
3753 const std::string
& name
) const
3755 const Struct_field_list
* fields
= this->fields_
;
3758 for (Struct_field_list::const_iterator pf
= fields
->begin();
3759 pf
!= fields
->end();
3762 const std::string
& field_name(pf
->field_name());
3763 if (Gogo::is_hidden_name(field_name
)
3764 && name
== Gogo::unpack_hidden_name(field_name
)
3765 && gogo
->pack_hidden_name(name
, false) != field_name
)
3772 // Finalize the methods of an unnamed struct.
3775 Struct_type::finalize_methods(Gogo
* gogo
)
3777 if (this->all_methods_
!= NULL
)
3779 Type::finalize_methods(gogo
, this, this->location_
, &this->all_methods_
);
3782 // Return the method NAME, or NULL if there isn't one or if it is
3783 // ambiguous. Set *IS_AMBIGUOUS if the method exists but is
3787 Struct_type::method_function(const std::string
& name
, bool* is_ambiguous
) const
3789 return Type::method_function(this->all_methods_
, name
, is_ambiguous
);
3792 // Get the tree for a struct type.
3795 Struct_type::do_get_tree(Gogo
* gogo
)
3797 tree type
= make_node(RECORD_TYPE
);
3798 return this->fill_in_tree(gogo
, type
);
3801 // Fill in the fields for a struct type.
3804 Struct_type::fill_in_tree(Gogo
* gogo
, tree type
)
3806 tree field_trees
= NULL_TREE
;
3807 tree
* pp
= &field_trees
;
3808 for (Struct_field_list::const_iterator p
= this->fields_
->begin();
3809 p
!= this->fields_
->end();
3812 std::string name
= Gogo::unpack_hidden_name(p
->field_name());
3813 tree name_tree
= get_identifier_with_length(name
.data(), name
.length());
3815 tree field_type_tree
= p
->type()->get_tree(gogo
);
3816 if (field_type_tree
== error_mark_node
)
3817 return error_mark_node
;
3818 gcc_assert(TYPE_SIZE(field_type_tree
) != NULL_TREE
);
3820 tree field
= build_decl(p
->location(), FIELD_DECL
, name_tree
,
3822 DECL_CONTEXT(field
) = type
;
3824 pp
= &DECL_CHAIN(field
);
3827 TYPE_FIELDS(type
) = field_trees
;
3834 // Initialize struct fields.
3837 Struct_type::do_get_init_tree(Gogo
* gogo
, tree type_tree
, bool is_clear
)
3839 if (this->fields_
== NULL
|| this->fields_
->empty())
3845 tree ret
= build_constructor(type_tree
,
3846 VEC_alloc(constructor_elt
, gc
, 0));
3847 TREE_CONSTANT(ret
) = 1;
3852 bool is_constant
= true;
3853 bool any_fields_set
= false;
3854 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
,
3855 this->fields_
->size());
3857 tree field
= TYPE_FIELDS(type_tree
);
3858 for (Struct_field_list::const_iterator p
= this->fields_
->begin();
3859 p
!= this->fields_
->end();
3860 ++p
, field
= DECL_CHAIN(field
))
3862 tree value
= p
->type()->get_init_tree(gogo
, is_clear
);
3863 if (value
== error_mark_node
)
3864 return error_mark_node
;
3865 gcc_assert(field
!= NULL_TREE
);
3868 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
3871 any_fields_set
= true;
3872 if (!TREE_CONSTANT(value
))
3873 is_constant
= false;
3876 gcc_assert(field
== NULL_TREE
);
3878 if (!any_fields_set
)
3880 gcc_assert(is_clear
);
3881 VEC_free(constructor_elt
, gc
, init
);
3885 tree ret
= build_constructor(type_tree
, init
);
3887 TREE_CONSTANT(ret
) = 1;
3891 // The type of a struct type descriptor.
3894 Struct_type::make_struct_type_descriptor_type()
3899 Type
* tdt
= Type::make_type_descriptor_type();
3900 Type
* ptdt
= Type::make_type_descriptor_ptr_type();
3902 Type
* uintptr_type
= Type::lookup_integer_type("uintptr");
3903 Type
* string_type
= Type::lookup_string_type();
3904 Type
* pointer_string_type
= Type::make_pointer_type(string_type
);
3907 Type::make_builtin_struct_type(5,
3908 "name", pointer_string_type
,
3909 "pkgPath", pointer_string_type
,
3911 "tag", pointer_string_type
,
3912 "offset", uintptr_type
);
3913 Type
* nsf
= Type::make_builtin_named_type("structField", sf
);
3915 Type
* slice_type
= Type::make_array_type(nsf
, NULL
);
3917 Struct_type
* s
= Type::make_builtin_struct_type(2,
3919 "fields", slice_type
);
3921 ret
= Type::make_builtin_named_type("StructType", s
);
3927 // Build a type descriptor for a struct type.
3930 Struct_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
3932 source_location bloc
= BUILTINS_LOCATION
;
3934 Type
* stdt
= Struct_type::make_struct_type_descriptor_type();
3936 const Struct_field_list
* fields
= stdt
->struct_type()->fields();
3938 Expression_list
* vals
= new Expression_list();
3941 const Methods
* methods
= this->methods();
3942 // A named struct should not have methods--the methods should attach
3943 // to the named type.
3944 gcc_assert(methods
== NULL
|| name
== NULL
);
3946 Struct_field_list::const_iterator ps
= fields
->begin();
3947 gcc_assert(ps
->field_name() == "commonType");
3948 vals
->push_back(this->type_descriptor_constructor(gogo
,
3949 RUNTIME_TYPE_KIND_STRUCT
,
3950 name
, methods
, true));
3953 gcc_assert(ps
->field_name() == "fields");
3955 Expression_list
* elements
= new Expression_list();
3956 elements
->reserve(this->fields_
->size());
3957 Type
* element_type
= ps
->type()->array_type()->element_type();
3958 for (Struct_field_list::const_iterator pf
= this->fields_
->begin();
3959 pf
!= this->fields_
->end();
3962 const Struct_field_list
* f
= element_type
->struct_type()->fields();
3964 Expression_list
* fvals
= new Expression_list();
3967 Struct_field_list::const_iterator q
= f
->begin();
3968 gcc_assert(q
->field_name() == "name");
3969 if (pf
->is_anonymous())
3970 fvals
->push_back(Expression::make_nil(bloc
));
3973 std::string n
= Gogo::unpack_hidden_name(pf
->field_name());
3974 Expression
* s
= Expression::make_string(n
, bloc
);
3975 fvals
->push_back(Expression::make_unary(OPERATOR_AND
, s
, bloc
));
3979 gcc_assert(q
->field_name() == "pkgPath");
3980 if (!Gogo::is_hidden_name(pf
->field_name()))
3981 fvals
->push_back(Expression::make_nil(bloc
));
3984 std::string n
= Gogo::hidden_name_prefix(pf
->field_name());
3985 Expression
* s
= Expression::make_string(n
, bloc
);
3986 fvals
->push_back(Expression::make_unary(OPERATOR_AND
, s
, bloc
));
3990 gcc_assert(q
->field_name() == "typ");
3991 fvals
->push_back(Expression::make_type_descriptor(pf
->type(), bloc
));
3994 gcc_assert(q
->field_name() == "tag");
3996 fvals
->push_back(Expression::make_nil(bloc
));
3999 Expression
* s
= Expression::make_string(pf
->tag(), bloc
);
4000 fvals
->push_back(Expression::make_unary(OPERATOR_AND
, s
, bloc
));
4004 gcc_assert(q
->field_name() == "offset");
4005 fvals
->push_back(Expression::make_struct_field_offset(this, &*pf
));
4007 Expression
* v
= Expression::make_struct_composite_literal(element_type
,
4009 elements
->push_back(v
);
4012 vals
->push_back(Expression::make_slice_composite_literal(ps
->type(),
4015 return Expression::make_struct_composite_literal(stdt
, vals
, bloc
);
4018 // Reflection string.
4021 Struct_type::do_reflection(Gogo
* gogo
, std::string
* ret
) const
4023 ret
->append("struct { ");
4025 for (Struct_field_list::const_iterator p
= this->fields_
->begin();
4026 p
!= this->fields_
->end();
4029 if (p
!= this->fields_
->begin())
4031 if (p
->is_anonymous())
4032 ret
->push_back('?');
4034 ret
->append(Gogo::unpack_hidden_name(p
->field_name()));
4035 ret
->push_back(' ');
4036 this->append_reflection(p
->type(), gogo
, ret
);
4040 const std::string
& tag(p
->tag());
4042 for (std::string::const_iterator p
= tag
.begin();
4047 ret
->append("\\x00");
4048 else if (*p
== '\n')
4050 else if (*p
== '\t')
4053 ret
->append("\\\"");
4054 else if (*p
== '\\')
4055 ret
->append("\\\\");
4059 ret
->push_back('"');
4069 Struct_type::do_mangled_name(Gogo
* gogo
, std::string
* ret
) const
4071 ret
->push_back('S');
4073 const Struct_field_list
* fields
= this->fields_
;
4076 for (Struct_field_list::const_iterator p
= fields
->begin();
4080 if (p
->is_anonymous())
4084 std::string n
= Gogo::unpack_hidden_name(p
->field_name());
4086 snprintf(buf
, sizeof buf
, "%u_",
4087 static_cast<unsigned int>(n
.length()));
4091 this->append_mangled_name(p
->type(), gogo
, ret
);
4094 const std::string
& tag(p
->tag());
4096 for (std::string::const_iterator p
= tag
.begin();
4100 if (ISALNUM(*p
) || *p
== '_')
4105 snprintf(buf
, sizeof buf
, ".%x.",
4106 static_cast<unsigned int>(*p
));
4111 snprintf(buf
, sizeof buf
, "T%u_",
4112 static_cast<unsigned int>(out
.length()));
4119 ret
->push_back('e');
4125 Struct_type::do_export(Export
* exp
) const
4127 exp
->write_c_string("struct { ");
4128 const Struct_field_list
* fields
= this->fields_
;
4129 gcc_assert(fields
!= NULL
);
4130 for (Struct_field_list::const_iterator p
= fields
->begin();
4134 if (p
->is_anonymous())
4135 exp
->write_string("? ");
4138 exp
->write_string(p
->field_name());
4139 exp
->write_c_string(" ");
4141 exp
->write_type(p
->type());
4145 exp
->write_c_string(" ");
4146 Expression
* expr
= Expression::make_string(p
->tag(),
4148 expr
->export_expression(exp
);
4152 exp
->write_c_string("; ");
4154 exp
->write_c_string("}");
4160 Struct_type::do_import(Import
* imp
)
4162 imp
->require_c_string("struct { ");
4163 Struct_field_list
* fields
= new Struct_field_list
;
4164 if (imp
->peek_char() != '}')
4169 if (imp
->match_c_string("? "))
4173 name
= imp
->read_identifier();
4174 imp
->require_c_string(" ");
4176 Type
* ftype
= imp
->read_type();
4178 Struct_field
sf(Typed_identifier(name
, ftype
, imp
->location()));
4180 if (imp
->peek_char() == ' ')
4183 Expression
* expr
= Expression::import_expression(imp
);
4184 String_expression
* sexpr
= expr
->string_expression();
4185 gcc_assert(sexpr
!= NULL
);
4186 sf
.set_tag(sexpr
->val());
4190 imp
->require_c_string("; ");
4191 fields
->push_back(sf
);
4192 if (imp
->peek_char() == '}')
4196 imp
->require_c_string("}");
4198 return Type::make_struct_type(fields
, imp
->location());
4201 // Make a struct type.
4204 Type::make_struct_type(Struct_field_list
* fields
,
4205 source_location location
)
4207 return new Struct_type(fields
, location
);
4210 // Class Array_type.
4212 // Whether two array types are identical.
4215 Array_type::is_identical(const Array_type
* t
, bool errors_are_identical
) const
4217 if (!Type::are_identical(this->element_type(), t
->element_type(),
4218 errors_are_identical
, NULL
))
4221 Expression
* l1
= this->length();
4222 Expression
* l2
= t
->length();
4224 // Slices of the same element type are identical.
4225 if (l1
== NULL
&& l2
== NULL
)
4228 // Arrays of the same element type are identical if they have the
4230 if (l1
!= NULL
&& l2
!= NULL
)
4235 // Try to determine the lengths. If we can't, assume the arrays
4236 // are not identical.
4244 if (l1
->integer_constant_value(true, v1
, &type1
)
4245 && l2
->integer_constant_value(true, v2
, &type2
))
4246 ret
= mpz_cmp(v1
, v2
) == 0;
4252 // Otherwise the arrays are not identical.
4259 Array_type::do_traverse(Traverse
* traverse
)
4261 if (Type::traverse(this->element_type_
, traverse
) == TRAVERSE_EXIT
)
4262 return TRAVERSE_EXIT
;
4263 if (this->length_
!= NULL
4264 && Expression::traverse(&this->length_
, traverse
) == TRAVERSE_EXIT
)
4265 return TRAVERSE_EXIT
;
4266 return TRAVERSE_CONTINUE
;
4269 // Check that the length is valid.
4272 Array_type::verify_length()
4274 if (this->length_
== NULL
)
4277 Type_context
context(Type::lookup_integer_type("int"), false);
4278 this->length_
->determine_type(&context
);
4280 if (!this->length_
->is_constant())
4282 error_at(this->length_
->location(), "array bound is not constant");
4289 if (!this->length_
->integer_constant_value(true, val
, &vt
))
4293 if (!this->length_
->float_constant_value(fval
, &vt
))
4295 if (this->length_
->type()->integer_type() != NULL
4296 || this->length_
->type()->float_type() != NULL
)
4297 error_at(this->length_
->location(),
4298 "array bound is not constant");
4300 error_at(this->length_
->location(),
4301 "array bound is not numeric");
4306 if (!mpfr_integer_p(fval
))
4308 error_at(this->length_
->location(),
4309 "array bound truncated to integer");
4315 mpfr_get_z(val
, fval
, GMP_RNDN
);
4319 if (mpz_sgn(val
) < 0)
4321 error_at(this->length_
->location(), "negative array bound");
4326 Type
* int_type
= Type::lookup_integer_type("int");
4327 int tbits
= int_type
->integer_type()->bits();
4328 int vbits
= mpz_sizeinbase(val
, 2);
4329 if (vbits
+ 1 > tbits
)
4331 error_at(this->length_
->location(), "array bound overflows");
4344 Array_type::do_verify()
4346 if (!this->verify_length())
4348 this->length_
= Expression::make_error(this->length_
->location());
4354 // Array type hash code.
4357 Array_type::do_hash_for_method(Gogo
* gogo
) const
4359 // There is no very convenient way to get a hash code for the
4361 return this->element_type_
->hash_for_method(gogo
) + 1;
4364 // See if the expression passed to make is suitable. The first
4365 // argument is required, and gives the length. An optional second
4366 // argument is permitted for the capacity.
4369 Array_type::do_check_make_expression(Expression_list
* args
,
4370 source_location location
)
4372 gcc_assert(this->length_
== NULL
);
4373 if (args
== NULL
|| args
->empty())
4375 error_at(location
, "length required when allocating a slice");
4378 else if (args
->size() > 2)
4380 error_at(location
, "too many expressions passed to make");
4385 if (!Type::check_int_value(args
->front(),
4386 _("bad length when making slice"), location
))
4389 if (args
->size() > 1)
4391 if (!Type::check_int_value(args
->back(),
4392 _("bad capacity when making slice"),
4401 // Get a tree for the length of a fixed array. The length may be
4402 // computed using a function call, so we must only evaluate it once.
4405 Array_type::get_length_tree(Gogo
* gogo
)
4407 gcc_assert(this->length_
!= NULL
);
4408 if (this->length_tree_
== NULL_TREE
)
4413 if (this->length_
->integer_constant_value(true, val
, &t
))
4416 t
= Type::lookup_integer_type("int");
4417 else if (t
->is_abstract())
4418 t
= t
->make_non_abstract_type();
4419 tree tt
= t
->get_tree(gogo
);
4420 this->length_tree_
= Expression::integer_constant_tree(val
, tt
);
4427 // Make up a translation context for the array length
4428 // expression. FIXME: This won't work in general.
4429 Translate_context
context(gogo
, NULL
, NULL
, NULL_TREE
);
4430 tree len
= this->length_
->get_tree(&context
);
4431 if (len
!= error_mark_node
)
4433 len
= convert_to_integer(integer_type_node
, len
);
4434 len
= save_expr(len
);
4436 this->length_tree_
= len
;
4439 return this->length_tree_
;
4442 // Get a tree for the type of this array. A fixed array is simply
4443 // represented as ARRAY_TYPE with the appropriate index--i.e., it is
4444 // just like an array in C. An open array is a struct with three
4445 // fields: a data pointer, the length, and the capacity.
4448 Array_type::do_get_tree(Gogo
* gogo
)
4450 if (this->length_
== NULL
)
4452 tree struct_type
= gogo
->slice_type_tree(void_type_node
);
4453 return this->fill_in_slice_tree(gogo
, struct_type
);
4457 tree array_type
= make_node(ARRAY_TYPE
);
4458 return this->fill_in_array_tree(gogo
, array_type
);
4462 // Fill in the fields for an array type. This is used for named array
4466 Array_type::fill_in_array_tree(Gogo
* gogo
, tree array_type
)
4468 gcc_assert(this->length_
!= NULL
);
4470 tree element_type_tree
= this->element_type_
->get_tree(gogo
);
4471 tree length_tree
= this->get_length_tree(gogo
);
4472 if (element_type_tree
== error_mark_node
4473 || length_tree
== error_mark_node
)
4474 return error_mark_node
;
4476 gcc_assert(TYPE_SIZE(element_type_tree
) != NULL_TREE
);
4478 length_tree
= fold_convert(sizetype
, length_tree
);
4480 // build_index_type takes the maximum index, which is one less than
4482 tree index_type
= build_index_type(fold_build2(MINUS_EXPR
, sizetype
,
4486 TREE_TYPE(array_type
) = element_type_tree
;
4487 TYPE_DOMAIN(array_type
) = index_type
;
4488 TYPE_ADDR_SPACE(array_type
) = TYPE_ADDR_SPACE(element_type_tree
);
4489 layout_type(array_type
);
4491 if (TYPE_STRUCTURAL_EQUALITY_P(element_type_tree
)
4492 || TYPE_STRUCTURAL_EQUALITY_P(index_type
))
4493 SET_TYPE_STRUCTURAL_EQUALITY(array_type
);
4494 else if (TYPE_CANONICAL(element_type_tree
) != element_type_tree
4495 || TYPE_CANONICAL(index_type
) != index_type
)
4496 TYPE_CANONICAL(array_type
) =
4497 build_array_type(TYPE_CANONICAL(element_type_tree
),
4498 TYPE_CANONICAL(index_type
));
4503 // Fill in the fields for a slice type. This is used for named slice
4507 Array_type::fill_in_slice_tree(Gogo
* gogo
, tree struct_type
)
4509 gcc_assert(this->length_
== NULL
);
4511 tree element_type_tree
= this->element_type_
->get_tree(gogo
);
4512 if (element_type_tree
== error_mark_node
)
4513 return error_mark_node
;
4514 tree field
= TYPE_FIELDS(struct_type
);
4515 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__values") == 0);
4516 gcc_assert(POINTER_TYPE_P(TREE_TYPE(field
))
4517 && TREE_TYPE(TREE_TYPE(field
)) == void_type_node
);
4518 TREE_TYPE(field
) = build_pointer_type(element_type_tree
);
4523 // Return an initializer for an array type.
4526 Array_type::do_get_init_tree(Gogo
* gogo
, tree type_tree
, bool is_clear
)
4528 if (this->length_
== NULL
)
4535 gcc_assert(TREE_CODE(type_tree
) == RECORD_TYPE
);
4537 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 3);
4539 for (tree field
= TYPE_FIELDS(type_tree
);
4541 field
= DECL_CHAIN(field
))
4543 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
,
4546 elt
->value
= fold_convert(TREE_TYPE(field
), size_zero_node
);
4549 tree ret
= build_constructor(type_tree
, init
);
4550 TREE_CONSTANT(ret
) = 1;
4557 tree value
= this->element_type_
->get_init_tree(gogo
, is_clear
);
4560 if (value
== error_mark_node
)
4561 return error_mark_node
;
4563 tree length_tree
= this->get_length_tree(gogo
);
4564 if (length_tree
== error_mark_node
)
4565 return error_mark_node
;
4567 length_tree
= fold_convert(sizetype
, length_tree
);
4568 tree range
= build2(RANGE_EXPR
, sizetype
, size_zero_node
,
4569 fold_build2(MINUS_EXPR
, sizetype
,
4570 length_tree
, size_one_node
));
4571 tree ret
= build_constructor_single(type_tree
, range
, value
);
4572 if (TREE_CONSTANT(value
))
4573 TREE_CONSTANT(ret
) = 1;
4578 // Handle the builtin make function for a slice.
4581 Array_type::do_make_expression_tree(Translate_context
* context
,
4582 Expression_list
* args
,
4583 source_location location
)
4585 gcc_assert(this->length_
== NULL
);
4587 Gogo
* gogo
= context
->gogo();
4588 tree type_tree
= this->get_tree(gogo
);
4589 if (type_tree
== error_mark_node
)
4590 return error_mark_node
;
4592 tree values_field
= TYPE_FIELDS(type_tree
);
4593 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(values_field
)),
4596 tree count_field
= DECL_CHAIN(values_field
);
4597 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(count_field
)),
4600 tree element_type_tree
= this->element_type_
->get_tree(gogo
);
4601 if (element_type_tree
== error_mark_node
)
4602 return error_mark_node
;
4603 tree element_size_tree
= TYPE_SIZE_UNIT(element_type_tree
);
4605 tree value
= this->element_type_
->get_init_tree(gogo
, true);
4606 if (value
== error_mark_node
)
4607 return error_mark_node
;
4609 // The first argument is the number of elements, the optional second
4610 // argument is the capacity.
4611 gcc_assert(args
!= NULL
&& args
->size() >= 1 && args
->size() <= 2);
4613 tree length_tree
= args
->front()->get_tree(context
);
4614 if (length_tree
== error_mark_node
)
4615 return error_mark_node
;
4616 if (!DECL_P(length_tree
))
4617 length_tree
= save_expr(length_tree
);
4618 if (!INTEGRAL_TYPE_P(TREE_TYPE(length_tree
)))
4619 length_tree
= convert_to_integer(TREE_TYPE(count_field
), length_tree
);
4621 tree bad_index
= Expression::check_bounds(length_tree
,
4622 TREE_TYPE(count_field
),
4623 NULL_TREE
, location
);
4625 length_tree
= fold_convert_loc(location
, TREE_TYPE(count_field
), length_tree
);
4627 if (args
->size() == 1)
4628 capacity_tree
= length_tree
;
4631 capacity_tree
= args
->back()->get_tree(context
);
4632 if (capacity_tree
== error_mark_node
)
4633 return error_mark_node
;
4634 if (!DECL_P(capacity_tree
))
4635 capacity_tree
= save_expr(capacity_tree
);
4636 if (!INTEGRAL_TYPE_P(TREE_TYPE(capacity_tree
)))
4637 capacity_tree
= convert_to_integer(TREE_TYPE(count_field
),
4640 bad_index
= Expression::check_bounds(capacity_tree
,
4641 TREE_TYPE(count_field
),
4642 bad_index
, location
);
4644 tree chktype
= (((TYPE_SIZE(TREE_TYPE(capacity_tree
))
4645 > TYPE_SIZE(TREE_TYPE(length_tree
)))
4646 || ((TYPE_SIZE(TREE_TYPE(capacity_tree
))
4647 == TYPE_SIZE(TREE_TYPE(length_tree
)))
4648 && TYPE_UNSIGNED(TREE_TYPE(capacity_tree
))))
4649 ? TREE_TYPE(capacity_tree
)
4650 : TREE_TYPE(length_tree
));
4651 tree chk
= fold_build2_loc(location
, LT_EXPR
, boolean_type_node
,
4652 fold_convert_loc(location
, chktype
,
4654 fold_convert_loc(location
, chktype
,
4656 if (bad_index
== NULL_TREE
)
4659 bad_index
= fold_build2_loc(location
, TRUTH_OR_EXPR
, boolean_type_node
,
4662 capacity_tree
= fold_convert_loc(location
, TREE_TYPE(count_field
),
4666 tree size_tree
= fold_build2_loc(location
, MULT_EXPR
, sizetype
,
4668 fold_convert_loc(location
, sizetype
,
4671 tree chk
= fold_build2_loc(location
, TRUTH_AND_EXPR
, boolean_type_node
,
4672 fold_build2_loc(location
, GT_EXPR
,
4674 fold_convert_loc(location
,
4678 fold_build2_loc(location
, LT_EXPR
,
4680 size_tree
, element_size_tree
));
4681 if (bad_index
== NULL_TREE
)
4684 bad_index
= fold_build2_loc(location
, TRUTH_OR_EXPR
, boolean_type_node
,
4687 tree space
= context
->gogo()->allocate_memory(this->element_type_
,
4688 size_tree
, location
);
4690 if (value
!= NULL_TREE
)
4691 space
= save_expr(space
);
4693 space
= fold_convert(TREE_TYPE(values_field
), space
);
4695 if (bad_index
!= NULL_TREE
&& bad_index
!= boolean_false_node
)
4697 tree crash
= Gogo::runtime_error(RUNTIME_ERROR_MAKE_SLICE_OUT_OF_BOUNDS
,
4699 space
= build2(COMPOUND_EXPR
, TREE_TYPE(space
),
4700 build3(COND_EXPR
, void_type_node
,
4701 bad_index
, crash
, NULL_TREE
),
4705 tree constructor
= gogo
->slice_constructor(type_tree
, space
, length_tree
,
4708 if (value
== NULL_TREE
)
4710 // The array contents are zero initialized.
4714 // The elements must be initialized.
4716 tree max
= fold_build2_loc(location
, MINUS_EXPR
, TREE_TYPE(count_field
),
4718 fold_convert_loc(location
, TREE_TYPE(count_field
),
4721 tree array_type
= build_array_type(element_type_tree
,
4722 build_index_type(max
));
4724 tree value_pointer
= fold_convert_loc(location
,
4725 build_pointer_type(array_type
),
4728 tree range
= build2(RANGE_EXPR
, sizetype
, size_zero_node
, max
);
4729 tree space_init
= build_constructor_single(array_type
, range
, value
);
4731 return build2(COMPOUND_EXPR
, TREE_TYPE(constructor
),
4732 build2(MODIFY_EXPR
, void_type_node
,
4733 build_fold_indirect_ref(value_pointer
),
4738 // Return a tree for a pointer to the values in ARRAY.
4741 Array_type::value_pointer_tree(Gogo
*, tree array
) const
4744 if (this->length() != NULL
)
4747 ret
= fold_convert(build_pointer_type(TREE_TYPE(TREE_TYPE(array
))),
4748 build_fold_addr_expr(array
));
4753 tree field
= TYPE_FIELDS(TREE_TYPE(array
));
4754 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)),
4756 ret
= fold_build3(COMPONENT_REF
, TREE_TYPE(field
), array
, field
,
4759 if (TREE_CONSTANT(array
))
4760 TREE_CONSTANT(ret
) = 1;
4764 // Return a tree for the length of the array ARRAY which has this
4768 Array_type::length_tree(Gogo
* gogo
, tree array
)
4770 if (this->length_
!= NULL
)
4772 if (TREE_CODE(array
) == SAVE_EXPR
)
4773 return fold_convert(integer_type_node
, this->get_length_tree(gogo
));
4775 return omit_one_operand(integer_type_node
,
4776 this->get_length_tree(gogo
), array
);
4779 // This is an open array. We need to read the length field.
4781 tree type
= TREE_TYPE(array
);
4782 gcc_assert(TREE_CODE(type
) == RECORD_TYPE
);
4784 tree field
= DECL_CHAIN(TYPE_FIELDS(type
));
4785 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__count") == 0);
4787 tree ret
= build3(COMPONENT_REF
, TREE_TYPE(field
), array
, field
, NULL_TREE
);
4788 if (TREE_CONSTANT(array
))
4789 TREE_CONSTANT(ret
) = 1;
4793 // Return a tree for the capacity of the array ARRAY which has this
4797 Array_type::capacity_tree(Gogo
* gogo
, tree array
)
4799 if (this->length_
!= NULL
)
4800 return omit_one_operand(sizetype
, this->get_length_tree(gogo
), array
);
4802 // This is an open array. We need to read the capacity field.
4804 tree type
= TREE_TYPE(array
);
4805 gcc_assert(TREE_CODE(type
) == RECORD_TYPE
);
4807 tree field
= DECL_CHAIN(DECL_CHAIN(TYPE_FIELDS(type
)));
4808 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__capacity") == 0);
4810 return build3(COMPONENT_REF
, TREE_TYPE(field
), array
, field
, NULL_TREE
);
4816 Array_type::do_export(Export
* exp
) const
4818 exp
->write_c_string("[");
4819 if (this->length_
!= NULL
)
4820 this->length_
->export_expression(exp
);
4821 exp
->write_c_string("] ");
4822 exp
->write_type(this->element_type_
);
4828 Array_type::do_import(Import
* imp
)
4830 imp
->require_c_string("[");
4832 if (imp
->peek_char() == ']')
4835 length
= Expression::import_expression(imp
);
4836 imp
->require_c_string("] ");
4837 Type
* element_type
= imp
->read_type();
4838 return Type::make_array_type(element_type
, length
);
4841 // The type of an array type descriptor.
4844 Array_type::make_array_type_descriptor_type()
4849 Type
* tdt
= Type::make_type_descriptor_type();
4850 Type
* ptdt
= Type::make_type_descriptor_ptr_type();
4852 Type
* uintptr_type
= Type::lookup_integer_type("uintptr");
4855 Type::make_builtin_struct_type(3,
4858 "len", uintptr_type
);
4860 ret
= Type::make_builtin_named_type("ArrayType", sf
);
4866 // The type of an slice type descriptor.
4869 Array_type::make_slice_type_descriptor_type()
4874 Type
* tdt
= Type::make_type_descriptor_type();
4875 Type
* ptdt
= Type::make_type_descriptor_ptr_type();
4878 Type::make_builtin_struct_type(2,
4882 ret
= Type::make_builtin_named_type("SliceType", sf
);
4888 // Build a type descriptor for an array/slice type.
4891 Array_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
4893 if (this->length_
!= NULL
)
4894 return this->array_type_descriptor(gogo
, name
);
4896 return this->slice_type_descriptor(gogo
, name
);
4899 // Build a type descriptor for an array type.
4902 Array_type::array_type_descriptor(Gogo
* gogo
, Named_type
* name
)
4904 source_location bloc
= BUILTINS_LOCATION
;
4906 Type
* atdt
= Array_type::make_array_type_descriptor_type();
4908 const Struct_field_list
* fields
= atdt
->struct_type()->fields();
4910 Expression_list
* vals
= new Expression_list();
4913 Struct_field_list::const_iterator p
= fields
->begin();
4914 gcc_assert(p
->field_name() == "commonType");
4915 vals
->push_back(this->type_descriptor_constructor(gogo
,
4916 RUNTIME_TYPE_KIND_ARRAY
,
4920 gcc_assert(p
->field_name() == "elem");
4921 vals
->push_back(Expression::make_type_descriptor(this->element_type_
, bloc
));
4924 gcc_assert(p
->field_name() == "len");
4925 vals
->push_back(Expression::make_cast(p
->type(), this->length_
, bloc
));
4928 gcc_assert(p
== fields
->end());
4930 return Expression::make_struct_composite_literal(atdt
, vals
, bloc
);
4933 // Build a type descriptor for a slice type.
4936 Array_type::slice_type_descriptor(Gogo
* gogo
, Named_type
* name
)
4938 source_location bloc
= BUILTINS_LOCATION
;
4940 Type
* stdt
= Array_type::make_slice_type_descriptor_type();
4942 const Struct_field_list
* fields
= stdt
->struct_type()->fields();
4944 Expression_list
* vals
= new Expression_list();
4947 Struct_field_list::const_iterator p
= fields
->begin();
4948 gcc_assert(p
->field_name() == "commonType");
4949 vals
->push_back(this->type_descriptor_constructor(gogo
,
4950 RUNTIME_TYPE_KIND_SLICE
,
4954 gcc_assert(p
->field_name() == "elem");
4955 vals
->push_back(Expression::make_type_descriptor(this->element_type_
, bloc
));
4958 gcc_assert(p
== fields
->end());
4960 return Expression::make_struct_composite_literal(stdt
, vals
, bloc
);
4963 // Reflection string.
4966 Array_type::do_reflection(Gogo
* gogo
, std::string
* ret
) const
4968 ret
->push_back('[');
4969 if (this->length_
!= NULL
)
4974 if (!this->length_
->integer_constant_value(true, val
, &type
))
4975 error_at(this->length_
->location(),
4976 "array length must be integer constant expression");
4977 else if (mpz_cmp_si(val
, 0) < 0)
4978 error_at(this->length_
->location(), "array length is negative");
4979 else if (mpz_cmp_ui(val
, mpz_get_ui(val
)) != 0)
4980 error_at(this->length_
->location(), "array length is too large");
4984 snprintf(buf
, sizeof buf
, "%lu", mpz_get_ui(val
));
4989 ret
->push_back(']');
4991 this->append_reflection(this->element_type_
, gogo
, ret
);
4997 Array_type::do_mangled_name(Gogo
* gogo
, std::string
* ret
) const
4999 ret
->push_back('A');
5000 this->append_mangled_name(this->element_type_
, gogo
, ret
);
5001 if (this->length_
!= NULL
)
5006 if (!this->length_
->integer_constant_value(true, val
, &type
))
5007 error_at(this->length_
->location(),
5008 "array length must be integer constant expression");
5009 else if (mpz_cmp_si(val
, 0) < 0)
5010 error_at(this->length_
->location(), "array length is negative");
5011 else if (mpz_cmp_ui(val
, mpz_get_ui(val
)) != 0)
5012 error_at(this->length_
->location(), "array size is too large");
5016 snprintf(buf
, sizeof buf
, "%lu", mpz_get_ui(val
));
5021 ret
->push_back('e');
5024 // Make an array type.
5027 Type::make_array_type(Type
* element_type
, Expression
* length
)
5029 return new Array_type(element_type
, length
);
5037 Map_type::do_traverse(Traverse
* traverse
)
5039 if (Type::traverse(this->key_type_
, traverse
) == TRAVERSE_EXIT
5040 || Type::traverse(this->val_type_
, traverse
) == TRAVERSE_EXIT
)
5041 return TRAVERSE_EXIT
;
5042 return TRAVERSE_CONTINUE
;
5045 // Check that the map type is OK.
5048 Map_type::do_verify()
5050 if (this->key_type_
->struct_type() != NULL
5051 || this->key_type_
->array_type() != NULL
)
5053 error_at(this->location_
, "invalid map key type");
5059 // Whether two map types are identical.
5062 Map_type::is_identical(const Map_type
* t
, bool errors_are_identical
) const
5064 return (Type::are_identical(this->key_type(), t
->key_type(),
5065 errors_are_identical
, NULL
)
5066 && Type::are_identical(this->val_type(), t
->val_type(),
5067 errors_are_identical
, NULL
));
5073 Map_type::do_hash_for_method(Gogo
* gogo
) const
5075 return (this->key_type_
->hash_for_method(gogo
)
5076 + this->val_type_
->hash_for_method(gogo
)
5080 // Check that a call to the builtin make function is valid. For a map
5081 // the optional argument is the number of spaces to preallocate for
5085 Map_type::do_check_make_expression(Expression_list
* args
,
5086 source_location location
)
5088 if (args
!= NULL
&& !args
->empty())
5090 if (!Type::check_int_value(args
->front(), _("bad size when making map"),
5093 else if (args
->size() > 1)
5095 error_at(location
, "too many arguments when making map");
5102 // Get a tree for a map type. A map type is represented as a pointer
5103 // to a struct. The struct is __go_map in libgo/map.h.
5106 Map_type::do_get_tree(Gogo
* gogo
)
5108 static tree type_tree
;
5109 if (type_tree
== NULL_TREE
)
5111 tree struct_type
= make_node(RECORD_TYPE
);
5113 tree map_descriptor_type
= gogo
->map_descriptor_type();
5114 tree const_map_descriptor_type
=
5115 build_qualified_type(map_descriptor_type
, TYPE_QUAL_CONST
);
5116 tree name
= get_identifier("__descriptor");
5117 tree field
= build_decl(BUILTINS_LOCATION
, FIELD_DECL
, name
,
5118 build_pointer_type(const_map_descriptor_type
));
5119 DECL_CONTEXT(field
) = struct_type
;
5120 TYPE_FIELDS(struct_type
) = field
;
5121 tree last_field
= field
;
5123 name
= get_identifier("__element_count");
5124 field
= build_decl(BUILTINS_LOCATION
, FIELD_DECL
, name
, sizetype
);
5125 DECL_CONTEXT(field
) = struct_type
;
5126 DECL_CHAIN(last_field
) = field
;
5129 name
= get_identifier("__bucket_count");
5130 field
= build_decl(BUILTINS_LOCATION
, FIELD_DECL
, name
, sizetype
);
5131 DECL_CONTEXT(field
) = struct_type
;
5132 DECL_CHAIN(last_field
) = field
;
5135 name
= get_identifier("__buckets");
5136 field
= build_decl(BUILTINS_LOCATION
, FIELD_DECL
, name
,
5137 build_pointer_type(ptr_type_node
));
5138 DECL_CONTEXT(field
) = struct_type
;
5139 DECL_CHAIN(last_field
) = field
;
5141 layout_type(struct_type
);
5143 // Give the struct a name for better debugging info.
5144 name
= get_identifier("__go_map");
5145 tree type_decl
= build_decl(BUILTINS_LOCATION
, TYPE_DECL
, name
,
5147 DECL_ARTIFICIAL(type_decl
) = 1;
5148 TYPE_NAME(struct_type
) = type_decl
;
5149 go_preserve_from_gc(type_decl
);
5150 rest_of_decl_compilation(type_decl
, 1, 0);
5152 type_tree
= build_pointer_type(struct_type
);
5153 go_preserve_from_gc(type_tree
);
5159 // Initialize a map.
5162 Map_type::do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
5166 return fold_convert(type_tree
, null_pointer_node
);
5169 // Return an expression for a newly allocated map.
5172 Map_type::do_make_expression_tree(Translate_context
* context
,
5173 Expression_list
* args
,
5174 source_location location
)
5176 tree bad_index
= NULL_TREE
;
5179 if (args
== NULL
|| args
->empty())
5180 expr_tree
= size_zero_node
;
5183 expr_tree
= args
->front()->get_tree(context
);
5184 if (expr_tree
== error_mark_node
)
5185 return error_mark_node
;
5186 if (!DECL_P(expr_tree
))
5187 expr_tree
= save_expr(expr_tree
);
5188 if (!INTEGRAL_TYPE_P(TREE_TYPE(expr_tree
)))
5189 expr_tree
= convert_to_integer(sizetype
, expr_tree
);
5190 bad_index
= Expression::check_bounds(expr_tree
, sizetype
, bad_index
,
5194 tree map_type
= this->get_tree(context
->gogo());
5196 static tree new_map_fndecl
;
5197 tree ret
= Gogo::call_builtin(&new_map_fndecl
,
5202 TREE_TYPE(TYPE_FIELDS(TREE_TYPE(map_type
))),
5203 context
->gogo()->map_descriptor(this),
5206 if (ret
== error_mark_node
)
5207 return error_mark_node
;
5208 // This can panic if the capacity is out of range.
5209 TREE_NOTHROW(new_map_fndecl
) = 0;
5211 if (bad_index
== NULL_TREE
)
5215 tree crash
= Gogo::runtime_error(RUNTIME_ERROR_MAKE_MAP_OUT_OF_BOUNDS
,
5217 return build2(COMPOUND_EXPR
, TREE_TYPE(ret
),
5218 build3(COND_EXPR
, void_type_node
,
5219 bad_index
, crash
, NULL_TREE
),
5224 // The type of a map type descriptor.
5227 Map_type::make_map_type_descriptor_type()
5232 Type
* tdt
= Type::make_type_descriptor_type();
5233 Type
* ptdt
= Type::make_type_descriptor_ptr_type();
5236 Type::make_builtin_struct_type(3,
5241 ret
= Type::make_builtin_named_type("MapType", sf
);
5247 // Build a type descriptor for a map type.
5250 Map_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
5252 source_location bloc
= BUILTINS_LOCATION
;
5254 Type
* mtdt
= Map_type::make_map_type_descriptor_type();
5256 const Struct_field_list
* fields
= mtdt
->struct_type()->fields();
5258 Expression_list
* vals
= new Expression_list();
5261 Struct_field_list::const_iterator p
= fields
->begin();
5262 gcc_assert(p
->field_name() == "commonType");
5263 vals
->push_back(this->type_descriptor_constructor(gogo
,
5264 RUNTIME_TYPE_KIND_MAP
,
5268 gcc_assert(p
->field_name() == "key");
5269 vals
->push_back(Expression::make_type_descriptor(this->key_type_
, bloc
));
5272 gcc_assert(p
->field_name() == "elem");
5273 vals
->push_back(Expression::make_type_descriptor(this->val_type_
, bloc
));
5276 gcc_assert(p
== fields
->end());
5278 return Expression::make_struct_composite_literal(mtdt
, vals
, bloc
);
5281 // Reflection string for a map.
5284 Map_type::do_reflection(Gogo
* gogo
, std::string
* ret
) const
5286 ret
->append("map[");
5287 this->append_reflection(this->key_type_
, gogo
, ret
);
5289 this->append_reflection(this->val_type_
, gogo
, ret
);
5292 // Mangled name for a map.
5295 Map_type::do_mangled_name(Gogo
* gogo
, std::string
* ret
) const
5297 ret
->push_back('M');
5298 this->append_mangled_name(this->key_type_
, gogo
, ret
);
5300 this->append_mangled_name(this->val_type_
, gogo
, ret
);
5303 // Export a map type.
5306 Map_type::do_export(Export
* exp
) const
5308 exp
->write_c_string("map [");
5309 exp
->write_type(this->key_type_
);
5310 exp
->write_c_string("] ");
5311 exp
->write_type(this->val_type_
);
5314 // Import a map type.
5317 Map_type::do_import(Import
* imp
)
5319 imp
->require_c_string("map [");
5320 Type
* key_type
= imp
->read_type();
5321 imp
->require_c_string("] ");
5322 Type
* val_type
= imp
->read_type();
5323 return Type::make_map_type(key_type
, val_type
, imp
->location());
5329 Type::make_map_type(Type
* key_type
, Type
* val_type
, source_location location
)
5331 return new Map_type(key_type
, val_type
, location
);
5334 // Class Channel_type.
5339 Channel_type::do_hash_for_method(Gogo
* gogo
) const
5341 unsigned int ret
= 0;
5342 if (this->may_send_
)
5344 if (this->may_receive_
)
5346 if (this->element_type_
!= NULL
)
5347 ret
+= this->element_type_
->hash_for_method(gogo
) << 2;
5351 // Whether this type is the same as T.
5354 Channel_type::is_identical(const Channel_type
* t
,
5355 bool errors_are_identical
) const
5357 if (!Type::are_identical(this->element_type(), t
->element_type(),
5358 errors_are_identical
, NULL
))
5360 return (this->may_send_
== t
->may_send_
5361 && this->may_receive_
== t
->may_receive_
);
5364 // Check whether the parameters for a call to the builtin function
5365 // make are OK for a channel. A channel can take an optional single
5366 // parameter which is the buffer size.
5369 Channel_type::do_check_make_expression(Expression_list
* args
,
5370 source_location location
)
5372 if (args
!= NULL
&& !args
->empty())
5374 if (!Type::check_int_value(args
->front(),
5375 _("bad buffer size when making channel"),
5378 else if (args
->size() > 1)
5380 error_at(location
, "too many arguments when making channel");
5387 // Return the tree for a channel type. A channel is a pointer to a
5388 // __go_channel struct. The __go_channel struct is defined in
5389 // libgo/runtime/channel.h.
5392 Channel_type::do_get_tree(Gogo
*)
5394 static tree type_tree
;
5395 if (type_tree
== NULL_TREE
)
5397 tree ret
= make_node(RECORD_TYPE
);
5398 TYPE_NAME(ret
) = get_identifier("__go_channel");
5399 TYPE_STUB_DECL(ret
) = build_decl(BUILTINS_LOCATION
, TYPE_DECL
, NULL_TREE
,
5401 type_tree
= build_pointer_type(ret
);
5402 go_preserve_from_gc(type_tree
);
5407 // Initialize a channel variable.
5410 Channel_type::do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
5414 return fold_convert(type_tree
, null_pointer_node
);
5417 // Handle the builtin function make for a channel.
5420 Channel_type::do_make_expression_tree(Translate_context
* context
,
5421 Expression_list
* args
,
5422 source_location location
)
5424 Gogo
* gogo
= context
->gogo();
5425 tree channel_type
= this->get_tree(gogo
);
5427 tree element_tree
= this->element_type_
->get_tree(gogo
);
5428 tree element_size_tree
= size_in_bytes(element_tree
);
5430 tree bad_index
= NULL_TREE
;
5433 if (args
== NULL
|| args
->empty())
5434 expr_tree
= size_zero_node
;
5437 expr_tree
= args
->front()->get_tree(context
);
5438 if (expr_tree
== error_mark_node
)
5439 return error_mark_node
;
5440 if (!DECL_P(expr_tree
))
5441 expr_tree
= save_expr(expr_tree
);
5442 if (!INTEGRAL_TYPE_P(TREE_TYPE(expr_tree
)))
5443 expr_tree
= convert_to_integer(sizetype
, expr_tree
);
5444 bad_index
= Expression::check_bounds(expr_tree
, sizetype
, bad_index
,
5448 static tree new_channel_fndecl
;
5449 tree ret
= Gogo::call_builtin(&new_channel_fndecl
,
5458 if (ret
== error_mark_node
)
5459 return error_mark_node
;
5460 // This can panic if the capacity is out of range.
5461 TREE_NOTHROW(new_channel_fndecl
) = 0;
5463 if (bad_index
== NULL_TREE
)
5467 tree crash
= Gogo::runtime_error(RUNTIME_ERROR_MAKE_CHAN_OUT_OF_BOUNDS
,
5469 return build2(COMPOUND_EXPR
, TREE_TYPE(ret
),
5470 build3(COND_EXPR
, void_type_node
,
5471 bad_index
, crash
, NULL_TREE
),
5476 // Build a type descriptor for a channel type.
5479 Channel_type::make_chan_type_descriptor_type()
5484 Type
* tdt
= Type::make_type_descriptor_type();
5485 Type
* ptdt
= Type::make_type_descriptor_ptr_type();
5487 Type
* uintptr_type
= Type::lookup_integer_type("uintptr");
5490 Type::make_builtin_struct_type(3,
5493 "dir", uintptr_type
);
5495 ret
= Type::make_builtin_named_type("ChanType", sf
);
5501 // Build a type descriptor for a map type.
5504 Channel_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
5506 source_location bloc
= BUILTINS_LOCATION
;
5508 Type
* ctdt
= Channel_type::make_chan_type_descriptor_type();
5510 const Struct_field_list
* fields
= ctdt
->struct_type()->fields();
5512 Expression_list
* vals
= new Expression_list();
5515 Struct_field_list::const_iterator p
= fields
->begin();
5516 gcc_assert(p
->field_name() == "commonType");
5517 vals
->push_back(this->type_descriptor_constructor(gogo
,
5518 RUNTIME_TYPE_KIND_CHAN
,
5522 gcc_assert(p
->field_name() == "elem");
5523 vals
->push_back(Expression::make_type_descriptor(this->element_type_
, bloc
));
5526 gcc_assert(p
->field_name() == "dir");
5527 // These bits must match the ones in libgo/runtime/go-type.h.
5529 if (this->may_receive_
)
5531 if (this->may_send_
)
5534 mpz_init_set_ui(iv
, val
);
5535 vals
->push_back(Expression::make_integer(&iv
, p
->type(), bloc
));
5539 gcc_assert(p
== fields
->end());
5541 return Expression::make_struct_composite_literal(ctdt
, vals
, bloc
);
5544 // Reflection string.
5547 Channel_type::do_reflection(Gogo
* gogo
, std::string
* ret
) const
5549 if (!this->may_send_
)
5551 ret
->append("chan");
5552 if (!this->may_receive_
)
5554 ret
->push_back(' ');
5555 this->append_reflection(this->element_type_
, gogo
, ret
);
5561 Channel_type::do_mangled_name(Gogo
* gogo
, std::string
* ret
) const
5563 ret
->push_back('C');
5564 this->append_mangled_name(this->element_type_
, gogo
, ret
);
5565 if (this->may_send_
)
5566 ret
->push_back('s');
5567 if (this->may_receive_
)
5568 ret
->push_back('r');
5569 ret
->push_back('e');
5575 Channel_type::do_export(Export
* exp
) const
5577 exp
->write_c_string("chan ");
5578 if (this->may_send_
&& !this->may_receive_
)
5579 exp
->write_c_string("-< ");
5580 else if (this->may_receive_
&& !this->may_send_
)
5581 exp
->write_c_string("<- ");
5582 exp
->write_type(this->element_type_
);
5588 Channel_type::do_import(Import
* imp
)
5590 imp
->require_c_string("chan ");
5594 if (imp
->match_c_string("-< "))
5598 may_receive
= false;
5600 else if (imp
->match_c_string("<- "))
5612 Type
* element_type
= imp
->read_type();
5614 return Type::make_channel_type(may_send
, may_receive
, element_type
);
5617 // Make a new channel type.
5620 Type::make_channel_type(bool send
, bool receive
, Type
* element_type
)
5622 return new Channel_type(send
, receive
, element_type
);
5625 // Class Interface_type.
5630 Interface_type::do_traverse(Traverse
* traverse
)
5632 if (this->methods_
== NULL
)
5633 return TRAVERSE_CONTINUE
;
5634 return this->methods_
->traverse(traverse
);
5637 // Finalize the methods. This handles interface inheritance.
5640 Interface_type::finalize_methods()
5642 if (this->methods_
== NULL
)
5644 std::vector
<Named_type
*> seen
;
5645 bool is_recursive
= false;
5648 while (from
< this->methods_
->size())
5650 const Typed_identifier
* p
= &this->methods_
->at(from
);
5651 if (!p
->name().empty())
5654 for (i
= 0; i
< to
; ++i
)
5656 if (this->methods_
->at(i
).name() == p
->name())
5658 error_at(p
->location(), "duplicate method %qs",
5659 Gogo::message_name(p
->name()).c_str());
5666 this->methods_
->set(to
, *p
);
5673 Interface_type
* it
= p
->type()->interface_type();
5676 error_at(p
->location(), "interface contains embedded non-interface");
5684 error_at(p
->location(), "invalid recursive interface");
5685 is_recursive
= true;
5691 Named_type
* nt
= p
->type()->named_type();
5694 std::vector
<Named_type
*>::const_iterator q
;
5695 for (q
= seen
.begin(); q
!= seen
.end(); ++q
)
5699 error_at(p
->location(), "inherited interface loop");
5703 if (q
!= seen
.end())
5711 const Typed_identifier_list
* methods
= it
->methods();
5712 if (methods
== NULL
)
5717 for (Typed_identifier_list::const_iterator q
= methods
->begin();
5718 q
!= methods
->end();
5721 if (q
->name().empty())
5723 if (q
->type()->forwarded() == p
->type()->forwarded())
5724 error_at(p
->location(), "interface inheritance loop");
5728 for (i
= from
+ 1; i
< this->methods_
->size(); ++i
)
5730 const Typed_identifier
* r
= &this->methods_
->at(i
);
5731 if (r
->name().empty()
5732 && r
->type()->forwarded() == q
->type()->forwarded())
5734 error_at(p
->location(),
5735 "inherited interface listed twice");
5739 if (i
== this->methods_
->size())
5740 this->methods_
->push_back(Typed_identifier(q
->name(),
5745 else if (this->find_method(q
->name()) == NULL
)
5746 this->methods_
->push_back(Typed_identifier(q
->name(), q
->type(),
5751 error_at(p
->location(), "inherited method %qs is ambiguous",
5752 Gogo::message_name(q
->name()).c_str());
5759 delete this->methods_
;
5760 this->methods_
= NULL
;
5764 this->methods_
->resize(to
);
5765 this->methods_
->sort_by_name();
5769 // Return the method NAME, or NULL.
5771 const Typed_identifier
*
5772 Interface_type::find_method(const std::string
& name
) const
5774 if (this->methods_
== NULL
)
5776 for (Typed_identifier_list::const_iterator p
= this->methods_
->begin();
5777 p
!= this->methods_
->end();
5779 if (p
->name() == name
)
5784 // Return the method index.
5787 Interface_type::method_index(const std::string
& name
) const
5789 gcc_assert(this->methods_
!= NULL
);
5791 for (Typed_identifier_list::const_iterator p
= this->methods_
->begin();
5792 p
!= this->methods_
->end();
5794 if (p
->name() == name
)
5799 // Return whether NAME is an unexported method, for better error
5803 Interface_type::is_unexported_method(Gogo
* gogo
, const std::string
& name
) const
5805 if (this->methods_
== NULL
)
5807 for (Typed_identifier_list::const_iterator p
= this->methods_
->begin();
5808 p
!= this->methods_
->end();
5811 const std::string
& method_name(p
->name());
5812 if (Gogo::is_hidden_name(method_name
)
5813 && name
== Gogo::unpack_hidden_name(method_name
)
5814 && gogo
->pack_hidden_name(name
, false) != method_name
)
5820 // Whether this type is identical with T.
5823 Interface_type::is_identical(const Interface_type
* t
,
5824 bool errors_are_identical
) const
5826 // We require the same methods with the same types. The methods
5827 // have already been sorted.
5828 if (this->methods() == NULL
|| t
->methods() == NULL
)
5829 return this->methods() == t
->methods();
5831 Typed_identifier_list::const_iterator p1
= this->methods()->begin();
5832 for (Typed_identifier_list::const_iterator p2
= t
->methods()->begin();
5833 p2
!= t
->methods()->end();
5836 if (p1
== this->methods()->end())
5838 if (p1
->name() != p2
->name()
5839 || !Type::are_identical(p1
->type(), p2
->type(),
5840 errors_are_identical
, NULL
))
5843 if (p1
!= this->methods()->end())
5848 // Whether we can assign the interface type T to this type. The types
5849 // are known to not be identical. An interface assignment is only
5850 // permitted if T is known to implement all methods in THIS.
5851 // Otherwise a type guard is required.
5854 Interface_type::is_compatible_for_assign(const Interface_type
* t
,
5855 std::string
* reason
) const
5857 if (this->methods() == NULL
)
5859 for (Typed_identifier_list::const_iterator p
= this->methods()->begin();
5860 p
!= this->methods()->end();
5863 const Typed_identifier
* m
= t
->find_method(p
->name());
5869 snprintf(buf
, sizeof buf
,
5870 _("need explicit conversion; missing method %s%s%s"),
5871 open_quote
, Gogo::message_name(p
->name()).c_str(),
5873 reason
->assign(buf
);
5878 std::string subreason
;
5879 if (!Type::are_identical(p
->type(), m
->type(), true, &subreason
))
5883 std::string n
= Gogo::message_name(p
->name());
5884 size_t len
= 100 + n
.length() + subreason
.length();
5885 char* buf
= new char[len
];
5886 if (subreason
.empty())
5887 snprintf(buf
, len
, _("incompatible type for method %s%s%s"),
5888 open_quote
, n
.c_str(), close_quote
);
5891 _("incompatible type for method %s%s%s (%s)"),
5892 open_quote
, n
.c_str(), close_quote
,
5894 reason
->assign(buf
);
5907 Interface_type::do_hash_for_method(Gogo
* gogo
) const
5909 unsigned int ret
= 0;
5910 if (this->methods_
!= NULL
)
5912 for (Typed_identifier_list::const_iterator p
= this->methods_
->begin();
5913 p
!= this->methods_
->end();
5916 ret
= Type::hash_string(p
->name(), ret
);
5917 ret
+= p
->type()->hash_for_method(gogo
);
5924 // Return true if T implements the interface. If it does not, and
5925 // REASON is not NULL, set *REASON to a useful error message.
5928 Interface_type::implements_interface(const Type
* t
, std::string
* reason
) const
5930 if (this->methods_
== NULL
)
5933 bool is_pointer
= false;
5934 const Named_type
* nt
= t
->named_type();
5935 const Struct_type
* st
= t
->struct_type();
5936 // If we start with a named type, we don't dereference it to find
5940 const Type
* pt
= t
->points_to();
5943 // If T is a pointer to a named type, then we need to look at
5944 // the type to which it points.
5946 nt
= pt
->named_type();
5947 st
= pt
->struct_type();
5951 // If we have a named type, get the methods from it rather than from
5956 // Only named and struct types have methods.
5957 if (nt
== NULL
&& st
== NULL
)
5961 if (t
->points_to() != NULL
5962 && t
->points_to()->interface_type() != NULL
)
5963 reason
->assign(_("pointer to interface type has no methods"));
5965 reason
->assign(_("type has no methods"));
5970 if (nt
!= NULL
? !nt
->has_any_methods() : !st
->has_any_methods())
5974 if (t
->points_to() != NULL
5975 && t
->points_to()->interface_type() != NULL
)
5976 reason
->assign(_("pointer to interface type has no methods"));
5978 reason
->assign(_("type has no methods"));
5983 for (Typed_identifier_list::const_iterator p
= this->methods_
->begin();
5984 p
!= this->methods_
->end();
5987 bool is_ambiguous
= false;
5988 Method
* m
= (nt
!= NULL
5989 ? nt
->method_function(p
->name(), &is_ambiguous
)
5990 : st
->method_function(p
->name(), &is_ambiguous
));
5995 std::string n
= Gogo::message_name(p
->name());
5996 size_t len
= n
.length() + 100;
5997 char* buf
= new char[len
];
5999 snprintf(buf
, len
, _("ambiguous method %s%s%s"),
6000 open_quote
, n
.c_str(), close_quote
);
6002 snprintf(buf
, len
, _("missing method %s%s%s"),
6003 open_quote
, n
.c_str(), close_quote
);
6004 reason
->assign(buf
);
6010 Function_type
*p_fn_type
= p
->type()->function_type();
6011 Function_type
* m_fn_type
= m
->type()->function_type();
6012 gcc_assert(p_fn_type
!= NULL
&& m_fn_type
!= NULL
);
6013 std::string subreason
;
6014 if (!p_fn_type
->is_identical(m_fn_type
, true, true, &subreason
))
6018 std::string n
= Gogo::message_name(p
->name());
6019 size_t len
= 100 + n
.length() + subreason
.length();
6020 char* buf
= new char[len
];
6021 if (subreason
.empty())
6022 snprintf(buf
, len
, _("incompatible type for method %s%s%s"),
6023 open_quote
, n
.c_str(), close_quote
);
6026 _("incompatible type for method %s%s%s (%s)"),
6027 open_quote
, n
.c_str(), close_quote
,
6029 reason
->assign(buf
);
6035 if (!is_pointer
&& !m
->is_value_method())
6039 std::string n
= Gogo::message_name(p
->name());
6040 size_t len
= 100 + n
.length();
6041 char* buf
= new char[len
];
6042 snprintf(buf
, len
, _("method %s%s%s requires a pointer"),
6043 open_quote
, n
.c_str(), close_quote
);
6044 reason
->assign(buf
);
6054 // Return a tree for an interface type. An interface is a pointer to
6055 // a struct. The struct has three fields. The first field is a
6056 // pointer to the type descriptor for the dynamic type of the object.
6057 // The second field is a pointer to a table of methods for the
6058 // interface to be used with the object. The third field is the value
6059 // of the object itself.
6062 Interface_type::do_get_tree(Gogo
* gogo
)
6064 if (this->methods_
== NULL
)
6065 return Interface_type::empty_type_tree(gogo
);
6068 tree t
= Interface_type::non_empty_type_tree(this->location_
);
6069 return this->fill_in_tree(gogo
, t
);
6073 // Return a singleton struct for an empty interface type. We use the
6074 // same type for all empty interfaces. This lets us assign them to
6075 // each other directly without triggering GIMPLE type errors.
6078 Interface_type::empty_type_tree(Gogo
* gogo
)
6080 static tree empty_interface
;
6081 if (empty_interface
!= NULL_TREE
)
6082 return empty_interface
;
6084 tree dtype
= Type::make_type_descriptor_type()->get_tree(gogo
);
6085 dtype
= build_pointer_type(build_qualified_type(dtype
, TYPE_QUAL_CONST
));
6086 return Gogo::builtin_struct(&empty_interface
, "__go_empty_interface",
6088 "__type_descriptor",
6094 // Return a new struct for a non-empty interface type. The correct
6095 // values are filled in by fill_in_tree.
6098 Interface_type::non_empty_type_tree(source_location location
)
6100 tree ret
= make_node(RECORD_TYPE
);
6102 tree field_trees
= NULL_TREE
;
6103 tree
* pp
= &field_trees
;
6105 tree name_tree
= get_identifier("__methods");
6106 tree field
= build_decl(location
, FIELD_DECL
, name_tree
, ptr_type_node
);
6107 DECL_CONTEXT(field
) = ret
;
6109 pp
= &DECL_CHAIN(field
);
6111 name_tree
= get_identifier("__object");
6112 field
= build_decl(location
, FIELD_DECL
, name_tree
, ptr_type_node
);
6113 DECL_CONTEXT(field
) = ret
;
6116 TYPE_FIELDS(ret
) = field_trees
;
6123 // Fill in the tree for an interface type. This is used for named
6127 Interface_type::fill_in_tree(Gogo
* gogo
, tree type
)
6129 gcc_assert(this->methods_
!= NULL
);
6131 // Build the type of the table of methods.
6133 tree method_table
= make_node(RECORD_TYPE
);
6135 // The first field is a pointer to the type descriptor.
6136 tree name_tree
= get_identifier("__type_descriptor");
6137 tree dtype
= Type::make_type_descriptor_type()->get_tree(gogo
);
6138 dtype
= build_pointer_type(build_qualified_type(dtype
, TYPE_QUAL_CONST
));
6139 tree field
= build_decl(this->location_
, FIELD_DECL
, name_tree
, dtype
);
6140 DECL_CONTEXT(field
) = method_table
;
6141 TYPE_FIELDS(method_table
) = field
;
6143 std::string last_name
= "";
6144 tree
* pp
= &DECL_CHAIN(field
);
6145 for (Typed_identifier_list::const_iterator p
= this->methods_
->begin();
6146 p
!= this->methods_
->end();
6149 std::string name
= Gogo::unpack_hidden_name(p
->name());
6150 name_tree
= get_identifier_with_length(name
.data(), name
.length());
6151 tree field_type
= p
->type()->get_tree(gogo
);
6152 if (field_type
== error_mark_node
)
6153 return error_mark_node
;
6154 field
= build_decl(this->location_
, FIELD_DECL
, name_tree
, field_type
);
6155 DECL_CONTEXT(field
) = method_table
;
6157 pp
= &DECL_CHAIN(field
);
6158 // Sanity check: the names should be sorted.
6159 gcc_assert(p
->name() > last_name
);
6160 last_name
= p
->name();
6162 layout_type(method_table
);
6164 // Update the type of the __methods field from a generic pointer to
6165 // a pointer to the method table.
6166 field
= TYPE_FIELDS(type
);
6167 gcc_assert(strcmp(IDENTIFIER_POINTER(DECL_NAME(field
)), "__methods") == 0);
6169 TREE_TYPE(field
) = build_pointer_type(method_table
);
6174 // Initialization value.
6177 Interface_type::do_get_init_tree(Gogo
*, tree type_tree
, bool is_clear
)
6182 VEC(constructor_elt
,gc
)* init
= VEC_alloc(constructor_elt
, gc
, 2);
6183 for (tree field
= TYPE_FIELDS(type_tree
);
6185 field
= DECL_CHAIN(field
))
6187 constructor_elt
* elt
= VEC_quick_push(constructor_elt
, init
, NULL
);
6189 elt
->value
= fold_convert(TREE_TYPE(field
), null_pointer_node
);
6192 tree ret
= build_constructor(type_tree
, init
);
6193 TREE_CONSTANT(ret
) = 1;
6197 // The type of an interface type descriptor.
6200 Interface_type::make_interface_type_descriptor_type()
6205 Type
* tdt
= Type::make_type_descriptor_type();
6206 Type
* ptdt
= Type::make_type_descriptor_ptr_type();
6208 Type
* string_type
= Type::lookup_string_type();
6209 Type
* pointer_string_type
= Type::make_pointer_type(string_type
);
6212 Type::make_builtin_struct_type(3,
6213 "name", pointer_string_type
,
6214 "pkgPath", pointer_string_type
,
6217 Type
* nsm
= Type::make_builtin_named_type("imethod", sm
);
6219 Type
* slice_nsm
= Type::make_array_type(nsm
, NULL
);
6221 Struct_type
* s
= Type::make_builtin_struct_type(2,
6223 "methods", slice_nsm
);
6225 ret
= Type::make_builtin_named_type("InterfaceType", s
);
6231 // Build a type descriptor for an interface type.
6234 Interface_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
6236 source_location bloc
= BUILTINS_LOCATION
;
6238 Type
* itdt
= Interface_type::make_interface_type_descriptor_type();
6240 const Struct_field_list
* ifields
= itdt
->struct_type()->fields();
6242 Expression_list
* ivals
= new Expression_list();
6245 Struct_field_list::const_iterator pif
= ifields
->begin();
6246 gcc_assert(pif
->field_name() == "commonType");
6247 ivals
->push_back(this->type_descriptor_constructor(gogo
,
6248 RUNTIME_TYPE_KIND_INTERFACE
,
6252 gcc_assert(pif
->field_name() == "methods");
6254 Expression_list
* methods
= new Expression_list();
6255 if (this->methods_
!= NULL
&& !this->methods_
->empty())
6257 Type
* elemtype
= pif
->type()->array_type()->element_type();
6259 methods
->reserve(this->methods_
->size());
6260 for (Typed_identifier_list::const_iterator pm
= this->methods_
->begin();
6261 pm
!= this->methods_
->end();
6264 const Struct_field_list
* mfields
= elemtype
->struct_type()->fields();
6266 Expression_list
* mvals
= new Expression_list();
6269 Struct_field_list::const_iterator pmf
= mfields
->begin();
6270 gcc_assert(pmf
->field_name() == "name");
6271 std::string s
= Gogo::unpack_hidden_name(pm
->name());
6272 Expression
* e
= Expression::make_string(s
, bloc
);
6273 mvals
->push_back(Expression::make_unary(OPERATOR_AND
, e
, bloc
));
6276 gcc_assert(pmf
->field_name() == "pkgPath");
6277 if (!Gogo::is_hidden_name(pm
->name()))
6278 mvals
->push_back(Expression::make_nil(bloc
));
6281 s
= Gogo::hidden_name_prefix(pm
->name());
6282 e
= Expression::make_string(s
, bloc
);
6283 mvals
->push_back(Expression::make_unary(OPERATOR_AND
, e
, bloc
));
6287 gcc_assert(pmf
->field_name() == "typ");
6288 mvals
->push_back(Expression::make_type_descriptor(pm
->type(), bloc
));
6291 gcc_assert(pmf
== mfields
->end());
6293 e
= Expression::make_struct_composite_literal(elemtype
, mvals
,
6295 methods
->push_back(e
);
6299 ivals
->push_back(Expression::make_slice_composite_literal(pif
->type(),
6303 gcc_assert(pif
== ifields
->end());
6305 return Expression::make_struct_composite_literal(itdt
, ivals
, bloc
);
6308 // Reflection string.
6311 Interface_type::do_reflection(Gogo
* gogo
, std::string
* ret
) const
6313 ret
->append("interface {");
6314 if (this->methods_
!= NULL
)
6316 for (Typed_identifier_list::const_iterator p
= this->methods_
->begin();
6317 p
!= this->methods_
->end();
6320 if (p
!= this->methods_
->begin())
6322 ret
->push_back(' ');
6323 ret
->append(Gogo::unpack_hidden_name(p
->name()));
6324 std::string sub
= p
->type()->reflection(gogo
);
6325 gcc_assert(sub
.compare(0, 4, "func") == 0);
6326 sub
= sub
.substr(4);
6336 Interface_type::do_mangled_name(Gogo
* gogo
, std::string
* ret
) const
6338 ret
->push_back('I');
6340 const Typed_identifier_list
* methods
= this->methods_
;
6341 if (methods
!= NULL
)
6343 for (Typed_identifier_list::const_iterator p
= methods
->begin();
6344 p
!= methods
->end();
6347 std::string n
= Gogo::unpack_hidden_name(p
->name());
6349 snprintf(buf
, sizeof buf
, "%u_",
6350 static_cast<unsigned int>(n
.length()));
6353 this->append_mangled_name(p
->type(), gogo
, ret
);
6357 ret
->push_back('e');
6363 Interface_type::do_export(Export
* exp
) const
6365 exp
->write_c_string("interface { ");
6367 const Typed_identifier_list
* methods
= this->methods_
;
6368 if (methods
!= NULL
)
6370 for (Typed_identifier_list::const_iterator pm
= methods
->begin();
6371 pm
!= methods
->end();
6374 exp
->write_string(pm
->name());
6375 exp
->write_c_string(" (");
6377 const Function_type
* fntype
= pm
->type()->function_type();
6380 const Typed_identifier_list
* parameters
= fntype
->parameters();
6381 if (parameters
!= NULL
)
6383 bool is_varargs
= fntype
->is_varargs();
6384 for (Typed_identifier_list::const_iterator pp
=
6385 parameters
->begin();
6386 pp
!= parameters
->end();
6392 exp
->write_c_string(", ");
6393 if (!is_varargs
|| pp
+ 1 != parameters
->end())
6394 exp
->write_type(pp
->type());
6397 exp
->write_c_string("...");
6398 Type
*pptype
= pp
->type();
6399 exp
->write_type(pptype
->array_type()->element_type());
6404 exp
->write_c_string(")");
6406 const Typed_identifier_list
* results
= fntype
->results();
6407 if (results
!= NULL
)
6409 exp
->write_c_string(" ");
6410 if (results
->size() == 1)
6411 exp
->write_type(results
->begin()->type());
6415 exp
->write_c_string("(");
6416 for (Typed_identifier_list::const_iterator p
=
6418 p
!= results
->end();
6424 exp
->write_c_string(", ");
6425 exp
->write_type(p
->type());
6427 exp
->write_c_string(")");
6431 exp
->write_c_string("; ");
6435 exp
->write_c_string("}");
6438 // Import an interface type.
6441 Interface_type::do_import(Import
* imp
)
6443 imp
->require_c_string("interface { ");
6445 Typed_identifier_list
* methods
= new Typed_identifier_list
;
6446 while (imp
->peek_char() != '}')
6448 std::string name
= imp
->read_identifier();
6449 imp
->require_c_string(" (");
6451 Typed_identifier_list
* parameters
;
6452 bool is_varargs
= false;
6453 if (imp
->peek_char() == ')')
6457 parameters
= new Typed_identifier_list
;
6460 if (imp
->match_c_string("..."))
6466 Type
* ptype
= imp
->read_type();
6468 ptype
= Type::make_array_type(ptype
, NULL
);
6469 parameters
->push_back(Typed_identifier(Import::import_marker
,
6470 ptype
, imp
->location()));
6471 if (imp
->peek_char() != ',')
6473 gcc_assert(!is_varargs
);
6474 imp
->require_c_string(", ");
6477 imp
->require_c_string(")");
6479 Typed_identifier_list
* results
;
6480 if (imp
->peek_char() != ' ')
6484 results
= new Typed_identifier_list
;
6486 if (imp
->peek_char() != '(')
6488 Type
* rtype
= imp
->read_type();
6489 results
->push_back(Typed_identifier(Import::import_marker
,
6490 rtype
, imp
->location()));
6497 Type
* rtype
= imp
->read_type();
6498 results
->push_back(Typed_identifier(Import::import_marker
,
6499 rtype
, imp
->location()));
6500 if (imp
->peek_char() != ',')
6502 imp
->require_c_string(", ");
6504 imp
->require_c_string(")");
6508 Function_type
* fntype
= Type::make_function_type(NULL
, parameters
,
6512 fntype
->set_is_varargs();
6513 methods
->push_back(Typed_identifier(name
, fntype
, imp
->location()));
6515 imp
->require_c_string("; ");
6518 imp
->require_c_string("}");
6520 if (methods
->empty())
6526 return Type::make_interface_type(methods
, imp
->location());
6529 // Make an interface type.
6532 Type::make_interface_type(Typed_identifier_list
* methods
,
6533 source_location location
)
6535 return new Interface_type(methods
, location
);
6540 // Bind a method to an object.
6543 Method::bind_method(Expression
* expr
, source_location location
) const
6545 if (this->stub_
== NULL
)
6547 // When there is no stub object, the binding is determined by
6549 return this->do_bind_method(expr
, location
);
6552 Expression
* func
= Expression::make_func_reference(this->stub_
, NULL
,
6554 return Expression::make_bound_method(expr
, func
, location
);
6557 // Return the named object associated with a method. This may only be
6558 // called after methods are finalized.
6561 Method::named_object() const
6563 if (this->stub_
!= NULL
)
6565 return this->do_named_object();
6568 // Class Named_method.
6570 // The type of the method.
6573 Named_method::do_type() const
6575 if (this->named_object_
->is_function())
6576 return this->named_object_
->func_value()->type();
6577 else if (this->named_object_
->is_function_declaration())
6578 return this->named_object_
->func_declaration_value()->type();
6583 // Return the location of the method receiver.
6586 Named_method::do_receiver_location() const
6588 return this->do_type()->receiver()->location();
6591 // Bind a method to an object.
6594 Named_method::do_bind_method(Expression
* expr
, source_location location
) const
6596 Expression
* func
= Expression::make_func_reference(this->named_object_
, NULL
,
6598 Bound_method_expression
* bme
= Expression::make_bound_method(expr
, func
,
6600 // If this is not a local method, and it does not use a stub, then
6601 // the real method expects a different type. We need to cast the
6603 if (this->depth() > 0 && !this->needs_stub_method())
6605 Function_type
* ftype
= this->do_type();
6606 gcc_assert(ftype
->is_method());
6607 Type
* frtype
= ftype
->receiver()->type();
6608 bme
->set_first_argument_type(frtype
);
6613 // Class Interface_method.
6615 // Bind a method to an object.
6618 Interface_method::do_bind_method(Expression
* expr
,
6619 source_location location
) const
6621 return Expression::make_interface_field_reference(expr
, this->name_
,
6627 // Insert a new method. Return true if it was inserted, false
6631 Methods::insert(const std::string
& name
, Method
* m
)
6633 std::pair
<Method_map::iterator
, bool> ins
=
6634 this->methods_
.insert(std::make_pair(name
, m
));
6639 Method
* old_method
= ins
.first
->second
;
6640 if (m
->depth() < old_method
->depth())
6643 ins
.first
->second
= m
;
6648 if (m
->depth() == old_method
->depth())
6649 old_method
->set_is_ambiguous();
6655 // Return the number of unambiguous methods.
6658 Methods::count() const
6661 for (Method_map::const_iterator p
= this->methods_
.begin();
6662 p
!= this->methods_
.end();
6664 if (!p
->second
->is_ambiguous())
6669 // Class Named_type.
6671 // Return the name of the type.
6674 Named_type::name() const
6676 return this->named_object_
->name();
6679 // Return the name of the type to use in an error message.
6682 Named_type::message_name() const
6684 return this->named_object_
->message_name();
6687 // Return the base type for this type. We have to be careful about
6688 // circular type definitions, which are invalid but may be seen here.
6691 Named_type::named_base()
6693 if (this->seen_
> 0)
6696 Type
* ret
= this->type_
->base();
6702 Named_type::named_base() const
6704 if (this->seen_
> 0)
6707 const Type
* ret
= this->type_
->base();
6712 // Return whether this is an error type. We have to be careful about
6713 // circular type definitions, which are invalid but may be seen here.
6716 Named_type::is_named_error_type() const
6718 if (this->seen_
> 0)
6721 bool ret
= this->type_
->is_error_type();
6726 // Add a method to this type.
6729 Named_type::add_method(const std::string
& name
, Function
* function
)
6731 if (this->local_methods_
== NULL
)
6732 this->local_methods_
= new Bindings(NULL
);
6733 return this->local_methods_
->add_function(name
, NULL
, function
);
6736 // Add a method declaration to this type.
6739 Named_type::add_method_declaration(const std::string
& name
, Package
* package
,
6740 Function_type
* type
,
6741 source_location location
)
6743 if (this->local_methods_
== NULL
)
6744 this->local_methods_
= new Bindings(NULL
);
6745 return this->local_methods_
->add_function_declaration(name
, package
, type
,
6749 // Add an existing method to this type.
6752 Named_type::add_existing_method(Named_object
* no
)
6754 if (this->local_methods_
== NULL
)
6755 this->local_methods_
= new Bindings(NULL
);
6756 this->local_methods_
->add_named_object(no
);
6759 // Look for a local method NAME, and returns its named object, or NULL
6763 Named_type::find_local_method(const std::string
& name
) const
6765 if (this->local_methods_
== NULL
)
6767 return this->local_methods_
->lookup(name
);
6770 // Return whether NAME is an unexported field or method, for better
6774 Named_type::is_unexported_local_method(Gogo
* gogo
,
6775 const std::string
& name
) const
6777 Bindings
* methods
= this->local_methods_
;
6778 if (methods
!= NULL
)
6780 for (Bindings::const_declarations_iterator p
=
6781 methods
->begin_declarations();
6782 p
!= methods
->end_declarations();
6785 if (Gogo::is_hidden_name(p
->first
)
6786 && name
== Gogo::unpack_hidden_name(p
->first
)
6787 && gogo
->pack_hidden_name(name
, false) != p
->first
)
6794 // Build the complete list of methods for this type, which means
6795 // recursively including all methods for anonymous fields. Create all
6799 Named_type::finalize_methods(Gogo
* gogo
)
6801 if (this->all_methods_
!= NULL
)
6804 if (this->local_methods_
!= NULL
6805 && (this->points_to() != NULL
|| this->interface_type() != NULL
))
6807 const Bindings
* lm
= this->local_methods_
;
6808 for (Bindings::const_declarations_iterator p
= lm
->begin_declarations();
6809 p
!= lm
->end_declarations();
6811 error_at(p
->second
->location(),
6812 "invalid pointer or interface receiver type");
6813 delete this->local_methods_
;
6814 this->local_methods_
= NULL
;
6818 Type::finalize_methods(gogo
, this, this->location_
, &this->all_methods_
);
6821 // Return the method NAME, or NULL if there isn't one or if it is
6822 // ambiguous. Set *IS_AMBIGUOUS if the method exists but is
6826 Named_type::method_function(const std::string
& name
, bool* is_ambiguous
) const
6828 return Type::method_function(this->all_methods_
, name
, is_ambiguous
);
6831 // Return a pointer to the interface method table for this type for
6832 // the interface INTERFACE. IS_POINTER is true if this is for a
6836 Named_type::interface_method_table(Gogo
* gogo
, const Interface_type
* interface
,
6839 gcc_assert(!interface
->is_empty());
6841 Interface_method_tables
** pimt
= (is_pointer
6842 ? &this->interface_method_tables_
6843 : &this->pointer_interface_method_tables_
);
6846 *pimt
= new Interface_method_tables(5);
6848 std::pair
<const Interface_type
*, tree
> val(interface
, NULL_TREE
);
6849 std::pair
<Interface_method_tables::iterator
, bool> ins
= (*pimt
)->insert(val
);
6853 // This is a new entry in the hash table.
6854 gcc_assert(ins
.first
->second
== NULL_TREE
);
6855 ins
.first
->second
= gogo
->interface_method_table_for_type(interface
,
6860 tree decl
= ins
.first
->second
;
6861 if (decl
== error_mark_node
)
6862 return error_mark_node
;
6863 gcc_assert(decl
!= NULL_TREE
&& TREE_CODE(decl
) == VAR_DECL
);
6864 return build_fold_addr_expr(decl
);
6867 // Return whether a named type has any hidden fields.
6870 Named_type::named_type_has_hidden_fields(std::string
* reason
) const
6872 if (this->seen_
> 0)
6875 bool ret
= this->type_
->has_hidden_fields(this, reason
);
6880 // Look for a use of a complete type within another type. This is
6881 // used to check that we don't try to use a type within itself.
6883 class Find_type_use
: public Traverse
6886 Find_type_use(Named_type
* find_type
)
6887 : Traverse(traverse_types
),
6888 find_type_(find_type
), found_(false)
6891 // Whether we found the type.
6894 { return this->found_
; }
6901 // The type we are looking for.
6902 Named_type
* find_type_
;
6903 // Whether we found the type.
6907 // Check for FIND_TYPE in TYPE.
6910 Find_type_use::type(Type
* type
)
6912 if (type
->named_type() != NULL
&& this->find_type_
== type
->named_type())
6914 this->found_
= true;
6915 return TRAVERSE_EXIT
;
6918 // It's OK if we see a reference to the type in any type which is
6919 // essentially a pointer: a pointer, a slice, a function, a map, or
6921 if (type
->points_to() != NULL
6922 || type
->is_open_array_type()
6923 || type
->function_type() != NULL
6924 || type
->map_type() != NULL
6925 || type
->channel_type() != NULL
)
6926 return TRAVERSE_SKIP_COMPONENTS
;
6928 // For an interface, a reference to the type in a method type should
6929 // be ignored, but we have to consider direct inheritance. When
6930 // this is called, there may be cases of direct inheritance
6931 // represented as a method with no name.
6932 if (type
->interface_type() != NULL
)
6934 const Typed_identifier_list
* methods
= type
->interface_type()->methods();
6935 if (methods
!= NULL
)
6937 for (Typed_identifier_list::const_iterator p
= methods
->begin();
6938 p
!= methods
->end();
6941 if (p
->name().empty())
6943 if (Type::traverse(p
->type(), this) == TRAVERSE_EXIT
)
6944 return TRAVERSE_EXIT
;
6948 return TRAVERSE_SKIP_COMPONENTS
;
6951 // Otherwise, FIND_TYPE_ depends on TYPE, in the sense that we need
6952 // to convert TYPE to the backend representation before we convert
6954 if (type
->named_type() != NULL
)
6956 switch (type
->base()->classification())
6958 case Type::TYPE_ERROR
:
6959 case Type::TYPE_BOOLEAN
:
6960 case Type::TYPE_INTEGER
:
6961 case Type::TYPE_FLOAT
:
6962 case Type::TYPE_COMPLEX
:
6963 case Type::TYPE_STRING
:
6964 case Type::TYPE_NIL
:
6967 case Type::TYPE_ARRAY
:
6968 case Type::TYPE_STRUCT
:
6969 this->find_type_
->add_dependency(type
->named_type());
6972 case Type::TYPE_VOID
:
6973 case Type::TYPE_SINK
:
6974 case Type::TYPE_FUNCTION
:
6975 case Type::TYPE_POINTER
:
6976 case Type::TYPE_CALL_MULTIPLE_RESULT
:
6977 case Type::TYPE_MAP
:
6978 case Type::TYPE_CHANNEL
:
6979 case Type::TYPE_INTERFACE
:
6980 case Type::TYPE_NAMED
:
6981 case Type::TYPE_FORWARD
:
6987 return TRAVERSE_CONTINUE
;
6990 // Verify that a named type does not refer to itself.
6993 Named_type::do_verify()
6995 Find_type_use
find(this);
6996 Type::traverse(this->type_
, &find
);
6999 error_at(this->location_
, "invalid recursive type %qs",
7000 this->message_name().c_str());
7001 this->is_error_
= true;
7005 // Check whether any of the local methods overloads an existing
7006 // struct field or interface method. We don't need to check the
7007 // list of methods against itself: that is handled by the Bindings
7009 if (this->local_methods_
!= NULL
)
7011 Struct_type
* st
= this->type_
->struct_type();
7012 Interface_type
* it
= this->type_
->interface_type();
7013 bool found_dup
= false;
7014 if (st
!= NULL
|| it
!= NULL
)
7016 for (Bindings::const_declarations_iterator p
=
7017 this->local_methods_
->begin_declarations();
7018 p
!= this->local_methods_
->end_declarations();
7021 const std::string
& name(p
->first
);
7022 if (st
!= NULL
&& st
->find_local_field(name
, NULL
) != NULL
)
7024 error_at(p
->second
->location(),
7025 "method %qs redeclares struct field name",
7026 Gogo::message_name(name
).c_str());
7029 if (it
!= NULL
&& it
->find_method(name
) != NULL
)
7031 error_at(p
->second
->location(),
7032 "method %qs redeclares interface method name",
7033 Gogo::message_name(name
).c_str());
7045 // Return whether this type is or contains a pointer.
7048 Named_type::do_has_pointer() const
7050 if (this->seen_
> 0)
7053 bool ret
= this->type_
->has_pointer();
7058 // Return a hash code. This is used for method lookup. We simply
7059 // hash on the name itself.
7062 Named_type::do_hash_for_method(Gogo
* gogo
) const
7064 const std::string
& name(this->named_object()->name());
7065 unsigned int ret
= Type::hash_string(name
, 0);
7067 // GOGO will be NULL here when called from Type_hash_identical.
7068 // That is OK because that is only used for internal hash tables
7069 // where we are going to be comparing named types for equality. In
7070 // other cases, which are cases where the runtime is going to
7071 // compare hash codes to see if the types are the same, we need to
7072 // include the package prefix and name in the hash.
7073 if (gogo
!= NULL
&& !Gogo::is_hidden_name(name
) && !this->is_builtin())
7075 const Package
* package
= this->named_object()->package();
7076 if (package
== NULL
)
7078 ret
= Type::hash_string(gogo
->unique_prefix(), ret
);
7079 ret
= Type::hash_string(gogo
->package_name(), ret
);
7083 ret
= Type::hash_string(package
->unique_prefix(), ret
);
7084 ret
= Type::hash_string(package
->name(), ret
);
7091 // Convert a named type to the backend representation. In order to
7092 // get dependencies right, we fill in a dummy structure for this type,
7093 // then convert all the dependencies, then complete this type. When
7094 // this function is complete, the size of the type is known.
7097 Named_type::convert(Gogo
* gogo
)
7099 if (this->is_error_
|| this->is_converted_
)
7102 this->create_placeholder(gogo
);
7104 // Convert all the dependencies. If they refer indirectly back to
7105 // this type, they will pick up the intermediate tree we just
7107 for (std::vector
<Named_type
*>::const_iterator p
= this->dependencies_
.begin();
7108 p
!= this->dependencies_
.end();
7110 (*p
)->convert(gogo
);
7112 // Complete this type.
7113 tree t
= this->named_tree_
;
7114 Type
* base
= this->type_
->base();
7115 switch (base
->classification())
7132 // The size of these types is already correct.
7136 t
= base
->struct_type()->fill_in_tree(gogo
, t
);
7140 if (!base
->is_open_array_type())
7141 t
= base
->array_type()->fill_in_array_tree(gogo
, t
);
7144 case TYPE_INTERFACE
:
7145 if (!base
->interface_type()->is_empty())
7146 t
= base
->interface_type()->fill_in_tree(gogo
, t
);
7154 case TYPE_CALL_MULTIPLE_RESULT
:
7160 this->named_tree_
= t
;
7162 if (t
== error_mark_node
)
7163 this->is_error_
= true;
7165 gcc_assert(TYPE_SIZE(t
) != NULL_TREE
);
7167 this->is_converted_
= true;
7170 // Create the placeholder for a named type. This is the first step in
7171 // converting to the backend representation.
7174 Named_type::create_placeholder(Gogo
* gogo
)
7176 if (this->is_error_
)
7177 this->named_tree_
= error_mark_node
;
7179 if (this->named_tree_
!= NULL_TREE
)
7182 // Create the structure for this type. Note that because we call
7183 // base() here, we don't attempt to represent a named type defined
7184 // as another named type. Instead both named types will point to
7185 // different base representations.
7186 Type
* base
= this->type_
->base();
7188 switch (base
->classification())
7191 this->is_error_
= true;
7192 this->named_tree_
= error_mark_node
;
7202 // These are simple basic types, we can just create them
7204 t
= Type::get_named_type_tree(gogo
, base
);
7205 if (t
== error_mark_node
)
7207 this->is_error_
= true;
7208 this->named_tree_
= error_mark_node
;
7211 t
= build_variant_type_copy(t
);
7216 // All maps and channels have the same type in GENERIC.
7217 t
= Type::get_named_type_tree(gogo
, base
);
7218 if (t
== error_mark_node
)
7220 this->is_error_
= true;
7221 this->named_tree_
= error_mark_node
;
7224 t
= build_variant_type_copy(t
);
7229 t
= build_variant_type_copy(ptr_type_node
);
7233 t
= make_node(RECORD_TYPE
);
7237 if (base
->is_open_array_type())
7238 t
= gogo
->slice_type_tree(void_type_node
);
7240 t
= make_node(ARRAY_TYPE
);
7243 case TYPE_INTERFACE
:
7244 if (base
->interface_type()->is_empty())
7246 t
= Interface_type::empty_type_tree(gogo
);
7247 t
= build_variant_type_copy(t
);
7251 source_location loc
= base
->interface_type()->location();
7252 t
= Interface_type::non_empty_type_tree(loc
);
7258 case TYPE_CALL_MULTIPLE_RESULT
:
7264 // Create the named type.
7266 tree id
= this->named_object_
->get_id(gogo
);
7267 tree decl
= build_decl(this->location_
, TYPE_DECL
, id
, t
);
7268 TYPE_NAME(t
) = decl
;
7270 this->named_tree_
= t
;
7273 // Get a tree for a named type.
7276 Named_type::do_get_tree(Gogo
* gogo
)
7278 if (this->is_error_
)
7279 return error_mark_node
;
7281 tree t
= this->named_tree_
;
7283 // FIXME: GOGO can be NULL when called from go_type_for_size, which
7284 // is only used for basic types.
7285 if (gogo
== NULL
|| !gogo
->named_types_are_converted())
7287 // We have not completed converting named types. NAMED_TREE_ is
7288 // a placeholder and we shouldn't do anything further.
7292 // We don't build dependencies for types whose sizes do not
7293 // change or are not relevant, so we may see them here while
7294 // converting types.
7295 this->create_placeholder(gogo
);
7296 t
= this->named_tree_
;
7297 gcc_assert(t
!= NULL_TREE
);
7301 // We are not converting types. This should only be called if the
7302 // type has already been converted.
7303 gcc_assert(this->is_converted_
);
7304 gcc_assert(t
!= NULL_TREE
&& TYPE_SIZE(t
) != NULL_TREE
);
7306 // Complete the tree.
7307 Type
* base
= this->type_
->base();
7309 switch (base
->classification())
7312 return error_mark_node
;
7324 case TYPE_INTERFACE
:
7328 // Don't build a circular data structure. GENERIC can't handle
7330 if (this->seen_
> 0)
7332 this->is_circular_
= true;
7333 return ptr_type_node
;
7336 t1
= Type::get_named_type_tree(gogo
, base
);
7338 if (t1
== error_mark_node
)
7339 return error_mark_node
;
7340 if (this->is_circular_
)
7342 gcc_assert(t
!= NULL_TREE
&& TREE_CODE(t
) == POINTER_TYPE
);
7343 gcc_assert(TREE_CODE(t1
) == POINTER_TYPE
);
7344 TREE_TYPE(t
) = TREE_TYPE(t1
);
7348 // Don't build a circular data structure. GENERIC can't handle
7350 if (this->seen_
> 0)
7352 this->is_circular_
= true;
7353 return ptr_type_node
;
7356 t1
= Type::get_named_type_tree(gogo
, base
);
7358 if (t1
== error_mark_node
)
7359 return error_mark_node
;
7360 if (this->is_circular_
)
7362 gcc_assert(t
!= NULL_TREE
&& TREE_CODE(t
) == POINTER_TYPE
);
7363 gcc_assert(TREE_CODE(t1
) == POINTER_TYPE
);
7364 TREE_TYPE(t
) = TREE_TYPE(t1
);
7368 if (base
->is_open_array_type())
7370 if (this->seen_
> 0)
7375 t
= base
->array_type()->fill_in_slice_tree(gogo
, t
);
7383 case TYPE_CALL_MULTIPLE_RESULT
:
7392 // Build a type descriptor for a named type.
7395 Named_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
7397 // If NAME is not NULL, then we don't really want the type
7398 // descriptor for this type; we want the descriptor for the
7399 // underlying type, giving it the name NAME.
7400 return this->named_type_descriptor(gogo
, this->type_
,
7401 name
== NULL
? this : name
);
7404 // Add to the reflection string. This is used mostly for the name of
7405 // the type used in a type descriptor, not for actual reflection
7409 Named_type::do_reflection(Gogo
* gogo
, std::string
* ret
) const
7411 if (this->location() != BUILTINS_LOCATION
)
7413 const Package
* package
= this->named_object_
->package();
7414 if (package
!= NULL
)
7415 ret
->append(package
->name());
7417 ret
->append(gogo
->package_name());
7418 ret
->push_back('.');
7420 if (this->in_function_
!= NULL
)
7422 ret
->append(Gogo::unpack_hidden_name(this->in_function_
->name()));
7423 ret
->push_back('$');
7425 ret
->append(Gogo::unpack_hidden_name(this->named_object_
->name()));
7428 // Get the mangled name.
7431 Named_type::do_mangled_name(Gogo
* gogo
, std::string
* ret
) const
7433 Named_object
* no
= this->named_object_
;
7435 if (this->location() == BUILTINS_LOCATION
)
7436 gcc_assert(this->in_function_
== NULL
);
7439 const std::string
& unique_prefix(no
->package() == NULL
7440 ? gogo
->unique_prefix()
7441 : no
->package()->unique_prefix());
7442 const std::string
& package_name(no
->package() == NULL
7443 ? gogo
->package_name()
7444 : no
->package()->name());
7445 name
= unique_prefix
;
7446 name
.append(1, '.');
7447 name
.append(package_name
);
7448 name
.append(1, '.');
7449 if (this->in_function_
!= NULL
)
7451 name
.append(Gogo::unpack_hidden_name(this->in_function_
->name()));
7452 name
.append(1, '$');
7455 name
.append(Gogo::unpack_hidden_name(no
->name()));
7457 snprintf(buf
, sizeof buf
, "N%u_", static_cast<unsigned int>(name
.length()));
7462 // Export the type. This is called to export a global type.
7465 Named_type::export_named_type(Export
* exp
, const std::string
&) const
7467 // We don't need to write the name of the type here, because it will
7468 // be written by Export::write_type anyhow.
7469 exp
->write_c_string("type ");
7470 exp
->write_type(this);
7471 exp
->write_c_string(";\n");
7474 // Import a named type.
7477 Named_type::import_named_type(Import
* imp
, Named_type
** ptype
)
7479 imp
->require_c_string("type ");
7480 Type
*type
= imp
->read_type();
7481 *ptype
= type
->named_type();
7482 gcc_assert(*ptype
!= NULL
);
7483 imp
->require_c_string(";\n");
7486 // Export the type when it is referenced by another type. In this
7487 // case Export::export_type will already have issued the name.
7490 Named_type::do_export(Export
* exp
) const
7492 exp
->write_type(this->type_
);
7494 // To save space, we only export the methods directly attached to
7496 Bindings
* methods
= this->local_methods_
;
7497 if (methods
== NULL
)
7500 exp
->write_c_string("\n");
7501 for (Bindings::const_definitions_iterator p
= methods
->begin_definitions();
7502 p
!= methods
->end_definitions();
7505 exp
->write_c_string(" ");
7506 (*p
)->export_named_object(exp
);
7509 for (Bindings::const_declarations_iterator p
= methods
->begin_declarations();
7510 p
!= methods
->end_declarations();
7513 if (p
->second
->is_function_declaration())
7515 exp
->write_c_string(" ");
7516 p
->second
->export_named_object(exp
);
7521 // Make a named type.
7524 Type::make_named_type(Named_object
* named_object
, Type
* type
,
7525 source_location location
)
7527 return new Named_type(named_object
, type
, location
);
7530 // Finalize the methods for TYPE. It will be a named type or a struct
7531 // type. This sets *ALL_METHODS to the list of methods, and builds
7532 // all required stubs.
7535 Type::finalize_methods(Gogo
* gogo
, const Type
* type
, source_location location
,
7536 Methods
** all_methods
)
7538 *all_methods
= NULL
;
7539 Types_seen types_seen
;
7540 Type::add_methods_for_type(type
, NULL
, 0, false, false, &types_seen
,
7542 Type::build_stub_methods(gogo
, type
, *all_methods
, location
);
7545 // Add the methods for TYPE to *METHODS. FIELD_INDEXES is used to
7546 // build up the struct field indexes as we go. DEPTH is the depth of
7547 // the field within TYPE. IS_EMBEDDED_POINTER is true if we are
7548 // adding these methods for an anonymous field with pointer type.
7549 // NEEDS_STUB_METHOD is true if we need to use a stub method which
7550 // calls the real method. TYPES_SEEN is used to avoid infinite
7554 Type::add_methods_for_type(const Type
* type
,
7555 const Method::Field_indexes
* field_indexes
,
7557 bool is_embedded_pointer
,
7558 bool needs_stub_method
,
7559 Types_seen
* types_seen
,
7562 // Pointer types may not have methods.
7563 if (type
->points_to() != NULL
)
7566 const Named_type
* nt
= type
->named_type();
7569 std::pair
<Types_seen::iterator
, bool> ins
= types_seen
->insert(nt
);
7575 Type::add_local_methods_for_type(nt
, field_indexes
, depth
,
7576 is_embedded_pointer
, needs_stub_method
,
7579 Type::add_embedded_methods_for_type(type
, field_indexes
, depth
,
7580 is_embedded_pointer
, needs_stub_method
,
7581 types_seen
, methods
);
7583 // If we are called with depth > 0, then we are looking at an
7584 // anonymous field of a struct. If such a field has interface type,
7585 // then we need to add the interface methods. We don't want to add
7586 // them when depth == 0, because we will already handle them
7587 // following the usual rules for an interface type.
7589 Type::add_interface_methods_for_type(type
, field_indexes
, depth
, methods
);
7592 // Add the local methods for the named type NT to *METHODS. The
7593 // parameters are as for add_methods_to_type.
7596 Type::add_local_methods_for_type(const Named_type
* nt
,
7597 const Method::Field_indexes
* field_indexes
,
7599 bool is_embedded_pointer
,
7600 bool needs_stub_method
,
7603 const Bindings
* local_methods
= nt
->local_methods();
7604 if (local_methods
== NULL
)
7607 if (*methods
== NULL
)
7608 *methods
= new Methods();
7610 for (Bindings::const_declarations_iterator p
=
7611 local_methods
->begin_declarations();
7612 p
!= local_methods
->end_declarations();
7615 Named_object
* no
= p
->second
;
7616 bool is_value_method
= (is_embedded_pointer
7617 || !Type::method_expects_pointer(no
));
7618 Method
* m
= new Named_method(no
, field_indexes
, depth
, is_value_method
,
7620 || (depth
> 0 && is_value_method
)));
7621 if (!(*methods
)->insert(no
->name(), m
))
7626 // Add the embedded methods for TYPE to *METHODS. These are the
7627 // methods attached to anonymous fields. The parameters are as for
7628 // add_methods_to_type.
7631 Type::add_embedded_methods_for_type(const Type
* type
,
7632 const Method::Field_indexes
* field_indexes
,
7634 bool is_embedded_pointer
,
7635 bool needs_stub_method
,
7636 Types_seen
* types_seen
,
7639 // Look for anonymous fields in TYPE. TYPE has fields if it is a
7641 const Struct_type
* st
= type
->struct_type();
7645 const Struct_field_list
* fields
= st
->fields();
7650 for (Struct_field_list::const_iterator pf
= fields
->begin();
7651 pf
!= fields
->end();
7654 if (!pf
->is_anonymous())
7657 Type
* ftype
= pf
->type();
7658 bool is_pointer
= false;
7659 if (ftype
->points_to() != NULL
)
7661 ftype
= ftype
->points_to();
7664 Named_type
* fnt
= ftype
->named_type();
7667 // This is an error, but it will be diagnosed elsewhere.
7671 Method::Field_indexes
* sub_field_indexes
= new Method::Field_indexes();
7672 sub_field_indexes
->next
= field_indexes
;
7673 sub_field_indexes
->field_index
= i
;
7675 Type::add_methods_for_type(fnt
, sub_field_indexes
, depth
+ 1,
7676 (is_embedded_pointer
|| is_pointer
),
7685 // If TYPE is an interface type, then add its method to *METHODS.
7686 // This is for interface methods attached to an anonymous field. The
7687 // parameters are as for add_methods_for_type.
7690 Type::add_interface_methods_for_type(const Type
* type
,
7691 const Method::Field_indexes
* field_indexes
,
7695 const Interface_type
* it
= type
->interface_type();
7699 const Typed_identifier_list
* imethods
= it
->methods();
7700 if (imethods
== NULL
)
7703 if (*methods
== NULL
)
7704 *methods
= new Methods();
7706 for (Typed_identifier_list::const_iterator pm
= imethods
->begin();
7707 pm
!= imethods
->end();
7710 Function_type
* fntype
= pm
->type()->function_type();
7713 // This is an error, but it should be reported elsewhere
7714 // when we look at the methods for IT.
7717 gcc_assert(!fntype
->is_method());
7718 fntype
= fntype
->copy_with_receiver(const_cast<Type
*>(type
));
7719 Method
* m
= new Interface_method(pm
->name(), pm
->location(), fntype
,
7720 field_indexes
, depth
);
7721 if (!(*methods
)->insert(pm
->name(), m
))
7726 // Build stub methods for TYPE as needed. METHODS is the set of
7727 // methods for the type. A stub method may be needed when a type
7728 // inherits a method from an anonymous field. When we need the
7729 // address of the method, as in a type descriptor, we need to build a
7730 // little stub which does the required field dereferences and jumps to
7731 // the real method. LOCATION is the location of the type definition.
7734 Type::build_stub_methods(Gogo
* gogo
, const Type
* type
, const Methods
* methods
,
7735 source_location location
)
7737 if (methods
== NULL
)
7739 for (Methods::const_iterator p
= methods
->begin();
7740 p
!= methods
->end();
7743 Method
* m
= p
->second
;
7744 if (m
->is_ambiguous() || !m
->needs_stub_method())
7747 const std::string
& name(p
->first
);
7749 // Build a stub method.
7751 const Function_type
* fntype
= m
->type();
7753 static unsigned int counter
;
7755 snprintf(buf
, sizeof buf
, "$this%u", counter
);
7758 Type
* receiver_type
= const_cast<Type
*>(type
);
7759 if (!m
->is_value_method())
7760 receiver_type
= Type::make_pointer_type(receiver_type
);
7761 source_location receiver_location
= m
->receiver_location();
7762 Typed_identifier
* receiver
= new Typed_identifier(buf
, receiver_type
,
7765 const Typed_identifier_list
* fnparams
= fntype
->parameters();
7766 Typed_identifier_list
* stub_params
;
7767 if (fnparams
== NULL
|| fnparams
->empty())
7771 // We give each stub parameter a unique name.
7772 stub_params
= new Typed_identifier_list();
7773 for (Typed_identifier_list::const_iterator pp
= fnparams
->begin();
7774 pp
!= fnparams
->end();
7778 snprintf(pbuf
, sizeof pbuf
, "$p%u", counter
);
7779 stub_params
->push_back(Typed_identifier(pbuf
, pp
->type(),
7785 const Typed_identifier_list
* fnresults
= fntype
->results();
7786 Typed_identifier_list
* stub_results
;
7787 if (fnresults
== NULL
|| fnresults
->empty())
7788 stub_results
= NULL
;
7791 // We create the result parameters without any names, since
7792 // we won't refer to them.
7793 stub_results
= new Typed_identifier_list();
7794 for (Typed_identifier_list::const_iterator pr
= fnresults
->begin();
7795 pr
!= fnresults
->end();
7797 stub_results
->push_back(Typed_identifier("", pr
->type(),
7801 Function_type
* stub_type
= Type::make_function_type(receiver
,
7804 fntype
->location());
7805 if (fntype
->is_varargs())
7806 stub_type
->set_is_varargs();
7808 // We only create the function in the package which creates the
7810 const Package
* package
;
7811 if (type
->named_type() == NULL
)
7814 package
= type
->named_type()->named_object()->package();
7816 if (package
!= NULL
)
7817 stub
= Named_object::make_function_declaration(name
, package
,
7818 stub_type
, location
);
7821 stub
= gogo
->start_function(name
, stub_type
, false,
7822 fntype
->location());
7823 Type::build_one_stub_method(gogo
, m
, buf
, stub_params
,
7824 fntype
->is_varargs(), location
);
7825 gogo
->finish_function(fntype
->location());
7828 m
->set_stub_object(stub
);
7832 // Build a stub method which adjusts the receiver as required to call
7833 // METHOD. RECEIVER_NAME is the name we used for the receiver.
7834 // PARAMS is the list of function parameters.
7837 Type::build_one_stub_method(Gogo
* gogo
, Method
* method
,
7838 const char* receiver_name
,
7839 const Typed_identifier_list
* params
,
7841 source_location location
)
7843 Named_object
* receiver_object
= gogo
->lookup(receiver_name
, NULL
);
7844 gcc_assert(receiver_object
!= NULL
);
7846 Expression
* expr
= Expression::make_var_reference(receiver_object
, location
);
7847 expr
= Type::apply_field_indexes(expr
, method
->field_indexes(), location
);
7848 if (expr
->type()->points_to() == NULL
)
7849 expr
= Expression::make_unary(OPERATOR_AND
, expr
, location
);
7851 Expression_list
* arguments
;
7852 if (params
== NULL
|| params
->empty())
7856 arguments
= new Expression_list();
7857 for (Typed_identifier_list::const_iterator p
= params
->begin();
7861 Named_object
* param
= gogo
->lookup(p
->name(), NULL
);
7862 gcc_assert(param
!= NULL
);
7863 Expression
* param_ref
= Expression::make_var_reference(param
,
7865 arguments
->push_back(param_ref
);
7869 Expression
* func
= method
->bind_method(expr
, location
);
7870 gcc_assert(func
!= NULL
);
7871 Call_expression
* call
= Expression::make_call(func
, arguments
, is_varargs
,
7873 size_t count
= call
->result_count();
7875 gogo
->add_statement(Statement::make_statement(call
));
7878 Expression_list
* retvals
= new Expression_list();
7880 retvals
->push_back(call
);
7883 for (size_t i
= 0; i
< count
; ++i
)
7884 retvals
->push_back(Expression::make_call_result(call
, i
));
7886 const Function
* function
= gogo
->current_function()->func_value();
7887 const Typed_identifier_list
* results
= function
->type()->results();
7888 Statement
* retstat
= Statement::make_return_statement(results
, retvals
,
7890 gogo
->add_statement(retstat
);
7894 // Apply FIELD_INDEXES to EXPR. The field indexes have to be applied
7895 // in reverse order.
7898 Type::apply_field_indexes(Expression
* expr
,
7899 const Method::Field_indexes
* field_indexes
,
7900 source_location location
)
7902 if (field_indexes
== NULL
)
7904 expr
= Type::apply_field_indexes(expr
, field_indexes
->next
, location
);
7905 Struct_type
* stype
= expr
->type()->deref()->struct_type();
7906 gcc_assert(stype
!= NULL
7907 && field_indexes
->field_index
< stype
->field_count());
7908 if (expr
->type()->struct_type() == NULL
)
7910 gcc_assert(expr
->type()->points_to() != NULL
);
7911 expr
= Expression::make_unary(OPERATOR_MULT
, expr
, location
);
7912 gcc_assert(expr
->type()->struct_type() == stype
);
7914 return Expression::make_field_reference(expr
, field_indexes
->field_index
,
7918 // Return whether NO is a method for which the receiver is a pointer.
7921 Type::method_expects_pointer(const Named_object
* no
)
7923 const Function_type
*fntype
;
7924 if (no
->is_function())
7925 fntype
= no
->func_value()->type();
7926 else if (no
->is_function_declaration())
7927 fntype
= no
->func_declaration_value()->type();
7930 return fntype
->receiver()->type()->points_to() != NULL
;
7933 // Given a set of methods for a type, METHODS, return the method NAME,
7934 // or NULL if there isn't one or if it is ambiguous. If IS_AMBIGUOUS
7935 // is not NULL, then set *IS_AMBIGUOUS to true if the method exists
7936 // but is ambiguous (and return NULL).
7939 Type::method_function(const Methods
* methods
, const std::string
& name
,
7942 if (is_ambiguous
!= NULL
)
7943 *is_ambiguous
= false;
7944 if (methods
== NULL
)
7946 Methods::const_iterator p
= methods
->find(name
);
7947 if (p
== methods
->end())
7949 Method
* m
= p
->second
;
7950 if (m
->is_ambiguous())
7952 if (is_ambiguous
!= NULL
)
7953 *is_ambiguous
= true;
7959 // Look for field or method NAME for TYPE. Return an Expression for
7960 // the field or method bound to EXPR. If there is no such field or
7961 // method, give an appropriate error and return an error expression.
7964 Type::bind_field_or_method(Gogo
* gogo
, const Type
* type
, Expression
* expr
,
7965 const std::string
& name
,
7966 source_location location
)
7968 if (type
->deref()->is_error_type())
7969 return Expression::make_error(location
);
7971 const Named_type
* nt
= type
->deref()->named_type();
7972 const Struct_type
* st
= type
->deref()->struct_type();
7973 const Interface_type
* it
= type
->deref()->interface_type();
7975 // If this is a pointer to a pointer, then it is possible that the
7976 // pointed-to type has methods.
7980 && type
->points_to() != NULL
7981 && type
->points_to()->points_to() != NULL
)
7983 expr
= Expression::make_unary(OPERATOR_MULT
, expr
, location
);
7984 type
= type
->points_to();
7985 if (type
->deref()->is_error_type())
7986 return Expression::make_error(location
);
7987 nt
= type
->points_to()->named_type();
7988 st
= type
->points_to()->struct_type();
7989 it
= type
->points_to()->interface_type();
7992 bool receiver_can_be_pointer
= (expr
->type()->points_to() != NULL
7993 || expr
->is_addressable());
7994 std::vector
<const Named_type
*> seen
;
7995 bool is_method
= false;
7996 bool found_pointer_method
= false;
7999 if (Type::find_field_or_method(type
, name
, receiver_can_be_pointer
,
8000 &seen
, NULL
, &is_method
,
8001 &found_pointer_method
, &ambig1
, &ambig2
))
8006 gcc_assert(st
!= NULL
);
8007 if (type
->struct_type() == NULL
)
8009 gcc_assert(type
->points_to() != NULL
);
8010 expr
= Expression::make_unary(OPERATOR_MULT
, expr
,
8012 gcc_assert(expr
->type()->struct_type() == st
);
8014 ret
= st
->field_reference(expr
, name
, location
);
8016 else if (it
!= NULL
&& it
->find_method(name
) != NULL
)
8017 ret
= Expression::make_interface_field_reference(expr
, name
,
8023 m
= nt
->method_function(name
, NULL
);
8024 else if (st
!= NULL
)
8025 m
= st
->method_function(name
, NULL
);
8028 gcc_assert(m
!= NULL
);
8029 if (!m
->is_value_method() && expr
->type()->points_to() == NULL
)
8030 expr
= Expression::make_unary(OPERATOR_AND
, expr
, location
);
8031 ret
= m
->bind_method(expr
, location
);
8033 gcc_assert(ret
!= NULL
);
8038 if (!ambig1
.empty())
8039 error_at(location
, "%qs is ambiguous via %qs and %qs",
8040 Gogo::message_name(name
).c_str(),
8041 Gogo::message_name(ambig1
).c_str(),
8042 Gogo::message_name(ambig2
).c_str());
8043 else if (found_pointer_method
)
8044 error_at(location
, "method requires a pointer");
8045 else if (nt
== NULL
&& st
== NULL
&& it
== NULL
)
8047 ("reference to field %qs in object which "
8048 "has no fields or methods"),
8049 Gogo::message_name(name
).c_str());
8053 if (!Gogo::is_hidden_name(name
))
8054 is_unexported
= false;
8057 std::string unpacked
= Gogo::unpack_hidden_name(name
);
8059 is_unexported
= Type::is_unexported_field_or_method(gogo
, type
,
8064 error_at(location
, "reference to unexported field or method %qs",
8065 Gogo::message_name(name
).c_str());
8067 error_at(location
, "reference to undefined field or method %qs",
8068 Gogo::message_name(name
).c_str());
8070 return Expression::make_error(location
);
8074 // Look in TYPE for a field or method named NAME, return true if one
8075 // is found. This looks through embedded anonymous fields and handles
8076 // ambiguity. If a method is found, sets *IS_METHOD to true;
8077 // otherwise, if a field is found, set it to false. If
8078 // RECEIVER_CAN_BE_POINTER is false, then the receiver is a value
8079 // whose address can not be taken. SEEN is used to avoid infinite
8080 // recursion on invalid types.
8082 // When returning false, this sets *FOUND_POINTER_METHOD if we found a
8083 // method we couldn't use because it requires a pointer. LEVEL is
8084 // used for recursive calls, and can be NULL for a non-recursive call.
8085 // When this function returns false because it finds that the name is
8086 // ambiguous, it will store a path to the ambiguous names in *AMBIG1
8087 // and *AMBIG2. If the name is not found at all, *AMBIG1 and *AMBIG2
8088 // will be unchanged.
8090 // This function just returns whether or not there is a field or
8091 // method, and whether it is a field or method. It doesn't build an
8092 // expression to refer to it. If it is a method, we then look in the
8093 // list of all methods for the type. If it is a field, the search has
8094 // to be done again, looking only for fields, and building up the
8095 // expression as we go.
8098 Type::find_field_or_method(const Type
* type
,
8099 const std::string
& name
,
8100 bool receiver_can_be_pointer
,
8101 std::vector
<const Named_type
*>* seen
,
8104 bool* found_pointer_method
,
8105 std::string
* ambig1
,
8106 std::string
* ambig2
)
8108 // Named types can have locally defined methods.
8109 const Named_type
* nt
= type
->named_type();
8110 if (nt
== NULL
&& type
->points_to() != NULL
)
8111 nt
= type
->points_to()->named_type();
8114 Named_object
* no
= nt
->find_local_method(name
);
8117 if (receiver_can_be_pointer
|| !Type::method_expects_pointer(no
))
8123 // Record that we have found a pointer method in order to
8124 // give a better error message if we don't find anything
8126 *found_pointer_method
= true;
8129 for (std::vector
<const Named_type
*>::const_iterator p
= seen
->begin();
8135 // We've already seen this type when searching for methods.
8141 // Interface types can have methods.
8142 const Interface_type
* it
= type
->deref()->interface_type();
8143 if (it
!= NULL
&& it
->find_method(name
) != NULL
)
8149 // Struct types can have fields. They can also inherit fields and
8150 // methods from anonymous fields.
8151 const Struct_type
* st
= type
->deref()->struct_type();
8154 const Struct_field_list
* fields
= st
->fields();
8159 seen
->push_back(nt
);
8161 int found_level
= 0;
8162 bool found_is_method
= false;
8163 std::string found_ambig1
;
8164 std::string found_ambig2
;
8165 const Struct_field
* found_parent
= NULL
;
8166 for (Struct_field_list::const_iterator pf
= fields
->begin();
8167 pf
!= fields
->end();
8170 if (pf
->field_name() == name
)
8178 if (!pf
->is_anonymous())
8181 if (pf
->type()->deref()->is_error_type()
8182 || pf
->type()->deref()->is_undefined())
8185 Named_type
* fnt
= pf
->type()->named_type();
8187 fnt
= pf
->type()->deref()->named_type();
8188 gcc_assert(fnt
!= NULL
);
8190 int sublevel
= level
== NULL
? 1 : *level
+ 1;
8192 std::string subambig1
;
8193 std::string subambig2
;
8194 bool subfound
= Type::find_field_or_method(fnt
,
8196 receiver_can_be_pointer
,
8200 found_pointer_method
,
8205 if (!subambig1
.empty())
8207 // The name was found via this field, but is ambiguous.
8208 // if the ambiguity is lower or at the same level as
8209 // anything else we have already found, then we want to
8210 // pass the ambiguity back to the caller.
8211 if (found_level
== 0 || sublevel
<= found_level
)
8213 found_ambig1
= pf
->field_name() + '.' + subambig1
;
8214 found_ambig2
= pf
->field_name() + '.' + subambig2
;
8215 found_level
= sublevel
;
8221 // The name was found via this field. Use the level to see
8222 // if we want to use this one, or whether it introduces an
8224 if (found_level
== 0 || sublevel
< found_level
)
8226 found_level
= sublevel
;
8227 found_is_method
= sub_is_method
;
8228 found_ambig1
.clear();
8229 found_ambig2
.clear();
8230 found_parent
= &*pf
;
8232 else if (sublevel
> found_level
)
8234 else if (found_ambig1
.empty())
8236 // We found an ambiguity.
8237 gcc_assert(found_parent
!= NULL
);
8238 found_ambig1
= found_parent
->field_name();
8239 found_ambig2
= pf
->field_name();
8243 // We found an ambiguity, but we already know of one.
8244 // Just report the earlier one.
8249 // Here if we didn't find anything FOUND_LEVEL is 0. If we found
8250 // something ambiguous, FOUND_LEVEL is not 0 and FOUND_AMBIG1 and
8251 // FOUND_AMBIG2 are not empty. If we found the field, FOUND_LEVEL
8252 // is not 0 and FOUND_AMBIG1 and FOUND_AMBIG2 are empty.
8257 if (found_level
== 0)
8259 else if (!found_ambig1
.empty())
8261 gcc_assert(!found_ambig1
.empty());
8262 ambig1
->assign(found_ambig1
);
8263 ambig2
->assign(found_ambig2
);
8265 *level
= found_level
;
8271 *level
= found_level
;
8272 *is_method
= found_is_method
;
8277 // Return whether NAME is an unexported field or method for TYPE.
8280 Type::is_unexported_field_or_method(Gogo
* gogo
, const Type
* type
,
8281 const std::string
& name
,
8282 std::vector
<const Named_type
*>* seen
)
8284 const Named_type
* nt
= type
->named_type();
8286 nt
= type
->deref()->named_type();
8289 if (nt
->is_unexported_local_method(gogo
, name
))
8292 for (std::vector
<const Named_type
*>::const_iterator p
= seen
->begin();
8298 // We've already seen this type.
8304 type
= type
->deref();
8306 const Interface_type
* it
= type
->interface_type();
8307 if (it
!= NULL
&& it
->is_unexported_method(gogo
, name
))
8310 const Struct_type
* st
= type
->struct_type();
8311 if (st
!= NULL
&& st
->is_unexported_local_field(gogo
, name
))
8317 const Struct_field_list
* fields
= st
->fields();
8322 seen
->push_back(nt
);
8324 for (Struct_field_list::const_iterator pf
= fields
->begin();
8325 pf
!= fields
->end();
8328 if (pf
->is_anonymous()
8329 && !pf
->type()->deref()->is_error_type()
8330 && !pf
->type()->deref()->is_undefined())
8332 Named_type
* subtype
= pf
->type()->named_type();
8333 if (subtype
== NULL
)
8334 subtype
= pf
->type()->deref()->named_type();
8335 if (subtype
== NULL
)
8337 // This is an error, but it will be diagnosed elsewhere.
8340 if (Type::is_unexported_field_or_method(gogo
, subtype
, name
, seen
))
8355 // Class Forward_declaration.
8357 Forward_declaration_type::Forward_declaration_type(Named_object
* named_object
)
8358 : Type(TYPE_FORWARD
),
8359 named_object_(named_object
->resolve()), warned_(false)
8361 gcc_assert(this->named_object_
->is_unknown()
8362 || this->named_object_
->is_type_declaration());
8365 // Return the named object.
8368 Forward_declaration_type::named_object()
8370 return this->named_object_
->resolve();
8374 Forward_declaration_type::named_object() const
8376 return this->named_object_
->resolve();
8379 // Return the name of the forward declared type.
8382 Forward_declaration_type::name() const
8384 return this->named_object()->name();
8387 // Warn about a use of a type which has been declared but not defined.
8390 Forward_declaration_type::warn() const
8392 Named_object
* no
= this->named_object_
->resolve();
8393 if (no
->is_unknown())
8395 // The name was not defined anywhere.
8398 error_at(this->named_object_
->location(),
8399 "use of undefined type %qs",
8400 no
->message_name().c_str());
8401 this->warned_
= true;
8404 else if (no
->is_type_declaration())
8406 // The name was seen as a type, but the type was never defined.
8407 if (no
->type_declaration_value()->using_type())
8409 error_at(this->named_object_
->location(),
8410 "use of undefined type %qs",
8411 no
->message_name().c_str());
8412 this->warned_
= true;
8417 // The name was defined, but not as a type.
8420 error_at(this->named_object_
->location(), "expected type");
8421 this->warned_
= true;
8426 // Get the base type of a declaration. This gives an error if the
8427 // type has not yet been defined.
8430 Forward_declaration_type::real_type()
8432 if (this->is_defined())
8433 return this->named_object()->type_value();
8437 return Type::make_error_type();
8442 Forward_declaration_type::real_type() const
8444 if (this->is_defined())
8445 return this->named_object()->type_value();
8449 return Type::make_error_type();
8453 // Return whether the base type is defined.
8456 Forward_declaration_type::is_defined() const
8458 return this->named_object()->is_type();
8461 // Add a method. This is used when methods are defined before the
8465 Forward_declaration_type::add_method(const std::string
& name
,
8468 Named_object
* no
= this->named_object();
8469 if (no
->is_unknown())
8470 no
->declare_as_type();
8471 return no
->type_declaration_value()->add_method(name
, function
);
8474 // Add a method declaration. This is used when methods are declared
8478 Forward_declaration_type::add_method_declaration(const std::string
& name
,
8479 Function_type
* type
,
8480 source_location location
)
8482 Named_object
* no
= this->named_object();
8483 if (no
->is_unknown())
8484 no
->declare_as_type();
8485 Type_declaration
* td
= no
->type_declaration_value();
8486 return td
->add_method_declaration(name
, type
, location
);
8492 Forward_declaration_type::do_traverse(Traverse
* traverse
)
8494 if (this->is_defined()
8495 && Type::traverse(this->real_type(), traverse
) == TRAVERSE_EXIT
)
8496 return TRAVERSE_EXIT
;
8497 return TRAVERSE_CONTINUE
;
8500 // Get a tree for the type.
8503 Forward_declaration_type::do_get_tree(Gogo
* gogo
)
8505 if (this->is_defined())
8506 return Type::get_named_type_tree(gogo
, this->real_type());
8509 return error_mark_node
;
8511 // We represent an undefined type as a struct with no fields. That
8512 // should work fine for the middle-end, since the same case can
8514 Named_object
* no
= this->named_object();
8515 tree type_tree
= make_node(RECORD_TYPE
);
8516 tree id
= no
->get_id(gogo
);
8517 tree decl
= build_decl(no
->location(), TYPE_DECL
, id
, type_tree
);
8518 TYPE_NAME(type_tree
) = decl
;
8519 layout_type(type_tree
);
8523 // Build a type descriptor for a forwarded type.
8526 Forward_declaration_type::do_type_descriptor(Gogo
* gogo
, Named_type
* name
)
8528 if (!this->is_defined())
8529 return Expression::make_nil(BUILTINS_LOCATION
);
8532 Type
* t
= this->real_type();
8534 return this->named_type_descriptor(gogo
, t
, name
);
8536 return Expression::make_type_descriptor(t
, BUILTINS_LOCATION
);
8540 // The reflection string.
8543 Forward_declaration_type::do_reflection(Gogo
* gogo
, std::string
* ret
) const
8545 this->append_reflection(this->real_type(), gogo
, ret
);
8548 // The mangled name.
8551 Forward_declaration_type::do_mangled_name(Gogo
* gogo
, std::string
* ret
) const
8553 if (this->is_defined())
8554 this->append_mangled_name(this->real_type(), gogo
, ret
);
8557 const Named_object
* no
= this->named_object();
8559 if (no
->package() == NULL
)
8560 name
= gogo
->package_name();
8562 name
= no
->package()->name();
8564 name
+= Gogo::unpack_hidden_name(no
->name());
8566 snprintf(buf
, sizeof buf
, "N%u_",
8567 static_cast<unsigned int>(name
.length()));
8573 // Export a forward declaration. This can happen when a defined type
8574 // refers to a type which is only declared (and is presumably defined
8575 // in some other file in the same package).
8578 Forward_declaration_type::do_export(Export
*) const
8580 // If there is a base type, that should be exported instead of this.
8581 gcc_assert(!this->is_defined());
8583 // We don't output anything.
8586 // Make a forward declaration.
8589 Type::make_forward_declaration(Named_object
* named_object
)
8591 return new Forward_declaration_type(named_object
);
8594 // Class Typed_identifier_list.
8596 // Sort the entries by name.
8598 struct Typed_identifier_list_sort
8602 operator()(const Typed_identifier
& t1
, const Typed_identifier
& t2
) const
8603 { return t1
.name() < t2
.name(); }
8607 Typed_identifier_list::sort_by_name()
8609 std::sort(this->entries_
.begin(), this->entries_
.end(),
8610 Typed_identifier_list_sort());
8616 Typed_identifier_list::traverse(Traverse
* traverse
)
8618 for (Typed_identifier_list::const_iterator p
= this->begin();
8622 if (Type::traverse(p
->type(), traverse
) == TRAVERSE_EXIT
)
8623 return TRAVERSE_EXIT
;
8625 return TRAVERSE_CONTINUE
;
8630 Typed_identifier_list
*
8631 Typed_identifier_list::copy() const
8633 Typed_identifier_list
* ret
= new Typed_identifier_list();
8634 for (Typed_identifier_list::const_iterator p
= this->begin();
8637 ret
->push_back(Typed_identifier(p
->name(), p
->type(), p
->location()));