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.
93 lines
3.0 KiB
93 lines
3.0 KiB
/*
|
|
* Copyright(C) 1999-2020, 2023 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_edata
|
|
#include "structs.h"
|
|
#include <stdio.h> // for NULL
|
|
|
|
void update_cube_edata(int vertex, /* graph vertex being worked on */
|
|
int dim, /* mesh dimension to be adjusted */
|
|
struct refine_edata *edata, /* data structure for edge preferences */
|
|
struct refine_vdata *vdata, /* data structure for vertex preferences */
|
|
struct vtx_data **comm_graph, /* communication graph */
|
|
int *node2vtx, /* maps processors to comm_graph vtxs */
|
|
int *vtx2node, /* maps comm_graph vtxs to processors */
|
|
int nsets_tot, /* total number of processors */
|
|
double *best_desire, /* best desire seen */
|
|
int imax, /* offset in desire_ptr array */
|
|
struct refine_edata **desire_ptr /* buckets for desire values */
|
|
)
|
|
{
|
|
struct refine_edata *eguy; /* data for desired edge */
|
|
float old_desire; /* original desire for edge to flip */
|
|
float new_desire; /* new desire for edge to flip */
|
|
int node; /* node number of vertex */
|
|
int k; /* index into desire_ptr array */
|
|
|
|
node = vtx2node[vertex];
|
|
eguy = find_edge_cube(node, dim, edata, nsets_tot);
|
|
|
|
old_desire = eguy->swap_desire;
|
|
new_desire = compute_cube_edata(eguy, vdata, nsets_tot, comm_graph, node2vtx);
|
|
|
|
if (new_desire != old_desire) { /* Update linked list if necessary. */
|
|
eguy->swap_desire = new_desire;
|
|
if (new_desire > *best_desire) {
|
|
*best_desire = new_desire;
|
|
}
|
|
|
|
/* Remove eguy from it's current place in list. */
|
|
if (eguy->prev == NULL) {
|
|
/* Round up for index into desire_ptr. */
|
|
if (old_desire >= 0) {
|
|
k = old_desire;
|
|
if (k != old_desire) {
|
|
k++;
|
|
}
|
|
}
|
|
else {
|
|
k = -old_desire;
|
|
if (k != -old_desire) {
|
|
k++;
|
|
}
|
|
k = -k;
|
|
}
|
|
k += imax;
|
|
desire_ptr[k] = eguy->next;
|
|
}
|
|
else {
|
|
eguy->prev->next = eguy->next;
|
|
}
|
|
if (eguy->next != NULL) {
|
|
eguy->next->prev = eguy->prev;
|
|
}
|
|
|
|
/* Now add eguy to it's new desire bucket. */
|
|
if (new_desire >= 0) {
|
|
k = new_desire;
|
|
if (k != new_desire) {
|
|
k++;
|
|
}
|
|
}
|
|
else {
|
|
k = -new_desire;
|
|
if (k != -new_desire) {
|
|
k++;
|
|
}
|
|
k = -k;
|
|
}
|
|
k += imax;
|
|
|
|
eguy->prev = NULL;
|
|
eguy->next = desire_ptr[k];
|
|
if (desire_ptr[k] != NULL) {
|
|
desire_ptr[k]->prev = eguy;
|
|
}
|
|
desire_ptr[k] = eguy;
|
|
}
|
|
}
|
|
|