diff options
| author | Daniel Veillard <veillard@src.gnome.org> | 2001-10-11 22:55:55 +0000 |
|---|---|---|
| committer | Daniel Veillard <veillard@src.gnome.org> | 2001-10-11 22:55:55 +0000 |
| commit | b44025c72b7472971a061b022cfe422adc42715d (patch) | |
| tree | 8286242ccaba46dbede84aa092cce816cbc1f5aa /valid.c | |
| parent | 75b96824bccaeadd9e71eba9be7fab1bd88ac814 (diff) | |
| download | android_external_libxml2-b44025c72b7472971a061b022cfe422adc42715d.tar.gz android_external_libxml2-b44025c72b7472971a061b022cfe422adc42715d.tar.bz2 android_external_libxml2-b44025c72b7472971a061b022cfe422adc42715d.zip | |
started integrating the non-controversial parts of Gary Pennington
* 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
Diffstat (limited to 'valid.c')
| -rw-r--r-- | valid.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -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 */ |