#11754: Computation of rank-decompositions in Sage
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.8
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: David Coudert | Author: Nathann Cohen
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Comment(by dcoudert):
I added some printf to track the segfault. It occurs in the
calculate_level function for ss=1 and i=17. More precisely, the segfault
is with the instruction ''cslots[1 << i] = 0x0;''.
{{{
void calculate_level(uint_fast8_t ss)
{
uint_fast8_t i;
subset_size = ss;
if(subset_size == 0)
slots[0] = 0;
else if(subset_size == 1)
for(i = 0; i < num_vertices; i++)
{
printf("ss=%d, i=%d\n",ss,i);
slots[1 << i] = cut_rank(1 << i);
printf("after cut_rank\n");
cslots[1 << i] = 0x0;
printf("after cslots\n");
}
else
{
subset_t i;
const subset_t end = binomial_coefficient(num_vertices,
subset_size);
for(i = 0; i < end; i++)
fill_slot(i);
}
}
}}}
This is definitely a memory allocation problem.
D.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11754#comment:10>
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.
