1 /* HTML parser for Wget.
2 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006,
3 2007, 2008, 2009 Free Software Foundation, Inc.
5 This file is part of GNU Wget.
7 GNU Wget is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or (at
10 your option) any later version.
12 GNU Wget is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with Wget. If not, see <http://www.gnu.org/licenses/>.
20 Additional permission under GNU GPL version 3 section 7
22 If you modify this program, or any covered work, by linking or
23 combining it with the OpenSSL project's OpenSSL library (or a
24 modified version of that library), containing parts covered by the
25 terms of the OpenSSL or SSLeay licenses, the Free Software Foundation
26 grants you additional permission to convey the resulting work.
27 Corresponding Source for a non-source form of such a combination
28 shall include the source code for the parts of OpenSSL used as well
29 as that of the covered work. */
31 /* The only entry point to this module is map_html_tags(), which see. */
35 - Allow hooks for callers to process contents outside tags. This
36 is needed to implement handling <style> and <script>. The
37 taginfo structure already carries the information about where the
38 tags are, but this is not enough, because one would also want to
39 skip the comments. (The funny thing is that for <style> and
40 <script> you *don't* want to skip comments!)
42 - Create a test suite for regression testing. */
46 This is the third HTML parser written for Wget. The first one was
47 written some time during the Geturl 1.0 beta cycle, and was very
48 inefficient and buggy. It also contained some very complex code to
49 remember a list of parser states, because it was supposed to be
52 The second HTML parser was written for Wget 1.4 (the first version
53 by the name `Wget'), and was a complete rewrite. Although the new
54 parser behaved much better and made no claims of reentrancy, it
55 still shared many of the fundamental flaws of the old version -- it
56 only regarded HTML in terms tag-attribute pairs, where the
57 attribute's value was a URL to be returned. Any other property of
58 HTML, such as <base href=...>, or strange way to specify a URL,
59 such as <meta http-equiv=Refresh content="0; URL=..."> had to be
60 crudely hacked in -- and the caller had to be aware of these hacks.
61 Like its predecessor, this parser did not support HTML comments.
63 After Wget 1.5.1 was released, I set out to write a third HTML
64 parser. The objectives of the new parser were to: (1) provide a
65 clean way to analyze HTML lexically, (2) separate interpretation of
66 the markup from the parsing process, (3) be as correct as possible,
67 e.g. correctly skipping comments and other SGML declarations, (4)
68 understand the most common errors in markup and skip them or be
69 relaxed towrds them, and (5) be reasonably efficient (no regexps,
70 minimum copying and minimum or no heap allocation).
72 I believe this parser meets all of the above goals. It is
73 reasonably well structured, and could be relatively easily
74 separated from Wget and used elsewhere. While some of its
75 intrinsic properties limit its value as a general-purpose HTML
76 parser, I believe that, with minimum modifications, it could serve
79 Due to time and other constraints, this parser was not integrated
80 into Wget until the version 1.7. */
84 The single entry point of this parser is map_html_tags(), which
85 works by calling a function you specify for each tag. The function
86 gets called with the pointer to a structure describing the tag and
89 /* To test as standalone, compile with `-DSTANDALONE -I.'. You'll
90 still need Wget headers to compile. */
95 # define I_REALLY_WANT_CTYPE_MACROS
104 #include "html-parse.h"
110 # define xmalloc malloc
111 # define xrealloc realloc
122 # define c_isspace(x) isspace (x)
123 # define c_isdigit(x) isdigit (x)
124 # define c_isxdigit(x) isxdigit (x)
125 # define c_isalpha(x) isalpha (x)
126 # define c_isalnum(x) isalnum (x)
127 # define c_tolower(x) tolower (x)
128 # define c_toupper(x) toupper (x)
134 hash_table_get (const struct hash_table *ht, void *ptr)
138 #else /* not STANDALONE */
142 /* Pool support. A pool is a resizable chunk of memory. It is first
143 allocated on the stack, and moved to the heap if it needs to be
144 larger than originally expected. map_html_tags() uses it to store
145 the zero-terminated names and values of tags and attributes.
147 Thus taginfo->name, and attr->name and attr->value for each
148 attribute, do not point into separately allocated areas, but into
149 different parts of the pool, separated only by terminating zeros.
150 This ensures minimum amount of allocation and, for most tags, no
151 allocation because the entire pool is kept on the stack. */
154 char *contents; /* pointer to the contents. */
155 int size; /* size of the pool. */
156 int tail; /* next available position index. */
157 bool resized; /* whether the pool has been resized
160 char *orig_contents; /* original pool contents, usually
161 stack-allocated. used by POOL_FREE
162 to restore the pool to the initial
167 /* Initialize the pool to hold INITIAL_SIZE bytes of storage. */
169 #define POOL_INIT(p, initial_storage, initial_size) do { \
170 struct pool *P = (p); \
171 P->contents = (initial_storage); \
172 P->size = (initial_size); \
174 P->resized = false; \
175 P->orig_contents = P->contents; \
176 P->orig_size = P->size; \
179 /* Grow the pool to accomodate at least SIZE new bytes. If the pool
180 already has room to accomodate SIZE bytes of data, this is a no-op. */
182 #define POOL_GROW(p, increase) \
183 GROW_ARRAY ((p)->contents, (p)->size, (p)->tail + (increase), \
186 /* Append text in the range [beg, end) to POOL. No zero-termination
189 #define POOL_APPEND(p, beg, end) do { \
190 const char *PA_beg = (beg); \
191 int PA_size = (end) - PA_beg; \
192 POOL_GROW (p, PA_size); \
193 memcpy ((p)->contents + (p)->tail, PA_beg, PA_size); \
194 (p)->tail += PA_size; \
197 /* Append one character to the pool. Can be used to zero-terminate
200 #define POOL_APPEND_CHR(p, ch) do { \
201 char PAC_char = (ch); \
203 (p)->contents[(p)->tail++] = PAC_char; \
206 /* Forget old pool contents. The allocated memory is not freed. */
207 #define POOL_REWIND(p) (p)->tail = 0
209 /* Free heap-allocated memory for contents of POOL. This calls
210 xfree() if the memory was allocated through malloc. It also
211 restores `contents' and `size' to their original, pre-malloc
212 values. That way after POOL_FREE, the pool is fully usable, just
213 as if it were freshly initialized with POOL_INIT. */
215 #define POOL_FREE(p) do { \
216 struct pool *P = p; \
218 xfree (P->contents); \
219 P->contents = P->orig_contents; \
220 P->size = P->orig_size; \
222 P->resized = false; \
225 /* Used for small stack-allocated memory chunks that might grow. Like
226 DO_REALLOC, this macro grows BASEVAR as necessary to take
227 NEEDED_SIZE items of TYPE.
229 The difference is that on the first resize, it will use
230 malloc+memcpy rather than realloc. That way you can stack-allocate
231 the initial chunk, and only resort to heap allocation if you
232 stumble upon large data.
234 After the first resize, subsequent ones are performed with realloc,
235 just like DO_REALLOC. */
237 #define GROW_ARRAY(basevar, sizevar, needed_size, resized, type) do { \
238 long ga_needed_size = (needed_size); \
239 long ga_newsize = (sizevar); \
240 while (ga_newsize < ga_needed_size) \
242 if (ga_newsize != (sizevar)) \
245 basevar = xrealloc (basevar, ga_newsize * sizeof (type)); \
248 void *ga_new = xmalloc (ga_newsize * sizeof (type)); \
249 memcpy (ga_new, basevar, (sizevar) * sizeof (type)); \
250 (basevar) = ga_new; \
253 (sizevar) = ga_newsize; \
257 /* Test whether n+1-sized entity name fits in P. We don't support
258 IE-style non-terminated entities, e.g. "<foo" -> "<foo".
259 However, "<foo" will work, as will "<!foo", "<", etc. In
260 other words an entity needs to be terminated by either a
261 non-alphanumeric or the end of string. */
262 #define FITS(p, n) (p + n == end || (p + n < end && !c_isalnum (p[n])))
264 /* Macros that test entity names by returning true if P is followed by
265 the specified characters. */
266 #define ENT1(p, c0) (FITS (p, 1) && p[0] == c0)
267 #define ENT2(p, c0, c1) (FITS (p, 2) && p[0] == c0 && p[1] == c1)
268 #define ENT3(p, c0, c1, c2) (FITS (p, 3) && p[0]==c0 && p[1]==c1 && p[2]==c2)
270 /* Increment P by INC chars. If P lands at a semicolon, increment it
271 past the semicolon. This ensures that e.g. "<foo" is converted
272 to "<foo", but "<,foo" to "<,foo". */
273 #define SKIP_SEMI(p, inc) (p += inc, p < end && *p == ';' ? ++p : p)
275 struct tagstack_item {
276 const char *tagname_begin;
277 const char *tagname_end;
278 const char *contents_begin;
279 struct tagstack_item *prev;
280 struct tagstack_item *next;
283 struct tagstack_item *
284 tagstack_push (struct tagstack_item **head, struct tagstack_item **tail)
286 struct tagstack_item *ts = xmalloc(sizeof(struct tagstack_item));
290 ts->prev = ts->next = NULL;
303 /* remove ts and everything after it from the stack */
305 tagstack_pop (struct tagstack_item **head, struct tagstack_item **tail,
306 struct tagstack_item *ts)
316 *head = *tail = NULL;
320 ts->prev->next = NULL;
335 ts->prev->next = NULL;
339 struct tagstack_item *p = ts->next;
346 struct tagstack_item *
347 tagstack_find (struct tagstack_item *tail, const char *tagname_begin,
348 const char *tagname_end)
350 int len = tagname_end - tagname_begin;
353 if (len == (tail->tagname_end - tail->tagname_begin))
355 if (0 == strncasecmp (tail->tagname_begin, tagname_begin, len))
363 /* Decode the HTML character entity at *PTR, considering END to be end
364 of buffer. It is assumed that the "&" character that marks the
365 beginning of the entity has been seen at *PTR-1. If a recognized
366 ASCII entity is seen, it is returned, and *PTR is moved to the end
367 of the entity. Otherwise, -1 is returned and *PTR left unmodified.
369 The recognized entities are: <, >, &, &apos, and ". */
372 decode_entity (const char **ptr, const char *end)
374 const char *p = *ptr;
383 /* Process numeric entities "&#DDD;" and "&#xHH;". */
388 for (++p; value < 256 && p < end && c_isxdigit (*p); p++, digits++)
389 value = (value << 4) + XDIGIT_TO_NUM (*p);
391 for (; value < 256 && p < end && c_isdigit (*p); p++, digits++)
392 value = (value * 10) + (*p - '0');
395 /* Don't interpret 128+ codes and NUL because we cannot
396 portably reinserted them into HTML. */
397 if (!value || (value & ~0x7f))
399 *ptr = SKIP_SEMI (p, 0);
402 /* Process named ASCII entities. */
405 value = '>', *ptr = SKIP_SEMI (p, 1);
409 value = '<', *ptr = SKIP_SEMI (p, 1);
412 if (ENT2 (p, 'm', 'p'))
413 value = '&', *ptr = SKIP_SEMI (p, 2);
414 else if (ENT3 (p, 'p', 'o', 's'))
415 /* handle &apos for the sake of the XML/XHTML crowd. */
416 value = '\'', *ptr = SKIP_SEMI (p, 3);
419 if (ENT3 (p, 'u', 'o', 't'))
420 value = '\"', *ptr = SKIP_SEMI (p, 3);
433 AP_DECODE_ENTITIES = 2,
437 /* Copy the text in the range [BEG, END) to POOL, optionally
438 performing operations specified by FLAGS. FLAGS may be any
439 combination of AP_DOWNCASE, AP_DECODE_ENTITIES and AP_TRIM_BLANKS
440 with the following meaning:
442 * AP_DOWNCASE -- downcase all the letters;
444 * AP_DECODE_ENTITIES -- decode the named and numeric entities in
445 the ASCII range when copying the string.
447 * AP_TRIM_BLANKS -- ignore blanks at the beginning and at the end
448 of text, as well as embedded newlines. */
451 convert_and_copy (struct pool *pool, const char *beg, const char *end, int flags)
453 int old_tail = pool->tail;
455 /* Skip blanks if required. We must do this before entities are
456 processed, so that blanks can still be inserted as, for instance,
458 if (flags & AP_TRIM_BLANKS)
460 while (beg < end && c_isspace (*beg))
462 while (end > beg && c_isspace (end[-1]))
466 if (flags & AP_DECODE_ENTITIES)
468 /* Grow the pool, then copy the text to the pool character by
469 character, processing the encountered entities as we go
472 It's safe (and necessary) to grow the pool in advance because
473 processing the entities can only *shorten* the string, it can
474 never lengthen it. */
475 const char *from = beg;
477 bool squash_newlines = !!(flags & AP_TRIM_BLANKS);
479 POOL_GROW (pool, end - beg);
480 to = pool->contents + pool->tail;
486 int entity = decode_entity (&from, end);
492 else if ((*from == '\n' || *from == '\r') && squash_newlines)
497 /* Verify that we haven't exceeded the original size. (It
498 shouldn't happen, hence the assert.) */
499 assert (to - (pool->contents + pool->tail) <= end - beg);
501 /* Make POOL's tail point to the position following the string
503 pool->tail = to - pool->contents;
504 POOL_APPEND_CHR (pool, '\0');
508 /* Just copy the text to the pool. */
509 POOL_APPEND (pool, beg, end);
510 POOL_APPEND_CHR (pool, '\0');
513 if (flags & AP_DOWNCASE)
515 char *p = pool->contents + old_tail;
521 /* Originally we used to adhere to rfc 1866 here, and allowed only
522 letters, digits, periods, and hyphens as names (of tags or
523 attributes). However, this broke too many pages which used
524 proprietary or strange attributes, e.g. <img src="a.gif"
525 v:shapes="whatever">.
527 So now we allow any character except:
529 * 8-bit and control chars
530 * characters that clearly cannot be part of name:
533 This only affects attribute and tag names; attribute values allow
534 an even greater variety of characters. */
536 #define NAME_CHAR_P(x) ((x) > 32 && (x) < 127 \
537 && (x) != '=' && (x) != '>' && (x) != '/')
540 static int comment_backout_count;
543 /* Advance over an SGML declaration, such as <!DOCTYPE ...>. In
544 strict comments mode, this is used for skipping over comments as
547 To recap: any SGML declaration may have comments associated with
549 <!MY-DECL -- isn't this fun? -- foo bar>
551 An HTML comment is merely an empty declaration (<!>) with a comment
553 <!-- some stuff here -->
555 Several comments may be embedded in one comment declaration:
556 <!-- have -- -- fun -->
558 Whitespace is allowed between and after the comments, but not
559 before the first comment. Additionally, this function attempts to
560 handle double quotes in SGML declarations correctly. */
563 advance_declaration (const char *beg, const char *end)
566 char quote_char = '\0'; /* shut up, gcc! */
589 /* It looked like a good idea to write this as a state machine, but
592 while (state != AC_S_DONE && state != AC_S_BACKOUT)
595 state = AC_S_BACKOUT;
605 state = AC_S_DEFAULT;
608 state = AC_S_BACKOUT;
630 if (NAME_CHAR_P (ch))
631 state = AC_S_DCLNAME;
633 state = AC_S_BACKOUT;
640 else if (NAME_CHAR_P (ch))
643 state = AC_S_DEFAULT;
646 /* We must use 0x22 because broken assert macros choke on
648 assert (ch == '\'' || ch == 0x22);
649 quote_char = ch; /* cheating -- I really don't feel like
650 introducing more different states for
651 different quote characters. */
653 state = AC_S_IN_QUOTE;
656 if (ch == quote_char)
662 assert (ch == quote_char);
664 state = AC_S_DEFAULT;
676 state = AC_S_COMMENT;
679 state = AC_S_BACKOUT;
703 state = AC_S_DEFAULT;
706 state = AC_S_COMMENT;
713 if (state == AC_S_BACKOUT)
716 ++comment_backout_count;
723 /* Find the first occurrence of the substring "-->" in [BEG, END) and
724 return the pointer to the character after the substring. If the
725 substring is not found, return NULL. */
728 find_comment_end (const char *beg, const char *end)
730 /* Open-coded Boyer-Moore search for "-->". Examine the third char;
731 if it's not '>' or '-', advance by three characters. Otherwise,
732 look at the preceding characters and try to find a match. */
734 const char *p = beg - 1;
736 while ((p += 3) < end)
740 if (p[-1] == '-' && p[-2] == '-')
748 if (++p == end) return NULL;
751 case '>': return p + 1;
752 case '-': goto at_dash_dash;
757 if ((p += 2) >= end) return NULL;
772 /* Return true if the string containing of characters inside [b, e) is
773 present in hash table HT. */
776 name_allowed (const struct hash_table *ht, const char *b, const char *e)
781 BOUNDED_TO_ALLOCA (b, e, copy);
782 return hash_table_get (ht, copy) != NULL;
785 /* Advance P (a char pointer), with the explicit intent of being able
786 to read the next character. If this is not possible, go to finish. */
788 #define ADVANCE(p) do { \
794 /* Skip whitespace, if any. */
796 #define SKIP_WS(p) do { \
797 while (c_isspace (*p)) { \
802 /* Skip non-whitespace, if any. */
804 #define SKIP_NON_WS(p) do { \
805 while (!c_isspace (*p)) { \
811 static int tag_backout_count;
814 /* Map MAPFUN over HTML tags in TEXT, which is SIZE characters long.
815 MAPFUN will be called with two arguments: pointer to an initialized
816 struct taginfo, and MAPARG.
818 ALLOWED_TAGS and ALLOWED_ATTRIBUTES are hash tables the keys of
819 which are the tags and attribute names that this function should
820 use. If ALLOWED_TAGS is NULL, all tags are processed; if
821 ALLOWED_ATTRIBUTES is NULL, all attributes are returned.
823 (Obviously, the caller can filter out unwanted tags and attributes
824 just as well, but this is just an optimization designed to avoid
825 unnecessary copying of tags/attributes which the caller doesn't
829 map_html_tags (const char *text, int size,
830 void (*mapfun) (struct taginfo *, void *), void *maparg,
832 const struct hash_table *allowed_tags,
833 const struct hash_table *allowed_attributes)
835 /* storage for strings passed to MAPFUN callback; if 256 bytes is
836 too little, POOL_APPEND allocates more with malloc. */
837 char pool_initial_storage[256];
840 const char *p = text;
841 const char *end = text + size;
843 struct attr_pair attr_pair_initial_storage[8];
844 int attr_pair_size = countof (attr_pair_initial_storage);
845 bool attr_pair_resized = false;
846 struct attr_pair *pairs = attr_pair_initial_storage;
848 struct tagstack_item *head = NULL;
849 struct tagstack_item *tail = NULL;
854 POOL_INIT (&pool, pool_initial_storage, countof (pool_initial_storage));
858 const char *tag_name_begin, *tag_name_end;
859 const char *tag_start_position;
860 bool uninteresting_tag;
868 /* Find beginning of tag. We use memchr() instead of the usual
869 looping with ADVANCE() for speed. */
870 p = memchr (p, '<', end - p);
874 tag_start_position = p;
877 /* Establish the type of the tag (start-tag, end-tag or
881 if (!(flags & MHT_STRICT_COMMENTS)
882 && p < end + 3 && p[1] == '-' && p[2] == '-')
884 /* If strict comments are not enforced and if we know
885 we're looking at a comment, simply look for the
886 terminating "-->". Non-strict is the default because
887 it works in other browsers and most HTML writers can't
888 be bothered with getting the comments right. */
889 const char *comment_end = find_comment_end (p + 3, end);
895 /* Either in strict comment mode or looking at a non-empty
896 declaration. Real declarations are much less likely to
897 be misused the way comments are, so advance over them
898 properly regardless of strictness. */
899 p = advance_declaration (p, end);
911 while (NAME_CHAR_P (*p))
913 if (p == tag_name_begin)
920 struct tagstack_item *ts = tagstack_push (&head, &tail);
923 ts->tagname_begin = tag_name_begin;
924 ts->tagname_end = tag_name_end;
925 ts->contents_begin = NULL;
929 if (end_tag && *p != '>')
932 if (!name_allowed (allowed_tags, tag_name_begin, tag_name_end))
933 /* We can't just say "goto look_for_tag" here because we need
934 the loop below to properly advance over the tag's attributes. */
935 uninteresting_tag = true;
938 uninteresting_tag = false;
939 convert_and_copy (&pool, tag_name_begin, tag_name_end, AP_DOWNCASE);
942 /* Find the attributes. */
945 const char *attr_name_begin, *attr_name_end;
946 const char *attr_value_begin, *attr_value_end;
947 const char *attr_raw_value_begin, *attr_raw_value_end;
948 int operation = AP_DOWNCASE; /* stupid compiler. */
954 /* A slash at this point means the tag is about to be
955 closed. This is legal in XML and has been popularized
956 in HTML via XHTML. */
957 /* <foo a=b c=d /> */
965 /* Check for end of tag definition. */
969 /* Establish bounds of attribute name. */
970 attr_name_begin = p; /* <foo bar ...> */
972 while (NAME_CHAR_P (*p))
974 attr_name_end = p; /* <foo bar ...> */
976 if (attr_name_begin == attr_name_end)
979 /* Establish bounds of attribute value. */
981 if (NAME_CHAR_P (*p) || *p == '/' || *p == '>')
983 /* Minimized attribute syntax allows `=' to be omitted.
984 For example, <UL COMPACT> is a valid shorthand for <UL
985 COMPACT="compact">. Even if such attributes are not
986 useful to Wget, we need to support them, so that the
987 tags containing them can be parsed correctly. */
988 attr_raw_value_begin = attr_value_begin = attr_name_begin;
989 attr_raw_value_end = attr_value_end = attr_name_end;
995 if (*p == '\"' || *p == '\'')
997 bool newline_seen = false;
998 char quote_char = *p;
999 attr_raw_value_begin = p;
1001 attr_value_begin = p; /* <foo bar="baz"> */
1003 while (*p != quote_char)
1005 if (!newline_seen && *p == '\n')
1007 /* If a newline is seen within the quotes, it
1008 is most likely that someone forgot to close
1009 the quote. In that case, we back out to
1010 the value beginning, and terminate the tag
1011 at either `>' or the delimiter, whichever
1012 comes first. Such a tag terminated at `>'
1014 p = attr_value_begin;
1015 newline_seen = true;
1018 else if (newline_seen && *p == '>')
1022 attr_value_end = p; /* <foo bar="baz"> */
1024 if (*p == quote_char)
1028 attr_raw_value_end = p; /* <foo bar="baz"> */
1030 operation = AP_DECODE_ENTITIES;
1031 if (flags & MHT_TRIM_VALUES)
1032 operation |= AP_TRIM_BLANKS;
1036 attr_value_begin = p; /* <foo bar=baz> */
1038 /* According to SGML, a name token should consist only
1039 of alphanumerics, . and -. However, this is often
1040 violated by, for instance, `%' in `width=75%'.
1041 We'll be liberal and allow just about anything as
1042 an attribute value. */
1043 while (!c_isspace (*p) && *p != '>')
1045 attr_value_end = p; /* <foo bar=baz qux=quix> */
1047 if (attr_value_begin == attr_value_end)
1051 attr_raw_value_begin = attr_value_begin;
1052 attr_raw_value_end = attr_value_end;
1053 operation = AP_DECODE_ENTITIES;
1058 /* We skipped the whitespace and found something that is
1059 neither `=' nor the beginning of the next attribute's
1061 goto backout_tag; /* <foo bar [... */
1065 /* If we're not interested in the tag, don't bother with any
1066 of the attributes. */
1067 if (uninteresting_tag)
1070 /* If we aren't interested in the attribute, skip it. We
1071 cannot do this test any sooner, because our text pointer
1072 needs to correctly advance over the attribute. */
1073 if (!name_allowed (allowed_attributes, attr_name_begin, attr_name_end))
1076 GROW_ARRAY (pairs, attr_pair_size, nattrs + 1, attr_pair_resized,
1079 pairs[nattrs].name_pool_index = pool.tail;
1080 convert_and_copy (&pool, attr_name_begin, attr_name_end, AP_DOWNCASE);
1082 pairs[nattrs].value_pool_index = pool.tail;
1083 convert_and_copy (&pool, attr_value_begin, attr_value_end, operation);
1084 pairs[nattrs].value_raw_beginning = attr_raw_value_begin;
1085 pairs[nattrs].value_raw_size = (attr_raw_value_end
1086 - attr_raw_value_begin);
1090 if (!end_tag && tail && (tail->tagname_begin == tag_name_begin))
1092 tail->contents_begin = p+1;
1095 if (uninteresting_tag)
1101 /* By now, we have a valid tag with a name and zero or more
1102 attributes. Fill in the data and call the mapper function. */
1105 struct taginfo taginfo;
1106 struct tagstack_item *ts = NULL;
1108 taginfo.name = pool.contents;
1109 taginfo.end_tag_p = end_tag;
1110 taginfo.nattrs = nattrs;
1111 /* We fill in the char pointers only now, when pool can no
1112 longer get realloc'ed. If we did that above, we could get
1113 hosed by reallocation. Obviously, after this point, the pool
1114 may no longer be grown. */
1115 for (i = 0; i < nattrs; i++)
1117 pairs[i].name = pool.contents + pairs[i].name_pool_index;
1118 pairs[i].value = pool.contents + pairs[i].value_pool_index;
1120 taginfo.attrs = pairs;
1121 taginfo.start_position = tag_start_position;
1122 taginfo.end_position = p + 1;
1123 taginfo.contents_begin = NULL;
1124 taginfo.contents_end = NULL;
1128 ts = tagstack_find (tail, tag_name_begin, tag_name_end);
1131 if (ts->contents_begin)
1133 taginfo.contents_begin = ts->contents_begin;
1134 taginfo.contents_end = tag_start_position;
1136 tagstack_pop (&head, &tail, ts);
1140 mapfun (&taginfo, maparg);
1147 ++tag_backout_count;
1149 /* The tag wasn't really a tag. Treat its contents as ordinary
1151 p = tag_start_position + 1;
1157 if (attr_pair_resized)
1159 /* pop any tag stack that's left */
1160 tagstack_pop (&head, &tail, head);
1169 test_mapper (struct taginfo *taginfo, void *arg)
1173 printf ("%s%s", taginfo->end_tag_p ? "/" : "", taginfo->name);
1174 for (i = 0; i < taginfo->nattrs; i++)
1175 printf (" %s=%s", taginfo->attrs[i].name, taginfo->attrs[i].value);
1183 char *x = xmalloc (size);
1186 int tag_counter = 0;
1188 while ((read_count = fread (x + length, 1, size - length, stdin)))
1190 length += read_count;
1192 x = xrealloc (x, size);
1195 map_html_tags (x, length, test_mapper, &tag_counter, 0, NULL, NULL);
1196 printf ("TAGS: %d\n", tag_counter);
1197 printf ("Tag backouts: %d\n", tag_backout_count);
1198 printf ("Comment backouts: %d\n", comment_backout_count);
1201 #endif /* STANDALONE */