1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
3 2005, 2006, 2007, 2008, 2010 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>.
21 Java and all Java-based marks are trademarks or registered trademarks
22 of Sun Microsystems, Inc. in the United States and other countries.
23 The Free Software Foundation is independent of Sun Microsystems, Inc. */
25 /* Written by Per Bothner <bothner@cygnus.com> */
29 #include "coretypes.h"
32 #include "java-tree.h"
42 #include "tree-iterator.h"
44 #include "tm.h" /* FIXME: For gcc_obstack_init from defaults.h. */
46 /* DOS brain-damage */
48 #define O_BINARY 0 /* MS-DOS brain-damage */
51 static tree
make_method_value (tree
);
52 static tree
build_java_method_type (tree
, tree
, int);
53 static int32
hashUtf8String (const char *, int);
54 static tree
make_field_value (tree
);
55 static tree
get_dispatch_vector (tree
);
56 static tree
get_dispatch_table (tree
, tree
);
57 static int supers_all_compiled (tree type
);
58 static tree
maybe_layout_super_class (tree
, tree
);
59 static void add_miranda_methods (tree
, tree
);
60 static int assume_compiled (const char *);
61 static tree
build_symbol_entry (tree
, tree
);
62 static tree
emit_assertion_table (tree
);
63 static void register_class (void);
65 struct obstack temporary_obstack
;
67 static const char *cyclic_inheritance_report
;
69 /* The compiler generates different code depending on whether or not
70 it can assume certain classes have been compiled down to native
71 code or not. The compiler options -fassume-compiled= and
72 -fno-assume-compiled= are used to create a tree of
73 class_flag_node objects. This tree is queried to determine if
74 a class is assume to be compiled or not. Each node in the tree
75 represents either a package or a specific class. */
77 typedef struct class_flag_node_struct
79 /* The class or package name. */
82 /* Nonzero if this represents an exclusion. */
85 /* Pointers to other nodes in the tree. */
86 struct class_flag_node_struct
*parent
;
87 struct class_flag_node_struct
*sibling
;
88 struct class_flag_node_struct
*child
;
91 static class_flag_node
*find_class_flag_node (class_flag_node
*, const char *);
92 static void add_class_flag (class_flag_node
**, const char *, int);
94 /* This is the root of the include/exclude tree. */
96 static class_flag_node
*assume_compiled_tree
;
98 static class_flag_node
*enable_assert_tree
;
100 static GTY(()) tree class_roots
[4];
101 #define fields_ident class_roots[0] /* get_identifier ("fields") */
102 #define info_ident class_roots[1] /* get_identifier ("info") */
103 #define class_list class_roots[2]
104 #define class_dtable_decl class_roots[3]
106 static GTY(()) VEC(tree
,gc
) *registered_class
;
108 /* A tree that returns the address of the class$ of the class
109 currently being compiled. */
110 static GTY(()) tree this_classdollar
;
112 /* A list of static class fields. This is to emit proper debug
114 VEC(tree
,gc
) *pending_static_fields
;
116 /* Return the node that most closely represents the class whose name
117 is IDENT. Start the search from NODE (followed by its siblings).
118 Return NULL if an appropriate node does not exist. */
120 static class_flag_node
*
121 find_class_flag_node (class_flag_node
*node
, const char *ident
)
125 size_t node_ident_length
= strlen (node
->ident
);
127 /* node_ident_length is zero at the root of the tree. If the
128 identifiers are the same length, then we have matching
129 classes. Otherwise check if we've matched an enclosing
132 if (node_ident_length
== 0
133 || (strncmp (ident
, node
->ident
, node_ident_length
) == 0
134 && (ident
[node_ident_length
] == '\0'
135 || ident
[node_ident_length
] == '.')))
137 /* We've found a match, however, there might be a more
140 class_flag_node
*found
= find_class_flag_node (node
->child
, ident
);
147 /* No match yet. Continue through the sibling list. */
148 node
= node
->sibling
;
151 /* No match at all in this tree. */
156 add_class_flag (class_flag_node
**rootp
, const char *ident
, int value
)
158 class_flag_node
*root
= *rootp
;
159 class_flag_node
*parent
, *node
;
161 /* Create the root of the tree if it doesn't exist yet. */
165 root
= XNEW (class_flag_node
);
168 root
->sibling
= NULL
;
174 /* Calling the function with the empty string means we're setting
175 value for the root of the hierarchy. */
183 /* Find the parent node for this new node. PARENT will either be a
184 class or a package name. Adjust PARENT accordingly. */
186 parent
= find_class_flag_node (root
, ident
);
187 if (strcmp (ident
, parent
->ident
) == 0)
188 parent
->value
= value
;
191 /* Insert new node into the tree. */
192 node
= XNEW (class_flag_node
);
194 node
->ident
= xstrdup (ident
);
198 node
->parent
= parent
;
199 node
->sibling
= parent
->child
;
200 parent
->child
= node
;
204 /* Add a new IDENT to the include/exclude tree. It's an exclusion
205 if EXCLUDEP is nonzero. */
208 add_assume_compiled (const char *ident
, int excludep
)
210 add_class_flag (&assume_compiled_tree
, ident
, excludep
);
213 /* The default value returned by enable_assertions. */
215 #define DEFAULT_ENABLE_ASSERT (optimize == 0)
217 /* Enter IDENT (a class or package name) into the enable-assertions table.
218 VALUE is true to enable and false to disable. */
221 add_enable_assert (const char *ident
, int value
)
223 if (enable_assert_tree
== NULL
)
224 add_class_flag (&enable_assert_tree
, "", DEFAULT_ENABLE_ASSERT
);
225 add_class_flag (&enable_assert_tree
, ident
, value
);
228 /* Returns nonzero if IDENT is the name of a class that the compiler
229 should assume has been compiled to object code. */
232 assume_compiled (const char *ident
)
237 if (NULL
== assume_compiled_tree
)
240 i
= find_class_flag_node (assume_compiled_tree
, ident
);
247 /* Return true if we should generate code to check assertions within KLASS. */
250 enable_assertions (tree klass
)
252 /* Check if command-line specifies whether we should check assertions. */
254 if (klass
!= NULL_TREE
&& DECL_NAME (klass
) && enable_assert_tree
!= NULL
)
256 const char *ident
= IDENTIFIER_POINTER (DECL_NAME (klass
));
257 class_flag_node
*node
258 = find_class_flag_node (enable_assert_tree
, ident
);
262 /* The default is to enable assertions if generating class files,
263 or not optimizing. */
264 return DEFAULT_ENABLE_ASSERT
;
267 /* Return an IDENTIFIER_NODE the same as (OLD_NAME, OLD_LENGTH).
268 except that characters matching OLD_CHAR are substituted by NEW_CHAR.
269 Also, PREFIX is prepended, and SUFFIX is appended. */
272 ident_subst (const char* old_name
,
279 int prefix_len
= strlen (prefix
);
280 int suffix_len
= strlen (suffix
);
281 int i
= prefix_len
+ old_length
+ suffix_len
+ 1;
282 char *buffer
= (char *) alloca (i
);
284 strcpy (buffer
, prefix
);
285 for (i
= 0; i
< old_length
; i
++)
287 char ch
= old_name
[i
];
290 buffer
[prefix_len
+ i
] = ch
;
292 strcpy (buffer
+ prefix_len
+ old_length
, suffix
);
293 return get_identifier (buffer
);
296 /* Return an IDENTIFIER_NODE the same as OLD_ID,
297 except that characters matching OLD_CHAR are substituted by NEW_CHAR.
298 Also, PREFIX is prepended, and SUFFIX is appended. */
301 identifier_subst (const tree old_id
,
307 return ident_subst (IDENTIFIER_POINTER (old_id
), IDENTIFIER_LENGTH (old_id
),
308 prefix
, old_char
, new_char
, suffix
);
311 /* Generate a valid C identifier from the name of the class TYPE,
312 prefixed by PREFIX. */
315 mangled_classname (const char *prefix
, tree type
)
318 tree ident
= TYPE_NAME (type
);
319 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
320 ident
= DECL_NAME (ident
);
321 result
= identifier_subst (ident
, prefix
, '.', '_', "");
323 /* Replace any characters that aren't in the set [0-9a-zA-Z_$] with
324 "_0xXX". Class names containing such chracters are uncommon, but
325 they do sometimes occur in class files. Without this check,
326 these names cause assembly errors.
328 There is a possibility that a real class name could conflict with
329 the identifier we generate, but it is unlikely and will
330 immediately be detected as an assembler error. At some point we
331 should do something more elaborate (perhaps using the full
332 unicode mangling scheme) in order to prevent such a conflict. */
335 const int len
= IDENTIFIER_LENGTH (result
);
336 const char *p
= IDENTIFIER_POINTER (result
);
337 int illegal_chars
= 0;
339 /* Make two passes over the identifier. The first pass is merely
340 to count illegal characters; we need to do this in order to
341 allocate a buffer. */
342 for (i
= 0; i
< len
; i
++)
345 illegal_chars
+= (! ISALNUM (c
) && c
!= '_' && c
!= '$');
348 /* And the second pass, which is rarely executed, does the
350 if (illegal_chars
!= 0)
352 char *buffer
= (char *) alloca (illegal_chars
* 4 + len
+ 1);
355 for (i
= 0, j
= 0; i
< len
; i
++)
358 if (! ISALNUM (c
) && c
!= '_' && c
!= '$')
361 sprintf (&buffer
[j
], "0x%02x", c
);
369 result
= get_identifier (buffer
);
380 type
= make_node (RECORD_TYPE
);
381 /* Unfortunately we must create the binfo here, so that class
383 TYPE_BINFO (type
) = make_tree_binfo (0);
384 MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC (type
);
389 /* Given a fully-qualified classname in NAME (whose length is NAME_LENGTH),
390 and where each of the constituents is separated by '/',
391 return a corresponding IDENTIFIER_NODE, except using '.' as separator. */
394 unmangle_classname (const char *name
, int name_length
)
396 tree to_return
= ident_subst (name
, name_length
, "", '/', '.', "");
397 /* It's not sufficient to compare to_return and get_identifier
398 (name) to determine whether to_return is qualified. There are
399 cases in signature analysis where name will be stripped of a
401 name
= IDENTIFIER_POINTER (to_return
);
405 QUALIFIED_P (to_return
) = 1;
412 #define GEN_TABLE(TABLE, NAME, TABLE_TYPE, TYPE) \
415 const char *type_name = IDENTIFIER_POINTER (mangled_classname ("", TYPE)); \
416 char *buf = (char *) alloca (strlen (type_name) \
417 + strlen (#NAME "_syms_") + 1); \
420 sprintf (buf, #NAME "_%s", type_name); \
421 TYPE_## TABLE ##_DECL (type) = decl = \
422 build_decl (input_location, VAR_DECL, get_identifier (buf), TABLE_TYPE); \
423 DECL_EXTERNAL (decl) = 1; \
424 TREE_STATIC (decl) = 1; \
425 TREE_READONLY (decl) = 1; \
426 TREE_CONSTANT (decl) = 1; \
427 DECL_IGNORED_P (decl) = 1; \
428 /* Mark the table as belonging to this class. */ \
430 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl); \
431 DECL_OWNER (decl) = TYPE; \
432 sprintf (buf, #NAME "_syms_%s", type_name); \
433 TYPE_## TABLE ##_SYMS_DECL (TYPE) = \
434 build_decl (input_location, VAR_DECL, get_identifier (buf), symbols_array_type); \
435 TREE_STATIC (TYPE_## TABLE ##_SYMS_DECL (TYPE)) = 1; \
436 TREE_CONSTANT (TYPE_## TABLE ##_SYMS_DECL (TYPE)) = 1; \
437 DECL_IGNORED_P (TYPE_## TABLE ##_SYMS_DECL (TYPE)) = 1; \
441 /* Given a class, create the DECLs for all its associated indirect
444 gen_indirect_dispatch_tables (tree type
)
446 const char *type_name
= IDENTIFIER_POINTER (mangled_classname ("", type
));
449 char *buf
= (char *) alloca (strlen (type_name
)
450 + strlen ("_catch_classes_") + 1);
451 tree catch_class_type
= make_node (RECORD_TYPE
);
453 sprintf (buf
, "_catch_classes_%s", type_name
);
454 PUSH_FIELD (input_location
,
455 catch_class_type
, field
, "address", utf8const_ptr_type
);
456 PUSH_FIELD (input_location
,
457 catch_class_type
, field
, "classname", ptr_type_node
);
458 FINISH_RECORD (catch_class_type
);
460 TYPE_CTABLE_DECL (type
)
461 = build_decl (input_location
, VAR_DECL
, get_identifier (buf
),
462 build_array_type (catch_class_type
, 0));
463 DECL_EXTERNAL (TYPE_CTABLE_DECL (type
)) = 1;
464 TREE_STATIC (TYPE_CTABLE_DECL (type
)) = 1;
465 TREE_READONLY (TYPE_CTABLE_DECL (type
)) = 1;
466 TREE_CONSTANT (TYPE_CTABLE_DECL (type
)) = 1;
467 DECL_IGNORED_P (TYPE_CTABLE_DECL (type
)) = 1;
468 pushdecl (TYPE_CTABLE_DECL (type
));
471 if (flag_indirect_dispatch
)
473 GEN_TABLE (ATABLE
, _atable
, atable_type
, type
);
474 GEN_TABLE (OTABLE
, _otable
, otable_type
, type
);
475 GEN_TABLE (ITABLE
, _itable
, itable_type
, type
);
482 push_class (tree class_type
, tree class_name
)
484 tree decl
, signature
;
485 location_t saved_loc
= input_location
;
486 CLASS_P (class_type
) = 1;
487 decl
= build_decl (input_location
, TYPE_DECL
, class_name
, class_type
);
488 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
490 /* dbxout needs a DECL_SIZE if in gstabs mode */
491 DECL_SIZE (decl
) = integer_zero_node
;
493 input_location
= saved_loc
;
494 signature
= identifier_subst (class_name
, "L", '.', '/', ";");
495 IDENTIFIER_SIGNATURE_TYPE (signature
) = build_pointer_type (class_type
);
497 /* Setting DECL_ARTIFICIAL forces dbxout.c to specific the type is
498 both a typedef and in the struct name-space. We may want to re-visit
499 this later, but for now it reduces the changes needed for gdb. */
500 DECL_ARTIFICIAL (decl
) = 1;
502 pushdecl_top_level (decl
);
507 /* Finds the (global) class named NAME. Creates the class if not found.
508 Also creates associated TYPE_DECL.
509 Does not check if the class actually exists, load the class,
510 fill in field or methods, or do layout_type. */
513 lookup_class (tree name
)
515 tree decl
= IDENTIFIER_CLASS_VALUE (name
);
516 if (decl
== NULL_TREE
)
517 decl
= push_class (make_class (), name
);
518 return TREE_TYPE (decl
);
522 set_super_info (int access_flags
, tree this_class
,
523 tree super_class
, int interfaces_count
)
525 int total_supers
= interfaces_count
;
526 tree class_decl
= TYPE_NAME (this_class
);
532 TYPE_BINFO (this_class
) = make_tree_binfo (total_supers
);
533 TYPE_VFIELD (this_class
) = TYPE_VFIELD (object_type_node
);
536 tree super_binfo
= make_tree_binfo (0);
537 BINFO_TYPE (super_binfo
) = super_class
;
538 BINFO_OFFSET (super_binfo
) = integer_zero_node
;
539 BINFO_BASE_APPEND (TYPE_BINFO (this_class
), super_binfo
);
540 CLASS_HAS_SUPER_FLAG (TYPE_BINFO (this_class
)) = 1;
543 set_class_decl_access_flags (access_flags
, class_decl
);
547 set_class_decl_access_flags (int access_flags
, tree class_decl
)
549 if (access_flags
& ACC_PUBLIC
) CLASS_PUBLIC (class_decl
) = 1;
550 if (access_flags
& ACC_FINAL
) CLASS_FINAL (class_decl
) = 1;
551 if (access_flags
& ACC_SUPER
) CLASS_SUPER (class_decl
) = 1;
552 if (access_flags
& ACC_INTERFACE
) CLASS_INTERFACE (class_decl
) = 1;
553 if (access_flags
& ACC_ABSTRACT
) CLASS_ABSTRACT (class_decl
) = 1;
554 if (access_flags
& ACC_STATIC
) CLASS_STATIC (class_decl
) = 1;
555 if (access_flags
& ACC_PRIVATE
) CLASS_PRIVATE (class_decl
) = 1;
556 if (access_flags
& ACC_PROTECTED
) CLASS_PROTECTED (class_decl
) = 1;
557 if (access_flags
& ACC_STRICT
) CLASS_STRICTFP (class_decl
) = 1;
558 if (access_flags
& ACC_ENUM
) CLASS_ENUM (class_decl
) = 1;
559 if (access_flags
& ACC_SYNTHETIC
) CLASS_SYNTHETIC (class_decl
) = 1;
560 if (access_flags
& ACC_ANNOTATION
) CLASS_ANNOTATION (class_decl
) = 1;
563 /* Return length of inheritance chain of CLAS, where java.lang.Object is 0,
564 direct sub-classes of Object are 1, and so on. */
567 class_depth (tree clas
)
570 if (! CLASS_LOADED_P (clas
))
571 load_class (clas
, 1);
572 if (TYPE_SIZE (clas
) == error_mark_node
)
574 while (clas
!= object_type_node
)
577 clas
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (clas
), 0));
582 /* Return true iff TYPE2 is an interface that extends interface TYPE1 */
585 interface_of_p (tree type1
, tree type2
)
588 tree binfo
, base_binfo
;
590 if (! TYPE_BINFO (type2
))
593 for (binfo
= TYPE_BINFO (type2
), i
= 0;
594 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
595 if (BINFO_TYPE (base_binfo
) == type1
)
598 for (binfo
= TYPE_BINFO (type2
), i
= 0;
599 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++) /* */
600 if (BINFO_TYPE (base_binfo
)
601 && interface_of_p (type1
, BINFO_TYPE (base_binfo
)))
607 /* Return true iff TYPE1 inherits from TYPE2. */
610 inherits_from_p (tree type1
, tree type2
)
612 while (type1
!= NULL_TREE
&& TREE_CODE (type1
) == RECORD_TYPE
)
617 if (! CLASS_LOADED_P (type1
))
618 load_class (type1
, 1);
620 type1
= maybe_layout_super_class (CLASSTYPE_SUPER (type1
), type1
);
625 /* Return a 1 iff TYPE1 is an enclosing context for TYPE2 */
628 enclosing_context_p (tree type1
, tree type2
)
630 if (!INNER_CLASS_TYPE_P (type2
))
633 for (type2
= TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type2
)));
635 type2
= (INNER_CLASS_TYPE_P (type2
) ?
636 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type2
))) : NULL_TREE
))
646 /* Return 1 iff TYPE1 and TYPE2 share a common enclosing class, regardless of
650 common_enclosing_context_p (tree type1
, tree type2
)
655 for (current
= type2
; current
;
656 current
= (INNER_CLASS_TYPE_P (current
) ?
657 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current
))) :
659 if (type1
== current
)
662 if (INNER_CLASS_TYPE_P (type1
))
663 type1
= TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type1
)));
670 /* Return 1 iff there exists a common enclosing "this" between TYPE1
671 and TYPE2, without crossing any static context. */
674 common_enclosing_instance_p (tree type1
, tree type2
)
676 if (!PURE_INNER_CLASS_TYPE_P (type1
) || !PURE_INNER_CLASS_TYPE_P (type2
))
679 for (type1
= TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type1
))); type1
;
680 type1
= (PURE_INNER_CLASS_TYPE_P (type1
) ?
681 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type1
))) : NULL_TREE
))
684 for (current
= TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type2
))); current
;
685 current
= (PURE_INNER_CLASS_TYPE_P (current
) ?
686 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current
))) :
688 if (type1
== current
)
694 /* Add INTERFACE_CLASS to THIS_CLASS iff INTERFACE_CLASS can't be
695 found in THIS_CLASS. Returns NULL_TREE upon success, INTERFACE_CLASS
696 if attempt is made to add it twice. */
699 maybe_add_interface (tree this_class
, tree interface_class
)
701 tree binfo
, base_binfo
;
704 for (binfo
= TYPE_BINFO (this_class
), i
= 0;
705 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
706 if (BINFO_TYPE (base_binfo
) == interface_class
)
707 return interface_class
;
708 add_interface (this_class
, interface_class
);
712 /* Add the INTERFACE_CLASS as one of the interfaces of THIS_CLASS. */
715 add_interface (tree this_class
, tree interface_class
)
717 tree interface_binfo
= make_tree_binfo (0);
719 BINFO_TYPE (interface_binfo
) = interface_class
;
720 BINFO_OFFSET (interface_binfo
) = integer_zero_node
;
721 BINFO_VPTR_FIELD (interface_binfo
) = integer_zero_node
;
722 BINFO_VIRTUAL_P (interface_binfo
) = 1;
724 BINFO_BASE_APPEND (TYPE_BINFO (this_class
), interface_binfo
);
728 build_java_method_type (tree fntype
, tree this_class
, int access_flags
)
730 if (access_flags
& ACC_STATIC
)
732 fntype
= build_method_type (this_class
, fntype
);
734 /* We know that arg 1 of every nonstatic method is non-null; tell
736 TYPE_ATTRIBUTES (fntype
) = (tree_cons
737 (get_identifier ("nonnull"),
738 tree_cons (NULL_TREE
,
739 build_int_cst (NULL_TREE
, 1),
741 TYPE_ATTRIBUTES (fntype
)));
746 java_hide_decl (tree decl ATTRIBUTE_UNUSED
)
748 #ifdef HAVE_GAS_HIDDEN
749 DECL_VISIBILITY (decl
) = VISIBILITY_HIDDEN
;
750 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
755 add_method_1 (tree this_class
, int access_flags
, tree name
, tree function_type
)
757 tree method_type
, fndecl
;
759 method_type
= build_java_method_type (function_type
,
760 this_class
, access_flags
);
762 fndecl
= build_decl (input_location
, FUNCTION_DECL
, name
, method_type
);
763 DECL_CONTEXT (fndecl
) = this_class
;
765 DECL_LANG_SPECIFIC (fndecl
)
766 = GGC_CNEW (struct lang_decl
);
767 DECL_LANG_SPECIFIC (fndecl
)->desc
= LANG_DECL_FUNC
;
769 /* Initialize the static initializer test table. */
771 DECL_FUNCTION_INIT_TEST_TABLE (fndecl
) =
772 java_treetreehash_create (10, 1);
774 /* Initialize the initialized (static) class table. */
775 if (access_flags
& ACC_STATIC
)
776 DECL_FUNCTION_INITIALIZED_CLASS_TABLE (fndecl
) =
777 htab_create_ggc (50, htab_hash_pointer
, htab_eq_pointer
, NULL
);
779 TREE_CHAIN (fndecl
) = TYPE_METHODS (this_class
);
780 TYPE_METHODS (this_class
) = fndecl
;
782 /* If pointers to member functions use the least significant bit to
783 indicate whether a function is virtual, ensure a pointer
784 to this function will have that bit clear. */
785 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
786 && !(access_flags
& ACC_STATIC
)
787 && DECL_ALIGN (fndecl
) < 2 * BITS_PER_UNIT
)
788 DECL_ALIGN (fndecl
) = 2 * BITS_PER_UNIT
;
790 /* Notice that this is a finalizer and update the class type
791 accordingly. This is used to optimize instance allocation. */
792 if (name
== finalize_identifier_node
793 && TREE_TYPE (function_type
) == void_type_node
794 && TREE_VALUE (TYPE_ARG_TYPES (function_type
)) == void_type_node
)
795 HAS_FINALIZER_P (this_class
) = 1;
797 if (access_flags
& ACC_PUBLIC
) METHOD_PUBLIC (fndecl
) = 1;
798 if (access_flags
& ACC_PROTECTED
) METHOD_PROTECTED (fndecl
) = 1;
799 if (access_flags
& ACC_PRIVATE
)
800 METHOD_PRIVATE (fndecl
) = 1;
801 if (access_flags
& ACC_NATIVE
)
803 METHOD_NATIVE (fndecl
) = 1;
804 DECL_EXTERNAL (fndecl
) = 1;
807 /* FNDECL is external unless we are compiling it into this object
809 DECL_EXTERNAL (fndecl
) = CLASS_FROM_CURRENTLY_COMPILED_P (this_class
) == 0;
810 if (access_flags
& ACC_STATIC
)
811 METHOD_STATIC (fndecl
) = 1;
812 if (access_flags
& ACC_FINAL
)
813 METHOD_FINAL (fndecl
) = 1;
814 if (access_flags
& ACC_SYNCHRONIZED
) METHOD_SYNCHRONIZED (fndecl
) = 1;
815 if (access_flags
& ACC_ABSTRACT
) METHOD_ABSTRACT (fndecl
) = 1;
816 if (access_flags
& ACC_STRICT
) METHOD_STRICTFP (fndecl
) = 1;
817 if (access_flags
& ACC_SYNTHETIC
) DECL_ARTIFICIAL (fndecl
) = 1;
818 if (access_flags
& ACC_BRIDGE
) METHOD_BRIDGE (fndecl
) = 1;
819 if (access_flags
& ACC_VARARGS
) METHOD_VARARGS (fndecl
) = 1;
823 /* Add a method to THIS_CLASS.
824 The method's name is NAME.
825 Its signature (mangled type) is METHOD_SIG (an IDENTIFIER_NODE). */
828 add_method (tree this_class
, int access_flags
, tree name
, tree method_sig
)
830 tree function_type
, fndecl
;
831 const unsigned char *sig
832 = (const unsigned char *) IDENTIFIER_POINTER (method_sig
);
835 fatal_error ("bad method signature");
837 function_type
= get_type_from_signature (method_sig
);
838 fndecl
= add_method_1 (this_class
, access_flags
, name
, function_type
);
839 set_java_signature (TREE_TYPE (fndecl
), method_sig
);
844 add_field (tree klass
, tree name
, tree field_type
, int flags
)
846 int is_static
= (flags
& ACC_STATIC
) != 0;
848 field
= build_decl (input_location
,
849 is_static
? VAR_DECL
: FIELD_DECL
, name
, field_type
);
850 TREE_CHAIN (field
) = TYPE_FIELDS (klass
);
851 TYPE_FIELDS (klass
) = field
;
852 DECL_CONTEXT (field
) = klass
;
853 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field
);
855 if (flags
& ACC_PUBLIC
) FIELD_PUBLIC (field
) = 1;
856 if (flags
& ACC_PROTECTED
) FIELD_PROTECTED (field
) = 1;
857 if (flags
& ACC_PRIVATE
) FIELD_PRIVATE (field
) = 1;
858 if (flags
& ACC_FINAL
) FIELD_FINAL (field
) = 1;
859 if (flags
& ACC_VOLATILE
)
861 FIELD_VOLATILE (field
) = 1;
862 TREE_THIS_VOLATILE (field
) = 1;
864 if (flags
& ACC_TRANSIENT
) FIELD_TRANSIENT (field
) = 1;
865 if (flags
& ACC_ENUM
) FIELD_ENUM (field
) = 1;
866 if (flags
& ACC_SYNTHETIC
) FIELD_SYNTHETIC (field
) = 1;
869 FIELD_STATIC (field
) = 1;
870 /* Always make field externally visible. This is required so
871 that native methods can always access the field. */
872 TREE_PUBLIC (field
) = 1;
873 /* Hide everything that shouldn't be visible outside a DSO. */
874 if (flag_indirect_classes
875 || (FIELD_PRIVATE (field
)))
876 java_hide_decl (field
);
877 /* Considered external unless we are compiling it into this
879 DECL_EXTERNAL (field
) = (is_compiled_class (klass
) != 2);
880 if (!DECL_EXTERNAL (field
))
881 VEC_safe_push (tree
, gc
, pending_static_fields
, field
);
887 /* Associate a constant value CONSTANT with VAR_DECL FIELD. */
890 set_constant_value (tree field
, tree constant
)
892 if (field
== NULL_TREE
)
893 warning (OPT_Wattributes
,
894 "misplaced ConstantValue attribute (not in any field)");
895 else if (DECL_INITIAL (field
) != NULL_TREE
)
896 warning (OPT_Wattributes
,
897 "duplicate ConstantValue attribute for field '%s'",
898 IDENTIFIER_POINTER (DECL_NAME (field
)));
901 DECL_INITIAL (field
) = constant
;
902 if (TREE_TYPE (constant
) != TREE_TYPE (field
)
903 && ! (TREE_TYPE (constant
) == int_type_node
904 && INTEGRAL_TYPE_P (TREE_TYPE (field
))
905 && TYPE_PRECISION (TREE_TYPE (field
)) <= 32)
906 && ! (TREE_TYPE (constant
) == utf8const_ptr_type
907 && TREE_TYPE (field
) == string_ptr_type_node
))
908 error ("ConstantValue attribute of field '%s' has wrong type",
909 IDENTIFIER_POINTER (DECL_NAME (field
)));
913 /* Calculate a hash value for a string encoded in Utf8 format.
914 * This returns the same hash value as specified for java.lang.String.hashCode.
918 hashUtf8String (const char *str
, int len
)
920 const unsigned char* ptr
= (const unsigned char*) str
;
921 const unsigned char *limit
= ptr
+ len
;
925 int ch
= UTF8_GET (ptr
, limit
);
926 /* Updated specification from
927 http://www.javasoft.com/docs/books/jls/clarify.html. */
928 hash
= (31 * hash
) + ch
;
934 build_utf8_ref (tree name
)
936 const char * name_ptr
= IDENTIFIER_POINTER (name
);
937 int name_len
= IDENTIFIER_LENGTH (name
), name_pad
;
939 tree ctype
, field
= NULL_TREE
, str_type
, cinit
, string
;
940 static int utf8_count
= 0;
942 tree ref
= IDENTIFIER_UTF8_REF (name
);
944 VEC(constructor_elt
,gc
) *v
= NULL
;
945 if (ref
!= NULL_TREE
)
948 ctype
= make_node (RECORD_TYPE
);
949 /* '\0' byte plus padding to utf8const_type's alignment. */
950 name_pad
= TYPE_ALIGN_UNIT (utf8const_type
)
951 - (name_len
& (TYPE_ALIGN_UNIT (utf8const_type
) - 1));
952 str_type
= build_prim_array_type (unsigned_byte_type_node
,
953 name_len
+ name_pad
);
954 PUSH_FIELD (input_location
, ctype
, field
, "hash", unsigned_short_type_node
);
955 PUSH_FIELD (input_location
,
956 ctype
, field
, "length", unsigned_short_type_node
);
957 PUSH_FIELD (input_location
, ctype
, field
, "data", str_type
);
958 FINISH_RECORD (ctype
);
959 START_RECORD_CONSTRUCTOR (v
, ctype
);
960 name_hash
= hashUtf8String (name_ptr
, name_len
) & 0xFFFF;
961 PUSH_FIELD_VALUE (v
, "hash", build_int_cst (NULL_TREE
, name_hash
));
962 PUSH_FIELD_VALUE (v
, "length", build_int_cst (NULL_TREE
, name_len
));
963 string
= build_string (name_len
, name_ptr
);
964 TREE_TYPE (string
) = str_type
;
965 PUSH_FIELD_VALUE (v
, "data", string
);
966 FINISH_RECORD_CONSTRUCTOR (cinit
, v
, ctype
);
967 TREE_CONSTANT (cinit
) = 1;
969 /* Generate a unique-enough identifier. */
970 sprintf(buf
, "_Utf%d", ++utf8_count
);
972 decl
= build_decl (input_location
,
973 VAR_DECL
, get_identifier (buf
), utf8const_type
);
974 TREE_STATIC (decl
) = 1;
975 DECL_ARTIFICIAL (decl
) = 1;
976 DECL_IGNORED_P (decl
) = 1;
977 TREE_READONLY (decl
) = 1;
978 TREE_THIS_VOLATILE (decl
) = 0;
979 DECL_INITIAL (decl
) = cinit
;
981 if (HAVE_GAS_SHF_MERGE
)
984 /* Ensure decl_size is a multiple of utf8const_type's alignment. */
985 decl_size
= name_len
+ 4 + name_pad
;
986 if (flag_merge_constants
&& decl_size
< 256)
989 int flags
= (SECTION_OVERRIDE
990 | SECTION_MERGE
| (SECTION_ENTSIZE
& decl_size
));
991 sprintf (buf
, ".rodata.jutf8.%d", decl_size
);
992 switch_to_section (get_section (buf
, flags
, NULL
));
993 DECL_SECTION_NAME (decl
) = build_string (strlen (buf
), buf
);
997 layout_decl (decl
, 0);
998 DECL_SIZE (decl
) = TYPE_SIZE (ctype
);
999 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (ctype
);
1001 rest_of_decl_compilation (decl
, global_bindings_p (), 0);
1002 varpool_mark_needed_node (varpool_node (decl
));
1003 ref
= build1 (ADDR_EXPR
, utf8const_ptr_type
, decl
);
1004 IDENTIFIER_UTF8_REF (name
) = ref
;
1008 /* Like build_class_ref, but instead of a direct reference generate a
1009 pointer into the constant pool. */
1012 build_indirect_class_ref (tree type
)
1016 index
= alloc_class_constant (type
);
1017 cl
= build_ref_from_constant_pool (index
);
1018 return convert (promote_type (class_ptr_type
), cl
);
1022 build_static_class_ref (tree type
)
1024 tree decl_name
, decl
, ref
;
1026 if (TYPE_SIZE (type
) == error_mark_node
)
1027 return null_pointer_node
;
1028 decl_name
= identifier_subst (DECL_NAME (TYPE_NAME (type
)),
1029 "", '/', '/', ".class$$");
1030 decl
= IDENTIFIER_GLOBAL_VALUE (decl_name
);
1031 if (decl
== NULL_TREE
)
1033 decl
= build_decl (input_location
, VAR_DECL
, decl_name
, class_type_node
);
1034 TREE_STATIC (decl
) = 1;
1035 if (! flag_indirect_classes
)
1037 TREE_PUBLIC (decl
) = 1;
1038 if (CLASS_PRIVATE (TYPE_NAME (type
)))
1039 java_hide_decl (decl
);
1041 DECL_IGNORED_P (decl
) = 1;
1042 DECL_ARTIFICIAL (decl
) = 1;
1043 if (is_compiled_class (type
) == 1)
1044 DECL_EXTERNAL (decl
) = 1;
1045 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl
);
1046 DECL_CLASS_FIELD_P (decl
) = 1;
1047 DECL_CONTEXT (decl
) = type
;
1049 /* ??? We want to preserve the DECL_CONTEXT we set just above,
1050 that that means not calling pushdecl_top_level. */
1051 IDENTIFIER_GLOBAL_VALUE (decl_name
) = decl
;
1054 ref
= build1 (ADDR_EXPR
, class_ptr_type
, decl
);
1059 build_classdollar_field (tree type
)
1061 tree decl_name
= identifier_subst (DECL_NAME (TYPE_NAME (type
)),
1062 "", '/', '/', ".class$");
1063 tree decl
= IDENTIFIER_GLOBAL_VALUE (decl_name
);
1065 if (decl
== NULL_TREE
)
1068 = build_decl (input_location
,
1069 VAR_DECL
, decl_name
,
1072 (build_type_variant (class_type_node
,
1074 /* const */ 1, 0)));
1075 TREE_STATIC (decl
) = 1;
1076 TREE_CONSTANT (decl
) = 1;
1077 TREE_READONLY (decl
) = 1;
1078 TREE_PUBLIC (decl
) = 1;
1079 java_hide_decl (decl
);
1080 DECL_IGNORED_P (decl
) = 1;
1081 DECL_ARTIFICIAL (decl
) = 1;
1082 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl
);
1083 IDENTIFIER_GLOBAL_VALUE (decl_name
) = decl
;
1084 DECL_CLASS_FIELD_P (decl
) = 1;
1085 DECL_CONTEXT (decl
) = type
;
1091 /* Create a local variable that holds the current class$. */
1094 cache_this_class_ref (tree fndecl
)
1098 tree classdollar_field
;
1099 if (flag_indirect_classes
)
1100 classdollar_field
= build_classdollar_field (output_class
);
1102 classdollar_field
= build_static_class_ref (output_class
);
1104 this_classdollar
= build_decl (input_location
,
1105 VAR_DECL
, NULL_TREE
,
1106 TREE_TYPE (classdollar_field
));
1108 java_add_local_var (this_classdollar
);
1109 java_add_stmt (build2 (MODIFY_EXPR
, TREE_TYPE (this_classdollar
),
1110 this_classdollar
, classdollar_field
));
1113 this_classdollar
= build_classdollar_field (output_class
);
1115 /* Prepend class initialization for static methods reachable from
1117 if (METHOD_STATIC (fndecl
)
1118 && (! METHOD_PRIVATE (fndecl
)
1119 || INNER_CLASS_P (DECL_CONTEXT (fndecl
)))
1120 && ! DECL_CLINIT_P (fndecl
)
1121 && ! CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (fndecl
))))
1123 tree init
= build_call_expr (soft_initclass_node
, 1,
1125 java_add_stmt (init
);
1129 /* Remove the reference to the local variable that holds the current
1133 uncache_this_class_ref (tree fndecl ATTRIBUTE_UNUSED
)
1135 this_classdollar
= build_classdollar_field (output_class
);
1138 /* Build a reference to the class TYPE.
1139 Also handles primitive types and array types. */
1142 build_class_ref (tree type
)
1144 int is_compiled
= is_compiled_class (type
);
1148 if (TREE_CODE (type
) == POINTER_TYPE
)
1149 type
= TREE_TYPE (type
);
1151 if (flag_indirect_dispatch
1152 && type
!= output_class
1153 && TREE_CODE (type
) == RECORD_TYPE
)
1154 return build_indirect_class_ref (type
);
1156 if (type
== output_class
&& flag_indirect_classes
)
1158 /* This can be NULL if we see a JNI stub before we see any
1160 if (! this_classdollar
)
1161 this_classdollar
= build_classdollar_field (output_class
);
1162 return this_classdollar
;
1165 if (TREE_CODE (type
) == RECORD_TYPE
)
1166 return build_static_class_ref (type
);
1172 decl_name
= TYPE_NAME (type
);
1173 if (TREE_CODE (decl_name
) == TYPE_DECL
)
1174 decl_name
= DECL_NAME (decl_name
);
1175 name
= IDENTIFIER_POINTER (decl_name
);
1176 if (strncmp (name
, "promoted_", 9) == 0)
1178 sprintf (buffer
, "_Jv_%sClass", name
);
1179 decl_name
= get_identifier (buffer
);
1180 decl
= IDENTIFIER_GLOBAL_VALUE (decl_name
);
1181 if (decl
== NULL_TREE
)
1183 decl
= build_decl (input_location
,
1184 VAR_DECL
, decl_name
, class_type_node
);
1185 TREE_STATIC (decl
) = 1;
1186 TREE_PUBLIC (decl
) = 1;
1187 DECL_EXTERNAL (decl
) = 1;
1188 DECL_ARTIFICIAL (decl
) = 1;
1189 pushdecl_top_level (decl
);
1193 ref
= build1 (ADDR_EXPR
, class_ptr_type
, decl
);
1197 return build_indirect_class_ref (type
);
1200 /* Create a local statically allocated variable that will hold a
1201 pointer to a static field. */
1204 build_fieldref_cache_entry (int index
, tree fdecl ATTRIBUTE_UNUSED
)
1206 tree decl
, decl_name
;
1207 const char *name
= IDENTIFIER_POINTER (mangled_classname ("_cpool_", output_class
));
1208 char *buf
= (char *) alloca (strlen (name
) + 20);
1209 sprintf (buf
, "%s_%d_ref", name
, index
);
1210 decl_name
= get_identifier (buf
);
1211 decl
= IDENTIFIER_GLOBAL_VALUE (decl_name
);
1212 if (decl
== NULL_TREE
)
1214 decl
= build_decl (input_location
,
1215 VAR_DECL
, decl_name
, ptr_type_node
);
1216 TREE_STATIC (decl
) = 1;
1217 TREE_PUBLIC (decl
) = 0;
1218 DECL_EXTERNAL (decl
) = 0;
1219 DECL_ARTIFICIAL (decl
) = 1;
1220 DECL_IGNORED_P (decl
) = 1;
1221 pushdecl_top_level (decl
);
1227 build_static_field_ref (tree fdecl
)
1229 tree fclass
= DECL_CONTEXT (fdecl
);
1230 int is_compiled
= is_compiled_class (fclass
);
1232 /* Allow static final fields to fold to a constant. When using
1233 -findirect-dispatch, we simply never do this folding if compiling
1234 from .class; in the .class file constants will be referred to via
1235 the constant pool. */
1236 if (!flag_indirect_dispatch
1238 || (FIELD_FINAL (fdecl
) && DECL_INITIAL (fdecl
) != NULL_TREE
1239 && (JSTRING_TYPE_P (TREE_TYPE (fdecl
))
1240 || JNUMERIC_TYPE_P (TREE_TYPE (fdecl
)))
1241 && TREE_CONSTANT (DECL_INITIAL (fdecl
)))))
1243 if (is_compiled
== 1)
1244 DECL_EXTERNAL (fdecl
) = 1;
1248 /* Generate a CONSTANT_FieldRef for FDECL in the constant pool
1249 and a class local static variable CACHE_ENTRY, then
1251 *(fdecl **)((__builtin_expect (cache_entry == null, false))
1252 ? cache_entry = _Jv_ResolvePoolEntry (output_class, cpool_index)
1255 This can mostly be optimized away, so that the usual path is a
1256 load followed by a test and branch. _Jv_ResolvePoolEntry is
1257 only called once for each constant pool entry.
1259 There is an optimization that we don't do: at the start of a
1260 method, create a local copy of CACHE_ENTRY and use that instead.
1264 int cpool_index
= alloc_constant_fieldref (output_class
, fdecl
);
1265 tree cache_entry
= build_fieldref_cache_entry (cpool_index
, fdecl
);
1267 = build_call_expr (built_in_decls
[BUILT_IN_EXPECT
], 2,
1268 build2 (EQ_EXPR
, boolean_type_node
,
1269 cache_entry
, null_pointer_node
),
1270 boolean_false_node
);
1271 tree cpool_index_cst
= build_int_cst (NULL_TREE
, cpool_index
);
1273 = build_call_expr (soft_resolvepoolentry_node
, 2,
1274 build_class_ref (output_class
),
1276 init
= build2 (MODIFY_EXPR
, ptr_type_node
, cache_entry
, init
);
1277 init
= build3 (COND_EXPR
, ptr_type_node
, test
, init
, cache_entry
);
1278 init
= fold_convert (build_pointer_type (TREE_TYPE (fdecl
)), init
);
1279 fdecl
= build1 (INDIRECT_REF
, TREE_TYPE (fdecl
), init
);
1285 get_access_flags_from_decl (tree decl
)
1287 int access_flags
= 0;
1288 if (TREE_CODE (decl
) == FIELD_DECL
|| TREE_CODE (decl
) == VAR_DECL
)
1290 if (FIELD_STATIC (decl
))
1291 access_flags
|= ACC_STATIC
;
1292 if (FIELD_PUBLIC (decl
))
1293 access_flags
|= ACC_PUBLIC
;
1294 if (FIELD_PROTECTED (decl
))
1295 access_flags
|= ACC_PROTECTED
;
1296 if (FIELD_PRIVATE (decl
))
1297 access_flags
|= ACC_PRIVATE
;
1298 if (FIELD_FINAL (decl
))
1299 access_flags
|= ACC_FINAL
;
1300 if (FIELD_VOLATILE (decl
))
1301 access_flags
|= ACC_VOLATILE
;
1302 if (FIELD_TRANSIENT (decl
))
1303 access_flags
|= ACC_TRANSIENT
;
1304 if (FIELD_ENUM (decl
))
1305 access_flags
|= ACC_ENUM
;
1306 if (FIELD_SYNTHETIC (decl
))
1307 access_flags
|= ACC_SYNTHETIC
;
1308 return access_flags
;
1310 if (TREE_CODE (decl
) == TYPE_DECL
)
1312 if (CLASS_PUBLIC (decl
))
1313 access_flags
|= ACC_PUBLIC
;
1314 if (CLASS_FINAL (decl
))
1315 access_flags
|= ACC_FINAL
;
1316 if (CLASS_SUPER (decl
))
1317 access_flags
|= ACC_SUPER
;
1318 if (CLASS_INTERFACE (decl
))
1319 access_flags
|= ACC_INTERFACE
;
1320 if (CLASS_ABSTRACT (decl
))
1321 access_flags
|= ACC_ABSTRACT
;
1322 if (CLASS_STATIC (decl
))
1323 access_flags
|= ACC_STATIC
;
1324 if (CLASS_PRIVATE (decl
))
1325 access_flags
|= ACC_PRIVATE
;
1326 if (CLASS_PROTECTED (decl
))
1327 access_flags
|= ACC_PROTECTED
;
1328 if (CLASS_STRICTFP (decl
))
1329 access_flags
|= ACC_STRICT
;
1330 if (CLASS_ENUM (decl
))
1331 access_flags
|= ACC_ENUM
;
1332 if (CLASS_SYNTHETIC (decl
))
1333 access_flags
|= ACC_SYNTHETIC
;
1334 if (CLASS_ANNOTATION (decl
))
1335 access_flags
|= ACC_ANNOTATION
;
1336 return access_flags
;
1338 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1340 if (METHOD_PUBLIC (decl
))
1341 access_flags
|= ACC_PUBLIC
;
1342 if (METHOD_PRIVATE (decl
))
1343 access_flags
|= ACC_PRIVATE
;
1344 if (METHOD_PROTECTED (decl
))
1345 access_flags
|= ACC_PROTECTED
;
1346 if (METHOD_STATIC (decl
))
1347 access_flags
|= ACC_STATIC
;
1348 if (METHOD_FINAL (decl
))
1349 access_flags
|= ACC_FINAL
;
1350 if (METHOD_SYNCHRONIZED (decl
))
1351 access_flags
|= ACC_SYNCHRONIZED
;
1352 if (METHOD_NATIVE (decl
))
1353 access_flags
|= ACC_NATIVE
;
1354 if (METHOD_ABSTRACT (decl
))
1355 access_flags
|= ACC_ABSTRACT
;
1356 if (METHOD_STRICTFP (decl
))
1357 access_flags
|= ACC_STRICT
;
1358 if (METHOD_INVISIBLE (decl
))
1359 access_flags
|= ACC_INVISIBLE
;
1360 if (DECL_ARTIFICIAL (decl
))
1361 access_flags
|= ACC_SYNTHETIC
;
1362 if (METHOD_BRIDGE (decl
))
1363 access_flags
|= ACC_BRIDGE
;
1364 if (METHOD_VARARGS (decl
))
1365 access_flags
|= ACC_VARARGS
;
1366 return access_flags
;
1371 static GTY (()) int alias_labelno
= 0;
1373 /* Create a private alias for METHOD. Using this alias instead of the method
1374 decl ensures that ncode entries in the method table point to the real function
1375 at runtime, not a PLT entry. */
1378 make_local_function_alias (tree method
)
1380 #ifdef ASM_OUTPUT_DEF
1383 const char *method_name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (method
));
1384 char *name
= (char *) alloca (strlen (method_name
) + 2);
1385 char *buf
= (char *) alloca (strlen (method_name
) + 128);
1387 /* Only create aliases for local functions. */
1388 if (DECL_EXTERNAL (method
))
1391 /* Prefix method_name with 'L' for the alias label. */
1393 strcpy (name
+ 1, method_name
);
1395 ASM_GENERATE_INTERNAL_LABEL (buf
, name
, alias_labelno
++);
1396 alias
= build_decl (input_location
,
1397 FUNCTION_DECL
, get_identifier (buf
),
1398 TREE_TYPE (method
));
1399 DECL_CONTEXT (alias
) = NULL
;
1400 TREE_READONLY (alias
) = TREE_READONLY (method
);
1401 TREE_THIS_VOLATILE (alias
) = TREE_THIS_VOLATILE (method
);
1402 TREE_PUBLIC (alias
) = 0;
1403 DECL_EXTERNAL (alias
) = 0;
1404 DECL_ARTIFICIAL (alias
) = 1;
1405 DECL_INITIAL (alias
) = error_mark_node
;
1406 TREE_ADDRESSABLE (alias
) = 1;
1407 TREE_USED (alias
) = 1;
1408 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (alias
)) = 1;
1409 if (!flag_syntax_only
)
1410 assemble_alias (alias
, DECL_ASSEMBLER_NAME (method
));
1417 /** Make reflection data (_Jv_Field) for field FDECL. */
1420 make_field_value (tree fdecl
)
1424 tree type
= TREE_TYPE (fdecl
);
1425 int resolved
= is_compiled_class (type
) && ! flag_indirect_dispatch
;
1426 VEC(constructor_elt
,gc
) *v
= NULL
;
1428 START_RECORD_CONSTRUCTOR (v
, field_type_node
);
1429 PUSH_FIELD_VALUE (v
, "name", build_utf8_ref (DECL_NAME (fdecl
)));
1431 type
= build_class_ref (type
);
1434 tree signature
= build_java_signature (type
);
1436 type
= build_utf8_ref (unmangle_classname
1437 (IDENTIFIER_POINTER (signature
),
1438 IDENTIFIER_LENGTH (signature
)));
1440 PUSH_FIELD_VALUE (v
, "type", type
);
1442 flags
= get_access_flags_from_decl (fdecl
);
1444 flags
|= 0x8000 /* FIELD_UNRESOLVED_FLAG */;
1446 PUSH_FIELD_VALUE (v
, "accflags", build_int_cst (NULL_TREE
, flags
));
1447 PUSH_FIELD_VALUE (v
, "bsize", TYPE_SIZE_UNIT (TREE_TYPE (fdecl
)));
1450 tree field_address
= integer_zero_node
;
1451 if ((DECL_INITIAL (fdecl
) || ! flag_indirect_classes
)
1452 && FIELD_STATIC (fdecl
))
1453 field_address
= build_address_of (fdecl
);
1457 build_constructor_from_list (field_info_union_node
,
1459 ((FIELD_STATIC (fdecl
)
1460 ? TREE_CHAIN (TYPE_FIELDS (field_info_union_node
))
1461 : TYPE_FIELDS (field_info_union_node
)),
1462 (FIELD_STATIC (fdecl
)
1464 : byte_position (fdecl
)))));
1467 FINISH_RECORD_CONSTRUCTOR (finit
, v
, field_type_node
);
1471 /** Make reflection data (_Jv_Method) for method MDECL. */
1474 make_method_value (tree mdecl
)
1476 static int method_name_count
= 0;
1481 #define ACC_TRANSLATED 0x4000
1482 int accflags
= get_access_flags_from_decl (mdecl
) | ACC_TRANSLATED
;
1483 VEC(constructor_elt
,gc
) *v
= NULL
;
1485 class_decl
= DECL_CONTEXT (mdecl
);
1486 /* For interfaces, the index field contains the dispatch index. */
1487 if (CLASS_INTERFACE (TYPE_NAME (class_decl
)))
1488 index
= build_int_cst (NULL_TREE
,
1489 get_interface_method_index (mdecl
, class_decl
));
1490 else if (!flag_indirect_dispatch
&& get_method_index (mdecl
) != NULL_TREE
)
1491 index
= get_method_index (mdecl
);
1493 index
= integer_minus_one_node
;
1495 code
= null_pointer_node
;
1496 if (METHOD_ABSTRACT (mdecl
))
1497 code
= build1 (ADDR_EXPR
, nativecode_ptr_type_node
,
1498 soft_abstractmethod_node
);
1500 code
= build1 (ADDR_EXPR
, nativecode_ptr_type_node
,
1501 make_local_function_alias (mdecl
));
1502 START_RECORD_CONSTRUCTOR (v
, method_type_node
);
1503 PUSH_FIELD_VALUE (v
, "name",
1504 build_utf8_ref (DECL_CONSTRUCTOR_P (mdecl
) ?
1505 init_identifier_node
1506 : DECL_NAME (mdecl
)));
1508 tree signature
= build_java_signature (TREE_TYPE (mdecl
));
1509 PUSH_FIELD_VALUE (v
, "signature",
1512 (IDENTIFIER_POINTER(signature
),
1513 IDENTIFIER_LENGTH(signature
)))));
1515 PUSH_FIELD_VALUE (v
, "accflags", build_int_cst (NULL_TREE
, accflags
));
1516 PUSH_FIELD_VALUE (v
, "index", index
);
1517 PUSH_FIELD_VALUE (v
, "ncode", code
);
1520 /* Compute the `throws' information for the method. */
1521 tree table
= null_pointer_node
;
1522 if (DECL_FUNCTION_THROWS (mdecl
) != NULL
)
1524 int length
= 1 + VEC_length (tree
, DECL_FUNCTION_THROWS (mdecl
));
1525 tree t
, type
, array
;
1529 table
= tree_cons (NULL_TREE
, table
, NULL_TREE
);
1531 VEC_iterate (tree
, DECL_FUNCTION_THROWS (mdecl
), ix
, t
);
1534 tree sig
= DECL_NAME (TYPE_NAME (t
));
1536 = build_utf8_ref (unmangle_classname (IDENTIFIER_POINTER (sig
),
1537 IDENTIFIER_LENGTH (sig
)));
1538 table
= tree_cons (NULL_TREE
, utf8
, table
);
1540 type
= build_prim_array_type (ptr_type_node
, length
);
1541 table
= build_constructor_from_list (type
, table
);
1542 /* Compute something unique enough. */
1543 sprintf (buf
, "_methods%d", method_name_count
++);
1544 array
= build_decl (input_location
,
1545 VAR_DECL
, get_identifier (buf
), type
);
1546 DECL_INITIAL (array
) = table
;
1547 TREE_STATIC (array
) = 1;
1548 DECL_ARTIFICIAL (array
) = 1;
1549 DECL_IGNORED_P (array
) = 1;
1550 rest_of_decl_compilation (array
, 1, 0);
1552 table
= build1 (ADDR_EXPR
, ptr_type_node
, array
);
1555 PUSH_FIELD_VALUE (v
, "throws", table
);
1558 FINISH_RECORD_CONSTRUCTOR (minit
, v
, method_type_node
);
1563 get_dispatch_vector (tree type
)
1565 tree vtable
= TYPE_VTABLE (type
);
1567 if (vtable
== NULL_TREE
)
1571 tree super
= CLASSTYPE_SUPER (type
);
1572 HOST_WIDE_INT nvirtuals
= tree_low_cst (TYPE_NVIRTUALS (type
), 0);
1573 vtable
= make_tree_vec (nvirtuals
);
1574 TYPE_VTABLE (type
) = vtable
;
1575 if (super
!= NULL_TREE
)
1577 tree super_vtable
= get_dispatch_vector (super
);
1579 for (i
= tree_low_cst (TYPE_NVIRTUALS (super
), 0); --i
>= 0; )
1580 TREE_VEC_ELT (vtable
, i
) = TREE_VEC_ELT (super_vtable
, i
);
1583 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
1584 method
= TREE_CHAIN (method
))
1586 tree method_index
= get_method_index (method
);
1587 if (method_index
!= NULL_TREE
1588 && host_integerp (method_index
, 0))
1589 TREE_VEC_ELT (vtable
, tree_low_cst (method_index
, 0)) = method
;
1597 get_dispatch_table (tree type
, tree this_class_addr
)
1599 int abstract_p
= CLASS_ABSTRACT (TYPE_NAME (type
));
1600 tree vtable
= get_dispatch_vector (type
);
1602 tree list
= NULL_TREE
;
1603 int nvirtuals
= TREE_VEC_LENGTH (vtable
);
1607 for (i
= nvirtuals
; --i
>= 0; )
1609 tree method
= TREE_VEC_ELT (vtable
, i
);
1610 if (METHOD_ABSTRACT (method
))
1613 warning_at (DECL_SOURCE_LOCATION (method
), 0,
1614 "abstract method in non-abstract class");
1616 if (TARGET_VTABLE_USES_DESCRIPTORS
)
1617 for (j
= 0; j
< TARGET_VTABLE_USES_DESCRIPTORS
; ++j
)
1618 list
= tree_cons (NULL_TREE
, null_pointer_node
, list
);
1620 list
= tree_cons (NULL_TREE
, null_pointer_node
, list
);
1624 if (TARGET_VTABLE_USES_DESCRIPTORS
)
1625 for (j
= 0; j
< TARGET_VTABLE_USES_DESCRIPTORS
; ++j
)
1627 tree fdesc
= build2 (FDESC_EXPR
, nativecode_ptr_type_node
,
1628 method
, build_int_cst (NULL_TREE
, j
));
1629 TREE_CONSTANT (fdesc
) = 1;
1630 list
= tree_cons (NULL_TREE
, fdesc
, list
);
1633 list
= tree_cons (NULL_TREE
,
1634 build1 (ADDR_EXPR
, nativecode_ptr_type_node
,
1640 /* Dummy entry for compatibility with G++ -fvtable-thunks. When
1641 using the Boehm GC we sometimes stash a GC type descriptor
1642 there. We set the PURPOSE to NULL_TREE not to interfere (reset)
1643 the emitted byte count during the output to the assembly file. */
1644 /* With TARGET_VTABLE_USES_DESCRIPTORS, we only add one extra
1645 fake "function descriptor". It's first word is the is the class
1646 pointer, and subsequent words (usually one) contain the GC descriptor.
1647 In all other cases, we reserve two extra vtable slots. */
1648 gc_descr
= get_boehm_type_descriptor (type
);
1649 list
= tree_cons (NULL_TREE
, gc_descr
, list
);
1650 for (j
= 1; j
< TARGET_VTABLE_USES_DESCRIPTORS
-1; ++j
)
1651 list
= tree_cons (NULL_TREE
, gc_descr
, list
);
1652 list
= tree_cons (NULL_TREE
, this_class_addr
, list
);
1654 /** Pointer to type_info object (to be implemented), according to g++ ABI. */
1655 list
= tree_cons (NULL_TREE
, null_pointer_node
, list
);
1656 /** Offset to start of whole object. Always (ptrdiff_t)0 for Java. */
1657 list
= tree_cons (integer_zero_node
, null_pointer_node
, list
);
1659 arraysize
= (TARGET_VTABLE_USES_DESCRIPTORS
? nvirtuals
+ 1 : nvirtuals
+ 2);
1660 if (TARGET_VTABLE_USES_DESCRIPTORS
)
1661 arraysize
*= TARGET_VTABLE_USES_DESCRIPTORS
;
1663 return build_constructor_from_list
1664 (build_prim_array_type (nativecode_ptr_type_node
,
1669 /* Set the method_index for a method decl. */
1671 set_method_index (tree decl
, tree method_index
)
1673 if (method_index
!= NULL_TREE
)
1675 /* method_index is null if we're using indirect dispatch. */
1676 method_index
= fold (convert (sizetype
, method_index
));
1678 if (TARGET_VTABLE_USES_DESCRIPTORS
)
1679 /* Add one to skip bogus descriptor for class and GC descriptor. */
1680 method_index
= size_binop (PLUS_EXPR
, method_index
, size_int (1));
1682 /* Add 1 to skip "class" field of dtable, and 1 to skip GC
1684 method_index
= size_binop (PLUS_EXPR
, method_index
, size_int (2));
1687 DECL_VINDEX (decl
) = method_index
;
1690 /* Get the method_index for a method decl. */
1692 get_method_index (tree decl
)
1694 tree method_index
= DECL_VINDEX (decl
);
1699 if (TARGET_VTABLE_USES_DESCRIPTORS
)
1700 /* Sub one to skip bogus descriptor for class and GC descriptor. */
1701 method_index
= size_binop (MINUS_EXPR
, method_index
, size_int (1));
1703 /* Sub 1 to skip "class" field of dtable, and 1 to skip GC descriptor. */
1704 method_index
= size_binop (MINUS_EXPR
, method_index
, size_int (2));
1706 return method_index
;
1710 supers_all_compiled (tree type
)
1712 while (type
!= NULL_TREE
)
1714 if (!assume_compiled (IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)))))
1716 type
= CLASSTYPE_SUPER (type
);
1722 add_table_and_syms (VEC(constructor_elt
,gc
) **v
,
1723 VEC(method_entry
,gc
) *methods
,
1724 const char *table_name
, tree table_slot
, tree table_type
,
1725 const char *syms_name
, tree syms_slot
)
1727 if (methods
== NULL
)
1729 PUSH_FIELD_VALUE (*v
, table_name
, null_pointer_node
);
1730 PUSH_FIELD_VALUE (*v
, syms_name
, null_pointer_node
);
1734 pushdecl_top_level (syms_slot
);
1735 PUSH_FIELD_VALUE (*v
, table_name
,
1736 build1 (ADDR_EXPR
, table_type
, table_slot
));
1737 PUSH_FIELD_VALUE (*v
, syms_name
,
1738 build1 (ADDR_EXPR
, symbols_array_ptr_type
,
1740 TREE_CONSTANT (table_slot
) = 1;
1745 make_class_data (tree type
)
1747 tree decl
, cons
, temp
;
1748 tree field
, fields_decl
;
1749 tree static_fields
= NULL_TREE
;
1750 tree instance_fields
= NULL_TREE
;
1751 HOST_WIDE_INT static_field_count
= 0;
1752 HOST_WIDE_INT instance_field_count
= 0;
1753 HOST_WIDE_INT field_count
;
1754 tree field_array_type
;
1756 tree methods
= NULL_TREE
;
1757 tree dtable_decl
= NULL_TREE
;
1758 HOST_WIDE_INT method_count
= 0;
1759 tree method_array_type
;
1762 tree this_class_addr
;
1763 tree constant_pool_constructor
;
1764 tree interfaces
= null_pointer_node
;
1765 int interface_len
= 0;
1766 int uses_jv_markobj
= 0;
1767 tree type_decl
= TYPE_NAME (type
);
1768 tree id_main
= get_identifier("main");
1769 tree id_class
= get_identifier("java.lang.Class");
1770 /** Offset from start of virtual function table declaration
1771 to where objects actually point at, following new g++ ABI. */
1772 tree dtable_start_offset
= size_int (2 * POINTER_SIZE
/ BITS_PER_UNIT
);
1773 VEC(int, heap
) *field_indexes
;
1774 tree first_real_field
;
1775 VEC(constructor_elt
,gc
) *v1
= NULL
, *v2
= NULL
;
1776 tree reflection_data
;
1778 this_class_addr
= build_static_class_ref (type
);
1779 decl
= TREE_OPERAND (this_class_addr
, 0);
1781 if (supers_all_compiled (type
) && ! CLASS_INTERFACE (type_decl
)
1782 && !flag_indirect_dispatch
)
1784 tree dtable
= get_dispatch_table (type
, this_class_addr
);
1785 uses_jv_markobj
= uses_jv_markobj_p (dtable
);
1786 if (type
== class_type_node
&& class_dtable_decl
!= NULL_TREE
)
1788 /* We've already created some other class, and consequently
1789 we made class_dtable_decl. Now we just want to fill it
1791 dtable_decl
= class_dtable_decl
;
1795 dtable_decl
= build_dtable_decl (type
);
1796 TREE_STATIC (dtable_decl
) = 1;
1797 DECL_ARTIFICIAL (dtable_decl
) = 1;
1798 DECL_IGNORED_P (dtable_decl
) = 1;
1801 TREE_PUBLIC (dtable_decl
) = 1;
1802 DECL_INITIAL (dtable_decl
) = dtable
;
1803 /* The only dispatch table exported from a DSO is the dispatch
1804 table for java.lang.Class. */
1805 if (DECL_NAME (type_decl
) != id_class
)
1806 java_hide_decl (dtable_decl
);
1807 if (! flag_indirect_classes
)
1808 rest_of_decl_compilation (dtable_decl
, 1, 0);
1809 /* Maybe we're compiling Class as the first class. If so, set
1810 class_dtable_decl to the decl we just made. */
1811 if (type
== class_type_node
&& class_dtable_decl
== NULL_TREE
)
1812 class_dtable_decl
= dtable_decl
;
1815 /* Build Field array. */
1816 field
= TYPE_FIELDS (type
);
1817 while (field
&& DECL_ARTIFICIAL (field
))
1818 field
= TREE_CHAIN (field
); /* Skip dummy fields. */
1819 if (field
&& DECL_NAME (field
) == NULL_TREE
)
1820 field
= TREE_CHAIN (field
); /* Skip dummy field for inherited data. */
1821 first_real_field
= field
;
1823 /* First count static and instance fields. */
1824 for ( ; field
!= NULL_TREE
; field
= TREE_CHAIN (field
))
1826 if (! DECL_ARTIFICIAL (field
))
1828 if (FIELD_STATIC (field
))
1829 static_field_count
++;
1830 else if (uses_jv_markobj
|| !flag_reduced_reflection
)
1831 instance_field_count
++;
1834 field_count
= static_field_count
+ instance_field_count
;
1835 field_indexes
= VEC_alloc (int, heap
, field_count
);
1837 /* gcj sorts fields so that static fields come first, followed by
1838 instance fields. Unfortunately, by the time this takes place we
1839 have already generated the reflection_data for this class, and
1840 that data contains indexes into the fields. So, we generate a
1841 permutation that maps each original field index to its final
1842 position. Then we pass this permutation to
1843 rewrite_reflection_indexes(), which fixes up the reflection
1847 int static_count
= 0;
1848 int instance_count
= static_field_count
;
1851 for (i
= 0, field
= first_real_field
;
1853 field
= TREE_CHAIN (field
), i
++)
1855 if (! DECL_ARTIFICIAL (field
))
1858 if (FIELD_STATIC (field
))
1859 field_index
= static_count
++;
1860 else if (uses_jv_markobj
|| !flag_reduced_reflection
)
1861 field_index
= instance_count
++;
1864 VEC_quick_push (int, field_indexes
, field_index
);
1869 for (field
= first_real_field
; field
!= NULL_TREE
;
1870 field
= TREE_CHAIN (field
))
1872 if (! DECL_ARTIFICIAL (field
))
1874 if (FIELD_STATIC (field
))
1876 /* We must always create reflection data for static fields
1877 as it is used in the creation of the field itself. */
1878 tree init
= make_field_value (field
);
1879 tree initial
= DECL_INITIAL (field
);
1880 static_fields
= tree_cons (NULL_TREE
, init
, static_fields
);
1881 /* If the initial value is a string constant,
1882 prevent output_constant from trying to assemble the value. */
1883 if (initial
!= NULL_TREE
1884 && TREE_TYPE (initial
) == string_ptr_type_node
)
1885 DECL_INITIAL (field
) = NULL_TREE
;
1886 rest_of_decl_compilation (field
, 1, 1);
1887 DECL_INITIAL (field
) = initial
;
1889 else if (uses_jv_markobj
|| !flag_reduced_reflection
)
1891 tree init
= make_field_value (field
);
1892 instance_fields
= tree_cons (NULL_TREE
, init
, instance_fields
);
1897 if (field_count
> 0)
1899 static_fields
= nreverse (static_fields
);
1900 instance_fields
= nreverse (instance_fields
);
1901 static_fields
= chainon (static_fields
, instance_fields
);
1902 field_array_type
= build_prim_array_type (field_type_node
, field_count
);
1903 fields_decl
= build_decl (input_location
,
1904 VAR_DECL
, mangled_classname ("_FL_", type
),
1906 DECL_INITIAL (fields_decl
) = build_constructor_from_list
1907 (field_array_type
, static_fields
);
1908 TREE_STATIC (fields_decl
) = 1;
1909 DECL_ARTIFICIAL (fields_decl
) = 1;
1910 DECL_IGNORED_P (fields_decl
) = 1;
1911 rest_of_decl_compilation (fields_decl
, 1, 0);
1914 fields_decl
= NULL_TREE
;
1916 /* Build Method array. */
1917 for (method
= TYPE_METHODS (type
);
1918 method
!= NULL_TREE
; method
= TREE_CHAIN (method
))
1921 if (METHOD_PRIVATE (method
)
1922 && ! flag_keep_inline_functions
1925 /* Even if we have a decl, we don't necessarily have the code.
1926 This can happen if we inherit a method from a superclass for
1927 which we don't have a .class file. */
1928 if (METHOD_DUMMY (method
))
1931 /* Generate method reflection data if:
1933 - !flag_reduced_reflection.
1935 - <clinit> -- The runtime uses reflection to initialize the
1938 - Any method in class java.lang.Class -- Class.forName() and
1939 perhaps other things require it.
1941 - class$ -- It does not work if reflection data missing.
1943 - main -- Reflection is used to find main(String[]) methods.
1945 - public not static -- It is potentially part of an
1946 interface. The runtime uses reflection data to build
1947 interface dispatch tables. */
1948 if (!flag_reduced_reflection
1949 || DECL_CLINIT_P (method
)
1950 || DECL_NAME (type_decl
) == id_class
1951 || DECL_NAME (method
) == id_main
1952 || (METHOD_PUBLIC (method
) && !METHOD_STATIC (method
)))
1954 init
= make_method_value (method
);
1956 methods
= tree_cons (NULL_TREE
, init
, methods
);
1959 method_array_type
= build_prim_array_type (method_type_node
, method_count
);
1960 methods_decl
= build_decl (input_location
,
1961 VAR_DECL
, mangled_classname ("_MT_", type
),
1963 DECL_INITIAL (methods_decl
) = build_constructor_from_list
1964 (method_array_type
, nreverse (methods
));
1965 TREE_STATIC (methods_decl
) = 1;
1966 DECL_ARTIFICIAL (methods_decl
) = 1;
1967 DECL_IGNORED_P (methods_decl
) = 1;
1968 rest_of_decl_compilation (methods_decl
, 1, 0);
1970 if (class_dtable_decl
== NULL_TREE
)
1972 class_dtable_decl
= build_dtable_decl (class_type_node
);
1973 TREE_STATIC (class_dtable_decl
) = 1;
1974 DECL_ARTIFICIAL (class_dtable_decl
) = 1;
1975 DECL_IGNORED_P (class_dtable_decl
) = 1;
1976 if (is_compiled_class (class_type_node
) != 2)
1978 DECL_EXTERNAL (class_dtable_decl
) = 1;
1979 rest_of_decl_compilation (class_dtable_decl
, 1, 0);
1983 super
= CLASSTYPE_SUPER (type
);
1984 if (super
== NULL_TREE
)
1985 super
= null_pointer_node
;
1986 else if (! flag_indirect_dispatch
1987 && assume_compiled (IDENTIFIER_POINTER (DECL_NAME (type_decl
)))
1988 && assume_compiled (IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (super
)))))
1989 super
= build_class_ref (super
);
1992 int super_index
= alloc_class_constant (super
);
1993 super
= build_int_cst (ptr_type_node
, super_index
);
1996 /* Build and emit the array of implemented interfaces. */
1997 if (type
!= object_type_node
)
1998 interface_len
= BINFO_N_BASE_BINFOS (TYPE_BINFO (type
)) - 1;
2000 if (interface_len
> 0)
2002 tree init
= NULL_TREE
;
2004 tree interface_array_type
, idecl
;
2005 interface_array_type
2006 = build_prim_array_type (class_ptr_type
, interface_len
);
2007 idecl
= build_decl (input_location
,
2008 VAR_DECL
, mangled_classname ("_IF_", type
),
2009 interface_array_type
);
2011 for (i
= interface_len
; i
> 0; i
--)
2013 tree child
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
2014 tree iclass
= BINFO_TYPE (child
);
2016 if (! flag_indirect_dispatch
2018 (IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (iclass
))))))
2019 index
= build_class_ref (iclass
);
2022 int int_index
= alloc_class_constant (iclass
);
2023 index
= build_int_cst (ptr_type_node
, int_index
);
2025 init
= tree_cons (NULL_TREE
, index
, init
);
2027 DECL_INITIAL (idecl
) = build_constructor_from_list (interface_array_type
,
2029 TREE_STATIC (idecl
) = 1;
2030 DECL_ARTIFICIAL (idecl
) = 1;
2031 DECL_IGNORED_P (idecl
) = 1;
2032 interfaces
= build1 (ADDR_EXPR
, ptr_type_node
, idecl
);
2033 rest_of_decl_compilation (idecl
, 1, 0);
2036 constant_pool_constructor
= build_constants_constructor ();
2038 if (flag_indirect_dispatch
)
2040 TYPE_OTABLE_DECL (type
)
2042 (DECL_NAME (TYPE_OTABLE_DECL (type
)),
2043 TYPE_OTABLE_DECL (type
), TYPE_OTABLE_METHODS (type
),
2044 TYPE_OTABLE_SYMS_DECL (type
), integer_type_node
, 1);
2046 TYPE_ATABLE_DECL (type
)
2048 (DECL_NAME (TYPE_ATABLE_DECL (type
)),
2049 TYPE_ATABLE_DECL (type
), TYPE_ATABLE_METHODS (type
),
2050 TYPE_ATABLE_SYMS_DECL (type
), ptr_type_node
, 1);
2052 TYPE_ITABLE_DECL (type
)
2054 (DECL_NAME (TYPE_ITABLE_DECL (type
)),
2055 TYPE_ITABLE_DECL (type
), TYPE_ITABLE_METHODS (type
),
2056 TYPE_ITABLE_SYMS_DECL (type
), ptr_type_node
, 2);
2059 TYPE_CTABLE_DECL (type
) = emit_catch_table (type
);
2061 START_RECORD_CONSTRUCTOR (v1
, object_type_node
);
2062 PUSH_FIELD_VALUE (v1
, "vtable",
2063 (flag_indirect_classes
2065 : build2 (POINTER_PLUS_EXPR
, dtable_ptr_type
,
2066 build1 (ADDR_EXPR
, dtable_ptr_type
,
2068 dtable_start_offset
)));
2069 if (! flag_hash_synchronization
)
2070 PUSH_FIELD_VALUE (v1
, "sync_info", null_pointer_node
);
2071 FINISH_RECORD_CONSTRUCTOR (temp
, v1
, object_type_node
);
2072 START_RECORD_CONSTRUCTOR (v2
, class_type_node
);
2073 PUSH_SUPER_VALUE (v2
, temp
);
2074 PUSH_FIELD_VALUE (v2
, "next_or_version", gcj_abi_version
);
2075 PUSH_FIELD_VALUE (v2
, "name", build_utf8_ref (DECL_NAME (type_decl
)));
2076 PUSH_FIELD_VALUE (v2
, "accflags",
2077 build_int_cst (NULL_TREE
,
2078 get_access_flags_from_decl (type_decl
)));
2080 PUSH_FIELD_VALUE (v2
, "superclass",
2081 CLASS_INTERFACE (type_decl
) ? null_pointer_node
: super
);
2082 PUSH_FIELD_VALUE (v2
, "constants", constant_pool_constructor
);
2083 PUSH_FIELD_VALUE (v2
, "methods",
2084 methods_decl
== NULL_TREE
? null_pointer_node
2085 : build1 (ADDR_EXPR
, method_ptr_type_node
, methods_decl
));
2086 PUSH_FIELD_VALUE (v2
, "method_count",
2087 build_int_cst (NULL_TREE
, method_count
));
2089 PUSH_FIELD_VALUE (v2
, "vtable_method_count",
2090 (flag_indirect_dispatch
2091 ? integer_minus_one_node
2092 : TYPE_NVIRTUALS (type
)));
2094 PUSH_FIELD_VALUE (v2
, "fields",
2095 fields_decl
== NULL_TREE
? null_pointer_node
2096 : build1 (ADDR_EXPR
, field_ptr_type_node
, fields_decl
));
2097 /* If we're using the binary compatibility ABI we don't know the
2098 size until load time. */
2099 PUSH_FIELD_VALUE (v2
, "size_in_bytes",
2100 (flag_indirect_dispatch
2101 ? integer_minus_one_node
2102 : size_in_bytes (type
)));
2103 PUSH_FIELD_VALUE (v2
, "field_count",
2104 build_int_cst (NULL_TREE
, field_count
));
2105 PUSH_FIELD_VALUE (v2
, "static_field_count",
2106 build_int_cst (NULL_TREE
, static_field_count
));
2108 PUSH_FIELD_VALUE (v2
, "vtable",
2109 (flag_indirect_dispatch
|| dtable_decl
== NULL_TREE
2111 : build2 (POINTER_PLUS_EXPR
, dtable_ptr_type
,
2112 build1 (ADDR_EXPR
, dtable_ptr_type
,
2114 dtable_start_offset
)));
2115 add_table_and_syms (&v2
, TYPE_OTABLE_METHODS (type
),
2116 "otable", TYPE_OTABLE_DECL (type
), otable_ptr_type
,
2117 "otable_syms", TYPE_OTABLE_SYMS_DECL (type
));
2118 add_table_and_syms (&v2
, TYPE_ATABLE_METHODS (type
),
2119 "atable", TYPE_ATABLE_DECL (type
), atable_ptr_type
,
2120 "atable_syms", TYPE_ATABLE_SYMS_DECL (type
));
2121 add_table_and_syms (&v2
, TYPE_ITABLE_METHODS (type
),
2122 "itable", TYPE_ITABLE_DECL (type
), itable_ptr_type
,
2123 "itable_syms", TYPE_ITABLE_SYMS_DECL (type
));
2125 PUSH_FIELD_VALUE (v2
, "catch_classes",
2126 build1 (ADDR_EXPR
, ptr_type_node
, TYPE_CTABLE_DECL (type
)));
2127 PUSH_FIELD_VALUE (v2
, "interfaces", interfaces
);
2128 PUSH_FIELD_VALUE (v2
, "loader", null_pointer_node
);
2129 PUSH_FIELD_VALUE (v2
, "interface_count",
2130 build_int_cst (NULL_TREE
, interface_len
));
2131 PUSH_FIELD_VALUE (v2
, "state",
2132 convert (byte_type_node
,
2133 build_int_cst (NULL_TREE
, JV_STATE_PRELOADING
)));
2135 PUSH_FIELD_VALUE (v2
, "thread", null_pointer_node
);
2136 PUSH_FIELD_VALUE (v2
, "depth", integer_zero_node
);
2137 PUSH_FIELD_VALUE (v2
, "ancestors", null_pointer_node
);
2138 PUSH_FIELD_VALUE (v2
, "idt", null_pointer_node
);
2139 PUSH_FIELD_VALUE (v2
, "arrayclass", null_pointer_node
);
2140 PUSH_FIELD_VALUE (v2
, "protectionDomain", null_pointer_node
);
2143 tree assertion_table_ref
;
2144 if (TYPE_ASSERTIONS (type
) == NULL
)
2145 assertion_table_ref
= null_pointer_node
;
2147 assertion_table_ref
= build1 (ADDR_EXPR
,
2148 build_pointer_type (assertion_table_type
),
2149 emit_assertion_table (type
));
2151 PUSH_FIELD_VALUE (v2
, "assertion_table", assertion_table_ref
);
2154 PUSH_FIELD_VALUE (v2
, "hack_signers", null_pointer_node
);
2155 PUSH_FIELD_VALUE (v2
, "chain", null_pointer_node
);
2156 PUSH_FIELD_VALUE (v2
, "aux_info", null_pointer_node
);
2157 PUSH_FIELD_VALUE (v2
, "engine", null_pointer_node
);
2159 if (TYPE_REFLECTION_DATA (current_class
))
2162 int count
= TYPE_REFLECTION_DATASIZE (current_class
);
2163 VEC (constructor_elt
, gc
) *v
2164 = VEC_alloc (constructor_elt
, gc
, count
);
2165 unsigned char *data
= TYPE_REFLECTION_DATA (current_class
);
2166 tree max_index
= build_int_cst (sizetype
, count
);
2167 tree index
= build_index_type (max_index
);
2168 tree type
= build_array_type (unsigned_byte_type_node
, index
);
2171 static int reflection_data_count
;
2173 sprintf (buf
, "_reflection_data_%d", reflection_data_count
++);
2174 array
= build_decl (input_location
,
2175 VAR_DECL
, get_identifier (buf
), type
);
2177 rewrite_reflection_indexes (field_indexes
);
2179 for (i
= 0; i
< count
; i
++)
2181 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
2182 elt
->index
= build_int_cst (sizetype
, i
);
2183 elt
->value
= build_int_cstu (byte_type_node
, data
[i
]);
2186 DECL_INITIAL (array
) = build_constructor (type
, v
);
2187 TREE_STATIC (array
) = 1;
2188 DECL_ARTIFICIAL (array
) = 1;
2189 DECL_IGNORED_P (array
) = 1;
2190 TREE_READONLY (array
) = 1;
2191 TREE_CONSTANT (DECL_INITIAL (array
)) = 1;
2192 rest_of_decl_compilation (array
, 1, 0);
2194 reflection_data
= build_address_of (array
);
2197 TYPE_REFLECTION_DATA (current_class
) = NULL
;
2200 reflection_data
= null_pointer_node
;
2202 PUSH_FIELD_VALUE (v2
, "reflection_data", reflection_data
);
2203 FINISH_RECORD_CONSTRUCTOR (cons
, v2
, class_type_node
);
2205 DECL_INITIAL (decl
) = cons
;
2207 /* Hash synchronization requires at least 64-bit alignment. */
2208 if (flag_hash_synchronization
&& POINTER_SIZE
< 64)
2209 DECL_ALIGN (decl
) = 64;
2211 if (flag_indirect_classes
)
2213 TREE_READONLY (decl
) = 1;
2214 TREE_CONSTANT (DECL_INITIAL (decl
)) = 1;
2217 rest_of_decl_compilation (decl
, 1, 0);
2220 tree classdollar_field
= build_classdollar_field (type
);
2221 if (!flag_indirect_classes
)
2222 DECL_INITIAL (classdollar_field
) = build_static_class_ref (type
);
2223 rest_of_decl_compilation (classdollar_field
, 1, 0);
2226 TYPE_OTABLE_DECL (type
) = NULL_TREE
;
2227 TYPE_ATABLE_DECL (type
) = NULL_TREE
;
2228 TYPE_CTABLE_DECL (type
) = NULL_TREE
;
2234 java_expand_catch_classes (current_class
);
2236 current_function_decl
= NULL_TREE
;
2237 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (current_class
)) = 0;
2238 make_class_data (current_class
);
2240 rest_of_decl_compilation (TYPE_NAME (current_class
), 1, 0);
2243 /* Return 2 if KLASS is compiled by this compilation job;
2244 return 1 if KLASS can otherwise be assumed to be compiled;
2245 return 0 if we cannot assume that KLASS is compiled.
2246 Returns 1 for primitive and 0 for array types. */
2248 is_compiled_class (tree klass
)
2251 if (TREE_CODE (klass
) == POINTER_TYPE
)
2252 klass
= TREE_TYPE (klass
);
2253 if (TREE_CODE (klass
) != RECORD_TYPE
) /* Primitive types are static. */
2255 if (TYPE_ARRAY_P (klass
))
2258 seen_in_zip
= (TYPE_JCF (klass
) && JCF_SEEN_IN_ZIP (TYPE_JCF (klass
)));
2259 if (CLASS_FROM_CURRENTLY_COMPILED_P (klass
))
2261 /* The class was seen in the current ZIP file and will be
2262 available as a compiled class in the future but may not have
2263 been loaded already. Load it if necessary. This prevent
2264 build_class_ref () from crashing. */
2266 if (seen_in_zip
&& !CLASS_LOADED_P (klass
) && (klass
!= current_class
))
2267 load_class (klass
, 1);
2269 /* We return 2 for class seen in ZIP and class from files
2270 belonging to the same compilation unit */
2274 if (assume_compiled (IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (klass
)))))
2276 if (!CLASS_LOADED_P (klass
))
2278 if (klass
!= current_class
)
2279 load_class (klass
, 1);
2287 /* Build a VAR_DECL for the dispatch table (vtable) for class TYPE. */
2290 build_dtable_decl (tree type
)
2294 /* We need to build a new dtable type so that its size is uniquely
2295 computed when we're dealing with the class for real and not just
2296 faking it (like java.lang.Class during the initialization of the
2297 compiler.) We know we're not faking a class when CURRENT_CLASS is
2299 if (current_class
== type
)
2301 tree dummy
= NULL_TREE
;
2304 dtype
= make_node (RECORD_TYPE
);
2306 PUSH_FIELD (input_location
, dtype
, dummy
, "top_offset", ptr_type_node
);
2307 PUSH_FIELD (input_location
, dtype
, dummy
, "type_info", ptr_type_node
);
2309 PUSH_FIELD (input_location
, dtype
, dummy
, "class", class_ptr_type
);
2310 for (n
= 1; n
< TARGET_VTABLE_USES_DESCRIPTORS
; ++n
)
2312 tree tmp_field
= build_decl (input_location
,
2313 FIELD_DECL
, NULL_TREE
, ptr_type_node
);
2314 TREE_CHAIN (dummy
) = tmp_field
;
2315 DECL_CONTEXT (tmp_field
) = dtype
;
2316 DECL_ARTIFICIAL (tmp_field
) = 1;
2320 PUSH_FIELD (input_location
, dtype
, dummy
, "gc_descr", ptr_type_node
);
2321 for (n
= 1; n
< TARGET_VTABLE_USES_DESCRIPTORS
; ++n
)
2323 tree tmp_field
= build_decl (input_location
,
2324 FIELD_DECL
, NULL_TREE
, ptr_type_node
);
2325 TREE_CHAIN (dummy
) = tmp_field
;
2326 DECL_CONTEXT (tmp_field
) = dtype
;
2327 DECL_ARTIFICIAL (tmp_field
) = 1;
2331 n
= TREE_VEC_LENGTH (get_dispatch_vector (type
));
2332 if (TARGET_VTABLE_USES_DESCRIPTORS
)
2333 n
*= TARGET_VTABLE_USES_DESCRIPTORS
;
2335 PUSH_FIELD (input_location
, dtype
, dummy
, "methods",
2336 build_prim_array_type (nativecode_ptr_type_node
, n
));
2337 layout_type (dtype
);
2340 dtype
= dtable_type
;
2342 decl
= build_decl (input_location
,
2343 VAR_DECL
, get_identifier ("vt$"), dtype
);
2344 DECL_CONTEXT (decl
) = type
;
2345 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl
);
2346 DECL_VTABLE_P (decl
) = 1;
2351 /* Pre-pend the TYPE_FIELDS of THIS_CLASS with a dummy FIELD_DECL for the
2352 fields inherited from SUPER_CLASS. */
2355 push_super_field (tree this_class
, tree super_class
)
2358 /* Don't insert the field if we're just re-laying the class out. */
2359 if (TYPE_FIELDS (this_class
) && !DECL_NAME (TYPE_FIELDS (this_class
)))
2361 base_decl
= build_decl (input_location
,
2362 FIELD_DECL
, NULL_TREE
, super_class
);
2363 DECL_IGNORED_P (base_decl
) = 1;
2364 TREE_CHAIN (base_decl
) = TYPE_FIELDS (this_class
);
2365 TYPE_FIELDS (this_class
) = base_decl
;
2366 DECL_SIZE (base_decl
) = TYPE_SIZE (super_class
);
2367 DECL_SIZE_UNIT (base_decl
) = TYPE_SIZE_UNIT (super_class
);
2370 /* Handle the different manners we may have to lay out a super class. */
2373 maybe_layout_super_class (tree super_class
, tree this_class ATTRIBUTE_UNUSED
)
2377 else if (TREE_CODE (super_class
) == RECORD_TYPE
)
2379 if (!CLASS_LOADED_P (super_class
))
2380 load_class (super_class
, 1);
2382 /* We might have to layout the class before its dependency on
2383 the super class gets resolved by java_complete_class */
2384 else if (TREE_CODE (super_class
) == POINTER_TYPE
)
2386 if (TREE_TYPE (super_class
) != NULL_TREE
)
2387 super_class
= TREE_TYPE (super_class
);
2391 if (!TYPE_SIZE (super_class
))
2392 safe_layout_class (super_class
);
2397 /* safe_layout_class just makes sure that we can load a class without
2398 disrupting the current_class, input_file, input_line, etc, information
2399 about the class processed currently. */
2402 safe_layout_class (tree klass
)
2404 tree save_current_class
= current_class
;
2405 location_t save_location
= input_location
;
2407 layout_class (klass
);
2409 current_class
= save_current_class
;
2410 input_location
= save_location
;
2414 layout_class (tree this_class
)
2417 tree super_class
= CLASSTYPE_SUPER (this_class
);
2419 class_list
= tree_cons (this_class
, NULL_TREE
, class_list
);
2420 if (CLASS_BEING_LAIDOUT (this_class
))
2426 sprintf (buffer
, " with '%s'",
2427 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (this_class
))));
2428 obstack_grow (&temporary_obstack
, buffer
, strlen (buffer
));
2430 for (current
= TREE_CHAIN (class_list
); current
;
2431 current
= TREE_CHAIN (current
))
2433 tree decl
= TYPE_NAME (TREE_PURPOSE (current
));
2434 sprintf (buffer
, "\n which inherits from '%s' (%s:%d)",
2435 IDENTIFIER_POINTER (DECL_NAME (decl
)),
2436 DECL_SOURCE_FILE (decl
),
2437 DECL_SOURCE_LINE (decl
));
2438 obstack_grow (&temporary_obstack
, buffer
, strlen (buffer
));
2440 obstack_1grow (&temporary_obstack
, '\0');
2441 report
= XOBFINISH (&temporary_obstack
, char *);
2442 cyclic_inheritance_report
= ggc_strdup (report
);
2443 obstack_free (&temporary_obstack
, report
);
2444 TYPE_SIZE (this_class
) = error_mark_node
;
2447 CLASS_BEING_LAIDOUT (this_class
) = 1;
2449 if (super_class
&& !CLASS_BEING_LAIDOUT (super_class
))
2451 tree maybe_super_class
2452 = maybe_layout_super_class (super_class
, this_class
);
2453 if (maybe_super_class
== NULL
2454 || TREE_CODE (TYPE_SIZE (maybe_super_class
)) == ERROR_MARK
)
2456 TYPE_SIZE (this_class
) = error_mark_node
;
2457 CLASS_BEING_LAIDOUT (this_class
) = 0;
2458 class_list
= TREE_CHAIN (class_list
);
2461 if (TYPE_SIZE (this_class
) == NULL_TREE
)
2462 push_super_field (this_class
, maybe_super_class
);
2465 layout_type (this_class
);
2467 /* Also recursively load/layout any superinterfaces. */
2468 if (TYPE_BINFO (this_class
))
2470 for (i
= BINFO_N_BASE_BINFOS (TYPE_BINFO (this_class
)) - 1; i
> 0; i
--)
2472 tree binfo
= BINFO_BASE_BINFO (TYPE_BINFO (this_class
), i
);
2473 tree super_interface
= BINFO_TYPE (binfo
);
2474 tree maybe_super_interface
2475 = maybe_layout_super_class (super_interface
, NULL_TREE
);
2476 if (maybe_super_interface
== NULL
2477 || TREE_CODE (TYPE_SIZE (maybe_super_interface
)) == ERROR_MARK
)
2479 TYPE_SIZE (this_class
) = error_mark_node
;
2480 CLASS_BEING_LAIDOUT (this_class
) = 0;
2481 class_list
= TREE_CHAIN (class_list
);
2487 /* Convert the size back to an SI integer value. */
2488 TYPE_SIZE_UNIT (this_class
) =
2489 fold (convert (int_type_node
, TYPE_SIZE_UNIT (this_class
)));
2491 CLASS_BEING_LAIDOUT (this_class
) = 0;
2492 class_list
= TREE_CHAIN (class_list
);
2496 add_miranda_methods (tree base_class
, tree search_class
)
2499 tree binfo
, base_binfo
;
2501 if (!CLASS_PARSED_P (search_class
))
2502 load_class (search_class
, 1);
2504 for (binfo
= TYPE_BINFO (search_class
), i
= 1;
2505 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
2508 tree elt
= BINFO_TYPE (base_binfo
);
2510 /* FIXME: This is totally bogus. We should not be handling
2511 Miranda methods at all if we're using the BC ABI. */
2512 if (TYPE_DUMMY (elt
))
2515 /* Ensure that interface methods are seen in declared order. */
2516 if (!CLASS_LOADED_P (elt
))
2517 load_class (elt
, 1);
2518 layout_class_methods (elt
);
2520 /* All base classes will have been laid out at this point, so the order
2521 will be correct. This code must match similar layout code in the
2523 for (method_decl
= TYPE_METHODS (elt
);
2524 method_decl
; method_decl
= TREE_CHAIN (method_decl
))
2528 /* An interface can have <clinit>. */
2529 if (ID_CLINIT_P (DECL_NAME (method_decl
)))
2532 sig
= build_java_argument_signature (TREE_TYPE (method_decl
));
2533 override
= lookup_argument_method (base_class
,
2534 DECL_NAME (method_decl
), sig
);
2535 if (override
== NULL_TREE
)
2537 /* Found a Miranda method. Add it. */
2539 sig
= build_java_signature (TREE_TYPE (method_decl
));
2541 = add_method (base_class
,
2542 get_access_flags_from_decl (method_decl
),
2543 DECL_NAME (method_decl
), sig
);
2544 METHOD_INVISIBLE (new_method
) = 1;
2548 /* Try superinterfaces. */
2549 add_miranda_methods (base_class
, elt
);
2554 layout_class_methods (tree this_class
)
2556 tree method_decl
, dtable_count
;
2557 tree super_class
, type_name
;
2559 if (TYPE_NVIRTUALS (this_class
))
2562 super_class
= CLASSTYPE_SUPER (this_class
);
2566 super_class
= maybe_layout_super_class (super_class
, this_class
);
2567 if (!TYPE_NVIRTUALS (super_class
))
2568 layout_class_methods (super_class
);
2569 dtable_count
= TYPE_NVIRTUALS (super_class
);
2572 dtable_count
= integer_zero_node
;
2574 type_name
= TYPE_NAME (this_class
);
2575 if (!flag_indirect_dispatch
2576 && (CLASS_ABSTRACT (type_name
) || CLASS_INTERFACE (type_name
)))
2578 /* An abstract class can have methods which are declared only in
2579 an implemented interface. These are called "Miranda
2580 methods". We make a dummy method entry for such methods
2582 add_miranda_methods (this_class
, this_class
);
2585 TYPE_METHODS (this_class
) = nreverse (TYPE_METHODS (this_class
));
2587 for (method_decl
= TYPE_METHODS (this_class
);
2588 method_decl
; method_decl
= TREE_CHAIN (method_decl
))
2589 dtable_count
= layout_class_method (this_class
, super_class
,
2590 method_decl
, dtable_count
);
2592 TYPE_NVIRTUALS (this_class
) = dtable_count
;
2595 /* Return the index of METHOD in INTERFACE. This index begins at 1
2596 and is used as an argument for _Jv_LookupInterfaceMethodIdx(). */
2598 get_interface_method_index (tree method
, tree interface
)
2603 for (meth
= TYPE_METHODS (interface
); ; meth
= TREE_CHAIN (meth
))
2607 /* We don't want to put <clinit> into the interface table. */
2608 if (! ID_CLINIT_P (DECL_NAME (meth
)))
2610 gcc_assert (meth
!= NULL_TREE
);
2614 /* Lay METHOD_DECL out, returning a possibly new value of
2615 DTABLE_COUNT. Also mangle the method's name. */
2618 layout_class_method (tree this_class
, tree super_class
,
2619 tree method_decl
, tree dtable_count
)
2621 tree method_name
= DECL_NAME (method_decl
);
2623 TREE_PUBLIC (method_decl
) = 1;
2625 if (flag_indirect_classes
2626 || (METHOD_PRIVATE (method_decl
) && METHOD_STATIC (method_decl
)
2627 && ! METHOD_NATIVE (method_decl
)
2628 && ! special_method_p (method_decl
)))
2629 java_hide_decl (method_decl
);
2631 /* Considered external unless it is being compiled into this object
2632 file, or it was already flagged as external. */
2633 if (!DECL_EXTERNAL (method_decl
))
2634 DECL_EXTERNAL (method_decl
) = ((is_compiled_class (this_class
) != 2)
2635 || METHOD_NATIVE (method_decl
));
2637 if (ID_INIT_P (method_name
))
2639 const char *p
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (this_class
)));
2641 for (ptr
= p
; *ptr
; )
2646 DECL_CONSTRUCTOR_P (method_decl
) = 1;
2647 build_java_signature (TREE_TYPE (method_decl
));
2649 else if (! METHOD_STATIC (method_decl
))
2652 build_java_signature (TREE_TYPE (method_decl
));
2653 bool method_override
= false;
2654 tree super_method
= lookup_java_method (super_class
, method_name
,
2656 if (super_method
!= NULL_TREE
2657 && ! METHOD_DUMMY (super_method
))
2659 method_override
= true;
2660 if (! METHOD_PUBLIC (super_method
) &&
2661 ! METHOD_PROTECTED (super_method
))
2663 /* Don't override private method, or default-access method in
2665 if (METHOD_PRIVATE (super_method
) ||
2666 ! in_same_package (TYPE_NAME (this_class
),
2667 TYPE_NAME (super_class
)))
2668 method_override
= false;
2671 if (method_override
)
2673 tree method_index
= get_method_index (super_method
);
2674 set_method_index (method_decl
, method_index
);
2675 if (method_index
== NULL_TREE
2676 && ! flag_indirect_dispatch
2677 && ! DECL_ARTIFICIAL (super_method
))
2678 error ("non-static method %q+D overrides static method",
2681 else if (this_class
== object_type_node
2682 && (METHOD_FINAL (method_decl
)
2683 || METHOD_PRIVATE (method_decl
)))
2685 /* We don't generate vtable entries for final Object
2686 methods. This is simply to save space, since every
2687 object would otherwise have to define them. */
2689 else if (! METHOD_PRIVATE (method_decl
)
2692 /* We generate vtable entries for final methods because they
2693 may one day be changed to non-final. */
2694 set_method_index (method_decl
, dtable_count
);
2695 dtable_count
= fold_build2 (PLUS_EXPR
, integer_type_node
,
2696 dtable_count
, integer_one_node
);
2700 return dtable_count
;
2704 register_class (void)
2708 if (!registered_class
)
2709 registered_class
= VEC_alloc (tree
, gc
, 8);
2711 if (flag_indirect_classes
)
2712 node
= current_class
;
2714 node
= TREE_OPERAND (build_class_ref (current_class
), 0);
2715 VEC_safe_push (tree
, gc
, registered_class
, node
);
2718 /* Emit a function that calls _Jv_RegisterNewClasses with a list of
2719 all the classes we have emitted. */
2722 emit_indirect_register_classes (tree
*list_p
)
2724 tree klass
, t
, register_class_fn
;
2727 tree init
= NULL_TREE
;
2728 int size
= VEC_length (tree
, registered_class
) * 2 + 1;
2729 tree class_array_type
2730 = build_prim_array_type (ptr_type_node
, size
);
2731 tree
cdecl = build_decl (input_location
,
2732 VAR_DECL
, get_identifier ("_Jv_CLS"),
2734 tree reg_class_list
;
2735 for (i
= 0; VEC_iterate (tree
, registered_class
, i
, klass
); ++i
)
2737 init
= tree_cons (NULL_TREE
,
2738 fold_convert (ptr_type_node
,
2739 build_static_class_ref (klass
)), init
);
2742 fold_convert (ptr_type_node
,
2743 build_address_of (build_classdollar_field (klass
))),
2746 init
= tree_cons (NULL_TREE
, integer_zero_node
, init
);
2747 DECL_INITIAL (cdecl) = build_constructor_from_list (class_array_type
,
2749 TREE_CONSTANT (DECL_INITIAL (cdecl)) = 1;
2750 TREE_STATIC (cdecl) = 1;
2751 DECL_ARTIFICIAL (cdecl) = 1;
2752 DECL_IGNORED_P (cdecl) = 1;
2753 TREE_READONLY (cdecl) = 1;
2754 TREE_CONSTANT (cdecl) = 1;
2755 rest_of_decl_compilation (cdecl, 1, 0);
2756 reg_class_list
= fold_convert (ptr_type_node
, build_address_of (cdecl));
2758 t
= build_function_type_list (void_type_node
,
2759 build_pointer_type (ptr_type_node
), NULL
);
2760 t
= build_decl (input_location
,
2762 get_identifier ("_Jv_RegisterNewClasses"), t
);
2763 TREE_PUBLIC (t
) = 1;
2764 DECL_EXTERNAL (t
) = 1;
2765 register_class_fn
= t
;
2766 t
= build_call_expr (register_class_fn
, 1, reg_class_list
);
2767 append_to_statement_list (t
, list_p
);
2771 /* Emit something to register classes at start-up time.
2773 The preferred mechanism is through the .jcr section, which contain
2774 a list of pointers to classes which get registered during constructor
2777 The fallback mechanism is to add statements to *LIST_P to call
2778 _Jv_RegisterClass for each class in this file. These statements will
2779 be added to a static constructor function for this translation unit. */
2782 emit_register_classes (tree
*list_p
)
2784 if (registered_class
== NULL
)
2787 if (flag_indirect_classes
)
2789 emit_indirect_register_classes (list_p
);
2793 /* TARGET_USE_JCR_SECTION defaults to 1 if SUPPORTS_WEAK and
2794 TARGET_ASM_NAMED_SECTION, else 0. Some targets meet those conditions
2795 but lack suitable crtbegin/end objects or linker support. These
2796 targets can override the default in tm.h to use the fallback mechanism. */
2797 if (TARGET_USE_JCR_SECTION
)
2802 #ifdef JCR_SECTION_NAME
2803 switch_to_section (get_section (JCR_SECTION_NAME
, SECTION_WRITE
, NULL
));
2805 /* A target has defined TARGET_USE_JCR_SECTION,
2806 but doesn't have a JCR_SECTION_NAME. */
2809 assemble_align (POINTER_SIZE
);
2811 for (i
= 0; VEC_iterate (tree
, registered_class
, i
, klass
); ++i
)
2813 t
= build_fold_addr_expr (klass
);
2814 output_constant (t
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
);
2819 tree klass
, t
, register_class_fn
;
2822 t
= build_function_type_list (void_type_node
, class_ptr_type
, NULL
);
2823 t
= build_decl (input_location
,
2824 FUNCTION_DECL
, get_identifier ("_Jv_RegisterClass"), t
);
2825 TREE_PUBLIC (t
) = 1;
2826 DECL_EXTERNAL (t
) = 1;
2827 register_class_fn
= t
;
2829 for (i
= 0; VEC_iterate (tree
, registered_class
, i
, klass
); ++i
)
2831 t
= build_fold_addr_expr (klass
);
2832 t
= build_call_expr (register_class_fn
, 1, t
);
2833 append_to_statement_list (t
, list_p
);
2838 /* Build a constructor for an entry in the symbol table. */
2841 build_symbol_table_entry (tree clname
, tree name
, tree signature
)
2844 VEC(constructor_elt
,gc
) *v
= NULL
;
2846 START_RECORD_CONSTRUCTOR (v
, symbol_type
);
2847 PUSH_FIELD_VALUE (v
, "clname", clname
);
2848 PUSH_FIELD_VALUE (v
, "name", name
);
2849 PUSH_FIELD_VALUE (v
, "signature", signature
);
2850 FINISH_RECORD_CONSTRUCTOR (symbol
, v
, symbol_type
);
2851 TREE_CONSTANT (symbol
) = 1;
2856 /* Make a symbol_type (_Jv_MethodSymbol) node for DECL. */
2859 build_symbol_entry (tree decl
, tree special
)
2861 tree clname
, name
, signature
;
2862 clname
= build_utf8_ref (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl
))));
2863 /* ??? Constructors are given the name foo.foo all the way through
2864 the compiler, but in the method table they're all renamed
2865 foo.<init>. So, we have to do the same here unless we want an
2866 unresolved reference at runtime. */
2867 name
= build_utf8_ref ((TREE_CODE (decl
) == FUNCTION_DECL
2868 && DECL_CONSTRUCTOR_P (decl
))
2869 ? init_identifier_node
2870 : DECL_NAME (decl
));
2871 signature
= build_java_signature (TREE_TYPE (decl
));
2872 signature
= build_utf8_ref (unmangle_classname
2873 (IDENTIFIER_POINTER (signature
),
2874 IDENTIFIER_LENGTH (signature
)));
2875 /* SPECIAL is either NULL_TREE or integer_one_node. We emit
2876 signature addr+1 if SPECIAL, and this indicates to the runtime
2877 system that this is a "special" symbol, i.e. one that should
2878 bypass access controls. */
2879 if (special
!= NULL_TREE
)
2880 signature
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (signature
), signature
,
2881 fold_convert (sizetype
, special
));
2883 return build_symbol_table_entry (clname
, name
, signature
);
2886 /* Emit a symbol table: used by -findirect-dispatch. */
2889 emit_symbol_table (tree name
, tree the_table
,
2890 VEC(method_entry
,gc
) *decl_table
,
2891 tree the_syms_decl
, tree the_array_element_type
,
2894 tree table
, list
, null_symbol
;
2895 tree table_size
, the_array_type
;
2899 /* Only emit a table if this translation unit actually made any
2900 references via it. */
2901 if (decl_table
== NULL
)
2904 /* Build a list of _Jv_MethodSymbols for each entry in otable_methods. */
2906 for (index
= 0; VEC_iterate (method_entry
, decl_table
, index
, e
); index
++)
2907 list
= tree_cons (NULL_TREE
,
2908 build_symbol_entry (e
->method
, e
->special
),
2911 /* Terminate the list with a "null" entry. */
2912 null_symbol
= build_symbol_table_entry (null_pointer_node
,
2915 list
= tree_cons (NULL_TREE
, null_symbol
, list
);
2917 /* Put the list in the right order and make it a constructor. */
2918 list
= nreverse (list
);
2919 table
= build_constructor_from_list (symbols_array_type
, list
);
2921 /* Make it the initial value for otable_syms and emit the decl. */
2922 DECL_INITIAL (the_syms_decl
) = table
;
2923 DECL_ARTIFICIAL (the_syms_decl
) = 1;
2924 DECL_IGNORED_P (the_syms_decl
) = 1;
2925 rest_of_decl_compilation (the_syms_decl
, 1, 0);
2927 /* Now that its size is known, redefine the table as an
2928 uninitialized static array of INDEX + 1 elements. The extra entry
2929 is used by the runtime to track whether the table has been
2932 = build_index_type (build_int_cst (NULL_TREE
, index
* element_size
+ 1));
2933 the_array_type
= build_array_type (the_array_element_type
, table_size
);
2934 the_table
= build_decl (input_location
,
2935 VAR_DECL
, name
, the_array_type
);
2936 TREE_STATIC (the_table
) = 1;
2937 TREE_READONLY (the_table
) = 1;
2938 rest_of_decl_compilation (the_table
, 1, 0);
2943 /* Make an entry for the catch_classes list. */
2945 make_catch_class_record (tree catch_class
, tree classname
)
2948 tree type
= TREE_TYPE (TREE_TYPE (TYPE_CTABLE_DECL (output_class
)));
2949 VEC(constructor_elt
,gc
) *v
= NULL
;
2950 START_RECORD_CONSTRUCTOR (v
, type
);
2951 PUSH_FIELD_VALUE (v
, "address", catch_class
);
2952 PUSH_FIELD_VALUE (v
, "classname", classname
);
2953 FINISH_RECORD_CONSTRUCTOR (entry
, v
, type
);
2958 /* Generate the list of Throwable classes that are caught by exception
2959 handlers in this class. */
2961 emit_catch_table (tree this_class
)
2963 tree table
, table_size
, array_type
;
2964 TYPE_CATCH_CLASSES (this_class
) =
2966 make_catch_class_record (null_pointer_node
, null_pointer_node
),
2967 TYPE_CATCH_CLASSES (this_class
));
2968 TYPE_CATCH_CLASSES (this_class
) = nreverse (TYPE_CATCH_CLASSES (this_class
));
2969 TYPE_CATCH_CLASSES (this_class
) =
2971 make_catch_class_record (null_pointer_node
, null_pointer_node
),
2972 TYPE_CATCH_CLASSES (this_class
));
2973 table_size
= build_index_type
2974 (build_int_cst (NULL_TREE
,
2975 list_length (TYPE_CATCH_CLASSES (this_class
))));
2977 = build_array_type (TREE_TYPE (TREE_TYPE (TYPE_CTABLE_DECL (this_class
))),
2980 build_decl (input_location
,
2981 VAR_DECL
, DECL_NAME (TYPE_CTABLE_DECL (this_class
)), array_type
);
2982 DECL_INITIAL (table
) =
2983 build_constructor_from_list (array_type
, TYPE_CATCH_CLASSES (this_class
));
2984 TREE_STATIC (table
) = 1;
2985 TREE_READONLY (table
) = 1;
2986 DECL_IGNORED_P (table
) = 1;
2987 rest_of_decl_compilation (table
, 1, 0);
2991 /* Given a type, return the signature used by
2992 _Jv_FindClassFromSignature() in libgcj. This isn't exactly the
2993 same as build_java_signature() because we want the canonical array
2997 build_signature_for_libgcj (tree type
)
3001 sig
= build_java_signature (type
);
3002 ref
= build_utf8_ref (unmangle_classname (IDENTIFIER_POINTER (sig
),
3003 IDENTIFIER_LENGTH (sig
)));
3007 /* Build an entry in the type assertion table. */
3010 build_assertion_table_entry (tree code
, tree op1
, tree op2
)
3012 VEC(constructor_elt
,gc
) *v
= NULL
;
3015 START_RECORD_CONSTRUCTOR (v
, assertion_entry_type
);
3016 PUSH_FIELD_VALUE (v
, "assertion_code", code
);
3017 PUSH_FIELD_VALUE (v
, "op1", op1
);
3018 PUSH_FIELD_VALUE (v
, "op2", op2
);
3019 FINISH_RECORD_CONSTRUCTOR (entry
, v
, assertion_entry_type
);
3024 /* Add an entry to the type assertion table. Callback used during hashtable
3028 add_assertion_table_entry (void **htab_entry
, void *ptr
)
3031 tree code_val
, op1_utf8
, op2_utf8
;
3032 tree
*list
= (tree
*) ptr
;
3033 type_assertion
*as
= (type_assertion
*) *htab_entry
;
3035 code_val
= build_int_cst (NULL_TREE
, as
->assertion_code
);
3037 if (as
->op1
== NULL_TREE
)
3038 op1_utf8
= null_pointer_node
;
3040 op1_utf8
= build_signature_for_libgcj (as
->op1
);
3042 if (as
->op2
== NULL_TREE
)
3043 op2_utf8
= null_pointer_node
;
3045 op2_utf8
= build_signature_for_libgcj (as
->op2
);
3047 entry
= build_assertion_table_entry (code_val
, op1_utf8
, op2_utf8
);
3049 *list
= tree_cons (NULL_TREE
, entry
, *list
);
3053 /* Generate the type assertion table for KLASS, and return its DECL. */
3056 emit_assertion_table (tree klass
)
3058 tree null_entry
, ctor
, table_decl
;
3059 tree list
= NULL_TREE
;
3060 htab_t assertions_htab
= TYPE_ASSERTIONS (klass
);
3062 /* Iterate through the hash table. */
3063 htab_traverse (assertions_htab
, add_assertion_table_entry
, &list
);
3065 /* Finish with a null entry. */
3066 null_entry
= build_assertion_table_entry (integer_zero_node
,
3070 list
= tree_cons (NULL_TREE
, null_entry
, list
);
3072 /* Put the list in the right order and make it a constructor. */
3073 list
= nreverse (list
);
3074 ctor
= build_constructor_from_list (assertion_table_type
, list
);
3076 table_decl
= build_decl (input_location
,
3077 VAR_DECL
, mangled_classname ("_type_assert_", klass
),
3078 assertion_table_type
);
3080 TREE_STATIC (table_decl
) = 1;
3081 TREE_READONLY (table_decl
) = 1;
3082 TREE_CONSTANT (table_decl
) = 1;
3083 DECL_IGNORED_P (table_decl
) = 1;
3085 DECL_INITIAL (table_decl
) = ctor
;
3086 DECL_ARTIFICIAL (table_decl
) = 1;
3087 rest_of_decl_compilation (table_decl
, 1, 0);
3093 init_class_processing (void)
3095 fields_ident
= get_identifier ("fields");
3096 info_ident
= get_identifier ("info");
3098 gcc_obstack_init (&temporary_obstack
);
3101 static hashval_t
java_treetreehash_hash (const void *);
3102 static int java_treetreehash_compare (const void *, const void *);
3104 /* A hash table mapping trees to trees. Used generally. */
3106 #define JAVA_TREEHASHHASH_H(t) ((hashval_t)TYPE_UID (t))
3109 java_treetreehash_hash (const void *k_p
)
3111 const struct treetreehash_entry
*const k
3112 = (const struct treetreehash_entry
*) k_p
;
3113 return JAVA_TREEHASHHASH_H (k
->key
);
3117 java_treetreehash_compare (const void * k1_p
, const void * k2_p
)
3119 const struct treetreehash_entry
*const k1
3120 = (const struct treetreehash_entry
*) k1_p
;
3121 const_tree
const k2
= (const_tree
) k2_p
;
3122 return (k1
->key
== k2
);
3126 java_treetreehash_find (htab_t ht
, tree t
)
3128 struct treetreehash_entry
*e
;
3129 hashval_t hv
= JAVA_TREEHASHHASH_H (t
);
3130 e
= (struct treetreehash_entry
*) htab_find_with_hash (ht
, t
, hv
);
3138 java_treetreehash_new (htab_t ht
, tree t
)
3141 struct treetreehash_entry
*tthe
;
3142 hashval_t hv
= JAVA_TREEHASHHASH_H (t
);
3144 e
= htab_find_slot_with_hash (ht
, t
, hv
, INSERT
);
3147 tthe
= (struct treetreehash_entry
*) (*ht
->alloc_f
) (1, sizeof (*tthe
));
3152 tthe
= (struct treetreehash_entry
*) *e
;
3153 return &tthe
->value
;
3157 java_treetreehash_create (size_t size
, int gc
)
3160 return htab_create_ggc (size
, java_treetreehash_hash
,
3161 java_treetreehash_compare
, NULL
);
3163 return htab_create_alloc (size
, java_treetreehash_hash
,
3164 java_treetreehash_compare
, free
, xcalloc
, free
);
3167 /* Break down qualified IDENTIFIER into package and class-name components.
3168 For example, given SOURCE "pkg.foo.Bar", LEFT will be set to
3169 "pkg.foo", and RIGHT to "Bar". */
3172 split_qualified_name (tree
*left
, tree
*right
, tree source
)
3175 int l
= IDENTIFIER_LENGTH (source
);
3177 base
= (char *) alloca (l
+ 1);
3178 memcpy (base
, IDENTIFIER_POINTER (source
), l
+ 1);
3180 /* Breakdown NAME into REMAINDER . IDENTIFIER. */
3182 while (*p
!= '.' && p
!= base
)
3185 /* We didn't find a '.'. Return an error. */
3191 *right
= get_identifier (p
+1);
3192 *left
= get_identifier (base
);
3197 /* Given two classes (TYPE_DECL) or class names (IDENTIFIER), return TRUE
3198 if the classes are from the same package. */
3201 in_same_package (tree name1
, tree name2
)
3207 if (TREE_CODE (name1
) == TYPE_DECL
)
3208 name1
= DECL_NAME (name1
);
3209 if (TREE_CODE (name2
) == TYPE_DECL
)
3210 name2
= DECL_NAME (name2
);
3212 if (QUALIFIED_P (name1
) != QUALIFIED_P (name2
))
3213 /* One in empty package. */
3216 if (QUALIFIED_P (name1
) == 0 && QUALIFIED_P (name2
) == 0)
3217 /* Both in empty package. */
3220 split_qualified_name (&pkg1
, &tmp
, name1
);
3221 split_qualified_name (&pkg2
, &tmp
, name2
);
3223 return (pkg1
== pkg2
);
3226 /* lang_hooks.decls.final_write_globals: perform final processing on
3227 global variables. */
3230 java_write_globals (void)
3232 tree
*vec
= VEC_address (tree
, pending_static_fields
);
3233 int len
= VEC_length (tree
, pending_static_fields
);
3234 write_global_declarations ();
3235 emit_debug_global_declarations (vec
, len
);
3236 VEC_free (tree
, gc
, pending_static_fields
);
3239 #include "gt-java-class.h"