mirror of git://gcc.gnu.org/git/gcc.git
PR fortran 57893
2013-10-22 Paul Thomas <pault@gcc.gnu.org> PR fortran 57893 * class.c : Include target-memory.h. (gfc_find_intrinsic_vtab) Build a minimal expression so that gfc_element_size can be used to obtain the storage size, rather that the kind value. 2013-10-22 Paul Thomas <pault@gcc.gnu.org> PR fortran 57893 * gfortran.dg/unlimited_polymorphic_13.f90 : New test. From-SVN: r203915
This commit is contained in:
parent
8223bb7821
commit
cddf01232d
|
|
@ -1,3 +1,11 @@
|
||||||
|
2013-10-22 Paul Thomas <pault@gcc.gnu.org>
|
||||||
|
|
||||||
|
PR fortran 57893
|
||||||
|
* class.c : Include target-memory.h.
|
||||||
|
(gfc_find_intrinsic_vtab) Build a minimal expression so that
|
||||||
|
gfc_element_size can be used to obtain the storage size, rather
|
||||||
|
that the kind value.
|
||||||
|
|
||||||
2013-10-21 Tobias Burnus <burnus@net-b.de>
|
2013-10-21 Tobias Burnus <burnus@net-b.de>
|
||||||
|
|
||||||
PR fortran/58803
|
PR fortran/58803
|
||||||
|
|
|
||||||
|
|
@ -53,6 +53,7 @@ along with GCC; see the file COPYING3. If not see
|
||||||
#include "coretypes.h"
|
#include "coretypes.h"
|
||||||
#include "gfortran.h"
|
#include "gfortran.h"
|
||||||
#include "constructor.h"
|
#include "constructor.h"
|
||||||
|
#include "target-memory.h"
|
||||||
|
|
||||||
/* Inserts a derived type component reference in a data reference chain.
|
/* Inserts a derived type component reference in a data reference chain.
|
||||||
TS: base type of the ref chain so far, in which we will pick the component
|
TS: base type of the ref chain so far, in which we will pick the component
|
||||||
|
|
@ -2473,6 +2474,7 @@ gfc_find_intrinsic_vtab (gfc_typespec *ts)
|
||||||
int hash;
|
int hash;
|
||||||
gfc_namespace *sub_ns;
|
gfc_namespace *sub_ns;
|
||||||
gfc_namespace *contained;
|
gfc_namespace *contained;
|
||||||
|
gfc_expr *e;
|
||||||
|
|
||||||
gfc_get_symbol (name, ns, &vtype);
|
gfc_get_symbol (name, ns, &vtype);
|
||||||
if (!gfc_add_flavor (&vtype->attr, FL_DERIVED, NULL,
|
if (!gfc_add_flavor (&vtype->attr, FL_DERIVED, NULL,
|
||||||
|
|
@ -2498,12 +2500,16 @@ gfc_find_intrinsic_vtab (gfc_typespec *ts)
|
||||||
c->ts.type = BT_INTEGER;
|
c->ts.type = BT_INTEGER;
|
||||||
c->ts.kind = 4;
|
c->ts.kind = 4;
|
||||||
c->attr.access = ACCESS_PRIVATE;
|
c->attr.access = ACCESS_PRIVATE;
|
||||||
if (ts->type == BT_CHARACTER)
|
|
||||||
c->initializer = gfc_get_int_expr (gfc_default_integer_kind,
|
/* Build a minimal expression to make use of
|
||||||
NULL, charlen*ts->kind);
|
target-memory.c/gfc_element_size for 'size'. */
|
||||||
else
|
e = gfc_get_expr ();
|
||||||
c->initializer = gfc_get_int_expr (gfc_default_integer_kind,
|
e->ts = *ts;
|
||||||
NULL, ts->kind);
|
e->expr_type = EXPR_VARIABLE;
|
||||||
|
c->initializer = gfc_get_int_expr (gfc_default_integer_kind,
|
||||||
|
NULL,
|
||||||
|
(int)gfc_element_size (e));
|
||||||
|
gfc_free_expr (e);
|
||||||
|
|
||||||
/* Add component _extends. */
|
/* Add component _extends. */
|
||||||
if (!gfc_add_component (vtype, "_extends", &c))
|
if (!gfc_add_component (vtype, "_extends", &c))
|
||||||
|
|
|
||||||
|
|
@ -1,3 +1,8 @@
|
||||||
|
2013-10-22 Paul Thomas <pault@gcc.gnu.org>
|
||||||
|
|
||||||
|
PR fortran 57893
|
||||||
|
* gfortran.dg/unlimited_polymorphic_13.f90 : New test.
|
||||||
|
|
||||||
2013-10-21 Tobias Burnus <burnus@net-b.de>
|
2013-10-21 Tobias Burnus <burnus@net-b.de>
|
||||||
|
|
||||||
PR fortran/58803
|
PR fortran/58803
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,55 @@
|
||||||
|
! { dg-do run }
|
||||||
|
!
|
||||||
|
! PR fortran/58793
|
||||||
|
!
|
||||||
|
! Contributed by Vladimir Fuka
|
||||||
|
!
|
||||||
|
! Had the wrong value for the storage_size for complex
|
||||||
|
!
|
||||||
|
module m
|
||||||
|
use iso_fortran_env
|
||||||
|
implicit none
|
||||||
|
integer, parameter :: c1 = real_kinds(1)
|
||||||
|
integer, parameter :: c2 = real_kinds(2)
|
||||||
|
integer, parameter :: c3 = real_kinds(size(real_kinds)-1)
|
||||||
|
integer, parameter :: c4 = real_kinds(size(real_kinds))
|
||||||
|
contains
|
||||||
|
subroutine s(o, k)
|
||||||
|
class(*) :: o
|
||||||
|
integer :: k
|
||||||
|
integer :: sz
|
||||||
|
|
||||||
|
select case (k)
|
||||||
|
case (4)
|
||||||
|
sz = 32*2
|
||||||
|
case (8)
|
||||||
|
sz = 64*2
|
||||||
|
case (10,16)
|
||||||
|
sz = 128*2
|
||||||
|
case default
|
||||||
|
call abort()
|
||||||
|
end select
|
||||||
|
|
||||||
|
if (storage_size(o) /= sz) call abort()
|
||||||
|
select type (o)
|
||||||
|
type is (complex(c1))
|
||||||
|
if (storage_size(o) /= sz) call abort()
|
||||||
|
type is (complex(c2))
|
||||||
|
if (storage_size(o) /= sz) call abort()
|
||||||
|
end select
|
||||||
|
select type (o)
|
||||||
|
type is (complex(c3))
|
||||||
|
if (storage_size(o) /= sz) call abort()
|
||||||
|
type is (complex(c4))
|
||||||
|
if (storage_size(o) /= sz) call abort()
|
||||||
|
end select
|
||||||
|
end subroutine s
|
||||||
|
end module m
|
||||||
|
|
||||||
|
program p
|
||||||
|
use m
|
||||||
|
call s((1._c1, 2._c1), c1)
|
||||||
|
call s((1._c2, 2._c2), c2)
|
||||||
|
call s((1._c3, 2._c3), c3)
|
||||||
|
call s((1._c4, 2._c4), c4)
|
||||||
|
end program p
|
||||||
Loading…
Reference in New Issue