/*  parsermodule.c
 *
 *  Copyright 1995-1996 by Fred L. Drake, Jr. and Virginia Polytechnic
 *  Institute and State University, Blacksburg, Virginia, USA.
 *  Portions copyright 1991-1995 by Stichting Mathematisch Centrum,
 *  Amsterdam, The Netherlands.  Copying is permitted under the terms
 *  associated with the main Python distribution, with the additional
 *  restriction that this additional notice be included and maintained
 *  on all distributed copies.
 *
 *  This module serves to replace the original parser module written
 *  by Guido.  The functionality is not matched precisely, but the
 *  original may be implemented on top of this.  This is desirable
 *  since the source of the text to be parsed is now divorced from
 *  this interface.
 *
 *  Unlike the prior interface, the ability to give a parse tree
 *  produced by Python code as a tuple to the compiler is enabled by
 *  this module.  See the documentation for more details.
 *
 *  I've added some annotations that help with the lint code-checking
 *  program, but they're not complete by a long shot.  The real errors
 *  that lint detects are gone, but there are still warnings with
 *  Py_[X]DECREF() and Py_[X]INCREF() macros.  The lint annotations
 *  look like "NOTE(...)".
 */

#include "Python.h"                     /* general Python API             */
#include "graminit.h"                   /* symbols defined in the grammar */
#include "node.h"                       /* internal parser structure      */
#include "token.h"                      /* token definitions              */
                                        /* ISTERMINAL() / ISNONTERMINAL() */
#include "compile.h"                    /* PyNode_Compile()               */

#ifdef lint
#include <note.h>
#else
#define NOTE(x)
#endif

#ifdef macintosh
char *strdup(char *);
#endif

/*  String constants used to initialize module attributes.
 *
 */
static char*
parser_copyright_string
= "Copyright 1995-1996 by Virginia Polytechnic Institute & State\n\
University, Blacksburg, Virginia, USA, and Fred L. Drake, Jr., Reston,\n\
Virginia, USA.  Portions copyright 1991-1995 by Stichting Mathematisch\n\
Centrum, Amsterdam, The Netherlands.";


static char*
parser_doc_string
= "This is an interface to Python's internal parser.";

static char*
parser_version_string = "0.5";


typedef PyObject* (*SeqMaker) (int length);
typedef int (*SeqInserter) (PyObject* sequence,
                            int index,
                            PyObject* element);

/*  The function below is copyrighted by Stichting Mathematisch Centrum.  The
 *  original copyright statement is included below, and continues to apply
 *  in full to the function immediately following.  All other material is
 *  original, copyrighted by Fred L. Drake, Jr. and Virginia Polytechnic
 *  Institute and State University.  Changes were made to comply with the
 *  new naming conventions.  Added arguments to provide support for creating
 *  lists as well as tuples, and optionally including the line numbers.
 */


static PyObject*
node2tuple(node *n,                     /* node to convert               */
           SeqMaker mkseq,              /* create sequence               */
           SeqInserter addelem,         /* func. to add elem. in seq.    */
           int lineno)                  /* include line numbers?         */
{
    if (n == NULL) {
        Py_INCREF(Py_None);
        return (Py_None);
    }
    if (ISNONTERMINAL(TYPE(n))) {
        int i;
        PyObject *v;
        PyObject *w;

        v = mkseq(1 + NCH(n));
        if (v == NULL)
            return (v);
        w = PyInt_FromLong(TYPE(n));
        if (w == NULL) {
            Py_DECREF(v);
            return ((PyObject*) NULL);
        }
        (void) addelem(v, 0, w);
        for (i = 0; i < NCH(n); i++) {
            w = node2tuple(CHILD(n, i), mkseq, addelem, lineno);
            if (w == NULL) {
                Py_DECREF(v);
                return ((PyObject*) NULL);
            }
            (void) addelem(v, i+1, w);
        }
        return (v);
    }
    else if (ISTERMINAL(TYPE(n))) {
        PyObject *result = mkseq(2 + lineno);
        if (result != NULL) {
            (void) addelem(result, 0, PyInt_FromLong(TYPE(n)));
            (void) addelem(result, 1, PyString_FromString(STR(n)));
            if (lineno == 1)
                (void) addelem(result, 2, PyInt_FromLong(n->n_lineno));
        }
        return (result);
    }
    else {
        PyErr_SetString(PyExc_SystemError,
                        "unrecognized parse tree node type");
        return ((PyObject*) NULL);
    }
}
/*
 *  End of material copyrighted by Stichting Mathematisch Centrum.
 */



/*  There are two types of intermediate objects we're interested in:
 *  'eval' and 'exec' types.  These constants can be used in the ast_type
 *  field of the object type to identify which any given object represents.
 *  These should probably go in an external header to allow other extensions
 *  to use them, but then, we really should be using C++ too.  ;-)
 *
 *  The PyAST_FRAGMENT type is not currently supported.  Maybe not useful?
 *  Haven't decided yet.
 */

#define PyAST_EXPR      1
#define PyAST_SUITE     2
#define PyAST_FRAGMENT  3


/*  These are the internal objects and definitions required to implement the
 *  AST type.  Most of the internal names are more reminiscent of the 'old'
 *  naming style, but the code uses the new naming convention.
 */

static PyObject*
parser_error = 0;


typedef struct _PyAST_Object {
    PyObject_HEAD                       /* standard object header           */
    node* ast_node;                     /* the node* returned by the parser */
    int   ast_type;                     /* EXPR or SUITE ?                  */
} PyAST_Object;


staticforward void
parser_free(PyAST_Object *ast);

staticforward int
parser_compare(PyAST_Object *left, PyAST_Object *right);

staticforward PyObject *
parser_getattr(PyObject *self, char *name);


static
PyTypeObject PyAST_Type = {
    PyObject_HEAD_INIT(NULL)
    0,
    "ast",                              /* tp_name              */
    (int) sizeof(PyAST_Object),         /* tp_basicsize         */
    0,                                  /* tp_itemsize          */
    (destructor)parser_free,            /* tp_dealloc           */
    0,                                  /* tp_print             */
    parser_getattr,                     /* tp_getattr           */
    0,                                  /* tp_setattr           */
    (cmpfunc)parser_compare,            /* tp_compare           */
    0,                                  /* tp_repr              */
    0,                                  /* tp_as_number         */
    0,                                  /* tp_as_sequence       */
    0,                                  /* tp_as_mapping        */
    0,                                  /* tp_hash              */
    0,                                  /* tp_call              */
    0,                                  /* tp_str               */
    0,                                  /* tp_getattro          */
    0,                                  /* tp_setattro          */

    /* Functions to access object as input/output buffer */
    0,                                  /* tp_as_buffer         */

    Py_TPFLAGS_DEFAULT,                 /* tp_flags             */

    /* __doc__ */
    "Intermediate representation of a Python parse tree."
};  /* PyAST_Type */


static int
parser_compare_nodes(node *left, node *right)
{
    int j;

    if (TYPE(left) < TYPE(right))
        return (-1);

    if (TYPE(right) < TYPE(left))
        return (1);

    if (ISTERMINAL(TYPE(left)))
        return (strcmp(STR(left), STR(right)));

    if (NCH(left) < NCH(right))
        return (-1);

    if (NCH(right) < NCH(left))
        return (1);

    for (j = 0; j < NCH(left); ++j) {
        int v = parser_compare_nodes(CHILD(left, j), CHILD(right, j));

        if (v != 0)
            return (v);
    }
    return (0);
}


/*  int parser_compare(PyAST_Object* left, PyAST_Object* right)
 *
 *  Comparison function used by the Python operators ==, !=, <, >, <=, >=
 *  This really just wraps a call to parser_compare_nodes() with some easy
 *  checks and protection code.
 *
 */
static int
parser_compare(PyAST_Object *left, PyAST_Object *right)
{
    if (left == right)
        return (0);

    if ((left == 0) || (right == 0))
        return (-1);

    return (parser_compare_nodes(left->ast_node, right->ast_node));
}


/*  parser_newastobject(node* ast)
 *
 *  Allocates a new Python object representing an AST.  This is simply the
 *  'wrapper' object that holds a node* and allows it to be passed around in
 *  Python code.
 *
 */
static PyObject*
parser_newastobject(node *ast, int type)
{
    PyAST_Object* o = PyObject_New(PyAST_Object, &PyAST_Type);

    if (o != 0) {
        o->ast_node = ast;
        o->ast_type = type;
    }
    else {
        PyNode_Free(ast);
    }
    return ((PyObject*)o);
}


/*  void parser_free(PyAST_Object* ast)
 *
 *  This is called by a del statement that reduces the reference count to 0.
 *
 */
static void
parser_free(PyAST_Object *ast)
{
    PyNode_Free(ast->ast_node);
    PyObject_Del(ast);
}


/*  parser_ast2tuple(PyObject* self, PyObject* args, PyObject* kw)
 *
 *  This provides conversion from a node* to a tuple object that can be
 *  returned to the Python-level caller.  The AST object is not modified.
 *
 */
static PyObject*
parser_ast2tuple(PyAST_Object *self, PyObject *args, PyObject *kw)
{
    PyObject *line_option = 0;
    PyObject *res = 0;
    int ok;

    static char *keywords[] = {"ast", "line_info", NULL};

    if (self == NULL) {
        ok = PyArg_ParseTupleAndKeywords(args, kw, "O!|O:ast2tuple", keywords,
                                         &PyAST_Type, &self, &line_option);
    }
    else
        ok = PyArg_ParseTupleAndKeywords(args, kw, "|O:totuple", &keywords[1],
                                         &line_option);
    if (ok != 0) {
        int lineno = 0;
        if (line_option != NULL) {
            lineno = (PyObject_IsTrue(line_option) != 0) ? 1 : 0;
        }
        /*
         *  Convert AST into a tuple representation.  Use Guido's function,
         *  since it's known to work already.
         */
        res = node2tuple(((PyAST_Object*)self)->ast_node,
                         PyTuple_New, PyTuple_SetItem, lineno);
    }
    return (res);
}


/*  parser_ast2list(PyObject* self, PyObject* args, PyObject* kw)
 *
 *  This provides conversion from a node* to a list object that can be
 *  returned to the Python-level caller.  The AST object is not modified.
 *
 */
static PyObject*
parser_ast2list(PyAST_Object *self, PyObject *args, PyObject *kw)
{
    PyObject *line_option = 0;
    PyObject *res = 0;
    int ok;

    static char *keywords[] = {"ast", "line_info", NULL};

    if (self == NULL)
        ok = PyArg_ParseTupleAndKeywords(args, kw, "O!|O:ast2list", keywords,
                                         &PyAST_Type, &self, &line_option);
    else
        ok = PyArg_ParseTupleAndKeywords(args, kw, "|O:tolist", &keywords[1],
                                         &line_option);
    if (ok) {
        int lineno = 0;
        if (line_option != 0) {
            lineno = PyObject_IsTrue(line_option) ? 1 : 0;
        }
        /*
         *  Convert AST into a tuple representation.  Use Guido's function,
         *  since it's known to work already.
         */
        res = node2tuple(self->ast_node,
                         PyList_New, PyList_SetItem, lineno);
    }
    return (res);
}


/*  parser_compileast(PyObject* self, PyObject* args)
 *
 *  This function creates code objects from the parse tree represented by
 *  the passed-in data object.  An optional file name is passed in as well.
 *
 */
static PyObject*
parser_compileast(PyAST_Object *self, PyObject *args, PyObject *kw)
{
    PyObject*     res = 0;
    char*         str = "<ast>";
    int ok;

    static char *keywords[] = {"ast", "filename", NULL};

    if (self == NULL)
        ok = PyArg_ParseTupleAndKeywords(args, kw, "O!|s:compileast", keywords,
                                         &PyAST_Type, &self, &str);
    else
        ok = PyArg_ParseTupleAndKeywords(args, kw, "|s:compile", &keywords[1],
                                         &str);

    if (ok)
        res = (PyObject *)PyNode_Compile(self->ast_node, str);

    return (res);
}


/*  PyObject* parser_isexpr(PyObject* self, PyObject* args)
 *  PyObject* parser_issuite(PyObject* self, PyObject* args)
 *
 *  Checks the passed-in AST object to determine if it is an expression or
 *  a statement suite, respectively.  The return is a Python truth value.
 *
 */
static PyObject*
parser_isexpr(PyAST_Object *self, PyObject *args, PyObject *kw)
{
    PyObject* res = 0;
    int ok;

    static char *keywords[] = {"ast", NULL};

    if (self == NULL)
        ok = PyArg_ParseTupleAndKeywords(args, kw, "O!:isexpr", keywords,
                                         &PyAST_Type, &self);
    else
        ok = PyArg_ParseTupleAndKeywords(args, kw, ":isexpr", &keywords[1]);

    if (ok) {
        /* Check to see if the AST represents an expression or not. */
        res = (self->ast_type == PyAST_EXPR) ? Py_True : Py_False;
        Py_INCREF(res);
    }
    return (res);
}


static PyObject*
parser_issuite(PyAST_Object *self, PyObject *args, PyObject *kw)
{
    PyObject* res = 0;
    int ok;

    static char *keywords[] = {"ast", NULL};

    if (self == NULL)
        ok = PyArg_ParseTupleAndKeywords(args, kw, "O!:issuite", keywords,
                                         &PyAST_Type, &self);
    else
        ok = PyArg_ParseTupleAndKeywords(args, kw, ":issuite", &keywords[1]);

    if (ok) {
        /* Check to see if the AST represents an expression or not. */
        res = (self->ast_type == PyAST_EXPR) ? Py_False : Py_True;
        Py_INCREF(res);
    }
    return (res);
}


#define PUBLIC_METHOD_TYPE (METH_VARARGS|METH_KEYWORDS)

static PyMethodDef
parser_methods[] = {
    {"compile",         (PyCFunction)parser_compileast, PUBLIC_METHOD_TYPE,
        "Compile this AST object into a code object."},
    {"isexpr",          (PyCFunction)parser_isexpr,     PUBLIC_METHOD_TYPE,
        "Determines if this AST object was created from an expression."},
    {"issuite",         (PyCFunction)parser_issuite,    PUBLIC_METHOD_TYPE,
        "Determines if this AST object was created from a suite."},
    {"tolist",          (PyCFunction)parser_ast2list,   PUBLIC_METHOD_TYPE,
        "Creates a list-tree representation of this AST."},
    {"totuple",         (PyCFunction)parser_ast2tuple,  PUBLIC_METHOD_TYPE,
        "Creates a tuple-tree representation of this AST."},

    {NULL, NULL, 0, NULL}
};


static PyObject*
parser_getattr(PyObject *self, char *name)
{
    return (Py_FindMethod(parser_methods, self, name));
}


/*  err_string(char* message)
 *
 *  Sets the error string for an exception of type ParserError.
 *
 */
static void
err_string(char *message)
{
    PyErr_SetString(parser_error, message);
}


/*  PyObject* parser_do_parse(PyObject* args, int type)
 *
 *  Internal function to actually execute the parse and return the result if
 *  successful, or set an exception if not.
 *
 */
static PyObject*
parser_do_parse(PyObject *args, PyObject *kw, char *argspec, int type)
{
    char*     string = 0;
    PyObject* res    = 0;

    static char *keywords[] = {"source", NULL};

    if (PyArg_ParseTupleAndKeywords(args, kw, argspec, keywords, &string)) {
        node* n = PyParser_SimpleParseString(string,
                                             (type == PyAST_EXPR)
                                             ? eval_input : file_input);

        if (n != 0)
            res = parser_newastobject(n, type);
        else
            err_string("could not parse string");
    }
    return (res);
}


/*  PyObject* parser_expr(PyObject* self, PyObject* args)
 *  PyObject* parser_suite(PyObject* self, PyObject* args)
 *
 *  External interfaces to the parser itself.  Which is called determines if
 *  the parser attempts to recognize an expression ('eval' form) or statement
 *  suite ('exec' form).  The real work is done by parser_do_parse() above.
 *
 */
static PyObject*
parser_expr(PyAST_Object *self, PyObject *args, PyObject *kw)
{
    NOTE(ARGUNUSED(self))
    return (parser_do_parse(args, kw, "s:expr", PyAST_EXPR));
}


static PyObject*
parser_suite(PyAST_Object *self, PyObject *args, PyObject *kw)
{
    NOTE(ARGUNUSED(self))
    return (parser_do_parse(args, kw, "s:suite", PyAST_SUITE));
}



/*  This is the messy part of the code.  Conversion from a tuple to an AST
 *  object requires that the input tuple be valid without having to rely on
 *  catching an exception from the compiler.  This is done to allow the
 *  compiler itself to remain fast, since most of its input will come from
 *  the parser directly, and therefore be known to be syntactically correct.
 *  This validation is done to ensure that we don't core dump the compile
 *  phase, returning an exception instead.
 *
 *  Two aspects can be broken out in this code:  creating a node tree from
 *  the tuple passed in, and verifying that it is indeed valid.  It may be
 *  advantageous to expand the number of AST types to include funcdefs and
 *  lambdadefs to take advantage of the optimizer, recognizing those ASTs
 *  here.  They are not necessary, and not quite as useful in a raw form.
 *  For now, let's get expressions and suites working reliably.
 */


staticforward node* build_node_tree(PyObject *tuple);
staticforward int   validate_expr_tree(node *tree);
staticforward int   validate_file_input(node *tree);


/*  PyObject* parser_tuple2ast(PyObject* self, PyObject* args)
 *
 *  This is the public function, called from the Python code.  It receives a
 *  single tuple object from the caller, and creates an AST object if the
 *  tuple can be validated.  It does this by checking the first code of the
 *  tuple, and, if acceptable, builds the internal representation.  If this
 *  step succeeds, the internal representation is validated as fully as
 *  possible with the various validate_*() routines defined below.
 *
 *  This function must be changed if support is to be added for PyAST_FRAGMENT
 *  AST objects.
 *
 */
static PyObject*
parser_tuple2ast(PyAST_Object *self, PyObject *args, PyObject *kw)
{
    NOTE(ARGUNUSED(self))
    PyObject *ast = 0;
    PyObject *tuple;
    node *tree;

    static char *keywords[] = {"sequence", NULL};

    if (!PyArg_ParseTupleAndKeywords(args, kw, "O:sequence2ast", keywords,
                                     &tuple))
        return (0);
    if (!PySequence_Check(tuple)) {
        PyErr_SetString(PyExc_ValueError,
                        "sequence2ast() requires a single sequence argument");
        return (0);
    }
    /*
     *  Convert the tree to the internal form before checking it.
     */
    tree = build_node_tree(tuple);
    if (tree != 0) {
        int start_sym = TYPE(tree);
        if (start_sym == eval_input) {
            /*  Might be an eval form.  */
            if (validate_expr_tree(tree))
                ast = parser_newastobject(tree, PyAST_EXPR);
        }
        else if (start_sym == file_input) {
            /*  This looks like an exec form so far.  */
            if (validate_file_input(tree))
                ast = parser_newastobject(tree, PyAST_SUITE);
        }
        else {
            /*  This is a fragment, at best. */
            PyNode_Free(tree);
            err_string("parse tree does not use a valid start symbol");
        }
    }
    /*  Make sure we throw an exception on all errors.  We should never
     *  get this, but we'd do well to be sure something is done.
     */
    if ((ast == 0) && !PyErr_Occurred())
        err_string("unspecified AST error occurred");

    return (ast);
}


/*  node* build_node_children()
 *
 *  Iterate across the children of the current non-terminal node and build
 *  their structures.  If successful, return the root of this portion of
 *  the tree, otherwise, 0.  Any required exception will be specified already,
 *  and no memory will have been deallocated.
 *
 */
static node*
build_node_children(PyObject *tuple, node *root, int *line_num)
{
    int len = PyObject_Size(tuple);
    int i;

    for (i = 1; i < len; ++i) {
        /* elem must always be a sequence, however simple */
        PyObject* elem = PySequence_GetItem(tuple, i);
        int ok = elem != NULL;
        long  type = 0;
        char *strn = 0;

        if (ok)
            ok = PySequence_Check(elem);
        if (ok) {
            PyObject *temp = PySequence_GetItem(elem, 0);
            if (temp == NULL)
                ok = 0;
            else {
                ok = PyInt_Check(temp);
                if (ok)
                    type = PyInt_AS_LONG(temp);
                Py_DECREF(temp);
            }
        }
        if (!ok) {
            PyErr_SetObject(parser_error,
                            Py_BuildValue("os", elem,
                                          "Illegal node construct."));
            Py_XDECREF(elem);
            return (0);
        }
        if (ISTERMINAL(type)) {
            int len = PyObject_Size(elem);
            PyObject *temp;

            if ((len != 2) && (len != 3)) {
                err_string("terminal nodes must have 2 or 3 entries");
                return 0;
            }
            temp = PySequence_GetItem(elem, 1);
            if (temp == NULL)
                return 0;
            if (!PyString_Check(temp)) {
                PyErr_Format(parser_error,
                             "second item in terminal node must be a string,"
                             " found %s",
                             ((PyTypeObject*)PyObject_Type(temp))->tp_name);
                Py_DECREF(temp);
                return 0;
            }
            if (len == 3) {
                PyObject *o = PySequence_GetItem(elem, 2);
                if (o != NULL) {
                    if (PyInt_Check(o))
                        *line_num = PyInt_AS_LONG(o);
                    else {
                        PyErr_Format(parser_error,
                                     "third item in terminal node must be an"
                                     " integer, found %s",
                                ((PyTypeObject*)PyObject_Type(temp))->tp_name);
                        Py_DECREF(o);
                        Py_DECREF(temp);
                        return 0;
                    }
                    Py_DECREF(o);
                }
            }
            len = PyString_GET_SIZE(temp) + 1;
            strn = (char *)PyMem_MALLOC(len);
            if (strn != NULL)
                (void) memcpy(strn, PyString_AS_STRING(temp), len);
            Py_DECREF(temp);
        }
        else if (!ISNONTERMINAL(type)) {
            /*
             *  It has to be one or the other; this is an error.
             *  Throw an exception.
             */
            PyErr_SetObject(parser_error,
                            Py_BuildValue("os", elem, "unknown node type."));
            Py_XDECREF(elem);
            return (0);
        }
        PyNode_AddChild(root, type, strn, *line_num);

        if (ISNONTERMINAL(type)) {
            node* new_child = CHILD(root, i - 1);

            if (new_child != build_node_children(elem, new_child, line_num)) {
                Py_XDECREF(elem);
                return (0);
            }
        }
        else if (type == NEWLINE) {     /* It's true:  we increment the     */
            ++(*line_num);              /* line number *after* the newline! */
        }
        Py_XDECREF(elem);
    }
    return (root);
}


static node*
build_node_tree(PyObject *tuple)
{
    node* res = 0;
    PyObject *temp = PySequence_GetItem(tuple, 0);
    long num = -1;

    if (temp != NULL)
        num = PyInt_AsLong(temp);
    Py_XDECREF(temp);
    if (ISTERMINAL(num)) {
        /*
         *  The tuple is simple, but it doesn't start with a start symbol.
         *  Throw an exception now and be done with it.
         */
        tuple = Py_BuildValue("os", tuple,
                      "Illegal ast tuple; cannot start with terminal symbol.");
        PyErr_SetObject(parser_error, tuple);
    }
    else if (ISNONTERMINAL(num)) {
        /*
         *  Not efficient, but that can be handled later.
         */
        int line_num = 0;

        res = PyNode_New(num);
        if (res != build_node_children(tuple, res, &line_num)) {
            PyNode_Free(res);
            res = 0;
        }
    }
    else
        /*  The tuple is illegal -- if the number is neither TERMINAL nor
         *  NONTERMINAL, we can't use it.  Not sure the implementation
         *  allows this condition, but the API doesn't preclude it.
         */
        PyErr_SetObject(parser_error,
                        Py_BuildValue("os", tuple,
                                      "Illegal component tuple."));

    return (res);
}


/*
 *  Validation routines used within the validation section:
 */
staticforward int validate_terminal(node *terminal, int type, char *string);

#define validate_ampersand(ch)  validate_terminal(ch,      AMPER, "&")
#define validate_circumflex(ch) validate_terminal(ch, CIRCUMFLEX, "^")
#define validate_colon(ch)      validate_terminal(ch,      COLON, ":")
#define validate_comma(ch)      validate_terminal(ch,      COMMA, ",")
#define validate_dedent(ch)     validate_terminal(ch,     DEDENT, "")
#define validate_equal(ch)      validate_terminal(ch,      EQUAL, "=")
#define validate_indent(ch)     validate_terminal(ch,     INDENT, (char*)NULL)
#define validate_lparen(ch)     validate_terminal(ch,       LPAR, "(")
#define validate_newline(ch)    validate_terminal(ch,    NEWLINE, (char*)NULL)
#define validate_rparen(ch)     validate_terminal(ch,       RPAR, ")")
#define validate_semi(ch)       validate_terminal(ch,       SEMI, ";")
#define validate_star(ch)       validate_terminal(ch,       STAR, "*")
#define validate_vbar(ch)       validate_terminal(ch,       VBAR, "|")
#define validate_doublestar(ch) validate_terminal(ch, DOUBLESTAR, "**")
#define validate_dot(ch)        validate_terminal(ch,        DOT, ".")
#define validate_name(ch, str)  validate_terminal(ch,       NAME, str)

#define VALIDATER(n)    static int validate_##n(node *tree)

VALIDATER(node);                VALIDATER(small_stmt);
VALIDATER(class);               VALIDATER(node);
VALIDATER(parameters);          VALIDATER(suite);
VALIDATER(testlist);            VALIDATER(varargslist);
VALIDATER(fpdef);               VALIDATER(fplist);
VALIDATER(stmt);                VALIDATER(simple_stmt);
VALIDATER(expr_stmt);           VALIDATER(power);
VALIDATER(print_stmt);          VALIDATER(del_stmt);
VALIDATER(return_stmt);         VALIDATER(list_iter);
VALIDATER(raise_stmt);          VALIDATER(import_stmt);
VALIDATER(global_stmt);         VALIDATER(list_if);
VALIDATER(assert_stmt);         VALIDATER(list_for);
VALIDATER(exec_stmt);           VALIDATER(compound_stmt);
VALIDATER(while);               VALIDATER(for);
VALIDATER(try);                 VALIDATER(except_clause);
VALIDATER(test);                VALIDATER(and_test);
VALIDATER(not_test);            VALIDATER(comparison);
VALIDATER(comp_op);             VALIDATER(expr);
VALIDATER(xor_expr);            VALIDATER(and_expr);
VALIDATER(shift_expr);          VALIDATER(arith_expr);
VALIDATER(term);                VALIDATER(factor);
VALIDATER(atom);                VALIDATER(lambdef);
VALIDATER(trailer);             VALIDATER(subscript);
VALIDATER(subscriptlist);       VALIDATER(sliceop);
VALIDATER(exprlist);            VALIDATER(dictmaker);
VALIDATER(arglist);             VALIDATER(argument);
VALIDATER(listmaker);

#undef VALIDATER

#define is_even(n)      (((n) & 1) == 0)
#define is_odd(n)       (((n) & 1) == 1)


static int
validate_ntype(node *n, int t)
{
    if (TYPE(n) != t) {
        PyErr_Format(parser_error, "Expected node type %d, got %d.",
                     t, TYPE(n));
        return 0;
    }
    return 1;
}


/*  Verifies that the number of child nodes is exactly 'num', raising
 *  an exception if it isn't.  The exception message does not indicate
 *  the exact number of nodes, allowing this to be used to raise the
 *  "right" exception when the wrong number of nodes is present in a
 *  specific variant of a statement's syntax.  This is commonly used
 *  in that fashion.
 */
static int
validate_numnodes(node *n, int num, const char *const name)
{
    if (NCH(n) != num) {
        PyErr_Format(parser_error,
                     "Illegal number of children for %s node.", name);
        return 0;
    }
    return 1;
}


static int
validate_terminal(node *terminal, int type, char *string)
{
    int res = (validate_ntype(terminal, type)
               && ((string == 0) || (strcmp(string, STR(terminal)) == 0)));

    if (!res && !PyErr_Occurred()) {
        PyErr_Format(parser_error,
                     "Illegal terminal: expected \"%s\"", string);
    }
    return (res);
}


/*  X (',' X) [',']
 */
static int
validate_repeating_list(node *tree, int ntype, int (*vfunc)(node *),
                        const char *const name)
{
    int nch = NCH(tree);
    int res = (nch && validate_ntype(tree, ntype)
               && vfunc(CHILD(tree, 0)));

    if (!res && !PyErr_Occurred())
        (void) validate_numnodes(tree, 1, name);
    else {
        if (is_even(nch))
            res = validate_comma(CHILD(tree, --nch));
        if (res && nch > 1) {
            int pos = 1;
            for ( ; res && pos < nch; pos += 2)
                res = (validate_comma(CHILD(tree, pos))
                       && vfunc(CHILD(tree, pos + 1)));
        }
    }
    return (res);
}


/*  validate_class()
 *
 *  classdef:
 *      'class' NAME ['(' testlist ')'] ':' suite
 */
static int
validate_class(node *tree)
{
    int nch = NCH(tree);
    int res = validate_ntype(tree, classdef) && ((nch == 4) || (nch == 7));

    if (res) {
        res = (validate_name(CHILD(tree, 0), "class")
               && validate_ntype(CHILD(tree, 1), NAME)
               && validate_colon(CHILD(tree, nch - 2))
               && validate_suite(CHILD(tree, nch - 1)));
    }
    else
        (void) validate_numnodes(tree, 4, "class");
    if (res && (nch == 7)) {
        res = (validate_lparen(CHILD(tree, 2))
               && validate_testlist(CHILD(tree, 3))
               && validate_rparen(CHILD(tree, 4)));
    }
    return (res);
}


/*  if_stmt:
 *      'if' test ':' suite ('elif' test ':' suite)* ['else' ':' suite]
 */
static int
validate_if(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, if_stmt)
               && (nch >= 4)
               && validate_name(CHILD(tree, 0), "if")
               && validate_test(CHILD(tree, 1))
               && validate_colon(CHILD(tree, 2))
               && validate_suite(CHILD(tree, 3)));

    if (res && ((nch % 4) == 3)) {
        /*  ... 'else' ':' suite  */
        res = (validate_name(CHILD(tree, nch - 3), "else")
               && validate_colon(CHILD(tree, nch - 2))
               && validate_suite(CHILD(tree, nch - 1)));
        nch -= 3;
    }
    else if (!res && !PyErr_Occurred())
        (void) validate_numnodes(tree, 4, "if");
    if ((nch % 4) != 0)
        /* Will catch the case for nch < 4 */
        res = validate_numnodes(tree, 0, "if");
    else if (res && (nch > 4)) {
        /*  ... ('elif' test ':' suite)+ ...  */
        int j = 4;
        while ((j < nch) && res) {
            res = (validate_name(CHILD(tree, j), "elif")
                   && validate_colon(CHILD(tree, j + 2))
                   && validate_test(CHILD(tree, j + 1))
                   && validate_suite(CHILD(tree, j + 3)));
            j += 4;
        }
    }
    return (res);
}


/*  parameters:
 *      '(' [varargslist] ')'
 *
 */
static int
validate_parameters(node *tree)
{
    int nch = NCH(tree);
    int res = validate_ntype(tree, parameters) && ((nch == 2) || (nch == 3));

    if (res) {
        res = (validate_lparen(CHILD(tree, 0))
               && validate_rparen(CHILD(tree, nch - 1)));
        if (res && (nch == 3))
            res = validate_varargslist(CHILD(tree, 1));
    }
    else {
        (void) validate_numnodes(tree, 2, "parameters");
    }
    return (res);
}


/*  validate_suite()
 *
 *  suite:
 *      simple_stmt
 *    | NEWLINE INDENT stmt+ DEDENT
 */
static int
validate_suite(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, suite) && ((nch == 1) || (nch >= 4)));

    if (res && (nch == 1))
        res = validate_simple_stmt(CHILD(tree, 0));
    else if (res) {
        /*  NEWLINE INDENT stmt+ DEDENT  */
        res = (validate_newline(CHILD(tree, 0))
               && validate_indent(CHILD(tree, 1))
               && validate_stmt(CHILD(tree, 2))
               && validate_dedent(CHILD(tree, nch - 1)));

        if (res && (nch > 4)) {
            int i = 3;
            --nch;                      /* forget the DEDENT     */
            for ( ; res && (i < nch); ++i)
                res = validate_stmt(CHILD(tree, i));
        }
        else if (nch < 4)
            res = validate_numnodes(tree, 4, "suite");
    }
    return (res);
}


static int
validate_testlist(node *tree)
{
    return (validate_repeating_list(tree, testlist,
                                    validate_test, "testlist"));
}


/* '*' NAME [',' '**' NAME] | '**' NAME
 */
static int
validate_varargslist_trailer(node *tree, int start)
{
    int nch = NCH(tree);
    int res = 0;
    int sym;

    if (nch <= start) {
        err_string("expected variable argument trailer for varargslist");
        return 0;
    }
    sym = TYPE(CHILD(tree, start));
    if (sym == STAR) {
        /*
         *  ('*' NAME [',' '**' NAME]
         */
        if (nch-start == 2)
            res = validate_name(CHILD(tree, start+1), NULL);
        else if (nch-start == 5)
            res = (validate_name(CHILD(tree, start+1), NULL)
                   && validate_comma(CHILD(tree, start+2))
                   && validate_doublestar(CHILD(tree, start+3))
                   && validate_name(CHILD(tree, start+4), NULL));
    }
    else if (sym == DOUBLESTAR) {
        /*
         *  '**' NAME
         */
        if (nch-start == 2)
            res = validate_name(CHILD(tree, start+1), NULL);
    }
    if (!res)
        err_string("illegal variable argument trailer for varargslist");
    return res;
}


/*  validate_varargslist()
 *
 *  varargslist:
 *      (fpdef ['=' test] ',')*
 *           ('*' NAME [',' '**' NAME]
 *         | '**' NAME)
 *    | fpdef ['=' test] (',' fpdef ['=' test])* [',']
 *
 */
static int
validate_varargslist(node *tree)
{
    int nch = NCH(tree);
    int res = validate_ntype(tree, varargslist) && (nch != 0);
    int sym;

    if (!res)
        return 0;
    if (nch < 1) {
        err_string("varargslist missing child nodes");
        return 0;
    }
    sym = TYPE(CHILD(tree, 0));
    if (sym == STAR || sym == DOUBLESTAR)
        /* whole thing matches:
         *      '*' NAME [',' '**' NAME] | '**' NAME
         */
        res = validate_varargslist_trailer(tree, 0);
    else if (sym == fpdef) {
        int i = 0;

        sym = TYPE(CHILD(tree, nch-1));
        if (sym == NAME) {
            /*
             *   (fpdef ['=' test] ',')+
             *       ('*' NAME [',' '**' NAME]
             *     | '**' NAME)
             */
            /* skip over (fpdef ['=' test] ',')+ */
            while (res && (i+2 <= nch)) {
                res = validate_fpdef(CHILD(tree, i));
                ++i;
                if (res && TYPE(CHILD(tree, i)) == EQUAL && (i+2 <= nch)) {
                    res = (validate_equal(CHILD(tree, i))
                           && validate_test(CHILD(tree, i+1)));
                    if (res)
                        i += 2;
                }
                if (res && i < nch) {
                    res = validate_comma(CHILD(tree, i));
                    ++i;
                    if (res && i < nch
                        && (TYPE(CHILD(tree, i)) == DOUBLESTAR
                            || TYPE(CHILD(tree, i)) == STAR))
                        break;
                }
            }
            /* ... '*' NAME [',' '**' NAME] | '**' NAME
             * i --^^^
             */
            if (res)
                res = validate_varargslist_trailer(tree, i);
        }
        else {
            /*
             *  fpdef ['=' test] (',' fpdef ['=' test])* [',']
             */
            /* strip trailing comma node */
            if (sym == COMMA) {
                res = validate_comma(CHILD(tree, nch-1));
                if (!res)
                    return 0;
                --nch;
            }
            /*
             *  fpdef ['=' test] (',' fpdef ['=' test])*
             */
            res = validate_fpdef(CHILD(tree, 0));
            ++i;
            if (res && (i+2 <= nch) && TYPE(CHILD(tree, i)) == EQUAL) {
                res = (validate_equal(CHILD(tree, i))
                       && validate_test(CHILD(tree, i+1)));
                i += 2;
            }
            /*
             *  ... (',' fpdef ['=' test])*
             *  i ---^^^
             */
            while (res && (nch - i) >= 2) {
                res = (validate_comma(CHILD(tree, i))
                       && validate_fpdef(CHILD(tree, i+1)));
                i += 2;
                if (res && (nch - i) >= 2 && TYPE(CHILD(tree, i)) == EQUAL) {
                    res = (validate_equal(CHILD(tree, i))
                           && validate_test(CHILD(tree, i+1)));
                    i += 2;
                }
            }
            if (res && nch - i != 0) {
                res = 0;
                err_string("illegal formation for varargslist");
            }
        }
    }
    return res;
}


/*  list_iter:  list_for | list_if
 */
static int
validate_list_iter(node *tree)
{
    int res = (validate_ntype(tree, list_iter)
               && validate_numnodes(tree, 1, "list_iter"));
    if (res && TYPE(CHILD(tree, 0)) == list_for)
        res = validate_list_for(CHILD(tree, 0));
    else
        res = validate_list_if(CHILD(tree, 0));

    return res;
}

/*  list_for:  'for' exprlist 'in' testlist [list_iter]
 */
static int
validate_list_for(node *tree)
{
    int nch = NCH(tree);
    int res;

    if (nch == 5)
        res = validate_list_iter(CHILD(tree, 4));
    else
        res = validate_numnodes(tree, 4, "list_for");

    if (res)
        res = (validate_name(CHILD(tree, 0), "for")
               && validate_exprlist(CHILD(tree, 1))
               && validate_name(CHILD(tree, 2), "in")
               && validate_testlist(CHILD(tree, 3)));

    return res;
}

/*  list_if:  'if' test [list_iter]
 */
static int
validate_list_if(node *tree)
{
    int nch = NCH(tree);
    int res;

    if (nch == 3)
        res = validate_list_iter(CHILD(tree, 2));
    else
        res = validate_numnodes(tree, 2, "list_if");

    if (res)
        res = (validate_name(CHILD(tree, 0), "if")
               && validate_test(CHILD(tree, 1)));

    return res;
}


/*  validate_fpdef()
 *
 *  fpdef:
 *      NAME
 *    | '(' fplist ')'
 */
static int
validate_fpdef(node *tree)
{
    int nch = NCH(tree);
    int res = validate_ntype(tree, fpdef);

    if (res) {
        if (nch == 1)
            res = validate_ntype(CHILD(tree, 0), NAME);
        else if (nch == 3)
            res = (validate_lparen(CHILD(tree, 0))
                   && validate_fplist(CHILD(tree, 1))
                   && validate_rparen(CHILD(tree, 2)));
        else
            res = validate_numnodes(tree, 1, "fpdef");
    }
    return (res);
}


static int
validate_fplist(node *tree)
{
    return (validate_repeating_list(tree, fplist,
                                    validate_fpdef, "fplist"));
}


/*  simple_stmt | compound_stmt
 *
 */
static int
validate_stmt(node *tree)
{
    int res = (validate_ntype(tree, stmt)
               && validate_numnodes(tree, 1, "stmt"));

    if (res) {
        tree = CHILD(tree, 0);

        if (TYPE(tree) == simple_stmt)
            res = validate_simple_stmt(tree);
        else
            res = validate_compound_stmt(tree);
    }
    return (res);
}


/*  small_stmt (';' small_stmt)* [';'] NEWLINE
 *
 */
static int
validate_simple_stmt(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, simple_stmt)
               && (nch >= 2)
               && validate_small_stmt(CHILD(tree, 0))
               && validate_newline(CHILD(tree, nch - 1)));

    if (nch < 2)
        res = validate_numnodes(tree, 2, "simple_stmt");
    --nch;                              /* forget the NEWLINE    */
    if (res && is_even(nch))
        res = validate_semi(CHILD(tree, --nch));
    if (res && (nch > 2)) {
        int i;

        for (i = 1; res && (i < nch); i += 2)
            res = (validate_semi(CHILD(tree, i))
                   && validate_small_stmt(CHILD(tree, i + 1)));
    }
    return (res);
}


static int
validate_small_stmt(node *tree)
{
    int nch = NCH(tree);
    int res = validate_numnodes(tree, 1, "small_stmt");

    if (res) {
        int ntype = TYPE(CHILD(tree, 0));

        if (  (ntype == expr_stmt)
              || (ntype == print_stmt)
              || (ntype == del_stmt)
              || (ntype == pass_stmt)
              || (ntype == flow_stmt)
              || (ntype == import_stmt)
              || (ntype == global_stmt)
              || (ntype == assert_stmt)
              || (ntype == exec_stmt))
            res = validate_node(CHILD(tree, 0));
        else {
            res = 0;
            err_string("illegal small_stmt child type");
        }
    }
    else if (nch == 1) {
        res = 0;
        PyErr_Format(parser_error,
                     "Unrecognized child node of small_stmt: %d.",
                     TYPE(CHILD(tree, 0)));
    }
    return (res);
}


/*  compound_stmt:
 *      if_stmt | while_stmt | for_stmt | try_stmt | funcdef | classdef
 */
static int
validate_compound_stmt(node *tree)
{
    int res = (validate_ntype(tree, compound_stmt)
               && validate_numnodes(tree, 1, "compound_stmt"));
    int ntype;

    if (!res)
        return (0);

    tree = CHILD(tree, 0);
    ntype = TYPE(tree);
    if (  (ntype == if_stmt)
          || (ntype == while_stmt)
          || (ntype == for_stmt)
          || (ntype == try_stmt)
          || (ntype == funcdef)
          || (ntype == classdef))
        res = validate_node(tree);
    else {
        res = 0;
        PyErr_Format(parser_error,
                     "Illegal compound statement type: %d.", TYPE(tree));
    }
    return (res);
}


static int
validate_expr_stmt(node *tree)
{
    int j;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, expr_stmt)
               && is_odd(nch)
               && validate_testlist(CHILD(tree, 0)));

    if (res && nch == 3
        && TYPE(CHILD(tree, 1)) == augassign) {
        res = (validate_numnodes(CHILD(tree, 1), 1, "augassign")
               && validate_testlist(CHILD(tree, 2)));

        if (res) {
            char *s = STR(CHILD(CHILD(tree, 1), 0));

            res = (strcmp(s, "+=") == 0
                   || strcmp(s, "-=") == 0
                   || strcmp(s, "*=") == 0
                   || strcmp(s, "/=") == 0
                   || strcmp(s, "%=") == 0
                   || strcmp(s, "&=") == 0
                   || strcmp(s, "|=") == 0
                   || strcmp(s, "^=") == 0
                   || strcmp(s, "<<=") == 0
                   || strcmp(s, ">>=") == 0
                   || strcmp(s, "**=") == 0);
            if (!res)
                err_string("illegal augmmented assignment operator");
        }
    }
    else {
        for (j = 1; res && (j < nch); j += 2)
            res = (validate_equal(CHILD(tree, j))
                   && validate_testlist(CHILD(tree, j + 1)));
    }
    return (res);
}


/*  print_stmt:
 *
 *      'print' ( [ test (',' test)* [','] ]
 *              | '>>' test [ (',' test)+ [','] ] )
 */
static int
validate_print_stmt(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, print_stmt)
               && (nch > 0)
               && validate_name(CHILD(tree, 0), "print"));

    if (res && nch > 1) {
        int sym = TYPE(CHILD(tree, 1));
        int i = 1;
        int allow_trailing_comma = 1;

        if (sym == test)
            res = validate_test(CHILD(tree, i++));
        else {
            if (nch < 3)
                res = validate_numnodes(tree, 3, "print_stmt");
            else {
                res = (validate_ntype(CHILD(tree, i), RIGHTSHIFT)
                       && validate_test(CHILD(tree, i+1)));
                i += 2;
                allow_trailing_comma = 0;
            }
        }
        if (res) {
            /*  ... (',' test)* [',']  */
            while (res && i+2 <= nch) {
                res = (validate_comma(CHILD(tree, i))
                       && validate_test(CHILD(tree, i+1)));
                allow_trailing_comma = 1;
                i += 2;
            }
            if (res && !allow_trailing_comma)
                res = validate_numnodes(tree, i, "print_stmt");
            else if (res && i < nch)
                res = validate_comma(CHILD(tree, i));
        }
    }
    return (res);
}


static int
validate_del_stmt(node *tree)
{
    return (validate_numnodes(tree, 2, "del_stmt")
            && validate_name(CHILD(tree, 0), "del")
            && validate_exprlist(CHILD(tree, 1)));
}


static int
validate_return_stmt(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, return_stmt)
               && ((nch == 1) || (nch == 2))
               && validate_name(CHILD(tree, 0), "return"));

    if (res && (nch == 2))
        res = validate_testlist(CHILD(tree, 1));

    return (res);
}


static int
validate_raise_stmt(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, raise_stmt)
               && ((nch == 1) || (nch == 2) || (nch == 4) || (nch == 6)));

    if (res) {
        res = validate_name(CHILD(tree, 0), "raise");
        if (res && (nch >= 2))
            res = validate_test(CHILD(tree, 1));
        if (res && nch > 2) {
            res = (validate_comma(CHILD(tree, 2))
                   && validate_test(CHILD(tree, 3)));
            if (res && (nch > 4))
                res = (validate_comma(CHILD(tree, 4))
                       && validate_test(CHILD(tree, 5)));
        }
    }
    else
        (void) validate_numnodes(tree, 2, "raise");
    if (res && (nch == 4))
        res = (validate_comma(CHILD(tree, 2))
               && validate_test(CHILD(tree, 3)));

    return (res);
}


static int
validate_import_as_name(node *tree)
{
    int nch = NCH(tree);
    int ok = validate_ntype(tree, import_as_name);

    if (ok) {
        if (nch == 1)
            ok = validate_name(CHILD(tree, 0), NULL);
        else if (nch == 3)
            ok = (validate_name(CHILD(tree, 0), NULL)
                  && validate_name(CHILD(tree, 1), "as")
                  && validate_name(CHILD(tree, 2), NULL));
        else
            ok = validate_numnodes(tree, 3, "import_as_name");
    }
    return ok;
}


/* dotted_name:  NAME ("." NAME)*
 */
static int
validate_dotted_name(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, dotted_name)
               && is_odd(nch)
               && validate_name(CHILD(tree, 0), NULL));
    int i;

    for (i = 1; res && (i < nch); i += 2) {
        res = (validate_dot(CHILD(tree, i))
               && validate_name(CHILD(tree, i+1), NULL));
    }
    return res;
}


/* dotted_as_name:  dotted_name [NAME NAME]
 */
static int
validate_dotted_as_name(node *tree)
{
    int nch = NCH(tree);
    int res = validate_ntype(tree, dotted_as_name);

    if (res) {
        if (nch == 1)
            res = validate_dotted_name(CHILD(tree, 0));
        else if (nch == 3)
            res = (validate_dotted_name(CHILD(tree, 0))
                   && validate_name(CHILD(tree, 1), "as")
                   && validate_name(CHILD(tree, 2), NULL));
        else {
            res = 0;
            err_string("illegal number of children for dotted_as_name");
        }
    }
    return res;
}


/*  import_stmt:
 *
 *    'import' dotted_as_name (',' dotted_as_name)*
 *  | 'from' dotted_name 'import' ('*' | import_as_name (',' import_as_name)*)
 */
static int
validate_import_stmt(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, import_stmt)
               && (nch >= 2) && is_even(nch)
               && validate_ntype(CHILD(tree, 0), NAME));

    if (res && (strcmp(STR(CHILD(tree, 0)), "import") == 0)) {
        int j;

        res = validate_dotted_as_name(CHILD(tree, 1));
        for (j = 2; res && (j < nch); j += 2)
            res = (validate_comma(CHILD(tree, j))
                   && validate_dotted_as_name(CHILD(tree, j + 1)));
    }
    else if (res && (res = validate_name(CHILD(tree, 0), "from"))) {
        res = ((nch >= 4) && is_even(nch)
               && validate_dotted_name(CHILD(tree, 1))
               && validate_name(CHILD(tree, 2), "import"));
        if (nch == 4) {
            if (TYPE(CHILD(tree, 3)) == import_as_name)
                res = validate_import_as_name(CHILD(tree, 3));
            else
                res = validate_star(CHILD(tree, 3));
        }
        else {
            /*  'from' dotted_name 'import' import_as_name
             *      (',' import_as_name)+
             */
            int j;
            res = validate_import_as_name(CHILD(tree, 3));
            for (j = 4; res && (j < nch); j += 2)
                res = (validate_comma(CHILD(tree, j))
                       && validate_import_as_name(CHILD(tree, j + 1)));
        }
    }
    else
        res = 0;

    return (res);
}


static int
validate_global_stmt(node *tree)
{
    int j;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, global_stmt)
               && is_even(nch) && (nch >= 2));

    if (res)
        res = (validate_name(CHILD(tree, 0), "global")
               && validate_ntype(CHILD(tree, 1), NAME));
    for (j = 2; res && (j < nch); j += 2)
        res = (validate_comma(CHILD(tree, j))
               && validate_ntype(CHILD(tree, j + 1), NAME));

    return (res);
}


/*  exec_stmt:
 *
 *  'exec' expr ['in' test [',' test]]
 */
static int
validate_exec_stmt(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, exec_stmt)
               && ((nch == 2) || (nch == 4) || (nch == 6))
               && validate_name(CHILD(tree, 0), "exec")
               && validate_expr(CHILD(tree, 1)));

    if (!res && !PyErr_Occurred())
        err_string("illegal exec statement");
    if (res && (nch > 2))
        res = (validate_name(CHILD(tree, 2), "in")
               && validate_test(CHILD(tree, 3)));
    if (res && (nch == 6))
        res = (validate_comma(CHILD(tree, 4))
               && validate_test(CHILD(tree, 5)));

    return (res);
}


/*  assert_stmt:
 *
 *  'assert' test [',' test]
 */
static int
validate_assert_stmt(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, assert_stmt)
               && ((nch == 2) || (nch == 4))
               && (validate_name(CHILD(tree, 0), "__assert__") ||
                   validate_name(CHILD(tree, 0), "assert"))
               && validate_test(CHILD(tree, 1)));

    if (!res && !PyErr_Occurred())
        err_string("illegal assert statement");
    if (res && (nch > 2))
        res = (validate_comma(CHILD(tree, 2))
               && validate_test(CHILD(tree, 3)));

    return (res);
}


static int
validate_while(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, while_stmt)
               && ((nch == 4) || (nch == 7))
               && validate_name(CHILD(tree, 0), "while")
               && validate_test(CHILD(tree, 1))
               && validate_colon(CHILD(tree, 2))
               && validate_suite(CHILD(tree, 3)));

    if (res && (nch == 7))
        res = (validate_name(CHILD(tree, 4), "else")
               && validate_colon(CHILD(tree, 5))
               && validate_suite(CHILD(tree, 6)));

    return (res);
}


static int
validate_for(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, for_stmt)
               && ((nch == 6) || (nch == 9))
               && validate_name(CHILD(tree, 0), "for")
               && validate_exprlist(CHILD(tree, 1))
               && validate_name(CHILD(tree, 2), "in")
               && validate_testlist(CHILD(tree, 3))
               && validate_colon(CHILD(tree, 4))
               && validate_suite(CHILD(tree, 5)));

    if (res && (nch == 9))
        res = (validate_name(CHILD(tree, 6), "else")
               && validate_colon(CHILD(tree, 7))
               && validate_suite(CHILD(tree, 8)));

    return (res);
}


/*  try_stmt:
 *      'try' ':' suite (except_clause ':' suite)+ ['else' ':' suite]
 *    | 'try' ':' suite 'finally' ':' suite
 *
 */
static int
validate_try(node *tree)
{
    int nch = NCH(tree);
    int pos = 3;
    int res = (validate_ntype(tree, try_stmt)
               && (nch >= 6) && ((nch % 3) == 0));

    if (res)
        res = (validate_name(CHILD(tree, 0), "try")
               && validate_colon(CHILD(tree, 1))
               && validate_suite(CHILD(tree, 2))
               && validate_colon(CHILD(tree, nch - 2))
               && validate_suite(CHILD(tree, nch - 1)));
    else if (!PyErr_Occurred()) {
        const char* name = "except";
        if (TYPE(CHILD(tree, nch - 3)) != except_clause)
            name = STR(CHILD(tree, nch - 3));

        PyErr_Format(parser_error,
                     "Illegal number of children for try/%s node.", name);
    }
    /*  Skip past except_clause sections:  */
    while (res && (TYPE(CHILD(tree, pos)) == except_clause)) {
        res = (validate_except_clause(CHILD(tree, pos))
               && validate_colon(CHILD(tree, pos + 1))
               && validate_suite(CHILD(tree, pos + 2)));
        pos += 3;
    }
    if (res && (pos < nch)) {
        res = validate_ntype(CHILD(tree, pos), NAME);
        if (res && (strcmp(STR(CHILD(tree, pos)), "finally") == 0))
            res = (validate_numnodes(tree, 6, "try/finally")
                   && validate_colon(CHILD(tree, 4))
                   && validate_suite(CHILD(tree, 5)));
        else if (res) {
            if (nch == (pos + 3)) {
                res = ((strcmp(STR(CHILD(tree, pos)), "except") == 0)
                       || (strcmp(STR(CHILD(tree, pos)), "else") == 0));
                if (!res)
                    err_string("illegal trailing triple in try statement");
            }
            else if (nch == (pos + 6)) {
                res = (validate_name(CHILD(tree, pos), "except")
                       && validate_colon(CHILD(tree, pos + 1))
                       && validate_suite(CHILD(tree, pos + 2))
                       && validate_name(CHILD(tree, pos + 3), "else"));
            }
            else
                res = validate_numnodes(tree, pos + 3, "try/except");
        }
    }
    return (res);
}


static int
validate_except_clause(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, except_clause)
               && ((nch == 1) || (nch == 2) || (nch == 4))
               && validate_name(CHILD(tree, 0), "except"));

    if (res && (nch > 1))
        res = validate_test(CHILD(tree, 1));
    if (res && (nch == 4))
        res = (validate_comma(CHILD(tree, 2))
               && validate_test(CHILD(tree, 3)));

    return (res);
}


static int
validate_test(node *tree)
{
    int nch = NCH(tree);
    int res = validate_ntype(tree, test) && is_odd(nch);

    if (res && (TYPE(CHILD(tree, 0)) == lambdef))
        res = ((nch == 1)
               && validate_lambdef(CHILD(tree, 0)));
    else if (res) {
        int pos;
        res = validate_and_test(CHILD(tree, 0));
        for (pos = 1; res && (pos < nch); pos += 2)
            res = (validate_name(CHILD(tree, pos), "or")
                   && validate_and_test(CHILD(tree, pos + 1)));
    }
    return (res);
}


static int
validate_and_test(node *tree)
{
    int pos;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, and_test)
               && is_odd(nch)
               && validate_not_test(CHILD(tree, 0)));

    for (pos = 1; res && (pos < nch); pos += 2)
        res = (validate_name(CHILD(tree, pos), "and")
               && validate_not_test(CHILD(tree, 0)));

    return (res);
}


static int
validate_not_test(node *tree)
{
    int nch = NCH(tree);
    int res = validate_ntype(tree, not_test) && ((nch == 1) || (nch == 2));

    if (res) {
        if (nch == 2)
            res = (validate_name(CHILD(tree, 0), "not")
                   && validate_not_test(CHILD(tree, 1)));
        else if (nch == 1)
            res = validate_comparison(CHILD(tree, 0));
    }
    return (res);
}


static int
validate_comparison(node *tree)
{
    int pos;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, comparison)
               && is_odd(nch)
               && validate_expr(CHILD(tree, 0)));

    for (pos = 1; res && (pos < nch); pos += 2)
        res = (validate_comp_op(CHILD(tree, pos))
               && validate_expr(CHILD(tree, pos + 1)));

    return (res);
}


static int
validate_comp_op(node *tree)
{
    int res = 0;
    int nch = NCH(tree);

    if (!validate_ntype(tree, comp_op))
        return (0);
    if (nch == 1) {
        /*
         *  Only child will be a terminal with a well-defined symbolic name
         *  or a NAME with a string of either 'is' or 'in'
         */
        tree = CHILD(tree, 0);
        switch (TYPE(tree)) {
            case LESS:
            case GREATER:
            case EQEQUAL:
            case EQUAL:
            case LESSEQUAL:
            case GREATEREQUAL:
            case NOTEQUAL:
              res = 1;
              break;
            case NAME:
              res = ((strcmp(STR(tree), "in") == 0)
                     || (strcmp(STR(tree), "is") == 0));
              if (!res) {
                  PyErr_Format(parser_error,
                               "illegal operator '%s'", STR(tree));
              }
              break;
          default:
              err_string("illegal comparison operator type");
              break;
        }
    }
    else if ((res = validate_numnodes(tree, 2, "comp_op")) != 0) {
        res = (validate_ntype(CHILD(tree, 0), NAME)
               && validate_ntype(CHILD(tree, 1), NAME)
               && (((strcmp(STR(CHILD(tree, 0)), "is") == 0)
                    && (strcmp(STR(CHILD(tree, 1)), "not") == 0))
                   || ((strcmp(STR(CHILD(tree, 0)), "not") == 0)
                       && (strcmp(STR(CHILD(tree, 1)), "in") == 0))));
        if (!res && !PyErr_Occurred())
            err_string("unknown comparison operator");
    }
    return (res);
}


static int
validate_expr(node *tree)
{
    int j;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, expr)
               && is_odd(nch)
               && validate_xor_expr(CHILD(tree, 0)));

    for (j = 2; res && (j < nch); j += 2)
        res = (validate_xor_expr(CHILD(tree, j))
               && validate_vbar(CHILD(tree, j - 1)));

    return (res);
}


static int
validate_xor_expr(node *tree)
{
    int j;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, xor_expr)
               && is_odd(nch)
               && validate_and_expr(CHILD(tree, 0)));

    for (j = 2; res && (j < nch); j += 2)
        res = (validate_circumflex(CHILD(tree, j - 1))
               && validate_and_expr(CHILD(tree, j)));

    return (res);
}


static int
validate_and_expr(node *tree)
{
    int pos;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, and_expr)
               && is_odd(nch)
               && validate_shift_expr(CHILD(tree, 0)));

    for (pos = 1; res && (pos < nch); pos += 2)
        res = (validate_ampersand(CHILD(tree, pos))
               && validate_shift_expr(CHILD(tree, pos + 1)));

    return (res);
}


static int
validate_chain_two_ops(node *tree, int (*termvalid)(node *), int op1, int op2)
 {
    int pos = 1;
    int nch = NCH(tree);
    int res = (is_odd(nch)
               && (*termvalid)(CHILD(tree, 0)));

    for ( ; res && (pos < nch); pos += 2) {
        if (TYPE(CHILD(tree, pos)) != op1)
            res = validate_ntype(CHILD(tree, pos), op2);
        if (res)
            res = (*termvalid)(CHILD(tree, pos + 1));
    }
    return (res);
}


static int
validate_shift_expr(node *tree)
{
    return (validate_ntype(tree, shift_expr)
            && validate_chain_two_ops(tree, validate_arith_expr,
                                      LEFTSHIFT, RIGHTSHIFT));
}


static int
validate_arith_expr(node *tree)
{
    return (validate_ntype(tree, arith_expr)
            && validate_chain_two_ops(tree, validate_term, PLUS, MINUS));
}


static int
validate_term(node *tree)
{
    int pos = 1;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, term)
               && is_odd(nch)
               && validate_factor(CHILD(tree, 0)));

    for ( ; res && (pos < nch); pos += 2)
        res = (((TYPE(CHILD(tree, pos)) == STAR)
               || (TYPE(CHILD(tree, pos)) == SLASH)
               || (TYPE(CHILD(tree, pos)) == PERCENT))
               && validate_factor(CHILD(tree, pos + 1)));

    return (res);
}


/*  factor:
 *
 *  factor: ('+'|'-'|'~') factor | power
 */
static int
validate_factor(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, factor)
               && (((nch == 2)
                    && ((TYPE(CHILD(tree, 0)) == PLUS)
                        || (TYPE(CHILD(tree, 0)) == MINUS)
                        || (TYPE(CHILD(tree, 0)) == TILDE))
                    && validate_factor(CHILD(tree, 1)))
                   || ((nch == 1)
                       && validate_power(CHILD(tree, 0)))));
    return (res);
}


/*  power:
 *
 *  power: atom trailer* ('**' factor)*
 */
static int
validate_power(node *tree)
{
    int pos = 1;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, power) && (nch >= 1)
               && validate_atom(CHILD(tree, 0)));

    while (res && (pos < nch) && (TYPE(CHILD(tree, pos)) == trailer))
        res = validate_trailer(CHILD(tree, pos++));
    if (res && (pos < nch)) {
        if (!is_even(nch - pos)) {
            err_string("illegal number of nodes for 'power'");
            return (0);
        }
        for ( ; res && (pos < (nch - 1)); pos += 2)
            res = (validate_doublestar(CHILD(tree, pos))
                   && validate_factor(CHILD(tree, pos + 1)));
    }
    return (res);
}


static int
validate_atom(node *tree)
{
    int pos;
    int nch = NCH(tree);
    int res = validate_ntype(tree, atom);

    if (res && nch < 1)
        res = validate_numnodes(tree, nch+1, "atom");
    if (res) {
        switch (TYPE(CHILD(tree, 0))) {
          case LPAR:
            res = ((nch <= 3)
                   && (validate_rparen(CHILD(tree, nch - 1))));

            if (res && (nch == 3))
                res = validate_testlist(CHILD(tree, 1));
            break;
          case LSQB:
            if (nch == 2)
                res = validate_ntype(CHILD(tree, 1), RSQB);
            else if (nch == 3)
                res = (validate_listmaker(CHILD(tree, 1))
                       && validate_ntype(CHILD(tree, 2), RSQB));
            else {
                res = 0;
                err_string("illegal list display atom");
            }
            break;
          case LBRACE:
            res = ((nch <= 3)
                   && validate_ntype(CHILD(tree, nch - 1), RBRACE));

            if (res && (nch == 3))
                res = validate_dictmaker(CHILD(tree, 1));
            break;
          case BACKQUOTE:
            res = ((nch == 3)
                   && validate_testlist(CHILD(tree, 1))
                   && validate_ntype(CHILD(tree, 2), BACKQUOTE));
            break;
          case NAME:
          case NUMBER:
            res = (nch == 1);
            break;
          case STRING:
            for (pos = 1; res && (pos < nch); ++pos)
                res = validate_ntype(CHILD(tree, pos), STRING);
            break;
          default:
            res = 0;
            break;
        }
    }
    return (res);
}


/*  listmaker:
 *    test ( list_for | (',' test)* [','] )
 */
static int
validate_listmaker(node *tree)
{
    int nch = NCH(tree);
    int ok = nch;

    if (nch == 0)
        err_string("missing child nodes of listmaker");
    else
        ok = validate_test(CHILD(tree, 0));

    /*
     *  list_iter | (',' test)* [',']
     */
    if (nch == 2 && TYPE(CHILD(tree, 1)) == list_for)
        ok = validate_list_for(CHILD(tree, 1));
    else {
        /*  (',' test)* [',']  */
        int i = 1;
        while (ok && nch - i >= 2) {
            ok = (validate_comma(CHILD(tree, i))
                  && validate_test(CHILD(tree, i+1)));
            i += 2;
        }
        if (ok && i == nch-1)
            ok = validate_comma(CHILD(tree, i));
        else if (i != nch) {
            ok = 0;
            err_string("illegal trailing nodes for listmaker");
        }
    }
    return ok;
}


/*  funcdef:
 *      'def' NAME parameters ':' suite
 *
 */
static int
validate_funcdef(node *tree)
{
    return (validate_ntype(tree, funcdef)
            && validate_numnodes(tree, 5, "funcdef")
            && validate_name(CHILD(tree, 0), "def")
            && validate_ntype(CHILD(tree, 1), NAME)
            && validate_colon(CHILD(tree, 3))
            && validate_parameters(CHILD(tree, 2))
            && validate_suite(CHILD(tree, 4)));
}


static int
validate_lambdef(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, lambdef)
               && ((nch == 3) || (nch == 4))
               && validate_name(CHILD(tree, 0), "lambda")
               && validate_colon(CHILD(tree, nch - 2))
               && validate_test(CHILD(tree, nch - 1)));

    if (res && (nch == 4))
        res = validate_varargslist(CHILD(tree, 1));
    else if (!res && !PyErr_Occurred())
        (void) validate_numnodes(tree, 3, "lambdef");

    return (res);
}


/*  arglist:
 *
 *  (argument ',')* (argument [','] | '*' test [',' '**' test] | '**' test)
 */
static int
validate_arglist(node *tree)
{
    int nch = NCH(tree);
    int i = 0;
    int ok = 1;

    if (nch <= 0)
        /* raise the right error from having an invalid number of children */
        return validate_numnodes(tree, nch + 1, "arglist");

    while (ok && nch-i >= 2) {
        /* skip leading (argument ',') */
        ok = (validate_argument(CHILD(tree, i))
              && validate_comma(CHILD(tree, i+1)));
        if (ok)
            i += 2;
        else
            PyErr_Clear();
    }
    ok = 1;
    if (nch-i > 0) {
        /*
         * argument | '*' test [',' '**' test] | '**' test
         */
        int sym = TYPE(CHILD(tree, i));

        if (sym == argument) {
            ok = validate_argument(CHILD(tree, i));
            if (ok && i+1 != nch) {
                err_string("illegal arglist specification"
                           " (extra stuff on end)");
                ok = 0;
            }
        }
        else if (sym == STAR) {
            ok = validate_star(CHILD(tree, i));
            if (ok && (nch-i == 2))
                ok = validate_test(CHILD(tree, i+1));
            else if (ok && (nch-i == 5))
                ok = (validate_test(CHILD(tree, i+1))
                      && validate_comma(CHILD(tree, i+2))
                      && validate_doublestar(CHILD(tree, i+3))
                      && validate_test(CHILD(tree, i+4)));
            else {
                err_string("illegal use of '*' in arglist");
                ok = 0;
            }
        }
        else if (sym == DOUBLESTAR) {
            if (nch-i == 2)
                ok = (validate_doublestar(CHILD(tree, i))
                      && validate_test(CHILD(tree, i+1)));
            else {
                err_string("illegal use of '**' in arglist");
                ok = 0;
            }
        }
        else {
            err_string("illegal arglist specification");
            ok = 0;
        }
    }
    return (ok);
}



/*  argument:
 *
 *  [test '='] test
 */
static int
validate_argument(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, argument)
               && ((nch == 1) || (nch == 3))
               && validate_test(CHILD(tree, 0)));

    if (res && (nch == 3))
        res = (validate_equal(CHILD(tree, 1))
               && validate_test(CHILD(tree, 2)));

    return (res);
}



/*  trailer:
 *
 *  '(' [arglist] ')' | '[' subscriptlist ']' | '.' NAME
 */
static int
validate_trailer(node *tree)
{
    int nch = NCH(tree);
    int res = validate_ntype(tree, trailer) && ((nch == 2) || (nch == 3));

    if (res) {
        switch (TYPE(CHILD(tree, 0))) {
          case LPAR:
            res = validate_rparen(CHILD(tree, nch - 1));
            if (res && (nch == 3))
                res = validate_arglist(CHILD(tree, 1));
            break;
          case LSQB:
            res = (validate_numnodes(tree, 3, "trailer")
                   && validate_subscriptlist(CHILD(tree, 1))
                   && validate_ntype(CHILD(tree, 2), RSQB));
            break;
          case DOT:
            res = (validate_numnodes(tree, 2, "trailer")
                   && validate_ntype(CHILD(tree, 1), NAME));
            break;
          default:
            res = 0;
            break;
        }
    }
    else {
        (void) validate_numnodes(tree, 2, "trailer");
    }
    return (res);
}


/*  subscriptlist:
 *
 *  subscript (',' subscript)* [',']
 */
static int
validate_subscriptlist(node *tree)
{
    return (validate_repeating_list(tree, subscriptlist,
                                    validate_subscript, "subscriptlist"));
}


/*  subscript:
 *
 *  '.' '.' '.' | test | [test] ':' [test] [sliceop]
 */
static int
validate_subscript(node *tree)
{
    int offset = 0;
    int nch = NCH(tree);
    int res = validate_ntype(tree, subscript) && (nch >= 1) && (nch <= 4);

    if (!res) {
        if (!PyErr_Occurred())
            err_string("invalid number of arguments for subscript node");
        return (0);
    }
    if (TYPE(CHILD(tree, 0)) == DOT)
        /* take care of ('.' '.' '.') possibility */
        return (validate_numnodes(tree, 3, "subscript")
                && validate_dot(CHILD(tree, 0))
                && validate_dot(CHILD(tree, 1))
                && validate_dot(CHILD(tree, 2)));
    if (nch == 1) {
        if (TYPE(CHILD(tree, 0)) == test)
            res = validate_test(CHILD(tree, 0));
        else
            res = validate_colon(CHILD(tree, 0));
        return (res);
    }
    /*  Must be [test] ':' [test] [sliceop],
     *  but at least one of the optional components will
     *  be present, but we don't know which yet.
     */
    if ((TYPE(CHILD(tree, 0)) != COLON) || (nch == 4)) {
        res = validate_test(CHILD(tree, 0));
        offset = 1;
    }
    if (res)
        res = validate_colon(CHILD(tree, offset));
    if (res) {
        int rem = nch - ++offset;
        if (rem) {
            if (TYPE(CHILD(tree, offset)) == test) {
                res = validate_test(CHILD(tree, offset));
                ++offset;
                --rem;
            }
            if (res && rem)
                res = validate_sliceop(CHILD(tree, offset));
        }
    }
    return (res);
}


static int
validate_sliceop(node *tree)
{
    int nch = NCH(tree);
    int res = ((nch == 1) || validate_numnodes(tree, 2, "sliceop"))
              && validate_ntype(tree, sliceop);
    if (!res && !PyErr_Occurred()) {
        res = validate_numnodes(tree, 1, "sliceop");
    }
    if (res)
        res = validate_colon(CHILD(tree, 0));
    if (res && (nch == 2))
        res = validate_test(CHILD(tree, 1));

    return (res);
}


static int
validate_exprlist(node *tree)
{
    return (validate_repeating_list(tree, exprlist,
                                    validate_expr, "exprlist"));
}


static int
validate_dictmaker(node *tree)
{
    int nch = NCH(tree);
    int res = (validate_ntype(tree, dictmaker)
               && (nch >= 3)
               && validate_test(CHILD(tree, 0))
               && validate_colon(CHILD(tree, 1))
               && validate_test(CHILD(tree, 2)));

    if (res && ((nch % 4) == 0))
        res = validate_comma(CHILD(tree, --nch));
    else if (res)
        res = ((nch % 4) == 3);

    if (res && (nch > 3)) {
        int pos = 3;
        /*  ( ',' test ':' test )*  */
        while (res && (pos < nch)) {
            res = (validate_comma(CHILD(tree, pos))
                   && validate_test(CHILD(tree, pos + 1))
                   && validate_colon(CHILD(tree, pos + 2))
                   && validate_test(CHILD(tree, pos + 3)));
            pos += 4;
        }
    }
    return (res);
}


static int
validate_eval_input(node *tree)
{
    int pos;
    int nch = NCH(tree);
    int res = (validate_ntype(tree, eval_input)
               && (nch >= 2)
               && validate_testlist(CHILD(tree, 0))
               && validate_ntype(CHILD(tree, nch - 1), ENDMARKER));

    for (pos = 1; res && (pos < (nch - 1)); ++pos)
        res = validate_ntype(CHILD(tree, pos), NEWLINE);

    return (res);
}


static int
validate_node(node *tree)
{
    int   nch  = 0;                     /* num. children on current node  */
    int   res  = 1;                     /* result value                   */
    node* next = 0;                     /* node to process after this one */

    while (res & (tree != 0)) {
        nch  = NCH(tree);
        next = 0;
        switch (TYPE(tree)) {
            /*
             *  Definition nodes.
             */
          case funcdef:
            res = validate_funcdef(tree);
            break;
          case classdef:
            res = validate_class(tree);
            break;
            /*
             *  "Trivial" parse tree nodes.
             *  (Why did I call these trivial?)
             */
          case stmt:
            res = validate_stmt(tree);
            break;
          case small_stmt:
            /*
             *  expr_stmt | print_stmt | del_stmt | pass_stmt | flow_stmt
             *  | import_stmt | global_stmt | exec_stmt | assert_stmt
             */
            res = validate_small_stmt(tree);
            break;
          case flow_stmt:
            res  = (validate_numnodes(tree, 1, "flow_stmt")
                    && ((TYPE(CHILD(tree, 0)) == break_stmt)
                        || (TYPE(CHILD(tree, 0)) == continue_stmt)
                        || (TYPE(CHILD(tree, 0)) == return_stmt)
                        || (TYPE(CHILD(tree, 0)) == raise_stmt)));
            if (res)
                next = CHILD(tree, 0);
            else if (nch == 1)
                err_string("illegal flow_stmt type");
            break;
            /*
             *  Compound statements.
             */
          case simple_stmt:
            res = validate_simple_stmt(tree);
            break;
          case compound_stmt:
            res = validate_compound_stmt(tree);
            break;
            /*
             *  Fundamental statements.
             */
          case expr_stmt:
            res = validate_expr_stmt(tree);
            break;
          case print_stmt:
            res = validate_print_stmt(tree);
            break;
          case del_stmt:
            res = validate_del_stmt(tree);
            break;
          case pass_stmt:
            res = (validate_numnodes(tree, 1, "pass")
                   && validate_name(CHILD(tree, 0), "pass"));
            break;
          case break_stmt:
            res = (validate_numnodes(tree, 1, "break")
                   && validate_name(CHILD(tree, 0), "break"));
            break;
          case continue_stmt:
            res = (validate_numnodes(tree, 1, "continue")
                   && validate_name(CHILD(tree, 0), "continue"));
            break;
          case return_stmt:
            res = validate_return_stmt(tree);
            break;
          case raise_stmt:
            res = validate_raise_stmt(tree);
            break;
          case import_stmt:
            res = validate_import_stmt(tree);
            break;
          case global_stmt:
            res = validate_global_stmt(tree);
            break;
          case exec_stmt:
            res = validate_exec_stmt(tree);
            break;
          case assert_stmt:
            res = validate_assert_stmt(tree);
            break;
          case if_stmt:
            res = validate_if(tree);
            break;
          case while_stmt:
            res = validate_while(tree);
            break;
          case for_stmt:
            res = validate_for(tree);
            break;
          case try_stmt:
            res = validate_try(tree);
            break;
          case suite:
            res = validate_suite(tree);
            break;
            /*
             *  Expression nodes.
             */
          case testlist:
            res = validate_testlist(tree);
            break;
          case test:
            res = validate_test(tree);
            break;
          case and_test:
            res = validate_and_test(tree);
            break;
          case not_test:
            res = validate_not_test(tree);
            break;
          case comparison:
            res = validate_comparison(tree);
            break;
          case exprlist:
            res = validate_exprlist(tree);
            break;
          case comp_op:
            res = validate_comp_op(tree);
            break;
          case expr:
            res = validate_expr(tree);
            break;
          case xor_expr:
            res = validate_xor_expr(tree);
            break;
          case and_expr:
            res = validate_and_expr(tree);
            break;
          case shift_expr:
            res = validate_shift_expr(tree);
            break;
          case arith_expr:
            res = validate_arith_expr(tree);
            break;
          case term:
            res = validate_term(tree);
            break;
          case factor:
            res = validate_factor(tree);
            break;
          case power:
            res = validate_power(tree);
            break;
          case atom:
            res = validate_atom(tree);
            break;

          default:
            /* Hopefully never reached! */
            err_string("unrecognized node type");
            res = 0;
            break;
        }
        tree = next;
    }
    return (res);
}


static int
validate_expr_tree(node *tree)
{
    int res = validate_eval_input(tree);

    if (!res && !PyErr_Occurred())
        err_string("could not validate expression tuple");

    return (res);
}


/*  file_input:
 *      (NEWLINE | stmt)* ENDMARKER
 */
static int
validate_file_input(node *tree)
{
    int j   = 0;
    int nch = NCH(tree) - 1;
    int res = ((nch >= 0)
               && validate_ntype(CHILD(tree, nch), ENDMARKER));

    for ( ; res && (j < nch); ++j) {
        if (TYPE(CHILD(tree, j)) == stmt)
            res = validate_stmt(CHILD(tree, j));
        else
            res = validate_newline(CHILD(tree, j));
    }
    /*  This stays in to prevent any internal failures from getting to the
     *  user.  Hopefully, this won't be needed.  If a user reports getting
     *  this, we have some debugging to do.
     */
    if (!res && !PyErr_Occurred())
        err_string("VALIDATION FAILURE: report this to the maintainer!");

    return (res);
}


static PyObject*
pickle_constructor = NULL;


static PyObject*
parser__pickler(PyObject *self, PyObject *args)
{
    NOTE(ARGUNUSED(self))
    PyObject *result = NULL;
    PyObject *ast = NULL;
    PyObject *empty_dict = NULL;

    if (PyArg_ParseTuple(args, "O!:_pickler", &PyAST_Type, &ast)) {
        PyObject *newargs;
        PyObject *tuple;

        if ((empty_dict = PyDict_New()) == NULL)
            goto finally;
        if ((newargs = Py_BuildValue("Oi", ast, 1)) == NULL)
            goto finally;
        tuple = parser_ast2tuple((PyAST_Object*)NULL, newargs, empty_dict);
        if (tuple != NULL) {
            result = Py_BuildValue("O(O)", pickle_constructor, tuple);
            Py_DECREF(tuple);
        }
        Py_DECREF(empty_dict);
        Py_DECREF(newargs);
    }
  finally:
    Py_XDECREF(empty_dict);

    return (result);
}


/*  Functions exported by this module.  Most of this should probably
 *  be converted into an AST object with methods, but that is better
 *  done directly in Python, allowing subclasses to be created directly.
 *  We'd really have to write a wrapper around it all anyway to allow
 *  inheritance.
 */
static PyMethodDef parser_functions[] =  {
    {"ast2tuple",       (PyCFunction)parser_ast2tuple,  PUBLIC_METHOD_TYPE,
        "Creates a tuple-tree representation of an AST."},
    {"ast2list",        (PyCFunction)parser_ast2list,   PUBLIC_METHOD_TYPE,
        "Creates a list-tree representation of an AST."},
    {"compileast",      (PyCFunction)parser_compileast, PUBLIC_METHOD_TYPE,
        "Compiles an AST object into a code object."},
    {"expr",            (PyCFunction)parser_expr,       PUBLIC_METHOD_TYPE,
        "Creates an AST object from an expression."},
    {"isexpr",          (PyCFunction)parser_isexpr,     PUBLIC_METHOD_TYPE,
        "Determines if an AST object was created from an expression."},
    {"issuite",         (PyCFunction)parser_issuite,    PUBLIC_METHOD_TYPE,
        "Determines if an AST object was created from a suite."},
    {"suite",           (PyCFunction)parser_suite,      PUBLIC_METHOD_TYPE,
        "Creates an AST object from a suite."},
    {"sequence2ast",    (PyCFunction)parser_tuple2ast,  PUBLIC_METHOD_TYPE,
        "Creates an AST object from a tree representation."},
    {"tuple2ast",       (PyCFunction)parser_tuple2ast,  PUBLIC_METHOD_TYPE,
        "Creates an AST object from a tree representation."},

    /* private stuff: support pickle module */
    {"_pickler",        (PyCFunction)parser__pickler,   METH_VARARGS,
        "Returns the pickle magic to allow ast objects to be pickled."},

    {NULL, NULL, 0, NULL}
    };


DL_EXPORT(void) initparser(void);  /* supply a prototype */

DL_EXPORT(void)
initparser(void)
{
    PyObject* module;
    PyObject* dict;
        
    PyAST_Type.ob_type = &PyType_Type;
    module = Py_InitModule("parser", parser_functions);
    dict = PyModule_GetDict(module);

    if (parser_error == 0)
        parser_error = PyErr_NewException("parser.ParserError", NULL, NULL);

    if ((parser_error == 0)
        || (PyDict_SetItemString(dict, "ParserError", parser_error) != 0))
    {
	    /* caller will check PyErr_Occurred() */
	    return;
    }
    /*
     *  Nice to have, but don't cry if we fail.
     */
    Py_INCREF(&PyAST_Type);
    PyDict_SetItemString(dict, "ASTType", (PyObject*)&PyAST_Type);

    PyDict_SetItemString(dict, "__copyright__",
                         PyString_FromString(parser_copyright_string));
    PyDict_SetItemString(dict, "__doc__",
                         PyString_FromString(parser_doc_string));
    PyDict_SetItemString(dict, "__version__",
                         PyString_FromString(parser_version_string));

    /* register to support pickling */
    module = PyImport_ImportModule("copy_reg");
    if (module != NULL) {
        PyObject *func, *pickler;

        func = PyObject_GetAttrString(module, "pickle");
        pickle_constructor = PyDict_GetItemString(dict, "sequence2ast");
        pickler = PyDict_GetItemString(dict, "_pickler");
        Py_XINCREF(pickle_constructor);
        if ((func != NULL) && (pickle_constructor != NULL)
            && (pickler != NULL)) {
            PyObject *res;

            res = PyObject_CallFunction(
                    func, "OOO", &PyAST_Type, pickler, pickle_constructor);
            Py_XDECREF(res);
        }
        Py_XDECREF(func);
        Py_DECREF(module);
    }
}
' href='#n2139'>2139</a>
<a id='n2140' href='#n2140'>2140</a>
<a id='n2141' href='#n2141'>2141</a>
<a id='n2142' href='#n2142'>2142</a>
<a id='n2143' href='#n2143'>2143</a>
<a id='n2144' href='#n2144'>2144</a>
<a id='n2145' href='#n2145'>2145</a>
<a id='n2146' href='#n2146'>2146</a>
<a id='n2147' href='#n2147'>2147</a>
<a id='n2148' href='#n2148'>2148</a>
<a id='n2149' href='#n2149'>2149</a>
<a id='n2150' href='#n2150'>2150</a>
<a id='n2151' href='#n2151'>2151</a>
<a id='n2152' href='#n2152'>2152</a>
<a id='n2153' href='#n2153'>2153</a>
<a id='n2154' href='#n2154'>2154</a>
<a id='n2155' href='#n2155'>2155</a>
<a id='n2156' href='#n2156'>2156</a>
<a id='n2157' href='#n2157'>2157</a>
<a id='n2158' href='#n2158'>2158</a>
<a id='n2159' href='#n2159'>2159</a>
<a id='n2160' href='#n2160'>2160</a>
<a id='n2161' href='#n2161'>2161</a>
<a id='n2162' href='#n2162'>2162</a>
<a id='n2163' href='#n2163'>2163</a>
<a id='n2164' href='#n2164'>2164</a>
<a id='n2165' href='#n2165'>2165</a>
<a id='n2166' href='#n2166'>2166</a>
<a id='n2167' href='#n2167'>2167</a>
<a id='n2168' href='#n2168'>2168</a>
<a id='n2169' href='#n2169'>2169</a>
<a id='n2170' href='#n2170'>2170</a>
<a id='n2171' href='#n2171'>2171</a>
<a id='n2172' href='#n2172'>2172</a>
<a id='n2173' href='#n2173'>2173</a>
<a id='n2174' href='#n2174'>2174</a>
<a id='n2175' href='#n2175'>2175</a>
<a id='n2176' href='#n2176'>2176</a>
<a id='n2177' href='#n2177'>2177</a>
<a id='n2178' href='#n2178'>2178</a>
<a id='n2179' href='#n2179'>2179</a>
<a id='n2180' href='#n2180'>2180</a>
<a id='n2181' href='#n2181'>2181</a>
<a id='n2182' href='#n2182'>2182</a>
<a id='n2183' href='#n2183'>2183</a>
<a id='n2184' href='#n2184'>2184</a>
<a id='n2185' href='#n2185'>2185</a>
<a id='n2186' href='#n2186'>2186</a>
<a id='n2187' href='#n2187'>2187</a>
<a id='n2188' href='#n2188'>2188</a>
<a id='n2189' href='#n2189'>2189</a>
<a id='n2190' href='#n2190'>2190</a>
<a id='n2191' href='#n2191'>2191</a>
<a id='n2192' href='#n2192'>2192</a>
<a id='n2193' href='#n2193'>2193</a>
<a id='n2194' href='#n2194'>2194</a>
<a id='n2195' href='#n2195'>2195</a>
<a id='n2196' href='#n2196'>2196</a>
<a id='n2197' href='#n2197'>2197</a>
<a id='n2198' href='#n2198'>2198</a>
<a id='n2199' href='#n2199'>2199</a>
<a id='n2200' href='#n2200'>2200</a>
<a id='n2201' href='#n2201'>2201</a>
<a id='n2202' href='#n2202'>2202</a>
<a id='n2203' href='#n2203'>2203</a>
<a id='n2204' href='#n2204'>2204</a>
<a id='n2205' href='#n2205'>2205</a>
<a id='n2206' href='#n2206'>2206</a>
<a id='n2207' href='#n2207'>2207</a>
<a id='n2208' href='#n2208'>2208</a>
<a id='n2209' href='#n2209'>2209</a>
<a id='n2210' href='#n2210'>2210</a>
<a id='n2211' href='#n2211'>2211</a>
<a id='n2212' href='#n2212'>2212</a>
<a id='n2213' href='#n2213'>2213</a>
<a id='n2214' href='#n2214'>2214</a>
<a id='n2215' href='#n2215'>2215</a>
<a id='n2216' href='#n2216'>2216</a>
<a id='n2217' href='#n2217'>2217</a>
<a id='n2218' href='#n2218'>2218</a>
<a id='n2219' href='#n2219'>2219</a>
<a id='n2220' href='#n2220'>2220</a>
<a id='n2221' href='#n2221'>2221</a>
<a id='n2222' href='#n2222'>2222</a>
<a id='n2223' href='#n2223'>2223</a>
<a id='n2224' href='#n2224'>2224</a>
<a id='n2225' href='#n2225'>2225</a>
<a id='n2226' href='#n2226'>2226</a>
<a id='n2227' href='#n2227'>2227</a>
<a id='n2228' href='#n2228'>2228</a>
<a id='n2229' href='#n2229'>2229</a>
<a id='n2230' href='#n2230'>2230</a>
<a id='n2231' href='#n2231'>2231</a>
<a id='n2232' href='#n2232'>2232</a>
<a id='n2233' href='#n2233'>2233</a>
<a id='n2234' href='#n2234'>2234</a>
<a id='n2235' href='#n2235'>2235</a>
<a id='n2236' href='#n2236'>2236</a>
<a id='n2237' href='#n2237'>2237</a>
<a id='n2238' href='#n2238'>2238</a>
<a id='n2239' href='#n2239'>2239</a>
<a id='n2240' href='#n2240'>2240</a>
<a id='n2241' href='#n2241'>2241</a>
<a id='n2242' href='#n2242'>2242</a>
<a id='n2243' href='#n2243'>2243</a>
<a id='n2244' href='#n2244'>2244</a>
<a id='n2245' href='#n2245'>2245</a>
<a id='n2246' href='#n2246'>2246</a>
<a id='n2247' href='#n2247'>2247</a>
<a id='n2248' href='#n2248'>2248</a>
<a id='n2249' href='#n2249'>2249</a>
<a id='n2250' href='#n2250'>2250</a>
<a id='n2251' href='#n2251'>2251</a>
<a id='n2252' href='#n2252'>2252</a>
<a id='n2253' href='#n2253'>2253</a>
<a id='n2254' href='#n2254'>2254</a>
<a id='n2255' href='#n2255'>2255</a>
<a id='n2256' href='#n2256'>2256</a>
<a id='n2257' href='#n2257'>2257</a>
<a id='n2258' href='#n2258'>2258</a>
<a id='n2259' href='#n2259'>2259</a>
<a id='n2260' href='#n2260'>2260</a>
<a id='n2261' href='#n2261'>2261</a>
<a id='n2262' href='#n2262'>2262</a>
<a id='n2263' href='#n2263'>2263</a>
<a id='n2264' href='#n2264'>2264</a>
<a id='n2265' href='#n2265'>2265</a>
<a id='n2266' href='#n2266'>2266</a>
<a id='n2267' href='#n2267'>2267</a>
<a id='n2268' href='#n2268'>2268</a>
<a id='n2269' href='#n2269'>2269</a>
<a id='n2270' href='#n2270'>2270</a>
<a id='n2271' href='#n2271'>2271</a>
<a id='n2272' href='#n2272'>2272</a>
<a id='n2273' href='#n2273'>2273</a>
<a id='n2274' href='#n2274'>2274</a>
<a id='n2275' href='#n2275'>2275</a>
<a id='n2276' href='#n2276'>2276</a>
<a id='n2277' href='#n2277'>2277</a>
<a id='n2278' href='#n2278'>2278</a>
<a id='n2279' href='#n2279'>2279</a>
<a id='n2280' href='#n2280'>2280</a>
<a id='n2281' href='#n2281'>2281</a>
<a id='n2282' href='#n2282'>2282</a>
<a id='n2283' href='#n2283'>2283</a>
<a id='n2284' href='#n2284'>2284</a>
<a id='n2285' href='#n2285'>2285</a>
<a id='n2286' href='#n2286'>2286</a>
<a id='n2287' href='#n2287'>2287</a>
<a id='n2288' href='#n2288'>2288</a>
<a id='n2289' href='#n2289'>2289</a>
<a id='n2290' href='#n2290'>2290</a>
<a id='n2291' href='#n2291'>2291</a>
<a id='n2292' href='#n2292'>2292</a>
<a id='n2293' href='#n2293'>2293</a>
<a id='n2294' href='#n2294'>2294</a>
<a id='n2295' href='#n2295'>2295</a>
<a id='n2296' href='#n2296'>2296</a>
<a id='n2297' href='#n2297'>2297</a>
<a id='n2298' href='#n2298'>2298</a>
<a id='n2299' href='#n2299'>2299</a>
<a id='n2300' href='#n2300'>2300</a>
<a id='n2301' href='#n2301'>2301</a>
<a id='n2302' href='#n2302'>2302</a>
<a id='n2303' href='#n2303'>2303</a>
<a id='n2304' href='#n2304'>2304</a>
<a id='n2305' href='#n2305'>2305</a>
<a id='n2306' href='#n2306'>2306</a>
<a id='n2307' href='#n2307'>2307</a>
<a id='n2308' href='#n2308'>2308</a>
<a id='n2309' href='#n2309'>2309</a>
<a id='n2310' href='#n2310'>2310</a>
<a id='n2311' href='#n2311'>2311</a>
<a id='n2312' href='#n2312'>2312</a>
<a id='n2313' href='#n2313'>2313</a>
<a id='n2314' href='#n2314'>2314</a>
<a id='n2315' href='#n2315'>2315</a>
<a id='n2316' href='#n2316'>2316</a>
<a id='n2317' href='#n2317'>2317</a>
<a id='n2318' href='#n2318'>2318</a>
<a id='n2319' href='#n2319'>2319</a>
<a id='n2320' href='#n2320'>2320</a>
<a id='n2321' href='#n2321'>2321</a>
<a id='n2322' href='#n2322'>2322</a>
<a id='n2323' href='#n2323'>2323</a>
<a id='n2324' href='#n2324'>2324</a>
<a id='n2325' href='#n2325'>2325</a>
<a id='n2326' href='#n2326'>2326</a>
<a id='n2327' href='#n2327'>2327</a>
<a id='n2328' href='#n2328'>2328</a>
<a id='n2329' href='#n2329'>2329</a>
<a id='n2330' href='#n2330'>2330</a>
<a id='n2331' href='#n2331'>2331</a>
<a id='n2332' href='#n2332'>2332</a>
<a id='n2333' href='#n2333'>2333</a>
<a id='n2334' href='#n2334'>2334</a>
<a id='n2335' href='#n2335'>2335</a>
<a id='n2336' href='#n2336'>2336</a>
<a id='n2337' href='#n2337'>2337</a>
<a id='n2338' href='#n2338'>2338</a>
<a id='n2339' href='#n2339'>2339</a>
<a id='n2340' href='#n2340'>2340</a>
<a id='n2341' href='#n2341'>2341</a>
<a id='n2342' href='#n2342'>2342</a>
<a id='n2343' href='#n2343'>2343</a>
<a id='n2344' href='#n2344'>2344</a>
<a id='n2345' href='#n2345'>2345</a>
<a id='n2346' href='#n2346'>2346</a>
<a id='n2347' href='#n2347'>2347</a>
<a id='n2348' href='#n2348'>2348</a>
<a id='n2349' href='#n2349'>2349</a>
<a id='n2350' href='#n2350'>2350</a>
<a id='n2351' href='#n2351'>2351</a>
<a id='n2352' href='#n2352'>2352</a>
<a id='n2353' href='#n2353'>2353</a>
<a id='n2354' href='#n2354'>2354</a>
<a id='n2355' href='#n2355'>2355</a>
<a id='n2356' href='#n2356'>2356</a>
<a id='n2357' href='#n2357'>2357</a>
<a id='n2358' href='#n2358'>2358</a>
<a id='n2359' href='#n2359'>2359</a>
<a id='n2360' href='#n2360'>2360</a>
<a id='n2361' href='#n2361'>2361</a>
<a id='n2362' href='#n2362'>2362</a>
<a id='n2363' href='#n2363'>2363</a>
<a id='n2364' href='#n2364'>2364</a>
<a id='n2365' href='#n2365'>2365</a>
<a id='n2366' href='#n2366'>2366</a>
<a id='n2367' href='#n2367'>2367</a>
<a id='n2368' href='#n2368'>2368</a>
<a id='n2369' href='#n2369'>2369</a>
<a id='n2370' href='#n2370'>2370</a>
<a id='n2371' href='#n2371'>2371</a>
<a id='n2372' href='#n2372'>2372</a>
<a id='n2373' href='#n2373'>2373</a>
<a id='n2374' href='#n2374'>2374</a>
<a id='n2375' href='#n2375'>2375</a>
<a id='n2376' href='#n2376'>2376</a>
<a id='n2377' href='#n2377'>2377</a>
<a id='n2378' href='#n2378'>2378</a>
<a id='n2379' href='#n2379'>2379</a>
<a id='n2380' href='#n2380'>2380</a>
<a id='n2381' href='#n2381'>2381</a>
<a id='n2382' href='#n2382'>2382</a>
<a id='n2383' href='#n2383'>2383</a>
<a id='n2384' href='#n2384'>2384</a>
<a id='n2385' href='#n2385'>2385</a>
<a id='n2386' href='#n2386'>2386</a>
<a id='n2387' href='#n2387'>2387</a>
<a id='n2388' href='#n2388'>2388</a>
<a id='n2389' href='#n2389'>2389</a>
<a id='n2390' href='#n2390'>2390</a>
<a id='n2391' href='#n2391'>2391</a>
<a id='n2392' href='#n2392'>2392</a>
<a id='n2393' href='#n2393'>2393</a>
<a id='n2394' href='#n2394'>2394</a>
<a id='n2395' href='#n2395'>2395</a>
<a id='n2396' href='#n2396'>2396</a>
<a id='n2397' href='#n2397'>2397</a>
<a id='n2398' href='#n2398'>2398</a>
<a id='n2399' href='#n2399'>2399</a>
<a id='n2400' href='#n2400'>2400</a>
<a id='n2401' href='#n2401'>2401</a>
<a id='n2402' href='#n2402'>2402</a>
<a id='n2403' href='#n2403'>2403</a>
<a id='n2404' href='#n2404'>2404</a>
<a id='n2405' href='#n2405'>2405</a>
<a id='n2406' href='#n2406'>2406</a>
<a id='n2407' href='#n2407'>2407</a>
<a id='n2408' href='#n2408'>2408</a>
<a id='n2409' href='#n2409'>2409</a>
<a id='n2410' href='#n2410'>2410</a>
<a id='n2411' href='#n2411'>2411</a>
<a id='n2412' href='#n2412'>2412</a>
<a id='n2413' href='#n2413'>2413</a>
<a id='n2414' href='#n2414'>2414</a>
<a id='n2415' href='#n2415'>2415</a>
<a id='n2416' href='#n2416'>2416</a>
<a id='n2417' href='#n2417'>2417</a>
<a id='n2418' href='#n2418'>2418</a>
<a id='n2419' href='#n2419'>2419</a>
<a id='n2420' href='#n2420'>2420</a>
<a id='n2421' href='#n2421'>2421</a>
<a id='n2422' href='#n2422'>2422</a>
<a id='n2423' href='#n2423'>2423</a>
<a id='n2424' href='#n2424'>2424</a>
<a id='n2425' href='#n2425'>2425</a>
<a id='n2426' href='#n2426'>2426</a>
<a id='n2427' href='#n2427'>2427</a>
<a id='n2428' href='#n2428'>2428</a>
<a id='n2429' href='#n2429'>2429</a>
<a id='n2430' href='#n2430'>2430</a>
<a id='n2431' href='#n2431'>2431</a>
<a id='n2432' href='#n2432'>2432</a>
<a id='n2433' href='#n2433'>2433</a>
<a id='n2434' href='#n2434'>2434</a>
<a id='n2435' href='#n2435'>2435</a>
<a id='n2436' href='#n2436'>2436</a>
<a id='n2437' href='#n2437'>2437</a>
<a id='n2438' href='#n2438'>2438</a>
<a id='n2439' href='#n2439'>2439</a>
<a id='n2440' href='#n2440'>2440</a>
<a id='n2441' href='#n2441'>2441</a>
<a id='n2442' href='#n2442'>2442</a>
<a id='n2443' href='#n2443'>2443</a>
<a id='n2444' href='#n2444'>2444</a>
<a id='n2445' href='#n2445'>2445</a>
<a id='n2446' href='#n2446'>2446</a>
<a id='n2447' href='#n2447'>2447</a>
<a id='n2448' href='#n2448'>2448</a>
<a id='n2449' href='#n2449'>2449</a>
<a id='n2450' href='#n2450'>2450</a>
<a id='n2451' href='#n2451'>2451</a>
<a id='n2452' href='#n2452'>2452</a>
<a id='n2453' href='#n2453'>2453</a>
<a id='n2454' href='#n2454'>2454</a>
<a id='n2455' href='#n2455'>2455</a>
<a id='n2456' href='#n2456'>2456</a>
<a id='n2457' href='#n2457'>2457</a>
<a id='n2458' href='#n2458'>2458</a>
<a id='n2459' href='#n2459'>2459</a>
<a id='n2460' href='#n2460'>2460</a>
<a id='n2461' href='#n2461'>2461</a>
<a id='n2462' href='#n2462'>2462</a>
<a id='n2463' href='#n2463'>2463</a>
<a id='n2464' href='#n2464'>2464</a>
<a id='n2465' href='#n2465'>2465</a>
<a id='n2466' href='#n2466'>2466</a>
<a id='n2467' href='#n2467'>2467</a>
<a id='n2468' href='#n2468'>2468</a>
<a id='n2469' href='#n2469'>2469</a>
<a id='n2470' href='#n2470'>2470</a>
<a id='n2471' href='#n2471'>2471</a>
<a id='n2472' href='#n2472'>2472</a>
<a id='n2473' href='#n2473'>2473</a>
<a id='n2474' href='#n2474'>2474</a>
<a id='n2475' href='#n2475'>2475</a>
<a id='n2476' href='#n2476'>2476</a>
<a id='n2477' href='#n2477'>2477</a>
<a id='n2478' href='#n2478'>2478</a>
<a id='n2479' href='#n2479'>2479</a>
<a id='n2480' href='#n2480'>2480</a>
<a id='n2481' href='#n2481'>2481</a>
<a id='n2482' href='#n2482'>2482</a>
<a id='n2483' href='#n2483'>2483</a>
<a id='n2484' href='#n2484'>2484</a>
<a id='n2485' href='#n2485'>2485</a>
<a id='n2486' href='#n2486'>2486</a>
<a id='n2487' href='#n2487'>2487</a>
<a id='n2488' href='#n2488'>2488</a>
<a id='n2489' href='#n2489'>2489</a>
<a id='n2490' href='#n2490'>2490</a>
<a id='n2491' href='#n2491'>2491</a>
<a id='n2492' href='#n2492'>2492</a>
<a id='n2493' href='#n2493'>2493</a>
<a id='n2494' href='#n2494'>2494</a>
<a id='n2495' href='#n2495'>2495</a>
<a id='n2496' href='#n2496'>2496</a>
<a id='n2497' href='#n2497'>2497</a>
<a id='n2498' href='#n2498'>2498</a>
<a id='n2499' href='#n2499'>2499</a>
<a id='n2500' href='#n2500'>2500</a>
<a id='n2501' href='#n2501'>2501</a>
<a id='n2502' href='#n2502'>2502</a>
<a id='n2503' href='#n2503'>2503</a>
<a id='n2504' href='#n2504'>2504</a>
<a id='n2505' href='#n2505'>2505</a>
<a id='n2506' href='#n2506'>2506</a>
<a id='n2507' href='#n2507'>2507</a>
<a id='n2508' href='#n2508'>2508</a>
<a id='n2509' href='#n2509'>2509</a>
<a id='n2510' href='#n2510'>2510</a>
<a id='n2511' href='#n2511'>2511</a>
<a id='n2512' href='#n2512'>2512</a>
<a id='n2513' href='#n2513'>2513</a>
<a id='n2514' href='#n2514'>2514</a>
<a id='n2515' href='#n2515'>2515</a>
<a id='n2516' href='#n2516'>2516</a>
<a id='n2517' href='#n2517'>2517</a>
<a id='n2518' href='#n2518'>2518</a>
<a id='n2519' href='#n2519'>2519</a>
<a id='n2520' href='#n2520'>2520</a>
<a id='n2521' href='#n2521'>2521</a>
<a id='n2522' href='#n2522'>2522</a>
<a id='n2523' href='#n2523'>2523</a>
<a id='n2524' href='#n2524'>2524</a>
<a id='n2525' href='#n2525'>2525</a>
<a id='n2526' href='#n2526'>2526</a>
<a id='n2527' href='#n2527'>2527</a>
<a id='n2528' href='#n2528'>2528</a>
<a id='n2529' href='#n2529'>2529</a>
<a id='n2530' href='#n2530'>2530</a>
<a id='n2531' href='#n2531'>2531</a>
<a id='n2532' href='#n2532'>2532</a>
<a id='n2533' href='#n2533'>2533</a>
<a id='n2534' href='#n2534'>2534</a>
<a id='n2535' href='#n2535'>2535</a>
<a id='n2536' href='#n2536'>2536</a>
<a id='n2537' href='#n2537'>2537</a>
<a id='n2538' href='#n2538'>2538</a>
<a id='n2539' href='#n2539'>2539</a>
<a id='n2540' href='#n2540'>2540</a>
<a id='n2541' href='#n2541'>2541</a>
<a id='n2542' href='#n2542'>2542</a>
<a id='n2543' href='#n2543'>2543</a>
<a id='n2544' href='#n2544'>2544</a>
<a id='n2545' href='#n2545'>2545</a>
<a id='n2546' href='#n2546'>2546</a>
<a id='n2547' href='#n2547'>2547</a>
<a id='n2548' href='#n2548'>2548</a>
<a id='n2549' href='#n2549'>2549</a>
<a id='n2550' href='#n2550'>2550</a>
<a id='n2551' href='#n2551'>2551</a>
<a id='n2552' href='#n2552'>2552</a>
<a id='n2553' href='#n2553'>2553</a>
<a id='n2554' href='#n2554'>2554</a>
<a id='n2555' href='#n2555'>2555</a>
<a id='n2556' href='#n2556'>2556</a>
<a id='n2557' href='#n2557'>2557</a>
<a id='n2558' href='#n2558'>2558</a>
<a id='n2559' href='#n2559'>2559</a>
<a id='n2560' href='#n2560'>2560</a>
<a id='n2561' href='#n2561'>2561</a>
<a id='n2562' href='#n2562'>2562</a>
<a id='n2563' href='#n2563'>2563</a>
<a id='n2564' href='#n2564'>2564</a>
<a id='n2565' href='#n2565'>2565</a>
<a id='n2566' href='#n2566'>2566</a>
<a id='n2567' href='#n2567'>2567</a>
<a id='n2568' href='#n2568'>2568</a>
<a id='n2569' href='#n2569'>2569</a>
<a id='n2570' href='#n2570'>2570</a>
<a id='n2571' href='#n2571'>2571</a>
<a id='n2572' href='#n2572'>2572</a>
<a id='n2573' href='#n2573'>2573</a>
<a id='n2574' href='#n2574'>2574</a>
<a id='n2575' href='#n2575'>2575</a>
<a id='n2576' href='#n2576'>2576</a>
<a id='n2577' href='#n2577'>2577</a>
<a id='n2578' href='#n2578'>2578</a>
<a id='n2579' href='#n2579'>2579</a>
<a id='n2580' href='#n2580'>2580</a>
<a id='n2581' href='#n2581'>2581</a>
<a id='n2582' href='#n2582'>2582</a>
<a id='n2583' href='#n2583'>2583</a>
<a id='n2584' href='#n2584'>2584</a>
<a id='n2585' href='#n2585'>2585</a>
<a id='n2586' href='#n2586'>2586</a>
<a id='n2587' href='#n2587'>2587</a>
<a id='n2588' href='#n2588'>2588</a>
<a id='n2589' href='#n2589'>2589</a>
<a id='n2590' href='#n2590'>2590</a>
<a id='n2591' href='#n2591'>2591</a>
<a id='n2592' href='#n2592'>2592</a>
<a id='n2593' href='#n2593'>2593</a>
<a id='n2594' href='#n2594'>2594</a>
<a id='n2595' href='#n2595'>2595</a>
<a id='n2596' href='#n2596'>2596</a>
<a id='n2597' href='#n2597'>2597</a>
<a id='n2598' href='#n2598'>2598</a>
<a id='n2599' href='#n2599'>2599</a>
<a id='n2600' href='#n2600'>2600</a>
<a id='n2601' href='#n2601'>2601</a>
<a id='n2602' href='#n2602'>2602</a>
<a id='n2603' href='#n2603'>2603</a>
<a id='n2604' href='#n2604'>2604</a>
<a id='n2605' href='#n2605'>2605</a>
<a id='n2606' href='#n2606'>2606</a>
<a id='n2607' href='#n2607'>2607</a>
<a id='n2608' href='#n2608'>2608</a>
<a id='n2609' href='#n2609'>2609</a>
<a id='n2610' href='#n2610'>2610</a>
<a id='n2611' href='#n2611'>2611</a>
<a id='n2612' href='#n2612'>2612</a>
<a id='n2613' href='#n2613'>2613</a>
<a id='n2614' href='#n2614'>2614</a>
<a id='n2615' href='#n2615'>2615</a>
<a id='n2616' href='#n2616'>2616</a>
<a id='n2617' href='#n2617'>2617</a>
<a id='n2618' href='#n2618'>2618</a>
<a id='n2619' href='#n2619'>2619</a>
<a id='n2620' href='#n2620'>2620</a>
<a id='n2621' href='#n2621'>2621</a>
<a id='n2622' href='#n2622'>2622</a>
<a id='n2623' href='#n2623'>2623</a>
<a id='n2624' href='#n2624'>2624</a>
<a id='n2625' href='#n2625'>2625</a>
<a id='n2626' href='#n2626'>2626</a>
<a id='n2627' href='#n2627'>2627</a>
<a id='n2628' href='#n2628'>2628</a>
<a id='n2629' href='#n2629'>2629</a>
<a id='n2630' href='#n2630'>2630</a>
<a id='n2631' href='#n2631'>2631</a>
<a id='n2632' href='#n2632'>2632</a>
<a id='n2633' href='#n2633'>2633</a>
<a id='n2634' href='#n2634'>2634</a>
<a id='n2635' href='#n2635'>2635</a>
<a id='n2636' href='#n2636'>2636</a>
<a id='n2637' href='#n2637'>2637</a>
<a id='n2638' href='#n2638'>2638</a>
<a id='n2639' href='#n2639'>2639</a>
<a id='n2640' href='#n2640'>2640</a>
<a id='n2641' href='#n2641'>2641</a>
<a id='n2642' href='#n2642'>2642</a>
<a id='n2643' href='#n2643'>2643</a>
<a id='n2644' href='#n2644'>2644</a>
<a id='n2645' href='#n2645'>2645</a>
<a id='n2646' href='#n2646'>2646</a>
<a id='n2647' href='#n2647'>2647</a>
<a id='n2648' href='#n2648'>2648</a>
<a id='n2649' href='#n2649'>2649</a>
<a id='n2650' href='#n2650'>2650</a>
<a id='n2651' href='#n2651'>2651</a>
<a id='n2652' href='#n2652'>2652</a>
<a id='n2653' href='#n2653'>2653</a>
<a id='n2654' href='#n2654'>2654</a>
<a id='n2655' href='#n2655'>2655</a>
<a id='n2656' href='#n2656'>2656</a>
<a id='n2657' href='#n2657'>2657</a>
<a id='n2658' href='#n2658'>2658</a>
<a id='n2659' href='#n2659'>2659</a>
<a id='n2660' href='#n2660'>2660</a>
<a id='n2661' href='#n2661'>2661</a>
<a id='n2662' href='#n2662'>2662</a>
<a id='n2663' href='#n2663'>2663</a>
<a id='n2664' href='#n2664'>2664</a>
<a id='n2665' href='#n2665'>2665</a>
<a id='n2666' href='#n2666'>2666</a>
<a id='n2667' href='#n2667'>2667</a>
<a id='n2668' href='#n2668'>2668</a>
<a id='n2669' href='#n2669'>2669</a>
<a id='n2670' href='#n2670'>2670</a>
<a id='n2671' href='#n2671'>2671</a>
<a id='n2672' href='#n2672'>2672</a>
<a id='n2673' href='#n2673'>2673</a>
<a id='n2674' href='#n2674'>2674</a>
<a id='n2675' href='#n2675'>2675</a>
<a id='n2676' href='#n2676'>2676</a>
<a id='n2677' href='#n2677'>2677</a>
<a id='n2678' href='#n2678'>2678</a>
<a id='n2679' href='#n2679'>2679</a>
<a id='n2680' href='#n2680'>2680</a>
<a id='n2681' href='#n2681'>2681</a>
<a id='n2682' href='#n2682'>2682</a>
<a id='n2683' href='#n2683'>2683</a>
<a id='n2684' href='#n2684'>2684</a>
<a id='n2685' href='#n2685'>2685</a>
<a id='n2686' href='#n2686'>2686</a>
<a id='n2687' href='#n2687'>2687</a>
<a id='n2688' href='#n2688'>2688</a>
<a id='n2689' href='#n2689'>2689</a>
<a id='n2690' href='#n2690'>2690</a>
<a id='n2691' href='#n2691'>2691</a>
<a id='n2692' href='#n2692'>2692</a>
<a id='n2693' href='#n2693'>2693</a>
<a id='n2694' href='#n2694'>2694</a>
<a id='n2695' href='#n2695'>2695</a>
<a id='n2696' href='#n2696'>2696</a>
<a id='n2697' href='#n2697'>2697</a>
<a id='n2698' href='#n2698'>2698</a>
<a id='n2699' href='#n2699'>2699</a>
<a id='n2700' href='#n2700'>2700</a>
<a id='n2701' href='#n2701'>2701</a>
<a id='n2702' href='#n2702'>2702</a>
<a id='n2703' href='#n2703'>2703</a>
<a id='n2704' href='#n2704'>2704</a>
<a id='n2705' href='#n2705'>2705</a>
<a id='n2706' href='#n2706'>2706</a>
<a id='n2707' href='#n2707'>2707</a>
<a id='n2708' href='#n2708'>2708</a>
<a id='n2709' href='#n2709'>2709</a>
<a id='n2710' href='#n2710'>2710</a>
<a id='n2711' href='#n2711'>2711</a>
<a id='n2712' href='#n2712'>2712</a>
<a id='n2713' href='#n2713'>2713</a>
<a id='n2714' href='#n2714'>2714</a>
<a id='n2715' href='#n2715'>2715</a>
<a id='n2716' href='#n2716'>2716</a>
<a id='n2717' href='#n2717'>2717</a>
<a id='n2718' href='#n2718'>2718</a>
<a id='n2719' href='#n2719'>2719</a>
<a id='n2720' href='#n2720'>2720</a>
<a id='n2721' href='#n2721'>2721</a>
<a id='n2722' href='#n2722'>2722</a>
<a id='n2723' href='#n2723'>2723</a>
<a id='n2724' href='#n2724'>2724</a>
<a id='n2725' href='#n2725'>2725</a>
<a id='n2726' href='#n2726'>2726</a>
<a id='n2727' href='#n2727'>2727</a>
<a id='n2728' href='#n2728'>2728</a>
<a id='n2729' href='#n2729'>2729</a>
<a id='n2730' href='#n2730'>2730</a>
<a id='n2731' href='#n2731'>2731</a>
<a id='n2732' href='#n2732'>2732</a>
<a id='n2733' href='#n2733'>2733</a>
<a id='n2734' href='#n2734'>2734</a>
<a id='n2735' href='#n2735'>2735</a>
<a id='n2736' href='#n2736'>2736</a>
<a id='n2737' href='#n2737'>2737</a>
<a id='n2738' href='#n2738'>2738</a>
<a id='n2739' href='#n2739'>2739</a>
<a id='n2740' href='#n2740'>2740</a>
<a id='n2741' href='#n2741'>2741</a>
<a id='n2742' href='#n2742'>2742</a>
<a id='n2743' href='#n2743'>2743</a>
<a id='n2744' href='#n2744'>2744</a>
<a id='n2745' href='#n2745'>2745</a>
<a id='n2746' href='#n2746'>2746</a>
<a id='n2747' href='#n2747'>2747</a>
<a id='n2748' href='#n2748'>2748</a>
<a id='n2749' href='#n2749'>2749</a>
<a id='n2750' href='#n2750'>2750</a>
<a id='n2751' href='#n2751'>2751</a>
<a id='n2752' href='#n2752'>2752</a>
<a id='n2753' href='#n2753'>2753</a>
<a id='n2754' href='#n2754'>2754</a>
<a id='n2755' href='#n2755'>2755</a>
<a id='n2756' href='#n2756'>2756</a>
<a id='n2757' href='#n2757'>2757</a>
<a id='n2758' href='#n2758'>2758</a>
<a id='n2759' href='#n2759'>2759</a>
<a id='n2760' href='#n2760'>2760</a>
<a id='n2761' href='#n2761'>2761</a>
<a id='n2762' href='#n2762'>2762</a>
<a id='n2763' href='#n2763'>2763</a>
<a id='n2764' href='#n2764'>2764</a>
<a id='n2765' href='#n2765'>2765</a>
<a id='n2766' href='#n2766'>2766</a>
<a id='n2767' href='#n2767'>2767</a>
<a id='n2768' href='#n2768'>2768</a>
<a id='n2769' href='#n2769'>2769</a>
<a id='n2770' href='#n2770'>2770</a>
<a id='n2771' href='#n2771'>2771</a>
<a id='n2772' href='#n2772'>2772</a>
<a id='n2773' href='#n2773'>2773</a>
<a id='n2774' href='#n2774'>2774</a>
<a id='n2775' href='#n2775'>2775</a>
<a id='n2776' href='#n2776'>2776</a>
<a id='n2777' href='#n2777'>2777</a>
<a id='n2778' href='#n2778'>2778</a>
<a id='n2779' href='#n2779'>2779</a>
<a id='n2780' href='#n2780'>2780</a>
<a id='n2781' href='#n2781'>2781</a>
<a id='n2782' href='#n2782'>2782</a>
<a id='n2783' href='#n2783'>2783</a>
<a id='n2784' href='#n2784'>2784</a>
<a id='n2785' href='#n2785'>2785</a>
<a id='n2786' href='#n2786'>2786</a>
<a id='n2787' href='#n2787'>2787</a>
<a id='n2788' href='#n2788'>2788</a>
<a id='n2789' href='#n2789'>2789</a>
<a id='n2790' href='#n2790'>2790</a>
<a id='n2791' href='#n2791'>2791</a>
<a id='n2792' href='#n2792'>2792</a>
<a id='n2793' href='#n2793'>2793</a>
<a id='n2794' href='#n2794'>2794</a>
<a id='n2795' href='#n2795'>2795</a>
<a id='n2796' href='#n2796'>2796</a>
<a id='n2797' href='#n2797'>2797</a>
<a id='n2798' href='#n2798'>2798</a>
<a id='n2799' href='#n2799'>2799</a>
<a id='n2800' href='#n2800'>2800</a>
<a id='n2801' href='#n2801'>2801</a>
<a id='n2802' href='#n2802'>2802</a>
<a id='n2803' href='#n2803'>2803</a>
<a id='n2804' href='#n2804'>2804</a>
<a id='n2805' href='#n2805'>2805</a>
<a id='n2806' href='#n2806'>2806</a>
<a id='n2807' href='#n2807'>2807</a>
<a id='n2808' href='#n2808'>2808</a>
<a id='n2809' href='#n2809'>2809</a>
<a id='n2810' href='#n2810'>2810</a>
<a id='n2811' href='#n2811'>2811</a>
<a id='n2812' href='#n2812'>2812</a>
<a id='n2813' href='#n2813'>2813</a>
<a id='n2814' href='#n2814'>2814</a>
<a id='n2815' href='#n2815'>2815</a>
<a id='n2816' href='#n2816'>2816</a>
<a id='n2817' href='#n2817'>2817</a>
<a id='n2818' href='#n2818'>2818</a>
<a id='n2819' href='#n2819'>2819</a>
<a id='n2820' href='#n2820'>2820</a>
<a id='n2821' href='#n2821'>2821</a>
<a id='n2822' href='#n2822'>2822</a>
<a id='n2823' href='#n2823'>2823</a>
<a id='n2824' href='#n2824'>2824</a>
<a id='n2825' href='#n2825'>2825</a>
<a id='n2826' href='#n2826'>2826</a>
<a id='n2827' href='#n2827'>2827</a>
<a id='n2828' href='#n2828'>2828</a>
<a id='n2829' href='#n2829'>2829</a>
<a id='n2830' href='#n2830'>2830</a>
<a id='n2831' href='#n2831'>2831</a>
<a id='n2832' href='#n2832'>2832</a>
<a id='n2833' href='#n2833'>2833</a>
<a id='n2834' href='#n2834'>2834</a>
<a id='n2835' href='#n2835'>2835</a>
<a id='n2836' href='#n2836'>2836</a>
<a id='n2837' href='#n2837'>2837</a>
<a id='n2838' href='#n2838'>2838</a>
<a id='n2839' href='#n2839'>2839</a>
<a id='n2840' href='#n2840'>2840</a>
<a id='n2841' href='#n2841'>2841</a>
<a id='n2842' href='#n2842'>2842</a>
<a id='n2843' href='#n2843'>2843</a>
<a id='n2844' href='#n2844'>2844</a>
<a id='n2845' href='#n2845'>2845</a>
<a id='n2846' href='#n2846'>2846</a>
<a id='n2847' href='#n2847'>2847</a>
<a id='n2848' href='#n2848'>2848</a>
<a id='n2849' href='#n2849'>2849</a>
<a id='n2850' href='#n2850'>2850</a>
<a id='n2851' href='#n2851'>2851</a>
<a id='n2852' href='#n2852'>2852</a>
<a id='n2853' href='#n2853'>2853</a>
<a id='n2854' href='#n2854'>2854</a>
<a id='n2855' href='#n2855'>2855</a>
<a id='n2856' href='#n2856'>2856</a>
<a id='n2857' href='#n2857'>2857</a>
<a id='n2858' href='#n2858'>2858</a>
<a id='n2859' href='#n2859'>2859</a>
<a id='n2860' href='#n2860'>2860</a>
<a id='n2861' href='#n2861'>2861</a>
<a id='n2862' href='#n2862'>2862</a>
<a id='n2863' href='#n2863'>2863</a>
<a id='n2864' href='#n2864'>2864</a>
<a id='n2865' href='#n2865'>2865</a>
<a id='n2866' href='#n2866'>2866</a>
<a id='n2867' href='#n2867'>2867</a>
<a id='n2868' href='#n2868'>2868</a>
<a id='n2869' href='#n2869'>2869</a>
<a id='n2870' href='#n2870'>2870</a>
<a id='n2871' href='#n2871'>2871</a>
<a id='n2872' href='#n2872'>2872</a>
<a id='n2873' href='#n2873'>2873</a>
<a id='n2874' href='#n2874'>2874</a>
<a id='n2875' href='#n2875'>2875</a>
<a id='n2876' href='#n2876'>2876</a>
<a id='n2877' href='#n2877'>2877</a>
<a id='n2878' href='#n2878'>2878</a>
<a id='n2879' href='#n2879'>2879</a>
<a id='n2880' href='#n2880'>2880</a>
<a id='n2881' href='#n2881'>2881</a>
<a id='n2882' href='#n2882'>2882</a>
<a id='n2883' href='#n2883'>2883</a>
<a id='n2884' href='#n2884'>2884</a>
<a id='n2885' href='#n2885'>2885</a>
<a id='n2886' href='#n2886'>2886</a>
<a id='n2887' href='#n2887'>2887</a>
<a id='n2888' href='#n2888'>2888</a>
<a id='n2889' href='#n2889'>2889</a>
<a id='n2890' href='#n2890'>2890</a>
<a id='n2891' href='#n2891'>2891</a>
<a id='n2892' href='#n2892'>2892</a>
<a id='n2893' href='#n2893'>2893</a>
<a id='n2894' href='#n2894'>2894</a>
<a id='n2895' href='#n2895'>2895</a>
<a id='n2896' href='#n2896'>2896</a>
<a id='n2897' href='#n2897'>2897</a>
<a id='n2898' href='#n2898'>2898</a>
<a id='n2899' href='#n2899'>2899</a>
<a id='n2900' href='#n2900'>2900</a>
<a id='n2901' href='#n2901'>2901</a>
<a id='n2902' href='#n2902'>2902</a>
<a id='n2903' href='#n2903'>2903</a>
<a id='n2904' href='#n2904'>2904</a>
<a id='n2905' href='#n2905'>2905</a>
<a id='n2906' href='#n2906'>2906</a>
<a id='n2907' href='#n2907'>2907</a>
<a id='n2908' href='#n2908'>2908</a>
<a id='n2909' href='#n2909'>2909</a>
<a id='n2910' href='#n2910'>2910</a>
<a id='n2911' href='#n2911'>2911</a>
<a id='n2912' href='#n2912'>2912</a>
<a id='n2913' href='#n2913'>2913</a>
<a id='n2914' href='#n2914'>2914</a>
<a id='n2915' href='#n2915'>2915</a>
<a id='n2916' href='#n2916'>2916</a>
<a id='n2917' href='#n2917'>2917</a>
<a id='n2918' href='#n2918'>2918</a>
<a id='n2919' href='#n2919'>2919</a>
<a id='n2920' href='#n2920'>2920</a>
<a id='n2921' href='#n2921'>2921</a>
<a id='n2922' href='#n2922'>2922</a>
<a id='n2923' href='#n2923'>2923</a>
<a id='n2924' href='#n2924'>2924</a>
<a id='n2925' href='#n2925'>2925</a>
<a id='n2926' href='#n2926'>2926</a>
<a id='n2927' href='#n2927'>2927</a>
<a id='n2928' href='#n2928'>2928</a>
<a id='n2929' href='#n2929'>2929</a>
<a id='n2930' href='#n2930'>2930</a>
<a id='n2931' href='#n2931'>2931</a>
<a id='n2932' href='#n2932'>2932</a>
<a id='n2933' href='#n2933'>2933</a>
<a id='n2934' href='#n2934'>2934</a>
<a id='n2935' href='#n2935'>2935</a>
<a id='n2936' href='#n2936'>2936</a>
<a id='n2937' href='#n2937'>2937</a>
<a id='n2938' href='#n2938'>2938</a>
<a id='n2939' href='#n2939'>2939</a>
<a id='n2940' href='#n2940'>2940</a>
<a id='n2941' href='#n2941'>2941</a>
<a id='n2942' href='#n2942'>2942</a>
<a id='n2943' href='#n2943'>2943</a>
<a id='n2944' href='#n2944'>2944</a>
<a id='n2945' href='#n2945'>2945</a>
<a id='n2946' href='#n2946'>2946</a>
<a id='n2947' href='#n2947'>2947</a>
<a id='n2948' href='#n2948'>2948</a>
<a id='n2949' href='#n2949'>2949</a>
<a id='n2950' href='#n2950'>2950</a>
<a id='n2951' href='#n2951'>2951</a>
<a id='n2952' href='#n2952'>2952</a>
<a id='n2953' href='#n2953'>2953</a>
<a id='n2954' href='#n2954'>2954</a>
<a id='n2955' href='#n2955'>2955</a>
<a id='n2956' href='#n2956'>2956</a>
<a id='n2957' href='#n2957'>2957</a>
<a id='n2958' href='#n2958'>2958</a>
<a id='n2959' href='#n2959'>2959</a>
<a id='n2960' href='#n2960'>2960</a>
<a id='n2961' href='#n2961'>2961</a>
<a id='n2962' href='#n2962'>2962</a>
<a id='n2963' href='#n2963'>2963</a>
<a id='n2964' href='#n2964'>2964</a>
<a id='n2965' href='#n2965'>2965</a>
<a id='n2966' href='#n2966'>2966</a>
<a id='n2967' href='#n2967'>2967</a>
<a id='n2968' href='#n2968'>2968</a>
<a id='n2969' href='#n2969'>2969</a>
<a id='n2970' href='#n2970'>2970</a>
<a id='n2971' href='#n2971'>2971</a>
<a id='n2972' href='#n2972'>2972</a>
<a id='n2973' href='#n2973'>2973</a>
<a id='n2974' href='#n2974'>2974</a>
<a id='n2975' href='#n2975'>2975</a>
<a id='n2976' href='#n2976'>2976</a>
<a id='n2977' href='#n2977'>2977</a>
<a id='n2978' href='#n2978'>2978</a>
<a id='n2979' href='#n2979'>2979</a>
<a id='n2980' href='#n2980'>2980</a>
<a id='n2981' href='#n2981'>2981</a>
<a id='n2982' href='#n2982'>2982</a>
<a id='n2983' href='#n2983'>2983</a>
<a id='n2984' href='#n2984'>2984</a>
<a id='n2985' href='#n2985'>2985</a>
<a id='n2986' href='#n2986'>2986</a>
<a id='n2987' href='#n2987'>2987</a>
<a id='n2988' href='#n2988'>2988</a>
<a id='n2989' href='#n2989'>2989</a>
<a id='n2990' href='#n2990'>2990</a>
<a id='n2991' href='#n2991'>2991</a>
<a id='n2992' href='#n2992'>2992</a>
<a id='n2993' href='#n2993'>2993</a>
<a id='n2994' href='#n2994'>2994</a>
<a id='n2995' href='#n2995'>2995</a>
<a id='n2996' href='#n2996'>2996</a>
<a id='n2997' href='#n2997'>2997</a>
<a id='n2998' href='#n2998'>2998</a>
<a id='n2999' href='#n2999'>2999</a>
<a id='n3000' href='#n3000'>3000</a>
<a id='n3001' href='#n3001'>3001</a>
<a id='n3002' href='#n3002'>3002</a>
<a id='n3003' href='#n3003'>3003</a>
<a id='n3004' href='#n3004'>3004</a>
<a id='n3005' href='#n3005'>3005</a>
<a id='n3006' href='#n3006'>3006</a>
<a id='n3007' href='#n3007'>3007</a>
<a id='n3008' href='#n3008'>3008</a>
<a id='n3009' href='#n3009'>3009</a>
<a id='n3010' href='#n3010'>3010</a>
<a id='n3011' href='#n3011'>3011</a>
<a id='n3012' href='#n3012'>3012</a>
<a id='n3013' href='#n3013'>3013</a>
<a id='n3014' href='#n3014'>3014</a>
<a id='n3015' href='#n3015'>3015</a>
<a id='n3016' href='#n3016'>3016</a>
<a id='n3017' href='#n3017'>3017</a>
<a id='n3018' href='#n3018'>3018</a>
<a id='n3019' href='#n3019'>3019</a>
<a id='n3020' href='#n3020'>3020</a>
<a id='n3021' href='#n3021'>3021</a>
<a id='n3022' href='#n3022'>3022</a>
<a id='n3023' href='#n3023'>3023</a>
<a id='n3024' href='#n3024'>3024</a>
<a id='n3025' href='#n3025'>3025</a>
<a id='n3026' href='#n3026'>3026</a>
<a id='n3027' href='#n3027'>3027</a>
<a id='n3028' href='#n3028'>3028</a>
<a id='n3029' href='#n3029'>3029</a>
<a id='n3030' href='#n3030'>3030</a>
<a id='n3031' href='#n3031'>3031</a>
<a id='n3032' href='#n3032'>3032</a>
<a id='n3033' href='#n3033'>3033</a>
<a id='n3034' href='#n3034'>3034</a>
<a id='n3035' href='#n3035'>3035</a>
<a id='n3036' href='#n3036'>3036</a>
<a id='n3037' href='#n3037'>3037</a>
<a id='n3038' href='#n3038'>3038</a>
<a id='n3039' href='#n3039'>3039</a>
<a id='n3040' href='#n3040'>3040</a>
<a id='n3041' href='#n3041'>3041</a>
<a id='n3042' href='#n3042'>3042</a>
<a id='n3043' href='#n3043'>3043</a>
<a id='n3044' href='#n3044'>3044</a>
<a id='n3045' href='#n3045'>3045</a>
<a id='n3046' href='#n3046'>3046</a>
<a id='n3047' href='#n3047'>3047</a>
<a id='n3048' href='#n3048'>3048</a>
<a id='n3049' href='#n3049'>3049</a>
<a id='n3050' href='#n3050'>3050</a>
<a id='n3051' href='#n3051'>3051</a>
<a id='n3052' href='#n3052'>3052</a>
<a id='n3053' href='#n3053'>3053</a>
<a id='n3054' href='#n3054'>3054</a>
<a id='n3055' href='#n3055'>3055</a>
<a id='n3056' href='#n3056'>3056</a>
<a id='n3057' href='#n3057'>3057</a>
<a id='n3058' href='#n3058'>3058</a>
<a id='n3059' href='#n3059'>3059</a>
<a id='n3060' href='#n3060'>3060</a>
<a id='n3061' href='#n3061'>3061</a>
<a id='n3062' href='#n3062'>3062</a>
<a id='n3063' href='#n3063'>3063</a>
<a id='n3064' href='#n3064'>3064</a>
<a id='n3065' href='#n3065'>3065</a>
<a id='n3066' href='#n3066'>3066</a>
<a id='n3067' href='#n3067'>3067</a>
<a id='n3068' href='#n3068'>3068</a>
<a id='n3069' href='#n3069'>3069</a>
<a id='n3070' href='#n3070'>3070</a>
<a id='n3071' href='#n3071'>3071</a>
<a id='n3072' href='#n3072'>3072</a>
<a id='n3073' href='#n3073'>3073</a>
<a id='n3074' href='#n3074'>3074</a>
<a id='n3075' href='#n3075'>3075</a>
<a id='n3076' href='#n3076'>3076</a>
<a id='n3077' href='#n3077'>3077</a>
<a id='n3078' href='#n3078'>3078</a>
<a id='n3079' href='#n3079'>3079</a>
<a id='n3080' href='#n3080'>3080</a>
<a id='n3081' href='#n3081'>3081</a>
<a id='n3082' href='#n3082'>3082</a>
<a id='n3083' href='#n3083'>3083</a>
<a id='n3084' href='#n3084'>3084</a>
<a id='n3085' href='#n3085'>3085</a>
<a id='n3086' href='#n3086'>3086</a>
<a id='n3087' href='#n3087'>3087</a>
<a id='n3088' href='#n3088'>3088</a>
<a id='n3089' href='#n3089'>3089</a>
<a id='n3090' href='#n3090'>3090</a>
<a id='n3091' href='#n3091'>3091</a>
<a id='n3092' href='#n3092'>3092</a>
<a id='n3093' href='#n3093'>3093</a>
<a id='n3094' href='#n3094'>3094</a>
<a id='n3095' href='#n3095'>3095</a>
<a id='n3096' href='#n3096'>3096</a>
<a id='n3097' href='#n3097'>3097</a>
<a id='n3098' href='#n3098'>3098</a>
<a id='n3099' href='#n3099'>3099</a>
<a id='n3100' href='#n3100'>3100</a>
<a id='n3101' href='#n3101'>3101</a>
<a id='n3102' href='#n3102'>3102</a>
<a id='n3103' href='#n3103'>3103</a>
<a id='n3104' href='#n3104'>3104</a>
<a id='n3105' href='#n3105'>3105</a>
<a id='n3106' href='#n3106'>3106</a>
<a id='n3107' href='#n3107'>3107</a>
<a id='n3108' href='#n3108'>3108</a>
<a id='n3109' href='#n3109'>3109</a>
<a id='n3110' href='#n3110'>3110</a>
<a id='n3111' href='#n3111'>3111</a>
<a id='n3112' href='#n3112'>3112</a>
<a id='n3113' href='#n3113'>3113</a>
<a id='n3114' href='#n3114'>3114</a>
<a id='n3115' href='#n3115'>3115</a>
<a id='n3116' href='#n3116'>3116</a>
<a id='n3117' href='#n3117'>3117</a>
<a id='n3118' href='#n3118'>3118</a>
<a id='n3119' href='#n3119'>3119</a>
<a id='n3120' href='#n3120'>3120</a>
<a id='n3121' href='#n3121'>3121</a>
<a id='n3122' href='#n3122'>3122</a>
<a id='n3123' href='#n3123'>3123</a>
<a id='n3124' href='#n3124'>3124</a>
<a id='n3125' href='#n3125'>3125</a>
<a id='n3126' href='#n3126'>3126</a>
<a id='n3127' href='#n3127'>3127</a>
<a id='n3128' href='#n3128'>3128</a>
<a id='n3129' href='#n3129'>3129</a>
<a id='n3130' href='#n3130'>3130</a>
<a id='n3131' href='#n3131'>3131</a>
<a id='n3132' href='#n3132'>3132</a>
<a id='n3133' href='#n3133'>3133</a>
<a id='n3134' href='#n3134'>3134</a>
<a id='n3135' href='#n3135'>3135</a>
<a id='n3136' href='#n3136'>3136</a>
<a id='n3137' href='#n3137'>3137</a>
<a id='n3138' href='#n3138'>3138</a>
<a id='n3139' href='#n3139'>3139</a>
<a id='n3140' href='#n3140'>3140</a>
<a id='n3141' href='#n3141'>3141</a>
<a id='n3142' href='#n3142'>3142</a>
<a id='n3143' href='#n3143'>3143</a>
<a id='n3144' href='#n3144'>3144</a>
<a id='n3145' href='#n3145'>3145</a>
<a id='n3146' href='#n3146'>3146</a>
<a id='n3147' href='#n3147'>3147</a>
<a id='n3148' href='#n3148'>3148</a>
<a id='n3149' href='#n3149'>3149</a>
<a id='n3150' href='#n3150'>3150</a>
<a id='n3151' href='#n3151'>3151</a>
<a id='n3152' href='#n3152'>3152</a>
<a id='n3153' href='#n3153'>3153</a>
<a id='n3154' href='#n3154'>3154</a>
<a id='n3155' href='#n3155'>3155</a>
<a id='n3156' href='#n3156'>3156</a>
<a id='n3157' href='#n3157'>3157</a>
<a id='n3158' href='#n3158'>3158</a>
<a id='n3159' href='#n3159'>3159</a>
<a id='n3160' href='#n3160'>3160</a>
<a id='n3161' href='#n3161'>3161</a>
<a id='n3162' href='#n3162'>3162</a>
<a id='n3163' href='#n3163'>3163</a>
<a id='n3164' href='#n3164'>3164</a>
<a id='n3165' href='#n3165'>3165</a>
<a id='n3166' href='#n3166'>3166</a>
<a id='n3167' href='#n3167'>3167</a>
<a id='n3168' href='#n3168'>3168</a>
<a id='n3169' href='#n3169'>3169</a>
<a id='n3170' href='#n3170'>3170</a>
<a id='n3171' href='#n3171'>3171</a>
<a id='n3172' href='#n3172'>3172</a>
<a id='n3173' href='#n3173'>3173</a>
<a id='n3174' href='#n3174'>3174</a>
<a id='n3175' href='#n3175'>3175</a>
<a id='n3176' href='#n3176'>3176</a>
<a id='n3177' href='#n3177'>3177</a>
<a id='n3178' href='#n3178'>3178</a>
<a id='n3179' href='#n3179'>3179</a>
<a id='n3180' href='#n3180'>3180</a>
<a id='n3181' href='#n3181'>3181</a>
<a id='n3182' href='#n3182'>3182</a>
<a id='n3183' href='#n3183'>3183</a>
<a id='n3184' href='#n3184'>3184</a>
<a id='n3185' href='#n3185'>3185</a>
<a id='n3186' href='#n3186'>3186</a>
<a id='n3187' href='#n3187'>3187</a>
<a id='n3188' href='#n3188'>3188</a>
<a id='n3189' href='#n3189'>3189</a>
<a id='n3190' href='#n3190'>3190</a>
<a id='n3191' href='#n3191'>3191</a>
<a id='n3192' href='#n3192'>3192</a>
<a id='n3193' href='#n3193'>3193</a>
<a id='n3194' href='#n3194'>3194</a>
<a id='n3195' href='#n3195'>3195</a>
<a id='n3196' href='#n3196'>3196</a>
<a id='n3197' href='#n3197'>3197</a>
<a id='n3198' href='#n3198'>3198</a>
<a id='n3199' href='#n3199'>3199</a>
<a id='n3200' href='#n3200'>3200</a>
<a id='n3201' href='#n3201'>3201</a>
<a id='n3202' href='#n3202'>3202</a>
<a id='n3203' href='#n3203'>3203</a>
<a id='n3204' href='#n3204'>3204</a>
<a id='n3205' href='#n3205'>3205</a>
<a id='n3206' href='#n3206'>3206</a>
<a id='n3207' href='#n3207'>3207</a>
<a id='n3208' href='#n3208'>3208</a>
<a id='n3209' href='#n3209'>3209</a>
<a id='n3210' href='#n3210'>3210</a>
<a id='n3211' href='#n3211'>3211</a>
<a id='n3212' href='#n3212'>3212</a>
<a id='n3213' href='#n3213'>3213</a>
<a id='n3214' href='#n3214'>3214</a>
<a id='n3215' href='#n3215'>3215</a>
<a id='n3216' href='#n3216'>3216</a>
<a id='n3217' href='#n3217'>3217</a>
<a id='n3218' href='#n3218'>3218</a>
<a id='n3219' href='#n3219'>3219</a>
<a id='n3220' href='#n3220'>3220</a>
<a id='n3221' href='#n3221'>3221</a>
<a id='n3222' href='#n3222'>3222</a>
<a id='n3223' href='#n3223'>3223</a>
<a id='n3224' href='#n3224'>3224</a>
<a id='n3225' href='#n3225'>3225</a>
<a id='n3226' href='#n3226'>3226</a>
<a id='n3227' href='#n3227'>3227</a>
<a id='n3228' href='#n3228'>3228</a>
<a id='n3229' href='#n3229'>3229</a>
<a id='n3230' href='#n3230'>3230</a>
<a id='n3231' href='#n3231'>3231</a>
<a id='n3232' href='#n3232'>3232</a>
<a id='n3233' href='#n3233'>3233</a>
<a id='n3234' href='#n3234'>3234</a>
<a id='n3235' href='#n3235'>3235</a>
<a id='n3236' href='#n3236'>3236</a>
<a id='n3237' href='#n3237'>3237</a>
<a id='n3238' href='#n3238'>3238</a>
<a id='n3239' href='#n3239'>3239</a>
<a id='n3240' href='#n3240'>3240</a>
<a id='n3241' href='#n3241'>3241</a>
<a id='n3242' href='#n3242'>3242</a>
<a id='n3243' href='#n3243'>3243</a>
<a id='n3244' href='#n3244'>3244</a>
<a id='n3245' href='#n3245'>3245</a>
<a id='n3246' href='#n3246'>3246</a>
<a id='n3247' href='#n3247'>3247</a>
<a id='n3248' href='#n3248'>3248</a>
<a id='n3249' href='#n3249'>3249</a>
<a id='n3250' href='#n3250'>3250</a>
<a id='n3251' href='#n3251'>3251</a>
<a id='n3252' href='#n3252'>3252</a>
<a id='n3253' href='#n3253'>3253</a>
<a id='n3254' href='#n3254'>3254</a>
<a id='n3255' href='#n3255'>3255</a>
<a id='n3256' href='#n3256'>3256</a>
<a id='n3257' href='#n3257'>3257</a>
<a id='n3258' href='#n3258'>3258</a>
<a id='n3259' href='#n3259'>3259</a>
<a id='n3260' href='#n3260'>3260</a>
<a id='n3261' href='#n3261'>3261</a>
<a id='n3262' href='#n3262'>3262</a>
<a id='n3263' href='#n3263'>3263</a>
<a id='n3264' href='#n3264'>3264</a>
<a id='n3265' href='#n3265'>3265</a>
<a id='n3266' href='#n3266'>3266</a>
<a id='n3267' href='#n3267'>3267</a>
<a id='n3268' href='#n3268'>3268</a>
<a id='n3269' href='#n3269'>3269</a>
<a id='n3270' href='#n3270'>3270</a>
<a id='n3271' href='#n3271'>3271</a>
<a id='n3272' href='#n3272'>3272</a>
<a id='n3273' href='#n3273'>3273</a>
<a id='n3274' href='#n3274'>3274</a>
<a id='n3275' href='#n3275'>3275</a>
<a id='n3276' href='#n3276'>3276</a>
<a id='n3277' href='#n3277'>3277</a>
<a id='n3278' href='#n3278'>3278</a>
<a id='n3279' href='#n3279'>3279</a>
<a id='n3280' href='#n3280'>3280</a>
<a id='n3281' href='#n3281'>3281</a>
<a id='n3282' href='#n3282'>3282</a>
<a id='n3283' href='#n3283'>3283</a>
<a id='n3284' href='#n3284'>3284</a>
<a id='n3285' href='#n3285'>3285</a>
<a id='n3286' href='#n3286'>3286</a>
<a id='n3287' href='#n3287'>3287</a>
<a id='n3288' href='#n3288'>3288</a>
<a id='n3289' href='#n3289'>3289</a>
<a id='n3290' href='#n3290'>3290</a>
<a id='n3291' href='#n3291'>3291</a>
<a id='n3292' href='#n3292'>3292</a>
<a id='n3293' href='#n3293'>3293</a>
<a id='n3294' href='#n3294'>3294</a>
<a id='n3295' href='#n3295'>3295</a>
<a id='n3296' href='#n3296'>3296</a>
<a id='n3297' href='#n3297'>3297</a>
<a id='n3298' href='#n3298'>3298</a>
<a id='n3299' href='#n3299'>3299</a>
<a id='n3300' href='#n3300'>3300</a>
<a id='n3301' href='#n3301'>3301</a>
<a id='n3302' href='#n3302'>3302</a>
<a id='n3303' href='#n3303'>3303</a>
<a id='n3304' href='#n3304'>3304</a>
<a id='n3305' href='#n3305'>3305</a>
<a id='n3306' href='#n3306'>3306</a>
<a id='n3307' href='#n3307'>3307</a>
<a id='n3308' href='#n3308'>3308</a>
<a id='n3309' href='#n3309'>3309</a>
<a id='n3310' href='#n3310'>3310</a>
<a id='n3311' href='#n3311'>3311</a>
<a id='n3312' href='#n3312'>3312</a>
<a id='n3313' href='#n3313'>3313</a>
<a id='n3314' href='#n3314'>3314</a>
<a id='n3315' href='#n3315'>3315</a>
<a id='n3316' href='#n3316'>3316</a>
<a id='n3317' href='#n3317'>3317</a>
<a id='n3318' href='#n3318'>3318</a>
<a id='n3319' href='#n3319'>3319</a>
<a id='n3320' href='#n3320'>3320</a>
<a id='n3321' href='#n3321'>3321</a>
<a id='n3322' href='#n3322'>3322</a>
<a id='n3323' href='#n3323'>3323</a>
<a id='n3324' href='#n3324'>3324</a>
<a id='n3325' href='#n3325'>3325</a>
<a id='n3326' href='#n3326'>3326</a>
<a id='n3327' href='#n3327'>3327</a>
<a id='n3328' href='#n3328'>3328</a>
<a id='n3329' href='#n3329'>3329</a>
<a id='n3330' href='#n3330'>3330</a>
<a id='n3331' href='#n3331'>3331</a>
<a id='n3332' href='#n3332'>3332</a>
<a id='n3333' href='#n3333'>3333</a>
<a id='n3334' href='#n3334'>3334</a>
<a id='n3335' href='#n3335'>3335</a>
<a id='n3336' href='#n3336'>3336</a>
<a id='n3337' href='#n3337'>3337</a>
<a id='n3338' href='#n3338'>3338</a>
<a id='n3339' href='#n3339'>3339</a>
<a id='n3340' href='#n3340'>3340</a>
<a id='n3341' href='#n3341'>3341</a>
<a id='n3342' href='#n3342'>3342</a>
<a id='n3343' href='#n3343'>3343</a>
<a id='n3344' href='#n3344'>3344</a>
<a id='n3345' href='#n3345'>3345</a>
<a id='n3346' href='#n3346'>3346</a>
<a id='n3347' href='#n3347'>3347</a>
<a id='n3348' href='#n3348'>3348</a>
<a id='n3349' href='#n3349'>3349</a>
<a id='n3350' href='#n3350'>3350</a>
<a id='n3351' href='#n3351'>3351</a>
<a id='n3352' href='#n3352'>3352</a>
<a id='n3353' href='#n3353'>3353</a>
<a id='n3354' href='#n3354'>3354</a>
<a id='n3355' href='#n3355'>3355</a>
<a id='n3356' href='#n3356'>3356</a>
<a id='n3357' href='#n3357'>3357</a>
<a id='n3358' href='#n3358'>3358</a>
<a id='n3359' href='#n3359'>3359</a>
<a id='n3360' href='#n3360'>3360</a>
<a id='n3361' href='#n3361'>3361</a>
<a id='n3362' href='#n3362'>3362</a>
<a id='n3363' href='#n3363'>3363</a>
<a id='n3364' href='#n3364'>3364</a>
<a id='n3365' href='#n3365'>3365</a>
<a id='n3366' href='#n3366'>3366</a>
<a id='n3367' href='#n3367'>3367</a>
<a id='n3368' href='#n3368'>3368</a>
<a id='n3369' href='#n3369'>3369</a>
<a id='n3370' href='#n3370'>3370</a>
<a id='n3371' href='#n3371'>3371</a>
<a id='n3372' href='#n3372'>3372</a>
<a id='n3373' href='#n3373'>3373</a>
<a id='n3374' href='#n3374'>3374</a>
<a id='n3375' href='#n3375'>3375</a>
<a id='n3376' href='#n3376'>3376</a>
<a id='n3377' href='#n3377'>3377</a>
<a id='n3378' href='#n3378'>3378</a>
<a id='n3379' href='#n3379'>3379</a>
<a id='n3380' href='#n3380'>3380</a>
<a id='n3381' href='#n3381'>3381</a>
<a id='n3382' href='#n3382'>3382</a>
<a id='n3383' href='#n3383'>3383</a>
<a id='n3384' href='#n3384'>3384</a>
<a id='n3385' href='#n3385'>3385</a>
<a id='n3386' href='#n3386'>3386</a>
<a id='n3387' href='#n3387'>3387</a>
<a id='n3388' href='#n3388'>3388</a>
<a id='n3389' href='#n3389'>3389</a>
<a id='n3390' href='#n3390'>3390</a>
<a id='n3391' href='#n3391'>3391</a>
<a id='n3392' href='#n3392'>3392</a>
<a id='n3393' href='#n3393'>3393</a>
<a id='n3394' href='#n3394'>3394</a>
<a id='n3395' href='#n3395'>3395</a>
<a id='n3396' href='#n3396'>3396</a>
<a id='n3397' href='#n3397'>3397</a>
<a id='n3398' href='#n3398'>3398</a>
<a id='n3399' href='#n3399'>3399</a>
<a id='n3400' href='#n3400'>3400</a>
<a id='n3401' href='#n3401'>3401</a>
<a id='n3402' href='#n3402'>3402</a>
<a id='n3403' href='#n3403'>3403</a>
<a id='n3404' href='#n3404'>3404</a>
<a id='n3405' href='#n3405'>3405</a>
<a id='n3406' href='#n3406'>3406</a>
<a id='n3407' href='#n3407'>3407</a>
<a id='n3408' href='#n3408'>3408</a>
<a id='n3409' href='#n3409'>3409</a>
<a id='n3410' href='#n3410'>3410</a>
<a id='n3411' href='#n3411'>3411</a>
<a id='n3412' href='#n3412'>3412</a>
<a id='n3413' href='#n3413'>3413</a>
<a id='n3414' href='#n3414'>3414</a>
<a id='n3415' href='#n3415'>3415</a>
<a id='n3416' href='#n3416'>3416</a>
<a id='n3417' href='#n3417'>3417</a>
<a id='n3418' href='#n3418'>3418</a>
<a id='n3419' href='#n3419'>3419</a>
<a id='n3420' href='#n3420'>3420</a>
<a id='n3421' href='#n3421'>3421</a>
<a id='n3422' href='#n3422'>3422</a>
<a id='n3423' href='#n3423'>3423</a>
<a id='n3424' href='#n3424'>3424</a>
<a id='n3425' href='#n3425'>3425</a>
<a id='n3426' href='#n3426'>3426</a>
<a id='n3427' href='#n3427'>3427</a>
<a id='n3428' href='#n3428'>3428</a>
<a id='n3429' href='#n3429'>3429</a>
<a id='n3430' href='#n3430'>3430</a>
<a id='n3431' href='#n3431'>3431</a>
<a id='n3432' href='#n3432'>3432</a>
<a id='n3433' href='#n3433'>3433</a>
<a id='n3434' href='#n3434'>3434</a>
<a id='n3435' href='#n3435'>3435</a>
<a id='n3436' href='#n3436'>3436</a>
<a id='n3437' href='#n3437'>3437</a>
<a id='n3438' href='#n3438'>3438</a>
<a id='n3439' href='#n3439'>3439</a>
<a id='n3440' href='#n3440'>3440</a>
<a id='n3441' href='#n3441'>3441</a>
<a id='n3442' href='#n3442'>3442</a>
<a id='n3443' href='#n3443'>3443</a>
<a id='n3444' href='#n3444'>3444</a>
<a id='n3445' href='#n3445'>3445</a>
<a id='n3446' href='#n3446'>3446</a>
<a id='n3447' href='#n3447'>3447</a>
<a id='n3448' href='#n3448'>3448</a>
<a id='n3449' href='#n3449'>3449</a>
<a id='n3450' href='#n3450'>3450</a>
<a id='n3451' href='#n3451'>3451</a>
<a id='n3452' href='#n3452'>3452</a>
<a id='n3453' href='#n3453'>3453</a>
<a id='n3454' href='#n3454'>3454</a>
<a id='n3455' href='#n3455'>3455</a>
<a id='n3456' href='#n3456'>3456</a>
<a id='n3457' href='#n3457'>3457</a>
<a id='n3458' href='#n3458'>3458</a>
<a id='n3459' href='#n3459'>3459</a>
<a id='n3460' href='#n3460'>3460</a>
<a id='n3461' href='#n3461'>3461</a>
<a id='n3462' href='#n3462'>3462</a>
<a id='n3463' href='#n3463'>3463</a>
<a id='n3464' href='#n3464'>3464</a>
<a id='n3465' href='#n3465'>3465</a>
<a id='n3466' href='#n3466'>3466</a>
<a id='n3467' href='#n3467'>3467</a>
<a id='n3468' href='#n3468'>3468</a>
<a id='n3469' href='#n3469'>3469</a>
<a id='n3470' href='#n3470'>3470</a>
<a id='n3471' href='#n3471'>3471</a>
<a id='n3472' href='#n3472'>3472</a>
<a id='n3473' href='#n3473'>3473</a>
<a id='n3474' href='#n3474'>3474</a>
<a id='n3475' href='#n3475'>3475</a>
<a id='n3476' href='#n3476'>3476</a>
<a id='n3477' href='#n3477'>3477</a>
<a id='n3478' href='#n3478'>3478</a>
<a id='n3479' href='#n3479'>3479</a>
<a id='n3480' href='#n3480'>3480</a>
<a id='n3481' href='#n3481'>3481</a>
<a id='n3482' href='#n3482'>3482</a>
<a id='n3483' href='#n3483'>3483</a>
<a id='n3484' href='#n3484'>3484</a>
<a id='n3485' href='#n3485'>3485</a>
<a id='n3486' href='#n3486'>3486</a>
<a id='n3487' href='#n3487'>3487</a>
<a id='n3488' href='#n3488'>3488</a>
<a id='n3489' href='#n3489'>3489</a>
<a id='n3490' href='#n3490'>3490</a>
<a id='n3491' href='#n3491'>3491</a>
<a id='n3492' href='#n3492'>3492</a>
<a id='n3493' href='#n3493'>3493</a>
<a id='n3494' href='#n3494'>3494</a>
<a id='n3495' href='#n3495'>3495</a>
<a id='n3496' href='#n3496'>3496</a>
<a id='n3497' href='#n3497'>3497</a>
<a id='n3498' href='#n3498'>3498</a>
<a id='n3499' href='#n3499'>3499</a>
<a id='n3500' href='#n3500'>3500</a>
<a id='n3501' href='#n3501'>3501</a>
<a id='n3502' href='#n3502'>3502</a>
<a id='n3503' href='#n3503'>3503</a>
<a id='n3504' href='#n3504'>3504</a>
<a id='n3505' href='#n3505'>3505</a>
<a id='n3506' href='#n3506'>3506</a>
<a id='n3507' href='#n3507'>3507</a>
<a id='n3508' href='#n3508'>3508</a>
<a id='n3509' href='#n3509'>3509</a>
<a id='n3510' href='#n3510'>3510</a>
<a id='n3511' href='#n3511'>3511</a>
<a id='n3512' href='#n3512'>3512</a>
<a id='n3513' href='#n3513'>3513</a>
<a id='n3514' href='#n3514'>3514</a>
<a id='n3515' href='#n3515'>3515</a>
<a id='n3516' href='#n3516'>3516</a>
<a id='n3517' href='#n3517'>3517</a>
<a id='n3518' href='#n3518'>3518</a>
<a id='n3519' href='#n3519'>3519</a>
<a id='n3520' href='#n3520'>3520</a>
<a id='n3521' href='#n3521'>3521</a>
<a id='n3522' href='#n3522'>3522</a>
<a id='n3523' href='#n3523'>3523</a>
<a id='n3524' href='#n3524'>3524</a>
<a id='n3525' href='#n3525'>3525</a>
<a id='n3526' href='#n3526'>3526</a>
<a id='n3527' href='#n3527'>3527</a>
<a id='n3528' href='#n3528'>3528</a>
<a id='n3529' href='#n3529'>3529</a>
<a id='n3530' href='#n3530'>3530</a>
<a id='n3531' href='#n3531'>3531</a>
<a id='n3532' href='#n3532'>3532</a>
<a id='n3533' href='#n3533'>3533</a>
<a id='n3534' href='#n3534'>3534</a>
<a id='n3535' href='#n3535'>3535</a>
<a id='n3536' href='#n3536'>3536</a>
<a id='n3537' href='#n3537'>3537</a>
<a id='n3538' href='#n3538'>3538</a>
<a id='n3539' href='#n3539'>3539</a>
<a id='n3540' href='#n3540'>3540</a>
<a id='n3541' href='#n3541'>3541</a>
<a id='n3542' href='#n3542'>3542</a>
<a id='n3543' href='#n3543'>3543</a>
<a id='n3544' href='#n3544'>3544</a>
<a id='n3545' href='#n3545'>3545</a>
<a id='n3546' href='#n3546'>3546</a>
<a id='n3547' href='#n3547'>3547</a>
<a id='n3548' href='#n3548'>3548</a>
<a id='n3549' href='#n3549'>3549</a>
<a id='n3550' href='#n3550'>3550</a>
<a id='n3551' href='#n3551'>3551</a>
<a id='n3552' href='#n3552'>3552</a>
<a id='n3553' href='#n3553'>3553</a>
<a id='n3554' href='#n3554'>3554</a>
<a id='n3555' href='#n3555'>3555</a>
<a id='n3556' href='#n3556'>3556</a>
<a id='n3557' href='#n3557'>3557</a>
<a id='n3558' href='#n3558'>3558</a>
<a id='n3559' href='#n3559'>3559</a>
<a id='n3560' href='#n3560'>3560</a>
<a id='n3561' href='#n3561'>3561</a>
<a id='n3562' href='#n3562'>3562</a>
<a id='n3563' href='#n3563'>3563</a>
<a id='n3564' href='#n3564'>3564</a>
<a id='n3565' href='#n3565'>3565</a>
<a id='n3566' href='#n3566'>3566</a>
<a id='n3567' href='#n3567'>3567</a>
<a id='n3568' href='#n3568'>3568</a>
<a id='n3569' href='#n3569'>3569</a>
<a id='n3570' href='#n3570'>3570</a>
<a id='n3571' href='#n3571'>3571</a>
<a id='n3572' href='#n3572'>3572</a>
<a id='n3573' href='#n3573'>3573</a>
<a id='n3574' href='#n3574'>3574</a>
<a id='n3575' href='#n3575'>3575</a>
<a id='n3576' href='#n3576'>3576</a>
<a id='n3577' href='#n3577'>3577</a>
<a id='n3578' href='#n3578'>3578</a>
<a id='n3579' href='#n3579'>3579</a>
<a id='n3580' href='#n3580'>3580</a>
<a id='n3581' href='#n3581'>3581</a>
<a id='n3582' href='#n3582'>3582</a>
<a id='n3583' href='#n3583'>3583</a>
<a id='n3584' href='#n3584'>3584</a>
<a id='n3585' href='#n3585'>3585</a>
<a id='n3586' href='#n3586'>3586</a>
<a id='n3587' href='#n3587'>3587</a>
<a id='n3588' href='#n3588'>3588</a>
<a id='n3589' href='#n3589'>3589</a>
<a id='n3590' href='#n3590'>3590</a>
<a id='n3591' href='#n3591'>3591</a>
<a id='n3592' href='#n3592'>3592</a>
<a id='n3593' href='#n3593'>3593</a>
<a id='n3594' href='#n3594'>3594</a>
<a id='n3595' href='#n3595'>3595</a>
<a id='n3596' href='#n3596'>3596</a>
<a id='n3597' href='#n3597'>3597</a>
<a id='n3598' href='#n3598'>3598</a>
<a id='n3599' href='#n3599'>3599</a>
<a id='n3600' href='#n3600'>3600</a>
<a id='n3601' href='#n3601'>3601</a>
<a id='n3602' href='#n3602'>3602</a>
<a id='n3603' href='#n3603'>3603</a>
<a id='n3604' href='#n3604'>3604</a>
<a id='n3605' href='#n3605'>3605</a>
<a id='n3606' href='#n3606'>3606</a>
<a id='n3607' href='#n3607'>3607</a>
<a id='n3608' href='#n3608'>3608</a>
<a id='n3609' href='#n3609'>3609</a>
<a id='n3610' href='#n3610'>3610</a>
<a id='n3611' href='#n3611'>3611</a>
<a id='n3612' href='#n3612'>3612</a>
<a id='n3613' href='#n3613'>3613</a>
<a id='n3614' href='#n3614'>3614</a>
<a id='n3615' href='#n3615'>3615</a>
<a id='n3616' href='#n3616'>3616</a>
<a id='n3617' href='#n3617'>3617</a>
<a id='n3618' href='#n3618'>3618</a>
<a id='n3619' href='#n3619'>3619</a>
<a id='n3620' href='#n3620'>3620</a>
<a id='n3621' href='#n3621'>3621</a>
<a id='n3622' href='#n3622'>3622</a>
<a id='n3623' href='#n3623'>3623</a>
<a id='n3624' href='#n3624'>3624</a>
<a id='n3625' href='#n3625'>3625</a>
<a id='n3626' href='#n3626'>3626</a>
<a id='n3627' href='#n3627'>3627</a>
<a id='n3628' href='#n3628'>3628</a>
<a id='n3629' href='#n3629'>3629</a>
<a id='n3630' href='#n3630'>3630</a>
<a id='n3631' href='#n3631'>3631</a>
<a id='n3632' href='#n3632'>3632</a>
<a id='n3633' href='#n3633'>3633</a>
<a id='n3634' href='#n3634'>3634</a>
<a id='n3635' href='#n3635'>3635</a>
<a id='n3636' href='#n3636'>3636</a>
<a id='n3637' href='#n3637'>3637</a>
<a id='n3638' href='#n3638'>3638</a>
<a id='n3639' href='#n3639'>3639</a>
<a id='n3640' href='#n3640'>3640</a>
<a id='n3641' href='#n3641'>3641</a>
<a id='n3642' href='#n3642'>3642</a>
<a id='n3643' href='#n3643'>3643</a>
<a id='n3644' href='#n3644'>3644</a>
<a id='n3645' href='#n3645'>3645</a>
<a id='n3646' href='#n3646'>3646</a>
<a id='n3647' href='#n3647'>3647</a>
<a id='n3648' href='#n3648'>3648</a>
<a id='n3649' href='#n3649'>3649</a>
<a id='n3650' href='#n3650'>3650</a>
<a id='n3651' href='#n3651'>3651</a>
<a id='n3652' href='#n3652'>3652</a>
<a id='n3653' href='#n3653'>3653</a>
<a id='n3654' href='#n3654'>3654</a>
<a id='n3655' href='#n3655'>3655</a>
<a id='n3656' href='#n3656'>3656</a>
<a id='n3657' href='#n3657'>3657</a>
<a id='n3658' href='#n3658'>3658</a>
<a id='n3659' href='#n3659'>3659</a>
<a id='n3660' href='#n3660'>3660</a>
<a id='n3661' href='#n3661'>3661</a>
<a id='n3662' href='#n3662'>3662</a>
<a id='n3663' href='#n3663'>3663</a>
<a id='n3664' href='#n3664'>3664</a>
<a id='n3665' href='#n3665'>3665</a>
<a id='n3666' href='#n3666'>3666</a>
<a id='n3667' href='#n3667'>3667</a>
<a id='n3668' href='#n3668'>3668</a>
<a id='n3669' href='#n3669'>3669</a>
<a id='n3670' href='#n3670'>3670</a>
<a id='n3671' href='#n3671'>3671</a>
<a id='n3672' href='#n3672'>3672</a>
<a id='n3673' href='#n3673'>3673</a>
<a id='n3674' href='#n3674'>3674</a>
<a id='n3675' href='#n3675'>3675</a>
<a id='n3676' href='#n3676'>3676</a>
<a id='n3677' href='#n3677'>3677</a>
<a id='n3678' href='#n3678'>3678</a>
<a id='n3679' href='#n3679'>3679</a>
<a id='n3680' href='#n3680'>3680</a>
<a id='n3681' href='#n3681'>3681</a>
<a id='n3682' href='#n3682'>3682</a>
<a id='n3683' href='#n3683'>3683</a>
<a id='n3684' href='#n3684'>3684</a>
<a id='n3685' href='#n3685'>3685</a>
<a id='n3686' href='#n3686'>3686</a>
<a id='n3687' href='#n3687'>3687</a>
<a id='n3688' href='#n3688'>3688</a>
<a id='n3689' href='#n3689'>3689</a>
<a id='n3690' href='#n3690'>3690</a>
<a id='n3691' href='#n3691'>3691</a>
<a id='n3692' href='#n3692'>3692</a>
<a id='n3693' href='#n3693'>3693</a>
<a id='n3694' href='#n3694'>3694</a>
<a id='n3695' href='#n3695'>3695</a>
<a id='n3696' href='#n3696'>3696</a>
<a id='n3697' href='#n3697'>3697</a>
<a id='n3698' href='#n3698'>3698</a>
<a id='n3699' href='#n3699'>3699</a>
<a id='n3700' href='#n3700'>3700</a>
<a id='n3701' href='#n3701'>3701</a>
<a id='n3702' href='#n3702'>3702</a>
<a id='n3703' href='#n3703'>3703</a>
<a id='n3704' href='#n3704'>3704</a>
<a id='n3705' href='#n3705'>3705</a>
<a id='n3706' href='#n3706'>3706</a>
<a id='n3707' href='#n3707'>3707</a>
<a id='n3708' href='#n3708'>3708</a>
<a id='n3709' href='#n3709'>3709</a>
<a id='n3710' href='#n3710'>3710</a>
<a id='n3711' href='#n3711'>3711</a>
<a id='n3712' href='#n3712'>3712</a>
<a id='n3713' href='#n3713'>3713</a>
<a id='n3714' href='#n3714'>3714</a>
<a id='n3715' href='#n3715'>3715</a>
<a id='n3716' href='#n3716'>3716</a>
<a id='n3717' href='#n3717'>3717</a>
<a id='n3718' href='#n3718'>3718</a>
<a id='n3719' href='#n3719'>3719</a>
<a id='n3720' href='#n3720'>3720</a>
<a id='n3721' href='#n3721'>3721</a>
<a id='n3722' href='#n3722'>3722</a>
<a id='n3723' href='#n3723'>3723</a>
<a id='n3724' href='#n3724'>3724</a>
<a id='n3725' href='#n3725'>3725</a>
<a id='n3726' href='#n3726'>3726</a>
<a id='n3727' href='#n3727'>3727</a>
<a id='n3728' href='#n3728'>3728</a>
<a id='n3729' href='#n3729'>3729</a>
<a id='n3730' href='#n3730'>3730</a>
<a id='n3731' href='#n3731'>3731</a>
<a id='n3732' href='#n3732'>3732</a>
<a id='n3733' href='#n3733'>3733</a>
<a id='n3734' href='#n3734'>3734</a>
<a id='n3735' href='#n3735'>3735</a>
<a id='n3736' href='#n3736'>3736</a>
<a id='n3737' href='#n3737'>3737</a>
<a id='n3738' href='#n3738'>3738</a>
<a id='n3739' href='#n3739'>3739</a>
<a id='n3740' href='#n3740'>3740</a>
<a id='n3741' href='#n3741'>3741</a>
<a id='n3742' href='#n3742'>3742</a>
<a id='n3743' href='#n3743'>3743</a>
<a id='n3744' href='#n3744'>3744</a>
<a id='n3745' href='#n3745'>3745</a>
<a id='n3746' href='#n3746'>3746</a>
<a id='n3747' href='#n3747'>3747</a>
<a id='n3748' href='#n3748'>3748</a>
<a id='n3749' href='#n3749'>3749</a>
<a id='n3750' href='#n3750'>3750</a>
<a id='n3751' href='#n3751'>3751</a>
<a id='n3752' href='#n3752'>3752</a>
<a id='n3753' href='#n3753'>3753</a>
<a id='n3754' href='#n3754'>3754</a>
<a id='n3755' href='#n3755'>3755</a>
<a id='n3756' href='#n3756'>3756</a>
<a id='n3757' href='#n3757'>3757</a>
<a id='n3758' href='#n3758'>3758</a>
<a id='n3759' href='#n3759'>3759</a>
<a id='n3760' href='#n3760'>3760</a>
<a id='n3761' href='#n3761'>3761</a>
<a id='n3762' href='#n3762'>3762</a>
<a id='n3763' href='#n3763'>3763</a>
<a id='n3764' href='#n3764'>3764</a>
<a id='n3765' href='#n3765'>3765</a>
<a id='n3766' href='#n3766'>3766</a>
<a id='n3767' href='#n3767'>3767</a>
<a id='n3768' href='#n3768'>3768</a>
<a id='n3769' href='#n3769'>3769</a>
<a id='n3770' href='#n3770'>3770</a>
<a id='n3771' href='#n3771'>3771</a>
<a id='n3772' href='#n3772'>3772</a>
<a id='n3773' href='#n3773'>3773</a>
<a id='n3774' href='#n3774'>3774</a>
<a id='n3775' href='#n3775'>3775</a>
<a id='n3776' href='#n3776'>3776</a>
<a id='n3777' href='#n3777'>3777</a>
<a id='n3778' href='#n3778'>3778</a>
<a id='n3779' href='#n3779'>3779</a>
<a id='n3780' href='#n3780'>3780</a>
<a id='n3781' href='#n3781'>3781</a>
<a id='n3782' href='#n3782'>3782</a>
<a id='n3783' href='#n3783'>3783</a>
<a id='n3784' href='#n3784'>3784</a>
<a id='n3785' href='#n3785'>3785</a>
<a id='n3786' href='#n3786'>3786</a>
<a id='n3787' href='#n3787'>3787</a>
<a id='n3788' href='#n3788'>3788</a>
<a id='n3789' href='#n3789'>3789</a>
<a id='n3790' href='#n3790'>3790</a>
<a id='n3791' href='#n3791'>3791</a>
<a id='n3792' href='#n3792'>3792</a>
<a id='n3793' href='#n3793'>3793</a>
<a id='n3794' href='#n3794'>3794</a>
<a id='n3795' href='#n3795'>3795</a>
<a id='n3796' href='#n3796'>3796</a>
<a id='n3797' href='#n3797'>3797</a>
<a id='n3798' href='#n3798'>3798</a>
<a id='n3799' href='#n3799'>3799</a>
<a id='n3800' href='#n3800'>3800</a>
<a id='n3801' href='#n3801'>3801</a>
<a id='n3802' href='#n3802'>3802</a>
<a id='n3803' href='#n3803'>3803</a>
<a id='n3804' href='#n3804'>3804</a>
<a id='n3805' href='#n3805'>3805</a>
<a id='n3806' href='#n3806'>3806</a>
<a id='n3807' href='#n3807'>3807</a>
<a id='n3808' href='#n3808'>3808</a>
<a id='n3809' href='#n3809'>3809</a>
<a id='n3810' href='#n3810'>3810</a>
<a id='n3811' href='#n3811'>3811</a>
<a id='n3812' href='#n3812'>3812</a>
<a id='n3813' href='#n3813'>3813</a>
<a id='n3814' href='#n3814'>3814</a>
<a id='n3815' href='#n3815'>3815</a>
<a id='n3816' href='#n3816'>3816</a>
<a id='n3817' href='#n3817'>3817</a>
<a id='n3818' href='#n3818'>3818</a>
<a id='n3819' href='#n3819'>3819</a>
<a id='n3820' href='#n3820'>3820</a>
<a id='n3821' href='#n3821'>3821</a>
<a id='n3822' href='#n3822'>3822</a>
<a id='n3823' href='#n3823'>3823</a>
<a id='n3824' href='#n3824'>3824</a>
<a id='n3825' href='#n3825'>3825</a>
<a id='n3826' href='#n3826'>3826</a>
<a id='n3827' href='#n3827'>3827</a>
<a id='n3828' href='#n3828'>3828</a>
<a id='n3829' href='#n3829'>3829</a>
<a id='n3830' href='#n3830'>3830</a>
<a id='n3831' href='#n3831'>3831</a>
<a id='n3832' href='#n3832'>3832</a>
<a id='n3833' href='#n3833'>3833</a>
<a id='n3834' href='#n3834'>3834</a>
<a id='n3835' href='#n3835'>3835</a>
<a id='n3836' href='#n3836'>3836</a>
<a id='n3837' href='#n3837'>3837</a>
<a id='n3838' href='#n3838'>3838</a>
<a id='n3839' href='#n3839'>3839</a>
<a id='n3840' href='#n3840'>3840</a>
<a id='n3841' href='#n3841'>3841</a>
<a id='n3842' href='#n3842'>3842</a>
<a id='n3843' href='#n3843'>3843</a>
<a id='n3844' href='#n3844'>3844</a>
<a id='n3845' href='#n3845'>3845</a>
<a id='n3846' href='#n3846'>3846</a>
<a id='n3847' href='#n3847'>3847</a>
<a id='n3848' href='#n3848'>3848</a>
<a id='n3849' href='#n3849'>3849</a>
<a id='n3850' href='#n3850'>3850</a>
<a id='n3851' href='#n3851'>3851</a>
<a id='n3852' href='#n3852'>3852</a>
<a id='n3853' href='#n3853'>3853</a>
<a id='n3854' href='#n3854'>3854</a>
<a id='n3855' href='#n3855'>3855</a>
<a id='n3856' href='#n3856'>3856</a>
<a id='n3857' href='#n3857'>3857</a>
<a id='n3858' href='#n3858'>3858</a>
<a id='n3859' href='#n3859'>3859</a>
<a id='n3860' href='#n3860'>3860</a>
<a id='n3861' href='#n3861'>3861</a>
<a id='n3862' href='#n3862'>3862</a>
<a id='n3863' href='#n3863'>3863</a>
<a id='n3864' href='#n3864'>3864</a>
<a id='n3865' href='#n3865'>3865</a>
<a id='n3866' href='#n3866'>3866</a>
<a id='n3867' href='#n3867'>3867</a>
<a id='n3868' href='#n3868'>3868</a>
<a id='n3869' href='#n3869'>3869</a>
<a id='n3870' href='#n3870'>3870</a>
<a id='n3871' href='#n3871'>3871</a>
<a id='n3872' href='#n3872'>3872</a>
<a id='n3873' href='#n3873'>3873</a>
<a id='n3874' href='#n3874'>3874</a>
<a id='n3875' href='#n3875'>3875</a>
<a id='n3876' href='#n3876'>3876</a>
<a id='n3877' href='#n3877'>3877</a>
<a id='n3878' href='#n3878'>3878</a>
<a id='n3879' href='#n3879'>3879</a>
<a id='n3880' href='#n3880'>3880</a>
<a id='n3881' href='#n3881'>3881</a>
<a id='n3882' href='#n3882'>3882</a>
<a id='n3883' href='#n3883'>3883</a>
<a id='n3884' href='#n3884'>3884</a>
<a id='n3885' href='#n3885'>3885</a>
<a id='n3886' href='#n3886'>3886</a>
<a id='n3887' href='#n3887'>3887</a>
<a id='n3888' href='#n3888'>3888</a>
<a id='n3889' href='#n3889'>3889</a>
<a id='n3890' href='#n3890'>3890</a>
<a id='n3891' href='#n3891'>3891</a>
<a id='n3892' href='#n3892'>3892</a>
<a id='n3893' href='#n3893'>3893</a>
<a id='n3894' href='#n3894'>3894</a>
<a id='n3895' href='#n3895'>3895</a>
<a id='n3896' href='#n3896'>3896</a>
<a id='n3897' href='#n3897'>3897</a>
<a id='n3898' href='#n3898'>3898</a>
<a id='n3899' href='#n3899'>3899</a>
<a id='n3900' href='#n3900'>3900</a>
<a id='n3901' href='#n3901'>3901</a>
<a id='n3902' href='#n3902'>3902</a>
<a id='n3903' href='#n3903'>3903</a>
<a id='n3904' href='#n3904'>3904</a>
<a id='n3905' href='#n3905'>3905</a>
<a id='n3906' href='#n3906'>3906</a>
<a id='n3907' href='#n3907'>3907</a>
<a id='n3908' href='#n3908'>3908</a>
<a id='n3909' href='#n3909'>3909</a>
<a id='n3910' href='#n3910'>3910</a>
<a id='n3911' href='#n3911'>3911</a>
<a id='n3912' href='#n3912'>3912</a>
<a id='n3913' href='#n3913'>3913</a>
<a id='n3914' href='#n3914'>3914</a>
<a id='n3915' href='#n3915'>3915</a>
<a id='n3916' href='#n3916'>3916</a>
<a id='n3917' href='#n3917'>3917</a>
<a id='n3918' href='#n3918'>3918</a>
<a id='n3919' href='#n3919'>3919</a>
<a id='n3920' href='#n3920'>3920</a>
<a id='n3921' href='#n3921'>3921</a>
<a id='n3922' href='#n3922'>3922</a>
<a id='n3923' href='#n3923'>3923</a>
<a id='n3924' href='#n3924'>3924</a>
<a id='n3925' href='#n3925'>3925</a>
<a id='n3926' href='#n3926'>3926</a>
<a id='n3927' href='#n3927'>3927</a>
<a id='n3928' href='#n3928'>3928</a>
<a id='n3929' href='#n3929'>3929</a>
<a id='n3930' href='#n3930'>3930</a>
<a id='n3931' href='#n3931'>3931</a>
<a id='n3932' href='#n3932'>3932</a>
<a id='n3933' href='#n3933'>3933</a>
<a id='n3934' href='#n3934'>3934</a>
<a id='n3935' href='#n3935'>3935</a>
<a id='n3936' href='#n3936'>3936</a>
<a id='n3937' href='#n3937'>3937</a>
<a id='n3938' href='#n3938'>3938</a>
<a id='n3939' href='#n3939'>3939</a>
<a id='n3940' href='#n3940'>3940</a>
<a id='n3941' href='#n3941'>3941</a>
<a id='n3942' href='#n3942'>3942</a>
<a id='n3943' href='#n3943'>3943</a>
<a id='n3944' href='#n3944'>3944</a>
<a id='n3945' href='#n3945'>3945</a>
<a id='n3946' href='#n3946'>3946</a>
<a id='n3947' href='#n3947'>3947</a>
<a id='n3948' href='#n3948'>3948</a>
<a id='n3949' href='#n3949'>3949</a>
<a id='n3950' href='#n3950'>3950</a>
<a id='n3951' href='#n3951'>3951</a>
<a id='n3952' href='#n3952'>3952</a>
<a id='n3953' href='#n3953'>3953</a>
<a id='n3954' href='#n3954'>3954</a>
<a id='n3955' href='#n3955'>3955</a>
<a id='n3956' href='#n3956'>3956</a>
<a id='n3957' href='#n3957'>3957</a>
<a id='n3958' href='#n3958'>3958</a>
<a id='n3959' href='#n3959'>3959</a>
<a id='n3960' href='#n3960'>3960</a>
<a id='n3961' href='#n3961'>3961</a>
<a id='n3962' href='#n3962'>3962</a>
<a id='n3963' href='#n3963'>3963</a>
<a id='n3964' href='#n3964'>3964</a>
<a id='n3965' href='#n3965'>3965</a>
<a id='n3966' href='#n3966'>3966</a>
<a id='n3967' href='#n3967'>3967</a>
<a id='n3968' href='#n3968'>3968</a>
<a id='n3969' href='#n3969'>3969</a>
<a id='n3970' href='#n3970'>3970</a>
<a id='n3971' href='#n3971'>3971</a>
<a id='n3972' href='#n3972'>3972</a>
<a id='n3973' href='#n3973'>3973</a>
<a id='n3974' href='#n3974'>3974</a>
<a id='n3975' href='#n3975'>3975</a>
<a id='n3976' href='#n3976'>3976</a>
<a id='n3977' href='#n3977'>3977</a>
<a id='n3978' href='#n3978'>3978</a>
<a id='n3979' href='#n3979'>3979</a>
<a id='n3980' href='#n3980'>3980</a>
<a id='n3981' href='#n3981'>3981</a>
<a id='n3982' href='#n3982'>3982</a>
<a id='n3983' href='#n3983'>3983</a>
<a id='n3984' href='#n3984'>3984</a>
<a id='n3985' href='#n3985'>3985</a>
<a id='n3986' href='#n3986'>3986</a>
<a id='n3987' href='#n3987'>3987</a>
<a id='n3988' href='#n3988'>3988</a>
<a id='n3989' href='#n3989'>3989</a>
<a id='n3990' href='#n3990'>3990</a>
<a id='n3991' href='#n3991'>3991</a>
<a id='n3992' href='#n3992'>3992</a>
<a id='n3993' href='#n3993'>3993</a>
<a id='n3994' href='#n3994'>3994</a>
<a id='n3995' href='#n3995'>3995</a>
<a id='n3996' href='#n3996'>3996</a>
<a id='n3997' href='#n3997'>3997</a>
<a id='n3998' href='#n3998'>3998</a>
<a id='n3999' href='#n3999'>3999</a>
<a id='n4000' href='#n4000'>4000</a>
<a id='n4001' href='#n4001'>4001</a>
<a id='n4002' href='#n4002'>4002</a>
<a id='n4003' href='#n4003'>4003</a>
<a id='n4004' href='#n4004'>4004</a>
<a id='n4005' href='#n4005'>4005</a>
<a id='n4006' href='#n4006'>4006</a>
<a id='n4007' href='#n4007'>4007</a>
<a id='n4008' href='#n4008'>4008</a>
<a id='n4009' href='#n4009'>4009</a>
<a id='n4010' href='#n4010'>4010</a>
<a id='n4011' href='#n4011'>4011</a>
<a id='n4012' href='#n4012'>4012</a>
<a id='n4013' href='#n4013'>4013</a>
<a id='n4014' href='#n4014'>4014</a>
<a id='n4015' href='#n4015'>4015</a>
<a id='n4016' href='#n4016'>4016</a>
<a id='n4017' href='#n4017'>4017</a>
<a id='n4018' href='#n4018'>4018</a>
<a id='n4019' href='#n4019'>4019</a>
<a id='n4020' href='#n4020'>4020</a>
<a id='n4021' href='#n4021'>4021</a>
<a id='n4022' href='#n4022'>4022</a>
<a id='n4023' href='#n4023'>4023</a>
<a id='n4024' href='#n4024'>4024</a>
<a id='n4025' href='#n4025'>4025</a>
<a id='n4026' href='#n4026'>4026</a>
<a id='n4027' href='#n4027'>4027</a>
<a id='n4028' href='#n4028'>4028</a>
<a id='n4029' href='#n4029'>4029</a>
<a id='n4030' href='#n4030'>4030</a>
<a id='n4031' href='#n4031'>4031</a>
<a id='n4032' href='#n4032'>4032</a>
<a id='n4033' href='#n4033'>4033</a>
<a id='n4034' href='#n4034'>4034</a>
<a id='n4035' href='#n4035'>4035</a>
<a id='n4036' href='#n4036'>4036</a>
<a id='n4037' href='#n4037'>4037</a>
<a id='n4038' href='#n4038'>4038</a>
<a id='n4039' href='#n4039'>4039</a>
<a id='n4040' href='#n4040'>4040</a>
<a id='n4041' href='#n4041'>4041</a>
<a id='n4042' href='#n4042'>4042</a>
<a id='n4043' href='#n4043'>4043</a>
<a id='n4044' href='#n4044'>4044</a>
<a id='n4045' href='#n4045'>4045</a>
<a id='n4046' href='#n4046'>4046</a>
<a id='n4047' href='#n4047'>4047</a>
<a id='n4048' href='#n4048'>4048</a>
<a id='n4049' href='#n4049'>4049</a>
<a id='n4050' href='#n4050'>4050</a>
<a id='n4051' href='#n4051'>4051</a>
<a id='n4052' href='#n4052'>4052</a>
<a id='n4053' href='#n4053'>4053</a>
<a id='n4054' href='#n4054'>4054</a>
<a id='n4055' href='#n4055'>4055</a>
<a id='n4056' href='#n4056'>4056</a>
<a id='n4057' href='#n4057'>4057</a>
<a id='n4058' href='#n4058'>4058</a>
<a id='n4059' href='#n4059'>4059</a>
<a id='n4060' href='#n4060'>4060</a>
<a id='n4061' href='#n4061'>4061</a>
<a id='n4062' href='#n4062'>4062</a>
<a id='n4063' href='#n4063'>4063</a>
<a id='n4064' href='#n4064'>4064</a>
<a id='n4065' href='#n4065'>4065</a>
<a id='n4066' href='#n4066'>4066</a>
<a id='n4067' href='#n4067'>4067</a>
<a id='n4068' href='#n4068'>4068</a>
<a id='n4069' href='#n4069'>4069</a>
<a id='n4070' href='#n4070'>4070</a>
<a id='n4071' href='#n4071'>4071</a>
<a id='n4072' href='#n4072'>4072</a>
<a id='n4073' href='#n4073'>4073</a>
<a id='n4074' href='#n4074'>4074</a>
<a id='n4075' href='#n4075'>4075</a>
<a id='n4076' href='#n4076'>4076</a>
<a id='n4077' href='#n4077'>4077</a>
<a id='n4078' href='#n4078'>4078</a>
<a id='n4079' href='#n4079'>4079</a>
<a id='n4080' href='#n4080'>4080</a>
<a id='n4081' href='#n4081'>4081</a>
<a id='n4082' href='#n4082'>4082</a>
<a id='n4083' href='#n4083'>4083</a>
<a id='n4084' href='#n4084'>4084</a>
<a id='n4085' href='#n4085'>4085</a>
<a id='n4086' href='#n4086'>4086</a>
<a id='n4087' href='#n4087'>4087</a>
<a id='n4088' href='#n4088'>4088</a>
<a id='n4089' href='#n4089'>4089</a>
<a id='n4090' href='#n4090'>4090</a>
<a id='n4091' href='#n4091'>4091</a>
<a id='n4092' href='#n4092'>4092</a>
<a id='n4093' href='#n4093'>4093</a>
<a id='n4094' href='#n4094'>4094</a>
<a id='n4095' href='#n4095'>4095</a>
<a id='n4096' href='#n4096'>4096</a>
<a id='n4097' href='#n4097'>4097</a>
<a id='n4098' href='#n4098'>4098</a>
<a id='n4099' href='#n4099'>4099</a>
<a id='n4100' href='#n4100'>4100</a>
<a id='n4101' href='#n4101'>4101</a>
<a id='n4102' href='#n4102'>4102</a>
<a id='n4103' href='#n4103'>4103</a>
<a id='n4104' href='#n4104'>4104</a>
<a id='n4105' href='#n4105'>4105</a>
<a id='n4106' href='#n4106'>4106</a>
<a id='n4107' href='#n4107'>4107</a>
<a id='n4108' href='#n4108'>4108</a>
<a id='n4109' href='#n4109'>4109</a>
<a id='n4110' href='#n4110'>4110</a>
<a id='n4111' href='#n4111'>4111</a>
<a id='n4112' href='#n4112'>4112</a>
<a id='n4113' href='#n4113'>4113</a>
<a id='n4114' href='#n4114'>4114</a>
<a id='n4115' href='#n4115'>4115</a>
<a id='n4116' href='#n4116'>4116</a>
<a id='n4117' href='#n4117'>4117</a>
<a id='n4118' href='#n4118'>4118</a>
<a id='n4119' href='#n4119'>4119</a>
<a id='n4120' href='#n4120'>4120</a>
<a id='n4121' href='#n4121'>4121</a>
<a id='n4122' href='#n4122'>4122</a>
<a id='n4123' href='#n4123'>4123</a>
<a id='n4124' href='#n4124'>4124</a>
<a id='n4125' href='#n4125'>4125</a>
<a id='n4126' href='#n4126'>4126</a>
<a id='n4127' href='#n4127'>4127</a>
<a id='n4128' href='#n4128'>4128</a>
<a id='n4129' href='#n4129'>4129</a>
<a id='n4130' href='#n4130'>4130</a>
<a id='n4131' href='#n4131'>4131</a>
<a id='n4132' href='#n4132'>4132</a>
<a id='n4133' href='#n4133'>4133</a>
<a id='n4134' href='#n4134'>4134</a>
<a id='n4135' href='#n4135'>4135</a>
<a id='n4136' href='#n4136'>4136</a>
<a id='n4137' href='#n4137'>4137</a>
<a id='n4138' href='#n4138'>4138</a>
<a id='n4139' href='#n4139'>4139</a>
<a id='n4140' href='#n4140'>4140</a>
<a id='n4141' href='#n4141'>4141</a>
<a id='n4142' href='#n4142'>4142</a>
<a id='n4143' href='#n4143'>4143</a>
<a id='n4144' href='#n4144'>4144</a>
<a id='n4145' href='#n4145'>4145</a>
<a id='n4146' href='#n4146'>4146</a>
<a id='n4147' href='#n4147'>4147</a>
<a id='n4148' href='#n4148'>4148</a>
<a id='n4149' href='#n4149'>4149</a>
<a id='n4150' href='#n4150'>4150</a>
<a id='n4151' href='#n4151'>4151</a>
<a id='n4152' href='#n4152'>4152</a>
<a id='n4153' href='#n4153'>4153</a>
<a id='n4154' href='#n4154'>4154</a>
<a id='n4155' href='#n4155'>4155</a>
<a id='n4156' href='#n4156'>4156</a>
<a id='n4157' href='#n4157'>4157</a>
<a id='n4158' href='#n4158'>4158</a>
<a id='n4159' href='#n4159'>4159</a>
<a id='n4160' href='#n4160'>4160</a>
<a id='n4161' href='#n4161'>4161</a>
<a id='n4162' href='#n4162'>4162</a>
<a id='n4163' href='#n4163'>4163</a>
<a id='n4164' href='#n4164'>4164</a>
<a id='n4165' href='#n4165'>4165</a>
<a id='n4166' href='#n4166'>4166</a>
<a id='n4167' href='#n4167'>4167</a>
<a id='n4168' href='#n4168'>4168</a>
<a id='n4169' href='#n4169'>4169</a>
<a id='n4170' href='#n4170'>4170</a>
<a id='n4171' href='#n4171'>4171</a>
<a id='n4172' href='#n4172'>4172</a>
<a id='n4173' href='#n4173'>4173</a>
<a id='n4174' href='#n4174'>4174</a>
<a id='n4175' href='#n4175'>4175</a>
<a id='n4176' href='#n4176'>4176</a>
<a id='n4177' href='#n4177'>4177</a>
<a id='n4178' href='#n4178'>4178</a>
<a id='n4179' href='#n4179'>4179</a>
<a id='n4180' href='#n4180'>4180</a>
<a id='n4181' href='#n4181'>4181</a>
<a id='n4182' href='#n4182'>4182</a>
<a id='n4183' href='#n4183'>4183</a>
<a id='n4184' href='#n4184'>4184</a>
<a id='n4185' href='#n4185'>4185</a>
<a id='n4186' href='#n4186'>4186</a>
<a id='n4187' href='#n4187'>4187</a>
<a id='n4188' href='#n4188'>4188</a>
<a id='n4189' href='#n4189'>4189</a>
<a id='n4190' href='#n4190'>4190</a>
<a id='n4191' href='#n4191'>4191</a>
<a id='n4192' href='#n4192'>4192</a>
<a id='n4193' href='#n4193'>4193</a>
<a id='n4194' href='#n4194'>4194</a>
<a id='n4195' href='#n4195'>4195</a>
<a id='n4196' href='#n4196'>4196</a>
<a id='n4197' href='#n4197'>4197</a>
<a id='n4198' href='#n4198'>4198</a>
<a id='n4199' href='#n4199'>4199</a>
<a id='n4200' href='#n4200'>4200</a>
<a id='n4201' href='#n4201'>4201</a>
<a id='n4202' href='#n4202'>4202</a>
<a id='n4203' href='#n4203'>4203</a>
<a id='n4204' href='#n4204'>4204</a>
<a id='n4205' href='#n4205'>4205</a>
<a id='n4206' href='#n4206'>4206</a>
<a id='n4207' href='#n4207'>4207</a>
<a id='n4208' href='#n4208'>4208</a>
<a id='n4209' href='#n4209'>4209</a>
<a id='n4210' href='#n4210'>4210</a>
<a id='n4211' href='#n4211'>4211</a>
<a id='n4212' href='#n4212'>4212</a>
<a id='n4213' href='#n4213'>4213</a>
<a id='n4214' href='#n4214'>4214</a>
<a id='n4215' href='#n4215'>4215</a>
<a id='n4216' href='#n4216'>4216</a>
<a id='n4217' href='#n4217'>4217</a>
<a id='n4218' href='#n4218'>4218</a>
<a id='n4219' href='#n4219'>4219</a>
<a id='n4220' href='#n4220'>4220</a>
<a id='n4221' href='#n4221'>4221</a>
<a id='n4222' href='#n4222'>4222</a>
<a id='n4223' href='#n4223'>4223</a>
<a id='n4224' href='#n4224'>4224</a>
<a id='n4225' href='#n4225'>4225</a>
<a id='n4226' href='#n4226'>4226</a>
<a id='n4227' href='#n4227'>4227</a>
<a id='n4228' href='#n4228'>4228</a>
<a id='n4229' href='#n4229'>4229</a>
<a id='n4230' href='#n4230'>4230</a>
<a id='n4231' href='#n4231'>4231</a>
<a id='n4232' href='#n4232'>4232</a>
<a id='n4233' href='#n4233'>4233</a>
<a id='n4234' href='#n4234'>4234</a>
<a id='n4235' href='#n4235'>4235</a>
<a id='n4236' href='#n4236'>4236</a>
<a id='n4237' href='#n4237'>4237</a>
<a id='n4238' href='#n4238'>4238</a>
<a id='n4239' href='#n4239'>4239</a>
<a id='n4240' href='#n4240'>4240</a>
<a id='n4241' href='#n4241'>4241</a>
<a id='n4242' href='#n4242'>4242</a>
<a id='n4243' href='#n4243'>4243</a>
<a id='n4244' href='#n4244'>4244</a>
<a id='n4245' href='#n4245'>4245</a>
<a id='n4246' href='#n4246'>4246</a>
<a id='n4247' href='#n4247'>4247</a>
<a id='n4248' href='#n4248'>4248</a>
<a id='n4249' href='#n4249'>4249</a>
<a id='n4250' href='#n4250'>4250</a>
<a id='n4251' href='#n4251'>4251</a>
<a id='n4252' href='#n4252'>4252</a>
<a id='n4253' href='#n4253'>4253</a>
<a id='n4254' href='#n4254'>4254</a>
<a id='n4255' href='#n4255'>4255</a>
<a id='n4256' href='#n4256'>4256</a>
<a id='n4257' href='#n4257'>4257</a>
<a id='n4258' href='#n4258'>4258</a>
<a id='n4259' href='#n4259'>4259</a>
<a id='n4260' href='#n4260'>4260</a>
<a id='n4261' href='#n4261'>4261</a>
<a id='n4262' href='#n4262'>4262</a>
<a id='n4263' href='#n4263'>4263</a>
<a id='n4264' href='#n4264'>4264</a>
<a id='n4265' href='#n4265'>4265</a>
<a id='n4266' href='#n4266'>4266</a>
<a id='n4267' href='#n4267'>4267</a>
<a id='n4268' href='#n4268'>4268</a>
<a id='n4269' href='#n4269'>4269</a>
<a id='n4270' href='#n4270'>4270</a>
<a id='n4271' href='#n4271'>4271</a>
<a id='n4272' href='#n4272'>4272</a>
<a id='n4273' href='#n4273'>4273</a>
<a id='n4274' href='#n4274'>4274</a>
<a id='n4275' href='#n4275'>4275</a>
<a id='n4276' href='#n4276'>4276</a>
<a id='n4277' href='#n4277'>4277</a>
<a id='n4278' href='#n4278'>4278</a>
<a id='n4279' href='#n4279'>4279</a>
<a id='n4280' href='#n4280'>4280</a>
<a id='n4281' href='#n4281'>4281</a>
<a id='n4282' href='#n4282'>4282</a>
<a id='n4283' href='#n4283'>4283</a>
<a id='n4284' href='#n4284'>4284</a>
<a id='n4285' href='#n4285'>4285</a>
<a id='n4286' href='#n4286'>4286</a>
<a id='n4287' href='#n4287'>4287</a>
<a id='n4288' href='#n4288'>4288</a>
<a id='n4289' href='#n4289'>4289</a>
<a id='n4290' href='#n4290'>4290</a>
<a id='n4291' href='#n4291'>4291</a>
<a id='n4292' href='#n4292'>4292</a>
<a id='n4293' href='#n4293'>4293</a>
<a id='n4294' href='#n4294'>4294</a>
<a id='n4295' href='#n4295'>4295</a>
<a id='n4296' href='#n4296'>4296</a>
<a id='n4297' href='#n4297'>4297</a>
<a id='n4298' href='#n4298'>4298</a>
<a id='n4299' href='#n4299'>4299</a>
<a id='n4300' href='#n4300'>4300</a>
<a id='n4301' href='#n4301'>4301</a>
<a id='n4302' href='#n4302'>4302</a>
<a id='n4303' href='#n4303'>4303</a>
<a id='n4304' href='#n4304'>4304</a>
<a id='n4305' href='#n4305'>4305</a>
<a id='n4306' href='#n4306'>4306</a>
<a id='n4307' href='#n4307'>4307</a>
<a id='n4308' href='#n4308'>4308</a>
<a id='n4309' href='#n4309'>4309</a>
<a id='n4310' href='#n4310'>4310</a>
<a id='n4311' href='#n4311'>4311</a>
<a id='n4312' href='#n4312'>4312</a>
<a id='n4313' href='#n4313'>4313</a>
<a id='n4314' href='#n4314'>4314</a>
<a id='n4315' href='#n4315'>4315</a>
<a id='n4316' href='#n4316'>4316</a>
<a id='n4317' href='#n4317'>4317</a>
<a id='n4318' href='#n4318'>4318</a>
<a id='n4319' href='#n4319'>4319</a>
<a id='n4320' href='#n4320'>4320</a>
<a id='n4321' href='#n4321'>4321</a>
<a id='n4322' href='#n4322'>4322</a>
<a id='n4323' href='#n4323'>4323</a>
<a id='n4324' href='#n4324'>4324</a>
<a id='n4325' href='#n4325'>4325</a>
<a id='n4326' href='#n4326'>4326</a>
<a id='n4327' href='#n4327'>4327</a>
<a id='n4328' href='#n4328'>4328</a>
<a id='n4329' href='#n4329'>4329</a>
<a id='n4330' href='#n4330'>4330</a>
<a id='n4331' href='#n4331'>4331</a>
<a id='n4332' href='#n4332'>4332</a>
<a id='n4333' href='#n4333'>4333</a>
<a id='n4334' href='#n4334'>4334</a>
<a id='n4335' href='#n4335'>4335</a>
<a id='n4336' href='#n4336'>4336</a>
<a id='n4337' href='#n4337'>4337</a>
<a id='n4338' href='#n4338'>4338</a>
<a id='n4339' href='#n4339'>4339</a>
<a id='n4340' href='#n4340'>4340</a>
<a id='n4341' href='#n4341'>4341</a>
<a id='n4342' href='#n4342'>4342</a>
<a id='n4343' href='#n4343'>4343</a>
<a id='n4344' href='#n4344'>4344</a>
<a id='n4345' href='#n4345'>4345</a>
<a id='n4346' href='#n4346'>4346</a>
<a id='n4347' href='#n4347'>4347</a>
<a id='n4348' href='#n4348'>4348</a>
<a id='n4349' href='#n4349'>4349</a>
<a id='n4350' href='#n4350'>4350</a>
<a id='n4351' href='#n4351'>4351</a>
<a id='n4352' href='#n4352'>4352</a>
<a id='n4353' href='#n4353'>4353</a>
<a id='n4354' href='#n4354'>4354</a>
<a id='n4355' href='#n4355'>4355</a>
<a id='n4356' href='#n4356'>4356</a>
<a id='n4357' href='#n4357'>4357</a>
<a id='n4358' href='#n4358'>4358</a>
<a id='n4359' href='#n4359'>4359</a>
<a id='n4360' href='#n4360'>4360</a>
<a id='n4361' href='#n4361'>4361</a>
<a id='n4362' href='#n4362'>4362</a>
<a id='n4363' href='#n4363'>4363</a>
<a id='n4364' href='#n4364'>4364</a>
<a id='n4365' href='#n4365'>4365</a>
<a id='n4366' href='#n4366'>4366</a>
<a id='n4367' href='#n4367'>4367</a>
<a id='n4368' href='#n4368'>4368</a>
<a id='n4369' href='#n4369'>4369</a>
<a id='n4370' href='#n4370'>4370</a>
<a id='n4371' href='#n4371'>4371</a>
<a id='n4372' href='#n4372'>4372</a>
<a id='n4373' href='#n4373'>4373</a>
<a id='n4374' href='#n4374'>4374</a>
<a id='n4375' href='#n4375'>4375</a>
<a id='n4376' href='#n4376'>4376</a>
<a id='n4377' href='#n4377'>4377</a>
<a id='n4378' href='#n4378'>4378</a>
<a id='n4379' href='#n4379'>4379</a>
<a id='n4380' href='#n4380'>4380</a>
<a id='n4381' href='#n4381'>4381</a>
<a id='n4382' href='#n4382'>4382</a>
<a id='n4383' href='#n4383'>4383</a>
<a id='n4384' href='#n4384'>4384</a>
<a id='n4385' href='#n4385'>4385</a>
<a id='n4386' href='#n4386'>4386</a>
<a id='n4387' href='#n4387'>4387</a>
<a id='n4388' href='#n4388'>4388</a>
<a id='n4389' href='#n4389'>4389</a>
<a id='n4390' href='#n4390'>4390</a>
<a id='n4391' href='#n4391'>4391</a>
<a id='n4392' href='#n4392'>4392</a>
<a id='n4393' href='#n4393'>4393</a>
<a id='n4394' href='#n4394'>4394</a>
<a id='n4395' href='#n4395'>4395</a>
<a id='n4396' href='#n4396'>4396</a>
<a id='n4397' href='#n4397'>4397</a>
<a id='n4398' href='#n4398'>4398</a>
<a id='n4399' href='#n4399'>4399</a>
<a id='n4400' href='#n4400'>4400</a>
<a id='n4401' href='#n4401'>4401</a>
<a id='n4402' href='#n4402'>4402</a>
<a id='n4403' href='#n4403'>4403</a>
<a id='n4404' href='#n4404'>4404</a>
<a id='n4405' href='#n4405'>4405</a>
<a id='n4406' href='#n4406'>4406</a>
<a id='n4407' href='#n4407'>4407</a>
<a id='n4408' href='#n4408'>4408</a>
<a id='n4409' href='#n4409'>4409</a>
<a id='n4410' href='#n4410'>4410</a>
<a id='n4411' href='#n4411'>4411</a>
<a id='n4412' href='#n4412'>4412</a>
<a id='n4413' href='#n4413'>4413</a>
<a id='n4414' href='#n4414'>4414</a>
<a id='n4415' href='#n4415'>4415</a>
<a id='n4416' href='#n4416'>4416</a>
<a id='n4417' href='#n4417'>4417</a>
<a id='n4418' href='#n4418'>4418</a>
<a id='n4419' href='#n4419'>4419</a>
<a id='n4420' href='#n4420'>4420</a>
<a id='n4421' href='#n4421'>4421</a>
<a id='n4422' href='#n4422'>4422</a>
<a id='n4423' href='#n4423'>4423</a>
<a id='n4424' href='#n4424'>4424</a>
<a id='n4425' href='#n4425'>4425</a>
<a id='n4426' href='#n4426'>4426</a>
<a id='n4427' href='#n4427'>4427</a>
<a id='n4428' href='#n4428'>4428</a>
<a id='n4429' href='#n4429'>4429</a>
<a id='n4430' href='#n4430'>4430</a>
<a id='n4431' href='#n4431'>4431</a>
<a id='n4432' href='#n4432'>4432</a>
<a id='n4433' href='#n4433'>4433</a>
<a id='n4434' href='#n4434'>4434</a>
<a id='n4435' href='#n4435'>4435</a>
<a id='n4436' href='#n4436'>4436</a>
<a id='n4437' href='#n4437'>4437</a>
<a id='n4438' href='#n4438'>4438</a>
<a id='n4439' href='#n4439'>4439</a>
<a id='n4440' href='#n4440'>4440</a>
<a id='n4441' href='#n4441'>4441</a>
<a id='n4442' href='#n4442'>4442</a>
<a id='n4443' href='#n4443'>4443</a>
<a id='n4444' href='#n4444'>4444</a>
<a id='n4445' href='#n4445'>4445</a>
<a id='n4446' href='#n4446'>4446</a>
<a id='n4447' href='#n4447'>4447</a>
<a id='n4448' href='#n4448'>4448</a>
<a id='n4449' href='#n4449'>4449</a>
<a id='n4450' href='#n4450'>4450</a>
<a id='n4451' href='#n4451'>4451</a>
<a id='n4452' href='#n4452'>4452</a>
<a id='n4453' href='#n4453'>4453</a>
<a id='n4454' href='#n4454'>4454</a>
<a id='n4455' href='#n4455'>4455</a>
<a id='n4456' href='#n4456'>4456</a>
<a id='n4457' href='#n4457'>4457</a>
<a id='n4458' href='#n4458'>4458</a>
<a id='n4459' href='#n4459'>4459</a>
<a id='n4460' href='#n4460'>4460</a>
<a id='n4461' href='#n4461'>4461</a>
<a id='n4462' href='#n4462'>4462</a>
<a id='n4463' href='#n4463'>4463</a>
<a id='n4464' href='#n4464'>4464</a>
<a id='n4465' href='#n4465'>4465</a>
<a id='n4466' href='#n4466'>4466</a>
<a id='n4467' href='#n4467'>4467</a>
<a id='n4468' href='#n4468'>4468</a>
<a id='n4469' href='#n4469'>4469</a>
<a id='n4470' href='#n4470'>4470</a>
<a id='n4471' href='#n4471'>4471</a>
<a id='n4472' href='#n4472'>4472</a>
<a id='n4473' href='#n4473'>4473</a>
<a id='n4474' href='#n4474'>4474</a>
<a id='n4475' href='#n4475'>4475</a>
<a id='n4476' href='#n4476'>4476</a>
<a id='n4477' href='#n4477'>4477</a>
<a id='n4478' href='#n4478'>4478</a>
<a id='n4479' href='#n4479'>4479</a>
<a id='n4480' href='#n4480'>4480</a>
<a id='n4481' href='#n4481'>4481</a>
<a id='n4482' href='#n4482'>4482</a>
<a id='n4483' href='#n4483'>4483</a>
<a id='n4484' href='#n4484'>4484</a>
<a id='n4485' href='#n4485'>4485</a>
<a id='n4486' href='#n4486'>4486</a>
<a id='n4487' href='#n4487'>4487</a>
<a id='n4488' href='#n4488'>4488</a>
<a id='n4489' href='#n4489'>4489</a>
<a id='n4490' href='#n4490'>4490</a>
<a id='n4491' href='#n4491'>4491</a>
<a id='n4492' href='#n4492'>4492</a>
<a id='n4493' href='#n4493'>4493</a>
<a id='n4494' href='#n4494'>4494</a>
<a id='n4495' href='#n4495'>4495</a>
<a id='n4496' href='#n4496'>4496</a>
<a id='n4497' href='#n4497'>4497</a>
<a id='n4498' href='#n4498'>4498</a>
<a id='n4499' href='#n4499'>4499</a>
<a id='n4500' href='#n4500'>4500</a>
<a id='n4501' href='#n4501'>4501</a>
<a id='n4502' href='#n4502'>4502</a>
<a id='n4503' href='#n4503'>4503</a>
<a id='n4504' href='#n4504'>4504</a>
<a id='n4505' href='#n4505'>4505</a>
<a id='n4506' href='#n4506'>4506</a>
<a id='n4507' href='#n4507'>4507</a>
<a id='n4508' href='#n4508'>4508</a>
<a id='n4509' href='#n4509'>4509</a>
<a id='n4510' href='#n4510'>4510</a>
<a id='n4511' href='#n4511'>4511</a>
<a id='n4512' href='#n4512'>4512</a>
<a id='n4513' href='#n4513'>4513</a>
<a id='n4514' href='#n4514'>4514</a>
<a id='n4515' href='#n4515'>4515</a>
<a id='n4516' href='#n4516'>4516</a>
<a id='n4517' href='#n4517'>4517</a>
<a id='n4518' href='#n4518'>4518</a>
<a id='n4519' href='#n4519'>4519</a>
<a id='n4520' href='#n4520'>4520</a>
<a id='n4521' href='#n4521'>4521</a>
<a id='n4522' href='#n4522'>4522</a>
<a id='n4523' href='#n4523'>4523</a>
<a id='n4524' href='#n4524'>4524</a>
<a id='n4525' href='#n4525'>4525</a>
<a id='n4526' href='#n4526'>4526</a>
<a id='n4527' href='#n4527'>4527</a>
<a id='n4528' href='#n4528'>4528</a>
<a id='n4529' href='#n4529'>4529</a>
<a id='n4530' href='#n4530'>4530</a>
<a id='n4531' href='#n4531'>4531</a>
<a id='n4532' href='#n4532'>4532</a>
<a id='n4533' href='#n4533'>4533</a>
<a id='n4534' href='#n4534'>4534</a>
<a id='n4535' href='#n4535'>4535</a>
<a id='n4536' href='#n4536'>4536</a>
<a id='n4537' href='#n4537'>4537</a>
<a id='n4538' href='#n4538'>4538</a>
<a id='n4539' href='#n4539'>4539</a>
<a id='n4540' href='#n4540'>4540</a>
<a id='n4541' href='#n4541'>4541</a>
<a id='n4542' href='#n4542'>4542</a>
<a id='n4543' href='#n4543'>4543</a>
<a id='n4544' href='#n4544'>4544</a>
<a id='n4545' href='#n4545'>4545</a>
<a id='n4546' href='#n4546'>4546</a>
<a id='n4547' href='#n4547'>4547</a>
<a id='n4548' href='#n4548'>4548</a>
<a id='n4549' href='#n4549'>4549</a>
<a id='n4550' href='#n4550'>4550</a>
<a id='n4551' href='#n4551'>4551</a>
<a id='n4552' href='#n4552'>4552</a>
<a id='n4553' href='#n4553'>4553</a>
<a id='n4554' href='#n4554'>4554</a>
<a id='n4555' href='#n4555'>4555</a>
<a id='n4556' href='#n4556'>4556</a>
<a id='n4557' href='#n4557'>4557</a>
<a id='n4558' href='#n4558'>4558</a>
<a id='n4559' href='#n4559'>4559</a>
<a id='n4560' href='#n4560'>4560</a>
<a id='n4561' href='#n4561'>4561</a>
<a id='n4562' href='#n4562'>4562</a>
<a id='n4563' href='#n4563'>4563</a>
<a id='n4564' href='#n4564'>4564</a>
<a id='n4565' href='#n4565'>4565</a>
<a id='n4566' href='#n4566'>4566</a>
<a id='n4567' href='#n4567'>4567</a>
<a id='n4568' href='#n4568'>4568</a>
<a id='n4569' href='#n4569'>4569</a>
<a id='n4570' href='#n4570'>4570</a>
<a id='n4571' href='#n4571'>4571</a>
<a id='n4572' href='#n4572'>4572</a>
<a id='n4573' href='#n4573'>4573</a>
<a id='n4574' href='#n4574'>4574</a>
<a id='n4575' href='#n4575'>4575</a>
<a id='n4576' href='#n4576'>4576</a>
<a id='n4577' href='#n4577'>4577</a>
<a id='n4578' href='#n4578'>4578</a>
<a id='n4579' href='#n4579'>4579</a>
<a id='n4580' href='#n4580'>4580</a>
<a id='n4581' href='#n4581'>4581</a>
<a id='n4582' href='#n4582'>4582</a>
<a id='n4583' href='#n4583'>4583</a>
<a id='n4584' href='#n4584'>4584</a>
<a id='n4585' href='#n4585'>4585</a>
<a id='n4586' href='#n4586'>4586</a>
<a id='n4587' href='#n4587'>4587</a>
<a id='n4588' href='#n4588'>4588</a>
<a id='n4589' href='#n4589'>4589</a>
<a id='n4590' href='#n4590'>4590</a>
<a id='n4591' href='#n4591'>4591</a>
<a id='n4592' href='#n4592'>4592</a>
<a id='n4593' href='#n4593'>4593</a>
<a id='n4594' href='#n4594'>4594</a>
<a id='n4595' href='#n4595'>4595</a>
<a id='n4596' href='#n4596'>4596</a>
<a id='n4597' href='#n4597'>4597</a>
<a id='n4598' href='#n4598'>4598</a>
<a id='n4599' href='#n4599'>4599</a>
<a id='n4600' href='#n4600'>4600</a>
<a id='n4601' href='#n4601'>4601</a>
<a id='n4602' href='#n4602'>4602</a>
<a id='n4603' href='#n4603'>4603</a>
<a id='n4604' href='#n4604'>4604</a>
<a id='n4605' href='#n4605'>4605</a>
<a id='n4606' href='#n4606'>4606</a>
<a id='n4607' href='#n4607'>4607</a>
<a id='n4608' href='#n4608'>4608</a>
<a id='n4609' href='#n4609'>4609</a>
<a id='n4610' href='#n4610'>4610</a>
<a id='n4611' href='#n4611'>4611</a>
<a id='n4612' href='#n4612'>4612</a>
<a id='n4613' href='#n4613'>4613</a>
<a id='n4614' href='#n4614'>4614</a>
<a id='n4615' href='#n4615'>4615</a>
<a id='n4616' href='#n4616'>4616</a>
<a id='n4617' href='#n4617'>4617</a>
<a id='n4618' href='#n4618'>4618</a>
<a id='n4619' href='#n4619'>4619</a>
<a id='n4620' href='#n4620'>4620</a>
<a id='n4621' href='#n4621'>4621</a>
<a id='n4622' href='#n4622'>4622</a>
<a id='n4623' href='#n4623'>4623</a>
<a id='n4624' href='#n4624'>4624</a>
<a id='n4625' href='#n4625'>4625</a>
<a id='n4626' href='#n4626'>4626</a>
<a id='n4627' href='#n4627'>4627</a>
<a id='n4628' href='#n4628'>4628</a>
<a id='n4629' href='#n4629'>4629</a>
<a id='n4630' href='#n4630'>4630</a>
<a id='n4631' href='#n4631'>4631</a>
<a id='n4632' href='#n4632'>4632</a>
<a id='n4633' href='#n4633'>4633</a>
<a id='n4634' href='#n4634'>4634</a>
<a id='n4635' href='#n4635'>4635</a>
<a id='n4636' href='#n4636'>4636</a>
<a id='n4637' href='#n4637'>4637</a>
<a id='n4638' href='#n4638'>4638</a>
<a id='n4639' href='#n4639'>4639</a>
<a id='n4640' href='#n4640'>4640</a>
<a id='n4641' href='#n4641'>4641</a>
<a id='n4642' href='#n4642'>4642</a>
<a id='n4643' href='#n4643'>4643</a>
<a id='n4644' href='#n4644'>4644</a>
<a id='n4645' href='#n4645'>4645</a>
<a id='n4646' href='#n4646'>4646</a>
<a id='n4647' href='#n4647'>4647</a>
<a id='n4648' href='#n4648'>4648</a>
<a id='n4649' href='#n4649'>4649</a>
<a id='n4650' href='#n4650'>4650</a>
<a id='n4651' href='#n4651'>4651</a>
<a id='n4652' href='#n4652'>4652</a>
<a id='n4653' href='#n4653'>4653</a>
<a id='n4654' href='#n4654'>4654</a>
<a id='n4655' href='#n4655'>4655</a>
<a id='n4656' href='#n4656'>4656</a>
<a id='n4657' href='#n4657'>4657</a>
<a id='n4658' href='#n4658'>4658</a>
<a id='n4659' href='#n4659'>4659</a>
<a id='n4660' href='#n4660'>4660</a>
<a id='n4661' href='#n4661'>4661</a>
<a id='n4662' href='#n4662'>4662</a>
<a id='n4663' href='#n4663'>4663</a>
<a id='n4664' href='#n4664'>4664</a>
<a id='n4665' href='#n4665'>4665</a>
<a id='n4666' href='#n4666'>4666</a>
<a id='n4667' href='#n4667'>4667</a>
<a id='n4668' href='#n4668'>4668</a>
<a id='n4669' href='#n4669'>4669</a>
<a id='n4670' href='#n4670'>4670</a>
<a id='n4671' href='#n4671'>4671</a>
<a id='n4672' href='#n4672'>4672</a>
<a id='n4673' href='#n4673'>4673</a>
<a id='n4674' href='#n4674'>4674</a>
<a id='n4675' href='#n4675'>4675</a>
<a id='n4676' href='#n4676'>4676</a>
<a id='n4677' href='#n4677'>4677</a>
<a id='n4678' href='#n4678'>4678</a>
<a id='n4679' href='#n4679'>4679</a>
<a id='n4680' href='#n4680'>4680</a>
<a id='n4681' href='#n4681'>4681</a>
<a id='n4682' href='#n4682'>4682</a>
<a id='n4683' href='#n4683'>4683</a>
<a id='n4684' href='#n4684'>4684</a>
<a id='n4685' href='#n4685'>4685</a>
<a id='n4686' href='#n4686'>4686</a>
<a id='n4687' href='#n4687'>4687</a>
<a id='n4688' href='#n4688'>4688</a>
<a id='n4689' href='#n4689'>4689</a>
<a id='n4690' href='#n4690'>4690</a>
<a id='n4691' href='#n4691'>4691</a>
<a id='n4692' href='#n4692'>4692</a>
<a id='n4693' href='#n4693'>4693</a>
<a id='n4694' href='#n4694'>4694</a>
<a id='n4695' href='#n4695'>4695</a>
<a id='n4696' href='#n4696'>4696</a>
<a id='n4697' href='#n4697'>4697</a>
<a id='n4698' href='#n4698'>4698</a>
<a id='n4699' href='#n4699'>4699</a>
<a id='n4700' href='#n4700'>4700</a>
<a id='n4701' href='#n4701'>4701</a>
<a id='n4702' href='#n4702'>4702</a>
<a id='n4703' href='#n4703'>4703</a>
<a id='n4704' href='#n4704'>4704</a>
<a id='n4705' href='#n4705'>4705</a>
<a id='n4706' href='#n4706'>4706</a>
<a id='n4707' href='#n4707'>4707</a>
<a id='n4708' href='#n4708'>4708</a>
<a id='n4709' href='#n4709'>4709</a>
<a id='n4710' href='#n4710'>4710</a>
<a id='n4711' href='#n4711'>4711</a>
<a id='n4712' href='#n4712'>4712</a>
<a id='n4713' href='#n4713'>4713</a>
<a id='n4714' href='#n4714'>4714</a>
<a id='n4715' href='#n4715'>4715</a>
<a id='n4716' href='#n4716'>4716</a>
<a id='n4717' href='#n4717'>4717</a>
<a id='n4718' href='#n4718'>4718</a>
<a id='n4719' href='#n4719'>4719</a>
<a id='n4720' href='#n4720'>4720</a>
<a id='n4721' href='#n4721'>4721</a>
<a id='n4722' href='#n4722'>4722</a>
<a id='n4723' href='#n4723'>4723</a>
<a id='n4724' href='#n4724'>4724</a>
<a id='n4725' href='#n4725'>4725</a>
<a id='n4726' href='#n4726'>4726</a>
<a id='n4727' href='#n4727'>4727</a>
<a id='n4728' href='#n4728'>4728</a>
<a id='n4729' href='#n4729'>4729</a>
<a id='n4730' href='#n4730'>4730</a>
<a id='n4731' href='#n4731'>4731</a>
<a id='n4732' href='#n4732'>4732</a>
<a id='n4733' href='#n4733'>4733</a>
<a id='n4734' href='#n4734'>4734</a>
<a id='n4735' href='#n4735'>4735</a>
<a id='n4736' href='#n4736'>4736</a>
<a id='n4737' href='#n4737'>4737</a>
<a id='n4738' href='#n4738'>4738</a>
<a id='n4739' href='#n4739'>4739</a>
<a id='n4740' href='#n4740'>4740</a>
<a id='n4741' href='#n4741'>4741</a>
<a id='n4742' href='#n4742'>4742</a>
<a id='n4743' href='#n4743'>4743</a>
<a id='n4744' href='#n4744'>4744</a>
<a id='n4745' href='#n4745'>4745</a>
<a id='n4746' href='#n4746'>4746</a>
<a id='n4747' href='#n4747'>4747</a>
<a id='n4748' href='#n4748'>4748</a>
<a id='n4749' href='#n4749'>4749</a>
<a id='n4750' href='#n4750'>4750</a>
<a id='n4751' href='#n4751'>4751</a>
<a id='n4752' href='#n4752'>4752</a>
<a id='n4753' href='#n4753'>4753</a>
<a id='n4754' href='#n4754'>4754</a>
<a id='n4755' href='#n4755'>4755</a>
<a id='n4756' href='#n4756'>4756</a>
<a id='n4757' href='#n4757'>4757</a>
<a id='n4758' href='#n4758'>4758</a>
<a id='n4759' href='#n4759'>4759</a>
<a id='n4760' href='#n4760'>4760</a>
<a id='n4761' href='#n4761'>4761</a>
<a id='n4762' href='#n4762'>4762</a>
<a id='n4763' href='#n4763'>4763</a>
<a id='n4764' href='#n4764'>4764</a>
<a id='n4765' href='#n4765'>4765</a>
<a id='n4766' href='#n4766'>4766</a>
<a id='n4767' href='#n4767'>4767</a>
<a id='n4768' href='#n4768'>4768</a>
<a id='n4769' href='#n4769'>4769</a>
<a id='n4770' href='#n4770'>4770</a>
<a id='n4771' href='#n4771'>4771</a>
<a id='n4772' href='#n4772'>4772</a>
<a id='n4773' href='#n4773'>4773</a>
<a id='n4774' href='#n4774'>4774</a>
<a id='n4775' href='#n4775'>4775</a>
<a id='n4776' href='#n4776'>4776</a>
<a id='n4777' href='#n4777'>4777</a>
<a id='n4778' href='#n4778'>4778</a>
<a id='n4779' href='#n4779'>4779</a>
<a id='n4780' href='#n4780'>4780</a>
<a id='n4781' href='#n4781'>4781</a>
<a id='n4782' href='#n4782'>4782</a>
<a id='n4783' href='#n4783'>4783</a>
<a id='n4784' href='#n4784'>4784</a>
<a id='n4785' href='#n4785'>4785</a>
<a id='n4786' href='#n4786'>4786</a>
<a id='n4787' href='#n4787'>4787</a>
<a id='n4788' href='#n4788'>4788</a>
<a id='n4789' href='#n4789'>4789</a>
<a id='n4790' href='#n4790'>4790</a>
<a id='n4791' href='#n4791'>4791</a>
<a id='n4792' href='#n4792'>4792</a>
<a id='n4793' href='#n4793'>4793</a>
<a id='n4794' href='#n4794'>4794</a>
<a id='n4795' href='#n4795'>4795</a>
<a id='n4796' href='#n4796'>4796</a>
<a id='n4797' href='#n4797'>4797</a>
<a id='n4798' href='#n4798'>4798</a>
<a id='n4799' href='#n4799'>4799</a>
<a id='n4800' href='#n4800'>4800</a>
<a id='n4801' href='#n4801'>4801</a>
<a id='n4802' href='#n4802'>4802</a>
<a id='n4803' href='#n4803'>4803</a>
<a id='n4804' href='#n4804'>4804</a>
<a id='n4805' href='#n4805'>4805</a>
<a id='n4806' href='#n4806'>4806</a>
<a id='n4807' href='#n4807'>4807</a>
<a id='n4808' href='#n4808'>4808</a>
<a id='n4809' href='#n4809'>4809</a>
<a id='n4810' href='#n4810'>4810</a>
<a id='n4811' href='#n4811'>4811</a>
<a id='n4812' href='#n4812'>4812</a>
<a id='n4813' href='#n4813'>4813</a>
<a id='n4814' href='#n4814'>4814</a>
<a id='n4815' href='#n4815'>4815</a>
<a id='n4816' href='#n4816'>4816</a>
<a id='n4817' href='#n4817'>4817</a>
<a id='n4818' href='#n4818'>4818</a>
<a id='n4819' href='#n4819'>4819</a>
<a id='n4820' href='#n4820'>4820</a>
<a id='n4821' href='#n4821'>4821</a>
<a id='n4822' href='#n4822'>4822</a>
<a id='n4823' href='#n4823'>4823</a>
<a id='n4824' href='#n4824'>4824</a>
<a id='n4825' href='#n4825'>4825</a>
<a id='n4826' href='#n4826'>4826</a>
<a id='n4827' href='#n4827'>4827</a>
<a id='n4828' href='#n4828'>4828</a>
<a id='n4829' href='#n4829'>4829</a>
<a id='n4830' href='#n4830'>4830</a>
<a id='n4831' href='#n4831'>4831</a>
<a id='n4832' href='#n4832'>4832</a>
<a id='n4833' href='#n4833'>4833</a>
<a id='n4834' href='#n4834'>4834</a>
<a id='n4835' href='#n4835'>4835</a>
<a id='n4836' href='#n4836'>4836</a>
<a id='n4837' href='#n4837'>4837</a>
<a id='n4838' href='#n4838'>4838</a>
<a id='n4839' href='#n4839'>4839</a>
<a id='n4840' href='#n4840'>4840</a>
<a id='n4841' href='#n4841'>4841</a>
<a id='n4842' href='#n4842'>4842</a>
<a id='n4843' href='#n4843'>4843</a>
<a id='n4844' href='#n4844'>4844</a>
<a id='n4845' href='#n4845'>4845</a>
<a id='n4846' href='#n4846'>4846</a>
<a id='n4847' href='#n4847'>4847</a>
<a id='n4848' href='#n4848'>4848</a>
<a id='n4849' href='#n4849'>4849</a>
<a id='n4850' href='#n4850'>4850</a>
<a id='n4851' href='#n4851'>4851</a>
<a id='n4852' href='#n4852'>4852</a>
<a id='n4853' href='#n4853'>4853</a>
<a id='n4854' href='#n4854'>4854</a>
<a id='n4855' href='#n4855'>4855</a>
<a id='n4856' href='#n4856'>4856</a>
<a id='n4857' href='#n4857'>4857</a>
<a id='n4858' href='#n4858'>4858</a>
<a id='n4859' href='#n4859'>4859</a>
<a id='n4860' href='#n4860'>4860</a>
<a id='n4861' href='#n4861'>4861</a>
<a id='n4862' href='#n4862'>4862</a>
<a id='n4863' href='#n4863'>4863</a>
<a id='n4864' href='#n4864'>4864</a>
<a id='n4865' href='#n4865'>4865</a>
<a id='n4866' href='#n4866'>4866</a>
<a id='n4867' href='#n4867'>4867</a>
<a id='n4868' href='#n4868'>4868</a>
<a id='n4869' href='#n4869'>4869</a>
<a id='n4870' href='#n4870'>4870</a>
<a id='n4871' href='#n4871'>4871</a>
<a id='n4872' href='#n4872'>4872</a>
<a id='n4873' href='#n4873'>4873</a>
<a id='n4874' href='#n4874'>4874</a>
<a id='n4875' href='#n4875'>4875</a>
<a id='n4876' href='#n4876'>4876</a>
<a id='n4877' href='#n4877'>4877</a>
<a id='n4878' href='#n4878'>4878</a>
<a id='n4879' href='#n4879'>4879</a>
<a id='n4880' href='#n4880'>4880</a>
<a id='n4881' href='#n4881'>4881</a>
<a id='n4882' href='#n4882'>4882</a>
<a id='n4883' href='#n4883'>4883</a>
<a id='n4884' href='#n4884'>4884</a>
<a id='n4885' href='#n4885'>4885</a>
<a id='n4886' href='#n4886'>4886</a>
<a id='n4887' href='#n4887'>4887</a>
<a id='n4888' href='#n4888'>4888</a>
<a id='n4889' href='#n4889'>4889</a>
<a id='n4890' href='#n4890'>4890</a>
<a id='n4891' href='#n4891'>4891</a>
<a id='n4892' href='#n4892'>4892</a>
<a id='n4893' href='#n4893'>4893</a>
<a id='n4894' href='#n4894'>4894</a>
<a id='n4895' href='#n4895'>4895</a>
<a id='n4896' href='#n4896'>4896</a>
<a id='n4897' href='#n4897'>4897</a>
<a id='n4898' href='#n4898'>4898</a>
<a id='n4899' href='#n4899'>4899</a>
<a id='n4900' href='#n4900'>4900</a>
<a id='n4901' href='#n4901'>4901</a>
<a id='n4902' href='#n4902'>4902</a>
<a id='n4903' href='#n4903'>4903</a>
<a id='n4904' href='#n4904'>4904</a>
<a id='n4905' href='#n4905'>4905</a>
<a id='n4906' href='#n4906'>4906</a>
<a id='n4907' href='#n4907'>4907</a>
<a id='n4908' href='#n4908'>4908</a>
<a id='n4909' href='#n4909'>4909</a>
<a id='n4910' href='#n4910'>4910</a>
<a id='n4911' href='#n4911'>4911</a>
<a id='n4912' href='#n4912'>4912</a>
<a id='n4913' href='#n4913'>4913</a>
<a id='n4914' href='#n4914'>4914</a>
<a id='n4915' href='#n4915'>4915</a>
<a id='n4916' href='#n4916'>4916</a>
<a id='n4917' href='#n4917'>4917</a>
<a id='n4918' href='#n4918'>4918</a>
<a id='n4919' href='#n4919'>4919</a>
<a id='n4920' href='#n4920'>4920</a>
<a id='n4921' href='#n4921'>4921</a>
<a id='n4922' href='#n4922'>4922</a>
<a id='n4923' href='#n4923'>4923</a>
<a id='n4924' href='#n4924'>4924</a>
<a id='n4925' href='#n4925'>4925</a>
<a id='n4926' href='#n4926'>4926</a>
<a id='n4927' href='#n4927'>4927</a>
<a id='n4928' href='#n4928'>4928</a>
<a id='n4929' href='#n4929'>4929</a>
<a id='n4930' href='#n4930'>4930</a>
<a id='n4931' href='#n4931'>4931</a>
<a id='n4932' href='#n4932'>4932</a>
<a id='n4933' href='#n4933'>4933</a>
<a id='n4934' href='#n4934'>4934</a>
<a id='n4935' href='#n4935'>4935</a>
<a id='n4936' href='#n4936'>4936</a>
<a id='n4937' href='#n4937'>4937</a>
<a id='n4938' href='#n4938'>4938</a>
<a id='n4939' href='#n4939'>4939</a>
<a id='n4940' href='#n4940'>4940</a>
<a id='n4941' href='#n4941'>4941</a>
<a id='n4942' href='#n4942'>4942</a>
<a id='n4943' href='#n4943'>4943</a>
<a id='n4944' href='#n4944'>4944</a>
<a id='n4945' href='#n4945'>4945</a>
<a id='n4946' href='#n4946'>4946</a>
<a id='n4947' href='#n4947'>4947</a>
<a id='n4948' href='#n4948'>4948</a>
<a id='n4949' href='#n4949'>4949</a>
<a id='n4950' href='#n4950'>4950</a>
<a id='n4951' href='#n4951'>4951</a>
<a id='n4952' href='#n4952'>4952</a>
<a id='n4953' href='#n4953'>4953</a>
<a id='n4954' href='#n4954'>4954</a>
<a id='n4955' href='#n4955'>4955</a>
<a id='n4956' href='#n4956'>4956</a>
<a id='n4957' href='#n4957'>4957</a>
<a id='n4958' href='#n4958'>4958</a>
<a id='n4959' href='#n4959'>4959</a>
<a id='n4960' href='#n4960'>4960</a>
<a id='n4961' href='#n4961'>4961</a>
<a id='n4962' href='#n4962'>4962</a>
<a id='n4963' href='#n4963'>4963</a>
<a id='n4964' href='#n4964'>4964</a>
<a id='n4965' href='#n4965'>4965</a>
<a id='n4966' href='#n4966'>4966</a>
<a id='n4967' href='#n4967'>4967</a>
<a id='n4968' href='#n4968'>4968</a>
<a id='n4969' href='#n4969'>4969</a>
<a id='n4970' href='#n4970'>4970</a>
<a id='n4971' href='#n4971'>4971</a>
<a id='n4972' href='#n4972'>4972</a>
<a id='n4973' href='#n4973'>4973</a>
<a id='n4974' href='#n4974'>4974</a>
<a id='n4975' href='#n4975'>4975</a>
<a id='n4976' href='#n4976'>4976</a>
<a id='n4977' href='#n4977'>4977</a>
<a id='n4978' href='#n4978'>4978</a>
<a id='n4979' href='#n4979'>4979</a>
<a id='n4980' href='#n4980'>4980</a>
<a id='n4981' href='#n4981'>4981</a>
<a id='n4982' href='#n4982'>4982</a>
<a id='n4983' href='#n4983'>4983</a>
<a id='n4984' href='#n4984'>4984</a>
<a id='n4985' href='#n4985'>4985</a>
<a id='n4986' href='#n4986'>4986</a>
<a id='n4987' href='#n4987'>4987</a>
<a id='n4988' href='#n4988'>4988</a>
<a id='n4989' href='#n4989'>4989</a>
<a id='n4990' href='#n4990'>4990</a>
<a id='n4991' href='#n4991'>4991</a>
<a id='n4992' href='#n4992'>4992</a>
<a id='n4993' href='#n4993'>4993</a>
<a id='n4994' href='#n4994'>4994</a>
<a id='n4995' href='#n4995'>4995</a>
<a id='n4996' href='#n4996'>4996</a>
<a id='n4997' href='#n4997'>4997</a>
<a id='n4998' href='#n4998'>4998</a>
<a id='n4999' href='#n4999'>4999</a>
<a id='n5000' href='#n5000'>5000</a>
<a id='n5001' href='#n5001'>5001</a>
<a id='n5002' href='#n5002'>5002</a>
<a id='n5003' href='#n5003'>5003</a>
<a id='n5004' href='#n5004'>5004</a>
<a id='n5005' href='#n5005'>5005</a>
<a id='n5006' href='#n5006'>5006</a>
<a id='n5007' href='#n5007'>5007</a>
<a id='n5008' href='#n5008'>5008</a>
<a id='n5009' href='#n5009'>5009</a>
<a id='n5010' href='#n5010'>5010</a>
<a id='n5011' href='#n5011'>5011</a>
<a id='n5012' href='#n5012'>5012</a>
<a id='n5013' href='#n5013'>5013</a>
<a id='n5014' href='#n5014'>5014</a>
<a id='n5015' href='#n5015'>5015</a>
<a id='n5016' href='#n5016'>5016</a>
<a id='n5017' href='#n5017'>5017</a>
<a id='n5018' href='#n5018'>5018</a>
<a id='n5019' href='#n5019'>5019</a>
<a id='n5020' href='#n5020'>5020</a>
<a id='n5021' href='#n5021'>5021</a>
<a id='n5022' href='#n5022'>5022</a>
<a id='n5023' href='#n5023'>5023</a>
<a id='n5024' href='#n5024'>5024</a>
<a id='n5025' href='#n5025'>5025</a>
<a id='n5026' href='#n5026'>5026</a>
<a id='n5027' href='#n5027'>5027</a>
<a id='n5028' href='#n5028'>5028</a>
<a id='n5029' href='#n5029'>5029</a>
<a id='n5030' href='#n5030'>5030</a>
<a id='n5031' href='#n5031'>5031</a>
<a id='n5032' href='#n5032'>5032</a>
<a id='n5033' href='#n5033'>5033</a>
<a id='n5034' href='#n5034'>5034</a>
<a id='n5035' href='#n5035'>5035</a>
<a id='n5036' href='#n5036'>5036</a>
<a id='n5037' href='#n5037'>5037</a>
<a id='n5038' href='#n5038'>5038</a>
<a id='n5039' href='#n5039'>5039</a>
<a id='n5040' href='#n5040'>5040</a>
<a id='n5041' href='#n5041'>5041</a>
<a id='n5042' href='#n5042'>5042</a>
<a id='n5043' href='#n5043'>5043</a>
<a id='n5044' href='#n5044'>5044</a>
<a id='n5045' href='#n5045'>5045</a>
<a id='n5046' href='#n5046'>5046</a>
<a id='n5047' href='#n5047'>5047</a>
<a id='n5048' href='#n5048'>5048</a>
<a id='n5049' href='#n5049'>5049</a>
<a id='n5050' href='#n5050'>5050</a>
<a id='n5051' href='#n5051'>5051</a>
<a id='n5052' href='#n5052'>5052</a>
<a id='n5053' href='#n5053'>5053</a>
<a id='n5054' href='#n5054'>5054</a>
<a id='n5055' href='#n5055'>5055</a>
<a id='n5056' href='#n5056'>5056</a>
<a id='n5057' href='#n5057'>5057</a>
<a id='n5058' href='#n5058'>5058</a>
<a id='n5059' href='#n5059'>5059</a>
<a id='n5060' href='#n5060'>5060</a>
<a id='n5061' href='#n5061'>5061</a>
<a id='n5062' href='#n5062'>5062</a>
<a id='n5063' href='#n5063'>5063</a>
<a id='n5064' href='#n5064'>5064</a>
<a id='n5065' href='#n5065'>5065</a>
<a id='n5066' href='#n5066'>5066</a>
<a id='n5067' href='#n5067'>5067</a>
<a id='n5068' href='#n5068'>5068</a>
<a id='n5069' href='#n5069'>5069</a>
<a id='n5070' href='#n5070'>5070</a>
<a id='n5071' href='#n5071'>5071</a>
<a id='n5072' href='#n5072'>5072</a>
<a id='n5073' href='#n5073'>5073</a>
<a id='n5074' href='#n5074'>5074</a>
<a id='n5075' href='#n5075'>5075</a>
<a id='n5076' href='#n5076'>5076</a>
<a id='n5077' href='#n5077'>5077</a>
<a id='n5078' href='#n5078'>5078</a>
<a id='n5079' href='#n5079'>5079</a>
<a id='n5080' href='#n5080'>5080</a>
<a id='n5081' href='#n5081'>5081</a>
<a id='n5082' href='#n5082'>5082</a>
<a id='n5083' href='#n5083'>5083</a>
<a id='n5084' href='#n5084'>5084</a>
<a id='n5085' href='#n5085'>5085</a>
<a id='n5086' href='#n5086'>5086</a>
<a id='n5087' href='#n5087'>5087</a>
<a id='n5088' href='#n5088'>5088</a>
<a id='n5089' href='#n5089'>5089</a>
<a id='n5090' href='#n5090'>5090</a>
<a id='n5091' href='#n5091'>5091</a>
<a id='n5092' href='#n5092'>5092</a>
<a id='n5093' href='#n5093'>5093</a>
<a id='n5094' href='#n5094'>5094</a>
<a id='n5095' href='#n5095'>5095</a>
<a id='n5096' href='#n5096'>5096</a>
<a id='n5097' href='#n5097'>5097</a>
<a id='n5098' href='#n5098'>5098</a>
<a id='n5099' href='#n5099'>5099</a>
<a id='n5100' href='#n5100'>5100</a>
<a id='n5101' href='#n5101'>5101</a>
<a id='n5102' href='#n5102'>5102</a>
<a id='n5103' href='#n5103'>5103</a>
<a id='n5104' href='#n5104'>5104</a>
<a id='n5105' href='#n5105'>5105</a>
<a id='n5106' href='#n5106'>5106</a>
<a id='n5107' href='#n5107'>5107</a>
<a id='n5108' href='#n5108'>5108</a>
<a id='n5109' href='#n5109'>5109</a>
<a id='n5110' href='#n5110'>5110</a>
<a id='n5111' href='#n5111'>5111</a>
<a id='n5112' href='#n5112'>5112</a>
<a id='n5113' href='#n5113'>5113</a>
<a id='n5114' href='#n5114'>5114</a>
<a id='n5115' href='#n5115'>5115</a>
<a id='n5116' href='#n5116'>5116</a>
<a id='n5117' href='#n5117'>5117</a>
<a id='n5118' href='#n5118'>5118</a>
<a id='n5119' href='#n5119'>5119</a>
<a id='n5120' href='#n5120'>5120</a>
<a id='n5121' href='#n5121'>5121</a>
<a id='n5122' href='#n5122'>5122</a>
<a id='n5123' href='#n5123'>5123</a>
<a id='n5124' href='#n5124'>5124</a>
<a id='n5125' href='#n5125'>5125</a>
<a id='n5126' href='#n5126'>5126</a>
<a id='n5127' href='#n5127'>5127</a>
<a id='n5128' href='#n5128'>5128</a>
<a id='n5129' href='#n5129'>5129</a>
<a id='n5130' href='#n5130'>5130</a>
<a id='n5131' href='#n5131'>5131</a>
<a id='n5132' href='#n5132'>5132</a>
<a id='n5133' href='#n5133'>5133</a>
<a id='n5134' href='#n5134'>5134</a>
<a id='n5135' href='#n5135'>5135</a>
<a id='n5136' href='#n5136'>5136</a>
<a id='n5137' href='#n5137'>5137</a>
<a id='n5138' href='#n5138'>5138</a>
<a id='n5139' href='#n5139'>5139</a>
<a id='n5140' href='#n5140'>5140</a>
<a id='n5141' href='#n5141'>5141</a>
<a id='n5142' href='#n5142'>5142</a>
<a id='n5143' href='#n5143'>5143</a>
<a id='n5144' href='#n5144'>5144</a>
<a id='n5145' href='#n5145'>5145</a>
<a id='n5146' href='#n5146'>5146</a>
<a id='n5147' href='#n5147'>5147</a>
<a id='n5148' href='#n5148'>5148</a>
<a id='n5149' href='#n5149'>5149</a>
<a id='n5150' href='#n5150'>5150</a>
<a id='n5151' href='#n5151'>5151</a>
<a id='n5152' href='#n5152'>5152</a>
<a id='n5153' href='#n5153'>5153</a>
<a id='n5154' href='#n5154'>5154</a>
<a id='n5155' href='#n5155'>5155</a>
<a id='n5156' href='#n5156'>5156</a>
<a id='n5157' href='#n5157'>5157</a>
<a id='n5158' href='#n5158'>5158</a>
<a id='n5159' href='#n5159'>5159</a>
<a id='n5160' href='#n5160'>5160</a>
<a id='n5161' href='#n5161'>5161</a>
<a id='n5162' href='#n5162'>5162</a>
<a id='n5163' href='#n5163'>5163</a>
<a id='n5164' href='#n5164'>5164</a>
<a id='n5165' href='#n5165'>5165</a>
<a id='n5166' href='#n5166'>5166</a>
<a id='n5167' href='#n5167'>5167</a>
<a id='n5168' href='#n5168'>5168</a>
<a id='n5169' href='#n5169'>5169</a>
<a id='n5170' href='#n5170'>5170</a>
<a id='n5171' href='#n5171'>5171</a>
<a id='n5172' href='#n5172'>5172</a>
<a id='n5173' href='#n5173'>5173</a>
<a id='n5174' href='#n5174'>5174</a>
<a id='n5175' href='#n5175'>5175</a>
<a id='n5176' href='#n5176'>5176</a>
<a id='n5177' href='#n5177'>5177</a>
<a id='n5178' href='#n5178'>5178</a>
<a id='n5179' href='#n5179'>5179</a>
<a id='n5180' href='#n5180'>5180</a>
<a id='n5181' href='#n5181'>5181</a>
<a id='n5182' href='#n5182'>5182</a>
<a id='n5183' href='#n5183'>5183</a>
<a id='n5184' href='#n5184'>5184</a>
<a id='n5185' href='#n5185'>5185</a>
<a id='n5186' href='#n5186'>5186</a>
<a id='n5187' href='#n5187'>5187</a>
<a id='n5188' href='#n5188'>5188</a>
<a id='n5189' href='#n5189'>5189</a>
<a id='n5190' href='#n5190'>5190</a>
<a id='n5191' href='#n5191'>5191</a>
<a id='n5192' href='#n5192'>5192</a>
<a id='n5193' href='#n5193'>5193</a>
<a id='n5194' href='#n5194'>5194</a>
<a id='n5195' href='#n5195'>5195</a>
<a id='n5196' href='#n5196'>5196</a>
<a id='n5197' href='#n5197'>5197</a>
<a id='n5198' href='#n5198'>5198</a>
<a id='n5199' href='#n5199'>5199</a>
<a id='n5200' href='#n5200'>5200</a>
<a id='n5201' href='#n5201'>5201</a>
<a id='n5202' href='#n5202'>5202</a>
<a id='n5203' href='#n5203'>5203</a>
<a id='n5204' href='#n5204'>5204</a>
<a id='n5205' href='#n5205'>5205</a>
<a id='n5206' href='#n5206'>5206</a>
<a id='n5207' href='#n5207'>5207</a>
<a id='n5208' href='#n5208'>5208</a>
<a id='n5209' href='#n5209'>5209</a>
<a id='n5210' href='#n5210'>5210</a>
<a id='n5211' href='#n5211'>5211</a>
<a id='n5212' href='#n5212'>5212</a>
<a id='n5213' href='#n5213'>5213</a>
<a id='n5214' href='#n5214'>5214</a>
<a id='n5215' href='#n5215'>5215</a>
<a id='n5216' href='#n5216'>5216</a>
<a id='n5217' href='#n5217'>5217</a>
<a id='n5218' href='#n5218'>5218</a>
<a id='n5219' href='#n5219'>5219</a>
<a id='n5220' href='#n5220'>5220</a>
<a id='n5221' href='#n5221'>5221</a>
<a id='n5222' href='#n5222'>5222</a>
<a id='n5223' href='#n5223'>5223</a>
<a id='n5224' href='#n5224'>5224</a>
<a id='n5225' href='#n5225'>5225</a>
<a id='n5226' href='#n5226'>5226</a>
<a id='n5227' href='#n5227'>5227</a>
<a id='n5228' href='#n5228'>5228</a>
<a id='n5229' href='#n5229'>5229</a>
<a id='n5230' href='#n5230'>5230</a>
<a id='n5231' href='#n5231'>5231</a>
<a id='n5232' href='#n5232'>5232</a>
<a id='n5233' href='#n5233'>5233</a>
<a id='n5234' href='#n5234'>5234</a>
<a id='n5235' href='#n5235'>5235</a>
<a id='n5236' href='#n5236'>5236</a>
<a id='n5237' href='#n5237'>5237</a>
<a id='n5238' href='#n5238'>5238</a>
<a id='n5239' href='#n5239'>5239</a>
<a id='n5240' href='#n5240'>5240</a>
<a id='n5241' href='#n5241'>5241</a>
<a id='n5242' href='#n5242'>5242</a>
<a id='n5243' href='#n5243'>5243</a>
<a id='n5244' href='#n5244'>5244</a>
<a id='n5245' href='#n5245'>5245</a>
<a id='n5246' href='#n5246'>5246</a>
<a id='n5247' href='#n5247'>5247</a>
<a id='n5248' href='#n5248'>5248</a>
<a id='n5249' href='#n5249'>5249</a>
<a id='n5250' href='#n5250'>5250</a>
<a id='n5251' href='#n5251'>5251</a>
<a id='n5252' href='#n5252'>5252</a>
<a id='n5253' href='#n5253'>5253</a>
<a id='n5254' href='#n5254'>5254</a>
<a id='n5255' href='#n5255'>5255</a>
<a id='n5256' href='#n5256'>5256</a>
<a id='n5257' href='#n5257'>5257</a>
<a id='n5258' href='#n5258'>5258</a>
<a id='n5259' href='#n5259'>5259</a>
<a id='n5260' href='#n5260'>5260</a>
<a id='n5261' href='#n5261'>5261</a>
<a id='n5262' href='#n5262'>5262</a>
<a id='n5263' href='#n5263'>5263</a>
<a id='n5264' href='#n5264'>5264</a>
<a id='n5265' href='#n5265'>5265</a>
<a id='n5266' href='#n5266'>5266</a>
<a id='n5267' href='#n5267'>5267</a>
<a id='n5268' href='#n5268'>5268</a>
<a id='n5269' href='#n5269'>5269</a>
<a id='n5270' href='#n5270'>5270</a>
<a id='n5271' href='#n5271'>5271</a>
<a id='n5272' href='#n5272'>5272</a>
<a id='n5273' href='#n5273'>5273</a>
<a id='n5274' href='#n5274'>5274</a>
<a id='n5275' href='#n5275'>5275</a>
<a id='n5276' href='#n5276'>5276</a>
<a id='n5277' href='#n5277'>5277</a>
<a id='n5278' href='#n5278'>5278</a>
<a id='n5279' href='#n5279'>5279</a>
<a id='n5280' href='#n5280'>5280</a>
<a id='n5281' href='#n5281'>5281</a>
<a id='n5282' href='#n5282'>5282</a>
<a id='n5283' href='#n5283'>5283</a>
<a id='n5284' href='#n5284'>5284</a>
<a id='n5285' href='#n5285'>5285</a>
<a id='n5286' href='#n5286'>5286</a>
<a id='n5287' href='#n5287'>5287</a>
<a id='n5288' href='#n5288'>5288</a>
<a id='n5289' href='#n5289'>5289</a>
<a id='n5290' href='#n5290'>5290</a>
<a id='n5291' href='#n5291'>5291</a>
<a id='n5292' href='#n5292'>5292</a>
<a id='n5293' href='#n5293'>5293</a>
<a id='n5294' href='#n5294'>5294</a>
<a id='n5295' href='#n5295'>5295</a>
<a id='n5296' href='#n5296'>5296</a>
<a id='n5297' href='#n5297'>5297</a>
<a id='n5298' href='#n5298'>5298</a>
<a id='n5299' href='#n5299'>5299</a>
<a id='n5300' href='#n5300'>5300</a>
<a id='n5301' href='#n5301'>5301</a>
<a id='n5302' href='#n5302'>5302</a>
<a id='n5303' href='#n5303'>5303</a>
<a id='n5304' href='#n5304'>5304</a>
<a id='n5305' href='#n5305'>5305</a>
<a id='n5306' href='#n5306'>5306</a>
<a id='n5307' href='#n5307'>5307</a>
<a id='n5308' href='#n5308'>5308</a>
<a id='n5309' href='#n5309'>5309</a>
<a id='n5310' href='#n5310'>5310</a>
<a id='n5311' href='#n5311'>5311</a>
<a id='n5312' href='#n5312'>5312</a>
<a id='n5313' href='#n5313'>5313</a>
<a id='n5314' href='#n5314'>5314</a>
<a id='n5315' href='#n5315'>5315</a>
<a id='n5316' href='#n5316'>5316</a>
<a id='n5317' href='#n5317'>5317</a>
<a id='n5318' href='#n5318'>5318</a>
<a id='n5319' href='#n5319'>5319</a>
<a id='n5320' href='#n5320'>5320</a>
<a id='n5321' href='#n5321'>5321</a>
<a id='n5322' href='#n5322'>5322</a>
<a id='n5323' href='#n5323'>5323</a>
<a id='n5324' href='#n5324'>5324</a>
<a id='n5325' href='#n5325'>5325</a>
<a id='n5326' href='#n5326'>5326</a>
<a id='n5327' href='#n5327'>5327</a>
<a id='n5328' href='#n5328'>5328</a>
<a id='n5329' href='#n5329'>5329</a>
<a id='n5330' href='#n5330'>5330</a>
<a id='n5331' href='#n5331'>5331</a>
<a id='n5332' href='#n5332'>5332</a>
<a id='n5333' href='#n5333'>5333</a>
<a id='n5334' href='#n5334'>5334</a>
<a id='n5335' href='#n5335'>5335</a>
<a id='n5336' href='#n5336'>5336</a>
<a id='n5337' href='#n5337'>5337</a>
<a id='n5338' href='#n5338'>5338</a>
<a id='n5339' href='#n5339'>5339</a>
<a id='n5340' href='#n5340'>5340</a>
<a id='n5341' href='#n5341'>5341</a>
<a id='n5342' href='#n5342'>5342</a>
<a id='n5343' href='#n5343'>5343</a>
<a id='n5344' href='#n5344'>5344</a>
<a id='n5345' href='#n5345'>5345</a>
<a id='n5346' href='#n5346'>5346</a>
<a id='n5347' href='#n5347'>5347</a>
<a id='n5348' href='#n5348'>5348</a>
<a id='n5349' href='#n5349'>5349</a>
<a id='n5350' href='#n5350'>5350</a>
<a id='n5351' href='#n5351'>5351</a>
<a id='n5352' href='#n5352'>5352</a>
<a id='n5353' href='#n5353'>5353</a>
<a id='n5354' href='#n5354'>5354</a>
<a id='n5355' href='#n5355'>5355</a>
<a id='n5356' href='#n5356'>5356</a>
<a id='n5357' href='#n5357'>5357</a>
<a id='n5358' href='#n5358'>5358</a>
<a id='n5359' href='#n5359'>5359</a>
<a id='n5360' href='#n5360'>5360</a>
<a id='n5361' href='#n5361'>5361</a>
<a id='n5362' href='#n5362'>5362</a>
<a id='n5363' href='#n5363'>5363</a>
<a id='n5364' href='#n5364'>5364</a>
<a id='n5365' href='#n5365'>5365</a>
<a id='n5366' href='#n5366'>5366</a>
<a id='n5367' href='#n5367'>5367</a>
<a id='n5368' href='#n5368'>5368</a>
<a id='n5369' href='#n5369'>5369</a>
<a id='n5370' href='#n5370'>5370</a>
<a id='n5371' href='#n5371'>5371</a>
<a id='n5372' href='#n5372'>5372</a>
<a id='n5373' href='#n5373'>5373</a>
<a id='n5374' href='#n5374'>5374</a>
<a id='n5375' href='#n5375'>5375</a>
<a id='n5376' href='#n5376'>5376</a>
<a id='n5377' href='#n5377'>5377</a>
<a id='n5378' href='#n5378'>5378</a>
<a id='n5379' href='#n5379'>5379</a>
<a id='n5380' href='#n5380'>5380</a>
<a id='n5381' href='#n5381'>5381</a>
<a id='n5382' href='#n5382'>5382</a>
<a id='n5383' href='#n5383'>5383</a>
<a id='n5384' href='#n5384'>5384</a>
<a id='n5385' href='#n5385'>5385</a>
<a id='n5386' href='#n5386'>5386</a>
<a id='n5387' href='#n5387'>5387</a>
<a id='n5388' href='#n5388'>5388</a>
<a id='n5389' href='#n5389'>5389</a>
<a id='n5390' href='#n5390'>5390</a>
<a id='n5391' href='#n5391'>5391</a>
<a id='n5392' href='#n5392'>5392</a>
<a id='n5393' href='#n5393'>5393</a>
<a id='n5394' href='#n5394'>5394</a>
<a id='n5395' href='#n5395'>5395</a>
<a id='n5396' href='#n5396'>5396</a>
<a id='n5397' href='#n5397'>5397</a>
<a id='n5398' href='#n5398'>5398</a>
<a id='n5399' href='#n5399'>5399</a>
<a id='n5400' href='#n5400'>5400</a>
<a id='n5401' href='#n5401'>5401</a>
<a id='n5402' href='#n5402'>5402</a>
<a id='n5403' href='#n5403'>5403</a>
<a id='n5404' href='#n5404'>5404</a>
<a id='n5405' href='#n5405'>5405</a>
<a id='n5406' href='#n5406'>5406</a>
<a id='n5407' href='#n5407'>5407</a>
<a id='n5408' href='#n5408'>5408</a>
<a id='n5409' href='#n5409'>5409</a>
<a id='n5410' href='#n5410'>5410</a>
<a id='n5411' href='#n5411'>5411</a>
<a id='n5412' href='#n5412'>5412</a>
<a id='n5413' href='#n5413'>5413</a>
<a id='n5414' href='#n5414'>5414</a>
<a id='n5415' href='#n5415'>5415</a>
<a id='n5416' href='#n5416'>5416</a>
<a id='n5417' href='#n5417'>5417</a>
<a id='n5418' href='#n5418'>5418</a>
<a id='n5419' href='#n5419'>5419</a>
<a id='n5420' href='#n5420'>5420</a>
<a id='n5421' href='#n5421'>5421</a>
<a id='n5422' href='#n5422'>5422</a>
<a id='n5423' href='#n5423'>5423</a>
<a id='n5424' href='#n5424'>5424</a>
<a id='n5425' href='#n5425'>5425</a>
<a id='n5426' href='#n5426'>5426</a>
<a id='n5427' href='#n5427'>5427</a>
<a id='n5428' href='#n5428'>5428</a>
<a id='n5429' href='#n5429'>5429</a>
<a id='n5430' href='#n5430'>5430</a>
<a id='n5431' href='#n5431'>5431</a>
<a id='n5432' href='#n5432'>5432</a>
<a id='n5433' href='#n5433'>5433</a>
<a id='n5434' href='#n5434'>5434</a>
<a id='n5435' href='#n5435'>5435</a>
<a id='n5436' href='#n5436'>5436</a>
<a id='n5437' href='#n5437'>5437</a>
<a id='n5438' href='#n5438'>5438</a>
<a id='n5439' href='#n5439'>5439</a>
<a id='n5440' href='#n5440'>5440</a>
<a id='n5441' href='#n5441'>5441</a>
<a id='n5442' href='#n5442'>5442</a>
<a id='n5443' href='#n5443'>5443</a>
<a id='n5444' href='#n5444'>5444</a>
<a id='n5445' href='#n5445'>5445</a>
<a id='n5446' href='#n5446'>5446</a>
<a id='n5447' href='#n5447'>5447</a>
<a id='n5448' href='#n5448'>5448</a>
<a id='n5449' href='#n5449'>5449</a>
<a id='n5450' href='#n5450'>5450</a>
<a id='n5451' href='#n5451'>5451</a>
<a id='n5452' href='#n5452'>5452</a>
<a id='n5453' href='#n5453'>5453</a>
<a id='n5454' href='#n5454'>5454</a>
<a id='n5455' href='#n5455'>5455</a>
<a id='n5456' href='#n5456'>5456</a>
<a id='n5457' href='#n5457'>5457</a>
<a id='n5458' href='#n5458'>5458</a>
<a id='n5459' href='#n5459'>5459</a>
<a id='n5460' href='#n5460'>5460</a>
<a id='n5461' href='#n5461'>5461</a>
<a id='n5462' href='#n5462'>5462</a>
<a id='n5463' href='#n5463'>5463</a>
<a id='n5464' href='#n5464'>5464</a>
<a id='n5465' href='#n5465'>5465</a>
<a id='n5466' href='#n5466'>5466</a>
<a id='n5467' href='#n5467'>5467</a>
<a id='n5468' href='#n5468'>5468</a>
<a id='n5469' href='#n5469'>5469</a>
<a id='n5470' href='#n5470'>5470</a>
<a id='n5471' href='#n5471'>5471</a>
<a id='n5472' href='#n5472'>5472</a>
<a id='n5473' href='#n5473'>5473</a>
<a id='n5474' href='#n5474'>5474</a>
<a id='n5475' href='#n5475'>5475</a>
<a id='n5476' href='#n5476'>5476</a>
<a id='n5477' href='#n5477'>5477</a>
<a id='n5478' href='#n5478'>5478</a>
<a id='n5479' href='#n5479'>5479</a>
<a id='n5480' href='#n5480'>5480</a>
<a id='n5481' href='#n5481'>5481</a>
<a id='n5482' href='#n5482'>5482</a>
<a id='n5483' href='#n5483'>5483</a>
<a id='n5484' href='#n5484'>5484</a>
<a id='n5485' href='#n5485'>5485</a>
<a id='n5486' href='#n5486'>5486</a>
<a id='n5487' href='#n5487'>5487</a>
<a id='n5488' href='#n5488'>5488</a>
<a id='n5489' href='#n5489'>5489</a>
<a id='n5490' href='#n5490'>5490</a>
<a id='n5491' href='#n5491'>5491</a>
<a id='n5492' href='#n5492'>5492</a>
<a id='n5493' href='#n5493'>5493</a>
<a id='n5494' href='#n5494'>5494</a>
<a id='n5495' href='#n5495'>5495</a>
<a id='n5496' href='#n5496'>5496</a>
<a id='n5497' href='#n5497'>5497</a>
<a id='n5498' href='#n5498'>5498</a>
<a id='n5499' href='#n5499'>5499</a>
<a id='n5500' href='#n5500'>5500</a>
<a id='n5501' href='#n5501'>5501</a>
<a id='n5502' href='#n5502'>5502</a>
<a id='n5503' href='#n5503'>5503</a>
<a id='n5504' href='#n5504'>5504</a>
<a id='n5505' href='#n5505'>5505</a>
<a id='n5506' href='#n5506'>5506</a>
<a id='n5507' href='#n5507'>5507</a>
<a id='n5508' href='#n5508'>5508</a>
<a id='n5509' href='#n5509'>5509</a>
<a id='n5510' href='#n5510'>5510</a>
<a id='n5511' href='#n5511'>5511</a>
<a id='n5512' href='#n5512'>5512</a>
<a id='n5513' href='#n5513'>5513</a>
<a id='n5514' href='#n5514'>5514</a>
<a id='n5515' href='#n5515'>5515</a>
<a id='n5516' href='#n5516'>5516</a>
<a id='n5517' href='#n5517'>5517</a>
<a id='n5518' href='#n5518'>5518</a>
<a id='n5519' href='#n5519'>5519</a>
<a id='n5520' href='#n5520'>5520</a>
<a id='n5521' href='#n5521'>5521</a>
<a id='n5522' href='#n5522'>5522</a>
<a id='n5523' href='#n5523'>5523</a>
<a id='n5524' href='#n5524'>5524</a>
<a id='n5525' href='#n5525'>5525</a>
<a id='n5526' href='#n5526'>5526</a>
<a id='n5527' href='#n5527'>5527</a>
<a id='n5528' href='#n5528'>5528</a>
<a id='n5529' href='#n5529'>5529</a>
<a id='n5530' href='#n5530'>5530</a>
<a id='n5531' href='#n5531'>5531</a>
<a id='n5532' href='#n5532'>5532</a>
<a id='n5533' href='#n5533'>5533</a>
<a id='n5534' href='#n5534'>5534</a>
<a id='n5535' href='#n5535'>5535</a>
<a id='n5536' href='#n5536'>5536</a>
<a id='n5537' href='#n5537'>5537</a>
<a id='n5538' href='#n5538'>5538</a>
<a id='n5539' href='#n5539'>5539</a>
<a id='n5540' href='#n5540'>5540</a>
<a id='n5541' href='#n5541'>5541</a>
<a id='n5542' href='#n5542'>5542</a>
<a id='n5543' href='#n5543'>5543</a>
<a id='n5544' href='#n5544'>5544</a>
<a id='n5545' href='#n5545'>5545</a>
<a id='n5546' href='#n5546'>5546</a>
<a id='n5547' href='#n5547'>5547</a>
<a id='n5548' href='#n5548'>5548</a>
<a id='n5549' href='#n5549'>5549</a>
<a id='n5550' href='#n5550'>5550</a>
<a id='n5551' href='#n5551'>5551</a>
<a id='n5552' href='#n5552'>5552</a>
<a id='n5553' href='#n5553'>5553</a>
<a id='n5554' href='#n5554'>5554</a>
<a id='n5555' href='#n5555'>5555</a>
<a id='n5556' href='#n5556'>5556</a>
<a id='n5557' href='#n5557'>5557</a>
<a id='n5558' href='#n5558'>5558</a>
<a id='n5559' href='#n5559'>5559</a>
<a id='n5560' href='#n5560'>5560</a>
<a id='n5561' href='#n5561'>5561</a>
<a id='n5562' href='#n5562'>5562</a>
<a id='n5563' href='#n5563'>5563</a>
<a id='n5564' href='#n5564'>5564</a>
<a id='n5565' href='#n5565'>5565</a>
<a id='n5566' href='#n5566'>5566</a>
<a id='n5567' href='#n5567'>5567</a>
<a id='n5568' href='#n5568'>5568</a>
<a id='n5569' href='#n5569'>5569</a>
<a id='n5570' href='#n5570'>5570</a>
<a id='n5571' href='#n5571'>5571</a>
<a id='n5572' href='#n5572'>5572</a>
<a id='n5573' href='#n5573'>5573</a>
<a id='n5574' href='#n5574'>5574</a>
<a id='n5575' href='#n5575'>5575</a>
<a id='n5576' href='#n5576'>5576</a>
<a id='n5577' href='#n5577'>5577</a>
<a id='n5578' href='#n5578'>5578</a>
<a id='n5579' href='#n5579'>5579</a>
<a id='n5580' href='#n5580'>5580</a>
<a id='n5581' href='#n5581'>5581</a>
<a id='n5582' href='#n5582'>5582</a>
<a id='n5583' href='#n5583'>5583</a>
<a id='n5584' href='#n5584'>5584</a>
<a id='n5585' href='#n5585'>5585</a>
<a id='n5586' href='#n5586'>5586</a>
<a id='n5587' href='#n5587'>5587</a>
<a id='n5588' href='#n5588'>5588</a>
<a id='n5589' href='#n5589'>5589</a>
<a id='n5590' href='#n5590'>5590</a>
<a id='n5591' href='#n5591'>5591</a>
<a id='n5592' href='#n5592'>5592</a>
<a id='n5593' href='#n5593'>5593</a>
<a id='n5594' href='#n5594'>5594</a>
<a id='n5595' href='#n5595'>5595</a>
<a id='n5596' href='#n5596'>5596</a>
<a id='n5597' href='#n5597'>5597</a>
<a id='n5598' href='#n5598'>5598</a>
<a id='n5599' href='#n5599'>5599</a>
<a id='n5600' href='#n5600'>5600</a>
<a id='n5601' href='#n5601'>5601</a>
<a id='n5602' href='#n5602'>5602</a>
<a id='n5603' href='#n5603'>5603</a>
<a id='n5604' href='#n5604'>5604</a>
<a id='n5605' href='#n5605'>5605</a>
<a id='n5606' href='#n5606'>5606</a>
<a id='n5607' href='#n5607'>5607</a>
<a id='n5608' href='#n5608'>5608</a>
<a id='n5609' href='#n5609'>5609</a>
<a id='n5610' href='#n5610'>5610</a>
<a id='n5611' href='#n5611'>5611</a>
<a id='n5612' href='#n5612'>5612</a>
<a id='n5613' href='#n5613'>5613</a>
<a id='n5614' href='#n5614'>5614</a>
<a id='n5615' href='#n5615'>5615</a>
<a id='n5616' href='#n5616'>5616</a>
<a id='n5617' href='#n5617'>5617</a>
<a id='n5618' href='#n5618'>5618</a>
<a id='n5619' href='#n5619'>5619</a>
<a id='n5620' href='#n5620'>5620</a>
<a id='n5621' href='#n5621'>5621</a>
<a id='n5622' href='#n5622'>5622</a>
<a id='n5623' href='#n5623'>5623</a>
<a id='n5624' href='#n5624'>5624</a>
<a id='n5625' href='#n5625'>5625</a>
<a id='n5626' href='#n5626'>5626</a>
<a id='n5627' href='#n5627'>5627</a>
<a id='n5628' href='#n5628'>5628</a>
<a id='n5629' href='#n5629'>5629</a>
<a id='n5630' href='#n5630'>5630</a>
<a id='n5631' href='#n5631'>5631</a>
<a id='n5632' href='#n5632'>5632</a>
<a id='n5633' href='#n5633'>5633</a>
<a id='n5634' href='#n5634'>5634</a>
<a id='n5635' href='#n5635'>5635</a>
<a id='n5636' href='#n5636'>5636</a>
<a id='n5637' href='#n5637'>5637</a>
<a id='n5638' href='#n5638'>5638</a>
<a id='n5639' href='#n5639'>5639</a>
<a id='n5640' href='#n5640'>5640</a>
<a id='n5641' href='#n5641'>5641</a>
<a id='n5642' href='#n5642'>5642</a>
<a id='n5643' href='#n5643'>5643</a>
<a id='n5644' href='#n5644'>5644</a>
<a id='n5645' href='#n5645'>5645</a>
<a id='n5646' href='#n5646'>5646</a>
<a id='n5647' href='#n5647'>5647</a>
<a id='n5648' href='#n5648'>5648</a>
<a id='n5649' href='#n5649'>5649</a>
<a id='n5650' href='#n5650'>5650</a>
<a id='n5651' href='#n5651'>5651</a>
<a id='n5652' href='#n5652'>5652</a>
<a id='n5653' href='#n5653'>5653</a>
<a id='n5654' href='#n5654'>5654</a>
<a id='n5655' href='#n5655'>5655</a>
<a id='n5656' href='#n5656'>5656</a>
<a id='n5657' href='#n5657'>5657</a>
<a id='n5658' href='#n5658'>5658</a>
<a id='n5659' href='#n5659'>5659</a>
<a id='n5660' href='#n5660'>5660</a>
<a id='n5661' href='#n5661'>5661</a>
<a id='n5662' href='#n5662'>5662</a>
<a id='n5663' href='#n5663'>5663</a>
<a id='n5664' href='#n5664'>5664</a>
<a id='n5665' href='#n5665'>5665</a>
<a id='n5666' href='#n5666'>5666</a>
<a id='n5667' href='#n5667'>5667</a>
<a id='n5668' href='#n5668'>5668</a>
<a id='n5669' href='#n5669'>5669</a>
<a id='n5670' href='#n5670'>5670</a>
<a id='n5671' href='#n5671'>5671</a>
<a id='n5672' href='#n5672'>5672</a>
<a id='n5673' href='#n5673'>5673</a>
<a id='n5674' href='#n5674'>5674</a>
<a id='n5675' href='#n5675'>5675</a>
<a id='n5676' href='#n5676'>5676</a>
<a id='n5677' href='#n5677'>5677</a>
<a id='n5678' href='#n5678'>5678</a>
<a id='n5679' href='#n5679'>5679</a>
<a id='n5680' href='#n5680'>5680</a>
<a id='n5681' href='#n5681'>5681</a>
<a id='n5682' href='#n5682'>5682</a>
<a id='n5683' href='#n5683'>5683</a>
<a id='n5684' href='#n5684'>5684</a>
<a id='n5685' href='#n5685'>5685</a>
<a id='n5686' href='#n5686'>5686</a>
<a id='n5687' href='#n5687'>5687</a>
<a id='n5688' href='#n5688'>5688</a>
<a id='n5689' href='#n5689'>5689</a>
<a id='n5690' href='#n5690'>5690</a>
<a id='n5691' href='#n5691'>5691</a>
<a id='n5692' href='#n5692'>5692</a>
<a id='n5693' href='#n5693'>5693</a>
<a id='n5694' href='#n5694'>5694</a>
<a id='n5695' href='#n5695'>5695</a>
<a id='n5696' href='#n5696'>5696</a>
<a id='n5697' href='#n5697'>5697</a>
<a id='n5698' href='#n5698'>5698</a>
<a id='n5699' href='#n5699'>5699</a>
<a id='n5700' href='#n5700'>5700</a>
<a id='n5701' href='#n5701'>5701</a>
<a id='n5702' href='#n5702'>5702</a>
<a id='n5703' href='#n5703'>5703</a>
<a id='n5704' href='#n5704'>5704</a>
<a id='n5705' href='#n5705'>5705</a>
<a id='n5706' href='#n5706'>5706</a>
<a id='n5707' href='#n5707'>5707</a>
<a id='n5708' href='#n5708'>5708</a>
<a id='n5709' href='#n5709'>5709</a>
<a id='n5710' href='#n5710'>5710</a>
<a id='n5711' href='#n5711'>5711</a>
<a id='n5712' href='#n5712'>5712</a>
<a id='n5713' href='#n5713'>5713</a>
<a id='n5714' href='#n5714'>5714</a>
<a id='n5715' href='#n5715'>5715</a>
<a id='n5716' href='#n5716'>5716</a>
<a id='n5717' href='#n5717'>5717</a>
<a id='n5718' href='#n5718'>5718</a>
<a id='n5719' href='#n5719'>5719</a>
<a id='n5720' href='#n5720'>5720</a>
<a id='n5721' href='#n5721'>5721</a>
<a id='n5722' href='#n5722'>5722</a>
<a id='n5723' href='#n5723'>5723</a>
<a id='n5724' href='#n5724'>5724</a>
<a id='n5725' href='#n5725'>5725</a>
<a id='n5726' href='#n5726'>5726</a>
<a id='n5727' href='#n5727'>5727</a>
<a id='n5728' href='#n5728'>5728</a>
<a id='n5729' href='#n5729'>5729</a>
<a id='n5730' href='#n5730'>5730</a>
<a id='n5731' href='#n5731'>5731</a>
<a id='n5732' href='#n5732'>5732</a>
<a id='n5733' href='#n5733'>5733</a>
<a id='n5734' href='#n5734'>5734</a>
<a id='n5735' href='#n5735'>5735</a>
<a id='n5736' href='#n5736'>5736</a>
<a id='n5737' href='#n5737'>5737</a>
<a id='n5738' href='#n5738'>5738</a>
<a id='n5739' href='#n5739'>5739</a>
<a id='n5740' href='#n5740'>5740</a>
<a id='n5741' href='#n5741'>5741</a>
<a id='n5742' href='#n5742'>5742</a>
<a id='n5743' href='#n5743'>5743</a>
<a id='n5744' href='#n5744'>5744</a>
<a id='n5745' href='#n5745'>5745</a>
<a id='n5746' href='#n5746'>5746</a>
<a id='n5747' href='#n5747'>5747</a>
<a id='n5748' href='#n5748'>5748</a>
<a id='n5749' href='#n5749'>5749</a>
<a id='n5750' href='#n5750'>5750</a>
<a id='n5751' href='#n5751'>5751</a>
<a id='n5752' href='#n5752'>5752</a>
<a id='n5753' href='#n5753'>5753</a>
<a id='n5754' href='#n5754'>5754</a>
<a id='n5755' href='#n5755'>5755</a>
<a id='n5756' href='#n5756'>5756</a>
<a id='n5757' href='#n5757'>5757</a>
<a id='n5758' href='#n5758'>5758</a>
<a id='n5759' href='#n5759'>5759</a>
<a id='n5760' href='#n5760'>5760</a>
<a id='n5761' href='#n5761'>5761</a>
<a id='n5762' href='#n5762'>5762</a>
<a id='n5763' href='#n5763'>5763</a>
<a id='n5764' href='#n5764'>5764</a>
<a id='n5765' href='#n5765'>5765</a>
<a id='n5766' href='#n5766'>5766</a>
<a id='n5767' href='#n5767'>5767</a>
<a id='n5768' href='#n5768'>5768</a>
<a id='n5769' href='#n5769'>5769</a>
<a id='n5770' href='#n5770'>5770</a>
<a id='n5771' href='#n5771'>5771</a>
<a id='n5772' href='#n5772'>5772</a>
<a id='n5773' href='#n5773'>5773</a>
<a id='n5774' href='#n5774'>5774</a>
<a id='n5775' href='#n5775'>5775</a>
<a id='n5776' href='#n5776'>5776</a>
<a id='n5777' href='#n5777'>5777</a>
<a id='n5778' href='#n5778'>5778</a>
<a id='n5779' href='#n5779'>5779</a>
<a id='n5780' href='#n5780'>5780</a>
<a id='n5781' href='#n5781'>5781</a>
<a id='n5782' href='#n5782'>5782</a>
<a id='n5783' href='#n5783'>5783</a>
<a id='n5784' href='#n5784'>5784</a>
<a id='n5785' href='#n5785'>5785</a>
<a id='n5786' href='#n5786'>5786</a>
<a id='n5787' href='#n5787'>5787</a>
<a id='n5788' href='#n5788'>5788</a>
<a id='n5789' href='#n5789'>5789</a>
<a id='n5790' href='#n5790'>5790</a>
<a id='n5791' href='#n5791'>5791</a>
<a id='n5792' href='#n5792'>5792</a>
<a id='n5793' href='#n5793'>5793</a>
<a id='n5794' href='#n5794'>5794</a>
<a id='n5795' href='#n5795'>5795</a>
<a id='n5796' href='#n5796'>5796</a>
<a id='n5797' href='#n5797'>5797</a>
<a id='n5798' href='#n5798'>5798</a>
<a id='n5799' href='#n5799'>5799</a>
<a id='n5800' href='#n5800'>5800</a>
<a id='n5801' href='#n5801'>5801</a>
<a id='n5802' href='#n5802'>5802</a>
<a id='n5803' href='#n5803'>5803</a>
<a id='n5804' href='#n5804'>5804</a>
<a id='n5805' href='#n5805'>5805</a>
<a id='n5806' href='#n5806'>5806</a>
<a id='n5807' href='#n5807'>5807</a>
<a id='n5808' href='#n5808'>5808</a>
<a id='n5809' href='#n5809'>5809</a>
<a id='n5810' href='#n5810'>5810</a>
<a id='n5811' href='#n5811'>5811</a>
<a id='n5812' href='#n5812'>5812</a>
<a id='n5813' href='#n5813'>5813</a>
<a id='n5814' href='#n5814'>5814</a>
<a id='n5815' href='#n5815'>5815</a>
<a id='n5816' href='#n5816'>5816</a>
<a id='n5817' href='#n5817'>5817</a>
<a id='n5818' href='#n5818'>5818</a>
<a id='n5819' href='#n5819'>5819</a>
<a id='n5820' href='#n5820'>5820</a>
<a id='n5821' href='#n5821'>5821</a>
<a id='n5822' href='#n5822'>5822</a>
<a id='n5823' href='#n5823'>5823</a>
<a id='n5824' href='#n5824'>5824</a>
<a id='n5825' href='#n5825'>5825</a>
<a id='n5826' href='#n5826'>5826</a>
<a id='n5827' href='#n5827'>5827</a>
<a id='n5828' href='#n5828'>5828</a>
<a id='n5829' href='#n5829'>5829</a>
<a id='n5830' href='#n5830'>5830</a>
<a id='n5831' href='#n5831'>5831</a>
<a id='n5832' href='#n5832'>5832</a>
<a id='n5833' href='#n5833'>5833</a>
<a id='n5834' href='#n5834'>5834</a>
<a id='n5835' href='#n5835'>5835</a>
<a id='n5836' href='#n5836'>5836</a>
<a id='n5837' href='#n5837'>5837</a>
<a id='n5838' href='#n5838'>5838</a>
<a id='n5839' href='#n5839'>5839</a>
<a id='n5840' href='#n5840'>5840</a>
<a id='n5841' href='#n5841'>5841</a>
<a id='n5842' href='#n5842'>5842</a>
<a id='n5843' href='#n5843'>5843</a>
<a id='n5844' href='#n5844'>5844</a>
<a id='n5845' href='#n5845'>5845</a>
<a id='n5846' href='#n5846'>5846</a>
<a id='n5847' href='#n5847'>5847</a>
<a id='n5848' href='#n5848'>5848</a>
<a id='n5849' href='#n5849'>5849</a>
<a id='n5850' href='#n5850'>5850</a>
<a id='n5851' href='#n5851'>5851</a>
<a id='n5852' href='#n5852'>5852</a>
<a id='n5853' href='#n5853'>5853</a>
<a id='n5854' href='#n5854'>5854</a>
<a id='n5855' href='#n5855'>5855</a>
<a id='n5856' href='#n5856'>5856</a>
<a id='n5857' href='#n5857'>5857</a>
<a id='n5858' href='#n5858'>5858</a>
<a id='n5859' href='#n5859'>5859</a>
<a id='n5860' href='#n5860'>5860</a>
<a id='n5861' href='#n5861'>5861</a>
<a id='n5862' href='#n5862'>5862</a>
<a id='n5863' href='#n5863'>5863</a>
<a id='n5864' href='#n5864'>5864</a>
<a id='n5865' href='#n5865'>5865</a>
<a id='n5866' href='#n5866'>5866</a>
<a id='n5867' href='#n5867'>5867</a>
<a id='n5868' href='#n5868'>5868</a>
<a id='n5869' href='#n5869'>5869</a>
<a id='n5870' href='#n5870'>5870</a>
<a id='n5871' href='#n5871'>5871</a>
<a id='n5872' href='#n5872'>5872</a>
<a id='n5873' href='#n5873'>5873</a>
<a id='n5874' href='#n5874'>5874</a>
<a id='n5875' href='#n5875'>5875</a>
<a id='n5876' href='#n5876'>5876</a>
<a id='n5877' href='#n5877'>5877</a>
<a id='n5878' href='#n5878'>5878</a>
<a id='n5879' href='#n5879'>5879</a>
<a id='n5880' href='#n5880'>5880</a>
<a id='n5881' href='#n5881'>5881</a>
<a id='n5882' href='#n5882'>5882</a>
<a id='n5883' href='#n5883'>5883</a>
<a id='n5884' href='#n5884'>5884</a>
<a id='n5885' href='#n5885'>5885</a>
<a id='n5886' href='#n5886'>5886</a>
<a id='n5887' href='#n5887'>5887</a>
<a id='n5888' href='#n5888'>5888</a>
<a id='n5889' href='#n5889'>5889</a>
<a id='n5890' href='#n5890'>5890</a>
<a id='n5891' href='#n5891'>5891</a>
<a id='n5892' href='#n5892'>5892</a>
<a id='n5893' href='#n5893'>5893</a>
<a id='n5894' href='#n5894'>5894</a>
<a id='n5895' href='#n5895'>5895</a>
<a id='n5896' href='#n5896'>5896</a>
<a id='n5897' href='#n5897'>5897</a>
<a id='n5898' href='#n5898'>5898</a>
<a id='n5899' href='#n5899'>5899</a>
<a id='n5900' href='#n5900'>5900</a>
<a id='n5901' href='#n5901'>5901</a>
<a id='n5902' href='#n5902'>5902</a>
<a id='n5903' href='#n5903'>5903</a>
<a id='n5904' href='#n5904'>5904</a>
<a id='n5905' href='#n5905'>5905</a>
<a id='n5906' href='#n5906'>5906</a>
<a id='n5907' href='#n5907'>5907</a>
<a id='n5908' href='#n5908'>5908</a>
<a id='n5909' href='#n5909'>5909</a>
<a id='n5910' href='#n5910'>5910</a>
<a id='n5911' href='#n5911'>5911</a>
<a id='n5912' href='#n5912'>5912</a>
<a id='n5913' href='#n5913'>5913</a>
<a id='n5914' href='#n5914'>5914</a>
<a id='n5915' href='#n5915'>5915</a>
<a id='n5916' href='#n5916'>5916</a>
<a id='n5917' href='#n5917'>5917</a>
<a id='n5918' href='#n5918'>5918</a>
<a id='n5919' href='#n5919'>5919</a>
<a id='n5920' href='#n5920'>5920</a>
<a id='n5921' href='#n5921'>5921</a>
<a id='n5922' href='#n5922'>5922</a>
<a id='n5923' href='#n5923'>5923</a>
<a id='n5924' href='#n5924'>5924</a>
<a id='n5925' href='#n5925'>5925</a>
<a id='n5926' href='#n5926'>5926</a>
<a id='n5927' href='#n5927'>5927</a>
<a id='n5928' href='#n5928'>5928</a>
<a id='n5929' href='#n5929'>5929</a>
<a id='n5930' href='#n5930'>5930</a>
<a id='n5931' href='#n5931'>5931</a>
<a id='n5932' href='#n5932'>5932</a>
<a id='n5933' href='#n5933'>5933</a>
<a id='n5934' href='#n5934'>5934</a>
<a id='n5935' href='#n5935'>5935</a>
<a id='n5936' href='#n5936'>5936</a>
<a id='n5937' href='#n5937'>5937</a>
<a id='n5938' href='#n5938'>5938</a>
<a id='n5939' href='#n5939'>5939</a>
<a id='n5940' href='#n5940'>5940</a>
<a id='n5941' href='#n5941'>5941</a>
<a id='n5942' href='#n5942'>5942</a>
<a id='n5943' href='#n5943'>5943</a>
<a id='n5944' href='#n5944'>5944</a>
<a id='n5945' href='#n5945'>5945</a>
<a id='n5946' href='#n5946'>5946</a>
<a id='n5947' href='#n5947'>5947</a>
<a id='n5948' href='#n5948'>5948</a>
<a id='n5949' href='#n5949'>5949</a>
<a id='n5950' href='#n5950'>5950</a>
<a id='n5951' href='#n5951'>5951</a>
<a id='n5952' href='#n5952'>5952</a>
<a id='n5953' href='#n5953'>5953</a>
<a id='n5954' href='#n5954'>5954</a>
<a id='n5955' href='#n5955'>5955</a>
<a id='n5956' href='#n5956'>5956</a>
<a id='n5957' href='#n5957'>5957</a>
<a id='n5958' href='#n5958'>5958</a>
<a id='n5959' href='#n5959'>5959</a>
<a id='n5960' href='#n5960'>5960</a>
<a id='n5961' href='#n5961'>5961</a>
<a id='n5962' href='#n5962'>5962</a>
<a id='n5963' href='#n5963'>5963</a>
<a id='n5964' href='#n5964'>5964</a>
<a id='n5965' href='#n5965'>5965</a>
<a id='n5966' href='#n5966'>5966</a>
<a id='n5967' href='#n5967'>5967</a>
<a id='n5968' href='#n5968'>5968</a>
<a id='n5969' href='#n5969'>5969</a>
<a id='n5970' href='#n5970'>5970</a>
<a id='n5971' href='#n5971'>5971</a>
<a id='n5972' href='#n5972'>5972</a>
<a id='n5973' href='#n5973'>5973</a>
<a id='n5974' href='#n5974'>5974</a>
<a id='n5975' href='#n5975'>5975</a>
<a id='n5976' href='#n5976'>5976</a>
<a id='n5977' href='#n5977'>5977</a>
<a id='n5978' href='#n5978'>5978</a>
<a id='n5979' href='#n5979'>5979</a>
<a id='n5980' href='#n5980'>5980</a>
<a id='n5981' href='#n5981'>5981</a>
<a id='n5982' href='#n5982'>5982</a>
<a id='n5983' href='#n5983'>5983</a>
<a id='n5984' href='#n5984'>5984</a>
<a id='n5985' href='#n5985'>5985</a>
<a id='n5986' href='#n5986'>5986</a>
<a id='n5987' href='#n5987'>5987</a>
<a id='n5988' href='#n5988'>5988</a>
<a id='n5989' href='#n5989'>5989</a>
<a id='n5990' href='#n5990'>5990</a>
<a id='n5991' href='#n5991'>5991</a>
<a id='n5992' href='#n5992'>5992</a>
<a id='n5993' href='#n5993'>5993</a>
<a id='n5994' href='#n5994'>5994</a>
<a id='n5995' href='#n5995'>5995</a>
<a id='n5996' href='#n5996'>5996</a>
<a id='n5997' href='#n5997'>5997</a>
<a id='n5998' href='#n5998'>5998</a>
<a id='n5999' href='#n5999'>5999</a>
<a id='n6000' href='#n6000'>6000</a>
<a id='n6001' href='#n6001'>6001</a>
<a id='n6002' href='#n6002'>6002</a>
<a id='n6003' href='#n6003'>6003</a>
<a id='n6004' href='#n6004'>6004</a>
<a id='n6005' href='#n6005'>6005</a>
<a id='n6006' href='#n6006'>6006</a>
<a id='n6007' href='#n6007'>6007</a>
<a id='n6008' href='#n6008'>6008</a>
<a id='n6009' href='#n6009'>6009</a>
<a id='n6010' href='#n6010'>6010</a>
<a id='n6011' href='#n6011'>6011</a>
<a id='n6012' href='#n6012'>6012</a>
<a id='n6013' href='#n6013'>6013</a>
<a id='n6014' href='#n6014'>6014</a>
<a id='n6015' href='#n6015'>6015</a>
<a id='n6016' href='#n6016'>6016</a>
<a id='n6017' href='#n6017'>6017</a>
<a id='n6018' href='#n6018'>6018</a>
<a id='n6019' href='#n6019'>6019</a>
<a id='n6020' href='#n6020'>6020</a>
<a id='n6021' href='#n6021'>6021</a>
<a id='n6022' href='#n6022'>6022</a>
<a id='n6023' href='#n6023'>6023</a>
<a id='n6024' href='#n6024'>6024</a>
<a id='n6025' href='#n6025'>6025</a>
<a id='n6026' href='#n6026'>6026</a>
<a id='n6027' href='#n6027'>6027</a>
<a id='n6028' href='#n6028'>6028</a>
<a id='n6029' href='#n6029'>6029</a>
<a id='n6030' href='#n6030'>6030</a>
<a id='n6031' href='#n6031'>6031</a>
<a id='n6032' href='#n6032'>6032</a>
<a id='n6033' href='#n6033'>6033</a>
<a id='n6034' href='#n6034'>6034</a>
<a id='n6035' href='#n6035'>6035</a>
<a id='n6036' href='#n6036'>6036</a>
<a id='n6037' href='#n6037'>6037</a>
<a id='n6038' href='#n6038'>6038</a>
<a id='n6039' href='#n6039'>6039</a>
<a id='n6040' href='#n6040'>6040</a>
<a id='n6041' href='#n6041'>6041</a>
<a id='n6042' href='#n6042'>6042</a>
<a id='n6043' href='#n6043'>6043</a>
<a id='n6044' href='#n6044'>6044</a>
<a id='n6045' href='#n6045'>6045</a>
<a id='n6046' href='#n6046'>6046</a>
<a id='n6047' href='#n6047'>6047</a>
<a id='n6048' href='#n6048'>6048</a>
<a id='n6049' href='#n6049'>6049</a>
<a id='n6050' href='#n6050'>6050</a>
<a id='n6051' href='#n6051'>6051</a>
<a id='n6052' href='#n6052'>6052</a>
<a id='n6053' href='#n6053'>6053</a>
<a id='n6054' href='#n6054'>6054</a>
<a id='n6055' href='#n6055'>6055</a>
<a id='n6056' href='#n6056'>6056</a>
<a id='n6057' href='#n6057'>6057</a>
<a id='n6058' href='#n6058'>6058</a>
<a id='n6059' href='#n6059'>6059</a>
<a id='n6060' href='#n6060'>6060</a>
<a id='n6061' href='#n6061'>6061</a>
<a id='n6062' href='#n6062'>6062</a>
<a id='n6063' href='#n6063'>6063</a>
<a id='n6064' href='#n6064'>6064</a>
<a id='n6065' href='#n6065'>6065</a>
<a id='n6066' href='#n6066'>6066</a>
<a id='n6067' href='#n6067'>6067</a>
<a id='n6068' href='#n6068'>6068</a>
<a id='n6069' href='#n6069'>6069</a>
<a id='n6070' href='#n6070'>6070</a>
<a id='n6071' href='#n6071'>6071</a>
<a id='n6072' href='#n6072'>6072</a>
<a id='n6073' href='#n6073'>6073</a>
<a id='n6074' href='#n6074'>6074</a>
<a id='n6075' href='#n6075'>6075</a>
<a id='n6076' href='#n6076'>6076</a>
<a id='n6077' href='#n6077'>6077</a>
<a id='n6078' href='#n6078'>6078</a>
<a id='n6079' href='#n6079'>6079</a>
<a id='n6080' href='#n6080'>6080</a>
<a id='n6081' href='#n6081'>6081</a>
<a id='n6082' href='#n6082'>6082</a>
<a id='n6083' href='#n6083'>6083</a>
<a id='n6084' href='#n6084'>6084</a>
<a id='n6085' href='#n6085'>6085</a>
<a id='n6086' href='#n6086'>6086</a>
<a id='n6087' href='#n6087'>6087</a>
<a id='n6088' href='#n6088'>6088</a>
<a id='n6089' href='#n6089'>6089</a>
<a id='n6090' href='#n6090'>6090</a>
<a id='n6091' href='#n6091'>6091</a>
<a id='n6092' href='#n6092'>6092</a>
<a id='n6093' href='#n6093'>6093</a>
<a id='n6094' href='#n6094'>6094</a>
<a id='n6095' href='#n6095'>6095</a>
<a id='n6096' href='#n6096'>6096</a>
<a id='n6097' href='#n6097'>6097</a>
<a id='n6098' href='#n6098'>6098</a>
<a id='n6099' href='#n6099'>6099</a>
<a id='n6100' href='#n6100'>6100</a>
<a id='n6101' href='#n6101'>6101</a>
<a id='n6102' href='#n6102'>6102</a>
<a id='n6103' href='#n6103'>6103</a>
<a id='n6104' href='#n6104'>6104</a>
<a id='n6105' href='#n6105'>6105</a>
<a id='n6106' href='#n6106'>6106</a>
<a id='n6107' href='#n6107'>6107</a>
<a id='n6108' href='#n6108'>6108</a>
<a id='n6109' href='#n6109'>6109</a>
<a id='n6110' href='#n6110'>6110</a>
<a id='n6111' href='#n6111'>6111</a>
<a id='n6112' href='#n6112'>6112</a>
<a id='n6113' href='#n6113'>6113</a>
<a id='n6114' href='#n6114'>6114</a>
<a id='n6115' href='#n6115'>6115</a>
<a id='n6116' href='#n6116'>6116</a>
<a id='n6117' href='#n6117'>6117</a>
<a id='n6118' href='#n6118'>6118</a>
<a id='n6119' href='#n6119'>6119</a>
<a id='n6120' href='#n6120'>6120</a>
<a id='n6121' href='#n6121'>6121</a>
<a id='n6122' href='#n6122'>6122</a>
<a id='n6123' href='#n6123'>6123</a>
<a id='n6124' href='#n6124'>6124</a>
<a id='n6125' href='#n6125'>6125</a>
<a id='n6126' href='#n6126'>6126</a>
<a id='n6127' href='#n6127'>6127</a>
<a id='n6128' href='#n6128'>6128</a>
<a id='n6129' href='#n6129'>6129</a>
<a id='n6130' href='#n6130'>6130</a>
<a id='n6131' href='#n6131'>6131</a>
<a id='n6132' href='#n6132'>6132</a>
<a id='n6133' href='#n6133'>6133</a>
<a id='n6134' href='#n6134'>6134</a>
<a id='n6135' href='#n6135'>6135</a>
<a id='n6136' href='#n6136'>6136</a>
<a id='n6137' href='#n6137'>6137</a>
<a id='n6138' href='#n6138'>6138</a>
<a id='n6139' href='#n6139'>6139</a>
<a id='n6140' href='#n6140'>6140</a>
<a id='n6141' href='#n6141'>6141</a>
<a id='n6142' href='#n6142'>6142</a>
<a id='n6143' href='#n6143'>6143</a>
<a id='n6144' href='#n6144'>6144</a>
<a id='n6145' href='#n6145'>6145</a>
<a id='n6146' href='#n6146'>6146</a>
<a id='n6147' href='#n6147'>6147</a>
<a id='n6148' href='#n6148'>6148</a>
<a id='n6149' href='#n6149'>6149</a>
<a id='n6150' href='#n6150'>6150</a>
<a id='n6151' href='#n6151'>6151</a>
<a id='n6152' href='#n6152'>6152</a>
<a id='n6153' href='#n6153'>6153</a>
<a id='n6154' href='#n6154'>6154</a>
<a id='n6155' href='#n6155'>6155</a>
<a id='n6156' href='#n6156'>6156</a>
<a id='n6157' href='#n6157'>6157</a>
<a id='n6158' href='#n6158'>6158</a>
<a id='n6159' href='#n6159'>6159</a>
<a id='n6160' href='#n6160'>6160</a>
<a id='n6161' href='#n6161'>6161</a>
<a id='n6162' href='#n6162'>6162</a>
<a id='n6163' href='#n6163'>6163</a>
<a id='n6164' href='#n6164'>6164</a>
<a id='n6165' href='#n6165'>6165</a>
<a id='n6166' href='#n6166'>6166</a>
<a id='n6167' href='#n6167'>6167</a>
<a id='n6168' href='#n6168'>6168</a>
<a id='n6169' href='#n6169'>6169</a>
<a id='n6170' href='#n6170'>6170</a>
<a id='n6171' href='#n6171'>6171</a>
<a id='n6172' href='#n6172'>6172</a>
<a id='n6173' href='#n6173'>6173</a>
<a id='n6174' href='#n6174'>6174</a>
<a id='n6175' href='#n6175'>6175</a>
<a id='n6176' href='#n6176'>6176</a>
<a id='n6177' href='#n6177'>6177</a>
<a id='n6178' href='#n6178'>6178</a>
<a id='n6179' href='#n6179'>6179</a>
<a id='n6180' href='#n6180'>6180</a>
<a id='n6181' href='#n6181'>6181</a>
<a id='n6182' href='#n6182'>6182</a>
<a id='n6183' href='#n6183'>6183</a>
<a id='n6184' href='#n6184'>6184</a>
<a id='n6185' href='#n6185'>6185</a>
<a id='n6186' href='#n6186'>6186</a>
<a id='n6187' href='#n6187'>6187</a>
<a id='n6188' href='#n6188'>6188</a>
<a id='n6189' href='#n6189'>6189</a>
<a id='n6190' href='#n6190'>6190</a>
<a id='n6191' href='#n6191'>6191</a>
<a id='n6192' href='#n6192'>6192</a>
<a id='n6193' href='#n6193'>6193</a>
<a id='n6194' href='#n6194'>6194</a>
<a id='n6195' href='#n6195'>6195</a>
<a id='n6196' href='#n6196'>6196</a>
<a id='n6197' href='#n6197'>6197</a>
<a id='n6198' href='#n6198'>6198</a>
<a id='n6199' href='#n6199'>6199</a>
<a id='n6200' href='#n6200'>6200</a>
<a id='n6201' href='#n6201'>6201</a>
<a id='n6202' href='#n6202'>6202</a>
<a id='n6203' href='#n6203'>6203</a>
<a id='n6204' href='#n6204'>6204</a>
<a id='n6205' href='#n6205'>6205</a>
<a id='n6206' href='#n6206'>6206</a>
<a id='n6207' href='#n6207'>6207</a>
<a id='n6208' href='#n6208'>6208</a>
<a id='n6209' href='#n6209'>6209</a>
<a id='n6210' href='#n6210'>6210</a>
<a id='n6211' href='#n6211'>6211</a>
<a id='n6212' href='#n6212'>6212</a>
<a id='n6213' href='#n6213'>6213</a>
<a id='n6214' href='#n6214'>6214</a>
<a id='n6215' href='#n6215'>6215</a>
<a id='n6216' href='#n6216'>6216</a>
<a id='n6217' href='#n6217'>6217</a>
<a id='n6218' href='#n6218'>6218</a>
<a id='n6219' href='#n6219'>6219</a>
<a id='n6220' href='#n6220'>6220</a>
<a id='n6221' href='#n6221'>6221</a>
<a id='n6222' href='#n6222'>6222</a>
<a id='n6223' href='#n6223'>6223</a>
<a id='n6224' href='#n6224'>6224</a>
<a id='n6225' href='#n6225'>6225</a>
<a id='n6226' href='#n6226'>6226</a>
<a id='n6227' href='#n6227'>6227</a>
<a id='n6228' href='#n6228'>6228</a>
<a id='n6229' href='#n6229'>6229</a>
<a id='n6230' href='#n6230'>6230</a>
<a id='n6231' href='#n6231'>6231</a>
<a id='n6232' href='#n6232'>6232</a>
<a id='n6233' href='#n6233'>6233</a>
<a id='n6234' href='#n6234'>6234</a>
<a id='n6235' href='#n6235'>6235</a>
<a id='n6236' href='#n6236'>6236</a>
<a id='n6237' href='#n6237'>6237</a>
<a id='n6238' href='#n6238'>6238</a>
<a id='n6239' href='#n6239'>6239</a>
<a id='n6240' href='#n6240'>6240</a>
<a id='n6241' href='#n6241'>6241</a>
<a id='n6242' href='#n6242'>6242</a>
<a id='n6243' href='#n6243'>6243</a>
<a id='n6244' href='#n6244'>6244</a>
<a id='n6245' href='#n6245'>6245</a>
<a id='n6246' href='#n6246'>6246</a>
<a id='n6247' href='#n6247'>6247</a>
<a id='n6248' href='#n6248'>6248</a>
<a id='n6249' href='#n6249'>6249</a>
<a id='n6250' href='#n6250'>6250</a>
<a id='n6251' href='#n6251'>6251</a>
<a id='n6252' href='#n6252'>6252</a>
<a id='n6253' href='#n6253'>6253</a>
<a id='n6254' href='#n6254'>6254</a>
<a id='n6255' href='#n6255'>6255</a>
<a id='n6256' href='#n6256'>6256</a>
<a id='n6257' href='#n6257'>6257</a>
<a id='n6258' href='#n6258'>6258</a>
<a id='n6259' href='#n6259'>6259</a>
<a id='n6260' href='#n6260'>6260</a>
<a id='n6261' href='#n6261'>6261</a>
<a id='n6262' href='#n6262'>6262</a>
<a id='n6263' href='#n6263'>6263</a>
<a id='n6264' href='#n6264'>6264</a>
<a id='n6265' href='#n6265'>6265</a>
<a id='n6266' href='#n6266'>6266</a>
<a id='n6267' href='#n6267'>6267</a>
<a id='n6268' href='#n6268'>6268</a>
<a id='n6269' href='#n6269'>6269</a>
<a id='n6270' href='#n6270'>6270</a>
<a id='n6271' href='#n6271'>6271</a>
<a id='n6272' href='#n6272'>6272</a>
<a id='n6273' href='#n6273'>6273</a>
<a id='n6274' href='#n6274'>6274</a>
<a id='n6275' href='#n6275'>6275</a>
<a id='n6276' href='#n6276'>6276</a>
<a id='n6277' href='#n6277'>6277</a>
<a id='n6278' href='#n6278'>6278</a>
<a id='n6279' href='#n6279'>6279</a>
<a id='n6280' href='#n6280'>6280</a>
<a id='n6281' href='#n6281'>6281</a>
<a id='n6282' href='#n6282'>6282</a>
<a id='n6283' href='#n6283'>6283</a>
<a id='n6284' href='#n6284'>6284</a>
<a id='n6285' href='#n6285'>6285</a>
<a id='n6286' href='#n6286'>6286</a>
<a id='n6287' href='#n6287'>6287</a>
<a id='n6288' href='#n6288'>6288</a>
<a id='n6289' href='#n6289'>6289</a>
<a id='n6290' href='#n6290'>6290</a>
<a id='n6291' href='#n6291'>6291</a>
<a id='n6292' href='#n6292'>6292</a>
<a id='n6293' href='#n6293'>6293</a>
<a id='n6294' href='#n6294'>6294</a>
<a id='n6295' href='#n6295'>6295</a>
<a id='n6296' href='#n6296'>6296</a>
<a id='n6297' href='#n6297'>6297</a>
<a id='n6298' href='#n6298'>6298</a>
<a id='n6299' href='#n6299'>6299</a>
<a id='n6300' href='#n6300'>6300</a>
<a id='n6301' href='#n6301'>6301</a>
<a id='n6302' href='#n6302'>6302</a>
<a id='n6303' href='#n6303'>6303</a>
<a id='n6304' href='#n6304'>6304</a>
<a id='n6305' href='#n6305'>6305</a>
<a id='n6306' href='#n6306'>6306</a>
<a id='n6307' href='#n6307'>6307</a>
<a id='n6308' href='#n6308'>6308</a>
<a id='n6309' href='#n6309'>6309</a>
<a id='n6310' href='#n6310'>6310</a>
<a id='n6311' href='#n6311'>6311</a>
<a id='n6312' href='#n6312'>6312</a>
<a id='n6313' href='#n6313'>6313</a>
<a id='n6314' href='#n6314'>6314</a>
<a id='n6315' href='#n6315'>6315</a>
<a id='n6316' href='#n6316'>6316</a>
<a id='n6317' href='#n6317'>6317</a>
<a id='n6318' href='#n6318'>6318</a>
<a id='n6319' href='#n6319'>6319</a>
<a id='n6320' href='#n6320'>6320</a>
<a id='n6321' href='#n6321'>6321</a>
<a id='n6322' href='#n6322'>6322</a>
<a id='n6323' href='#n6323'>6323</a>
<a id='n6324' href='#n6324'>6324</a>
<a id='n6325' href='#n6325'>6325</a>
<a id='n6326' href='#n6326'>6326</a>
<a id='n6327' href='#n6327'>6327</a>
<a id='n6328' href='#n6328'>6328</a>
<a id='n6329' href='#n6329'>6329</a>
<a id='n6330' href='#n6330'>6330</a>
<a id='n6331' href='#n6331'>6331</a>
<a id='n6332' href='#n6332'>6332</a>
<a id='n6333' href='#n6333'>6333</a>
<a id='n6334' href='#n6334'>6334</a>
<a id='n6335' href='#n6335'>6335</a>
<a id='n6336' href='#n6336'>6336</a>
<a id='n6337' href='#n6337'>6337</a>
<a id='n6338' href='#n6338'>6338</a>
<a id='n6339' href='#n6339'>6339</a>
<a id='n6340' href='#n6340'>6340</a>
<a id='n6341' href='#n6341'>6341</a>
<a id='n6342' href='#n6342'>6342</a>
<a id='n6343' href='#n6343'>6343</a>
<a id='n6344' href='#n6344'>6344</a>
<a id='n6345' href='#n6345'>6345</a>
<a id='n6346' href='#n6346'>6346</a>
<a id='n6347' href='#n6347'>6347</a>
<a id='n6348' href='#n6348'>6348</a>
<a id='n6349' href='#n6349'>6349</a>
<a id='n6350' href='#n6350'>6350</a>
<a id='n6351' href='#n6351'>6351</a>
<a id='n6352' href='#n6352'>6352</a>
<a id='n6353' href='#n6353'>6353</a>
<a id='n6354' href='#n6354'>6354</a>
<a id='n6355' href='#n6355'>6355</a>
<a id='n6356' href='#n6356'>6356</a>
<a id='n6357' href='#n6357'>6357</a>
<a id='n6358' href='#n6358'>6358</a>
<a id='n6359' href='#n6359'>6359</a>
<a id='n6360' href='#n6360'>6360</a>
<a id='n6361' href='#n6361'>6361</a>
<a id='n6362' href='#n6362'>6362</a>
<a id='n6363' href='#n6363'>6363</a>
<a id='n6364' href='#n6364'>6364</a>
<a id='n6365' href='#n6365'>6365</a>
<a id='n6366' href='#n6366'>6366</a>
<a id='n6367' href='#n6367'>6367</a>
<a id='n6368' href='#n6368'>6368</a>
<a id='n6369' href='#n6369'>6369</a>
<a id='n6370' href='#n6370'>6370</a>
<a id='n6371' href='#n6371'>6371</a>
<a id='n6372' href='#n6372'>6372</a>
<a id='n6373' href='#n6373'>6373</a>
<a id='n6374' href='#n6374'>6374</a>
<a id='n6375' href='#n6375'>6375</a>
<a id='n6376' href='#n6376'>6376</a>
<a id='n6377' href='#n6377'>6377</a>
<a id='n6378' href='#n6378'>6378</a>
<a id='n6379' href='#n6379'>6379</a>
<a id='n6380' href='#n6380'>6380</a>
<a id='n6381' href='#n6381'>6381</a>
<a id='n6382' href='#n6382'>6382</a>
<a id='n6383' href='#n6383'>6383</a>
<a id='n6384' href='#n6384'>6384</a>
<a id='n6385' href='#n6385'>6385</a>
<a id='n6386' href='#n6386'>6386</a>
<a id='n6387' href='#n6387'>6387</a>
<a id='n6388' href='#n6388'>6388</a>
<a id='n6389' href='#n6389'>6389</a>
<a id='n6390' href='#n6390'>6390</a>
<a id='n6391' href='#n6391'>6391</a>
<a id='n6392' href='#n6392'>6392</a>
<a id='n6393' href='#n6393'>6393</a>
<a id='n6394' href='#n6394'>6394</a>
<a id='n6395' href='#n6395'>6395</a>
<a id='n6396' href='#n6396'>6396</a>
<a id='n6397' href='#n6397'>6397</a>
<a id='n6398' href='#n6398'>6398</a>
<a id='n6399' href='#n6399'>6399</a>
<a id='n6400' href='#n6400'>6400</a>
<a id='n6401' href='#n6401'>6401</a>
<a id='n6402' href='#n6402'>6402</a>
<a id='n6403' href='#n6403'>6403</a>
<a id='n6404' href='#n6404'>6404</a>
<a id='n6405' href='#n6405'>6405</a>
<a id='n6406' href='#n6406'>6406</a>
<a id='n6407' href='#n6407'>6407</a>
<a id='n6408' href='#n6408'>6408</a>
<a id='n6409' href='#n6409'>6409</a>
<a id='n6410' href='#n6410'>6410</a>
<a id='n6411' href='#n6411'>6411</a>
<a id='n6412' href='#n6412'>6412</a>
<a id='n6413' href='#n6413'>6413</a>
<a id='n6414' href='#n6414'>6414</a>
<a id='n6415' href='#n6415'>6415</a>
<a id='n6416' href='#n6416'>6416</a>
<a id='n6417' href='#n6417'>6417</a>
<a id='n6418' href='#n6418'>6418</a>
<a id='n6419' href='#n6419'>6419</a>
<a id='n6420' href='#n6420'>6420</a>
<a id='n6421' href='#n6421'>6421</a>
<a id='n6422' href='#n6422'>6422</a>
<a id='n6423' href='#n6423'>6423</a>
<a id='n6424' href='#n6424'>6424</a>
<a id='n6425' href='#n6425'>6425</a>
<a id='n6426' href='#n6426'>6426</a>
<a id='n6427' href='#n6427'>6427</a>
<a id='n6428' href='#n6428'>6428</a>
<a id='n6429' href='#n6429'>6429</a>
<a id='n6430' href='#n6430'>6430</a>
<a id='n6431' href='#n6431'>6431</a>
<a id='n6432' href='#n6432'>6432</a>
<a id='n6433' href='#n6433'>6433</a>
<a id='n6434' href='#n6434'>6434</a>
<a id='n6435' href='#n6435'>6435</a>
<a id='n6436' href='#n6436'>6436</a>
<a id='n6437' href='#n6437'>6437</a>
<a id='n6438' href='#n6438'>6438</a>
<a id='n6439' href='#n6439'>6439</a>
<a id='n6440' href='#n6440'>6440</a>
<a id='n6441' href='#n6441'>6441</a>
<a id='n6442' href='#n6442'>6442</a>
<a id='n6443' href='#n6443'>6443</a>
<a id='n6444' href='#n6444'>6444</a>
<a id='n6445' href='#n6445'>6445</a>
<a id='n6446' href='#n6446'>6446</a>
<a id='n6447' href='#n6447'>6447</a>
<a id='n6448' href='#n6448'>6448</a>
<a id='n6449' href='#n6449'>6449</a>
<a id='n6450' href='#n6450'>6450</a>
<a id='n6451' href='#n6451'>6451</a>
<a id='n6452' href='#n6452'>6452</a>
<a id='n6453' href='#n6453'>6453</a>
<a id='n6454' href='#n6454'>6454</a>
<a id='n6455' href='#n6455'>6455</a>
<a id='n6456' href='#n6456'>6456</a>
<a id='n6457' href='#n6457'>6457</a>
<a id='n6458' href='#n6458'>6458</a>
<a id='n6459' href='#n6459'>6459</a>
<a id='n6460' href='#n6460'>6460</a>
<a id='n6461' href='#n6461'>6461</a>
<a id='n6462' href='#n6462'>6462</a>
<a id='n6463' href='#n6463'>6463</a>
<a id='n6464' href='#n6464'>6464</a>
<a id='n6465' href='#n6465'>6465</a>
<a id='n6466' href='#n6466'>6466</a>
<a id='n6467' href='#n6467'>6467</a>
<a id='n6468' href='#n6468'>6468</a>
<a id='n6469' href='#n6469'>6469</a>
<a id='n6470' href='#n6470'>6470</a>
<a id='n6471' href='#n6471'>6471</a>
<a id='n6472' href='#n6472'>6472</a>
<a id='n6473' href='#n6473'>6473</a>
<a id='n6474' href='#n6474'>6474</a>
<a id='n6475' href='#n6475'>6475</a>
<a id='n6476' href='#n6476'>6476</a>
<a id='n6477' href='#n6477'>6477</a>
<a id='n6478' href='#n6478'>6478</a>
<a id='n6479' href='#n6479'>6479</a>
<a id='n6480' href='#n6480'>6480</a>
<a id='n6481' href='#n6481'>6481</a>
<a id='n6482' href='#n6482'>6482</a>
<a id='n6483' href='#n6483'>6483</a>
<a id='n6484' href='#n6484'>6484</a>
<a id='n6485' href='#n6485'>6485</a>
<a id='n6486' href='#n6486'>6486</a>
<a id='n6487' href='#n6487'>6487</a>
<a id='n6488' href='#n6488'>6488</a>
<a id='n6489' href='#n6489'>6489</a>
<a id='n6490' href='#n6490'>6490</a>
<a id='n6491' href='#n6491'>6491</a>
<a id='n6492' href='#n6492'>6492</a>
<a id='n6493' href='#n6493'>6493</a>
<a id='n6494' href='#n6494'>6494</a>
<a id='n6495' href='#n6495'>6495</a>
<a id='n6496' href='#n6496'>6496</a>
<a id='n6497' href='#n6497'>6497</a>
<a id='n6498' href='#n6498'>6498</a>
<a id='n6499' href='#n6499'>6499</a>
<a id='n6500' href='#n6500'>6500</a>
<a id='n6501' href='#n6501'>6501</a>
<a id='n6502' href='#n6502'>6502</a>
<a id='n6503' href='#n6503'>6503</a>
<a id='n6504' href='#n6504'>6504</a>
<a id='n6505' href='#n6505'>6505</a>
<a id='n6506' href='#n6506'>6506</a>
<a id='n6507' href='#n6507'>6507</a>
<a id='n6508' href='#n6508'>6508</a>
<a id='n6509' href='#n6509'>6509</a>
<a id='n6510' href='#n6510'>6510</a>
<a id='n6511' href='#n6511'>6511</a>
<a id='n6512' href='#n6512'>6512</a>
<a id='n6513' href='#n6513'>6513</a>
<a id='n6514' href='#n6514'>6514</a>
<a id='n6515' href='#n6515'>6515</a>
<a id='n6516' href='#n6516'>6516</a>
<a id='n6517' href='#n6517'>6517</a>
<a id='n6518' href='#n6518'>6518</a>
<a id='n6519' href='#n6519'>6519</a>
<a id='n6520' href='#n6520'>6520</a>
<a id='n6521' href='#n6521'>6521</a>
<a id='n6522' href='#n6522'>6522</a>
<a id='n6523' href='#n6523'>6523</a>
<a id='n6524' href='#n6524'>6524</a>
<a id='n6525' href='#n6525'>6525</a>
<a id='n6526' href='#n6526'>6526</a>
<a id='n6527' href='#n6527'>6527</a>
<a id='n6528' href='#n6528'>6528</a>
<a id='n6529' href='#n6529'>6529</a>
<a id='n6530' href='#n6530'>6530</a>
<a id='n6531' href='#n6531'>6531</a>
<a id='n6532' href='#n6532'>6532</a>
<a id='n6533' href='#n6533'>6533</a>
<a id='n6534' href='#n6534'>6534</a>
<a id='n6535' href='#n6535'>6535</a>
<a id='n6536' href='#n6536'>6536</a>
<a id='n6537' href='#n6537'>6537</a>
<a id='n6538' href='#n6538'>6538</a>
<a id='n6539' href='#n6539'>6539</a>
<a id='n6540' href='#n6540'>6540</a>
<a id='n6541' href='#n6541'>6541</a>
<a id='n6542' href='#n6542'>6542</a>
<a id='n6543' href='#n6543'>6543</a>
<a id='n6544' href='#n6544'>6544</a>
<a id='n6545' href='#n6545'>6545</a>
<a id='n6546' href='#n6546'>6546</a>
<a id='n6547' href='#n6547'>6547</a>
<a id='n6548' href='#n6548'>6548</a>
<a id='n6549' href='#n6549'>6549</a>
<a id='n6550' href='#n6550'>6550</a>
<a id='n6551' href='#n6551'>6551</a>
<a id='n6552' href='#n6552'>6552</a>
<a id='n6553' href='#n6553'>6553</a>
<a id='n6554' href='#n6554'>6554</a>
<a id='n6555' href='#n6555'>6555</a>
<a id='n6556' href='#n6556'>6556</a>
<a id='n6557' href='#n6557'>6557</a>
<a id='n6558' href='#n6558'>6558</a>
<a id='n6559' href='#n6559'>6559</a>
<a id='n6560' href='#n6560'>6560</a>
<a id='n6561' href='#n6561'>6561</a>
<a id='n6562' href='#n6562'>6562</a>
<a id='n6563' href='#n6563'>6563</a>
<a id='n6564' href='#n6564'>6564</a>
<a id='n6565' href='#n6565'>6565</a>
<a id='n6566' href='#n6566'>6566</a>
<a id='n6567' href='#n6567'>6567</a>
<a id='n6568' href='#n6568'>6568</a>
<a id='n6569' href='#n6569'>6569</a>
<a id='n6570' href='#n6570'>6570</a>
<a id='n6571' href='#n6571'>6571</a>
<a id='n6572' href='#n6572'>6572</a>
<a id='n6573' href='#n6573'>6573</a>
<a id='n6574' href='#n6574'>6574</a>
<a id='n6575' href='#n6575'>6575</a>
<a id='n6576' href='#n6576'>6576</a>
<a id='n6577' href='#n6577'>6577</a>
<a id='n6578' href='#n6578'>6578</a>
<a id='n6579' href='#n6579'>6579</a>
<a id='n6580' href='#n6580'>6580</a>
<a id='n6581' href='#n6581'>6581</a>
<a id='n6582' href='#n6582'>6582</a>
<a id='n6583' href='#n6583'>6583</a>
<a id='n6584' href='#n6584'>6584</a>
<a id='n6585' href='#n6585'>6585</a>
<a id='n6586' href='#n6586'>6586</a>
<a id='n6587' href='#n6587'>6587</a>
<a id='n6588' href='#n6588'>6588</a>
<a id='n6589' href='#n6589'>6589</a>
<a id='n6590' href='#n6590'>6590</a>
<a id='n6591' href='#n6591'>6591</a>
<a id='n6592' href='#n6592'>6592</a>
<a id='n6593' href='#n6593'>6593</a>
<a id='n6594' href='#n6594'>6594</a>
<a id='n6595' href='#n6595'>6595</a>
<a id='n6596' href='#n6596'>6596</a>
<a id='n6597' href='#n6597'>6597</a>
<a id='n6598' href='#n6598'>6598</a>
<a id='n6599' href='#n6599'>6599</a>
<a id='n6600' href='#n6600'>6600</a>
<a id='n6601' href='#n6601'>6601</a>
<a id='n6602' href='#n6602'>6602</a>
<a id='n6603' href='#n6603'>6603</a>
<a id='n6604' href='#n6604'>6604</a>
<a id='n6605' href='#n6605'>6605</a>
<a id='n6606' href='#n6606'>6606</a>
<a id='n6607' href='#n6607'>6607</a>
<a id='n6608' href='#n6608'>6608</a>
<a id='n6609' href='#n6609'>6609</a>
<a id='n6610' href='#n6610'>6610</a>
<a id='n6611' href='#n6611'>6611</a>
<a id='n6612' href='#n6612'>6612</a>
<a id='n6613' href='#n6613'>6613</a>
<a id='n6614' href='#n6614'>6614</a>
<a id='n6615' href='#n6615'>6615</a>
<a id='n6616' href='#n6616'>6616</a>
<a id='n6617' href='#n6617'>6617</a>
<a id='n6618' href='#n6618'>6618</a>
<a id='n6619' href='#n6619'>6619</a>
<a id='n6620' href='#n6620'>6620</a>
<a id='n6621' href='#n6621'>6621</a>
<a id='n6622' href='#n6622'>6622</a>
<a id='n6623' href='#n6623'>6623</a>
<a id='n6624' href='#n6624'>6624</a>
<a id='n6625' href='#n6625'>6625</a>
<a id='n6626' href='#n6626'>6626</a>
<a id='n6627' href='#n6627'>6627</a>
<a id='n6628' href='#n6628'>6628</a>
<a id='n6629' href='#n6629'>6629</a>
<a id='n6630' href='#n6630'>6630</a>
<a id='n6631' href='#n6631'>6631</a>
<a id='n6632' href='#n6632'>6632</a>
<a id='n6633' href='#n6633'>6633</a>
<a id='n6634' href='#n6634'>6634</a>
<a id='n6635' href='#n6635'>6635</a>
<a id='n6636' href='#n6636'>6636</a>
<a id='n6637' href='#n6637'>6637</a>
<a id='n6638' href='#n6638'>6638</a>
<a id='n6639' href='#n6639'>6639</a>
<a id='n6640' href='#n6640'>6640</a>
<a id='n6641' href='#n6641'>6641</a>
<a id='n6642' href='#n6642'>6642</a>
<a id='n6643' href='#n6643'>6643</a>
<a id='n6644' href='#n6644'>6644</a>
<a id='n6645' href='#n6645'>6645</a>
<a id='n6646' href='#n6646'>6646</a>
<a id='n6647' href='#n6647'>6647</a>
<a id='n6648' href='#n6648'>6648</a>
<a id='n6649' href='#n6649'>6649</a>
<a id='n6650' href='#n6650'>6650</a>
<a id='n6651' href='#n6651'>6651</a>
<a id='n6652' href='#n6652'>6652</a>
<a id='n6653' href='#n6653'>6653</a>
<a id='n6654' href='#n6654'>6654</a>
<a id='n6655' href='#n6655'>6655</a>
<a id='n6656' href='#n6656'>6656</a>
<a id='n6657' href='#n6657'>6657</a>
<a id='n6658' href='#n6658'>6658</a>
<a id='n6659' href='#n6659'>6659</a>
<a id='n6660' href='#n6660'>6660</a>
<a id='n6661' href='#n6661'>6661</a>
<a id='n6662' href='#n6662'>6662</a>
<a id='n6663' href='#n6663'>6663</a>
<a id='n6664' href='#n6664'>6664</a>
<a id='n6665' href='#n6665'>6665</a>
<a id='n6666' href='#n6666'>6666</a>
<a id='n6667' href='#n6667'>6667</a>
<a id='n6668' href='#n6668'>6668</a>
<a id='n6669' href='#n6669'>6669</a>
<a id='n6670' href='#n6670'>6670</a>
<a id='n6671' href='#n6671'>6671</a>
<a id='n6672' href='#n6672'>6672</a>
<a id='n6673' href='#n6673'>6673</a>
<a id='n6674' href='#n6674'>6674</a>
<a id='n6675' href='#n6675'>6675</a>
<a id='n6676' href='#n6676'>6676</a>
<a id='n6677' href='#n6677'>6677</a>
<a id='n6678' href='#n6678'>6678</a>
<a id='n6679' href='#n6679'>6679</a>
<a id='n6680' href='#n6680'>6680</a>
<a id='n6681' href='#n6681'>6681</a>
<a id='n6682' href='#n6682'>6682</a>
<a id='n6683' href='#n6683'>6683</a>
<a id='n6684' href='#n6684'>6684</a>
<a id='n6685' href='#n6685'>6685</a>
<a id='n6686' href='#n6686'>6686</a>
<a id='n6687' href='#n6687'>6687</a>
<a id='n6688' href='#n6688'>6688</a>
<a id='n6689' href='#n6689'>6689</a>
<a id='n6690' href='#n6690'>6690</a>
<a id='n6691' href='#n6691'>6691</a>
<a id='n6692' href='#n6692'>6692</a>
<a id='n6693' href='#n6693'>6693</a>
<a id='n6694' href='#n6694'>6694</a>
<a id='n6695' href='#n6695'>6695</a>
<a id='n6696' href='#n6696'>6696</a>
<a id='n6697' href='#n6697'>6697</a>
<a id='n6698' href='#n6698'>6698</a>
<a id='n6699' href='#n6699'>6699</a>
<a id='n6700' href='#n6700'>6700</a>
<a id='n6701' href='#n6701'>6701</a>
<a id='n6702' href='#n6702'>6702</a>
<a id='n6703' href='#n6703'>6703</a>
<a id='n6704' href='#n6704'>6704</a>
<a id='n6705' href='#n6705'>6705</a>
<a id='n6706' href='#n6706'>6706</a>
<a id='n6707' href='#n6707'>6707</a>
<a id='n6708' href='#n6708'>6708</a>
<a id='n6709' href='#n6709'>6709</a>
<a id='n6710' href='#n6710'>6710</a>
<a id='n6711' href='#n6711'>6711</a>
<a id='n6712' href='#n6712'>6712</a>
<a id='n6713' href='#n6713'>6713</a>
<a id='n6714' href='#n6714'>6714</a>
<a id='n6715' href='#n6715'>6715</a>
<a id='n6716' href='#n6716'>6716</a>
<a id='n6717' href='#n6717'>6717</a>
<a id='n6718' href='#n6718'>6718</a>
<a id='n6719' href='#n6719'>6719</a>
<a id='n6720' href='#n6720'>6720</a>
<a id='n6721' href='#n6721'>6721</a>
<a id='n6722' href='#n6722'>6722</a>
<a id='n6723' href='#n6723'>6723</a>
<a id='n6724' href='#n6724'>6724</a>
<a id='n6725' href='#n6725'>6725</a>
<a id='n6726' href='#n6726'>6726</a>
<a id='n6727' href='#n6727'>6727</a>
<a id='n6728' href='#n6728'>6728</a>
<a id='n6729' href='#n6729'>6729</a>
<a id='n6730' href='#n6730'>6730</a>
<a id='n6731' href='#n6731'>6731</a>
<a id='n6732' href='#n6732'>6732</a>
<a id='n6733' href='#n6733'>6733</a>
<a id='n6734' href='#n6734'>6734</a>
<a id='n6735' href='#n6735'>6735</a>
<a id='n6736' href='#n6736'>6736</a>
<a id='n6737' href='#n6737'>6737</a>
<a id='n6738' href='#n6738'>6738</a>
<a id='n6739' href='#n6739'>6739</a>
<a id='n6740' href='#n6740'>6740</a>
<a id='n6741' href='#n6741'>6741</a>
<a id='n6742' href='#n6742'>6742</a>
<a id='n6743' href='#n6743'>6743</a>
<a id='n6744' href='#n6744'>6744</a>
<a id='n6745' href='#n6745'>6745</a>
<a id='n6746' href='#n6746'>6746</a>
<a id='n6747' href='#n6747'>6747</a>
<a id='n6748' href='#n6748'>6748</a>
<a id='n6749' href='#n6749'>6749</a>
<a id='n6750' href='#n6750'>6750</a>
<a id='n6751' href='#n6751'>6751</a>
<a id='n6752' href='#n6752'>6752</a>
<a id='n6753' href='#n6753'>6753</a>
<a id='n6754' href='#n6754'>6754</a>
<a id='n6755' href='#n6755'>6755</a>
<a id='n6756' href='#n6756'>6756</a>
<a id='n6757' href='#n6757'>6757</a>
<a id='n6758' href='#n6758'>6758</a>
<a id='n6759' href='#n6759'>6759</a>
<a id='n6760' href='#n6760'>6760</a>
<a id='n6761' href='#n6761'>6761</a>
<a id='n6762' href='#n6762'>6762</a>
<a id='n6763' href='#n6763'>6763</a>
<a id='n6764' href='#n6764'>6764</a>
<a id='n6765' href='#n6765'>6765</a>
<a id='n6766' href='#n6766'>6766</a>
<a id='n6767' href='#n6767'>6767</a>
<a id='n6768' href='#n6768'>6768</a>
<a id='n6769' href='#n6769'>6769</a>
<a id='n6770' href='#n6770'>6770</a>
<a id='n6771' href='#n6771'>6771</a>
<a id='n6772' href='#n6772'>6772</a>
<a id='n6773' href='#n6773'>6773</a>
<a id='n6774' href='#n6774'>6774</a>
<a id='n6775' href='#n6775'>6775</a>
<a id='n6776' href='#n6776'>6776</a>
<a id='n6777' href='#n6777'>6777</a>
<a id='n6778' href='#n6778'>6778</a>
<a id='n6779' href='#n6779'>6779</a>
<a id='n6780' href='#n6780'>6780</a>
<a id='n6781' href='#n6781'>6781</a>
<a id='n6782' href='#n6782'>6782</a>
<a id='n6783' href='#n6783'>6783</a>
<a id='n6784' href='#n6784'>6784</a>
<a id='n6785' href='#n6785'>6785</a>
<a id='n6786' href='#n6786'>6786</a>
<a id='n6787' href='#n6787'>6787</a>
<a id='n6788' href='#n6788'>6788</a>
<a id='n6789' href='#n6789'>6789</a>
<a id='n6790' href='#n6790'>6790</a>
<a id='n6791' href='#n6791'>6791</a>
<a id='n6792' href='#n6792'>6792</a>
<a id='n6793' href='#n6793'>6793</a>
<a id='n6794' href='#n6794'>6794</a>
<a id='n6795' href='#n6795'>6795</a>
<a id='n6796' href='#n6796'>6796</a>
<a id='n6797' href='#n6797'>6797</a>
<a id='n6798' href='#n6798'>6798</a>
<a id='n6799' href='#n6799'>6799</a>
<a id='n6800' href='#n6800'>6800</a>
<a id='n6801' href='#n6801'>6801</a>
<a id='n6802' href='#n6802'>6802</a>
<a id='n6803' href='#n6803'>6803</a>
<a id='n6804' href='#n6804'>6804</a>
<a id='n6805' href='#n6805'>6805</a>
<a id='n6806' href='#n6806'>6806</a>
<a id='n6807' href='#n6807'>6807</a>
<a id='n6808' href='#n6808'>6808</a>
<a id='n6809' href='#n6809'>6809</a>
<a id='n6810' href='#n6810'>6810</a>
<a id='n6811' href='#n6811'>6811</a>
<a id='n6812' href='#n6812'>6812</a>
<a id='n6813' href='#n6813'>6813</a>
<a id='n6814' href='#n6814'>6814</a>
<a id='n6815' href='#n6815'>6815</a>
<a id='n6816' href='#n6816'>6816</a>
<a id='n6817' href='#n6817'>6817</a>
<a id='n6818' href='#n6818'>6818</a>
<a id='n6819' href='#n6819'>6819</a>
<a id='n6820' href='#n6820'>6820</a>
<a id='n6821' href='#n6821'>6821</a>
<a id='n6822' href='#n6822'>6822</a>
<a id='n6823' href='#n6823'>6823</a>
<a id='n6824' href='#n6824'>6824</a>
<a id='n6825' href='#n6825'>6825</a>
<a id='n6826' href='#n6826'>6826</a>
<a id='n6827' href='#n6827'>6827</a>
<a id='n6828' href='#n6828'>6828</a>
<a id='n6829' href='#n6829'>6829</a>
<a id='n6830' href='#n6830'>6830</a>
<a id='n6831' href='#n6831'>6831</a>
<a id='n6832' href='#n6832'>6832</a>
<a id='n6833' href='#n6833'>6833</a>
<a id='n6834' href='#n6834'>6834</a>
<a id='n6835' href='#n6835'>6835</a>
<a id='n6836' href='#n6836'>6836</a>
<a id='n6837' href='#n6837'>6837</a>
<a id='n6838' href='#n6838'>6838</a>
<a id='n6839' href='#n6839'>6839</a>
<a id='n6840' href='#n6840'>6840</a>
<a id='n6841' href='#n6841'>6841</a>
<a id='n6842' href='#n6842'>6842</a>
<a id='n6843' href='#n6843'>6843</a>
<a id='n6844' href='#n6844'>6844</a>
<a id='n6845' href='#n6845'>6845</a>
<a id='n6846' href='#n6846'>6846</a>
<a id='n6847' href='#n6847'>6847</a>
<a id='n6848' href='#n6848'>6848</a>
<a id='n6849' href='#n6849'>6849</a>
<a id='n6850' href='#n6850'>6850</a>
<a id='n6851' href='#n6851'>6851</a>
<a id='n6852' href='#n6852'>6852</a>
<a id='n6853' href='#n6853'>6853</a>
<a id='n6854' href='#n6854'>6854</a>
<a id='n6855' href='#n6855'>6855</a>
<a id='n6856' href='#n6856'>6856</a>
<a id='n6857' href='#n6857'>6857</a>
<a id='n6858' href='#n6858'>6858</a>
<a id='n6859' href='#n6859'>6859</a>
<a id='n6860' href='#n6860'>6860</a>
<a id='n6861' href='#n6861'>6861</a>
<a id='n6862' href='#n6862'>6862</a>
<a id='n6863' href='#n6863'>6863</a>
<a id='n6864' href='#n6864'>6864</a>
<a id='n6865' href='#n6865'>6865</a>
<a id='n6866' href='#n6866'>6866</a>
<a id='n6867' href='#n6867'>6867</a>
<a id='n6868' href='#n6868'>6868</a>
<a id='n6869' href='#n6869'>6869</a>
<a id='n6870' href='#n6870'>6870</a>
<a id='n6871' href='#n6871'>6871</a>
<a id='n6872' href='#n6872'>6872</a>
<a id='n6873' href='#n6873'>6873</a>
<a id='n6874' href='#n6874'>6874</a>
<a id='n6875' href='#n6875'>6875</a>
<a id='n6876' href='#n6876'>6876</a>
<a id='n6877' href='#n6877'>6877</a>
<a id='n6878' href='#n6878'>6878</a>
<a id='n6879' href='#n6879'>6879</a>
<a id='n6880' href='#n6880'>6880</a>
<a id='n6881' href='#n6881'>6881</a>
<a id='n6882' href='#n6882'>6882</a>
<a id='n6883' href='#n6883'>6883</a>
<a id='n6884' href='#n6884'>6884</a>
<a id='n6885' href='#n6885'>6885</a>
<a id='n6886' href='#n6886'>6886</a>
<a id='n6887' href='#n6887'>6887</a>
<a id='n6888' href='#n6888'>6888</a>
<a id='n6889' href='#n6889'>6889</a>
<a id='n6890' href='#n6890'>6890</a>
<a id='n6891' href='#n6891'>6891</a>
<a id='n6892' href='#n6892'>6892</a>
<a id='n6893' href='#n6893'>6893</a>
<a id='n6894' href='#n6894'>6894</a>
<a id='n6895' href='#n6895'>6895</a>
<a id='n6896' href='#n6896'>6896</a>
<a id='n6897' href='#n6897'>6897</a>
<a id='n6898' href='#n6898'>6898</a>
<a id='n6899' href='#n6899'>6899</a>
<a id='n6900' href='#n6900'>6900</a>
<a id='n6901' href='#n6901'>6901</a>
<a id='n6902' href='#n6902'>6902</a>
<a id='n6903' href='#n6903'>6903</a>
<a id='n6904' href='#n6904'>6904</a>
<a id='n6905' href='#n6905'>6905</a>
<a id='n6906' href='#n6906'>6906</a>
<a id='n6907' href='#n6907'>6907</a>
<a id='n6908' href='#n6908'>6908</a>
<a id='n6909' href='#n6909'>6909</a>
<a id='n6910' href='#n6910'>6910</a>
<a id='n6911' href='#n6911'>6911</a>
<a id='n6912' href='#n6912'>6912</a>
<a id='n6913' href='#n6913'>6913</a>
<a id='n6914' href='#n6914'>6914</a>
<a id='n6915' href='#n6915'>6915</a>
<a id='n6916' href='#n6916'>6916</a>
<a id='n6917' href='#n6917'>6917</a>
<a id='n6918' href='#n6918'>6918</a>
<a id='n6919' href='#n6919'>6919</a>
<a id='n6920' href='#n6920'>6920</a>
<a id='n6921' href='#n6921'>6921</a>
<a id='n6922' href='#n6922'>6922</a>
<a id='n6923' href='#n6923'>6923</a>
<a id='n6924' href='#n6924'>6924</a>
<a id='n6925' href='#n6925'>6925</a>
<a id='n6926' href='#n6926'>6926</a>
<a id='n6927' href='#n6927'>6927</a>
<a id='n6928' href='#n6928'>6928</a>
<a id='n6929' href='#n6929'>6929</a>
<a id='n6930' href='#n6930'>6930</a>
<a id='n6931' href='#n6931'>6931</a>
<a id='n6932' href='#n6932'>6932</a>
<a id='n6933' href='#n6933'>6933</a>
<a id='n6934' href='#n6934'>6934</a>
<a id='n6935' href='#n6935'>6935</a>
<a id='n6936' href='#n6936'>6936</a>
<a id='n6937' href='#n6937'>6937</a>
<a id='n6938' href='#n6938'>6938</a>
<a id='n6939' href='#n6939'>6939</a>
<a id='n6940' href='#n6940'>6940</a>
<a id='n6941' href='#n6941'>6941</a>
<a id='n6942' href='#n6942'>6942</a>
<a id='n6943' href='#n6943'>6943</a>
<a id='n6944' href='#n6944'>6944</a>
<a id='n6945' href='#n6945'>6945</a>
<a id='n6946' href='#n6946'>6946</a>
<a id='n6947' href='#n6947'>6947</a>
<a id='n6948' href='#n6948'>6948</a>
<a id='n6949' href='#n6949'>6949</a>
<a id='n6950' href='#n6950'>6950</a>
<a id='n6951' href='#n6951'>6951</a>
<a id='n6952' href='#n6952'>6952</a>
<a id='n6953' href='#n6953'>6953</a>
<a id='n6954' href='#n6954'>6954</a>
<a id='n6955' href='#n6955'>6955</a>
<a id='n6956' href='#n6956'>6956</a>
<a id='n6957' href='#n6957'>6957</a>
<a id='n6958' href='#n6958'>6958</a>
<a id='n6959' href='#n6959'>6959</a>
<a id='n6960' href='#n6960'>6960</a>
<a id='n6961' href='#n6961'>6961</a>
<a id='n6962' href='#n6962'>6962</a>
<a id='n6963' href='#n6963'>6963</a>
<a id='n6964' href='#n6964'>6964</a>
<a id='n6965' href='#n6965'>6965</a>
<a id='n6966' href='#n6966'>6966</a>
<a id='n6967' href='#n6967'>6967</a>
<a id='n6968' href='#n6968'>6968</a>
<a id='n6969' href='#n6969'>6969</a>
<a id='n6970' href='#n6970'>6970</a>
<a id='n6971' href='#n6971'>6971</a>
<a id='n6972' href='#n6972'>6972</a>
<a id='n6973' href='#n6973'>6973</a>
<a id='n6974' href='#n6974'>6974</a>
<a id='n6975' href='#n6975'>6975</a>
<a id='n6976' href='#n6976'>6976</a>
<a id='n6977' href='#n6977'>6977</a>
<a id='n6978' href='#n6978'>6978</a>
<a id='n6979' href='#n6979'>6979</a>
<a id='n6980' href='#n6980'>6980</a>
<a id='n6981' href='#n6981'>6981</a>
<a id='n6982' href='#n6982'>6982</a>
<a id='n6983' href='#n6983'>6983</a>
<a id='n6984' href='#n6984'>6984</a>
<a id='n6985' href='#n6985'>6985</a>
<a id='n6986' href='#n6986'>6986</a>
<a id='n6987' href='#n6987'>6987</a>
<a id='n6988' href='#n6988'>6988</a>
<a id='n6989' href='#n6989'>6989</a>
<a id='n6990' href='#n6990'>6990</a>
<a id='n6991' href='#n6991'>6991</a>
<a id='n6992' href='#n6992'>6992</a>
<a id='n6993' href='#n6993'>6993</a>
<a id='n6994' href='#n6994'>6994</a>
<a id='n6995' href='#n6995'>6995</a>
<a id='n6996' href='#n6996'>6996</a>
<a id='n6997' href='#n6997'>6997</a>
<a id='n6998' href='#n6998'>6998</a>
<a id='n6999' href='#n6999'>6999</a>
<a id='n7000' href='#n7000'>7000</a>
<a id='n7001' href='#n7001'>7001</a>
<a id='n7002' href='#n7002'>7002</a>
<a id='n7003' href='#n7003'>7003</a>
<a id='n7004' href='#n7004'>7004</a>
<a id='n7005' href='#n7005'>7005</a>
<a id='n7006' href='#n7006'>7006</a>
<a id='n7007' href='#n7007'>7007</a>
<a id='n7008' href='#n7008'>7008</a>
<a id='n7009' href='#n7009'>7009</a>
<a id='n7010' href='#n7010'>7010</a>
<a id='n7011' href='#n7011'>7011</a>
<a id='n7012' href='#n7012'>7012</a>
<a id='n7013' href='#n7013'>7013</a>
<a id='n7014' href='#n7014'>7014</a>
<a id='n7015' href='#n7015'>7015</a>
<a id='n7016' href='#n7016'>7016</a>
<a id='n7017' href='#n7017'>7017</a>
<a id='n7018' href='#n7018'>7018</a>
<a id='n7019' href='#n7019'>7019</a>
<a id='n7020' href='#n7020'>7020</a>
<a id='n7021' href='#n7021'>7021</a>
<a id='n7022' href='#n7022'>7022</a>
<a id='n7023' href='#n7023'>7023</a>
<a id='n7024' href='#n7024'>7024</a>
<a id='n7025' href='#n7025'>7025</a>
<a id='n7026' href='#n7026'>7026</a>
<a id='n7027' href='#n7027'>7027</a>
<a id='n7028' href='#n7028'>7028</a>
<a id='n7029' href='#n7029'>7029</a>
<a id='n7030' href='#n7030'>7030</a>
<a id='n7031' href='#n7031'>7031</a>
<a id='n7032' href='#n7032'>7032</a>
<a id='n7033' href='#n7033'>7033</a>
<a id='n7034' href='#n7034'>7034</a>
<a id='n7035' href='#n7035'>7035</a>
<a id='n7036' href='#n7036'>7036</a>
<a id='n7037' href='#n7037'>7037</a>
<a id='n7038' href='#n7038'>7038</a>
<a id='n7039' href='#n7039'>7039</a>
<a id='n7040' href='#n7040'>7040</a>
<a id='n7041' href='#n7041'>7041</a>
<a id='n7042' href='#n7042'>7042</a>
<a id='n7043' href='#n7043'>7043</a>
<a id='n7044' href='#n7044'>7044</a>
<a id='n7045' href='#n7045'>7045</a>
<a id='n7046' href='#n7046'>7046</a>
<a id='n7047' href='#n7047'>7047</a>
<a id='n7048' href='#n7048'>7048</a>
<a id='n7049' href='#n7049'>7049</a>
<a id='n7050' href='#n7050'>7050</a>
<a id='n7051' href='#n7051'>7051</a>
<a id='n7052' href='#n7052'>7052</a>
<a id='n7053' href='#n7053'>7053</a>
<a id='n7054' href='#n7054'>7054</a>
<a id='n7055' href='#n7055'>7055</a>
<a id='n7056' href='#n7056'>7056</a>
<a id='n7057' href='#n7057'>7057</a>
<a id='n7058' href='#n7058'>7058</a>
<a id='n7059' href='#n7059'>7059</a>
<a id='n7060' href='#n7060'>7060</a>
<a id='n7061' href='#n7061'>7061</a>
<a id='n7062' href='#n7062'>7062</a>
<a id='n7063' href='#n7063'>7063</a>
<a id='n7064' href='#n7064'>7064</a>
<a id='n7065' href='#n7065'>7065</a>
<a id='n7066' href='#n7066'>7066</a>
<a id='n7067' href='#n7067'>7067</a>
<a id='n7068' href='#n7068'>7068</a>
<a id='n7069' href='#n7069'>7069</a>
<a id='n7070' href='#n7070'>7070</a>
<a id='n7071' href='#n7071'>7071</a>
<a id='n7072' href='#n7072'>7072</a>
<a id='n7073' href='#n7073'>7073</a>
<a id='n7074' href='#n7074'>7074</a>
<a id='n7075' href='#n7075'>7075</a>
<a id='n7076' href='#n7076'>7076</a>
<a id='n7077' href='#n7077'>7077</a>
<a id='n7078' href='#n7078'>7078</a>
<a id='n7079' href='#n7079'>7079</a>
<a id='n7080' href='#n7080'>7080</a>
<a id='n7081' href='#n7081'>7081</a>
<a id='n7082' href='#n7082'>7082</a>
<a id='n7083' href='#n7083'>7083</a>
<a id='n7084' href='#n7084'>7084</a>
<a id='n7085' href='#n7085'>7085</a>
<a id='n7086' href='#n7086'>7086</a>
<a id='n7087' href='#n7087'>7087</a>
<a id='n7088' href='#n7088'>7088</a>
<a id='n7089' href='#n7089'>7089</a>
<a id='n7090' href='#n7090'>7090</a>
<a id='n7091' href='#n7091'>7091</a>
<a id='n7092' href='#n7092'>7092</a>
<a id='n7093' href='#n7093'>7093</a>
<a id='n7094' href='#n7094'>7094</a>
<a id='n7095' href='#n7095'>7095</a>
<a id='n7096' href='#n7096'>7096</a>
<a id='n7097' href='#n7097'>7097</a>
<a id='n7098' href='#n7098'>7098</a>
<a id='n7099' href='#n7099'>7099</a>
<a id='n7100' href='#n7100'>7100</a>
<a id='n7101' href='#n7101'>7101</a>
<a id='n7102' href='#n7102'>7102</a>
<a id='n7103' href='#n7103'>7103</a>
<a id='n7104' href='#n7104'>7104</a>
<a id='n7105' href='#n7105'>7105</a>
<a id='n7106' href='#n7106'>7106</a>
<a id='n7107' href='#n7107'>7107</a>
<a id='n7108' href='#n7108'>7108</a>
<a id='n7109' href='#n7109'>7109</a>
<a id='n7110' href='#n7110'>7110</a>
<a id='n7111' href='#n7111'>7111</a>
<a id='n7112' href='#n7112'>7112</a>
<a id='n7113' href='#n7113'>7113</a>
<a id='n7114' href='#n7114'>7114</a>
<a id='n7115' href='#n7115'>7115</a>
<a id='n7116' href='#n7116'>7116</a>
<a id='n7117' href='#n7117'>7117</a>
<a id='n7118' href='#n7118'>7118</a>
<a id='n7119' href='#n7119'>7119</a>
<a id='n7120' href='#n7120'>7120</a>
<a id='n7121' href='#n7121'>7121</a>
<a id='n7122' href='#n7122'>7122</a>
<a id='n7123' href='#n7123'>7123</a>
<a id='n7124' href='#n7124'>7124</a>
<a id='n7125' href='#n7125'>7125</a>
<a id='n7126' href='#n7126'>7126</a>
<a id='n7127' href='#n7127'>7127</a>
<a id='n7128' href='#n7128'>7128</a>
<a id='n7129' href='#n7129'>7129</a>
<a id='n7130' href='#n7130'>7130</a>
<a id='n7131' href='#n7131'>7131</a>
<a id='n7132' href='#n7132'>7132</a>
<a id='n7133' href='#n7133'>7133</a>
<a id='n7134' href='#n7134'>7134</a>
<a id='n7135' href='#n7135'>7135</a>
<a id='n7136' href='#n7136'>7136</a>
<a id='n7137' href='#n7137'>7137</a>
<a id='n7138' href='#n7138'>7138</a>
<a id='n7139' href='#n7139'>7139</a>
<a id='n7140' href='#n7140'>7140</a>
<a id='n7141' href='#n7141'>7141</a>
<a id='n7142' href='#n7142'>7142</a>
<a id='n7143' href='#n7143'>7143</a>
<a id='n7144' href='#n7144'>7144</a>
<a id='n7145' href='#n7145'>7145</a>
<a id='n7146' href='#n7146'>7146</a>
<a id='n7147' href='#n7147'>7147</a>
<a id='n7148' href='#n7148'>7148</a>
<a id='n7149' href='#n7149'>7149</a>
<a id='n7150' href='#n7150'>7150</a>
<a id='n7151' href='#n7151'>7151</a>
<a id='n7152' href='#n7152'>7152</a>
<a id='n7153' href='#n7153'>7153</a>
<a id='n7154' href='#n7154'>7154</a>
<a id='n7155' href='#n7155'>7155</a>
<a id='n7156' href='#n7156'>7156</a>
<a id='n7157' href='#n7157'>7157</a>
<a id='n7158' href='#n7158'>7158</a>
<a id='n7159' href='#n7159'>7159</a>
<a id='n7160' href='#n7160'>7160</a>
<a id='n7161' href='#n7161'>7161</a>
<a id='n7162' href='#n7162'>7162</a>
<a id='n7163' href='#n7163'>7163</a>
<a id='n7164' href='#n7164'>7164</a>
<a id='n7165' href='#n7165'>7165</a>
<a id='n7166' href='#n7166'>7166</a>
<a id='n7167' href='#n7167'>7167</a>
<a id='n7168' href='#n7168'>7168</a>
<a id='n7169' href='#n7169'>7169</a>
<a id='n7170' href='#n7170'>7170</a>
<a id='n7171' href='#n7171'>7171</a>
<a id='n7172' href='#n7172'>7172</a>
<a id='n7173' href='#n7173'>7173</a>
<a id='n7174' href='#n7174'>7174</a>
<a id='n7175' href='#n7175'>7175</a>
<a id='n7176' href='#n7176'>7176</a>
<a id='n7177' href='#n7177'>7177</a>
<a id='n7178' href='#n7178'>7178</a>
<a id='n7179' href='#n7179'>7179</a>
<a id='n7180' href='#n7180'>7180</a>
<a id='n7181' href='#n7181'>7181</a>
<a id='n7182' href='#n7182'>7182</a>
<a id='n7183' href='#n7183'>7183</a>
<a id='n7184' href='#n7184'>7184</a>
<a id='n7185' href='#n7185'>7185</a>
<a id='n7186' href='#n7186'>7186</a>
<a id='n7187' href='#n7187'>7187</a>
<a id='n7188' href='#n7188'>7188</a>
<a id='n7189' href='#n7189'>7189</a>
<a id='n7190' href='#n7190'>7190</a>
<a id='n7191' href='#n7191'>7191</a>
<a id='n7192' href='#n7192'>7192</a>
<a id='n7193' href='#n7193'>7193</a>
<a id='n7194' href='#n7194'>7194</a>
<a id='n7195' href='#n7195'>7195</a>
<a id='n7196' href='#n7196'>7196</a>
<a id='n7197' href='#n7197'>7197</a>
<a id='n7198' href='#n7198'>7198</a>
<a id='n7199' href='#n7199'>7199</a>
<a id='n7200' href='#n7200'>7200</a>
<a id='n7201' href='#n7201'>7201</a>
<a id='n7202' href='#n7202'>7202</a>
<a id='n7203' href='#n7203'>7203</a>
<a id='n7204' href='#n7204'>7204</a>
<a id='n7205' href='#n7205'>7205</a>
<a id='n7206' href='#n7206'>7206</a>
<a id='n7207' href='#n7207'>7207</a>
<a id='n7208' href='#n7208'>7208</a>
<a id='n7209' href='#n7209'>7209</a>
<a id='n7210' href='#n7210'>7210</a>
<a id='n7211' href='#n7211'>7211</a>
<a id='n7212' href='#n7212'>7212</a>
<a id='n7213' href='#n7213'>7213</a>
<a id='n7214' href='#n7214'>7214</a>
<a id='n7215' href='#n7215'>7215</a>
<a id='n7216' href='#n7216'>7216</a>
<a id='n7217' href='#n7217'>7217</a>
<a id='n7218' href='#n7218'>7218</a>
<a id='n7219' href='#n7219'>7219</a>
<a id='n7220' href='#n7220'>7220</a>
<a id='n7221' href='#n7221'>7221</a>
<a id='n7222' href='#n7222'>7222</a>
<a id='n7223' href='#n7223'>7223</a>
<a id='n7224' href='#n7224'>7224</a>
<a id='n7225' href='#n7225'>7225</a>
<a id='n7226' href='#n7226'>7226</a>
<a id='n7227' href='#n7227'>7227</a>
<a id='n7228' href='#n7228'>7228</a>
<a id='n7229' href='#n7229'>7229</a>
<a id='n7230' href='#n7230'>7230</a>
<a id='n7231' href='#n7231'>7231</a>
<a id='n7232' href='#n7232'>7232</a>
<a id='n7233' href='#n7233'>7233</a>
<a id='n7234' href='#n7234'>7234</a>
<a id='n7235' href='#n7235'>7235</a>
<a id='n7236' href='#n7236'>7236</a>
<a id='n7237' href='#n7237'>7237</a>
<a id='n7238' href='#n7238'>7238</a>
<a id='n7239' href='#n7239'>7239</a>
<a id='n7240' href='#n7240'>7240</a>
<a id='n7241' href='#n7241'>7241</a>
<a id='n7242' href='#n7242'>7242</a>
<a id='n7243' href='#n7243'>7243</a>
<a id='n7244' href='#n7244'>7244</a>
<a id='n7245' href='#n7245'>7245</a>
<a id='n7246' href='#n7246'>7246</a>
<a id='n7247' href='#n7247'>7247</a>
<a id='n7248' href='#n7248'>7248</a>
<a id='n7249' href='#n7249'>7249</a>
<a id='n7250' href='#n7250'>7250</a>
<a id='n7251' href='#n7251'>7251</a>
<a id='n7252' href='#n7252'>7252</a>
<a id='n7253' href='#n7253'>7253</a>
<a id='n7254' href='#n7254'>7254</a>
<a id='n7255' href='#n7255'>7255</a>
<a id='n7256' href='#n7256'>7256</a>
<a id='n7257' href='#n7257'>7257</a>
<a id='n7258' href='#n7258'>7258</a>
<a id='n7259' href='#n7259'>7259</a>
<a id='n7260' href='#n7260'>7260</a>
<a id='n7261' href='#n7261'>7261</a>
<a id='n7262' href='#n7262'>7262</a>
<a id='n7263' href='#n7263'>7263</a>
<a id='n7264' href='#n7264'>7264</a>
<a id='n7265' href='#n7265'>7265</a>
<a id='n7266' href='#n7266'>7266</a>
<a id='n7267' href='#n7267'>7267</a>
<a id='n7268' href='#n7268'>7268</a>
<a id='n7269' href='#n7269'>7269</a>
<a id='n7270' href='#n7270'>7270</a>
<a id='n7271' href='#n7271'>7271</a>
<a id='n7272' href='#n7272'>7272</a>
<a id='n7273' href='#n7273'>7273</a>
<a id='n7274' href='#n7274'>7274</a>
<a id='n7275' href='#n7275'>7275</a>
<a id='n7276' href='#n7276'>7276</a>
<a id='n7277' href='#n7277'>7277</a>
<a id='n7278' href='#n7278'>7278</a>
<a id='n7279' href='#n7279'>7279</a>
<a id='n7280' href='#n7280'>7280</a>
<a id='n7281' href='#n7281'>7281</a>
<a id='n7282' href='#n7282'>7282</a>
<a id='n7283' href='#n7283'>7283</a>
<a id='n7284' href='#n7284'>7284</a>
<a id='n7285' href='#n7285'>7285</a>
<a id='n7286' href='#n7286'>7286</a>
<a id='n7287' href='#n7287'>7287</a>
<a id='n7288' href='#n7288'>7288</a>
<a id='n7289' href='#n7289'>7289</a>
<a id='n7290' href='#n7290'>7290</a>
<a id='n7291' href='#n7291'>7291</a>
<a id='n7292' href='#n7292'>7292</a>
<a id='n7293' href='#n7293'>7293</a>
<a id='n7294' href='#n7294'>7294</a>
<a id='n7295' href='#n7295'>7295</a>
<a id='n7296' href='#n7296'>7296</a>
<a id='n7297' href='#n7297'>7297</a>
<a id='n7298' href='#n7298'>7298</a>
<a id='n7299' href='#n7299'>7299</a>
<a id='n7300' href='#n7300'>7300</a>
<a id='n7301' href='#n7301'>7301</a>
<a id='n7302' href='#n7302'>7302</a>
<a id='n7303' href='#n7303'>7303</a>
<a id='n7304' href='#n7304'>7304</a>
<a id='n7305' href='#n7305'>7305</a>
<a id='n7306' href='#n7306'>7306</a>
<a id='n7307' href='#n7307'>7307</a>
<a id='n7308' href='#n7308'>7308</a>
<a id='n7309' href='#n7309'>7309</a>
<a id='n7310' href='#n7310'>7310</a>
<a id='n7311' href='#n7311'>7311</a>
<a id='n7312' href='#n7312'>7312</a>
<a id='n7313' href='#n7313'>7313</a>
<a id='n7314' href='#n7314'>7314</a>
<a id='n7315' href='#n7315'>7315</a>
<a id='n7316' href='#n7316'>7316</a>
<a id='n7317' href='#n7317'>7317</a>
<a id='n7318' href='#n7318'>7318</a>
<a id='n7319' href='#n7319'>7319</a>
<a id='n7320' href='#n7320'>7320</a>
<a id='n7321' href='#n7321'>7321</a>
<a id='n7322' href='#n7322'>7322</a>
<a id='n7323' href='#n7323'>7323</a>
<a id='n7324' href='#n7324'>7324</a>
<a id='n7325' href='#n7325'>7325</a>
<a id='n7326' href='#n7326'>7326</a>
<a id='n7327' href='#n7327'>7327</a>
<a id='n7328' href='#n7328'>7328</a>
<a id='n7329' href='#n7329'>7329</a>
<a id='n7330' href='#n7330'>7330</a>
<a id='n7331' href='#n7331'>7331</a>
<a id='n7332' href='#n7332'>7332</a>
<a id='n7333' href='#n7333'>7333</a>
<a id='n7334' href='#n7334'>7334</a>
<a id='n7335' href='#n7335'>7335</a>
<a id='n7336' href='#n7336'>7336</a>
<a id='n7337' href='#n7337'>7337</a>
<a id='n7338' href='#n7338'>7338</a>
<a id='n7339' href='#n7339'>7339</a>
<a id='n7340' href='#n7340'>7340</a>
<a id='n7341' href='#n7341'>7341</a>
<a id='n7342' href='#n7342'>7342</a>
<a id='n7343' href='#n7343'>7343</a>
<a id='n7344' href='#n7344'>7344</a>
<a id='n7345' href='#n7345'>7345</a>
<a id='n7346' href='#n7346'>7346</a>
<a id='n7347' href='#n7347'>7347</a>
<a id='n7348' href='#n7348'>7348</a>
<a id='n7349' href='#n7349'>7349</a>
<a id='n7350' href='#n7350'>7350</a>
<a id='n7351' href='#n7351'>7351</a>
<a id='n7352' href='#n7352'>7352</a>
<a id='n7353' href='#n7353'>7353</a>
<a id='n7354' href='#n7354'>7354</a>
<a id='n7355' href='#n7355'>7355</a>
<a id='n7356' href='#n7356'>7356</a>
<a id='n7357' href='#n7357'>7357</a>
<a id='n7358' href='#n7358'>7358</a>
<a id='n7359' href='#n7359'>7359</a>
<a id='n7360' href='#n7360'>7360</a>
<a id='n7361' href='#n7361'>7361</a>
<a id='n7362' href='#n7362'>7362</a>
<a id='n7363' href='#n7363'>7363</a>
<a id='n7364' href='#n7364'>7364</a>
<a id='n7365' href='#n7365'>7365</a>
<a id='n7366' href='#n7366'>7366</a>
<a id='n7367' href='#n7367'>7367</a>
<a id='n7368' href='#n7368'>7368</a>
<a id='n7369' href='#n7369'>7369</a>
<a id='n7370' href='#n7370'>7370</a>
<a id='n7371' href='#n7371'>7371</a>
<a id='n7372' href='#n7372'>7372</a>
<a id='n7373' href='#n7373'>7373</a>
<a id='n7374' href='#n7374'>7374</a>
<a id='n7375' href='#n7375'>7375</a>
<a id='n7376' href='#n7376'>7376</a>
<a id='n7377' href='#n7377'>7377</a>
<a id='n7378' href='#n7378'>7378</a>
<a id='n7379' href='#n7379'>7379</a>
<a id='n7380' href='#n7380'>7380</a>
<a id='n7381' href='#n7381'>7381</a>
<a id='n7382' href='#n7382'>7382</a>
<a id='n7383' href='#n7383'>7383</a>
<a id='n7384' href='#n7384'>7384</a>
<a id='n7385' href='#n7385'>7385</a>
<a id='n7386' href='#n7386'>7386</a>
<a id='n7387' href='#n7387'>7387</a>
<a id='n7388' href='#n7388'>7388</a>
<a id='n7389' href='#n7389'>7389</a>
<a id='n7390' href='#n7390'>7390</a>
<a id='n7391' href='#n7391'>7391</a>
<a id='n7392' href='#n7392'>7392</a>
<a id='n7393' href='#n7393'>7393</a>
<a id='n7394' href='#n7394'>7394</a>
<a id='n7395' href='#n7395'>7395</a>
<a id='n7396' href='#n7396'>7396</a>
<a id='n7397' href='#n7397'>7397</a>
<a id='n7398' href='#n7398'>7398</a>
<a id='n7399' href='#n7399'>7399</a>
<a id='n7400' href='#n7400'>7400</a>
<a id='n7401' href='#n7401'>7401</a>
<a id='n7402' href='#n7402'>7402</a>
<a id='n7403' href='#n7403'>7403</a>
<a id='n7404' href='#n7404'>7404</a>
<a id='n7405' href='#n7405'>7405</a>
<a id='n7406' href='#n7406'>7406</a>
<a id='n7407' href='#n7407'>7407</a>
<a id='n7408' href='#n7408'>7408</a>
<a id='n7409' href='#n7409'>7409</a>
<a id='n7410' href='#n7410'>7410</a>
<a id='n7411' href='#n7411'>7411</a>
<a id='n7412' href='#n7412'>7412</a>
<a id='n7413' href='#n7413'>7413</a>
<a id='n7414' href='#n7414'>7414</a>
<a id='n7415' href='#n7415'>7415</a>
<a id='n7416' href='#n7416'>7416</a>
<a id='n7417' href='#n7417'>7417</a>
<a id='n7418' href='#n7418'>7418</a>
<a id='n7419' href='#n7419'>7419</a>
<a id='n7420' href='#n7420'>7420</a>
<a id='n7421' href='#n7421'>7421</a>
<a id='n7422' href='#n7422'>7422</a>
<a id='n7423' href='#n7423'>7423</a>
<a id='n7424' href='#n7424'>7424</a>
<a id='n7425' href='#n7425'>7425</a>
<a id='n7426' href='#n7426'>7426</a>
<a id='n7427' href='#n7427'>7427</a>
<a id='n7428' href='#n7428'>7428</a>
<a id='n7429' href='#n7429'>7429</a>
<a id='n7430' href='#n7430'>7430</a>
<a id='n7431' href='#n7431'>7431</a>
<a id='n7432' href='#n7432'>7432</a>
<a id='n7433' href='#n7433'>7433</a>
<a id='n7434' href='#n7434'>7434</a>
<a id='n7435' href='#n7435'>7435</a>
<a id='n7436' href='#n7436'>7436</a>
<a id='n7437' href='#n7437'>7437</a>
<a id='n7438' href='#n7438'>7438</a>
<a id='n7439' href='#n7439'>7439</a>
<a id='n7440' href='#n7440'>7440</a>
<a id='n7441' href='#n7441'>7441</a>
<a id='n7442' href='#n7442'>7442</a>
<a id='n7443' href='#n7443'>7443</a>
<a id='n7444' href='#n7444'>7444</a>
<a id='n7445' href='#n7445'>7445</a>
<a id='n7446' href='#n7446'>7446</a>
<a id='n7447' href='#n7447'>7447</a>
<a id='n7448' href='#n7448'>7448</a>
<a id='n7449' href='#n7449'>7449</a>
<a id='n7450' href='#n7450'>7450</a>
<a id='n7451' href='#n7451'>7451</a>
<a id='n7452' href='#n7452'>7452</a>
<a id='n7453' href='#n7453'>7453</a>
<a id='n7454' href='#n7454'>7454</a>
<a id='n7455' href='#n7455'>7455</a>
<a id='n7456' href='#n7456'>7456</a>
<a id='n7457' href='#n7457'>7457</a>
<a id='n7458' href='#n7458'>7458</a>
<a id='n7459' href='#n7459'>7459</a>
<a id='n7460' href='#n7460'>7460</a>
<a id='n7461' href='#n7461'>7461</a>
<a id='n7462' href='#n7462'>7462</a>
<a id='n7463' href='#n7463'>7463</a>
<a id='n7464' href='#n7464'>7464</a>
<a id='n7465' href='#n7465'>7465</a>
<a id='n7466' href='#n7466'>7466</a>
<a id='n7467' href='#n7467'>7467</a>
<a id='n7468' href='#n7468'>7468</a>
<a id='n7469' href='#n7469'>7469</a>
<a id='n7470' href='#n7470'>7470</a>
<a id='n7471' href='#n7471'>7471</a>
<a id='n7472' href='#n7472'>7472</a>
<a id='n7473' href='#n7473'>7473</a>
<a id='n7474' href='#n7474'>7474</a>
<a id='n7475' href='#n7475'>7475</a>
<a id='n7476' href='#n7476'>7476</a>
<a id='n7477' href='#n7477'>7477</a>
<a id='n7478' href='#n7478'>7478</a>
<a id='n7479' href='#n7479'>7479</a>
<a id='n7480' href='#n7480'>7480</a>
<a id='n7481' href='#n7481'>7481</a>
<a id='n7482' href='#n7482'>7482</a>
<a id='n7483' href='#n7483'>7483</a>
<a id='n7484' href='#n7484'>7484</a>
<a id='n7485' href='#n7485'>7485</a>
<a id='n7486' href='#n7486'>7486</a>
<a id='n7487' href='#n7487'>7487</a>
<a id='n7488' href='#n7488'>7488</a>
<a id='n7489' href='#n7489'>7489</a>
<a id='n7490' href='#n7490'>7490</a>
<a id='n7491' href='#n7491'>7491</a>
<a id='n7492' href='#n7492'>7492</a>
<a id='n7493' href='#n7493'>7493</a>
<a id='n7494' href='#n7494'>7494</a>
<a id='n7495' href='#n7495'>7495</a>
<a id='n7496' href='#n7496'>7496</a>
<a id='n7497' href='#n7497'>7497</a>
<a id='n7498' href='#n7498'>7498</a>
<a id='n7499' href='#n7499'>7499</a>
<a id='n7500' href='#n7500'>7500</a>
<a id='n7501' href='#n7501'>7501</a>
<a id='n7502' href='#n7502'>7502</a>
<a id='n7503' href='#n7503'>7503</a>
<a id='n7504' href='#n7504'>7504</a>
<a id='n7505' href='#n7505'>7505</a>
<a id='n7506' href='#n7506'>7506</a>
<a id='n7507' href='#n7507'>7507</a>
<a id='n7508' href='#n7508'>7508</a>
<a id='n7509' href='#n7509'>7509</a>
<a id='n7510' href='#n7510'>7510</a>
<a id='n7511' href='#n7511'>7511</a>
<a id='n7512' href='#n7512'>7512</a>
<a id='n7513' href='#n7513'>7513</a>
<a id='n7514' href='#n7514'>7514</a>
<a id='n7515' href='#n7515'>7515</a>
<a id='n7516' href='#n7516'>7516</a>
<a id='n7517' href='#n7517'>7517</a>
<a id='n7518' href='#n7518'>7518</a>
<a id='n7519' href='#n7519'>7519</a>
<a id='n7520' href='#n7520'>7520</a>
<a id='n7521' href='#n7521'>7521</a>
<a id='n7522' href='#n7522'>7522</a>
<a id='n7523' href='#n7523'>7523</a>
<a id='n7524' href='#n7524'>7524</a>
<a id='n7525' href='#n7525'>7525</a>
<a id='n7526' href='#n7526'>7526</a>
<a id='n7527' href='#n7527'>7527</a>
<a id='n7528' href='#n7528'>7528</a>
<a id='n7529' href='#n7529'>7529</a>
<a id='n7530' href='#n7530'>7530</a>
<a id='n7531' href='#n7531'>7531</a>
<a id='n7532' href='#n7532'>7532</a>
<a id='n7533' href='#n7533'>7533</a>
<a id='n7534' href='#n7534'>7534</a>
<a id='n7535' href='#n7535'>7535</a>
<a id='n7536' href='#n7536'>7536</a>
<a id='n7537' href='#n7537'>7537</a>
<a id='n7538' href='#n7538'>7538</a>
<a id='n7539' href='#n7539'>7539</a>
<a id='n7540' href='#n7540'>7540</a>
<a id='n7541' href='#n7541'>7541</a>
<a id='n7542' href='#n7542'>7542</a>
<a id='n7543' href='#n7543'>7543</a>
<a id='n7544' href='#n7544'>7544</a>
<a id='n7545' href='#n7545'>7545</a>
<a id='n7546' href='#n7546'>7546</a>
<a id='n7547' href='#n7547'>7547</a>
<a id='n7548' href='#n7548'>7548</a>
<a id='n7549' href='#n7549'>7549</a>
<a id='n7550' href='#n7550'>7550</a>
<a id='n7551' href='#n7551'>7551</a>
<a id='n7552' href='#n7552'>7552</a>
<a id='n7553' href='#n7553'>7553</a>
<a id='n7554' href='#n7554'>7554</a>
<a id='n7555' href='#n7555'>7555</a>
<a id='n7556' href='#n7556'>7556</a>
<a id='n7557' href='#n7557'>7557</a>
<a id='n7558' href='#n7558'>7558</a>
<a id='n7559' href='#n7559'>7559</a>
<a id='n7560' href='#n7560'>7560</a>
<a id='n7561' href='#n7561'>7561</a>
<a id='n7562' href='#n7562'>7562</a>
<a id='n7563' href='#n7563'>7563</a>
<a id='n7564' href='#n7564'>7564</a>
<a id='n7565' href='#n7565'>7565</a>
<a id='n7566' href='#n7566'>7566</a>
<a id='n7567' href='#n7567'>7567</a>
<a id='n7568' href='#n7568'>7568</a>
<a id='n7569' href='#n7569'>7569</a>
<a id='n7570' href='#n7570'>7570</a>
<a id='n7571' href='#n7571'>7571</a>
<a id='n7572' href='#n7572'>7572</a>
<a id='n7573' href='#n7573'>7573</a>
<a id='n7574' href='#n7574'>7574</a>
<a id='n7575' href='#n7575'>7575</a>
<a id='n7576' href='#n7576'>7576</a>
<a id='n7577' href='#n7577'>7577</a>
<a id='n7578' href='#n7578'>7578</a>
<a id='n7579' href='#n7579'>7579</a>
<a id='n7580' href='#n7580'>7580</a>
<a id='n7581' href='#n7581'>7581</a>
<a id='n7582' href='#n7582'>7582</a>
<a id='n7583' href='#n7583'>7583</a>
<a id='n7584' href='#n7584'>7584</a>
<a id='n7585' href='#n7585'>7585</a>
<a id='n7586' href='#n7586'>7586</a>
<a id='n7587' href='#n7587'>7587</a>
<a id='n7588' href='#n7588'>7588</a>
<a id='n7589' href='#n7589'>7589</a>
<a id='n7590' href='#n7590'>7590</a>
<a id='n7591' href='#n7591'>7591</a>
<a id='n7592' href='#n7592'>7592</a>
<a id='n7593' href='#n7593'>7593</a>
<a id='n7594' href='#n7594'>7594</a>
<a id='n7595' href='#n7595'>7595</a>
<a id='n7596' href='#n7596'>7596</a>
<a id='n7597' href='#n7597'>7597</a>
<a id='n7598' href='#n7598'>7598</a>
<a id='n7599' href='#n7599'>7599</a>
<a id='n7600' href='#n7600'>7600</a>
<a id='n7601' href='#n7601'>7601</a>
<a id='n7602' href='#n7602'>7602</a>
<a id='n7603' href='#n7603'>7603</a>
<a id='n7604' href='#n7604'>7604</a>
<a id='n7605' href='#n7605'>7605</a>
<a id='n7606' href='#n7606'>7606</a>
<a id='n7607' href='#n7607'>7607</a>
<a id='n7608' href='#n7608'>7608</a>
<a id='n7609' href='#n7609'>7609</a>
<a id='n7610' href='#n7610'>7610</a>
<a id='n7611' href='#n7611'>7611</a>
<a id='n7612' href='#n7612'>7612</a>
<a id='n7613' href='#n7613'>7613</a>
<a id='n7614' href='#n7614'>7614</a>
<a id='n7615' href='#n7615'>7615</a>
<a id='n7616' href='#n7616'>7616</a>
<a id='n7617' href='#n7617'>7617</a>
<a id='n7618' href='#n7618'>7618</a>
<a id='n7619' href='#n7619'>7619</a>
<a id='n7620' href='#n7620'>7620</a>
<a id='n7621' href='#n7621'>7621</a>
<a id='n7622' href='#n7622'>7622</a>
<a id='n7623' href='#n7623'>7623</a>
<a id='n7624' href='#n7624'>7624</a>
<a id='n7625' href='#n7625'>7625</a>
<a id='n7626' href='#n7626'>7626</a>
<a id='n7627' href='#n7627'>7627</a>
<a id='n7628' href='#n7628'>7628</a>
<a id='n7629' href='#n7629'>7629</a>
<a id='n7630' href='#n7630'>7630</a>
<a id='n7631' href='#n7631'>7631</a>
<a id='n7632' href='#n7632'>7632</a>
<a id='n7633' href='#n7633'>7633</a>
<a id='n7634' href='#n7634'>7634</a>
<a id='n7635' href='#n7635'>7635</a>
<a id='n7636' href='#n7636'>7636</a>
<a id='n7637' href='#n7637'>7637</a>
<a id='n7638' href='#n7638'>7638</a>
<a id='n7639' href='#n7639'>7639</a>
<a id='n7640' href='#n7640'>7640</a>
<a id='n7641' href='#n7641'>7641</a>
<a id='n7642' href='#n7642'>7642</a>
<a id='n7643' href='#n7643'>7643</a>
<a id='n7644' href='#n7644'>7644</a>
<a id='n7645' href='#n7645'>7645</a>
<a id='n7646' href='#n7646'>7646</a>
<a id='n7647' href='#n7647'>7647</a>
<a id='n7648' href='#n7648'>7648</a>
<a id='n7649' href='#n7649'>7649</a>
<a id='n7650' href='#n7650'>7650</a>
<a id='n7651' href='#n7651'>7651</a>
<a id='n7652' href='#n7652'>7652</a>
<a id='n7653' href='#n7653'>7653</a>
<a id='n7654' href='#n7654'>7654</a>
<a id='n7655' href='#n7655'>7655</a>
<a id='n7656' href='#n7656'>7656</a>
<a id='n7657' href='#n7657'>7657</a>
<a id='n7658' href='#n7658'>7658</a>
<a id='n7659' href='#n7659'>7659</a>
<a id='n7660' href='#n7660'>7660</a>
<a id='n7661' href='#n7661'>7661</a>
<a id='n7662' href='#n7662'>7662</a>
<a id='n7663' href='#n7663'>7663</a>
<a id='n7664' href='#n7664'>7664</a>
<a id='n7665' href='#n7665'>7665</a>
<a id='n7666' href='#n7666'>7666</a>
<a id='n7667' href='#n7667'>7667</a>
<a id='n7668' href='#n7668'>7668</a>
<a id='n7669' href='#n7669'>7669</a>
<a id='n7670' href='#n7670'>7670</a>
<a id='n7671' href='#n7671'>7671</a>
<a id='n7672' href='#n7672'>7672</a>
<a id='n7673' href='#n7673'>7673</a>
<a id='n7674' href='#n7674'>7674</a>
<a id='n7675' href='#n7675'>7675</a>
<a id='n7676' href='#n7676'>7676</a>
<a id='n7677' href='#n7677'>7677</a>
<a id='n7678' href='#n7678'>7678</a>
<a id='n7679' href='#n7679'>7679</a>
<a id='n7680' href='#n7680'>7680</a>
<a id='n7681' href='#n7681'>7681</a>
<a id='n7682' href='#n7682'>7682</a>
<a id='n7683' href='#n7683'>7683</a>
<a id='n7684' href='#n7684'>7684</a>
<a id='n7685' href='#n7685'>7685</a>
<a id='n7686' href='#n7686'>7686</a>
<a id='n7687' href='#n7687'>7687</a>
<a id='n7688' href='#n7688'>7688</a>
<a id='n7689' href='#n7689'>7689</a>
<a id='n7690' href='#n7690'>7690</a>
<a id='n7691' href='#n7691'>7691</a>
<a id='n7692' href='#n7692'>7692</a>
<a id='n7693' href='#n7693'>7693</a>
<a id='n7694' href='#n7694'>7694</a>
<a id='n7695' href='#n7695'>7695</a>
<a id='n7696' href='#n7696'>7696</a>
<a id='n7697' href='#n7697'>7697</a>
<a id='n7698' href='#n7698'>7698</a>
<a id='n7699' href='#n7699'>7699</a>
<a id='n7700' href='#n7700'>7700</a>
<a id='n7701' href='#n7701'>7701</a>
<a id='n7702' href='#n7702'>7702</a>
<a id='n7703' href='#n7703'>7703</a>
<a id='n7704' href='#n7704'>7704</a>
<a id='n7705' href='#n7705'>7705</a>
<a id='n7706' href='#n7706'>7706</a>
<a id='n7707' href='#n7707'>7707</a>
<a id='n7708' href='#n7708'>7708</a>
<a id='n7709' href='#n7709'>7709</a>
<a id='n7710' href='#n7710'>7710</a>
<a id='n7711' href='#n7711'>7711</a>
<a id='n7712' href='#n7712'>7712</a>
<a id='n7713' href='#n7713'>7713</a>
<a id='n7714' href='#n7714'>7714</a>
<a id='n7715' href='#n7715'>7715</a>
<a id='n7716' href='#n7716'>7716</a>
<a id='n7717' href='#n7717'>7717</a>
<a id='n7718' href='#n7718'>7718</a>
<a id='n7719' href='#n7719'>7719</a>
<a id='n7720' href='#n7720'>7720</a>
<a id='n7721' href='#n7721'>7721</a>
<a id='n7722' href='#n7722'>7722</a>
<a id='n7723' href='#n7723'>7723</a>
<a id='n7724' href='#n7724'>7724</a>
<a id='n7725' href='#n7725'>7725</a>
<a id='n7726' href='#n7726'>7726</a>
<a id='n7727' href='#n7727'>7727</a>
<a id='n7728' href='#n7728'>7728</a>
<a id='n7729' href='#n7729'>7729</a>
<a id='n7730' href='#n7730'>7730</a>
<a id='n7731' href='#n7731'>7731</a>
<a id='n7732' href='#n7732'>7732</a>
<a id='n7733' href='#n7733'>7733</a>
<a id='n7734' href='#n7734'>7734</a>
<a id='n7735' href='#n7735'>7735</a>
<a id='n7736' href='#n7736'>7736</a>
<a id='n7737' href='#n7737'>7737</a>
<a id='n7738' href='#n7738'>7738</a>
<a id='n7739' href='#n7739'>7739</a>
<a id='n7740' href='#n7740'>7740</a>
<a id='n7741' href='#n7741'>7741</a>
<a id='n7742' href='#n7742'>7742</a>
<a id='n7743' href='#n7743'>7743</a>
<a id='n7744' href='#n7744'>7744</a>
<a id='n7745' href='#n7745'>7745</a>
<a id='n7746' href='#n7746'>7746</a>
<a id='n7747' href='#n7747'>7747</a>
<a id='n7748' href='#n7748'>7748</a>
<a id='n7749' href='#n7749'>7749</a>
<a id='n7750' href='#n7750'>7750</a>
<a id='n7751' href='#n7751'>7751</a>
<a id='n7752' href='#n7752'>7752</a>
<a id='n7753' href='#n7753'>7753</a>
<a id='n7754' href='#n7754'>7754</a>
<a id='n7755' href='#n7755'>7755</a>
<a id='n7756' href='#n7756'>7756</a>
<a id='n7757' href='#n7757'>7757</a>
<a id='n7758' href='#n7758'>7758</a>
<a id='n7759' href='#n7759'>7759</a>
<a id='n7760' href='#n7760'>7760</a>
<a id='n7761' href='#n7761'>7761</a>
<a id='n7762' href='#n7762'>7762</a>
<a id='n7763' href='#n7763'>7763</a>
<a id='n7764' href='#n7764'>7764</a>
<a id='n7765' href='#n7765'>7765</a>
<a id='n7766' href='#n7766'>7766</a>
<a id='n7767' href='#n7767'>7767</a>
<a id='n7768' href='#n7768'>7768</a>
<a id='n7769' href='#n7769'>7769</a>
<a id='n7770' href='#n7770'>7770</a>
<a id='n7771' href='#n7771'>7771</a>
<a id='n7772' href='#n7772'>7772</a>
<a id='n7773' href='#n7773'>7773</a>
<a id='n7774' href='#n7774'>7774</a>
<a id='n7775' href='#n7775'>7775</a>
<a id='n7776' href='#n7776'>7776</a>
<a id='n7777' href='#n7777'>7777</a>
<a id='n7778' href='#n7778'>7778</a>
<a id='n7779' href='#n7779'>7779</a>
<a id='n7780' href='#n7780'>7780</a>
<a id='n7781' href='#n7781'>7781</a>
<a id='n7782' href='#n7782'>7782</a>
<a id='n7783' href='#n7783'>7783</a>
<a id='n7784' href='#n7784'>7784</a>
<a id='n7785' href='#n7785'>7785</a>
<a id='n7786' href='#n7786'>7786</a>
<a id='n7787' href='#n7787'>7787</a>
<a id='n7788' href='#n7788'>7788</a>
<a id='n7789' href='#n7789'>7789</a>
<a id='n7790' href='#n7790'>7790</a>
<a id='n7791' href='#n7791'>7791</a>
<a id='n7792' href='#n7792'>7792</a>
<a id='n7793' href='#n7793'>7793</a>
<a id='n7794' href='#n7794'>7794</a>
<a id='n7795' href='#n7795'>7795</a>
<a id='n7796' href='#n7796'>7796</a>
<a id='n7797' href='#n7797'>7797</a>
<a id='n7798' href='#n7798'>7798</a>
<a id='n7799' href='#n7799'>7799</a>
<a id='n7800' href='#n7800'>7800</a>
<a id='n7801' href='#n7801'>7801</a>
<a id='n7802' href='#n7802'>7802</a>
<a id='n7803' href='#n7803'>7803</a>
<a id='n7804' href='#n7804'>7804</a>
<a id='n7805' href='#n7805'>7805</a>
<a id='n7806' href='#n7806'>7806</a>
<a id='n7807' href='#n7807'>7807</a>
<a id='n7808' href='#n7808'>7808</a>
<a id='n7809' href='#n7809'>7809</a>
<a id='n7810' href='#n7810'>7810</a>
<a id='n7811' href='#n7811'>7811</a>
<a id='n7812' href='#n7812'>7812</a>
<a id='n7813' href='#n7813'>7813</a>
<a id='n7814' href='#n7814'>7814</a>
<a id='n7815' href='#n7815'>7815</a>
<a id='n7816' href='#n7816'>7816</a>
<a id='n7817' href='#n7817'>7817</a>
<a id='n7818' href='#n7818'>7818</a>
<a id='n7819' href='#n7819'>7819</a>
<a id='n7820' href='#n7820'>7820</a>
<a id='n7821' href='#n7821'>7821</a>
<a id='n7822' href='#n7822'>7822</a>
<a id='n7823' href='#n7823'>7823</a>
<a id='n7824' href='#n7824'>7824</a>
<a id='n7825' href='#n7825'>7825</a>
<a id='n7826' href='#n7826'>7826</a>
<a id='n7827' href='#n7827'>7827</a>
<a id='n7828' href='#n7828'>7828</a>
<a id='n7829' href='#n7829'>7829</a>
<a id='n7830' href='#n7830'>7830</a>
<a id='n7831' href='#n7831'>7831</a>
<a id='n7832' href='#n7832'>7832</a>
<a id='n7833' href='#n7833'>7833</a>
<a id='n7834' href='#n7834'>7834</a>
<a id='n7835' href='#n7835'>7835</a>
<a id='n7836' href='#n7836'>7836</a>
<a id='n7837' href='#n7837'>7837</a>
<a id='n7838' href='#n7838'>7838</a>
<a id='n7839' href='#n7839'>7839</a>
<a id='n7840' href='#n7840'>7840</a>
<a id='n7841' href='#n7841'>7841</a>
<a id='n7842' href='#n7842'>7842</a>
<a id='n7843' href='#n7843'>7843</a>
<a id='n7844' href='#n7844'>7844</a>
<a id='n7845' href='#n7845'>7845</a>
<a id='n7846' href='#n7846'>7846</a>
<a id='n7847' href='#n7847'>7847</a>
<a id='n7848' href='#n7848'>7848</a>
<a id='n7849' href='#n7849'>7849</a>
<a id='n7850' href='#n7850'>7850</a>
<a id='n7851' href='#n7851'>7851</a>
<a id='n7852' href='#n7852'>7852</a>
<a id='n7853' href='#n7853'>7853</a>
<a id='n7854' href='#n7854'>7854</a>
<a id='n7855' href='#n7855'>7855</a>
<a id='n7856' href='#n7856'>7856</a>
<a id='n7857' href='#n7857'>7857</a>
<a id='n7858' href='#n7858'>7858</a>
<a id='n7859' href='#n7859'>7859</a>
<a id='n7860' href='#n7860'>7860</a>
<a id='n7861' href='#n7861'>7861</a>
<a id='n7862' href='#n7862'>7862</a>
<a id='n7863' href='#n7863'>7863</a>
<a id='n7864' href='#n7864'>7864</a>
<a id='n7865' href='#n7865'>7865</a>
<a id='n7866' href='#n7866'>7866</a>
<a id='n7867' href='#n7867'>7867</a>
<a id='n7868' href='#n7868'>7868</a>
<a id='n7869' href='#n7869'>7869</a>
<a id='n7870' href='#n7870'>7870</a>
<a id='n7871' href='#n7871'>7871</a>
<a id='n7872' href='#n7872'>7872</a>
<a id='n7873' href='#n7873'>7873</a>
<a id='n7874' href='#n7874'>7874</a>
<a id='n7875' href='#n7875'>7875</a>
<a id='n7876' href='#n7876'>7876</a>
<a id='n7877' href='#n7877'>7877</a>
<a id='n7878' href='#n7878'>7878</a>
<a id='n7879' href='#n7879'>7879</a>
<a id='n7880' href='#n7880'>7880</a>
<a id='n7881' href='#n7881'>7881</a>
<a id='n7882' href='#n7882'>7882</a>
<a id='n7883' href='#n7883'>7883</a>
<a id='n7884' href='#n7884'>7884</a>
<a id='n7885' href='#n7885'>7885</a>
<a id='n7886' href='#n7886'>7886</a>
<a id='n7887' href='#n7887'>7887</a>
<a id='n7888' href='#n7888'>7888</a>
<a id='n7889' href='#n7889'>7889</a>
<a id='n7890' href='#n7890'>7890</a>
<a id='n7891' href='#n7891'>7891</a>
<a id='n7892' href='#n7892'>7892</a>
<a id='n7893' href='#n7893'>7893</a>
<a id='n7894' href='#n7894'>7894</a>
<a id='n7895' href='#n7895'>7895</a>
<a id='n7896' href='#n7896'>7896</a>
<a id='n7897' href='#n7897'>7897</a>
<a id='n7898' href='#n7898'>7898</a>
<a id='n7899' href='#n7899'>7899</a>
<a id='n7900' href='#n7900'>7900</a>
<a id='n7901' href='#n7901'>7901</a>
<a id='n7902' href='#n7902'>7902</a>
<a id='n7903' href='#n7903'>7903</a>
<a id='n7904' href='#n7904'>7904</a>
<a id='n7905' href='#n7905'>7905</a>
<a id='n7906' href='#n7906'>7906</a>
<a id='n7907' href='#n7907'>7907</a>
<a id='n7908' href='#n7908'>7908</a>
<a id='n7909' href='#n7909'>7909</a>
<a id='n7910' href='#n7910'>7910</a>
<a id='n7911' href='#n7911'>7911</a>
<a id='n7912' href='#n7912'>7912</a>
<a id='n7913' href='#n7913'>7913</a>
<a id='n7914' href='#n7914'>7914</a>
<a id='n7915' href='#n7915'>7915</a>
<a id='n7916' href='#n7916'>7916</a>
<a id='n7917' href='#n7917'>7917</a>
<a id='n7918' href='#n7918'>7918</a>
<a id='n7919' href='#n7919'>7919</a>
<a id='n7920' href='#n7920'>7920</a>
<a id='n7921' href='#n7921'>7921</a>
<a id='n7922' href='#n7922'>7922</a>
<a id='n7923' href='#n7923'>7923</a>
<a id='n7924' href='#n7924'>7924</a>
<a id='n7925' href='#n7925'>7925</a>
<a id='n7926' href='#n7926'>7926</a>
<a id='n7927' href='#n7927'>7927</a>
<a id='n7928' href='#n7928'>7928</a>
<a id='n7929' href='#n7929'>7929</a>
<a id='n7930' href='#n7930'>7930</a>
<a id='n7931' href='#n7931'>7931</a>
<a id='n7932' href='#n7932'>7932</a>
<a id='n7933' href='#n7933'>7933</a>
<a id='n7934' href='#n7934'>7934</a>
<a id='n7935' href='#n7935'>7935</a>
<a id='n7936' href='#n7936'>7936</a>
<a id='n7937' href='#n7937'>7937</a>
<a id='n7938' href='#n7938'>7938</a>
<a id='n7939' href='#n7939'>7939</a>
<a id='n7940' href='#n7940'>7940</a>
<a id='n7941' href='#n7941'>7941</a>
<a id='n7942' href='#n7942'>7942</a>
<a id='n7943' href='#n7943'>7943</a>
<a id='n7944' href='#n7944'>7944</a>
<a id='n7945' href='#n7945'>7945</a>
<a id='n7946' href='#n7946'>7946</a>
<a id='n7947' href='#n7947'>7947</a>
<a id='n7948' href='#n7948'>7948</a>
<a id='n7949' href='#n7949'>7949</a>
<a id='n7950' href='#n7950'>7950</a>
<a id='n7951' href='#n7951'>7951</a>
<a id='n7952' href='#n7952'>7952</a>
<a id='n7953' href='#n7953'>7953</a>
<a id='n7954' href='#n7954'>7954</a>
<a id='n7955' href='#n7955'>7955</a>
<a id='n7956' href='#n7956'>7956</a>
<a id='n7957' href='#n7957'>7957</a>
<a id='n7958' href='#n7958'>7958</a>
<a id='n7959' href='#n7959'>7959</a>
<a id='n7960' href='#n7960'>7960</a>
<a id='n7961' href='#n7961'>7961</a>
<a id='n7962' href='#n7962'>7962</a>
<a id='n7963' href='#n7963'>7963</a>
<a id='n7964' href='#n7964'>7964</a>
<a id='n7965' href='#n7965'>7965</a>
<a id='n7966' href='#n7966'>7966</a>
<a id='n7967' href='#n7967'>7967</a>
<a id='n7968' href='#n7968'>7968</a>
<a id='n7969' href='#n7969'>7969</a>
<a id='n7970' href='#n7970'>7970</a>
<a id='n7971' href='#n7971'>7971</a>
<a id='n7972' href='#n7972'>7972</a>
<a id='n7973' href='#n7973'>7973</a>
<a id='n7974' href='#n7974'>7974</a>
<a id='n7975' href='#n7975'>7975</a>
<a id='n7976' href='#n7976'>7976</a>
<a id='n7977' href='#n7977'>7977</a>
<a id='n7978' href='#n7978'>7978</a>
<a id='n7979' href='#n7979'>7979</a>
<a id='n7980' href='#n7980'>7980</a>
<a id='n7981' href='#n7981'>7981</a>
<a id='n7982' href='#n7982'>7982</a>
<a id='n7983' href='#n7983'>7983</a>
<a id='n7984' href='#n7984'>7984</a>
<a id='n7985' href='#n7985'>7985</a>
<a id='n7986' href='#n7986'>7986</a>
<a id='n7987' href='#n7987'>7987</a>
<a id='n7988' href='#n7988'>7988</a>
<a id='n7989' href='#n7989'>7989</a>
<a id='n7990' href='#n7990'>7990</a>
<a id='n7991' href='#n7991'>7991</a>
<a id='n7992' href='#n7992'>7992</a>
<a id='n7993' href='#n7993'>7993</a>
<a id='n7994' href='#n7994'>7994</a>
<a id='n7995' href='#n7995'>7995</a>
<a id='n7996' href='#n7996'>7996</a>
<a id='n7997' href='#n7997'>7997</a>
<a id='n7998' href='#n7998'>7998</a>
<a id='n7999' href='#n7999'>7999</a>
<a id='n8000' href='#n8000'>8000</a>
<a id='n8001' href='#n8001'>8001</a>
<a id='n8002' href='#n8002'>8002</a>
<a id='n8003' href='#n8003'>8003</a>
<a id='n8004' href='#n8004'>8004</a>
<a id='n8005' href='#n8005'>8005</a>
<a id='n8006' href='#n8006'>8006</a>
<a id='n8007' href='#n8007'>8007</a>
<a id='n8008' href='#n8008'>8008</a>
<a id='n8009' href='#n8009'>8009</a>
<a id='n8010' href='#n8010'>8010</a>
<a id='n8011' href='#n8011'>8011</a>
<a id='n8012' href='#n8012'>8012</a>
<a id='n8013' href='#n8013'>8013</a>
<a id='n8014' href='#n8014'>8014</a>
<a id='n8015' href='#n8015'>8015</a>
<a id='n8016' href='#n8016'>8016</a>
<a id='n8017' href='#n8017'>8017</a>
<a id='n8018' href='#n8018'>8018</a>
<a id='n8019' href='#n8019'>8019</a>
<a id='n8020' href='#n8020'>8020</a>
<a id='n8021' href='#n8021'>8021</a>
<a id='n8022' href='#n8022'>8022</a>
<a id='n8023' href='#n8023'>8023</a>
<a id='n8024' href='#n8024'>8024</a>
<a id='n8025' href='#n8025'>8025</a>
<a id='n8026' href='#n8026'>8026</a>
<a id='n8027' href='#n8027'>8027</a>
<a id='n8028' href='#n8028'>8028</a>
<a id='n8029' href='#n8029'>8029</a>
<a id='n8030' href='#n8030'>8030</a>
<a id='n8031' href='#n8031'>8031</a>
<a id='n8032' href='#n8032'>8032</a>
<a id='n8033' href='#n8033'>8033</a>
<a id='n8034' href='#n8034'>8034</a>
<a id='n8035' href='#n8035'>8035</a>
<a id='n8036' href='#n8036'>8036</a>
<a id='n8037' href='#n8037'>8037</a>
<a id='n8038' href='#n8038'>8038</a>
<a id='n8039' href='#n8039'>8039</a>
<a id='n8040' href='#n8040'>8040</a>
<a id='n8041' href='#n8041'>8041</a>
<a id='n8042' href='#n8042'>8042</a>
<a id='n8043' href='#n8043'>8043</a>
<a id='n8044' href='#n8044'>8044</a>
<a id='n8045' href='#n8045'>8045</a>
<a id='n8046' href='#n8046'>8046</a>
<a id='n8047' href='#n8047'>8047</a>
<a id='n8048' href='#n8048'>8048</a>
<a id='n8049' href='#n8049'>8049</a>
<a id='n8050' href='#n8050'>8050</a>
<a id='n8051' href='#n8051'>8051</a>
<a id='n8052' href='#n8052'>8052</a>
<a id='n8053' href='#n8053'>8053</a>
<a id='n8054' href='#n8054'>8054</a>
<a id='n8055' href='#n8055'>8055</a>
<a id='n8056' href='#n8056'>8056</a>
<a id='n8057' href='#n8057'>8057</a>
<a id='n8058' href='#n8058'>8058</a>
<a id='n8059' href='#n8059'>8059</a>
<a id='n8060' href='#n8060'>8060</a>
<a id='n8061' href='#n8061'>8061</a>
<a id='n8062' href='#n8062'>8062</a>
<a id='n8063' href='#n8063'>8063</a>
<a id='n8064' href='#n8064'>8064</a>
<a id='n8065' href='#n8065'>8065</a>
<a id='n8066' href='#n8066'>8066</a>
<a id='n8067' href='#n8067'>8067</a>
<a id='n8068' href='#n8068'>8068</a>
<a id='n8069' href='#n8069'>8069</a>
<a id='n8070' href='#n8070'>8070</a>
<a id='n8071' href='#n8071'>8071</a>
<a id='n8072' href='#n8072'>8072</a>
<a id='n8073' href='#n8073'>8073</a>
<a id='n8074' href='#n8074'>8074</a>
<a id='n8075' href='#n8075'>8075</a>
<a id='n8076' href='#n8076'>8076</a>
<a id='n8077' href='#n8077'>8077</a>
<a id='n8078' href='#n8078'>8078</a>
<a id='n8079' href='#n8079'>8079</a>
<a id='n8080' href='#n8080'>8080</a>
<a id='n8081' href='#n8081'>8081</a>
<a id='n8082' href='#n8082'>8082</a>
<a id='n8083' href='#n8083'>8083</a>
<a id='n8084' href='#n8084'>8084</a>
<a id='n8085' href='#n8085'>8085</a>
<a id='n8086' href='#n8086'>8086</a>
<a id='n8087' href='#n8087'>8087</a>
<a id='n8088' href='#n8088'>8088</a>
<a id='n8089' href='#n8089'>8089</a>
<a id='n8090' href='#n8090'>8090</a>
<a id='n8091' href='#n8091'>8091</a>
<a id='n8092' href='#n8092'>8092</a>
<a id='n8093' href='#n8093'>8093</a>
<a id='n8094' href='#n8094'>8094</a>
<a id='n8095' href='#n8095'>8095</a>
<a id='n8096' href='#n8096'>8096</a>
<a id='n8097' href='#n8097'>8097</a>
<a id='n8098' href='#n8098'>8098</a>
<a id='n8099' href='#n8099'>8099</a>
<a id='n8100' href='#n8100'>8100</a>
<a id='n8101' href='#n8101'>8101</a>
<a id='n8102' href='#n8102'>8102</a>
<a id='n8103' href='#n8103'>8103</a>
<a id='n8104' href='#n8104'>8104</a>
<a id='n8105' href='#n8105'>8105</a>
<a id='n8106' href='#n8106'>8106</a>
<a id='n8107' href='#n8107'>8107</a>
<a id='n8108' href='#n8108'>8108</a>
<a id='n8109' href='#n8109'>8109</a>
<a id='n8110' href='#n8110'>8110</a>
<a id='n8111' href='#n8111'>8111</a>
<a id='n8112' href='#n8112'>8112</a>
<a id='n8113' href='#n8113'>8113</a>
<a id='n8114' href='#n8114'>8114</a>
<a id='n8115' href='#n8115'>8115</a>
<a id='n8116' href='#n8116'>8116</a>
<a id='n8117' href='#n8117'>8117</a>
<a id='n8118' href='#n8118'>8118</a>
<a id='n8119' href='#n8119'>8119</a>
<a id='n8120' href='#n8120'>8120</a>
<a id='n8121' href='#n8121'>8121</a>
<a id='n8122' href='#n8122'>8122</a>
<a id='n8123' href='#n8123'>8123</a>
<a id='n8124' href='#n8124'>8124</a>
<a id='n8125' href='#n8125'>8125</a>
<a id='n8126' href='#n8126'>8126</a>
<a id='n8127' href='#n8127'>8127</a>
<a id='n8128' href='#n8128'>8128</a>
<a id='n8129' href='#n8129'>8129</a>
<a id='n8130' href='#n8130'>8130</a>
<a id='n8131' href='#n8131'>8131</a>
<a id='n8132' href='#n8132'>8132</a>
<a id='n8133' href='#n8133'>8133</a>
<a id='n8134' href='#n8134'>8134</a>
<a id='n8135' href='#n8135'>8135</a>
<a id='n8136' href='#n8136'>8136</a>
<a id='n8137' href='#n8137'>8137</a>
<a id='n8138' href='#n8138'>8138</a>
<a id='n8139' href='#n8139'>8139</a>
<a id='n8140' href='#n8140'>8140</a>
<a id='n8141' href='#n8141'>8141</a>
<a id='n8142' href='#n8142'>8142</a>
<a id='n8143' href='#n8143'>8143</a>
<a id='n8144' href='#n8144'>8144</a>
<a id='n8145' href='#n8145'>8145</a>
<a id='n8146' href='#n8146'>8146</a>
<a id='n8147' href='#n8147'>8147</a>
<a id='n8148' href='#n8148'>8148</a>
<a id='n8149' href='#n8149'>8149</a>
<a id='n8150' href='#n8150'>8150</a>
<a id='n8151' href='#n8151'>8151</a>
<a id='n8152' href='#n8152'>8152</a>
<a id='n8153' href='#n8153'>8153</a>
<a id='n8154' href='#n8154'>8154</a>
<a id='n8155' href='#n8155'>8155</a>
<a id='n8156' href='#n8156'>8156</a>
<a id='n8157' href='#n8157'>8157</a>
<a id='n8158' href='#n8158'>8158</a>
<a id='n8159' href='#n8159'>8159</a>
<a id='n8160' href='#n8160'>8160</a>
<a id='n8161' href='#n8161'>8161</a>
<a id='n8162' href='#n8162'>8162</a>
<a id='n8163' href='#n8163'>8163</a>
<a id='n8164' href='#n8164'>8164</a>
<a id='n8165' href='#n8165'>8165</a>
<a id='n8166' href='#n8166'>8166</a>
<a id='n8167' href='#n8167'>8167</a>
<a id='n8168' href='#n8168'>8168</a>
<a id='n8169' href='#n8169'>8169</a>
<a id='n8170' href='#n8170'>8170</a>
<a id='n8171' href='#n8171'>8171</a>
<a id='n8172' href='#n8172'>8172</a>
<a id='n8173' href='#n8173'>8173</a>
<a id='n8174' href='#n8174'>8174</a>
<a id='n8175' href='#n8175'>8175</a>
<a id='n8176' href='#n8176'>8176</a>
<a id='n8177' href='#n8177'>8177</a>
<a id='n8178' href='#n8178'>8178</a>
<a id='n8179' href='#n8179'>8179</a>
<a id='n8180' href='#n8180'>8180</a>
<a id='n8181' href='#n8181'>8181</a>
<a id='n8182' href='#n8182'>8182</a>
<a id='n8183' href='#n8183'>8183</a>
<a id='n8184' href='#n8184'>8184</a>
<a id='n8185' href='#n8185'>8185</a>
<a id='n8186' href='#n8186'>8186</a>
<a id='n8187' href='#n8187'>8187</a>
<a id='n8188' href='#n8188'>8188</a>
<a id='n8189' href='#n8189'>8189</a>
<a id='n8190' href='#n8190'>8190</a>
<a id='n8191' href='#n8191'>8191</a>
<a id='n8192' href='#n8192'>8192</a>
<a id='n8193' href='#n8193'>8193</a>
<a id='n8194' href='#n8194'>8194</a>
<a id='n8195' href='#n8195'>8195</a>
<a id='n8196' href='#n8196'>8196</a>
<a id='n8197' href='#n8197'>8197</a>
<a id='n8198' href='#n8198'>8198</a>
<a id='n8199' href='#n8199'>8199</a>
<a id='n8200' href='#n8200'>8200</a>
<a id='n8201' href='#n8201'>8201</a>
<a id='n8202' href='#n8202'>8202</a>
<a id='n8203' href='#n8203'>8203</a>
<a id='n8204' href='#n8204'>8204</a>
<a id='n8205' href='#n8205'>8205</a>
<a id='n8206' href='#n8206'>8206</a>
<a id='n8207' href='#n8207'>8207</a>
<a id='n8208' href='#n8208'>8208</a>
<a id='n8209' href='#n8209'>8209</a>
<a id='n8210' href='#n8210'>8210</a>
<a id='n8211' href='#n8211'>8211</a>
<a id='n8212' href='#n8212'>8212</a>
<a id='n8213' href='#n8213'>8213</a>
<a id='n8214' href='#n8214'>8214</a>
<a id='n8215' href='#n8215'>8215</a>
<a id='n8216' href='#n8216'>8216</a>
<a id='n8217' href='#n8217'>8217</a>
<a id='n8218' href='#n8218'>8218</a>
<a id='n8219' href='#n8219'>8219</a>
<a id='n8220' href='#n8220'>8220</a>
<a id='n8221' href='#n8221'>8221</a>
<a id='n8222' href='#n8222'>8222</a>
<a id='n8223' href='#n8223'>8223</a>
<a id='n8224' href='#n8224'>8224</a>
<a id='n8225' href='#n8225'>8225</a>
<a id='n8226' href='#n8226'>8226</a>
<a id='n8227' href='#n8227'>8227</a>
<a id='n8228' href='#n8228'>8228</a>
<a id='n8229' href='#n8229'>8229</a>
<a id='n8230' href='#n8230'>8230</a>
<a id='n8231' href='#n8231'>8231</a>
<a id='n8232' href='#n8232'>8232</a>
<a id='n8233' href='#n8233'>8233</a>
<a id='n8234' href='#n8234'>8234</a>
<a id='n8235' href='#n8235'>8235</a>
<a id='n8236' href='#n8236'>8236</a>
<a id='n8237' href='#n8237'>8237</a>
<a id='n8238' href='#n8238'>8238</a>
<a id='n8239' href='#n8239'>8239</a>
<a id='n8240' href='#n8240'>8240</a>
<a id='n8241' href='#n8241'>8241</a>
<a id='n8242' href='#n8242'>8242</a>
<a id='n8243' href='#n8243'>8243</a>
<a id='n8244' href='#n8244'>8244</a>
<a id='n8245' href='#n8245'>8245</a>
<a id='n8246' href='#n8246'>8246</a>
<a id='n8247' href='#n8247'>8247</a>
<a id='n8248' href='#n8248'>8248</a>
<a id='n8249' href='#n8249'>8249</a>
<a id='n8250' href='#n8250'>8250</a>
<a id='n8251' href='#n8251'>8251</a>
<a id='n8252' href='#n8252'>8252</a>
<a id='n8253' href='#n8253'>8253</a>
<a id='n8254' href='#n8254'>8254</a>
<a id='n8255' href='#n8255'>8255</a>
<a id='n8256' href='#n8256'>8256</a>
<a id='n8257' href='#n8257'>8257</a>
<a id='n8258' href='#n8258'>8258</a>
<a id='n8259' href='#n8259'>8259</a>
<a id='n8260' href='#n8260'>8260</a>
<a id='n8261' href='#n8261'>8261</a>
<a id='n8262' href='#n8262'>8262</a>
<a id='n8263' href='#n8263'>8263</a>
<a id='n8264' href='#n8264'>8264</a>
<a id='n8265' href='#n8265'>8265</a>
<a id='n8266' href='#n8266'>8266</a>
<a id='n8267' href='#n8267'>8267</a>
<a id='n8268' href='#n8268'>8268</a>
<a id='n8269' href='#n8269'>8269</a>
<a id='n8270' href='#n8270'>8270</a>
<a id='n8271' href='#n8271'>8271</a>
<a id='n8272' href='#n8272'>8272</a>
<a id='n8273' href='#n8273'>8273</a>
<a id='n8274' href='#n8274'>8274</a>
<a id='n8275' href='#n8275'>8275</a>
<a id='n8276' href='#n8276'>8276</a>
<a id='n8277' href='#n8277'>8277</a>
<a id='n8278' href='#n8278'>8278</a>
<a id='n8279' href='#n8279'>8279</a>
<a id='n8280' href='#n8280'>8280</a>
<a id='n8281' href='#n8281'>8281</a>
<a id='n8282' href='#n8282'>8282</a>
<a id='n8283' href='#n8283'>8283</a>
<a id='n8284' href='#n8284'>8284</a>
<a id='n8285' href='#n8285'>8285</a>
<a id='n8286' href='#n8286'>8286</a>
<a id='n8287' href='#n8287'>8287</a>
<a id='n8288' href='#n8288'>8288</a>
<a id='n8289' href='#n8289'>8289</a>
<a id='n8290' href='#n8290'>8290</a>
<a id='n8291' href='#n8291'>8291</a>
<a id='n8292' href='#n8292'>8292</a>
<a id='n8293' href='#n8293'>8293</a>
<a id='n8294' href='#n8294'>8294</a>
<a id='n8295' href='#n8295'>8295</a>
<a id='n8296' href='#n8296'>8296</a>
<a id='n8297' href='#n8297'>8297</a>
<a id='n8298' href='#n8298'>8298</a>
<a id='n8299' href='#n8299'>8299</a>
<a id='n8300' href='#n8300'>8300</a>
<a id='n8301' href='#n8301'>8301</a>
<a id='n8302' href='#n8302'>8302</a>
<a id='n8303' href='#n8303'>8303</a>
<a id='n8304' href='#n8304'>8304</a>
<a id='n8305' href='#n8305'>8305</a>
<a id='n8306' href='#n8306'>8306</a>
<a id='n8307' href='#n8307'>8307</a>
<a id='n8308' href='#n8308'>8308</a>
<a id='n8309' href='#n8309'>8309</a>
<a id='n8310' href='#n8310'>8310</a>
<a id='n8311' href='#n8311'>8311</a>
<a id='n8312' href='#n8312'>8312</a>
<a id='n8313' href='#n8313'>8313</a>
<a id='n8314' href='#n8314'>8314</a>
<a id='n8315' href='#n8315'>8315</a>
<a id='n8316' href='#n8316'>8316</a>
<a id='n8317' href='#n8317'>8317</a>
<a id='n8318' href='#n8318'>8318</a>
<a id='n8319' href='#n8319'>8319</a>
<a id='n8320' href='#n8320'>8320</a>
<a id='n8321' href='#n8321'>8321</a>
<a id='n8322' href='#n8322'>8322</a>
<a id='n8323' href='#n8323'>8323</a>
<a id='n8324' href='#n8324'>8324</a>
<a id='n8325' href='#n8325'>8325</a>
<a id='n8326' href='#n8326'>8326</a>
<a id='n8327' href='#n8327'>8327</a>
<a id='n8328' href='#n8328'>8328</a>
<a id='n8329' href='#n8329'>8329</a>
<a id='n8330' href='#n8330'>8330</a>
<a id='n8331' href='#n8331'>8331</a>
<a id='n8332' href='#n8332'>8332</a>
<a id='n8333' href='#n8333'>8333</a>
<a id='n8334' href='#n8334'>8334</a>
<a id='n8335' href='#n8335'>8335</a>
<a id='n8336' href='#n8336'>8336</a>
<a id='n8337' href='#n8337'>8337</a>
<a id='n8338' href='#n8338'>8338</a>
<a id='n8339' href='#n8339'>8339</a>
<a id='n8340' href='#n8340'>8340</a>
<a id='n8341' href='#n8341'>8341</a>
<a id='n8342' href='#n8342'>8342</a>
<a id='n8343' href='#n8343'>8343</a>
<a id='n8344' href='#n8344'>8344</a>
<a id='n8345' href='#n8345'>8345</a>
<a id='n8346' href='#n8346'>8346</a>
<a id='n8347' href='#n8347'>8347</a>
<a id='n8348' href='#n8348'>8348</a>
<a id='n8349' href='#n8349'>8349</a>
<a id='n8350' href='#n8350'>8350</a>
<a id='n8351' href='#n8351'>8351</a>
<a id='n8352' href='#n8352'>8352</a>
<a id='n8353' href='#n8353'>8353</a>
<a id='n8354' href='#n8354'>8354</a>
<a id='n8355' href='#n8355'>8355</a>
<a id='n8356' href='#n8356'>8356</a>
<a id='n8357' href='#n8357'>8357</a>
<a id='n8358' href='#n8358'>8358</a>
<a id='n8359' href='#n8359'>8359</a>
<a id='n8360' href='#n8360'>8360</a>
<a id='n8361' href='#n8361'>8361</a>
<a id='n8362' href='#n8362'>8362</a>
<a id='n8363' href='#n8363'>8363</a>
<a id='n8364' href='#n8364'>8364</a>
<a id='n8365' href='#n8365'>8365</a>
<a id='n8366' href='#n8366'>8366</a>
<a id='n8367' href='#n8367'>8367</a>
<a id='n8368' href='#n8368'>8368</a>
<a id='n8369' href='#n8369'>8369</a>
<a id='n8370' href='#n8370'>8370</a>
<a id='n8371' href='#n8371'>8371</a>
<a id='n8372' href='#n8372'>8372</a>
<a id='n8373' href='#n8373'>8373</a>
<a id='n8374' href='#n8374'>8374</a>
<a id='n8375' href='#n8375'>8375</a>
<a id='n8376' href='#n8376'>8376</a>
<a id='n8377' href='#n8377'>8377</a>
<a id='n8378' href='#n8378'>8378</a>
<a id='n8379' href='#n8379'>8379</a>
<a id='n8380' href='#n8380'>8380</a>
<a id='n8381' href='#n8381'>8381</a>
<a id='n8382' href='#n8382'>8382</a>
<a id='n8383' href='#n8383'>8383</a>
<a id='n8384' href='#n8384'>8384</a>
<a id='n8385' href='#n8385'>8385</a>
<a id='n8386' href='#n8386'>8386</a>
<a id='n8387' href='#n8387'>8387</a>
<a id='n8388' href='#n8388'>8388</a>
<a id='n8389' href='#n8389'>8389</a>
<a id='n8390' href='#n8390'>8390</a>
<a id='n8391' href='#n8391'>8391</a>
<a id='n8392' href='#n8392'>8392</a>
<a id='n8393' href='#n8393'>8393</a>
<a id='n8394' href='#n8394'>8394</a>
<a id='n8395' href='#n8395'>8395</a>
<a id='n8396' href='#n8396'>8396</a>
<a id='n8397' href='#n8397'>8397</a>
<a id='n8398' href='#n8398'>8398</a>
<a id='n8399' href='#n8399'>8399</a>
<a id='n8400' href='#n8400'>8400</a>
<a id='n8401' href='#n8401'>8401</a>
<a id='n8402' href='#n8402'>8402</a>
<a id='n8403' href='#n8403'>8403</a>
<a id='n8404' href='#n8404'>8404</a>
<a id='n8405' href='#n8405'>8405</a>
<a id='n8406' href='#n8406'>8406</a>
<a id='n8407' href='#n8407'>8407</a>
<a id='n8408' href='#n8408'>8408</a>
<a id='n8409' href='#n8409'>8409</a>
<a id='n8410' href='#n8410'>8410</a>
<a id='n8411' href='#n8411'>8411</a>
<a id='n8412' href='#n8412'>8412</a>
<a id='n8413' href='#n8413'>8413</a>
<a id='n8414' href='#n8414'>8414</a>
<a id='n8415' href='#n8415'>8415</a>
<a id='n8416' href='#n8416'>8416</a>
<a id='n8417' href='#n8417'>8417</a>
<a id='n8418' href='#n8418'>8418</a>
<a id='n8419' href='#n8419'>8419</a>
<a id='n8420' href='#n8420'>8420</a>
<a id='n8421' href='#n8421'>8421</a>
<a id='n8422' href='#n8422'>8422</a>
<a id='n8423' href='#n8423'>8423</a>
<a id='n8424' href='#n8424'>8424</a>
<a id='n8425' href='#n8425'>8425</a>
<a id='n8426' href='#n8426'>8426</a>
<a id='n8427' href='#n8427'>8427</a>
<a id='n8428' href='#n8428'>8428</a>
<a id='n8429' href='#n8429'>8429</a>
<a id='n8430' href='#n8430'>8430</a>
<a id='n8431' href='#n8431'>8431</a>
<a id='n8432' href='#n8432'>8432</a>
<a id='n8433' href='#n8433'>8433</a>
<a id='n8434' href='#n8434'>8434</a>
<a id='n8435' href='#n8435'>8435</a>
<a id='n8436' href='#n8436'>8436</a>
<a id='n8437' href='#n8437'>8437</a>
<a id='n8438' href='#n8438'>8438</a>
<a id='n8439' href='#n8439'>8439</a>
<a id='n8440' href='#n8440'>8440</a>
<a id='n8441' href='#n8441'>8441</a>
<a id='n8442' href='#n8442'>8442</a>
<a id='n8443' href='#n8443'>8443</a>
<a id='n8444' href='#n8444'>8444</a>
<a id='n8445' href='#n8445'>8445</a>
<a id='n8446' href='#n8446'>8446</a>
<a id='n8447' href='#n8447'>8447</a>
<a id='n8448' href='#n8448'>8448</a>
<a id='n8449' href='#n8449'>8449</a>
<a id='n8450' href='#n8450'>8450</a>
<a id='n8451' href='#n8451'>8451</a>
<a id='n8452' href='#n8452'>8452</a>
<a id='n8453' href='#n8453'>8453</a>
<a id='n8454' href='#n8454'>8454</a>
<a id='n8455' href='#n8455'>8455</a>
<a id='n8456' href='#n8456'>8456</a>
<a id='n8457' href='#n8457'>8457</a>
<a id='n8458' href='#n8458'>8458</a>
<a id='n8459' href='#n8459'>8459</a>
<a id='n8460' href='#n8460'>8460</a>
<a id='n8461' href='#n8461'>8461</a>
<a id='n8462' href='#n8462'>8462</a>
<a id='n8463' href='#n8463'>8463</a>
<a id='n8464' href='#n8464'>8464</a>
<a id='n8465' href='#n8465'>8465</a>
<a id='n8466' href='#n8466'>8466</a>
<a id='n8467' href='#n8467'>8467</a>
<a id='n8468' href='#n8468'>8468</a>
<a id='n8469' href='#n8469'>8469</a>
<a id='n8470' href='#n8470'>8470</a>
<a id='n8471' href='#n8471'>8471</a>
<a id='n8472' href='#n8472'>8472</a>
<a id='n8473' href='#n8473'>8473</a>
<a id='n8474' href='#n8474'>8474</a>
<a id='n8475' href='#n8475'>8475</a>
<a id='n8476' href='#n8476'>8476</a>
<a id='n8477' href='#n8477'>8477</a>
<a id='n8478' href='#n8478'>8478</a>
<a id='n8479' href='#n8479'>8479</a>
<a id='n8480' href='#n8480'>8480</a>
<a id='n8481' href='#n8481'>8481</a>
<a id='n8482' href='#n8482'>8482</a>
<a id='n8483' href='#n8483'>8483</a>
<a id='n8484' href='#n8484'>8484</a>
<a id='n8485' href='#n8485'>8485</a>
<a id='n8486' href='#n8486'>8486</a>
<a id='n8487' href='#n8487'>8487</a>
<a id='n8488' href='#n8488'>8488</a>
<a id='n8489' href='#n8489'>8489</a>
<a id='n8490' href='#n8490'>8490</a>
<a id='n8491' href='#n8491'>8491</a>
<a id='n8492' href='#n8492'>8492</a>
<a id='n8493' href='#n8493'>8493</a>
<a id='n8494' href='#n8494'>8494</a>
<a id='n8495' href='#n8495'>8495</a>
<a id='n8496' href='#n8496'>8496</a>
<a id='n8497' href='#n8497'>8497</a>
<a id='n8498' href='#n8498'>8498</a>
<a id='n8499' href='#n8499'>8499</a>
<a id='n8500' href='#n8500'>8500</a>
<a id='n8501' href='#n8501'>8501</a>
<a id='n8502' href='#n8502'>8502</a>
<a id='n8503' href='#n8503'>8503</a>
<a id='n8504' href='#n8504'>8504</a>
<a id='n8505' href='#n8505'>8505</a>
<a id='n8506' href='#n8506'>8506</a>
<a id='n8507' href='#n8507'>8507</a>
<a id='n8508' href='#n8508'>8508</a>
<a id='n8509' href='#n8509'>8509</a>
<a id='n8510' href='#n8510'>8510</a>
<a id='n8511' href='#n8511'>8511</a>
<a id='n8512' href='#n8512'>8512</a>
<a id='n8513' href='#n8513'>8513</a>
<a id='n8514' href='#n8514'>8514</a>
<a id='n8515' href='#n8515'>8515</a>
<a id='n8516' href='#n8516'>8516</a>
<a id='n8517' href='#n8517'>8517</a>
<a id='n8518' href='#n8518'>8518</a>
<a id='n8519' href='#n8519'>8519</a>
<a id='n8520' href='#n8520'>8520</a>
<a id='n8521' href='#n8521'>8521</a>
<a id='n8522' href='#n8522'>8522</a>
<a id='n8523' href='#n8523'>8523</a>
<a id='n8524' href='#n8524'>8524</a>
<a id='n8525' href='#n8525'>8525</a>
<a id='n8526' href='#n8526'>8526</a>
<a id='n8527' href='#n8527'>8527</a>
<a id='n8528' href='#n8528'>8528</a>
<a id='n8529' href='#n8529'>8529</a>
<a id='n8530' href='#n8530'>8530</a>
<a id='n8531' href='#n8531'>8531</a>
<a id='n8532' href='#n8532'>8532</a>
<a id='n8533' href='#n8533'>8533</a>
<a id='n8534' href='#n8534'>8534</a>
<a id='n8535' href='#n8535'>8535</a>
<a id='n8536' href='#n8536'>8536</a>
<a id='n8537' href='#n8537'>8537</a>
<a id='n8538' href='#n8538'>8538</a>
<a id='n8539' href='#n8539'>8539</a>
<a id='n8540' href='#n8540'>8540</a>
<a id='n8541' href='#n8541'>8541</a>
<a id='n8542' href='#n8542'>8542</a>
<a id='n8543' href='#n8543'>8543</a>
<a id='n8544' href='#n8544'>8544</a>
<a id='n8545' href='#n8545'>8545</a>
<a id='n8546' href='#n8546'>8546</a>
<a id='n8547' href='#n8547'>8547</a>
<a id='n8548' href='#n8548'>8548</a>
<a id='n8549' href='#n8549'>8549</a>
<a id='n8550' href='#n8550'>8550</a>
<a id='n8551' href='#n8551'>8551</a>
<a id='n8552' href='#n8552'>8552</a>
<a id='n8553' href='#n8553'>8553</a>
<a id='n8554' href='#n8554'>8554</a>
<a id='n8555' href='#n8555'>8555</a>
<a id='n8556' href='#n8556'>8556</a>
<a id='n8557' href='#n8557'>8557</a>
<a id='n8558' href='#n8558'>8558</a>
<a id='n8559' href='#n8559'>8559</a>
<a id='n8560' href='#n8560'>8560</a>
<a id='n8561' href='#n8561'>8561</a>
<a id='n8562' href='#n8562'>8562</a>
<a id='n8563' href='#n8563'>8563</a>
<a id='n8564' href='#n8564'>8564</a>
<a id='n8565' href='#n8565'>8565</a>
<a id='n8566' href='#n8566'>8566</a>
<a id='n8567' href='#n8567'>8567</a>
<a id='n8568' href='#n8568'>8568</a>
<a id='n8569' href='#n8569'>8569</a>
<a id='n8570' href='#n8570'>8570</a>
<a id='n8571' href='#n8571'>8571</a>
<a id='n8572' href='#n8572'>8572</a>
<a id='n8573' href='#n8573'>8573</a>
<a id='n8574' href='#n8574'>8574</a>
<a id='n8575' href='#n8575'>8575</a>
<a id='n8576' href='#n8576'>8576</a>
<a id='n8577' href='#n8577'>8577</a>
<a id='n8578' href='#n8578'>8578</a>
<a id='n8579' href='#n8579'>8579</a>
<a id='n8580' href='#n8580'>8580</a>
<a id='n8581' href='#n8581'>8581</a>
<a id='n8582' href='#n8582'>8582</a>
<a id='n8583' href='#n8583'>8583</a>
<a id='n8584' href='#n8584'>8584</a>
<a id='n8585' href='#n8585'>8585</a>
<a id='n8586' href='#n8586'>8586</a>
<a id='n8587' href='#n8587'>8587</a>
<a id='n8588' href='#n8588'>8588</a>
<a id='n8589' href='#n8589'>8589</a>
<a id='n8590' href='#n8590'>8590</a>
<a id='n8591' href='#n8591'>8591</a>
<a id='n8592' href='#n8592'>8592</a>
<a id='n8593' href='#n8593'>8593</a>
<a id='n8594' href='#n8594'>8594</a>
<a id='n8595' href='#n8595'>8595</a>
<a id='n8596' href='#n8596'>8596</a>
<a id='n8597' href='#n8597'>8597</a>
<a id='n8598' href='#n8598'>8598</a>
<a id='n8599' href='#n8599'>8599</a>
<a id='n8600' href='#n8600'>8600</a>
<a id='n8601' href='#n8601'>8601</a>
<a id='n8602' href='#n8602'>8602</a>
<a id='n8603' href='#n8603'>8603</a>
<a id='n8604' href='#n8604'>8604</a>
<a id='n8605' href='#n8605'>8605</a>
<a id='n8606' href='#n8606'>8606</a>
<a id='n8607' href='#n8607'>8607</a>
<a id='n8608' href='#n8608'>8608</a>
<a id='n8609' href='#n8609'>8609</a>
<a id='n8610' href='#n8610'>8610</a>
<a id='n8611' href='#n8611'>8611</a>
<a id='n8612' href='#n8612'>8612</a>
<a id='n8613' href='#n8613'>8613</a>
<a id='n8614' href='#n8614'>8614</a>
<a id='n8615' href='#n8615'>8615</a>
<a id='n8616' href='#n8616'>8616</a>
<a id='n8617' href='#n8617'>8617</a>
<a id='n8618' href='#n8618'>8618</a>
<a id='n8619' href='#n8619'>8619</a>
<a id='n8620' href='#n8620'>8620</a>
<a id='n8621' href='#n8621'>8621</a>
<a id='n8622' href='#n8622'>8622</a>
<a id='n8623' href='#n8623'>8623</a>
<a id='n8624' href='#n8624'>8624</a>
<a id='n8625' href='#n8625'>8625</a>
<a id='n8626' href='#n8626'>8626</a>
<a id='n8627' href='#n8627'>8627</a>
<a id='n8628' href='#n8628'>8628</a>
<a id='n8629' href='#n8629'>8629</a>
<a id='n8630' href='#n8630'>8630</a>
<a id='n8631' href='#n8631'>8631</a>
<a id='n8632' href='#n8632'>8632</a>
<a id='n8633' href='#n8633'>8633</a>
<a id='n8634' href='#n8634'>8634</a>
<a id='n8635' href='#n8635'>8635</a>
<a id='n8636' href='#n8636'>8636</a>
<a id='n8637' href='#n8637'>8637</a>
<a id='n8638' href='#n8638'>8638</a>
<a id='n8639' href='#n8639'>8639</a>
<a id='n8640' href='#n8640'>8640</a>
<a id='n8641' href='#n8641'>8641</a>
<a id='n8642' href='#n8642'>8642</a>
<a id='n8643' href='#n8643'>8643</a>
<a id='n8644' href='#n8644'>8644</a>
<a id='n8645' href='#n8645'>8645</a>
<a id='n8646' href='#n8646'>8646</a>
<a id='n8647' href='#n8647'>8647</a>
<a id='n8648' href='#n8648'>8648</a>
<a id='n8649' href='#n8649'>8649</a>
<a id='n8650' href='#n8650'>8650</a>
<a id='n8651' href='#n8651'>8651</a>
<a id='n8652' href='#n8652'>8652</a>
<a id='n8653' href='#n8653'>8653</a>
<a id='n8654' href='#n8654'>8654</a>
<a id='n8655' href='#n8655'>8655</a>
<a id='n8656' href='#n8656'>8656</a>
<a id='n8657' href='#n8657'>8657</a>
<a id='n8658' href='#n8658'>8658</a>
<a id='n8659' href='#n8659'>8659</a>
<a id='n8660' href='#n8660'>8660</a>
<a id='n8661' href='#n8661'>8661</a>
<a id='n8662' href='#n8662'>8662</a>
<a id='n8663' href='#n8663'>8663</a>
<a id='n8664' href='#n8664'>8664</a>
<a id='n8665' href='#n8665'>8665</a>
<a id='n8666' href='#n8666'>8666</a>
<a id='n8667' href='#n8667'>8667</a>
<a id='n8668' href='#n8668'>8668</a>
<a id='n8669' href='#n8669'>8669</a>
<a id='n8670' href='#n8670'>8670</a>
<a id='n8671' href='#n8671'>8671</a>
<a id='n8672' href='#n8672'>8672</a>
<a id='n8673' href='#n8673'>8673</a>
<a id='n8674' href='#n8674'>8674</a>
<a id='n8675' href='#n8675'>8675</a>
<a id='n8676' href='#n8676'>8676</a>
<a id='n8677' href='#n8677'>8677</a>
<a id='n8678' href='#n8678'>8678</a>
<a id='n8679' href='#n8679'>8679</a>
<a id='n8680' href='#n8680'>8680</a>
<a id='n8681' href='#n8681'>8681</a>
<a id='n8682' href='#n8682'>8682</a>
<a id='n8683' href='#n8683'>8683</a>
<a id='n8684' href='#n8684'>8684</a>
<a id='n8685' href='#n8685'>8685</a>
<a id='n8686' href='#n8686'>8686</a>
<a id='n8687' href='#n8687'>8687</a>
<a id='n8688' href='#n8688'>8688</a>
<a id='n8689' href='#n8689'>8689</a>
<a id='n8690' href='#n8690'>8690</a>
<a id='n8691' href='#n8691'>8691</a>
<a id='n8692' href='#n8692'>8692</a>
<a id='n8693' href='#n8693'>8693</a>
<a id='n8694' href='#n8694'>8694</a>
<a id='n8695' href='#n8695'>8695</a>
<a id='n8696' href='#n8696'>8696</a>
<a id='n8697' href='#n8697'>8697</a>
<a id='n8698' href='#n8698'>8698</a>
<a id='n8699' href='#n8699'>8699</a>
<a id='n8700' href='#n8700'>8700</a>
<a id='n8701' href='#n8701'>8701</a>
<a id='n8702' href='#n8702'>8702</a>
<a id='n8703' href='#n8703'>8703</a>
<a id='n8704' href='#n8704'>8704</a>
<a id='n8705' href='#n8705'>8705</a>
<a id='n8706' href='#n8706'>8706</a>
<a id='n8707' href='#n8707'>8707</a>
<a id='n8708' href='#n8708'>8708</a>
<a id='n8709' href='#n8709'>8709</a>
<a id='n8710' href='#n8710'>8710</a>
<a id='n8711' href='#n8711'>8711</a>
<a id='n8712' href='#n8712'>8712</a>
<a id='n8713' href='#n8713'>8713</a>
<a id='n8714' href='#n8714'>8714</a>
<a id='n8715' href='#n8715'>8715</a>
<a id='n8716' href='#n8716'>8716</a>
<a id='n8717' href='#n8717'>8717</a>
<a id='n8718' href='#n8718'>8718</a>
<a id='n8719' href='#n8719'>8719</a>
<a id='n8720' href='#n8720'>8720</a>
<a id='n8721' href='#n8721'>8721</a>
<a id='n8722' href='#n8722'>8722</a>
<a id='n8723' href='#n8723'>8723</a>
<a id='n8724' href='#n8724'>8724</a>
<a id='n8725' href='#n8725'>8725</a>
<a id='n8726' href='#n8726'>8726</a>
<a id='n8727' href='#n8727'>8727</a>
<a id='n8728' href='#n8728'>8728</a>
<a id='n8729' href='#n8729'>8729</a>
<a id='n8730' href='#n8730'>8730</a>
<a id='n8731' href='#n8731'>8731</a>
<a id='n8732' href='#n8732'>8732</a>
<a id='n8733' href='#n8733'>8733</a>
<a id='n8734' href='#n8734'>8734</a>
<a id='n8735' href='#n8735'>8735</a>
<a id='n8736' href='#n8736'>8736</a>
<a id='n8737' href='#n8737'>8737</a>
<a id='n8738' href='#n8738'>8738</a>
<a id='n8739' href='#n8739'>8739</a>
<a id='n8740' href='#n8740'>8740</a>
<a id='n8741' href='#n8741'>8741</a>
<a id='n8742' href='#n8742'>8742</a>
<a id='n8743' href='#n8743'>8743</a>
<a id='n8744' href='#n8744'>8744</a>
<a id='n8745' href='#n8745'>8745</a>
<a id='n8746' href='#n8746'>8746</a>
<a id='n8747' href='#n8747'>8747</a>
<a id='n8748' href='#n8748'>8748</a>
<a id='n8749' href='#n8749'>8749</a>
<a id='n8750' href='#n8750'>8750</a>
<a id='n8751' href='#n8751'>8751</a>
<a id='n8752' href='#n8752'>8752</a>
<a id='n8753' href='#n8753'>8753</a>
<a id='n8754' href='#n8754'>8754</a>
<a id='n8755' href='#n8755'>8755</a>
<a id='n8756' href='#n8756'>8756</a>
<a id='n8757' href='#n8757'>8757</a>
<a id='n8758' href='#n8758'>8758</a>
<a id='n8759' href='#n8759'>8759</a>
<a id='n8760' href='#n8760'>8760</a>
<a id='n8761' href='#n8761'>8761</a>
<a id='n8762' href='#n8762'>8762</a>
<a id='n8763' href='#n8763'>8763</a>
<a id='n8764' href='#n8764'>8764</a>
<a id='n8765' href='#n8765'>8765</a>
<a id='n8766' href='#n8766'>8766</a>
<a id='n8767' href='#n8767'>8767</a>
<a id='n8768' href='#n8768'>8768</a>
<a id='n8769' href='#n8769'>8769</a>
<a id='n8770' href='#n8770'>8770</a>
<a id='n8771' href='#n8771'>8771</a>
<a id='n8772' href='#n8772'>8772</a>
<a id='n8773' href='#n8773'>8773</a>
<a id='n8774' href='#n8774'>8774</a>
<a id='n8775' href='#n8775'>8775</a>
<a id='n8776' href='#n8776'>8776</a>
<a id='n8777' href='#n8777'>8777</a>
<a id='n8778' href='#n8778'>8778</a>
<a id='n8779' href='#n8779'>8779</a>
<a id='n8780' href='#n8780'>8780</a>
<a id='n8781' href='#n8781'>8781</a>
<a id='n8782' href='#n8782'>8782</a>
<a id='n8783' href='#n8783'>8783</a>
<a id='n8784' href='#n8784'>8784</a>
<a id='n8785' href='#n8785'>8785</a>
<a id='n8786' href='#n8786'>8786</a>
<a id='n8787' href='#n8787'>8787</a>
<a id='n8788' href='#n8788'>8788</a>
<a id='n8789' href='#n8789'>8789</a>
<a id='n8790' href='#n8790'>8790</a>
<a id='n8791' href='#n8791'>8791</a>
<a id='n8792' href='#n8792'>8792</a>
<a id='n8793' href='#n8793'>8793</a>
<a id='n8794' href='#n8794'>8794</a>
<a id='n8795' href='#n8795'>8795</a>
<a id='n8796' href='#n8796'>8796</a>
<a id='n8797' href='#n8797'>8797</a>
<a id='n8798' href='#n8798'>8798</a>
<a id='n8799' href='#n8799'>8799</a>
<a id='n8800' href='#n8800'>8800</a>
<a id='n8801' href='#n8801'>8801</a>
<a id='n8802' href='#n8802'>8802</a>
<a id='n8803' href='#n8803'>8803</a>
<a id='n8804' href='#n8804'>8804</a>
<a id='n8805' href='#n8805'>8805</a>
<a id='n8806' href='#n8806'>8806</a>
<a id='n8807' href='#n8807'>8807</a>
<a id='n8808' href='#n8808'>8808</a>
<a id='n8809' href='#n8809'>8809</a>
<a id='n8810' href='#n8810'>8810</a>
<a id='n8811' href='#n8811'>8811</a>
<a id='n8812' href='#n8812'>8812</a>
<a id='n8813' href='#n8813'>8813</a>
<a id='n8814' href='#n8814'>8814</a>
<a id='n8815' href='#n8815'>8815</a>
<a id='n8816' href='#n8816'>8816</a>
<a id='n8817' href='#n8817'>8817</a>
<a id='n8818' href='#n8818'>8818</a>
<a id='n8819' href='#n8819'>8819</a>
<a id='n8820' href='#n8820'>8820</a>
<a id='n8821' href='#n8821'>8821</a>
<a id='n8822' href='#n8822'>8822</a>
<a id='n8823' href='#n8823'>8823</a>
<a id='n8824' href='#n8824'>8824</a>
<a id='n8825' href='#n8825'>8825</a>
<a id='n8826' href='#n8826'>8826</a>
<a id='n8827' href='#n8827'>8827</a>
<a id='n8828' href='#n8828'>8828</a>
<a id='n8829' href='#n8829'>8829</a>
<a id='n8830' href='#n8830'>8830</a>
<a id='n8831' href='#n8831'>8831</a>
<a id='n8832' href='#n8832'>8832</a>
<a id='n8833' href='#n8833'>8833</a>
<a id='n8834' href='#n8834'>8834</a>
<a id='n8835' href='#n8835'>8835</a>
<a id='n8836' href='#n8836'>8836</a>
<a id='n8837' href='#n8837'>8837</a>
<a id='n8838' href='#n8838'>8838</a>
<a id='n8839' href='#n8839'>8839</a>
<a id='n8840' href='#n8840'>8840</a>
<a id='n8841' href='#n8841'>8841</a>
<a id='n8842' href='#n8842'>8842</a>
<a id='n8843' href='#n8843'>8843</a>
<a id='n8844' href='#n8844'>8844</a>
<a id='n8845' href='#n8845'>8845</a>
<a id='n8846' href='#n8846'>8846</a>
<a id='n8847' href='#n8847'>8847</a>
<a id='n8848' href='#n8848'>8848</a>
<a id='n8849' href='#n8849'>8849</a>
<a id='n8850' href='#n8850'>8850</a>
<a id='n8851' href='#n8851'>8851</a>
<a id='n8852' href='#n8852'>8852</a>
<a id='n8853' href='#n8853'>8853</a>
<a id='n8854' href='#n8854'>8854</a>
<a id='n8855' href='#n8855'>8855</a>
</pre></td>
<td class='lines'><pre><code><span class="hl com">/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *</span>
<span class="hl com"> * Copyright by The HDF Group.                                               *</span>
<span class="hl com"> * Copyright by the Board of Trustees of the University of Illinois.         *</span>
<span class="hl com"> * All rights reserved.                                                      *</span>
<span class="hl com"> *                                                                           *</span>
<span class="hl com"> * This file is part of HDF5.  The full HDF5 copyright notice, including     *</span>
<span class="hl com"> * terms governing use, modification, and redistribution, is contained in    *</span>
<span class="hl com"> * the files COPYING and Copyright.html.  COPYING can be found at the root   *</span>
<span class="hl com"> * of the source code distribution tree; Copyright.html can be found at the  *</span>
<span class="hl com"> * root level of an installed copy of the electronic HDF5 document set and   *</span>
<span class="hl com"> * is linked from the top-level documents page.  It can also be found at     *</span>
<span class="hl com"> * http://hdfgroup.org/HDF5/doc/Copyright.html.  If you do not have          *</span>
<span class="hl com"> * access to either file, you may request a copy from help&#64;hdfgroup.org.     *</span>
<span class="hl com"> * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */</span>

<span class="hl com">/*</span>
<span class="hl com"> * Programmer:  Quincey Koziol &lt;koziol&#64;ncsa.uiuc.edu&gt;</span>
<span class="hl com"> *              Thursday, June 18, 1998</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Hyperslab selection data space I/O functions.</span>
<span class="hl com"> */</span>

<span class="hl ppc">#define H5S_PACKAGE</span>		<span class="hl com">/*suppress error about including H5Spkg	  */</span><span class="hl ppc"></span>


<span class="hl ppc">#include</span> <span class="hl pps">&quot;H5private.h&quot;</span><span class="hl ppc"></span>		<span class="hl com">/* Generic Functions			*/</span><span class="hl ppc"></span>
<span class="hl ppc">#include</span> <span class="hl pps">&quot;H5Eprivate.h&quot;</span><span class="hl ppc"></span>		<span class="hl com">/* Error handling			*/</span><span class="hl ppc"></span>
<span class="hl ppc">#include</span> <span class="hl pps">&quot;H5FLprivate.h&quot;</span><span class="hl ppc"></span>	<span class="hl com">/* Free Lists				*/</span><span class="hl ppc"></span>
<span class="hl ppc">#include</span> <span class="hl pps">&quot;H5Iprivate.h&quot;</span><span class="hl ppc"></span>		<span class="hl com">/* ID Functions				*/</span><span class="hl ppc"></span>
<span class="hl ppc">#include</span> <span class="hl pps">&quot;H5Spkg.h&quot;</span><span class="hl ppc"></span>		<span class="hl com">/* Dataspace functions			*/</span><span class="hl ppc"></span>
<span class="hl ppc">#include</span> <span class="hl pps">&quot;H5Vprivate.h&quot;</span><span class="hl ppc"></span>         <span class="hl com">/* Vector functions			*/</span><span class="hl ppc"></span>

<span class="hl com">/* Local datatypes */</span>

<span class="hl com">/* Static function prototypes */</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>span_info<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_free_span</span><span class="hl opt">(</span>H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">);</span>
<span class="hl kwb">static</span> H5S_hyper_span_info_t <span class="hl opt">*</span><span class="hl kwd">H5S_hyper_copy_span</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">);</span>
<span class="hl kwb">static void</span> <span class="hl kwd">H5S_hyper_span_scratch</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> <span class="hl kwb">void</span> <span class="hl opt">*</span>scr_value<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_span_precompute</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> <span class="hl kwb">size_t</span> elmt_size<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_generate_hyperslab</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> H5S_seloper_t op<span class="hl opt">,</span>
    <span class="hl kwb">const</span> hsize_t start<span class="hl opt">[],</span> <span class="hl kwb">const</span> hsize_t stride<span class="hl opt">[],</span> <span class="hl kwb">const</span> hsize_t count<span class="hl opt">[],</span> <span class="hl kwb">const</span> hsize_t block<span class="hl opt">[]);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_generate_spans</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">);</span>
<span class="hl com">/* Needed for use in hyperslab code (H5Shyper.c) */</span>
<span class="hl ppc">#ifdef NEW_HYPERSLAB_API</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_select_select</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space1<span class="hl opt">,</span> H5S_seloper_t op<span class="hl opt">,</span> H5S_t <span class="hl opt">*</span>space2<span class="hl opt">);</span>
<span class="hl ppc">#endif</span> <span class="hl com">/*NEW_HYPERSLAB_API*/</span><span class="hl ppc"></span>

<span class="hl com">/* Selection callbacks */</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_copy</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>dst<span class="hl opt">,</span> <span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>src<span class="hl opt">,</span> hbool_t share_selection<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_get_seq_list</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">unsigned</span> flags<span class="hl opt">,</span>
    H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">,</span> <span class="hl kwb">size_t</span> maxseq<span class="hl opt">,</span> <span class="hl kwb">size_t</span> maxbytes<span class="hl opt">,</span>
    <span class="hl kwb">size_t</span> <span class="hl opt">*</span>nseq<span class="hl opt">,</span> <span class="hl kwb">size_t</span> <span class="hl opt">*</span>nbytes<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>off<span class="hl opt">,</span> <span class="hl kwb">size_t</span> <span class="hl opt">*</span>len<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_release</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">);</span>
<span class="hl kwb">static</span> htri_t <span class="hl kwd">H5S_hyper_is_valid</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">);</span>
<span class="hl kwb">static</span> hssize_t <span class="hl kwd">H5S_hyper_serial_size</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_serialize</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">uint8_t</span> <span class="hl opt">*</span>buf<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_deserialize</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">const uint8_t</span> <span class="hl opt">*</span>buf<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_bounds</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>start<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>end<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_offset</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>offset<span class="hl opt">);</span>
<span class="hl kwb">static</span> htri_t <span class="hl kwd">H5S_hyper_is_contiguous</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">);</span>
<span class="hl kwb">static</span> htri_t <span class="hl kwd">H5S_hyper_is_single</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">);</span>
<span class="hl kwb">static</span> htri_t <span class="hl kwd">H5S_hyper_is_regular</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_adjust_u</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>offset<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_project_scalar</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>offset<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_project_simple</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> H5S_t <span class="hl opt">*</span>new_space<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>offset<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_iter_init</span><span class="hl opt">(</span>H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">,</span> <span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">);</span>

<span class="hl com">/* Selection iteration callbacks */</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_iter_coords</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>coords<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_iter_block</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>start<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>end<span class="hl opt">);</span>
<span class="hl kwb">static</span> hsize_t <span class="hl kwd">H5S_hyper_iter_nelmts</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">);</span>
<span class="hl kwb">static</span> htri_t <span class="hl kwd">H5S_hyper_iter_has_next_block</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_sel_iter_t <span class="hl opt">*</span>sel_iter<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_iter_next</span><span class="hl opt">(</span>H5S_sel_iter_t <span class="hl opt">*</span>sel_iter<span class="hl opt">,</span> <span class="hl kwb">size_t</span> nelem<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_iter_next_block</span><span class="hl opt">(</span>H5S_sel_iter_t <span class="hl opt">*</span>sel_iter<span class="hl opt">);</span>
<span class="hl kwb">static</span> herr_t <span class="hl kwd">H5S_hyper_iter_release</span><span class="hl opt">(</span>H5S_sel_iter_t <span class="hl opt">*</span>sel_iter<span class="hl opt">);</span>

<span class="hl com">/* Static function for optimizing hyperslab */</span>
<span class="hl kwb">static</span> hbool_t <span class="hl kwd">H5S_hyper_rebuild_helper</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">,</span>
    H5S_hyper_dim_t span_slab_info<span class="hl opt">[],</span> <span class="hl kwb">unsigned</span> rank<span class="hl opt">);</span>
<span class="hl kwb">static</span> htri_t <span class="hl kwd">H5S_hyper_rebuild</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">);</span>

<span class="hl com">/* Selection properties for hyperslab selections */</span>
<span class="hl kwb">const</span> H5S_select_class_t H5S_sel_hyper<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">] = {{</span>
    H5S_SEL_HYPERSLABS<span class="hl opt">,</span>

    <span class="hl com">/* Methods on selection */</span>
    H5S_hyper_copy<span class="hl opt">,</span>
    H5S_hyper_get_seq_list<span class="hl opt">,</span>
    H5S_hyper_release<span class="hl opt">,</span>
    H5S_hyper_is_valid<span class="hl opt">,</span>
    H5S_hyper_serial_size<span class="hl opt">,</span>
    H5S_hyper_serialize<span class="hl opt">,</span>
    H5S_hyper_deserialize<span class="hl opt">,</span>
    H5S_hyper_bounds<span class="hl opt">,</span>
    H5S_hyper_offset<span class="hl opt">,</span>
    H5S_hyper_is_contiguous<span class="hl opt">,</span>
    H5S_hyper_is_single<span class="hl opt">,</span>
    H5S_hyper_is_regular<span class="hl opt">,</span>
    H5S_hyper_adjust_u<span class="hl opt">,</span>
    H5S_hyper_project_scalar<span class="hl opt">,</span>
    H5S_hyper_project_simple<span class="hl opt">,</span>
    H5S_hyper_iter_init<span class="hl opt">,</span>
<span class="hl opt">}};</span>

<span class="hl com">/* Iteration properties for hyperslab selections */</span>
<span class="hl kwb">static const</span> H5S_sel_iter_class_t H5S_sel_iter_hyper<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">] = {{</span>
    H5S_SEL_HYPERSLABS<span class="hl opt">,</span>

    <span class="hl com">/* Methods on selection iterator */</span>
    H5S_hyper_iter_coords<span class="hl opt">,</span>
    H5S_hyper_iter_block<span class="hl opt">,</span>
    H5S_hyper_iter_nelmts<span class="hl opt">,</span>
    H5S_hyper_iter_has_next_block<span class="hl opt">,</span>
    H5S_hyper_iter_next<span class="hl opt">,</span>
    H5S_hyper_iter_next_block<span class="hl opt">,</span>
    H5S_hyper_iter_release<span class="hl opt">,</span>
<span class="hl opt">}};</span>

<span class="hl com">/* Static variables */</span>

<span class="hl com">/* Array for default stride, block, etc. */</span>
<span class="hl kwb">static const</span> hsize_t _ones<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">]={</span>
    <span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span> <span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span>
    <span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span> <span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span>
    <span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span> <span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span>
    <span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span> <span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">,</span><span class="hl num">1</span><span class="hl opt">};</span>

<span class="hl com">/* Declare a free list to manage the H5S_hyper_sel_t struct */</span>
<span class="hl kwd">H5FL_DEFINE_STATIC</span><span class="hl opt">(</span>H5S_hyper_sel_t<span class="hl opt">);</span>

<span class="hl com">/* Declare a free list to manage the H5S_hyper_span_t struct */</span>
<span class="hl kwd">H5FL_DEFINE_STATIC</span><span class="hl opt">(</span>H5S_hyper_span_t<span class="hl opt">);</span>

<span class="hl com">/* Declare a free list to manage the H5S_hyper_span_info_t struct */</span>
<span class="hl kwd">H5FL_DEFINE_STATIC</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">);</span>

<span class="hl com">/* #define H5S_HYPER_DEBUG */</span>
<span class="hl ppc">#ifdef H5S_HYPER_DEBUG</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_print_spans_helper</span><span class="hl opt">(</span><span class="hl kwb">FILE</span> <span class="hl opt">*</span>f<span class="hl opt">,</span> <span class="hl kwb">struct</span> H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">,</span><span class="hl kwb">unsigned</span> depth<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_print_spans_helper<span class="hl opt">)</span>

    <span class="hl kwa">while</span><span class="hl opt">(</span>span<span class="hl opt">) {</span>
        <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%s: depth=%u, span=%p, (%d, %d), nelem=%u, pstride=%u</span><span class="hl esc">\n</span><span class="hl str">&quot;</span><span class="hl opt">,</span>FUNC<span class="hl opt">,</span>depth<span class="hl opt">,</span>span<span class="hl opt">,(</span><span class="hl kwb">int</span><span class="hl opt">)</span>span<span class="hl opt">-&gt;</span>low<span class="hl opt">,(</span><span class="hl kwb">int</span><span class="hl opt">)</span>span<span class="hl opt">-&gt;</span>high<span class="hl opt">,(</span><span class="hl kwb">unsigned</span><span class="hl opt">)</span>span<span class="hl opt">-&gt;</span>nelem<span class="hl opt">,(</span><span class="hl kwb">unsigned</span><span class="hl opt">)</span>span<span class="hl opt">-&gt;</span>pstride<span class="hl opt">);</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down <span class="hl opt">&amp;&amp;</span> span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">) {</span>
            <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%s: spans=%p, count=%u, scratch=%p, head=%p</span><span class="hl esc">\n</span><span class="hl str">&quot;</span><span class="hl opt">,</span>FUNC<span class="hl opt">,</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>count<span class="hl opt">,</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>scratch<span class="hl opt">,</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">);</span>
            <span class="hl kwd">H5S_hyper_print_spans_helper</span><span class="hl opt">(</span>f<span class="hl opt">,</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">,</span>depth<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        span<span class="hl opt">=</span>span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>

herr_t
<span class="hl kwd">H5S_hyper_print_spans</span><span class="hl opt">(</span><span class="hl kwb">FILE</span> <span class="hl opt">*</span>f<span class="hl opt">,</span> <span class="hl kwb">const struct</span> H5S_hyper_span_info_t <span class="hl opt">*</span>span_lst<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_print_spans<span class="hl opt">)</span>

    <span class="hl kwa">if</span><span class="hl opt">(</span>span_lst<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%s: spans=%p, count=%u, scratch=%p, head=%p</span><span class="hl esc">\n</span><span class="hl str">&quot;</span><span class="hl opt">,</span>FUNC<span class="hl opt">,</span>span_lst<span class="hl opt">,</span>span_lst<span class="hl opt">-&gt;</span>count<span class="hl opt">,</span>span_lst<span class="hl opt">-&gt;</span>scratch<span class="hl opt">,</span>span_lst<span class="hl opt">-&gt;</span>head<span class="hl opt">);</span>
        <span class="hl kwd">H5S_hyper_print_spans_helper</span><span class="hl opt">(</span>f<span class="hl opt">,</span>span_lst<span class="hl opt">-&gt;</span>head<span class="hl opt">,</span><span class="hl num">0</span><span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>

herr_t
<span class="hl kwd">H5S_space_print_spans</span><span class="hl opt">(</span><span class="hl kwb">FILE</span> <span class="hl opt">*</span>f<span class="hl opt">,</span> <span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_space_print_spans<span class="hl opt">)</span>

    <span class="hl kwd">H5S_hyper_print_spans</span><span class="hl opt">(</span>f<span class="hl opt">,</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>

<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_print_diminfo_helper</span><span class="hl opt">(</span><span class="hl kwb">FILE</span> <span class="hl opt">*</span>f<span class="hl opt">,</span> <span class="hl kwb">const char</span> <span class="hl opt">*</span>field<span class="hl opt">,</span> <span class="hl kwb">unsigned</span> ndims<span class="hl opt">,</span> <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>dinfo<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                 <span class="hl com">/* Local index variable */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_print_diminfo_helper<span class="hl opt">)</span>

    <span class="hl kwa">if</span><span class="hl opt">(</span>dinfo<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%s: %s: start=[&quot;</span><span class="hl opt">,</span>FUNC<span class="hl opt">,</span>field<span class="hl opt">);</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>ndims<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%Hd%s&quot;</span><span class="hl opt">,</span>dinfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">, (</span>u<span class="hl opt">&lt;(</span>ndims<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)</span> ? <span class="hl str">&quot;, &quot;</span> <span class="hl opt">:</span> <span class="hl str">&quot;]</span><span class="hl esc">\n</span><span class="hl str">&quot;</span><span class="hl opt">));</span>
        <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%s: %s: stride=[&quot;</span><span class="hl opt">,</span>FUNC<span class="hl opt">,</span>field<span class="hl opt">);</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>ndims<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%Hu%s&quot;</span><span class="hl opt">,</span>dinfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride<span class="hl opt">, (</span>u<span class="hl opt">&lt;(</span>ndims<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)</span> ? <span class="hl str">&quot;, &quot;</span> <span class="hl opt">:</span> <span class="hl str">&quot;]</span><span class="hl esc">\n</span><span class="hl str">&quot;</span><span class="hl opt">));</span>
        <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%s: %s: count=[&quot;</span><span class="hl opt">,</span>FUNC<span class="hl opt">,</span>field<span class="hl opt">);</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>ndims<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%Hu%s&quot;</span><span class="hl opt">,</span>dinfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">, (</span>u<span class="hl opt">&lt;(</span>ndims<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)</span> ? <span class="hl str">&quot;, &quot;</span> <span class="hl opt">:</span> <span class="hl str">&quot;]</span><span class="hl esc">\n</span><span class="hl str">&quot;</span><span class="hl opt">));</span>
        <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%s: %s: block=[&quot;</span><span class="hl opt">,</span>FUNC<span class="hl opt">,</span>field<span class="hl opt">);</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>ndims<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%Hu%s&quot;</span><span class="hl opt">,</span>dinfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block<span class="hl opt">, (</span>u<span class="hl opt">&lt;(</span>ndims<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)</span> ? <span class="hl str">&quot;, &quot;</span> <span class="hl opt">:</span> <span class="hl str">&quot;]</span><span class="hl esc">\n</span><span class="hl str">&quot;</span><span class="hl opt">));</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span>
        <span class="hl kwd">HDfprintf</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;%s: %s==NULL</span><span class="hl esc">\n</span><span class="hl str">&quot;</span><span class="hl opt">,</span>FUNC<span class="hl opt">,</span>field<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>

herr_t
<span class="hl kwd">H5S_hyper_print_diminfo</span><span class="hl opt">(</span><span class="hl kwb">FILE</span> <span class="hl opt">*</span>f<span class="hl opt">,</span> <span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_print_diminfo<span class="hl opt">)</span>

    <span class="hl kwd">H5S_hyper_print_diminfo_helper</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;opt_diminfo&quot;</span><span class="hl opt">,</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">,</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">);</span>
    <span class="hl kwd">H5S_hyper_print_diminfo_helper</span><span class="hl opt">(</span>f<span class="hl opt">,</span><span class="hl str">&quot;app_diminfo&quot;</span><span class="hl opt">,</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">,</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>
<span class="hl ppc">#endif</span> <span class="hl com">/* H5S_HYPER_DEBUG */</span><span class="hl ppc"></span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_iter_init</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Initializes iteration information for hyperslab span tree selection.</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	non-negative on success, negative on failure.</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Saturday, February 24, 2001</span>
<span class="hl com"> *</span>
<span class="hl com"> * Notes:       If the 'elmt_size' parameter is set to zero, the regular</span>
<span class="hl com"> *              hyperslab selection iterator will not be 'flattened'.  This</span>
<span class="hl com"> *              is used by the H5S_select_shape_same() code to avoid changing</span>
<span class="hl com"> *              the rank and appearance of the selection.</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
herr_t
<span class="hl kwd">H5S_hyper_iter_init</span><span class="hl opt">(</span>H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">,</span> <span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>tdiminfo<span class="hl opt">;</span>    <span class="hl com">/* Temporary pointer to diminfo information */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">;</span>   <span class="hl com">/* Pointer to hyperslab span info node */</span>
    <span class="hl kwb">unsigned</span> rank<span class="hl opt">;</span>                  <span class="hl com">/* Dataspace's dimension rank */</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                     <span class="hl com">/* Index variable */</span>
    <span class="hl kwb">int</span> i<span class="hl opt">;</span>                          <span class="hl com">/* Index variable */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_iter_init<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space <span class="hl opt">&amp;&amp;</span> H5S_SEL_HYPERSLABS <span class="hl opt">==</span> <span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">));</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>iter<span class="hl opt">);</span>

    <span class="hl com">/* Initialize the number of points to iterate over */</span>
    iter<span class="hl opt">-&gt;</span>elmt_left <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">;</span>
    iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

    <span class="hl com">/* Get the rank of the dataspace */</span>
    rank <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span>

    <span class="hl com">/* Set the temporary pointer to the dimension information */</span>
    tdiminfo <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span>

    <span class="hl com">/* Check for the special case of just one H5Sselect_hyperslab call made */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
<span class="hl com">/* Initialize the information needed for regular hyperslab I/O */</span>
        <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>mem_size<span class="hl opt">;</span>    <span class="hl com">/* Temporary pointer to dataspace extent's dimension sizes */</span>
        hsize_t acc<span class="hl opt">;</span>                <span class="hl com">/* Accumulator for &quot;flattened&quot; dimension's sizes */</span>
        <span class="hl kwb">unsigned</span> cont_dim <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>      <span class="hl com">/* # of contiguous dimensions */</span>

        <span class="hl com">/* Set the temporary pointer to the dataspace extent's dimension sizes */</span>
        mem_size <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">;</span>

        <span class="hl com">/*</span>
<span class="hl com">         * For a regular hyperslab to be contiguous up to some dimension, it</span>
<span class="hl com">         * must have only one block (i.e. count==1 in all dimensions up to that</span>
<span class="hl com">         * dimension) and the block size must be the same as the dataspace's</span>
<span class="hl com">         * extent in that dimension and all dimensions up to that dimension.</span>
<span class="hl com">         */</span>

        <span class="hl com">/* Don't flatten adjacent elements into contiguous block if the</span>
<span class="hl com">         * element size is 0.  This is for the H5S_select_shape_same() code.</span>
<span class="hl com">         */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>elmt_size <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl com">/* Check for any &quot;contiguous&quot; blocks that can be flattened */</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">= (</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">);</span> u <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">--) {</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">==</span> <span class="hl num">1</span> <span class="hl opt">&amp;&amp;</span> tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block <span class="hl opt">==</span> mem_size<span class="hl opt">[</span>u<span class="hl opt">]) {</span>
                    cont_dim<span class="hl opt">++;</span>
                    iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>flattened<span class="hl opt">[</span>u<span class="hl opt">] =</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span>
                    iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>flattened<span class="hl opt">[</span>u<span class="hl opt">] =</span> FALSE<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
            iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>flattened<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> FALSE<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Check if the regular selection can be &quot;flattened&quot; */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>cont_dim <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl kwb">unsigned</span> last_dim_flattened <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>    <span class="hl com">/* Flag to indicate that the last dimension was flattened */</span>
            <span class="hl kwb">unsigned</span> flat_rank <span class="hl opt">=</span> rank<span class="hl opt">-</span>cont_dim<span class="hl opt">;</span> <span class="hl com">/* Number of dimensions after flattening */</span>
            <span class="hl kwb">unsigned</span> curr_dim<span class="hl opt">;</span>                  <span class="hl com">/* Current dimension */</span>

            <span class="hl com">/* Set the iterator's rank to the contiguous dimensions */</span>
            iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank <span class="hl opt">=</span> flat_rank<span class="hl opt">;</span>

            <span class="hl com">/* &quot;Flatten&quot; dataspace extent and selection information */</span>
            curr_dim <span class="hl opt">=</span> flat_rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">,</span> acc <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> i <span class="hl opt">&gt;=</span> <span class="hl num">0</span><span class="hl opt">;</span> i<span class="hl opt">--) {</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>block <span class="hl opt">==</span> mem_size<span class="hl opt">[</span>i<span class="hl opt">] &amp;&amp;</span> i <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
                    <span class="hl com">/* &quot;Flatten&quot; this dimension */</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">);</span>
                    acc <span class="hl opt">*=</span> mem_size<span class="hl opt">[</span>i<span class="hl opt">];</span>

                    <span class="hl com">/* Indicate that the dimension was flattened */</span>
                    last_dim_flattened <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>last_dim_flattened<span class="hl opt">) {</span>
                        <span class="hl com">/* First dimension after flattened dimensions */</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>start <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start <span class="hl opt">*</span> acc<span class="hl opt">;</span>

                        <span class="hl com">/* Special case for single block regular selections */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>count <span class="hl opt">==</span> <span class="hl num">1</span><span class="hl opt">)</span>
                            iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>stride <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
                        <span class="hl kwa">else</span>
                            iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>stride <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>stride <span class="hl opt">*</span> acc<span class="hl opt">;</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>count <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>count<span class="hl opt">;</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>block <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>block <span class="hl opt">*</span> acc<span class="hl opt">;</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>size<span class="hl opt">[</span>curr_dim<span class="hl opt">] =</span> mem_size<span class="hl opt">[</span>i<span class="hl opt">] *</span> acc<span class="hl opt">;</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>sel_off<span class="hl opt">[</span>curr_dim<span class="hl opt">] =</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>i<span class="hl opt">] * (</span>hssize_t<span class="hl opt">)</span>acc<span class="hl opt">;</span>

                        <span class="hl com">/* Reset the &quot;last dim flattened&quot; flag to avoid flattened any further dimensions */</span>
                        last_dim_flattened <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

                        <span class="hl com">/* Reset the &quot;accumulator&quot; for possible further dimension flattening */</span>
                        acc <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* All other dimensions */</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>start <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start<span class="hl opt">;</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>stride <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>stride<span class="hl opt">;</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>count <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>count<span class="hl opt">;</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>block <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>block<span class="hl opt">;</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>size<span class="hl opt">[</span>curr_dim<span class="hl opt">] =</span> mem_size<span class="hl opt">[</span>i<span class="hl opt">];</span>
                        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>sel_off<span class="hl opt">[</span>curr_dim<span class="hl opt">] =</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>i<span class="hl opt">];</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Decrement &quot;current&quot; flattened dimension */</span>
                    curr_dim<span class="hl opt">--;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

            <span class="hl com">/* Initialize &quot;flattened&quot; iterator offset to initial location and dataspace extent and selection information to correct values */</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> flat_rank<span class="hl opt">;</span> u<span class="hl opt">++)</span>
                iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>u<span class="hl opt">] =</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Initialize position to initial location */</span>
            <span class="hl com">/* Also make local copy of the regular selection information */</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
                <span class="hl com">/* Regular selection information */</span>
                iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">;</span>
                iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride<span class="hl opt">;</span>
                iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">;</span>
                iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block <span class="hl opt">=</span> tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block<span class="hl opt">;</span>

                <span class="hl com">/* Position information */</span>
                iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>u<span class="hl opt">] =</span> tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

        <span class="hl com">/* Flag the diminfo information as valid in the iterator */</span>
        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo_valid <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>

        <span class="hl com">/* Initialize irregular region information also (for release) */</span>
        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>spans <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
<span class="hl com">/* Initialize the information needed for non-regular hyperslab I/O */</span>
        <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>
        <span class="hl com">/* Make a copy of the span tree to iterate over */</span>
        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>spans <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_copy_span</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>

        <span class="hl com">/* Set the nelem &amp; pstride values according to the element size */</span>
        <span class="hl kwd">H5S_hyper_span_precompute</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>spans<span class="hl opt">,</span>iter<span class="hl opt">-&gt;</span>elmt_size<span class="hl opt">);</span>

        <span class="hl com">/* Initialize the starting span_info's and spans */</span>
        spans <span class="hl opt">=</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>spans<span class="hl opt">;</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl com">/* Set the pointers to the initial span in each dimension */</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">);</span>

            <span class="hl com">/* Set the pointer to the first span in the list for this node */</span>
            iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>span<span class="hl opt">[</span>u<span class="hl opt">] =</span> spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

            <span class="hl com">/* Set the initial offset to low bound of span */</span>
            iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>u<span class="hl opt">] =</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>span<span class="hl opt">[</span>u<span class="hl opt">]-&gt;</span>low<span class="hl opt">;</span>

            <span class="hl com">/* Get the pointer to the next level down */</span>
            spans <span class="hl opt">=</span> spans<span class="hl opt">-&gt;</span>head<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* Flag the diminfo information as not valid in the iterator */</span>
        iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo_valid <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl com">/* Initialize type of selection iterator */</span>
    iter<span class="hl opt">-&gt;</span>type <span class="hl opt">=</span> H5S_sel_iter_hyper<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_iter_init() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_iter_coords</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Retrieve the current coordinates of iterator for current</span>
<span class="hl com"> *              selection</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	non-negative on success, negative on failure</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Tuesday, April 22, 2003</span>
<span class="hl com"> *</span>
<span class="hl com"> * Modifications:</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_iter_coords</span> <span class="hl opt">(</span><span class="hl kwb">const</span> H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>coords<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_iter_coords<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>iter<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>coords<span class="hl opt">);</span>

    <span class="hl com">/* Copy the offset of the current point */</span>

    <span class="hl com">/* Check for a single &quot;regular&quot; hyperslab */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl com">/* Check if this is a &quot;flattened&quot; regular hyperslab selection */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank <span class="hl opt">!=</span> <span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank <span class="hl opt">&lt;</span> iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">) {</span>
            <span class="hl kwb">int</span> u<span class="hl opt">,</span> v<span class="hl opt">;</span>           <span class="hl com">/* Dimension indices */</span>

            <span class="hl com">/* Set the starting rank of both the &quot;natural&quot; &amp; &quot;flattened&quot; dimensions */</span>
            u <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>iter<span class="hl opt">-&gt;</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>
            v <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>

            <span class="hl com">/* Construct the &quot;natural&quot; dimensions from a set of flattened coordinates */</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>u <span class="hl opt">&gt;=</span> <span class="hl num">0</span><span class="hl opt">) {</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>flattened<span class="hl opt">[</span>u<span class="hl opt">]) {</span>
                    <span class="hl kwb">int</span> begin <span class="hl opt">=</span> u<span class="hl opt">;</span>      <span class="hl com">/* The rank of the first flattened dimension */</span>

                    <span class="hl com">/* Walk up through as many flattened dimensions as possible */</span>
                    <span class="hl kwa">do</span> <span class="hl opt">{</span>
                        u<span class="hl opt">--;</span>
                    <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>u <span class="hl opt">&gt;=</span> <span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>flattened<span class="hl opt">[</span>u<span class="hl opt">]);</span>

                    <span class="hl com">/* Compensate for possibly overshooting dim 0 */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>u <span class="hl opt">&lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                        u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

                    <span class="hl com">/* Sanity check */</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>v <span class="hl opt">&gt;=</span> <span class="hl num">0</span><span class="hl opt">);</span>

                    <span class="hl com">/* Compute the coords for the flattened dimensions */</span>
                    <span class="hl kwd">H5V_array_calc</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>v<span class="hl opt">], (</span><span class="hl kwb">unsigned</span><span class="hl opt">)((</span>begin <span class="hl opt">-</span> u<span class="hl opt">) +</span> <span class="hl num">1</span><span class="hl opt">), &amp;(</span>iter<span class="hl opt">-&gt;</span>dims<span class="hl opt">[</span>u<span class="hl opt">]), &amp;(</span>coords<span class="hl opt">[</span>u<span class="hl opt">]));</span>

                    <span class="hl com">/* Continue to faster dimension in both indices */</span>
                    u<span class="hl opt">--;</span>
                    v<span class="hl opt">--;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Walk up through as many non-flattened dimensions as possible */</span>
                    <span class="hl kwa">while</span><span class="hl opt">(</span>u <span class="hl opt">&gt;=</span> <span class="hl num">0</span> <span class="hl opt">&amp;&amp; !</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>flattened<span class="hl opt">[</span>u<span class="hl opt">]) {</span>
                        <span class="hl com">/* Sanity check */</span>
                        <span class="hl kwd">HDassert</span><span class="hl opt">(</span>v <span class="hl opt">&gt;=</span> <span class="hl num">0</span><span class="hl opt">);</span>

                        <span class="hl com">/* Copy the coordinate */</span>
                        coords<span class="hl opt">[</span>u<span class="hl opt">] =</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>v<span class="hl opt">];</span>

                        <span class="hl com">/* Continue to faster dimension in both indices */</span>
                        u<span class="hl opt">--;</span>
                        v<span class="hl opt">--;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>v <span class="hl opt">&lt;</span> <span class="hl num">0</span><span class="hl opt">);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span>
            <span class="hl kwd">HDmemcpy</span><span class="hl opt">(</span>coords<span class="hl opt">,</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hsize_t<span class="hl opt">) *</span> iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span>
        <span class="hl kwd">HDmemcpy</span><span class="hl opt">(</span>coords<span class="hl opt">,</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hsize_t<span class="hl opt">) *</span> iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_iter_coords() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_iter_block</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Retrieve the current block of iterator for current</span>
<span class="hl com"> *              selection</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	non-negative on success, negative on failure</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Monday, June 2, 2003</span>
<span class="hl com"> *</span>
<span class="hl com"> * Notes:       This routine assumes that the iterator is always located at</span>
<span class="hl com"> *              the beginning of a block.</span>
<span class="hl com"> *</span>
<span class="hl com"> * Modifications:</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_iter_block</span> <span class="hl opt">(</span><span class="hl kwb">const</span> H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>start<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>end<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                 <span class="hl com">/* Local index variable */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_iter_block<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>iter<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>end<span class="hl opt">);</span>

    <span class="hl com">/* Copy the offset of the current point */</span>

    <span class="hl com">/* Check for a single &quot;regular&quot; hyperslab */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl com">/* Compute the end of the block */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            start<span class="hl opt">[</span>u<span class="hl opt">]=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>u<span class="hl opt">];</span>
            end<span class="hl opt">[</span>u<span class="hl opt">]=(</span>start<span class="hl opt">[</span>u<span class="hl opt">]+</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block<span class="hl opt">)-</span><span class="hl num">1</span><span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Copy the start of the block */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            start<span class="hl opt">[</span>u<span class="hl opt">]=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>span<span class="hl opt">[</span>u<span class="hl opt">]-&gt;</span>low<span class="hl opt">;</span>

        <span class="hl com">/* Copy the end of the block */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            end<span class="hl opt">[</span>u<span class="hl opt">]=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>span<span class="hl opt">[</span>u<span class="hl opt">]-&gt;</span>high<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_iter_block() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_iter_nelmts</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Return number of elements left to process in iterator</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	non-negative number of elements on success, zero on failure</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Tuesday, June 16, 1998</span>
<span class="hl com"> *</span>
<span class="hl com"> * Modifications:</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> hsize_t
<span class="hl kwd">H5S_hyper_iter_nelmts</span> <span class="hl opt">(</span><span class="hl kwb">const</span> H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_iter_nelmts<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>iter<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>elmt_left<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_iter_nelmts() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_iter_has_next_block</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Check if there is another block left in the current iterator</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_iter_has_next_block(iter)</span>
<span class="hl com">        const H5S_sel_iter_t *iter;       IN: Pointer to selection iterator</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative (TRUE/FALSE) on success/Negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Check if there is another block available in the selection iterator.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> htri_t
<span class="hl kwd">H5S_hyper_iter_has_next_block</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                 <span class="hl com">/* Local index variable */</span>
    htri_t ret_value <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>   <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_iter_has_next_block<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>iter<span class="hl opt">);</span>

    <span class="hl com">/* Check for a single &quot;regular&quot; hyperslab */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>tdiminfo<span class="hl opt">;</span>    <span class="hl com">/* Temporary pointer to diminfo information */</span>
        <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>toff<span class="hl opt">;</span>               <span class="hl com">/* Temporary offset in selection */</span>

        <span class="hl com">/* Check if the offset of the iterator is at the last location in all dimensions */</span>
        tdiminfo <span class="hl opt">=</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">;</span>
        toff <span class="hl opt">=</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">;</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl com">/* If there is only one block, continue */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">==</span> <span class="hl num">1</span><span class="hl opt">)</span>
                <span class="hl kwa">continue</span><span class="hl opt">;</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>toff<span class="hl opt">[</span>u<span class="hl opt">] != (</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">+ ((</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">) *</span> tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride<span class="hl opt">)))</span>
                <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>TRUE<span class="hl opt">);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Check for any levels of the tree with more sequences in them */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>span<span class="hl opt">[</span>u<span class="hl opt">]-&gt;</span>next <span class="hl opt">!=</span> NULL<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>TRUE<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_iter_has_next_block() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_iter_next</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Moves a hyperslab iterator to the beginning of the next sequence</span>
<span class="hl com"> *      of elements to read.  Handles walking off the end in all dimensions.</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	Success:	non-negative</span>
<span class="hl com"> *		Failure:	negative</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Friday, September 8, 2000</span>
<span class="hl com"> *</span>
<span class="hl com"> * Modifications:</span>
<span class="hl com"> *      Modified for both general and optimized hyperslab I/O</span>
<span class="hl com"> *      Quincey Koziol, April 17, 2003</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_iter_next</span><span class="hl opt">(</span>H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">,</span> <span class="hl kwb">size_t</span> nelem<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> ndims<span class="hl opt">;</span>     <span class="hl com">/* Number of dimensions of dataset */</span>
    <span class="hl kwb">int</span> fast_dim<span class="hl opt">;</span>       <span class="hl com">/* Rank of the fastest changing dimension for the dataspace */</span>
    <span class="hl kwb">unsigned</span> i<span class="hl opt">;</span>         <span class="hl com">/* Counters */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_iter_next<span class="hl opt">)</span>

    <span class="hl com">/* Check for the special case of just one H5Sselect_hyperslab call made */</span>
    <span class="hl com">/* (i.e. a regular hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>tdiminfo<span class="hl opt">;</span>    <span class="hl com">/* Temporary pointer to diminfo information */</span>
        hsize_t iter_offset<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>
        hsize_t iter_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>
        <span class="hl kwb">int</span> temp_dim<span class="hl opt">;</span>  <span class="hl com">/* Temporary rank holder */</span>

        <span class="hl com">/* Check if this is a &quot;flattened&quot; regular hyperslab selection */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank<span class="hl opt">!=</span><span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank<span class="hl opt">&lt;</span>iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">) {</span>
            <span class="hl com">/* Set the aliases for the dimension rank */</span>
            ndims<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Set the aliases for the dimension rank */</span>
            ndims<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

        <span class="hl com">/* Set the fastest dimension rank */</span>
        fast_dim <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>ndims <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>

        <span class="hl com">/* Set the local copy of the diminfo pointer */</span>
        tdiminfo<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">;</span>

        <span class="hl com">/* Calculate the offset and block count for each dimension */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>i<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> i<span class="hl opt">&lt;</span>ndims<span class="hl opt">;</span> i<span class="hl opt">++) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>count<span class="hl opt">==</span><span class="hl num">1</span><span class="hl opt">) {</span>
                iter_offset<span class="hl opt">[</span>i<span class="hl opt">]=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>i<span class="hl opt">]-</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start<span class="hl opt">;</span>
                iter_count<span class="hl opt">[</span>i<span class="hl opt">]=</span><span class="hl num">0</span><span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                iter_offset<span class="hl opt">[</span>i<span class="hl opt">]=(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>i<span class="hl opt">]-</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start<span class="hl opt">)%</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>stride<span class="hl opt">;</span>
                iter_count<span class="hl opt">[</span>i<span class="hl opt">]=(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>i<span class="hl opt">]-</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start<span class="hl opt">)/</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>stride<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* Loop through, advancing the offset &amp; counts, until all the nelements are accounted for */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>nelem<span class="hl opt">&gt;</span><span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl com">/* Start with the fastest changing dimension */</span>
            temp_dim<span class="hl opt">=</span>fast_dim<span class="hl opt">;</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>temp_dim<span class="hl opt">&gt;=</span><span class="hl num">0</span><span class="hl opt">) {</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>temp_dim<span class="hl opt">==</span>fast_dim<span class="hl opt">) {</span>
                    <span class="hl kwb">size_t</span> actual_elem<span class="hl opt">;</span>     <span class="hl com">/* Actual # of elements advanced on each iteration through loop */</span>
                    hsize_t block_elem<span class="hl opt">;</span>     <span class="hl com">/* Number of elements left in a block */</span>

                    <span class="hl com">/* Compute the number of elements left in block */</span>
                    block_elem<span class="hl opt">=</span>tdiminfo<span class="hl opt">[</span>temp_dim<span class="hl opt">].</span>block<span class="hl opt">-</span>iter_offset<span class="hl opt">[</span>temp_dim<span class="hl opt">];</span>

                    <span class="hl com">/* Compute the number of actual elements to advance */</span>
                    actual_elem<span class="hl opt">=(</span><span class="hl kwb">size_t</span><span class="hl opt">)</span><span class="hl kwd">MIN</span><span class="hl opt">(</span>nelem<span class="hl opt">,</span>block_elem<span class="hl opt">);</span>

                    <span class="hl com">/* Move the iterator over as many elements as possible */</span>
                    iter_offset<span class="hl opt">[</span>temp_dim<span class="hl opt">]+=</span>actual_elem<span class="hl opt">;</span>

                    <span class="hl com">/* Decrement the number of elements advanced */</span>
                    nelem<span class="hl opt">-=</span>actual_elem<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Move to the next row in the current dimension */</span>
                    iter_offset<span class="hl opt">[</span>temp_dim<span class="hl opt">]++;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                <span class="hl com">/* If this block is still in the range of blocks to output for the dimension, break out of loop */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>iter_offset<span class="hl opt">[</span>temp_dim<span class="hl opt">]&lt;</span>tdiminfo<span class="hl opt">[</span>temp_dim<span class="hl opt">].</span>block<span class="hl opt">)</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Move to the next block in the current dimension */</span>
                    iter_offset<span class="hl opt">[</span>temp_dim<span class="hl opt">]=</span><span class="hl num">0</span><span class="hl opt">;</span>
                    iter_count<span class="hl opt">[</span>temp_dim<span class="hl opt">]++;</span>

                    <span class="hl com">/* If this block is still in the range of blocks to output for the dimension, break out of loop */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>iter_count<span class="hl opt">[</span>temp_dim<span class="hl opt">]&lt;</span>tdiminfo<span class="hl opt">[</span>temp_dim<span class="hl opt">].</span>count<span class="hl opt">)</span>
                        <span class="hl kwa">break</span><span class="hl opt">;</span>
                    <span class="hl kwa">else</span>
                        iter_count<span class="hl opt">[</span>temp_dim<span class="hl opt">]=</span><span class="hl num">0</span><span class="hl opt">;</span> <span class="hl com">/* reset back to the beginning of the line */</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                <span class="hl com">/* Decrement dimension count */</span>
                temp_dim<span class="hl opt">--;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

        <span class="hl com">/* Translate current iter_offset and iter_count into iterator position */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>i<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> i<span class="hl opt">&lt;</span>ndims<span class="hl opt">;</span> i<span class="hl opt">++)</span>
            iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>i<span class="hl opt">]=</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start<span class="hl opt">+(</span>tdiminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>stride<span class="hl opt">*</span>iter_count<span class="hl opt">[</span>i<span class="hl opt">])+</span>iter_offset<span class="hl opt">[</span>i<span class="hl opt">];</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl com">/* Must be an irregular hyperslab selection */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        H5S_hyper_span_t <span class="hl opt">*</span>curr_span<span class="hl opt">;</span>    <span class="hl com">/* Current hyperslab span node */</span>
        H5S_hyper_span_t <span class="hl opt">**</span>ispan<span class="hl opt">;</span>       <span class="hl com">/* Iterator's hyperslab span nodes */</span>
        hsize_t <span class="hl opt">*</span>abs_arr<span class="hl opt">;</span>              <span class="hl com">/* Absolute hyperslab span position */</span>
        <span class="hl kwb">int</span> curr_dim<span class="hl opt">;</span>                   <span class="hl com">/* Temporary rank holder */</span>

        <span class="hl com">/* Set the rank of the fastest changing dimension */</span>
        ndims<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">;</span>
        fast_dim <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>ndims <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>

        <span class="hl com">/* Get the pointers to the current span info and span nodes */</span>
        abs_arr<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">;</span>
        ispan<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>span<span class="hl opt">;</span>

        <span class="hl com">/* Loop through, advancing the span information, until all the nelements are accounted for */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>nelem<span class="hl opt">&gt;</span><span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl com">/* Start at the fastest dim */</span>
            curr_dim<span class="hl opt">=</span>fast_dim<span class="hl opt">;</span>

            <span class="hl com">/* Work back up through the dimensions */</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>curr_dim<span class="hl opt">&gt;=</span><span class="hl num">0</span><span class="hl opt">) {</span>
                <span class="hl com">/* Reset the current span */</span>
                curr_span<span class="hl opt">=</span>ispan<span class="hl opt">[</span>curr_dim<span class="hl opt">];</span>

                <span class="hl com">/* Increment absolute position */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>curr_dim<span class="hl opt">==</span>fast_dim<span class="hl opt">) {</span>
                    <span class="hl kwb">size_t</span> actual_elem<span class="hl opt">;</span>     <span class="hl com">/* Actual # of elements advanced on each iteration through loop */</span>
                    hsize_t span_elem<span class="hl opt">;</span>      <span class="hl com">/* Number of elements left in a span */</span>

                    <span class="hl com">/* Compute the number of elements left in block */</span>
                    span_elem<span class="hl opt">=(</span>curr_span<span class="hl opt">-&gt;</span>high<span class="hl opt">-</span>abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">])+</span><span class="hl num">1</span><span class="hl opt">;</span>

                    <span class="hl com">/* Compute the number of actual elements to advance */</span>
                    actual_elem<span class="hl opt">=(</span><span class="hl kwb">size_t</span><span class="hl opt">)</span><span class="hl kwd">MIN</span><span class="hl opt">(</span>nelem<span class="hl opt">,</span>span_elem<span class="hl opt">);</span>

                    <span class="hl com">/* Move the iterator over as many elements as possible */</span>
                    abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]+=</span>actual_elem<span class="hl opt">;</span>

                    <span class="hl com">/* Decrement the number of elements advanced */</span>
                    nelem<span class="hl opt">-=</span>actual_elem<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Move to the next row in the current dimension */</span>
                    abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]++;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                <span class="hl com">/* Check if we are still within the span */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]&lt;=</span>curr_span<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl com">/* If we walked off that span, advance to the next span */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Advance span in this dimension */</span>
                    curr_span<span class="hl opt">=</span>curr_span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>

                    <span class="hl com">/* Check if we have a valid span in this dimension still */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>curr_span<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                        <span class="hl com">/* Reset the span in the current dimension */</span>
                        ispan<span class="hl opt">[</span>curr_dim<span class="hl opt">]=</span>curr_span<span class="hl opt">;</span>

                        <span class="hl com">/* Reset absolute position */</span>
                        abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]=</span>curr_span<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>

                        <span class="hl kwa">break</span><span class="hl opt">;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* If we finished the span list in this dimension, decrement the dimension worked on and loop again */</span>
                        curr_dim<span class="hl opt">--;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

            <span class="hl com">/* Check if we are finished with the spans in the tree */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>curr_dim<span class="hl opt">&gt;=</span><span class="hl num">0</span><span class="hl opt">) {</span>
                <span class="hl com">/* Walk back down the iterator positions, reseting them */</span>
                <span class="hl kwa">while</span><span class="hl opt">(</span>curr_dim<span class="hl opt">&lt;</span>fast_dim<span class="hl opt">) {</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>curr_span<span class="hl opt">);</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>curr_span<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>curr_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">);</span>

                    <span class="hl com">/* Increment current dimension */</span>
                    curr_dim<span class="hl opt">++;</span>

                    <span class="hl com">/* Set the new span_info &amp; span for this dimension */</span>
                    ispan<span class="hl opt">[</span>curr_dim<span class="hl opt">]=</span>curr_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

                    <span class="hl com">/* Advance span down the tree */</span>
                    curr_span<span class="hl opt">=</span>curr_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

                    <span class="hl com">/* Reset the absolute offset for the dim */</span>
                    abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]=</span>curr_span<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

                <span class="hl com">/* Verify that the curr_span points to the fastest dim */</span>
                <span class="hl kwd">HDassert</span><span class="hl opt">(</span>curr_span<span class="hl opt">==</span>ispan<span class="hl opt">[</span>fast_dim<span class="hl opt">]);</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* H5S_hyper_iter_next() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_iter_next_block</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Moves a hyperslab iterator to the beginning of the next sequence</span>
<span class="hl com"> *      of elements to read.  Handles walking off the end in all dimensions.</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	Success:	non-negative</span>
<span class="hl com"> *		Failure:	negative</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Tuesday, June 3, 2003</span>
<span class="hl com"> *</span>
<span class="hl com"> * Modifications:</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_iter_next_block</span><span class="hl opt">(</span>H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> ndims<span class="hl opt">;</span>     <span class="hl com">/* Number of dimensions of dataset */</span>
    <span class="hl kwb">int</span> fast_dim<span class="hl opt">;</span>       <span class="hl com">/* Rank of the fastest changing dimension for the dataspace */</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>         <span class="hl com">/* Counters */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_iter_next_block<span class="hl opt">)</span>

    <span class="hl com">/* Check for the special case of just one H5Sselect_hyperslab call made */</span>
    <span class="hl com">/* (i.e. a regular hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>tdiminfo<span class="hl opt">;</span>    <span class="hl com">/* Temporary pointer to diminfo information */</span>
        hsize_t iter_offset<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>
        hsize_t iter_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>
        <span class="hl kwb">int</span> temp_dim<span class="hl opt">;</span>  <span class="hl com">/* Temporary rank holder */</span>

        <span class="hl com">/* Check if this is a &quot;flattened&quot; regular hyperslab selection */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank<span class="hl opt">!=</span><span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank<span class="hl opt">&lt;</span>iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">) {</span>
            <span class="hl com">/* Set the aliases for the dimension rank */</span>
            ndims<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>iter_rank<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Set the aliases for the dimension rank */</span>
            ndims<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

        <span class="hl com">/* Set the fastest dimension rank */</span>
        fast_dim <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>ndims <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>

        <span class="hl com">/* Set the local copy of the diminfo pointer */</span>
        tdiminfo<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>diminfo<span class="hl opt">;</span>

        <span class="hl com">/* Calculate the offset and block count for each dimension */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>ndims<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">==</span><span class="hl num">1</span><span class="hl opt">) {</span>
                iter_offset<span class="hl opt">[</span>u<span class="hl opt">]=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>u<span class="hl opt">]-</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">;</span>
                iter_count<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">0</span><span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                iter_offset<span class="hl opt">[</span>u<span class="hl opt">]=(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>u<span class="hl opt">]-</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">)%</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride<span class="hl opt">;</span>
                iter_count<span class="hl opt">[</span>u<span class="hl opt">]=(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>u<span class="hl opt">]-</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">)/</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* Advance one block */</span>
        temp_dim<span class="hl opt">=</span>fast_dim<span class="hl opt">;</span> <span class="hl com">/* Start with the fastest changing dimension */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>temp_dim<span class="hl opt">&gt;=</span><span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>temp_dim<span class="hl opt">==</span>fast_dim<span class="hl opt">) {</span>
                <span class="hl com">/* Move iterator over current block */</span>
                iter_offset<span class="hl opt">[</span>temp_dim<span class="hl opt">]+=</span>tdiminfo<span class="hl opt">[</span>temp_dim<span class="hl opt">].</span>block<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl com">/* Move to the next row in the current dimension */</span>
                iter_offset<span class="hl opt">[</span>temp_dim<span class="hl opt">]++;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

            <span class="hl com">/* If this block is still in the range of blocks to output for the dimension, break out of loop */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>iter_offset<span class="hl opt">[</span>temp_dim<span class="hl opt">]&lt;</span>tdiminfo<span class="hl opt">[</span>temp_dim<span class="hl opt">].</span>block<span class="hl opt">)</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl com">/* Move to the next block in the current dimension */</span>
                iter_offset<span class="hl opt">[</span>temp_dim<span class="hl opt">]=</span><span class="hl num">0</span><span class="hl opt">;</span>
                iter_count<span class="hl opt">[</span>temp_dim<span class="hl opt">]++;</span>

                <span class="hl com">/* If this block is still in the range of blocks to output for the dimension, break out of loop */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>iter_count<span class="hl opt">[</span>temp_dim<span class="hl opt">]&lt;</span>tdiminfo<span class="hl opt">[</span>temp_dim<span class="hl opt">].</span>count<span class="hl opt">)</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>
                <span class="hl kwa">else</span>
                    iter_count<span class="hl opt">[</span>temp_dim<span class="hl opt">]=</span><span class="hl num">0</span><span class="hl opt">;</span> <span class="hl com">/* reset back to the beginning of the line */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

            <span class="hl com">/* Decrement dimension count */</span>
            temp_dim<span class="hl opt">--;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

        <span class="hl com">/* Translate current iter_offset and iter_count into iterator position */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>ndims<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">[</span>u<span class="hl opt">]=</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">+(</span>tdiminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride<span class="hl opt">*</span>iter_count<span class="hl opt">[</span>u<span class="hl opt">])+</span>iter_offset<span class="hl opt">[</span>u<span class="hl opt">];</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl com">/* Must be an irregular hyperslab selection */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        H5S_hyper_span_t <span class="hl opt">*</span>curr_span<span class="hl opt">;</span>    <span class="hl com">/* Current hyperslab span node */</span>
        H5S_hyper_span_t <span class="hl opt">**</span>ispan<span class="hl opt">;</span>       <span class="hl com">/* Iterator's hyperslab span nodes */</span>
        hsize_t <span class="hl opt">*</span>abs_arr<span class="hl opt">;</span>              <span class="hl com">/* Absolute hyperslab span position */</span>
        <span class="hl kwb">int</span> curr_dim<span class="hl opt">;</span>                   <span class="hl com">/* Temporary rank holder */</span>

        <span class="hl com">/* Set the rank of the fastest changing dimension */</span>
        ndims <span class="hl opt">=</span> iter<span class="hl opt">-&gt;</span>rank<span class="hl opt">;</span>
        fast_dim <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>ndims <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>

        <span class="hl com">/* Get the pointers to the current span info and span nodes */</span>
        abs_arr<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>off<span class="hl opt">;</span>
        ispan<span class="hl opt">=</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>span<span class="hl opt">;</span>

        <span class="hl com">/* Loop through, advancing the span information, until all the nelements are accounted for */</span>
        curr_dim<span class="hl opt">=</span>fast_dim<span class="hl opt">;</span> <span class="hl com">/* Start at the fastest dim */</span>

        <span class="hl com">/* Work back up through the dimensions */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>curr_dim<span class="hl opt">&gt;=</span><span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl com">/* Reset the current span */</span>
            curr_span<span class="hl opt">=</span>ispan<span class="hl opt">[</span>curr_dim<span class="hl opt">];</span>

            <span class="hl com">/* Increment absolute position */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>curr_dim<span class="hl opt">==</span>fast_dim<span class="hl opt">) {</span>
                <span class="hl com">/* Move the iterator over rest of element in span */</span>
                abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]=</span>curr_span<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl com">/* Move to the next row in the current dimension */</span>
                abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]++;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

            <span class="hl com">/* Check if we are still within the span */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]&lt;=</span>curr_span<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl com">/* If we walked off that span, advance to the next span */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl com">/* Advance span in this dimension */</span>
                curr_span<span class="hl opt">=</span>curr_span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>

                <span class="hl com">/* Check if we have a valid span in this dimension still */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>curr_span<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl com">/* Reset the span in the current dimension */</span>
                    ispan<span class="hl opt">[</span>curr_dim<span class="hl opt">]=</span>curr_span<span class="hl opt">;</span>

                    <span class="hl com">/* Reset absolute position */</span>
                    abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]=</span>curr_span<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>

                    <span class="hl kwa">break</span><span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* If we finished the span list in this dimension, decrement the dimension worked on and loop again */</span>
                    curr_dim<span class="hl opt">--;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

        <span class="hl com">/* Check if we are finished with the spans in the tree */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>curr_dim<span class="hl opt">&gt;=</span><span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl com">/* Walk back down the iterator positions, reseting them */</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>curr_dim<span class="hl opt">&lt;</span>fast_dim<span class="hl opt">) {</span>
                <span class="hl kwd">HDassert</span><span class="hl opt">(</span>curr_span<span class="hl opt">);</span>
                <span class="hl kwd">HDassert</span><span class="hl opt">(</span>curr_span<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>
                <span class="hl kwd">HDassert</span><span class="hl opt">(</span>curr_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">);</span>

                <span class="hl com">/* Increment current dimension */</span>
                curr_dim<span class="hl opt">++;</span>

                <span class="hl com">/* Set the new span_info &amp; span for this dimension */</span>
                ispan<span class="hl opt">[</span>curr_dim<span class="hl opt">]=</span>curr_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

                <span class="hl com">/* Advance span down the tree */</span>
                curr_span<span class="hl opt">=</span>curr_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

                <span class="hl com">/* Reset the absolute offset for the dim */</span>
                abs_arr<span class="hl opt">[</span>curr_dim<span class="hl opt">]=</span>curr_span<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

            <span class="hl com">/* Verify that the curr_span points to the fastest dim */</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>curr_span <span class="hl opt">==</span> ispan<span class="hl opt">[</span>fast_dim<span class="hl opt">]);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* H5S_hyper_iter_next() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_iter_release</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Release hyperslab selection iterator information for a dataspace</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_iter_release(iter)</span>
<span class="hl com">        H5S_sel_iter_t *iter;       IN: Pointer to selection iterator</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success/Negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Releases all information for a dataspace hyperslab selection iterator</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_iter_release</span> <span class="hl opt">(</span>H5S_sel_iter_t <span class="hl opt">*</span>iter<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_iter_release<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>iter<span class="hl opt">);</span>

<span class="hl com">/* Release the information needed for non-regular hyperslab I/O */</span>
    <span class="hl com">/* Free the copy of the selections span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>spans <span class="hl opt">!=</span> NULL<span class="hl opt">)</span>
        <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>iter<span class="hl opt">-&gt;</span>u<span class="hl opt">.</span>hyp<span class="hl opt">.</span>spans<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_iter_release() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_new_span</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Make a new hyperslab span node</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    H5S_hyper_span_t *H5S_hyper_new_span(low, high, down, next)</span>
<span class="hl com">        hsize_t low, high;         IN: Low and high bounds for new span node</span>
<span class="hl com">        H5S_hyper_span_info_t *down;     IN: Down span tree for new node</span>
<span class="hl com">        H5S_hyper_span_t *next;     IN: Next span for new node</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Pointer to next span node on success, NULL on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Allocate and initialize a new hyperslab span node, filling in the low &amp;</span>
<span class="hl com">    high bounds, the down span and next span pointers also.  Increment the</span>
<span class="hl com">    reference count of the 'down span' if applicable.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> H5S_hyper_span_t <span class="hl opt">*</span>
<span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>hsize_t low<span class="hl opt">,</span> hsize_t high<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">*</span>down<span class="hl opt">,</span> H5S_hyper_span_t <span class="hl opt">*</span>next<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>ret_value<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_new_span<span class="hl opt">)</span>

    <span class="hl com">/* Allocate a new span node */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>ret_value <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_t<span class="hl opt">)))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTALLOC<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Copy the span's basic information */</span>
    ret_value<span class="hl opt">-&gt;</span>low <span class="hl opt">=</span> low<span class="hl opt">;</span>
    ret_value<span class="hl opt">-&gt;</span>high <span class="hl opt">=</span> high<span class="hl opt">;</span>
    ret_value<span class="hl opt">-&gt;</span>nelem <span class="hl opt">= (</span>high <span class="hl opt">-</span> low<span class="hl opt">) +</span> <span class="hl num">1</span><span class="hl opt">;</span>
    ret_value<span class="hl opt">-&gt;</span>pstride <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
    ret_value<span class="hl opt">-&gt;</span>down <span class="hl opt">=</span> down<span class="hl opt">;</span>
    ret_value<span class="hl opt">-&gt;</span>next <span class="hl opt">=</span> next<span class="hl opt">;</span>

    <span class="hl com">/* Increment the reference count of the 'down span' if there is one */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>ret_value<span class="hl opt">-&gt;</span>down<span class="hl opt">)</span>
        ret_value<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>count<span class="hl opt">++;</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_new_span() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_span_precompute_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Helper routine to precompute the nelem and pstrides in bytes.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_span_precompute_helper(span_info, elmt_size)</span>
<span class="hl com">        H5S_hyper_span_info_t *span_info;      IN/OUT: Span tree to work on</span>
<span class="hl com">        size_t elmt_size;                      IN: element size to work with</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Change the nelem and pstride values in the span tree from elements to</span>
<span class="hl com">    bytes using the elmt_size parameter.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_span_precompute_helper</span> <span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> <span class="hl kwb">size_t</span> elmt_size<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>     <span class="hl com">/* Hyperslab span */</span>
    herr_t      ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_span_precompute_helper<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>

    <span class="hl com">/* Check if we've already set this down span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>spans<span class="hl opt">-&gt;</span>scratch<span class="hl opt">!=(</span>H5S_hyper_span_info_t <span class="hl opt">*)~((</span><span class="hl kwb">size_t</span><span class="hl opt">)</span>NULL<span class="hl opt">)) {</span>
        <span class="hl com">/* Set the tree's scratch pointer */</span>
        spans<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=(</span>H5S_hyper_span_info_t <span class="hl opt">*)~((</span><span class="hl kwb">size_t</span><span class="hl opt">)</span>NULL<span class="hl opt">);</span>

        <span class="hl com">/* Set the scratch pointers in all the nodes */</span>
        span<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

        <span class="hl com">/* Loop over all the spans for this down span tree */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
            <span class="hl com">/* If there are down spans, set their scratch value also */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_span_precompute_helper</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>elmt_size<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't reset hyperslab scratch pointer&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

            <span class="hl com">/* Change the nelem &amp; pstride values into bytes */</span>
            span<span class="hl opt">-&gt;</span>nelem <span class="hl opt">*=</span> elmt_size<span class="hl opt">;</span>
            span<span class="hl opt">-&gt;</span>pstride <span class="hl opt">*=</span> elmt_size<span class="hl opt">;</span>

            <span class="hl com">/* Advance to next span */</span>
            span<span class="hl opt">=</span>span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_span_precompute_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_span_precompute</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Precompute the nelem and pstrides in bytes.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_span_precompute(span_info, elmt_size)</span>
<span class="hl com">        H5S_hyper_span_info_t *span_info;      IN/OUT: Span tree to work on</span>
<span class="hl com">        size_t elmt_size;                      IN: element size to work with</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Change the nelem and pstride values in the span tree from elements to</span>
<span class="hl com">    bytes using the elmt_size parameter.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_span_precompute</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> <span class="hl kwb">size_t</span> elmt_size<span class="hl opt">)</span>
<span class="hl opt">{</span>
    herr_t      ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_span_precompute<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>

    <span class="hl com">/* Call the helper routine to actually do the work */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_span_precompute_helper</span><span class="hl opt">(</span>spans<span class="hl opt">,</span> elmt_size<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't precompute span info&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Reset the scratch pointers for the next routine which needs them */</span>
    <span class="hl kwd">H5S_hyper_span_scratch</span><span class="hl opt">(</span>spans<span class="hl opt">,</span> NULL<span class="hl opt">);</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_span_precompute() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_span_scratch</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Set the scratch pointers on hyperslab span trees</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    void H5S_hyper_span_scratch(span_info)</span>
<span class="hl com">        H5S_hyper_span_info_t *span_info;      IN: Span tree to reset</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    &lt;none&gt;</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Set the scratch pointers on a hyperslab span tree.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static void</span>
<span class="hl kwd">H5S_hyper_span_scratch</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> <span class="hl kwb">void</span> <span class="hl opt">*</span>scr_value<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_span_scratch<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>

    <span class="hl com">/* Check if we've already set this down span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>spans<span class="hl opt">-&gt;</span>scratch <span class="hl opt">!=</span> scr_value<span class="hl opt">) {</span>
        H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>             <span class="hl com">/* Hyperslab span */</span>

        <span class="hl com">/* Set the tree's scratch pointer */</span>
        spans<span class="hl opt">-&gt;</span>scratch <span class="hl opt">= (</span>H5S_hyper_span_info_t <span class="hl opt">*)</span>scr_value<span class="hl opt">;</span>

        <span class="hl com">/* Set the scratch pointers in all the nodes */</span>
        span <span class="hl opt">=</span> spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
            <span class="hl com">/* If there are down spans, set their scratch value also */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">)</span>
                <span class="hl kwd">H5S_hyper_span_scratch</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span> scr_value<span class="hl opt">);</span>

            <span class="hl com">/* Advance to next span */</span>
            span <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    FUNC_LEAVE_NOAPI_VOID
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_span_scratch() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_copy_span_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Helper routine to copy a hyperslab span tree</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    H5S_hyper_span_info_t * H5S_hyper_copy_span_helper(spans)</span>
<span class="hl com">        H5S_hyper_span_info_t *spans;      IN: Span tree to copy</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Pointer to the copied span tree on success, NULL on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Copy a hyperslab span tree, using reference counting as appropriate.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> H5S_hyper_span_info_t <span class="hl opt">*</span>
<span class="hl kwd">H5S_hyper_copy_span_helper</span> <span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>         <span class="hl com">/* Hyperslab span */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>new_span<span class="hl opt">;</span>     <span class="hl com">/* Temporary hyperslab span */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>prev_span<span class="hl opt">;</span>    <span class="hl com">/* Previous hyperslab span */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>new_down<span class="hl opt">;</span>    <span class="hl com">/* New down span tree */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>ret_value<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_copy_span_helper<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>

    <span class="hl com">/* Check if the span tree was already copied */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>spans<span class="hl opt">-&gt;</span>scratch <span class="hl opt">!=</span> NULL <span class="hl opt">&amp;&amp;</span> spans<span class="hl opt">-&gt;</span>scratch <span class="hl opt">!= (</span>H5S_hyper_span_info_t <span class="hl opt">*)~((</span><span class="hl kwb">size_t</span><span class="hl opt">)</span>NULL<span class="hl opt">)) {</span>
        <span class="hl com">/* Just return the value of the already copied span tree */</span>
        ret_value <span class="hl opt">=</span> spans<span class="hl opt">-&gt;</span>scratch<span class="hl opt">;</span>

        <span class="hl com">/* Increment the reference count of the span tree */</span>
        ret_value<span class="hl opt">-&gt;</span>count<span class="hl opt">++;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Allocate a new span_info node */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>ret_value <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">)))</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTALLOC<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span info&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Copy the span_info information */</span>
        ret_value<span class="hl opt">-&gt;</span>count <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
        ret_value<span class="hl opt">-&gt;</span>scratch <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
        ret_value<span class="hl opt">-&gt;</span>head <span class="hl opt">=</span> NULL<span class="hl opt">;</span>

        <span class="hl com">/* Set the scratch pointer in the node being copied to the newly allocated node */</span>
        spans<span class="hl opt">-&gt;</span>scratch <span class="hl opt">=</span> ret_value<span class="hl opt">;</span>

        <span class="hl com">/* Copy over the nodes in the span list */</span>
        span <span class="hl opt">=</span> spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
        prev_span <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
            <span class="hl com">/* Allocate a new node */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>new_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span> span<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span> NULL<span class="hl opt">,</span> NULL<span class="hl opt">)))</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTALLOC<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Append to list of spans */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">==</span> prev_span<span class="hl opt">)</span>
                ret_value<span class="hl opt">-&gt;</span>head <span class="hl opt">=</span> new_span<span class="hl opt">;</span>
            <span class="hl kwa">else</span>
                prev_span<span class="hl opt">-&gt;</span>next <span class="hl opt">=</span> new_span<span class="hl opt">;</span>

            <span class="hl com">/* Copy the pstride */</span>
            new_span<span class="hl opt">-&gt;</span>pstride <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>pstride<span class="hl opt">;</span>

            <span class="hl com">/* Recurse to copy the 'down' spans, if there are any */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>new_down <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_copy_span_helper</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">)))</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCOPY<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't copy hyperslab spans&quot;</span><span class="hl opt">)</span>
                new_span<span class="hl opt">-&gt;</span>down <span class="hl opt">=</span> new_down<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

            <span class="hl com">/* Update the previous (new) span */</span>
            prev_span <span class="hl opt">=</span> new_span<span class="hl opt">;</span>

            <span class="hl com">/* Advance to next span */</span>
            span <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_copy_span_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_copy_span</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Copy a hyperslab span tree</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    H5S_hyper_span_info_t * H5S_hyper_copy_span(span_info)</span>
<span class="hl com">        H5S_hyper_span_info_t *span_info;      IN: Span tree to copy</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Copy a hyperslab span tree, using reference counting as appropriate.</span>
<span class="hl com">    (Which means that just the nodes in the top span tree are duplicated and</span>
<span class="hl com">    the reference counts of their 'down spans' are just incremented)</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> H5S_hyper_span_info_t <span class="hl opt">*</span>
<span class="hl kwd">H5S_hyper_copy_span</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>ret_value<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_copy_span<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>

    <span class="hl com">/* Copy the hyperslab span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>ret_value <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_copy_span_helper</span><span class="hl opt">(</span>spans<span class="hl opt">)))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCOPY<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't copy hyperslab span tree&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Reset the scratch pointers for the next routine which needs them */</span>
    <span class="hl kwd">H5S_hyper_span_scratch</span><span class="hl opt">(</span>spans<span class="hl opt">,</span> NULL<span class="hl opt">);</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_copy_span() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_cmp_spans</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Check if two hyperslab slabs are the same</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_d H5S_hyper_cmp_spans(span1, span2)</span>
<span class="hl com">        H5S_hyper_span_t *span1;    IN: First span tree to compare</span>
<span class="hl com">        H5S_hyper_span_t *span2;    IN: Second span tree to compare</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    TRUE (1) or FALSE (0) on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Compare two hyperslab slabs to determine if they refer to the same</span>
<span class="hl com">    selection.  If span1 &amp; span2 are both NULL, that counts as equal</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> htri_t
<span class="hl kwd">H5S_hyper_cmp_spans</span> <span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>span_info1<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">*</span>span_info2<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span1<span class="hl opt">;</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span2<span class="hl opt">;</span>
    htri_t nest<span class="hl opt">=</span>FAIL<span class="hl opt">;</span>
    htri_t ret_value<span class="hl opt">=</span>FAIL<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_cmp_spans<span class="hl opt">)</span>

    <span class="hl com">/* Check for redundant comparison */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>span_info1<span class="hl opt">==</span>span_info2<span class="hl opt">)</span>
        ret_value<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Check for both spans being NULL */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>span_info1<span class="hl opt">==</span>NULL <span class="hl opt">&amp;&amp;</span> span_info2<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
            ret_value<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Check for one span being NULL */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span_info1<span class="hl opt">==</span>NULL <span class="hl opt">||</span> span_info2<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
                ret_value<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl com">/* Get the pointers to the actual lists of spans */</span>
                span1<span class="hl opt">=</span>span_info1<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
                span2<span class="hl opt">=</span>span_info2<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

                <span class="hl com">/* Sanity checking */</span>
                <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span1<span class="hl opt">);</span>
                <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span2<span class="hl opt">);</span>

                <span class="hl com">/* infinite loop which must be broken out of */</span>
                <span class="hl kwa">while</span> <span class="hl opt">(</span><span class="hl num">1</span><span class="hl opt">) {</span>
                    <span class="hl com">/* Check for both spans being NULL */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span1<span class="hl opt">==</span>NULL <span class="hl opt">&amp;&amp;</span> span2<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
                        ret_value<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>
                        <span class="hl kwa">break</span><span class="hl opt">;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* Check for one span being NULL */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>span1<span class="hl opt">==</span>NULL <span class="hl opt">||</span> span2<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
                            ret_value<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                            <span class="hl kwa">break</span><span class="hl opt">;</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                        <span class="hl kwa">else</span> <span class="hl opt">{</span>
                            <span class="hl com">/* Check if the actual low &amp; high span information is the same */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span>span1<span class="hl opt">-&gt;</span>low<span class="hl opt">!=</span>span2<span class="hl opt">-&gt;</span>low <span class="hl opt">||</span> span1<span class="hl opt">-&gt;</span>high<span class="hl opt">!=</span>span2<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                                ret_value<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                                <span class="hl kwa">break</span><span class="hl opt">;</span>
                            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                                <span class="hl kwa">if</span><span class="hl opt">(</span>span1<span class="hl opt">-&gt;</span>down<span class="hl opt">!=</span>NULL <span class="hl opt">||</span> span2<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                                    <span class="hl kwa">if</span><span class="hl opt">((</span>nest<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>span1<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span2<span class="hl opt">-&gt;</span>down<span class="hl opt">))==</span>FAIL<span class="hl opt">) {</span>
                                        ret_value<span class="hl opt">=</span>FAIL<span class="hl opt">;</span>
                                        <span class="hl kwa">break</span><span class="hl opt">;</span>
                                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                                        <span class="hl kwa">if</span><span class="hl opt">(</span>nest<span class="hl opt">==</span>FALSE<span class="hl opt">) {</span>
                                            ret_value<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                                            <span class="hl kwa">break</span><span class="hl opt">;</span>
                                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                                        <span class="hl kwa">else</span> <span class="hl opt">{</span>
                                            <span class="hl com">/* Keep going... */</span>
                                        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                                    <span class="hl com">/* Keep going... */</span>
                                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Advance to the next nodes in the span list */</span>
                    span1<span class="hl opt">=</span>span1<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
                    span2<span class="hl opt">=</span>span2<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_cmp_spans() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_free_span_info</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Free a hyperslab span info node</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_free_span_info(span_info)</span>
<span class="hl com">        H5S_hyper_span_info_t *span_info;      IN: Span info node to free</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Free a hyperslab span info node, along with all the span nodes and the</span>
<span class="hl com">    'down spans' from the nodes, if reducing their reference count to zero</span>
<span class="hl com">    indicates it is appropriate to do so.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_free_span_info</span> <span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>span_info<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">, *</span>next_span<span class="hl opt">;</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_free_span_info<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span_info<span class="hl opt">);</span>

    <span class="hl com">/* Decrement the span tree's reference count */</span>
    span_info<span class="hl opt">-&gt;</span>count<span class="hl opt">--;</span>

    <span class="hl com">/* Free the span tree if the reference count drops to zero */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>span_info<span class="hl opt">-&gt;</span>count<span class="hl opt">==</span><span class="hl num">0</span><span class="hl opt">) {</span>

        <span class="hl com">/* Work through the list of spans pointed to by this 'info' node */</span>
        span<span class="hl opt">=</span>span_info<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
            next_span<span class="hl opt">=</span>span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span</span><span class="hl opt">(</span>span<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release hyperslab span&quot;</span><span class="hl opt">)</span>
            span<span class="hl opt">=</span>next_span<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

        <span class="hl com">/* Free this span info */</span>
        span_info <span class="hl opt">=</span> <span class="hl kwd">H5FL_FREE</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">,</span> span_info<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_free_span_info() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_free_span</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Free a hyperslab span node</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_free_span(span)</span>
<span class="hl com">        H5S_hyper_span_t *span;      IN: Span node to free</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Free a hyperslab span node, along with the 'down spans' from the node,</span>
<span class="hl com">    if reducing their reference count to zero indicates it is appropriate to</span>
<span class="hl com">    do so.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_free_span</span> <span class="hl opt">(</span>H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">)</span>
<span class="hl opt">{</span>
    herr_t ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_free_span<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span<span class="hl opt">);</span>

    <span class="hl com">/* Decrement the reference count of the 'down spans', freeing them if appropriate */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release hyperslab span tree&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl com">/* Free this span */</span>
    span <span class="hl opt">=</span> <span class="hl kwd">H5FL_FREE</span><span class="hl opt">(</span>H5S_hyper_span_t<span class="hl opt">,</span> span<span class="hl opt">);</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_free_span() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_copy</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Copy a selection from one dataspace to another</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_copy(dst, src)</span>
<span class="hl com">        H5S_t *dst;  OUT: Pointer to the destination dataspace</span>
<span class="hl com">        H5S_t *src;  IN: Pointer to the source dataspace</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success/Negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Copies all the hyperslab selection information from the source</span>
<span class="hl com">    dataspace to the destination dataspace.</span>
<span class="hl com"></span>
<span class="hl com">    If the SHARE_SELECTION flag is set, then the selection can be shared</span>
<span class="hl com">    between the source and destination dataspaces.  (This should only occur in</span>
<span class="hl com">    situations where the destination dataspace will immediately change to a new</span>
<span class="hl com">    selection)</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_copy</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>dst<span class="hl opt">,</span> <span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>src<span class="hl opt">,</span> hbool_t share_selection<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_sel_t <span class="hl opt">*</span>dst_hslab<span class="hl opt">;</span>         <span class="hl com">/* Pointer to destination hyperslab info */</span>
    <span class="hl kwb">const</span> H5S_hyper_sel_t <span class="hl opt">*</span>src_hslab<span class="hl opt">;</span>   <span class="hl com">/* Pointer to source hyperslab info */</span>
    herr_t ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>   <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI</span><span class="hl opt">(</span>H5S_hyper_copy<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>src<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>dst<span class="hl opt">);</span>

    <span class="hl com">/* Allocate space for the hyperslab selection information */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>dst<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_sel_t<span class="hl opt">)))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab info&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Set temporary pointers */</span>
    dst_hslab<span class="hl opt">=</span>dst<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">;</span>
    src_hslab<span class="hl opt">=</span>src<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">;</span>

    <span class="hl com">/* Copy the hyperslab information */</span>
    dst_hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">=</span>src_hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">;</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>src_hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">size_t</span> u<span class="hl opt">;</span>       <span class="hl com">/* Local index variable */</span>

        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>src<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            dst_hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">]=</span>src_hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">];</span>
            dst_hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">]=</span>src_hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">];</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    dst<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>src<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">;</span>

    <span class="hl com">/* Check if there is hyperslab span information to copy */</span>
    <span class="hl com">/* (Regular hyperslab information is copied with the selection structure) */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>src<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>share_selection<span class="hl opt">) {</span>
            <span class="hl com">/* Share the source's span tree by incrementing the reference count on it */</span>
            dst<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">-&gt;</span>count<span class="hl opt">++;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span>
            <span class="hl com">/* Copy the hyperslab span information */</span>
            dst<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_copy_span</span><span class="hl opt">(</span>src<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* end H5S_hyper_copy() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_is_valid_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Check whether the selection fits within the extent, with the current</span>
<span class="hl com">    offset defined.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_is_valid_helper(spans, offset, rank);</span>
<span class="hl com">        const H5S_hyper_span_info_t *spans; IN: Pointer to current hyperslab span tree</span>
<span class="hl com">        const hssize_t *offset;             IN: Pointer to offset array</span>
<span class="hl com">        const hsize_t *size;                IN: Pointer to size array</span>
<span class="hl com">        hsize_t rank;                       IN: Current rank looking at</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    TRUE if the selection fits within the extent, FALSE if it does not and</span>
<span class="hl com">        Negative on an error.</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Determines if the current selection at the current offet fits within the</span>
<span class="hl com">    extent for the dataspace.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> htri_t
<span class="hl kwd">H5S_hyper_is_valid_helper</span> <span class="hl opt">(</span><span class="hl kwb">const</span> H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> <span class="hl kwb">const</span> hssize_t <span class="hl opt">*</span>offset<span class="hl opt">,</span> <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>size<span class="hl opt">,</span> hsize_t rank<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>curr<span class="hl opt">;</span>     <span class="hl com">/* Hyperslab information nodes */</span>
    htri_t tmp<span class="hl opt">;</span>                 <span class="hl com">/* temporary return value */</span>
    htri_t ret_value<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>      <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_is_valid_helper<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>offset<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>size<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>rank <span class="hl opt">&lt;</span> H5O_LAYOUT_NDIMS<span class="hl opt">);</span>

    <span class="hl com">/* Check each point to determine whether selection+offset is within extent */</span>
    curr<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
    <span class="hl kwa">while</span><span class="hl opt">(</span>curr<span class="hl opt">!=</span>NULL <span class="hl opt">&amp;&amp;</span> ret_value<span class="hl opt">==</span>TRUE<span class="hl opt">) {</span>
        <span class="hl com">/* Check if an offset has been defined */</span>
        <span class="hl com">/* Bounds check the selected point + offset against the extent */</span>
        <span class="hl kwa">if</span><span class="hl opt">((((</span>hssize_t<span class="hl opt">)</span>curr<span class="hl opt">-&gt;</span>low<span class="hl opt">+</span>offset<span class="hl opt">[</span>rank<span class="hl opt">])&gt;=(</span>hssize_t<span class="hl opt">)</span>size<span class="hl opt">[</span>rank<span class="hl opt">])</span>
                <span class="hl opt">|| (((</span>hssize_t<span class="hl opt">)</span>curr<span class="hl opt">-&gt;</span>low<span class="hl opt">+</span>offset<span class="hl opt">[</span>rank<span class="hl opt">])&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl opt">|| (((</span>hssize_t<span class="hl opt">)</span>curr<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span>offset<span class="hl opt">[</span>rank<span class="hl opt">])&gt;=(</span>hssize_t<span class="hl opt">)</span>size<span class="hl opt">[</span>rank<span class="hl opt">])</span>
                <span class="hl opt">|| (((</span>hssize_t<span class="hl opt">)</span>curr<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span>offset<span class="hl opt">[</span>rank<span class="hl opt">])&lt;</span><span class="hl num">0</span><span class="hl opt">)) {</span>
            ret_value<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
            <span class="hl kwa">break</span><span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Recurse if this node has down spans */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
            <span class="hl kwa">if</span><span class="hl opt">((</span>tmp<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_is_valid_helper</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>offset<span class="hl opt">,</span>size<span class="hl opt">,</span>rank<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">))!=</span>TRUE<span class="hl opt">) {</span>
                ret_value<span class="hl opt">=</span>tmp<span class="hl opt">;</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Advance to next node */</span>
        curr<span class="hl opt">=</span>curr<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* end H5S_hyper_is_valid_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_is_valid</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Check whether the selection fits within the extent, with the current</span>
<span class="hl com">    offset defined.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_is_valid(space);</span>
<span class="hl com">        H5S_t *space;             IN: Dataspace pointer to query</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    TRUE if the selection fits within the extent, FALSE if it does not and</span>
<span class="hl com">        Negative on an error.</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Determines if the current selection at the current offet fits within the</span>
<span class="hl com">    extent for the dataspace.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
htri_t
<span class="hl kwd">H5S_hyper_is_valid</span> <span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                    <span class="hl com">/* Counter */</span>
    htri_t ret_value<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>      <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_is_valid<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>diminfo<span class="hl opt">=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span> <span class="hl com">/* local alias for diminfo */</span>
        hssize_t end<span class="hl opt">;</span>      <span class="hl com">/* The high bound of a region in a dimension */</span>

        <span class="hl com">/* Check each dimension */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl com">/* if block or count is zero, then can skip the test since */</span>
            <span class="hl com">/* no data point is chosen */</span>
            <span class="hl kwa">if</span> <span class="hl opt">(</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">&amp;&amp;</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block<span class="hl opt">) {</span>
                <span class="hl com">/* Bounds check the start point in this dimension */</span>
                <span class="hl kwa">if</span><span class="hl opt">(((</span>hssize_t<span class="hl opt">)</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">+</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>u<span class="hl opt">])&lt;</span><span class="hl num">0</span> <span class="hl opt">||</span>
                        <span class="hl opt">((</span>hssize_t<span class="hl opt">)</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">+</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>u<span class="hl opt">])&gt;=(</span>hssize_t<span class="hl opt">)</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">[</span>u<span class="hl opt">])</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>

                <span class="hl com">/* Compute the largest location in this dimension */</span>
                end<span class="hl opt">=(</span>hssize_t<span class="hl opt">)(</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">+</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride<span class="hl opt">*(</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)+(</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">))+</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>u<span class="hl opt">];</span>

                <span class="hl com">/* Bounds check the end point in this dimension */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>end<span class="hl opt">&lt;</span><span class="hl num">0</span> <span class="hl opt">||</span> end<span class="hl opt">&gt;=(</span>hssize_t<span class="hl opt">)</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">[</span>u<span class="hl opt">])</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Call the recursive routine to validate the span tree */</span>
        ret_value<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_is_valid_helper</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">,</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">,(</span>hsize_t<span class="hl opt">)</span><span class="hl num">0</span><span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* end H5S_hyper_is_valid() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_span_nblocks</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Count the number of blocks in a span tree</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    hsize_t H5S_hyper_span_nblocks(spans)</span>
<span class="hl com">        const H5S_hyper_span_info_t *spans; IN: Hyperslab span tree to count elements of</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Number of blocks in span tree on success; negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Counts the number of blocks described by the spans in a span tree.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> hsize_t
<span class="hl kwd">H5S_hyper_span_nblocks</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>     <span class="hl com">/* Hyperslab span */</span>
    hsize_t ret_value <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>      <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_span_nblocks<span class="hl opt">)</span>

    <span class="hl com">/* Count the number of elements in the span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>spans <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
        span <span class="hl opt">=</span> spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
            <span class="hl com">/* If there are down spans, add the total down span blocks */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">!=</span>NULL<span class="hl opt">)</span>
                ret_value <span class="hl opt">+=</span> <span class="hl kwd">H5S_hyper_span_nblocks</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>
            <span class="hl com">/* If there are no down spans, just count the block in this span */</span>
            <span class="hl kwa">else</span>
                ret_value<span class="hl opt">++;</span>

            <span class="hl com">/* Advance to next span */</span>
            span <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_span_nblocks() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_get_select_hyper_nblocks</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Get the number of hyperslab blocks in current hyperslab selection</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    hsize_t H5S_get_select_hyper_nblocks(space)</span>
<span class="hl com">        H5S_t *space;             IN: Dataspace ptr of selection to query</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    The number of hyperslab blocks in selection on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Returns the number of hyperslab blocks in current selection for dataspace.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> hsize_t
<span class="hl kwd">H5S_get_select_hyper_nblocks</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    hsize_t ret_value<span class="hl opt">;</span>         <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_get_select_hyper_nblocks<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                 <span class="hl com">/* Local index variable */</span>

        <span class="hl com">/* Check each dimension */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>ret_value <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">,</span> u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            ret_value <span class="hl opt">*=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span>
        ret_value <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_span_nblocks</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_get_select_hyper_nblocks() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5Sget_select_hyper_nblocks</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Get the number of hyperslab blocks in current hyperslab selection</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    hssize_t H5Sget_select_hyper_nblocks(dsid)</span>
<span class="hl com">        hid_t dsid;             IN: Dataspace ID of selection to query</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    The number of hyperslab blocks in selection on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Returns the number of hyperslab blocks in current selection for dataspace.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
hssize_t
<span class="hl kwd">H5Sget_select_hyper_nblocks</span><span class="hl opt">(</span>hid_t spaceid<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_t <span class="hl opt">*</span>space<span class="hl opt">;</span>               <span class="hl com">/* Dataspace to modify selection of */</span>
    hssize_t ret_value<span class="hl opt">;</span>         <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_API</span><span class="hl opt">(</span>H5Sget_select_hyper_nblocks<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>
    <span class="hl kwd">H5TRACE1</span><span class="hl opt">(</span><span class="hl str">&quot;Hs&quot;</span><span class="hl opt">,</span> <span class="hl str">&quot;i&quot;</span><span class="hl opt">,</span> spaceid<span class="hl opt">);</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>space <span class="hl opt">= (</span>H5S_t <span class="hl opt">*)</span><span class="hl kwd">H5I_object_verify</span><span class="hl opt">(</span>spaceid<span class="hl opt">,</span> H5I_DATASPACE<span class="hl opt">)))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADTYPE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;not a data space&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">) !=</span> H5S_SEL_HYPERSLABS<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADTYPE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;not a hyperslab selection&quot;</span><span class="hl opt">)</span>

    ret_value <span class="hl opt">= (</span>hssize_t<span class="hl opt">)</span><span class="hl kwd">H5S_get_select_hyper_nblocks</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_API</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5Sget_select_hyper_nblocks() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_serial_size</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Determine the number of bytes needed to store the serialized hyperslab</span>
<span class="hl com">        selection information.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    hssize_t H5S_hyper_serial_size(space)</span>
<span class="hl com">        H5S_t *space;             IN: Dataspace pointer to query</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    The number of bytes required on success, negative on an error.</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Determines the number of bytes required to serialize the current hyperslab</span>
<span class="hl com">    selection information for storage on disk.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> hssize_t
<span class="hl kwd">H5S_hyper_serial_size</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                 <span class="hl com">/* Counter */</span>
    hsize_t block_count<span class="hl opt">;</span>       <span class="hl com">/* block counter for regular hyperslabs */</span>
    hssize_t ret_value<span class="hl opt">;</span>         <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_serial_size<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Basic number of bytes required to serialize hyperslab selection:</span>
<span class="hl com">     *  &lt;type (4 bytes)&gt; + &lt;version (4 bytes)&gt; + &lt;padding (4 bytes)&gt; +</span>
<span class="hl com">     *      &lt;length (4 bytes)&gt; + &lt;rank (4 bytes)&gt; + &lt;# of blocks (4 bytes)&gt; = 24 bytes</span>
<span class="hl com">     */</span>
    ret_value <span class="hl opt">=</span> <span class="hl num">24</span><span class="hl opt">;</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl com">/* Check each dimension */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>block_count <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">,</span> u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            block_count <span class="hl opt">*=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span>
        <span class="hl com">/* Spin through hyperslab spans, adding 8 * rank bytes for each block */</span>
        block_count <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_span_nblocks</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>

    <span class="hl kwd">H5_CHECK_OVERFLOW</span><span class="hl opt">((</span><span class="hl num">8</span> <span class="hl opt">*</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">*</span> block_count<span class="hl opt">),</span> hsize_t<span class="hl opt">,</span> hssize_t<span class="hl opt">);</span>
    ret_value <span class="hl opt">+= (</span>hssize_t<span class="hl opt">)(</span><span class="hl num">8</span> <span class="hl opt">*</span> block_count <span class="hl opt">*</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* end H5S_hyper_serial_size() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_serialize_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Serialize the current selection into a user-provided buffer.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_serialize_helper(spans, start, end, rank, buf)</span>
<span class="hl com">        H5S_hyper_span_info_t *spans;   IN: Hyperslab span tree to serialize</span>
<span class="hl com">        hssize_t start[];       IN/OUT: Accumulated start points</span>
<span class="hl com">        hssize_t end[];         IN/OUT: Accumulated end points</span>
<span class="hl com">        hsize_t rank;           IN: Current rank looking at</span>
<span class="hl com">        uint8 *buf;             OUT: Buffer to put serialized selection into</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success/Negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Serializes the current element selection into a buffer.  (Primarily for</span>
<span class="hl com">    storing on disk).</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_serialize_helper</span> <span class="hl opt">(</span><span class="hl kwb">const</span> H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>start<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>end<span class="hl opt">,</span> hsize_t rank<span class="hl opt">,</span> <span class="hl kwb">uint8_t</span> <span class="hl opt">**</span>buf<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>curr<span class="hl opt">;</span>     <span class="hl com">/* Pointer to current hyperslab span */</span>
    hsize_t u<span class="hl opt">;</span>                  <span class="hl com">/* Index variable */</span>
    herr_t ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>  <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_serialize_helper<span class="hl opt">)</span>

    <span class="hl com">/* Sanity checks */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>end<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>rank <span class="hl opt">&lt;</span> H5O_LAYOUT_NDIMS<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>buf <span class="hl opt">&amp;&amp; *</span>buf<span class="hl opt">);</span>

    <span class="hl com">/* Walk through the list of spans, recursing or outputing them */</span>
    curr<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
    <span class="hl kwa">while</span><span class="hl opt">(</span>curr<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl com">/* Recurse if this node has down spans */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
            <span class="hl com">/* Add the starting and ending points for this span to the list */</span>
            start<span class="hl opt">[</span>rank<span class="hl opt">]=</span>curr<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>
            end<span class="hl opt">[</span>rank<span class="hl opt">]=</span>curr<span class="hl opt">-&gt;</span>high<span class="hl opt">;</span>

            <span class="hl com">/* Recurse down to the next dimension */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_serialize_helper</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>start<span class="hl opt">,</span>end<span class="hl opt">,</span>rank<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>buf<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release hyperslab spans&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Encode all the previous dimensions starting &amp; ending points */</span>

            <span class="hl com">/* Encode previous starting points */</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>rank<span class="hl opt">;</span> u<span class="hl opt">++)</span>
                <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(*</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span>start<span class="hl opt">[</span>u<span class="hl opt">]);</span>

            <span class="hl com">/* Encode starting point for this span */</span>
            <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(*</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span>curr<span class="hl opt">-&gt;</span>low<span class="hl opt">);</span>

            <span class="hl com">/* Encode previous ending points */</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>rank<span class="hl opt">;</span> u<span class="hl opt">++)</span>
                <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(*</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span>end<span class="hl opt">[</span>u<span class="hl opt">]);</span>

            <span class="hl com">/* Encode starting point for this span */</span>
            <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(*</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span>curr<span class="hl opt">-&gt;</span>high<span class="hl opt">);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

        <span class="hl com">/* Advance to next node */</span>
        curr<span class="hl opt">=</span>curr<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_serialize_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_serialize</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Serialize the current selection into a user-provided buffer.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_serialize(space, buf)</span>
<span class="hl com">        H5S_t *space;           IN: Dataspace pointer of selection to serialize</span>
<span class="hl com">        uint8 *buf;             OUT: Buffer to put serialized selection into</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success/Negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Serializes the current element selection into a buffer.  (Primarily for</span>
<span class="hl com">    storing on disk).</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_serialize</span> <span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">uint8_t</span> <span class="hl opt">*</span>buf<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>diminfo<span class="hl opt">;</span>         <span class="hl com">/* Alias for dataspace's diminfo information */</span>
    hsize_t tmp_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary hyperslab counts */</span>
    hsize_t offset<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>      <span class="hl com">/* Offset of element in dataspace */</span>
    hsize_t start<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Location of start of hyperslab */</span>
    hsize_t end<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>     <span class="hl com">/* Location of end of hyperslab */</span>
    hsize_t temp_off<span class="hl opt">;</span>            <span class="hl com">/* Offset in a given dimension */</span>
    <span class="hl kwb">uint8_t</span> <span class="hl opt">*</span>lenp<span class="hl opt">;</span>          <span class="hl com">/* pointer to length location for later storage */</span>
    <span class="hl kwb">uint32_t</span> len <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>       <span class="hl com">/* number of bytes used */</span>
    hsize_t block_count<span class="hl opt">;</span>    <span class="hl com">/* block counter for regular hyperslabs */</span>
    <span class="hl kwb">unsigned</span> fast_dim<span class="hl opt">;</span>      <span class="hl com">/* Rank of the fastest changing dimension for the dataspace */</span>
    <span class="hl kwb">unsigned</span> ndims<span class="hl opt">;</span>         <span class="hl com">/* Rank of the dataspace */</span>
    <span class="hl kwb">int</span> done<span class="hl opt">;</span>               <span class="hl com">/* Whether we are done with the iteration */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_serialize<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Store the preamble information */</span>
    <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">));</span>  <span class="hl com">/* Store the type of selection */</span>
    <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span><span class="hl num">1</span><span class="hl opt">);</span>  <span class="hl com">/* Store the version number */</span>
    <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span><span class="hl num">0</span><span class="hl opt">);</span>  <span class="hl com">/* Store the un-used padding */</span>
    lenp <span class="hl opt">=</span> buf<span class="hl opt">;</span>           <span class="hl com">/* keep the pointer to the length location for later */</span>
    buf <span class="hl opt">+=</span> <span class="hl num">4</span><span class="hl opt">;</span>             <span class="hl com">/* skip over space for length */</span>

    <span class="hl com">/* Encode number of dimensions */</span>
    <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span>
    len <span class="hl opt">+=</span> <span class="hl num">4</span><span class="hl opt">;</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>     <span class="hl com">/* Local counting variable */</span>

        <span class="hl com">/* Set some convienence values */</span>
        ndims <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span>
        fast_dim <span class="hl opt">=</span> ndims <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>
        diminfo<span class="hl opt">=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span>

        <span class="hl com">/* Check each dimension */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>block_count <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">,</span> u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> ndims<span class="hl opt">;</span> u<span class="hl opt">++)</span>
            block_count <span class="hl opt">*=</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">;</span>

        <span class="hl com">/* Encode number of hyperslabs */</span>
        <span class="hl kwd">H5_CHECK_OVERFLOW</span><span class="hl opt">(</span>block_count<span class="hl opt">,</span> hsize_t<span class="hl opt">,</span> <span class="hl kwb">uint32_t</span><span class="hl opt">);</span>
        <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span>block_count<span class="hl opt">);</span>
        len<span class="hl opt">+=</span><span class="hl num">4</span><span class="hl opt">;</span>

        <span class="hl com">/* Now serialize the information for the regular hyperslab */</span>

        <span class="hl com">/* Build the tables of count sizes as well as the initial offset */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> ndims<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            tmp_count<span class="hl opt">[</span>u<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">;</span>
            offset<span class="hl opt">[</span>u<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* We're not done with the iteration */</span>
        done<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

        <span class="hl com">/* Go iterate over the hyperslabs */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>done<span class="hl opt">==</span><span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl com">/* Iterate over the blocks in the fastest dimension */</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>tmp_count<span class="hl opt">[</span>fast_dim<span class="hl opt">]&gt;</span><span class="hl num">0</span><span class="hl opt">) {</span>
                <span class="hl com">/* Add 8 bytes times the rank for each hyperslab selected */</span>
                len<span class="hl opt">+=</span><span class="hl num">8</span><span class="hl opt">*</span>ndims<span class="hl opt">;</span>

                <span class="hl com">/* Encode hyperslab starting location */</span>
                <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> ndims<span class="hl opt">;</span> u<span class="hl opt">++)</span>
                    <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span>offset<span class="hl opt">[</span>u<span class="hl opt">]);</span>

                <span class="hl com">/* Encode hyperslab ending location */</span>
                <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> ndims<span class="hl opt">;</span> u<span class="hl opt">++)</span>
                    <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)(</span>offset<span class="hl opt">[</span>u<span class="hl opt">] + (</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">)));</span>

                <span class="hl com">/* Move the offset to the next sequence to start */</span>
                offset<span class="hl opt">[</span>fast_dim<span class="hl opt">]+=</span>diminfo<span class="hl opt">[</span>fast_dim<span class="hl opt">].</span>stride<span class="hl opt">;</span>

                <span class="hl com">/* Decrement the block count */</span>
                tmp_count<span class="hl opt">[</span>fast_dim<span class="hl opt">]--;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

            <span class="hl com">/* Work on other dimensions if necessary */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>fast_dim <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
                <span class="hl kwb">int</span> temp_dim<span class="hl opt">;</span>           <span class="hl com">/* Temporary rank holder */</span>

                <span class="hl com">/* Reset the block counts */</span>
                tmp_count<span class="hl opt">[</span>fast_dim<span class="hl opt">]=</span>diminfo<span class="hl opt">[</span>fast_dim<span class="hl opt">].</span>count<span class="hl opt">;</span>

                <span class="hl com">/* Bubble up the decrement to the slower changing dimensions */</span>
                temp_dim <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>fast_dim <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>
                <span class="hl kwa">while</span><span class="hl opt">(</span>temp_dim <span class="hl opt">&gt;=</span> <span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> done <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">) {</span>
                    <span class="hl com">/* Decrement the block count */</span>
                    tmp_count<span class="hl opt">[</span>temp_dim<span class="hl opt">]--;</span>

                    <span class="hl com">/* Check if we have more blocks left */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>tmp_count<span class="hl opt">[</span>temp_dim<span class="hl opt">] &gt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwa">break</span><span class="hl opt">;</span>

                    <span class="hl com">/* Check for getting out of iterator */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>temp_dim <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">)</span>
                        done <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>

                    <span class="hl com">/* Reset the block count in this dimension */</span>
                    tmp_count<span class="hl opt">[</span>temp_dim<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>temp_dim<span class="hl opt">].</span>count<span class="hl opt">;</span>

                    <span class="hl com">/* Wrapped a dimension, go up to next dimension */</span>
                    temp_dim<span class="hl opt">--;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">else</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>  <span class="hl com">/* Break out now, for 1-D selections */</span>

            <span class="hl com">/* Re-compute offset array */</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> ndims<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
                temp_off <span class="hl opt">=</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">+</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride <span class="hl opt">* (</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">-</span> tmp_count<span class="hl opt">[</span>u<span class="hl opt">]);</span>
                offset<span class="hl opt">[</span>u<span class="hl opt">] =</span> temp_off<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Encode number of hyperslabs */</span>
        block_count <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_span_nblocks</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>
        <span class="hl kwd">H5_CHECK_OVERFLOW</span><span class="hl opt">(</span>block_count<span class="hl opt">,</span> hsize_t<span class="hl opt">,</span> <span class="hl kwb">uint32_t</span><span class="hl opt">);</span>
        <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(</span>buf<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span>block_count<span class="hl opt">);</span>
        len<span class="hl opt">+=</span><span class="hl num">4</span><span class="hl opt">;</span>

        <span class="hl com">/* Add 8 bytes times the rank for each hyperslab selected */</span>
        <span class="hl kwd">H5_CHECK_OVERFLOW</span><span class="hl opt">((</span><span class="hl num">8</span> <span class="hl opt">*</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">*</span> block_count<span class="hl opt">),</span> hsize_t<span class="hl opt">,</span> <span class="hl kwb">size_t</span><span class="hl opt">);</span>
        len <span class="hl opt">+= (</span><span class="hl kwb">size_t</span><span class="hl opt">)(</span><span class="hl num">8</span> <span class="hl opt">*</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">*</span> block_count<span class="hl opt">);</span>

        <span class="hl com">/* Encode each hyperslab in selection */</span>
        <span class="hl kwd">H5S_hyper_serialize_helper</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span> start<span class="hl opt">,</span> end<span class="hl opt">, (</span>hsize_t<span class="hl opt">)</span><span class="hl num">0</span><span class="hl opt">, &amp;</span>buf<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl com">/* Encode length */</span>
    <span class="hl kwd">UINT32ENCODE</span><span class="hl opt">(</span>lenp<span class="hl opt">, (</span><span class="hl kwb">uint32_t</span><span class="hl opt">)</span>len<span class="hl opt">);</span>  <span class="hl com">/* Store the length of the extra information */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_serialize() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_deserialize</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Deserialize the current selection from a user-provided buffer.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_deserialize(space, buf)</span>
<span class="hl com">        H5S_t *space;           IN/OUT: Dataspace pointer to place selection into</span>
<span class="hl com">        uint8 *buf;             IN: Buffer to retrieve serialized selection from</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success/Negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Deserializes the current selection into a buffer.  (Primarily for retrieving</span>
<span class="hl com">    from disk).</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_deserialize</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">const uint8_t</span> <span class="hl opt">*</span>buf<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">uint32_t</span> rank<span class="hl opt">;</span>           	<span class="hl com">/* rank of points */</span>
    <span class="hl kwb">size_t</span> num_elem<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>      	<span class="hl com">/* number of elements in selection */</span>
    hsize_t start<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>	<span class="hl com">/* hyperslab start information */</span>
    hsize_t end<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>	<span class="hl com">/* hyperslab end information */</span>
    hsize_t stride<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* hyperslab stride information */</span>
    hsize_t count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* hyperslab count information */</span>
    hsize_t block<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* hyperslab block information */</span>
    hsize_t <span class="hl opt">*</span>tstart<span class="hl opt">=</span>NULL<span class="hl opt">;</span>	<span class="hl com">/* temporary hyperslab pointers */</span>
    hsize_t <span class="hl opt">*</span>tend<span class="hl opt">=</span>NULL<span class="hl opt">;</span>		<span class="hl com">/* temporary hyperslab pointers */</span>
    hsize_t <span class="hl opt">*</span>tstride<span class="hl opt">=</span>NULL<span class="hl opt">;</span>	<span class="hl com">/* temporary hyperslab pointers */</span>
    hsize_t <span class="hl opt">*</span>tcount<span class="hl opt">=</span>NULL<span class="hl opt">;</span>	<span class="hl com">/* temporary hyperslab pointers */</span>
    hsize_t <span class="hl opt">*</span>tblock<span class="hl opt">=</span>NULL<span class="hl opt">;</span>	<span class="hl com">/* temporary hyperslab pointers */</span>
    <span class="hl kwb">unsigned</span> i<span class="hl opt">,</span>j<span class="hl opt">;</span>              	<span class="hl com">/* local counting variables */</span>
    herr_t ret_value<span class="hl opt">=</span>FAIL<span class="hl opt">;</span>  	<span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI</span><span class="hl opt">(</span>H5S_hyper_deserialize<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>buf<span class="hl opt">);</span>

    <span class="hl com">/* Deserialize slabs to select */</span>
    buf<span class="hl opt">+=</span><span class="hl num">16</span><span class="hl opt">;</span>    <span class="hl com">/* Skip over selection header */</span>
    <span class="hl kwd">UINT32DECODE</span><span class="hl opt">(</span>buf<span class="hl opt">,</span>rank<span class="hl opt">);</span>  <span class="hl com">/* decode the rank of the point selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>rank<span class="hl opt">!=</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADRANGE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;rank of pointer does not match dataspace&quot;</span><span class="hl opt">)</span>
    <span class="hl kwd">UINT32DECODE</span><span class="hl opt">(</span>buf<span class="hl opt">,</span>num_elem<span class="hl opt">);</span>  <span class="hl com">/* decode the number of points */</span>

    <span class="hl com">/* Set the count &amp; stride for all blocks */</span>
    <span class="hl kwa">for</span><span class="hl opt">(</span>tcount<span class="hl opt">=</span>count<span class="hl opt">,</span>tstride<span class="hl opt">=</span>stride<span class="hl opt">,</span>j<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> j<span class="hl opt">&lt;</span>rank<span class="hl opt">;</span> j<span class="hl opt">++,</span>tstride<span class="hl opt">++,</span>tcount<span class="hl opt">++) {</span>
        <span class="hl opt">*</span>tcount<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>
        <span class="hl opt">*</span>tstride<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

    <span class="hl com">/* Retrieve the coordinates from the buffer */</span>
    <span class="hl kwa">for</span><span class="hl opt">(</span>i<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> i<span class="hl opt">&lt;</span>num_elem<span class="hl opt">;</span> i<span class="hl opt">++) {</span>
        <span class="hl com">/* Decode the starting points */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>tstart<span class="hl opt">=</span>start<span class="hl opt">,</span>j<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> j<span class="hl opt">&lt;</span>rank<span class="hl opt">;</span> j<span class="hl opt">++,</span>tstart<span class="hl opt">++)</span>
            <span class="hl kwd">UINT32DECODE</span><span class="hl opt">(</span>buf<span class="hl opt">, *</span>tstart<span class="hl opt">);</span>

        <span class="hl com">/* Decode the ending points */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>tend<span class="hl opt">=</span>end<span class="hl opt">,</span>j<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> j<span class="hl opt">&lt;</span>rank<span class="hl opt">;</span> j<span class="hl opt">++,</span>tend<span class="hl opt">++)</span>
            <span class="hl kwd">UINT32DECODE</span><span class="hl opt">(</span>buf<span class="hl opt">, *</span>tend<span class="hl opt">);</span>

        <span class="hl com">/* Change the ending points into blocks */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>tblock<span class="hl opt">=</span>block<span class="hl opt">,</span>tstart<span class="hl opt">=</span>start<span class="hl opt">,</span>tend<span class="hl opt">=</span>end<span class="hl opt">,</span>j<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> j<span class="hl opt">&lt;(</span><span class="hl kwb">unsigned</span><span class="hl opt">)</span>rank<span class="hl opt">;</span> j<span class="hl opt">++,</span>tstart<span class="hl opt">++,</span>tend<span class="hl opt">++,</span>tblock<span class="hl opt">++)</span>
            <span class="hl opt">*</span>tblock<span class="hl opt">=(*</span>tend<span class="hl opt">-*</span>tstart<span class="hl opt">)+</span><span class="hl num">1</span><span class="hl opt">;</span>

        <span class="hl com">/* Select or add the hyperslab to the current selection */</span>
        <span class="hl kwa">if</span><span class="hl opt">((</span>ret_value<span class="hl opt">=</span><span class="hl kwd">H5S_select_hyperslab</span><span class="hl opt">(</span>space<span class="hl opt">,(</span>i<span class="hl opt">==</span><span class="hl num">0</span> ? H5S_SELECT_SET <span class="hl opt">:</span> H5S_SELECT_OR<span class="hl opt">),</span>start<span class="hl opt">,</span>stride<span class="hl opt">,</span>count<span class="hl opt">,</span>block<span class="hl opt">))&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't change selection&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_deserialize() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_span_blocklist</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Get a list of hyperslab blocks currently selected</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_span_blocklist(spans, start, end, rank, startblock, numblocks, buf)</span>
<span class="hl com">        H5S_hyper_span_info_t *spans;   IN: Dataspace pointer of selection to query</span>
<span class="hl com">        hsize_t start[];       IN/OUT: Accumulated start points</span>
<span class="hl com">        hsize_t end[];         IN/OUT: Accumulated end points</span>
<span class="hl com">        hsize_t rank;           IN: Rank of dataspace</span>
<span class="hl com">        hsize_t *startblock;    IN/OUT: Hyperslab block to start with</span>
<span class="hl com">        hsize_t *numblocks;     IN/OUT: Number of hyperslab blocks to get</span>
<span class="hl com">        hsize_t **buf;          OUT: List of hyperslab blocks selected</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success/Negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">        Puts a list of the hyperslab blocks into the user's buffer.  The blocks</span>
<span class="hl com">    start with the '*startblock'th block in the list of blocks and put</span>
<span class="hl com">    '*numblocks' number of blocks into the user's buffer (or until the end of</span>
<span class="hl com">    the list of blocks, whichever happens first)</span>
<span class="hl com">        The block coordinates have the same dimensionality (rank) as the</span>
<span class="hl com">    dataspace they are located within.  The list of blocks is formatted as</span>
<span class="hl com">    follows: &lt;&quot;start&quot; coordinate&gt; immediately followed by &lt;&quot;opposite&quot; corner</span>
<span class="hl com">    coordinate&gt;, followed by the next &quot;start&quot; and &quot;opposite&quot; coordinate, etc.</span>
<span class="hl com">    until all the block information requested has been put into the user's</span>
<span class="hl com">    buffer.</span>
<span class="hl com">        No guarantee of any order of the blocks is implied.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_span_blocklist</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> hsize_t start<span class="hl opt">[],</span> hsize_t end<span class="hl opt">[],</span> hsize_t rank<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>startblock<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>numblocks<span class="hl opt">,</span> hsize_t <span class="hl opt">**</span>buf<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>curr<span class="hl opt">;</span>     <span class="hl com">/* Pointer to current hyperslab span */</span>
    hsize_t u<span class="hl opt">;</span>                  <span class="hl com">/* Index variable */</span>
    herr_t ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span> <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_span_blocklist<span class="hl opt">)</span>

    <span class="hl com">/* Sanity checks */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>rank <span class="hl opt">&lt;</span> H5O_LAYOUT_NDIMS<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>end<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>startblock<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>numblocks <span class="hl opt">&amp;&amp; *</span>numblocks <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>buf <span class="hl opt">&amp;&amp; *</span>buf<span class="hl opt">);</span>

    <span class="hl com">/* Walk through the list of spans, recursing or outputing them */</span>
    curr <span class="hl opt">=</span> spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
    <span class="hl kwa">while</span><span class="hl opt">(</span>curr <span class="hl opt">!=</span> NULL <span class="hl opt">&amp;&amp; *</span>numblocks <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
        <span class="hl com">/* Recurse if this node has down spans */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
            <span class="hl com">/* Add the starting and ending points for this span to the list */</span>
            start<span class="hl opt">[</span>rank<span class="hl opt">] =</span> curr<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>
            end<span class="hl opt">[</span>rank<span class="hl opt">] =</span> curr<span class="hl opt">-&gt;</span>high<span class="hl opt">;</span>

            <span class="hl com">/* Recurse down to the next dimension */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_span_blocklist</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span> start<span class="hl opt">,</span> end<span class="hl opt">, (</span>rank <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">),</span> startblock<span class="hl opt">,</span> numblocks<span class="hl opt">,</span> buf<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release hyperslab spans&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Skip this block if we haven't skipped all the startblocks yet */</span>
            <span class="hl kwa">if</span><span class="hl opt">(*</span>startblock <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
                <span class="hl com">/* Decrement the starting block */</span>
                <span class="hl opt">(*</span>startblock<span class="hl opt">)--;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl com">/* Process this block */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl com">/* Encode all the previous dimensions starting &amp; ending points */</span>

                <span class="hl com">/* Copy previous starting points */</span>
                <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> rank<span class="hl opt">;</span> u<span class="hl opt">++, (*</span>buf<span class="hl opt">)++)</span>
                    <span class="hl kwd">HDmemcpy</span><span class="hl opt">(*</span>buf<span class="hl opt">, &amp;</span>start<span class="hl opt">[</span>u<span class="hl opt">],</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hsize_t<span class="hl opt">));</span>

                <span class="hl com">/* Copy starting point for this span */</span>
                <span class="hl kwd">HDmemcpy</span><span class="hl opt">(*</span>buf<span class="hl opt">, &amp;</span>curr<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hsize_t<span class="hl opt">));</span>
                <span class="hl opt">(*</span>buf<span class="hl opt">)++;</span>

                <span class="hl com">/* Copy previous ending points */</span>
                <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> rank<span class="hl opt">;</span> u<span class="hl opt">++, (*</span>buf<span class="hl opt">)++)</span>
                    <span class="hl kwd">HDmemcpy</span><span class="hl opt">(*</span>buf<span class="hl opt">, &amp;</span>end<span class="hl opt">[</span>u<span class="hl opt">],</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hsize_t<span class="hl opt">));</span>

                <span class="hl com">/* Copy starting point for this span */</span>
                <span class="hl kwd">HDmemcpy</span><span class="hl opt">(*</span>buf<span class="hl opt">, &amp;</span>curr<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hsize_t<span class="hl opt">));</span>
                <span class="hl opt">(*</span>buf<span class="hl opt">)++;</span>

                <span class="hl com">/* Decrement the number of blocks processed */</span>
                <span class="hl opt">(*</span>numblocks<span class="hl opt">)--;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

        <span class="hl com">/* Advance to next node */</span>
        curr <span class="hl opt">=</span> curr<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_span_blocklist() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_get_select_hyper_blocklist</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Get the list of hyperslab blocks currently selected</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_get_select_hyper_blocklist(space, startblock, numblocks, buf)</span>
<span class="hl com">        H5S_t *space;           IN: Dataspace pointer of selection to query</span>
<span class="hl com">        hsize_t startblock;     IN: Hyperslab block to start with</span>
<span class="hl com">        hsize_t numblocks;      IN: Number of hyperslab blocks to get</span>
<span class="hl com">        hsize_t *buf;           OUT: List of hyperslab blocks selected</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">        Puts a list of the hyperslab blocks into the user's buffer.  The blocks</span>
<span class="hl com">    start with the 'startblock'th block in the list of blocks and put</span>
<span class="hl com">    'numblocks' number of blocks into the user's buffer (or until the end of</span>
<span class="hl com">    the list of blocks, whichever happens first)</span>
<span class="hl com">        The block coordinates have the same dimensionality (rank) as the</span>
<span class="hl com">    dataspace they are located within.  The list of blocks is formatted as</span>
<span class="hl com">    follows: &lt;&quot;start&quot; coordinate&gt; immediately followed by &lt;&quot;opposite&quot; corner</span>
<span class="hl com">    coordinate&gt;, followed by the next &quot;start&quot; and &quot;opposite&quot; coordinate, etc.</span>
<span class="hl com">    until all the block information requested has been put into the user's</span>
<span class="hl com">    buffer.</span>
<span class="hl com">        No guarantee of any order of the blocks is implied.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_get_select_hyper_blocklist</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> hbool_t internal<span class="hl opt">,</span> hsize_t startblock<span class="hl opt">,</span> hsize_t numblocks<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>buf<span class="hl opt">)</span>
<span class="hl opt">{</span>
    herr_t ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span> <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_get_select_hyper_blocklist<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>buf<span class="hl opt">);</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>diminfo<span class="hl opt">;</span> <span class="hl com">/* Alias for dataspace's diminfo information */</span>
        hsize_t tmp_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary hyperslab counts */</span>
        hsize_t offset<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>      <span class="hl com">/* Offset of element in dataspace */</span>
        <span class="hl kwb">unsigned</span> fast_dim<span class="hl opt">;</span>          <span class="hl com">/* Rank of the fastest changing dimension for the dataspace */</span>
        <span class="hl kwb">unsigned</span> ndims<span class="hl opt">;</span>             <span class="hl com">/* Rank of the dataspace */</span>
        hbool_t done<span class="hl opt">;</span>               <span class="hl com">/* Whether we are done with the iteration */</span>
        <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                 <span class="hl com">/* Counter */</span>

        <span class="hl com">/* Set some convienence values */</span>
        ndims <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span>
        fast_dim <span class="hl opt">=</span> ndims <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span>

        <span class="hl com">/* Check which set of dimension information to use */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>internal<span class="hl opt">)</span>
            <span class="hl com">/*</span>
<span class="hl com">             * Use the &quot;optimized dimension information&quot; to pass back information</span>
<span class="hl com">             * on the blocks set, not the &quot;application information&quot;.</span>
<span class="hl com">             */</span>
            diminfo <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span>
        <span class="hl kwa">else</span>
            <span class="hl com">/*</span>
<span class="hl com">             * Use the &quot;application dimension information&quot; to pass back to the user</span>
<span class="hl com">             * the blocks they set, not the optimized, internal information.</span>
<span class="hl com">             */</span>
            diminfo <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">;</span>

        <span class="hl com">/* Build the tables of count sizes as well as the initial offset */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> ndims<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            tmp_count<span class="hl opt">[</span>u<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">;</span>
            offset<span class="hl opt">[</span>u<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* We're not done with the iteration */</span>
        done <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>

        <span class="hl com">/* Go iterate over the hyperslabs */</span>
        <span class="hl kwa">while</span><span class="hl opt">(!</span>done <span class="hl opt">&amp;&amp;</span> numblocks <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
            hsize_t temp_off<span class="hl opt">;</span>           <span class="hl com">/* Offset in a given dimension */</span>

            <span class="hl com">/* Iterate over the blocks in the fastest dimension */</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>tmp_count<span class="hl opt">[</span>fast_dim<span class="hl opt">] &gt;</span> <span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> numblocks <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>

                <span class="hl com">/* Check if we should copy this block information */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>startblock <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">) {</span>
                    <span class="hl com">/* Copy the starting location */</span>
                    <span class="hl kwd">HDmemcpy</span><span class="hl opt">(</span>buf<span class="hl opt">,</span> offset<span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hsize_t<span class="hl opt">) *</span> ndims<span class="hl opt">);</span>
                    buf <span class="hl opt">+=</span> ndims<span class="hl opt">;</span>

                    <span class="hl com">/* Compute the ending location */</span>
                    <span class="hl kwd">HDmemcpy</span><span class="hl opt">(</span>buf<span class="hl opt">,</span> offset<span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hsize_t<span class="hl opt">) *</span> ndims<span class="hl opt">);</span>
                    <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> ndims<span class="hl opt">;</span> u<span class="hl opt">++)</span>
                        buf<span class="hl opt">[</span>u<span class="hl opt">] += (</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">);</span>
                    buf <span class="hl opt">+=</span> ndims<span class="hl opt">;</span>

                    <span class="hl com">/* Decrement the number of blocks to retrieve */</span>
                    numblocks<span class="hl opt">--;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span>
                    startblock<span class="hl opt">--;</span>

                <span class="hl com">/* Move the offset to the next sequence to start */</span>
                offset<span class="hl opt">[</span>fast_dim<span class="hl opt">] +=</span> diminfo<span class="hl opt">[</span>fast_dim<span class="hl opt">].</span>stride<span class="hl opt">;</span>

                <span class="hl com">/* Decrement the block count */</span>
                tmp_count<span class="hl opt">[</span>fast_dim<span class="hl opt">]--;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

            <span class="hl com">/* Work on other dimensions if necessary */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>fast_dim <span class="hl opt">&gt;</span> <span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> numblocks <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
                <span class="hl kwb">int</span> temp_dim<span class="hl opt">;</span>               <span class="hl com">/* Temporary rank holder */</span>

                <span class="hl com">/* Reset the block counts */</span>
                tmp_count<span class="hl opt">[</span>fast_dim<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>fast_dim<span class="hl opt">].</span>count<span class="hl opt">;</span>

                <span class="hl com">/* Bubble up the decrement to the slower changing dimensions */</span>
                temp_dim <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)(</span>fast_dim <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">);</span>
                <span class="hl kwa">while</span><span class="hl opt">(</span>temp_dim <span class="hl opt">&gt;=</span> <span class="hl num">0</span> <span class="hl opt">&amp;&amp; !</span>done<span class="hl opt">) {</span>
                    <span class="hl com">/* Decrement the block count */</span>
                    tmp_count<span class="hl opt">[</span>temp_dim<span class="hl opt">]--;</span>

                    <span class="hl com">/* Check if we have more blocks left */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>tmp_count<span class="hl opt">[</span>temp_dim<span class="hl opt">] &gt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwa">break</span><span class="hl opt">;</span>

                    <span class="hl com">/* Check for getting out of iterator */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>temp_dim <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">)</span>
                        done <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>

                    <span class="hl com">/* Reset the block count in this dimension */</span>
                    tmp_count<span class="hl opt">[</span>temp_dim<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>temp_dim<span class="hl opt">].</span>count<span class="hl opt">;</span>

                    <span class="hl com">/* Wrapped a dimension, go up to next dimension */</span>
                    temp_dim<span class="hl opt">--;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

            <span class="hl com">/* Re-compute offset array */</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> ndims<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
                temp_off <span class="hl opt">=</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">+</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride <span class="hl opt">* (</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">-</span> tmp_count<span class="hl opt">[</span>u<span class="hl opt">]);</span>
                offset<span class="hl opt">[</span>u<span class="hl opt">] =</span> temp_off<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        hsize_t start<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Location of start of hyperslab */</span>
        hsize_t end<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>     <span class="hl com">/* Location of end of hyperslab */</span>

        ret_value <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_span_blocklist</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span> start<span class="hl opt">,</span> end<span class="hl opt">, (</span>hsize_t<span class="hl opt">)</span><span class="hl num">0</span><span class="hl opt">, &amp;</span>startblock<span class="hl opt">, &amp;</span>numblocks<span class="hl opt">, &amp;</span>buf<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_get_select_hyper_blocklist() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5Sget_select_hyper_blocklist</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Get the list of hyperslab blocks currently selected</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5Sget_select_hyper_blocklist(dsid, startblock, numblocks, buf)</span>
<span class="hl com">        hid_t dsid;             IN: Dataspace ID of selection to query</span>
<span class="hl com">        hsize_t startblock;     IN: Hyperslab block to start with</span>
<span class="hl com">        hsize_t numblocks;      IN: Number of hyperslab blocks to get</span>
<span class="hl com">        hsize_t buf[];          OUT: List of hyperslab blocks selected</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">        Puts a list of the hyperslab blocks into the user's buffer.  The blocks</span>
<span class="hl com">    start with the 'startblock'th block in the list of blocks and put</span>
<span class="hl com">    'numblocks' number of blocks into the user's buffer (or until the end of</span>
<span class="hl com">    the list of blocks, whichever happen first)</span>
<span class="hl com">        The block coordinates have the same dimensionality (rank) as the</span>
<span class="hl com">    dataspace they are located within.  The list of blocks is formatted as</span>
<span class="hl com">    follows: &lt;&quot;start&quot; coordinate&gt; immediately followed by &lt;&quot;opposite&quot; corner</span>
<span class="hl com">    coordinate&gt;, followed by the next &quot;start&quot; and &quot;opposite&quot; coordinate, etc.</span>
<span class="hl com">    until all the block information requested has been put into the user's</span>
<span class="hl com">    buffer.</span>
<span class="hl com">        No guarantee of any order of the blocks is implied.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5Sget_select_hyper_blocklist</span><span class="hl opt">(</span>hid_t spaceid<span class="hl opt">,</span> hsize_t startblock<span class="hl opt">,</span>
    hsize_t numblocks<span class="hl opt">,</span> hsize_t buf<span class="hl opt">[</span><span class="hl com">/*numblocks*/</span><span class="hl opt">])</span>
<span class="hl opt">{</span>
    H5S_t <span class="hl opt">*</span>space<span class="hl opt">;</span>               <span class="hl com">/* Dataspace to modify selection of */</span>
    herr_t ret_value<span class="hl opt">;</span>           <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_API</span><span class="hl opt">(</span>H5Sget_select_hyper_blocklist<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>
    <span class="hl kwd">H5TRACE4</span><span class="hl opt">(</span><span class="hl str">&quot;e&quot;</span><span class="hl opt">,</span> <span class="hl str">&quot;ihh*[a2]h&quot;</span><span class="hl opt">,</span> spaceid<span class="hl opt">,</span> startblock<span class="hl opt">,</span> numblocks<span class="hl opt">,</span> buf<span class="hl opt">);</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>buf <span class="hl opt">==</span> NULL<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADVALUE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid pointer&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>space <span class="hl opt">= (</span>H5S_t <span class="hl opt">*)</span><span class="hl kwd">H5I_object_verify</span><span class="hl opt">(</span>spaceid<span class="hl opt">,</span> H5I_DATASPACE<span class="hl opt">)))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADTYPE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;not a data space&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">)!=</span>H5S_SEL_HYPERSLABS<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADTYPE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;not a hyperslab selection&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Go get the correct number of blocks */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>numblocks <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
        ret_value <span class="hl opt">=</span> <span class="hl kwd">H5S_get_select_hyper_blocklist</span><span class="hl opt">(</span>space<span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">,</span> startblock<span class="hl opt">,</span> numblocks<span class="hl opt">,</span> buf<span class="hl opt">);</span>
    <span class="hl kwa">else</span>
        ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>      <span class="hl com">/* Successfully got 0 blocks... */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_API</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5Sget_select_hyper_blocklist() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_bounds_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Gets the bounding box containing the selection.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_bounds_helper(spans, offset, rank);</span>
<span class="hl com">        const H5S_hyper_span_info_t *spans; IN: Pointer to current hyperslab span tree</span>
<span class="hl com">        const hssize_t *offset;         IN: Pointer to offset array</span>
<span class="hl com">        hsize_t rank;                   IN: Current rank looking at</span>
<span class="hl com">        hsize_t *start;                 OUT: Start array bounds</span>
<span class="hl com">        hsize_t *end;                   OUT: End array bounds</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Retrieves the bounding box containing the current selection and places</span>
<span class="hl com">    it into the user's buffers.  The start and end buffers must be large</span>
<span class="hl com">    enough to hold the dataspace rank number of coordinates.  The bounding box</span>
<span class="hl com">    exactly contains the selection, ie. if a 2-D element selection is currently</span>
<span class="hl com">    defined with the following points: (4,5), (6,8) (10,7), the bounding box</span>
<span class="hl com">    with be (4, 5), (10, 8).</span>
<span class="hl com">        The bounding box calculations _does_ include the current offset of the</span>
<span class="hl com">    selection within the dataspace extent.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_bounds_helper</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> <span class="hl kwb">const</span> hssize_t <span class="hl opt">*</span>offset<span class="hl opt">,</span> hsize_t rank<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>start<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>end<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>curr<span class="hl opt">;</span>             <span class="hl com">/* Hyperslab information nodes */</span>
    herr_t      ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>    <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_bounds_helper<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>offset<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>rank <span class="hl opt">&lt;</span> H5O_LAYOUT_NDIMS<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>end<span class="hl opt">);</span>

    <span class="hl com">/* Check each point to determine whether selection+offset is within extent */</span>
    curr<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
    <span class="hl kwa">while</span><span class="hl opt">(</span>curr<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl com">/* Check for offset moving selection negative */</span>
        <span class="hl kwa">if</span><span class="hl opt">(((</span>hssize_t<span class="hl opt">)</span>curr<span class="hl opt">-&gt;</span>low <span class="hl opt">+</span> offset<span class="hl opt">[</span>rank<span class="hl opt">]) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADRANGE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;offset moves selection out of bounds&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Check if the current span extends the bounding box */</span>
        <span class="hl kwa">if</span><span class="hl opt">((</span>curr<span class="hl opt">-&gt;</span>low <span class="hl opt">+ (</span>hsize_t<span class="hl opt">)</span>offset<span class="hl opt">[</span>rank<span class="hl opt">]) &lt;</span> start<span class="hl opt">[</span>rank<span class="hl opt">])</span>
            start<span class="hl opt">[</span>rank<span class="hl opt">] =</span> curr<span class="hl opt">-&gt;</span>low <span class="hl opt">+ (</span>hsize_t<span class="hl opt">)</span>offset<span class="hl opt">[</span>rank<span class="hl opt">];</span>
        <span class="hl kwa">if</span><span class="hl opt">((</span>curr<span class="hl opt">-&gt;</span>high <span class="hl opt">+ (</span>hsize_t<span class="hl opt">)</span>offset<span class="hl opt">[</span>rank<span class="hl opt">]) &gt;</span> end<span class="hl opt">[</span>rank<span class="hl opt">])</span>
            end<span class="hl opt">[</span>rank<span class="hl opt">] =</span> curr<span class="hl opt">-&gt;</span>high <span class="hl opt">+ (</span>hsize_t<span class="hl opt">)</span>offset<span class="hl opt">[</span>rank<span class="hl opt">];</span>

        <span class="hl com">/* Recurse if this node has down spans */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_bounds_helper</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span> offset<span class="hl opt">, (</span>rank <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">),</span> start<span class="hl opt">,</span> end<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failure in lower dimension&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Advance to next node */</span>
        curr <span class="hl opt">=</span> curr<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* end H5S_hyper_bounds_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_bounds</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Gets the bounding box containing the selection.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_bounds(space, hsize_t *start, hsize_t *end)</span>
<span class="hl com">        H5S_t *space;           IN: Dataspace pointer of selection to query</span>
<span class="hl com">        hsize_t *start;         OUT: Starting coordinate of bounding box</span>
<span class="hl com">        hsize_t *end;           OUT: Opposite coordinate of bounding box</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Retrieves the bounding box containing the current selection and places</span>
<span class="hl com">    it into the user's buffers.  The start and end buffers must be large</span>
<span class="hl com">    enough to hold the dataspace rank number of coordinates.  The bounding box</span>
<span class="hl com">    exactly contains the selection, ie. if a 2-D element selection is currently</span>
<span class="hl com">    defined with the following points: (4,5), (6,8) (10,7), the bounding box</span>
<span class="hl com">    with be (4, 5), (10, 8).</span>
<span class="hl com">        The bounding box calculations _does_ include the current offset of the</span>
<span class="hl com">    selection within the dataspace extent.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_bounds</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>start<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>end<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> rank<span class="hl opt">;</span>              <span class="hl com">/* Dataspace rank */</span>
    <span class="hl kwb">unsigned</span> i<span class="hl opt">;</span>                 <span class="hl com">/* index variable */</span>
    herr_t ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span> <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI</span><span class="hl opt">(</span>H5S_hyper_bounds<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>end<span class="hl opt">);</span>

    <span class="hl com">/* Set the start and end arrays up */</span>
    rank <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span>
    <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> i <span class="hl opt">&lt;</span> rank<span class="hl opt">;</span> i<span class="hl opt">++) {</span>
        start<span class="hl opt">[</span>i<span class="hl opt">] =</span> HSIZET_MAX<span class="hl opt">;</span>
        end<span class="hl opt">[</span>i<span class="hl opt">] =</span> <span class="hl num">0</span><span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>diminfo <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span> <span class="hl com">/* local alias for diminfo */</span>

        <span class="hl com">/* Check each dimension */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> i <span class="hl opt">&lt;</span> rank<span class="hl opt">;</span> i<span class="hl opt">++) {</span>
            <span class="hl com">/* Check for offset moving selection negative */</span>
            <span class="hl kwa">if</span><span class="hl opt">((</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>i<span class="hl opt">] + (</span>hssize_t<span class="hl opt">)</span>diminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADRANGE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;offset moves selection out of bounds&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Compute the smallest location in this dimension */</span>
            start<span class="hl opt">[</span>i<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start <span class="hl opt">+ (</span>hsize_t<span class="hl opt">)</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>i<span class="hl opt">];</span>

            <span class="hl com">/* Compute the largest location in this dimension */</span>
            end<span class="hl opt">[</span>i<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start <span class="hl opt">+</span> diminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>stride <span class="hl opt">* (</span>diminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>count <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">) + (</span>diminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>block <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">) + (</span>hsize_t<span class="hl opt">)</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>i<span class="hl opt">];</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Call the recursive routine to get the bounds for the span tree */</span>
        ret_value <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_bounds_helper</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">, (</span>hsize_t<span class="hl opt">)</span><span class="hl num">0</span><span class="hl opt">,</span> start<span class="hl opt">,</span> end<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_bounds() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_offset</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Gets the linear offset of the first element for the selection.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_offset(space, offset)</span>
<span class="hl com">        const H5S_t *space;     IN: Dataspace pointer of selection to query</span>
<span class="hl com">        hsize_t *offset;        OUT: Linear offset of first element in selection</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Retrieves the linear offset (in &quot;units&quot; of elements) of the first element</span>
<span class="hl com">    selected within the dataspace.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com">    Calling this function on a &quot;none&quot; selection returns fail.</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_offset</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>offset<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">const</span> hssize_t <span class="hl opt">*</span>sel_offset<span class="hl opt">;</span> <span class="hl com">/* Pointer to the selection's offset */</span>
    <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>dim_size<span class="hl opt">;</span>    <span class="hl com">/* Pointer to a dataspace's extent */</span>
    hsize_t accum<span class="hl opt">;</span>              <span class="hl com">/* Accumulator for dimension sizes */</span>
    <span class="hl kwb">unsigned</span> rank<span class="hl opt">;</span>              <span class="hl com">/* Dataspace rank */</span>
    <span class="hl kwb">int</span> i<span class="hl opt">;</span>                      <span class="hl com">/* index variable */</span>
    herr_t ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span> <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI</span><span class="hl opt">(</span>H5S_hyper_offset<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>offset<span class="hl opt">);</span>

    <span class="hl com">/* Start at linear offset 0 */</span>
    <span class="hl opt">*</span>offset <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

    <span class="hl com">/* Set up pointers to arrays of values */</span>
    rank <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span>
    sel_offset <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">;</span>
    dim_size <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">;</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>diminfo <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span> <span class="hl com">/* Local alias for diminfo */</span>

        <span class="hl com">/* Loop through starting coordinates, calculating the linear offset */</span>
        accum <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)(</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">);</span> i <span class="hl opt">&gt;=</span> <span class="hl num">0</span><span class="hl opt">;</span> i<span class="hl opt">--) {</span>
            hssize_t hyp_offset <span class="hl opt">= (</span>hssize_t<span class="hl opt">)</span>diminfo<span class="hl opt">[</span>i<span class="hl opt">].</span>start <span class="hl opt">+</span> sel_offset<span class="hl opt">[</span>i<span class="hl opt">];</span> <span class="hl com">/* Hyperslab's offset in this dimension */</span>

            <span class="hl com">/* Check for offset moving selection out of the dataspace */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>hyp_offset <span class="hl opt">&lt;</span> <span class="hl num">0</span> <span class="hl opt">|| (</span>hsize_t<span class="hl opt">)</span>hyp_offset <span class="hl opt">&gt;=</span> dim_size<span class="hl opt">[</span>i<span class="hl opt">])</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADRANGE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;offset moves selection out of bounds&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Add the hyperslab's offset in this dimension to the total linear offset */</span>
            <span class="hl opt">*</span>offset <span class="hl opt">+= (</span>hsize_t<span class="hl opt">)(</span>hyp_offset <span class="hl opt">* (</span>hssize_t<span class="hl opt">)</span>accum<span class="hl opt">);</span>

            <span class="hl com">/* Increase the accumulator */</span>
            accum <span class="hl opt">*=</span> dim_size<span class="hl opt">[</span>i<span class="hl opt">];</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl kwb">const</span> H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>           <span class="hl com">/* Hyperslab span node */</span>
        hsize_t dim_accum<span class="hl opt">[</span>H5S_MAX_RANK<span class="hl opt">];</span>        <span class="hl com">/* Accumulators, for each dimension */</span>

        <span class="hl com">/* Calculate the accumulator for each dimension */</span>
        accum <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)(</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">);</span> i <span class="hl opt">&gt;=</span> <span class="hl num">0</span><span class="hl opt">;</span> i<span class="hl opt">--) {</span>
            <span class="hl com">/* Set the accumulator for this dimension */</span>
            dim_accum<span class="hl opt">[</span>i<span class="hl opt">] =</span> accum<span class="hl opt">;</span>

            <span class="hl com">/* Increase the accumulator */</span>
            accum <span class="hl opt">*=</span> dim_size<span class="hl opt">[</span>i<span class="hl opt">];</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* Get information for the first span, in the slowest changing dimension */</span>
        span <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

        <span class="hl com">/* Work down the spans, computing the linear offset */</span>
        i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span<span class="hl opt">) {</span>
            hssize_t hyp_offset <span class="hl opt">= (</span>hssize_t<span class="hl opt">)</span>span<span class="hl opt">-&gt;</span>low <span class="hl opt">+</span> sel_offset<span class="hl opt">[</span>i<span class="hl opt">];</span> <span class="hl com">/* Hyperslab's offset in this dimension */</span>

            <span class="hl com">/* Check for offset moving selection out of the dataspace */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>hyp_offset <span class="hl opt">&lt;</span> <span class="hl num">0</span> <span class="hl opt">|| (</span>hsize_t<span class="hl opt">)</span>hyp_offset <span class="hl opt">&gt;=</span> dim_size<span class="hl opt">[</span>i<span class="hl opt">])</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADRANGE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;offset moves selection out of bounds&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Add the hyperslab's offset in this dimension to the total linear offset */</span>
            <span class="hl opt">*</span>offset <span class="hl opt">+= (</span>hsize_t<span class="hl opt">)(</span>hyp_offset <span class="hl opt">* (</span>hssize_t<span class="hl opt">)</span>dim_accum<span class="hl opt">[</span>i<span class="hl opt">]);</span>

            <span class="hl com">/* Advance to first span in &quot;down&quot; dimension */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">) {</span>
                <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">);</span>
                span <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">else</span>
                span <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
            i<span class="hl opt">++;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_offset() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_is_contiguous</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Check if a hyperslab selection is contiguous within the dataspace extent.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_is_contiguous(space)</span>
<span class="hl com">        H5S_t *space;           IN: Dataspace pointer to check</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    TRUE/FALSE/FAIL</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Checks to see if the current selection in the dataspace is contiguous.</span>
<span class="hl com">    This is primarily used for reading the entire selection in one swoop.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
htri_t
<span class="hl kwd">H5S_hyper_is_contiguous</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> small_contiguous<span class="hl opt">,</span>      <span class="hl com">/* Flag for small contiguous block */</span>
        large_contiguous<span class="hl opt">;</span>           <span class="hl com">/* Flag for large contiguous block */</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                     <span class="hl com">/* index variable */</span>
    htri_t ret_value <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_is_contiguous<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>diminfo<span class="hl opt">=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span> <span class="hl com">/* local alias for diminfo */</span>

        <span class="hl com">/*</span>
<span class="hl com">         * For a regular hyperslab to be contiguous, it must have only one</span>
<span class="hl com">         * block (i.e. count==1 in all dimensions) and the block size must be</span>
<span class="hl com">         * the same as the dataspace extent's in all but the slowest changing</span>
<span class="hl com">         * dimension. (dubbed &quot;large contiguous&quot; block)</span>
<span class="hl com">         *</span>
<span class="hl com">         * OR</span>
<span class="hl com">         *</span>
<span class="hl com">         * The selection must have only one block (i.e. count==1) in all</span>
<span class="hl com">         * dimensions and the block size must be 1 in all but the fastest</span>
<span class="hl com">         * changing dimension. (dubbed &quot;small contiguous&quot; block)</span>
<span class="hl com">         */</span>

        <span class="hl com">/* Initialize flags */</span>
        large_contiguous<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>	<span class="hl com">/* assume true and reset if the dimensions don't match */</span>
        small_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>	<span class="hl com">/* assume false initially */</span>

        <span class="hl com">/* Check for a &quot;large contigous&quot; block */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">&gt;</span><span class="hl num">1</span><span class="hl opt">) {</span>
                large_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>u<span class="hl opt">&gt;</span><span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block<span class="hl opt">!=</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">[</span>u<span class="hl opt">]) {</span>
                large_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* If we didn't find a large contiguous block, check for a small one */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>large_contiguous<span class="hl opt">==</span>FALSE<span class="hl opt">) {</span>
            small_contiguous<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">&gt;</span><span class="hl num">1</span><span class="hl opt">) {</span>
                    small_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>u<span class="hl opt">&lt;(</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">) &amp;&amp;</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block<span class="hl opt">!=</span><span class="hl num">1</span><span class="hl opt">) {</span>
                    small_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Indicate true if it's either a large or small contiguous block */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>large_contiguous <span class="hl opt">||</span> small_contiguous<span class="hl opt">)</span>
            ret_value<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">;</span>   <span class="hl com">/* Hyperslab span info node */</span>
        H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>         <span class="hl com">/* Hyperslab span node */</span>

        <span class="hl com">/*</span>
<span class="hl com">         * For a hyperslab to be contiguous, it must have only one block and</span>
<span class="hl com">         * (either it's size must be the same as the dataspace extent's in all</span>
<span class="hl com">         * but the slowest changing dimension</span>
<span class="hl com">         * OR</span>
<span class="hl com">         * block size must be 1 in all but the fastest changing dimension).</span>
<span class="hl com">         */</span>
        <span class="hl com">/* Initialize flags */</span>
        large_contiguous<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>	<span class="hl com">/* assume true and reset if the dimensions don't match */</span>
        small_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>	<span class="hl com">/* assume false initially */</span>

        <span class="hl com">/* Get information for slowest changing information */</span>
        spans<span class="hl opt">=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">;</span>
        span<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

        <span class="hl com">/* If there are multiple spans in the slowest changing dimension, the selection isn't contiguous */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>next<span class="hl opt">!=</span>NULL<span class="hl opt">)</span>
            large_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Now check the rest of the dimensions */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                u<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>    <span class="hl com">/* Current dimension working on */</span>

                <span class="hl com">/* Get the span information for the next fastest dimension */</span>
                spans<span class="hl opt">=</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>

                <span class="hl com">/* Cycle down the spans until we run out of down spans or find a non-contiguous span */</span>
                <span class="hl kwa">while</span><span class="hl opt">(</span>spans<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    span<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

                    <span class="hl com">/* Check that this is the only span and it spans the entire dimension */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>next<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                        large_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                        <span class="hl kwa">break</span><span class="hl opt">;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* If this span doesn't cover the entire dimension, then this selection isn't contiguous */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(((</span>span<span class="hl opt">-&gt;</span>high<span class="hl opt">-</span>span<span class="hl opt">-&gt;</span>low<span class="hl opt">)+</span><span class="hl num">1</span><span class="hl opt">)!=</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">[</span>u<span class="hl opt">]) {</span>
                            large_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                            <span class="hl kwa">break</span><span class="hl opt">;</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                        <span class="hl kwa">else</span> <span class="hl opt">{</span>
                            <span class="hl com">/* Walk down to the next span */</span>
                            spans<span class="hl opt">=</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>

                            <span class="hl com">/* Increment dimension */</span>
                            u<span class="hl opt">++;</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

        <span class="hl com">/* If we didn't find a large contiguous block, check for a small one */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>large_contiguous<span class="hl opt">==</span>FALSE<span class="hl opt">) {</span>
            small_contiguous<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>

            <span class="hl com">/* Get information for slowest changing information */</span>
            spans<span class="hl opt">=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">;</span>
            span<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

            <span class="hl com">/* Current dimension working on */</span>
            u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

            <span class="hl com">/* Cycle down the spans until we run out of down spans or find a non-contiguous span */</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>spans<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                span<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

                <span class="hl com">/* Check that this is the only span and it spans the entire dimension */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>next<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    small_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* If this span doesn't cover the entire dimension, then this selection isn't contiguous */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>u<span class="hl opt">&lt;(</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">) &amp;&amp; ((</span>span<span class="hl opt">-&gt;</span>high<span class="hl opt">-</span>span<span class="hl opt">-&gt;</span>low<span class="hl opt">)+</span><span class="hl num">1</span><span class="hl opt">)!=</span><span class="hl num">1</span><span class="hl opt">) {</span>
                        small_contiguous<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>
                        <span class="hl kwa">break</span><span class="hl opt">;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* Walk down to the next span */</span>
                        spans<span class="hl opt">=</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>

                        <span class="hl com">/* Increment dimension */</span>
                        u<span class="hl opt">++;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Indicate true if it's either a large or small contiguous block */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>large_contiguous <span class="hl opt">||</span> small_contiguous<span class="hl opt">)</span>
            ret_value<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_is_contiguous() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_is_single</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Check if a hyperslab selection is a single block within the dataspace extent.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_is_single(space)</span>
<span class="hl com">        H5S_t *space;           IN: Dataspace pointer to check</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    TRUE/FALSE/FAIL</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Checks to see if the current selection in the dataspace is a single block.</span>
<span class="hl com">    This is primarily used for reading the entire selection in one swoop.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
htri_t
<span class="hl kwd">H5S_hyper_is_single</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">;</span>   <span class="hl com">/* Hyperslab span info node */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>         <span class="hl com">/* Hyperslab span node */</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                     <span class="hl com">/* index variable */</span>
    htri_t ret_value<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>         <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_is_single<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Check for a &quot;single&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl com">/*</span>
<span class="hl com">         * For a regular hyperslab to be single, it must have only one</span>
<span class="hl com">         * block (i.e. count==1 in all dimensions)</span>
<span class="hl com">         */</span>

        <span class="hl com">/* Check for a single block */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">&gt;</span><span class="hl num">1</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/*</span>
<span class="hl com">         * For a region to be single, it must have only one block</span>
<span class="hl com">         */</span>
        <span class="hl com">/* Get information for slowest changing information */</span>
        spans<span class="hl opt">=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">;</span>

        <span class="hl com">/* Cycle down the spans until we run out of down spans or find a non-contiguous span */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>spans<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
            span<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

            <span class="hl com">/* Check that this is the only span and it spans the entire dimension */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>next<span class="hl opt">!=</span>NULL<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>
            <span class="hl kwa">else</span>
                <span class="hl com">/* Walk down to the next span */</span>
                spans<span class="hl opt">=</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_is_single() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_is_regular</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Check if a hyperslab selection is &quot;regular&quot;</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_is_regular(space)</span>
<span class="hl com">        const H5S_t *space;     IN: Dataspace pointer to check</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    TRUE/FALSE/FAIL</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Checks to see if the current selection in a dataspace is the a regular</span>
<span class="hl com">    pattern.</span>
<span class="hl com">    This is primarily used for reading the entire selection in one swoop.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com">    Doesn't check for &quot;regular&quot; hyperslab selections composed of spans</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
htri_t
<span class="hl kwd">H5S_hyper_is_regular</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    htri_t ret_value<span class="hl opt">;</span>  <span class="hl com">/* return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_is_regular<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Only simple check for regular hyperslabs for now... */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">)</span>
        ret_value<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>
    <span class="hl kwa">else</span>
        ret_value<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_is_regular() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_release</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Release hyperslab selection information for a dataspace</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_release(space)</span>
<span class="hl com">        H5S_t *space;       IN: Pointer to dataspace</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success/Negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Releases all hyperslab selection information for a dataspace</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com"> * 	Robb Matzke, 1998-08-25</span>
<span class="hl com"> *	The fields which are freed are set to NULL to prevent them from being</span>
<span class="hl com"> *	freed again later.  This fixes some allocation problems where</span>
<span class="hl com"> *	changing the hyperslab selection of one data space causes a core dump</span>
<span class="hl com"> *	when closing some other data space.</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_release</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    herr_t ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI</span><span class="hl opt">(</span>H5S_hyper_release<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space <span class="hl opt">&amp;&amp;</span> H5S_SEL_HYPERSLABS <span class="hl opt">==</span> <span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">));</span>

    <span class="hl com">/* Reset the number of points selected */</span>
    space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

    <span class="hl com">/* Release irregular hyperslab information */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release hyperslab spans&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl com">/* Release space for the hyperslab selection information */</span>
    space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab <span class="hl opt">=</span> <span class="hl kwd">H5FL_FREE</span><span class="hl opt">(</span>H5S_hyper_sel_t<span class="hl opt">,</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">);</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_release() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_recover_span</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Recover a generated span, if appropriate</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_recover_span(recover, curr_span, next_span)</span>
<span class="hl com">        unsigned *recover;                 IN/OUT: Pointer recover flag</span>
<span class="hl com">        H5S_hyper_span_t **curr_span;   IN/OUT: Pointer to current span in list</span>
<span class="hl com">        H5S_hyper_span_t *next_span;    IN: Pointer to next span</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Check if the current span needs to be recovered and free it if so.</span>
<span class="hl com">    Set the current span to the next span in any case.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_recover_span</span> <span class="hl opt">(</span><span class="hl kwb">unsigned</span> <span class="hl opt">*</span>recover<span class="hl opt">,</span> H5S_hyper_span_t <span class="hl opt">**</span>curr_span<span class="hl opt">,</span> H5S_hyper_span_t <span class="hl opt">*</span>next_span<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_recover_span<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>recover<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>curr_span<span class="hl opt">);</span>

    <span class="hl com">/* Check if the span should be recovered */</span>
    <span class="hl kwa">if</span><span class="hl opt">(*</span>recover<span class="hl opt">) {</span>
        <span class="hl kwd">H5S_hyper_free_span</span><span class="hl opt">(*</span>curr_span<span class="hl opt">);</span>
        <span class="hl opt">*</span>recover<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl com">/* Set the current span to next span */</span>
    <span class="hl opt">*</span>curr_span<span class="hl opt">=</span>next_span<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_recover_span() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_coord_to_span</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Create a span tree for a single element</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    H5S_hyper_span_t *H5S_hyper_coord_to_span(rank, coords)</span>
<span class="hl com">        unsigned rank;                  IN: Number of dimensions of coordinate</span>
<span class="hl com">        hsize_t *coords;               IN: Location of element</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Create a span tree for a single element</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> H5S_hyper_span_t <span class="hl opt">*</span>
<span class="hl kwd">H5S_hyper_coord_to_span</span><span class="hl opt">(</span><span class="hl kwb">unsigned</span> rank<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>coords<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>new_span<span class="hl opt">;</span>         <span class="hl com">/* Pointer to new span tree for coordinate */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>down<span class="hl opt">=</span>NULL<span class="hl opt">;</span>   <span class="hl com">/* Pointer to new span tree for next level down */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>ret_value<span class="hl opt">=</span>NULL<span class="hl opt">;</span>   <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_coord_to_span<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>rank <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>coords<span class="hl opt">);</span>

    <span class="hl com">/* Search for location to insert new element in tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>rank<span class="hl opt">&gt;</span><span class="hl num">1</span><span class="hl opt">) {</span>
        <span class="hl com">/* Allocate a span info node */</span>
        <span class="hl kwa">if</span><span class="hl opt">((</span>down <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Set the reference count */</span>
        down<span class="hl opt">-&gt;</span>count<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

        <span class="hl com">/* Reset the scratch pad space */</span>
        down<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

        <span class="hl com">/* Build span tree for coordinates below this one */</span>
        <span class="hl kwa">if</span><span class="hl opt">((</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_coord_to_span</span><span class="hl opt">(</span>rank<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">,&amp;</span>coords<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">]))==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl com">/* Build span for this coordinate */</span>
    <span class="hl kwa">if</span><span class="hl opt">((</span>new_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>coords<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">],</span>coords<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">],</span>down<span class="hl opt">,</span>NULL<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Set return value */</span>
    ret_value<span class="hl opt">=</span>new_span<span class="hl opt">;</span>

done<span class="hl opt">:</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>ret_value<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>down<span class="hl opt">!=</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_coord_to_span() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_add_span_element_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Add a single elment to a span tree</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_add_span_element_helper(prev_span, span_tree, rank, coords)</span>
<span class="hl com">        H5S_hyper_span_info_t *span_tree;  IN/OUT: Pointer to span tree to append to</span>
<span class="hl com">        unsigned rank;                  IN: Number of dimensions of coordinates</span>
<span class="hl com">        hsize_t *coords;               IN: Location of element to add to span tree</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Add a single element to an existing span tree.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com">    Assumes that the element is not already covered by the span tree</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_add_span_element_helper</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>span_tree<span class="hl opt">,</span> <span class="hl kwb">unsigned</span> rank<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>coords<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>tspan_info<span class="hl opt">;</span>  <span class="hl com">/* Temporary pointer to span info */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>prev_span_info<span class="hl opt">;</span>  <span class="hl com">/* Pointer to span info for level above current position */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>tmp_span<span class="hl opt">;</span>         <span class="hl com">/* Temporary pointer to a span */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>tmp2_span<span class="hl opt">;</span>        <span class="hl com">/* Another temporary pointer to a span */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>new_span<span class="hl opt">;</span>         <span class="hl com">/* New span created for element */</span>
    herr_t ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>           <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_add_span_element_helper<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span_tree<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>rank <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>coords<span class="hl opt">);</span>

    <span class="hl com">/* Get pointer to last span in span tree */</span>
    tspan_info<span class="hl opt">=</span>span_tree<span class="hl opt">;</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>span_tree<span class="hl opt">-&gt;</span>scratch<span class="hl opt">)</span>
        tmp_span<span class="hl opt">=(</span>H5S_hyper_span_t <span class="hl opt">*)</span>span_tree<span class="hl opt">-&gt;</span>scratch<span class="hl opt">;</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        tmp_span<span class="hl opt">=</span>span_tree<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
        <span class="hl kwd">HDassert</span><span class="hl opt">(</span>tmp_span<span class="hl opt">);</span>
        span_tree<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=(</span>H5S_hyper_span_info_t <span class="hl opt">*)</span>tmp_span<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl com">/* Find last span tree which includes a portion of the coordinate */</span>
    prev_span_info<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
    <span class="hl kwa">while</span><span class="hl opt">(</span>coords<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">]&gt;=</span>tmp_span<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp;</span> coords<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">]&lt;=</span>tmp_span<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
        <span class="hl com">/* Move rank &amp; coordinate offset down a dimension */</span>
        rank<span class="hl opt">--;</span>
        coords<span class="hl opt">++;</span>

        <span class="hl com">/* Remember the span tree we are descending into */</span>
        prev_span_info<span class="hl opt">=</span>tspan_info<span class="hl opt">;</span>
        tspan_info<span class="hl opt">=</span>tmp_span<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>

        <span class="hl com">/* Get the last span in this span's 'down' tree */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>tspan_info<span class="hl opt">-&gt;</span>scratch<span class="hl opt">)</span>
            tmp_span<span class="hl opt">=(</span>H5S_hyper_span_t <span class="hl opt">*)</span>tspan_info<span class="hl opt">-&gt;</span>scratch<span class="hl opt">;</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            tmp_span<span class="hl opt">=</span>tspan_info<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>tmp_span<span class="hl opt">);</span>
            tspan_info<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=(</span>H5S_hyper_span_info_t <span class="hl opt">*)</span>tmp_span<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

    <span class="hl com">/* Check if we made it all the way to the bottom span in the tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>rank<span class="hl opt">&gt;</span><span class="hl num">1</span><span class="hl opt">) {</span>
        <span class="hl com">/* Before we create another span at this level in the tree, check if</span>
<span class="hl com">         * the last span's &quot;down tree&quot; was equal to any other spans in this</span>
<span class="hl com">         * list of spans in the span tree.</span>
<span class="hl com">         *</span>
<span class="hl com">         * If so, release last span information and make last span merge into</span>
<span class="hl com">         * previous span (if possible), or at least share their &quot;down tree&quot;</span>
<span class="hl com">         * information.</span>
<span class="hl com">         */</span>
        tmp2_span<span class="hl opt">=</span>tspan_info<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>tmp2_span<span class="hl opt">!=</span>tmp_span<span class="hl opt">) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>tmp2_span<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>tmp_span<span class="hl opt">-&gt;</span>down<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
                <span class="hl com">/* Check for merging into previous span */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>tmp2_span<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">==</span>tmp_span<span class="hl opt">-&gt;</span>low<span class="hl opt">) {</span>
                    <span class="hl com">/* Release last span created */</span>
                    <span class="hl kwd">H5S_hyper_free_span</span><span class="hl opt">(</span>tmp_span<span class="hl opt">);</span>

                    <span class="hl com">/* Increase size of previous span */</span>
                    tmp2_span<span class="hl opt">-&gt;</span>high<span class="hl opt">++;</span>
                    tmp2_span<span class="hl opt">-&gt;</span>nelem<span class="hl opt">++;</span>

                    <span class="hl com">/* Reset the 'tmp_span' for the rest of this block's algorithm */</span>
                    tmp_span<span class="hl opt">=</span>tmp2_span<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl com">/* Span is disjoint, but has the same &quot;down tree&quot; selection */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Release &quot;down tree&quot; information */</span>
                    <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>tmp_span<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>

                    <span class="hl com">/* Point at earlier span's &quot;down tree&quot; */</span>
                    tmp_span<span class="hl opt">-&gt;</span>down<span class="hl opt">=</span>tmp2_span<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>

                    <span class="hl com">/* Increment reference count on shared &quot;down tree&quot; */</span>
                    tmp_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>count<span class="hl opt">++;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                <span class="hl com">/* Found span to merge into, break out now */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

            <span class="hl com">/* Advance to next span to check */</span>
            tmp2_span<span class="hl opt">=</span>tmp2_span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

        <span class="hl com">/* Make span tree for current coordinates */</span>
        <span class="hl kwa">if</span><span class="hl opt">((</span>new_span<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_coord_to_span</span><span class="hl opt">(</span>rank<span class="hl opt">,</span>coords<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Add new span tree as span */</span>
        <span class="hl kwd">HDassert</span><span class="hl opt">(</span>tmp_span<span class="hl opt">);</span>
        tmp_span<span class="hl opt">-&gt;</span>next<span class="hl opt">=</span>new_span<span class="hl opt">;</span>

        <span class="hl com">/* Make scratch pointer point to last span in list */</span>
        <span class="hl kwd">HDassert</span><span class="hl opt">(</span>tspan_info<span class="hl opt">);</span>
        tspan_info<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=(</span>H5S_hyper_span_info_t <span class="hl opt">*)</span>new_span<span class="hl opt">;</span>

        <span class="hl com">/* Set the proper 'pstride' for new span */</span>
        new_span<span class="hl opt">-&gt;</span>pstride<span class="hl opt">=</span>new_span<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span>tmp_span<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Does new node adjoin existing node? */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>tmp_span<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">==</span>coords<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">]) {</span>
            tmp_span<span class="hl opt">-&gt;</span>high<span class="hl opt">++;</span>
            tmp_span<span class="hl opt">-&gt;</span>nelem<span class="hl opt">++;</span>

            <span class="hl com">/* Check if this span tree should now be merged with a level higher in the tree */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>prev_span_info<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                <span class="hl com">/* Before we create another span at this level in the tree, check if</span>
<span class="hl com">                 * the last span's &quot;down tree&quot; was equal to any other spans in this</span>
<span class="hl com">                 * list of spans in the span tree.</span>
<span class="hl com">                 *</span>
<span class="hl com">                 * If so, release last span information and make last span merge into</span>
<span class="hl com">                 * previous span (if possible), or at least share their &quot;down tree&quot;</span>
<span class="hl com">                 * information.</span>
<span class="hl com">                 */</span>
                tmp2_span<span class="hl opt">=</span>prev_span_info<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
                tmp_span<span class="hl opt">=(</span>H5S_hyper_span_t <span class="hl opt">*)</span>prev_span_info<span class="hl opt">-&gt;</span>scratch<span class="hl opt">;</span>
                <span class="hl kwa">while</span><span class="hl opt">(</span>tmp2_span<span class="hl opt">!=</span>tmp_span<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>tmp2_span<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>tmp_span<span class="hl opt">-&gt;</span>down<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
                        <span class="hl com">/* Check for merging into previous span */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>tmp2_span<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">==</span>tmp_span<span class="hl opt">-&gt;</span>low<span class="hl opt">) {</span>
                            <span class="hl com">/* Release last span created */</span>
                            <span class="hl kwd">H5S_hyper_free_span</span><span class="hl opt">(</span>tmp_span<span class="hl opt">);</span>

                            <span class="hl com">/* Increase size of previous span */</span>
                            tmp2_span<span class="hl opt">-&gt;</span>high<span class="hl opt">++;</span>
                            tmp2_span<span class="hl opt">-&gt;</span>nelem<span class="hl opt">++;</span>

                            <span class="hl com">/* Update pointers */</span>
                            tmp2_span<span class="hl opt">-&gt;</span>next<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
                            prev_span_info<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=(</span>H5S_hyper_span_info_t <span class="hl opt">*)</span>tmp2_span<span class="hl opt">;</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                        <span class="hl com">/* Span is disjoint, but has the same &quot;down tree&quot; selection */</span>
                        <span class="hl kwa">else</span> <span class="hl opt">{</span>
                            <span class="hl com">/* Release &quot;down tree&quot; information */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>tmp_span<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>

                            <span class="hl com">/* Point at earlier span's &quot;down tree&quot; */</span>
                            tmp_span<span class="hl opt">-&gt;</span>down<span class="hl opt">=</span>tmp2_span<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>

                            <span class="hl com">/* Increment reference count on shared &quot;down tree&quot; */</span>
                            tmp_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>count<span class="hl opt">++;</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                        <span class="hl com">/* Found span to merge into, break out now */</span>
                        <span class="hl kwa">break</span><span class="hl opt">;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                    <span class="hl com">/* Advance to next span to check */</span>
                    tmp2_span<span class="hl opt">=</span>tmp2_span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl kwa">if</span><span class="hl opt">((</span>new_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>coords<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">],</span>coords<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">],</span>NULL<span class="hl opt">,</span>NULL<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Add new span tree as span */</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>tmp_span<span class="hl opt">);</span>
            tmp_span<span class="hl opt">-&gt;</span>next<span class="hl opt">=</span>new_span<span class="hl opt">;</span>

            <span class="hl com">/* Make scratch pointer point to last span in list */</span>
            tspan_info<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=(</span>H5S_hyper_span_info_t <span class="hl opt">*)</span>new_span<span class="hl opt">;</span>

            <span class="hl com">/* Set the proper 'pstride' for new span */</span>
            new_span<span class="hl opt">-&gt;</span>pstride<span class="hl opt">=</span>new_span<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span>tmp_span<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_add_span_element_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_add_span_element</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Add a single elment to a span tree</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_add_span_element(space, span_tree, rank, coords)</span>
<span class="hl com">        H5S_t *space;           IN/OUT: Pointer to dataspace to add coordinate to</span>
<span class="hl com">        unsigned rank;          IN: Number of dimensions of coordinates</span>
<span class="hl com">        hsize_t *coords;       IN: Location of element to add to span tree</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Add a single element to an existing span tree.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com">    Assumes that the element is not already in the dataspace's selection</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_add_span_element</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">unsigned</span> rank<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>coords<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>head <span class="hl opt">=</span> NULL<span class="hl opt">;</span>    <span class="hl com">/* Pointer to new head of span tree */</span>
    herr_t      ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_add_span_element<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>rank <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>coords<span class="hl opt">);</span>

    <span class="hl com">/* Check if this is the first element in the selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">==</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">) {</span>
        <span class="hl com">/* Allocate a span info node */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>head <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">)))</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Set the reference count */</span>
        head<span class="hl opt">-&gt;</span>count <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>

        <span class="hl com">/* Reset the scratch pad space */</span>
        head<span class="hl opt">-&gt;</span>scratch <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

        <span class="hl com">/* Build span tree for this coordinate */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>head<span class="hl opt">-&gt;</span>head <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_coord_to_span</span><span class="hl opt">(</span>rank<span class="hl opt">,</span> coords<span class="hl opt">)))</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Allocate selection info */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_sel_t<span class="hl opt">)))</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab info&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Set the selection to the new span tree */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">=</span> head<span class="hl opt">;</span>

        <span class="hl com">/* Set selection type */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>type <span class="hl opt">=</span> H5S_sel_hyper<span class="hl opt">;</span>

        <span class="hl com">/* Reset &quot;regular&quot; hyperslab flag */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>

        <span class="hl com">/* Set # of elements in selection */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_add_span_element_helper</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span> rank<span class="hl opt">,</span> coords<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Increment # of elements in selection */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">++;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>ret_value <span class="hl opt">&lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>head<span class="hl opt">)</span>
            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>head<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_add_span_element() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_reset_scratch</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Reset the scratch information for span tree</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_reset_scratch(space)</span>
<span class="hl com">        H5S_t *space;           IN/OUT: Pointer to dataspace to reset scratch pointers</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Resets the &quot;scratch&quot; pointers used for various tasks in computing hyperslab</span>
<span class="hl com">    spans.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_reset_scratch</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_reset_scratch<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Check if there are spans in the span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">!=</span> NULL<span class="hl opt">)</span>
        <span class="hl com">/* Reset the scratch pointers for the next routine which needs them */</span>
        <span class="hl kwd">H5S_hyper_span_scratch</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span> NULL<span class="hl opt">);</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_reset_scratch() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_convert</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Convert a compatible selection to span tree form</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_convert(space)</span>
<span class="hl com">        H5S_t *space;           IN/OUT: Pointer to dataspace to convert</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Converts a compatible selection (currently only &quot;all&quot; selections) to the</span>
<span class="hl com">    span-tree form of a hyperslab selection. (Point and &quot;none&quot; selection aren't</span>
<span class="hl com">    currently supported and hyperslab selection always have the span-tree form</span>
<span class="hl com">    available).</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_convert</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_convert<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Check the type of selection */</span>
    <span class="hl kwa">switch</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">)) {</span>
        <span class="hl kwa">case</span> H5S_SEL_ALL<span class="hl opt">:</span>    <span class="hl com">/* All elements selected in dataspace */</span>
            <span class="hl com">/* Convert current &quot;all&quot; selection to &quot;real&quot; hyperslab selection */</span>
            <span class="hl opt">{</span>
                hsize_t tmp_start<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Temporary start information */</span>
                hsize_t tmp_stride<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Temporary stride information */</span>
                hsize_t tmp_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary count information */</span>
                hsize_t tmp_block<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary block information */</span>
                <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                             <span class="hl com">/* Local index variable */</span>

                <span class="hl com">/* Fill in temporary information for the dimensions */</span>
                <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
                    tmp_start<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">0</span><span class="hl opt">;</span>
                    tmp_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                    tmp_count<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                    tmp_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">[</span>u<span class="hl opt">];</span>
                <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

                <span class="hl com">/* Convert to hyperslab selection */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_select_hyperslab</span><span class="hl opt">(</span>space<span class="hl opt">,</span>H5S_SELECT_SET<span class="hl opt">,</span>tmp_start<span class="hl opt">,</span>tmp_stride<span class="hl opt">,</span>tmp_count<span class="hl opt">,</span>tmp_block<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't convert selection&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end case */</span>
            <span class="hl kwa">break</span><span class="hl opt">;</span>

        <span class="hl kwa">case</span> H5S_SEL_HYPERSLABS<span class="hl opt">:</span>        <span class="hl com">/* Hyperslab selection */</span>
            <span class="hl kwa">break</span><span class="hl opt">;</span>

        <span class="hl kwa">case</span> H5S_SEL_NONE<span class="hl opt">:</span>   <span class="hl com">/* No elements selected in dataspace */</span>
        <span class="hl kwa">case</span> H5S_SEL_POINTS<span class="hl opt">:</span> <span class="hl com">/* Point selection */</span>
        <span class="hl kwa">case</span> H5S_SEL_ERROR<span class="hl opt">:</span>  <span class="hl com">/* Selection error */</span>
        <span class="hl kwa">case</span> H5S_SEL_N<span class="hl opt">:</span>      <span class="hl com">/* Selection count */</span>
        <span class="hl kwa">default</span><span class="hl opt">:</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't convert to span tree selection&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_convert() */</span>

<span class="hl ppc">#ifdef LATER</span>

<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_intersect_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Helper routine to detect intersections in span trees</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_intersect_helper(spans1, spans2)</span>
<span class="hl com">        H5S_hyper_span_info_t *spans1;     IN: First span tree to operate with</span>
<span class="hl com">        H5S_hyper_span_info_t *spans2;     IN: Second span tree to operate with</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Quickly detect intersections between two span trees</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> htri_t
<span class="hl kwd">H5S_hyper_intersect_helper</span> <span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans1<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">*</span>spans2<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>curr1<span class="hl opt">;</span>    <span class="hl com">/* Pointer to current span in 1st span tree */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>curr2<span class="hl opt">;</span>    <span class="hl com">/* Pointer to current span in 2nd span tree */</span>
    htri_t status<span class="hl opt">;</span>              <span class="hl com">/* Status from recursive call */</span>
    htri_t ret_value<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>     <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_intersect_helper<span class="hl opt">)</span>

    <span class="hl com">/* Sanity check */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">((</span>spans1 <span class="hl opt">&amp;&amp;</span> spans2<span class="hl opt">) || (</span>spans1 <span class="hl opt">==</span> NULL <span class="hl opt">&amp;&amp;</span> spans2 <span class="hl opt">==</span> NULL<span class="hl opt">));</span>

    <span class="hl com">/* &quot;NULL&quot; span trees compare as overlapping */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>spans1<span class="hl opt">==</span>NULL <span class="hl opt">&amp;&amp;</span> spans2<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>TRUE<span class="hl opt">);</span>

    <span class="hl com">/* Get the span lists for each span in this tree */</span>
    curr1<span class="hl opt">=</span>spans1<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
    curr2<span class="hl opt">=</span>spans2<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

    <span class="hl com">/* Iterate over the spans in each tree */</span>
    <span class="hl kwa">while</span><span class="hl opt">(</span>curr1<span class="hl opt">!=</span>NULL <span class="hl opt">&amp;&amp;</span> curr2<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl com">/* Check for 1st span entirely before 2nd span */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>curr1<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;</span>curr2<span class="hl opt">-&gt;</span>low<span class="hl opt">)</span>
            curr1<span class="hl opt">=</span>curr1<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl com">/* Check for 2nd span entirely before 1st span */</span>
        <span class="hl kwa">else if</span><span class="hl opt">(</span>curr2<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;</span>curr1<span class="hl opt">-&gt;</span>low<span class="hl opt">)</span>
            curr2<span class="hl opt">=</span>curr2<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl com">/* Spans must overlap */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Recursively check spans in next dimension down */</span>
            <span class="hl kwa">if</span><span class="hl opt">((</span>status<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_intersect_helper</span><span class="hl opt">(</span>curr1<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>curr2<span class="hl opt">-&gt;</span>down<span class="hl opt">))&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't perform hyperslab intersection check&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* If there is a span intersection in the down dimensions, the span trees overlap */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>status<span class="hl opt">==</span>TRUE<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>TRUE<span class="hl opt">);</span>

            <span class="hl com">/* No intersection in down dimensions, advance to next span */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>curr1<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;</span>curr2<span class="hl opt">-&gt;</span>high<span class="hl opt">)</span>
                curr1<span class="hl opt">=</span>curr1<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
            <span class="hl kwa">else</span>
                curr2<span class="hl opt">=</span>curr2<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_intersect_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_intersect</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Detect intersections in span trees</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_intersect(space1, space2)</span>
<span class="hl com">        H5S_t *space1;     IN: First dataspace to operate on span tree</span>
<span class="hl com">        H5S_t *space2;     IN: Second dataspace to operate on span tree</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Quickly detect intersections between two span trees</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
htri_t
<span class="hl kwd">H5S_hyper_intersect</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space1<span class="hl opt">,</span> H5S_t <span class="hl opt">*</span>space2<span class="hl opt">)</span>
<span class="hl opt">{</span>
    htri_t ret_value<span class="hl opt">=</span>FAIL<span class="hl opt">;</span>      <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_intersect<span class="hl opt">)</span>

    <span class="hl com">/* Sanity check */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space1<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space2<span class="hl opt">);</span>

    <span class="hl com">/* Check that the space selections both have span trees */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space1<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">==</span>NULL <span class="hl opt">||</span>
            space2<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_UNINITIALIZED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;dataspace does not have span tree&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Check that the dataspaces are both the same rank */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space1<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">!=</span>space2<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADRANGE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;dataspace ranks don't match&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Perform the span-by-span intersection check */</span>
    <span class="hl kwa">if</span><span class="hl opt">((</span>ret_value<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_intersect_helper</span><span class="hl opt">(</span>space1<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span>space2<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">))&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't perform hyperslab intersection check&quot;</span><span class="hl opt">)</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_intersect() */</span>
<span class="hl ppc">#endif</span> <span class="hl com">/* LATER */</span><span class="hl ppc"></span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_intersect_block_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Helper routine to detect intersections in span trees</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_intersect_block_helper(spans, start, end)</span>
<span class="hl com">        H5S_hyper_span_info_t *spans;     IN: First span tree to operate with</span>
<span class="hl com">        hssize_t *offset;   IN: Selection offset coordinate</span>
<span class="hl com">        hsize_t *start;    IN: Starting coordinate for block</span>
<span class="hl com">        hsize_t *end;      IN: Ending coordinate for block</span>
<span class="hl com"> RETURN</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Quickly detect intersections between span tree and block</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> htri_t
<span class="hl kwd">H5S_hyper_intersect_block_helper</span> <span class="hl opt">(</span><span class="hl kwb">const</span> H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>start<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>end<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>curr<span class="hl opt">;</span>     <span class="hl com">/* Pointer to current span in 1st span tree */</span>
    htri_t status<span class="hl opt">;</span>              <span class="hl com">/* Status from recursive call */</span>
    htri_t ret_value<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>     <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_intersect_block_helper<span class="hl opt">)</span>

    <span class="hl com">/* Sanity check */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>end<span class="hl opt">);</span>

    <span class="hl com">/* Get the span list for spans in this tree */</span>
    curr<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

    <span class="hl com">/* Iterate over the spans in the tree */</span>
    <span class="hl kwa">while</span><span class="hl opt">(</span>curr<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl com">/* Check for span entirely before block */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>high <span class="hl opt">&lt; *</span>start<span class="hl opt">)</span>
            <span class="hl com">/* Advance to next span in this dimension */</span>
            curr<span class="hl opt">=</span>curr<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl com">/* If this span is past the end of the block, then we're done in this dimension */</span>
        <span class="hl kwa">else if</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>low <span class="hl opt">&gt; *</span>end<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>
        <span class="hl com">/* block &amp; span overlap */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>TRUE<span class="hl opt">)</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl com">/* Recursively check spans in next dimension down */</span>
                <span class="hl kwa">if</span><span class="hl opt">((</span>status<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_intersect_block_helper</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>start<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>end<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">))&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't perform hyperslab intersection check&quot;</span><span class="hl opt">)</span>

                <span class="hl com">/* If there is a span intersection in the down dimensions, the span trees overlap */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>status<span class="hl opt">==</span>TRUE<span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>TRUE<span class="hl opt">);</span>

                <span class="hl com">/* No intersection in down dimensions, advance to next span */</span>
                curr<span class="hl opt">=</span>curr<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_intersect_block_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_intersect_block</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Detect intersections in span trees</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    htri_t H5S_hyper_intersect_block(space, start, end)</span>
<span class="hl com">        H5S_t *space;       IN: First dataspace to operate on span tree</span>
<span class="hl com">        hssize_t *start;    IN: Starting coordinate for block</span>
<span class="hl com">        hssize_t *end;      IN: Ending coordinate for block</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Quickly detect intersections between span tree and block</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
htri_t
<span class="hl kwd">H5S_hyper_intersect_block</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>start<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>end<span class="hl opt">)</span>
<span class="hl opt">{</span>
    htri_t ret_value<span class="hl opt">=</span>FAIL<span class="hl opt">;</span>      <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_intersect_block<span class="hl opt">)</span>

    <span class="hl com">/* Sanity check */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>end<span class="hl opt">);</span>

    <span class="hl com">/* Check for 'all' selection, instead of a hyperslab selection */</span>
    <span class="hl com">/* (Technically, this shouldn't be in the &quot;hyperslab&quot; routines...) */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">)==</span>H5S_SEL_ALL<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>TRUE<span class="hl opt">);</span>

    <span class="hl com">/* Check that the space selection has a span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_generate_spans</span><span class="hl opt">(</span>space<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_UNINITIALIZED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;dataspace does not have span tree&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Perform the span-by-span intersection check */</span>
    <span class="hl kwa">if</span><span class="hl opt">((</span>ret_value<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_intersect_block_helper</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span>start<span class="hl opt">,</span>end<span class="hl opt">))&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't perform hyperslab intersection check&quot;</span><span class="hl opt">)</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_intersect_block() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_adjust_helper_u</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Helper routine to adjust offsets in span trees</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_adjust_helper_u(spans, offset)</span>
<span class="hl com">        H5S_hyper_span_info_t *spans;   IN: Span tree to operate with</span>
<span class="hl com">        const hsize_t *offset;         IN: Offset to subtract</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Adjust the location of the spans in a span tree by subtracting an offset</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_adjust_helper_u</span> <span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>offset<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>     <span class="hl com">/* Pointer to current span in span tree */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_adjust_helper_u<span class="hl opt">)</span>

    <span class="hl com">/* Sanity check */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>offset<span class="hl opt">);</span>

    <span class="hl com">/* Check if we've already set this down span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>spans<span class="hl opt">-&gt;</span>scratch<span class="hl opt">!=(</span>H5S_hyper_span_info_t <span class="hl opt">*)~((</span><span class="hl kwb">size_t</span><span class="hl opt">)</span>NULL<span class="hl opt">)) {</span>
        <span class="hl com">/* Set the tree's scratch pointer */</span>
        spans<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=(</span>H5S_hyper_span_info_t <span class="hl opt">*)~((</span><span class="hl kwb">size_t</span><span class="hl opt">)</span>NULL<span class="hl opt">);</span>

        <span class="hl com">/* Get the span lists for each span in this tree */</span>
        span<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

        <span class="hl com">/* Iterate over the spans in tree */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
            <span class="hl com">/* Adjust span offset */</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>low<span class="hl opt">&gt;=*</span>offset<span class="hl opt">);</span>
            span<span class="hl opt">-&gt;</span>low<span class="hl opt">-=*</span>offset<span class="hl opt">;</span>
            span<span class="hl opt">-&gt;</span>high<span class="hl opt">-=*</span>offset<span class="hl opt">;</span>

            <span class="hl com">/* Recursively adjust spans in next dimension down */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">!=</span>NULL<span class="hl opt">)</span>
                <span class="hl kwd">H5S_hyper_adjust_helper_u</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>offset<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">);</span>

            <span class="hl com">/* Advance to next span in this dimension */</span>
            span<span class="hl opt">=</span>span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_adjust_helper_u() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_adjust_u</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Adjust a hyperslab selection by subtracting an offset</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_adjust_u(space,offset)</span>
<span class="hl com">        H5S_t *space;           IN/OUT: Pointer to dataspace to adjust</span>
<span class="hl com">        const hsize_t *offset; IN: Offset to subtract</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Moves a hyperslab selection by subtracting an offset from it.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_adjust_u</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>offset<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                         <span class="hl com">/* Local index variable */</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_adjust_u<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>offset<span class="hl opt">);</span>

    <span class="hl com">/* Subtract the offset from the &quot;regular&quot; coordinates, if they exist */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">&gt;=</span>offset<span class="hl opt">[</span>u<span class="hl opt">]);</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">-=</span>offset<span class="hl opt">[</span>u<span class="hl opt">];</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl com">/* Subtract the offset from the span tree coordinates, if they exist */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_adjust_helper_u</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span>offset<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't perform hyperslab offset adjustment&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Reset the scratch pointers for the next routine which needs them */</span>
        <span class="hl kwd">H5S_hyper_span_scratch</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span> NULL<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_adjust_u() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_project_scalar</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Projects a single element hyperslab selection into a scalar</span>
<span class="hl com"> *              dataspace</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	non-negative on success, negative on failure.</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Sunday, July 18, 2010</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_project_scalar</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>offset<span class="hl opt">)</span>
<span class="hl opt">{</span>
    hsize_t block<span class="hl opt">[</span>H5S_MAX_RANK<span class="hl opt">];</span>     <span class="hl com">/* Block selected in base dataspace */</span>
    herr_t ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>         <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_project_scalar<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space <span class="hl opt">&amp;&amp;</span> H5S_SEL_HYPERSLABS <span class="hl opt">==</span> <span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">));</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>offset<span class="hl opt">);</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>diminfo <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span> <span class="hl com">/* Alias for dataspace's diminfo information */</span>
        <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                 <span class="hl com">/* Counter */</span>

        <span class="hl com">/* Build the table of the initial offset */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            block<span class="hl opt">[</span>u<span class="hl opt">] =</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">;</span>

            <span class="hl com">/* Check for more than one hyperslab */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">&gt;</span> <span class="hl num">1</span> <span class="hl opt">||</span> diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block <span class="hl opt">&gt;</span> <span class="hl num">1</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADRANGE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;hyperslab selection of one element has more than one node!&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl kwb">const</span> H5S_hyper_span_t <span class="hl opt">*</span>curr<span class="hl opt">;</span>           <span class="hl com">/* Pointer to current hyperslab span */</span>
        <span class="hl kwb">unsigned</span> curr_dim<span class="hl opt">;</span>                      <span class="hl com">/* Current dimension being operated on */</span>

        <span class="hl com">/* Advance down selected spans */</span>
        curr <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
        curr_dim <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>curr<span class="hl opt">) {</span>
            <span class="hl com">/* Check for more than one span */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>curr<span class="hl opt">-&gt;</span>next <span class="hl opt">||</span> curr<span class="hl opt">-&gt;</span>low <span class="hl opt">!=</span> curr<span class="hl opt">-&gt;</span>high<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADRANGE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;hyperslab selection of one element has more than one node!&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Save the location of the selection in current dimension */</span>
            block<span class="hl opt">[</span>curr_dim<span class="hl opt">] =</span> curr<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>

            <span class="hl com">/* Advance down to next dimension */</span>
            curr <span class="hl opt">=</span> curr<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
            curr_dim<span class="hl opt">++;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl com">/* Calculate offset of selection in projected buffer */</span>
    <span class="hl opt">*</span>offset <span class="hl opt">=</span> <span class="hl kwd">H5V_array_offset</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">,</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">,</span> block<span class="hl opt">);</span> 

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_project_scalar() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_project_simple_lower</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Projects a hyperslab selection onto/into a simple dataspace</span>
<span class="hl com"> *              of a lower rank</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	non-negative on success, negative on failure.</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Sunday, July 18, 2010</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_project_simple_lower</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>base_space<span class="hl opt">,</span> H5S_t <span class="hl opt">*</span>new_space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>down<span class="hl opt">;</span>        <span class="hl com">/* Pointer to list of spans */</span>
    <span class="hl kwb">unsigned</span> curr_dim<span class="hl opt">;</span>                  <span class="hl com">/* Current dimension being operated on */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_project_simple_lower<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>base_space <span class="hl opt">&amp;&amp;</span> H5S_SEL_HYPERSLABS <span class="hl opt">==</span> <span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>base_space<span class="hl opt">));</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">&lt;</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span>

    <span class="hl com">/* Walk down the span tree until we reach the selection to project */</span>
    down <span class="hl opt">=</span> base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">;</span>
    curr_dim <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
    <span class="hl kwa">while</span><span class="hl opt">(</span>down <span class="hl opt">&amp;&amp;</span> curr_dim <span class="hl opt">&lt; (</span>base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">-</span> new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">)) {</span>
        <span class="hl com">/* Sanity check */</span>
        <span class="hl kwd">HDassert</span><span class="hl opt">(</span>NULL <span class="hl opt">==</span> down<span class="hl opt">-&gt;</span>head<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>

        <span class="hl com">/* Advance down to next dimension */</span>
        down <span class="hl opt">=</span> down<span class="hl opt">-&gt;</span>head<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>
        curr_dim<span class="hl opt">++;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>down<span class="hl opt">);</span>

    <span class="hl com">/* Share the underlying hyperslab span information */</span>
    new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">=</span> down<span class="hl opt">;</span>
    new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">-&gt;</span>count<span class="hl opt">++;</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_project_simple_lower() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_project_simple_higher</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Projects a hyperslab selection onto/into a simple dataspace</span>
<span class="hl com"> *              of a higher rank</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	non-negative on success, negative on failure.</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Sunday, July 18, 2010</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_project_simple_higher</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>base_space<span class="hl opt">,</span> H5S_t <span class="hl opt">*</span>new_space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>prev_span <span class="hl opt">=</span> NULL<span class="hl opt">;</span> <span class="hl com">/* Pointer to previous list of spans */</span>
    <span class="hl kwb">unsigned</span> curr_dim<span class="hl opt">;</span>                  <span class="hl com">/* Current dimension being operated on */</span>
    herr_t ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>         <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_project_simple_higher<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>base_space <span class="hl opt">&amp;&amp;</span> H5S_SEL_HYPERSLABS <span class="hl opt">==</span> <span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>base_space<span class="hl opt">));</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">&gt;</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span>

    <span class="hl com">/* Create nodes until reaching the correct # of dimensions */</span>
    new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
    curr_dim <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
    <span class="hl kwa">while</span><span class="hl opt">(</span>curr_dim <span class="hl opt">&lt; (</span>new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">-</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">)) {</span>
        H5S_hyper_span_info_t <span class="hl opt">*</span>new_span_info<span class="hl opt">;</span>  <span class="hl com">/* Pointer to list of spans */</span>
        H5S_hyper_span_t <span class="hl opt">*</span>new_span<span class="hl opt">;</span>     <span class="hl com">/* Temporary hyperslab span */</span>

        <span class="hl com">/* Allocate a new span_info node */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>new_span_info <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">))) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>prev_span<span class="hl opt">)</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span</span><span class="hl opt">(</span>prev_span<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                    <span class="hl kwd">HERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> <span class="hl str">&quot;can't free hyperslab span&quot;</span><span class="hl opt">);</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTALLOC<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span info&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Check for linking into higher span */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>prev_span<span class="hl opt">)</span>
            prev_span<span class="hl opt">-&gt;</span>down <span class="hl opt">=</span> new_span_info<span class="hl opt">;</span>

        <span class="hl com">/* Allocate a new node */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>new_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span><span class="hl num">0</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">,</span> NULL<span class="hl opt">,</span> NULL<span class="hl opt">))) {</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_span_info<span class="hl opt">);</span>
            <span class="hl kwa">if</span><span class="hl opt">(!</span>prev_span<span class="hl opt">)</span>
                <span class="hl opt">(</span><span class="hl kwb">void</span><span class="hl opt">)</span><span class="hl kwd">H5FL_FREE</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">,</span> new_span_info<span class="hl opt">);</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTALLOC<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Set the span_info information */</span>
        new_span_info<span class="hl opt">-&gt;</span>count <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
        new_span_info<span class="hl opt">-&gt;</span>scratch <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
        new_span_info<span class="hl opt">-&gt;</span>head <span class="hl opt">=</span> new_span<span class="hl opt">;</span>

        <span class="hl com">/* Attach to new space, if top span info */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">==</span> new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">)</span>
            new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">=</span> new_span_info<span class="hl opt">;</span>

        <span class="hl com">/* Remember previous span info */</span>
        prev_span <span class="hl opt">=</span> new_span<span class="hl opt">;</span>

        <span class="hl com">/* Advance to next dimension */</span>
        curr_dim<span class="hl opt">++;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>prev_span<span class="hl opt">);</span>

    <span class="hl com">/* Share the underlying hyperslab span information */</span>
    prev_span<span class="hl opt">-&gt;</span>down <span class="hl opt">=</span> base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">;</span>
    prev_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>count<span class="hl opt">++;</span>

done<span class="hl opt">:</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>ret_value <span class="hl opt">&lt;</span> <span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">-&gt;</span>head<span class="hl opt">)</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span</span><span class="hl opt">(</span>
                    new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">-&gt;</span>head<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HDONE_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't free hyperslab span&quot;</span><span class="hl opt">)</span>

        new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">=</span> <span class="hl kwd">H5FL_FREE</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">,</span> new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_project_simple_higher() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_hyper_project_simple</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Projects a hyperslab selection onto/into a simple dataspace</span>
<span class="hl com"> *              of a different rank</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	non-negative on success, negative on failure.</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Sunday, July 18, 2010</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_project_simple</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_t <span class="hl opt">*</span>base_space<span class="hl opt">,</span> H5S_t <span class="hl opt">*</span>new_space<span class="hl opt">,</span> hsize_t <span class="hl opt">*</span>offset<span class="hl opt">)</span>
<span class="hl opt">{</span>
    herr_t ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>         <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_project_simple<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>base_space <span class="hl opt">&amp;&amp;</span> H5S_SEL_HYPERSLABS <span class="hl opt">==</span> <span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>base_space<span class="hl opt">));</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>offset<span class="hl opt">);</span>

    <span class="hl com">/* We are setting a new selection, remove any current selection in new dataspace */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_SELECT_RELEASE</span><span class="hl opt">(</span>new_space<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't release selection&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Allocate space for the hyperslab selection information */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_sel_t<span class="hl opt">)))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab info&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Check for a &quot;regular&quot; hyperslab selection */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwb">unsigned</span> base_space_dim<span class="hl opt">;</span>    <span class="hl com">/* Current dimension in the base dataspace */</span>
        <span class="hl kwb">unsigned</span> new_space_dim<span class="hl opt">;</span>     <span class="hl com">/* Current dimension in the new dataspace */</span>

        <span class="hl com">/* Check if the new space's rank is &lt; or &gt; base space's rank */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">&lt;</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">) {</span>
            <span class="hl kwb">const</span> H5S_hyper_dim_t <span class="hl opt">*</span>opt_diminfo <span class="hl opt">=</span> base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span> <span class="hl com">/* Alias for dataspace's diminfo information */</span>
            hsize_t block<span class="hl opt">[</span>H5S_MAX_RANK<span class="hl opt">];</span>     <span class="hl com">/* Block selected in base dataspace */</span>
            <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>         <span class="hl com">/* Local index variable */</span>

            <span class="hl com">/* Compute the offset for the down-projection */</span>
            <span class="hl kwd">HDmemset</span><span class="hl opt">(</span>block<span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>block<span class="hl opt">));</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt; (</span>base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">-</span> new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span> u<span class="hl opt">++)</span>
                block<span class="hl opt">[</span>u<span class="hl opt">] =</span> opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">;</span>
            <span class="hl opt">*</span>offset <span class="hl opt">=</span> <span class="hl kwd">H5V_array_offset</span><span class="hl opt">(</span>base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">,</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">,</span> block<span class="hl opt">);</span> 

            <span class="hl com">/* Set the correct dimensions for the base &amp; new spaces */</span>
            base_space_dim <span class="hl opt">=</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">-</span> new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span>
            new_space_dim <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">&gt;</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span>

            <span class="hl com">/* The offset is zero when projected into higher dimensions */</span>
            <span class="hl opt">*</span>offset <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

            <span class="hl com">/* Set the diminfo information for the higher dimensions */</span>
            <span class="hl kwa">for</span><span class="hl opt">(</span>new_space_dim <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> new_space_dim <span class="hl opt">&lt; (</span>new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">-</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span> new_space_dim<span class="hl opt">++) {</span>
                new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>start <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
                new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>stride <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
                new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>count <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
                new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>block <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>

                new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>start <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
                new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>stride <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
                new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>count <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
                new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>block <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

            <span class="hl com">/* Start at beginning of base space's dimension info */</span>
            base_space_dim <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

        <span class="hl com">/* Copy the diminfo */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>base_space_dim <span class="hl opt">&lt;</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">) {</span>
            new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>start <span class="hl opt">=</span> 
                    base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>base_space_dim<span class="hl opt">].</span>start<span class="hl opt">;</span>
            new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>stride <span class="hl opt">=</span> 
                    base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>base_space_dim<span class="hl opt">].</span>stride<span class="hl opt">;</span>
            new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>count <span class="hl opt">=</span> 
                    base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>base_space_dim<span class="hl opt">].</span>count<span class="hl opt">;</span>
            new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>block <span class="hl opt">=</span> 
                    base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>base_space_dim<span class="hl opt">].</span>block<span class="hl opt">;</span>

            new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>start <span class="hl opt">=</span> 
                    base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>base_space_dim<span class="hl opt">].</span>start<span class="hl opt">;</span>
            new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>stride <span class="hl opt">=</span>
                    base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>base_space_dim<span class="hl opt">].</span>stride<span class="hl opt">;</span>
            new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>count <span class="hl opt">=</span> 
                    base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>base_space_dim<span class="hl opt">].</span>count<span class="hl opt">;</span>
            new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>new_space_dim<span class="hl opt">].</span>block <span class="hl opt">=</span> 
                    base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>base_space_dim<span class="hl opt">].</span>block<span class="hl opt">;</span>

            <span class="hl com">/* Advance to next dimensions */</span>
            base_space_dim<span class="hl opt">++;</span>
            new_space_dim<span class="hl opt">++;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* Indicate that the dimension information is valid */</span>
        new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>

        <span class="hl com">/* Indicate that there's no slab information */</span>
        new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Check if the new space's rank is &lt; or &gt; base space's rank */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">&lt;</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">) {</span>
            <span class="hl kwb">const</span> H5S_hyper_span_t <span class="hl opt">*</span>curr<span class="hl opt">;</span>    <span class="hl com">/* Pointer to current hyperslab span */</span>
            hsize_t block<span class="hl opt">[</span>H5S_MAX_RANK<span class="hl opt">];</span>     <span class="hl com">/* Block selected in base dataspace */</span>
            <span class="hl kwb">unsigned</span> curr_dim<span class="hl opt">;</span>               <span class="hl com">/* Current dimension being operated on */</span>

            <span class="hl com">/* Clear the block buffer */</span>
            <span class="hl kwd">HDmemset</span><span class="hl opt">(</span>block<span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>block<span class="hl opt">));</span>

            <span class="hl com">/* Advance down selected spans */</span>
            curr <span class="hl opt">=</span> base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
            curr_dim <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>curr <span class="hl opt">&amp;&amp;</span> curr_dim <span class="hl opt">&lt; (</span>base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">-</span> new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">)) {</span>
                <span class="hl com">/* Save the location of the selection in current dimension */</span>
                block<span class="hl opt">[</span>curr_dim<span class="hl opt">] =</span> curr<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>

                <span class="hl com">/* Advance down to next dimension */</span>
                curr <span class="hl opt">=</span> curr<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
                curr_dim<span class="hl opt">++;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

            <span class="hl com">/* Compute the offset for the down-projection */</span>
            <span class="hl opt">*</span>offset <span class="hl opt">=</span> <span class="hl kwd">H5V_array_offset</span><span class="hl opt">(</span>base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">,</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">,</span> block<span class="hl opt">);</span> 

            <span class="hl com">/* Project the base space's selection down in less dimensions */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_project_simple_lower</span><span class="hl opt">(</span>base_space<span class="hl opt">,</span> new_space<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't project hyperslab selection into less dimensions&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank <span class="hl opt">&gt;</span> base_space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span>

            <span class="hl com">/* The offset is zero when projected into higher dimensions */</span>
            <span class="hl opt">*</span>offset <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

            <span class="hl com">/* Project the base space's selection down in less dimensions */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_project_simple_higher</span><span class="hl opt">(</span>base_space<span class="hl opt">,</span> new_space<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't project hyperslab selection into less dimensions&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

        <span class="hl com">/* Indicate that the dimension information is not valid */</span>
        new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl com">/* Number of elements selected will be the same */</span>
    new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem <span class="hl opt">=</span> base_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">;</span>

    <span class="hl com">/* Set selection type */</span>
    new_space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>type <span class="hl opt">=</span> H5S_sel_hyper<span class="hl opt">;</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_project_simple() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_adjust_helper_s</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Helper routine to adjust offsets in span trees</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_adjust_helper_s(spans, offset)</span>
<span class="hl com">        H5S_hyper_span_info_t *spans;   IN: Span tree to operate with</span>
<span class="hl com">        const hssize_t *offset;         IN: Offset to subtract</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Adjust the location of the spans in a span tree by subtracting an offset</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_adjust_helper_s</span><span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">,</span> <span class="hl kwb">const</span> hssize_t <span class="hl opt">*</span>offset<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>     <span class="hl com">/* Pointer to current span in span tree */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_adjust_helper_s<span class="hl opt">)</span>

    <span class="hl com">/* Sanity check */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>offset<span class="hl opt">);</span>

    <span class="hl com">/* Check if we've already set this down span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>spans<span class="hl opt">-&gt;</span>scratch <span class="hl opt">!= (</span>H5S_hyper_span_info_t <span class="hl opt">*)~((</span><span class="hl kwb">size_t</span><span class="hl opt">)</span>NULL<span class="hl opt">)) {</span>
        <span class="hl com">/* Set the tree's scratch pointer */</span>
        spans<span class="hl opt">-&gt;</span>scratch <span class="hl opt">= (</span>H5S_hyper_span_info_t <span class="hl opt">*)~((</span><span class="hl kwb">size_t</span><span class="hl opt">)</span>NULL<span class="hl opt">);</span>

        <span class="hl com">/* Get the span lists for each span in this tree */</span>
        span <span class="hl opt">=</span> spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

        <span class="hl com">/* Iterate over the spans in tree */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
            <span class="hl com">/* Adjust span offset */</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">((</span>hssize_t<span class="hl opt">)</span>span<span class="hl opt">-&gt;</span>low <span class="hl opt">&gt;= *</span>offset<span class="hl opt">);</span>
            span<span class="hl opt">-&gt;</span>low <span class="hl opt">= (</span>hsize_t<span class="hl opt">)((</span>hssize_t<span class="hl opt">)</span>span<span class="hl opt">-&gt;</span>low <span class="hl opt">- *</span>offset<span class="hl opt">);</span>
            span<span class="hl opt">-&gt;</span>high <span class="hl opt">= (</span>hsize_t<span class="hl opt">)((</span>hssize_t<span class="hl opt">)</span>span<span class="hl opt">-&gt;</span>high <span class="hl opt">- *</span>offset<span class="hl opt">);</span>

            <span class="hl com">/* Recursively adjust spans in next dimension down */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">)</span>
                <span class="hl kwd">H5S_hyper_adjust_helper_s</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span> offset <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">);</span>

            <span class="hl com">/* Advance to next span in this dimension */</span>
            span <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_adjust_helper_s() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_adjust_s</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Adjust a hyperslab selection by subtracting an offset</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_adjust_s(space,offset)</span>
<span class="hl com">        H5S_t *space;           IN/OUT: Pointer to dataspace to adjust</span>
<span class="hl com">        const hssize_t *offset; IN: Offset to subtract</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Moves a hyperslab selection by subtracting an offset from it.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_adjust_s</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">const</span> hssize_t <span class="hl opt">*</span>offset<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                         <span class="hl com">/* Local index variable */</span>
    herr_t      ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>    <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_adjust_s<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>offset<span class="hl opt">);</span>

    <span class="hl com">/* Subtract the offset from the &quot;regular&quot; coordinates, if they exist */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">) {</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">((</span>hssize_t<span class="hl opt">)</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">&gt;=</span> offset<span class="hl opt">[</span>u<span class="hl opt">]);</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">= (</span>hsize_t<span class="hl opt">)((</span>hssize_t<span class="hl opt">)</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">-</span> offset<span class="hl opt">[</span>u<span class="hl opt">]);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl com">/* Subtract the offset from the span tree coordinates, if they exist */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_adjust_helper_s</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span> offset<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't perform hyperslab offset adjustment&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Reset the scratch pointers for the next routine which needs them */</span>
        <span class="hl kwd">H5S_hyper_span_scratch</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span> NULL<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_adjust_s() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_normalize_offset</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    &quot;Normalize&quot; a hyperslab selection by adjusting it's coordinates by the</span>
<span class="hl com">    amount of the selection offset.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_normalize_offset(space, old_offset)</span>
<span class="hl com">        H5S_t *space;           IN/OUT: Pointer to dataspace to move</span>
<span class="hl com">        hssize_t *old_offset;   OUT: Pointer to space to store old offset</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Copies the current selection offset into the array provided, then</span>
<span class="hl com">    inverts the selection offset, subtracts the offset from the hyperslab</span>
<span class="hl com">    selection and resets the offset to zero.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
htri_t
<span class="hl kwd">H5S_hyper_normalize_offset</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> hssize_t <span class="hl opt">*</span>old_offset<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                         <span class="hl com">/* Local index variable */</span>
    herr_t ret_value <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>           <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_normalize_offset<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>

    <span class="hl com">/* Check for hyperslab selection &amp; offset changed */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">) ==</span> H5S_SEL_HYPERSLABS <span class="hl opt">&amp;&amp;</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset_changed<span class="hl opt">) {</span>
        <span class="hl com">/* Copy &amp; invert the selection offset */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            old_offset<span class="hl opt">[</span>u<span class="hl opt">] =</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>u<span class="hl opt">] = -</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">[</span>u<span class="hl opt">];</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* Call the existing 'adjust' routine */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_adjust_s</span><span class="hl opt">(</span>space<span class="hl opt">,</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't perform hyperslab normalization&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Zero out the selection offset */</span>
        <span class="hl kwd">HDmemset</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hssize_t<span class="hl opt">) *</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span>

        <span class="hl com">/* Indicate that the offset was normalized */</span>
        ret_value <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_normalize_offset() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_denormalize_offset</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    &quot;Denormalize&quot; a hyperslab selection by reverse adjusting it's coordinates</span>
<span class="hl com">    by the amount of the former selection offset.</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_normalize_offset(space, old_offset)</span>
<span class="hl com">        H5S_t *space;           IN/OUT: Pointer to dataspace to move</span>
<span class="hl com">        hssize_t *old_offset;   IN: Pointer to old offset array</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Subtracts the old offset from the current selection (canceling out the</span>
<span class="hl com">    effect of the &quot;normalize&quot; routine), then restores the old offset into</span>
<span class="hl com">    the dataspace.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5S_hyper_denormalize_offset</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> <span class="hl kwb">const</span> hssize_t <span class="hl opt">*</span>old_offset<span class="hl opt">)</span>
<span class="hl opt">{</span>
    herr_t      ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>    <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_denormalize_offset<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">) ==</span> H5S_SEL_HYPERSLABS<span class="hl opt">);</span>

    <span class="hl com">/* Call the existing 'adjust' routine */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_adjust_s</span><span class="hl opt">(</span>space<span class="hl opt">,</span> old_offset<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADSELECT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't perform hyperslab normalization&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Copy the selection offset over */</span>
    <span class="hl kwd">HDmemcpy</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>offset<span class="hl opt">,</span> old_offset<span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>hssize_t<span class="hl opt">) *</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">);</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_denormalize_offset() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_append_span</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Create a new span and append to span list</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_append_span(prev_span, span_tree, low, high, down, next)</span>
<span class="hl com">        H5S_hyper_span_t **prev_span;    IN/OUT: Pointer to previous span in list</span>
<span class="hl com">        H5S_hyper_span_info_t **span_tree;  IN/OUT: Pointer to span tree to append to</span>
<span class="hl com">        hsize_t low, high;         IN: Low and high bounds for new span node</span>
<span class="hl com">        H5S_hyper_span_info_t *down;     IN: Down span tree for new node</span>
<span class="hl com">        H5S_hyper_span_t *next;     IN: Next span for new node</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Create a new span node and append to a span list.  Update the previous</span>
<span class="hl com">    span in the list also.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_append_span</span> <span class="hl opt">(</span>H5S_hyper_span_t <span class="hl opt">**</span>prev_span<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">**</span> span_tree<span class="hl opt">,</span> hsize_t low<span class="hl opt">,</span> hsize_t high<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">*</span>down<span class="hl opt">,</span> H5S_hyper_span_t <span class="hl opt">*</span>next<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>new_span <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
    herr_t      ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_append_span<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>prev_span<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span_tree<span class="hl opt">);</span>

    <span class="hl com">/* Check for adding first node to merged spans */</span>
    <span class="hl kwa">if</span><span class="hl opt">(*</span>prev_span<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
        <span class="hl com">/* Allocate new span node to append to list */</span>
        <span class="hl kwa">if</span><span class="hl opt">((</span>new_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>low<span class="hl opt">,</span>high<span class="hl opt">,</span>down<span class="hl opt">,</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Make first node in span list */</span>

        <span class="hl com">/* Check that we haven't already allocated a span tree */</span>
        <span class="hl kwd">HDassert</span><span class="hl opt">(*</span>span_tree<span class="hl opt">==</span>NULL<span class="hl opt">);</span>

        <span class="hl com">/* Allocate a new span_info node */</span>
        <span class="hl kwa">if</span><span class="hl opt">((*</span>span_tree <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Set the span tree's basic information */</span>
        <span class="hl opt">(*</span>span_tree<span class="hl opt">)-&gt;</span>count<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>
        <span class="hl opt">(*</span>span_tree<span class="hl opt">)-&gt;</span>scratch<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
        <span class="hl opt">(*</span>span_tree<span class="hl opt">)-&gt;</span>head<span class="hl opt">=</span>new_span<span class="hl opt">;</span>

        <span class="hl com">/* Update previous merged span */</span>
        <span class="hl opt">*</span>prev_span<span class="hl opt">=</span>new_span<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl com">/* Merge or append to existing merged spans list */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Check if span can just extend the previous merged span */</span>
        <span class="hl kwa">if</span><span class="hl opt">((((*</span>prev_span<span class="hl opt">)-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">)==</span>low<span class="hl opt">) &amp;&amp;</span>
                <span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>down<span class="hl opt">,(*</span>prev_span<span class="hl opt">)-&gt;</span>down<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
            <span class="hl com">/* Extend previous merged span to include new high bound */</span>
            <span class="hl opt">(*</span>prev_span<span class="hl opt">)-&gt;</span>high<span class="hl opt">=</span>high<span class="hl opt">;</span>
            <span class="hl opt">(*</span>prev_span<span class="hl opt">)-&gt;</span>nelem<span class="hl opt">+=(</span>high<span class="hl opt">-</span>low<span class="hl opt">)+</span><span class="hl num">1</span><span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Allocate new span node to append to list */</span>
            <span class="hl kwa">if</span><span class="hl opt">((</span>new_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>low<span class="hl opt">,</span>high<span class="hl opt">,</span>down<span class="hl opt">,</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Check if there is actually a down span */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>new_span<span class="hl opt">-&gt;</span>down<span class="hl opt">) {</span>
                <span class="hl com">/* Check if the down spans for the new span node are the same as the previous span node */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>new_span<span class="hl opt">-&gt;</span>down<span class="hl opt">,(*</span>prev_span<span class="hl opt">)-&gt;</span>down<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
                    <span class="hl com">/* Release the down span for the new node */</span>
                    <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>new_span<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>

                    <span class="hl com">/* Point the new node's down span at the previous node's down span */</span>
                    new_span<span class="hl opt">-&gt;</span>down<span class="hl opt">=(*</span>prev_span<span class="hl opt">)-&gt;</span>down<span class="hl opt">;</span>

                    <span class="hl com">/* Increment the reference count to the shared down span */</span>
                    new_span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>count<span class="hl opt">++;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

            <span class="hl com">/* Indicate elements from previous span */</span>
            new_span<span class="hl opt">-&gt;</span>pstride<span class="hl opt">=</span>low<span class="hl opt">-(*</span>prev_span<span class="hl opt">)-&gt;</span>low<span class="hl opt">;</span>

            <span class="hl com">/* Append to end of merged spans list */</span>
            <span class="hl opt">(*</span>prev_span<span class="hl opt">)-&gt;</span>next<span class="hl opt">=</span>new_span<span class="hl opt">;</span>
            <span class="hl opt">*</span>prev_span<span class="hl opt">=</span>new_span<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>ret_value <span class="hl opt">&lt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>new_span<span class="hl opt">)</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span</span><span class="hl opt">(</span>new_span<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HDONE_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release new hyperslab span&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_append_span() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_clip_spans</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Clip a new span tree against the current spans in the hyperslab selection</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_clip_spans(span_a, span_b, a_not_b, a_and_b, b_not_a)</span>
<span class="hl com">        H5S_hyper_span_t *a_spans;    IN: Span tree 'a' to clip with.</span>
<span class="hl com">        H5S_hyper_span_t *b_spans;    IN: Span tree 'b' to clip with.</span>
<span class="hl com">        H5S_hyper_span_t **a_not_b;  OUT: Span tree of 'a' hyperslab spans which</span>
<span class="hl com">                                            doesn't overlap with 'b' hyperslab</span>
<span class="hl com">                                            spans.</span>
<span class="hl com">        H5S_hyper_span_t **a_and_b;  OUT: Span tree of 'a' hyperslab spans which</span>
<span class="hl com">                                            overlaps with 'b' hyperslab spans.</span>
<span class="hl com">        H5S_hyper_span_t **b_not_a;  OUT: Span tree of 'b' hyperslab spans which</span>
<span class="hl com">                                            doesn't overlap with 'a' hyperslab</span>
<span class="hl com">                                            spans.</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Clip one span tree ('a') against another span tree ('b').  Creates span</span>
<span class="hl com">    trees for the area defined by the 'a' span tree which does not overlap the</span>
<span class="hl com">    'b' span tree, the area defined by the overlap of the 'a' hyperslab span</span>
<span class="hl com">    tree and the 'b' span tree, and the area defined by the 'b' hyperslab span</span>
<span class="hl com">    tree which does not overlap the 'a' span tree.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_clip_spans</span> <span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>a_spans<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">*</span>b_spans<span class="hl opt">,</span>
    H5S_hyper_span_info_t <span class="hl opt">**</span>a_not_b<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">**</span>a_and_b<span class="hl opt">,</span>
    H5S_hyper_span_info_t <span class="hl opt">**</span>b_not_a<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span_a<span class="hl opt">;</span>   <span class="hl com">/* Pointer to a node in span tree 'a' */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span_b<span class="hl opt">;</span>   <span class="hl com">/* Pointer to a node in span tree 'b' */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>tmp_span<span class="hl opt">;</span> <span class="hl com">/* Temporary pointer to new span */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>last_a_not_b<span class="hl opt">;</span>   <span class="hl com">/* Pointer to previous node in span tree 'a_not_b' */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>last_a_and_b<span class="hl opt">;</span>   <span class="hl com">/* Pointer to previous node in span tree 'a_and_b' */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>last_b_not_a<span class="hl opt">;</span>   <span class="hl com">/* Pointer to previous node in span tree 'b_not_a' */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>down_a_not_b<span class="hl opt">;</span> <span class="hl com">/* Temporary pointer to a_not_b span tree of down spans for overlapping nodes */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>down_a_and_b<span class="hl opt">;</span> <span class="hl com">/* Temporary pointer to a_and_b span tree of down spans for overlapping nodes */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>down_b_not_a<span class="hl opt">;</span> <span class="hl com">/* Temporary pointer to b_and_a span tree of down spans for overlapping nodes */</span>
    <span class="hl kwb">unsigned</span> recover_a<span class="hl opt">,</span> recover_b<span class="hl opt">;</span>         <span class="hl com">/* Flags to indicate when to recover temporary spans */</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_clip_spans<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>a_spans<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>b_spans<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>a_not_b<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>a_and_b<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>b_not_a<span class="hl opt">);</span>

    <span class="hl com">/* Check if both span trees are not defined */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>a_spans<span class="hl opt">==</span>NULL <span class="hl opt">&amp;&amp;</span> b_spans<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
        <span class="hl opt">*</span>a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
        <span class="hl opt">*</span>a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
        <span class="hl opt">*</span>b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl com">/* If span 'a' is not defined, but 'b' is, copy 'b' and set the other return span trees to empty */</span>
    <span class="hl kwa">else if</span><span class="hl opt">(</span>a_spans<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
        <span class="hl opt">*</span>a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
        <span class="hl opt">*</span>a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
        <span class="hl kwa">if</span><span class="hl opt">((*</span>b_not_a<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_copy_span</span><span class="hl opt">(</span>b_spans<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTCOPY<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't copy hyperslab span tree&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl com">/* If span 'b' is not defined, but 'a' is, copy 'a' and set the other return span trees to empty */</span>
    <span class="hl kwa">else if</span><span class="hl opt">(</span>b_spans<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">((*</span>a_not_b<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_copy_span</span><span class="hl opt">(</span>a_spans<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTCOPY<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't copy hyperslab span tree&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">*</span>a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
        <span class="hl opt">*</span>b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl com">/* If span 'a' and 'b' are both defined, calculate the proper span trees */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Check if both span trees completely overlap */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>a_spans<span class="hl opt">,</span>b_spans<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
            <span class="hl opt">*</span>a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
            <span class="hl kwa">if</span><span class="hl opt">((*</span>a_and_b<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_copy_span</span><span class="hl opt">(</span>a_spans<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTCOPY<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't copy hyperslab span tree&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">*</span>b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Get the pointers to the new and old span lists */</span>
            span_a<span class="hl opt">=</span>a_spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
            span_b<span class="hl opt">=</span>b_spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

            <span class="hl com">/* Set the pointer to the previous spans */</span>
            last_a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
            last_a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
            last_b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

            <span class="hl com">/* No spans to recover yet */</span>
            recover_a<span class="hl opt">=</span>recover_b<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

            <span class="hl com">/* Work through the list of spans in the new list */</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>span_a<span class="hl opt">!=</span>NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                <span class="hl com">/* Check if span 'a' is completely before span 'b' */</span>
                <span class="hl com">/*    AAAAAAA                            */</span>
                <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
                <span class="hl com">/*             BBBBBBBBBB                */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">) {</span>
                    <span class="hl com">/* Copy span 'a' and add to a_not_b list */</span>

                    <span class="hl com">/* Merge/add span 'a' with/to a_not_b list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_not_b<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Advance span 'a', leave span 'b' */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl com">/* Check if span 'a' overlaps only the lower bound */</span>
                <span class="hl com">/*  of span 'b' , up to the upper bound of span 'b' */</span>
                <span class="hl com">/*    AAAAAAAAAAAA                       */</span>
                <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
                <span class="hl com">/*             BBBBBBBBBB                */</span>
                <span class="hl kwa">else if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp; (</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&gt;=</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;=</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">)) {</span>
                    <span class="hl com">/* Split span 'a' into two parts at the low bound of span 'b' */</span>

                    <span class="hl com">/* Merge/add lower part of span 'a' with/to a_not_b list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_not_b<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Check for overlaps between upper part of span 'a' and lower part of span 'b' */</span>

                    <span class="hl com">/* Make certain both spans either have a down span or both don't have one */</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">((</span>span_a<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">) || (</span>span_a<span class="hl opt">-&gt;</span>down <span class="hl opt">==</span> NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">-&gt;</span>down <span class="hl opt">==</span> NULL<span class="hl opt">));</span>

                    <span class="hl com">/* If there are no down spans, just add the overlapping area to the a_and_b list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
                        <span class="hl com">/* Merge/add overlapped part with/to a_and_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_and_b<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>NULL<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl com">/* If there are down spans, check for the overlap in them and add to each appropriate list */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* NULL out the temporary pointers to clipped areas in down spans */</span>
                        down_a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
                        down_a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
                        down_b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                        <span class="hl com">/* Check for overlaps in the 'down spans' of span 'a' &amp; 'b' */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_clip_spans</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,&amp;</span>down_a_not_b<span class="hl opt">,&amp;</span>down_a_and_b<span class="hl opt">,&amp;</span>down_b_not_a<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCLIP<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't clip hyperslab information&quot;</span><span class="hl opt">)</span>

                        <span class="hl com">/* Check for additions to the a_not_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_a_not_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to a_not_b list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_not_b<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_a_not_b<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_a_not_b<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                        <span class="hl com">/* Check for additions to the a_and_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_a_and_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to a_and_b list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_and_b<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_a_and_b<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_a_and_b<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                        <span class="hl com">/* Check for additions to the b_not_a list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to b_not_a list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_b_not_a<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_b_not_a<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_b_not_a<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Split off upper part of span 'b' at upper span of span 'a' */</span>

                    <span class="hl com">/* Check if there is actually an upper part of span 'b' to split off */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                        <span class="hl com">/* Allocate new span node for upper part of span 'b' */</span>
                        <span class="hl kwa">if</span><span class="hl opt">((</span>tmp_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                        <span class="hl com">/* Advance span 'a' */</span>
                        <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>

                        <span class="hl com">/* Make upper part of span 'b' into new span 'b' */</span>
                        <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>tmp_span<span class="hl opt">);</span>
                        recover_b<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl com">/* No upper part of span 'b' to split */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* Advance both 'a' and 'b' */</span>
                        <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                        <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl com">/* Check if span 'a' overlaps the lower &amp; upper bound */</span>
                <span class="hl com">/*  of span 'b' */</span>
                <span class="hl com">/*    AAAAAAAAAAAAAAAAAAAAA              */</span>
                <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
                <span class="hl com">/*             BBBBBBBBBB                */</span>
                <span class="hl kwa">else if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&gt;</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                    <span class="hl com">/* Split off lower part of span 'a' at lower span of span 'b' */</span>

                    <span class="hl com">/* Merge/add lower part of span 'a' with/to a_not_b list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_not_b<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Check for overlaps between middle part of span 'a' and span 'b' */</span>

                    <span class="hl com">/* Make certain both spans either have a down span or both don't have one */</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">((</span>span_a<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">) || (</span>span_a<span class="hl opt">-&gt;</span>down <span class="hl opt">==</span> NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">-&gt;</span>down <span class="hl opt">==</span> NULL<span class="hl opt">));</span>

                    <span class="hl com">/* If there are no down spans, just add the overlapping area to the a_and_b list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
                        <span class="hl com">/* Merge/add overlapped part with/to a_and_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_and_b<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>NULL<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl com">/* If there are down spans, check for the overlap in them and add to each appropriate list */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* NULL out the temporary pointers to clipped areas in down spans */</span>
                        down_a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
                        down_a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
                        down_b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                        <span class="hl com">/* Check for overlaps in the 'down spans' of span 'a' &amp; 'b' */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_clip_spans</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,&amp;</span>down_a_not_b<span class="hl opt">,&amp;</span>down_a_and_b<span class="hl opt">,&amp;</span>down_b_not_a<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCLIP<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't clip hyperslab information&quot;</span><span class="hl opt">)</span>

                        <span class="hl com">/* Check for additions to the a_not_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_a_not_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to a_not_b list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_not_b<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_a_not_b<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_a_not_b<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                        <span class="hl com">/* Check for additions to the a_and_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_a_and_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to a_and_b list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_and_b<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_a_and_b<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_a_and_b<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                        <span class="hl com">/* Check for additions to the b_not_a list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to b_not_a list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_b_not_a<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_b_not_a<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_b_not_a<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Split off upper part of span 'a' at upper span of span 'b' */</span>

                    <span class="hl com">/* Allocate new span node for upper part of span 'a' */</span>
                    <span class="hl kwa">if</span><span class="hl opt">((</span>tmp_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Make upper part of span 'a' the new span 'a' */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>tmp_span<span class="hl opt">);</span>
                    recover_a<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>

                    <span class="hl com">/* Advance span 'b' */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl com">/* Check if span 'a' is entirely within span 'b' */</span>
                <span class="hl com">/*                AAAAA                  */</span>
                <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
                <span class="hl com">/*             BBBBBBBBBB                */</span>
                <span class="hl kwa">else if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&gt;=</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;=</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                    <span class="hl com">/* Split off lower part of span 'b' at lower span of span 'a' */</span>

                    <span class="hl com">/* Check if there is actually a lower part of span 'b' to split off */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&gt;</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">) {</span>
                        <span class="hl com">/* Merge/add lower part of span 'b' with/to b_not_a list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_b_not_a<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* Keep going, nothing to split off */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Check for overlaps between span 'a' and midle of span 'b' */</span>

                    <span class="hl com">/* Make certain both spans either have a down span or both don't have one */</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">((</span>span_a<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">) || (</span>span_a<span class="hl opt">-&gt;</span>down <span class="hl opt">==</span> NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">-&gt;</span>down <span class="hl opt">==</span> NULL<span class="hl opt">));</span>

                    <span class="hl com">/* If there are no down spans, just add the overlapping area to the a_and_b list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
                        <span class="hl com">/* Merge/add overlapped part with/to a_and_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_and_b<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>NULL<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl com">/* If there are down spans, check for the overlap in them and add to each appropriate list */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* NULL out the temporary pointers to clipped areas in down spans */</span>
                        down_a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
                        down_a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
                        down_b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                        <span class="hl com">/* Check for overlaps in the 'down spans' of span 'a' &amp; 'b' */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_clip_spans</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,&amp;</span>down_a_not_b<span class="hl opt">,&amp;</span>down_a_and_b<span class="hl opt">,&amp;</span>down_b_not_a<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCLIP<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't clip hyperslab information&quot;</span><span class="hl opt">)</span>

                        <span class="hl com">/* Check for additions to the a_not_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_a_not_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to a_not_b list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_not_b<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_a_not_b<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_a_not_b<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                        <span class="hl com">/* Check for additions to the a_and_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_a_and_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to a_and_b list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_and_b<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_a_and_b<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_a_and_b<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                        <span class="hl com">/* Check for additions to the b_not_a list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to b_not_a list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_b_not_a<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_b_not_a<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_b_not_a<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Check if there is actually an upper part of span 'b' to split off */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                        <span class="hl com">/* Split off upper part of span 'b' at upper span of span 'a' */</span>

                        <span class="hl com">/* Allocate new span node for upper part of spans 'a' */</span>
                        <span class="hl kwa">if</span><span class="hl opt">((</span>tmp_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                        <span class="hl com">/* And advance span 'a' */</span>
                        <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>

                        <span class="hl com">/* Make upper part of span 'b' the new span 'b' */</span>
                        <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>tmp_span<span class="hl opt">);</span>
                        recover_b<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* Advance both span 'a' &amp; span 'b' */</span>
                        <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                        <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl com">/* Check if span 'a' overlaps only the upper bound */</span>
                <span class="hl com">/*  of span 'b' */</span>
                <span class="hl com">/*                AAAAAAAAAA             */</span>
                <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
                <span class="hl com">/*             BBBBBBBBBB                */</span>
                <span class="hl kwa">else if</span><span class="hl opt">((</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&gt;=</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&lt;=</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) &amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&gt;</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                    <span class="hl com">/* Check if there is actually a lower part of span 'b' to split off */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&gt;</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">) {</span>
                        <span class="hl com">/* Split off lower part of span 'b' at lower span of span 'a' */</span>

                        <span class="hl com">/* Merge/add lower part of span 'b' with/to b_not_a list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_b_not_a<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* Keep going, nothing to split off */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Check for overlaps between lower part of span 'a' and upper part of span 'b' */</span>

                    <span class="hl com">/* Make certain both spans either have a down span or both don't have one */</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">((</span>span_a<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">-&gt;</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">) || (</span>span_a<span class="hl opt">-&gt;</span>down <span class="hl opt">==</span> NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">-&gt;</span>down <span class="hl opt">==</span> NULL<span class="hl opt">));</span>

                    <span class="hl com">/* If there are no down spans, just add the overlapping area to the a_and_b list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
                        <span class="hl com">/* Merge/add overlapped part with/to a_and_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_and_b<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>NULL<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl com">/* If there are down spans, check for the overlap in them and add to each appropriate list */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* NULL out the temporary pointers to clipped areas in down spans */</span>
                        down_a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
                        down_a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
                        down_b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                        <span class="hl com">/* Check for overlaps in the 'down spans' of span 'a' &amp; 'b' */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_clip_spans</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,&amp;</span>down_a_not_b<span class="hl opt">,&amp;</span>down_a_and_b<span class="hl opt">,&amp;</span>down_b_not_a<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCLIP<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't clip hyperslab information&quot;</span><span class="hl opt">)</span>

                        <span class="hl com">/* Check for additions to the a_not_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_a_not_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to a_not_b list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_not_b<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_a_not_b<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_a_not_b<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                        <span class="hl com">/* Check for additions to the a_and_b list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_a_and_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to a_and_b list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_and_b<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_a_and_b<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_a_and_b<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                        <span class="hl com">/* Check for additions to the b_not_a list */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span>down_b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                            <span class="hl com">/* Merge/add overlapped part with/to b_not_a list */</span>
                            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_b_not_a<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>down_b_not_a<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                            <span class="hl com">/* Release the down span tree generated */</span>
                            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>down_b_not_a<span class="hl opt">);</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Split off upper part of span 'a' at upper span of span 'b' */</span>

                    <span class="hl com">/* Allocate new span node for upper part of span 'a' */</span>
                    <span class="hl kwa">if</span><span class="hl opt">((</span>tmp_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Make upper part of span 'a' into new span 'a' */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>tmp_span<span class="hl opt">);</span>
                    recover_a<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>

                    <span class="hl com">/* Advance span 'b' */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl com">/* span 'a' must be entirely above span 'b' */</span>
                <span class="hl com">/*                         AAAAA         */</span>
                <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
                <span class="hl com">/*             BBBBBBBBBB                */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Copy span 'b' and add to b_not_a list */</span>

                    <span class="hl com">/* Merge/add span 'b' with/to b_not_a list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_b_not_a<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Advance span 'b', leave span 'a' */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

            <span class="hl com">/* Clean up 'a' spans which haven't been covered yet */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">!=</span>NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
                <span class="hl kwa">while</span><span class="hl opt">(</span>span_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl com">/* Copy span 'a' and add to a_not_b list */</span>

                    <span class="hl com">/* Merge/add span 'a' with/to a_not_b list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_a_not_b<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Advance to the next 'a' span */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl com">/* Clean up 'b' spans which haven't been covered yet */</span>
            <span class="hl kwa">else if</span><span class="hl opt">(</span>span_a<span class="hl opt">==</span>NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                <span class="hl kwa">while</span><span class="hl opt">(</span>span_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl com">/* Copy span 'b' and add to b_not_a list */</span>

                    <span class="hl com">/* Merge/add span 'b' with/to b_not_a list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>last_b_not_a<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Advance to the next 'b' span */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_clip_spans() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_merge_spans_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Merge two hyperslab span tree together</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    H5S_hyper_span_info_t *H5S_hyper_merge_spans_helper(a_spans, b_spans)</span>
<span class="hl com">        H5S_hyper_span_info_t *a_spans; IN: First hyperslab spans to merge</span>
<span class="hl com">                                                together</span>
<span class="hl com">        H5S_hyper_span_info_t *b_spans; IN: Second hyperslab spans to merge</span>
<span class="hl com">                                                together</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Pointer to span tree containing the merged spans on success, NULL on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Merge two sets of hyperslab spans together and return the span tree from</span>
<span class="hl com">    the merged set.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> H5S_hyper_span_info_t <span class="hl opt">*</span>
<span class="hl kwd">H5S_hyper_merge_spans_helper</span> <span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>a_spans<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">*</span>b_spans<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>merged_spans<span class="hl opt">=</span>NULL<span class="hl opt">;</span> <span class="hl com">/* Pointer to the merged span tree */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>tmp_spans<span class="hl opt">;</span>   <span class="hl com">/* Pointer to temporary new span tree */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>tmp_span<span class="hl opt">;</span>         <span class="hl com">/* Pointer to temporary new span */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span_a<span class="hl opt">;</span>           <span class="hl com">/* Pointer to current span 'a' working on */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span_b<span class="hl opt">;</span>           <span class="hl com">/* Pointer to current span 'b' working on */</span>
    H5S_hyper_span_t <span class="hl opt">*</span>prev_span_merge<span class="hl opt">;</span>  <span class="hl com">/* Pointer to previous merged span */</span>
    <span class="hl kwb">unsigned</span> recover_a<span class="hl opt">,</span> recover_b<span class="hl opt">;</span>         <span class="hl com">/* Flags to indicate when to recover temporary spans */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>ret_value<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_merge_spans_helper<span class="hl opt">)</span>

    <span class="hl com">/* Make certain both 'a' &amp; 'b' spans have down span trees or neither does */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">((</span>a_spans <span class="hl opt">!=</span> NULL <span class="hl opt">&amp;&amp;</span> b_spans <span class="hl opt">!=</span> NULL<span class="hl opt">) || (</span>a_spans <span class="hl opt">==</span> NULL <span class="hl opt">&amp;&amp;</span> b_spans <span class="hl opt">==</span> NULL<span class="hl opt">));</span>

    <span class="hl com">/* Check if the span trees for the 'a' span and the 'b' span are the same */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>a_spans<span class="hl opt">,</span>b_spans<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>a_spans<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
            merged_spans<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Copy one of the span trees to return */</span>
            <span class="hl kwa">if</span><span class="hl opt">((</span>merged_spans<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_copy_span</span><span class="hl opt">(</span>a_spans<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTCOPY<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't copy hyperslab span tree&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Get the pointers to the 'a' and 'b' span lists */</span>
        span_a<span class="hl opt">=</span>a_spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
        span_b<span class="hl opt">=</span>b_spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>

        <span class="hl com">/* Set the pointer to the previous spans */</span>
        prev_span_merge<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

        <span class="hl com">/* No spans to recover yet */</span>
        recover_a<span class="hl opt">=</span>recover_b<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

        <span class="hl com">/* Work through the list of spans in the new list */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span_a<span class="hl opt">!=</span>NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
            <span class="hl com">/* Check if the 'a' span is completely before 'b' span */</span>
            <span class="hl com">/*    AAAAAAA                            */</span>
            <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
            <span class="hl com">/*             BBBBBBBBBB                */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">) {</span>
                <span class="hl com">/* Merge/add span 'a' with/to the merged spans */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                <span class="hl com">/* Advance span 'a' */</span>
                <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl com">/* Check if span 'a' overlaps only the lower bound */</span>
            <span class="hl com">/*  of span 'b', up to the upper bound of span 'b' */</span>
            <span class="hl com">/*    AAAAAAAAAAAA                       */</span>
            <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
            <span class="hl com">/*             BBBBBBBBBB                */</span>
            <span class="hl kwa">else if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp; (</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&gt;=</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;=</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">)) {</span>
                <span class="hl com">/* Check if span 'a' and span 'b' down spans are equal */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
                    <span class="hl com">/* Merge/add copy of span 'a' with/to merged spans */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Merge/add lower part of span 'a' with/to merged spans */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Get merged span tree for overlapped section */</span>
                    tmp_spans<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_merge_spans_helper</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>

                    <span class="hl com">/* Merge/add overlapped section to merged spans */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>tmp_spans<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Release merged span tree for overlapped section */</span>
                    <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>tmp_spans<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                <span class="hl com">/* Check if there is an upper part of span 'b' */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                    <span class="hl com">/* Copy upper part of span 'b' as new span 'b' */</span>

                    <span class="hl com">/* Allocate new span node to append to list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">((</span>tmp_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Advance span 'a' */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>

                    <span class="hl com">/* Set new span 'b' to tmp_span */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>tmp_span<span class="hl opt">);</span>
                    recover_b<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Advance both span 'a' &amp; 'b' */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl com">/* Check if span 'a' overlaps the lower &amp; upper bound */</span>
            <span class="hl com">/*  of span 'b' */</span>
            <span class="hl com">/*    AAAAAAAAAAAAAAAAAAAAA              */</span>
            <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
            <span class="hl com">/*             BBBBBBBBBB                */</span>
            <span class="hl kwa">else if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&gt;</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                <span class="hl com">/* Check if span 'a' and span 'b' down spans are equal */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
                    <span class="hl com">/* Merge/add copy of lower &amp; middle parts of span 'a' to merged spans */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Merge/add lower part of span 'a' to merged spans */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Get merged span tree for overlapped section */</span>
                    tmp_spans<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_merge_spans_helper</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>

                    <span class="hl com">/* Merge/add overlapped section to merged spans */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>tmp_spans<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Release merged span tree for overlapped section */</span>
                    <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>tmp_spans<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                <span class="hl com">/* Copy upper part of span 'a' as new span 'a' (remember to free) */</span>

                <span class="hl com">/* Allocate new span node to append to list */</span>
                <span class="hl kwa">if</span><span class="hl opt">((</span>tmp_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                <span class="hl com">/* Set new span 'a' to tmp_span */</span>
                <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>tmp_span<span class="hl opt">);</span>
                recover_a<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>

                <span class="hl com">/* Advance span 'b' */</span>
                <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl com">/* Check if span 'a' is entirely within span 'b' */</span>
            <span class="hl com">/*                AAAAA                  */</span>
            <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
            <span class="hl com">/*             BBBBBBBBBB                */</span>
            <span class="hl kwa">else if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&gt;=</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;=</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                <span class="hl com">/* Check if span 'a' and span 'b' down spans are equal */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
                    <span class="hl com">/* Merge/add copy of lower &amp; middle parts of span 'b' to merged spans */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Check if there is a lower part of span 'b' */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&gt;</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">) {</span>
                        <span class="hl com">/* Merge/add lower part of span 'b' to merged spans */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* No lower part of span 'b' , keep going... */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Get merged span tree for overlapped section */</span>
                    tmp_spans<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_merge_spans_helper</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>

                    <span class="hl com">/* Merge/add overlapped section to merged spans */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>tmp_spans<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Release merged span tree for overlapped section */</span>
                    <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>tmp_spans<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                <span class="hl com">/* Check if there is an upper part of span 'b' */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&lt;</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                    <span class="hl com">/* Copy upper part of span 'b' as new span 'b' (remember to free) */</span>

                    <span class="hl com">/* Allocate new span node to append to list */</span>
                    <span class="hl kwa">if</span><span class="hl opt">((</span>tmp_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Advance span 'a' */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>

                    <span class="hl com">/* Set new span 'b' to tmp_span */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>tmp_span<span class="hl opt">);</span>
                    recover_b<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Advance both spans */</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                    <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl com">/* Check if span 'a' overlaps only the upper bound */</span>
            <span class="hl com">/*  of span 'b' */</span>
            <span class="hl com">/*                AAAAAAAAAA             */</span>
            <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
            <span class="hl com">/*             BBBBBBBBBB                */</span>
            <span class="hl kwa">else if</span><span class="hl opt">((</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&gt;=</span>span_b<span class="hl opt">-&gt;</span>low <span class="hl opt">&amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&lt;=</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) &amp;&amp;</span> span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">&gt;</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">) {</span>
                <span class="hl com">/* Check if span 'a' and span 'b' down spans are equal */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_cmp_spans</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">)==</span>TRUE<span class="hl opt">) {</span>
                    <span class="hl com">/* Merge/add copy of span 'b' to merged spans if so */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl com">/* Check if there is a lower part of span 'b' */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">&gt;</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">) {</span>
                        <span class="hl com">/* Merge/add lower part of span 'b' to merged spans */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                    <span class="hl kwa">else</span> <span class="hl opt">{</span>
                        <span class="hl com">/* No lower part of span 'b' , keep going... */</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                    <span class="hl com">/* Get merged span tree for overlapped section */</span>
                    tmp_spans<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_merge_spans_helper</span><span class="hl opt">(</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>

                    <span class="hl com">/* Merge/add overlapped section to merged spans */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>tmp_spans<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Release merged span tree for overlapped section */</span>
                    <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>tmp_spans<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

                <span class="hl com">/* Copy upper part of span 'a' as new span 'a' */</span>

                <span class="hl com">/* Allocate new span node to append to list */</span>
                <span class="hl kwa">if</span><span class="hl opt">((</span>tmp_span <span class="hl opt">=</span> <span class="hl kwd">H5S_hyper_new_span</span><span class="hl opt">(</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                <span class="hl com">/* Set new span 'a' to tmp_span */</span>
                <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>tmp_span<span class="hl opt">);</span>
                recover_a<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>

                <span class="hl com">/* Advance span 'b' */</span>
                <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl com">/* Span 'a' must be entirely above span 'b' */</span>
            <span class="hl com">/*                         AAAAA         */</span>
            <span class="hl com">/* &lt;-----------------------------------&gt; */</span>
            <span class="hl com">/*             BBBBBBBBBB                */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl com">/* Merge/add span 'b' with the merged spans */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                <span class="hl com">/* Advance span 'b' */</span>
                <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

        <span class="hl com">/* Clean up 'a' spans which haven't been added to the list of merged spans */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">!=</span>NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>span_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                <span class="hl com">/* Merge/add all 'a' spans into the merged spans */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                <span class="hl com">/* Advance to next 'a' span, until all processed */</span>
                <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_a<span class="hl opt">,&amp;</span>span_a<span class="hl opt">,</span>span_a<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Clean up 'b' spans which haven't been added to the list of merged spans */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>span_a<span class="hl opt">==</span>NULL <span class="hl opt">&amp;&amp;</span> span_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
            <span class="hl kwa">while</span><span class="hl opt">(</span>span_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                <span class="hl com">/* Merge/add all 'b' spans into the merged spans */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_append_span</span><span class="hl opt">(&amp;</span>prev_span_merge<span class="hl opt">,&amp;</span>merged_spans<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>low<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>high<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>down<span class="hl opt">,</span>NULL<span class="hl opt">)==</span>FAIL<span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

                <span class="hl com">/* Advance to next 'b' span, until all processed */</span>
                <span class="hl kwd">H5S_hyper_recover_span</span><span class="hl opt">(&amp;</span>recover_b<span class="hl opt">,&amp;</span>span_b<span class="hl opt">,</span>span_b<span class="hl opt">-&gt;</span>next<span class="hl opt">);</span>
            <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl com">/* Set return value */</span>
    ret_value <span class="hl opt">=</span> merged_spans<span class="hl opt">;</span>

done<span class="hl opt">:</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>ret_value <span class="hl opt">==</span> NULL<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>merged_spans<span class="hl opt">)</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>merged_spans<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HDONE_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release merged hyperslab spans&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_merge_spans_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_merge_spans</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Merge new hyperslab spans to existing hyperslab selection</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_merge_spans(space, new_spans, can_own)</span>
<span class="hl com">        H5S_t *space;             IN: Dataspace to add new spans to hyperslab</span>
<span class="hl com">                                        selection.</span>
<span class="hl com">        H5S_hyper_span_t *new_spans;    IN: Span tree of new spans to add to</span>
<span class="hl com">                                            hyperslab selection</span>
<span class="hl com">        hbool_t can_own;        IN: Flag to indicate that it is OK to point</span>
<span class="hl com">                                    directly to the new spans, instead of</span>
<span class="hl com">                                    copying them.</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Add a set of hyperslab spans to an existing hyperslab selection.  The</span>
<span class="hl com">    new spans are required to be non-overlapping with the existing spans in</span>
<span class="hl com">    the dataspace's current hyperslab selection.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_merge_spans</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">*</span>new_spans<span class="hl opt">,</span> hbool_t can_own<span class="hl opt">)</span>
<span class="hl opt">{</span>
    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_merge_spans<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>new_spans<span class="hl opt">);</span>

    <span class="hl com">/* If this is the first span tree in the hyperslab selection, just use it */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>can_own<span class="hl opt">)</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>new_spans<span class="hl opt">;</span>
        <span class="hl kwa">else</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_copy_span</span><span class="hl opt">(</span>new_spans<span class="hl opt">);</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        H5S_hyper_span_info_t <span class="hl opt">*</span>merged_spans<span class="hl opt">;</span>

        <span class="hl com">/* Get the merged spans */</span>
        merged_spans<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_merge_spans_helper</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span> new_spans<span class="hl opt">);</span>

        <span class="hl com">/* Sanity checking since we started with some spans, we should still have some after the merge */</span>
        <span class="hl kwd">HDassert</span><span class="hl opt">(</span>merged_spans<span class="hl opt">);</span>

        <span class="hl com">/* Free the previous spans */</span>
        <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>

        <span class="hl com">/* Point to the new merged spans */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>merged_spans<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_merge_spans() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_spans_nelem</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Count the number of elements in a span tree</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    hsize_t H5S_hyper_spans_nelem(spans)</span>
<span class="hl com">        const H5S_hyper_span_info_t *spans; IN: Hyperslan span tree to count elements of</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Number of elements in span tree on success; negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Counts the number of elements described by the spans in a span tree.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> hsize_t
<span class="hl kwd">H5S_hyper_spans_nelem</span> <span class="hl opt">(</span>H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">;</span>     <span class="hl com">/* Hyperslab span */</span>
    hsize_t ret_value<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_spans_nelem<span class="hl opt">)</span>

    <span class="hl com">/* Count the number of elements in the span tree */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>spans<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
        ret_value<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        span<span class="hl opt">=</span>spans<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
        ret_value<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
            <span class="hl com">/* If there are down spans, multiply the size of this span by the total down span elements */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">!=</span>NULL<span class="hl opt">)</span>
                ret_value<span class="hl opt">+=</span>span<span class="hl opt">-&gt;</span>nelem<span class="hl opt">*</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">);</span>
            <span class="hl com">/* If there are no down spans, just count the elements in this span */</span>
            <span class="hl kwa">else</span>
                ret_value<span class="hl opt">+=</span>span<span class="hl opt">-&gt;</span>nelem<span class="hl opt">;</span>

            <span class="hl com">/* Advance to next span */</span>
            span<span class="hl opt">=</span>span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_spans_nelem() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_make_spans</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Create a span tree</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    H5S_hyper_span_t *H5S_hyper_make_spans(rank, start, stride, count, block)</span>
<span class="hl com">        unsigned rank;               IN: # of dimensions of the space</span>
<span class="hl com">        const hsize_t *start;    IN: Starting location of the hyperslabs</span>
<span class="hl com">        const hsize_t *stride;    IN: Stride from the beginning of one block to</span>
<span class="hl com">                                        the next</span>
<span class="hl com">        const hsize_t *count;     IN: Number of blocks</span>
<span class="hl com">        const hsize_t *block;     IN: Size of hyperslab block</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Pointer to new span tree on success, NULL on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Generates a new span tree for the hyperslab parameters specified.</span>
<span class="hl com">    Each span tree has a list of the elements spanned in each dimension, with</span>
<span class="hl com">    each span node containing a pointer to the list of spans in the next</span>
<span class="hl com">    dimension down.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> H5S_hyper_span_info_t <span class="hl opt">*</span>
<span class="hl kwd">H5S_hyper_make_spans</span><span class="hl opt">(</span><span class="hl kwb">unsigned</span> rank<span class="hl opt">,</span> <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>start<span class="hl opt">,</span> <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>stride<span class="hl opt">,</span>
    <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>count<span class="hl opt">,</span> <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>block<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>down <span class="hl opt">=</span> NULL<span class="hl opt">;</span>     <span class="hl com">/* Pointer to spans in next dimension down */</span>
    H5S_hyper_span_t      <span class="hl opt">*</span>last_span<span class="hl opt">;</span>       <span class="hl com">/* Current position in hyperslab span list */</span>
    H5S_hyper_span_t      <span class="hl opt">*</span>head <span class="hl opt">=</span> NULL<span class="hl opt">;</span>     <span class="hl com">/* Head of new hyperslab span list */</span>
    hsize_t                stride_iter<span class="hl opt">;</span>     <span class="hl com">/* Iterator over the stride values */</span>
    <span class="hl kwb">int</span>                    i<span class="hl opt">;</span>               <span class="hl com">/* Counters */</span>
    <span class="hl kwb">unsigned</span>               u<span class="hl opt">;</span>               <span class="hl com">/* Counters */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>ret_value<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_make_spans<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>rank <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>stride<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>count<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>block<span class="hl opt">);</span>

    <span class="hl com">/* Start creating spans in fastest changing dimension */</span>
    <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)(</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">);</span> i <span class="hl opt">&gt;=</span> <span class="hl num">0</span><span class="hl opt">;</span> i<span class="hl opt">--) {</span>

        <span class="hl com">/* Sanity check */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl num">0</span> <span class="hl opt">==</span> count<span class="hl opt">[</span>i<span class="hl opt">])</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_BADVALUE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;count == 0 is invalid&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Start a new list in this dimension */</span>
        head <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
        last_span <span class="hl opt">=</span> NULL<span class="hl opt">;</span>

        <span class="hl com">/* Generate all the span segments for this dimension */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">,</span> stride_iter <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> count<span class="hl opt">[</span>i<span class="hl opt">];</span> u<span class="hl opt">++,</span> stride_iter <span class="hl opt">+=</span> stride<span class="hl opt">[</span>i<span class="hl opt">]) {</span>
            H5S_hyper_span_t      <span class="hl opt">*</span>span<span class="hl opt">;</span>            <span class="hl com">/* New hyperslab span */</span>

            <span class="hl com">/* Allocate a span node */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>span <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_t<span class="hl opt">)))</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTALLOC<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Set the span's basic information */</span>
            span<span class="hl opt">-&gt;</span>low <span class="hl opt">=</span> start<span class="hl opt">[</span>i<span class="hl opt">] +</span> stride_iter<span class="hl opt">;</span>
            span<span class="hl opt">-&gt;</span>high <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>low <span class="hl opt">+ (</span>block<span class="hl opt">[</span>i<span class="hl opt">] -</span> <span class="hl num">1</span><span class="hl opt">);</span>
            span<span class="hl opt">-&gt;</span>nelem <span class="hl opt">=</span> block<span class="hl opt">[</span>i<span class="hl opt">];</span>
            span<span class="hl opt">-&gt;</span>pstride <span class="hl opt">=</span> stride<span class="hl opt">[</span>i<span class="hl opt">];</span>
            span<span class="hl opt">-&gt;</span>next <span class="hl opt">=</span> NULL<span class="hl opt">;</span>

            <span class="hl com">/* Append to the list of spans in this dimension */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>head <span class="hl opt">==</span> NULL<span class="hl opt">)</span>
                head <span class="hl opt">=</span> span<span class="hl opt">;</span>
            <span class="hl kwa">else</span>
                last_span<span class="hl opt">-&gt;</span>next <span class="hl opt">=</span> span<span class="hl opt">;</span>

            <span class="hl com">/* Move current pointer */</span>
            last_span <span class="hl opt">=</span> span<span class="hl opt">;</span>

            <span class="hl com">/* Set the information for the next dimension down's spans, if appropriate */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>down <span class="hl opt">!=</span> NULL<span class="hl opt">) {</span>
                span<span class="hl opt">-&gt;</span>down <span class="hl opt">=</span> down<span class="hl opt">;</span>
                down<span class="hl opt">-&gt;</span>count<span class="hl opt">++;</span>  <span class="hl com">/* Increment reference count for shared span */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                span<span class="hl opt">-&gt;</span>down <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* Allocate a span info node */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>down <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">)))</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTALLOC<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Set the reference count */</span>
        down<span class="hl opt">-&gt;</span>count <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

        <span class="hl com">/* Reset the scratch pad space */</span>
        down<span class="hl opt">-&gt;</span>scratch <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

        <span class="hl com">/* Keep the pointer to the next dimension down's completed list */</span>
        down<span class="hl opt">-&gt;</span>head <span class="hl opt">=</span> head<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

    <span class="hl com">/* Indicate that there is a pointer to this tree */</span>
    down<span class="hl opt">-&gt;</span>count <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>

    <span class="hl com">/* Success!  Return the head of the list in the slowest changing dimension */</span>
    ret_value <span class="hl opt">=</span> down<span class="hl opt">;</span>

done<span class="hl opt">:</span>
    <span class="hl com">/* cleanup if error (ret_value will be NULL) */</span>
    <span class="hl kwa">if</span><span class="hl opt">(!</span>ret_value<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>head <span class="hl opt">||</span> down<span class="hl opt">) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>head <span class="hl opt">&amp;&amp;</span> down<span class="hl opt">)</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>down<span class="hl opt">-&gt;</span>head <span class="hl opt">!=</span> head<span class="hl opt">)</span>
                    down <span class="hl opt">=</span> NULL<span class="hl opt">;</span>

            <span class="hl kwa">do</span> <span class="hl opt">{</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>down<span class="hl opt">) {</span>
                    head <span class="hl opt">=</span> down<span class="hl opt">-&gt;</span>head<span class="hl opt">;</span>
                    down <span class="hl opt">=</span> <span class="hl kwd">H5FL_FREE</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">,</span> down<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                down <span class="hl opt">=</span> head<span class="hl opt">-&gt;</span>down<span class="hl opt">;</span>

                <span class="hl kwa">while</span><span class="hl opt">(</span>head<span class="hl opt">) {</span>
                    last_span <span class="hl opt">=</span> head<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
                    head <span class="hl opt">=</span> <span class="hl kwd">H5FL_FREE</span><span class="hl opt">(</span>H5S_hyper_span_t<span class="hl opt">,</span> head<span class="hl opt">);</span>
                    head <span class="hl opt">=</span> last_span<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end while */</span>
            <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>down<span class="hl opt">);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_make_spans() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_rebuild_helper</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Helper routine to rebuild optimized hyperslab information if possible.</span>
<span class="hl com">    (It can be recovered with regular selection)</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_rebuild_helper(space)</span>
<span class="hl com">        const H5S_hyper_span_t *span;   IN: Portion of span tree to check</span>
<span class="hl com">        H5S_hyper_dim_t span_slab[];    OUT: Rebuilt section of hyperslab description</span>
<span class="hl com">        unsigned rank;                  IN: Current dimension to work on</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    &gt;=0 on success, &lt;0 on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Examine the span tree for a hyperslab selection and rebuild</span>
<span class="hl com">    the start/stride/count/block information for the selection, if possible.</span>
<span class="hl com"></span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com">    To be able to recover the optimized information, the span tree must conform</span>
<span class="hl com">    to span tree able to be generated from a single H5S_SELECT_SET operation.</span>
<span class="hl com"></span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">    KY, 2005/9/22</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> hbool_t
<span class="hl kwd">H5S_hyper_rebuild_helper</span><span class="hl opt">(</span><span class="hl kwb">const</span> H5S_hyper_span_t <span class="hl opt">*</span>span<span class="hl opt">,</span> H5S_hyper_dim_t span_slab_info<span class="hl opt">[],</span>
    <span class="hl kwb">unsigned</span> rank<span class="hl opt">)</span>
<span class="hl opt">{</span>
    hsize_t curr_stride<span class="hl opt">,</span> next_stride<span class="hl opt">;</span>
    hsize_t curr_block<span class="hl opt">,</span> next_block<span class="hl opt">;</span>
    hsize_t curr_start<span class="hl opt">;</span>
    hsize_t curr_low<span class="hl opt">;</span>
    <span class="hl kwb">size_t</span> outcount<span class="hl opt">;</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>
    H5S_hyper_dim_t      canon_down_span_slab_info<span class="hl opt">[</span>H5S_MAX_RANK<span class="hl opt">];</span>
    hbool_t ret_value <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_rebuild_helper<span class="hl opt">)</span>

    <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">) {</span>
        <span class="hl com">/* Initialization */</span>
        curr_stride     <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
        curr_block      <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
        outcount        <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>
        curr_low        <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span>

        <span class="hl com">/* Get &quot;canonical&quot; down span information */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">) {</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">);</span>

            <span class="hl com">/* Go to the next down span and check whether the selection can be rebuilt.*/</span>
            <span class="hl kwa">if</span><span class="hl opt">(!</span><span class="hl kwd">H5S_hyper_rebuild_helper</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">,</span> span_slab_info<span class="hl opt">,</span> rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">))</span>
                <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>

            <span class="hl kwd">HDmemcpy</span><span class="hl opt">(</span>canon_down_span_slab_info<span class="hl opt">,</span> span_slab_info<span class="hl opt">,</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>H5S_hyper_dim_t<span class="hl opt">) *</span> rank<span class="hl opt">);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

        <span class="hl com">/* Assign the initial starting point &amp; block size */</span>
        curr_start <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>
        curr_block <span class="hl opt">= (</span>span<span class="hl opt">-&gt;</span>high <span class="hl opt">-</span> span<span class="hl opt">-&gt;</span>low<span class="hl opt">) +</span> <span class="hl num">1</span><span class="hl opt">;</span>

        <span class="hl com">/* Loop the span */</span>
        <span class="hl kwa">while</span><span class="hl opt">(</span>span<span class="hl opt">) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>outcount <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">) {</span>
                    H5S_hyper_dim_t      <span class="hl opt">*</span>curr_down_span_slab_info<span class="hl opt">;</span>

                    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">);</span>

                    <span class="hl com">/* Go to the next down span and check whether the selection can be rebuilt.*/</span>
                    <span class="hl kwa">if</span><span class="hl opt">(!</span><span class="hl kwd">H5S_hyper_rebuild_helper</span><span class="hl opt">(</span>span<span class="hl opt">-&gt;</span>down<span class="hl opt">-&gt;</span>head<span class="hl opt">,</span> span_slab_info<span class="hl opt">,</span> rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">))</span>
                        <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>

                    <span class="hl com">/* Compare the slab information of the adjacent spans in the down span tree.</span>
<span class="hl com">                       We have to compare all the sub-tree slab information with the canon_down_span_slab_info.*/</span>

                    <span class="hl kwa">for</span><span class="hl opt">(</span> u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span> u<span class="hl opt">++) {</span>
                       curr_down_span_slab_info <span class="hl opt">= &amp;</span>span_slab_info<span class="hl opt">[</span>u<span class="hl opt">];</span>

                       <span class="hl kwa">if</span><span class="hl opt">(</span>curr_down_span_slab_info<span class="hl opt">-&gt;</span>count <span class="hl opt">&gt;</span> <span class="hl num">0</span> <span class="hl opt">&amp;&amp;</span> canon_down_span_slab_info<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">&gt;</span> <span class="hl num">0</span><span class="hl opt">) {</span>
                          <span class="hl kwa">if</span><span class="hl opt">(</span>curr_down_span_slab_info<span class="hl opt">-&gt;</span>start <span class="hl opt">!=</span> canon_down_span_slab_info<span class="hl opt">[</span>u<span class="hl opt">].</span>start
                              <span class="hl opt">||</span> curr_down_span_slab_info<span class="hl opt">-&gt;</span>stride <span class="hl opt">!=</span> canon_down_span_slab_info<span class="hl opt">[</span>u<span class="hl opt">].</span>stride
                              <span class="hl opt">||</span> curr_down_span_slab_info<span class="hl opt">-&gt;</span>block <span class="hl opt">!=</span> canon_down_span_slab_info<span class="hl opt">[</span>u<span class="hl opt">].</span>block
                              <span class="hl opt">||</span> curr_down_span_slab_info<span class="hl opt">-&gt;</span>count <span class="hl opt">!=</span> canon_down_span_slab_info<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">)</span>
                          <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>
                       <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                       <span class="hl kwa">else if</span> <span class="hl opt">(!((</span>curr_down_span_slab_info<span class="hl opt">-&gt;</span>count <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">) &amp;&amp; (</span>canon_down_span_slab_info<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">)))</span>
                          <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>
                    <span class="hl opt">}</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

            <span class="hl com">/* Obtain values for stride and block */</span>
            next_stride  <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>low  <span class="hl opt">-</span> curr_low<span class="hl opt">;</span>
            next_block   <span class="hl opt">= (</span>span<span class="hl opt">-&gt;</span>high <span class="hl opt">-</span> span<span class="hl opt">-&gt;</span>low<span class="hl opt">) +</span> <span class="hl num">1</span><span class="hl opt">;</span>

            <span class="hl com">/* Compare stride and block in this span, to compare stride,</span>
<span class="hl com">             * three spans are needed. Ignore the first two spans.</span>
<span class="hl com">             */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>outcount  <span class="hl opt">&gt;</span> <span class="hl num">1</span>  <span class="hl opt">&amp;&amp;</span> curr_stride <span class="hl opt">!=</span> next_stride<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>outcount <span class="hl opt">!=</span> <span class="hl num">0</span>  <span class="hl opt">&amp;&amp;</span> next_block  <span class="hl opt">!=</span> curr_block<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>

            <span class="hl com">/* Keep the isolated stride to be 1 */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>outcount <span class="hl opt">!=</span> <span class="hl num">0</span><span class="hl opt">)</span>
                curr_stride <span class="hl opt">=</span> next_stride<span class="hl opt">;</span>

            <span class="hl com">/* Keep current starting point */</span>
            curr_low    <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>low<span class="hl opt">;</span>

            <span class="hl com">/* Advance to next span */</span>
            span <span class="hl opt">=</span> span<span class="hl opt">-&gt;</span>next<span class="hl opt">;</span>
            outcount<span class="hl opt">++;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end while */</span>

        <span class="hl com">/* Save the span information. */</span>
        span_slab_info<span class="hl opt">[</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">].</span>start  <span class="hl opt">=</span> curr_start<span class="hl opt">;</span>
        span_slab_info<span class="hl opt">[</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">].</span>count  <span class="hl opt">=</span> outcount<span class="hl opt">;</span>
        span_slab_info<span class="hl opt">[</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">].</span>block  <span class="hl opt">=</span> curr_block<span class="hl opt">;</span>
        span_slab_info<span class="hl opt">[</span>rank <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">].</span>stride <span class="hl opt">=</span> curr_stride<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* end H5S_hyper_rebuild_helper() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_rebuild</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Rebuild optimized hyperslab information if possible.</span>
<span class="hl com">    (It can be recovered with regular selection)</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_rebuild(space)</span>
<span class="hl com">        const H5S_t *space;     IN: Dataspace to check</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    &gt;=0 on success, &lt;0 on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Examine the span tree for a hyperslab selection and rebuild</span>
<span class="hl com">    the start/stride/count/block information for the selection, if possible.</span>
<span class="hl com"></span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com">    To be able to recover the optimized information, the span tree must conform</span>
<span class="hl com">    to span tree able to be generated from a single H5S_SELECT_SET operation.</span>
<span class="hl com"></span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com"></span>
<span class="hl com">    This routine is the optimization of the old version. The previous version</span>
<span class="hl com">    can only detect a singluar selection. This version is general enough to</span>
<span class="hl com">    detect any regular selection.</span>
<span class="hl com">    KY, 2005/9/22</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> htri_t
<span class="hl kwd">H5S_hyper_rebuild</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_dim_t top_span_slab_info<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>
    H5S_hyper_dim_t <span class="hl opt">*</span>diminfo<span class="hl opt">;</span>
    H5S_hyper_dim_t <span class="hl opt">*</span>app_diminfo<span class="hl opt">;</span>
    <span class="hl kwb">unsigned</span> rank<span class="hl opt">,</span> curr_dim<span class="hl opt">;</span>
    htri_t ret_value <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>      <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT_NOFUNC</span><span class="hl opt">(</span>H5S_hyper_rebuild<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">);</span>

    <span class="hl com">/* Check the rank of space */</span>
    rank <span class="hl opt">=</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span>

    <span class="hl com">/* Check whether the slab can be rebuilt. Only regular selection can be rebuilt. If yes, fill in correct values.*/</span>
    <span class="hl kwa">if</span><span class="hl opt">(!</span><span class="hl kwd">H5S_hyper_rebuild_helper</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">-&gt;</span>head<span class="hl opt">,</span> top_span_slab_info<span class="hl opt">,</span> rank<span class="hl opt">)) {</span>
        <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>FALSE<span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        diminfo<span class="hl opt">=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">;</span>
        app_diminfo<span class="hl opt">=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">;</span>

        <span class="hl kwa">for</span><span class="hl opt">(</span>curr_dim <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> curr_dim <span class="hl opt">&lt;</span> rank<span class="hl opt">;</span> curr_dim<span class="hl opt">++) {</span>

            app_diminfo<span class="hl opt">[(</span>rank <span class="hl opt">-</span> curr_dim<span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">].</span>start  <span class="hl opt">=</span> diminfo<span class="hl opt">[(</span>rank <span class="hl opt">-</span> curr_dim<span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">].</span>start <span class="hl opt">=</span> top_span_slab_info<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>start<span class="hl opt">;</span>
            app_diminfo<span class="hl opt">[(</span>rank <span class="hl opt">-</span> curr_dim<span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">].</span>stride <span class="hl opt">=</span> diminfo<span class="hl opt">[(</span>rank <span class="hl opt">-</span> curr_dim<span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">].</span>stride <span class="hl opt">=</span> top_span_slab_info<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>stride<span class="hl opt">;</span>
            app_diminfo<span class="hl opt">[(</span>rank <span class="hl opt">-</span> curr_dim<span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">].</span>count  <span class="hl opt">=</span> diminfo<span class="hl opt">[(</span>rank <span class="hl opt">-</span> curr_dim<span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">].</span>count <span class="hl opt">=</span> top_span_slab_info<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>count<span class="hl opt">;</span>
            app_diminfo<span class="hl opt">[(</span>rank <span class="hl opt">-</span> curr_dim<span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">].</span>block  <span class="hl opt">=</span> diminfo<span class="hl opt">[(</span>rank <span class="hl opt">-</span> curr_dim<span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">].</span>block <span class="hl opt">=</span> top_span_slab_info<span class="hl opt">[</span>curr_dim<span class="hl opt">].</span>block<span class="hl opt">;</span>

        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_rebuild() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5S_hyper_generate_spans</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Create span tree for a regular hyperslab selection</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5S_hyper_generate_spans(space)</span>
<span class="hl com">        H5S_t *space;           IN/OUT: Pointer to dataspace</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success, negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Create a span tree representation of a regular hyperslab selection and</span>
<span class="hl com">    add it to the information for the hyperslab selection.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_hyper_generate_spans</span><span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">)</span>
<span class="hl opt">{</span>
    hsize_t tmp_start<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Temporary start information */</span>
    hsize_t tmp_stride<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Temporary stride information */</span>
    hsize_t tmp_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary count information */</span>
    hsize_t tmp_block<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary block information */</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                             <span class="hl com">/* Counter */</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_hyper_generate_spans<span class="hl opt">)</span>

    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">) ==</span> H5S_SEL_HYPERSLABS<span class="hl opt">);</span>

    <span class="hl com">/* Get the diminfo */</span>
    <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
        tmp_start<span class="hl opt">[</span>u<span class="hl opt">]=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start<span class="hl opt">;</span>
        tmp_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride<span class="hl opt">;</span>
        tmp_count<span class="hl opt">[</span>u<span class="hl opt">]=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count<span class="hl opt">;</span>
        tmp_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

    <span class="hl com">/* Build the hyperslab information also */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_generate_hyperslab</span> <span class="hl opt">(</span>space<span class="hl opt">,</span> H5S_SELECT_SET<span class="hl opt">,</span> tmp_start<span class="hl opt">,</span> tmp_stride<span class="hl opt">,</span> tmp_count<span class="hl opt">,</span> tmp_block<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't generate hyperslabs&quot;</span><span class="hl opt">)</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* H5S_hyper_generate_spans() */</span>

<span class="hl ppc">#ifndef NEW_HYPERSLAB_API</span>

<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_generate_hyperlab</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Generate hyperslab information from H5S_select_hyperslab()</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	Non-negative on success/Negative on failure</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol (split from HS_select_hyperslab()).</span>
<span class="hl com"> *              Tuesday, September 12, 2000</span>
<span class="hl com"> *</span>
<span class="hl com"> * Modifications:</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_generate_hyperslab</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> H5S_seloper_t op<span class="hl opt">,</span>
		      <span class="hl kwb">const</span> hsize_t start<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t stride<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t count<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t block<span class="hl opt">[])</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>new_spans<span class="hl opt">=</span>NULL<span class="hl opt">;</span>  <span class="hl com">/* Span tree for new hyperslab */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>    <span class="hl com">/* Span tree for hyperslab spans in old span tree and not in new span tree */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>    <span class="hl com">/* Span tree for hyperslab spans in both old and new span trees */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>    <span class="hl com">/* Span tree for hyperslab spans in new span tree and not in old span tree */</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_generate_hyperslab<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>op <span class="hl opt">&gt;</span> H5S_SELECT_NOOP <span class="hl opt">&amp;&amp;</span> op <span class="hl opt">&lt;</span> H5S_SELECT_INVALID<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>stride<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>count<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>block<span class="hl opt">);</span>

    <span class="hl com">/* Generate span tree for new hyperslab information */</span>
    <span class="hl kwa">if</span><span class="hl opt">((</span>new_spans<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_make_spans</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">,</span>start<span class="hl opt">,</span>stride<span class="hl opt">,</span>count<span class="hl opt">,</span>block<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't create hyperslab information&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Generate list of blocks to add/remove based on selection operation */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>op<span class="hl opt">==</span>H5S_SELECT_SET<span class="hl opt">) {</span>
        <span class="hl com">/* Add new spans to current selection */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>space<span class="hl opt">,</span>new_spans<span class="hl opt">,</span>TRUE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Set the number of elements in current selection */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>new_spans<span class="hl opt">);</span>

        <span class="hl com">/* Indicate that the new_spans are owned */</span>
        new_spans<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        hbool_t updated_spans <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>  <span class="hl com">/* Whether the spans in the selection were modified */</span>

        <span class="hl com">/* Generate lists of spans which overlap and don't overlap */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_clip_spans</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">,</span>new_spans<span class="hl opt">,&amp;</span>a_not_b<span class="hl opt">,&amp;</span>a_and_b<span class="hl opt">,&amp;</span>b_not_a<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCLIP<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't clip hyperslab information&quot;</span><span class="hl opt">)</span>

        <span class="hl kwa">switch</span><span class="hl opt">(</span>op<span class="hl opt">) {</span>
            <span class="hl kwa">case</span> H5S_SELECT_OR<span class="hl opt">:</span>
                <span class="hl com">/* Add any new spans from b_not_a to current selection */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>space<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>FALSE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">+=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>b_not_a<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">case</span> H5S_SELECT_AND<span class="hl opt">:</span>
                <span class="hl com">/* Free the current selection */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release hyperslab spans&quot;</span><span class="hl opt">)</span>
                space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                <span class="hl com">/* Reset the number of items in selection */</span>
                space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

                <span class="hl com">/* Check if there are any overlapped selections */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>a_and_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>space<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>TRUE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>a_and_b<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the a_and_b spans are owned */</span>
                    a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">case</span> H5S_SELECT_XOR<span class="hl opt">:</span>
                <span class="hl com">/* Free the current selection */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release hyperslab spans&quot;</span><span class="hl opt">)</span>
                space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                <span class="hl com">/* Reset the number of items in selection */</span>
                space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

                <span class="hl com">/* Check if there are any non-overlapped selections */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>a_not_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>space<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>FALSE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>a_not_b<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>space<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>FALSE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">+=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>b_not_a<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">case</span> H5S_SELECT_NOTB<span class="hl opt">:</span>
                <span class="hl com">/* Free the current selection */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release hyperslab spans&quot;</span><span class="hl opt">)</span>
                space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                <span class="hl com">/* Reset the number of items in selection */</span>
                space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

                <span class="hl com">/* Check if there are any non-overlapped selections */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>a_not_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>space<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>TRUE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>a_not_b<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the a_not_b are owned */</span>
                    a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">case</span> H5S_SELECT_NOTA<span class="hl opt">:</span>
                <span class="hl com">/* Free the current selection */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release hyperslab spans&quot;</span><span class="hl opt">)</span>
                space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                <span class="hl com">/* Reset the number of items in selection */</span>
                space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

                <span class="hl com">/* Check if there are any non-overlapped selections */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>space<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>TRUE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>b_not_a<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the b_not_a are owned */</span>
                    b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">case</span> H5S_SELECT_NOOP<span class="hl opt">:</span>
            <span class="hl kwa">case</span> H5S_SELECT_SET<span class="hl opt">:</span>
            <span class="hl kwa">case</span> H5S_SELECT_APPEND<span class="hl opt">:</span>
            <span class="hl kwa">case</span> H5S_SELECT_PREPEND<span class="hl opt">:</span>
            <span class="hl kwa">case</span> H5S_SELECT_INVALID<span class="hl opt">:</span>
            <span class="hl kwa">default</span><span class="hl opt">:</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>

        <span class="hl com">/* Check if the resulting hyperslab span tree is empty */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
            H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">;</span>     <span class="hl com">/* Empty hyperslab span tree */</span>

            <span class="hl com">/* Sanity check */</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">);</span>

            <span class="hl com">/* Allocate a span info node */</span>
            <span class="hl kwa">if</span><span class="hl opt">((</span>spans <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Set the reference count */</span>
            spans<span class="hl opt">-&gt;</span>count<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>

            <span class="hl com">/* Reset the scratch pad space */</span>
            spans<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

            <span class="hl com">/* Set to empty tree */</span>
            spans<span class="hl opt">-&gt;</span>head<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

            <span class="hl com">/* Set pointer to empty span tree */</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>spans<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Check if we updated the spans */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>updated_spans<span class="hl opt">) {</span>
                <span class="hl com">/* Attempt to rebuild &quot;optimized&quot; start/stride/count/block information.</span>
<span class="hl com">                 * from resulting hyperslab span tree</span>
<span class="hl com">                 */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_rebuild</span><span class="hl opt">(</span>space<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCOUNT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't rebuild hyperslab info&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl com">/* Free resources */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>a_not_b<span class="hl opt">)</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>a_not_b<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HDONE_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release temporary hyperslab spans&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>a_and_b<span class="hl opt">)</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>a_and_b<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HDONE_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release temporary hyperslab spans&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>b_not_a<span class="hl opt">)</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>b_not_a<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HDONE_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release temporary hyperslab spans&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>new_spans<span class="hl opt">)</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>new_spans<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HDONE_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release temporary hyperslab spans&quot;</span><span class="hl opt">)</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* end H5S_generate_hyperslab() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_select_hyperslab</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Internal version of H5Sselect_hyperslab().</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	Non-negative on success/Negative on failure</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Wednesday, January 10, 2001</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
herr_t
<span class="hl kwd">H5S_select_hyperslab</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> H5S_seloper_t op<span class="hl opt">,</span>
		      <span class="hl kwb">const</span> hsize_t start<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>stride<span class="hl opt">,</span>
		      <span class="hl kwb">const</span> hsize_t count<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>block<span class="hl opt">)</span>
<span class="hl opt">{</span>
    hsize_t int_stride<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Internal storage for stride information */</span>
    hsize_t int_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Internal storage for count information */</span>
    hsize_t int_block<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Internal storage for block information */</span>
    <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>opt_stride<span class="hl opt">;</span>      <span class="hl com">/* Optimized stride information */</span>
    <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>opt_count<span class="hl opt">;</span>       <span class="hl com">/* Optimized count information */</span>
    <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>opt_block<span class="hl opt">;</span>       <span class="hl com">/* Optimized block information */</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                     <span class="hl com">/* Counters */</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI</span><span class="hl opt">(</span>H5S_select_hyperslab<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>count<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>op <span class="hl opt">&gt;</span> H5S_SELECT_NOOP <span class="hl opt">&amp;&amp;</span> op <span class="hl opt">&lt;</span> H5S_SELECT_INVALID<span class="hl opt">);</span>

    <span class="hl com">/* Point to the correct stride values */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>stride<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
        stride <span class="hl opt">=</span> _ones<span class="hl opt">;</span>

    <span class="hl com">/* Point to the correct block values */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>block<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
        block <span class="hl opt">=</span> _ones<span class="hl opt">;</span>

    <span class="hl com">/*</span>
<span class="hl com">     * Check new selection.</span>
<span class="hl com">     */</span>
    <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
        <span class="hl com">/* Check for overlapping hyperslab blocks in new selection. */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>count<span class="hl opt">[</span>u<span class="hl opt">]&gt;</span><span class="hl num">1</span> <span class="hl opt">&amp;&amp;</span> stride<span class="hl opt">[</span>u<span class="hl opt">]&lt;</span>block<span class="hl opt">[</span>u<span class="hl opt">])</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADVALUE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;hyperslab blocks overlap&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Detect zero-sized hyperslabs in new selection */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>count<span class="hl opt">[</span>u<span class="hl opt">] ==</span> <span class="hl num">0</span> <span class="hl opt">||</span> block<span class="hl opt">[</span>u<span class="hl opt">] ==</span> <span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl kwa">switch</span><span class="hl opt">(</span>op<span class="hl opt">) {</span>
                <span class="hl kwa">case</span> H5S_SELECT_SET<span class="hl opt">:</span>   <span class="hl com">/* Select &quot;set&quot; operation */</span>
                <span class="hl kwa">case</span> H5S_SELECT_AND<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;and&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTA<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;B not A&quot; operation for hyperslabs */</span>
                    <span class="hl com">/* Convert to &quot;none&quot; selection */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_select_none</span><span class="hl opt">(</span>space<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't convert selection&quot;</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>

                <span class="hl kwa">case</span> H5S_SELECT_OR<span class="hl opt">:</span>    <span class="hl com">/* Binary &quot;or&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_XOR<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;xor&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTB<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;A not B&quot; operation for hyperslabs */</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>        <span class="hl com">/* Selection stays same */</span>

                <span class="hl kwa">case</span> H5S_SELECT_NOOP<span class="hl opt">:</span>
                <span class="hl kwa">case</span> H5S_SELECT_APPEND<span class="hl opt">:</span>
                <span class="hl kwa">case</span> H5S_SELECT_PREPEND<span class="hl opt">:</span>
                <span class="hl kwa">case</span> H5S_SELECT_INVALID<span class="hl opt">:</span>
                <span class="hl kwa">default</span><span class="hl opt">:</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

    <span class="hl com">/* Optimize hyperslab parameters to merge contiguous blocks, etc. */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>stride <span class="hl opt">==</span> _ones <span class="hl opt">&amp;&amp;</span> block <span class="hl opt">==</span> _ones<span class="hl opt">) {</span>
        <span class="hl com">/* Point to existing arrays */</span>
        opt_stride <span class="hl opt">=</span> _ones<span class="hl opt">;</span>
        opt_count <span class="hl opt">=</span> _ones<span class="hl opt">;</span>
        opt_block <span class="hl opt">=</span> count<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Point to local arrays */</span>
        opt_stride <span class="hl opt">=</span> int_stride<span class="hl opt">;</span>
        opt_count <span class="hl opt">=</span> int_count<span class="hl opt">;</span>
        opt_block <span class="hl opt">=</span> int_block<span class="hl opt">;</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl com">/* contiguous hyperslabs have the block size equal to the stride */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>stride<span class="hl opt">[</span>u<span class="hl opt">]==</span>block<span class="hl opt">[</span>u<span class="hl opt">]) {</span>
                int_count<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                int_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>block<span class="hl opt">[</span>u<span class="hl opt">]==</span><span class="hl num">1</span><span class="hl opt">)</span>
                    int_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>count<span class="hl opt">[</span>u<span class="hl opt">];</span>
                <span class="hl kwa">else</span>
                    int_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>block<span class="hl opt">[</span>u<span class="hl opt">]*</span>count<span class="hl opt">[</span>u<span class="hl opt">];</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>count<span class="hl opt">[</span>u<span class="hl opt">]==</span><span class="hl num">1</span><span class="hl opt">)</span>
                    int_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>stride<span class="hl opt">[</span>u<span class="hl opt">] &gt;</span> block<span class="hl opt">[</span>u<span class="hl opt">]);</span>
                    int_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span>stride<span class="hl opt">[</span>u<span class="hl opt">];</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                int_count<span class="hl opt">[</span>u<span class="hl opt">]=</span>count<span class="hl opt">[</span>u<span class="hl opt">];</span>
                int_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>block<span class="hl opt">[</span>u<span class="hl opt">];</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl com">/* Fixup operation for non-hyperslab selections */</span>
    <span class="hl kwa">switch</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">)) {</span>
        <span class="hl kwa">case</span> H5S_SEL_NONE<span class="hl opt">:</span>   <span class="hl com">/* No elements selected in dataspace */</span>
            <span class="hl kwa">switch</span><span class="hl opt">(</span>op<span class="hl opt">) {</span>
                <span class="hl kwa">case</span> H5S_SELECT_SET<span class="hl opt">:</span>   <span class="hl com">/* Select &quot;set&quot; operation */</span>
                    <span class="hl com">/* Change &quot;none&quot; selection to hyperslab selection */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_OR<span class="hl opt">:</span>    <span class="hl com">/* Binary &quot;or&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_XOR<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;xor&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTA<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;B not A&quot; operation for hyperslabs */</span>
                    op<span class="hl opt">=</span>H5S_SELECT_SET<span class="hl opt">;</span> <span class="hl com">/* Maps to &quot;set&quot; operation when applied to &quot;none&quot; selection */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_AND<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;and&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTB<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;A not B&quot; operation for hyperslabs */</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>        <span class="hl com">/* Selection stays &quot;none&quot; */</span>

                <span class="hl kwa">case</span> H5S_SELECT_NOOP<span class="hl opt">:</span>
                <span class="hl kwa">case</span> H5S_SELECT_APPEND<span class="hl opt">:</span>
                <span class="hl kwa">case</span> H5S_SELECT_PREPEND<span class="hl opt">:</span>
                <span class="hl kwa">case</span> H5S_SELECT_INVALID<span class="hl opt">:</span>
                <span class="hl kwa">default</span><span class="hl opt">:</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>
            <span class="hl kwa">break</span><span class="hl opt">;</span>

        <span class="hl kwa">case</span> H5S_SEL_ALL<span class="hl opt">:</span>    <span class="hl com">/* All elements selected in dataspace */</span>
            <span class="hl kwa">switch</span><span class="hl opt">(</span>op<span class="hl opt">) {</span>
                <span class="hl kwa">case</span> H5S_SELECT_SET<span class="hl opt">:</span>   <span class="hl com">/* Select &quot;set&quot; operation */</span>
                    <span class="hl com">/* Change &quot;all&quot; selection to hyperslab selection */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_OR<span class="hl opt">:</span>    <span class="hl com">/* Binary &quot;or&quot; operation for hyperslabs */</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>        <span class="hl com">/* Selection stays &quot;all&quot; */</span>

                <span class="hl kwa">case</span> H5S_SELECT_AND<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;and&quot; operation for hyperslabs */</span>
                    op<span class="hl opt">=</span>H5S_SELECT_SET<span class="hl opt">;</span> <span class="hl com">/* Maps to &quot;set&quot; operation when applied to &quot;none&quot; selection */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_XOR<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;xor&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTB<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;A not B&quot; operation for hyperslabs */</span>
                    <span class="hl com">/* Convert current &quot;all&quot; selection to &quot;real&quot; hyperslab selection */</span>
                    <span class="hl com">/* Then allow operation to proceed */</span>
                    <span class="hl opt">{</span>
                        hsize_t tmp_start<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Temporary start information */</span>
                        hsize_t tmp_stride<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Temporary stride information */</span>
                        hsize_t tmp_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary count information */</span>
                        hsize_t tmp_block<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary block information */</span>

                        <span class="hl com">/* Fill in temporary information for the dimensions */</span>
                        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
                            tmp_start<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">0</span><span class="hl opt">;</span>
                            tmp_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                            tmp_count<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                            tmp_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">[</span>u<span class="hl opt">];</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

                        <span class="hl com">/* Convert to hyperslab selection */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_select_hyperslab</span><span class="hl opt">(</span>space<span class="hl opt">,</span>H5S_SELECT_SET<span class="hl opt">,</span>tmp_start<span class="hl opt">,</span>tmp_stride<span class="hl opt">,</span>tmp_count<span class="hl opt">,</span>tmp_block<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't convert selection&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end case */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_NOTA<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;B not A&quot; operation for hyperslabs */</span>
                    <span class="hl com">/* Convert to &quot;none&quot; selection */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_select_none</span><span class="hl opt">(</span>space<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't convert selection&quot;</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>

                <span class="hl kwa">case</span> H5S_SELECT_NOOP<span class="hl opt">:</span>
                <span class="hl kwa">case</span> H5S_SELECT_APPEND<span class="hl opt">:</span>
                <span class="hl kwa">case</span> H5S_SELECT_PREPEND<span class="hl opt">:</span>
                <span class="hl kwa">case</span> H5S_SELECT_INVALID<span class="hl opt">:</span>
                <span class="hl kwa">default</span><span class="hl opt">:</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>
            <span class="hl kwa">break</span><span class="hl opt">;</span>

        <span class="hl kwa">case</span> H5S_SEL_HYPERSLABS<span class="hl opt">:</span>
            <span class="hl com">/* Hyperslab operation on hyperslab selection, OK */</span>
            <span class="hl kwa">break</span><span class="hl opt">;</span>

        <span class="hl kwa">case</span> H5S_SEL_POINTS<span class="hl opt">:</span> <span class="hl com">/* Can't combine hyperslab operations and point selections currently */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>op<span class="hl opt">==</span>H5S_SELECT_SET<span class="hl opt">)</span>      <span class="hl com">/* Allow only &quot;set&quot; operation to proceed */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>
            <span class="hl com">/* Else fall through to error */</span>

        <span class="hl kwa">case</span> H5S_SEL_ERROR<span class="hl opt">:</span>
        <span class="hl kwa">case</span> H5S_SEL_N<span class="hl opt">:</span>
        <span class="hl kwa">default</span><span class="hl opt">:</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>

    <span class="hl kwa">if</span><span class="hl opt">(</span>op <span class="hl opt">==</span> H5S_SELECT_SET<span class="hl opt">) {</span>
        <span class="hl com">/* If we are setting a new selection, remove current selection first */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_SELECT_RELEASE</span><span class="hl opt">(</span>space<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't release selection&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Allocate space for the hyperslab selection information */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_sel_t<span class="hl opt">)))</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab info&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Save the diminfo */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u <span class="hl opt">&lt;</span> space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">=</span> start<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride <span class="hl opt">=</span> stride<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">=</span> count<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block <span class="hl opt">=</span> block<span class="hl opt">[</span>u<span class="hl opt">];</span>

            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">=</span> start<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride <span class="hl opt">=</span> opt_stride<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">=</span> opt_count<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block <span class="hl opt">=</span> opt_block<span class="hl opt">[</span>u<span class="hl opt">];</span>

            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem <span class="hl opt">*= (</span>opt_count<span class="hl opt">[</span>u<span class="hl opt">] *</span> opt_block<span class="hl opt">[</span>u<span class="hl opt">]);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* Indicate that the dimension information is valid */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>

        <span class="hl com">/* Indicate that there's no slab information */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst <span class="hl opt">=</span> NULL<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else if</span><span class="hl opt">(</span>op <span class="hl opt">&gt;=</span> H5S_SELECT_OR <span class="hl opt">&amp;&amp;</span> op <span class="hl opt">&lt;=</span> H5S_SELECT_NOTA<span class="hl opt">) {</span>
        <span class="hl com">/* Sanity check */</span>
        <span class="hl kwd">HDassert</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">) ==</span> H5S_SEL_HYPERSLABS<span class="hl opt">);</span>

        <span class="hl com">/* Check if there's no hyperslab span information currently */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">==</span> space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">)</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_generate_spans</span><span class="hl opt">(</span>space<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_UNINITIALIZED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;dataspace does not have span tree&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Indicate that the regular dimensions are no longer valid */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>

        <span class="hl com">/* Add in the new hyperslab information */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_generate_hyperslab</span><span class="hl opt">(</span>space<span class="hl opt">,</span> op<span class="hl opt">,</span> start<span class="hl opt">,</span> opt_stride<span class="hl opt">,</span> opt_count<span class="hl opt">,</span> opt_block<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't generate hyperslabs&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Set selection type */</span>
    space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>type <span class="hl opt">=</span> H5S_sel_hyper<span class="hl opt">;</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* end H5S_select_hyperslab() */</span>


<span class="hl com">/*--------------------------------------------------------------------------</span>
<span class="hl com"> NAME</span>
<span class="hl com">    H5Sselect_hyperslab</span>
<span class="hl com"> PURPOSE</span>
<span class="hl com">    Specify a hyperslab to combine with the current hyperslab selection</span>
<span class="hl com"> USAGE</span>
<span class="hl com">    herr_t H5Sselect_hyperslab(dsid, op, start, stride, count, block)</span>
<span class="hl com">        hid_t dsid;             IN: Dataspace ID of selection to modify</span>
<span class="hl com">        H5S_seloper_t op;       IN: Operation to perform on current selection</span>
<span class="hl com">        const hsize_t *start;        IN: Offset of start of hyperslab</span>
<span class="hl com">        const hsize_t *stride;       IN: Hyperslab stride</span>
<span class="hl com">        const hsize_t *count;        IN: Number of blocks included in hyperslab</span>
<span class="hl com">        const hsize_t *block;        IN: Size of block in hyperslab</span>
<span class="hl com"> RETURNS</span>
<span class="hl com">    Non-negative on success/Negative on failure</span>
<span class="hl com"> DESCRIPTION</span>
<span class="hl com">    Combines a hyperslab selection with the current selection for a dataspace.</span>
<span class="hl com">    If the current selection is not a hyperslab, it is freed and the hyperslab</span>
<span class="hl com">    parameters passed in are combined with the H5S_SEL_ALL hyperslab (ie. a</span>
<span class="hl com">    selection composing the entire current extent).  If STRIDE or BLOCK is</span>
<span class="hl com">    NULL, they are assumed to be set to all '1'.</span>
<span class="hl com"> GLOBAL VARIABLES</span>
<span class="hl com"> COMMENTS, BUGS, ASSUMPTIONS</span>
<span class="hl com"> EXAMPLES</span>
<span class="hl com"> REVISION LOG</span>
<span class="hl com">--------------------------------------------------------------------------*/</span>
herr_t
<span class="hl kwd">H5Sselect_hyperslab</span><span class="hl opt">(</span>hid_t space_id<span class="hl opt">,</span> H5S_seloper_t op<span class="hl opt">,</span> <span class="hl kwb">const</span> hsize_t start<span class="hl opt">[],</span>
         <span class="hl kwb">const</span> hsize_t stride<span class="hl opt">[],</span> <span class="hl kwb">const</span> hsize_t count<span class="hl opt">[],</span> <span class="hl kwb">const</span> hsize_t block<span class="hl opt">[])</span>
<span class="hl opt">{</span>
    H5S_t <span class="hl opt">*</span>space<span class="hl opt">;</span>               <span class="hl com">/* Dataspace to modify selection of */</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                 <span class="hl com">/* Local index variable */</span>
    herr_t ret_value <span class="hl opt">=</span> SUCCEED<span class="hl opt">;</span> <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_API</span><span class="hl opt">(</span>H5Sselect_hyperslab<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>
    <span class="hl kwd">H5TRACE6</span><span class="hl opt">(</span><span class="hl str">&quot;e&quot;</span><span class="hl opt">,</span> <span class="hl str">&quot;iSs*h*h*h*h&quot;</span><span class="hl opt">,</span> space_id<span class="hl opt">,</span> op<span class="hl opt">,</span> start<span class="hl opt">,</span> stride<span class="hl opt">,</span> count<span class="hl opt">,</span> block<span class="hl opt">);</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>NULL <span class="hl opt">== (</span>space <span class="hl opt">= (</span>H5S_t <span class="hl opt">*)</span><span class="hl kwd">H5I_object_verify</span><span class="hl opt">(</span>space_id<span class="hl opt">,</span> H5I_DATASPACE<span class="hl opt">)))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADTYPE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;not a data space&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>H5S_SCALAR <span class="hl opt">==</span> <span class="hl kwd">H5S_GET_EXTENT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADTYPE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;hyperslab doesn't support H5S_SCALAR space&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>H5S_NULL <span class="hl opt">==</span> <span class="hl kwd">H5S_GET_EXTENT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADTYPE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;hyperslab doesn't support H5S_NULL space&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>start <span class="hl opt">==</span> NULL <span class="hl opt">||</span> count <span class="hl opt">==</span> NULL<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADVALUE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;hyperslab not specified&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(!(</span>op <span class="hl opt">&gt;</span> H5S_SELECT_NOOP <span class="hl opt">&amp;&amp;</span> op <span class="hl opt">&lt;</span> H5S_SELECT_INVALID<span class="hl opt">))</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>stride<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl com">/* Check for 0-sized strides */</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>stride<span class="hl opt">[</span>u<span class="hl opt">]==</span><span class="hl num">0</span><span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADVALUE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid stride==0 value&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">H5S_select_hyperslab</span><span class="hl opt">(</span>space<span class="hl opt">,</span> op<span class="hl opt">,</span> start<span class="hl opt">,</span> stride<span class="hl opt">,</span> count<span class="hl opt">,</span> block<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINIT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;unable to set hyperslab selection&quot;</span><span class="hl opt">)</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_API</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* end H5Sselect_hyperslab() */</span>
<span class="hl ppc">#else</span> <span class="hl com">/* NEW_HYPERSLAB_API */</span><span class="hl ppc"></span> <span class="hl com">/* Works */</span><span class="hl ppc"></span>

<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_operate_hyperslab</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Combines two hyperslabs with an operation, putting the</span>
<span class="hl com"> *              result into a third hyperslab selection</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	non-negative on success/NULL on failure</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Tuesday, October 30, 2001</span>
<span class="hl com"> *</span>
<span class="hl com"> * Modifications:</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_operate_hyperslab</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>result<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">*</span>spans1<span class="hl opt">,</span> H5S_seloper_t op<span class="hl opt">,</span> H5S_hyper_span_info_t <span class="hl opt">*</span>spans2<span class="hl opt">,</span>
    hbool_t can_own_span2<span class="hl opt">,</span> hbool_t <span class="hl opt">*</span>span2_owned<span class="hl opt">)</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>    <span class="hl com">/* Span tree for hyperslab spans in old span tree and not in new span tree */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>    <span class="hl com">/* Span tree for hyperslab spans in both old and new span trees */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>    <span class="hl com">/* Span tree for hyperslab spans in new span tree and not in old span tree */</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_operate_hyperslab<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>result<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans2<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>op <span class="hl opt">&gt;</span> H5S_SELECT_NOOP <span class="hl opt">&amp;&amp;</span> op <span class="hl opt">&lt;</span> H5S_SELECT_INVALID<span class="hl opt">);</span>

    <span class="hl com">/* Just copy the selection from spans2 if we are setting the selection */</span>
    <span class="hl com">/* ('space1' to 'result' aliasing happens at the next layer up) */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>op<span class="hl opt">==</span>H5S_SELECT_SET<span class="hl opt">) {</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>result<span class="hl opt">,</span>spans2<span class="hl opt">,</span>can_own_span2<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Update the number of elements in current selection */</span>
        result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>spans2<span class="hl opt">);</span>

        <span class="hl com">/* Indicate that we took ownership of span2, if allowed */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>can_own_span2<span class="hl opt">)</span>
            <span class="hl opt">*</span>span2_owned<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        hbool_t updated_spans <span class="hl opt">=</span> FALSE<span class="hl opt">;</span>  <span class="hl com">/* Whether the spans in the selection were modified */</span>

        <span class="hl kwd">HDassert</span><span class="hl opt">(</span>spans1<span class="hl opt">);</span>

        <span class="hl com">/* Generate lists of spans which overlap and don't overlap */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_clip_spans</span><span class="hl opt">(</span>spans1<span class="hl opt">,</span>spans2<span class="hl opt">,&amp;</span>a_not_b<span class="hl opt">,&amp;</span>a_and_b<span class="hl opt">,&amp;</span>b_not_a<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCLIP<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't clip hyperslab information&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Switch on the operation */</span>
        <span class="hl kwa">switch</span><span class="hl opt">(</span>op<span class="hl opt">) {</span>
            <span class="hl kwa">case</span> H5S_SELECT_OR<span class="hl opt">:</span>
                <span class="hl com">/* Copy spans from spans1 to current selection */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>spans1<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>result<span class="hl opt">,</span>spans1<span class="hl opt">,</span>FALSE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>spans1<span class="hl opt">);</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

                <span class="hl com">/* Add any new spans from spans2 to current selection */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>result<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>FALSE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">+=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>b_not_a<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">case</span> H5S_SELECT_AND<span class="hl opt">:</span>
                <span class="hl com">/* Check if there are any overlapped selections */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>a_and_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>result<span class="hl opt">,</span>a_and_b<span class="hl opt">,</span>TRUE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>a_and_b<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the result owns the a_and_b spans */</span>
                    a_and_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">case</span> H5S_SELECT_XOR<span class="hl opt">:</span>
                <span class="hl com">/* Check if there are any non-overlapped selections */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>a_not_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>result<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>FALSE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>a_not_b<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>result<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>FALSE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">+=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>b_not_a<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">case</span> H5S_SELECT_NOTB<span class="hl opt">:</span>
                <span class="hl com">/* Check if there are any non-overlapped selections */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>a_not_b<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>result<span class="hl opt">,</span>a_not_b<span class="hl opt">,</span>TRUE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>a_not_b<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the result owns the a_not_b spans */</span>
                    a_not_b<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">case</span> H5S_SELECT_NOTA<span class="hl opt">:</span>
                <span class="hl com">/* Check if there are any non-overlapped selections */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>b_not_a<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_merge_spans</span><span class="hl opt">(</span>result<span class="hl opt">,</span>b_not_a<span class="hl opt">,</span>TRUE<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't insert hyperslabs&quot;</span><span class="hl opt">)</span>

                    <span class="hl com">/* Update the number of elements in current selection */</span>
                    result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_spans_nelem</span><span class="hl opt">(</span>b_not_a<span class="hl opt">);</span>

                    <span class="hl com">/* Indicate that the result owns the b_not_a spans */</span>
                    b_not_a<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

                    <span class="hl com">/* Indicate that the spans were updated */</span>
                    updated_spans <span class="hl opt">=</span> TRUE<span class="hl opt">;</span>
                <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>

            <span class="hl kwa">default</span><span class="hl opt">:</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
        <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>

        <span class="hl com">/* Free the hyperslab trees generated from the clipping algorithm */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>a_not_b<span class="hl opt">)</span>
            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>a_not_b<span class="hl opt">);</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>a_and_b<span class="hl opt">)</span>
            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>a_and_b<span class="hl opt">);</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>b_not_a<span class="hl opt">)</span>
            <span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>b_not_a<span class="hl opt">);</span>

        <span class="hl com">/* Check if the resulting hyperslab span tree is empty */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">==</span>NULL<span class="hl opt">) {</span>
            H5S_hyper_span_info_t <span class="hl opt">*</span>spans<span class="hl opt">;</span>     <span class="hl com">/* Empty hyperslab span tree */</span>

            <span class="hl com">/* Sanity check */</span>
            <span class="hl kwd">HDassert</span><span class="hl opt">(</span>result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">);</span>

            <span class="hl com">/* Allocate a span info node */</span>
            <span class="hl kwa">if</span><span class="hl opt">((</span>spans <span class="hl opt">=</span> <span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_span_info_t<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
                <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab span&quot;</span><span class="hl opt">)</span>

            <span class="hl com">/* Set the reference count */</span>
            spans<span class="hl opt">-&gt;</span>count<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>

            <span class="hl com">/* Reset the scratch pad space */</span>
            spans<span class="hl opt">-&gt;</span>scratch<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span>

            <span class="hl com">/* Set to empty tree */</span>
            spans<span class="hl opt">-&gt;</span>head<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

            <span class="hl com">/* Set pointer to empty span tree */</span>
            result<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>spans<span class="hl opt">;</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl kwa">else</span> <span class="hl opt">{</span>
            <span class="hl com">/* Check if we updated the spans */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>updated_spans<span class="hl opt">) {</span>
                <span class="hl com">/* Attempt to rebuild &quot;optimized&quot; start/stride/count/block information.</span>
<span class="hl com">                 * from resulting hyperslab span tree</span>
<span class="hl com">                 */</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_rebuild</span><span class="hl opt">(</span>result<span class="hl opt">) &lt;</span> <span class="hl num">0</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCOUNT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't rebuild hyperslab info&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

done<span class="hl opt">:</span>
    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span>   <span class="hl com">/* end H5S_operate_hyperslab() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_generate_hyperlab</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Generate hyperslab information from H5S_select_hyperslab()</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	Non-negative on success/Negative on failure</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol (split from HS_select_hyperslab()).</span>
<span class="hl com"> *              Tuesday, September 12, 2000</span>
<span class="hl com"> *</span>
<span class="hl com"> * Modifications:</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
<span class="hl kwb">static</span> herr_t
<span class="hl kwd">H5S_generate_hyperslab</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> H5S_seloper_t op<span class="hl opt">,</span>
		      <span class="hl kwb">const</span> hsize_t start<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t stride<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t count<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t block<span class="hl opt">[])</span>
<span class="hl opt">{</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>new_spans<span class="hl opt">=</span>NULL<span class="hl opt">;</span>   <span class="hl com">/* Span tree for new hyperslab */</span>
    H5S_hyper_span_info_t <span class="hl opt">*</span>tmp_spans<span class="hl opt">=</span>NULL<span class="hl opt">;</span>   <span class="hl com">/* Temporary copy of selection */</span>
    hbool_t span2_owned<span class="hl opt">=</span>FALSE<span class="hl opt">;</span>          <span class="hl com">/* Flag to indicate that span2 was used in H5S_operate_hyperslab() */</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI_NOINIT</span><span class="hl opt">(</span>H5S_generate_hyperslab<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>op <span class="hl opt">&gt;</span> H5S_SELECT_NOOP <span class="hl opt">&amp;&amp;</span> op <span class="hl opt">&lt;</span> H5S_SELECT_INVALID<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>stride<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>count<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>block<span class="hl opt">);</span>

    <span class="hl com">/* Generate span tree for new hyperslab information */</span>
    <span class="hl kwa">if</span><span class="hl opt">((</span>new_spans<span class="hl opt">=</span><span class="hl kwd">H5S_hyper_make_spans</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">,</span>start<span class="hl opt">,</span>stride<span class="hl opt">,</span>count<span class="hl opt">,</span>block<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTINSERT<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't create hyperslab information&quot;</span><span class="hl opt">)</span>

    <span class="hl com">/* Copy the original dataspace */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">!=</span>NULL<span class="hl opt">) {</span>
        <span class="hl com">/* Take ownership of the dataspace's hyperslab spans */</span>
        <span class="hl com">/* (These are freed later) */</span>
        tmp_spans<span class="hl opt">=</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">;</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>NULL<span class="hl opt">;</span>

        <span class="hl com">/* Reset the other dataspace selection information */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_SELECT_RELEASE</span><span class="hl opt">(</span>space<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't release selection&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Allocate space for the hyperslab selection information */</span>
        <span class="hl kwa">if</span><span class="hl opt">((</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">=</span><span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_sel_t<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab info&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>

    <span class="hl com">/* Combine tmp_space (really space) &amp; new_space, with the result in space */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_operate_hyperslab</span><span class="hl opt">(</span>space<span class="hl opt">,</span>tmp_spans<span class="hl opt">,</span>op<span class="hl opt">,</span>new_spans<span class="hl opt">,</span>TRUE<span class="hl opt">,&amp;</span>span2_owned<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTCLIP<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't clip hyperslab information&quot;</span><span class="hl opt">)</span>

done<span class="hl opt">:</span>
    <span class="hl com">/* Free temporary data structures */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>tmp_spans<span class="hl opt">!=</span>NULL<span class="hl opt">)</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>tmp_spans<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HDONE_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release temporary hyperslab spans&quot;</span><span class="hl opt">)</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>new_spans<span class="hl opt">!=</span>NULL <span class="hl opt">&amp;&amp;</span> span2_owned<span class="hl opt">==</span>FALSE<span class="hl opt">)</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_free_span_info</span><span class="hl opt">(</span>new_spans<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HDONE_ERROR</span><span class="hl opt">(</span>H5E_INTERNAL<span class="hl opt">,</span> H5E_CANTFREE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;failed to release temporary hyperslab spans&quot;</span><span class="hl opt">)</span>

    <span class="hl kwd">FUNC_LEAVE_NOAPI</span><span class="hl opt">(</span>ret_value<span class="hl opt">)</span>
<span class="hl opt">}</span> <span class="hl com">/* end H5S_generate_hyperslab() */</span>


<span class="hl com">/*-------------------------------------------------------------------------</span>
<span class="hl com"> * Function:	H5S_select_hyperslab</span>
<span class="hl com"> *</span>
<span class="hl com"> * Purpose:	Internal version of H5Sselect_hyperslab().</span>
<span class="hl com"> *</span>
<span class="hl com"> * Return:	Non-negative on success/Negative on failure</span>
<span class="hl com"> *</span>
<span class="hl com"> * Programmer:	Quincey Koziol</span>
<span class="hl com"> *              Wednesday, January 10, 2001</span>
<span class="hl com"> *</span>
<span class="hl com"> * Modifications:</span>
<span class="hl com"> *</span>
<span class="hl com"> *-------------------------------------------------------------------------</span>
<span class="hl com"> */</span>
herr_t
<span class="hl kwd">H5S_select_hyperslab</span> <span class="hl opt">(</span>H5S_t <span class="hl opt">*</span>space<span class="hl opt">,</span> H5S_seloper_t op<span class="hl opt">,</span>
		      <span class="hl kwb">const</span> hsize_t start<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>stride<span class="hl opt">,</span>
		      <span class="hl kwb">const</span> hsize_t count<span class="hl opt">[],</span>
		      <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>block<span class="hl opt">)</span>
<span class="hl opt">{</span>
    hsize_t int_stride<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Internal storage for stride information */</span>
    hsize_t int_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Internal storage for count information */</span>
    hsize_t int_block<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Internal storage for block information */</span>
    <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>opt_stride<span class="hl opt">;</span>      <span class="hl com">/* Optimized stride information */</span>
    <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>opt_count<span class="hl opt">;</span>       <span class="hl com">/* Optimized count information */</span>
    <span class="hl kwb">const</span> hsize_t <span class="hl opt">*</span>opt_block<span class="hl opt">;</span>       <span class="hl com">/* Optimized block information */</span>
    <span class="hl kwb">unsigned</span> u<span class="hl opt">;</span>                    <span class="hl com">/* Counters */</span>
    herr_t      ret_value<span class="hl opt">=</span>SUCCEED<span class="hl opt">;</span>       <span class="hl com">/* Return value */</span>

    <span class="hl kwd">FUNC_ENTER_NOAPI</span><span class="hl opt">(</span>H5S_select_hyperslab<span class="hl opt">,</span> FAIL<span class="hl opt">)</span>

    <span class="hl com">/* Check args */</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>space<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>start<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>count<span class="hl opt">);</span>
    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>op <span class="hl opt">&gt;</span> H5S_SELECT_NOOP <span class="hl opt">&amp;&amp;</span> op <span class="hl opt">&lt;</span> H5S_SELECT_INVALID<span class="hl opt">);</span>

    <span class="hl com">/* Point to the correct stride values */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>stride<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
        stride <span class="hl opt">=</span> _ones<span class="hl opt">;</span>

    <span class="hl com">/* Point to the correct block values */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>block<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
        block <span class="hl opt">=</span> _ones<span class="hl opt">;</span>

    <span class="hl com">/*</span>
<span class="hl com">     * Check new selection.</span>
<span class="hl com">     */</span>
    <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
        <span class="hl com">/* Check for overlapping hyperslab blocks in new selection. */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>count<span class="hl opt">[</span>u<span class="hl opt">]&gt;</span><span class="hl num">1</span> <span class="hl opt">&amp;&amp;</span> stride<span class="hl opt">[</span>u<span class="hl opt">]&lt;</span>block<span class="hl opt">[</span>u<span class="hl opt">])</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_BADVALUE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;hyperslab blocks overlap&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Detect zero-sized hyperslabs in new selection */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>count<span class="hl opt">[</span>u<span class="hl opt">] ==</span> <span class="hl num">0</span> <span class="hl opt">||</span> block<span class="hl opt">[</span>u<span class="hl opt">] ==</span> <span class="hl num">0</span><span class="hl opt">) {</span>
            <span class="hl kwa">switch</span><span class="hl opt">(</span>op<span class="hl opt">) {</span>
                <span class="hl kwa">case</span> H5S_SELECT_SET<span class="hl opt">:</span>   <span class="hl com">/* Select &quot;set&quot; operation */</span>
                <span class="hl kwa">case</span> H5S_SELECT_AND<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;and&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTA<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;B not A&quot; operation for hyperslabs */</span>
                    <span class="hl com">/* Convert to &quot;none&quot; selection */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_select_none</span><span class="hl opt">(</span>space<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't convert selection&quot;</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>

                <span class="hl kwa">case</span> H5S_SELECT_OR<span class="hl opt">:</span>    <span class="hl com">/* Binary &quot;or&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_XOR<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;xor&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTB<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;A not B&quot; operation for hyperslabs */</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>        <span class="hl com">/* Selection stays same */</span>

                <span class="hl kwa">default</span><span class="hl opt">:</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

    <span class="hl com">/* Optimize hyperslab parameters to merge contiguous blocks, etc. */</span>
    <span class="hl kwa">if</span><span class="hl opt">(</span>stride <span class="hl opt">==</span> _ones <span class="hl opt">&amp;&amp;</span> block <span class="hl opt">==</span> _ones<span class="hl opt">) {</span>
        <span class="hl com">/* Point to existing arrays */</span>
        opt_stride <span class="hl opt">=</span> _ones<span class="hl opt">;</span>
        opt_count <span class="hl opt">=</span> _ones<span class="hl opt">;</span>
        opt_block <span class="hl opt">=</span> count<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else</span> <span class="hl opt">{</span>
        <span class="hl com">/* Point to local arrays */</span>
        opt_stride <span class="hl opt">=</span> int_stride<span class="hl opt">;</span>
        opt_count <span class="hl opt">=</span> int_count<span class="hl opt">;</span>
        opt_block <span class="hl opt">=</span> int_block<span class="hl opt">;</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            <span class="hl com">/* contiguous hyperslabs have the block size equal to the stride */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>stride<span class="hl opt">[</span>u<span class="hl opt">]==</span>block<span class="hl opt">[</span>u<span class="hl opt">]) {</span>
                int_count<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                int_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>block<span class="hl opt">[</span>u<span class="hl opt">]==</span><span class="hl num">1</span><span class="hl opt">)</span>
                    int_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>count<span class="hl opt">[</span>u<span class="hl opt">];</span>
                <span class="hl kwa">else</span>
                    int_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>block<span class="hl opt">[</span>u<span class="hl opt">]*</span>count<span class="hl opt">[</span>u<span class="hl opt">];</span>
            <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
            <span class="hl kwa">else</span> <span class="hl opt">{</span>
                <span class="hl kwa">if</span><span class="hl opt">(</span>count<span class="hl opt">[</span>u<span class="hl opt">]==</span><span class="hl num">1</span><span class="hl opt">)</span>
                    int_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                <span class="hl kwa">else</span> <span class="hl opt">{</span>
                    <span class="hl kwd">HDassert</span><span class="hl opt">(</span>stride<span class="hl opt">[</span>u<span class="hl opt">] &gt;</span> block<span class="hl opt">[</span>u<span class="hl opt">]);</span>
                    int_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span>stride<span class="hl opt">[</span>u<span class="hl opt">];</span>
                <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
                int_count<span class="hl opt">[</span>u<span class="hl opt">]=</span>count<span class="hl opt">[</span>u<span class="hl opt">];</span>
                int_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>block<span class="hl opt">[</span>u<span class="hl opt">];</span>
            <span class="hl opt">}</span> <span class="hl com">/* end else */</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>
    <span class="hl opt">}</span> <span class="hl com">/* end else */</span>

    <span class="hl com">/* Fixup operation for non-hyperslab selections */</span>
    <span class="hl kwa">switch</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">)) {</span>
        <span class="hl kwa">case</span> H5S_SEL_NONE<span class="hl opt">:</span>   <span class="hl com">/* No elements selected in dataspace */</span>
            <span class="hl kwa">switch</span><span class="hl opt">(</span>op<span class="hl opt">) {</span>
                <span class="hl kwa">case</span> H5S_SELECT_SET<span class="hl opt">:</span>   <span class="hl com">/* Select &quot;set&quot; operation */</span>
                    <span class="hl com">/* Change &quot;none&quot; selection to hyperslab selection */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_OR<span class="hl opt">:</span>    <span class="hl com">/* Binary &quot;or&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_XOR<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;xor&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTA<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;B not A&quot; operation for hyperslabs */</span>
                    op<span class="hl opt">=</span>H5S_SELECT_SET<span class="hl opt">;</span> <span class="hl com">/* Maps to &quot;set&quot; operation when applied to &quot;none&quot; selection */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_AND<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;and&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTB<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;A not B&quot; operation for hyperslabs */</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>        <span class="hl com">/* Selection stays &quot;none&quot; */</span>

                <span class="hl kwa">default</span><span class="hl opt">:</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>
            <span class="hl kwa">break</span><span class="hl opt">;</span>

        <span class="hl kwa">case</span> H5S_SEL_ALL<span class="hl opt">:</span>    <span class="hl com">/* All elements selected in dataspace */</span>
            <span class="hl kwa">switch</span><span class="hl opt">(</span>op<span class="hl opt">) {</span>
                <span class="hl kwa">case</span> H5S_SELECT_SET<span class="hl opt">:</span>   <span class="hl com">/* Select &quot;set&quot; operation */</span>
                    <span class="hl com">/* Change &quot;all&quot; selection to hyperslab selection */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_OR<span class="hl opt">:</span>    <span class="hl com">/* Binary &quot;or&quot; operation for hyperslabs */</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>        <span class="hl com">/* Selection stays &quot;all&quot; */</span>

                <span class="hl kwa">case</span> H5S_SELECT_AND<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;and&quot; operation for hyperslabs */</span>
                    op<span class="hl opt">=</span>H5S_SELECT_SET<span class="hl opt">;</span> <span class="hl com">/* Maps to &quot;set&quot; operation when applied to &quot;none&quot; selection */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_XOR<span class="hl opt">:</span>   <span class="hl com">/* Binary &quot;xor&quot; operation for hyperslabs */</span>
                <span class="hl kwa">case</span> H5S_SELECT_NOTB<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;A not B&quot; operation for hyperslabs */</span>
                    <span class="hl com">/* Convert current &quot;all&quot; selection to &quot;real&quot; hyperslab selection */</span>
                    <span class="hl com">/* Then allow operation to proceed */</span>
                    <span class="hl opt">{</span>
                        hsize_t tmp_start<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Temporary start information */</span>
                        hsize_t tmp_stride<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>   <span class="hl com">/* Temporary stride information */</span>
                        hsize_t tmp_count<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary count information */</span>
                        hsize_t tmp_block<span class="hl opt">[</span>H5O_LAYOUT_NDIMS<span class="hl opt">];</span>    <span class="hl com">/* Temporary block information */</span>

                        <span class="hl com">/* Fill in temporary information for the dimensions */</span>
                        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
                            tmp_start<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">0</span><span class="hl opt">;</span>
                            tmp_stride<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                            tmp_count<span class="hl opt">[</span>u<span class="hl opt">]=</span><span class="hl num">1</span><span class="hl opt">;</span>
                            tmp_block<span class="hl opt">[</span>u<span class="hl opt">]=</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>size<span class="hl opt">[</span>u<span class="hl opt">];</span>
                        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

                        <span class="hl com">/* Convert to hyperslab selection */</span>
                        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_select_hyperslab</span><span class="hl opt">(</span>space<span class="hl opt">,</span>H5S_SELECT_SET<span class="hl opt">,</span>tmp_start<span class="hl opt">,</span>tmp_stride<span class="hl opt">,</span>tmp_count<span class="hl opt">,</span>tmp_block<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't convert selection&quot;</span><span class="hl opt">)</span>
                    <span class="hl opt">}</span> <span class="hl com">/* end case */</span>
                    <span class="hl kwa">break</span><span class="hl opt">;</span>

                <span class="hl kwa">case</span> H5S_SELECT_NOTA<span class="hl opt">:</span>  <span class="hl com">/* Binary &quot;B not A&quot; operation for hyperslabs */</span>
                    <span class="hl com">/* Convert to &quot;none&quot; selection */</span>
                    <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_select_none</span><span class="hl opt">(</span>space<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
                        <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't convert selection&quot;</span><span class="hl opt">)</span>
                    <span class="hl kwd">HGOTO_DONE</span><span class="hl opt">(</span>SUCCEED<span class="hl opt">);</span>

                <span class="hl kwa">default</span><span class="hl opt">:</span>
                    <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
            <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>
            <span class="hl kwa">break</span><span class="hl opt">;</span>

        <span class="hl kwa">case</span> H5S_SEL_HYPERSLABS<span class="hl opt">:</span>
            <span class="hl com">/* Hyperslab operation on hyperslab selection, OK */</span>
            <span class="hl kwa">break</span><span class="hl opt">;</span>

        <span class="hl kwa">case</span> H5S_SEL_POINTS<span class="hl opt">:</span> <span class="hl com">/* Can't combine hyperslab operations and point selections currently */</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span>op<span class="hl opt">==</span>H5S_SELECT_SET<span class="hl opt">)</span>      <span class="hl com">/* Allow only &quot;set&quot; operation to proceed */</span>
                <span class="hl kwa">break</span><span class="hl opt">;</span>
            <span class="hl com">/* Else fall through to error */</span>

        <span class="hl kwa">default</span><span class="hl opt">:</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_ARGS<span class="hl opt">,</span> H5E_UNSUPPORTED<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;invalid selection operation&quot;</span><span class="hl opt">)</span>
    <span class="hl opt">}</span> <span class="hl com">/* end switch */</span>


    <span class="hl kwa">if</span><span class="hl opt">(</span>op<span class="hl opt">==</span>H5S_SELECT_SET<span class="hl opt">) {</span>
        <span class="hl com">/* If we are setting a new selection, remove current selection first */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_SELECT_RELEASE</span><span class="hl opt">(</span>space<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_DATASPACE<span class="hl opt">,</span> H5E_CANTDELETE<span class="hl opt">,</span> FAIL<span class="hl opt">,</span> <span class="hl str">&quot;can't release hyperslab&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Allocate space for the hyperslab selection information */</span>
        <span class="hl kwa">if</span><span class="hl opt">((</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">=</span><span class="hl kwd">H5FL_MALLOC</span><span class="hl opt">(</span>H5S_hyper_sel_t<span class="hl opt">))==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwd">HGOTO_ERROR</span><span class="hl opt">(</span>H5E_RESOURCE<span class="hl opt">,</span> H5E_NOSPACE<span class="hl opt">,</span> NULL<span class="hl opt">,</span> <span class="hl str">&quot;can't allocate hyperslab info&quot;</span><span class="hl opt">)</span>

        <span class="hl com">/* Save the diminfo */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">=</span><span class="hl num">1</span><span class="hl opt">;</span>
        <span class="hl kwa">for</span><span class="hl opt">(</span>u<span class="hl opt">=</span><span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">&lt;</span>space<span class="hl opt">-&gt;</span>extent<span class="hl opt">.</span>rank<span class="hl opt">;</span> u<span class="hl opt">++) {</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">=</span> start<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride <span class="hl opt">=</span> stride<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">=</span> count<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>app_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block <span class="hl opt">=</span> block<span class="hl opt">[</span>u<span class="hl opt">];</span>

            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>start <span class="hl opt">=</span> start<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>stride <span class="hl opt">=</span> opt_stride<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>count <span class="hl opt">=</span> opt_count<span class="hl opt">[</span>u<span class="hl opt">];</span>
            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>opt_diminfo<span class="hl opt">[</span>u<span class="hl opt">].</span>block <span class="hl opt">=</span> opt_block<span class="hl opt">[</span>u<span class="hl opt">];</span>

            space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>num_elem<span class="hl opt">*=(</span>opt_count<span class="hl opt">[</span>u<span class="hl opt">]*</span>opt_block<span class="hl opt">[</span>u<span class="hl opt">]);</span>
        <span class="hl opt">}</span> <span class="hl com">/* end for */</span>

        <span class="hl com">/* Indicate that the dimension information is valid */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>diminfo_valid<span class="hl opt">=</span>TRUE<span class="hl opt">;</span>

        <span class="hl com">/* Indicate that there's no slab information */</span>
        space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">=</span>NULL<span class="hl opt">;</span>
    <span class="hl opt">}</span> <span class="hl com">/* end if */</span>
    <span class="hl kwa">else if</span><span class="hl opt">(</span>op<span class="hl opt">&gt;=</span>H5S_SELECT_OR <span class="hl opt">&amp;&amp;</span> op<span class="hl opt">&lt;=</span>H5S_SELECT_NOTA<span class="hl opt">) {</span>
        <span class="hl com">/* Sanity check */</span>
        <span class="hl kwd">HDassert</span><span class="hl opt">(</span><span class="hl kwd">H5S_GET_SELECT_TYPE</span><span class="hl opt">(</span>space<span class="hl opt">) ==</span> H5S_SEL_HYPERSLABS<span class="hl opt">);</span>

        <span class="hl com">/* Check if there's no hyperslab span information currently */</span>
        <span class="hl kwa">if</span><span class="hl opt">(</span>space<span class="hl opt">-&gt;</span>select<span class="hl opt">.</span>sel_info<span class="hl opt">.</span>hslab<span class="hl opt">-&gt;</span>span_lst<span class="hl opt">==</span>NULL<span class="hl opt">)</span>
            <span class="hl kwa">if</span><span class="hl opt">(</span><span class="hl kwd">H5S_hyper_generate_spans</span><span class="hl opt">(</span>space<span class="hl opt">)&lt;</span><span class="hl num">0</span><span class="hl opt">)