version 1.1, 2009/10/21 19:13:50 |
version 1.2, 2009/10/27 21:40:07 |
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
#include <sys/types.h> |
#include <sys/types.h> |
#include <sys/queue.h> |
|
|
|
#include <assert.h> |
#include <assert.h> |
#include <err.h> |
#include <err.h> |
|
|
if (NULL == (h = calloc(1, sizeof(struct html)))) |
if (NULL == (h = calloc(1, sizeof(struct html)))) |
return(NULL); |
return(NULL); |
|
|
SLIST_INIT(&h->tags); |
h->tags.head = NULL; |
SLIST_INIT(&h->ords); |
h->ords.head = NULL; |
|
|
if (NULL == (h->symtab = chars_init(CHARS_HTML))) { |
if (NULL == (h->symtab = chars_init(CHARS_HTML))) { |
free(h); |
free(h); |
|
|
|
|
h = (struct html *)p; |
h = (struct html *)p; |
|
|
while ( ! SLIST_EMPTY(&h->ords)) { |
while ((ord = h->ords.head) != NULL) { |
ord = SLIST_FIRST(&h->ords); |
h->ords.head = ord->next; |
SLIST_REMOVE_HEAD(&h->ords, entry); |
|
free(ord); |
free(ord); |
} |
} |
|
|
while ( ! SLIST_EMPTY(&h->tags)) { |
while ((tag = h->tags.head) != NULL) { |
tag = SLIST_FIRST(&h->tags); |
h->tags.head = tag->next; |
SLIST_REMOVE_HEAD(&h->tags, entry); |
|
free(tag); |
free(tag); |
} |
} |
|
|
|
|
if (NULL == (t = malloc(sizeof(struct tag)))) |
if (NULL == (t = malloc(sizeof(struct tag)))) |
err(EXIT_FAILURE, "malloc"); |
err(EXIT_FAILURE, "malloc"); |
t->tag = tag; |
t->tag = tag; |
SLIST_INSERT_HEAD(&h->tags, t, entry); |
t->next = h->tags.head; |
|
h->tags.head = t; |
} else |
} else |
t = NULL; |
t = NULL; |
|
|
|
|
{ |
{ |
struct tag *tag; |
struct tag *tag; |
|
|
while ( ! SLIST_EMPTY(&h->tags)) { |
while ((tag = h->tags.head) != NULL) { |
tag = SLIST_FIRST(&h->tags); |
|
print_ctag(h, tag->tag); |
print_ctag(h, tag->tag); |
SLIST_REMOVE_HEAD(&h->tags, entry); |
h->tags.head = tag->next; |
free(tag); |
free(tag); |
if (until && tag == until) |
if (until && tag == until) |
return; |
return; |
|
|
{ |
{ |
struct tag *tag; |
struct tag *tag; |
|
|
while ( ! SLIST_EMPTY(&h->tags)) { |
while ((tag = h->tags.head) != NULL) { |
tag = SLIST_FIRST(&h->tags); |
|
if (suntil && tag == suntil) |
if (suntil && tag == suntil) |
return; |
return; |
print_ctag(h, tag->tag); |
print_ctag(h, tag->tag); |
SLIST_REMOVE_HEAD(&h->tags, entry); |
h->tags.head = tag->next; |
free(tag); |
free(tag); |
} |
} |
} |
} |