#715: Parents probably not reclaimed due to too much caching
----------------------------+-----------------------------------------------
Reporter: robertwb | Owner: somebody
Type: defect | Status: needs_work
Priority: major | Milestone: sage-4.8
Component: coercion | Keywords: weak cache coercion
Work_issues: fix doctests | Upstream: N/A
Reviewer: | Author: Simon King
Merged: | Dependencies: #9138, #11900
----------------------------+-----------------------------------------------
Comment(by SimonKing):
The segfault does not occur while computing a hash. It occurs in line 468
of sage/matrix/matrix_rational_dense.pyx, namely
{{{
mpq_mul(y, w._entries[j], self._matrix[j][i])
}}}
I also tested, just before that line, that `w[j]` and
`self.get_unsafe(j,i)` (which accesses `w._entries[j]` and
`self._matrix[j],[i]`) works.
At this point, I am at my wits' end. To me, it looks like a change in the
way of comparing dictionary keys modifies internals of mpir (IIRC, this is
where mpq_mul is defined). gdb can not decipher the core file, and I don't
know how valgrind can be used.
What else?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/715#comment:49>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
