commit 76e95df05556c9610b564b14cf578c8f9e34c9c1
author William M. Brack <wbrack@src.gnome.org> Sat Oct 18 16:20:14 2003 +0000
committer William M. Brack <wbrack@src.gnome.org> Sat Oct 18 16:20:14 2003 +0000
tree 54d9c3de3e733b6c331651ac42afa66157297cca
parent 196b38860c1a33e2ee8656a8373e25835f141939

Changed all (?) occurences where validation macros (IS_xxx) had

* include/libxml/parserInternals.h HTMLparser.c HTMLtree.c
  SAX2.c catalog.c debugXML.c entities.c parser.c relaxng.c
  testSAX.c tree.c valid.c xmlschemas.c xmlschemastypes.c
  xpath.c: Changed all (?) occurences where validation macros
  (IS_xxx) had single-byte arguments to use IS_xxx_CH instead
  (e.g. IS_BLANK changed to IS_BLANK_CH).  This gets rid of
  many warning messages on certain platforms, and also high-
  lights places in the library which may need to be enhanced
  for proper UTF8 handling.

tree.c

diff --git a/tree.c b/tree.c
index 0eccfbd..b612ffd 100644
--- a/tree.c
+++ b/tree.c
@@ -349,7 +349,7 @@
      * First quick algorithm for ASCII range
      */
     if (space)
-	while (IS_BLANK(*cur)) cur++;
+	while (IS_BLANK_CH(*cur)) cur++;
     if (((*cur >= 'a') && (*cur <= 'z')) || ((*cur >= 'A') && (*cur <= 'Z')) ||
 	(*cur == '_'))
 	cur++;
@@ -361,7 +361,7 @@
 	   (*cur == '_') || (*cur == '-') || (*cur == '.'))
 	cur++;
     if (space)
-	while (IS_BLANK(*cur)) cur++;
+	while (IS_BLANK_CH(*cur)) cur++;
     if (*cur == 0)
 	return(0);
 
@@ -418,7 +418,7 @@
      * First quick algorithm for ASCII range
      */
     if (space)
-	while (IS_BLANK(*cur)) cur++;
+	while (IS_BLANK_CH(*cur)) cur++;
     if (((*cur >= 'a') && (*cur <= 'z')) || ((*cur >= 'A') && (*cur <= 'Z')) ||
 	(*cur == '_'))
 	cur++;
@@ -444,7 +444,7 @@
 	    cur++;
     }
     if (space)
-	while (IS_BLANK(*cur)) cur++;
+	while (IS_BLANK_CH(*cur)) cur++;
     if (*cur == 0)
 	return(0);
 
@@ -514,7 +514,7 @@
      * First quick algorithm for ASCII range
      */
     if (space)
-	while (IS_BLANK(*cur)) cur++;
+	while (IS_BLANK_CH(*cur)) cur++;
     if (((*cur >= 'a') && (*cur <= 'z')) || ((*cur >= 'A') && (*cur <= 'Z')) ||
 	(*cur == '_') || (*cur == ':'))
 	cur++;
@@ -526,7 +526,7 @@
 	   (*cur == '_') || (*cur == '-') || (*cur == '.') || (*cur == ':'))
 	cur++;
     if (space)
-	while (IS_BLANK(*cur)) cur++;
+	while (IS_BLANK_CH(*cur)) cur++;
     if (*cur == 0)
 	return(0);
 
@@ -581,7 +581,7 @@
      * First quick algorithm for ASCII range
      */
     if (space)
-	while (IS_BLANK(*cur)) cur++;
+	while (IS_BLANK_CH(*cur)) cur++;
     if (((*cur >= 'a') && (*cur <= 'z')) ||
         ((*cur >= 'A') && (*cur <= 'Z')) ||
         ((*cur >= '0') && (*cur <= '9')) ||
@@ -595,7 +595,7 @@
 	   (*cur == '_') || (*cur == '-') || (*cur == '.') || (*cur == ':'))
 	cur++;
     if (space)
-	while (IS_BLANK(*cur)) cur++;
+	while (IS_BLANK_CH(*cur)) cur++;
     if (*cur == 0)
 	return(0);
 
@@ -6232,7 +6232,7 @@
     if (node->content == NULL) return(1);
     cur = node->content;
     while (*cur != 0) {
-	if (!IS_BLANK(*cur)) return(0);
+	if (!IS_BLANK_CH(*cur)) return(0);
 	cur++;
     }