Lines Matching refs:tree
254 * need of a tree to validate the content model. this is done in each
337 * only restriction is on the deepness of the tree limited by the
350 unsigned char depth; /* current depth in the overall tree */
1093 * @cur: the element content tree to free
1136 * @cur: the element content tree to free
1371 * @content: the element content tree or NULL
1768 * @cur: the tree to free.
1785 * @cur: the tree to copy.
1925 if (attr->tree != NULL)
1926 xmlFreeEnumeration(attr->tree);
1961 * @tree: if it's an enumeration, the associated list
1964 * Note that @tree becomes the ownership of the DTD
1973 const xmlChar *defaultValue, xmlEnumerationPtr tree) {
1980 xmlFreeEnumeration(tree);
1984 xmlFreeEnumeration(tree);
1988 xmlFreeEnumeration(tree);
2023 xmlFreeEnumeration(tree);
2092 ret->tree = tree;
2212 cur->tree = xmlCopyEnumeration(attr->tree);
2287 xmlDumpEnumeration(buf, attr->tree);
2291 xmlDumpEnumeration(buf, attr->tree);
4107 if ((attr->defaultValue != NULL) && (attr->tree != NULL)) {
4108 xmlEnumerationPtr tree = attr->tree;
4109 while (tree != NULL) {
4110 if (xmlStrEqual(tree->name, attr->defaultValue)) break;
4111 tree = tree->next;
4113 if (tree == NULL) {
4354 xmlEnumerationPtr tree = attrDecl->tree;
4370 while (tree != NULL) {
4371 if (xmlStrEqual(tree->name, value)) break;
4372 tree = tree->next;
4374 if (tree == NULL) {
4384 xmlEnumerationPtr tree = attrDecl->tree;
4385 while (tree != NULL) {
4386 if (xmlStrEqual(tree->name, value)) break;
4387 tree = tree->next;
4389 if (tree == NULL) {
4551 xmlEnumerationPtr tree = attrDecl->tree;
4573 while (tree != NULL) {
4574 if (xmlStrEqual(tree->name, value)) break;
4575 tree = tree->next;
4577 if (tree == NULL) {
4593 xmlEnumerationPtr tree = attrDecl->tree;
4594 while (tree != NULL) {
4595 if (xmlStrEqual(tree->name, value)) break;
4596 tree = tree->next;
4598 if (tree == NULL) {
4876 * At this point handle going up in the tree
6598 if (cur->tree != NULL) {
6599 xmlEnumerationPtr tree = cur->tree;
6600 while (tree != NULL) {
6602 cur->name, cur->atype, tree->name);
6605 tree = tree->next;
6700 * and validate the document tree.
6774 * @ctree: an element content tree
6779 * Build/extend a list of potential children allowed by the content tree
6834 * within an existing tree while respecting the validity constraints
6895 * Do a backup of the current tree structure
6903 * Creates a dummy node and insert it into the tree
6937 * Restore the tree structure