~ubuntu-branches/ubuntu/trusty/scotch/trusty

« back to all changes in this revision

Viewing changes to src/libscotch/mesh_check.c

Committer: Bazaar Package Importer
Author(s): Christophe Prud'homme
Date: 2008-01-25 09:13:53 UTC
Revision ID: james.westby@ubuntu.com-20080125091353-zghdao60dfsyc2bt

Tags: upstream-5.0.1.dfsg

Import upstream version 5.0.1.dfsg

files added:

INSTALL.txt

LICENCE_fr.txt

LICENSE_en.txt

LISEZ-MOI.txt

README.txt

doc/CeCILL-C_V1-en.txt

doc/CeCILL-C_V1-fr.txt

doc/scotch_example.f

grf/3elt.grf.gz

grf/3elt.xyz.gz

grf/4elt.grf.gz

grf/4elt.xyz.gz

grf/4elt2.grf.gz

grf/4elt2.xyz.gz

grf/bump.grf.gz

grf/bump.xyz.gz

src/Make.inc

src/Make.inc/Makefile.inc.alpha_dec_osf1

src/Make.inc/Makefile.inc.freebsd

src/Make.inc/Makefile.inc.i686_pc_linux2

src/Make.inc/Makefile.inc.i686_pc_linux2.debug

src/Make.inc/Makefile.inc.i686_pc_linux2.nothreads

src/Make.inc/Makefile.inc.i686_pc_linux2.prof

src/Make.inc/Makefile.inc.mips_sgi_irix6

src/Make.inc/Makefile.inc.pa11_hp_ux10

src/Make.inc/Makefile.inc.power3_ibm_aix5

src/Makefile

src/common

src/common/Makefile

src/common/common.c

src/common/common.h

src/common/common_error.c

src/common/common_file.c

src/common/common_file.h

src/common/common_integer.c

src/common/common_integer.h

src/common/common_memory.c

src/common/common_sort.c

src/libscotch

src/libscotch/Makefile

src/libscotch/arch.c

src/libscotch/arch.h

src/libscotch/arch_build.c

src/libscotch/arch_build.h

src/libscotch/arch_cmplt.c

src/libscotch/arch_cmplt.h

src/libscotch/arch_deco.c

src/libscotch/arch_deco.h

src/libscotch/arch_hcub.c

src/libscotch/arch_hcub.h

src/libscotch/arch_mesh.c

src/libscotch/arch_mesh.h

src/libscotch/arch_tleaf.c

src/libscotch/arch_tleaf.h

src/libscotch/arch_torus.c

src/libscotch/arch_torus.h

src/libscotch/arch_vcmplt.c

src/libscotch/arch_vcmplt.h

src/libscotch/arch_vhcub.c

src/libscotch/arch_vhcub.h

src/libscotch/bgraph.c

src/libscotch/bgraph.h

src/libscotch/bgraph_bipart_bd.c

src/libscotch/bgraph_bipart_bd.h

src/libscotch/bgraph_bipart_df.c

src/libscotch/bgraph_bipart_df.h

src/libscotch/bgraph_bipart_ex.c

src/libscotch/bgraph_bipart_ex.h

src/libscotch/bgraph_bipart_fm.c

src/libscotch/bgraph_bipart_fm.h

src/libscotch/bgraph_bipart_gg.c

src/libscotch/bgraph_bipart_gg.h

src/libscotch/bgraph_bipart_gp.c

src/libscotch/bgraph_bipart_gp.h

src/libscotch/bgraph_bipart_ml.c

src/libscotch/bgraph_bipart_ml.h

src/libscotch/bgraph_bipart_st.c

src/libscotch/bgraph_bipart_st.h

src/libscotch/bgraph_bipart_zr.c

src/libscotch/bgraph_bipart_zr.h

src/libscotch/bgraph_check.c

src/libscotch/bgraph_store.c

src/libscotch/common.c

src/libscotch/common.h

src/libscotch/common_integer.c

src/libscotch/common_integer.h

src/libscotch/common_memory.c

src/libscotch/common_sort.c

src/libscotch/dgraph.c

src/libscotch/dgraph.h

src/libscotch/dgraph_allreduce.c

src/libscotch/dgraph_allreduce.h

src/libscotch/dgraph_build.c

src/libscotch/dgraph_build.h

src/libscotch/dgraph_build_grid3d.c

src/libscotch/dgraph_build_hcub.c

src/libscotch/dgraph_check.c

src/libscotch/dgraph_coarsen.c

src/libscotch/dgraph_coarsen.h

src/libscotch/dgraph_fold.c

src/libscotch/dgraph_fold.h

src/libscotch/dgraph_fold_comm.c

src/libscotch/dgraph_fold_comm.h

src/libscotch/dgraph_fold_dup.c

src/libscotch/dgraph_fold_dup.h

src/libscotch/dgraph_gather.c

src/libscotch/dgraph_gather_all.c

src/libscotch/dgraph_ghst.c

src/libscotch/dgraph_ghst.h

src/libscotch/dgraph_halo.c

src/libscotch/dgraph_halo_fill.c

src/libscotch/dgraph_induce.c

src/libscotch/dgraph_io_load.c

src/libscotch/dgraph_io_load.h

src/libscotch/dgraph_io_save.c

src/libscotch/dgraph_match.h

src/libscotch/dgraph_match_sync.c

src/libscotch/dgraph_match_sync.h

src/libscotch/dgraph_match_tools.c

src/libscotch/dgraph_match_tools.h

src/libscotch/dgraph_scatter.c

src/libscotch/dgraph_view.c

src/libscotch/dorder.c

src/libscotch/dorder.h

src/libscotch/dorder_gather.c

src/libscotch/dorder_gather.h

src/libscotch/dorder_io.c

src/libscotch/dorder_io_tree.c

src/libscotch/dummysizes.c

src/libscotch/gain.c

src/libscotch/gain.h

src/libscotch/geom.c

src/libscotch/geom.h

src/libscotch/graph.c

src/libscotch/graph.h

src/libscotch/graph_base.c

src/libscotch/graph_check.c

src/libscotch/graph_coarsen.c

src/libscotch/graph_coarsen.h

src/libscotch/graph_coarsen_edge.c

src/libscotch/graph_induce.c

src/libscotch/graph_induce.h

src/libscotch/graph_io.c

src/libscotch/graph_io.h

src/libscotch/graph_io_chac.c

src/libscotch/graph_io_habo.c

src/libscotch/graph_io_habo.h

src/libscotch/graph_io_scot.c

src/libscotch/graph_io_scot.h

src/libscotch/graph_list.c

src/libscotch/graph_list.h

src/libscotch/hall_order_hd.c

src/libscotch/hall_order_hd.h

src/libscotch/hall_order_hf.c

src/libscotch/hall_order_hf.h

src/libscotch/hall_order_hx.c

src/libscotch/hall_order_hx.h

src/libscotch/hdgraph.c

src/libscotch/hdgraph.h

src/libscotch/hdgraph_check.c

src/libscotch/hdgraph_fold.c

src/libscotch/hdgraph_fold.h

src/libscotch/hdgraph_gather.c

src/libscotch/hdgraph_induce.c

src/libscotch/hdgraph_order_nd.c

src/libscotch/hdgraph_order_nd.h

src/libscotch/hdgraph_order_si.c

src/libscotch/hdgraph_order_si.h

src/libscotch/hdgraph_order_st.c

src/libscotch/hdgraph_order_st.h

src/libscotch/hgraph.c

src/libscotch/hgraph.h

src/libscotch/hgraph_check.c

src/libscotch/hgraph_induce.c

src/libscotch/hgraph_induce.h

src/libscotch/hgraph_induce_edge.c

src/libscotch/hgraph_order_bl.c

src/libscotch/hgraph_order_bl.h

src/libscotch/hgraph_order_cp.c

src/libscotch/hgraph_order_cp.h

src/libscotch/hgraph_order_gp.c

src/libscotch/hgraph_order_gp.h

src/libscotch/hgraph_order_hd.c

src/libscotch/hgraph_order_hd.h

src/libscotch/hgraph_order_hf.c

src/libscotch/hgraph_order_hf.h

src/libscotch/hgraph_order_hx.c

src/libscotch/hgraph_order_hx.h

src/libscotch/hgraph_order_nd.c

src/libscotch/hgraph_order_nd.h

src/libscotch/hgraph_order_si.c

src/libscotch/hgraph_order_si.h

src/libscotch/hgraph_order_st.c

src/libscotch/hgraph_order_st.h

src/libscotch/hmesh.c

src/libscotch/hmesh.h

src/libscotch/hmesh_check.c

src/libscotch/hmesh_hgraph.c

src/libscotch/hmesh_hgraph.h

src/libscotch/hmesh_induce.c

src/libscotch/hmesh_induce.h

src/libscotch/hmesh_mesh.c

src/libscotch/hmesh_order_bl.c

src/libscotch/hmesh_order_bl.h

src/libscotch/hmesh_order_cp.c

src/libscotch/hmesh_order_cp.h

src/libscotch/hmesh_order_gp.c

src/libscotch/hmesh_order_gp.h

src/libscotch/hmesh_order_gr.c

src/libscotch/hmesh_order_gr.h

src/libscotch/hmesh_order_hd.c

src/libscotch/hmesh_order_hd.h

src/libscotch/hmesh_order_hf.c

src/libscotch/hmesh_order_hf.h

src/libscotch/hmesh_order_hx.c

src/libscotch/hmesh_order_hx.h

src/libscotch/hmesh_order_nd.c

src/libscotch/hmesh_order_nd.h

src/libscotch/hmesh_order_si.c

src/libscotch/hmesh_order_si.h

src/libscotch/hmesh_order_st.c

src/libscotch/hmesh_order_st.h

src/libscotch/kgraph.c

src/libscotch/kgraph.h

src/libscotch/kgraph_map_rb.c

src/libscotch/kgraph_map_rb.h

src/libscotch/kgraph_map_st.c

src/libscotch/kgraph_map_st.h

src/libscotch/last_resort

src/libscotch/last_resort/parser_ll.c

src/libscotch/last_resort/parser_ly.h

src/libscotch/last_resort/parser_yy.c

src/libscotch/library.h

src/libscotch/library_arch.c

src/libscotch/library_arch_build.c

src/libscotch/library_arch_build_f.c

src/libscotch/library_arch_f.c

src/libscotch/library_dgraph.c

src/libscotch/library_dgraph_build.c

src/libscotch/library_dgraph_build_f.c

src/libscotch/library_dgraph_build_grid.c

src/libscotch/library_dgraph_build_grid_f.c

src/libscotch/library_dgraph_check.c

src/libscotch/library_dgraph_check_f.c

src/libscotch/library_dgraph_f.c

src/libscotch/library_dgraph_gather.c

src/libscotch/library_dgraph_gather_f.c

src/libscotch/library_dgraph_halo.c

src/libscotch/library_dgraph_halo_f.c

src/libscotch/library_dgraph_io_load.c

src/libscotch/library_dgraph_io_load_f.c

src/libscotch/library_dgraph_io_save.c

src/libscotch/library_dgraph_io_save_f.c

src/libscotch/library_dgraph_order.c

src/libscotch/library_dgraph_order_f.c

src/libscotch/library_dgraph_order_gather.c

src/libscotch/library_dgraph_order_gather_f.c

src/libscotch/library_dgraph_order_io.c

src/libscotch/library_dgraph_order_io_f.c

src/libscotch/library_dgraph_scatter.c

src/libscotch/library_dgraph_scatter_f.c

src/libscotch/library_dgraph_stat.c

src/libscotch/library_dgraph_stat.h

src/libscotch/library_dgraph_stat_f.c

src/libscotch/library_errcom.c

src/libscotch/library_error.c

src/libscotch/library_geom.c

src/libscotch/library_geom_f.c

src/libscotch/library_graph.c

src/libscotch/library_graph_base.c

src/libscotch/library_graph_base_f.c

src/libscotch/library_graph_check.c

src/libscotch/library_graph_check_f.c

src/libscotch/library_graph_f.c

src/libscotch/library_graph_io_chac.c

src/libscotch/library_graph_io_chac_f.c

src/libscotch/library_graph_io_habo.c

src/libscotch/library_graph_io_habo_f.c

src/libscotch/library_graph_io_scot.c

src/libscotch/library_graph_io_scot_f.c

src/libscotch/library_graph_map.c

src/libscotch/library_graph_map_f.c

src/libscotch/library_graph_map_view.c

src/libscotch/library_graph_map_view.h

src/libscotch/library_graph_map_view_f.c

src/libscotch/library_graph_order.c

src/libscotch/library_graph_order_f.c

src/libscotch/library_mapping.h

src/libscotch/library_mesh.c

src/libscotch/library_mesh_f.c

src/libscotch/library_mesh_graph.c

src/libscotch/library_mesh_graph_f.c

src/libscotch/library_mesh_io_habo.c

src/libscotch/library_mesh_io_habo_f.c

src/libscotch/library_mesh_io_scot.c

src/libscotch/library_mesh_io_scot_f.c

src/libscotch/library_mesh_order.c

src/libscotch/library_mesh_order_f.c

src/libscotch/library_order.h

src/libscotch/library_parser.c

src/libscotch/library_parser_f.c

src/libscotch/library_random.c

src/libscotch/library_random_f.c

src/libscotch/libraryf.h

src/libscotch/mapping.c

src/libscotch/mapping.h

src/libscotch/mapping_io.c

src/libscotch/mapping_io.h

src/libscotch/mesh.c

src/libscotch/mesh.h

src/libscotch/mesh_check.c

src/libscotch/mesh_coarsen.c

src/libscotch/mesh_coarsen.h

src/libscotch/mesh_graph.c

src/libscotch/mesh_graph.h

src/libscotch/mesh_induce_sepa.c

src/libscotch/mesh_induce_sepa.h

src/libscotch/mesh_io.c

src/libscotch/mesh_io.h

src/libscotch/mesh_io_habo.c

src/libscotch/mesh_io_scot.c

src/libscotch/module.h

src/libscotch/order.c

src/libscotch/order.h

src/libscotch/order_check.c

src/libscotch/order_io.c

src/libscotch/parser.c

src/libscotch/parser.h

src/libscotch/parser_ll.h

src/libscotch/parser_ll.l

src/libscotch/parser_yy.h

src/libscotch/parser_yy.y

src/libscotch/vdgraph.c

src/libscotch/vdgraph.h

src/libscotch/vdgraph_check.c

src/libscotch/vdgraph_gather_all.c

src/libscotch/vdgraph_separate_bd.c

src/libscotch/vdgraph_separate_bd.h

src/libscotch/vdgraph_separate_ml.c

src/libscotch/vdgraph_separate_ml.h

src/libscotch/vdgraph_separate_sq.c

src/libscotch/vdgraph_separate_sq.h

src/libscotch/vdgraph_separate_st.c

src/libscotch/vdgraph_separate_st.h

src/libscotch/vdgraph_separate_zr.c

src/libscotch/vdgraph_separate_zr.h

src/libscotch/vdgraph_store.c

src/libscotch/vgraph.c

src/libscotch/vgraph.h

src/libscotch/vgraph_check.c

src/libscotch/vgraph_separate_bd.c

src/libscotch/vgraph_separate_bd.h

src/libscotch/vgraph_separate_es.c

src/libscotch/vgraph_separate_es.h

src/libscotch/vgraph_separate_fm.c

src/libscotch/vgraph_separate_fm.h

src/libscotch/vgraph_separate_gg.c

src/libscotch/vgraph_separate_gg.h

src/libscotch/vgraph_separate_gp.c

src/libscotch/vgraph_separate_gp.h

src/libscotch/vgraph_separate_ml.c

src/libscotch/vgraph_separate_ml.h

src/libscotch/vgraph_separate_st.c

src/libscotch/vgraph_separate_st.h

src/libscotch/vgraph_separate_th.c

src/libscotch/vgraph_separate_th.h

src/libscotch/vgraph_separate_vw.c

src/libscotch/vgraph_separate_vw.h

src/libscotch/vgraph_separate_zr.c

src/libscotch/vgraph_separate_zr.h

src/libscotch/vgraph_store.c

src/libscotch/vmesh.c

src/libscotch/vmesh.h

src/libscotch/vmesh_check.c

src/libscotch/vmesh_separate_fm.c

src/libscotch/vmesh_separate_fm.h

src/libscotch/vmesh_separate_gg.c

src/libscotch/vmesh_separate_gg.h

src/libscotch/vmesh_separate_gr.c

src/libscotch/vmesh_separate_gr.h

src/libscotch/vmesh_separate_ml.c

src/libscotch/vmesh_separate_ml.h

src/libscotch/vmesh_separate_st.c

src/libscotch/vmesh_separate_st.h

src/libscotch/vmesh_separate_zr.c

src/libscotch/vmesh_separate_zr.h

src/libscotch/vmesh_store.c

src/libscotchmetis

src/libscotchmetis/Makefile

src/libscotchmetis/metis.h

src/libscotchmetis/metis_graph_order.c

src/libscotchmetis/metis_graph_order_f.c

src/libscotchmetis/metis_graph_part.c

src/libscotchmetis/metis_graph_part_f.c

src/scotch

src/scotch/Makefile

src/scotch/acpl.c

src/scotch/acpl.h

src/scotch/amk_ccc.c

src/scotch/amk_ccc.h

src/scotch/amk_fft2.c

src/scotch/amk_fft2.h

src/scotch/amk_grf.c

src/scotch/amk_grf.h

src/scotch/amk_hy.c

src/scotch/amk_hy.h

src/scotch/amk_m2.c

src/scotch/amk_m2.h

src/scotch/amk_p2.c

src/scotch/amk_p2.h

src/scotch/atst.c

src/scotch/atst.h

src/scotch/dgord.c

src/scotch/dgord.h

src/scotch/dgscat.c

src/scotch/dgscat.h

src/scotch/dgtst.c

src/scotch/dgtst.h

src/scotch/gbase.c

src/scotch/gbase.h

src/scotch/gcv.c

src/scotch/gcv.h

src/scotch/gmap.c

src/scotch/gmap.h

src/scotch/gmk_hy.c

src/scotch/gmk_hy.h

src/scotch/gmk_m2.c

src/scotch/gmk_m2.h

src/scotch/gmk_m3.c

src/scotch/gmk_m3.h

src/scotch/gmk_msh.c

src/scotch/gmk_msh.h

src/scotch/gmk_ub2.c

src/scotch/gmk_ub2.h

src/scotch/gmtst.c

src/scotch/gmtst.h

src/scotch/gord.c

src/scotch/gord.h

src/scotch/gotst.c

src/scotch/gotst.h

src/scotch/gout_c.c

src/scotch/gout_c.h

src/scotch/gout_o.c

src/scotch/gout_o.h

src/scotch/gtst.c

src/scotch/gtst.h

src/scotch/mcv.c

src/scotch/mcv.h

src/scotch/mmk_m2.c

src/scotch/mmk_m2.h

src/scotch/mmk_m3.c

src/scotch/mmk_m3.h

src/scotch/mord.c

src/scotch/mord.h

src/scotch/mtst.c

src/scotch/mtst.h

tgt/SP2_16.txt

tgt/T3D_64.tgt

tgt/h1.tgt

tgt/h10.tgt

tgt/h2.tgt

tgt/h3.tgt

tgt/h4.tgt

tgt/h5.tgt

tgt/h6.tgt

tgt/h7.tgt

tgt/h8.tgt

tgt/h9.tgt

tgt/k1.tgt

tgt/k12.tgt

tgt/k128.tgt

tgt/k16.tgt

tgt/k2.tgt

tgt/k24.tgt

tgt/k256.tgt

tgt/k32.tgt

tgt/k4.tgt

tgt/k48.tgt

tgt/k512.tgt

tgt/k6.tgt

tgt/k64.tgt

tgt/k7.tgt

tgt/k8.tgt

tgt/k96.tgt

tgt/m10x10.tgt

tgt/m10x20.tgt

tgt/m11x13.tgt

tgt/m16x16.tgt

tgt/m16x32.tgt

tgt/m17x19.tgt

tgt/m19x21.tgt

tgt/m19x31.tgt

tgt/m21x23.tgt

tgt/m23x25.tgt

tgt/m24x24.tgt

tgt/m25x27.tgt

tgt/m27x29.tgt

tgt/m29x31.tgt

tgt/m2x2.tgt

tgt/m2x4x8.tgt

tgt/m32x32.tgt

tgt/m3x3.tgt

tgt/m4x4.tgt

tgt/m4x8.tgt

tgt/m5x5.tgt

tgt/m5x7.tgt

tgt/m64x64.tgt

tgt/m8x16.tgt

tgt/m8x8.tgt

tgt/m9x11.tgt

tgt/m9x7.tgt

tgt/p128.tgt

tgt/p16.tgt

tgt/p2.tgt

tgt/p256.tgt

tgt/p32.tgt

tgt/p4.tgt

tgt/p512.tgt

tgt/p64.tgt

tgt/p8.tgt

tgt/t2x4x8.tgt

tgt/t4x4x4.tgt

tgt/vcmplt.tgt

tgt/vhcub.tgt

tgt/void.tgt

Show diffs side-by-side

added added

removed removed

src/libscotch/mesh_check.c

** This file is part of the Scotch software package for static mapping,

** graph partitioning and sparse matrix ordering.

** This software is governed by the CeCILL-C license under French law

** and abiding by the rules of distribution of free software. You can

** use, modify and/or redistribute the software under the terms of the

** CeCILL-C license as circulated by CEA, CNRS and INRIA at the following

** URL: "http://www.cecill.info".

** As a counterpart to the access to the source code and rights to copy,

** modify and redistribute granted by the license, users are provided

** only with a limited warranty and the software's author, the holder of

** the economic rights, and the successive licensors have only limited

** liability.

** In this respect, the user's attention is drawn to the risks associated

** with loading, using, modifying and/or developing or reproducing the

** software by the user in light of its specific status of free software,

** that may mean that it is complicated to manipulate, and that also

** therefore means that it is reserved for developers and experienced

** professionals having in-depth computer knowledge. Users are therefore

** encouraged to load and test the software's suitability as regards

** their requirements in conditions enabling the security of their

** systems and/or data to be ensured and, more generally, to use and

** operate it in the same conditions as regards security.

** The fact that you are presently reading this means that you have had

** knowledge of the CeCILL-C license and that you accept its terms.

/************************************************************/

/** **/

/** NAME : mesh_check.c **/

/** **/

/** AUTHOR : Francois PELLEGRINI **/

/** **/

/** FUNCTION : This module handles the source mesh **/

/** functions. **/

/** **/

/** DATES : # Version 4.0 : from : 29 dec 2001 **/

/** to 11 may 2004 **/

/** **/

/************************************************************/

** The defines and includes.

#define MESH

#include "module.h"

#include "common.h"

#include "graph.h"

#include "mesh.h"

/****************************************/

/* */

/* These routines handle source meshes. */

/* */

/****************************************/

/* This routine checks the consistency

** of the given mesh.

** It returns:

** - 0 : if mesh data are consistent.

** - !0 : on error.

int

meshCheck (

const Mesh * const meshptr)

{

Gnum vertnnd; /* Maximum vertex index */

Gnum vertnum; /* Number of current vertex */

Gnum veisnbr; /* Number of isolated element vertices */

Gnum velosum; /* Vertex element load sum */

Gnum vnlosum; /* Vertex node load sum */

Gnum degrmax; /* Maximum degree */

if ((meshptr->velmbas > meshptr->velmnnd) ||

(meshptr->vnodbas > meshptr->vnodnnd) ||

((meshptr->velmnnd != meshptr->vnodbas) &&

(meshptr->vnodnnd != meshptr->velmbas))) {

errorPrint ("meshCheck: invalid node and element numbers");

return (1);

}

vertnnd = meshptr->velmnbr + meshptr->vnodnbr + meshptr->baseval;

degrmax = 0;

veisnbr = 0;

for (vertnum = meshptr->velmbas; vertnum < meshptr->velmnnd; vertnum ++) { /* For all element vertices */

Gnum degrval;

Gnum edgenum;

if ((meshptr->verttax[vertnum] < meshptr->baseval) ||

(meshptr->vendtax[vertnum] < meshptr->verttax[vertnum])) {

errorPrint ("meshCheck: invalid vertex arrays (1)");

return (1);

100

}

101

102

degrval = meshptr->vendtax[vertnum] - meshptr->verttax[vertnum];

103

if (degrval > degrmax)

104

degrmax = degrval;

105

else if (degrval == 0)

106

veisnbr ++;

107

108

for (edgenum = meshptr->verttax[vertnum]; edgenum < meshptr->vendtax[vertnum]; edgenum ++) {

109

Gnum vertend; /* Number of end vertex */

110

Gnum edgeend; /* Number of end vertex edge */

111

112

vertend = meshptr->edgetax[edgenum];

113

114

if ((vertend < meshptr->baseval) || (vertend >= vertnnd)) { /* If invalid edge end */

115

errorPrint ("meshCheck: invalid edge array (1)");

116

return (1);

117

}

118

if ((vertend >= meshptr->velmbas) &&

119

(vertend < meshptr->velmnnd)) {

120

errorPrint ("meshCheck: element vertices must not be connected together");

121

return (1);

122

}

123

124

for (edgeend = meshptr->verttax[vertend]; /* Search for matching arc */

125

(edgeend < meshptr->vendtax[vertend]) && (meshptr->edgetax[edgeend] != vertnum);

126

edgeend ++) ;

127

if (edgeend >= meshptr->vendtax[vertend]) {

128

errorPrint ("meshCheck: arc data do not match (1)");

129

return (1);

130

}

131

for (edgeend ++; /* Search for duplicate arcs */

132

(edgeend < meshptr->vendtax[vertend]) && (meshptr->edgetax[edgeend] != vertnum);

133

edgeend ++) ;

134

if (edgeend < meshptr->vendtax[vertend]) {

135

errorPrint ("meshCheck: duplicate arc (1)");

136

return (1);

137

}

138

}

139

}

140

if (veisnbr != meshptr->veisnbr) {

141

errorPrint ("meshCheck: invalid number of isolated element vertices (1)");

142

return (1);

143

}

144

145

for (vertnum = meshptr->vnodbas; vertnum < meshptr->vnodnnd; vertnum ++) { /* For all node vertices */

146

Gnum edgenum;

147

148

if ((meshptr->verttax[vertnum] < meshptr->baseval) ||

149

(meshptr->vendtax[vertnum] < meshptr->verttax[vertnum])) {

150

errorPrint ("meshCheck: invalid vertex arrays (2)");

151

return (1);

152

}

153

if ((meshptr->vendtax[vertnum] - meshptr->verttax[vertnum]) > degrmax)

154

degrmax = meshptr->vendtax[vertnum] - meshptr->verttax[vertnum];

155

156

for (edgenum = meshptr->verttax[vertnum]; edgenum < meshptr->vendtax[vertnum]; edgenum ++) {

157

Gnum vertend; /* Number of end vertex */

158

Gnum edgeend; /* Number of end vertex edge */

159

160

vertend = meshptr->edgetax[edgenum];

161

162

if ((vertend < meshptr->baseval) || (vertend >= vertnnd)) { /* If invalid edge end */

163

errorPrint ("meshCheck: invalid edge array (2)");

164

return (1);

165

}

166

if ((vertend >= meshptr->vnodbas) &&

167

(vertend < meshptr->vnodnnd)) {

168

errorPrint ("meshCheck: node vertices must not be connected together");

169

return (1);

170

}

171

172

for (edgeend = meshptr->verttax[vertend]; /* Search for matching arc */

173

(edgeend < meshptr->vendtax[vertend]) && (meshptr->edgetax[edgeend] != vertnum);

174

edgeend ++) ;

175

if (edgeend >= meshptr->vendtax[vertend]) {

176

errorPrint ("meshCheck: arc data do not match (2)");

177

return (1);

178

}

179

for (edgeend ++; /* Search for duplicate arcs */

180

(edgeend < meshptr->vendtax[vertend]) && (meshptr->edgetax[edgeend] != vertnum);

181

edgeend ++) ;

182

if (edgeend < meshptr->vendtax[vertend]) {

183

errorPrint ("meshCheck: duplicate arc (2)");

184

return (1);

185

}

186

}

187

}

188

189

if (meshptr->velotax == NULL) /* Recompute node vertex load sum */

190

velosum = meshptr->velmnnd - meshptr->velmbas;

191

else {

192

for (vertnum = meshptr->velmbas, velosum = 0;

193

vertnum < meshptr->velmnnd; vertnum ++) {

194

if (meshptr->velotax[vertnum] < 1) {

195

errorPrint ("meshCheck: invalid element vertex load");

196

return (1);

197

}

198

velosum += meshptr->velotax[vertnum];

199

}

200

}

201

if (velosum != meshptr->velosum) {

202

errorPrint ("meshCheck: invalid element vertex load sum");

203

return (1);

204

}

205

206

if (meshptr->vnlotax == NULL) /* Recompute node vertex load sum */

207

vnlosum = meshptr->vnodnnd - meshptr->vnodbas;

208

else {

209

for (vertnum = meshptr->vnodbas, vnlosum = 0;

210

vertnum < meshptr->vnodnnd; vertnum ++) {

211

if (meshptr->vnlotax[vertnum] < 1) {

212

errorPrint ("meshCheck: invalid node vertex load");

213

return (1);

214

}

215

vnlosum += meshptr->vnlotax[vertnum];

216

}

217

}

218

if (vnlosum != meshptr->vnlosum) {

219

errorPrint ("meshCheck: invalid node vertex load sum");

220

return (1);

221

}

222

223

if (meshptr->degrmax < degrmax) {

224

errorPrint ("meshCheck: invalid maximum degree");

225

return (1);

226

}

227

228

return (0);

229

}

Older »