src_old/src/h5core/h5t_retrieve.c

/*
  Copyright (c) 2006-2012, The Regents of the University of California,
  through Lawrence Berkeley National Laboratory (subject to receipt of any
  required approvals from the U.S. Dept. of Energy) and the Paul Scherrer
  Institut (Switzerland).  All rights reserved.

  License: see file COPYING in top level of source distribution.
*/

#include "h5t_types_private.h"
#include "h5t_errorhandling_private.h"
#include "h5t_map_private.h"
#include "h5t_model_private.h"
#include "h5t_access_private.h"
#include "h5t_tags_private.h"
#include "h5t_retrieve_private.h"

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

/*
   Skip elements which have been refined on a level <= the current one.
 */
static h5_err_t
iter_leaf_elem_idx (
        h5t_leaf_iterator_t* iter
        ) {
	h5_loc_elem_t* el;
	do {
		iter->elem_idx++;
		if (iter->elem_idx >= iter->mesh->num_interior_elems[iter->leaf_level]) {
			return H5_NOK; // done
		}
		el = h5tpriv_get_loc_elem (iter->mesh, iter->elem_idx);
	} while (!h5tpriv_is_leaf_elem (iter->mesh, el));
	return H5_SUCCESS;
}

static h5_loc_id_t
iterate_leaf_elems (
        h5t_iterator_t* iter
        ) {
	h5t_leaf_iterator_t* it = (h5t_leaf_iterator_t*)iter;
	if ( iter_leaf_elem_idx (it) == H5_NOK) {
		return H5_NOK;
	}
	int dim = h5tpriv_ref_elem_get_dim (it);
	h5_loc_id_t type_id = h5tpriv_ref_elem_get_entity_type (it, dim);
	return h5tpriv_build_entity_id (type_id, 0, it->elem_idx );
}

static h5_loc_id_t
iterate_geom_boundary_elems (
        h5t_iterator_t* iter
        ) {
	h5t_leaf_iterator_t* it = (h5t_leaf_iterator_t*)iter;
	do {
		if ( iter_leaf_elem_idx (it) == H5_NOK) {
			return H5_NOK;
		}
	} while (!h5tpriv_is_geom_boundary_elem (it->mesh, it->elem_idx));
	int dim = h5tpriv_ref_elem_get_dim (it);
	h5_loc_id_t type_id = h5tpriv_ref_elem_get_entity_type (it, dim);
	return h5tpriv_build_entity_id (type_id, 0, it->elem_idx );
}

/*
   Iterate boundary facets (co-dim 1 entities).
 */
static h5_loc_id_t
iterate_boundary_facets (
        h5t_iterator_t* iter
        ) {
	H5_PRIV_FUNC_ENTER (h5_loc_id_t, "iter=%p", iter);
	h5t_leaf_iterator_t* it = (h5t_leaf_iterator_t*)iter;
	int num_facets = h5tpriv_ref_elem_get_num_facets (it) - 1;
	int dim = h5tpriv_ref_elem_get_dim (it) - it->codim;
	do {
		if (it->face_idx >= num_facets) {
			h5_loc_id_t elem_id;
			TRY( elem_id = iterate_geom_boundary_elems (iter) );
			if (elem_id == H5_NOK) {
				H5_PRIV_FUNC_LEAVE (H5_NOK);    // done!
			}
			it->elem_idx = h5tpriv_get_elem_idx (elem_id);
			it->face_idx = 0;
		} else {
			it->face_idx++;
		}
	} while (!h5tpriv_is_boundary_facet (it->mesh, it->elem_idx, it->face_idx));
	int type = h5tpriv_ref_elem_get_entity_type (it, dim);
	H5_PRIV_FUNC_RETURN (h5tpriv_build_entity_id (type, it->face_idx, it->elem_idx));
}

/*!
   Travere entities with co-dim > 0
 */
static h5_loc_id_t
iterate_leaf_faces (
        h5t_iterator_t* iter
        ) {
	H5_PRIV_FUNC_ENTER (h5_loc_id_t, "iter=%p", iter);
	h5t_leaf_iterator_t* it = (h5t_leaf_iterator_t*)iter;
	h5_loc_idlist_t* entry;
	int dim = h5tpriv_ref_elem_get_dim (it) - it->codim;
	int num_faces = h5tpriv_ref_elem_get_num_faces (it, dim) - 1;
	int i = -1;
	do {
		if (it->face_idx >= num_faces) {
			if (iter_leaf_elem_idx (it) == H5_NOK) {
				H5_PRIV_FUNC_LEAVE (H5_NOK);    // done!
			}
			it->face_idx = 0;
		} else {
			it->face_idx++;
		}
		// Skip already visited faces:

		//  1. Get list of all elements with this face. Actually we
		//     retrieve a list of entities sorted by the element index.
		TRY( (it->find)(it->mesh, it->face_idx, it->elem_idx, &entry) );

		// 2. Go to first element in list which is on current level
		i = -1;
		h5_loc_elem_t *el;
		do {
			i++;
			h5_loc_idx_t idx = h5tpriv_get_elem_idx (entry->items[i]);
			el = h5tpriv_get_loc_elem (it->mesh, idx);
		} while (!h5tpriv_is_leaf_elem (it->mesh, el));

		// 3. Face already visited if
	} while (it->elem_idx > h5tpriv_get_elem_idx(entry->items[i]));
	/*
	   note: in above test it->elem_idx is always greater or equal to the
	   compared index. It cannot be smaller since it->elem_idx is on the
	   current level and the element index of entry->items[i] is the smallest
	   element index with the given face on the current level.
	 */
	H5_PRIV_FUNC_RETURN (entry->items[i]);
}

/*
   Iterate boundary faces with co-dim > 1
 */
static h5_loc_id_t
iterate_boundary_faces (
        h5t_iterator_t* iter
        ) {
	H5_PRIV_FUNC_ENTER (h5_loc_id_t, "iter=%p", iter);
	h5t_leaf_iterator_t* it = (h5t_leaf_iterator_t*)iter;
	// TODO!!!
	int dim = h5tpriv_ref_elem_get_dim (it) - it->codim;
	int num_faces = h5tpriv_ref_elem_get_num_faces (it, dim) - 1;
	do {
		// iterate to next boundary face
		do {
			// first iterate over all faces of element, if done
			// goto next element
			if (it->face_idx >= num_faces) {
				h5_loc_id_t elem_id;
				TRY( elem_id = iterate_geom_boundary_elems (iter) );
				if (elem_id == H5_NOK) {
					H5_PRIV_FUNC_LEAVE (H5_NOK);    // done!
				}
				it->face_idx = 0;
			} else {
				it->face_idx++;
			}
		} while (!h5tpriv_is_boundary_face (
		                 it->mesh, dim, it->elem_idx, it->face_idx));
		// Skip already visited faces
	} while (0);
	H5_PRIV_FUNC_RETURN (h5_error_internal ());
}

static h5_loc_id_t
iterate_tags (
        h5t_iterator_t* iter
        ) {
	H5_PRIV_FUNC_ENTER (h5_loc_id_t, "iter=%p", iter);
	UNUSED_ARGUMENT (iter);
#if 0
	h5t_tagsel_t* tags;
	do {
		if (iter->subentity_idx >= 14) {
			iter->elem_idx++;
			iter->subentity_idx = 0;
		} else {
			iter->subentity_idx++;
		}
		tags = iter->tagset->elems[iter->elem_idx];
	} while ((tags == NULL) || (tags->idx[iter->subentity_idx]));
#endif
	H5_PRIV_FUNC_RETURN (h5_error_internal ());
}

h5_err_t
h5t_init_leaf_iterator (
        h5t_iterator_t* iter,
        h5t_mesh_t* m,
        int codim
        ) {
	H5_CORE_API_ENTER (h5_err_t, "iter=%p, m=%p, codim=%d", iter, m, codim);
	h5t_leaf_iterator_t* it = (h5t_leaf_iterator_t*)iter;
	it->mesh = m;
	it->face_idx = 999;
	it->elem_idx = -1;
	it->codim = codim;
	it->leaf_level = m->leaf_level;
	it->ref_elem = m->ref_elem;

	if (it->codim > 0) {
		it->iter = iterate_leaf_faces;
	} else if (it->codim == 0) {
		it->iter = iterate_leaf_elems;
	}
	TRY (h5tpriv_init_entity_iterator (m, iter, codim));
	H5_CORE_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5t_init_boundary_face_iterator (
        h5t_iterator_t* iter,
        h5t_mesh_t* m,
        int codim
        ) {
	H5_CORE_API_ENTER (h5_err_t, "iter=%p, m=%p, codim=%d", iter, m, codim);
	h5t_leaf_iterator_t* it = (h5t_leaf_iterator_t*)iter;
	it->mesh = m;
	it->face_idx = 999; // something > max number of faces
	it->elem_idx = -1;
	it->codim = codim;
	it->leaf_level = m->leaf_level;
	it->ref_elem = m->ref_elem;

	if (it->codim <= 0 || it->codim > it->ref_elem->dim) {
		H5_CORE_API_LEAVE (h5tpriv_inval_codim (codim, 1, it->ref_elem->dim));
	} else if (it->codim == 1) {
		it->iter = iterate_boundary_facets;
	}
	else if (it->codim > 1) {
		it->iter = iterate_boundary_faces;
	}
	H5_CORE_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5t_init_mtag_iterator (
        h5t_iterator_t* iter,
        h5t_mesh_t* m,
        const char* name
        ) {
	H5_CORE_API_ENTER (h5_err_t, "iter=%p, m=%p, name='%s'", iter, m, name);
	h5t_tag_iterator_t* it = (h5t_tag_iterator_t*)iter;
	it->mesh = m;
	TRY (h5t_open_mtagset (m, name, &it->tagset));
	it->elem_idx = -1;
	it->subentity_idx = 999;
	it->level_idx = m->leaf_level;
	it->iter = iterate_tags;
	H5_CORE_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5t_release_entity_iterator (
        h5t_iterator_t* iter
        ) {
	H5_CORE_API_ENTER (h5_err_t, "iter=%p", iter);
	H5_CORE_API_RETURN (h5_free (iter));
}

h5_loc_id_t
h5t_iterate_entities (
        h5t_iterator_t* iter
        ) {
	H5_CORE_API_ENTER (h5_err_t, "iter=%p", iter);
	H5_CORE_API_RETURN (iter->iter (iter));
}

h5_err_t
h5t_end_iterate_entities (
        h5t_iterator_t* iter
        ) {
	H5_CORE_API_ENTER (h5_err_t, "iter=%p", iter);
	memset (iter, 0, sizeof(*iter));
	h5t_leaf_iterator_t* it = (h5t_leaf_iterator_t*)iter;
	it->face_idx = -1;
	it->elem_idx = -1;
	it->codim = -1;
	H5_CORE_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5t_get_vertex_coords_by_index (
        h5t_mesh_t* const m,
        h5_loc_idx_t vertex_index,
        h5_float64_t P[3]
        ) {
	H5_CORE_API_ENTER (h5_err_t,
	                   "m=%p, vertex_index=%llu, P=%p",
	                   m,
	                   (long long unsigned)vertex_index,
	                   P);
	h5_loc_vertex_t *vertex = &m->vertices[vertex_index];
	memcpy ( P, &vertex->P, sizeof ( vertex->P ) );
	H5_CORE_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5t_get_vertex_coords_by_id (
        h5t_mesh_t* const m,
        h5_loc_id_t vertex_id,
        h5_float64_t P[3]
        ) {
	H5_CORE_API_ENTER (h5_err_t,
	                   "m=%p, vertex_id=%llu, P=%p",
	                   m,
	                   (long long unsigned)vertex_id,
	                   P);
	h5_loc_idx_t vertex_index;
	TRY (h5tpriv_get_vertex_index_of_vertex (m, vertex_id, &vertex_index));
	TRY (h5t_get_vertex_coords_by_index (m, vertex_index, P));
	H5_CORE_API_RETURN (H5_SUCCESS);
}

h5_err_t
h5t_get_vertex_by_id (
        h5t_mesh_t* const m,
        const h5_loc_id_t vertex_id,
        h5_glb_idx_t* glb_idx,
        h5_float64_t* P[]
        ) {
	H5_CORE_API_ENTER (h5_err_t,
	                   "m=%p, vertex_id=%lld, glb_idx=%p, P[]=%p",
	                   m, (long long)vertex_id, glb_idx, P);
	// get loc index of vertex
	h5_loc_idx_t idx;
	TRY (h5t_get_loc_vertex_index_of_vertex (m, vertex_id, &idx));
	*glb_idx = m->vertices[idx].idx;
	*P = m->vertices[idx].P;
	H5_CORE_API_RETURN (H5_SUCCESS);
}


h5_err_t
h5t_get_neighbor_indices (
        h5t_mesh_t* const m,
        h5_loc_id_t entity_id,
        h5_loc_idx_t* neighbor_indices
        ) {
	H5_CORE_API_ENTER (h5_err_t,
	                   "m=%p, entity_id=%llu, neighbor_indices=%p",
	                   m,
	                   (long long unsigned)entity_id,
	                   neighbor_indices);
	h5_loc_idx_t elem_idx = h5tpriv_get_elem_idx (entity_id);
	h5_loc_idx_t* indices = h5tpriv_get_loc_elem_neighbor_indices (m, elem_idx);
	int num_facets = h5tpriv_ref_elem_get_num_facets (m);
	for (int i = 0; i < num_facets; i++) {
		neighbor_indices[i] = indices[i];
	}
	H5_CORE_API_RETURN (H5_SUCCESS);
}