| 1 |
/* |
| 2 |
* Copyright(C) 1999-2020 National Technology & Engineering Solutions |
| 3 |
* of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with |
| 4 |
* NTESS, the U.S. Government retains certain rights in this software. |
| 5 |
* |
| 6 |
* See packages/seacas/LICENSE for details |
| 7 |
*/ |
| 8 |
|
| 9 |
#include "defs.h" |
| 10 |
#include "internal.h" |
| 11 |
#include "structs.h" |
| 12 |
#include <stdio.h> |
| 13 |
|
| 14 |
void check_internal(struct vtx_data **graph, /* graph data structure */ |
| 15 |
int nvtxs, /* number of vertices in graph */ |
| 16 |
struct bidint *int_list, /* sorted list of internal weights per set */ |
| 17 |
struct bidint *set_list, /* head of vtx_elems lists */ |
| 18 |
struct bidint *vtx_elems, /* start of vertex data */ |
| 19 |
int *total_vwgt, /* total weight in each set */ |
| 20 |
int *assign, /* current assignment */ |
| 21 |
int nsets_tot /* total number of sets */ |
| 22 |
) |
| 23 |
{ |
| 24 |
struct bidint *ptr, *ptr2; /* elements in int_list */ |
| 25 |
struct bidint *old_ptr, *old_ptr2; /* elements in set_list */ |
| 26 |
int vwgt_sum; /* sum of vertex weights */ |
| 27 |
int set, set2; /* sets two vertices are in */ |
| 28 |
int sum; /* sum of internal weights */ |
| 29 |
int nseen; /* number of vertices found in set_lists */ |
| 30 |
int old_val, val; /* consecutive values in int_list */ |
| 31 |
int vtx; /* vertex in set list */ |
| 32 |
int internal; /* is a vertex internal or not? */ |
| 33 |
int size; /* array spacing */ |
| 34 |
int j, k; /* loop counters */ |
| 35 |
|
| 36 |
k = 0; |
| 37 |
size = (int)(&(int_list[1]) - &(int_list[0])); |
| 38 |
nseen = 0; |
| 39 |
old_val = -1; |
| 40 |
old_ptr = &(int_list[nsets_tot]); |
| 41 |
for (ptr = int_list[nsets_tot].next; ptr != NULL; ptr = ptr->next) { |
| 42 |
set = ((int)(ptr - int_list)) / size; |
| 43 |
val = ptr->val; |
| 44 |
if (val < old_val) { |
| 45 |
printf("int_list out of order, k=%d, set = %d, old_val=%d, val = %d\n", k, set, old_val, val); |
| 46 |
} |
| 47 |
if (ptr->prev != old_ptr) { |
| 48 |
printf(" int_list back link screwed up, set=%d, k=%d, old_ptr=%lld, ptr->prev = %lld\n", set, |
| 49 |
k, (long long)old_ptr, (long long)ptr->prev); |
| 50 |
} |
| 51 |
old_ptr = ptr; |
| 52 |
old_val = val; |
| 53 |
|
| 54 |
vwgt_sum = 0; |
| 55 |
sum = 0; |
| 56 |
old_ptr2 = &(set_list[set]); |
| 57 |
for (ptr2 = set_list[set].next; ptr2 != NULL; ptr2 = ptr2->next) { |
| 58 |
vtx = ((int)(ptr2 - vtx_elems)) / size; |
| 59 |
vwgt_sum += graph[vtx]->vwgt; |
| 60 |
if (ptr2->prev != old_ptr2) { |
| 61 |
printf(" set_list back link screwed up, set=%d, k=%d, old_ptr2=%lld, ptr2->prev = %lld\n", |
| 62 |
set, k, (long long)old_ptr2, (long long)ptr2->prev); |
| 63 |
} |
| 64 |
old_ptr2 = ptr2; |
| 65 |
|
| 66 |
++nseen; |
| 67 |
if (assign[vtx] != set) { |
| 68 |
printf("assign[%d] = %d, but in set_list[%d]\n", vtx, assign[vtx], set); |
| 69 |
} |
| 70 |
internal = TRUE; |
| 71 |
for (j = 1; j < graph[vtx]->nedges && internal; j++) { |
| 72 |
set2 = assign[graph[vtx]->edges[j]]; |
| 73 |
internal = (set2 == set); |
| 74 |
} |
| 75 |
if (internal) { |
| 76 |
sum += graph[vtx]->vwgt; |
| 77 |
} |
| 78 |
} |
| 79 |
if (sum != val) { |
| 80 |
printf("set = %d, val = %d, but I compute internal = %d\n", set, val, sum); |
| 81 |
} |
| 82 |
if (vwgt_sum != total_vwgt[set]) { |
| 83 |
printf(" vwgt_sum = %d, but total_vwgt[%d] = %d\n", vwgt_sum, set, total_vwgt[set]); |
| 84 |
} |
| 85 |
k++; |
| 86 |
} |
| 87 |
if (k != nsets_tot) { |
| 88 |
printf(" Only %d sets in int_sets list, but nsets_tot = %d\n", k, nsets_tot); |
| 89 |
} |
| 90 |
if (nseen != nvtxs) { |
| 91 |
printf(" Only %d vertices found in int_sets lists, but nvtxs = %d\n", nseen, nvtxs); |
| 92 |
} |
| 93 |
} |