/src/libxml2/valid.c

Source (jump to first uncovered line)
/*
 * valid.c : part of the code use to do the DTD handling and the validity
 *           checking
 *
 * See Copyright for the status of this software.
 *
 * daniel@veillard.com
 */

#define IN_LIBXML
#include "libxml.h"

#include <string.h>
#include <stdlib.h>

#include <libxml/xmlmemory.h>
#include <libxml/hash.h>
#include <libxml/uri.h>
#include <libxml/valid.h>
#include <libxml/parser.h>
#include <libxml/parserInternals.h>
#include <libxml/xmlerror.h>
#include <libxml/list.h>
#include <libxml/xmlsave.h>

#include "private/error.h"
#include "private/parser.h"
#include "private/regexp.h"
#include "private/save.h"
#include "private/tree.h"

static xmlElementPtr
xmlGetDtdElementDesc2(xmlValidCtxtPtr ctxt, xmlDtdPtr dtd, const xmlChar *name);

#ifdef LIBXML_VALID_ENABLED
static int
xmlValidateAttributeValueInternal(xmlDocPtr doc, xmlAttributeType type,
                                  const xmlChar *value);
#endif
/************************************************************************
 *                  *
 *      Error handling routines       *
 *                  *
 ************************************************************************/

/**
 * xmlVErrMemory:
 * @ctxt:  an XML validation parser context
 * @extra:  extra information
 *
 * Handle an out of memory error
 */
static void
xmlVErrMemory(xmlValidCtxtPtr ctxt)
{
    if (ctxt != NULL) {
        if (ctxt->flags & XML_VCTXT_USE_PCTXT) {
            xmlCtxtErrMemory(ctxt->userData);
        } else {
            xmlRaiseMemoryError(NULL, ctxt->error, ctxt->userData,
                                XML_FROM_VALID, NULL);
        }
    } else {
        xmlRaiseMemoryError(NULL, NULL, NULL, XML_FROM_VALID, NULL);
    }
}

static void
xmlDoErrValid(xmlValidCtxtPtr ctxt, xmlNodePtr node,
              xmlParserErrors code, int level,
              const xmlChar *str1, const xmlChar *str2, const xmlChar *str3,
              int int1,
              const char *msg, ...) {
    xmlParserCtxtPtr pctxt = NULL;
    va_list ap;

    if (ctxt == NULL)
        return;
    if (ctxt->flags & XML_VCTXT_USE_PCTXT)
        pctxt = ctxt->userData;

    va_start(ap, msg);
    if (pctxt != NULL) {
        xmlCtxtVErr(pctxt, node, XML_FROM_VALID, code, level,
                    str1, str2, str3, int1, msg, ap);
    } else {
        xmlGenericErrorFunc channel = NULL;
        void *data = NULL;
        int res;

        if (ctxt != NULL) {
            channel = ctxt->error;
            data = ctxt->userData;
        }
        res = xmlVRaiseError(NULL, channel, data, NULL, node,
                             XML_FROM_VALID, code, level, NULL, 0,
                             (const char *) str1, (const char *) str2,
                             (const char *) str2, int1, 0,
                             msg, ap);
        if (res < 0)
            xmlVErrMemory(ctxt);
    }
    va_end(ap);
}

/**
 * xmlErrValid:
 * @ctxt:  an XML validation parser context
 * @error:  the error number
 * @extra:  extra information
 *
 * Handle a validation error
 */
static void LIBXML_ATTR_FORMAT(3,0)
xmlErrValid(xmlValidCtxtPtr ctxt, xmlParserErrors error,
            const char *msg, const char *extra)
{
    xmlDoErrValid(ctxt, NULL, error, XML_ERR_ERROR, (const xmlChar *) extra,
                  NULL, NULL, 0, msg, extra);
}

#ifdef LIBXML_VALID_ENABLED
/**
 * xmlErrValidNode:
 * @ctxt:  an XML validation parser context
 * @node:  the node raising the error
 * @error:  the error number
 * @str1:  extra information
 * @str2:  extra information
 * @str3:  extra information
 *
 * Handle a validation error, provide contextual information
 */
static void LIBXML_ATTR_FORMAT(4,0)
xmlErrValidNode(xmlValidCtxtPtr ctxt,
                xmlNodePtr node, xmlParserErrors error,
                const char *msg, const xmlChar * str1,
                const xmlChar * str2, const xmlChar * str3)
{
    xmlDoErrValid(ctxt, node, error, XML_ERR_ERROR, str1, str2, str3, 0,
                  msg, str1, str2, str3);
}

/**
 * xmlErrValidNodeNr:
 * @ctxt:  an XML validation parser context
 * @node:  the node raising the error
 * @error:  the error number
 * @str1:  extra information
 * @int2:  extra information
 * @str3:  extra information
 *
 * Handle a validation error, provide contextual information
 */
static void LIBXML_ATTR_FORMAT(4,0)
xmlErrValidNodeNr(xmlValidCtxtPtr ctxt,
                xmlNodePtr node, xmlParserErrors error,
                const char *msg, const xmlChar * str1,
                int int2, const xmlChar * str3)
{
    xmlDoErrValid(ctxt, node, error, XML_ERR_ERROR, str1, str3, NULL, int2,
                  msg, str1, int2, str3);
}

/**
 * xmlErrValidWarning:
 * @ctxt:  an XML validation parser context
 * @node:  the node raising the error
 * @error:  the error number
 * @str1:  extra information
 * @str2:  extra information
 * @str3:  extra information
 *
 * Handle a validation error, provide contextual information
 */
static void LIBXML_ATTR_FORMAT(4,0)
xmlErrValidWarning(xmlValidCtxtPtr ctxt,
                xmlNodePtr node, xmlParserErrors error,
                const char *msg, const xmlChar * str1,
                const xmlChar * str2, const xmlChar * str3)
{
    xmlDoErrValid(ctxt, node, error, XML_ERR_WARNING, str1, str2, str3, 0,
                  msg, str1, str2, str3);
}



#ifdef LIBXML_REGEXP_ENABLED
/*
 * If regexp are enabled we can do continuous validation without the
 * need of a tree to validate the content model. this is done in each
 * callbacks.
 * Each xmlValidState represent the validation state associated to the
 * set of nodes currently open from the document root to the current element.
 */


typedef struct _xmlValidState {
    xmlElementPtr  elemDecl;  /* pointer to the content model */
    xmlNodePtr           node;    /* pointer to the current node */
    xmlRegExecCtxtPtr    exec;    /* regexp runtime */
} _xmlValidState;


static int
vstateVPush(xmlValidCtxtPtr ctxt, xmlElementPtr elemDecl, xmlNodePtr node) {
    if ((ctxt->vstateMax == 0) || (ctxt->vstateTab == NULL)) {
  ctxt->vstateMax = 10;
  ctxt->vstateTab = (xmlValidState *) xmlMalloc(ctxt->vstateMax *
                  sizeof(ctxt->vstateTab[0]));
        if (ctxt->vstateTab == NULL) {
      xmlVErrMemory(ctxt);
      return(-1);
  }
    }

    if (ctxt->vstateNr >= ctxt->vstateMax) {
        xmlValidState *tmp;

  tmp = (xmlValidState *) xmlRealloc(ctxt->vstateTab,
               2 * ctxt->vstateMax * sizeof(ctxt->vstateTab[0]));
        if (tmp == NULL) {
      xmlVErrMemory(ctxt);
      return(-1);
  }
  ctxt->vstateMax *= 2;
  ctxt->vstateTab = tmp;
    }
    ctxt->vstate = &ctxt->vstateTab[ctxt->vstateNr];
    ctxt->vstateTab[ctxt->vstateNr].elemDecl = elemDecl;
    ctxt->vstateTab[ctxt->vstateNr].node = node;
    if ((elemDecl != NULL) && (elemDecl->etype == XML_ELEMENT_TYPE_ELEMENT)) {
  if (elemDecl->contModel == NULL)
      xmlValidBuildContentModel(ctxt, elemDecl);
  if (elemDecl->contModel != NULL) {
      ctxt->vstateTab[ctxt->vstateNr].exec =
    xmlRegNewExecCtxt(elemDecl->contModel, NULL, NULL);
            if (ctxt->vstateTab[ctxt->vstateNr].exec == NULL) {
                xmlVErrMemory(ctxt);
                return(-1);
            }
  } else {
      ctxt->vstateTab[ctxt->vstateNr].exec = NULL;
      xmlErrValidNode(ctxt, (xmlNodePtr) elemDecl,
                      XML_ERR_INTERNAL_ERROR,
          "Failed to build content model regexp for %s\n",
          node->name, NULL, NULL);
  }
    }
    return(ctxt->vstateNr++);
}

static int
vstateVPop(xmlValidCtxtPtr ctxt) {
    xmlElementPtr elemDecl;

    if (ctxt->vstateNr < 1) return(-1);
    ctxt->vstateNr--;
    elemDecl = ctxt->vstateTab[ctxt->vstateNr].elemDecl;
    ctxt->vstateTab[ctxt->vstateNr].elemDecl = NULL;
    ctxt->vstateTab[ctxt->vstateNr].node = NULL;
    if ((elemDecl != NULL) && (elemDecl->etype == XML_ELEMENT_TYPE_ELEMENT)) {
  xmlRegFreeExecCtxt(ctxt->vstateTab[ctxt->vstateNr].exec);
    }
    ctxt->vstateTab[ctxt->vstateNr].exec = NULL;
    if (ctxt->vstateNr >= 1)
  ctxt->vstate = &ctxt->vstateTab[ctxt->vstateNr - 1];
    else
  ctxt->vstate = NULL;
    return(ctxt->vstateNr);
}

#else /* not LIBXML_REGEXP_ENABLED */
/*
 * If regexp are not enabled, it uses a home made algorithm less
 * complex and easier to
 * debug/maintain than a generic NFA -> DFA state based algo. The
 * only restriction is on the deepness of the tree limited by the
 * size of the occurs bitfield
 *
 * this is the content of a saved state for rollbacks
 */

#define ROLLBACK_OR 0
#define ROLLBACK_PARENT 1

typedef struct _xmlValidState {
    xmlElementContentPtr cont;  /* pointer to the content model subtree */
    xmlNodePtr           node;  /* pointer to the current node in the list */
    long                 occurs;/* bitfield for multiple occurrences */
    unsigned char        depth; /* current depth in the overall tree */
    unsigned char        state; /* ROLLBACK_XXX */
} _xmlValidState;

#define MAX_RECURSE 25000
#define MAX_DEPTH ((sizeof(_xmlValidState.occurs)) * 8)
#define CONT ctxt->vstate->cont
#define NODE ctxt->vstate->node
#define DEPTH ctxt->vstate->depth
#define OCCURS ctxt->vstate->occurs
#define STATE ctxt->vstate->state

#define OCCURRENCE (ctxt->vstate->occurs & (1 << DEPTH))
#define PARENT_OCCURRENCE (ctxt->vstate->occurs & ((1 << DEPTH) - 1))

#define SET_OCCURRENCE ctxt->vstate->occurs |= (1 << DEPTH)
#define RESET_OCCURRENCE ctxt->vstate->occurs &= ((1 << DEPTH) - 1)

static int
vstateVPush(xmlValidCtxtPtr ctxt, xmlElementContentPtr cont,
      xmlNodePtr node, unsigned char depth, long occurs,
      unsigned char state) {
    int i = ctxt->vstateNr - 1;

    if (ctxt->vstateNr > MAX_RECURSE) {
  return(-1);
    }
    if (ctxt->vstateTab == NULL) {
  ctxt->vstateMax = 8;
  ctxt->vstateTab = (xmlValidState *) xmlMalloc(
         ctxt->vstateMax * sizeof(ctxt->vstateTab[0]));
  if (ctxt->vstateTab == NULL) {
      xmlVErrMemory(ctxt);
      return(-1);
  }
    }
    if (ctxt->vstateNr >= ctxt->vstateMax) {
        xmlValidState *tmp;

        tmp = (xmlValidState *) xmlRealloc(ctxt->vstateTab,
               2 * ctxt->vstateMax * sizeof(ctxt->vstateTab[0]));
        if (tmp == NULL) {
      xmlVErrMemory(ctxt);
      return(-1);
  }
  ctxt->vstateMax *= 2;
  ctxt->vstateTab = tmp;
  ctxt->vstate = &ctxt->vstateTab[0];
    }
    /*
     * Don't push on the stack a state already here
     */
    if ((i >= 0) && (ctxt->vstateTab[i].cont == cont) &&
  (ctxt->vstateTab[i].node == node) &&
  (ctxt->vstateTab[i].depth == depth) &&
  (ctxt->vstateTab[i].occurs == occurs) &&
  (ctxt->vstateTab[i].state == state))
  return(ctxt->vstateNr);
    ctxt->vstateTab[ctxt->vstateNr].cont = cont;
    ctxt->vstateTab[ctxt->vstateNr].node = node;
    ctxt->vstateTab[ctxt->vstateNr].depth = depth;
    ctxt->vstateTab[ctxt->vstateNr].occurs = occurs;
    ctxt->vstateTab[ctxt->vstateNr].state = state;
    return(ctxt->vstateNr++);
}

static int
vstateVPop(xmlValidCtxtPtr ctxt) {
    if (ctxt->vstateNr <= 1) return(-1);
    ctxt->vstateNr--;
    ctxt->vstate = &ctxt->vstateTab[0];
    ctxt->vstate->cont =  ctxt->vstateTab[ctxt->vstateNr].cont;
    ctxt->vstate->node = ctxt->vstateTab[ctxt->vstateNr].node;
    ctxt->vstate->depth = ctxt->vstateTab[ctxt->vstateNr].depth;
    ctxt->vstate->occurs = ctxt->vstateTab[ctxt->vstateNr].occurs;
    ctxt->vstate->state = ctxt->vstateTab[ctxt->vstateNr].state;
    return(ctxt->vstateNr);
}

#endif /* LIBXML_REGEXP_ENABLED */

static int
nodeVPush(xmlValidCtxtPtr ctxt, xmlNodePtr value)
{
    if (ctxt->nodeMax <= 0) {
        ctxt->nodeMax = 4;
        ctxt->nodeTab =
            (xmlNodePtr *) xmlMalloc(ctxt->nodeMax *
                                     sizeof(ctxt->nodeTab[0]));
        if (ctxt->nodeTab == NULL) {
      xmlVErrMemory(ctxt);
            ctxt->nodeMax = 0;
            return (0);
        }
    }
    if (ctxt->nodeNr >= ctxt->nodeMax) {
        xmlNodePtr *tmp;
        tmp = (xmlNodePtr *) xmlRealloc(ctxt->nodeTab,
            ctxt->nodeMax * 2 * sizeof(ctxt->nodeTab[0]));
        if (tmp == NULL) {
      xmlVErrMemory(ctxt);
            return (0);
        }
        ctxt->nodeMax *= 2;
  ctxt->nodeTab = tmp;
    }
    ctxt->nodeTab[ctxt->nodeNr] = value;
    ctxt->node = value;
    return (ctxt->nodeNr++);
}
static xmlNodePtr
nodeVPop(xmlValidCtxtPtr ctxt)
{
    xmlNodePtr ret;

    if (ctxt->nodeNr <= 0)
        return (NULL);
    ctxt->nodeNr--;
    if (ctxt->nodeNr > 0)
        ctxt->node = ctxt->nodeTab[ctxt->nodeNr - 1];
    else
        ctxt->node = NULL;
    ret = ctxt->nodeTab[ctxt->nodeNr];
    ctxt->nodeTab[ctxt->nodeNr] = NULL;
    return (ret);
}

/* TODO: use hash table for accesses to elem and attribute definitions */


#define CHECK_DTD           \
   if (doc == NULL) return(0);         \
   else if ((doc->intSubset == NULL) &&       \
      (doc->extSubset == NULL)) return(0)

#ifdef LIBXML_REGEXP_ENABLED

/************************************************************************
 *                  *
 *    Content model validation based on the regexps   *
 *                  *
 ************************************************************************/

/**
 * xmlValidBuildAContentModel:
 * @content:  the content model
 * @ctxt:  the schema parser context
 * @name:  the element name whose content is being built
 *
 * Generate the automata sequence needed for that type
 *
 * Returns 1 if successful or 0 in case of error.
 */
static int
xmlValidBuildAContentModel(xmlElementContentPtr content,
               xmlValidCtxtPtr ctxt,
               const xmlChar *name) {
    if (content == NULL) {
  xmlErrValidNode(ctxt, NULL, XML_ERR_INTERNAL_ERROR,
      "Found NULL content in content model of %s\n",
      name, NULL, NULL);
  return(0);
    }
    switch (content->type) {
  case XML_ELEMENT_CONTENT_PCDATA:
      xmlErrValidNode(ctxt, NULL, XML_ERR_INTERNAL_ERROR,
          "Found PCDATA in content model of %s\n",
                name, NULL, NULL);
      return(0);
      break;
  case XML_ELEMENT_CONTENT_ELEMENT: {
      xmlAutomataStatePtr oldstate = ctxt->state;
      xmlChar fn[50];
      xmlChar *fullname;

      fullname = xmlBuildQName(content->name, content->prefix, fn, 50);
      if (fullname == NULL) {
          xmlVErrMemory(ctxt);
    return(0);
      }

      switch (content->ocur) {
    case XML_ELEMENT_CONTENT_ONCE:
        ctxt->state = xmlAutomataNewTransition(ctxt->am,
          ctxt->state, NULL, fullname, NULL);
        break;
    case XML_ELEMENT_CONTENT_OPT:
        ctxt->state = xmlAutomataNewTransition(ctxt->am,
          ctxt->state, NULL, fullname, NULL);
        xmlAutomataNewEpsilon(ctxt->am, oldstate, ctxt->state);
        break;
    case XML_ELEMENT_CONTENT_PLUS:
        ctxt->state = xmlAutomataNewTransition(ctxt->am,
          ctxt->state, NULL, fullname, NULL);
        xmlAutomataNewTransition(ctxt->am, ctxt->state,
                           ctxt->state, fullname, NULL);
        break;
    case XML_ELEMENT_CONTENT_MULT:
        ctxt->state = xmlAutomataNewEpsilon(ctxt->am,
              ctxt->state, NULL);
        xmlAutomataNewTransition(ctxt->am,
          ctxt->state, ctxt->state, fullname, NULL);
        break;
      }
      if ((fullname != fn) && (fullname != content->name))
    xmlFree(fullname);
      break;
  }
  case XML_ELEMENT_CONTENT_SEQ: {
      xmlAutomataStatePtr oldstate, oldend;
      xmlElementContentOccur ocur;

      /*
       * Simply iterate over the content
       */
      oldstate = ctxt->state;
      ocur = content->ocur;
      if (ocur != XML_ELEMENT_CONTENT_ONCE) {
    ctxt->state = xmlAutomataNewEpsilon(ctxt->am, oldstate, NULL);
    oldstate = ctxt->state;
      }
      do {
    if (xmlValidBuildAContentModel(content->c1, ctxt, name) == 0)
                    return(0);
    content = content->c2;
      } while ((content->type == XML_ELEMENT_CONTENT_SEQ) &&
         (content->ocur == XML_ELEMENT_CONTENT_ONCE));
      if (xmlValidBuildAContentModel(content, ctxt, name) == 0)
                return(0);
      oldend = ctxt->state;
      ctxt->state = xmlAutomataNewEpsilon(ctxt->am, oldend, NULL);
      switch (ocur) {
    case XML_ELEMENT_CONTENT_ONCE:
        break;
    case XML_ELEMENT_CONTENT_OPT:
        xmlAutomataNewEpsilon(ctxt->am, oldstate, ctxt->state);
        break;
    case XML_ELEMENT_CONTENT_MULT:
        xmlAutomataNewEpsilon(ctxt->am, oldstate, ctxt->state);
        xmlAutomataNewEpsilon(ctxt->am, oldend, oldstate);
        break;
    case XML_ELEMENT_CONTENT_PLUS:
        xmlAutomataNewEpsilon(ctxt->am, oldend, oldstate);
        break;
      }
      break;
  }
  case XML_ELEMENT_CONTENT_OR: {
      xmlAutomataStatePtr oldstate, oldend;
      xmlElementContentOccur ocur;

      ocur = content->ocur;
      if ((ocur == XML_ELEMENT_CONTENT_PLUS) ||
    (ocur == XML_ELEMENT_CONTENT_MULT)) {
    ctxt->state = xmlAutomataNewEpsilon(ctxt->am,
      ctxt->state, NULL);
      }
      oldstate = ctxt->state;
      oldend = xmlAutomataNewState(ctxt->am);

      /*
       * iterate over the subtypes and remerge the end with an
       * epsilon transition
       */
      do {
    ctxt->state = oldstate;
    if (xmlValidBuildAContentModel(content->c1, ctxt, name) == 0)
                    return(0);
    xmlAutomataNewEpsilon(ctxt->am, ctxt->state, oldend);
    content = content->c2;
      } while ((content->type == XML_ELEMENT_CONTENT_OR) &&
         (content->ocur == XML_ELEMENT_CONTENT_ONCE));
      ctxt->state = oldstate;
      if (xmlValidBuildAContentModel(content, ctxt, name) == 0)
                return(0);
      xmlAutomataNewEpsilon(ctxt->am, ctxt->state, oldend);
      ctxt->state = xmlAutomataNewEpsilon(ctxt->am, oldend, NULL);
      switch (ocur) {
    case XML_ELEMENT_CONTENT_ONCE:
        break;
    case XML_ELEMENT_CONTENT_OPT:
        xmlAutomataNewEpsilon(ctxt->am, oldstate, ctxt->state);
        break;
    case XML_ELEMENT_CONTENT_MULT:
        xmlAutomataNewEpsilon(ctxt->am, oldstate, ctxt->state);
        xmlAutomataNewEpsilon(ctxt->am, oldend, oldstate);
        break;
    case XML_ELEMENT_CONTENT_PLUS:
        xmlAutomataNewEpsilon(ctxt->am, oldend, oldstate);
        break;
      }
      break;
  }
  default:
      xmlErrValid(ctxt, XML_ERR_INTERNAL_ERROR,
                  "ContentModel broken for element %s\n",
      (const char *) name);
      return(0);
    }
    return(1);
}
/**
 * xmlValidBuildContentModel:
 * @ctxt:  a validation context
 * @elem:  an element declaration node
 *
 * DEPRECATED: Internal function, don't use.
 *
 * (Re)Build the automata associated to the content model of this
 * element
 *
 * Returns 1 in case of success, 0 in case of error
 */
int
xmlValidBuildContentModel(xmlValidCtxtPtr ctxt, xmlElementPtr elem) {
    int ret = 0;

    if ((ctxt == NULL) || (elem == NULL))
  return(0);
    if (elem->type != XML_ELEMENT_DECL)
  return(0);
    if (elem->etype != XML_ELEMENT_TYPE_ELEMENT)
  return(1);
    /* TODO: should we rebuild in this case ? */
    if (elem->contModel != NULL) {
  if (!xmlRegexpIsDeterminist(elem->contModel)) {
      ctxt->valid = 0;
      return(0);
  }
  return(1);
    }

    ctxt->am = xmlNewAutomata();
    if (ctxt->am == NULL) {
        xmlVErrMemory(ctxt);
  return(0);
    }
    ctxt->state = xmlAutomataGetInitState(ctxt->am);
    if (xmlValidBuildAContentModel(elem->content, ctxt, elem->name) == 0)
        goto done;
    xmlAutomataSetFinalState(ctxt->am, ctxt->state);
    elem->contModel = xmlAutomataCompile(ctxt->am);
    if (elem->contModel == NULL) {
        xmlVErrMemory(ctxt);
        goto done;
    }
    if (xmlRegexpIsDeterminist(elem->contModel) != 1) {
  char expr[5000];
  expr[0] = 0;
  xmlSnprintfElementContent(expr, 5000, elem->content, 1);
  xmlErrValidNode(ctxt, (xmlNodePtr) elem,
                  XML_DTD_CONTENT_NOT_DETERMINIST,
         "Content model of %s is not deterministic: %s\n",
         elem->name, BAD_CAST expr, NULL);
        ctxt->valid = 0;
  goto done;
    }

    ret = 1;

done:
    ctxt->state = NULL;
    xmlFreeAutomata(ctxt->am);
    ctxt->am = NULL;
    return(ret);
}

#endif /* LIBXML_REGEXP_ENABLED */

/****************************************************************
 *                *
 *  Util functions for data allocation/deallocation   *
 *                *
 ****************************************************************/

/**
 * xmlNewValidCtxt:
 *
 * Allocate a validation context structure.
 *
 * Returns NULL if not, otherwise the new validation context structure
 */
xmlValidCtxtPtr xmlNewValidCtxt(void) {
    xmlValidCtxtPtr ret;

    ret = xmlMalloc(sizeof (xmlValidCtxt));
    if (ret == NULL)
  return (NULL);

    (void) memset(ret, 0, sizeof (xmlValidCtxt));

    return (ret);
}

/**
 * xmlFreeValidCtxt:
 * @cur:  the validation context to free
 *
 * Free a validation context structure.
 */
void
xmlFreeValidCtxt(xmlValidCtxtPtr cur) {
    if (cur == NULL)
        return;
    if (cur->vstateTab != NULL)
        xmlFree(cur->vstateTab);
    if (cur->nodeTab != NULL)
        xmlFree(cur->nodeTab);
    xmlFree(cur);
}

#endif /* LIBXML_VALID_ENABLED */

/**
 * xmlNewDocElementContent:
 * @doc:  the document
 * @name:  the subelement name or NULL
 * @type:  the type of element content decl
 *
 * Allocate an element content structure for the document.
 *
 * Returns NULL if not, otherwise the new element content structure
 */
xmlElementContentPtr
xmlNewDocElementContent(xmlDocPtr doc, const xmlChar *name,
                        xmlElementContentType type) {
    xmlElementContentPtr ret;
    xmlDictPtr dict = NULL;

    if (doc != NULL)
        dict = doc->dict;

    switch(type) {
  case XML_ELEMENT_CONTENT_ELEMENT:
      if (name == NULL) {
          xmlErrValid(NULL, XML_ERR_INTERNAL_ERROR,
      "xmlNewElementContent : name == NULL !\n",
      NULL);
      }
      break;
        case XML_ELEMENT_CONTENT_PCDATA:
  case XML_ELEMENT_CONTENT_SEQ:
  case XML_ELEMENT_CONTENT_OR:
      if (name != NULL) {
          xmlErrValid(NULL, XML_ERR_INTERNAL_ERROR,
      "xmlNewElementContent : name != NULL !\n",
      NULL);
      }
      break;
  default:
      xmlErrValid(NULL, XML_ERR_INTERNAL_ERROR,
        "Internal: ELEMENT content corrupted invalid type\n",
        NULL);
      return(NULL);
    }
    ret = (xmlElementContentPtr) xmlMalloc(sizeof(xmlElementContent));
    if (ret == NULL)
  return(NULL);
    memset(ret, 0, sizeof(xmlElementContent));
    ret->type = type;
    ret->ocur = XML_ELEMENT_CONTENT_ONCE;
    if (name != NULL) {
        int l;
  const xmlChar *tmp;

  tmp = xmlSplitQName3(name, &l);
  if (tmp == NULL) {
      if (dict == NULL)
    ret->name = xmlStrdup(name);
      else
          ret->name = xmlDictLookup(dict, name, -1);
  } else {
      if (dict == NULL) {
    ret->prefix = xmlStrndup(name, l);
    ret->name = xmlStrdup(tmp);
      } else {
          ret->prefix = xmlDictLookup(dict, name, l);
    ret->name = xmlDictLookup(dict, tmp, -1);
      }
            if (ret->prefix == NULL)
                goto error;
  }
        if (ret->name == NULL)
            goto error;
    }
    return(ret);

error:
    xmlFreeDocElementContent(doc, ret);
    return(NULL);
}

/**
 * xmlNewElementContent:
 * @name:  the subelement name or NULL
 * @type:  the type of element content decl
 *
 * Allocate an element content structure.
 * Deprecated in favor of xmlNewDocElementContent
 *
 * Returns NULL if not, otherwise the new element content structure
 */
xmlElementContentPtr
xmlNewElementContent(const xmlChar *name, xmlElementContentType type) {
    return(xmlNewDocElementContent(NULL, name, type));
}

/**
 * xmlCopyDocElementContent:
 * @doc:  the document owning the element declaration
 * @cur:  An element content pointer.
 *
 * Build a copy of an element content description.
 *
 * Returns the new xmlElementContentPtr or NULL in case of error.
 */
xmlElementContentPtr
xmlCopyDocElementContent(xmlDocPtr doc, xmlElementContentPtr cur) {
    xmlElementContentPtr ret = NULL, prev = NULL, tmp;
    xmlDictPtr dict = NULL;

    if (cur == NULL) return(NULL);

    if (doc != NULL)
        dict = doc->dict;

    ret = (xmlElementContentPtr) xmlMalloc(sizeof(xmlElementContent));
    if (ret == NULL)
  return(NULL);
    memset(ret, 0, sizeof(xmlElementContent));
    ret->type = cur->type;
    ret->ocur = cur->ocur;
    if (cur->name != NULL) {
  if (dict)
      ret->name = xmlDictLookup(dict, cur->name, -1);
  else
      ret->name = xmlStrdup(cur->name);
        if (ret->name == NULL)
            goto error;
    }

    if (cur->prefix != NULL) {
  if (dict)
      ret->prefix = xmlDictLookup(dict, cur->prefix, -1);
  else
      ret->prefix = xmlStrdup(cur->prefix);
        if (ret->prefix == NULL)
            goto error;
    }
    if (cur->c1 != NULL) {
        ret->c1 = xmlCopyDocElementContent(doc, cur->c1);
        if (ret->c1 == NULL)
            goto error;
  ret->c1->parent = ret;
    }
    if (cur->c2 != NULL) {
        prev = ret;
  cur = cur->c2;
  while (cur != NULL) {
      tmp = (xmlElementContentPtr) xmlMalloc(sizeof(xmlElementContent));
      if (tmp == NULL)
                goto error;
      memset(tmp, 0, sizeof(xmlElementContent));
      tmp->type = cur->type;
      tmp->ocur = cur->ocur;
      prev->c2 = tmp;
      tmp->parent = prev;
      if (cur->name != NULL) {
    if (dict)
        tmp->name = xmlDictLookup(dict, cur->name, -1);
    else
        tmp->name = xmlStrdup(cur->name);
                if (tmp->name == NULL)
                    goto error;
      }

      if (cur->prefix != NULL) {
    if (dict)
        tmp->prefix = xmlDictLookup(dict, cur->prefix, -1);
    else
        tmp->prefix = xmlStrdup(cur->prefix);
                if (tmp->prefix == NULL)
                    goto error;
      }
      if (cur->c1 != NULL) {
          tmp->c1 = xmlCopyDocElementContent(doc,cur->c1);
          if (tmp->c1 == NULL)
                    goto error;
    tmp->c1->parent = tmp;
            }
      prev = tmp;
      cur = cur->c2;
  }
    }
    return(ret);

error:
    xmlFreeElementContent(ret);
    return(NULL);
}

/**
 * xmlCopyElementContent:
 * @cur:  An element content pointer.
 *
 * Build a copy of an element content description.
 * Deprecated, use xmlCopyDocElementContent instead
 *
 * Returns the new xmlElementContentPtr or NULL in case of error.
 */
xmlElementContentPtr
xmlCopyElementContent(xmlElementContentPtr cur) {
    return(xmlCopyDocElementContent(NULL, cur));
}

/**
 * xmlFreeDocElementContent:
 * @doc: the document owning the element declaration
 * @cur:  the element content tree to free
 *
 * Free an element content structure. The whole subtree is removed.
 */
void
xmlFreeDocElementContent(xmlDocPtr doc, xmlElementContentPtr cur) {
    xmlDictPtr dict = NULL;
    size_t depth = 0;

    if (cur == NULL)
        return;
    if (doc != NULL)
        dict = doc->dict;

    while (1) {
        xmlElementContentPtr parent;

        while ((cur->c1 != NULL) || (cur->c2 != NULL)) {
            cur = (cur->c1 != NULL) ? cur->c1 : cur->c2;
            depth += 1;
        }

  switch (cur->type) {
      case XML_ELEMENT_CONTENT_PCDATA:
      case XML_ELEMENT_CONTENT_ELEMENT:
      case XML_ELEMENT_CONTENT_SEQ:
      case XML_ELEMENT_CONTENT_OR:
    break;
      default:
    xmlErrValid(NULL, XML_ERR_INTERNAL_ERROR,
      "Internal: ELEMENT content corrupted invalid type\n",
      NULL);
    return;
  }
  if (dict) {
      if ((cur->name != NULL) && (!xmlDictOwns(dict, cur->name)))
          xmlFree((xmlChar *) cur->name);
      if ((cur->prefix != NULL) && (!xmlDictOwns(dict, cur->prefix)))
          xmlFree((xmlChar *) cur->prefix);
  } else {
      if (cur->name != NULL) xmlFree((xmlChar *) cur->name);
      if (cur->prefix != NULL) xmlFree((xmlChar *) cur->prefix);
  }
        parent = cur->parent;
        if ((depth == 0) || (parent == NULL)) {
            xmlFree(cur);
            break;
        }
        if (cur == parent->c1)
            parent->c1 = NULL;
        else
            parent->c2 = NULL;
  xmlFree(cur);

        if (parent->c2 != NULL) {
      cur = parent->c2;
        } else {
            depth -= 1;
            cur = parent;
        }
    }
}

/**
 * xmlFreeElementContent:
 * @cur:  the element content tree to free
 *
 * Free an element content structure. The whole subtree is removed.
 * Deprecated, use xmlFreeDocElementContent instead
 */
void
xmlFreeElementContent(xmlElementContentPtr cur) {
    xmlFreeDocElementContent(NULL, cur);
}

#ifdef LIBXML_OUTPUT_ENABLED
/**
 * xmlSprintfElementContent:
 * @buf:  an output buffer
 * @content:  An element table
 * @englob: 1 if one must print the englobing parenthesis, 0 otherwise
 *
 * Deprecated, unsafe, use xmlSnprintfElementContent
 */
void
xmlSprintfElementContent(char *buf ATTRIBUTE_UNUSED,
                   xmlElementContentPtr content ATTRIBUTE_UNUSED,
       int englob ATTRIBUTE_UNUSED) {
}
#endif /* LIBXML_OUTPUT_ENABLED */

/**
 * xmlSnprintfElementContent:
 * @buf:  an output buffer
 * @size:  the buffer size
 * @content:  An element table
 * @englob: 1 if one must print the englobing parenthesis, 0 otherwise
 *
 * This will dump the content of the element content definition
 * Intended just for the debug routine
 */
void
xmlSnprintfElementContent(char *buf, int size, xmlElementContentPtr content, int englob) {
    int len;

    if (content == NULL) return;
    len = strlen(buf);
    if (size - len < 50) {
  if ((size - len > 4) && (buf[len - 1] != '.'))
      strcat(buf, " ...");
  return;
    }
    if (englob) strcat(buf, "(");
    switch (content->type) {
        case XML_ELEMENT_CONTENT_PCDATA:
            strcat(buf, "#PCDATA");
      break;
  case XML_ELEMENT_CONTENT_ELEMENT: {
            int qnameLen = xmlStrlen(content->name);

      if (content->prefix != NULL)
                qnameLen += xmlStrlen(content->prefix) + 1;
      if (size - len < qnameLen + 10) {
    strcat(buf, " ...");
    return;
      }
      if (content->prefix != NULL) {
    strcat(buf, (char *) content->prefix);
    strcat(buf, ":");
      }
      if (content->name != NULL)
    strcat(buf, (char *) content->name);
      break;
        }
  case XML_ELEMENT_CONTENT_SEQ:
      if ((content->c1->type == XML_ELEMENT_CONTENT_OR) ||
          (content->c1->type == XML_ELEMENT_CONTENT_SEQ))
    xmlSnprintfElementContent(buf, size, content->c1, 1);
      else
    xmlSnprintfElementContent(buf, size, content->c1, 0);
      len = strlen(buf);
      if (size - len < 50) {
    if ((size - len > 4) && (buf[len - 1] != '.'))
        strcat(buf, " ...");
    return;
      }
            strcat(buf, " , ");
      if (((content->c2->type == XML_ELEMENT_CONTENT_OR) ||
     (content->c2->ocur != XML_ELEMENT_CONTENT_ONCE)) &&
    (content->c2->type != XML_ELEMENT_CONTENT_ELEMENT))
    xmlSnprintfElementContent(buf, size, content->c2, 1);
      else
    xmlSnprintfElementContent(buf, size, content->c2, 0);
      break;
  case XML_ELEMENT_CONTENT_OR:
      if ((content->c1->type == XML_ELEMENT_CONTENT_OR) ||
          (content->c1->type == XML_ELEMENT_CONTENT_SEQ))
    xmlSnprintfElementContent(buf, size, content->c1, 1);
      else
    xmlSnprintfElementContent(buf, size, content->c1, 0);
      len = strlen(buf);
      if (size - len < 50) {
    if ((size - len > 4) && (buf[len - 1] != '.'))
        strcat(buf, " ...");
    return;
      }
            strcat(buf, " | ");
      if (((content->c2->type == XML_ELEMENT_CONTENT_SEQ) ||
     (content->c2->ocur != XML_ELEMENT_CONTENT_ONCE)) &&
    (content->c2->type != XML_ELEMENT_CONTENT_ELEMENT))
    xmlSnprintfElementContent(buf, size, content->c2, 1);
      else
    xmlSnprintfElementContent(buf, size, content->c2, 0);
      break;
    }
    if (size - strlen(buf) <= 2) return;
    if (englob)
        strcat(buf, ")");
    switch (content->ocur) {
        case XML_ELEMENT_CONTENT_ONCE:
      break;
        case XML_ELEMENT_CONTENT_OPT:
      strcat(buf, "?");
      break;
        case XML_ELEMENT_CONTENT_MULT:
      strcat(buf, "*");
      break;
        case XML_ELEMENT_CONTENT_PLUS:
      strcat(buf, "+");
      break;
    }
}

/****************************************************************
 *                *
 *  Registration of DTD declarations      *
 *                *
 ****************************************************************/

/**
 * xmlFreeElement:
 * @elem:  An element
 *
 * Deallocate the memory used by an element definition
 */
static void
xmlFreeElement(xmlElementPtr elem) {
    if (elem == NULL) return;
    xmlUnlinkNode((xmlNodePtr) elem);
    xmlFreeDocElementContent(elem->doc, elem->content);
    if (elem->name != NULL)
  xmlFree((xmlChar *) elem->name);
    if (elem->prefix != NULL)
  xmlFree((xmlChar *) elem->prefix);
#ifdef LIBXML_REGEXP_ENABLED
    if (elem->contModel != NULL)
  xmlRegFreeRegexp(elem->contModel);
#endif
    xmlFree(elem);
}


/**
 * xmlAddElementDecl:
 * @ctxt:  the validation context
 * @dtd:  pointer to the DTD
 * @name:  the entity name
 * @type:  the element type
 * @content:  the element content tree or NULL
 *
 * Register a new element declaration
 *
 * Returns NULL if not, otherwise the entity
 */
xmlElementPtr
xmlAddElementDecl(xmlValidCtxtPtr ctxt,
                  xmlDtdPtr dtd, const xmlChar *name,
                  xmlElementTypeVal type,
      xmlElementContentPtr content) {
    xmlElementPtr ret;
    xmlElementTablePtr table;
    xmlAttributePtr oldAttributes = NULL;
    const xmlChar *localName;
    xmlChar *prefix = NULL;

    if (dtd == NULL) {
  return(NULL);
    }
    if (name == NULL) {
  return(NULL);
    }

    switch (type) {
        case XML_ELEMENT_TYPE_EMPTY:
      if (content != NULL) {
    xmlErrValid(ctxt, XML_DTD_CONTENT_ERROR,
            "xmlAddElementDecl: content != NULL for EMPTY\n",
      NULL);
    return(NULL);
      }
      break;
  case XML_ELEMENT_TYPE_ANY:
      if (content != NULL) {
    xmlErrValid(ctxt, XML_DTD_CONTENT_ERROR,
            "xmlAddElementDecl: content != NULL for ANY\n",
      NULL);
    return(NULL);
      }
      break;
  case XML_ELEMENT_TYPE_MIXED:
      if (content == NULL) {
    xmlErrValid(ctxt, XML_DTD_CONTENT_ERROR,
            "xmlAddElementDecl: content == NULL for MIXED\n",
      NULL);
    return(NULL);
      }
      break;
  case XML_ELEMENT_TYPE_ELEMENT:
      if (content == NULL) {
    xmlErrValid(ctxt, XML_DTD_CONTENT_ERROR,
            "xmlAddElementDecl: content == NULL for ELEMENT\n",
      NULL);
    return(NULL);
      }
      break;
  default:
      xmlErrValid(ctxt, XML_ERR_ARGUMENT,
        "xmlAddElementDecl: invalid type\n", NULL);
      return(NULL);
    }

    /*
     * check if name is a QName
     */
    localName = xmlSplitQName4(name, &prefix);
    if (localName == NULL)
        goto mem_error;

    /*
     * Create the Element table if needed.
     */
    table = (xmlElementTablePtr) dtd->elements;
    if (table == NULL) {
  xmlDictPtr dict = NULL;

  if (dtd->doc != NULL)
      dict = dtd->doc->dict;
        table = xmlHashCreateDict(0, dict);
        if (table == NULL)
            goto mem_error;
  dtd->elements = (void *) table;
    }

    /*
     * lookup old attributes inserted on an undefined element in the
     * internal subset.
     */
    if ((dtd->doc != NULL) && (dtd->doc->intSubset != NULL)) {
  ret = xmlHashLookup2(dtd->doc->intSubset->elements, localName, prefix);
  if ((ret != NULL) && (ret->etype == XML_ELEMENT_TYPE_UNDEFINED)) {
      oldAttributes = ret->attributes;
      ret->attributes = NULL;
      xmlHashRemoveEntry2(dtd->doc->intSubset->elements, localName, prefix,
                                NULL);
      xmlFreeElement(ret);
  }
    }

    /*
     * The element may already be present if one of its attribute
     * was registered first
     */
    ret = xmlHashLookup2(table, localName, prefix);
    if (ret != NULL) {
  if (ret->etype != XML_ELEMENT_TYPE_UNDEFINED) {
#ifdef LIBXML_VALID_ENABLED
      /*
       * The element is already defined in this DTD.
       */
      xmlErrValidNode(ctxt, (xmlNodePtr) dtd, XML_DTD_ELEM_REDEFINED,
                      "Redefinition of element %s\n",
          name, NULL, NULL);
#endif /* LIBXML_VALID_ENABLED */
            if (prefix != NULL)
          xmlFree(prefix);
      return(NULL);
  }
  if (prefix != NULL) {
      xmlFree(prefix);
      prefix = NULL;
  }
    } else {
        int res;

  ret = (xmlElementPtr) xmlMalloc(sizeof(xmlElement));
  if (ret == NULL)
            goto mem_error;
  memset(ret, 0, sizeof(xmlElement));
  ret->type = XML_ELEMENT_DECL;

  /*
   * fill the structure.
   */
  ret->name = xmlStrdup(localName);
  if (ret->name == NULL) {
      xmlFree(ret);
      goto mem_error;
  }
  ret->prefix = prefix;
        prefix = NULL;

  /*
   * Validity Check:
   * Insertion must not fail
   */
        res = xmlHashAdd2(table, localName, ret->prefix, ret);
        if (res <= 0) {
      xmlFreeElement(ret);
            goto mem_error;
  }
  /*
   * For new element, may have attributes from earlier
   * definition in internal subset
   */
  ret->attributes = oldAttributes;
    }

    /*
     * Finish to fill the structure.
     */
    ret->etype = type;
    /*
     * Avoid a stupid copy when called by the parser
     * and flag it by setting a special parent value
     * so the parser doesn't unallocate it.
     */
    if (content != NULL) {
        if ((ctxt != NULL) && (ctxt->flags & XML_VCTXT_USE_PCTXT)) {
            ret->content = content;
            content->parent = (xmlElementContentPtr) 1;
        } else if (content != NULL){
            ret->content = xmlCopyDocElementContent(dtd->doc, content);
            if (ret->content == NULL)
                goto mem_error;
        }
    }

    /*
     * Link it to the DTD
     */
    ret->parent = dtd;
    ret->doc = dtd->doc;
    if (dtd->last == NULL) {
  dtd->children = dtd->last = (xmlNodePtr) ret;
    } else {
        dtd->last->next = (xmlNodePtr) ret;
  ret->prev = dtd->last;
  dtd->last = (xmlNodePtr) ret;
    }
    if (prefix != NULL)
  xmlFree(prefix);
    return(ret);

mem_error:
    xmlVErrMemory(ctxt);
    if (prefix != NULL)
        xmlFree(prefix);
    return(NULL);
}

static void
xmlFreeElementTableEntry(void *elem, const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlFreeElement((xmlElementPtr) elem);
}

/**
 * xmlFreeElementTable:
 * @table:  An element table
 *
 * Deallocate the memory used by an element hash table.
 */
void
xmlFreeElementTable(xmlElementTablePtr table) {
    xmlHashFree(table, xmlFreeElementTableEntry);
}

/**
 * xmlCopyElement:
 * @elem:  An element
 *
 * Build a copy of an element.
 *
 * Returns the new xmlElementPtr or NULL in case of error.
 */
static void *
xmlCopyElement(void *payload, const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlElementPtr elem = (xmlElementPtr) payload;
    xmlElementPtr cur;

    cur = (xmlElementPtr) xmlMalloc(sizeof(xmlElement));
    if (cur == NULL)
  return(NULL);
    memset(cur, 0, sizeof(xmlElement));
    cur->type = XML_ELEMENT_DECL;
    cur->etype = elem->etype;
    if (elem->name != NULL) {
  cur->name = xmlStrdup(elem->name);
        if (cur->name == NULL)
            goto error;
    }
    if (elem->prefix != NULL) {
  cur->prefix = xmlStrdup(elem->prefix);
        if (cur->prefix == NULL)
            goto error;
    }
    if (elem->content != NULL) {
        cur->content = xmlCopyElementContent(elem->content);
        if (cur->content == NULL)
            goto error;
    }
    /* TODO : rebuild the attribute list on the copy */
    cur->attributes = NULL;
    return(cur);

error:
    xmlFreeElement(cur);
    return(NULL);
}

/**
 * xmlCopyElementTable:
 * @table:  An element table
 *
 * Build a copy of an element table.
 *
 * Returns the new xmlElementTablePtr or NULL in case of error.
 */
xmlElementTablePtr
xmlCopyElementTable(xmlElementTablePtr table) {
    return(xmlHashCopySafe(table, xmlCopyElement, xmlFreeElementTableEntry));
}

#ifdef LIBXML_OUTPUT_ENABLED
/**
 * xmlDumpElementDecl:
 * @buf:  the XML buffer output
 * @elem:  An element table
 *
 * DEPRECATED: Use xmlSaveTree.
 *
 * This will dump the content of the element declaration as an XML
 * DTD definition
 */
void
xmlDumpElementDecl(xmlBufferPtr buf, xmlElementPtr elem) {
    xmlSaveCtxtPtr save;

    if ((buf == NULL) || (elem == NULL))
        return;

    save = xmlSaveToBuffer(buf, NULL, 0);
    xmlSaveTree(save, (xmlNodePtr) elem);
    if (xmlSaveFinish(save) != XML_ERR_OK)
        xmlFree(xmlBufferDetach(buf));
}

/**
 * xmlDumpElementDeclScan:
 * @elem:  An element table
 * @buf:  the XML buffer output
 *
 * This routine is used by the hash scan function.  It just reverses
 * the arguments.
 */
static void
xmlDumpElementDeclScan(void *elem, void *save,
                       const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlSaveTree(save, elem);
}

/**
 * xmlDumpElementTable:
 * @buf:  the XML buffer output
 * @table:  An element table
 *
 * DEPRECATED: Don't use.
 *
 * This will dump the content of the element table as an XML DTD definition
 */
void
xmlDumpElementTable(xmlBufferPtr buf, xmlElementTablePtr table) {
    xmlSaveCtxtPtr save;

    if ((buf == NULL) || (table == NULL))
        return;

    save = xmlSaveToBuffer(buf, NULL, 0);
    xmlHashScan(table, xmlDumpElementDeclScan, save);
    if (xmlSaveFinish(save) != XML_ERR_OK)
        xmlFree(xmlBufferDetach(buf));
}
#endif /* LIBXML_OUTPUT_ENABLED */

/**
 * xmlCreateEnumeration:
 * @name:  the enumeration name or NULL
 *
 * create and initialize an enumeration attribute node.
 *
 * Returns the xmlEnumerationPtr just created or NULL in case
 *                of error.
 */
xmlEnumerationPtr
xmlCreateEnumeration(const xmlChar *name) {
    xmlEnumerationPtr ret;

    ret = (xmlEnumerationPtr) xmlMalloc(sizeof(xmlEnumeration));
    if (ret == NULL)
        return(NULL);
    memset(ret, 0, sizeof(xmlEnumeration));

    if (name != NULL) {
        ret->name = xmlStrdup(name);
        if (ret->name == NULL) {
            xmlFree(ret);
            return(NULL);
        }
    }

    return(ret);
}

/**
 * xmlFreeEnumeration:
 * @cur:  the tree to free.
 *
 * free an enumeration attribute node (recursive).
 */
void
xmlFreeEnumeration(xmlEnumerationPtr cur) {
    while (cur != NULL) {
        xmlEnumerationPtr next = cur->next;

        xmlFree((xmlChar *) cur->name);
        xmlFree(cur);

        cur = next;
    }
}

/**
 * xmlCopyEnumeration:
 * @cur:  the tree to copy.
 *
 * Copy an enumeration attribute node (recursive).
 *
 * Returns the xmlEnumerationPtr just created or NULL in case
 *                of error.
 */
xmlEnumerationPtr
xmlCopyEnumeration(xmlEnumerationPtr cur) {
    xmlEnumerationPtr ret = NULL;
    xmlEnumerationPtr last = NULL;

    while (cur != NULL) {
        xmlEnumerationPtr copy = xmlCreateEnumeration(cur->name);

        if (copy == NULL) {
            xmlFreeEnumeration(ret);
            return(NULL);
        }

        if (ret == NULL) {
            ret = last = copy;
        } else {
            last->next = copy;
            last = copy;
        }

        cur = cur->next;
    }

    return(ret);
}

#ifdef LIBXML_VALID_ENABLED
/**
 * xmlScanIDAttributeDecl:
 * @ctxt:  the validation context
 * @elem:  the element name
 * @err: whether to raise errors here
 *
 * Verify that the element don't have too many ID attributes
 * declared.
 *
 * Returns the number of ID attributes found.
 */
static int
xmlScanIDAttributeDecl(xmlValidCtxtPtr ctxt, xmlElementPtr elem, int err) {
    xmlAttributePtr cur;
    int ret = 0;

    if (elem == NULL) return(0);
    cur = elem->attributes;
    while (cur != NULL) {
        if (cur->atype == XML_ATTRIBUTE_ID) {
      ret ++;
      if ((ret > 1) && (err))
    xmlErrValidNode(ctxt, (xmlNodePtr) elem, XML_DTD_MULTIPLE_ID,
         "Element %s has too many ID attributes defined : %s\n",
           elem->name, cur->name, NULL);
  }
  cur = cur->nexth;
    }
    return(ret);
}
#endif /* LIBXML_VALID_ENABLED */

/**
 * xmlFreeAttribute:
 * @elem:  An attribute
 *
 * Deallocate the memory used by an attribute definition
 */
static void
xmlFreeAttribute(xmlAttributePtr attr) {
    xmlDictPtr dict;

    if (attr == NULL) return;
    if (attr->doc != NULL)
  dict = attr->doc->dict;
    else
  dict = NULL;
    xmlUnlinkNode((xmlNodePtr) attr);
    if (attr->tree != NULL)
        xmlFreeEnumeration(attr->tree);
    if (dict) {
        if ((attr->elem != NULL) && (!xmlDictOwns(dict, attr->elem)))
      xmlFree((xmlChar *) attr->elem);
        if ((attr->name != NULL) && (!xmlDictOwns(dict, attr->name)))
      xmlFree((xmlChar *) attr->name);
        if ((attr->prefix != NULL) && (!xmlDictOwns(dict, attr->prefix)))
      xmlFree((xmlChar *) attr->prefix);
        if ((attr->defaultValue != NULL) &&
      (!xmlDictOwns(dict, attr->defaultValue)))
      xmlFree((xmlChar *) attr->defaultValue);
    } else {
  if (attr->elem != NULL)
      xmlFree((xmlChar *) attr->elem);
  if (attr->name != NULL)
      xmlFree((xmlChar *) attr->name);
  if (attr->defaultValue != NULL)
      xmlFree((xmlChar *) attr->defaultValue);
  if (attr->prefix != NULL)
      xmlFree((xmlChar *) attr->prefix);
    }
    xmlFree(attr);
}


/**
 * xmlAddAttributeDecl:
 * @ctxt:  the validation context
 * @dtd:  pointer to the DTD
 * @elem:  the element name
 * @name:  the attribute name
 * @ns:  the attribute namespace prefix
 * @type:  the attribute type
 * @def:  the attribute default type
 * @defaultValue:  the attribute default value
 * @tree:  if it's an enumeration, the associated list
 *
 * Register a new attribute declaration
 * Note that @tree becomes the ownership of the DTD
 *
 * Returns NULL if not new, otherwise the attribute decl
 */
xmlAttributePtr
xmlAddAttributeDecl(xmlValidCtxtPtr ctxt,
                    xmlDtdPtr dtd, const xmlChar *elem,
                    const xmlChar *name, const xmlChar *ns,
        xmlAttributeType type, xmlAttributeDefault def,
        const xmlChar *defaultValue, xmlEnumerationPtr tree) {
    xmlAttributePtr ret = NULL;
    xmlAttributeTablePtr table;
    xmlElementPtr elemDef;
    xmlDictPtr dict = NULL;
    int res;

    if (dtd == NULL) {
  xmlFreeEnumeration(tree);
  return(NULL);
    }
    if (name == NULL) {
  xmlFreeEnumeration(tree);
  return(NULL);
    }
    if (elem == NULL) {
  xmlFreeEnumeration(tree);
  return(NULL);
    }
    if (dtd->doc != NULL)
  dict = dtd->doc->dict;

#ifdef LIBXML_VALID_ENABLED
    /*
     * Check the type and possibly the default value.
     */
    switch (type) {
        case XML_ATTRIBUTE_CDATA:
      break;
        case XML_ATTRIBUTE_ID:
      break;
        case XML_ATTRIBUTE_IDREF:
      break;
        case XML_ATTRIBUTE_IDREFS:
      break;
        case XML_ATTRIBUTE_ENTITY:
      break;
        case XML_ATTRIBUTE_ENTITIES:
      break;
        case XML_ATTRIBUTE_NMTOKEN:
      break;
        case XML_ATTRIBUTE_NMTOKENS:
      break;
        case XML_ATTRIBUTE_ENUMERATION:
      break;
        case XML_ATTRIBUTE_NOTATION:
      break;
  default:
      xmlErrValid(ctxt, XML_ERR_ARGUMENT,
        "xmlAddAttributeDecl: invalid type\n", NULL);
      xmlFreeEnumeration(tree);
      return(NULL);
    }
    if ((defaultValue != NULL) &&
        (!xmlValidateAttributeValueInternal(dtd->doc, type, defaultValue))) {
  xmlErrValidNode(ctxt, (xmlNodePtr) dtd, XML_DTD_ATTRIBUTE_DEFAULT,
                  "Attribute %s of %s: invalid default value\n",
                  elem, name, defaultValue);
  defaultValue = NULL;
  if (ctxt != NULL)
      ctxt->valid = 0;
    }
#endif /* LIBXML_VALID_ENABLED */

    /*
     * Check first that an attribute defined in the external subset wasn't
     * already defined in the internal subset
     */
    if ((dtd->doc != NULL) && (dtd->doc->extSubset == dtd) &&
  (dtd->doc->intSubset != NULL) &&
  (dtd->doc->intSubset->attributes != NULL)) {
        ret = xmlHashLookup3(dtd->doc->intSubset->attributes, name, ns, elem);
  if (ret != NULL) {
      xmlFreeEnumeration(tree);
      return(NULL);
  }
    }

    /*
     * Create the Attribute table if needed.
     */
    table = (xmlAttributeTablePtr) dtd->attributes;
    if (table == NULL) {
        table = xmlHashCreateDict(0, dict);
  dtd->attributes = (void *) table;
    }
    if (table == NULL)
        goto mem_error;

    ret = (xmlAttributePtr) xmlMalloc(sizeof(xmlAttribute));
    if (ret == NULL)
        goto mem_error;
    memset(ret, 0, sizeof(xmlAttribute));
    ret->type = XML_ATTRIBUTE_DECL;

    /*
     * fill the structure.
     */
    ret->atype = type;
    /*
     * doc must be set before possible error causes call
     * to xmlFreeAttribute (because it's used to check on
     * dict use)
     */
    ret->doc = dtd->doc;
    if (dict) {
  ret->name = xmlDictLookup(dict, name, -1);
  ret->elem = xmlDictLookup(dict, elem, -1);
    } else {
  ret->name = xmlStrdup(name);
  ret->elem = xmlStrdup(elem);
    }
    if ((ret->name == NULL) || (ret->elem == NULL))
        goto mem_error;
    if (ns != NULL) {
        if (dict)
            ret->prefix = xmlDictLookup(dict, ns, -1);
        else
            ret->prefix = xmlStrdup(ns);
        if (ret->prefix == NULL)
            goto mem_error;
    }
    ret->def = def;
    ret->tree = tree;
    tree = NULL;
    if (defaultValue != NULL) {
        if (dict)
      ret->defaultValue = xmlDictLookup(dict, defaultValue, -1);
  else
      ret->defaultValue = xmlStrdup(defaultValue);
        if (ret->defaultValue == NULL)
            goto mem_error;
    }

    elemDef = xmlGetDtdElementDesc2(ctxt, dtd, elem);
    if (elemDef == NULL)
        goto mem_error;

    /*
     * Validity Check:
     * Search the DTD for previous declarations of the ATTLIST
     */
    res = xmlHashAdd3(table, ret->name, ret->prefix, ret->elem, ret);
    if (res <= 0) {
        if (res < 0)
            goto mem_error;
#ifdef LIBXML_VALID_ENABLED
        /*
         * The attribute is already defined in this DTD.
         */
        xmlErrValidWarning(ctxt, (xmlNodePtr) dtd,
                XML_DTD_ATTRIBUTE_REDEFINED,
                "Attribute %s of element %s: already defined\n",
                name, elem, NULL);
#endif /* LIBXML_VALID_ENABLED */
  xmlFreeAttribute(ret);
  return(NULL);
    }

    /*
     * Validity Check:
     * Multiple ID per element
     */
#ifdef LIBXML_VALID_ENABLED
    if ((type == XML_ATTRIBUTE_ID) &&
        (xmlScanIDAttributeDecl(ctxt, elemDef, 1) != 0)) {
        xmlErrValidNode(ctxt, (xmlNodePtr) dtd, XML_DTD_MULTIPLE_ID,
       "Element %s has too may ID attributes defined : %s\n",
               elem, name, NULL);
        if (ctxt != NULL)
            ctxt->valid = 0;
    }
#endif /* LIBXML_VALID_ENABLED */

    /*
     * Insert namespace default def first they need to be
     * processed first.
     */
    if ((xmlStrEqual(ret->name, BAD_CAST "xmlns")) ||
        ((ret->prefix != NULL &&
         (xmlStrEqual(ret->prefix, BAD_CAST "xmlns"))))) {
        ret->nexth = elemDef->attributes;
        elemDef->attributes = ret;
    } else {
        xmlAttributePtr tmp = elemDef->attributes;

        while ((tmp != NULL) &&
               ((xmlStrEqual(tmp->name, BAD_CAST "xmlns")) ||
                ((ret->prefix != NULL &&
                 (xmlStrEqual(ret->prefix, BAD_CAST "xmlns")))))) {
            if (tmp->nexth == NULL)
                break;
            tmp = tmp->nexth;
        }
        if (tmp != NULL) {
            ret->nexth = tmp->nexth;
            tmp->nexth = ret;
        } else {
            ret->nexth = elemDef->attributes;
            elemDef->attributes = ret;
        }
    }

    /*
     * Link it to the DTD
     */
    ret->parent = dtd;
    if (dtd->last == NULL) {
  dtd->children = dtd->last = (xmlNodePtr) ret;
    } else {
        dtd->last->next = (xmlNodePtr) ret;
  ret->prev = dtd->last;
  dtd->last = (xmlNodePtr) ret;
    }
    return(ret);

mem_error:
    xmlVErrMemory(ctxt);
    xmlFreeEnumeration(tree);
    xmlFreeAttribute(ret);
    return(NULL);
}

static void
xmlFreeAttributeTableEntry(void *attr, const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlFreeAttribute((xmlAttributePtr) attr);
}

/**
 * xmlFreeAttributeTable:
 * @table:  An attribute table
 *
 * Deallocate the memory used by an entities hash table.
 */
void
xmlFreeAttributeTable(xmlAttributeTablePtr table) {
    xmlHashFree(table, xmlFreeAttributeTableEntry);
}

/**
 * xmlCopyAttribute:
 * @attr:  An attribute
 *
 * Build a copy of an attribute.
 *
 * Returns the new xmlAttributePtr or NULL in case of error.
 */
static void *
xmlCopyAttribute(void *payload, const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlAttributePtr attr = (xmlAttributePtr) payload;
    xmlAttributePtr cur;

    cur = (xmlAttributePtr) xmlMalloc(sizeof(xmlAttribute));
    if (cur == NULL)
  return(NULL);
    memset(cur, 0, sizeof(xmlAttribute));
    cur->type = XML_ATTRIBUTE_DECL;
    cur->atype = attr->atype;
    cur->def = attr->def;
    if (attr->tree != NULL) {
        cur->tree = xmlCopyEnumeration(attr->tree);
        if (cur->tree == NULL)
            goto error;
    }
    if (attr->elem != NULL) {
  cur->elem = xmlStrdup(attr->elem);
        if (cur->elem == NULL)
            goto error;
    }
    if (attr->name != NULL) {
  cur->name = xmlStrdup(attr->name);
        if (cur->name == NULL)
            goto error;
    }
    if (attr->prefix != NULL) {
  cur->prefix = xmlStrdup(attr->prefix);
        if (cur->prefix == NULL)
            goto error;
    }
    if (attr->defaultValue != NULL) {
  cur->defaultValue = xmlStrdup(attr->defaultValue);
        if (cur->defaultValue == NULL)
            goto error;
    }
    return(cur);

error:
    xmlFreeAttribute(cur);
    return(NULL);
}

/**
 * xmlCopyAttributeTable:
 * @table:  An attribute table
 *
 * Build a copy of an attribute table.
 *
 * Returns the new xmlAttributeTablePtr or NULL in case of error.
 */
xmlAttributeTablePtr
xmlCopyAttributeTable(xmlAttributeTablePtr table) {
    return(xmlHashCopySafe(table, xmlCopyAttribute,
                           xmlFreeAttributeTableEntry));
}

#ifdef LIBXML_OUTPUT_ENABLED
/**
 * xmlDumpAttributeDecl:
 * @buf:  the XML buffer output
 * @attr:  An attribute declaration
 *
 * DEPRECATED: Use xmlSaveTree.
 *
 * This will dump the content of the attribute declaration as an XML
 * DTD definition
 */
void
xmlDumpAttributeDecl(xmlBufferPtr buf, xmlAttributePtr attr) {
    xmlSaveCtxtPtr save;

    if ((buf == NULL) || (attr == NULL))
        return;

    save = xmlSaveToBuffer(buf, NULL, 0);
    xmlSaveTree(save, (xmlNodePtr) attr);
    if (xmlSaveFinish(save) != XML_ERR_OK)
        xmlFree(xmlBufferDetach(buf));
}

/**
 * xmlDumpAttributeDeclScan:
 * @attr:  An attribute declaration
 * @buf:  the XML buffer output
 *
 * This is used with the hash scan function - just reverses arguments
 */
static void
xmlDumpAttributeDeclScan(void *attr, void *save,
                         const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlSaveTree(save, attr);
}

/**
 * xmlDumpAttributeTable:
 * @buf:  the XML buffer output
 * @table:  An attribute table
 *
 * DEPRECATED: Don't use.
 *
 * This will dump the content of the attribute table as an XML DTD definition
 */
void
xmlDumpAttributeTable(xmlBufferPtr buf, xmlAttributeTablePtr table) {
    xmlSaveCtxtPtr save;

    if ((buf == NULL) || (table == NULL))
        return;

    save = xmlSaveToBuffer(buf, NULL, 0);
    xmlHashScan(table, xmlDumpAttributeDeclScan, save);
    if (xmlSaveFinish(save) != XML_ERR_OK)
        xmlFree(xmlBufferDetach(buf));
}
#endif /* LIBXML_OUTPUT_ENABLED */

/************************************************************************
 *                  *
 *        NOTATIONs       *
 *                  *
 ************************************************************************/
/**
 * xmlFreeNotation:
 * @not:  A notation
 *
 * Deallocate the memory used by an notation definition
 */
static void
xmlFreeNotation(xmlNotationPtr nota) {
    if (nota == NULL) return;
    if (nota->name != NULL)
  xmlFree((xmlChar *) nota->name);
    if (nota->PublicID != NULL)
  xmlFree((xmlChar *) nota->PublicID);
    if (nota->SystemID != NULL)
  xmlFree((xmlChar *) nota->SystemID);
    xmlFree(nota);
}


/**
 * xmlAddNotationDecl:
 * @dtd:  pointer to the DTD
 * @ctxt:  the validation context
 * @name:  the entity name
 * @PublicID:  the public identifier or NULL
 * @SystemID:  the system identifier or NULL
 *
 * Register a new notation declaration
 *
 * Returns NULL if not, otherwise the entity
 */
xmlNotationPtr
xmlAddNotationDecl(xmlValidCtxtPtr ctxt, xmlDtdPtr dtd,
             const xmlChar *name,
                   const xmlChar *PublicID, const xmlChar *SystemID) {
    xmlNotationPtr ret = NULL;
    xmlNotationTablePtr table;
    int res;

    if (dtd == NULL) {
  return(NULL);
    }
    if (name == NULL) {
  return(NULL);
    }
    if ((PublicID == NULL) && (SystemID == NULL)) {
  return(NULL);
    }

    /*
     * Create the Notation table if needed.
     */
    table = (xmlNotationTablePtr) dtd->notations;
    if (table == NULL) {
  xmlDictPtr dict = NULL;
  if (dtd->doc != NULL)
      dict = dtd->doc->dict;

        dtd->notations = table = xmlHashCreateDict(0, dict);
        if (table == NULL)
            goto mem_error;
    }

    ret = (xmlNotationPtr) xmlMalloc(sizeof(xmlNotation));
    if (ret == NULL)
        goto mem_error;
    memset(ret, 0, sizeof(xmlNotation));

    /*
     * fill the structure.
     */
    ret->name = xmlStrdup(name);
    if (ret->name == NULL)
        goto mem_error;
    if (SystemID != NULL) {
        ret->SystemID = xmlStrdup(SystemID);
        if (ret->SystemID == NULL)
            goto mem_error;
    }
    if (PublicID != NULL) {
        ret->PublicID = xmlStrdup(PublicID);
        if (ret->PublicID == NULL)
            goto mem_error;
    }

    /*
     * Validity Check:
     * Check the DTD for previous declarations of the ATTLIST
     */
    res = xmlHashAdd(table, name, ret);
    if (res <= 0) {
        if (res < 0)
            goto mem_error;
#ifdef LIBXML_VALID_ENABLED
        xmlErrValid(ctxt, XML_DTD_NOTATION_REDEFINED,
                    "xmlAddNotationDecl: %s already defined\n",
                    (const char *) name);
#endif /* LIBXML_VALID_ENABLED */
  xmlFreeNotation(ret);
  return(NULL);
    }
    return(ret);

mem_error:
    xmlVErrMemory(ctxt);
    xmlFreeNotation(ret);
    return(NULL);
}

static void
xmlFreeNotationTableEntry(void *nota, const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlFreeNotation((xmlNotationPtr) nota);
}

/**
 * xmlFreeNotationTable:
 * @table:  An notation table
 *
 * Deallocate the memory used by an entities hash table.
 */
void
xmlFreeNotationTable(xmlNotationTablePtr table) {
    xmlHashFree(table, xmlFreeNotationTableEntry);
}

/**
 * xmlCopyNotation:
 * @nota:  A notation
 *
 * Build a copy of a notation.
 *
 * Returns the new xmlNotationPtr or NULL in case of error.
 */
static void *
xmlCopyNotation(void *payload, const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlNotationPtr nota = (xmlNotationPtr) payload;
    xmlNotationPtr cur;

    cur = (xmlNotationPtr) xmlMalloc(sizeof(xmlNotation));
    if (cur == NULL)
  return(NULL);
    memset(cur, 0, sizeof(*cur));
    if (nota->name != NULL) {
  cur->name = xmlStrdup(nota->name);
        if (cur->name == NULL)
            goto error;
    }
    if (nota->PublicID != NULL) {
  cur->PublicID = xmlStrdup(nota->PublicID);
        if (cur->PublicID == NULL)
            goto error;
    }
    if (nota->SystemID != NULL) {
  cur->SystemID = xmlStrdup(nota->SystemID);
        if (cur->SystemID == NULL)
            goto error;
    }
    return(cur);

error:
    xmlFreeNotation(cur);
    return(NULL);
}

/**
 * xmlCopyNotationTable:
 * @table:  A notation table
 *
 * Build a copy of a notation table.
 *
 * Returns the new xmlNotationTablePtr or NULL in case of error.
 */
xmlNotationTablePtr
xmlCopyNotationTable(xmlNotationTablePtr table) {
    return(xmlHashCopySafe(table, xmlCopyNotation, xmlFreeNotationTableEntry));
}

#ifdef LIBXML_OUTPUT_ENABLED
/**
 * xmlDumpNotationDecl:
 * @buf:  the XML buffer output
 * @nota:  A notation declaration
 *
 * DEPRECATED: Don't use.
 *
 * This will dump the content the notation declaration as an XML DTD definition
 */
void
xmlDumpNotationDecl(xmlBufferPtr buf, xmlNotationPtr nota) {
    xmlSaveCtxtPtr save;

    if ((buf == NULL) || (nota == NULL))
        return;

    save = xmlSaveToBuffer(buf, NULL, 0);
    xmlSaveNotationDecl(save, nota);
    if (xmlSaveFinish(save) != XML_ERR_OK)
        xmlFree(xmlBufferDetach(buf));
}

/**
 * xmlDumpNotationTable:
 * @buf:  the XML buffer output
 * @table:  A notation table
 *
 * DEPRECATED: Don't use.
 *
 * This will dump the content of the notation table as an XML DTD definition
 */
void
xmlDumpNotationTable(xmlBufferPtr buf, xmlNotationTablePtr table) {
    xmlSaveCtxtPtr save;

    if ((buf == NULL) || (table == NULL))
        return;

    save = xmlSaveToBuffer(buf, NULL, 0);
    xmlSaveNotationTable(save, table);
    if (xmlSaveFinish(save) != XML_ERR_OK)
        xmlFree(xmlBufferDetach(buf));
}
#endif /* LIBXML_OUTPUT_ENABLED */

/************************************************************************
 *                  *
 *        IDs         *
 *                  *
 ************************************************************************/
/**
 * DICT_FREE:
 * @str:  a string
 *
 * Free a string if it is not owned by the "dict" dictionary in the
 * current scope
 */
#define DICT_FREE(str)            \
  if ((str) && ((!dict) ||       \
      (xmlDictOwns(dict, (const xmlChar *)(str)) == 0)))  \
      xmlFree((char *)(str));

static int
xmlIsStreaming(xmlValidCtxtPtr ctxt) {
    xmlParserCtxtPtr pctxt;

    if (ctxt == NULL)
        return(0);
    if ((ctxt->flags & XML_VCTXT_USE_PCTXT) == 0)
        return(0);
    pctxt = ctxt->userData;
    return(pctxt->parseMode == XML_PARSE_READER);
}

/**
 * xmlFreeID:
 * @not:  A id
 *
 * Deallocate the memory used by an id definition
 */
static void
xmlFreeID(xmlIDPtr id) {
    xmlDictPtr dict = NULL;

    if (id == NULL) return;

    if (id->doc != NULL)
        dict = id->doc->dict;

    if (id->value != NULL)
  DICT_FREE(id->value)
    if (id->name != NULL)
  DICT_FREE(id->name)
    if (id->attr != NULL) {
        id->attr->id = NULL;
        id->attr->atype = 0;
    }

    xmlFree(id);
}


/**
 * xmlAddIDInternal:
 * @attr:  the attribute holding the ID
 * @value:  the attribute (ID) value
 * @idPtr:  pointer to resulting ID
 *
 * Register a new id declaration
 *
 * Returns 1 on success, 0 if the ID already exists, -1 if a memory
 * allocation fails.
 */
static int
xmlAddIDInternal(xmlAttrPtr attr, const xmlChar *value, xmlIDPtr *idPtr) {
    xmlDocPtr doc;
    xmlIDPtr id;
    xmlIDTablePtr table;
    int ret;

    if (idPtr != NULL)
        *idPtr = NULL;
    if ((value == NULL) || (value[0] == 0))
  return(0);
    if (attr == NULL)
  return(0);

    doc = attr->doc;
    if (doc == NULL)
        return(0);

    /*
     * Create the ID table if needed.
     */
    table = (xmlIDTablePtr) doc->ids;
    if (table == NULL)  {
        doc->ids = table = xmlHashCreateDict(0, doc->dict);
        if (table == NULL)
            return(-1);
    } else {
        id = xmlHashLookup(table, value);
        if (id != NULL)
            return(0);
    }

    id = (xmlIDPtr) xmlMalloc(sizeof(xmlID));
    if (id == NULL)
  return(-1);
    memset(id, 0, sizeof(*id));

    /*
     * fill the structure.
     */
    id->doc = doc;
    id->value = xmlStrdup(value);
    if (id->value == NULL) {
        xmlFreeID(id);
        return(-1);
    }

    if (attr->id != NULL)
        xmlRemoveID(doc, attr);

    if (xmlHashAddEntry(table, value, id) < 0) {
  xmlFreeID(id);
  return(-1);
    }

    ret = 1;
    if (idPtr != NULL)
        *idPtr = id;

    id->attr = attr;
    id->lineno = xmlGetLineNo(attr->parent);
    attr->atype = XML_ATTRIBUTE_ID;
    attr->id = id;

    return(ret);
}

/**
 * xmlAddIDSafe:
 * @attr:  the attribute holding the ID
 * @value:  the attribute (ID) value
 *
 * Register a new id declaration
 *
 * Available since 2.13.0.
 *
 * Returns 1 on success, 0 if the ID already exists, -1 if a memory
 * allocation fails.
 */
int
xmlAddIDSafe(xmlAttrPtr attr, const xmlChar *value) {
    return(xmlAddIDInternal(attr, value, NULL));
}

/**
 * xmlAddID:
 * @ctxt:  the validation context
 * @doc:  pointer to the document
 * @value:  the value name
 * @attr:  the attribute holding the ID
 *
 * Register a new id declaration
 *
 * Returns NULL if not, otherwise the new xmlIDPtr
 */
xmlIDPtr
xmlAddID(xmlValidCtxtPtr ctxt, xmlDocPtr doc, const xmlChar *value,
         xmlAttrPtr attr) {
    xmlIDPtr id;
    int res;

    if ((attr == NULL) || (doc != attr->doc))
        return(NULL);

    res = xmlAddIDInternal(attr, value, &id);
    if (res < 0) {
        xmlVErrMemory(ctxt);
    }
#ifdef LIBXML_VALID_ENABLED
    else if (res == 0) {
        if (ctxt != NULL) {
            /*
             * The id is already defined in this DTD.
             */
            xmlErrValidNode(ctxt, attr->parent, XML_DTD_ID_REDEFINED,
                            "ID %s already defined\n", value, NULL, NULL);
        }
    }
#endif /* LIBXML_VALID_ENABLED */

    return(id);
}

static void
xmlFreeIDTableEntry(void *id, const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlFreeID((xmlIDPtr) id);
}

/**
 * xmlFreeIDTable:
 * @table:  An id table
 *
 * Deallocate the memory used by an ID hash table.
 */
void
xmlFreeIDTable(xmlIDTablePtr table) {
    xmlHashFree(table, xmlFreeIDTableEntry);
}

/**
 * xmlIsID:
 * @doc:  the document
 * @elem:  the element carrying the attribute
 * @attr:  the attribute
 *
 * Determine whether an attribute is of type ID. In case we have DTD(s)
 * then this is done if DTD loading has been requested. In the case
 * of HTML documents parsed with the HTML parser, then ID detection is
 * done systematically.
 *
 * Returns 0 or 1 depending on the lookup result or -1 if a memory allocation
 * failed.
 */
int
xmlIsID(xmlDocPtr doc, xmlNodePtr elem, xmlAttrPtr attr) {
    if ((attr == NULL) || (attr->name == NULL))
        return(0);

    if ((doc != NULL) && (doc->type == XML_HTML_DOCUMENT_NODE)) {
        if (xmlStrEqual(BAD_CAST "id", attr->name))
            return(1);

        if ((elem == NULL) || (elem->type != XML_ELEMENT_NODE))
            return(0);

        if ((xmlStrEqual(BAD_CAST "name", attr->name)) &&
      (xmlStrEqual(elem->name, BAD_CAST "a")))
      return(1);
    } else {
  xmlAttributePtr attrDecl = NULL;
  xmlChar felem[50];
  xmlChar *fullelemname;
        const xmlChar *aprefix;

        if ((attr->ns != NULL) && (attr->ns->prefix != NULL) &&
            (!strcmp((char *) attr->name, "id")) &&
            (!strcmp((char *) attr->ns->prefix, "xml")))
            return(1);

        if ((doc == NULL) ||
            ((doc->intSubset == NULL) && (doc->extSubset == NULL)))
            return(0);

        if ((elem == NULL) ||
            (elem->type != XML_ELEMENT_NODE) ||
            (elem->name == NULL))
            return(0);

  fullelemname = (elem->ns != NULL && elem->ns->prefix != NULL) ?
      xmlBuildQName(elem->name, elem->ns->prefix, felem, 50) :
      (xmlChar *)elem->name;
        if (fullelemname == NULL)
            return(-1);

        aprefix = (attr->ns != NULL) ? attr->ns->prefix : NULL;

  if (fullelemname != NULL) {
      attrDecl = xmlGetDtdQAttrDesc(doc->intSubset, fullelemname,
                              attr->name, aprefix);
      if ((attrDecl == NULL) && (doc->extSubset != NULL))
    attrDecl = xmlGetDtdQAttrDesc(doc->extSubset, fullelemname,
                attr->name, aprefix);
  }

  if ((fullelemname != felem) && (fullelemname != elem->name))
      xmlFree(fullelemname);

        if ((attrDecl != NULL) && (attrDecl->atype == XML_ATTRIBUTE_ID))
      return(1);
    }

    return(0);
}

/**
 * xmlRemoveID:
 * @doc:  the document
 * @attr:  the attribute
 *
 * Remove the given attribute from the ID table maintained internally.
 *
 * Returns -1 if the lookup failed and 0 otherwise
 */
int
xmlRemoveID(xmlDocPtr doc, xmlAttrPtr attr) {
    xmlIDTablePtr table;

    if (doc == NULL) return(-1);
    if ((attr == NULL) || (attr->id == NULL)) return(-1);

    table = (xmlIDTablePtr) doc->ids;
    if (table == NULL)
        return(-1);

    if (xmlHashRemoveEntry(table, attr->id->value, xmlFreeIDTableEntry) < 0)
        return(-1);

    return(0);
}

/**
 * xmlGetID:
 * @doc:  pointer to the document
 * @ID:  the ID value
 *
 * Search the attribute declaring the given ID
 *
 * Returns NULL if not found, otherwise the xmlAttrPtr defining the ID
 */
xmlAttrPtr
xmlGetID(xmlDocPtr doc, const xmlChar *ID) {
    xmlIDTablePtr table;
    xmlIDPtr id;

    if (doc == NULL) {
  return(NULL);
    }

    if (ID == NULL) {
  return(NULL);
    }

    table = (xmlIDTablePtr) doc->ids;
    if (table == NULL)
        return(NULL);

    id = xmlHashLookup(table, ID);
    if (id == NULL)
  return(NULL);
    if (id->attr == NULL) {
  /*
   * We are operating on a stream, return a well known reference
   * since the attribute node doesn't exist anymore
   */
  return((xmlAttrPtr) doc);
    }
    return(id->attr);
}

/************************************************************************
 *                  *
 *        Refs          *
 *                  *
 ************************************************************************/
typedef struct xmlRemoveMemo_t
{
  xmlListPtr l;
  xmlAttrPtr ap;
} xmlRemoveMemo;

typedef xmlRemoveMemo *xmlRemoveMemoPtr;

typedef struct xmlValidateMemo_t
{
    xmlValidCtxtPtr ctxt;
    const xmlChar *name;
} xmlValidateMemo;

typedef xmlValidateMemo *xmlValidateMemoPtr;

/**
 * xmlFreeRef:
 * @lk:  A list link
 *
 * Deallocate the memory used by a ref definition
 */
static void
xmlFreeRef(xmlLinkPtr lk) {
    xmlRefPtr ref = (xmlRefPtr)xmlLinkGetData(lk);
    if (ref == NULL) return;
    if (ref->value != NULL)
        xmlFree((xmlChar *)ref->value);
    if (ref->name != NULL)
        xmlFree((xmlChar *)ref->name);
    xmlFree(ref);
}

/**
 * xmlFreeRefTableEntry:
 * @list_ref:  A list of references.
 *
 * Deallocate the memory used by a list of references
 */
static void
xmlFreeRefTableEntry(void *payload, const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlListPtr list_ref = (xmlListPtr) payload;
    if (list_ref == NULL) return;
    xmlListDelete(list_ref);
}

/**
 * xmlWalkRemoveRef:
 * @data:  Contents of current link
 * @user:  Value supplied by the user
 *
 * Returns 0 to abort the walk or 1 to continue
 */
static int
xmlWalkRemoveRef(const void *data, void *user)
{
    xmlAttrPtr attr0 = ((xmlRefPtr)data)->attr;
    xmlAttrPtr attr1 = ((xmlRemoveMemoPtr)user)->ap;
    xmlListPtr ref_list = ((xmlRemoveMemoPtr)user)->l;

    if (attr0 == attr1) { /* Matched: remove and terminate walk */
        xmlListRemoveFirst(ref_list, (void *)data);
        return 0;
    }
    return 1;
}

/**
 * xmlDummyCompare
 * @data0:  Value supplied by the user
 * @data1:  Value supplied by the user
 *
 * Do nothing, return 0. Used to create unordered lists.
 */
static int
xmlDummyCompare(const void *data0 ATTRIBUTE_UNUSED,
                const void *data1 ATTRIBUTE_UNUSED)
{
    return (0);
}

/**
 * xmlAddRef:
 * @ctxt:  the validation context
 * @doc:  pointer to the document
 * @value:  the value name
 * @attr:  the attribute holding the Ref
 *
 * DEPRECATED, do not use. This function will be removed from the public API.
 *
 * Register a new ref declaration
 *
 * Returns NULL if not, otherwise the new xmlRefPtr
 */
xmlRefPtr
xmlAddRef(xmlValidCtxtPtr ctxt, xmlDocPtr doc, const xmlChar *value,
    xmlAttrPtr attr) {
    xmlRefPtr ret = NULL;
    xmlRefTablePtr table;
    xmlListPtr ref_list;

    if (doc == NULL) {
        return(NULL);
    }
    if (value == NULL) {
        return(NULL);
    }
    if (attr == NULL) {
        return(NULL);
    }

    /*
     * Create the Ref table if needed.
     */
    table = (xmlRefTablePtr) doc->refs;
    if (table == NULL) {
        doc->refs = table = xmlHashCreateDict(0, doc->dict);
        if (table == NULL)
            goto failed;
    }

    ret = (xmlRefPtr) xmlMalloc(sizeof(xmlRef));
    if (ret == NULL)
        goto failed;
    memset(ret, 0, sizeof(*ret));

    /*
     * fill the structure.
     */
    ret->value = xmlStrdup(value);
    if (ret->value == NULL)
        goto failed;
    if (xmlIsStreaming(ctxt)) {
  /*
   * Operating in streaming mode, attr is gonna disappear
   */
  ret->name = xmlStrdup(attr->name);
        if (ret->name == NULL)
            goto failed;
  ret->attr = NULL;
    } else {
  ret->name = NULL;
  ret->attr = attr;
    }
    ret->lineno = xmlGetLineNo(attr->parent);

    /* To add a reference :-
     * References are maintained as a list of references,
     * Lookup the entry, if no entry create new nodelist
     * Add the owning node to the NodeList
     * Return the ref
     */

    ref_list = xmlHashLookup(table, value);
    if (ref_list == NULL) {
        int res;

        ref_list = xmlListCreate(xmlFreeRef, xmlDummyCompare);
        if (ref_list == NULL)
      goto failed;
        res = xmlHashAdd(table, value, ref_list);
        if (res <= 0) {
            xmlListDelete(ref_list);
      goto failed;
        }
    }
    if (xmlListAppend(ref_list, ret) != 0)
        goto failed;
    return(ret);

failed:
    xmlVErrMemory(ctxt);
    if (ret != NULL) {
        if (ret->value != NULL)
      xmlFree((char *)ret->value);
        if (ret->name != NULL)
      xmlFree((char *)ret->name);
        xmlFree(ret);
    }
    return(NULL);
}

/**
 * xmlFreeRefTable:
 * @table:  An ref table
 *
 * DEPRECATED, do not use. This function will be removed from the public API.
 *
 * Deallocate the memory used by an Ref hash table.
 */
void
xmlFreeRefTable(xmlRefTablePtr table) {
    xmlHashFree(table, xmlFreeRefTableEntry);
}

/**
 * xmlIsRef:
 * @doc:  the document
 * @elem:  the element carrying the attribute
 * @attr:  the attribute
 *
 * DEPRECATED, do not use. This function will be removed from the public API.
 *
 * Determine whether an attribute is of type Ref. In case we have DTD(s)
 * then this is simple, otherwise we use an heuristic: name Ref (upper
 * or lowercase).
 *
 * Returns 0 or 1 depending on the lookup result
 */
int
xmlIsRef(xmlDocPtr doc, xmlNodePtr elem, xmlAttrPtr attr) {
    if (attr == NULL)
        return(0);
    if (doc == NULL) {
        doc = attr->doc;
  if (doc == NULL) return(0);
    }

    if ((doc->intSubset == NULL) && (doc->extSubset == NULL)) {
        return(0);
    } else if (doc->type == XML_HTML_DOCUMENT_NODE) {
        /* TODO @@@ */
        return(0);
    } else {
        xmlAttributePtr attrDecl;
        const xmlChar *aprefix;

        if (elem == NULL) return(0);
        aprefix = (attr->ns != NULL) ? attr->ns->prefix : NULL;
        attrDecl = xmlGetDtdQAttrDesc(doc->intSubset, elem->name, attr->name,
                                      aprefix);
        if ((attrDecl == NULL) && (doc->extSubset != NULL))
            attrDecl = xmlGetDtdQAttrDesc(doc->extSubset, elem->name, attr->name,
                                          aprefix);

  if ((attrDecl != NULL) &&
      (attrDecl->atype == XML_ATTRIBUTE_IDREF ||
       attrDecl->atype == XML_ATTRIBUTE_IDREFS))
  return(1);
    }
    return(0);
}

/**
 * xmlRemoveRef:
 * @doc:  the document
 * @attr:  the attribute
 *
 * DEPRECATED, do not use. This function will be removed from the public API.
 *
 * Remove the given attribute from the Ref table maintained internally.
 *
 * Returns -1 if the lookup failed and 0 otherwise
 */
int
xmlRemoveRef(xmlDocPtr doc, xmlAttrPtr attr) {
    xmlListPtr ref_list;
    xmlRefTablePtr table;
    xmlChar *ID;
    xmlRemoveMemo target;

    if (doc == NULL) return(-1);
    if (attr == NULL) return(-1);

    table = (xmlRefTablePtr) doc->refs;
    if (table == NULL)
        return(-1);

    ID = xmlNodeListGetString(doc, attr->children, 1);
    if (ID == NULL)
        return(-1);

    ref_list = xmlHashLookup(table, ID);
    if(ref_list == NULL) {
        xmlFree(ID);
        return (-1);
    }

    /* At this point, ref_list refers to a list of references which
     * have the same key as the supplied attr. Our list of references
     * is ordered by reference address and we don't have that information
     * here to use when removing. We'll have to walk the list and
     * check for a matching attribute, when we find one stop the walk
     * and remove the entry.
     * The list is ordered by reference, so that means we don't have the
     * key. Passing the list and the reference to the walker means we
     * will have enough data to be able to remove the entry.
     */
    target.l = ref_list;
    target.ap = attr;

    /* Remove the supplied attr from our list */
    xmlListWalk(ref_list, xmlWalkRemoveRef, &target);

    /*If the list is empty then remove the list entry in the hash */
    if (xmlListEmpty(ref_list))
        xmlHashRemoveEntry(table, ID, xmlFreeRefTableEntry);
    xmlFree(ID);
    return(0);
}

/**
 * xmlGetRefs:
 * @doc:  pointer to the document
 * @ID:  the ID value
 *
 * DEPRECATED, do not use. This function will be removed from the public API.
 *
 * Find the set of references for the supplied ID.
 *
 * Returns NULL if not found, otherwise node set for the ID.
 */
xmlListPtr
xmlGetRefs(xmlDocPtr doc, const xmlChar *ID) {
    xmlRefTablePtr table;

    if (doc == NULL) {
        return(NULL);
    }

    if (ID == NULL) {
        return(NULL);
    }

    table = (xmlRefTablePtr) doc->refs;
    if (table == NULL)
        return(NULL);

    return (xmlHashLookup(table, ID));
}

/************************************************************************
 *                  *
 *    Routines for validity checking        *
 *                  *
 ************************************************************************/

/**
 * xmlGetDtdElementDesc:
 * @dtd:  a pointer to the DtD to search
 * @name:  the element name
 *
 * Search the DTD for the description of this element
 *
 * NOTE: A NULL return value can also mean that a memory allocation failed.
 *
 * returns the xmlElementPtr if found or NULL
 */

xmlElementPtr
xmlGetDtdElementDesc(xmlDtdPtr dtd, const xmlChar *name) {
    xmlElementTablePtr table;
    xmlElementPtr cur;
    const xmlChar *localname;
    xmlChar *prefix;

    if ((dtd == NULL) || (dtd->elements == NULL) ||
        (name == NULL))
        return(NULL);

    table = (xmlElementTablePtr) dtd->elements;
    if (table == NULL)
  return(NULL);

    localname = xmlSplitQName4(name, &prefix);
    if (localname == NULL)
        return(NULL);
    cur = xmlHashLookup2(table, localname, prefix);
    if (prefix != NULL)
        xmlFree(prefix);
    return(cur);
}

/**
 * xmlGetDtdElementDesc2:
 * @dtd:  a pointer to the DtD to search
 * @name:  the element name
 * @create:  create an empty description if not found
 *
 * Search the DTD for the description of this element
 *
 * returns the xmlElementPtr if found or NULL
 */

static xmlElementPtr
xmlGetDtdElementDesc2(xmlValidCtxtPtr ctxt, xmlDtdPtr dtd, const xmlChar *name) {
    xmlElementTablePtr table;
    xmlElementPtr cur = NULL;
    const xmlChar *localName;
    xmlChar *prefix = NULL;

    if (dtd == NULL) return(NULL);

    /*
     * Create the Element table if needed.
     */
    if (dtd->elements == NULL) {
  xmlDictPtr dict = NULL;

  if (dtd->doc != NULL)
      dict = dtd->doc->dict;

  dtd->elements = xmlHashCreateDict(0, dict);
  if (dtd->elements == NULL)
            goto mem_error;
    }
    table = (xmlElementTablePtr) dtd->elements;

    localName = xmlSplitQName4(name, &prefix);
    if (localName == NULL)
        goto mem_error;
    cur = xmlHashLookup2(table, localName, prefix);
    if (cur == NULL) {
  cur = (xmlElementPtr) xmlMalloc(sizeof(xmlElement));
  if (cur == NULL)
            goto mem_error;
  memset(cur, 0, sizeof(xmlElement));
  cur->type = XML_ELEMENT_DECL;
        cur->doc = dtd->doc;

  /*
   * fill the structure.
   */
  cur->name = xmlStrdup(localName);
        if (cur->name == NULL)
            goto mem_error;
  cur->prefix = prefix;
        prefix = NULL;
  cur->etype = XML_ELEMENT_TYPE_UNDEFINED;

  if (xmlHashAdd2(table, localName, cur->prefix, cur) <= 0)
            goto mem_error;
    }

    if (prefix != NULL)
        xmlFree(prefix);
    return(cur);

mem_error:
    xmlVErrMemory(ctxt);
    xmlFree(prefix);
    xmlFreeElement(cur);
    return(NULL);
}

/**
 * xmlGetDtdQElementDesc:
 * @dtd:  a pointer to the DtD to search
 * @name:  the element name
 * @prefix:  the element namespace prefix
 *
 * Search the DTD for the description of this element
 *
 * returns the xmlElementPtr if found or NULL
 */

xmlElementPtr
xmlGetDtdQElementDesc(xmlDtdPtr dtd, const xmlChar *name,
                const xmlChar *prefix) {
    xmlElementTablePtr table;

    if (dtd == NULL) return(NULL);
    if (dtd->elements == NULL) return(NULL);
    table = (xmlElementTablePtr) dtd->elements;

    return(xmlHashLookup2(table, name, prefix));
}

/**
 * xmlGetDtdAttrDesc:
 * @dtd:  a pointer to the DtD to search
 * @elem:  the element name
 * @name:  the attribute name
 *
 * Search the DTD for the description of this attribute on
 * this element.
 *
 * returns the xmlAttributePtr if found or NULL
 */

xmlAttributePtr
xmlGetDtdAttrDesc(xmlDtdPtr dtd, const xmlChar *elem, const xmlChar *name) {
    xmlAttributeTablePtr table;
    xmlAttributePtr cur;
    const xmlChar *localname;
    xmlChar *prefix = NULL;

    if ((dtd == NULL) || (dtd->attributes == NULL) ||
        (elem == NULL) || (name == NULL))
        return(NULL);

    table = (xmlAttributeTablePtr) dtd->attributes;
    if (table == NULL)
  return(NULL);

    localname = xmlSplitQName4(name, &prefix);
    if (localname == NULL)
        return(NULL);
    cur = xmlHashLookup3(table, localname, prefix, elem);
    if (prefix != NULL)
        xmlFree(prefix);
    return(cur);
}

/**
 * xmlGetDtdQAttrDesc:
 * @dtd:  a pointer to the DtD to search
 * @elem:  the element name
 * @name:  the attribute name
 * @prefix:  the attribute namespace prefix
 *
 * Search the DTD for the description of this qualified attribute on
 * this element.
 *
 * returns the xmlAttributePtr if found or NULL
 */

xmlAttributePtr
xmlGetDtdQAttrDesc(xmlDtdPtr dtd, const xmlChar *elem, const xmlChar *name,
            const xmlChar *prefix) {
    xmlAttributeTablePtr table;

    if (dtd == NULL) return(NULL);
    if (dtd->attributes == NULL) return(NULL);
    table = (xmlAttributeTablePtr) dtd->attributes;

    return(xmlHashLookup3(table, name, prefix, elem));
}

/**
 * xmlGetDtdNotationDesc:
 * @dtd:  a pointer to the DtD to search
 * @name:  the notation name
 *
 * Search the DTD for the description of this notation
 *
 * returns the xmlNotationPtr if found or NULL
 */

xmlNotationPtr
xmlGetDtdNotationDesc(xmlDtdPtr dtd, const xmlChar *name) {
    xmlNotationTablePtr table;

    if (dtd == NULL) return(NULL);
    if (dtd->notations == NULL) return(NULL);
    table = (xmlNotationTablePtr) dtd->notations;

    return(xmlHashLookup(table, name));
}

#ifdef LIBXML_VALID_ENABLED
/**
 * xmlValidateNotationUse:
 * @ctxt:  the validation context
 * @doc:  the document
 * @notationName:  the notation name to check
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Validate that the given name match a notation declaration.
 * - [ VC: Notation Declared ]
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateNotationUse(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
                       const xmlChar *notationName) {
    xmlNotationPtr notaDecl;
    if ((doc == NULL) || (doc->intSubset == NULL) ||
        (notationName == NULL)) return(-1);

    notaDecl = xmlGetDtdNotationDesc(doc->intSubset, notationName);
    if ((notaDecl == NULL) && (doc->extSubset != NULL))
  notaDecl = xmlGetDtdNotationDesc(doc->extSubset, notationName);

    if (notaDecl == NULL) {
  xmlErrValidNode(ctxt, (xmlNodePtr) doc, XML_DTD_UNKNOWN_NOTATION,
                  "NOTATION %s is not declared\n",
            notationName, NULL, NULL);
  return(0);
    }
    return(1);
}
#endif /* LIBXML_VALID_ENABLED */

/**
 * xmlIsMixedElement:
 * @doc:  the document
 * @name:  the element name
 *
 * Search in the DtDs whether an element accept Mixed content (or ANY)
 * basically if it is supposed to accept text childs
 *
 * returns 0 if no, 1 if yes, and -1 if no element description is available
 */

int
xmlIsMixedElement(xmlDocPtr doc, const xmlChar *name) {
    xmlElementPtr elemDecl;

    if ((doc == NULL) || (doc->intSubset == NULL)) return(-1);

    elemDecl = xmlGetDtdElementDesc(doc->intSubset, name);
    if ((elemDecl == NULL) && (doc->extSubset != NULL))
  elemDecl = xmlGetDtdElementDesc(doc->extSubset, name);
    if (elemDecl == NULL) return(-1);
    switch (elemDecl->etype) {
  case XML_ELEMENT_TYPE_UNDEFINED:
      return(-1);
  case XML_ELEMENT_TYPE_ELEMENT:
      return(0);
        case XML_ELEMENT_TYPE_EMPTY:
      /*
       * return 1 for EMPTY since we want VC error to pop up
       * on <empty>     </empty> for example
       */
  case XML_ELEMENT_TYPE_ANY:
  case XML_ELEMENT_TYPE_MIXED:
      return(1);
    }
    return(1);
}

#ifdef LIBXML_VALID_ENABLED

/**
 * xmlValidNormalizeString:
 * @str: a string
 *
 * Normalize a string in-place.
 */
static void
xmlValidNormalizeString(xmlChar *str) {
    xmlChar *dst;
    const xmlChar *src;

    if (str == NULL)
        return;
    src = str;
    dst = str;

    while (*src == 0x20) src++;
    while (*src != 0) {
  if (*src == 0x20) {
      while (*src == 0x20) src++;
      if (*src != 0)
    *dst++ = 0x20;
  } else {
      *dst++ = *src++;
  }
    }
    *dst = 0;
}

static int
xmlIsDocNameStartChar(xmlDocPtr doc, int c) {
    if ((doc == NULL) || (doc->properties & XML_DOC_OLD10) == 0) {
        /*
   * Use the new checks of production [4] [4a] amd [5] of the
   * Update 5 of XML-1.0
   */
  if (((c >= 'a') && (c <= 'z')) ||
      ((c >= 'A') && (c <= 'Z')) ||
      (c == '_') || (c == ':') ||
      ((c >= 0xC0) && (c <= 0xD6)) ||
      ((c >= 0xD8) && (c <= 0xF6)) ||
      ((c >= 0xF8) && (c <= 0x2FF)) ||
      ((c >= 0x370) && (c <= 0x37D)) ||
      ((c >= 0x37F) && (c <= 0x1FFF)) ||
      ((c >= 0x200C) && (c <= 0x200D)) ||
      ((c >= 0x2070) && (c <= 0x218F)) ||
      ((c >= 0x2C00) && (c <= 0x2FEF)) ||
      ((c >= 0x3001) && (c <= 0xD7FF)) ||
      ((c >= 0xF900) && (c <= 0xFDCF)) ||
      ((c >= 0xFDF0) && (c <= 0xFFFD)) ||
      ((c >= 0x10000) && (c <= 0xEFFFF)))
      return(1);
    } else {
        if (IS_LETTER(c) || (c == '_') || (c == ':'))
      return(1);
    }
    return(0);
}

static int
xmlIsDocNameChar(xmlDocPtr doc, int c) {
    if ((doc == NULL) || (doc->properties & XML_DOC_OLD10) == 0) {
        /*
   * Use the new checks of production [4] [4a] amd [5] of the
   * Update 5 of XML-1.0
   */
  if (((c >= 'a') && (c <= 'z')) ||
      ((c >= 'A') && (c <= 'Z')) ||
      ((c >= '0') && (c <= '9')) || /* !start */
      (c == '_') || (c == ':') ||
      (c == '-') || (c == '.') || (c == 0xB7) || /* !start */
      ((c >= 0xC0) && (c <= 0xD6)) ||
      ((c >= 0xD8) && (c <= 0xF6)) ||
      ((c >= 0xF8) && (c <= 0x2FF)) ||
      ((c >= 0x300) && (c <= 0x36F)) || /* !start */
      ((c >= 0x370) && (c <= 0x37D)) ||
      ((c >= 0x37F) && (c <= 0x1FFF)) ||
      ((c >= 0x200C) && (c <= 0x200D)) ||
      ((c >= 0x203F) && (c <= 0x2040)) || /* !start */
      ((c >= 0x2070) && (c <= 0x218F)) ||
      ((c >= 0x2C00) && (c <= 0x2FEF)) ||
      ((c >= 0x3001) && (c <= 0xD7FF)) ||
      ((c >= 0xF900) && (c <= 0xFDCF)) ||
      ((c >= 0xFDF0) && (c <= 0xFFFD)) ||
      ((c >= 0x10000) && (c <= 0xEFFFF)))
       return(1);
    } else {
        if ((IS_LETTER(c)) || (IS_DIGIT(c)) ||
            (c == '.') || (c == '-') ||
      (c == '_') || (c == ':') ||
      (IS_COMBINING(c)) ||
      (IS_EXTENDER(c)))
      return(1);
    }
    return(0);
}

/**
 * xmlValidateNameValue:
 * @doc:  pointer to the document or NULL
 * @value:  an Name value
 *
 * Validate that the given value match Name production
 *
 * returns 1 if valid or 0 otherwise
 */

static int
xmlValidateNameValueInternal(xmlDocPtr doc, const xmlChar *value) {
    const xmlChar *cur;
    int val, len;

    if (value == NULL) return(0);
    cur = value;
    val = xmlStringCurrentChar(NULL, cur, &len);
    cur += len;
    if (!xmlIsDocNameStartChar(doc, val))
  return(0);

    val = xmlStringCurrentChar(NULL, cur, &len);
    cur += len;
    while (xmlIsDocNameChar(doc, val)) {
  val = xmlStringCurrentChar(NULL, cur, &len);
  cur += len;
    }

    if (val != 0) return(0);

    return(1);
}

/**
 * xmlValidateNameValue:
 * @value:  an Name value
 *
 * Validate that the given value match Name production
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateNameValue(const xmlChar *value) {
    return(xmlValidateNameValueInternal(NULL, value));
}

/**
 * xmlValidateNamesValueInternal:
 * @doc:  pointer to the document or NULL
 * @value:  an Names value
 *
 * Validate that the given value match Names production
 *
 * returns 1 if valid or 0 otherwise
 */

static int
xmlValidateNamesValueInternal(xmlDocPtr doc, const xmlChar *value) {
    const xmlChar *cur;
    int val, len;

    if (value == NULL) return(0);
    cur = value;
    val = xmlStringCurrentChar(NULL, cur, &len);
    cur += len;

    if (!xmlIsDocNameStartChar(doc, val))
  return(0);

    val = xmlStringCurrentChar(NULL, cur, &len);
    cur += len;
    while (xmlIsDocNameChar(doc, val)) {
  val = xmlStringCurrentChar(NULL, cur, &len);
  cur += len;
    }

    /* Should not test IS_BLANK(val) here -- see erratum E20*/
    while (val == 0x20) {
  while (val == 0x20) {
      val = xmlStringCurrentChar(NULL, cur, &len);
      cur += len;
  }

  if (!xmlIsDocNameStartChar(doc, val))
      return(0);

  val = xmlStringCurrentChar(NULL, cur, &len);
  cur += len;

  while (xmlIsDocNameChar(doc, val)) {
      val = xmlStringCurrentChar(NULL, cur, &len);
      cur += len;
  }
    }

    if (val != 0) return(0);

    return(1);
}

/**
 * xmlValidateNamesValue:
 * @value:  an Names value
 *
 * Validate that the given value match Names production
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateNamesValue(const xmlChar *value) {
    return(xmlValidateNamesValueInternal(NULL, value));
}

/**
 * xmlValidateNmtokenValueInternal:
 * @doc:  pointer to the document or NULL
 * @value:  an Nmtoken value
 *
 * Validate that the given value match Nmtoken production
 *
 * [ VC: Name Token ]
 *
 * returns 1 if valid or 0 otherwise
 */

static int
xmlValidateNmtokenValueInternal(xmlDocPtr doc, const xmlChar *value) {
    const xmlChar *cur;
    int val, len;

    if (value == NULL) return(0);
    cur = value;
    val = xmlStringCurrentChar(NULL, cur, &len);
    cur += len;

    if (!xmlIsDocNameChar(doc, val))
  return(0);

    val = xmlStringCurrentChar(NULL, cur, &len);
    cur += len;
    while (xmlIsDocNameChar(doc, val)) {
  val = xmlStringCurrentChar(NULL, cur, &len);
  cur += len;
    }

    if (val != 0) return(0);

    return(1);
}

/**
 * xmlValidateNmtokenValue:
 * @value:  an Nmtoken value
 *
 * Validate that the given value match Nmtoken production
 *
 * [ VC: Name Token ]
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateNmtokenValue(const xmlChar *value) {
    return(xmlValidateNmtokenValueInternal(NULL, value));
}

/**
 * xmlValidateNmtokensValueInternal:
 * @doc:  pointer to the document or NULL
 * @value:  an Nmtokens value
 *
 * Validate that the given value match Nmtokens production
 *
 * [ VC: Name Token ]
 *
 * returns 1 if valid or 0 otherwise
 */

static int
xmlValidateNmtokensValueInternal(xmlDocPtr doc, const xmlChar *value) {
    const xmlChar *cur;
    int val, len;

    if (value == NULL) return(0);
    cur = value;
    val = xmlStringCurrentChar(NULL, cur, &len);
    cur += len;

    while (IS_BLANK(val)) {
  val = xmlStringCurrentChar(NULL, cur, &len);
  cur += len;
    }

    if (!xmlIsDocNameChar(doc, val))
  return(0);

    while (xmlIsDocNameChar(doc, val)) {
  val = xmlStringCurrentChar(NULL, cur, &len);
  cur += len;
    }

    /* Should not test IS_BLANK(val) here -- see erratum E20*/
    while (val == 0x20) {
  while (val == 0x20) {
      val = xmlStringCurrentChar(NULL, cur, &len);
      cur += len;
  }
  if (val == 0) return(1);

  if (!xmlIsDocNameChar(doc, val))
      return(0);

  val = xmlStringCurrentChar(NULL, cur, &len);
  cur += len;

  while (xmlIsDocNameChar(doc, val)) {
      val = xmlStringCurrentChar(NULL, cur, &len);
      cur += len;
  }
    }

    if (val != 0) return(0);

    return(1);
}

/**
 * xmlValidateNmtokensValue:
 * @value:  an Nmtokens value
 *
 * Validate that the given value match Nmtokens production
 *
 * [ VC: Name Token ]
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateNmtokensValue(const xmlChar *value) {
    return(xmlValidateNmtokensValueInternal(NULL, value));
}

/**
 * xmlValidateNotationDecl:
 * @ctxt:  the validation context
 * @doc:  a document instance
 * @nota:  a notation definition
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Try to validate a single notation definition
 * basically it does the following checks as described by the
 * XML-1.0 recommendation:
 *  - it seems that no validity constraint exists on notation declarations
 * But this function get called anyway ...
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateNotationDecl(xmlValidCtxtPtr ctxt ATTRIBUTE_UNUSED, xmlDocPtr doc ATTRIBUTE_UNUSED,
                         xmlNotationPtr nota ATTRIBUTE_UNUSED) {
    int ret = 1;

    return(ret);
}

/**
 * xmlValidateAttributeValueInternal:
 * @doc: the document
 * @type:  an attribute type
 * @value:  an attribute value
 *
 * Validate that the given attribute value match  the proper production
 *
 * returns 1 if valid or 0 otherwise
 */

static int
xmlValidateAttributeValueInternal(xmlDocPtr doc, xmlAttributeType type,
                                  const xmlChar *value) {
    switch (type) {
  case XML_ATTRIBUTE_ENTITIES:
  case XML_ATTRIBUTE_IDREFS:
      return(xmlValidateNamesValueInternal(doc, value));
  case XML_ATTRIBUTE_ENTITY:
  case XML_ATTRIBUTE_IDREF:
  case XML_ATTRIBUTE_ID:
  case XML_ATTRIBUTE_NOTATION:
      return(xmlValidateNameValueInternal(doc, value));
  case XML_ATTRIBUTE_NMTOKENS:
  case XML_ATTRIBUTE_ENUMERATION:
      return(xmlValidateNmtokensValueInternal(doc, value));
  case XML_ATTRIBUTE_NMTOKEN:
      return(xmlValidateNmtokenValueInternal(doc, value));
        case XML_ATTRIBUTE_CDATA:
      break;
    }
    return(1);
}

/**
 * xmlValidateAttributeValue:
 * @type:  an attribute type
 * @value:  an attribute value
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Validate that the given attribute value match  the proper production
 *
 * [ VC: ID ]
 * Values of type ID must match the Name production....
 *
 * [ VC: IDREF ]
 * Values of type IDREF must match the Name production, and values
 * of type IDREFS must match Names ...
 *
 * [ VC: Entity Name ]
 * Values of type ENTITY must match the Name production, values
 * of type ENTITIES must match Names ...
 *
 * [ VC: Name Token ]
 * Values of type NMTOKEN must match the Nmtoken production; values
 * of type NMTOKENS must match Nmtokens.
 *
 * returns 1 if valid or 0 otherwise
 */
int
xmlValidateAttributeValue(xmlAttributeType type, const xmlChar *value) {
    return(xmlValidateAttributeValueInternal(NULL, type, value));
}

/**
 * xmlValidateAttributeValue2:
 * @ctxt:  the validation context
 * @doc:  the document
 * @name:  the attribute name (used for error reporting only)
 * @type:  the attribute type
 * @value:  the attribute value
 *
 * Validate that the given attribute value match a given type.
 * This typically cannot be done before having finished parsing
 * the subsets.
 *
 * [ VC: IDREF ]
 * Values of type IDREF must match one of the declared IDs
 * Values of type IDREFS must match a sequence of the declared IDs
 * each Name must match the value of an ID attribute on some element
 * in the XML document; i.e. IDREF values must match the value of
 * some ID attribute
 *
 * [ VC: Entity Name ]
 * Values of type ENTITY must match one declared entity
 * Values of type ENTITIES must match a sequence of declared entities
 *
 * [ VC: Notation Attributes ]
 * all notation names in the declaration must be declared.
 *
 * returns 1 if valid or 0 otherwise
 */

static int
xmlValidateAttributeValue2(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
      const xmlChar *name, xmlAttributeType type, const xmlChar *value) {
    int ret = 1;
    switch (type) {
  case XML_ATTRIBUTE_IDREFS:
  case XML_ATTRIBUTE_IDREF:
  case XML_ATTRIBUTE_ID:
  case XML_ATTRIBUTE_NMTOKENS:
  case XML_ATTRIBUTE_ENUMERATION:
  case XML_ATTRIBUTE_NMTOKEN:
        case XML_ATTRIBUTE_CDATA:
      break;
  case XML_ATTRIBUTE_ENTITY: {
      xmlEntityPtr ent;

      ent = xmlGetDocEntity(doc, value);
      /* yeah it's a bit messy... */
      if ((ent == NULL) && (doc->standalone == 1)) {
    doc->standalone = 0;
    ent = xmlGetDocEntity(doc, value);
      }
      if (ent == NULL) {
    xmlErrValidNode(ctxt, (xmlNodePtr) doc,
        XML_DTD_UNKNOWN_ENTITY,
   "ENTITY attribute %s reference an unknown entity \"%s\"\n",
           name, value, NULL);
    ret = 0;
      } else if (ent->etype != XML_EXTERNAL_GENERAL_UNPARSED_ENTITY) {
    xmlErrValidNode(ctxt, (xmlNodePtr) doc,
        XML_DTD_ENTITY_TYPE,
   "ENTITY attribute %s reference an entity \"%s\" of wrong type\n",
           name, value, NULL);
    ret = 0;
      }
      break;
        }
  case XML_ATTRIBUTE_ENTITIES: {
      xmlChar *dup, *nam = NULL, *cur, save;
      xmlEntityPtr ent;

      dup = xmlStrdup(value);
      if (dup == NULL) {
                xmlVErrMemory(ctxt);
    return(0);
            }
      cur = dup;
      while (*cur != 0) {
    nam = cur;
    while ((*cur != 0) && (!IS_BLANK_CH(*cur))) cur++;
    save = *cur;
    *cur = 0;
    ent = xmlGetDocEntity(doc, nam);
    if (ent == NULL) {
        xmlErrValidNode(ctxt, (xmlNodePtr) doc,
            XML_DTD_UNKNOWN_ENTITY,
       "ENTITIES attribute %s reference an unknown entity \"%s\"\n",
         name, nam, NULL);
        ret = 0;
    } else if (ent->etype != XML_EXTERNAL_GENERAL_UNPARSED_ENTITY) {
        xmlErrValidNode(ctxt, (xmlNodePtr) doc,
            XML_DTD_ENTITY_TYPE,
       "ENTITIES attribute %s reference an entity \"%s\" of wrong type\n",
         name, nam, NULL);
        ret = 0;
    }
    if (save == 0)
        break;
    *cur = save;
    while (IS_BLANK_CH(*cur)) cur++;
      }
      xmlFree(dup);
      break;
  }
  case XML_ATTRIBUTE_NOTATION: {
      xmlNotationPtr nota;

      nota = xmlGetDtdNotationDesc(doc->intSubset, value);
      if ((nota == NULL) && (doc->extSubset != NULL))
    nota = xmlGetDtdNotationDesc(doc->extSubset, value);

      if (nota == NULL) {
    xmlErrValidNode(ctxt, (xmlNodePtr) doc,
                    XML_DTD_UNKNOWN_NOTATION,
       "NOTATION attribute %s reference an unknown notation \"%s\"\n",
           name, value, NULL);
    ret = 0;
      }
      break;
        }
    }
    return(ret);
}

/**
 * xmlValidCtxtNormalizeAttributeValue:
 * @ctxt: the validation context
 * @doc:  the document
 * @elem:  the parent
 * @name:  the attribute name
 * @value:  the attribute value
 * @ctxt:  the validation context or NULL
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Does the validation related extra step of the normalization of attribute
 * values:
 *
 * If the declared value is not CDATA, then the XML processor must further
 * process the normalized attribute value by discarding any leading and
 * trailing space (#x20) characters, and by replacing sequences of space
 * (#x20) characters by single space (#x20) character.
 *
 * Also  check VC: Standalone Document Declaration in P32, and update
 *  ctxt->valid accordingly
 *
 * returns a new normalized string if normalization is needed, NULL otherwise
 *      the caller must free the returned value.
 */

xmlChar *
xmlValidCtxtNormalizeAttributeValue(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
       xmlNodePtr elem, const xmlChar *name, const xmlChar *value) {
    xmlChar *ret;
    xmlAttributePtr attrDecl = NULL;
    const xmlChar *localName;
    xmlChar *prefix = NULL;
    int extsubset = 0;

    if (doc == NULL) return(NULL);
    if (elem == NULL) return(NULL);
    if (name == NULL) return(NULL);
    if (value == NULL) return(NULL);

    localName = xmlSplitQName4(name, &prefix);
    if (localName == NULL)
        goto mem_error;

    if ((elem->ns != NULL) && (elem->ns->prefix != NULL)) {
  xmlChar buf[50];
  xmlChar *elemname;

  elemname = xmlBuildQName(elem->name, elem->ns->prefix, buf, 50);
  if (elemname == NULL)
      goto mem_error;
        if (doc->intSubset != NULL)
            attrDecl = xmlHashLookup3(doc->intSubset->attributes, localName,
                                      prefix, elemname);
  if ((attrDecl == NULL) && (doc->extSubset != NULL)) {
      attrDecl = xmlHashLookup3(doc->extSubset->attributes, localName,
                                      prefix, elemname);
      if (attrDecl != NULL)
    extsubset = 1;
  }
  if ((elemname != buf) && (elemname != elem->name))
      xmlFree(elemname);
    }
    if ((attrDecl == NULL) && (doc->intSubset != NULL))
  attrDecl = xmlHashLookup3(doc->intSubset->attributes, localName,
                                  prefix, elem->name);
    if ((attrDecl == NULL) && (doc->extSubset != NULL)) {
  attrDecl = xmlHashLookup3(doc->extSubset->attributes, localName,
                                  prefix, elem->name);
  if (attrDecl != NULL)
      extsubset = 1;
    }

    if (attrDecl == NULL)
  goto done;
    if (attrDecl->atype == XML_ATTRIBUTE_CDATA)
  goto done;

    ret = xmlStrdup(value);
    if (ret == NULL)
  goto mem_error;
    xmlValidNormalizeString(ret);
    if ((doc->standalone) && (extsubset == 1) && (!xmlStrEqual(value, ret))) {
  xmlErrValidNode(ctxt, elem, XML_DTD_NOT_STANDALONE,
"standalone: %s on %s value had to be normalized based on external subset declaration\n",
         name, elem->name, NULL);
  ctxt->valid = 0;
    }

    xmlFree(prefix);
    return(ret);

mem_error:
    xmlVErrMemory(ctxt);

done:
    xmlFree(prefix);
    return(NULL);
}

/**
 * xmlValidNormalizeAttributeValue:
 * @doc:  the document
 * @elem:  the parent
 * @name:  the attribute name
 * @value:  the attribute value
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Does the validation related extra step of the normalization of attribute
 * values:
 *
 * If the declared value is not CDATA, then the XML processor must further
 * process the normalized attribute value by discarding any leading and
 * trailing space (#x20) characters, and by replacing sequences of space
 * (#x20) characters by single space (#x20) character.
 *
 * Returns a new normalized string if normalization is needed, NULL otherwise
 *      the caller must free the returned value.
 */

xmlChar *
xmlValidNormalizeAttributeValue(xmlDocPtr doc, xmlNodePtr elem,
              const xmlChar *name, const xmlChar *value) {
    xmlChar *ret;
    xmlAttributePtr attrDecl = NULL;

    if (doc == NULL) return(NULL);
    if (elem == NULL) return(NULL);
    if (name == NULL) return(NULL);
    if (value == NULL) return(NULL);

    if ((elem->ns != NULL) && (elem->ns->prefix != NULL)) {
  xmlChar fn[50];
  xmlChar *fullname;

  fullname = xmlBuildQName(elem->name, elem->ns->prefix, fn, 50);
  if (fullname == NULL)
      return(NULL);
  if ((fullname != fn) && (fullname != elem->name))
      xmlFree(fullname);
    }
    attrDecl = xmlGetDtdAttrDesc(doc->intSubset, elem->name, name);
    if ((attrDecl == NULL) && (doc->extSubset != NULL))
  attrDecl = xmlGetDtdAttrDesc(doc->extSubset, elem->name, name);

    if (attrDecl == NULL)
  return(NULL);
    if (attrDecl->atype == XML_ATTRIBUTE_CDATA)
  return(NULL);

    ret = xmlStrdup(value);
    if (ret == NULL)
  return(NULL);
    xmlValidNormalizeString(ret);
    return(ret);
}

static void
xmlValidateAttributeIdCallback(void *payload, void *data,
                         const xmlChar *name ATTRIBUTE_UNUSED) {
    xmlAttributePtr attr = (xmlAttributePtr) payload;
    int *count = (int *) data;
    if (attr->atype == XML_ATTRIBUTE_ID) (*count)++;
}

/**
 * xmlValidateAttributeDecl:
 * @ctxt:  the validation context
 * @doc:  a document instance
 * @attr:  an attribute definition
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Try to validate a single attribute definition
 * basically it does the following checks as described by the
 * XML-1.0 recommendation:
 *  - [ VC: Attribute Default Legal ]
 *  - [ VC: Enumeration ]
 *  - [ VC: ID Attribute Default ]
 *
 * The ID/IDREF uniqueness and matching are done separately
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateAttributeDecl(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
                         xmlAttributePtr attr) {
    int ret = 1;
    int val;
    CHECK_DTD;
    if(attr == NULL) return(1);

    /* Attribute Default Legal */
    /* Enumeration */
    if (attr->defaultValue != NULL) {
  val = xmlValidateAttributeValueInternal(doc, attr->atype,
                                          attr->defaultValue);
  if (val == 0) {
      xmlErrValidNode(ctxt, (xmlNodePtr) attr, XML_DTD_ATTRIBUTE_DEFAULT,
         "Syntax of default value for attribute %s of %s is not valid\n",
             attr->name, attr->elem, NULL);
  }
        ret &= val;
    }

    /* ID Attribute Default */
    if ((attr->atype == XML_ATTRIBUTE_ID)&&
        (attr->def != XML_ATTRIBUTE_IMPLIED) &&
  (attr->def != XML_ATTRIBUTE_REQUIRED)) {
  xmlErrValidNode(ctxt, (xmlNodePtr) attr, XML_DTD_ID_FIXED,
          "ID attribute %s of %s is not valid must be #IMPLIED or #REQUIRED\n",
         attr->name, attr->elem, NULL);
  ret = 0;
    }

    /* One ID per Element Type */
    if (attr->atype == XML_ATTRIBUTE_ID) {
        xmlElementPtr elem = NULL;
        const xmlChar *elemLocalName;
        xmlChar *elemPrefix;
        int nbId;

        elemLocalName = xmlSplitQName4(attr->elem, &elemPrefix);
        if (elemLocalName == NULL) {
            xmlVErrMemory(ctxt);
            return(0);
        }

  /* the trick is that we parse DtD as their own internal subset */
        if (doc->intSubset != NULL)
            elem = xmlHashLookup2(doc->intSubset->elements,
                                  elemLocalName, elemPrefix);
  if (elem != NULL) {
      nbId = xmlScanIDAttributeDecl(ctxt, elem, 0);
  } else {
      xmlAttributeTablePtr table;

      /*
       * The attribute may be declared in the internal subset and the
       * element in the external subset.
       */
      nbId = 0;
      if (doc->intSubset != NULL) {
    table = (xmlAttributeTablePtr) doc->intSubset->attributes;
    xmlHashScan3(table, NULL, NULL, attr->elem,
           xmlValidateAttributeIdCallback, &nbId);
      }
  }
  if (nbId > 1) {

      xmlErrValidNodeNr(ctxt, (xmlNodePtr) attr, XML_DTD_ID_SUBSET,
       "Element %s has %d ID attribute defined in the internal subset : %s\n",
       attr->elem, nbId, attr->name);
            ret = 0;
  } else if (doc->extSubset != NULL) {
      int extId = 0;
      elem = xmlHashLookup2(doc->extSubset->elements,
                                  elemLocalName, elemPrefix);
      if (elem != NULL) {
    extId = xmlScanIDAttributeDecl(ctxt, elem, 0);
      }
      if (extId > 1) {
    xmlErrValidNodeNr(ctxt, (xmlNodePtr) attr, XML_DTD_ID_SUBSET,
       "Element %s has %d ID attribute defined in the external subset : %s\n",
           attr->elem, extId, attr->name);
                ret = 0;
      } else if (extId + nbId > 1) {
    xmlErrValidNode(ctxt, (xmlNodePtr) attr, XML_DTD_ID_SUBSET,
"Element %s has ID attributes defined in the internal and external subset : %s\n",
           attr->elem, attr->name, NULL);
                ret = 0;
      }
  }

        xmlFree(elemPrefix);
    }

    /* Validity Constraint: Enumeration */
    if ((attr->defaultValue != NULL) && (attr->tree != NULL)) {
        xmlEnumerationPtr tree = attr->tree;
  while (tree != NULL) {
      if (xmlStrEqual(tree->name, attr->defaultValue)) break;
      tree = tree->next;
  }
  if (tree == NULL) {
      xmlErrValidNode(ctxt, (xmlNodePtr) attr, XML_DTD_ATTRIBUTE_VALUE,
"Default value \"%s\" for attribute %s of %s is not among the enumerated set\n",
       attr->defaultValue, attr->name, attr->elem);
      ret = 0;
  }
    }

    return(ret);
}

/**
 * xmlValidateElementDecl:
 * @ctxt:  the validation context
 * @doc:  a document instance
 * @elem:  an element definition
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Try to validate a single element definition
 * basically it does the following checks as described by the
 * XML-1.0 recommendation:
 *  - [ VC: One ID per Element Type ]
 *  - [ VC: No Duplicate Types ]
 *  - [ VC: Unique Element Type Declaration ]
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateElementDecl(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
                       xmlElementPtr elem) {
    int ret = 1;
    xmlElementPtr tst;
    const xmlChar *localName;
    xmlChar *prefix;

    CHECK_DTD;

    if (elem == NULL) return(1);

    /* No Duplicate Types */
    if (elem->etype == XML_ELEMENT_TYPE_MIXED) {
  xmlElementContentPtr cur, next;
        const xmlChar *name;

  cur = elem->content;
  while (cur != NULL) {
      if (cur->type != XML_ELEMENT_CONTENT_OR) break;
      if (cur->c1 == NULL) break;
      if (cur->c1->type == XML_ELEMENT_CONTENT_ELEMENT) {
    name = cur->c1->name;
    next = cur->c2;
    while (next != NULL) {
        if (next->type == XML_ELEMENT_CONTENT_ELEMENT) {
            if ((xmlStrEqual(next->name, name)) &&
          (xmlStrEqual(next->prefix, cur->c1->prefix))) {
          if (cur->c1->prefix == NULL) {
        xmlErrValidNode(ctxt, (xmlNodePtr) elem, XML_DTD_CONTENT_ERROR,
       "Definition of %s has duplicate references of %s\n",
               elem->name, name, NULL);
          } else {
        xmlErrValidNode(ctxt, (xmlNodePtr) elem, XML_DTD_CONTENT_ERROR,
       "Definition of %s has duplicate references of %s:%s\n",
               elem->name, cur->c1->prefix, name);
          }
          ret = 0;
      }
      break;
        }
        if (next->c1 == NULL) break;
        if (next->c1->type != XML_ELEMENT_CONTENT_ELEMENT) break;
        if ((xmlStrEqual(next->c1->name, name)) &&
            (xmlStrEqual(next->c1->prefix, cur->c1->prefix))) {
      if (cur->c1->prefix == NULL) {
          xmlErrValidNode(ctxt, (xmlNodePtr) elem, XML_DTD_CONTENT_ERROR,
         "Definition of %s has duplicate references to %s\n",
           elem->name, name, NULL);
      } else {
          xmlErrValidNode(ctxt, (xmlNodePtr) elem, XML_DTD_CONTENT_ERROR,
         "Definition of %s has duplicate references to %s:%s\n",
           elem->name, cur->c1->prefix, name);
      }
      ret = 0;
        }
        next = next->c2;
    }
      }
      cur = cur->c2;
  }
    }

    localName = xmlSplitQName4(elem->name, &prefix);
    if (localName == NULL) {
        xmlVErrMemory(ctxt);
        return(0);
    }

    /* VC: Unique Element Type Declaration */
    if (doc->intSubset != NULL) {
        tst = xmlHashLookup2(doc->intSubset->elements, localName, prefix);

        if ((tst != NULL ) && (tst != elem) &&
            ((tst->prefix == elem->prefix) ||
             (xmlStrEqual(tst->prefix, elem->prefix))) &&
            (tst->etype != XML_ELEMENT_TYPE_UNDEFINED)) {
            xmlErrValidNode(ctxt, (xmlNodePtr) elem, XML_DTD_ELEM_REDEFINED,
                            "Redefinition of element %s\n",
                           elem->name, NULL, NULL);
            ret = 0;
        }
    }
    if (doc->extSubset != NULL) {
        tst = xmlHashLookup2(doc->extSubset->elements, localName, prefix);

        if ((tst != NULL ) && (tst != elem) &&
            ((tst->prefix == elem->prefix) ||
             (xmlStrEqual(tst->prefix, elem->prefix))) &&
            (tst->etype != XML_ELEMENT_TYPE_UNDEFINED)) {
            xmlErrValidNode(ctxt, (xmlNodePtr) elem, XML_DTD_ELEM_REDEFINED,
                            "Redefinition of element %s\n",
                           elem->name, NULL, NULL);
            ret = 0;
        }
    }

    /* One ID per Element Type
     * already done when registering the attribute
    if (xmlScanIDAttributeDecl(ctxt, elem) > 1) {
  ret = 0;
    } */

    xmlFree(prefix);
    return(ret);
}

/**
 * xmlValidateOneAttribute:
 * @ctxt:  the validation context
 * @doc:  a document instance
 * @elem:  an element instance
 * @attr:  an attribute instance
 * @value:  the attribute value (without entities processing)
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Try to validate a single attribute for an element
 * basically it does the following checks as described by the
 * XML-1.0 recommendation:
 *  - [ VC: Attribute Value Type ]
 *  - [ VC: Fixed Attribute Default ]
 *  - [ VC: Entity Name ]
 *  - [ VC: Name Token ]
 *  - [ VC: ID ]
 *  - [ VC: IDREF ]
 *  - [ VC: Entity Name ]
 *  - [ VC: Notation Attributes ]
 *
 * The ID/IDREF uniqueness and matching are done separately
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateOneAttribute(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
                        xmlNodePtr elem, xmlAttrPtr attr, const xmlChar *value)
{
    xmlAttributePtr attrDecl =  NULL;
    const xmlChar *aprefix;
    int val;
    int ret = 1;

    CHECK_DTD;
    if ((elem == NULL) || (elem->name == NULL)) return(0);
    if ((attr == NULL) || (attr->name == NULL)) return(0);

    aprefix = (attr->ns != NULL) ? attr->ns->prefix : NULL;

    if ((elem->ns != NULL) && (elem->ns->prefix != NULL)) {
  xmlChar fn[50];
  xmlChar *fullname;

  fullname = xmlBuildQName(elem->name, elem->ns->prefix, fn, 50);
  if (fullname == NULL) {
            xmlVErrMemory(ctxt);
      return(0);
        }
        attrDecl = xmlGetDtdQAttrDesc(doc->intSubset, fullname,
                                      attr->name, aprefix);
        if ((attrDecl == NULL) && (doc->extSubset != NULL))
            attrDecl = xmlGetDtdQAttrDesc(doc->extSubset, fullname,
                                          attr->name, aprefix);
  if ((fullname != fn) && (fullname != elem->name))
      xmlFree(fullname);
    }
    if (attrDecl == NULL) {
        attrDecl = xmlGetDtdQAttrDesc(doc->intSubset, elem->name,
                                      attr->name, aprefix);
        if ((attrDecl == NULL) && (doc->extSubset != NULL))
            attrDecl = xmlGetDtdQAttrDesc(doc->extSubset, elem->name,
                                          attr->name, aprefix);
    }


    /* Validity Constraint: Attribute Value Type */
    if (attrDecl == NULL) {
  xmlErrValidNode(ctxt, elem, XML_DTD_UNKNOWN_ATTRIBUTE,
         "No declaration for attribute %s of element %s\n",
         attr->name, elem->name, NULL);
  return(0);
    }
    if (attr->atype == XML_ATTRIBUTE_ID)
        xmlRemoveID(doc, attr);
    attr->atype = attrDecl->atype;

    val = xmlValidateAttributeValueInternal(doc, attrDecl->atype, value);
    if (val == 0) {
      xmlErrValidNode(ctxt, elem, XML_DTD_ATTRIBUTE_VALUE,
     "Syntax of value for attribute %s of %s is not valid\n",
         attr->name, elem->name, NULL);
        ret = 0;
    }

    /* Validity constraint: Fixed Attribute Default */
    if (attrDecl->def == XML_ATTRIBUTE_FIXED) {
  if (!xmlStrEqual(value, attrDecl->defaultValue)) {
      xmlErrValidNode(ctxt, elem, XML_DTD_ATTRIBUTE_DEFAULT,
     "Value for attribute %s of %s is different from default \"%s\"\n",
       attr->name, elem->name, attrDecl->defaultValue);
      ret = 0;
  }
    }

    /* Validity Constraint: ID uniqueness */
    if (attrDecl->atype == XML_ATTRIBUTE_ID) {
        if (xmlAddID(ctxt, doc, value, attr) == NULL)
      ret = 0;
    }

    if ((attrDecl->atype == XML_ATTRIBUTE_IDREF) ||
  (attrDecl->atype == XML_ATTRIBUTE_IDREFS)) {
        if (xmlAddRef(ctxt, doc, value, attr) == NULL)
      ret = 0;
    }

    /* Validity Constraint: Notation Attributes */
    if (attrDecl->atype == XML_ATTRIBUTE_NOTATION) {
        xmlEnumerationPtr tree = attrDecl->tree;
        xmlNotationPtr nota;

        /* First check that the given NOTATION was declared */
  nota = xmlGetDtdNotationDesc(doc->intSubset, value);
  if (nota == NULL)
      nota = xmlGetDtdNotationDesc(doc->extSubset, value);

  if (nota == NULL) {
      xmlErrValidNode(ctxt, elem, XML_DTD_UNKNOWN_NOTATION,
       "Value \"%s\" for attribute %s of %s is not a declared Notation\n",
       value, attr->name, elem->name);
      ret = 0;
        }

  /* Second, verify that it's among the list */
  while (tree != NULL) {
      if (xmlStrEqual(tree->name, value)) break;
      tree = tree->next;
  }
  if (tree == NULL) {
      xmlErrValidNode(ctxt, elem, XML_DTD_NOTATION_VALUE,
"Value \"%s\" for attribute %s of %s is not among the enumerated notations\n",
       value, attr->name, elem->name);
      ret = 0;
  }
    }

    /* Validity Constraint: Enumeration */
    if (attrDecl->atype == XML_ATTRIBUTE_ENUMERATION) {
        xmlEnumerationPtr tree = attrDecl->tree;
  while (tree != NULL) {
      if (xmlStrEqual(tree->name, value)) break;
      tree = tree->next;
  }
  if (tree == NULL) {
      xmlErrValidNode(ctxt, elem, XML_DTD_ATTRIBUTE_VALUE,
       "Value \"%s\" for attribute %s of %s is not among the enumerated set\n",
       value, attr->name, elem->name);
      ret = 0;
  }
    }

    /* Fixed Attribute Default */
    if ((attrDecl->def == XML_ATTRIBUTE_FIXED) &&
        (!xmlStrEqual(attrDecl->defaultValue, value))) {
  xmlErrValidNode(ctxt, elem, XML_DTD_ATTRIBUTE_VALUE,
     "Value for attribute %s of %s must be \"%s\"\n",
         attr->name, elem->name, attrDecl->defaultValue);
        ret = 0;
    }

    /* Extra check for the attribute value */
    ret &= xmlValidateAttributeValue2(ctxt, doc, attr->name,
              attrDecl->atype, value);

    return(ret);
}

/**
 * xmlValidateOneNamespace:
 * @ctxt:  the validation context
 * @doc:  a document instance
 * @elem:  an element instance
 * @prefix:  the namespace prefix
 * @ns:  an namespace declaration instance
 * @value:  the attribute value (without entities processing)
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Try to validate a single namespace declaration for an element
 * basically it does the following checks as described by the
 * XML-1.0 recommendation:
 *  - [ VC: Attribute Value Type ]
 *  - [ VC: Fixed Attribute Default ]
 *  - [ VC: Entity Name ]
 *  - [ VC: Name Token ]
 *  - [ VC: ID ]
 *  - [ VC: IDREF ]
 *  - [ VC: Entity Name ]
 *  - [ VC: Notation Attributes ]
 *
 * The ID/IDREF uniqueness and matching are done separately
 *
 * returns 1 if valid or 0 otherwise
 */

int
xmlValidateOneNamespace(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
xmlNodePtr elem, const xmlChar *prefix, xmlNsPtr ns, const xmlChar *value) {
    /* xmlElementPtr elemDecl; */
    xmlAttributePtr attrDecl =  NULL;
    int val;
    int ret = 1;

    CHECK_DTD;
    if ((elem == NULL) || (elem->name == NULL)) return(0);
    if ((ns == NULL) || (ns->href == NULL)) return(0);

    if (prefix != NULL) {
  xmlChar fn[50];
  xmlChar *fullname;

  fullname = xmlBuildQName(elem->name, prefix, fn, 50);
  if (fullname == NULL) {
      xmlVErrMemory(ctxt);
      return(0);
  }
  if (ns->prefix != NULL) {
      attrDecl = xmlGetDtdQAttrDesc(doc->intSubset, fullname,
                              ns->prefix, BAD_CAST "xmlns");
      if ((attrDecl == NULL) && (doc->extSubset != NULL))
    attrDecl = xmlGetDtdQAttrDesc(doc->extSubset, fullname,
            ns->prefix, BAD_CAST "xmlns");
  } else {
      attrDecl = xmlGetDtdQAttrDesc(doc->intSubset, fullname,
                                          BAD_CAST "xmlns", NULL);
      if ((attrDecl == NULL) && (doc->extSubset != NULL))
    attrDecl = xmlGetDtdQAttrDesc(doc->extSubset, fullname,
                                              BAD_CAST "xmlns", NULL);
  }
  if ((fullname != fn) && (fullname != elem->name))
      xmlFree(fullname);
    }
    if (attrDecl == NULL) {
  if (ns->prefix != NULL) {
      attrDecl = xmlGetDtdQAttrDesc(doc->intSubset, elem->name,
                              ns->prefix, BAD_CAST "xmlns");
      if ((attrDecl == NULL) && (doc->extSubset != NULL))
    attrDecl = xmlGetDtdQAttrDesc(doc->extSubset, elem->name,
                ns->prefix, BAD_CAST "xmlns");
  } else {
      attrDecl = xmlGetDtdQAttrDesc(doc->intSubset, elem->name,
                                          BAD_CAST "xmlns", NULL);
      if ((attrDecl == NULL) && (doc->extSubset != NULL))
    attrDecl = xmlGetDtdQAttrDesc(doc->extSubset, elem->name,
                                              BAD_CAST "xmlns", NULL);
  }
    }


    /* Validity Constraint: Attribute Value Type */
    if (attrDecl == NULL) {
  if (ns->prefix != NULL) {
      xmlErrValidNode(ctxt, elem, XML_DTD_UNKNOWN_ATTRIBUTE,
       "No declaration for attribute xmlns:%s of element %s\n",
       ns->prefix, elem->name, NULL);
  } else {
      xmlErrValidNode(ctxt, elem, XML_DTD_UNKNOWN_ATTRIBUTE,
       "No declaration for attribute xmlns of element %s\n",
       elem->name, NULL, NULL);
  }
  return(0);
    }

    val = xmlValidateAttributeValueInternal(doc, attrDecl->atype, value);
    if (val == 0) {
  if (ns->prefix != NULL) {
      xmlErrValidNode(ctxt, elem, XML_DTD_INVALID_DEFAULT,
         "Syntax of value for attribute xmlns:%s of %s is not valid\n",
       ns->prefix, elem->name, NULL);
  } else {
      xmlErrValidNode(ctxt, elem, XML_DTD_INVALID_DEFAULT,
         "Syntax of value for attribute xmlns of %s is not valid\n",
       elem->name, NULL, NULL);
  }
        ret = 0;
    }

    /* Validity constraint: Fixed Attribute Default */
    if (attrDecl->def == XML_ATTRIBUTE_FIXED) {
  if (!xmlStrEqual(value, attrDecl->defaultValue)) {
      if (ns->prefix != NULL) {
    xmlErrValidNode(ctxt, elem, XML_DTD_ATTRIBUTE_DEFAULT,
       "Value for attribute xmlns:%s of %s is different from default \"%s\"\n",
           ns->prefix, elem->name, attrDecl->defaultValue);
      } else {
    xmlErrValidNode(ctxt, elem, XML_DTD_ATTRIBUTE_DEFAULT,
       "Value for attribute xmlns of %s is different from default \"%s\"\n",
           elem->name, attrDecl->defaultValue, NULL);
      }
      ret = 0;
  }
    }

    /* Validity Constraint: Notation Attributes */
    if (attrDecl->atype == XML_ATTRIBUTE_NOTATION) {
        xmlEnumerationPtr tree = attrDecl->tree;
        xmlNotationPtr nota;

        /* First check that the given NOTATION was declared */
  nota = xmlGetDtdNotationDesc(doc->intSubset, value);
  if (nota == NULL)
      nota = xmlGetDtdNotationDesc(doc->extSubset, value);

  if (nota == NULL) {
      if (ns->prefix != NULL) {
    xmlErrValidNode(ctxt, elem, XML_DTD_UNKNOWN_NOTATION,
       "Value \"%s\" for attribute xmlns:%s of %s is not a declared Notation\n",
           value, ns->prefix, elem->name);
      } else {
    xmlErrValidNode(ctxt, elem, XML_DTD_UNKNOWN_NOTATION,
       "Value \"%s\" for attribute xmlns of %s is not a declared Notation\n",
           value, elem->name, NULL);
      }
      ret = 0;
        }

  /* Second, verify that it's among the list */
  while (tree != NULL) {
      if (xmlStrEqual(tree->name, value)) break;
      tree = tree->next;
  }
  if (tree == NULL) {
      if (ns->prefix != NULL) {
    xmlErrValidNode(ctxt, elem, XML_DTD_NOTATION_VALUE,
"Value \"%s\" for attribute xmlns:%s of %s is not among the enumerated notations\n",
           value, ns->prefix, elem->name);
      } else {
    xmlErrValidNode(ctxt, elem, XML_DTD_NOTATION_VALUE,
"Value \"%s\" for attribute xmlns of %s is not among the enumerated notations\n",
           value, elem->name, NULL);
      }
      ret = 0;
  }
    }

    /* Validity Constraint: Enumeration */
    if (attrDecl->atype == XML_ATTRIBUTE_ENUMERATION) {
        xmlEnumerationPtr tree = attrDecl->tree;
  while (tree != NULL) {
      if (xmlStrEqual(tree->name, value)) break;
      tree = tree->next;
  }
  if (tree == NULL) {
      if (ns->prefix != NULL) {
    xmlErrValidNode(ctxt, elem, XML_DTD_ATTRIBUTE_VALUE,
"Value \"%s\" for attribute xmlns:%s of %s is not among the enumerated set\n",
           value, ns->prefix, elem->name);
      } else {
    xmlErrValidNode(ctxt, elem, XML_DTD_ATTRIBUTE_VALUE,
"Value \"%s\" for attribute xmlns of %s is not among the enumerated set\n",
           value, elem->name, NULL);
      }
      ret = 0;
  }
    }

    /* Fixed Attribute Default */
    if ((attrDecl->def == XML_ATTRIBUTE_FIXED) &&
        (!xmlStrEqual(attrDecl->defaultValue, value))) {
  if (ns->prefix != NULL) {
      xmlErrValidNode(ctxt, elem, XML_DTD_ELEM_NAMESPACE,
       "Value for attribute xmlns:%s of %s must be \"%s\"\n",
       ns->prefix, elem->name, attrDecl->defaultValue);
  } else {
      xmlErrValidNode(ctxt, elem, XML_DTD_ELEM_NAMESPACE,
       "Value for attribute xmlns of %s must be \"%s\"\n",
       elem->name, attrDecl->defaultValue, NULL);
  }
        ret = 0;
    }

    /* Extra check for the attribute value */
    if (ns->prefix != NULL) {
  ret &= xmlValidateAttributeValue2(ctxt, doc, ns->prefix,
            attrDecl->atype, value);
    } else {
  ret &= xmlValidateAttributeValue2(ctxt, doc, BAD_CAST "xmlns",
            attrDecl->atype, value);
    }

    return(ret);
}

#ifndef  LIBXML_REGEXP_ENABLED
/**
 * xmlValidateSkipIgnorable:
 * @ctxt:  the validation context
 * @child:  the child list
 *
 * Skip ignorable elements w.r.t. the validation process
 *
 * returns the first element to consider for validation of the content model
 */

static xmlNodePtr
xmlValidateSkipIgnorable(xmlNodePtr child) {
    while (child != NULL) {
  switch (child->type) {
      /* These things are ignored (skipped) during validation.  */
      case XML_PI_NODE:
      case XML_COMMENT_NODE:
      case XML_XINCLUDE_START:
      case XML_XINCLUDE_END:
    child = child->next;
    break;
      case XML_TEXT_NODE:
    if (xmlIsBlankNode(child))
        child = child->next;
    else
        return(child);
    break;
      /* keep current node */
      default:
    return(child);
  }
    }
    return(child);
}

/**
 * xmlValidateElementType:
 * @ctxt:  the validation context
 *
 * Try to validate the content model of an element internal function
 *
 * returns 1 if valid or 0 ,-1 in case of error, -2 if an entity
 *           reference is found and -3 if the validation succeeded but
 *           the content model is not determinist.
 */

static int
xmlValidateElementType(xmlValidCtxtPtr ctxt) {
    int ret = -1;
    int determinist = 1;

    NODE = xmlValidateSkipIgnorable(NODE);
    if ((NODE == NULL) && (CONT == NULL))
  return(1);
    if ((NODE == NULL) &&
  ((CONT->ocur == XML_ELEMENT_CONTENT_MULT) ||
   (CONT->ocur == XML_ELEMENT_CONTENT_OPT))) {
  return(1);
    }
    if (CONT == NULL) return(-1);
    if ((NODE != NULL) && (NODE->type == XML_ENTITY_REF_NODE))
  return(-2);

    /*
     * We arrive here when more states need to be examined
     */
cont:

    /*
     * We just recovered from a rollback generated by a possible
     * epsilon transition, go directly to the analysis phase
     */
    if (STATE == ROLLBACK_PARENT) {
  ret = 1;
  goto analyze;
    }

    /*
     * we may have to save a backup state here. This is the equivalent
     * of handling epsilon transition in NFAs.
     */
    if ((CONT != NULL) &&
  ((CONT->parent == NULL) ||
   (CONT->parent == (xmlElementContentPtr) 1) ||
   (CONT->parent->type != XML_ELEMENT_CONTENT_OR)) &&
  ((CONT->ocur == XML_ELEMENT_CONTENT_MULT) ||
   (CONT->ocur == XML_ELEMENT_CONTENT_OPT) ||
   ((CONT->ocur == XML_ELEMENT_CONTENT_PLUS) && (OCCURRENCE)))) {
  if (vstateVPush(ctxt, CONT, NODE, DEPTH, OCCURS, ROLLBACK_PARENT) < 0)
      return(0);
    }


    /*
     * Check first if the content matches
     */
    switch (CONT->type) {
  case XML_ELEMENT_CONTENT_PCDATA:
      if (NODE == NULL) {
    ret = 0;
    break;
      }
      if (NODE->type == XML_TEXT_NODE) {
    /*
     * go to next element in the content model
     * skipping ignorable elems
     */
    do {
        NODE = NODE->next;
        NODE = xmlValidateSkipIgnorable(NODE);
        if ((NODE != NULL) &&
      (NODE->type == XML_ENTITY_REF_NODE))
      return(-2);
    } while ((NODE != NULL) &&
       ((NODE->type != XML_ELEMENT_NODE) &&
        (NODE->type != XML_TEXT_NODE) &&
        (NODE->type != XML_CDATA_SECTION_NODE)));
                ret = 1;
    break;
      } else {
    ret = 0;
    break;
      }
      break;
  case XML_ELEMENT_CONTENT_ELEMENT:
      if (NODE == NULL) {
    ret = 0;
    break;
      }
      ret = ((NODE->type == XML_ELEMENT_NODE) &&
       (xmlStrEqual(NODE->name, CONT->name)));
      if (ret == 1) {
    if ((NODE->ns == NULL) || (NODE->ns->prefix == NULL)) {
        ret = (CONT->prefix == NULL);
    } else if (CONT->prefix == NULL) {
        ret = 0;
    } else {
        ret = xmlStrEqual(NODE->ns->prefix, CONT->prefix);
    }
      }
      if (ret == 1) {
    /*
     * go to next element in the content model
     * skipping ignorable elems
     */
    do {
        NODE = NODE->next;
        NODE = xmlValidateSkipIgnorable(NODE);
        if ((NODE != NULL) &&
      (NODE->type == XML_ENTITY_REF_NODE))
      return(-2);
    } while ((NODE != NULL) &&
       ((NODE->type != XML_ELEMENT_NODE) &&
        (NODE->type != XML_TEXT_NODE) &&
        (NODE->type != XML_CDATA_SECTION_NODE)));
      } else {
    ret = 0;
    break;
      }
      break;
  case XML_ELEMENT_CONTENT_OR:
      /*
       * Small optimization.
       */
      if (CONT->c1->type == XML_ELEMENT_CONTENT_ELEMENT) {
    if ((NODE == NULL) ||
        (!xmlStrEqual(NODE->name, CONT->c1->name))) {
        DEPTH++;
        CONT = CONT->c2;
        goto cont;
    }
    if ((NODE->ns == NULL) || (NODE->ns->prefix == NULL)) {
        ret = (CONT->c1->prefix == NULL);
    } else if (CONT->c1->prefix == NULL) {
        ret = 0;
    } else {
        ret = xmlStrEqual(NODE->ns->prefix, CONT->c1->prefix);
    }
    if (ret == 0) {
        DEPTH++;
        CONT = CONT->c2;
        goto cont;
    }
      }

      /*
       * save the second branch 'or' branch
       */
      if (vstateVPush(ctxt, CONT->c2, NODE, DEPTH + 1,
          OCCURS, ROLLBACK_OR) < 0)
    return(-1);
      DEPTH++;
      CONT = CONT->c1;
      goto cont;
  case XML_ELEMENT_CONTENT_SEQ:
      /*
       * Small optimization.
       */
      if ((CONT->c1->type == XML_ELEMENT_CONTENT_ELEMENT) &&
    ((CONT->c1->ocur == XML_ELEMENT_CONTENT_OPT) ||
     (CONT->c1->ocur == XML_ELEMENT_CONTENT_MULT))) {
    if ((NODE == NULL) ||
        (!xmlStrEqual(NODE->name, CONT->c1->name))) {
        DEPTH++;
        CONT = CONT->c2;
        goto cont;
    }
    if ((NODE->ns == NULL) || (NODE->ns->prefix == NULL)) {
        ret = (CONT->c1->prefix == NULL);
    } else if (CONT->c1->prefix == NULL) {
        ret = 0;
    } else {
        ret = xmlStrEqual(NODE->ns->prefix, CONT->c1->prefix);
    }
    if (ret == 0) {
        DEPTH++;
        CONT = CONT->c2;
        goto cont;
    }
      }
      DEPTH++;
      CONT = CONT->c1;
      goto cont;
    }

    /*
     * At this point handle going up in the tree
     */
    if (ret == -1) {
  return(ret);
    }
analyze:
    while (CONT != NULL) {
  /*
   * First do the analysis depending on the occurrence model at
   * this level.
   */
  if (ret == 0) {
      switch (CONT->ocur) {
    xmlNodePtr cur;

    case XML_ELEMENT_CONTENT_ONCE:
        cur = ctxt->vstate->node;
        if (vstateVPop(ctxt) < 0 ) {
      return(0);
        }
        if (cur != ctxt->vstate->node)
      determinist = -3;
        goto cont;
    case XML_ELEMENT_CONTENT_PLUS:
        if (OCCURRENCE == 0) {
      cur = ctxt->vstate->node;
      if (vstateVPop(ctxt) < 0 ) {
          return(0);
      }
      if (cur != ctxt->vstate->node)
          determinist = -3;
      goto cont;
        }
        ret = 1;
        break;
    case XML_ELEMENT_CONTENT_MULT:
        ret = 1;
        break;
    case XML_ELEMENT_CONTENT_OPT:
        ret = 1;
        break;
      }
  } else {
      switch (CONT->ocur) {
    case XML_ELEMENT_CONTENT_OPT:
        ret = 1;
        break;
    case XML_ELEMENT_CONTENT_ONCE:
        ret = 1;
        break;
    case XML_ELEMENT_CONTENT_PLUS:
        if (STATE == ROLLBACK_PARENT) {
      ret = 1;
      break;
        }
        if (NODE == NULL) {
      ret = 1;
      break;
        }
        SET_OCCURRENCE;
        goto cont;
    case XML_ELEMENT_CONTENT_MULT:
        if (STATE == ROLLBACK_PARENT) {
      ret = 1;
      break;
        }
        if (NODE == NULL) {
      ret = 1;
      break;
        }
        /* SET_OCCURRENCE; */
        goto cont;
      }
  }
  STATE = 0;

  /*
   * Then act accordingly at the parent level
   */
  RESET_OCCURRENCE;
  if ((CONT->parent == NULL) ||
            (CONT->parent == (xmlElementContentPtr) 1))
      break;

  switch (CONT->parent->type) {
      case XML_ELEMENT_CONTENT_PCDATA:
    return(-1);
      case XML_ELEMENT_CONTENT_ELEMENT:
    return(-1);
      case XML_ELEMENT_CONTENT_OR:
    if (ret == 1) {
        CONT = CONT->parent;
        DEPTH--;
    } else {
        CONT = CONT->parent;
        DEPTH--;
    }
    break;
      case XML_ELEMENT_CONTENT_SEQ:
    if (ret == 0) {
        CONT = CONT->parent;
        DEPTH--;
    } else if (CONT == CONT->parent->c1) {
        CONT = CONT->parent->c2;
        goto cont;
    } else {
        CONT = CONT->parent;
        DEPTH--;
    }
  }
    }
    if (NODE != NULL) {
  xmlNodePtr cur;

  cur = ctxt->vstate->node;
  if (vstateVPop(ctxt) < 0 ) {
      return(0);
  }
  if (cur != ctxt->vstate->node)
      determinist = -3;
  goto cont;
    }
    if (ret == 0) {
  xmlNodePtr cur;

  cur = ctxt->vstate->node;
  if (vstateVPop(ctxt) < 0 ) {
      return(0);
  }
  if (cur != ctxt->vstate->node)
      determinist = -3;
  goto cont;
    }
    return(determinist);
}
#endif

/**
 * xmlSnprintfElements:
 * @buf:  an output buffer
 * @size:  the size of the buffer
 * @content:  An element
 * @glob: 1 if one must print the englobing parenthesis, 0 otherwise
 *
 * This will dump the list of elements to the buffer
 * Intended just for the debug routine
 */
static void
xmlSnprintfElements(char *buf, int size, xmlNodePtr node, int glob) {
    xmlNodePtr cur;
    int len;

    if (node == NULL) return;
    if (glob) strcat(buf, "(");
    cur = node;
    while (cur != NULL) {
  len = strlen(buf);
  if (size - len < 50) {
      if ((size - len > 4) && (buf[len - 1] != '.'))
    strcat(buf, " ...");
      return;
  }
        switch (cur->type) {
            case XML_ELEMENT_NODE:
    if ((cur->ns != NULL) && (cur->ns->prefix != NULL)) {
        if (size - len < xmlStrlen(cur->ns->prefix) + 10) {
      if ((size - len > 4) && (buf[len - 1] != '.'))
          strcat(buf, " ...");
      return;
        }
        strcat(buf, (char *) cur->ns->prefix);
        strcat(buf, ":");
    }
                if (size - len < xmlStrlen(cur->name) + 10) {
        if ((size - len > 4) && (buf[len - 1] != '.'))
      strcat(buf, " ...");
        return;
    }
                if (cur->name != NULL)
              strcat(buf, (char *) cur->name);
    if (cur->next != NULL)
        strcat(buf, " ");
    break;
            case XML_TEXT_NODE:
    if (xmlIsBlankNode(cur))
        break;
                /* Falls through. */
            case XML_CDATA_SECTION_NODE:
            case XML_ENTITY_REF_NODE:
          strcat(buf, "CDATA");
    if (cur->next != NULL)
        strcat(buf, " ");
    break;
            case XML_ATTRIBUTE_NODE:
            case XML_DOCUMENT_NODE:
      case XML_HTML_DOCUMENT_NODE:
            case XML_DOCUMENT_TYPE_NODE:
            case XML_DOCUMENT_FRAG_NODE:
            case XML_NOTATION_NODE:
      case XML_NAMESPACE_DECL:
          strcat(buf, "???");
    if (cur->next != NULL)
        strcat(buf, " ");
    break;
            case XML_ENTITY_NODE:
            case XML_PI_NODE:
            case XML_DTD_NODE:
            case XML_COMMENT_NODE:
      case XML_ELEMENT_DECL:
      case XML_ATTRIBUTE_DECL:
      case XML_ENTITY_DECL:
      case XML_XINCLUDE_START:
      case XML_XINCLUDE_END:
    break;
  }
  cur = cur->next;
    }
    if (glob) strcat(buf, ")");
}

/**
 * xmlValidateElementContent:
 * @ctxt:  the validation context
 * @child:  the child list
 * @elemDecl:  pointer to the element declaration
 * @warn:  emit the error message
 * @parent: the parent element (for error reporting)
 *
 * Try to validate the content model of an element
 *
 * returns 1 if valid or 0 if not and -1 in case of error
 */

static int
xmlValidateElementContent(xmlValidCtxtPtr ctxt, xmlNodePtr child,
       xmlElementPtr elemDecl, int warn, xmlNodePtr parent) {
    int ret = 1;
#ifndef  LIBXML_REGEXP_ENABLED
    xmlNodePtr repl = NULL, last = NULL, tmp;
#endif
    xmlNodePtr cur;
    xmlElementContentPtr cont;
    const xmlChar *name;

    if ((elemDecl == NULL) || (parent == NULL) || (ctxt == NULL))
  return(-1);
    cont = elemDecl->content;
    name = elemDecl->name;

#ifdef LIBXML_REGEXP_ENABLED
    /* Build the regexp associated to the content model */
    if (elemDecl->contModel == NULL)
  ret = xmlValidBuildContentModel(ctxt, elemDecl);
    if (elemDecl->contModel == NULL) {
  return(-1);
    } else {
  xmlRegExecCtxtPtr exec;

  if (!xmlRegexpIsDeterminist(elemDecl->contModel)) {
      return(-1);
  }
  ctxt->nodeMax = 0;
  ctxt->nodeNr = 0;
  ctxt->nodeTab = NULL;
  exec = xmlRegNewExecCtxt(elemDecl->contModel, NULL, NULL);
  if (exec == NULL) {
            xmlVErrMemory(ctxt);
            return(-1);
        }
        cur = child;
        while (cur != NULL) {
            switch (cur->type) {
                case XML_ENTITY_REF_NODE:
                    /*
                     * Push the current node to be able to roll back
                     * and process within the entity
                     */
                    if ((cur->children != NULL) &&
                        (cur->children->children != NULL)) {
                        nodeVPush(ctxt, cur);
                        cur = cur->children->children;
                        continue;
                    }
                    break;
                case XML_TEXT_NODE:
                    if (xmlIsBlankNode(cur))
                        break;
                    ret = 0;
                    goto fail;
                case XML_CDATA_SECTION_NODE:
                    /* TODO */
                    ret = 0;
                    goto fail;
                case XML_ELEMENT_NODE:
                    if ((cur->ns != NULL) && (cur->ns->prefix != NULL)) {
                        xmlChar fn[50];
                        xmlChar *fullname;

                        fullname = xmlBuildQName(cur->name,
                                                 cur->ns->prefix, fn, 50);
                        if (fullname == NULL) {
                            xmlVErrMemory(ctxt);
                            ret = -1;
                            goto fail;
                        }
                        ret = xmlRegExecPushString(exec, fullname, NULL);
                        if ((fullname != fn) && (fullname != cur->name))
                            xmlFree(fullname);
                    } else {
                        ret = xmlRegExecPushString(exec, cur->name, NULL);
                    }
                    break;
                default:
                    break;
            }
            if (ret == XML_REGEXP_OUT_OF_MEMORY)
                xmlVErrMemory(ctxt);
            /*
             * Switch to next element
             */
            cur = cur->next;
            while (cur == NULL) {
                cur = nodeVPop(ctxt);
                if (cur == NULL)
                    break;
                cur = cur->next;
            }
        }
        ret = xmlRegExecPushString(exec, NULL, NULL);
        if (ret == XML_REGEXP_OUT_OF_MEMORY)
            xmlVErrMemory(ctxt);
fail:
        xmlRegFreeExecCtxt(exec);
    }
#else  /* LIBXML_REGEXP_ENABLED */
    /*
     * Allocate the stack
     */
    ctxt->vstateMax = 8;
    ctxt->vstateTab = (xmlValidState *) xmlMalloc(
     ctxt->vstateMax * sizeof(ctxt->vstateTab[0]));
    if (ctxt->vstateTab == NULL) {
  xmlVErrMemory(ctxt);
  return(-1);
    }
    /*
     * The first entry in the stack is reserved to the current state
     */
    ctxt->nodeMax = 0;
    ctxt->nodeNr = 0;
    ctxt->nodeTab = NULL;
    ctxt->vstate = &ctxt->vstateTab[0];
    ctxt->vstateNr = 1;
    CONT = cont;
    NODE = child;
    DEPTH = 0;
    OCCURS = 0;
    STATE = 0;
    ret = xmlValidateElementType(ctxt);
    if ((ret == -3) && (warn)) {
  char expr[5000];
  expr[0] = 0;
  xmlSnprintfElementContent(expr, 5000, elemDecl->content, 1);
  xmlErrValidNode(ctxt, (xmlNodePtr) elemDecl,
                XML_DTD_CONTENT_NOT_DETERMINIST,
          "Content model of %s is not deterministic: %s\n",
          name, BAD_CAST expr, NULL);
    } else if (ret == -2) {
  /*
   * An entities reference appeared at this level.
   * Build a minimal representation of this node content
   * sufficient to run the validation process on it
   */
  cur = child;
  while (cur != NULL) {
      switch (cur->type) {
    case XML_ENTITY_REF_NODE:
        /*
         * Push the current node to be able to roll back
         * and process within the entity
         */
        if ((cur->children != NULL) &&
      (cur->children->children != NULL)) {
      nodeVPush(ctxt, cur);
      cur = cur->children->children;
      continue;
        }
        break;
    case XML_TEXT_NODE:
        if (xmlIsBlankNode(cur))
      break;
        /* no break on purpose */
    case XML_CDATA_SECTION_NODE:
        /* no break on purpose */
    case XML_ELEMENT_NODE:
        /*
         * Allocate a new node and minimally fills in
         * what's required
         */
        tmp = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
        if (tmp == NULL) {
      xmlVErrMemory(ctxt);
      xmlFreeNodeList(repl);
      ret = -1;
      goto done;
        }
        tmp->type = cur->type;
        tmp->name = cur->name;
        tmp->ns = cur->ns;
        tmp->next = NULL;
        tmp->content = NULL;
        if (repl == NULL)
      repl = last = tmp;
        else {
      last->next = tmp;
      last = tmp;
        }
        if (cur->type == XML_CDATA_SECTION_NODE) {
      /*
       * E59 spaces in CDATA does not match the
       * nonterminal S
       */
      tmp->content = xmlStrdup(BAD_CAST "CDATA");
        }
        break;
    default:
        break;
      }
      /*
       * Switch to next element
       */
      cur = cur->next;
      while (cur == NULL) {
    cur = nodeVPop(ctxt);
    if (cur == NULL)
        break;
    cur = cur->next;
      }
  }

  /*
   * Relaunch the validation
   */
  ctxt->vstate = &ctxt->vstateTab[0];
  ctxt->vstateNr = 1;
  CONT = cont;
  NODE = repl;
  DEPTH = 0;
  OCCURS = 0;
  STATE = 0;
  ret = xmlValidateElementType(ctxt);
    }
#endif /* LIBXML_REGEXP_ENABLED */
    if ((warn) && ((ret != 1) && (ret != -3))) {
  if (ctxt != NULL) {
      char expr[5000];
      char list[5000];

      expr[0] = 0;
      xmlSnprintfElementContent(&expr[0], 5000, cont, 1);
      list[0] = 0;
#ifndef LIBXML_REGEXP_ENABLED
      if (repl != NULL)
    xmlSnprintfElements(&list[0], 5000, repl, 1);
      else
#endif /* LIBXML_REGEXP_ENABLED */
    xmlSnprintfElements(&list[0], 5000, child, 1);

      if (name != NULL) {
    xmlErrValidNode(ctxt, parent, XML_DTD_CONTENT_MODEL,
     "Element %s content does not follow the DTD, expecting %s, got %s\n",
           name, BAD_CAST expr, BAD_CAST list);
      } else {
    xmlErrValidNode(ctxt, parent, XML_DTD_CONTENT_MODEL,
     "Element content does not follow the DTD, expecting %s, got %s\n",
           BAD_CAST expr, BAD_CAST list, NULL);
      }
  } else {
      if (name != NULL) {
    xmlErrValidNode(ctxt, parent, XML_DTD_CONTENT_MODEL,
           "Element %s content does not follow the DTD\n",
           name, NULL, NULL);
      } else {
    xmlErrValidNode(ctxt, parent, XML_DTD_CONTENT_MODEL,
           "Element content does not follow the DTD\n",
                    NULL, NULL, NULL);
      }
  }
  ret = 0;
    }
    if (ret == -3)
  ret = 1;

#ifndef  LIBXML_REGEXP_ENABLED
done:
    /*
     * Deallocate the copy if done, and free up the validation stack
     */
    while (repl != NULL) {
  tmp = repl->next;
  xmlFree(repl);
  repl = tmp;
    }
    ctxt->vstateMax = 0;
    if (ctxt->vstateTab != NULL) {
  xmlFree(ctxt->vstateTab);
  ctxt->vstateTab = NULL;
    }
#endif
    ctxt->nodeMax = 0;
    ctxt->nodeNr = 0;
    if (ctxt->nodeTab != NULL) {
  xmlFree(ctxt->nodeTab);
  ctxt->nodeTab = NULL;
    }
    return(ret);

}

/**
 * xmlValidateCdataElement:
 * @ctxt:  the validation context
 * @doc:  a document instance
 * @elem:  an element instance
 *
 * Check that an element follows #CDATA
 *
 * returns 1 if valid or 0 otherwise
 */
static int
xmlValidateOneCdataElement(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
                           xmlNodePtr elem) {
    int ret = 1;
    xmlNodePtr cur, child;

    if ((ctxt == NULL) || (doc == NULL) || (elem == NULL) ||
        (elem->type != XML_ELEMENT_NODE))
  return(0);

    child = elem->children;

    cur = child;
    while (cur != NULL) {
  switch (cur->type) {
      case XML_ENTITY_REF_NODE:
    /*
     * Push the current node to be able to roll back
     * and process within the entity
     */
    if ((cur->children != NULL) &&
        (cur->children->children != NULL)) {
        nodeVPush(ctxt, cur);
        cur = cur->children->children;
        continue;
    }
    break;
      case XML_COMMENT_NODE:
      case XML_PI_NODE:
      case XML_TEXT_NODE:
      case XML_CDATA_SECTION_NODE:
    break;
      default:
    ret = 0;
    goto done;
  }
  /*
   * Switch to next element
   */
  cur = cur->next;
  while (cur == NULL) {
      cur = nodeVPop(ctxt);
      if (cur == NULL)
    break;
      cur = cur->next;
  }
    }
done:
    ctxt->nodeMax = 0;
    ctxt->nodeNr = 0;
    if (ctxt->nodeTab != NULL) {
  xmlFree(ctxt->nodeTab);
  ctxt->nodeTab = NULL;
    }
    return(ret);
}

#ifdef LIBXML_REGEXP_ENABLED
/**
 * xmlValidateCheckMixed:
 * @ctxt:  the validation context
 * @cont:  the mixed content model
 * @qname:  the qualified name as appearing in the serialization
 *
 * Check if the given node is part of the content model.
 *
 * Returns 1 if yes, 0 if no, -1 in case of error
 */
static int
xmlValidateCheckMixed(xmlValidCtxtPtr ctxt,
                xmlElementContentPtr cont, const xmlChar *qname) {
    const xmlChar *name;
    int plen;
    name = xmlSplitQName3(qname, &plen);

    if (name == NULL) {
  while (cont != NULL) {
      if (cont->type == XML_ELEMENT_CONTENT_ELEMENT) {
    if ((cont->prefix == NULL) && (xmlStrEqual(cont->name, qname)))
        return(1);
      } else if ((cont->type == XML_ELEMENT_CONTENT_OR) &&
         (cont->c1 != NULL) &&
         (cont->c1->type == XML_ELEMENT_CONTENT_ELEMENT)){
    if ((cont->c1->prefix == NULL) &&
        (xmlStrEqual(cont->c1->name, qname)))
        return(1);
      } else if ((cont->type != XML_ELEMENT_CONTENT_OR) ||
    (cont->c1 == NULL) ||
    (cont->c1->type != XML_ELEMENT_CONTENT_PCDATA)){
    xmlErrValid(NULL, XML_DTD_MIXED_CORRUPT,
      "Internal: MIXED struct corrupted\n",
      NULL);
    break;
      }
      cont = cont->c2;
  }
    } else {
  while (cont != NULL) {
      if (cont->type == XML_ELEMENT_CONTENT_ELEMENT) {
    if ((cont->prefix != NULL) &&
        (xmlStrncmp(cont->prefix, qname, plen) == 0) &&
        (xmlStrEqual(cont->name, name)))
        return(1);
      } else if ((cont->type == XML_ELEMENT_CONTENT_OR) &&
         (cont->c1 != NULL) &&
         (cont->c1->type == XML_ELEMENT_CONTENT_ELEMENT)){
    if ((cont->c1->prefix != NULL) &&
        (xmlStrncmp(cont->c1->prefix, qname, plen) == 0) &&
        (xmlStrEqual(cont->c1->name, name)))
        return(1);
      } else if ((cont->type != XML_ELEMENT_CONTENT_OR) ||
    (cont->c1 == NULL) ||
    (cont->c1->type != XML_ELEMENT_CONTENT_PCDATA)){
    xmlErrValid(ctxt, XML_DTD_MIXED_CORRUPT,
      "Internal: MIXED struct corrupted\n",
      NULL);
    break;
      }
      cont = cont->c2;
  }
    }
    return(0);
}
#endif /* LIBXML_REGEXP_ENABLED */

/**
 * xmlValidGetElemDecl:
 * @ctxt:  the validation context
 * @doc:  a document instance
 * @elem:  an element instance
 * @extsubset:  pointer, (out) indicate if the declaration was found
 *              in the external subset.
 *
 * Finds a declaration associated to an element in the document.
 *
 * returns the pointer to the declaration or NULL if not found.
 */
static xmlElementPtr
xmlValidGetElemDecl(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
              xmlNodePtr elem, int *extsubset) {
    xmlElementPtr elemDecl = NULL;
    const xmlChar *prefix = NULL;

    if ((ctxt == NULL) || (doc == NULL) ||
        (elem == NULL) || (elem->name == NULL))
        return(NULL);
    if (extsubset != NULL)
  *extsubset = 0;

    /*
     * Fetch the declaration for the qualified name
     */
    if ((elem->ns != NULL) && (elem->ns->prefix != NULL))
  prefix = elem->ns->prefix;

    if (prefix != NULL) {
  elemDecl = xmlGetDtdQElementDesc(doc->intSubset,
                             elem->name, prefix);
  if ((elemDecl == NULL) && (doc->extSubset != NULL)) {
      elemDecl = xmlGetDtdQElementDesc(doc->extSubset,
                                 elem->name, prefix);
      if ((elemDecl != NULL) && (extsubset != NULL))
    *extsubset = 1;
  }
    }

    /*
     * Fetch the declaration for the non qualified name
     * This is "non-strict" validation should be done on the
     * full QName but in that case being flexible makes sense.
     */
    if (elemDecl == NULL) {
  elemDecl = xmlGetDtdQElementDesc(doc->intSubset, elem->name, NULL);
  if ((elemDecl == NULL) && (doc->extSubset != NULL)) {
      elemDecl = xmlGetDtdQElementDesc(doc->extSubset, elem->name, NULL);
      if ((elemDecl != NULL) && (extsubset != NULL))
    *extsubset = 1;
  }
    }
    if (elemDecl == NULL) {
  xmlErrValidNode(ctxt, elem,
      XML_DTD_UNKNOWN_ELEM,
         "No declaration for element %s\n",
         elem->name, NULL, NULL);
    }
    return(elemDecl);
}

#ifdef LIBXML_REGEXP_ENABLED
/**
 * xmlValidatePushElement:
 * @ctxt:  the validation context
 * @doc:  a document instance
 * @elem:  an element instance
 * @qname:  the qualified name as appearing in the serialization
 *
 * DEPRECATED: Internal function, don't use.
 *
 * Push a new element start on the validation stack.
 *
 * returns 1 if no validation problem was found or 0 otherwise
 */
int
xmlValidatePushElement(xmlValidCtxtPtr ctxt, xmlDocPtr doc,
                       xmlNodePtr elem, const xmlChar *qname) {
    int ret = 1;
    xmlElementPtr eDecl;
    int extsubset = 0;

    if (ctxt == NULL)
        return(0);

    if ((ctxt->vstateNr > 0) && (ctxt->vstate != NULL)) {
  xmlValidStatePtr state = ctxt->vstate;
  xmlElementPtr elemDecl;

  /*
   * Check the new element against the content model of the new elem.
   */
  if (state->elemDecl != NULL) {
      elemDecl = state->elemDecl;

      switch(elemDecl->etype) {
    case XML_ELEMENT_TYPE_UNDEFINED:
        ret = 0;
        break;
    case XML_ELEMENT_TYPE_EMPTY:
        xmlErrValidNode(ctxt, state->node,
            XML_DTD_NOT_EMPTY,
         "Element %s was declared EMPTY this one has content\n",
         state->node->name, NULL, NULL);
        ret = 0;
        break;
    case XML_ELEMENT_TYPE_ANY:
        /* I don't think anything is required then */
        break;
    case XML_ELEMENT_TYPE_MIXED:
        /* simple case of declared as #PCDATA */
        if ((elemDecl->content != NULL) &&
      (elemDecl->content->type ==
       XML_ELEMENT_CONTENT_PCDATA)) {
      xmlErrValidNode(ctxt, sta

Coverage Report

Created: 2024-11-08 06:24