Roll libxml to 8effcb578e0590cc01bbcab0f9dccefc6bdbcdbd

third_party/libxml/src/tree.c

 /*
  * tree.c : implementation of access function for an XML tree.
  *
  * References:
  *   XHTML 1.0 W3C REC: http://www.w3.org/TR/2002/REC-xhtml1-20020801/
  *
  * See Copyright for the status of this software.
  *
  * daniel@veillard.com
  *
@@ skipping 1026 matching lines @@
 
     if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
         xmlRegisterNodeDefaultValue((xmlNodePtr)cur);
     return(cur);
 }
 
 /**
  * DICT_FREE:
  * @str:  a string
  *
- * Free a string if it is not owned by the "dict" dictionnary in the
+ * 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));
 
 
 /**
  * DICT_COPY:
  * @str:  a string
  *
- * Copy a string using a "dict" dictionnary in the current scope,
+ * Copy a string using a "dict" dictionary in the current scope,
  * if availabe.
  */
 #define DICT_COPY(str, cpy) \
     if (str) { \
         if (dict) { \
             if (xmlDictOwns(dict, (const xmlChar *)(str))) \
                 cpy = (xmlChar *) (str); \
             else \
                 cpy = (xmlChar *) xmlDictLookup((dict), (const xmlChar *)(str), -1); \
         } else \
             cpy = xmlStrdup((const xmlChar *)(str)); }
 
 /**
  * DICT_CONST_COPY:
  * @str:  a string
  *
- * Copy a string using a "dict" dictionnary in the current scope,
+ * Copy a string using a "dict" dictionary in the current scope,
  * if availabe.
  */
 #define DICT_CONST_COPY(str, cpy) \
     if (str) { \
         if (dict) { \
             if (xmlDictOwns(dict, (const xmlChar *)(str))) \
                 cpy = (const xmlChar *) (str); \
             else \
                 cpy = xmlDictLookup((dict), (const xmlChar *)(str), -1); \
         } else \
@@ skipping 1175 matching lines @@
 #endif
         return(NULL);
     }
 
     /*
      * Allocate a new node and fill the fields.
      */
     cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
     if (cur == NULL) {
         xmlTreeErrMemory("building node");
-        /* we can't check here that name comes from the doc dictionnary */
+        /* we can't check here that name comes from the doc dictionary */
         return(NULL);
     }
     memset(cur, 0, sizeof(xmlNode));
     cur->type = XML_ELEMENT_NODE;
 
     cur->name = name;
     cur->ns = ns;
 
     if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
         xmlRegisterNodeDefaultValue((xmlNodePtr)cur);
@@ skipping 59 matching lines @@
     xmlNodePtr cur;
 
     cur = xmlNewNodeEatName(ns, name);
     if (cur != NULL) {
         cur->doc = doc;
         if (content != NULL) {
             cur->children = xmlStringGetNodeList(doc, content);
             UPDATE_LAST_CHILD_AND_PARENT(cur)
         }
     } else {
-        /* if name don't come from the doc dictionnary free it here */
+        /* if name don't come from the doc dictionary free it here */
         if ((name != NULL) && (doc != NULL) &&
             (!(xmlDictOwns(doc->dict, name))))
             xmlFree(name);
     }
     return(cur);
 }
 
 #ifdef LIBXML_TREE_ENABLED
 /**
  * xmlNewDocRawNode:
@@ skipping 1330 matching lines @@
             if (((cur->type == XML_ELEMENT_NODE) ||
                  (cur->type == XML_XINCLUDE_START) ||
                  (cur->type == XML_XINCLUDE_END)) &&
                 (cur->nsDef != NULL))
                 xmlFreeNsList(cur->nsDef);
 
             /*
              * When a node is a text node or a comment, it uses a global static
              * variable for the name of the node.
              * Otherwise the node name might come from the document's
-             * dictionnary
+             * dictionary
              */
             if ((cur->name != NULL) &&
                 (cur->type != XML_TEXT_NODE) &&
                 (cur->type != XML_COMMENT_NODE))
                 DICT_FREE(cur->name)
             xmlFree(cur);
         }
         cur = next;
     }
 }
@@ skipping 48 matching lines @@
         (cur->type != XML_ENTITY_REF_NODE) &&
         (cur->type != XML_XINCLUDE_END) &&
         (cur->type != XML_XINCLUDE_START) &&
         (cur->content != (xmlChar *) &(cur->properties))) {
         DICT_FREE(cur->content)
     }
 
     /*
      * When a node is a text node or a comment, it uses a global static
      * variable for the name of the node.
-     * Otherwise the node name might come from the document's dictionnary
+     * Otherwise the node name might come from the document's dictionary
      */
     if ((cur->name != NULL) &&
         (cur->type != XML_TEXT_NODE) &&
         (cur->type != XML_COMMENT_NODE))
         DICT_FREE(cur->name)
 
     if (((cur->type == XML_ELEMENT_NODE) ||
          (cur->type == XML_XINCLUDE_START) ||
          (cur->type == XML_XINCLUDE_END)) &&
         (cur->nsDef != NULL))
@@ skipping 6328 matching lines @@
             }
             default:
                 break;
         }
     }
     return (0);
 }
 
 #define bottom_tree
 #include "elfgcchack.h"