Skip to content
Snippets Groups Projects
Commit eea556f9 authored by Jonathan Lambrechts's avatar Jonathan Lambrechts
Browse files

fix segfault in p2 prism closures generation

parent 95eaa84c
No related branches found
No related tags found
No related merge requests found
...@@ -1139,6 +1139,8 @@ static void addEdgeNodes(polynomialBasis::clCont &closureFull, const int *edges, ...@@ -1139,6 +1139,8 @@ static void addEdgeNodes(polynomialBasis::clCont &closureFull, const int *edges,
for (unsigned int iClosure = 0; iClosure < closureFull.size(); iClosure++) { for (unsigned int iClosure = 0; iClosure < closureFull.size(); iClosure++) {
std::vector<int> &cl = closureFull[iClosure]; std::vector<int> &cl = closureFull[iClosure];
for (int iEdge = 0; edges[iEdge] >= 0; iEdge += 2) { for (int iEdge = 0; edges[iEdge] >= 0; iEdge += 2) {
if (cl.empty())
continue;
int n0 = cl[edges[iEdge]]; int n0 = cl[edges[iEdge]];
int n1 = cl[edges[iEdge + 1]]; int n1 = cl[edges[iEdge + 1]];
int oEdge = nodes2edges[n0][n1]; int oEdge = nodes2edges[n0][n1];
...@@ -1485,6 +1487,8 @@ static void generateFaceClosurePrismFull(polynomialBasis::clCont &closureFull, ...@@ -1485,6 +1487,8 @@ static void generateFaceClosurePrismFull(polynomialBasis::clCont &closureFull,
nodeSum2Face[nodeSum] = iFace; nodeSum2Face[nodeSum] = iFace;
} }
for (unsigned int i = 0; i < closureFull.size(); i++ ) { for (unsigned int i = 0; i < closureFull.size(); i++ ) {
if (closureFull[i].empty())
continue;
for (int iFace = 0; iFace < numFaces; iFace++ ) { for (int iFace = 0; iFace < numFaces; iFace++ ) {
int nodeSum = 0; int nodeSum = 0;
for (int iNode = 0; iNode < numFaceNodes; iNode++) for (int iNode = 0; iNode < numFaceNodes; iNode++)
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment