https://gcc.gnu.org/bugzilla/show_bug.cgi?id=44912
janus at gcc dot gnu.org changed:
What|Removed |Added
Target Milestone|--- |4.6.0
--- Comment #9 from janus at gcc dot gnu dot org 2010-08-01 19:22 ---
Subject: Bug 44912
Author: janus
Date: Sun Aug 1 19:21:49 2010
New Revision: 162804
URL: http://gcc.gnu.org/viewcvs?root=gccview=revrev=162804
Log:
2010-08-01 Janus Weil ja...@gcc.gnu.org
PR
--- Comment #10 from janus at gcc dot gnu dot org 2010-08-01 19:24 ---
Fixed with r162804. Closing.
--
janus at gcc dot gnu dot org changed:
What|Removed |Added
--
janus at gcc dot gnu dot org changed:
What|Removed |Added
AssignedTo|unassigned at gcc dot gnu |janus at gcc dot gnu dot org
|dot org
--- Comment #3 from burnus at gcc dot gnu dot org 2010-07-30 07:02 ---
(In reply to comment #2)
it prints the following output:
ifc: ( 1.000, 0.000) ( 2.000, 0.000) (
3.000, 0.000)
ap
Segmentation fault
If one changes
--- Comment #4 from burnus at gcc dot gnu dot org 2010-07-30 15:29 ---
One observation: In case one does not have PRIVATE, one initializes seemingly
the global variable
__polynomial_MOD_vtab
while with PRIVATE and failing, one uses the variables vtab$polynomD which is
local in
--- Comment #5 from janus at gcc dot gnu dot org 2010-07-30 18:39 ---
(In reply to comment #4)
admittedly, I do not fully understand the code which sets
the TBP to the vtable - shouldn't this be done when the vtable for a type is
created rather than every time before it is used?
--- Comment #6 from janus at gcc dot gnu dot org 2010-07-30 18:46 ---
(In reply to comment #4)
One observation: In case one does not have PRIVATE, one initializes seemingly
the global variable
__polynomial_MOD_vtab
while with PRIVATE and failing, one uses the variables
--- Comment #7 from janus at gcc dot gnu dot org 2010-07-30 18:54 ---
(In reply to comment #6)
Good point. Actually the test case is fixed by making the vtab public:
Of course this does not fix the actual problem, but it limits the set of
affected cases (and I guess it's a good idea
--- Comment #8 from janus at gcc dot gnu dot org 2010-07-30 20:56 ---
(In reply to comment #7)
The test case still fails when adding an 'only' clause in the use statement:
use polynomial, only: polynom
This case can be fixed by the following patchlet:
Index: module.c
--- Comment #1 from janus at gcc dot gnu dot org 2010-07-29 19:36 ---
Here is a reduced/modified version of the code in comment #0, which also
exhibits a runtime segfault, although the code seems to be valid:
module polynomial
implicit none
private
type, public :: polynom
--- Comment #2 from burnus at gcc dot gnu dot org 2010-07-29 21:13 ---
(In reply to comment #1)
Here is a reduced/modified version of the code in comment #0, which also
exhibits a runtime segfault, although the code seems to be valid:
[...]
it prints the following output:
ifc: (
12 matches
Mail list logo
