Upgrade to libxml 2.9.2 and libxslt 1.1.28

third_party/libxml/src/testRegexp.c

 /*
  * testRegexp.c: simple module for testing regular expressions
  *
  * See Copyright for the status of this software.
  *
  * Daniel Veillard <veillard@redhat.com>
  */
 
 #include "libxml.h"
 #ifdef LIBXML_REGEXP_ENABLED
@@ skipping 31 matching lines @@
 
     input = fopen(filename, "r");
     if (input == NULL) {
         xmlGenericError(xmlGenericErrorContext,
                 "Cannot open %s for reading\n", filename);
         return;
     }
     while (fgets(expression, 4500, input) != NULL) {
         len = strlen(expression);
         len--;
-        while ((len >= 0) && 
+        while ((len >= 0) &&
                ((expression[len] == '\n') || (expression[len] == '\t') ||
                 (expression[len] == '\r') || (expression[len] == ' '))) len--;
-        expression[len + 1] = 0;      
+        expression[len + 1] = 0;
         if (len >= 0) {
             if (expression[0] == '#')
                 continue;
             if ((expression[0] == '=') && (expression[1] == '>')) {
                 char *pattern = &expression[2];
 
                 if (comp != NULL) {
                     xmlRegFreeRegexp(comp);
                     comp = NULL;
                 }
@@ skipping 30 matching lines @@
 
     input = fopen(filename, "r");
     if (input == NULL) {
         xmlGenericError(xmlGenericErrorContext,
                 "Cannot open %s for reading\n", filename);
         return;
     }
     while (fgets(expression, 4500, input) != NULL) {
         len = strlen(expression);
         len--;
-        while ((len >= 0) && 
+        while ((len >= 0) &&
                ((expression[len] == '\n') || (expression[len] == '\t') ||
                 (expression[len] == '\r') || (expression[len] == ' '))) len--;
-        expression[len + 1] = 0;      
+        expression[len + 1] = 0;
         if (len >= 0) {
             if (expression[0] == '#')
                 continue;
             if ((expression[0] == '=') && (expression[1] == '>')) {
                 char *str = &expression[2];
 
                 if (expr != NULL) {
                     xmlExpFree(ctxt, expr);
-                    if (xmlExpCtxtNbNodes(ctxt) != 0) 
+                    if (xmlExpCtxtNbNodes(ctxt) != 0)
                         printf(" Parse/free of Expression leaked %d\n",
                                xmlExpCtxtNbNodes(ctxt));
                     expr = NULL;
                 }
                 printf("Expression: %s\n", str) ;
                 expr = xmlExpParse(ctxt, str);
                 if (expr == NULL) {
                     printf("   parsing Failed\n");
                     break;
                 }
             } else if (expr != NULL) {
                 int expect = -1;
                 int nodes1, nodes2;
 
                 if (expression[0] == '0')
                     expect = 0;
                 if (expression[0] == '1')
                     expect = 1;
                 printf("Subexp: %s", expression + 2) ;
                 nodes1 = xmlExpCtxtNbNodes(ctxt);
                 sub = xmlExpParse(ctxt, expression + 2);
                 if (sub == NULL) {
                     printf("   parsing Failed\n");
                     break;
                 } else {
                     int ret;
-                    
+
                     nodes2 = xmlExpCtxtNbNodes(ctxt);
                     ret = xmlExpSubsume(ctxt, expr, sub);
 
                     if ((expect == 1) && (ret == 1)) {
                         printf(" => accept, Ok\n");
                     } else if ((expect == 0) && (ret == 0)) {
                         printf(" => reject, Ok\n");
                     } else if ((expect == 1) && (ret == 0)) {
                         printf(" => reject, Failed\n");
                     } else if ((expect == 0) && (ret == 1)) {
@@ skipping 11 matching lines @@
                         printf(" Parse/free leaked %d\n",
                                xmlExpCtxtNbNodes(ctxt) - nodes1);
                     }
                 }
 
             }
         }
     }
     if (expr != NULL) {
         xmlExpFree(ctxt, expr);
-        if (xmlExpCtxtNbNodes(ctxt) != 0) 
+        if (xmlExpCtxtNbNodes(ctxt) != 0)
             printf(" Parse/free of Expression leaked %d\n",
                    xmlExpCtxtNbNodes(ctxt));
     }
     fclose(input);
 }
 
-static void 
+static void
 testReduce(xmlExpCtxtPtr ctxt, xmlExpNodePtr expr, const char *tst) {
     xmlBufferPtr xmlExpBuf;
     xmlExpNodePtr sub, deriv;
     xmlExpBuf = xmlBufferCreate();
 
     sub = xmlExpParse(ctxt, tst);
     if (sub == NULL) {
         printf("Subset %s failed to parse\n", tst);
         return;
     }
@@ skipping 11 matching lines @@
             printf("Resulting nillable derivation: %s\n",
                    (const char *) xmlBufferContent(xmlExpBuf));
         else
             printf("Resulting derivation: %s\n",
                    (const char *) xmlBufferContent(xmlExpBuf));
         xmlExpFree(ctxt, deriv);
     }
     xmlExpFree(ctxt, sub);
 }
 
-static void 
+static void
 exprDebug(xmlExpCtxtPtr ctxt, xmlExpNodePtr expr) {
     xmlBufferPtr xmlExpBuf;
     xmlExpNodePtr deriv;
     const char *list[40];
     int ret;
 
     xmlExpBuf = xmlBufferCreate();
 
     if (expr == NULL) {
         printf("Failed to parse\n");
@@ skipping 166 matching lines @@
     return(0);
 }
 
 #else
 #include <stdio.h>
 int main(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED) {
     printf("%s : Regexp support not compiled in\n", argv[0]);
     return(0);
 }
 #endif /* LIBXML_REGEXP_ENABLED */