diff options
author | Jason Merrill <jason@redhat.com> | 2014-06-12 16:47:08 -0400 |
---|---|---|
committer | Jason Merrill <jason@gcc.gnu.org> | 2014-06-12 16:47:08 -0400 |
commit | 90d8493479eebfa2df08f6462f5972887a330138 (patch) | |
tree | fb6c67f9fd779411a8cc1494ddd0c7961d42676d /gcc/cp/decl.c | |
parent | 8fdcb6a997e7125d155b79947a1793f01611527b (diff) | |
download | gcc-90d8493479eebfa2df08f6462f5972887a330138.zip gcc-90d8493479eebfa2df08f6462f5972887a330138.tar.gz gcc-90d8493479eebfa2df08f6462f5972887a330138.tar.bz2 |
toplev.c (process_options): Reject -fabi-version=1.
gcc/
* toplev.c (process_options): Reject -fabi-version=1.
gcc/cp/
* call.c (build_operator_new_call): Remove -fabi-version=1 support.
* class.c (walk_subobject_offsets, include_empty_classes): Likewise.
(layout_nonempty_base_or_field, end_of_class): Likewise.
(layout_empty_base, build_base_field, layout_class_type): Likewise.
(is_empty_class, add_vcall_offset_vtbl_entries_1): Likewise.
(layout_virtual_bases): Likewise.
* decl.c (compute_array_index_type): Likewise.
* mangle.c (write_mangled_name, write_prefix): Likewise.
(write_template_prefix, write_integer_cst, write_expression): Likewise.
(write_template_arg, write_array_type): Likewise.
* method.c (lazily_declare_fn): Likewise.
* rtti.c (get_pseudo_ti_index): Likewise.
* typeck.c (comp_array_types): Likewise.
From-SVN: r211592
Diffstat (limited to 'gcc/cp/decl.c')
-rw-r--r-- | gcc/cp/decl.c | 24 |
1 files changed, 1 insertions, 23 deletions
diff --git a/gcc/cp/decl.c b/gcc/cp/decl.c index fba0cc9..c472ee5 100644 --- a/gcc/cp/decl.c +++ b/gcc/cp/decl.c @@ -8268,7 +8268,6 @@ compute_array_index_type (tree name, tree size, tsubst_flags_t complain) { tree itype; tree osize = size; - tree abi_1_itype = NULL_TREE; if (error_operand_p (size)) return error_mark_node; @@ -8305,9 +8304,6 @@ compute_array_index_type (tree name, tree size, tsubst_flags_t complain) if (size == error_mark_node) return error_mark_node; type = TREE_TYPE (size); - /* We didn't support this case in GCC 3.2, so don't bother - trying to model it now in ABI v1. */ - abi_1_itype = error_mark_node; } if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type)) @@ -8354,17 +8350,6 @@ compute_array_index_type (tree name, tree size, tsubst_flags_t complain) return itype; } - if (!abi_version_at_least (2) && processing_template_decl - && abi_1_itype == NULL_TREE) - /* For abi-1, we handled all instances in templates the same way, - even when they were non-dependent. This affects the manglings - produced. So, we do the normal checking for non-dependent - sizes, but at the end we'll return the same type that abi-1 - would have, but with TYPE_CANONICAL set to the "right" - value that the current ABI would provide. */ - abi_1_itype = build_index_type (build_min (MINUS_EXPR, sizetype, - osize, integer_one_node)); - /* Normally, the array-bound will be a constant. */ if (TREE_CODE (size) == INTEGER_CST) { @@ -8510,14 +8495,7 @@ compute_array_index_type (tree name, tree size, tsubst_flags_t complain) } /* Create and return the appropriate index type. */ - if (abi_1_itype && abi_1_itype != error_mark_node) - { - tree t = build_index_type (itype); - TYPE_CANONICAL (abi_1_itype) = TYPE_CANONICAL (t); - itype = abi_1_itype; - } - else - itype = build_index_type (itype); + itype = build_index_type (itype); /* If the index type were dependent, we would have returned early, so remember that it isn't. */ |