lib/libxml2
1
0
Fork 0
mirror of https://gitlab.gnome.org/GNOME/libxml2.git synced 2025-08-01 10:06:59 +03:00
Code Activity

started integrating the non-controversial parts of Gary Pennington

Browse Source 
* HTMLtree.c catalog.c debugXML.c entities.c nanoftp.c
  parser.c valid.c xmlmemory.c xpath.c xpointer.c: started
  integrating the non-controversial parts of Gary Pennington
  multithread patches
* catalog.c: corrected a small bug introduced
Daniel
This commit is contained in:
Daniel Veillard
2001-10-11 22:55:55 +00:00
parent 75b96824bc
commit b44025c72b
11 changed files with 35 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
valid.c
View File

@ -70,7 +70,7 @@ scope type name##VPop(xmlValidCtxtPtr ctxt) { \
} \
/*
* I will use a home made algorithm less complex and easier to
* I use a home made algorithm less complex and easier to
* debug/maintin 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
@ -81,7 +81,7 @@ scope type name##VPop(xmlValidCtxtPtr ctxt) { \
#define ROLLBACK_OR 0
#define ROLLBACK_PARENT 1
struct _xmlValidState {
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 occurences */