52 |
for (p = 0; p < mpiSize; ++p) |
for (p = 0; p < mpiSize; ++p) |
53 |
len = MAX(len, distribution[p + 1] - distribution[p]); |
len = MAX(len, distribution[p + 1] - distribution[p]); |
54 |
|
|
55 |
index_list = TMPMEMALLOC(myNumVertices, Dudley_IndexList); |
index_list = new Dudley_IndexList[myNumVertices]; |
56 |
newGlobalDOFID = TMPMEMALLOC(len, index_t); |
newGlobalDOFID = new index_t[len]; |
57 |
/* create the adjacency structure xadj and adjncy */ |
/* create the adjacency structure xadj and adjncy */ |
58 |
if (!(Dudley_checkPtr(index_list) || Dudley_checkPtr(newGlobalDOFID))) |
if (!(Dudley_checkPtr(index_list) || Dudley_checkPtr(newGlobalDOFID))) |
59 |
{ |
{ |
134 |
} |
} |
135 |
} |
} |
136 |
} |
} |
137 |
TMPMEMFREE(index_list); |
delete[] index_list; |
138 |
TMPMEMFREE(newGlobalDOFID); |
delete[] newGlobalDOFID; |
139 |
#if 0 |
#if 0 |
140 |
for (i = 0; i < in->Nodes->numNodes; ++i) |
for (i = 0; i < in->Nodes->numNodes; ++i) |
141 |
printf("%d ", in->Nodes->globalDegreesOfFreedom[i]); |
printf("%d ", in->Nodes->globalDegreesOfFreedom[i]); |