fdurastante/amg4psblas
1
0
Fork 0
mirror of https://github.com/sfilippone/amg4psblas.git synced 2026-10-06 14:44:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

PROCESS_CROSS_EDGE refactoring

Browse Source
This commit is contained in:
StefanoPetrilli
2022-07-17 12:03:48 -05:00
parent 4f07a70ed1
commit a71fe82752
6 changed files with 10 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files
amgprec/impl/aggregator/MatchBoxPC.h
+1 -2
View File
@@ -287,8 +287,7 @@ extern "C"
staticQueue &privateQMsgType,
staticQueue &privateQOwner);
void PROCESS_CROSS_EDGE(vector<MilanLongInt> &Counter,
MilanLongInt edge,
void PROCESS_CROSS_EDGE(MilanLongInt *edge,
MilanLongInt *SPtr);
void processMatchedVertices(
amgprec/impl/aggregator/algoDistEdgeApproxDomEdgesLinearSearchMesgBndlSmallMateCMP.cpp
+1 -1
View File
@@ -456,7 +456,7 @@ void dalgoDistEdgeApproxDomEdgesLinearSearchMesgBndlSmallMateCMP(
fflush(stdout);
#endif
PROCESS_CROSS_EDGE(Counter, Ghost2LocalMap[w], &S);
PROCESS_CROSS_EDGE(&Counter[Ghost2LocalMap[w]], &S);
} // End of if CandidateMate[w] = v
} // End of if a Ghost Vertex
amgprec/impl/aggregator/processCrossEdge.cpp
+2 -3
View File
@@ -1,14 +1,13 @@
#include "MatchBoxPC.h"
void PROCESS_CROSS_EDGE(vector<MilanLongInt> &Counter,
MilanLongInt edge,
void PROCESS_CROSS_EDGE(MilanLongInt *edge,
MilanLongInt *SPtr)
{
// Start: PARALLEL_PROCESS_CROSS_EDGE_B
MilanLongInt captureCounter;
#pragma omp atomic capture
captureCounter = --Counter[edge]; // Decrement
captureCounter = --(*edge); // Decrement
//assert(captureCounter >= 0);
amgprec/impl/aggregator/processExposedVertex.cpp
+1 -1
View File
@@ -115,7 +115,7 @@ void PARALLEL_PROCESS_EXPOSED_VERTEX_B(MilanLongInt NLVer,
//TODO refactor this!!
// Decrement the counter:
PROCESS_CROSS_EDGE(Counter, Ghost2LocalMap[w], &S);
PROCESS_CROSS_EDGE(&Counter[Ghost2LocalMap[w]], &S);
} // End of if CandidateMate[w] = v
} // End of if a Ghost Vertex
amgprec/impl/aggregator/processMatchedVertices.cpp
+1 -1
View File
@@ -183,7 +183,7 @@ void processMatchedVertices(
fflush(stdout);
#endif
// Decrement the counter:
PROCESS_CROSS_EDGE(Counter, Ghost2LocalMap[w], SPtr);
PROCESS_CROSS_EDGE(&Counter[Ghost2LocalMap[w]], SPtr);
case 2:
// Found a dominating edge, it is a ghost
ghostOwner = findOwnerOfGhost(w, verDistance, myRank, numProcs);
amgprec/impl/aggregator/processMessages.cpp
+4 -4
View File
@@ -194,7 +194,7 @@ void processMessages(
fflush(stdout);
#endif
PROCESS_CROSS_EDGE(Counter, Ghost2LocalMap[u], S);
PROCESS_CROSS_EDGE(&Counter[Ghost2LocalMap[u]], S);
} // End of if ( candidateMate[v-StartIndex] == u )e
} // End of if ( Mate[v] == -1 )
} // End of REQUEST
@@ -207,7 +207,7 @@ void processMessages(
fflush(stdout);
#endif
GMate[Ghost2LocalMap[u]] = EndIndex + 1; // Set a Dummy Mate to make sure that we do not (u is a ghost) process it again
PROCESS_CROSS_EDGE(Counter, Ghost2LocalMap[u], S);
PROCESS_CROSS_EDGE(&Counter[Ghost2LocalMap[u]], S);
#ifdef DEBUG_GHOST_
if ((v < 0) || (v < StartIndex) || ((v - StartIndex) > NLVer))
{
@@ -260,7 +260,7 @@ void processMessages(
fflush(stdout);
#endif
PROCESS_CROSS_EDGE(Counter, Ghost2LocalMap[w], S);
PROCESS_CROSS_EDGE(&Counter[Ghost2LocalMap[w]], S);
} // End of if CandidateMate[w] = v
} // End of if a Ghost Vertex
else
@@ -319,7 +319,7 @@ void processMessages(
fflush(stdout);
#endif
GMate[Ghost2LocalMap[u]] = EndIndex + 1; // Set a Dummy Mate to make sure that we do not (u is a ghost) process this anymore
PROCESS_CROSS_EDGE(Counter, Ghost2LocalMap[u], S); // Decrease the counter
PROCESS_CROSS_EDGE(&Counter[Ghost2LocalMap[u]], S); // Decrease the counter
} // End of else: CASE III
} // End of else: CASE I
}