diff options
| author | Nathan Sidwell <nathan@codesourcery.com> | 2004-07-26 08:23:58 +0000 |
|---|---|---|
| committer | Nathan Sidwell <nathan@codesourcery.com> | 2004-07-26 08:23:58 +0000 |
| commit | 36caa533f84422d9d856f2954608b0b1d239e980 (patch) | |
| tree | a52bd0b1bb36a9dba1bfbf17a55c904a10884e28 /gcc/cp/search.c | |
| parent | 064c9132f05b3638339281e001b1801c7272cbd9 (diff) | |
.:
* tree.h (BINFO_BASE_ACCESSES): Accesses are a VEC(tree).
(BINFO_BASE_ACCESS): Adjust.
(BINFO_BASE_ACCESS_APPEND): New.
(struct tree_binfo): Make base_accesses a VEC(tree) pointer.
* dbxout.c (dbxout_type): Adjust binfo access accessing.
* dwarf2out.c (gen_member_die): Likewise.
* tree-dump.c (deque_and_dump): Likewise.
cp:
* decl.c (xref_basetypes): Adjust base access vector creation.
* rtti.c (get_pseudo_ti_init, get_pseudo_ti_desc): Adjust base
access accesses.
* search.c (dynamic_cast_base_recurse, dfs_access_in_type): Likewise.
git-svn-id: https://gcc.gnu.org/svn/gcc/trunk@85187 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/cp/search.c')
| -rw-r--r-- | gcc/cp/search.c | 9 |
1 files changed, 5 insertions, 4 deletions
diff --git a/gcc/cp/search.c b/gcc/cp/search.c index 7841d1e5cec..a1270acdbfa 100644 --- a/gcc/cp/search.c +++ b/gcc/cp/search.c @@ -287,7 +287,7 @@ static int dynamic_cast_base_recurse (tree subtype, tree binfo, bool is_via_virtual, tree *offset_ptr) { - tree accesses; + VEC (tree) *accesses; tree base_binfo; int i; int worst = -2; @@ -306,7 +306,7 @@ dynamic_cast_base_recurse (tree subtype, tree binfo, bool is_via_virtual, accesses = BINFO_BASE_ACCESSES (binfo); for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) { - tree base_access = TREE_VEC_ELT (accesses, i); + tree base_access = VEC_index (tree, accesses, i); int rval; if (base_access != access_public_node) @@ -625,14 +625,15 @@ dfs_access_in_type (tree binfo, void *data) if (!access) { int i; - tree base_binfo, accesses; + tree base_binfo; + VEC (tree) *accesses; /* Otherwise, scan our baseclasses, and pick the most favorable access. */ accesses = BINFO_BASE_ACCESSES (binfo); for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) { - tree base_access = TREE_VEC_ELT (accesses, i); + tree base_access = VEC_index (tree, accesses, i); access_kind base_access_now = BINFO_ACCESS (base_binfo); if (base_access_now == ak_none || base_access_now == ak_private) |