if (rid)
{
struct stat statbuf;
+ void *mm;
fstat(fd, &statbuf);
-
- rid->fd = fd;
- rid->len = statbuf.st_size;
- rid->start = mmap(0, rid->len, PROT_READ, MAP_PRIVATE, fd, 0L);
- rid->name = 0;
+ mm = mmap(0, statbuf.st_size, PROT_READ, MAP_PRIVATE, fd, 0L);
+ if (mm != (void *)-1)
+ {
+ rid->fd = fd;
+ rid->start = mm;
+ rid->len = statbuf.st_size;
+ rid->name = 0;
#ifndef XML_NONVALIDATING
- rid->info = 0;
+ rid->info = 0;
#endif
+ }
}
}
}
if (p)
{
char *ret, *node = nodename;
-
ret = __xmlNodeGet(p, &len, &node, &slen, &num);
if (ret == 0 && slen == 0)
{
assert(xid != 0);
assert(name != 0);
- if (xid->len && xid->name_len)
+ if (xid->name_len)
{
size_t slen = strlen(name);
char *ps, *pe;
assert(xid != 0);
assert(name != 0);
- if (xid->len && xid->name_len)
+ if (xid->name_len)
{
size_t slen = strlen(name);
char *ps, *pe;
assert(xid != 0);
assert(name != 0);
- if (xid->len && xid->name_len)
+ if (xid->name_len)
{
size_t slen = strlen(name);
char *ps, *pe;
assert(buffer != 0);
assert(buflen > 0);
- if (xid->len && xid->name_len)
+ if (xid->name_len)
{
size_t slen = strlen(name);
char *ps, *pe;
assert(name != 0);
assert(s != 0);
- if (xid->len && xid->name_len && strlen(s))
+ if (xid->name_len && strlen(s))
{
size_t slen = strlen(name);
char *ps, *pe;
char *new, *cur, *ne, *ret = 0;
char *element, *start_tag=0;
size_t restlen, elementlen;
- size_t retlen = 0;
+ size_t return_len = 0;
int found, num;
assert(start != 0);
cur = (char *)start;
ne = cur + restlen;
+ /* search for an opening tag */
while ((new = memchr(cur, '<', restlen)) != 0)
{
- if (*(new+1) == '/') /* cascading closing tag found */
+ size_t len_remaining;
+ char *rptr;
+
+ if (*(new+1) == '/') /* end of section */
{
- *len -= restlen;
+ *len -= restlen-1;
break;
}
restlen -= new-cur;
cur = new;
- if (*cur == '!')
+ if (*cur == '!') /* comment */
{
new = __xmlCommentSkip(cur, restlen);
if (!new)
cur = new;
continue;
}
- else if (*cur == '?')
+ else if (*cur == '?') /* info block */
{
new = __xmlInfoProcess(cur, restlen);
if (!new)
continue;
}
+ /*
+ * get element name and a pointer to after the opening tag
+ */
element = *name;
elementlen = *rlen;
- new = __xml_memncasecmp(cur, &restlen, &element, &elementlen);
- if (new)
+ len_remaining = restlen;
+ new = rptr = __xml_memncasecmp(cur, &restlen, &element, &elementlen);
+ if (rptr) /* requested element was found */
{
- retlen = elementlen;
+ return_len = elementlen;
if (found == num)
{
- ret = new+1;
+ ret = new;
start_tag = element;
*rlen = elementlen;
}
else start_tag = 0;
}
- else
+ else /* different element name was foud */
{
- new = cur+elementlen;
+ new = cur + (len_remaining - restlen);
if (new >= ne)
{
*rlen = 0;
element = *name;
}
- if (*(new-1) == '/') /* e.g. <test/> */
+ if (*(new-2) == '/') /* e.g. <test/> */
{
- if (found == num)
- {
- *len = 0;
- *name = start_tag;
- }
- found++;
-
- if ((restlen < 1) || (*new != '>'))
+ cur = new;
+ if (rptr)
{
- *rlen = 0;
- *name = cur;
- *len = XML_ELEMENT_NO_CLOSING_TAG;
- return 0;
+ if (found == num)
+ {
+ *name = start_tag;
+ *len = 0;
+ }
+ found++;
}
-
- restlen -= new+1-cur;
- cur = new+1;
continue;
}
+ /*
+ * get the next xml tag
+ */
/* restlen -= new-cur; not necessary because of __xml_memncasecmp */
cur = new;
new = memchr(cur, '<', restlen);
restlen -= new-cur;
cur = new;
- if (*(cur+1) != '/') /* new node found */
+ if (*(cur+1) != '/') /* cascading tag found */
{
char *node = "*";
size_t slen = restlen;
size_t nlen = 1;
size_t pos = -1;
+ /*
+ * recursively walk the xml tree from here
+ */
new = __xmlNodeGet(cur, &slen, &node, &nlen, &pos);
if (!new)
{
restlen -= slen;
cur = new;
+ /*
+ * look for the closing tag of the cascading block
+ */
new = memchr(cur, '<', restlen);
if (!new)
{
}
found++;
}
+ /* else proper closing tag not yet found, continue */
new = memchr(cur, '>', restlen);
if (!new)
{
*rlen = 0;
*name = cur;
+ *len = XML_ELEMENT_NO_CLOSING_TAG;
return 0;
}
}
- if ((ret == 0) && (start_tag == 0) && (*rlen > 1))
+ if (found == 0)
{
ret = 0;
*rlen = 0;
*name = start_tag;
- *len = XML_NO_ERROR; /* element not found */
+ *len = XML_NO_ERROR; /* element not found, no real error */
}
else
{
- *rlen = retlen;
+ *rlen = return_len;
*nodenum = found;
}
__xml_memncasecmp(const char *haystack, size_t *haystacklen,
char **needle, size_t *needlelen)
{
- void *rptr = 0;
+ char *rptr = 0;
if (haystack && needle && needlelen && (*needlelen > 0)
&& (*haystacklen >= *needlelen))
char *he = hs + *haystacklen;
while ((hs < he) && !isspace(*hs) && (*hs != '>')) hs++;
+ if (*(hs-1) == '/') hs--;
+
*needle = (char *)haystack;
*needlelen = hs - haystack;
+
while ((hs < he) && (*hs != '>')) hs++;
+ hs++;
+
rptr = hs;
}
else
for (i=0; i<nlen; i++)
{
if (NOCASECMP(*hs,*ns) && (*ns != '?')) break;
- if (isspace(*hs) || (*hs == '>')) break;
+ if (isspace(*hs) || (*hs == '/') || (*hs == '>')) break;
hs++;
ns++;
}
- if (i != nlen)
+ if (i == nlen)
{
- while((hs < he) && !isspace(*hs) && (*hs != '>')) hs++;
*needle = (char *)haystack;
*needlelen = hs - haystack;
+
+ while ((hs < he) && (*hs != '>')) hs++;
+ hs++;
+
+ rptr = hs;
}
- else
+ else /* not found */
{
- int found = (isspace(*hs) || (*hs == '>'));
+ while((hs < he) && !isspace(*hs) && (*hs != '>')) hs++;
+ if (*(hs-1) == '/') hs--;
*needle = (char *)haystack;
*needlelen = hs - haystack;
while ((hs < he) && (*hs != '>')) hs++;
-
- if (!found) *needlelen = hs - haystack;
- else rptr = hs;
+ hs++;
}
}