You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
46 lines
1.6 KiB
46 lines
1.6 KiB
/*
|
|
* Copyright(C) 1999-2020 National Technology & Engineering Solutions
|
|
* of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with
|
|
* NTESS, the U.S. Government retains certain rights in this software.
|
|
*
|
|
* See packages/seacas/LICENSE for details
|
|
*/
|
|
|
|
#include "refine_map.h" // for refine_vdata
|
|
#include "structs.h" // for vtx_data
|
|
|
|
void compute_cube_vdata(struct refine_vdata *vdata, /* preference data for a vertex */
|
|
struct vtx_data ** comm_graph, /* communication graph data structure */
|
|
int vtx, /* current vertex */
|
|
int mask, /* bit set in current hypercube dimension */
|
|
int * vtx2node /* maps graph vtxs to mesh nodes */
|
|
)
|
|
{
|
|
float same; /* my preference to stay where I am */
|
|
float change; /* my preference to change this bit */
|
|
float ewgt; /* weight of an edge */
|
|
int neighbor; /* neighboring vtx in comm_graph */
|
|
int my_side; /* which side of hypercube I'm on */
|
|
int neighb_side; /* which side of hypercube neighbor's on */
|
|
int j; /* loop counter */
|
|
|
|
my_side = (vtx2node[vtx] & mask);
|
|
|
|
change = 0;
|
|
same = 0;
|
|
for (j = 1; j < comm_graph[vtx]->nedges; j++) {
|
|
neighbor = comm_graph[vtx]->edges[j];
|
|
ewgt = comm_graph[vtx]->ewgts[j];
|
|
|
|
neighb_side = (vtx2node[neighbor] & mask);
|
|
|
|
if (neighb_side != my_side) {
|
|
change += ewgt;
|
|
}
|
|
else {
|
|
same += ewgt;
|
|
}
|
|
}
|
|
vdata->same = same;
|
|
vdata->above = change;
|
|
}
|
|
|