src_old/src/h5core/h5t_core.c

#include <string.h>

#include "h5t_types_private.h"
#include "h5core/h5t_map.h"

#include "h5t_map_private.h"
#include "h5t_core_private.h"
#include "h5t_access_private.h"
#include "h5t_errorhandling_private.h"

h5_err_t
h5tpriv_grow_te_htab (
        h5t_mesh_t* const m,
        size_t nel
        );

h5_err_t
h5tpriv_grow_td_htab (
        h5t_mesh_t* const m,
        size_t nel
        ) ;

h5_err_t
h5tpriv_enter_tv2 (
        h5t_mesh_t* const m,
        h5_loc_idx_t face_idx,          // in
        h5_loc_idx_t elem_idx,          // in
        h5_loc_idlist_t** idlist        // out
        ) {
	H5_PRIV_API_ENTER (h5_err_t,
	                   "m=%p, face_idx=%lld, elem_idx=%lld, idlist=%p",
	                   m, (long long)face_idx, (long long)elem_idx, idlist);

	h5_loc_idx_t vertex_idx;
	TRY (h5tpriv_get_loc_vtx_idx_of_vtx2 (
	             m,
	             face_idx, elem_idx,
	             &vertex_idx));

	TRY (h5priv_search_in_loc_idlist (
	             &m->adjacencies.tv.v[vertex_idx],
	             h5tpriv_build_vertex_id (face_idx, elem_idx)));

	// set return value
	if (idlist) {
		*idlist = m->adjacencies.tv.v[vertex_idx];
	}

	H5_PRIV_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5tpriv_enter_te2 (
        h5t_mesh_t* const m,
        h5_loc_idx_t face_idx,
        h5_loc_idx_t elem_idx,
        h5_loc_idlist_t** idlist
        ) {
	H5_PRIV_API_ENTER (h5_err_t,
	                   "m=%p, face_idx=%lld, elem_idx=%lld, idlist=%p",
	                   m, (long long)face_idx, (long long)elem_idx, idlist);
	h5t_adjacencies_t* a = &m->adjacencies;
	void* __retval;
	static h5t_te_entry_t* entry = NULL;

	if (entry == NULL) {
		TRY (entry = h5_calloc (1, sizeof (*entry)));
	}
	TRY (h5t_get_loc_vertex_indices_of_edge2 (
	             m, face_idx, elem_idx, entry->key.vids));
	/*
	   resize hash table if more than 4/5 filled
	 */
	if ((a->te_hash.size*4) <= (a->te_hash.filled*5)) {
		h5_debug ("Resize te-structure");
		h5_loc_idx_t num_interior_elems = m->num_interior_elems[m->num_leaf_levels-1];
		TRY (h5tpriv_grow_te_htab (m, 2*(num_interior_elems - elem_idx)+8192));
	}
	TRY (h5priv_hsearch (
	             entry,
	             H5_ENTER,
	             &__retval,
	             &a->te_hash));
	h5t_te_entry_t* te_entry = (h5t_te_entry_t *)__retval;
	if (entry == te_entry) {        // if used,
		entry = NULL;           // force allocation of new entry
	}
	TRY (h5priv_search_in_loc_idlist (
	             &te_entry->value,
	             h5tpriv_build_edge_id (face_idx, elem_idx)));

	if (idlist) {
		*idlist = te_entry->value;
	}
	H5_PRIV_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5tpriv_enter_td2 (
        h5t_mesh_t* const m,
        h5_loc_idx_t face_idx,
        h5_loc_idx_t elem_idx,
        h5_loc_idlist_t** idlist        // out
        ) {
	H5_PRIV_API_ENTER (h5_err_t,
	                   "m=%p, face_idx=%lld, elem_idx=%lld, idlist=%p",
	                   m, (long long)face_idx, (long long)elem_idx, idlist);
	h5t_adjacencies_t* a = &m->adjacencies;
	void* __retval;
	static h5t_td_entry_t* entry = NULL;

	if (entry == NULL) {
		TRY (entry = h5_calloc (1, sizeof(*entry)) );
	}
	TRY (h5t_get_loc_vertex_indices_of_triangle2 (
	             m, face_idx, elem_idx, entry->key.vids) );
	/* resize hash table if more than 80% filled */
	if ((a->td_hash.size*4) <= (a->td_hash.filled*5)) {
		h5_debug ("Resize td-structure");
		h5_loc_idx_t num_interior_elems = m->num_interior_elems[m->num_leaf_levels-1];
		TRY (h5tpriv_grow_td_htab (m, 3*(num_interior_elems-elem_idx)));
	}
	/* search in hash, add if entry doesn't already exists */
	TRY (h5priv_hsearch (
	             entry,
	             H5_ENTER,
	             &__retval,
	             &a->td_hash));
	h5t_td_entry_t *td_entry = (h5t_td_entry_t *)__retval;
	if (entry == td_entry) { // if used:
		entry = NULL;    // force allocation of new
	}

	/* search ID in list of IDs for given triangle */
	TRY (h5priv_search_in_loc_idlist (
	             &td_entry->value,
	             h5tpriv_build_triangle_id (face_idx, elem_idx)));
	if (idlist) {
		*idlist = td_entry->value;
	}
	H5_PRIV_API_RETURN (H5_SUCCESS);
}

static int
cmp_te_entries (
        const void* __a,
        const void* __b
        ) {
	h5t_te_entry_t* a = (h5t_te_entry_t*)__a;
	h5t_te_entry_t* b = (h5t_te_entry_t*)__b;
	return memcmp (a->key.vids, b->key.vids, sizeof (a->key.vids));
}

static unsigned int
compute_te_hashval (
        const void* __item
        ) {
	h5t_te_entry_t* item = (h5t_te_entry_t*)__item;
	uint16_t* key =  (uint16_t*)item->key.vids;
	unsigned int count = 2*sizeof (item->key.vids[0]) / sizeof (uint16_t);
	unsigned int hval = count;
	while (count--) {
		if (*key) {
			hval <<= 6;
			hval += *key;
		}
		key++;
	}
	return hval;
}

static h5_err_t
release_te_entry (
        const void* __entry
        ) {
	H5_PRIV_FUNC_ENTER (h5_err_t, "__entry=%p", __entry);
	struct h5_te_entry* entry = *(struct h5_te_entry**)__entry;
	h5_loc_idlist_t* list = entry->value;
	TRY (h5priv_free_loc_idlist (&list));
	TRY (h5_free (entry));
	H5_PRIV_FUNC_RETURN (H5_SUCCESS);
}

h5_err_t
h5tpriv_grow_te_htab (
        h5t_mesh_t* const m,
        size_t nel
        ) {
	H5_PRIV_API_ENTER (h5_err_t, "m=%p, nel=%zu", m, nel);
	h5_debug ("Resize te-structure by %zu", nel);
	h5t_adjacencies_t* a = &m->adjacencies;
	if ( a->te_hash.size == 0 ) {
		TRY (h5priv_hcreate (
		             nel,
		             &a->te_hash,
		             cmp_te_entries,
		             compute_te_hashval,
		             release_te_entry));
	} else {
		TRY (h5priv_hgrow (nel, &a->te_hash));
	}
	H5_PRIV_API_RETURN (H5_SUCCESS);
}

/*
   Find item in the T(E) hash table.

   Passing item with type entry type.
 */
static inline h5_err_t
find_te (
        h5t_mesh_t* const m,
        h5t_te_entry_t* item,   // in: item to find
        h5_loc_idlist_t** idlist        // out:
        ) {
	H5_PRIV_FUNC_ENTER (h5_err_t, "m=%p, item=%p, idlist=%p",
	                    m, item, idlist);
	void* __entry;
	TRY (h5priv_hsearch (
	             item,
	             H5_FIND,
	             &__entry,
	             &m->adjacencies.te_hash));
	h5t_te_entry_t* entry = (h5t_te_entry_t*)__entry;
	if (entry == NULL) {
		H5_PRIV_FUNC_LEAVE (H5_NOK);    // not found
	}
	if (idlist) {
		*idlist = entry->value;
	}
	H5_PRIV_FUNC_RETURN (H5_SUCCESS);
}

/*
   Find item in the T(E) hash table.

   Passing item with face and local element ID.
 */
h5_err_t
h5tpriv_find_te (
        h5t_mesh_t* const m,
        h5_loc_idx_t edge_id,   // in
        h5_loc_idlist_t** idlist        // out
        ) {
	H5_PRIV_API_ENTER (h5_err_t,
	                   "m=%p, edge_id=%lld, idlist=%p",
	                   m, (long long)edge_id, idlist);
	h5t_te_entry_t item;
	TRY (h5t_get_loc_vertex_indices_of_edge (
	             m,
	             edge_id,
	             item.key.vids));

	TRY (find_te (m, &item, idlist));
	H5_PRIV_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5tpriv_find_te2 (
        h5t_mesh_t* const m,
        h5_loc_idx_t face_idx,  // in
        h5_loc_idx_t elem_idx,  // in
        h5_loc_idlist_t** idlist        // out
        ) {
	H5_PRIV_API_ENTER (h5_err_t,
	                   "m=%p, face_idx=%lld, elem_idx=%lld, idlist=%p",
	                   m, (long long)face_idx, (long long)elem_idx, idlist);
	h5t_te_entry_t item;
	TRY (h5t_get_loc_vertex_indices_of_edge2 (
	             m,
	             face_idx,
	             elem_idx,
	             item.key.vids));
	TRY (find_te (m, &item, idlist));
	H5_PRIV_API_RETURN (H5_SUCCESS);
}

static int
cmp_td_entries (
        const void* __a,
        const void* __b
        ) {
	h5t_td_entry_t* a = (h5t_td_entry_t*)__a;
	h5t_td_entry_t* b = (h5t_td_entry_t*)__b;
	return memcmp (a->key.vids, b->key.vids, sizeof(a->key.vids));
}

static unsigned int
compute_td_hashval (
        const void* __item
        ) {
	h5t_td_entry_t* item = (h5t_td_entry_t*)__item;
	uint16_t* key =  (uint16_t*)item->key.vids;
	unsigned int count = 3 * sizeof (item->key.vids[0]) / sizeof (uint16_t);
	unsigned int hval = count;
	while (count--) {
		if (*key) {
			hval <<= 6;
			hval += *key;
		}
		key++;
	}
	return hval;
}

static h5_err_t
release_td_entry (
        const void* __entry
        ) {
	H5_PRIV_FUNC_ENTER (h5_err_t, "__entry=%p", __entry);
	struct h5_td_entry* entry = *(struct h5_td_entry**)__entry;
	h5_loc_idlist_t* list = entry->value;
	TRY (h5priv_free_loc_idlist (&list));
	TRY (h5_free (entry));
	H5_PRIV_FUNC_RETURN (H5_SUCCESS);
}


h5_err_t
h5tpriv_grow_td_htab (
        h5t_mesh_t* const m,
        size_t nel
        ) {
	H5_PRIV_API_ENTER (h5_err_t, "m=%p, nel=%lld", m, (long long)nel);
	h5_debug ("Resize td-structure");
	h5t_adjacencies_t* a = &m->adjacencies;
	if (a->td_hash.size == 0) {
		TRY (h5priv_hcreate (
		             nel,
		             &a->td_hash,
		             cmp_td_entries,
		             compute_td_hashval,
		             release_td_entry));
	} else {
		TRY (h5priv_hgrow (nel, &a->td_hash));
	}
	H5_PRIV_API_RETURN (H5_SUCCESS);
}

static inline h5_err_t
find_td (
        h5t_mesh_t* const m,
        h5t_td_entry_t* item,
        h5_loc_idlist_t** idlist        // out
        ) {
	void* __entry;
	h5priv_hsearch (
	        item,
	        H5_FIND,
	        &__entry,
	        &m->adjacencies.td_hash);
	if (__entry == NULL) {
		return h5tpriv_error_local_triangle_nexist (item->key.vids);
	}
	h5t_td_entry_t* entry = (h5t_td_entry_t*)__entry;
	*idlist = entry->value;
	return H5_SUCCESS;
}

h5_err_t
h5tpriv_find_td (
        h5t_mesh_t* const m,
        h5_loc_idx_t triangle_id,
        h5_loc_idlist_t** idlist
        ) {
	H5_PRIV_API_ENTER (h5_err_t,
	                   "m=%p, triangle_id=%lld, idlist=%p",
	                   m, (long long)triangle_id, idlist);
	h5t_td_entry_t item;
	TRY (h5t_get_loc_vertex_indices_of_triangle (
	             m,
	             triangle_id,
	             item.key.vids));
	TRY (find_td (m, &item, idlist));
	H5_PRIV_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5tpriv_find_td2 (
        h5t_mesh_t* const m,
        h5_loc_idx_t face_idx,
        h5_loc_idx_t elem_idx,
        h5_loc_idlist_t** idlist
        ) {
	H5_PRIV_API_ENTER (h5_err_t,
	                   "m=%p, face_idx=%lld, elem_idx=%lld, idlist=%p",
	                   m, (long long)face_idx, (long long)elem_idx, idlist);
	h5t_td_entry_t item;
	TRY (h5t_get_loc_vertex_indices_of_triangle2 (
	             m,
	             face_idx,
	             elem_idx,
	             item.key.vids));
	TRY (find_td (m, &item, idlist));
	H5_PRIV_API_RETURN (H5_SUCCESS);
}

/*
   Return list of elements sharing the same vertex.
 */
h5_err_t
h5tpriv_find_tv2 (
        h5t_mesh_t* const m,
        h5_loc_idx_t face_idx,
        h5_loc_idx_t elem_idx,
        h5_loc_idlist_t** idlist
        ) {
	H5_PRIV_API_ENTER (h5_err_t,
	                   "m=%p, face_idx=%lld, elem_idx=%lld, idlist=%p",
	                   m, (long long)face_idx, (long long)elem_idx, idlist);
	h5_loc_idx_t idx;
	TRY (idx = h5tpriv_get_loc_elem_vertex_idx (m, elem_idx, face_idx));
	*idlist = m->adjacencies.tv.v[idx];
	H5_PRIV_API_RETURN (H5_SUCCESS);
}

/*
   Return list of elements sharing the same vertex.
 */
h5_err_t
h5tpriv_find_tv3 (
        h5t_mesh_t* const m,
        h5_loc_idx_t vtx_idx,
        h5_loc_idlist_t** idlist
        ) {
	H5_PRIV_FUNC_ENTER (h5_err_t,
	                   "m=%p, vtx_idx=%lld, idlist=%p",
	                   m, (long long)vtx_idx, idlist);
	*idlist = m->adjacencies.tv.v[vtx_idx];
	H5_PRIV_FUNC_RETURN (H5_SUCCESS);
}