1 /* Breadth-first and depth-first routines for
2 searching multiple-inheritance lattice for GNU C++.
3 Copyright (C) 1987, 89, 92, 93, 94, 95, 96, 1997 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* High-level class interface. */
34 #define obstack_chunk_alloc xmalloc
35 #define obstack_chunk_free free
37 extern struct obstack
*current_obstack
;
38 extern tree abort_fndecl
;
42 /* Obstack used for remembering decision points of breadth-first. */
44 static struct obstack search_obstack
;
46 /* Methods for pushing and popping objects to and from obstacks. */
49 push_stack_level (obstack
, tp
, size
)
50 struct obstack
*obstack
;
51 char *tp
; /* Sony NewsOS 5.0 compiler doesn't like void * here. */
54 struct stack_level
*stack
;
55 obstack_grow (obstack
, tp
, size
);
56 stack
= (struct stack_level
*) ((char*)obstack_next_free (obstack
) - size
);
57 obstack_finish (obstack
);
58 stack
->obstack
= obstack
;
59 stack
->first
= (tree
*) obstack_base (obstack
);
60 stack
->limit
= obstack_room (obstack
) / sizeof (tree
*);
65 pop_stack_level (stack
)
66 struct stack_level
*stack
;
68 struct stack_level
*tem
= stack
;
69 struct obstack
*obstack
= tem
->obstack
;
71 obstack_free (obstack
, tem
);
75 #define search_level stack_level
76 static struct search_level
*search_stack
;
78 static void clear_memoized_cache
PROTO((void));
79 static tree make_memoized_table_entry
PROTO((tree
, tree
, int));
80 static tree get_abstract_virtuals_1
PROTO((tree
, int, tree
));
81 static tree get_vbase_1
PROTO((tree
, tree
, unsigned int *));
82 static tree convert_pointer_to_vbase
PROTO((tree
, tree
));
83 static tree lookup_field_1
PROTO((tree
, tree
));
84 static tree convert_pointer_to_single_level
PROTO((tree
, tree
));
85 static int lookup_fnfields_1
PROTO((tree
, tree
));
86 static int lookup_fnfields_here
PROTO((tree
, tree
));
87 static int is_subobject_of_p
PROTO((tree
, tree
));
88 static int hides
PROTO((tree
, tree
));
89 static tree virtual_context
PROTO((tree
, tree
, tree
));
90 static tree get_template_base_recursive
91 PROTO((tree
, tree
, tree
, int));
92 static void dfs_walk
PROTO((tree
, void (*) (tree
), int (*) (tree
)));
93 static void envelope_add_decl
PROTO((tree
, tree
, tree
*));
94 static int get_base_distance_recursive
95 PROTO((tree
, int, int, int, int *, tree
*, tree
, tree
*,
96 int, int *, int, int));
97 static void expand_upcast_fixups
98 PROTO((tree
, tree
, tree
, tree
, tree
, tree
, tree
*));
99 static void fixup_virtual_upcast_offsets
100 PROTO((tree
, tree
, int, int, tree
, tree
, tree
, tree
,
102 static int markedp
PROTO((tree
));
103 static int unmarkedp
PROTO((tree
));
104 static int numberedp
PROTO((tree
));
105 static int unnumberedp
PROTO((tree
));
106 static int marked_vtable_pathp
PROTO((tree
));
107 static int unmarked_vtable_pathp
PROTO((tree
));
108 static int marked_new_vtablep
PROTO((tree
));
109 static int unmarked_new_vtablep
PROTO((tree
));
110 static int dfs_debug_unmarkedp
PROTO((tree
));
111 static void dfs_number
PROTO((tree
));
112 static void dfs_unnumber
PROTO((tree
));
113 static void dfs_debug_mark
PROTO((tree
));
114 static void dfs_find_vbases
PROTO((tree
));
115 static void dfs_clear_vbase_slots
PROTO((tree
));
116 static void dfs_unmark
PROTO((tree
));
117 static void dfs_init_vbase_pointers
PROTO((tree
));
118 static void dfs_get_vbase_types
PROTO((tree
));
119 static void dfs_record_inheritance
PROTO((tree
));
120 static void dfs_pushdecls
PROTO((tree
));
121 static void dfs_compress_decls
PROTO((tree
));
122 static void dfs_unuse_fields
PROTO((tree
));
123 static void add_conversions
PROTO((tree
));
124 static tree get_virtuals_named_this
PROTO((tree
));
125 static tree get_virtual_destructor
PROTO((tree
, int));
126 static int tree_has_any_destructor_p
PROTO((tree
, int));
127 static struct search_level
*push_search_level
128 PROTO((struct stack_level
*, struct obstack
*));
129 static struct search_level
*pop_search_level
130 PROTO((struct stack_level
*));
131 static struct type_level
*push_type_level
132 PROTO((struct stack_level
*, struct obstack
*));
133 static struct type_level
*pop_type_level
134 PROTO((struct type_level
*));
135 static tree my_tree_cons
PROTO((tree
, tree
, tree
));
136 static tree my_build_string
PROTO((char *));
137 static struct memoized_entry
* my_new_memoized_entry
138 PROTO((struct memoized_entry
*));
139 static HOST_WIDE_INT breadth_first_search
140 PROTO((tree
, int (*) (tree
, int), int (*) (tree
, int)));
142 static tree vbase_types
;
143 static tree vbase_decl_ptr_intermediate
, vbase_decl_ptr
;
144 static tree vbase_init_result
;
146 /* Allocate a level of searching. */
148 static struct search_level
*
149 push_search_level (stack
, obstack
)
150 struct stack_level
*stack
;
151 struct obstack
*obstack
;
153 struct search_level tem
;
156 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
159 /* Discard a level of search allocation. */
161 static struct search_level
*
162 pop_search_level (obstack
)
163 struct stack_level
*obstack
;
165 register struct search_level
*stack
= pop_stack_level (obstack
);
170 /* Search memoization. */
174 struct stack_level base
;
176 /* First object allocated in obstack of entries. */
179 /* Number of types memoized in this context. */
182 /* Type being memoized; save this if we are saving
183 memoized contexts. */
187 /* Obstack used for memoizing member and member function lookup. */
189 static struct obstack type_obstack
, type_obstack_entries
;
190 static struct type_level
*type_stack
;
191 static tree _vptr_name
;
193 /* Make things that look like tree nodes, but allocate them
194 on type_obstack_entries. */
195 static int my_tree_node_counter
;
197 extern int flag_memoize_lookups
, flag_save_memoized_contexts
;
199 /* Variables for gathering statistics. */
200 static int my_memoized_entry_counter
;
201 static int memoized_fast_finds
[2], memoized_adds
[2], memoized_fast_rejects
[2];
202 static int memoized_fields_searched
[2];
203 #ifdef GATHER_STATISTICS
204 static int n_fields_searched
;
205 static int n_calls_lookup_field
, n_calls_lookup_field_1
;
206 static int n_calls_lookup_fnfields
, n_calls_lookup_fnfields_1
;
207 static int n_calls_get_base_type
;
208 static int n_outer_fields_searched
;
209 static int n_contexts_saved
;
210 #endif /* GATHER_STATISTICS */
212 /* Local variables to help save memoization contexts. */
213 static tree prev_type_memoized
;
214 static struct type_level
*prev_type_stack
;
216 /* This list is used by push_class_decls to know what decls need to
217 be pushed into class scope. */
218 static tree closed_envelopes
= NULL_TREE
;
220 /* Allocate a level of type memoization context. */
222 static struct type_level
*
223 push_type_level (stack
, obstack
)
224 struct stack_level
*stack
;
225 struct obstack
*obstack
;
227 struct type_level tem
;
229 tem
.base
.prev
= stack
;
231 obstack_finish (&type_obstack_entries
);
232 tem
.entries
= (char *) obstack_base (&type_obstack_entries
);
234 tem
.type
= NULL_TREE
;
236 return (struct type_level
*)push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
239 /* Discard a level of type memoization context. */
241 static struct type_level
*
242 pop_type_level (stack
)
243 struct type_level
*stack
;
245 obstack_free (&type_obstack_entries
, stack
->entries
);
246 return (struct type_level
*)pop_stack_level ((struct stack_level
*)stack
);
249 /* Make something that looks like a TREE_LIST, but
250 do it on the type_obstack_entries obstack. */
253 my_tree_cons (purpose
, value
, chain
)
254 tree purpose
, value
, chain
;
256 tree p
= (tree
)obstack_alloc (&type_obstack_entries
, sizeof (struct tree_list
));
257 ++my_tree_node_counter
;
258 TREE_TYPE (p
) = NULL_TREE
;
259 ((HOST_WIDE_INT
*)p
)[3] = 0;
260 TREE_SET_CODE (p
, TREE_LIST
);
261 TREE_PURPOSE (p
) = purpose
;
262 TREE_VALUE (p
) = value
;
263 TREE_CHAIN (p
) = chain
;
268 my_build_string (str
)
271 tree p
= (tree
)obstack_alloc (&type_obstack_entries
, sizeof (struct tree_string
));
272 ++my_tree_node_counter
;
275 TREE_SET_CODE (p
, STRING_CST
);
276 TREE_STRING_POINTER (p
) = str
;
277 TREE_STRING_LENGTH (p
) = strlen (str
);
281 /* Memoizing machinery to make searches for multiple inheritance
282 reasonably efficient. */
284 #define MEMOIZE_HASHSIZE 8
285 typedef struct memoized_entry
287 struct memoized_entry
*chain
;
289 tree data_members
[MEMOIZE_HASHSIZE
];
290 tree function_members
[MEMOIZE_HASHSIZE
];
293 #define MEMOIZED_CHAIN(ENTRY) (((ME)ENTRY)->chain)
294 #define MEMOIZED_UID(ENTRY) (((ME)ENTRY)->uid)
295 #define MEMOIZED_FIELDS(ENTRY,INDEX) (((ME)ENTRY)->data_members[INDEX])
296 #define MEMOIZED_FNFIELDS(ENTRY,INDEX) (((ME)ENTRY)->function_members[INDEX])
297 /* The following is probably a lousy hash function. */
298 #define MEMOIZED_HASH_FN(NODE) (((long)(NODE)>>4)&(MEMOIZE_HASHSIZE - 1))
300 static struct memoized_entry
*
301 my_new_memoized_entry (chain
)
302 struct memoized_entry
*chain
;
304 struct memoized_entry
*p
305 = (struct memoized_entry
*)obstack_alloc (&type_obstack_entries
,
306 sizeof (struct memoized_entry
));
307 bzero ((char *) p
, sizeof (struct memoized_entry
));
308 MEMOIZED_CHAIN (p
) = chain
;
309 MEMOIZED_UID (p
) = ++my_memoized_entry_counter
;
313 /* Clears the deferred pop from pop_memoized_context, if any. */
316 clear_memoized_cache ()
320 type_stack
= pop_type_level (prev_type_stack
);
321 prev_type_memoized
= 0;
326 /* Make an entry in the memoized table for type TYPE
327 that the entry for NAME is FIELD. */
330 make_memoized_table_entry (type
, name
, function_p
)
334 int idx
= MEMOIZED_HASH_FN (name
);
335 tree entry
, *prev_entry
;
337 /* Since we allocate from the type_obstack, we must pop any deferred
339 clear_memoized_cache ();
341 memoized_adds
[function_p
] += 1;
342 if (CLASSTYPE_MTABLE_ENTRY (type
) == 0)
344 obstack_ptr_grow (&type_obstack
, type
);
345 obstack_blank (&type_obstack
, sizeof (struct memoized_entry
*));
346 CLASSTYPE_MTABLE_ENTRY (type
) = (char *)my_new_memoized_entry ((struct memoized_entry
*)0);
348 if (type_stack
->len
* 2 >= type_stack
->base
.limit
)
349 my_friendly_abort (88);
352 prev_entry
= &MEMOIZED_FNFIELDS (CLASSTYPE_MTABLE_ENTRY (type
), idx
);
354 prev_entry
= &MEMOIZED_FIELDS (CLASSTYPE_MTABLE_ENTRY (type
), idx
);
356 entry
= my_tree_cons (name
, NULL_TREE
, *prev_entry
);
359 /* Don't know the error message to give yet. */
360 TREE_TYPE (entry
) = error_mark_node
;
365 /* When a new function or class context is entered, we build
366 a table of types which have been searched for members.
367 The table is an array (obstack) of types. When a type is
368 entered into the obstack, its CLASSTYPE_MTABLE_ENTRY
369 field is set to point to a new record, of type struct memoized_entry.
371 A non-NULL TREE_TYPE of the entry contains an access control error message.
373 The slots for the data members are arrays of tree nodes.
374 These tree nodes are lists, with the TREE_PURPOSE
375 of this list the known member name, and the TREE_VALUE
376 as the FIELD_DECL for the member.
378 For member functions, the TREE_PURPOSE is again the
379 name of the member functions for that class,
380 and the TREE_VALUE of the list is a pairs
381 whose TREE_PURPOSE is a member functions of this name,
382 and whose TREE_VALUE is a list of known argument lists this
383 member function has been called with. The TREE_TYPE of the pair,
384 if non-NULL, is an error message to print. */
386 /* Tell search machinery that we are entering a new context, and
387 to update tables appropriately.
389 TYPE is the type of the context we are entering, which can
390 be NULL_TREE if we are not in a class's scope.
392 USE_OLD, if nonzero tries to use previous context. */
395 push_memoized_context (type
, use_old
)
404 if (use_old
&& prev_type_memoized
== type
)
406 #ifdef GATHER_STATISTICS
408 #endif /* GATHER_STATISTICS */
409 type_stack
= prev_type_stack
;
412 tem
= &type_stack
->base
.first
[0];
413 len
= type_stack
->len
;
415 CLASSTYPE_MTABLE_ENTRY (tem
[len
*2]) = (char *)tem
[len
*2+1];
418 /* Otherwise, need to pop old stack here. */
419 clear_memoized_cache ();
422 type_stack
= push_type_level ((struct stack_level
*)type_stack
,
424 type_stack
->type
= type
;
427 /* Tell search machinery that we have left a context.
428 We do not currently save these contexts for later use.
429 If we wanted to, we could not use pop_search_level, since
430 poping that level allows the data we have collected to
431 be clobbered; a stack of obstacks would be needed. */
434 pop_memoized_context (use_old
)
438 tree
*tem
= &type_stack
->base
.first
[0];
440 if (! flag_save_memoized_contexts
)
444 len
= type_stack
->len
;
446 tem
[len
*2+1] = (tree
)CLASSTYPE_MTABLE_ENTRY (tem
[len
*2]);
448 /* If there was a deferred pop, we need to pop it now. */
449 clear_memoized_cache ();
451 prev_type_stack
= type_stack
;
452 prev_type_memoized
= type_stack
->type
;
455 if (flag_memoize_lookups
)
457 len
= type_stack
->len
;
459 CLASSTYPE_MTABLE_ENTRY (tem
[len
*2])
460 = (char *)MEMOIZED_CHAIN (CLASSTYPE_MTABLE_ENTRY (tem
[len
*2]));
463 type_stack
= pop_type_level (type_stack
);
465 type_stack
= (struct type_level
*)type_stack
->base
.prev
;
468 /* Get a virtual binfo that is found inside BINFO's hierarchy that is
469 the same type as the type given in PARENT. To be optimal, we want
470 the first one that is found by going through the least number of
474 get_vbase_1 (parent
, binfo
, depth
)
480 tree rval
= NULL_TREE
;
482 if (BINFO_TYPE (binfo
) == parent
&& TREE_VIA_VIRTUAL (binfo
))
490 binfos
= BINFO_BASETYPES (binfo
);
491 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
493 /* Process base types. */
494 for (i
= 0; i
< n_baselinks
; i
++)
496 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
502 nrval
= get_vbase_1 (parent
, base_binfo
, depth
);
511 get_vbase (parent
, binfo
)
515 unsigned int d
= (unsigned int)-1;
516 return get_vbase_1 (parent
, binfo
, &d
);
519 /* Convert EXPR to a virtual base class of type TYPE. We know that
520 EXPR is a non-null POINTER_TYPE to RECORD_TYPE. We also know that
521 the type of what expr points to has a virtual base of type TYPE. */
524 convert_pointer_to_vbase (type
, expr
)
528 tree vb
= get_vbase (type
, TYPE_BINFO (TREE_TYPE (TREE_TYPE (expr
))));
529 return convert_pointer_to_real (vb
, expr
);
532 /* Check whether the type given in BINFO is derived from PARENT. If
533 it isn't, return 0. If it is, but the derivation is MI-ambiguous
534 AND protect != 0, emit an error message and return error_mark_node.
536 Otherwise, if TYPE is derived from PARENT, return the actual base
537 information, unless a one of the protection violations below
538 occurs, in which case emit an error message and return error_mark_node.
540 If PROTECT is 1, then check if access to a public field of PARENT
541 would be private. Also check for ambiguity. */
544 get_binfo (parent
, binfo
, protect
)
545 register tree parent
, binfo
;
550 tree rval
= NULL_TREE
;
552 if (TREE_CODE (parent
) == TREE_VEC
)
553 parent
= BINFO_TYPE (parent
);
554 else if (! IS_AGGR_TYPE_CODE (TREE_CODE (parent
)))
555 my_friendly_abort (89);
557 if (TREE_CODE (binfo
) == TREE_VEC
)
558 type
= BINFO_TYPE (binfo
);
559 else if (IS_AGGR_TYPE_CODE (TREE_CODE (binfo
)))
562 my_friendly_abort (90);
564 dist
= get_base_distance (parent
, binfo
, protect
, &rval
);
568 cp_error ("fields of `%T' are inaccessible in `%T' due to private inheritance",
570 return error_mark_node
;
572 else if (dist
== -2 && protect
)
574 cp_error ("type `%T' is ambiguous base class for type `%T'", parent
,
576 return error_mark_node
;
582 /* This is the newer depth first get_base_distance routine. */
585 get_base_distance_recursive (binfo
, depth
, is_private
, rval
,
586 rval_private_ptr
, new_binfo_ptr
, parent
, path_ptr
,
587 protect
, via_virtual_ptr
, via_virtual
,
588 current_scope_in_chain
)
590 int depth
, is_private
, rval
;
591 int *rval_private_ptr
;
592 tree
*new_binfo_ptr
, parent
, *path_ptr
;
593 int protect
, *via_virtual_ptr
, via_virtual
;
594 int current_scope_in_chain
;
600 && !current_scope_in_chain
601 && is_friend (BINFO_TYPE (binfo
), current_scope ()))
602 current_scope_in_chain
= 1;
604 if (BINFO_TYPE (binfo
) == parent
|| binfo
== parent
)
609 *rval_private_ptr
= is_private
;
610 *new_binfo_ptr
= binfo
;
611 *via_virtual_ptr
= via_virtual
;
615 int same_object
= (tree_int_cst_equal (BINFO_OFFSET (*new_binfo_ptr
),
616 BINFO_OFFSET (binfo
))
617 && *via_virtual_ptr
&& via_virtual
);
619 if (*via_virtual_ptr
&& via_virtual
==0)
621 *rval_private_ptr
= is_private
;
622 *new_binfo_ptr
= binfo
;
623 *via_virtual_ptr
= via_virtual
;
625 else if (same_object
)
627 if (*rval_private_ptr
&& ! is_private
)
629 *rval_private_ptr
= is_private
;
630 *new_binfo_ptr
= binfo
;
631 *via_virtual_ptr
= via_virtual
;
641 binfos
= BINFO_BASETYPES (binfo
);
642 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
645 /* Process base types. */
646 for (i
= 0; i
< n_baselinks
; i
++)
648 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
650 /* Find any specific instance of a virtual base, when searching with
652 if (BINFO_MARKED (base_binfo
) == 0 || TREE_CODE (parent
) == TREE_VEC
)
657 || (!TREE_VIA_PUBLIC (base_binfo
)
658 && !(TREE_VIA_PROTECTED (base_binfo
)
659 && current_scope_in_chain
)
660 && !is_friend (BINFO_TYPE (binfo
), current_scope ()))));
661 int this_virtual
= via_virtual
|| TREE_VIA_VIRTUAL (base_binfo
);
664 /* When searching for a non-virtual, we cannot mark
665 virtually found binfos. */
667 SET_BINFO_MARKED (base_binfo
);
669 #define WATCH_VALUES(rval, via_private) (rval == -1 ? 3 : via_private)
671 was
= WATCH_VALUES (rval
, *via_virtual_ptr
);
672 rval
= get_base_distance_recursive (base_binfo
, depth
, via_private
,
673 rval
, rval_private_ptr
,
674 new_binfo_ptr
, parent
, path_ptr
,
675 protect
, via_virtual_ptr
,
677 current_scope_in_chain
);
678 /* watch for updates; only update if path is good. */
679 if (path_ptr
&& WATCH_VALUES (rval
, *via_virtual_ptr
) != was
)
680 BINFO_INHERITANCE_CHAIN (base_binfo
) = binfo
;
681 if (rval
== -2 && *via_virtual_ptr
== 0)
692 /* Return the number of levels between type PARENT and the type given
693 in BINFO, following the leftmost path to PARENT not found along a
694 virtual path, if there are no real PARENTs (all come from virtual
695 base classes), then follow the leftmost path to PARENT.
697 Return -1 if TYPE is not derived from PARENT.
698 Return -2 if PARENT is an ambiguous base class of TYPE, and PROTECT is
700 Return -3 if PARENT is private to TYPE, and PROTECT is non-zero.
702 If PATH_PTR is non-NULL, then also build the list of types
703 from PARENT to TYPE, with TREE_VIA_VIRTUAL and TREE_VIA_PUBLIC
706 PARENT can also be a binfo, in which case that exact parent is found
707 and no other. convert_pointer_to_real uses this functionality.
709 If BINFO is a binfo, its BINFO_INHERITANCE_CHAIN will be left alone. */
712 get_base_distance (parent
, binfo
, protect
, path_ptr
)
713 register tree parent
, binfo
;
718 int rval_private
= 0;
720 tree new_binfo
= NULL_TREE
;
722 int watch_access
= protect
;
724 /* Should we be completing types here? */
725 if (TREE_CODE (parent
) != TREE_VEC
)
726 parent
= complete_type (TYPE_MAIN_VARIANT (parent
));
728 complete_type (TREE_TYPE (parent
));
730 if (TREE_CODE (binfo
) == TREE_VEC
)
731 type
= BINFO_TYPE (binfo
);
732 else if (IS_AGGR_TYPE_CODE (TREE_CODE (binfo
)))
734 type
= complete_type (binfo
);
735 binfo
= TYPE_BINFO (type
);
738 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
741 my_friendly_abort (92);
743 if (parent
== type
|| parent
== binfo
)
745 /* If the distance is 0, then we don't really need
746 a path pointer, but we shouldn't let garbage go back. */
755 rval
= get_base_distance_recursive (binfo
, 0, 0, -1,
756 &rval_private
, &new_binfo
, parent
,
757 path_ptr
, watch_access
, &via_virtual
, 0,
760 dfs_walk (binfo
, dfs_unmark
, markedp
);
762 /* Access restrictions don't count if we found an ambiguous basetype. */
763 if (rval
== -2 && protect
>= 0)
766 if (rval
&& protect
&& rval_private
)
769 /* find real virtual base classes. */
770 if (rval
== -1 && TREE_CODE (parent
) == TREE_VEC
771 && parent
== binfo_member (BINFO_TYPE (parent
),
772 CLASSTYPE_VBASECLASSES (type
)))
774 BINFO_INHERITANCE_CHAIN (parent
) = binfo
;
780 *path_ptr
= new_binfo
;
784 /* Search for a member with name NAME in a multiple inheritance lattice
785 specified by TYPE. If it does not exist, return NULL_TREE.
786 If the member is ambiguously referenced, return `error_mark_node'.
787 Otherwise, return the FIELD_DECL. */
789 /* Do a 1-level search for NAME as a member of TYPE. The caller must
790 figure out whether it can access this field. (Since it is only one
791 level, this is reasonable.) */
794 lookup_field_1 (type
, name
)
797 register tree field
= TYPE_FIELDS (type
);
799 #ifdef GATHER_STATISTICS
800 n_calls_lookup_field_1
++;
801 #endif /* GATHER_STATISTICS */
804 #ifdef GATHER_STATISTICS
806 #endif /* GATHER_STATISTICS */
807 if (DECL_NAME (field
) == NULL_TREE
808 && TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
810 tree temp
= lookup_field_1 (TREE_TYPE (field
), name
);
814 if (DECL_NAME (field
) == name
)
816 if ((TREE_CODE(field
) == VAR_DECL
|| TREE_CODE(field
) == CONST_DECL
)
817 && DECL_ASSEMBLER_NAME (field
) != NULL
)
818 GNU_xref_ref(current_function_decl
,
819 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (field
)));
822 field
= TREE_CHAIN (field
);
825 if (name
== _vptr_name
)
827 /* Give the user what s/he thinks s/he wants. */
828 if (TYPE_VIRTUAL_P (type
))
829 return CLASSTYPE_VFIELD (type
);
834 /* There are a number of cases we need to be aware of here:
835 current_class_type current_function_decl
842 Those last two make life interesting. If we're in a function which is
843 itself inside a class, we need decls to go into the fn's decls (our
844 second case below). But if we're in a class and the class itself is
845 inside a function, we need decls to go into the decls for the class. To
846 achieve this last goal, we must see if, when both current_class_ptr and
847 current_function_decl are set, the class was declared inside that
848 function. If so, we know to put the decls into the class's scope. */
853 if (current_function_decl
== NULL_TREE
)
854 return current_class_type
;
855 if (current_class_type
== NULL_TREE
)
856 return current_function_decl
;
857 if (DECL_CLASS_CONTEXT (current_function_decl
) == current_class_type
)
858 return current_function_decl
;
860 return current_class_type
;
863 /* Compute the access of FIELD. This is done by computing
864 the access available to each type in BASETYPES (which comes
865 as a list of [via_public/basetype] in reverse order, namely base
866 class before derived class). The first one which defines a
867 access defines the access for the field. Otherwise, the
868 access of the field is that which occurs normally.
870 Uses global variables CURRENT_CLASS_TYPE and
871 CURRENT_FUNCTION_DECL to use friend relationships
874 This will be static when lookup_fnfield comes into this file.
876 access_public_node means that the field can be accessed by the current lexical
879 access_protected_node means that the field cannot be accessed by the current
880 lexical scope because it is protected.
882 access_private_node means that the field cannot be accessed by the current
883 lexical scope because it is private. */
886 #define PUBLIC_RETURN return (DECL_PUBLIC (field) = 1), access_public_node
887 #define PROTECTED_RETURN return (DECL_PROTECTED (field) = 1), access_protected_node
888 #define PRIVATE_RETURN return (DECL_PRIVATE (field) = 1), access_private_node
890 #define PUBLIC_RETURN return access_public_node
891 #define PROTECTED_RETURN return access_protected_node
892 #define PRIVATE_RETURN return access_private_node
896 /* Disabled with DECL_PUBLIC &c. */
897 static tree previous_scope
= NULL_TREE
;
901 compute_access (basetype_path
, field
)
902 tree basetype_path
, field
;
907 int protected_ok
, via_protected
;
908 extern int flag_access_control
;
910 /* Replaces static decl above. */
914 = ((TREE_CODE (field
) == FUNCTION_DECL
&& DECL_STATIC_FUNCTION_P (field
))
915 || (TREE_CODE (field
) != FUNCTION_DECL
&& TREE_STATIC (field
)));
917 if (! flag_access_control
)
918 return access_public_node
;
920 /* The field lives in the current class. */
921 if (BINFO_TYPE (basetype_path
) == current_class_type
)
922 return access_public_node
;
925 /* Disabled until pushing function scope clears these out. If ever. */
926 /* Make these special cases fast. */
927 if (current_scope () == previous_scope
)
929 if (DECL_PUBLIC (field
))
930 return access_public_node
;
931 if (DECL_PROTECTED (field
))
932 return access_protected_node
;
933 if (DECL_PRIVATE (field
))
934 return access_private_node
;
938 /* We don't currently support access control on nested types. */
939 if (TREE_CODE (field
) == TYPE_DECL
)
940 return access_public_node
;
942 previous_scope
= current_scope ();
944 context
= DECL_CLASS_CONTEXT (field
);
945 if (context
== NULL_TREE
)
946 context
= DECL_CONTEXT (field
);
948 /* Fields coming from nested anonymous unions have their DECL_CLASS_CONTEXT
949 slot set to the union type rather than the record type containing
950 the anonymous union. */
951 if (context
&& TREE_CODE (context
) == UNION_TYPE
952 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (context
)))
953 context
= TYPE_CONTEXT (context
);
955 /* Virtual function tables are never private. But we should know that
956 we are looking for this, and not even try to hide it. */
957 if (DECL_NAME (field
) && VFIELD_NAME_P (DECL_NAME (field
)) == 1)
960 /* Member found immediately within object. */
961 if (BINFO_INHERITANCE_CHAIN (basetype_path
) == NULL_TREE
)
963 /* Are we (or an enclosing scope) friends with the class that has
965 if (is_friend (context
, previous_scope
))
968 /* If it's private, it's private, you letch. */
969 if (TREE_PRIVATE (field
))
972 /* ARM $11.5. Member functions of a derived class can access the
973 non-static protected members of a base class only through a
974 pointer to the derived class, a reference to it, or an object
975 of it. Also any subsequently derived classes also have
977 else if (TREE_PROTECTED (field
))
979 if (current_class_type
981 && ACCESSIBLY_DERIVED_FROM_P (context
, current_class_type
))
990 /* must reverse more than one element */
991 basetype_path
= reverse_path (basetype_path
);
992 types
= basetype_path
;
994 access
= access_default_node
;
995 protected_ok
= static_mem
&& current_class_type
996 && ACCESSIBLY_DERIVED_FROM_P (BINFO_TYPE (types
), current_class_type
);
1002 tree type
= BINFO_TYPE (binfo
);
1005 /* Friends of a class can see protected members of its bases.
1006 Note that classes are their own friends. */
1007 if (is_friend (type
, previous_scope
))
1013 member
= purpose_member (type
, DECL_ACCESS (field
));
1016 access
= TREE_VALUE (member
);
1020 types
= BINFO_INHERITANCE_CHAIN (types
);
1022 /* If the next type was VIA_PROTECTED, then fields of all remaining
1023 classes past that one are *at least* protected. */
1026 if (TREE_VIA_PROTECTED (types
))
1028 else if (! TREE_VIA_PUBLIC (types
) && ! private_ok
)
1030 access
= access_private_node
;
1037 reverse_path (basetype_path
);
1039 /* No special visibilities apply. Use normal rules. */
1041 if (access
== access_default_node
)
1043 if (is_friend (context
, previous_scope
))
1044 access
= access_public_node
;
1045 else if (TREE_PRIVATE (field
))
1046 access
= access_private_node
;
1047 else if (TREE_PROTECTED (field
))
1048 access
= access_protected_node
;
1050 access
= access_public_node
;
1053 if (access
== access_public_node
&& via_protected
)
1054 access
= access_protected_node
;
1056 if (access
== access_protected_node
&& protected_ok
)
1057 access
= access_public_node
;
1060 if (access
== access_public_node
)
1061 DECL_PUBLIC (field
) = 1;
1062 else if (access
== access_protected_node
)
1063 DECL_PROTECTED (field
) = 1;
1064 else if (access
== access_private_node
)
1065 DECL_PRIVATE (field
) = 1;
1066 else my_friendly_abort (96);
1071 /* Routine to see if the sub-object denoted by the binfo PARENT can be
1072 found as a base class and sub-object of the object denoted by
1073 BINFO. This routine relies upon binfos not being shared, except
1074 for binfos for virtual bases. */
1077 is_subobject_of_p (parent
, binfo
)
1080 tree binfos
= BINFO_BASETYPES (binfo
);
1081 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
1083 if (parent
== binfo
)
1086 /* Process and/or queue base types. */
1087 for (i
= 0; i
< n_baselinks
; i
++)
1089 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
1090 if (TREE_VIA_VIRTUAL (base_binfo
))
1091 base_binfo
= TYPE_BINFO (BINFO_TYPE (base_binfo
));
1092 if (is_subobject_of_p (parent
, base_binfo
))
1098 /* See if a one FIELD_DECL hides another. This routine is meant to
1099 correspond to ANSI working paper Sept 17, 1992 10p4. The two
1100 binfos given are the binfos corresponding to the particular places
1101 the FIELD_DECLs are found. This routine relies upon binfos not
1102 being shared, except for virtual bases. */
1105 hides (hider_binfo
, hidee_binfo
)
1106 tree hider_binfo
, hidee_binfo
;
1108 /* hider hides hidee, if hider has hidee as a base class and
1109 the instance of hidee is a sub-object of hider. The first
1110 part is always true is the second part is true.
1112 When hider and hidee are the same (two ways to get to the exact
1113 same member) we consider either one as hiding the other. */
1114 return is_subobject_of_p (hidee_binfo
, hider_binfo
);
1117 /* Very similar to lookup_fnfields_1 but it ensures that at least one
1118 function was declared inside the class given by TYPE. It really should
1119 only return functions that match the given TYPE. */
1122 lookup_fnfields_here (type
, name
)
1125 int idx
= lookup_fnfields_1 (type
, name
);
1128 /* ctors and dtors are always only in the right class. */
1131 fndecls
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type
), idx
);
1134 if (TYPE_MAIN_VARIANT (DECL_CLASS_CONTEXT (fndecls
))
1135 == TYPE_MAIN_VARIANT (type
))
1137 fndecls
= TREE_CHAIN (fndecls
);
1142 /* Look for a field named NAME in an inheritance lattice dominated by
1143 XBASETYPE. PROTECT is zero if we can avoid computing access
1144 information, otherwise it is 1. WANT_TYPE is 1 when we should only
1145 return TYPE_DECLs, if no TYPE_DECL can be found return NULL_TREE.
1147 It was not clear what should happen if WANT_TYPE is set, and an
1148 ambiguity is found. At least one use (lookup_name) to not see
1152 lookup_field (xbasetype
, name
, protect
, want_type
)
1153 register tree xbasetype
, name
;
1154 int protect
, want_type
;
1156 int head
= 0, tail
= 0;
1157 tree rval
, rval_binfo
= NULL_TREE
, rval_binfo_h
;
1158 tree type
, basetype_chain
, basetype_path
;
1159 tree this_v
= access_default_node
;
1160 tree entry
, binfo
, binfo_h
;
1161 tree own_access
= access_default_node
;
1162 int vbase_name_p
= VBASE_NAME_P (name
);
1164 /* rval_binfo is the binfo associated with the found member, note,
1165 this can be set with useful information, even when rval is not
1166 set, because it must deal with ALL members, not just non-function
1167 members. It is used for ambiguity checking and the hidden
1168 checks. Whereas rval is only set if a proper (not hidden)
1169 non-function member is found. */
1171 /* rval_binfo_h and binfo_h are binfo values used when we perform the
1172 hiding checks, as virtual base classes may not be shared. The strategy
1173 is we always go into the the binfo hierarchy owned by TYPE_BINFO of
1174 virtual base classes, as we cross virtual base class lines. This way
1175 we know that binfo of a virtual base class will always == itself when
1176 found along any line. (mrs) */
1180 /* Set this to nonzero if we don't know how to compute
1181 accurate error messages for access control. */
1182 int idx
= MEMOIZED_HASH_FN (name
);
1185 /* We cannot search for constructor/destructor names like this. */
1186 /* This can't go here, but where should it go? */
1187 /* If we are looking for a constructor in a templated type, use the
1188 unspecialized name, as that is how we store it. */
1189 if (IDENTIFIER_TEMPLATE (name
))
1190 name
= constructor_name (name
);
1193 if (xbasetype
== current_class_type
&& TYPE_BEING_DEFINED (xbasetype
)
1194 && IDENTIFIER_CLASS_VALUE (name
))
1196 tree field
= IDENTIFIER_CLASS_VALUE (name
);
1197 if (TREE_CODE (field
) != FUNCTION_DECL
1198 && ! (want_type
&& TREE_CODE (field
) != TYPE_DECL
))
1202 if (TREE_CODE (xbasetype
) == TREE_VEC
)
1204 type
= BINFO_TYPE (xbasetype
);
1205 basetype_path
= xbasetype
;
1207 else if (IS_AGGR_TYPE_CODE (TREE_CODE (xbasetype
)))
1210 basetype_path
= TYPE_BINFO (type
);
1211 BINFO_VIA_PUBLIC (basetype_path
) = 1;
1212 BINFO_INHERITANCE_CHAIN (basetype_path
) = NULL_TREE
;
1215 my_friendly_abort (97);
1217 complete_type (type
);
1219 if (CLASSTYPE_MTABLE_ENTRY (type
))
1221 tree tem
= MEMOIZED_FIELDS (CLASSTYPE_MTABLE_ENTRY (type
), idx
);
1223 while (tem
&& TREE_PURPOSE (tem
) != name
)
1225 memoized_fields_searched
[0]++;
1226 tem
= TREE_CHAIN (tem
);
1230 if (protect
&& TREE_TYPE (tem
))
1232 error (TREE_STRING_POINTER (TREE_TYPE (tem
)),
1233 IDENTIFIER_POINTER (name
),
1234 TYPE_NAME_STRING (DECL_FIELD_CONTEXT (TREE_VALUE (tem
))));
1235 return error_mark_node
;
1237 if (TREE_VALUE (tem
) == NULL_TREE
)
1238 memoized_fast_rejects
[0] += 1;
1240 memoized_fast_finds
[0] += 1;
1241 return TREE_VALUE (tem
);
1245 #ifdef GATHER_STATISTICS
1246 n_calls_lookup_field
++;
1247 #endif /* GATHER_STATISTICS */
1248 if (protect
&& flag_memoize_lookups
&& ! global_bindings_p ())
1249 entry
= make_memoized_table_entry (type
, name
, 0);
1253 rval
= lookup_field_1 (type
, name
);
1255 if (rval
|| lookup_fnfields_here (type
, name
) >= 0)
1261 if (TREE_CODE (rval
) != TYPE_DECL
)
1263 rval
= purpose_member (name
, CLASSTYPE_TAGS (type
));
1265 rval
= TYPE_MAIN_DECL (TREE_VALUE (rval
));
1270 if (TREE_CODE (rval
) == TYPE_DECL
1271 && lookup_fnfields_here (type
, name
) >= 0)
1276 if (protect
&& rval
)
1278 if (TREE_PRIVATE (rval
) | TREE_PROTECTED (rval
))
1279 this_v
= compute_access (basetype_path
, rval
);
1280 if (TREE_CODE (rval
) == CONST_DECL
)
1282 if (this_v
== access_private_node
)
1283 errstr
= "enum `%D' is a private value of class `%T'";
1284 else if (this_v
== access_protected_node
)
1285 errstr
= "enum `%D' is a protected value of class `%T'";
1289 if (this_v
== access_private_node
)
1290 errstr
= "member `%D' is a private member of class `%T'";
1291 else if (this_v
== access_protected_node
)
1292 errstr
= "member `%D' is a protected member of class `%T'";
1300 /* This depends on behavior of lookup_field_1! */
1301 tree error_string
= my_build_string (errstr
);
1302 TREE_TYPE (entry
) = error_string
;
1306 /* Let entry know there is no problem with this access. */
1307 TREE_TYPE (entry
) = NULL_TREE
;
1309 TREE_VALUE (entry
) = rval
;
1312 if (errstr
&& protect
)
1314 cp_error (errstr
, name
, type
);
1315 return error_mark_node
;
1320 basetype_chain
= build_tree_list (NULL_TREE
, basetype_path
);
1321 TREE_VIA_PUBLIC (basetype_chain
) = TREE_VIA_PUBLIC (basetype_path
);
1322 TREE_VIA_PROTECTED (basetype_chain
) = TREE_VIA_PROTECTED (basetype_path
);
1323 TREE_VIA_VIRTUAL (basetype_chain
) = TREE_VIA_VIRTUAL (basetype_path
);
1325 /* The ambiguity check relies upon breadth first searching. */
1327 search_stack
= push_search_level (search_stack
, &search_obstack
);
1328 binfo
= basetype_path
;
1333 tree binfos
= BINFO_BASETYPES (binfo
);
1334 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
1337 /* Process and/or queue base types. */
1338 for (i
= 0; i
< n_baselinks
; i
++)
1340 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
1341 if (BINFO_FIELDS_MARKED (base_binfo
) == 0)
1345 SET_BINFO_FIELDS_MARKED (base_binfo
);
1346 btypes
= my_tree_cons (NULL_TREE
, base_binfo
, basetype_chain
);
1347 TREE_VIA_PUBLIC (btypes
) = TREE_VIA_PUBLIC (base_binfo
);
1348 TREE_VIA_PROTECTED (btypes
) = TREE_VIA_PROTECTED (base_binfo
);
1349 TREE_VIA_VIRTUAL (btypes
) = TREE_VIA_VIRTUAL (base_binfo
);
1350 if (TREE_VIA_VIRTUAL (base_binfo
))
1351 btypes
= tree_cons (NULL_TREE
,
1352 TYPE_BINFO (BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (binfo_h
), i
))),
1355 btypes
= tree_cons (NULL_TREE
,
1356 TREE_VEC_ELT (BINFO_BASETYPES (binfo_h
), i
),
1358 obstack_ptr_grow (&search_obstack
, btypes
);
1360 if (tail
>= search_stack
->limit
)
1361 my_friendly_abort (98);
1365 /* Process head of queue, if one exists. */
1369 basetype_chain
= search_stack
->first
[head
++];
1370 binfo_h
= TREE_VALUE (basetype_chain
);
1371 basetype_chain
= TREE_CHAIN (basetype_chain
);
1372 basetype_path
= TREE_VALUE (basetype_chain
);
1373 if (TREE_CHAIN (basetype_chain
))
1374 BINFO_INHERITANCE_CHAIN (basetype_path
) = TREE_VALUE (TREE_CHAIN (basetype_chain
));
1376 BINFO_INHERITANCE_CHAIN (basetype_path
) = NULL_TREE
;
1378 binfo
= basetype_path
;
1379 type
= BINFO_TYPE (binfo
);
1381 /* See if we can find NAME in TYPE. If RVAL is nonzero,
1382 and we do find NAME in TYPE, verify that such a second
1383 sighting is in fact valid. */
1385 nval
= lookup_field_1 (type
, name
);
1387 if (nval
|| lookup_fnfields_here (type
, name
)>=0)
1389 if (nval
&& nval
== rval
&& SHARED_MEMBER_P (nval
))
1391 /* This is ok, the member found is the same [class.ambig] */
1393 else if (rval_binfo
&& hides (rval_binfo_h
, binfo_h
))
1395 /* This is ok, the member found is in rval_binfo, not
1398 else if (rval_binfo
==NULL_TREE
|| hides (binfo_h
, rval_binfo_h
))
1400 /* This is ok, the member found is here (binfo), not in
1405 if (entry
|| protect
)
1406 this_v
= compute_access (basetype_path
, rval
);
1407 /* These may look ambiguous, but they really are not. */
1413 /* Undo finding it before, as something else hides it. */
1417 rval_binfo_h
= binfo_h
;
1421 /* This is ambiguous. */
1422 errstr
= "request for member `%D' is ambiguous";
1429 tree
*tp
= search_stack
->first
;
1430 tree
*search_tail
= tp
+ tail
;
1433 TREE_VALUE (entry
) = rval
;
1437 type
= BINFO_TYPE (rval_binfo
);
1443 if (TREE_CODE (rval
) != TYPE_DECL
)
1445 rval
= purpose_member (name
, CLASSTYPE_TAGS (type
));
1447 rval
= TYPE_MAIN_DECL (TREE_VALUE (rval
));
1452 if (TREE_CODE (rval
) == TYPE_DECL
1453 && lookup_fnfields_here (type
, name
) >= 0)
1459 if (rval
== NULL_TREE
)
1462 /* If this FIELD_DECL defines its own access level, deal with that. */
1463 if (rval
&& errstr
== 0
1464 && ((protect
&1) || entry
)
1465 && DECL_LANG_SPECIFIC (rval
)
1466 && DECL_ACCESS (rval
))
1468 while (tp
< search_tail
)
1470 /* If is possible for one of the derived types on the path to
1471 have defined special access for this field. Look for such
1472 declarations and report an error if a conflict is found. */
1475 if (this_v
!= access_default_node
)
1476 new_v
= compute_access (TREE_VALUE (TREE_CHAIN (*tp
)), rval
);
1477 if (this_v
!= access_default_node
&& new_v
!= this_v
)
1479 errstr
= "conflicting access to member `%D'";
1480 this_v
= access_default_node
;
1483 CLEAR_BINFO_FIELDS_MARKED (TREE_VALUE (TREE_CHAIN (*tp
)));
1489 while (tp
< search_tail
)
1491 CLEAR_BINFO_FIELDS_MARKED (TREE_VALUE (TREE_CHAIN (*tp
)));
1496 search_stack
= pop_search_level (search_stack
);
1500 if (own_access
== access_private_node
)
1501 errstr
= "member `%D' declared private";
1502 else if (own_access
== access_protected_node
)
1503 errstr
= "member `%D' declared protected";
1504 else if (this_v
== access_private_node
)
1505 errstr
= TREE_PRIVATE (rval
)
1506 ? "member `%D' is private"
1507 : "member `%D' is from private base class";
1508 else if (this_v
== access_protected_node
)
1509 errstr
= TREE_PROTECTED (rval
)
1510 ? "member `%D' is protected"
1511 : "member `%D' is from protected base class";
1518 tree error_string
= my_build_string (errstr
);
1519 /* Save error message with entry. */
1520 TREE_TYPE (entry
) = error_string
;
1524 /* Mark entry as having no error string. */
1525 TREE_TYPE (entry
) = NULL_TREE
;
1531 /* If we are not interested in ambiguities, don't report them,
1532 just return NULL_TREE. */
1537 if (errstr
&& protect
)
1539 cp_error (errstr
, name
, type
);
1540 rval
= error_mark_node
;
1545 /* Try to find NAME inside a nested class. */
1548 lookup_nested_field (name
, complain
)
1554 tree id
= NULL_TREE
;
1555 if (TREE_CHAIN (current_class_type
))
1557 /* Climb our way up the nested ladder, seeing if we're trying to
1558 modify a field in an enclosing class. If so, we should only
1559 be able to modify if it's static. */
1560 for (t
= TREE_CHAIN (current_class_type
);
1561 t
&& DECL_CONTEXT (t
);
1562 t
= TREE_CHAIN (DECL_CONTEXT (t
)))
1564 if (TREE_CODE (DECL_CONTEXT (t
)) != RECORD_TYPE
)
1567 /* N.B.: lookup_field will do the access checking for us */
1568 id
= lookup_field (DECL_CONTEXT (t
), name
, complain
, 0);
1569 if (id
== error_mark_node
)
1575 if (id
!= NULL_TREE
)
1577 if (TREE_CODE (id
) == FIELD_DECL
1578 && ! TREE_STATIC (id
)
1579 && TREE_TYPE (id
) != error_mark_node
)
1583 /* At parse time, we don't want to give this error, since
1584 we won't have enough state to make this kind of
1585 decision properly. But there are times (e.g., with
1586 enums in nested classes) when we do need to call
1587 this fn at parse time. So, in those cases, we pass
1588 complain as a 0 and just return a NULL_TREE. */
1589 cp_error ("assignment to non-static member `%D' of enclosing class `%T'",
1590 id
, DECL_CONTEXT (t
));
1591 /* Mark this for do_identifier(). It would otherwise
1592 claim that the variable was undeclared. */
1593 TREE_TYPE (id
) = error_mark_node
;
1609 /* TYPE is a class type. Return the index of the fields within
1610 the method vector with name NAME, or -1 is no such field exists. */
1613 lookup_fnfields_1 (type
, name
)
1616 register tree method_vec
= CLASSTYPE_METHOD_VEC (type
);
1618 if (method_vec
!= 0)
1620 register tree
*methods
= &TREE_VEC_ELT (method_vec
, 0);
1621 register tree
*end
= TREE_VEC_END (method_vec
);
1623 #ifdef GATHER_STATISTICS
1624 n_calls_lookup_fnfields_1
++;
1625 #endif /* GATHER_STATISTICS */
1627 /* Constructors are first... */
1628 if (*methods
&& name
== ctor_identifier
)
1631 /* and destructors are second. */
1632 if (*++methods
&& name
== dtor_identifier
)
1635 while (++methods
!= end
)
1637 #ifdef GATHER_STATISTICS
1638 n_outer_fields_searched
++;
1639 #endif /* GATHER_STATISTICS */
1640 if (DECL_NAME (*methods
) == name
)
1644 /* If we didn't find it, it might have been a template
1645 conversion operator. (Note that we don't look for this case
1646 above so that we will always find specializations first.) */
1648 && IDENTIFIER_TYPENAME_P (name
))
1650 methods
= &TREE_VEC_ELT (method_vec
, 0) + 1;
1652 while (++methods
!= end
)
1654 if (TREE_CODE (*methods
) == TEMPLATE_DECL
1655 && IDENTIFIER_TYPENAME_P (DECL_NAME (*methods
)))
1661 return methods
- &TREE_VEC_ELT (method_vec
, 0);
1667 /* Starting from BASETYPE, return a TREE_BASELINK-like object
1668 which gives the following information (in a list):
1670 TREE_TYPE: list of basetypes needed to get to...
1671 TREE_VALUE: list of all functions in a given type
1672 which have name NAME.
1674 No access information is computed by this function,
1675 other then to adorn the list of basetypes with
1678 If there are two ways to find a name (two members), if COMPLAIN is
1679 non-zero, then error_mark_node is returned, and an error message is
1680 printed, otherwise, just an error_mark_node is returned.
1682 As a special case, is COMPLAIN is -1, we don't complain, and we
1683 don't return error_mark_node, but rather the complete list of
1684 virtuals. This is used by get_virtuals_named_this. */
1687 lookup_fnfields (basetype_path
, name
, complain
)
1688 tree basetype_path
, name
;
1691 int head
= 0, tail
= 0;
1692 tree type
, rval
, rval_binfo
= NULL_TREE
, rvals
= NULL_TREE
, rval_binfo_h
;
1693 tree entry
, binfo
, basetype_chain
, binfo_h
;
1696 /* rval_binfo is the binfo associated with the found member, note,
1697 this can be set with useful information, even when rval is not
1698 set, because it must deal with ALL members, not just function
1699 members. It is used for ambiguity checking and the hidden
1700 checks. Whereas rval is only set if a proper (not hidden)
1701 function member is found. */
1703 /* rval_binfo_h and binfo_h are binfo values used when we perform the
1704 hiding checks, as virtual base classes may not be shared. The strategy
1705 is we always go into the the binfo hierarchy owned by TYPE_BINFO of
1706 virtual base classes, as we cross virtual base class lines. This way
1707 we know that binfo of a virtual base class will always == itself when
1708 found along any line. (mrs) */
1710 /* For now, don't try this. */
1711 int protect
= complain
;
1715 /* Set this to nonzero if we don't know how to compute
1716 accurate error messages for access control. */
1717 int idx
= MEMOIZED_HASH_FN (name
);
1722 protect
= complain
= 0;
1726 /* We cannot search for constructor/destructor names like this. */
1727 /* This can't go here, but where should it go? */
1728 /* If we are looking for a constructor in a templated type, use the
1729 unspecialized name, as that is how we store it. */
1730 if (IDENTIFIER_TEMPLATE (name
))
1731 name
= constructor_name (name
);
1734 binfo
= basetype_path
;
1736 type
= complete_type (BINFO_TYPE (basetype_path
));
1738 /* The memoization code is in need of maintenance. */
1739 if (!find_all
&& CLASSTYPE_MTABLE_ENTRY (type
))
1741 tree tem
= MEMOIZED_FNFIELDS (CLASSTYPE_MTABLE_ENTRY (type
), idx
);
1743 while (tem
&& TREE_PURPOSE (tem
) != name
)
1745 memoized_fields_searched
[1]++;
1746 tem
= TREE_CHAIN (tem
);
1750 if (protect
&& TREE_TYPE (tem
))
1752 error (TREE_STRING_POINTER (TREE_TYPE (tem
)),
1753 IDENTIFIER_POINTER (name
),
1754 TYPE_NAME_STRING (DECL_CLASS_CONTEXT (TREE_VALUE (TREE_VALUE (tem
)))));
1755 return error_mark_node
;
1757 if (TREE_VALUE (tem
) == NULL_TREE
)
1759 memoized_fast_rejects
[1] += 1;
1764 /* Want to return this, but we must make sure
1765 that access information is consistent. */
1766 tree baselink
= TREE_VALUE (tem
);
1767 tree memoized_basetypes
= TREE_PURPOSE (baselink
);
1768 tree these_basetypes
= basetype_path
;
1769 while (memoized_basetypes
&& these_basetypes
)
1771 memoized_fields_searched
[1]++;
1772 if (TREE_VALUE (memoized_basetypes
) != these_basetypes
)
1774 memoized_basetypes
= TREE_CHAIN (memoized_basetypes
);
1775 these_basetypes
= BINFO_INHERITANCE_CHAIN (these_basetypes
);
1777 /* The following statement is true only when both are NULL. */
1778 if (memoized_basetypes
== these_basetypes
)
1780 memoized_fast_finds
[1] += 1;
1781 return TREE_VALUE (tem
);
1783 /* else, we must re-find this field by hand. */
1784 baselink
= tree_cons (basetype_path
, TREE_VALUE (baselink
), TREE_CHAIN (baselink
));
1790 #ifdef GATHER_STATISTICS
1791 n_calls_lookup_fnfields
++;
1792 #endif /* GATHER_STATISTICS */
1793 if (protect
&& flag_memoize_lookups
&& ! global_bindings_p ())
1794 entry
= make_memoized_table_entry (type
, name
, 1);
1798 idx
= lookup_fnfields_here (type
, name
);
1799 if (idx
>= 0 || lookup_field_1 (type
, name
))
1801 rval_binfo
= basetype_path
;
1802 rval_binfo_h
= rval_binfo
;
1807 rval
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type
), idx
);
1808 rvals
= my_tree_cons (basetype_path
, rval
, rvals
);
1809 if (BINFO_BASETYPES (binfo
) && CLASSTYPE_BASELINK_VEC (type
))
1810 TREE_TYPE (rvals
) = TREE_VEC_ELT (CLASSTYPE_BASELINK_VEC (type
), idx
);
1814 TREE_VALUE (entry
) = rvals
;
1815 TREE_TYPE (entry
) = NULL_TREE
;
1822 if (name
== ctor_identifier
|| name
== dtor_identifier
)
1824 /* Don't allow lookups of constructors and destructors to go
1825 deeper than the first place we look. */
1827 TREE_TYPE (entry
) = TREE_VALUE (entry
) = NULL_TREE
;
1832 if (basetype_path
== TYPE_BINFO (type
))
1834 basetype_chain
= CLASSTYPE_BINFO_AS_LIST (type
);
1835 TREE_VIA_PUBLIC (basetype_chain
) = 1;
1836 BINFO_VIA_PUBLIC (basetype_path
) = 1;
1837 BINFO_INHERITANCE_CHAIN (basetype_path
) = NULL_TREE
;
1841 basetype_chain
= build_tree_list (NULL_TREE
, basetype_path
);
1842 TREE_VIA_PUBLIC (basetype_chain
) = TREE_VIA_PUBLIC (basetype_path
);
1843 TREE_VIA_PROTECTED (basetype_chain
) = TREE_VIA_PROTECTED (basetype_path
);
1844 TREE_VIA_VIRTUAL (basetype_chain
) = TREE_VIA_VIRTUAL (basetype_path
);
1847 /* The ambiguity check relies upon breadth first searching. */
1849 search_stack
= push_search_level (search_stack
, &search_obstack
);
1850 binfo
= basetype_path
;
1855 tree binfos
= BINFO_BASETYPES (binfo
);
1856 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
1859 /* Process and/or queue base types. */
1860 for (i
= 0; i
< n_baselinks
; i
++)
1862 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
1863 if (BINFO_FIELDS_MARKED (base_binfo
) == 0)
1867 SET_BINFO_FIELDS_MARKED (base_binfo
);
1868 btypes
= my_tree_cons (NULL_TREE
, base_binfo
, basetype_chain
);
1869 TREE_VIA_PUBLIC (btypes
) = TREE_VIA_PUBLIC (base_binfo
);
1870 TREE_VIA_PROTECTED (btypes
) = TREE_VIA_PROTECTED (base_binfo
);
1871 TREE_VIA_VIRTUAL (btypes
) = TREE_VIA_VIRTUAL (base_binfo
);
1872 if (TREE_VIA_VIRTUAL (base_binfo
))
1873 btypes
= tree_cons (NULL_TREE
,
1874 TYPE_BINFO (BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (binfo_h
), i
))),
1877 btypes
= tree_cons (NULL_TREE
,
1878 TREE_VEC_ELT (BINFO_BASETYPES (binfo_h
), i
),
1880 obstack_ptr_grow (&search_obstack
, btypes
);
1882 if (tail
>= search_stack
->limit
)
1883 my_friendly_abort (99);
1887 /* Process head of queue, if one exists. */
1891 basetype_chain
= search_stack
->first
[head
++];
1892 binfo_h
= TREE_VALUE (basetype_chain
);
1893 basetype_chain
= TREE_CHAIN (basetype_chain
);
1894 basetype_path
= TREE_VALUE (basetype_chain
);
1895 if (TREE_CHAIN (basetype_chain
))
1896 BINFO_INHERITANCE_CHAIN (basetype_path
) = TREE_VALUE (TREE_CHAIN (basetype_chain
));
1898 BINFO_INHERITANCE_CHAIN (basetype_path
) = NULL_TREE
;
1900 binfo
= basetype_path
;
1901 type
= BINFO_TYPE (binfo
);
1903 /* See if we can find NAME in TYPE. If RVAL is nonzero,
1904 and we do find NAME in TYPE, verify that such a second
1905 sighting is in fact valid. */
1907 idx
= lookup_fnfields_here (type
, name
);
1909 if (idx
>= 0 || (lookup_field_1 (type
, name
)!=NULL_TREE
&& !find_all
))
1911 if (rval_binfo
&& !find_all
&& hides (rval_binfo_h
, binfo_h
))
1913 /* This is ok, the member found is in rval_binfo, not
1916 else if (rval_binfo
==NULL_TREE
|| find_all
|| hides (binfo_h
, rval_binfo_h
))
1918 /* This is ok, the member found is here (binfo), not in
1922 rval
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type
), idx
);
1923 /* Note, rvals can only be previously set if find_all is
1925 rvals
= my_tree_cons (basetype_path
, rval
, rvals
);
1926 if (TYPE_BINFO_BASETYPES (type
)
1927 && CLASSTYPE_BASELINK_VEC (type
))
1928 TREE_TYPE (rvals
) = TREE_VEC_ELT (CLASSTYPE_BASELINK_VEC (type
), idx
);
1932 /* Undo finding it before, as something else hides it. */
1937 rval_binfo_h
= binfo_h
;
1941 /* This is ambiguous. */
1942 errstr
= "request for method `%D' is ambiguous";
1943 rvals
= error_mark_node
;
1949 tree
*tp
= search_stack
->first
;
1950 tree
*search_tail
= tp
+ tail
;
1952 while (tp
< search_tail
)
1954 CLEAR_BINFO_FIELDS_MARKED (TREE_VALUE (TREE_CHAIN (*tp
)));
1958 search_stack
= pop_search_level (search_stack
);
1964 tree error_string
= my_build_string (errstr
);
1965 /* Save error message with entry. */
1966 TREE_TYPE (entry
) = error_string
;
1970 /* Mark entry as having no error string. */
1971 TREE_TYPE (entry
) = NULL_TREE
;
1972 TREE_VALUE (entry
) = rvals
;
1976 if (errstr
&& protect
)
1978 cp_error (errstr
, name
);
1979 rvals
= error_mark_node
;
1985 /* BREADTH-FIRST SEARCH ROUTINES. */
1987 /* Search a multiple inheritance hierarchy by breadth-first search.
1989 BINFO is an aggregate type, possibly in a multiple-inheritance hierarchy.
1990 TESTFN is a function, which, if true, means that our condition has been met,
1991 and its return value should be returned.
1992 QFN, if non-NULL, is a predicate dictating whether the type should
1995 static HOST_WIDE_INT
1996 breadth_first_search (binfo
, testfn
, qfn
)
1998 int (*testfn
) PROTO((tree
, int));
1999 int (*qfn
) PROTO((tree
, int));
2001 int head
= 0, tail
= 0;
2004 search_stack
= push_search_level (search_stack
, &search_obstack
);
2008 tree binfos
= BINFO_BASETYPES (binfo
);
2009 int n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
2012 /* Process and/or queue base types. */
2013 for (i
= 0; i
< n_baselinks
; i
++)
2015 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
2017 if (BINFO_MARKED (base_binfo
) == 0
2018 && (qfn
== 0 || (*qfn
) (binfo
, i
)))
2020 SET_BINFO_MARKED (base_binfo
);
2021 obstack_ptr_grow (&search_obstack
, binfo
);
2022 obstack_ptr_grow (&search_obstack
, (HOST_WIDE_INT
) i
);
2024 if (tail
>= search_stack
->limit
)
2025 my_friendly_abort (100);
2028 /* Process head of queue, if one exists. */
2035 binfo
= search_stack
->first
[head
++];
2036 i
= (HOST_WIDE_INT
) search_stack
->first
[head
++];
2037 if (rval
= (*testfn
) (binfo
, i
))
2039 binfo
= BINFO_BASETYPE (binfo
, i
);
2042 tree
*tp
= search_stack
->first
;
2043 tree
*search_tail
= tp
+ tail
;
2044 while (tp
< search_tail
)
2047 int i
= (HOST_WIDE_INT
)(*tp
++);
2048 CLEAR_BINFO_MARKED (BINFO_BASETYPE (binfo
, i
));
2052 search_stack
= pop_search_level (search_stack
);
2056 /* Functions to use in breadth first searches. */
2057 typedef int (*pfi
) PROTO((tree
, int));
2059 static tree declarator
;
2062 get_virtuals_named_this (binfo
)
2067 fields
= lookup_fnfields (binfo
, declarator
, -1);
2068 /* fields cannot be error_mark_node */
2073 /* Get to the function decls, and return the first virtual function
2074 with this name, if there is one. */
2079 for (fndecl
= TREE_VALUE (fields
); fndecl
; fndecl
= DECL_CHAIN (fndecl
))
2080 if (DECL_VINDEX (fndecl
))
2082 fields
= next_baselink (fields
);
2088 get_virtual_destructor (binfo
, i
)
2092 tree type
= BINFO_TYPE (binfo
);
2094 type
= BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (binfo
), i
));
2095 if (TYPE_HAS_DESTRUCTOR (type
)
2096 && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type
), 1)))
2097 return TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type
), 1);
2102 tree_has_any_destructor_p (binfo
, i
)
2106 tree type
= BINFO_TYPE (binfo
);
2108 type
= BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (binfo
), i
));
2109 return TYPE_NEEDS_DESTRUCTOR (type
);
2112 /* Given a class type TYPE, and a function decl FNDECL, look for a
2113 virtual function in TYPE's hierarchy which FNDECL could match as a
2114 virtual function. It doesn't matter which one we find.
2116 DTORP is nonzero if we are looking for a destructor. Destructors
2117 need special treatment because they do not match by name. */
2120 get_matching_virtual (binfo
, fndecl
, dtorp
)
2124 tree tmp
= NULL_TREE
;
2126 /* Breadth first search routines start searching basetypes
2127 of TYPE, so we must perform first ply of search here. */
2130 if (tree_has_any_destructor_p (binfo
, -1))
2131 tmp
= get_virtual_destructor (binfo
, -1);
2136 tmp
= (tree
) breadth_first_search (binfo
,
2137 (pfi
) get_virtual_destructor
,
2138 tree_has_any_destructor_p
);
2143 tree drettype
, dtypes
, btypes
, instptr_type
;
2144 tree basetype
= DECL_CLASS_CONTEXT (fndecl
);
2145 tree baselink
, best
= NULL_TREE
;
2146 tree name
= DECL_ASSEMBLER_NAME (fndecl
);
2148 declarator
= DECL_NAME (fndecl
);
2149 if (IDENTIFIER_VIRTUAL_P (declarator
) == 0)
2152 baselink
= get_virtuals_named_this (binfo
);
2153 if (baselink
== NULL_TREE
)
2156 drettype
= TREE_TYPE (TREE_TYPE (fndecl
));
2157 dtypes
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2158 if (DECL_STATIC_FUNCTION_P (fndecl
))
2159 instptr_type
= NULL_TREE
;
2161 instptr_type
= TREE_TYPE (TREE_VALUE (dtypes
));
2163 for (; baselink
; baselink
= next_baselink (baselink
))
2165 for (tmp
= TREE_VALUE (baselink
); tmp
; tmp
= DECL_CHAIN (tmp
))
2167 if (! DECL_VINDEX (tmp
))
2170 btypes
= TYPE_ARG_TYPES (TREE_TYPE (tmp
));
2171 if (instptr_type
== NULL_TREE
)
2173 if (compparms (TREE_CHAIN (btypes
), dtypes
, 3))
2174 /* Caller knows to give error in this case. */
2179 if ((TYPE_READONLY (TREE_TYPE (TREE_VALUE (btypes
)))
2180 == TYPE_READONLY (instptr_type
))
2181 && compparms (TREE_CHAIN (btypes
), TREE_CHAIN (dtypes
), 3))
2183 tree brettype
= TREE_TYPE (TREE_TYPE (tmp
));
2184 if (comptypes (brettype
, drettype
, 1))
2187 (TREE_CODE (brettype
) == TREE_CODE (drettype
)
2188 && (TREE_CODE (brettype
) == POINTER_TYPE
2189 || TREE_CODE (brettype
) == REFERENCE_TYPE
)
2190 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (brettype
)),
2191 TYPE_MAIN_VARIANT (TREE_TYPE (drettype
)),
2193 /* covariant return type */
2195 tree b
= TREE_TYPE (brettype
), d
= TREE_TYPE (drettype
);
2196 if (TYPE_MAIN_VARIANT (b
) != TYPE_MAIN_VARIANT (d
))
2198 tree binfo
= get_binfo (b
, d
, 1);
2199 if (binfo
!= error_mark_node
2200 && ! BINFO_OFFSET_ZEROP (binfo
))
2201 sorry ("adjusting pointers for covariant returns");
2203 if (TYPE_READONLY (d
) > TYPE_READONLY (b
))
2205 cp_error_at ("return type of `%#D' adds const", fndecl
);
2206 cp_error_at (" overriding definition as `%#D'",
2209 else if (TYPE_VOLATILE (d
) > TYPE_VOLATILE (b
))
2211 cp_error_at ("return type of `%#D' adds volatile",
2213 cp_error_at (" overriding definition as `%#D'",
2217 else if (IS_AGGR_TYPE_2 (brettype
, drettype
)
2218 && comptypes (brettype
, drettype
, 0))
2220 error ("invalid covariant return type (must use pointer or reference)");
2221 cp_error_at (" overriding `%#D'", tmp
);
2222 cp_error_at (" with `%#D'", fndecl
);
2224 else if (IDENTIFIER_ERROR_LOCUS (name
) == NULL_TREE
)
2226 cp_error_at ("conflicting return type specified for virtual function `%#D'", fndecl
);
2227 cp_error_at (" overriding definition as `%#D'", tmp
);
2228 SET_IDENTIFIER_ERROR_LOCUS (name
, basetype
);
2244 /* Return the list of virtual functions which are abstract in type
2245 TYPE that come from non virtual base classes. See
2246 expand_direct_vtbls_init for the style of search we do. */
2249 get_abstract_virtuals_1 (binfo
, do_self
, abstract_virtuals
)
2252 tree abstract_virtuals
;
2254 tree binfos
= BINFO_BASETYPES (binfo
);
2255 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
2257 for (i
= 0; i
< n_baselinks
; i
++)
2259 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
2260 int is_not_base_vtable
2261 = i
!= CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo
));
2262 if (! TREE_VIA_VIRTUAL (base_binfo
))
2264 = get_abstract_virtuals_1 (base_binfo
, is_not_base_vtable
,
2267 /* Should we use something besides CLASSTYPE_VFIELDS? */
2268 if (do_self
&& CLASSTYPE_VFIELDS (BINFO_TYPE (binfo
)))
2270 tree virtuals
= BINFO_VIRTUALS (binfo
);
2272 skip_rtti_stuff (&virtuals
);
2276 tree base_pfn
= FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (virtuals
));
2277 tree base_fndecl
= TREE_OPERAND (base_pfn
, 0);
2278 if (DECL_ABSTRACT_VIRTUAL_P (base_fndecl
))
2279 abstract_virtuals
= tree_cons (NULL_TREE
, base_fndecl
, abstract_virtuals
);
2280 virtuals
= TREE_CHAIN (virtuals
);
2283 return abstract_virtuals
;
2286 /* Return the list of virtual functions which are abstract in type TYPE.
2287 This information is cached, and so must be built on a
2288 non-temporary obstack. */
2291 get_abstract_virtuals (type
)
2295 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (type
);
2297 /* First get all from non-virtual bases. */
2299 = get_abstract_virtuals_1 (TYPE_BINFO (type
), 1, abstract_virtuals
);
2301 for (vbases
= CLASSTYPE_VBASECLASSES (type
); vbases
; vbases
= TREE_CHAIN (vbases
))
2303 tree virtuals
= BINFO_VIRTUALS (vbases
);
2305 skip_rtti_stuff (&virtuals
);
2309 tree base_pfn
= FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (virtuals
));
2310 tree base_fndecl
= TREE_OPERAND (base_pfn
, 0);
2311 if (DECL_ABSTRACT_VIRTUAL_P (base_fndecl
))
2312 abstract_virtuals
= tree_cons (NULL_TREE
, base_fndecl
, abstract_virtuals
);
2313 virtuals
= TREE_CHAIN (virtuals
);
2316 return nreverse (abstract_virtuals
);
2319 /* For the type TYPE, return a list of member functions available from
2320 base classes with name NAME. The TREE_VALUE of the list is a chain of
2321 member functions with name NAME. The TREE_PURPOSE of the list is a
2322 basetype, or a list of base types (in reverse order) which were
2323 traversed to reach the chain of member functions. If we reach a base
2324 type which provides a member function of name NAME, and which has at
2325 most one base type itself, then we can terminate the search. */
2328 get_baselinks (type_as_binfo_list
, type
, name
)
2329 tree type_as_binfo_list
;
2332 int head
= 0, tail
= 0, idx
;
2333 tree rval
= 0, nval
= 0;
2334 tree basetypes
= type_as_binfo_list
;
2335 tree binfo
= TYPE_BINFO (type
);
2337 search_stack
= push_search_level (search_stack
, &search_obstack
);
2341 tree binfos
= BINFO_BASETYPES (binfo
);
2342 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
2344 /* Process and/or queue base types. */
2345 for (i
= 0; i
< n_baselinks
; i
++)
2347 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
2350 btypes
= hash_tree_cons (TREE_VIA_PUBLIC (base_binfo
),
2351 TREE_VIA_VIRTUAL (base_binfo
),
2352 TREE_VIA_PROTECTED (base_binfo
),
2353 NULL_TREE
, base_binfo
,
2355 obstack_ptr_grow (&search_obstack
, btypes
);
2356 search_stack
->first
= (tree
*)obstack_base (&search_obstack
);
2361 /* Process head of queue, if one exists. */
2365 basetypes
= search_stack
->first
[head
++];
2366 binfo
= TREE_VALUE (basetypes
);
2367 type
= BINFO_TYPE (binfo
);
2368 idx
= lookup_fnfields_1 (type
, name
);
2371 nval
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type
), idx
);
2372 rval
= hash_tree_cons (0, 0, 0, basetypes
, nval
, rval
);
2373 if (TYPE_BINFO_BASETYPES (type
) == 0)
2375 else if (TREE_VEC_LENGTH (TYPE_BINFO_BASETYPES (type
)) == 1)
2377 if (CLASSTYPE_BASELINK_VEC (type
))
2378 TREE_TYPE (rval
) = TREE_VEC_ELT (CLASSTYPE_BASELINK_VEC (type
), idx
);
2385 search_stack
= pop_search_level (search_stack
);
2390 next_baselink (baselink
)
2393 tree tmp
= TREE_TYPE (baselink
);
2394 baselink
= TREE_CHAIN (baselink
);
2397 /* @@ does not yet add previous base types. */
2398 baselink
= tree_cons (TREE_PURPOSE (tmp
), TREE_VALUE (tmp
),
2400 TREE_TYPE (baselink
) = TREE_TYPE (tmp
);
2401 tmp
= TREE_CHAIN (tmp
);
2406 /* DEPTH-FIRST SEARCH ROUTINES. */
2408 /* Assign unique numbers to _CLASSTYPE members of the lattice
2409 specified by TYPE. The root nodes are marked first; the nodes
2410 are marked depth-fisrt, left-right. */
2414 /* Matrix implementing a relation from CLASSTYPE X CLASSTYPE => INT.
2415 Relation yields 1 if C1 <= C2, 0 otherwise. */
2416 typedef char mi_boolean
;
2417 static mi_boolean
*mi_matrix
;
2419 /* Type for which this matrix is defined. */
2420 static tree mi_type
;
2422 /* Size of the matrix for indexing purposes. */
2425 /* Return nonzero if class C2 derives from class C1. */
2426 #define BINFO_DERIVES_FROM(C1, C2) \
2427 ((mi_matrix+mi_size*(BINFO_CID (C1)-1))[BINFO_CID (C2)-1])
2428 #define TYPE_DERIVES_FROM(C1, C2) \
2429 ((mi_matrix+mi_size*(CLASSTYPE_CID (C1)-1))[CLASSTYPE_CID (C2)-1])
2430 #define BINFO_DERIVES_FROM_STAR(C) \
2431 (mi_matrix+(BINFO_CID (C)-1))
2433 /* This routine converts a pointer to be a pointer of an immediate
2434 base class. The normal convert_pointer_to routine would diagnose
2435 the conversion as ambiguous, under MI code that has the base class
2436 as an ambiguous base class. */
2439 convert_pointer_to_single_level (to_type
, expr
)
2442 tree binfo_of_derived
;
2445 binfo_of_derived
= TYPE_BINFO (TREE_TYPE (TREE_TYPE (expr
)));
2446 last
= get_binfo (to_type
, TREE_TYPE (TREE_TYPE (expr
)), 0);
2447 BINFO_INHERITANCE_CHAIN (last
) = binfo_of_derived
;
2448 BINFO_INHERITANCE_CHAIN (binfo_of_derived
) = NULL_TREE
;
2449 return build_vbase_path (PLUS_EXPR
, build_pointer_type (to_type
), expr
, last
, 1);
2452 /* The main function which implements depth first search.
2454 This routine has to remember the path it walked up, when
2455 dfs_init_vbase_pointers is the work function, as otherwise there
2456 would be no record. */
2459 dfs_walk (binfo
, fn
, qfn
)
2461 void (*fn
) PROTO((tree
));
2462 int (*qfn
) PROTO((tree
));
2464 tree binfos
= BINFO_BASETYPES (binfo
);
2465 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
2467 for (i
= 0; i
< n_baselinks
; i
++)
2469 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
2471 if (qfn
== 0 || (*qfn
)(base_binfo
))
2473 if (TREE_CODE (BINFO_TYPE (base_binfo
)) == TEMPLATE_TYPE_PARM
)
2475 else if (fn
== dfs_init_vbase_pointers
)
2477 /* When traversing an arbitrary MI hierarchy, we need to keep
2478 a record of the path we took to get down to the final base
2479 type, as otherwise there would be no record of it, and just
2480 trying to blindly convert at the bottom would be ambiguous.
2482 The easiest way is to do the conversions one step at a time,
2483 as we know we want the immediate base class at each step.
2485 The only special trick to converting one step at a time,
2486 is that when we hit the last virtual base class, we must
2487 use the SLOT value for it, and not use the normal convert
2488 routine. We use the last virtual base class, as in our
2489 implementation, we have pointers to all virtual base
2490 classes in the base object. */
2492 tree saved_vbase_decl_ptr_intermediate
2493 = vbase_decl_ptr_intermediate
;
2495 if (TREE_VIA_VIRTUAL (base_binfo
))
2497 /* No need for the conversion here, as we know it is the
2499 vbase_decl_ptr_intermediate
2500 = CLASSTYPE_SEARCH_SLOT (BINFO_TYPE (base_binfo
));
2504 vbase_decl_ptr_intermediate
2505 = convert_pointer_to_single_level (BINFO_TYPE (base_binfo
),
2506 vbase_decl_ptr_intermediate
);
2509 dfs_walk (base_binfo
, fn
, qfn
);
2511 vbase_decl_ptr_intermediate
= saved_vbase_decl_ptr_intermediate
;
2514 dfs_walk (base_binfo
, fn
, qfn
);
2521 /* Predicate functions which serve for dfs_walk. */
2522 static int numberedp (binfo
) tree binfo
;
2523 { return BINFO_CID (binfo
); }
2524 static int unnumberedp (binfo
) tree binfo
;
2525 { return BINFO_CID (binfo
) == 0; }
2527 static int markedp (binfo
) tree binfo
;
2528 { return BINFO_MARKED (binfo
); }
2529 static int unmarkedp (binfo
) tree binfo
;
2530 { return BINFO_MARKED (binfo
) == 0; }
2533 static int bfs_markedp (binfo
, i
) tree binfo
; int i
;
2534 { return BINFO_MARKED (BINFO_BASETYPE (binfo
, i
)); }
2535 static int bfs_unmarkedp (binfo
, i
) tree binfo
; int i
;
2536 { return BINFO_MARKED (BINFO_BASETYPE (binfo
, i
)) == 0; }
2537 static int bfs_marked_vtable_pathp (binfo
, i
) tree binfo
; int i
;
2538 { return BINFO_VTABLE_PATH_MARKED (BINFO_BASETYPE (binfo
, i
)); }
2539 static int bfs_unmarked_vtable_pathp (binfo
, i
) tree binfo
; int i
;
2540 { return BINFO_VTABLE_PATH_MARKED (BINFO_BASETYPE (binfo
, i
)) == 0; }
2541 static int bfs_marked_new_vtablep (binfo
, i
) tree binfo
; int i
;
2542 { return BINFO_NEW_VTABLE_MARKED (BINFO_BASETYPE (binfo
, i
)); }
2543 static int bfs_unmarked_new_vtablep (binfo
, i
) tree binfo
; int i
;
2544 { return BINFO_NEW_VTABLE_MARKED (BINFO_BASETYPE (binfo
, i
)) == 0; }
2547 static int marked_vtable_pathp (binfo
) tree binfo
;
2548 { return BINFO_VTABLE_PATH_MARKED (binfo
); }
2549 static int unmarked_vtable_pathp (binfo
) tree binfo
;
2550 { return BINFO_VTABLE_PATH_MARKED (binfo
) == 0; }
2551 static int marked_new_vtablep (binfo
) tree binfo
;
2552 { return BINFO_NEW_VTABLE_MARKED (binfo
); }
2553 static int unmarked_new_vtablep (binfo
) tree binfo
;
2554 { return BINFO_NEW_VTABLE_MARKED (binfo
) == 0; }
2557 static int dfs_search_slot_nonempty_p (binfo
) tree binfo
;
2558 { return CLASSTYPE_SEARCH_SLOT (BINFO_TYPE (binfo
)) != 0; }
2561 static int dfs_debug_unmarkedp (binfo
) tree binfo
;
2562 { return CLASSTYPE_DEBUG_REQUESTED (BINFO_TYPE (binfo
)) == 0; }
2564 /* The worker functions for `dfs_walk'. These do not need to
2565 test anything (vis a vis marking) if they are paired with
2566 a predicate function (above). */
2568 /* Assign each type within the lattice a number which is unique
2569 in the lattice. The first number assigned is 1. */
2575 BINFO_CID (binfo
) = ++cid
;
2579 dfs_unnumber (binfo
)
2582 BINFO_CID (binfo
) = 0;
2587 dfs_mark (binfo
) tree binfo
;
2588 { SET_BINFO_MARKED (binfo
); }
2592 dfs_unmark (binfo
) tree binfo
;
2593 { CLEAR_BINFO_MARKED (binfo
); }
2597 dfs_mark_vtable_path (binfo
) tree binfo
;
2598 { SET_BINFO_VTABLE_PATH_MARKED (binfo
); }
2601 dfs_unmark_vtable_path (binfo
) tree binfo
;
2602 { CLEAR_BINFO_VTABLE_PATH_MARKED (binfo
); }
2605 dfs_mark_new_vtable (binfo
) tree binfo
;
2606 { SET_BINFO_NEW_VTABLE_MARKED (binfo
); }
2609 dfs_unmark_new_vtable (binfo
) tree binfo
;
2610 { CLEAR_BINFO_NEW_VTABLE_MARKED (binfo
); }
2613 dfs_clear_search_slot (binfo
) tree binfo
;
2614 { CLASSTYPE_SEARCH_SLOT (BINFO_TYPE (binfo
)) = 0; }
2618 dfs_debug_mark (binfo
)
2621 tree t
= BINFO_TYPE (binfo
);
2623 /* Use heuristic that if there are virtual functions,
2624 ignore until we see a non-inline virtual function. */
2625 tree methods
= CLASSTYPE_METHOD_VEC (t
);
2627 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
2632 /* If interface info is known, either we've already emitted the debug
2633 info or we don't need to. */
2634 if (CLASSTYPE_INTERFACE_KNOWN (t
)
2635 || (write_virtuals
== 2 && TYPE_VIRTUAL_P (t
)))
2638 /* If debug info is requested from this context for this type, supply it.
2639 If debug info is requested from another context for this type,
2640 see if some third context can supply it. */
2641 if (current_function_decl
== NULL_TREE
2642 || DECL_CLASS_CONTEXT (current_function_decl
) != t
)
2644 if (TREE_VEC_ELT (methods
, 1))
2645 methods
= TREE_VEC_ELT (methods
, 1);
2646 else if (TREE_VEC_ELT (methods
, 0))
2647 methods
= TREE_VEC_ELT (methods
, 0);
2649 methods
= TREE_VEC_ELT (methods
, 2);
2652 if (DECL_VINDEX (methods
)
2653 && DECL_THIS_INLINE (methods
) == 0
2654 && DECL_ABSTRACT_VIRTUAL_P (methods
) == 0)
2656 /* Somebody, somewhere is going to have to define this
2657 virtual function. When they do, they will provide
2658 the debugging info. */
2661 methods
= TREE_CHAIN (methods
);
2664 /* We cannot rely on some alien method to solve our problems,
2665 so we must write out the debug info ourselves. */
2666 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = 0;
2667 rest_of_type_compilation (t
, global_bindings_p ());
2670 /* Attach to the type of the virtual base class, the pointer to the
2671 virtual base class, given the global pointer vbase_decl_ptr.
2673 We use the global vbase_types. ICK! */
2676 dfs_find_vbases (binfo
)
2679 tree binfos
= BINFO_BASETYPES (binfo
);
2680 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
2682 for (i
= n_baselinks
-1; i
>= 0; i
--)
2684 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
2686 if (TREE_VIA_VIRTUAL (base_binfo
)
2687 && CLASSTYPE_SEARCH_SLOT (BINFO_TYPE (base_binfo
)) == 0)
2689 tree vbase
= BINFO_TYPE (base_binfo
);
2690 tree binfo
= binfo_member (vbase
, vbase_types
);
2692 CLASSTYPE_SEARCH_SLOT (vbase
)
2693 = build (PLUS_EXPR
, build_pointer_type (vbase
),
2694 vbase_decl_ptr
, BINFO_OFFSET (binfo
));
2697 SET_BINFO_VTABLE_PATH_MARKED (binfo
);
2698 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
2702 dfs_init_vbase_pointers (binfo
)
2705 tree type
= BINFO_TYPE (binfo
);
2706 tree fields
= TYPE_FIELDS (type
);
2707 tree this_vbase_ptr
;
2709 CLEAR_BINFO_VTABLE_PATH_MARKED (binfo
);
2712 /* See finish_struct_1 for when we can enable this. */
2713 /* If we have a vtable pointer first, skip it. */
2714 if (VFIELD_NAME_P (DECL_NAME (fields
)))
2715 fields
= TREE_CHAIN (fields
);
2718 if (fields
== NULL_TREE
2719 || DECL_NAME (fields
) == NULL_TREE
2720 || ! VBASE_NAME_P (DECL_NAME (fields
)))
2723 this_vbase_ptr
= vbase_decl_ptr_intermediate
;
2725 if (build_pointer_type (type
) != TYPE_MAIN_VARIANT (TREE_TYPE (this_vbase_ptr
)))
2726 my_friendly_abort (125);
2728 while (fields
&& DECL_NAME (fields
)
2729 && VBASE_NAME_P (DECL_NAME (fields
)))
2731 tree ref
= build (COMPONENT_REF
, TREE_TYPE (fields
),
2732 build_indirect_ref (this_vbase_ptr
, NULL_PTR
), fields
);
2733 tree init
= CLASSTYPE_SEARCH_SLOT (TREE_TYPE (TREE_TYPE (fields
)));
2734 vbase_init_result
= tree_cons (binfo_member (TREE_TYPE (TREE_TYPE (fields
)),
2736 build_modify_expr (ref
, NOP_EXPR
, init
),
2738 fields
= TREE_CHAIN (fields
);
2742 /* Sometimes this needs to clear both VTABLE_PATH and NEW_VTABLE. Other
2743 times, just NEW_VTABLE, but optimizer should make both with equal
2744 efficiency (though it does not currently). */
2747 dfs_clear_vbase_slots (binfo
)
2750 tree type
= BINFO_TYPE (binfo
);
2751 CLASSTYPE_SEARCH_SLOT (type
) = 0;
2752 CLEAR_BINFO_VTABLE_PATH_MARKED (binfo
);
2753 CLEAR_BINFO_NEW_VTABLE_MARKED (binfo
);
2757 init_vbase_pointers (type
, decl_ptr
)
2761 if (TYPE_USES_VIRTUAL_BASECLASSES (type
))
2763 int old_flag
= flag_this_is_variable
;
2764 tree binfo
= TYPE_BINFO (type
);
2765 flag_this_is_variable
= -2;
2766 vbase_types
= CLASSTYPE_VBASECLASSES (type
);
2767 vbase_decl_ptr
= vbase_decl_ptr_intermediate
= decl_ptr
;
2768 vbase_init_result
= NULL_TREE
;
2769 dfs_walk (binfo
, dfs_find_vbases
, unmarked_vtable_pathp
);
2770 dfs_walk (binfo
, dfs_init_vbase_pointers
, marked_vtable_pathp
);
2771 dfs_walk (binfo
, dfs_clear_vbase_slots
, marked_new_vtablep
);
2772 flag_this_is_variable
= old_flag
;
2773 return vbase_init_result
;
2778 /* get the virtual context (the vbase that directly contains the
2779 DECL_CLASS_CONTEXT of the FNDECL) that the given FNDECL is declared in,
2780 or NULL_TREE if there is none.
2782 FNDECL must come from a virtual table from a virtual base to ensure that
2783 there is only one possible DECL_CLASS_CONTEXT.
2785 We know that if there is more than one place (binfo) the fndecl that the
2786 declared, they all refer to the same binfo. See get_class_offset_1 for
2787 the check that ensures this. */
2790 virtual_context (fndecl
, t
, vbase
)
2791 tree fndecl
, t
, vbase
;
2794 if (get_base_distance (DECL_CLASS_CONTEXT (fndecl
), t
, 0, &path
) < 0)
2796 /* DECL_CLASS_CONTEXT can be ambiguous in t. */
2797 if (get_base_distance (DECL_CLASS_CONTEXT (fndecl
), vbase
, 0, &path
) >= 0)
2801 /* Not sure if checking path == vbase is necessary here, but just in
2803 if (TREE_VIA_VIRTUAL (path
) || path
== vbase
)
2804 return binfo_member (BINFO_TYPE (path
), CLASSTYPE_VBASECLASSES (t
));
2805 path
= BINFO_INHERITANCE_CHAIN (path
);
2808 /* This shouldn't happen, I don't want errors! */
2809 warning ("recoverable compiler error, fixups for virtual function");
2814 if (TREE_VIA_VIRTUAL (path
))
2815 return binfo_member (BINFO_TYPE (path
), CLASSTYPE_VBASECLASSES (t
));
2816 path
= BINFO_INHERITANCE_CHAIN (path
);
2821 /* Fixups upcast offsets for one vtable.
2822 Entries may stay within the VBASE given, or
2823 they may upcast into a direct base, or
2824 they may upcast into a different vbase.
2826 We only need to do fixups in case 2 and 3. In case 2, we add in
2827 the virtual base offset to effect an upcast, in case 3, we add in
2828 the virtual base offset to effect an upcast, then subtract out the
2829 offset for the other virtual base, to effect a downcast into it.
2831 This routine mirrors fixup_vtable_deltas in functionality, though
2832 this one is runtime based, and the other is compile time based.
2833 Conceivably that routine could be removed entirely, and all fixups
2836 VBASE_OFFSETS is an association list of virtual bases that contains
2837 offset information for the virtual bases, so the offsets are only
2838 calculated once. The offsets are computed by where we think the
2839 vbase should be (as noted by the CLASSTYPE_SEARCH_SLOT) minus where
2840 the vbase really is. */
2843 expand_upcast_fixups (binfo
, addr
, orig_addr
, vbase
, vbase_addr
, t
,
2845 tree binfo
, addr
, orig_addr
, vbase
, vbase_addr
, t
, *vbase_offsets
;
2847 tree virtuals
= BINFO_VIRTUALS (binfo
);
2850 unsigned HOST_WIDE_INT n
;
2852 delta
= purpose_member (vbase
, *vbase_offsets
);
2855 delta
= CLASSTYPE_SEARCH_SLOT (BINFO_TYPE (vbase
));
2856 delta
= build (MINUS_EXPR
, ptrdiff_type_node
, delta
, vbase_addr
);
2857 delta
= save_expr (delta
);
2858 delta
= tree_cons (vbase
, delta
, *vbase_offsets
);
2859 *vbase_offsets
= delta
;
2862 n
= skip_rtti_stuff (&virtuals
);
2866 tree current_fndecl
= TREE_VALUE (virtuals
);
2867 current_fndecl
= FNADDR_FROM_VTABLE_ENTRY (current_fndecl
);
2868 current_fndecl
= TREE_OPERAND (current_fndecl
, 0);
2870 && current_fndecl
!= abort_fndecl
2871 && (vc
=virtual_context (current_fndecl
, t
, vbase
)) != vbase
)
2873 /* This may in fact need a runtime fixup. */
2874 tree idx
= build_int_2 (n
, 0);
2875 tree vtbl
= BINFO_VTABLE (binfo
);
2876 tree nvtbl
= lookup_name (DECL_NAME (vtbl
), 0);
2877 tree aref
, ref
, naref
;
2878 tree old_delta
, new_delta
;
2881 if (nvtbl
== NULL_TREE
2882 || nvtbl
== IDENTIFIER_GLOBAL_VALUE (DECL_NAME (vtbl
)))
2884 /* Dup it if it isn't in local scope yet. */
2885 nvtbl
= build_decl (VAR_DECL
,
2887 TYPE_MAIN_VARIANT (TREE_TYPE (BINFO_VTABLE (binfo
))));
2888 DECL_ALIGN (nvtbl
) = MAX (TYPE_ALIGN (double_type_node
),
2889 DECL_ALIGN (nvtbl
));
2890 TREE_READONLY (nvtbl
) = 0;
2891 DECL_ARTIFICIAL (nvtbl
) = 1;
2892 nvtbl
= pushdecl (nvtbl
);
2894 cp_finish_decl (nvtbl
, init
, NULL_TREE
, 0, LOOKUP_ONLYCONVERTING
);
2895 DECL_VIRTUAL_P (nvtbl
) = 1;
2896 DECL_CONTEXT (nvtbl
) = t
;
2897 init
= build (MODIFY_EXPR
, TREE_TYPE (nvtbl
),
2899 TREE_SIDE_EFFECTS (init
) = 1;
2900 expand_expr_stmt (init
);
2901 /* Update the vtable pointers as necessary. */
2902 ref
= build_vfield_ref (build_indirect_ref (addr
, NULL_PTR
), DECL_CONTEXT (CLASSTYPE_VFIELD (BINFO_TYPE (binfo
))));
2903 expand_expr_stmt (build_modify_expr (ref
, NOP_EXPR
,
2904 build_unary_op (ADDR_EXPR
, nvtbl
, 0)));
2906 assemble_external (vtbl
);
2907 aref
= build_array_ref (vtbl
, idx
);
2908 naref
= build_array_ref (nvtbl
, idx
);
2909 old_delta
= build_component_ref (aref
, delta_identifier
, NULL_TREE
, 0);
2910 new_delta
= build_component_ref (naref
, delta_identifier
, NULL_TREE
, 0);
2912 /* This is a upcast, so we have to add the offset for the
2914 old_delta
= build_binary_op (PLUS_EXPR
, old_delta
,
2915 TREE_VALUE (delta
), 0);
2918 /* If this is set, we need to subtract out the delta
2919 adjustments for the other virtual base that we
2921 tree vc_delta
= purpose_member (vc
, *vbase_offsets
);
2924 tree vc_addr
= convert_pointer_to_real (vc
, orig_addr
);
2925 vc_delta
= CLASSTYPE_SEARCH_SLOT (BINFO_TYPE (vc
));
2926 vc_delta
= build (MINUS_EXPR
, ptrdiff_type_node
,
2928 vc_delta
= save_expr (vc_delta
);
2929 *vbase_offsets
= tree_cons (vc
, vc_delta
, *vbase_offsets
);
2932 vc_delta
= TREE_VALUE (vc_delta
);
2934 /* This is a downcast, so we have to subtract the offset
2935 for the virtual base. */
2936 old_delta
= build_binary_op (MINUS_EXPR
, old_delta
, vc_delta
, 0);
2939 TREE_READONLY (new_delta
) = 0;
2940 expand_expr_stmt (build_modify_expr (new_delta
, NOP_EXPR
,
2944 virtuals
= TREE_CHAIN (virtuals
);
2948 /* Fixup upcast offsets for all direct vtables. Patterned after
2949 expand_direct_vtbls_init. */
2952 fixup_virtual_upcast_offsets (real_binfo
, binfo
, init_self
, can_elide
, addr
, orig_addr
, type
, vbase
, vbase_offsets
)
2953 tree real_binfo
, binfo
;
2954 int init_self
, can_elide
;
2955 tree addr
, orig_addr
, type
, vbase
, *vbase_offsets
;
2957 tree real_binfos
= BINFO_BASETYPES (real_binfo
);
2958 tree binfos
= BINFO_BASETYPES (binfo
);
2959 int i
, n_baselinks
= real_binfos
? TREE_VEC_LENGTH (real_binfos
) : 0;
2961 for (i
= 0; i
< n_baselinks
; i
++)
2963 tree real_base_binfo
= TREE_VEC_ELT (real_binfos
, i
);
2964 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
2965 int is_not_base_vtable
2966 = i
!= CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (real_binfo
));
2967 if (! TREE_VIA_VIRTUAL (real_base_binfo
))
2968 fixup_virtual_upcast_offsets (real_base_binfo
, base_binfo
,
2969 is_not_base_vtable
, can_elide
, addr
,
2970 orig_addr
, type
, vbase
, vbase_offsets
);
2973 /* Before turning this on, make sure it is correct. */
2974 if (can_elide
&& ! BINFO_MODIFIED (binfo
))
2977 /* Should we use something besides CLASSTYPE_VFIELDS? */
2978 if (init_self
&& CLASSTYPE_VFIELDS (BINFO_TYPE (real_binfo
)))
2980 tree new_addr
= convert_pointer_to_real (binfo
, addr
);
2981 expand_upcast_fixups (real_binfo
, new_addr
, orig_addr
, vbase
, addr
,
2982 type
, vbase_offsets
);
2986 /* Build a COMPOUND_EXPR which when expanded will generate the code
2987 needed to initialize all the virtual function table slots of all
2988 the virtual baseclasses. MAIN_BINFO is the binfo which determines
2989 the virtual baseclasses to use; TYPE is the type of the object to
2990 which the initialization applies. TRUE_EXP is the true object we
2991 are initializing, and DECL_PTR is the pointer to the sub-object we
2994 When USE_COMPUTED_OFFSETS is non-zero, we can assume that the
2995 object was laid out by a top-level constructor and the computed
2996 offsets are valid to store vtables. When zero, we must store new
2997 vtables through virtual baseclass pointers.
2999 We setup and use the globals: vbase_decl_ptr, vbase_types
3003 expand_indirect_vtbls_init (binfo
, true_exp
, decl_ptr
)
3005 tree true_exp
, decl_ptr
;
3007 tree type
= BINFO_TYPE (binfo
);
3009 if (TYPE_USES_VIRTUAL_BASECLASSES (type
))
3011 rtx fixup_insns
= NULL_RTX
;
3012 tree vbases
= CLASSTYPE_VBASECLASSES (type
);
3013 vbase_types
= vbases
;
3014 vbase_decl_ptr
= true_exp
? build_unary_op (ADDR_EXPR
, true_exp
, 0) : decl_ptr
;
3016 dfs_walk (binfo
, dfs_find_vbases
, unmarked_new_vtablep
);
3018 /* Initialized with vtables of type TYPE. */
3019 for (; vbases
; vbases
= TREE_CHAIN (vbases
))
3023 addr
= convert_pointer_to_vbase (TREE_TYPE (vbases
), vbase_decl_ptr
);
3025 /* Do all vtables from this virtual base. */
3026 /* This assumes that virtual bases can never serve as parent
3027 binfos. (in the CLASSTPE_VFIELD_PARENT sense) */
3028 expand_direct_vtbls_init (vbases
, TYPE_BINFO (BINFO_TYPE (vbases
)),
3031 /* Now we adjust the offsets for virtual functions that
3032 cross virtual boundaries on an implicit upcast on vf call
3033 so that the layout of the most complete type is used,
3034 instead of assuming the layout of the virtual bases from
3035 our current type. */
3037 if (flag_vtable_thunks
)
3039 /* We don't have dynamic thunks yet!
3040 So for now, just fail silently. */
3044 tree vbase_offsets
= NULL_TREE
;
3045 push_to_sequence (fixup_insns
);
3046 fixup_virtual_upcast_offsets (vbases
,
3047 TYPE_BINFO (BINFO_TYPE (vbases
)),
3048 1, 0, addr
, vbase_decl_ptr
,
3049 type
, vbases
, &vbase_offsets
);
3050 fixup_insns
= get_insns ();
3057 extern tree in_charge_identifier
;
3058 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
3059 if (! in_charge_node
)
3061 warning ("recoverable internal compiler error, nobody's in charge!");
3062 in_charge_node
= integer_zero_node
;
3064 in_charge_node
= build_binary_op (EQ_EXPR
, in_charge_node
, integer_zero_node
, 1);
3065 expand_start_cond (in_charge_node
, 0);
3066 emit_insns (fixup_insns
);
3070 dfs_walk (binfo
, dfs_clear_vbase_slots
, marked_new_vtablep
);
3074 /* get virtual base class types.
3075 This adds type to the vbase_types list in reverse dfs order.
3076 Ordering is very important, so don't change it. */
3079 dfs_get_vbase_types (binfo
)
3082 if (TREE_VIA_VIRTUAL (binfo
) && ! BINFO_VBASE_MARKED (binfo
))
3084 vbase_types
= make_binfo (integer_zero_node
, binfo
,
3085 BINFO_VTABLE (binfo
),
3086 BINFO_VIRTUALS (binfo
), vbase_types
);
3087 TREE_VIA_VIRTUAL (vbase_types
) = 1;
3088 SET_BINFO_VBASE_MARKED (binfo
);
3090 SET_BINFO_MARKED (binfo
);
3093 /* get a list of virtual base classes in dfs order. */
3096 get_vbase_types (type
)
3102 if (TREE_CODE (type
) == TREE_VEC
)
3105 binfo
= TYPE_BINFO (type
);
3107 vbase_types
= NULL_TREE
;
3108 dfs_walk (binfo
, dfs_get_vbase_types
, unmarkedp
);
3109 dfs_walk (binfo
, dfs_unmark
, markedp
);
3110 /* Rely upon the reverse dfs ordering from dfs_get_vbase_types, and now
3111 reverse it so that we get normal dfs ordering. */
3112 vbase_types
= nreverse (vbase_types
);
3114 /* unmark marked vbases */
3115 for (vbases
= vbase_types
; vbases
; vbases
= TREE_CHAIN (vbases
))
3116 CLEAR_BINFO_VBASE_MARKED (vbases
);
3122 dfs_record_inheritance (binfo
)
3125 tree binfos
= BINFO_BASETYPES (binfo
);
3126 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
3127 mi_boolean
*derived_row
= BINFO_DERIVES_FROM_STAR (binfo
);
3129 for (i
= n_baselinks
-1; i
>= 0; i
--)
3132 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
3133 tree baseclass
= BINFO_TYPE (base_binfo
);
3134 mi_boolean
*base_row
= BINFO_DERIVES_FROM_STAR (base_binfo
);
3136 /* Don't search if there's nothing there! MI_SIZE can be
3137 zero as a result of parse errors. */
3138 if (TYPE_BINFO_BASETYPES (baseclass
) && mi_size
> 0)
3139 for (j
= mi_size
*(CLASSTYPE_CID (baseclass
)-1); j
>= 0; j
-= mi_size
)
3140 derived_row
[j
] |= base_row
[j
];
3141 TYPE_DERIVES_FROM (baseclass
, BINFO_TYPE (binfo
)) = 1;
3144 SET_BINFO_MARKED (binfo
);
3147 /* Given a _CLASSTYPE node in a multiple inheritance lattice,
3148 convert the lattice into a simple relation such that,
3149 given to CIDs, C1 and C2, one can determine if C1 <= C2
3150 or C2 <= C1 or C1 <> C2.
3152 Once constructed, we walk the lattice depth fisrt,
3153 applying various functions to elements as they are encountered.
3155 We use xmalloc here, in case we want to randomly free these tables. */
3157 #define SAVE_MI_MATRIX
3160 build_mi_matrix (type
)
3163 tree binfo
= TYPE_BINFO (type
);
3166 #ifdef SAVE_MI_MATRIX
3167 if (CLASSTYPE_MI_MATRIX (type
))
3169 mi_size
= CLASSTYPE_N_SUPERCLASSES (type
) + CLASSTYPE_N_VBASECLASSES (type
);
3170 mi_matrix
= CLASSTYPE_MI_MATRIX (type
);
3172 dfs_walk (binfo
, dfs_number
, unnumberedp
);
3177 dfs_walk (binfo
, dfs_number
, unnumberedp
);
3179 mi_size
= CLASSTYPE_N_SUPERCLASSES (type
) + CLASSTYPE_N_VBASECLASSES (type
);
3180 if (mi_size
< (cid
-1))
3182 mi_matrix
= (char *)xmalloc ((mi_size
+ 1) * (mi_size
+ 1));
3184 bzero (mi_matrix
, (mi_size
+ 1) * (mi_size
+ 1));
3185 dfs_walk (binfo
, dfs_record_inheritance
, unmarkedp
);
3186 dfs_walk (binfo
, dfs_unmark
, markedp
);
3192 dfs_walk (TYPE_BINFO (mi_type
), dfs_unnumber
, numberedp
);
3194 #ifdef SAVE_MI_MATRIX
3195 CLASSTYPE_MI_MATRIX (mi_type
) = mi_matrix
;
3203 /* If we want debug info for a type TYPE, make sure all its base types
3204 are also marked as being potentially interesting. This avoids
3205 the problem of not writing any debug info for intermediate basetypes
3206 that have abstract virtual functions. Also mark member types. */
3209 note_debug_info_needed (type
)
3214 if (current_template_parms
)
3217 /* We can't do the TYPE_DECL_SUPPRESS_DEBUG thing with DWARF, which
3218 does not support name references between translation units. Well, we
3219 could, but that would mean putting global labels in the debug output
3220 before each exported type and each of its functions and static data
3222 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
3225 dfs_walk (TYPE_BINFO (type
), dfs_debug_mark
, dfs_debug_unmarkedp
);
3226 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
3229 if (TREE_CODE (field
) == FIELD_DECL
3230 && IS_AGGR_TYPE (ttype
= target_type (TREE_TYPE (field
)))
3231 && dfs_debug_unmarkedp (TYPE_BINFO (ttype
)))
3232 note_debug_info_needed (ttype
);
3236 /* Subroutines of push_class_decls (). */
3238 /* Add in a decl to the envelope. */
3240 envelope_add_decl (type
, decl
, values
)
3241 tree type
, decl
, *values
;
3244 tree name
= DECL_NAME (decl
);
3247 /* virtual base names are always unique. */
3248 if (VBASE_NAME_P (name
))
3249 *values
= NULL_TREE
;
3251 /* Possible ambiguity. If its defining type(s)
3252 is (are all) derived from us, no problem. */
3253 else if (*values
&& TREE_CODE (*values
) != TREE_LIST
)
3255 tree value
= *values
;
3256 /* Only complain if we shadow something we can access. */
3257 if (warn_shadow
&& TREE_CODE (decl
) == FUNCTION_DECL
3258 && ((DECL_LANG_SPECIFIC (*values
)
3259 && DECL_CLASS_CONTEXT (value
) == current_class_type
)
3260 || ! TREE_PRIVATE (value
)))
3261 /* Should figure out access control more accurately. */
3263 cp_warning_at ("member `%#D' is shadowed", value
);
3264 cp_warning_at ("by member function `%#D'", decl
);
3265 warning ("in this context");
3268 context
= (TREE_CODE (value
) == FUNCTION_DECL
3269 && DECL_VIRTUAL_P (value
))
3270 ? DECL_CLASS_CONTEXT (value
)
3271 : DECL_CONTEXT (value
);
3273 if (context
== type
)
3275 if (TREE_CODE (value
) == TYPE_DECL
3276 && DECL_ARTIFICIAL (value
))
3277 *values
= NULL_TREE
;
3281 /* If we don't check CLASSTYPE_CID on CONTEXT right now, we'll end
3282 up subtracting from the address of MI_MATRIX, putting us off
3285 && CLASSTYPE_CID (context
)
3286 && TYPE_DERIVES_FROM (context
, type
))
3288 /* Don't add in *values to list */
3289 *values
= NULL_TREE
;
3292 *values
= build_tree_list (NULL_TREE
, value
);
3295 for (tmp
= values
; *tmp
;)
3297 tree value
= TREE_VALUE (*tmp
);
3298 my_friendly_assert (TREE_CODE (value
) != TREE_LIST
, 999);
3299 context
= (TREE_CODE (value
) == FUNCTION_DECL
3300 && DECL_VIRTUAL_P (value
))
3301 ? DECL_CLASS_CONTEXT (value
)
3302 : DECL_CONTEXT (value
);
3304 /* If we don't check CLASSTYPE_CID on CONTEXT right now, we'll end
3305 up subtracting from the address of MI_MATRIX, putting us off
3308 && CLASSTYPE_CID (context
)
3309 && TYPE_DERIVES_FROM (context
, type
))
3311 /* remove *tmp from list */
3312 *tmp
= TREE_CHAIN (*tmp
);
3315 tmp
= &TREE_CHAIN (*tmp
);
3320 /* Put the new contents in our envelope. */
3321 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3323 *values
= tree_cons (name
, decl
, *values
);
3324 TREE_NONLOCAL_FLAG (*values
) = 1;
3325 TREE_TYPE (*values
) = unknown_type_node
;
3331 *values
= tree_cons (NULL_TREE
, decl
, *values
);
3332 /* Mark this as a potentially ambiguous member. */
3333 /* Leaving TREE_TYPE blank is intentional.
3334 We cannot use `error_mark_node' (lookup_name)
3335 or `unknown_type_node' (all member functions use this). */
3336 TREE_NONLOCAL_FLAG (*values
) = 1;
3344 /* Add the instance variables which this class contributed to the
3345 current class binding contour. When a redefinition occurs, if the
3346 redefinition is strictly within a single inheritance path, we just
3347 overwrite the old declaration with the new. If the fields are not
3348 within a single inheritance path, we must cons them.
3350 In order to know what decls are new (stemming from the current
3351 invocation of push_class_decls) we enclose them in an "envelope",
3352 which is a TREE_LIST node where the TREE_PURPOSE slot contains the
3353 new decl (or possibly a list of competing ones), the TREE_VALUE slot
3354 points to the old value and the TREE_CHAIN slot chains together all
3355 envelopes which needs to be "opened" in push_class_decls. Opening an
3356 envelope means: push the old value onto the class_shadowed list,
3357 install the new one and if it's a TYPE_DECL do the same to the
3358 IDENTIFIER_TYPE_VALUE. Such an envelope is recognized by seeing that
3359 the TREE_PURPOSE slot is non-null, and that it is not an identifier.
3360 Because if it is, it could be a set of overloaded methods from an
3364 dfs_pushdecls (binfo
)
3367 tree type
= BINFO_TYPE (binfo
);
3368 tree fields
, *methods
, *end
;
3371 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
3373 /* Unmark so that if we are in a constructor, and then find that
3374 this field was initialized by a base initializer,
3375 we can emit an error message. */
3376 if (TREE_CODE (fields
) == FIELD_DECL
)
3377 TREE_USED (fields
) = 0;
3379 /* Recurse into anonymous unions. */
3380 if (DECL_NAME (fields
) == NULL_TREE
3381 && TREE_CODE (TREE_TYPE (fields
)) == UNION_TYPE
)
3383 dfs_pushdecls (TYPE_BINFO (TREE_TYPE (fields
)));
3387 if (DECL_NAME (fields
))
3389 tree name
= DECL_NAME (fields
);
3390 tree class_value
= IDENTIFIER_CLASS_VALUE (name
);
3392 /* If the class value is not an envelope of the kind described in
3393 the comment above, we create a new envelope. */
3394 if (class_value
== NULL_TREE
|| TREE_CODE (class_value
) != TREE_LIST
3395 || TREE_PURPOSE (class_value
) == NULL_TREE
3396 || TREE_CODE (TREE_PURPOSE (class_value
)) == IDENTIFIER_NODE
)
3398 /* See comment above for a description of envelopes. */
3399 closed_envelopes
= tree_cons (NULL_TREE
, class_value
,
3401 IDENTIFIER_CLASS_VALUE (name
) = closed_envelopes
;
3402 class_value
= IDENTIFIER_CLASS_VALUE (name
);
3405 envelope_add_decl (type
, fields
, &TREE_PURPOSE (class_value
));
3409 method_vec
= CLASSTYPE_METHOD_VEC (type
);
3412 /* Farm out constructors and destructors. */
3413 methods
= &TREE_VEC_ELT (method_vec
, 2);
3414 end
= TREE_VEC_END (method_vec
);
3416 while (methods
!= end
)
3418 /* This will cause lookup_name to return a pointer
3419 to the tree_list of possible methods of this name. */
3420 tree name
= DECL_NAME (*methods
);
3421 tree class_value
= IDENTIFIER_CLASS_VALUE (name
);
3423 /* If the class value is not an envelope of the kind described in
3424 the comment above, we create a new envelope. */
3425 if (class_value
== NULL_TREE
|| TREE_CODE (class_value
) != TREE_LIST
3426 || TREE_PURPOSE (class_value
) == NULL_TREE
3427 || TREE_CODE (TREE_PURPOSE (class_value
)) == IDENTIFIER_NODE
)
3429 /* See comment above for a description of envelopes. */
3430 closed_envelopes
= tree_cons (NULL_TREE
, class_value
,
3432 IDENTIFIER_CLASS_VALUE (name
) = closed_envelopes
;
3433 class_value
= IDENTIFIER_CLASS_VALUE (name
);
3436 /* Here we try to rule out possible ambiguities.
3437 If we can't do that, keep a TREE_LIST with possibly ambiguous
3439 maybe_push_cache_obstack ();
3440 envelope_add_decl (type
, *methods
, &TREE_PURPOSE (class_value
));
3446 SET_BINFO_MARKED (binfo
);
3449 /* Consolidate unique (by name) member functions. */
3452 dfs_compress_decls (binfo
)
3455 tree type
= BINFO_TYPE (binfo
);
3456 tree method_vec
= CLASSTYPE_METHOD_VEC (type
);
3458 if (method_vec
!= 0)
3460 /* Farm out constructors and destructors. */
3461 tree
*methods
= &TREE_VEC_ELT (method_vec
, 2);
3462 tree
*end
= TREE_VEC_END (method_vec
);
3464 for (; methods
!= end
; methods
++)
3466 /* This is known to be an envelope of the kind described before
3468 tree class_value
= IDENTIFIER_CLASS_VALUE (DECL_NAME (*methods
));
3469 tree tmp
= TREE_PURPOSE (class_value
);
3471 /* This was replaced in scope by somebody else. Just leave it
3473 if (TREE_CODE (tmp
) != TREE_LIST
)
3476 if (TREE_CHAIN (tmp
) == NULL_TREE
3478 && DECL_CHAIN (TREE_VALUE (tmp
)) == NULL_TREE
)
3480 TREE_PURPOSE (class_value
) = TREE_VALUE (tmp
);
3484 CLEAR_BINFO_MARKED (binfo
);
3487 /* When entering the scope of a class, we cache all of the
3488 fields that that class provides within its inheritance
3489 lattice. Where ambiguities result, we mark them
3490 with `error_mark_node' so that if they are encountered
3491 without explicit qualification, we can emit an error
3495 push_class_decls (type
)
3498 struct obstack
*ambient_obstack
= current_obstack
;
3499 search_stack
= push_search_level (search_stack
, &search_obstack
);
3501 /* Push class fields into CLASS_VALUE scope, and mark. */
3502 dfs_walk (TYPE_BINFO (type
), dfs_pushdecls
, unmarkedp
);
3504 /* Compress fields which have only a single entry
3505 by a given name, and unmark. */
3506 dfs_walk (TYPE_BINFO (type
), dfs_compress_decls
, markedp
);
3508 /* Open up all the closed envelopes and push the contained decls into
3510 while (closed_envelopes
)
3512 tree
new = TREE_PURPOSE (closed_envelopes
);
3515 /* This is messy because the class value may be a *_DECL, or a
3516 TREE_LIST of overloaded *_DECLs or even a TREE_LIST of ambiguous
3517 *_DECLs. The name is stored at different places in these three
3519 if (TREE_CODE (new) == TREE_LIST
)
3521 if (TREE_PURPOSE (new) != NULL_TREE
)
3522 id
= TREE_PURPOSE (new);
3525 tree node
= TREE_VALUE (new);
3527 if (TREE_CODE (node
) == TYPE_DECL
3528 && DECL_ARTIFICIAL (node
)
3529 && IS_AGGR_TYPE (TREE_TYPE (node
))
3530 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (node
)))
3532 tree t
= CLASSTYPE_TI_TEMPLATE (TREE_TYPE (node
));
3535 for (; n
; n
= TREE_CHAIN (n
))
3537 tree d
= TREE_VALUE (n
);
3538 if (TREE_CODE (d
) == TYPE_DECL
3539 && DECL_ARTIFICIAL (node
)
3540 && IS_AGGR_TYPE (TREE_TYPE (d
))
3541 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (d
))
3542 && CLASSTYPE_TI_TEMPLATE (TREE_TYPE (d
)) == t
)
3551 else while (TREE_CODE (node
) == TREE_LIST
)
3552 node
= TREE_VALUE (node
);
3553 id
= DECL_NAME (node
);
3557 id
= DECL_NAME (new);
3559 /* Install the original class value in order to make
3560 pushdecl_class_level work correctly. */
3561 IDENTIFIER_CLASS_VALUE (id
) = TREE_VALUE (closed_envelopes
);
3562 if (TREE_CODE (new) == TREE_LIST
)
3563 push_class_level_binding (id
, new);
3565 pushdecl_class_level (new);
3566 closed_envelopes
= TREE_CHAIN (closed_envelopes
);
3568 current_obstack
= ambient_obstack
;
3571 /* Here's a subroutine we need because C lacks lambdas. */
3574 dfs_unuse_fields (binfo
)
3577 tree type
= TREE_TYPE (binfo
);
3580 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
3582 if (TREE_CODE (fields
) != FIELD_DECL
)
3585 TREE_USED (fields
) = 0;
3586 if (DECL_NAME (fields
) == NULL_TREE
3587 && TREE_CODE (TREE_TYPE (fields
)) == UNION_TYPE
)
3588 unuse_fields (TREE_TYPE (fields
));
3596 dfs_walk (TYPE_BINFO (type
), dfs_unuse_fields
, unmarkedp
);
3602 /* We haven't pushed a search level when dealing with cached classes,
3603 so we'd better not try to pop it. */
3605 search_stack
= pop_search_level (search_stack
);
3609 print_search_statistics ()
3611 #ifdef GATHER_STATISTICS
3612 if (flag_memoize_lookups
)
3614 fprintf (stderr
, "%d memoized contexts saved\n",
3616 fprintf (stderr
, "%d local tree nodes made\n", my_tree_node_counter
);
3617 fprintf (stderr
, "%d local hash nodes made\n", my_memoized_entry_counter
);
3618 fprintf (stderr
, "fields statistics:\n");
3619 fprintf (stderr
, " memoized finds = %d; rejects = %d; (searches = %d)\n",
3620 memoized_fast_finds
[0], memoized_fast_rejects
[0],
3621 memoized_fields_searched
[0]);
3622 fprintf (stderr
, " memoized_adds = %d\n", memoized_adds
[0]);
3623 fprintf (stderr
, "fnfields statistics:\n");
3624 fprintf (stderr
, " memoized finds = %d; rejects = %d; (searches = %d)\n",
3625 memoized_fast_finds
[1], memoized_fast_rejects
[1],
3626 memoized_fields_searched
[1]);
3627 fprintf (stderr
, " memoized_adds = %d\n", memoized_adds
[1]);
3629 fprintf (stderr
, "%d fields searched in %d[%d] calls to lookup_field[_1]\n",
3630 n_fields_searched
, n_calls_lookup_field
, n_calls_lookup_field_1
);
3631 fprintf (stderr
, "%d fnfields searched in %d calls to lookup_fnfields\n",
3632 n_outer_fields_searched
, n_calls_lookup_fnfields
);
3633 fprintf (stderr
, "%d calls to get_base_type\n", n_calls_get_base_type
);
3634 #else /* GATHER_STATISTICS */
3635 fprintf (stderr
, "no search statistics\n");
3636 #endif /* GATHER_STATISTICS */
3640 init_search_processing ()
3642 gcc_obstack_init (&search_obstack
);
3643 gcc_obstack_init (&type_obstack
);
3644 gcc_obstack_init (&type_obstack_entries
);
3646 /* This gives us room to build our chains of basetypes,
3647 whether or not we decide to memoize them. */
3648 type_stack
= push_type_level ((struct stack_level
*)0, &type_obstack
);
3649 _vptr_name
= get_identifier ("_vptr");
3653 reinit_search_statistics ()
3655 my_memoized_entry_counter
= 0;
3656 memoized_fast_finds
[0] = 0;
3657 memoized_fast_finds
[1] = 0;
3658 memoized_adds
[0] = 0;
3659 memoized_adds
[1] = 0;
3660 memoized_fast_rejects
[0] = 0;
3661 memoized_fast_rejects
[1] = 0;
3662 memoized_fields_searched
[0] = 0;
3663 memoized_fields_searched
[1] = 0;
3664 #ifdef GATHER_STATISTICS
3665 n_fields_searched
= 0;
3666 n_calls_lookup_field
= 0, n_calls_lookup_field_1
= 0;
3667 n_calls_lookup_fnfields
= 0, n_calls_lookup_fnfields_1
= 0;
3668 n_calls_get_base_type
= 0;
3669 n_outer_fields_searched
= 0;
3670 n_contexts_saved
= 0;
3671 #endif /* GATHER_STATISTICS */
3674 static tree conversions
;
3676 add_conversions (binfo
)
3680 tree method_vec
= CLASSTYPE_METHOD_VEC (BINFO_TYPE (binfo
));
3682 for (i
= 2; i
< TREE_VEC_LENGTH (method_vec
); ++i
)
3684 tree tmp
= TREE_VEC_ELT (method_vec
, i
);
3685 if (! IDENTIFIER_TYPENAME_P (DECL_NAME (tmp
)))
3687 conversions
= tree_cons (binfo
, tmp
, conversions
);
3689 SET_BINFO_MARKED (binfo
);
3693 lookup_conversions (type
)
3696 conversions
= NULL_TREE
;
3697 if (TYPE_SIZE (type
))
3699 dfs_walk (TYPE_BINFO (type
), add_conversions
, unmarkedp
);
3700 dfs_walk (TYPE_BINFO (type
), dfs_unmark
, markedp
);
3705 /* Subroutine of get_template_base. */
3708 get_template_base_recursive (binfo
, rval
, template, via_virtual
)
3709 tree binfo
, template, rval
;
3714 tree type
= BINFO_TYPE (binfo
);
3716 if (CLASSTYPE_TEMPLATE_INFO (type
)
3717 && CLASSTYPE_TI_TEMPLATE (type
) == template)
3719 if (rval
== NULL_TREE
|| rval
== type
)
3722 return error_mark_node
;
3725 binfos
= BINFO_BASETYPES (binfo
);
3726 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
3728 /* Process base types. */
3729 for (i
= 0; i
< n_baselinks
; i
++)
3731 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
3733 /* Find any specific instance of a virtual base, when searching with
3735 if (BINFO_MARKED (base_binfo
) == 0)
3737 int this_virtual
= via_virtual
|| TREE_VIA_VIRTUAL (base_binfo
);
3739 /* When searching for a non-virtual, we cannot mark
3740 virtually found binfos. */
3742 SET_BINFO_MARKED (base_binfo
);
3744 rval
= get_template_base_recursive
3745 (base_binfo
, rval
, template, this_virtual
);
3746 if (rval
== error_mark_node
)
3754 /* Given a class template TEMPLATE and a class type or binfo node BINFO,
3755 find the unique base type in BINFO that is an instance of TEMPLATE.
3756 If there are more than one, return error_mark_node. Used by unify. */
3759 get_template_base (template, binfo
)
3760 register tree
template, binfo
;
3764 if (TREE_CODE (binfo
) == TREE_VEC
)
3765 type
= BINFO_TYPE (binfo
);
3766 else if (IS_AGGR_TYPE_CODE (TREE_CODE (binfo
)))
3768 type
= complete_type (binfo
);
3769 binfo
= TYPE_BINFO (type
);
3772 my_friendly_abort (92);
3774 if (CLASSTYPE_TEMPLATE_INFO (type
)
3775 && CLASSTYPE_TI_TEMPLATE (type
) == template)
3778 rval
= get_template_base_recursive (binfo
, NULL_TREE
, template, 0);
3779 dfs_walk (binfo
, dfs_unmark
, markedp
);