Skip to content

Initialised return_edge variable #31

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Nov 6, 2023
Merged

Initialised return_edge variable #31

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
eca6aba
Initialised return_edge variable
DanGiles Nov 6, 2023
4e5c8d3
Removed a typedef for idx_t and a define for SCOTCH_Idx;
DanGiles Nov 6, 2023
0b46b24
Removed typedef from metis/parmetis - only code chunk.
DanGiles Nov 6, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 0 additions & 1 deletion src/debug.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -41,7 +41,6 @@ void dumpCells(const char *prefix, int super, int active, int mpiactive,

#if defined(WITH_MPI) && (defined(HAVE_METIS) || defined(HAVE_PARMETIS)) \
&& !defined(HAVE_SCOTCH)
typedef int64_t idx_t;
#include <metis.h>
void dumpMETISGraph(const char *prefix, idx_t nvtxs, idx_t ncon, idx_t *xadj,
idx_t *adjncy, idx_t *vwgt, idx_t *vsize, idx_t *adjwgt);
Expand Down
4 changes: 1 addition & 3 deletions src/partition.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -54,8 +54,6 @@
/* SCOTCH headers only used when MPI is also available. */
#ifdef HAVE_SCOTCH
#include <scotch.h>
typedef int64_t idx_t;
#define IDX_T MPI_INT
#define idx_t SCOTCH_Idx
#define IDX_MAX SCOTCH_NUMMAX
SCOTCH_Arch the_archdat;
Expand Down Expand Up @@ -1601,7 +1599,7 @@ static void pick_scotch(int nodeID, struct space *s, int nregions,

int vertex_count = 0;
int neighbour;
int return_edge;
int return_edge = 0;
/* The bidirectional weights associated with an edge are averaged to ensure
that the resultant edges are symmetric. This is a neccessary for a Scotch
graph. */
Expand Down