This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/37721] Segmentation fault
- From: "ivranos at freemail dot gr" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 3 Oct 2008 09:09:03 -0000
- Subject: [Bug libstdc++/37721] Segmentation fault
- References: <bug-37721-15818@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #13 from ivranos at freemail dot gr 2008-10-03 09:09 -------
The prurpose of the code is to benchmark the sorting of a vector and of a list
with complex objects as their elements (SomeClass).
SomeClass itself doesn't make any other sense, its purpose is to be complex.
I think there is no source code bug on it, that accesses inaccessible memory.
Noone here spotted such a bug, noone in c.l.c++ spotted a bug too, since I had
posted the code there previously.
But in any case, I posted the code in a new thread with subject "Segmentation
fault".
If noone finds any source code bug, I will reopen the GCC bug report here.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=37721