lib
/
EXODUS
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
Cloned SEACAS for EXODUS library with extra build files for internal package management.
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.
6 Commits
1 Branch
0 Tags
19 MiB
 
 
 
 
 
 
Tag: Branch: Tree: main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'main'
${ noResults }
EXODUS/packages/zoltan/src/reftree/reftree_build.c

3491 lines
128 KiB
Raw Permalink Blame History

/*
* @HEADER
*
* ***********************************************************************
*
* Zoltan Toolkit for Load-balancing, Partitioning, Ordering and Coloring
* Copyright 2012 Sandia Corporation
*
* THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Questions? Contact Karen Devine kddevin@sandia.gov
* Erik Boman egboman@sandia.gov
*
* ***********************************************************************
*
* @HEADER
*/
#ifdef __cplusplus
/* if C++, define the rest of this header file as extern C */
extern "C" {
#endif
#include <stdio.h>
#include "zz_const.h"
#include "reftree.h"
#include "params_const.h"
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
/* Prototypes for functions internal to this file */
static void Zoltan_Reftree_Free_Subtree(ZZ *zz, ZOLTAN_REFTREE *subroot);
static int order_tri_bisect(ZZ *zz, int *vert1, int *order,
ZOLTAN_ID_PTR vertices, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex, ZOLTAN_REFTREE *subroot);
static int order_quad_quad(ZZ *zz, int *vert1, int *order,
ZOLTAN_ID_PTR vertices, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex, ZOLTAN_REFTREE *subroot);
static int order_hex3d_oct(ZZ *zz, int *vert1, int *order,
ZOLTAN_ID_PTR vertices, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex, ZOLTAN_REFTREE *subroot);
static int hex_nshared(int elem1, int elem2, int *lvertices, int *vert1);
static int order_other_ref(ZZ *zz, ZOLTAN_REFTREE *parent, int num_child,
int *num_vert, int *vert1, ZOLTAN_ID_PTR vertices,
int *order, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex);
static void order_other_ref_recur(int new_entry, int level, int *order,
int *on_path,
int num_child, int *has_out, int **share_vert,
int max_share, int *solved);
static int find_inout(ZZ *zz,int level,int num_child,int *num_vert,int *vert1,
ZOLTAN_ID_PTR vertices, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex, int *order);
static int Zoltan_Reftree_Reinit_Coarse(ZZ *zz);
static int Zoltan_Reftree_Build_Recursive(ZZ *zz,ZOLTAN_REFTREE *subroot);
static int alloc_reftree_nodes(ZZ *zz, ZOLTAN_REFTREE **node, int num_node,
int *num_vert);
static void free_reftree_nodes(ZOLTAN_REFTREE **node);
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
/* Variables that are global to this file */
static ZOLTAN_ID_PTR slocal_gids; /* coarse element Global IDs from user */
static ZOLTAN_ID_PTR slocal_lids; /* coarse element Local IDs from user */
static int *sassigned; /* 1 if the element is assigned to this proc */
static int *snum_vert; /* number of vertices for each coarse element */
static ZOLTAN_ID_PTR svertices; /* vertices for the coarse elements */
static ZOLTAN_ID_PTR sin_vertex; /* "in" vertex for each coarse element */
static ZOLTAN_ID_PTR sout_vertex; /* "out" vertex for each coarse element */
static int *svert1; /* array containing the first vertex for each child*/
static int *sorder; /* order of the children */
static int ssize;
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
/* Parameters structure for reftree methods */
static PARAM_VARS REFTREE_params[] = {
{ "REFTREE_INITPATH", NULL, "STRING", 0 },
{ "REFTREE_HASH_SIZE", NULL, "INT", 0 },
{ NULL, NULL, NULL, 0 } };
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
int Zoltan_Reftree_Set_Param(
char *name, /* name of variable */
char *val) /* value of variable */
{
int status, i;
PARAM_UTYPE result; /* value returned from Check_Param */
int index; /* index returned from Check_Param */
char *valid_methods[] = { /* methods for initial path */
"CONNECTED", "HILBERT", "SIERPINSKI", "REFTREE_DEFAULT", NULL };
status = Zoltan_Check_Param(name, val, REFTREE_params, &result, &index);
if (status == ZOLTAN_OK) {
if (strcmp(name, "REFTREE_INITPATH") == 0) {
status = ZOLTAN_FATAL;
for (i=0; valid_methods[i] != NULL; i++) {
if (strcmp(val, valid_methods[i]) == 0){
status = ZOLTAN_OK;
break;
}
}
}
}
return(status);
}
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
int Zoltan_Reftree_Init(ZZ *zz)
{
/*
* Function to initialize a refinement tree. This creates the root and
* the first level of the tree, which corresponds to the initial coarse grid
*/
char *yo = "Zoltan_Reftree_Init";
char msg[256];
struct Zoltan_Reftree_data_struct *reftree_data = NULL; /* data pointed to by zz */
ZOLTAN_REFTREE *root; /* Root of the refinement tree */
struct Zoltan_Reftree_hash_node **hashtab = NULL; /* hash table */
int nproc; /* number of processors */
ZOLTAN_ID_PTR local_gids = NULL; /* coarse element Global IDs from user */
ZOLTAN_ID_PTR full_gid = NULL; /* local_gids for the full coarse grid */
ZOLTAN_ID_PTR local_lids = NULL; /* coarse element Local IDs from user */
ZOLTAN_ID_PTR full_lid = NULL; /* local_lids for the full coarse grid */
ZOLTAN_ID_PTR lid, prev_lid; /* temporary coarse element Local ID; used to pass
NULL to query functions when NUM_LID_ENTRIES=0 */
int *assigned = NULL; /* 1 if the element is assigned to this proc */
int *full_assigned = NULL; /* assigned for the full coarse grid */
int *full_known = NULL; /* 1 if the element is known to this proc */
int *num_vert = NULL; /* number of vertices for each coarse element */
int *full_num_vert = NULL; /* num_vert for the full coarse grid */
double *coords = NULL; /* coordinates of each coarse element */
double *full_coords = NULL; /* coords for the full coarse grid */
int *reorder_nvert = NULL; /* num_vert reordered by permutation "order" */
int root_vert[1]; /* fake number of vertices for the root */
ZOLTAN_ID_PTR vertices = NULL; /* vertices for the coarse elements */
ZOLTAN_ID_PTR full_vertices = NULL; /* vertices for the full coarse grid */
ZOLTAN_ID_PTR in_vertex = NULL; /* "in" vertex for each coarse element */
ZOLTAN_ID_PTR full_in_vertex = NULL; /* in_vertex for the full coarse grid */
ZOLTAN_ID_PTR out_vertex = NULL; /* "out" vertex for each coarse element */
ZOLTAN_ID_PTR full_out_vertex = NULL; /* out_vertex for the full coarse grid */
ZOLTAN_ID_PTR send_id = NULL; /* to send message to other procs */
ZOLTAN_ID_PTR recv_id = NULL; /* to receive message from othr procs */
int *send_int = NULL; /* to send message to other procs */
double *send_double = NULL;/* to send message to other procs */
int *recv_size_all = NULL; /* size of message from each processor */
int recv_size; /* total size of a received message */
int in_order; /* 1 if user is supplying order of the elements */
int in_order_temp; /* holds in_order from other proc while checking */
int *in_order_all = NULL; /* in_order from each processor */
int num_obj; /* number of coarse objects known to this proc */
int *num_obj_all = NULL; /* num_obj from each processor */
int num_assigned_obj; /* number of coarse objects assigned to this proc */
int *num_ass_all = NULL; /* num_assigned_obj from each processor */
int total_num_obj; /* number of objects in the whole coarse grid */
int *displs = NULL; /* displacements for start of each proc in message */
int sum_assigned_vert; /* sum of # of verts in objs assigned to this proc */
int *sum_ass_vert_all = NULL; /* sum_assigned_vert from each processor */
int total_sum_vert; /* sum of sum_ass_vert_all */
int ierr; /* error flag from calls */
int final_ierr; /* error flag returned by this routine */
int wdim; /* dimension of object weights */
int count; /* counter for number of objects */
int vcount; /* counter for number of vertices */
int sum_vert; /* summation of number of vertices of objects */
int *order = NULL; /* permutation array for ordering coarse elements */
int found; /* flag for terminating first/next query loop */
int hashsize; /* size of the hash table */
char *initpath_method; /* method for path in initial grid */
int i, j; /* loop counters */
int ngid_ent = zz->Num_GID; /* number of array entries in a global ID */
int nlid_ent = zz->Num_LID; /* number of array entries in a local ID */
int num_geom = 0; /* number of dimensions in the geometry */
ZOLTAN_TRACE_ENTER(zz, yo);
ssize = 0;
final_ierr = ZOLTAN_OK;
if (zz->Obj_Weight_Dim == 0) {
wdim = 1;
} else {
wdim = zz->Obj_Weight_Dim;
}
nproc = zz->Num_Proc;
/*
* Allocate the root of the refinement tree for this Zoltan structure.
* If a tree already exists, destroy it first.
*/
if (zz->LB.Data_Structure != NULL) Zoltan_Reftree_Free_Structure(zz);
root_vert[0] = 1;
ierr = alloc_reftree_nodes(zz, &root, 1, root_vert);
if (ierr == ZOLTAN_MEMERR) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Error returned by alloc_reftree_nodes.");
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
/*
* Initialize the root
*/
root->children = (ZOLTAN_REFTREE *) NULL;
root->num_child = 0;
root->num_vertex = 0;
root->assigned_to_me = 0;
root->known_to_me = 1;
root->partition = 0;
for (i=0; i<wdim; i++) {
root->weight[i] = 0.0;
root->summed_weight[i] = 0.0;
root->my_sum_weight[i] = 0.0;
}
/*
* Bind parameters, set default values, and set user values.
*/
initpath_method = (char *)ZOLTAN_MALLOC(sizeof(char)*(MAX_PARAM_STRING_LEN));
Zoltan_Bind_Param(REFTREE_params, "REFTREE_INITPATH", (void *) initpath_method);
strcpy(initpath_method, DEFAULT_INITPATH);
Zoltan_Bind_Param(REFTREE_params, "REFTREE_HASH_SIZE", (void *) &hashsize);
hashsize = DEFAULT_HASH_TABLE_SIZE;
Zoltan_Assign_Param_Vals(zz->Params, REFTREE_params, zz->Debug_Level, zz->Proc,
zz->Debug_Proc);
/*
* Allocate and initialize the hash table.
*/
hashtab = (struct Zoltan_Reftree_hash_node **)
ZOLTAN_MALLOC(sizeof(struct Zoltan_Reftree_hash_node *)*hashsize);
if (hashtab == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
for (i=0; i<hashsize; i++)
hashtab[i] = (struct Zoltan_Reftree_hash_node *)NULL;
/*
* set the zz pointer for later access to the refinement tree and hash table
*/
reftree_data = (struct Zoltan_Reftree_data_struct *)
ZOLTAN_MALLOC(sizeof(struct Zoltan_Reftree_data_struct));
reftree_data->reftree_root = root;
reftree_data->hash_table = hashtab;
reftree_data->hash_table_size = hashsize;
zz->LB.Data_Structure = (void *) reftree_data;
/*
* Get the list of initial elements known to this processor
*/
/*
* Get the number of objects
*/
if (zz->Get_Num_Coarse_Obj == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Must register ZOLTAN_NUM_COARSE_OBJ_FN.");
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_FATAL);
}
num_obj = zz->Get_Num_Coarse_Obj(zz->Get_Num_Coarse_Obj_Data, &ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Num_Coarse_Obj.");
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
sum_vert = 0;
/*
* Get the objects, if the number is not 0
*/
if (num_obj > 0) {
num_obj += 1; /* allocate one extra spot for the last call to NEXT_OBJ */
local_gids = ZOLTAN_MALLOC_GID_ARRAY(zz, num_obj);
local_lids = ZOLTAN_MALLOC_LID_ARRAY(zz, num_obj);
assigned = (int *) ZOLTAN_MALLOC(num_obj*sizeof(int));
num_vert = (int *) ZOLTAN_MALLOC(num_obj*sizeof(int));
vertices = ZOLTAN_MALLOC_GID_ARRAY(zz,MAXVERT*num_obj);
in_vertex = ZOLTAN_MALLOC_GID_ARRAY(zz,num_obj);
out_vertex = ZOLTAN_MALLOC_GID_ARRAY(zz,num_obj);
num_obj -= 1;
if (local_gids == NULL || (nlid_ent > 0 && local_lids == NULL) ||
assigned == NULL ||
num_vert == NULL || vertices == NULL || in_vertex == NULL ||
out_vertex == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 8, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
if (zz->Get_Coarse_Obj_List != NULL) {
/*
* Get objects via list
*/
zz->Get_Coarse_Obj_List(zz->Get_Coarse_Obj_List_Data,
ngid_ent, nlid_ent,
local_gids, local_lids,
assigned, num_vert, vertices,
&in_order, in_vertex, out_vertex, &ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Coarse_Obj_List.");
Zoltan_Multifree(__FILE__, __LINE__, 8, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
for (i=0; i<num_obj; i++) {
sum_vert += num_vert[i];
}
}
else if (zz->Get_First_Coarse_Obj != NULL &&
zz->Get_Next_Coarse_Obj != NULL) {
/*
* Get objects via first/next
*/
count = 0;
lid = (nlid_ent ? &(local_lids[count*nlid_ent]) : NULL);
found = zz->Get_First_Coarse_Obj(zz->Get_First_Coarse_Obj_Data,
ngid_ent, nlid_ent,
&local_gids[count*ngid_ent],
lid,
&assigned[count],
&num_vert[count],
&vertices[sum_vert*ngid_ent],
&in_order,
&in_vertex[count*ngid_ent],
&out_vertex[count*ngid_ent],
&ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_First_Coarse_Obj.");
Zoltan_Multifree(__FILE__, __LINE__, 8, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
if (found) sum_vert += num_vert[count];
while (found && count <= num_obj) {
count += 1;
prev_lid = (nlid_ent ? &(local_lids[(count-1)*nlid_ent])
: NULL);
lid = (nlid_ent ? &(local_lids[count*nlid_ent]) : NULL);
found = zz->Get_Next_Coarse_Obj(zz->Get_Next_Coarse_Obj_Data,
ngid_ent, nlid_ent,
&local_gids[(count-1)*ngid_ent],
prev_lid,
&local_gids[count*ngid_ent],
lid,
&assigned[count],
&num_vert[count],
&vertices[sum_vert*ngid_ent],
&in_vertex[count*ngid_ent],
&out_vertex[count*ngid_ent],
&ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Next_Coarse_Obj.");
Zoltan_Multifree(__FILE__, __LINE__, 8, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
if (found) sum_vert += num_vert[count];
}
if (count != num_obj) {
sprintf(msg, "Number of objects returned by "
"First/Next_Coarse_Obj = %d is not equal to the "
"number returned by Num_Coarse_Obj = %d\n",
count, num_obj);
ZOLTAN_PRINT_WARN(zz->Proc, yo, msg);
final_ierr = ZOLTAN_WARN;
}
}
else {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Must define and register either "
"ZOLTAN_COARSE_OBJ_LIST_FN or "
"ZOLTAN_FIRST_COARSE_OBJ_FN/ZOLTAN_NEXT_COARSE_OBJ_FN pair.");
Zoltan_Multifree(__FILE__, __LINE__, 8, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_FATAL);
}
} /* nobj > 0 */
/* make sure all processors agree about in_order; also if num_obj is 0 then
set in_order from a processor where it is not 0 */
in_order_all = (int *)ZOLTAN_MALLOC(nproc*sizeof(int));
num_obj_all = (int *)ZOLTAN_MALLOC(nproc*sizeof(int));
if (in_order_all == NULL || num_obj_all == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 11, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex,
&coords,
&in_order_all,
&num_obj_all);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
MPI_Allgather((void *)&in_order,1,MPI_INT,(void *)in_order_all,1,
MPI_INT,zz->Communicator);
MPI_Allgather((void *)&num_obj,1,MPI_INT,(void *)num_obj_all,1,
MPI_INT,zz->Communicator);
in_order_temp = -1;
for (i=0; i<nproc; i++) {
if (num_obj_all[i] != 0) {
if (in_order_temp == -1) {
in_order_temp = in_order_all[i];
}
else {
if (in_order_all[i] != in_order_temp) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"All processors must return the same value for in_order.");
Zoltan_Multifree(__FILE__, __LINE__, 11, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex,
&coords,
&in_order_all,
&num_obj_all);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_FATAL);
}
}
}
}
if (num_obj == 0) in_order = in_order_temp;
ZOLTAN_FREE(&in_order_all);
ZOLTAN_FREE(&num_obj_all);
/* if an SFC will be used to order the coarse grid elements,
find out if this is a 2D or 3D problem */
if (!in_order && (strcmp(initpath_method, "HILBERT") == 0 ||
strcmp(initpath_method, "SIERPINSKI") == 0 ||
strcmp(initpath_method, "REFTREE_DEFAULT") == 0 )) {
if (zz->Get_Num_Geom == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Must register ZOLTAN_NUM_GEOM_FN.");
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_FATAL);
}
num_geom = zz->Get_Num_Geom(zz->Get_Num_Geom_Data, &ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Num_Geom.");
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
if (!(num_geom==2 || num_geom==3)) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Geometry must be either 2D or 3D.");
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_FATAL);
}
}
/* if an SFC will be used to order the coarse grid elements, get the coords */
if (num_obj > 0 && !in_order && (strcmp(initpath_method, "HILBERT") == 0 ||
strcmp(initpath_method, "SIERPINSKI") == 0 ||
strcmp(initpath_method, "REFTREE_DEFAULT") == 0 )) {
/* verify the geometry function has be registered */
if (zz->Get_Geom == NULL && zz->Get_Geom_Multi == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Must register ZOLTAN_GEOM_FN or ZOLTAN_GEOM_MULTI_FN.");
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_FATAL);
}
/* allocate space for the element coordinates */
coords = (double *) ZOLTAN_MALLOC(num_obj*num_geom*sizeof(double));
if (coords == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 9, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex,
&coords);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
/* get the coordinates of each element */
if (zz->Get_Geom) {
for (i=0; i<num_obj; i++) {
zz->Get_Geom(zz->Get_Geom_Data, zz->Num_GID, zz->Num_LID,
&(local_gids[ngid_ent*i]), &(local_lids[nlid_ent*i]),
&(coords[num_geom*i]),&ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Geom.");
Zoltan_Multifree(__FILE__, __LINE__, 9, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex,
&coords);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
}
}
else {
/* Use MULTI Function */
zz->Get_Geom_Multi(zz->Get_Geom_Multi_Data, ngid_ent, nlid_ent, num_obj,
local_gids, local_lids, num_geom, coords, &ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Geom_Multi.");
Zoltan_Multifree(__FILE__, __LINE__, 9, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex,
&coords);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
}
} /* endif will use SFC for initial grid order */
/*
* Communicate to get coarse grid objects unknown to this processor.
*/
/* determine the number of vertices among the assigned elements of each proc */
/* determine how many coarse objects are assigned to each processor */
num_assigned_obj = 0;
for (i=0; i<num_obj; i++) {
if (assigned[i]) num_assigned_obj++;
}
num_ass_all = (int *)ZOLTAN_MALLOC(nproc*sizeof(int));
displs = (int *)ZOLTAN_MALLOC(nproc*sizeof(int));
if (num_ass_all == NULL || displs == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 11, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex,
&coords,
&num_ass_all,
&displs);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
MPI_Allgather((void *)&num_assigned_obj,1,MPI_INT,(void *)num_ass_all,1,
MPI_INT,zz->Communicator);
/* determine the number of vertices among the assigned elements of each proc */
sum_assigned_vert = 0;
for (i=0; i<num_obj; i++) {
if (assigned[i]) {
sum_assigned_vert += num_vert[i];
}
}
sum_ass_vert_all = (int *)ZOLTAN_MALLOC(nproc*sizeof(int));
recv_size_all = (int *)ZOLTAN_MALLOC(nproc*sizeof(int));
if (sum_ass_vert_all == NULL || recv_size_all == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 13, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex,
&coords,
&num_ass_all,
&displs,
&sum_ass_vert_all,
&recv_size_all);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
MPI_Allgather((void *)&sum_assigned_vert,1,MPI_INT,(void *)sum_ass_vert_all,
1,MPI_INT,zz->Communicator);
/* determine the displacements in a message containing 3+num_vert GIDs for
each assigned object, the total number of objects, and the size of such
a message */
displs[0] = 0;
for (i=1; i<nproc; i++) {
recv_size_all[i-1] = (3*num_ass_all[i-1]+sum_ass_vert_all[i-1])*ngid_ent;
displs[i] = displs[i-1] + recv_size_all[i-1];
}
recv_size_all[nproc-1] =
(3*num_ass_all[nproc-1]+sum_ass_vert_all[nproc-1])*ngid_ent;
recv_size = displs[nproc-1] + recv_size_all[nproc-1];
/* Make an array of GID with the global ID, vertices, in_vertex and
out_vertex of each object assigned to this processor, an integer array
with the number of vertices, and a double array with the coordinates. */
send_id = ZOLTAN_MALLOC_GID_ARRAY(zz, 3*num_assigned_obj+sum_vert);
send_int = (int *) ZOLTAN_MALLOC(sizeof(int)*num_assigned_obj);
send_double = (double *) ZOLTAN_MALLOC(sizeof(double)*num_geom*num_assigned_obj);
if (num_assigned_obj != 0 && (send_id == NULL || send_int == NULL
|| (send_double == NULL && num_geom != 0))) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 16, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&num_vert,
&vertices,
&in_vertex,
&out_vertex,
&coords,
&num_ass_all,
&displs,
&sum_ass_vert_all,
&recv_size_all,
&send_id,
&send_int,
&send_double);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
count = 0;
sum_vert = 0;
for (i=0; i<num_obj; i++) {
if (assigned[i]) {
ZOLTAN_SET_GID(zz, &(send_id[count*ngid_ent]),
&(local_gids[i*ngid_ent]));
ZOLTAN_SET_GID(zz, &(send_id[(count+1)*ngid_ent]),
&(in_vertex[i*ngid_ent]));
ZOLTAN_SET_GID(zz, &(send_id[(count+2)*ngid_ent]),
&(out_vertex[i*ngid_ent]));
for (j=0; j<num_vert[i]; j++) {
ZOLTAN_SET_GID(zz, &(send_id[(count+3+j)*ngid_ent]),
&(vertices[(sum_vert+j)*ngid_ent]));
}
count += 3 + num_vert[i];
}
sum_vert += num_vert[i];
}
count = 0;
for (i=0; i<num_obj; i++) {
if (assigned[i]) {
send_int[count] = num_vert[i];
if (!in_order && (strcmp(initpath_method, "HILBERT") == 0 ||
strcmp(initpath_method, "SIERPINSKI") == 0 ||
strcmp(initpath_method, "REFTREE_DEFAULT") == 0 )) {
send_double[num_geom*count ] = coords[num_geom*i ];
send_double[num_geom*count+1] = coords[num_geom*i+1];
if (num_geom == 3) send_double[num_geom*count+2] = coords[num_geom*i+2];
}
count = count + 1;
}
}
ZOLTAN_FREE(&num_vert);
ZOLTAN_FREE(&vertices);
ZOLTAN_FREE(&in_vertex);
ZOLTAN_FREE(&out_vertex);
/* exchange the assigned coarse objects with all processors */
recv_id = ZOLTAN_MALLOC_GID_ARRAY(zz, recv_size);
if (recv_id == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 13, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&coords,
&num_ass_all,
&displs,
&sum_ass_vert_all,
&recv_size_all,
&send_id,
&send_int,
&send_double,
&recv_id);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
MPI_Allgatherv((void *)send_id,(3*num_assigned_obj+sum_vert)*ngid_ent,
ZOLTAN_ID_MPI_TYPE,(void *)recv_id,recv_size_all,displs,
ZOLTAN_ID_MPI_TYPE,zz->Communicator);
ZOLTAN_FREE(&send_id);
/* set the displacements for sending the integer message, compute the
number of objects and vertices in the whole coarse grid, and exchange the
number of vertices of each object */
displs[0] = 0;
total_num_obj = num_ass_all[0];
total_sum_vert = sum_ass_vert_all[0];
recv_size_all[0] = num_ass_all[0];
for (i=1; i<nproc; i++) {
displs[i] = displs[i-1]+num_ass_all[i-1];
total_num_obj += num_ass_all[i];
total_sum_vert += sum_ass_vert_all[i];
recv_size_all[i] = num_ass_all[i];
}
full_num_vert = (int *) ZOLTAN_MALLOC(sizeof(int)*total_num_obj);
if (full_num_vert == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__,13, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&coords,
&displs,
&num_ass_all,
&sum_ass_vert_all,
&recv_size_all,
&send_int,
&send_double,
&recv_id,
&full_num_vert);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
MPI_Allgatherv((void *)send_int,num_assigned_obj,MPI_INT,
(void *)full_num_vert,recv_size_all,displs, MPI_INT,
zz->Communicator);
ZOLTAN_FREE(&send_int);
/* set the displacements for sending the coordinates, and exchange the coords */
if (!in_order && (strcmp(initpath_method, "HILBERT") == 0 ||
strcmp(initpath_method, "SIERPINSKI") == 0 ||
strcmp(initpath_method, "REFTREE_DEFAULT") == 0 )) {
displs[0] = 0;
recv_size_all[0] = num_geom*num_ass_all[0];
for (i=1; i<nproc; i++) {
displs[i] = displs[i-1] + num_geom*num_ass_all[i-1];
recv_size_all[i] = num_geom*num_ass_all[i];
}
full_coords = (double *) ZOLTAN_MALLOC(num_geom*total_num_obj*sizeof(double));
if (full_coords == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__,11, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&coords,
&displs,
&recv_size_all,
&send_double,
&recv_id,
&full_num_vert,
&full_coords);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
MPI_Allgatherv((void *)send_double,num_geom*num_assigned_obj,MPI_DOUBLE,
(void *)full_coords,recv_size_all,displs, MPI_DOUBLE,
zz->Communicator);
ZOLTAN_FREE(&send_double);
}
ZOLTAN_FREE(&num_ass_all);
ZOLTAN_FREE(&sum_ass_vert_all);
ZOLTAN_FREE(&displs);
ZOLTAN_FREE(&recv_size_all);
/* copy the messages into the coarse grid data structure */
full_gid = ZOLTAN_MALLOC_GID_ARRAY(zz, total_num_obj);
full_in_vertex = ZOLTAN_MALLOC_GID_ARRAY(zz, total_num_obj);
full_out_vertex = ZOLTAN_MALLOC_GID_ARRAY(zz, total_num_obj);
full_vertices = ZOLTAN_MALLOC_GID_ARRAY(zz, total_sum_vert);
if (full_gid == NULL || full_in_vertex == NULL || full_out_vertex == NULL ||
full_vertices == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 14, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&coords,
&displs,
&recv_size_all,
&recv_id,
&full_num_vert,
&full_gid,
&full_in_vertex,
&full_out_vertex,
&full_vertices,
&full_coords);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
count = 0;
vcount = 0;
for (i=0; i<total_num_obj; i++) {
ZOLTAN_SET_GID(zz, &(full_gid[i*ngid_ent]), &(recv_id[count*ngid_ent]));
ZOLTAN_SET_GID(zz, &(full_in_vertex[i*ngid_ent]),
&(recv_id[(count+1)*ngid_ent]));
ZOLTAN_SET_GID(zz, &(full_out_vertex[i*ngid_ent]),
&(recv_id[(count+2)*ngid_ent]));
for (j=0; j<full_num_vert[i]; j++) {
ZOLTAN_SET_GID(zz, &(full_vertices[(vcount+j)*ngid_ent]),
&(recv_id[(count+3+j)*ngid_ent]));
}
count += 3 + full_num_vert[i];
vcount += full_num_vert[i];
}
ZOLTAN_FREE(&recv_id);
/* go through all the coarse grid elements to see if it is known to this
processor, and if so set assigned and local id */
full_lid = ZOLTAN_MALLOC_LID_ARRAY(zz, total_num_obj);
full_assigned = (int *) ZOLTAN_MALLOC(total_num_obj*sizeof(int));
full_known = (int *) ZOLTAN_MALLOC(total_num_obj*sizeof(int));
if (full_lid == NULL || full_assigned == NULL || full_known == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 14, &initpath_method,
&local_gids,
&local_lids,
&assigned,
&coords,
&full_num_vert,
&full_gid,
&full_in_vertex,
&full_out_vertex,
&full_vertices,
&full_coords,
&full_lid,
&full_assigned,
&full_known);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
for (i=0; i<total_num_obj; i++) {
/* TEMP seach for matching GID. Should be more efficient with a hash table */
found = 0;
for (j=0; j<num_obj && !found; j++) {
if (ZOLTAN_EQ_GID(zz, &(full_gid[i*ngid_ent]),
&(local_gids[j*ngid_ent])))
found = 1;
}
j--;
if (found) {
ZOLTAN_SET_LID(zz, &(full_lid[i*nlid_ent]), &(local_lids[j*nlid_ent]));
full_known[i] = 1;
full_assigned[i] = assigned[j];
}
else {
ZOLTAN_INIT_LID(zz, &(full_lid[i*nlid_ent]));
full_known[i] = 0;
full_assigned[i] = 0;
}
}
ZOLTAN_FREE(&local_gids);
ZOLTAN_FREE(&local_lids);
ZOLTAN_FREE(&assigned);
ZOLTAN_FREE(&coords);
/*
* Determine the order of the coarse grid elements.
*/
order = (int *) ZOLTAN_MALLOC(total_num_obj*sizeof(int));
if (order == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 11, &initpath_method,
&full_num_vert,
&full_gid,
&full_in_vertex,
&full_out_vertex,
&full_vertices,
&full_lid,
&full_assigned,
&full_known,
&full_coords,
&order);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
/* If the user provided the order, then use it */
if (in_order && total_num_obj != 0) {
for (i=0; i<total_num_obj; i++) {
order[i] = i;
}
}
else {
/* If the user did not provide the order, then find one */
if (!in_order && total_num_obj != 0) {
ierr = Zoltan_Reftree_Coarse_Grid_Path(total_num_obj, full_num_vert,
full_vertices, full_in_vertex,
full_out_vertex, full_coords,
order, full_gid, full_lid,
initpath_method, zz);
Zoltan_Multifree(__FILE__, __LINE__, 2, &initpath_method, &full_coords);
if (ierr == ZOLTAN_FATAL || ierr == ZOLTAN_MEMERR) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned by Zoltan_Reftree_Coarse_Grid_Path");
Zoltan_Multifree(__FILE__, __LINE__, 9, &full_num_vert,
&full_gid,
&full_in_vertex,
&full_out_vertex,
&full_vertices,
&full_lid,
&full_assigned,
&full_known,
&order);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
}
}
/*
* Copy the elements into the child list of the root
*/
/*
* Allocate the children of the root
*/
reorder_nvert = (int *) ZOLTAN_MALLOC(total_num_obj*sizeof(int));
if (reorder_nvert == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 9, &full_num_vert,
&full_gid,
&full_in_vertex,
&full_out_vertex,
&full_vertices,
&full_lid,
&full_assigned,
&full_known,
&order);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
for (i=0; i<total_num_obj; i++) {
reorder_nvert[i] = MAXVERT;
}
ierr = alloc_reftree_nodes(zz, &(root->children), total_num_obj,
reorder_nvert);
ZOLTAN_FREE(&reorder_nvert);
if (ierr == ZOLTAN_MEMERR) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Error returned by alloc_reftree_nodes.");
Zoltan_Multifree(__FILE__, __LINE__, 9, &full_num_vert,
&full_gid,
&full_in_vertex,
&full_out_vertex,
&full_vertices,
&full_lid,
&full_assigned,
&full_known,
&order);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
root->num_child = total_num_obj;
/*
* Make sure the weights have been provided, if needed
*/
if (zz->Obj_Weight_Dim != 0 && zz->Get_Child_Weight == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Must register ZOLTAN_CHILD_WEIGHT_FN.");
Zoltan_Multifree(__FILE__, __LINE__, 9, &full_num_vert,
&full_gid,
&full_in_vertex,
&full_out_vertex,
&full_vertices,
&full_lid,
&full_assigned,
&full_known,
&order);
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_FATAL);
}
/*
* For each coarse grid object ...
*/
sum_vert = 0;
for (i=0; i<total_num_obj; i++) {
/*
* Get the weight
*/
if (zz->Obj_Weight_Dim == 0) {
/* if an initial element is a leaf, the weight gets set to 1 later */
*(root->children[order[i]].weight) = 0.0;
}
else if (!full_known[i]) {
/* if the element is not known to this processor, the weight is 0 */
*(root->children[order[i]].weight) = 0.0;
}
else {
lid = (nlid_ent ? &(full_lid[i*nlid_ent]) : NULL);
zz->Get_Child_Weight(zz->Get_Child_Weight_Data,
ngid_ent, nlid_ent,
&(full_gid[i*ngid_ent]),
lid, zz->Obj_Weight_Dim,
root->children[order[i]].weight, &ierr);
}
for (j=0; j<wdim; j++) {
root->children[order[i]].summed_weight[j] = 0.0;
root->children[order[i]].my_sum_weight[j] = 0.0;
}
/*
* Copy the vertices
*/
for (j=0; j<full_num_vert[i]; j++)
ZOLTAN_SET_GID(zz,&(root->children[order[i]].vertices[j*ngid_ent]),
&(full_vertices[(sum_vert+j)*ngid_ent]));
if (full_num_vert[i] > 0) sum_vert += full_num_vert[i];
/*
* Copy from temporary arrays and set empty defaults
*/
ZOLTAN_SET_GID(zz, root->children[order[i]].global_id,
&(full_gid[i*ngid_ent]));
ZOLTAN_SET_LID(zz, root->children[order[i]].local_id,
&(full_lid[i*nlid_ent]));
root->children[order[i]].children = (ZOLTAN_REFTREE *) NULL;
root->children[order[i]].num_child = 0;
root->children[order[i]].num_vertex = full_num_vert[i];
ZOLTAN_SET_GID(zz, root->children[order[i]].in_vertex,
&(full_in_vertex[i*ngid_ent]));
ZOLTAN_SET_GID(zz, root->children[order[i]].out_vertex,
&(full_out_vertex[i*ngid_ent]));
root->children[order[i]].assigned_to_me = full_assigned[i];
root->children[order[i]].known_to_me = full_known[i];
root->children[order[i]].partition = 0;
/*
* Add it to the hash table
*/
Zoltan_Reftree_Hash_Insert(zz, &(root->children[order[i]]),hashtab,hashsize);
}
/*
* clean up and return error code
*/
ZOLTAN_FREE(&full_num_vert);
ZOLTAN_FREE(&full_gid);
ZOLTAN_FREE(&full_in_vertex);
ZOLTAN_FREE(&full_out_vertex);
ZOLTAN_FREE(&full_vertices);
ZOLTAN_FREE(&full_lid);
ZOLTAN_FREE(&full_assigned);
ZOLTAN_FREE(&full_known);
ZOLTAN_FREE(&order);
ZOLTAN_TRACE_EXIT(zz, yo);
return(final_ierr);
}
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
int Zoltan_Reftree_Build(ZZ *zz)
{
/*
* Function to build a refinement tree
*/
char *yo = "Zoltan_Reftree_Build";
ZOLTAN_REFTREE *root; /* Root of the refinement tree */
int ierr; /* Error code returned by called functions */
int i; /* loop counter */
ZOLTAN_TRACE_ENTER(zz, yo);
/*
* Initialize the tree, if not already there, and set the root. If already
* there, reinitialize coarse grid.
*/
if (zz->LB.Data_Structure == NULL) {
ierr = Zoltan_Reftree_Init(zz);
if (ierr==ZOLTAN_FATAL || ierr==ZOLTAN_MEMERR) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Error returned from Zoltan_Reftree_Init.");
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
}
else {
Zoltan_Reftree_Reinit_Coarse(zz);
}
root = ((struct Zoltan_Reftree_data_struct *)zz->LB.Data_Structure)->reftree_root;
/*
* Verify the required child query functions are registered
*/
if (zz->Get_Num_Child == NULL || zz->Get_Child_List == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Must register ZOLTAN_NUM_CHILD_FN"
" and ZOLTAN_CHILD_LIST_FN.");
Zoltan_Reftree_Free_Structure(zz);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_FATAL);
}
/*
* For each child of the root, build the subtree rooted at that child
* and, if the weights are not provided, set its weight if it is a leaf.
* Skip elements not known to this processor.
*/
for (i=0; i<root->num_child; i++) {
if ( (root->children[i]).known_to_me) {
ierr = Zoltan_Reftree_Build_Recursive(zz,&(root->children[i]));
if (ierr==ZOLTAN_FATAL || ierr==ZOLTAN_MEMERR) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from Zoltan_Reftree_Build_Recursive.");
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
}
}
/* KDD Free memory to avoid memory leak. Reset ssize to 0. */
ssize = 0;
Zoltan_Multifree(__FILE__, __LINE__, 9, &slocal_gids,
&slocal_lids,
&sassigned,
&snum_vert,
&svertices,
&sin_vertex,
&sout_vertex,
&svert1,
&sorder);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_OK);
}
static int Zoltan_Reftree_Build_Recursive(ZZ *zz,ZOLTAN_REFTREE *subroot)
{
/*
* Recursive function to traverse a tree while building it
*/
char *yo = "Zoltan_Reftree_Build_Recursive";
char msg[256];
int ierr; /* error code called routines */
int final_ierr; /* error code returned by this routine */
int num_obj; /* number of children returned by user */
ZOLTAN_ID_PTR lid; /* temporary coarse element Local ID; used to pass
NULL to query functions when NUM_LID_ENTRIES=0 */
int *reorder_nvert; /* num_vert reordered by permutation "order" */
ZOLTAN_REF_TYPE ref_type; /* type of refinement that creates children */
int wdim; /* dimension for weights */
int i, j; /* loop counters */
int sum_vert; /* running sum of the number of vertices */
struct Zoltan_Reftree_hash_node **hashtab; /* hash tree */
int hashsize; /* size of the hash table */
int ngid_ent = zz->Num_GID; /* number of array entries in a global ID */
int nlid_ent = zz->Num_LID; /* number of array entries in a local ID */
int children_agree; /* flag, true if all children of a node in the
refinement tree agree with data from GET_CHILD */
int existing; /* existing child that agrees with GET_CHILD data */
final_ierr = ZOLTAN_OK;
if (zz->Obj_Weight_Dim == 0) {
wdim = 1;
} else {
wdim = zz->Obj_Weight_Dim;
}
/*
* Print a warning if a nonexistent subroot is passed in
*/
if (subroot == NULL) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Called with nonexistent subroot.");
return(ZOLTAN_WARN);
}
/*
* Get the number of children of this node
*/
num_obj = zz->Get_Num_Child(zz->Get_Num_Child_Data,
ngid_ent, nlid_ent,
subroot->global_id, subroot->local_id, &ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Num_Child.");
Zoltan_Reftree_Free_Structure(zz);
return(ierr);
}
/*
* If there are no children, make sure the tree has no children, and
* set the weight if it is not user provided,
* and return. The default is to use 1.0 for leaves and 0.0 for others.
*/
if (num_obj == 0) {
if (subroot->num_child != 0) {
Zoltan_Reftree_Free_Subtree(zz, subroot);
}
if (zz->Obj_Weight_Dim == 0) *(subroot->weight) = 1.0;
return(ZOLTAN_OK);
}
/*
* Get the children
*/
if (num_obj > ssize) {
if (ssize > 0) {
Zoltan_Multifree(__FILE__, __LINE__, 8, &slocal_gids,
&slocal_lids,
&sassigned,
&snum_vert,
&svertices,
&sin_vertex,
&sout_vertex,
&svert1);
}
slocal_gids = ZOLTAN_MALLOC_GID_ARRAY(zz, num_obj);
slocal_lids = ZOLTAN_MALLOC_LID_ARRAY(zz, num_obj);
sassigned = (int *) ZOLTAN_MALLOC(num_obj*sizeof(int));
snum_vert = (int *) ZOLTAN_MALLOC(num_obj*sizeof(int));
svertices = ZOLTAN_MALLOC_GID_ARRAY(zz,MAXVERT*num_obj);
sin_vertex = ZOLTAN_MALLOC_GID_ARRAY(zz,num_obj);
sout_vertex = ZOLTAN_MALLOC_GID_ARRAY(zz,num_obj);
svert1 = (int *) ZOLTAN_MALLOC((num_obj+1)*sizeof(int));
sorder = (int *) ZOLTAN_MALLOC(num_obj*sizeof(int));
ssize = num_obj;
if (slocal_gids == NULL || (nlid_ent > 0 && slocal_lids == NULL) ||
sassigned == NULL ||
snum_vert == NULL || svertices == NULL || sin_vertex == NULL ||
sout_vertex == NULL || svert1 == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 9, &slocal_gids,
&slocal_lids,
&sassigned,
&snum_vert,
&svertices,
&sin_vertex,
&sout_vertex,
&svert1,
&sorder);
ssize = 0;
Zoltan_Reftree_Free_Structure(zz);
return(ZOLTAN_MEMERR);
}
}
zz->Get_Child_List(zz->Get_Child_List_Data,
ngid_ent, nlid_ent,
subroot->global_id, subroot->local_id,
slocal_gids, slocal_lids, sassigned,
snum_vert, svertices, &ref_type, sin_vertex, sout_vertex,
&ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Child_List.");
Zoltan_Reftree_Free_Structure(zz);
return(ierr);
}
/*
* Set the start of the list of vertices for each child
*/
svert1[0] = 0;
for (i=0; i<num_obj; i++) svert1[i+1] = svert1[i] + snum_vert[i];
/*
* If there already exist children, then make sure they are exactly the
* same. Otherwise, delete them and rebuild the tree from here.
*/
/*
* check that the number of children agree and that each child agrees
* with an existing child in GID, LID and vertices
*/
children_agree = TRUE;
if (subroot->num_child == 0) {
children_agree = FALSE;
} else {
if (subroot->num_child != num_obj) {
children_agree = FALSE;
} else {
for (i=0; i<num_obj && children_agree; i++) {
existing = -1;
for (j=0; j<subroot->num_child && existing==-1; j++) {
if (ZOLTAN_EQ_GID(zz, subroot->children[j].global_id,
&(slocal_gids[i*ngid_ent]))) {
existing = j;
}
}
if (existing == -1) {
children_agree = FALSE;
} else {
for (j=0; j<nlid_ent; j++) {
if (subroot->children[existing].local_id[j] !=
slocal_lids[i*nlid_ent+j]) {
children_agree = FALSE;
}
}
if (subroot->children[existing].num_vertex != snum_vert[i]) {
children_agree = FALSE;
} else {
if (snum_vert[i] != 0) {
for (j=0; j<snum_vert[i] && children_agree; j++) {
if (!ZOLTAN_EQ_GID(zz,&subroot->children[existing].vertices[j*ngid_ent],
&(svertices[(svert1[i]+j)*ngid_ent]))) {
children_agree = FALSE;
}
}
}
}
/* set new value of assigned just in case we keep the children */
subroot->children[existing].assigned_to_me = sassigned[i];
}
}
}
}
/*
* If the children do not agree, then get rid of them and rebuild
*/
if (!children_agree) Zoltan_Reftree_Free_Subtree(zz, subroot);
if (subroot->num_child != 0) {
/*
* If the children were kept, set the current weights
*/
for (i=0; i<subroot->num_child; i++) {
if (zz->Obj_Weight_Dim == 0) {
*(subroot->children[i].weight) = 0.0;
}
else {
lid = (nlid_ent ? subroot->children[i].local_id : NULL);
zz->Get_Child_Weight(zz->Get_Child_Weight_Data,
ngid_ent, nlid_ent,
subroot->children[i].global_id,
lid,
zz->Obj_Weight_Dim,
subroot->children[i].weight, &ierr);
}
for (j=0; j<wdim; j++) {
subroot->children[i].summed_weight[j] = 0.0;
subroot->children[i].my_sum_weight[j] = 0.0;
}
}
} else {
/*
* If the children did not already exist or were removed, add them
*/
/*
* Determine the order of the children
*/
/*
* Refinement type dependent determination of the order of the children
* and the in/out vertices
*/
switch (ref_type) {
case ZOLTAN_IN_ORDER:
for (i=0; i<num_obj; i++) sorder[i] = i;
break;
case ZOLTAN_TRI_BISECT:
ierr = order_tri_bisect(zz,svert1,sorder,svertices,sin_vertex,sout_vertex,
subroot);
break;
case ZOLTAN_QUAD_QUAD:
ierr = order_quad_quad(zz,svert1,sorder,svertices,sin_vertex,sout_vertex,
subroot);
break;
case ZOLTAN_HEX3D_OCT:
ierr = order_hex3d_oct(zz,svert1,sorder,svertices,sin_vertex,sout_vertex,
subroot);
break;
case ZOLTAN_OTHER_REF:
ierr = order_other_ref(zz, subroot, num_obj, snum_vert, svert1, svertices,
sorder, sin_vertex, sout_vertex);
break;
/*
* Default case if a bad value gets returned; use them in order.
*/
default:
sprintf(msg, "Unknown value returned for ref_type"
" = %d. Using children in order provided.",ref_type);
ZOLTAN_PRINT_WARN(zz->Proc, yo, msg);
for (i=0; i<num_obj; i++) sorder[i] = i;
final_ierr = ZOLTAN_WARN;
}
/*
* Copy the children into the child list of the subroot
*/
/*
* Allocate the children
*/
if (subroot->children != NULL) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "children already existed; memory"
" leak potential.");
final_ierr = ZOLTAN_WARN;
}
reorder_nvert = (int *) ZOLTAN_MALLOC(num_obj*sizeof(int));
if (reorder_nvert == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Reftree_Free_Structure(zz);
return(ZOLTAN_MEMERR);
}
for (i=0; i<num_obj; i++) {
reorder_nvert[sorder[i]] = snum_vert[i];
}
ierr = alloc_reftree_nodes(zz, &(subroot->children), num_obj, reorder_nvert);
ZOLTAN_FREE(&reorder_nvert);
subroot->num_child = num_obj;
hashtab = ((struct Zoltan_Reftree_data_struct *)zz->LB.Data_Structure)->hash_table;
hashsize = ((struct Zoltan_Reftree_data_struct *)zz->LB.Data_Structure)->hash_table_size;
/*
* For each child ...
*/
sum_vert = 0;
for (i=0; i<num_obj; i++) {
/*
* Get the weight
*/
if (zz->Obj_Weight_Dim == 0) {
*(subroot->children[sorder[i]].weight) = 0.0;
}
else {
lid = (nlid_ent ? &(slocal_lids[i*nlid_ent]) : NULL);
zz->Get_Child_Weight(zz->Get_Child_Weight_Data,
ngid_ent, nlid_ent,
&(slocal_gids[i*ngid_ent]),
lid,
zz->Obj_Weight_Dim,
subroot->children[sorder[i]].weight, &ierr);
}
for (j=0; j<wdim; j++) {
subroot->children[sorder[i]].summed_weight[j] = 0.0;
subroot->children[sorder[i]].my_sum_weight[j] = 0.0;
}
/*
* Copy the vertices
*/
for (j=0; j<snum_vert[i]; j++)
ZOLTAN_SET_GID(zz,&(subroot->children[sorder[i]].vertices[j*ngid_ent]),
&(svertices[(sum_vert+j)*ngid_ent]));
if (snum_vert[i] > 0) sum_vert += snum_vert[i];
/*
* Copy from temporary arrays and set empty defaults
*/
ZOLTAN_SET_GID(zz, subroot->children[sorder[i]].global_id,
&(slocal_gids[i*ngid_ent]));
ZOLTAN_SET_LID(zz, subroot->children[sorder[i]].local_id,
&(slocal_lids[i*nlid_ent]));
subroot->children[sorder[i]].children = (ZOLTAN_REFTREE *) NULL;
subroot->children[sorder[i]].num_child = 0;
subroot->children[sorder[i]].num_vertex = snum_vert[i];
ZOLTAN_SET_GID(zz, subroot->children[sorder[i]].in_vertex,
&(sin_vertex[i*ngid_ent]));
ZOLTAN_SET_GID(zz, subroot->children[sorder[i]].out_vertex,
&(sout_vertex[i*ngid_ent]));
subroot->children[sorder[i]].assigned_to_me = sassigned[i];
subroot->children[sorder[i]].known_to_me = 1;
subroot->children[sorder[i]].partition = 0;
/*
* Add it to the hash table
*/
Zoltan_Reftree_Hash_Insert(zz, &(subroot->children[sorder[i]]),hashtab,hashsize);
}
}
/*
* recursively do the children
*/
for (i=0; i<subroot->num_child; i++) {
ierr = Zoltan_Reftree_Build_Recursive(zz,&(subroot->children[i]));
if (ierr) final_ierr = ierr;
}
return(final_ierr);
}
/*****************************************************************************/
static int order_tri_bisect(ZZ *zz, int *vert1, int *order,
ZOLTAN_ID_PTR vertices, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex, ZOLTAN_REFTREE *subroot)
{
/*
* Function to determine the order of the children and in/out vertices
* when refinement is done by bisecting triangles. Determine which of
* the first and second child has the in_vertex and out_vertex, and find the
* common vertex to go between them.
*/
char *yo = "order_tri_bisect";
int i, j; /* loop indices */
int parents_vert[6]; /* cross index between children and parent */
int parent_in; /* index of the parent in vertex */
int parent_out; /* index of the parent out vertex */
int parent_third; /* index of the parent triangle non in/out vert */
int not_parent[2]={0,0}; /* index of a vertex the parent does not have */
int has_in[2]; /* flag for an element having the parent in vert */
int has_out[2]; /* flag for an element having the parent out vert */
int has_third[2]; /* flag for a triangle having the parent non in/out*/
int bad_case; /* flag for failing to identify order */
int ngid_ent = zz->Num_GID; /* number of array entries in a global ID */
/* verify that 3 vertices were given for each triangle; if not, punt */
if (vert1[1] != 3 || vert1[2] != 6) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Incorrect number of vertices "
"given for bisected triangles.");
order[0] = 0;
order[1] = 1;
ZOLTAN_SET_GID(zz,&in_vertex[0],&vertices[vert1[0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[0],&vertices[(vert1[0]+1)*ngid_ent]);
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],&vertices[vert1[1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],&vertices[(vert1[1]+1)*ngid_ent]);
return(ZOLTAN_WARN);
}
/* determine the relationship between the parent's vertices and
the children's vertices */
for (i=0; i<6; i++) {
parents_vert[i] = -1;
for (j=0; j<3; j++) {
if (ZOLTAN_EQ_GID(zz,&vertices[i*ngid_ent],
&subroot->vertices[j*ngid_ent]))
parents_vert[i] = j;
}
}
/* determine the location of the parents in and out vertices */
parent_in = -1; parent_out = -1; parent_third = -1;
for (i=0; i<3; i++) {
if (ZOLTAN_EQ_GID(zz,&subroot->vertices[i*ngid_ent],subroot->in_vertex)) {
parent_in = i;
}
else if (ZOLTAN_EQ_GID(zz,&subroot->vertices[i*ngid_ent],
subroot->out_vertex)) {
parent_out = i;
}
else {
parent_third = i;
}
}
if (parent_in == -1 || parent_out == -1 || parent_third == -1) {
/* failed to locate one of them */
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Could not locate in and out "
"vertices in the parent.");
order[0] = 0;
order[1] = 1;
ZOLTAN_SET_GID(zz,&in_vertex[0],&vertices[vert1[0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[0],&vertices[(vert1[0]+1)*ngid_ent]);
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],&vertices[vert1[1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],&vertices[(vert1[1]+1)*ngid_ent]);
return(ZOLTAN_WARN);
}
/* find the vertex that the parent doesn't have */
if (parents_vert[0] == -1) not_parent[0] = 0;
if (parents_vert[1] == -1) not_parent[0] = 1;
if (parents_vert[2] == -1) not_parent[0] = 2;
if (parents_vert[3] == -1) not_parent[1] = 3;
if (parents_vert[4] == -1) not_parent[1] = 4;
if (parents_vert[5] == -1) not_parent[1] = 5;
/* see which children have which special vertices */
if (parents_vert[0] == parent_in || parents_vert[1] == parent_in ||
parents_vert[2] == parent_in) has_in[0] = 1;
else has_in[0] = 0;
if (parents_vert[0] == parent_out || parents_vert[1] == parent_out ||
parents_vert[2] == parent_out) has_out[0] = 1;
else has_out[0] = 0;
if (parents_vert[0] == parent_third || parents_vert[1] == parent_third ||
parents_vert[2] == parent_third) has_third[0] = 1;
else has_third[0] = 0;
if (parents_vert[3] == parent_in || parents_vert[4] == parent_in ||
parents_vert[5] == parent_in) has_in[1] = 1;
else has_in[1] = 0;
if (parents_vert[3] == parent_out || parents_vert[4] == parent_out ||
parents_vert[5] == parent_out) has_out[1] = 1;
else has_out[1] = 0;
if (parents_vert[3] == parent_third || parents_vert[4] == parent_third ||
parents_vert[5] == parent_third) has_third[1] = 1;
else has_third[1] = 0;
/* look for the case for this refinement */
bad_case = 0;
if (has_in[0]) {
if (has_out[1]) {
order[0] = 0; order[1] = 1;
ZOLTAN_SET_GID(zz,&in_vertex[0],&(subroot->vertices[parent_in*ngid_ent]));
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],
&(subroot->vertices[parent_out*ngid_ent]));
if (has_third[0] && has_third[1]) {
ZOLTAN_SET_GID(zz,&out_vertex[0],
&(subroot->vertices[parent_third*ngid_ent]));
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],
&(subroot->vertices[parent_third*ngid_ent]));
}else{
ZOLTAN_SET_GID(zz,&out_vertex[0],&vertices[not_parent[0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],
&vertices[not_parent[1]*ngid_ent]);
}
}
else if (has_in[1]) {
if (has_out[0]) {
order[0] = 1; order[1] = 0;
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],
&(subroot->vertices[parent_in*ngid_ent]));
ZOLTAN_SET_GID(zz,&out_vertex[0],
&(subroot->vertices[parent_out*ngid_ent]));
if (has_third[0] && has_third[1]) {
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],
&(subroot->vertices[parent_third*ngid_ent]));
ZOLTAN_SET_GID(zz,&in_vertex[0],
&(subroot->vertices[parent_third*ngid_ent]));
}else{
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],
&vertices[not_parent[1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&in_vertex[0],
&vertices[not_parent[0]*ngid_ent]);
}
}else{ /* impossible case, no one has the out vertex */
bad_case = 1;
order[0] = 0; order[1] = 1;
ZOLTAN_SET_GID(zz,&in_vertex[0],
&(subroot->vertices[parent_in*ngid_ent]));
ZOLTAN_SET_GID(zz,&out_vertex[0],
&(subroot->vertices[parent_third*ngid_ent]));
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],
&(subroot->vertices[parent_third*ngid_ent]));
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],
&(subroot->vertices[parent_in*ngid_ent]));
}
}else{ /* impossible case, second child has neither in nor out */
bad_case = 1;
order[0] = 0; order[1] = 1;
ZOLTAN_SET_GID(zz,&in_vertex[0],&(subroot->vertices[parent_in*ngid_ent]));
ZOLTAN_SET_GID(zz,&out_vertex[0],
&(subroot->vertices[parent_third*ngid_ent]));
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],&vertices[3*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],&vertices[4*ngid_ent]);
}
}
else if (has_out[0]) {
if (has_in[1]) {
order[0] = 1; order[1] = 0;
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],
&(subroot->vertices[parent_in*ngid_ent]));
ZOLTAN_SET_GID(zz,&out_vertex[0],
&(subroot->vertices[parent_out*ngid_ent]));
if (has_third[0] && has_third[1]) {
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],
&(subroot->vertices[parent_third*ngid_ent]));
ZOLTAN_SET_GID(zz,&in_vertex[0],
&(subroot->vertices[parent_third*ngid_ent]));
}else{
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],
&vertices[not_parent[1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&in_vertex[0],&vertices[not_parent[0]*ngid_ent]);
}
}else{ /* impossible case, no one has the in vertex */
bad_case = 1;
order[0] = 0; order[1] = 1;
ZOLTAN_SET_GID(zz,&in_vertex[0],&(subroot->vertices[parent_out*ngid_ent]));
ZOLTAN_SET_GID(zz,&out_vertex[0],
&(subroot->vertices[parent_third*ngid_ent]));
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],
&(subroot->vertices[parent_third*ngid_ent]));
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],
&(subroot->vertices[parent_out*ngid_ent]));
}
}else{ /* impossible case, first child has neither in nor out */
bad_case = 1;
order[0] = 0; order[1] = 1;
ZOLTAN_SET_GID(zz,&in_vertex[0],&vertices[0*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[0],&vertices[1*ngid_ent]);
ZOLTAN_SET_GID(zz,&in_vertex[ngid_ent],&vertices[3*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ngid_ent],&vertices[4*ngid_ent]);
}
if (bad_case) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Vertices of children did not "
"match the in and out vertices of parent.");
return(ZOLTAN_WARN);
}
else {
return(ZOLTAN_OK);
}
}
/*****************************************************************************/
static int order_quad_quad(ZZ *zz, int *vert1, int *order,
ZOLTAN_ID_PTR vertices, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex, ZOLTAN_REFTREE *subroot)
{
/*
* Function to determine the order of the children and in/out vertices
* when refinement is done by quadrasecting quadrilaterals.
*/
int i,j,k,found,ord[4]={0,0,0,0};
ZOLTAN_ID_PTR shared;
char *yo = "order_quad_quad";
int ngid_ent = zz->Num_GID; /* number of array entries in a global ID */
shared = ZOLTAN_MALLOC_GID_ARRAY(zz,3);
/* verify that 4 vertices were given for each quadrilateral; if not, punt */
if (vert1[1] != 4 || vert1[2] != 8 || vert1[3] != 12) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Incorrect number of vertices "
"given for quadrasected quadrilaterals.");
for (i=0; i<4; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+3)*ngid_ent]);
}
ZOLTAN_FREE(&shared);
return(ZOLTAN_WARN);
}
/* find the child that contains the in_vertex and make it first */
found = 0;
for (i=0; i<4 && !found; i++) {
for (j=0; j<4 && !found; j++) {
if (ZOLTAN_EQ_GID(zz,&vertices[(4*i+j)*ngid_ent],subroot->in_vertex)) {
ord[0] = i;
found = 1;
}
}
}
if (!found) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Couldn't find in_vertex in children");
for (i=0; i<4; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+3)*ngid_ent]);
}
ZOLTAN_FREE(&shared);
return(ZOLTAN_WARN);
}
/* find the child that contains the out_vertex and make it last */
found = 0;
for (i=0; i<4 && !found; i++) {
for (j=0; j<4 && !found; j++) {
if (ZOLTAN_EQ_GID(zz,&vertices[(4*i+j)*ngid_ent],subroot->out_vertex)) {
ord[3] = i;
found = 1;
}
}
}
if (!found) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Couldn't find out_vertex in children");
for (i=0; i<4; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+3)*ngid_ent]);
}
ZOLTAN_FREE(&shared);
return(ZOLTAN_WARN);
}
/* find a child that shares two vertices with the first child and is
not the last child, and make it second */
found = 0;
for (k=0; k<4 && found!=2; k++) {
if (k != ord[0] && k != ord[3]) {
found = 0;
for (j=0; j<4 && found!=2; j++) {
for (i=0; i<4 && found!=2; i++) {
if (ZOLTAN_EQ_GID(zz,&vertices[(4*k+j)*ngid_ent],
&vertices[(4*ord[0]+i)*ngid_ent])) {
ZOLTAN_SET_GID(zz,&shared[found*ngid_ent],
&vertices[(4*k+j)*ngid_ent]);
found = found + 1;
}
}
}
}
if (found == 2) {
ord[1] = k;
}
}
if (found != 2) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Couldn't find second child of quadrasection");
for (i=0; i<4; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+3)*ngid_ent]);
}
ZOLTAN_FREE(&shared);
return(ZOLTAN_WARN);
}
/* the remaining child is given by six minus the sum of the others */
ord[2] = 6 - ord[0] - ord[1] - ord[3];
/* determine which vertex shared by the first and second children is also
shared by the last child, and hence is the middle of the parent, and
place that one in shared[0] */
found = 0;
for (j=0; j<4 && !found; j++) {
if (ZOLTAN_EQ_GID(zz,&shared[0],&vertices[(4*ord[3]+j)*ngid_ent])) {
found = 1;
}
if (ZOLTAN_EQ_GID(zz,&shared[ngid_ent],&vertices[(4*ord[3]+j)*ngid_ent])) {
ZOLTAN_SET_GID(zz,&shared[ngid_ent],&shared[0]);
ZOLTAN_SET_GID(zz,&shared[0],&vertices[(4*ord[3]+j)*ngid_ent]);
found = 1;
}
}
if (!found) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Couldn't find central node of quadrasection");
for (i=0; i<4; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+3)*ngid_ent]);
}
ZOLTAN_FREE(&shared);
return(ZOLTAN_WARN);
}
/* find the other vertex shared by the third and fourth children */
found = 0;
for (j=0; j<4 && !found; j++) {
if (!ZOLTAN_EQ_GID(zz,&vertices[(4*ord[2]+j)*ngid_ent],&shared[0])) {
for (i=0; i<4 && !found; i++) {
if (ZOLTAN_EQ_GID(zz,&vertices[(4*ord[2]+j)*ngid_ent],
&vertices[(4*ord[3]+i)*ngid_ent])) {
ZOLTAN_SET_GID(zz,&shared[2*ngid_ent],
&vertices[(4*ord[2]+j)*ngid_ent]);
found = 1;
}
}
}
}
if (!found) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Couldn't find shared vertex of 3rd and 4th child");
for (i=0; i<4; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+3)*ngid_ent]);
}
ZOLTAN_FREE(&shared);
return(ZOLTAN_WARN);
}
/* invert the permutation matrix */
for (i=0; i<4; i++) {
order[ord[i]] = i;
}
/* set the in/out vertices */
ZOLTAN_SET_GID(zz, &in_vertex[ord[0]*ngid_ent], subroot->in_vertex);
ZOLTAN_SET_GID(zz,&out_vertex[ord[0]*ngid_ent],&shared[1*ngid_ent]);
ZOLTAN_SET_GID(zz, &in_vertex[ord[1]*ngid_ent],&shared[1*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[1]*ngid_ent],&shared[0*ngid_ent]);
ZOLTAN_SET_GID(zz, &in_vertex[ord[2]*ngid_ent],&shared[0*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[2]*ngid_ent],&shared[2*ngid_ent]);
ZOLTAN_SET_GID(zz, &in_vertex[ord[3]*ngid_ent],&shared[2*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[3]*ngid_ent], subroot->out_vertex);
ZOLTAN_FREE(&shared);
return(ZOLTAN_OK);
}
/*****************************************************************************/
static int order_hex3d_oct(ZZ *zz, int *vert1, int *order,
ZOLTAN_ID_PTR vertices, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex, ZOLTAN_REFTREE *subroot)
{
/*
* Function to determine the order of the children and in/out vertices
* when refinement is done by octasection of hexahedra.
*/
int i,j,found,ord[8],vert,count[27],lvertices[64],ecoord[8][3],vcoord[27][3];
int nshare, nshare2, nshare4, nshare100, nshare010, share2[3];
int element[2][2][2]={{{0,0},{0,0}},{{0,0},{0,0}}};
int elem100,elem010,elem001,vertex[3][3][3];
ZOLTAN_ID_PTR lvertices_gid = NULL;
char *yo = "order_hex3d_oct";
int ngid_ent = zz->Num_GID; /* number of array entries in a global ID */
/* verify that 8 vertices were given for each hexadron; if not, punt */
for (j=0; j<8; j++) {
if (vert1[j] != 8*j) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Incorrect number of vertices "
"given for octasected hexahedra.");
for (i=0; i<8; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+7)*ngid_ent]);
}
return(ZOLTAN_WARN);
}
}
/* find the child that contains the in_vertex and make it first */
found = 0;
for (i=0; i<8 && !found; i++) {
for (j=0; j<8 && !found; j++) {
if (ZOLTAN_EQ_GID(zz,&vertices[(8*i+j)*ngid_ent],subroot->in_vertex)) {
ord[0] = i;
found = 1;
}
}
}
if (!found) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Couldn't find in_vertex in children");
for (i=0; i<8; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+7)*ngid_ent]);
}
return(ZOLTAN_WARN);
}
/* find the child that contains the out_vertex and make it last */
found = 0;
for (i=0; i<8 && !found; i++) {
for (j=0; j<8 && !found; j++) {
if (ZOLTAN_EQ_GID(zz,&vertices[(8*i+j)*ngid_ent],subroot->out_vertex)) {
ord[7] = i;
found = 1;
}
}
}
if (!found) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Couldn't find out_vertex in children");
for (i=0; i<8; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+7)*ngid_ent]);
}
return(ZOLTAN_WARN);
}
/* Construct a local numbering of the vertices, from 0 to 26 */
lvertices_gid = ZOLTAN_MALLOC_GID_ARRAY(zz,27);
vert = 0;
for (i=0; i<64; i++) {
found = -1;
for (j=0; j<vert && found==-1; j++) {
if (ZOLTAN_EQ_GID(zz,&vertices[i*ngid_ent],&lvertices_gid[j*ngid_ent])) {
found = j;
}
}
if (found==-1) {
ZOLTAN_SET_GID(zz,&lvertices_gid[vert*ngid_ent],&vertices[i*ngid_ent]);
found = vert;
vert++;
}
lvertices[i] = found;
}
if (vert != 27) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Didn't find 27 distinct vertices in children of hexahedron.");
for (i=0; i<8; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+7)*ngid_ent]);
}
return(ZOLTAN_WARN);
}
/* Determine a local numbering of the children as corners of the unit cube. */
/* Put the in element at (0,0,0). */
ecoord[ord[0]][0] = 0;
ecoord[ord[0]][1] = 0;
ecoord[ord[0]][2] = 0;
element[0][0][0] = ord[0];
/* If the out element shares 4 vertices with the in element, put it at (1,0,0)
If the out element shares 2 vertices with the in element, put it at (1,1,0)
If the out element shares 1 vertices with the in element, put it at (1,1,1)
If none of those apply, the data is erroneous. */
nshare = hex_nshared(ord[0],ord[7],lvertices,vert1);
if (nshare != 1 && nshare != 2 && nshare != 4) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Hexahedral children do not share 1, 2 or 4 vertices.");
for (i=0; i<8; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+7)*ngid_ent]);
}
return(ZOLTAN_WARN);
}
ecoord[ord[7]][0] = 1;
if (nshare == 4) {
ecoord[ord[7]][1] = 0;
nshare4 = 1;
element[1][0][0] = ord[7];
} else {
ecoord[ord[7]][1] = 1;
nshare4 = 0;
}
if (nshare == 1) {
ecoord[ord[7]][2] = 1;
element[1][1][1] = ord[7];
} else {
ecoord[ord[7]][2] = 0;
}
if (nshare == 2) {
nshare2 = 1;
share2[0] = ord[7];
element[1][1][0] = ord[7];
} else {
nshare2 = 0;
}
/* examine the other six elements for the number of vertices shared
with element 0,0,0. If it 4, then assign it to 1,0,0, then 0,1,0,
then 0,0,1. If it is 2, defer the assignment until the next step.
If it is 1, then assign it to 1,1,1
*/
for (i=0; i<8; i++) {
if (ord[0] != i && ord[7] != i) {
nshare = hex_nshared(ord[0],i,lvertices,vert1);
if (nshare == 4) {
ecoord[i][0] = 0;
ecoord[i][1] = 0;
ecoord[i][2] = 0;
ecoord[i][nshare4] = 1;
if (nshare4 == 0) {
element[1][0][0] = i;
} else {
if (nshare4 == 1) {
element[0][1][0] = i;
} else {
element[0][0][1] = i;
}
}
nshare4++;
} else {
if (nshare == 2) {
share2[nshare2] = i;
nshare2++;
} else {
if (nshare == 1) {
ecoord[i][0] = 1;
ecoord[i][1] = 1;
ecoord[i][2] = 1;
element[1][1][1] = i;
} else {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Hexahedral children do not share 1, 2 or 4 vertices.");
for (i=0; i<8; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+7)*ngid_ent]);
}
return(ZOLTAN_WARN);
}
}
}
}
}
/* For the three that share 2 vertices with element 0,0,0, see how many
they share with 1,0,0 and 0,1,0. If it is the out element, then
swap element 0,0,1 with one of those two to keep the out element at
1,1,0. Otherwise, assign the element to the proper position depending
on which elements it shares 4 vertices with.
*/
for (i=0; i<3; i++) {
nshare100 = hex_nshared(element[1][0][0],share2[i],lvertices,vert1);
nshare010 = hex_nshared(element[0][1][0],share2[i],lvertices,vert1);
if ((nshare100 != 1 && nshare100 != 2 && nshare100 != 4) ||
(nshare010 != 1 && nshare010 != 2 && nshare010 != 4)) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Hexahedral children do not share 1, 2 or 4 vertices.");
for (i=0; i<8; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+7)*ngid_ent]);
}
return(ZOLTAN_WARN);
}
if (share2[i] == ord[7]) {
if (nshare100 != 4) {
elem001 = element[1][0][0];
elem100 = element[0][0][1];
ecoord[elem100][0] = 1;
ecoord[elem100][1] = 0;
ecoord[elem100][2] = 0;
element[1][0][0] = elem100;
ecoord[elem001][0] = 0;
ecoord[elem001][1] = 0;
ecoord[elem001][2] = 1;
element[0][0][1] = elem001;
}
if (nshare010 != 4) {
elem001 = element[0][1][0];
elem010 = element[0][0][1];
ecoord[elem010][0] = 1;
ecoord[elem010][1] = 0;
ecoord[elem010][2] = 0;
element[0][1][0] = elem010;
ecoord[elem001][0] = 0;
ecoord[elem001][1] = 0;
ecoord[elem001][2] = 1;
element[0][0][1] = elem001;
}
} else {
if (nshare100 == 4 && nshare010 == 4) {
ecoord[share2[i]][0] = 1;
ecoord[share2[i]][1] = 1;
ecoord[share2[i]][2] = 0;
element[1][1][0] = share2[i];
} else {
if (nshare100 == 4) {
ecoord[share2[i]][0] = 1;
ecoord[share2[i]][1] = 0;
ecoord[share2[i]][2] = 1;
element[1][0][1] = share2[i];
} else {
ecoord[share2[i]][0] = 0;
ecoord[share2[i]][1] = 1;
ecoord[share2[i]][2] = 1;
element[0][1][1] = share2[i];
}
}
}
}
/* Determine a local numbering of the vertices as positions on the 2x2x2 cube.
This is found summing the coordinates of all the elements that contain
it and multiplying by 2 divided by the number of elements that contain it.
Amazing, huh?
*/
for (vert=0; vert<27; vert++) {
vcoord[vert][0] = 0;
vcoord[vert][1] = 0;
vcoord[vert][2] = 0;
count[vert] = 0;
}
for (i=0; i<8; i++) {
for (j=0; j<8; j++) {
vert = lvertices[vert1[i]+j];
vcoord[vert][0] = vcoord[vert][0] + ecoord[i][0];
vcoord[vert][1] = vcoord[vert][1] + ecoord[i][1];
vcoord[vert][2] = vcoord[vert][2] + ecoord[i][2];
count[vert]++;
}
}
for (vert=0; vert<27; vert++) {
if (count[vert] == 1 || count[vert] == 2 || count[vert] == 4 ||
count[vert] == 8) {
vcoord[vert][0] = (vcoord[vert][0]*2)/count[vert];
vcoord[vert][1] = (vcoord[vert][1]*2)/count[vert];
vcoord[vert][2] = (vcoord[vert][2]*2)/count[vert];
}
else {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "A vertex did not appear the right number of times in hexahedral children.");
for (i=0; i<8; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+7)*ngid_ent]);
}
return(ZOLTAN_WARN);
}
}
for (vert=0; vert<27; vert++) {
vertex[vcoord[vert][0]][vcoord[vert][1]][vcoord[vert][2]] = vert;
}
/* Select one of three templates depending on whether the out element
is at (1,0,0), (1,1,0), or (1,1,1) */
if (element[1][0][0] == ord[7]) {
ZOLTAN_SET_GID(zz, &in_vertex[ord[0]*ngid_ent],
&lvertices_gid[vertex[0][0][0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[0]*ngid_ent],
&lvertices_gid[vertex[0][1][0]*ngid_ent]);
ord[1] = element[0][1][0];
ZOLTAN_SET_GID(zz, &in_vertex[ord[1]*ngid_ent],
&lvertices_gid[vertex[0][1][0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[1]*ngid_ent],
&lvertices_gid[vertex[0][1][1]*ngid_ent]);
ord[2] = element[0][1][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[2]*ngid_ent],
&lvertices_gid[vertex[0][1][1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[2]*ngid_ent],
&lvertices_gid[vertex[0][1][2]*ngid_ent]);
ord[3] = element[0][0][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[3]*ngid_ent],
&lvertices_gid[vertex[0][1][2]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[3]*ngid_ent],
&lvertices_gid[vertex[1][1][2]*ngid_ent]);
ord[4] = element[1][0][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[4]*ngid_ent],
&lvertices_gid[vertex[1][1][2]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[4]*ngid_ent],
&lvertices_gid[vertex[2][1][2]*ngid_ent]);
ord[5] = element[1][1][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[5]*ngid_ent],
&lvertices_gid[vertex[2][1][2]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[5]*ngid_ent],
&lvertices_gid[vertex[2][1][1]*ngid_ent]);
ord[6] = element[1][1][0];
ZOLTAN_SET_GID(zz, &in_vertex[ord[6]*ngid_ent],
&lvertices_gid[vertex[2][1][1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[6]*ngid_ent],
&lvertices_gid[vertex[2][1][0]*ngid_ent]);
ZOLTAN_SET_GID(zz, &in_vertex[ord[7]*ngid_ent],
&lvertices_gid[vertex[2][1][0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[7]*ngid_ent],
&lvertices_gid[vertex[2][0][0]*ngid_ent]);
} else {
if (element[1][1][0] == ord[7]) {
ZOLTAN_SET_GID(zz, &in_vertex[ord[0]*ngid_ent],
&lvertices_gid[vertex[0][0][0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[0]*ngid_ent],
&lvertices_gid[vertex[1][0][0]*ngid_ent]);
ord[1] = element[1][0][0];
ZOLTAN_SET_GID(zz, &in_vertex[ord[1]*ngid_ent],
&lvertices_gid[vertex[1][0][0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[1]*ngid_ent],
&lvertices_gid[vertex[1][0][1]*ngid_ent]);
ord[2] = element[1][0][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[2]*ngid_ent],
&lvertices_gid[vertex[1][0][1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[2]*ngid_ent],
&lvertices_gid[vertex[1][0][2]*ngid_ent]);
ord[3] = element[0][0][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[3]*ngid_ent],
&lvertices_gid[vertex[1][0][2]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[3]*ngid_ent],
&lvertices_gid[vertex[1][1][2]*ngid_ent]);
ord[4] = element[0][1][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[4]*ngid_ent],
&lvertices_gid[vertex[1][1][2]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[4]*ngid_ent],
&lvertices_gid[vertex[1][1][1]*ngid_ent]);
ord[5] = element[0][1][0];
ZOLTAN_SET_GID(zz, &in_vertex[ord[5]*ngid_ent],
&lvertices_gid[vertex[1][1][1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[5]*ngid_ent],
&lvertices_gid[vertex[1][2][1]*ngid_ent]);
ord[6] = element[1][1][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[6]*ngid_ent],
&lvertices_gid[vertex[1][2][1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[6]*ngid_ent],
&lvertices_gid[vertex[2][2][1]*ngid_ent]);
ZOLTAN_SET_GID(zz, &in_vertex[ord[7]*ngid_ent],
&lvertices_gid[vertex[2][2][1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[7]*ngid_ent],
&lvertices_gid[vertex[2][2][0]*ngid_ent]);
} else {
if (element[1][1][1] == ord[7]) {
ZOLTAN_SET_GID(zz, &in_vertex[ord[0]*ngid_ent],
&lvertices_gid[vertex[0][0][0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[0]*ngid_ent],
&lvertices_gid[vertex[1][0][0]*ngid_ent]);
ord[1] = element[1][0][0];
ZOLTAN_SET_GID(zz, &in_vertex[ord[1]*ngid_ent],
&lvertices_gid[vertex[1][0][0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[1]*ngid_ent],
&lvertices_gid[vertex[1][1][0]*ngid_ent]);
ord[2] = element[1][1][0];
ZOLTAN_SET_GID(zz, &in_vertex[ord[2]*ngid_ent],
&lvertices_gid[vertex[1][1][0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[2]*ngid_ent],
&lvertices_gid[vertex[1][2][0]*ngid_ent]);
ord[3] = element[0][1][0];
ZOLTAN_SET_GID(zz, &in_vertex[ord[3]*ngid_ent],
&lvertices_gid[vertex[1][2][0]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[3]*ngid_ent],
&lvertices_gid[vertex[1][2][1]*ngid_ent]);
ord[4] = element[0][1][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[4]*ngid_ent],
&lvertices_gid[vertex[1][2][1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[4]*ngid_ent],
&lvertices_gid[vertex[1][1][1]*ngid_ent]);
ord[5] = element[0][0][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[5]*ngid_ent],
&lvertices_gid[vertex[1][1][1]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[5]*ngid_ent],
&lvertices_gid[vertex[1][1][2]*ngid_ent]);
ord[6] = element[1][0][1];
ZOLTAN_SET_GID(zz, &in_vertex[ord[6]*ngid_ent],
&lvertices_gid[vertex[1][1][2]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[6]*ngid_ent],
&lvertices_gid[vertex[2][1][2]*ngid_ent]);
ZOLTAN_SET_GID(zz, &in_vertex[ord[7]*ngid_ent],
&lvertices_gid[vertex[2][1][2]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[ord[7]*ngid_ent],
&lvertices_gid[vertex[2][2][2]*ngid_ent]);
} else {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Out element is not assigned correctly.");
for (i=0; i<8; i++) {
order[i] = i;
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+7)*ngid_ent]);
}
ZOLTAN_FREE(&lvertices_gid);
return(ZOLTAN_WARN);
}
}
}
/* invert the permutation matrix */
for (i=0; i<8; i++) {
order[ord[i]] = i;
}
ZOLTAN_FREE(&lvertices_gid);
return(ZOLTAN_OK);
}
/*****************************************************************************/
static int hex_nshared(int elem1, int elem2, int *lvertices, int *vert1)
{
/*
* This function counts the number of vertices shared by hexahedral elements
* elem1 and elem2, where lvertices lists the 8 vertices of elemX starting
* at position vert1[X]
*/
int i,j,count,found;
count = 0;
for (i=0; i<8; i++) {
found = 0;
for (j=0; j<8 && !found; j++) {
if (lvertices[vert1[elem1]+i] == lvertices[vert1[elem2]+j]) {
count++;
found = 1;
}
}
}
return(count);
}
/*****************************************************************************/
static int order_other_ref(ZZ *zz, ZOLTAN_REFTREE *parent, int num_child,
int *num_vert, int *vert1, ZOLTAN_ID_PTR vertices,
int *order, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex)
{
/*
* Function to determine the order of the children for an undetermined
* refinement scheme. This is expensive as it performs a tree search
* to solve this NP hard problem, but it should work for any refinement.
*/
char *yo = "order_other_ref";
int i, j, vi, vj; /* loop counters */
int *has_in; /* flag for children having in vertex */
int *has_out; /* flag for children having out vertex */
int **share_vert; /* number of vertices shared by two elements */
int max_share; /* maximum number of vertices shared by two elements */
int solved; /* flag for having found the solution */
int final_ierr; /* error code returned */
int *on_path; /* flag for already placed element on path */
int ngid_ent = zz->Num_GID; /* number of array entries in a global ID */
final_ierr = ZOLTAN_OK;
/*
* Determine which elements contain the in and out vertices of the parent
*/
has_in = (int *) ZOLTAN_MALLOC(num_child*sizeof(int));
has_out = (int *) ZOLTAN_MALLOC(num_child*sizeof(int));
if (has_in == NULL || has_out == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 2, &has_in,
&has_out);
return(ZOLTAN_MEMERR);
}
for (i=0; i<num_child; i++) {
has_in[i] = FALSE;
has_out[i] = FALSE;
for (j=0; j<num_vert[i] && !has_in[i]; j++)
if (ZOLTAN_EQ_GID(zz,&vertices[(vert1[i]+j)*ngid_ent],
parent->in_vertex)) has_in[i] = TRUE;
for (j=0; j<num_vert[i] && !has_out[i]; j++)
if (ZOLTAN_EQ_GID(zz,&vertices[(vert1[i]+j)*ngid_ent],
parent->out_vertex)) has_out[i] = TRUE;
}
/*
* Determine which elements share vertices other than the in/out vertices
*/
share_vert = (int **) ZOLTAN_MALLOC(num_child*sizeof(int *));
if (share_vert == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 3, &share_vert,
&has_in,
&has_out);
return(ZOLTAN_MEMERR);
}
for (i=0; i<num_child; i++) {
share_vert[i] = (int *) ZOLTAN_MALLOC(num_child*sizeof(int));
if (share_vert[i] == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
for (j=0; j<=i; j++) ZOLTAN_FREE(&(share_vert[j]));
Zoltan_Multifree(__FILE__, __LINE__, 3, &share_vert,
&has_in,
&has_out);
return(ZOLTAN_MEMERR);
}
}
max_share = 0;
for (i=0; i<num_child; i++) {
share_vert[i][i] = 1;
for (j=i+1; j<num_child; j++) {
share_vert[i][j] = 0;
share_vert[j][i] = 0;
for (vi=0; vi<num_vert[i]; vi++) {
for (vj=0; vj<num_vert[j]; vj++) {
if (ZOLTAN_EQ_GID(zz,&vertices[(vert1[i]+vi)*ngid_ent],
&vertices[(vert1[j]+vj)*ngid_ent])) {
if (!ZOLTAN_EQ_GID(zz,&vertices[(vert1[i]+vi)*ngid_ent],
parent->in_vertex) &&
!ZOLTAN_EQ_GID(zz,&vertices[(vert1[i]+vi)*ngid_ent],
parent->out_vertex)) {
share_vert[i][j] = share_vert[i][j] + 1;
share_vert[j][i] = share_vert[i][j];
}
}
}
}
if (share_vert[i][j] > max_share) {
max_share = share_vert[i][j];
}
}
}
/*
* Perform tree search to find solution
*/
solved = 0;
on_path = (int *) ZOLTAN_MALLOC(num_child*sizeof(int));
if (on_path == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
for (j=0; j<num_child; j++) ZOLTAN_FREE(&(share_vert[j]));
Zoltan_Multifree(__FILE__, __LINE__, 4, &on_path,
&share_vert,
&has_in,
&has_out);
return(ZOLTAN_MEMERR);
}
for (i=0; i<num_child; i++) on_path[i]=0;
/*
* Try each element with the in vertex to start the path
*/
for (i=0; i<num_child && !solved; i++) {
if (has_in[i]) {
order_other_ref_recur(i,0,order,on_path,num_child,
has_out,share_vert,max_share,&solved);
}
}
/*
* This should have found a solution, but if not then use given order
*/
if (!solved) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Couldn't find path through children."
" Using given order.");
for (i=0; i<num_child; i++) order[i] = i;
final_ierr = ZOLTAN_WARN;
}
for (j=0; j<num_child; j++) /* KDD Added to remove memory leak */
ZOLTAN_FREE(&(share_vert[j]));
ZOLTAN_FREE(&on_path);
ZOLTAN_FREE(&share_vert);
ZOLTAN_FREE(&has_out);
/*
* Finally, determine the in and out vertices of each child
*/
ZOLTAN_SET_GID(zz,&in_vertex[order[0]*ngid_ent],parent->in_vertex);
ZOLTAN_SET_GID(zz,&out_vertex[order[num_child-1]*ngid_ent],
parent->out_vertex);
solved = find_inout(zz, 0, num_child, num_vert, vert1, vertices, in_vertex,
out_vertex, order);
if (!solved) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "Couldn't find good set of in/out"
" vertices. Using first and second.\n");
for (i=0; i<num_child; i++) {
ZOLTAN_SET_GID(zz,&in_vertex[i*ngid_ent],&vertices[vert1[i]*ngid_ent]);
ZOLTAN_SET_GID(zz,&out_vertex[i*ngid_ent],
&vertices[(vert1[i]+1)*ngid_ent]);
}
final_ierr = ZOLTAN_WARN;
}
/*
* Invert the permutation matrix (order) to agree with it's usage in
* Zoltan_Reftree_Build_Recursive, using has_in as workspace
*/
for (i=0; i<num_child; i++) {
has_in[order[i]] = i;
}
for (i=0; i<num_child; i++) {
order[i] = has_in[i];
}
ZOLTAN_FREE(&has_in);
return(final_ierr);
}
/*****************************************************************************/
static void order_other_ref_recur(int new_entry, int level, int *order,
int *on_path,
int num_child, int *has_out, int **share_vert,
int max_share, int *solved)
{
/*
* Recursive routine to search the solution space tree
*/
int i, nshare;
if (level == num_child-1) {
/*
* End of a path, success if this element has the out vertex
*/
if (has_out[new_entry]) {
order[level] = new_entry;
*solved = 1;
}
else {
*solved = 0;
}
}
else {
/*
* Add this element to the proposed path
*/
order[level] = new_entry;
on_path[new_entry] = 1;
/*
* Try each element that is not already on the path and shares a vertex
* with the current new entry, starting first with those that share the
* most vertices to give a preference to going through faces
*/
for (nshare = max_share; nshare>0 && !(*solved); nshare--) {
for (i=0; i<num_child && !(*solved); i++) {
if (!on_path[i] && share_vert[new_entry][i]==nshare) {
order_other_ref_recur(i, level+1, order, on_path, num_child, has_out,
share_vert, max_share, solved);
}
}
}
on_path[new_entry] = 0;
}
}
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
static int find_inout(ZZ *zz,int level,int num_child,int *num_vert,int *vert1,
ZOLTAN_ID_PTR vertices, ZOLTAN_ID_PTR in_vertex,
ZOLTAN_ID_PTR out_vertex, int *order)
{
/*
* Function to find in and out vertices.
* On first call, the first in_vertex and last out_vertex should already be set.
* level should be 0 in the first call.
*/
int i, j; /* loop counters */
int solved; /* found a solution */
int ngid_ent = zz->Num_GID; /* number of array entries in a global ID */
if (level == num_child-1) {
/*
* Last element. Success if the in vertex is not the last out
*/
if (ZOLTAN_EQ_GID(zz,&in_vertex[order[level]*ngid_ent],
&out_vertex[order[level]*ngid_ent]))
solved = 0;
else
solved = 1;
}
else {
/*
* Not last element.
* Try each vertex that is not the in vertex, and if the next element in
* the path shares that vertex, move on to the next element
*/
solved = 0;
for (i=0; i<num_vert[order[level]] && !solved; i++) {
if (!ZOLTAN_EQ_GID(zz,&vertices[(vert1[order[level]]+i)*ngid_ent],
&in_vertex[order[level]*ngid_ent])) {
for (j=0; j<num_vert[order[level+1]] && !solved; j++) {
if (ZOLTAN_EQ_GID(zz,&vertices[(vert1[order[level+1]]+j)*ngid_ent],
&vertices[(vert1[order[level]]+i)*ngid_ent])) {
ZOLTAN_SET_GID(zz,&out_vertex[order[level]*ngid_ent],
&vertices[(vert1[order[level]]+i)*ngid_ent]);
ZOLTAN_SET_GID(zz,&in_vertex[order[level+1]*ngid_ent],
&vertices[(vert1[order[level]]+i)*ngid_ent]);
solved = find_inout(zz,level+1,num_child,num_vert,vert1,vertices,
in_vertex, out_vertex, order);
}
}
}
}
}
return(solved);
}
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
static int alloc_reftree_nodes(ZZ *zz, ZOLTAN_REFTREE **node, int num_node,
int *num_vert)
{
/*
* Function to allocate num_node refinement tree nodes
*/
/*
* A pointer to the first allocated node is returned in node.
* num_vert is input to indicate the number of vertices to allocate for
* the element corresponding to each node.
*/
ZOLTAN_ID_PTR gids; /* pointer to memory for GIDs */
ZOLTAN_ID_PTR lids; /* pointer to memory for LIDs */
ZOLTAN_ID_PTR verts; /* pointer to memory for vertices */
ZOLTAN_ID_PTR ins; /* pointer to memory for in_vertices */
ZOLTAN_ID_PTR outs; /* pointer to memory for out_vertices */
float *float_mem; /* pointer to memory for floats */
int sum_vert; /* sum of num_vert */
int wdim; /* dimension of object weights */
int i; /* loop counter */
char *yo = "alloc_reftree_nodes";
if (zz->Obj_Weight_Dim == 0) {
wdim = 1;
} else {
wdim = zz->Obj_Weight_Dim;
}
/* compute sum of num_vert */
sum_vert = 0;
for (i=0; i<num_node; i++) sum_vert = sum_vert + num_vert[i];
/* allocate the structures themselves */
*node = (ZOLTAN_REFTREE *) ZOLTAN_MALLOC(num_node*sizeof(ZOLTAN_REFTREE));
/* allocate memory to be used within the structures */
gids = ZOLTAN_MALLOC_GID_ARRAY(zz, num_node);
lids = ZOLTAN_MALLOC_LID_ARRAY(zz, num_node);
verts = ZOLTAN_MALLOC_GID_ARRAY(zz, sum_vert);
ins = ZOLTAN_MALLOC_GID_ARRAY(zz, num_node);
outs = ZOLTAN_MALLOC_GID_ARRAY(zz, num_node);
float_mem = (float *) ZOLTAN_MALLOC(3*wdim*num_node*sizeof(float));
if (*node == NULL || gids == NULL || lids == NULL || verts == NULL ||
ins == NULL || outs == NULL || float_mem == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 7, &gids,
&lids,
&verts,
&ins,
&outs,
&float_mem,
node);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
/* divide the memory up among the nodes */
for (i=0; i<num_node; i++) {
(*node)[i].global_id = gids;
gids += zz->Num_GID;
(*node)[i].local_id = lids;
lids += zz->Num_LID;
(*node)[i].weight = float_mem;
(*node)[i].summed_weight = float_mem+wdim;
(*node)[i].my_sum_weight = float_mem+2*wdim;
float_mem += 3*wdim;
(*node)[i].vertices = verts;
verts += zz->Num_GID*num_vert[i];
(*node)[i].in_vertex = ins;
ins += zz->Num_GID;
(*node)[i].out_vertex = outs;
outs += zz->Num_GID;
}
return(ZOLTAN_OK);
}
/*****************************************************************************/
static void free_reftree_nodes(ZOLTAN_REFTREE **node)
{
/*
* Function to free memory of one or more refinement tree nodes.
* node should be a pointer returned by alloc_reftree_nodes; all nodes
* allocated by that call are freed.
*/
if (*node != NULL) {
ZOLTAN_FREE(&((*node)->global_id));
ZOLTAN_FREE(&((*node)->local_id));
ZOLTAN_FREE(&((*node)->weight));
ZOLTAN_FREE(&((*node)->vertices));
ZOLTAN_FREE(&((*node)->in_vertex));
ZOLTAN_FREE(&((*node)->out_vertex));
ZOLTAN_FREE(node);
}
}
/*****************************************************************************/
void Zoltan_Reftree_Free_Structure(ZZ *zz)
{
/*
* Function to free all the memory of a refinement tree
*/
struct Zoltan_Reftree_data_struct *reftree_data; /* data structure from zz */
ZOLTAN_REFTREE *root; /* Root of the refinement tree */
struct Zoltan_Reftree_hash_node **hashtab; /* hash table */
int hashsize; /* dimension of hash table */
int i; /* loop counter */
if (zz->LB.Data_Structure == NULL) return; /* Nothing to do */
reftree_data = (struct Zoltan_Reftree_data_struct *)zz->LB.Data_Structure;
root = reftree_data->reftree_root;
if (root != NULL) {
/*
* Make all the children of the root be leaves, recursively
*/
if (root->children != NULL) {
for (i=0; i<root->num_child; i++)
Zoltan_Reftree_Free_Subtree(zz, &(root->children[i]));
}
/*
* Free the memory used by the children, making root a leaf
*/
free_reftree_nodes(&(root->children));
/*
* Free the root
*/
free_reftree_nodes(&root);
}
/*
* Free the memory in the hash table
*/
hashtab = reftree_data->hash_table;
hashsize = reftree_data->hash_table_size;
if (hashtab != NULL) {
Zoltan_Reftree_Clear_Hash_Table(hashtab,hashsize);
ZOLTAN_FREE(&hashtab);
}
ZOLTAN_FREE(&(zz->LB.Data_Structure));
}
static void Zoltan_Reftree_Free_Subtree(ZZ *zz, ZOLTAN_REFTREE *subroot)
{
/*
* Function to free the memory of a subtree. Upon return, subroot is a leaf.
*/
int i; /* loop counter */
struct Zoltan_Reftree_data_struct *reftree_data; /* data structure from zz */
if (subroot != NULL) {
reftree_data = (struct Zoltan_Reftree_data_struct *)zz->LB.Data_Structure;
/*
* Turn all the children into leaves and remove them from the hash table
*/
if (subroot->children != NULL) {
for (i=0; i<subroot->num_child; i++) {
Zoltan_Reftree_Free_Subtree(zz,&(subroot->children[i]));
Zoltan_Reftree_Hash_Remove(zz,&(subroot->children[i]),
reftree_data->hash_table,
reftree_data->hash_table_size);
}
/*
* Free the memory used by the children, making subroot a leaf
*/
free_reftree_nodes(&(subroot->children));
subroot->num_child = 0;
}
}
}
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
static int Zoltan_Reftree_Reinit_Coarse(ZZ *zz)
{
/*
* Function to reestablish which coarse grid elements are known to this proc
*/
/*****************************************************************************/
/*****************************************************************************/
/*****************************************************************************/
char *yo = "Zoltan_Reftree_Reinit_Coarse";
ZOLTAN_REFTREE *root; /* Root of the refinement tree */
struct Zoltan_Reftree_hash_node **hashtab; /* hash table */
int hashsize; /* dimension of hash table */
int i; /* loop counter */
ZOLTAN_ID_PTR local_gids; /* coarse element Global IDs from user */
ZOLTAN_ID_PTR local_lids; /* coarse element Local IDs from user */
ZOLTAN_ID_PTR lid; /* temporary coarse element Local ID; used to pass
NULL to query functions when NUM_LID_ENTRIES=0 */
int *assigned; /* 1 if the element is assigned to this proc */
int *known; /* 1 if the element is known to this proc */
int *num_vert; /* number of vertices for each coarse element */
ZOLTAN_ID_PTR vertices; /* vertices for the coarse elements */
ZOLTAN_ID_PTR in_vertex; /* "in" vertex for each coarse element */
ZOLTAN_ID_PTR out_vertex; /* "out" vertex for each coarse element */
ZOLTAN_ID_PTR plocal_gids;/* previous coarse element Global IDs from user */
ZOLTAN_ID_PTR plocal_lids;/* previous coarse element Local IDs from user */
int iassigned; /* 1 if the element is assigned to this proc */
int inum_vert; /* number of vertices for a coarse element */
int in_order; /* 1 if user is supplying order of the elements */
int num_obj; /* number of coarse objects known to this proc */
int ierr; /* error flag */
ZOLTAN_REFTREE *tree_node;/* pointer to an initial grid element in the tree */
int final_ierr; /* error code returned */
int found; /* flag for another coarse grid element */
int ngid_ent = zz->Num_GID; /* number of array entries in a global ID */
int nlid_ent = zz->Num_LID; /* number of array entries in a local ID */
ZOLTAN_TRACE_ENTER(zz, yo);
root = ((struct Zoltan_Reftree_data_struct *)zz->LB.Data_Structure)->reftree_root;
hashtab = ((struct Zoltan_Reftree_data_struct *)zz->LB.Data_Structure)->hash_table;
hashsize = ((struct Zoltan_Reftree_data_struct *)zz->LB.Data_Structure)->hash_table_size;
final_ierr = ZOLTAN_OK;
/*
* Mark all coarse elements as unknown
*/
for (i=0; i<root->num_child; i++) {
((root->children)[i]).known_to_me = 0;
}
/*
* Get the coarse grid objects and update the local ids, whether the element
* is assigned to this processor, whether the element is known to this
* processor and weight.
*/
if (zz->Get_Coarse_Obj_List != NULL) {
/*
* Get objects via list
*/
num_obj = zz->Get_Num_Coarse_Obj(zz->Get_Num_Coarse_Obj_Data, &ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Num_Coarse_Obj.");
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
if (num_obj > 0) {
local_gids = ZOLTAN_MALLOC_GID_ARRAY(zz, num_obj);
local_lids = ZOLTAN_MALLOC_LID_ARRAY(zz, num_obj);
assigned = (int *) ZOLTAN_MALLOC(num_obj*sizeof(int));
known = (int *) ZOLTAN_MALLOC(num_obj*sizeof(int));
num_vert = (int *) ZOLTAN_MALLOC(num_obj*sizeof(int));
vertices = ZOLTAN_MALLOC_GID_ARRAY(zz, MAXVERT*num_obj);
in_vertex = ZOLTAN_MALLOC_GID_ARRAY(zz, num_obj);
out_vertex = ZOLTAN_MALLOC_GID_ARRAY(zz, num_obj);
if (local_gids == NULL || (nlid_ent > 0 && local_lids == NULL) ||
assigned == NULL || known == NULL ||
num_vert == NULL || vertices == NULL || in_vertex == NULL ||
out_vertex == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 8, &local_gids,
&local_lids,
&assigned,
&known,
&num_vert,
&vertices,
&in_vertex,
&out_vertex);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
zz->Get_Coarse_Obj_List(zz->Get_Coarse_Obj_List_Data,
ngid_ent, nlid_ent,
local_gids, local_lids,
assigned, num_vert, vertices,
&in_order, in_vertex, out_vertex, &ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_Coarse_Obj_List.");
Zoltan_Multifree(__FILE__, __LINE__, 8, &local_gids,
&local_lids,
&assigned,
&known,
&num_vert,
&vertices,
&in_vertex,
&out_vertex);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
for (i=0; i<num_obj; i++) {
tree_node = Zoltan_Reftree_hash_lookup(zz, hashtab,
&(local_gids[i*ngid_ent]),
hashsize);
if (tree_node == NULL) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "coarse grid element not"
" previously seen.");
final_ierr = ZOLTAN_WARN;
}
else {
tree_node->assigned_to_me = assigned[i];
tree_node->known_to_me = 1;
ZOLTAN_SET_LID(zz, tree_node->local_id, &(local_lids[i*nlid_ent]));
if (zz->Obj_Weight_Dim == 0)
tree_node->weight[0] = 0.0;
else {
lid = (nlid_ent ? &(local_lids[i*nlid_ent]) : NULL);
zz->Get_Child_Weight(zz->Get_Child_Weight_Data,
ngid_ent, nlid_ent,
&(local_gids[i*ngid_ent]),
lid,
zz->Obj_Weight_Dim,
tree_node->weight, &ierr);
}
}
}
Zoltan_Multifree(__FILE__, __LINE__, 8, &local_gids,
&local_lids,
&assigned,
&known,
&num_vert,
&vertices,
&in_vertex,
&out_vertex);
}
}
else {
/*
* Get objects via first/next
*/
local_gids = ZOLTAN_MALLOC_GID(zz);
local_lids = ZOLTAN_MALLOC_LID(zz);
in_vertex = ZOLTAN_MALLOC_GID(zz);
out_vertex = ZOLTAN_MALLOC_GID(zz);
plocal_gids = ZOLTAN_MALLOC_GID(zz);
plocal_lids = ZOLTAN_MALLOC_LID(zz);
vertices = ZOLTAN_MALLOC_GID_ARRAY(zz,MAXVERT);
if (local_gids == NULL || (nlid_ent > 0 && local_lids == NULL) ||
plocal_gids == NULL || (nlid_ent > 0 && plocal_lids == NULL) ||
in_vertex == NULL || out_vertex == NULL ||
vertices == NULL) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo, "Insufficient memory.");
Zoltan_Multifree(__FILE__, __LINE__, 7, &local_gids,
&local_lids,
&plocal_gids,
&plocal_lids,
&in_vertex,
&out_vertex,
&vertices);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ZOLTAN_MEMERR);
}
found = zz->Get_First_Coarse_Obj(zz->Get_First_Coarse_Obj_Data,
ngid_ent, nlid_ent,
local_gids, local_lids, &iassigned,
&inum_vert, vertices, &in_order,
in_vertex, out_vertex, &ierr);
if (ierr) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned from user function Get_First_Coarse_Obj.");
Zoltan_Multifree(__FILE__, __LINE__, 7, &local_gids,
&local_lids,
&plocal_gids,
&plocal_lids,
&in_vertex,
&out_vertex,
&vertices);
ZOLTAN_TRACE_EXIT(zz, yo);
return(ierr);
}
while (found) {
tree_node = Zoltan_Reftree_hash_lookup(zz, hashtab,local_gids,hashsize);
if (tree_node == NULL) {
ZOLTAN_PRINT_WARN(zz->Proc, yo, "coarse grid element not"
" previously seen.");
final_ierr = ZOLTAN_WARN;
}
else {
tree_node->assigned_to_me = iassigned;
tree_node->known_to_me = 1;
ZOLTAN_SET_LID(zz, tree_node->local_id, local_lids);
if (zz->Obj_Weight_Dim == 0)
tree_node->weight[0] = 0.0;
else
zz->Get_Child_Weight(zz->Get_Child_Weight_Data,
ngid_ent, nlid_ent,
local_gids, local_lids, zz->Obj_Weight_Dim,
tree_node->weight, &ierr);
}
ZOLTAN_SET_GID(zz, plocal_gids, local_gids);
ZOLTAN_SET_LID(zz, plocal_lids, local_lids);
found = zz->Get_Next_Coarse_Obj(zz->Get_Next_Coarse_Obj_Data,
ngid_ent, nlid_ent,
plocal_gids, plocal_lids,
local_gids, local_lids, &iassigned,
&inum_vert, vertices,
in_vertex, out_vertex, &ierr);
}
Zoltan_Multifree(__FILE__, __LINE__, 7, &local_gids,
&local_lids,
&plocal_gids,
&plocal_lids,
&in_vertex,
&out_vertex,
&vertices);
}
ZOLTAN_TRACE_EXIT(zz, yo);
return(final_ierr);
}
void Zoltan_Reftree_Print(ZZ *zz, ZOLTAN_REFTREE *subroot, int level)
{
/*
* Print the refinement tree, for debugging
*/
int i, me;
if (subroot == NULL) return;
me = zz->Proc;
printf("\n");
printf("[%d] refinement tree node with local id ", me);
ZOLTAN_PRINT_LID(zz, subroot->local_id);
printf(" on level %d\n", level);
printf("[%d] Global ID ",me);
ZOLTAN_PRINT_GID(zz, subroot->global_id);
printf("\n");
printf("[%d] first weight %f\n",me,subroot->weight[0]);
printf("[%d] first summed weight %f\n",me,subroot->summed_weight[0]);
printf("[%d] first my_sum weight %f\n",me,subroot->my_sum_weight[0]);
printf("[%d] number of vertices %d\n",me,subroot->num_vertex);
printf("[%d] vertices",me);
for (i=0; i<subroot->num_vertex; i++) {
printf("[%d] ",me);
ZOLTAN_PRINT_GID(zz,&subroot->vertices[i*zz->Num_GID]);
}
printf("\n");
printf("[%d] in vertex ",me);
ZOLTAN_PRINT_GID(zz,subroot->in_vertex);
printf("\n");
printf("[%d] out vertex ",me);
ZOLTAN_PRINT_GID(zz,subroot->out_vertex);
printf("\n");
printf("[%d] assigned_to_me %d\n",me,subroot->assigned_to_me);
printf("[%d] known_to_me %d\n",me,subroot->known_to_me);
printf("[%d] partition %d\n",me,subroot->partition);
printf("[%d] number of children %d \n",me,subroot->num_child);
printf("[%d] children follow.\n",me);
for (i=0; i<subroot->num_child; i++)
Zoltan_Reftree_Print(zz,&(subroot->children[i]),level+1);
}
static void get_child_order_recur(ZZ *zz, ZOLTAN_REFTREE *subroot, int *isub, int *order)
{
/*
* adds the children to order and recursively continues down the tree
*/
int i, j;
/*
* if no children, done with this branch
*/
if (subroot->num_child == 0) {
return;
}
/*
* add the subroot and children to order
*/
for (j=0; j<zz->Num_GID; j++) order[*isub+j] = subroot->global_id[j];
for (i=0; i<subroot->num_child; i++) {
for (j=0; j<zz->Num_GID; j++) order[*isub+zz->Num_GID*(3*i+1)+j] =
(subroot->children[i]).global_id[j];
for (j=0; j<zz->Num_GID; j++) order[*isub+zz->Num_GID*(3*i+2)+j] =
(subroot->children[i]).in_vertex[j];
for (j=0; j<zz->Num_GID; j++) order[*isub+zz->Num_GID*(3*i+3)+j] =
(subroot->children[i]).out_vertex[j];
}
*isub = *isub + zz->Num_GID*(3*subroot->num_child + 1);
/*
* traverse the children
*/
for (i=0; i<subroot->num_child; i++) {
get_child_order_recur(zz, &(subroot->children[i]), isub, order);
}
}
void Zoltan_Reftree_Get_Child_Order(ZZ *zz, int *order, int *ierr)
{
/*
* Return the order of the children in the refinement tree.
* Upon return, order contains GIDs. It contains
* sets of entries consisting of the GID of an element followed by the
* GIDs of the children in the order determined by the reftree code,
* and each child is followed by the GIDs of the in and out vertices.
* order should be allocated to the correct size by the caller.
* This is a hack and should not be publicized.
*/
char *yo = "Zoltan_Reftree_Get_Child_Order";
int isub;
ZOLTAN_REFTREE *root;
*ierr = ZOLTAN_OK;
/*
* initialize the tree, if not already done
*/
if (zz->LB.Data_Structure == NULL) {
*ierr = Zoltan_Reftree_Init(zz);
if (*ierr==ZOLTAN_FATAL || *ierr==ZOLTAN_MEMERR) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned by Zoltan_Reftree_Init.");
return;
}
}
/*
* build the refinement tree
*/
*ierr = Zoltan_Reftree_Build(zz);
if (*ierr==ZOLTAN_FATAL || *ierr==ZOLTAN_MEMERR) {
ZOLTAN_PRINT_ERROR(zz->Proc, yo,
"Error returned by Zoltan_Reftree_Build.");
return;
}
/*
* traverse the tree to find the child order
*/
root = ((struct Zoltan_Reftree_data_struct *)zz->LB.Data_Structure)->reftree_root;
isub = 0;
get_child_order_recur(zz,root,&isub,order);
/*
* delete the tree, except for the first level (initial coarse grid)
*/
}
#ifdef __cplusplus
} /* closing bracket for extern "C" */
#endif