c语言使用ekhtml库解析html

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
/*
 * Copyright (c) 2002, Jon Travis
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

#include "ekhtml.h"

#define MAGIC_DOODIE 0xf9d33bc1

typedef struct {
    unsigned int n_starttags;
    unsigned int n_endtags;
    unsigned int n_comments;
    unsigned int n_data;
    unsigned int magic_doodie;
    unsigned int only_parse;
} tester_cbdata;

static void handle_starttag_way(void *cbdata, ekhtml_string_t *tag,
                                ekhtml_attr_t *attrs)
{
    printf("GOT WAY START!n");
}

static void handle_starttag(void *cbdata, ekhtml_string_t *tag,
			    ekhtml_attr_t *attrs)
{
    ekhtml_attr_t *attr;
    tester_cbdata *tdata = cbdata;
    
    assert(tdata->magic_doodie == MAGIC_DOODIE);
    tdata->n_starttags++;
    if(tdata->only_parse)
        return;
    
    printf("START: "%.*s"n", (int)tag->len, tag->str);
    for(attr=attrs; attr; attr=attr->next) {
        printf("ATTRIBUTE: "%.*s" = ", (int)attr->name.len, attr->name.str);
        if(!attr->isBoolean)
            printf(""%.*s"n", (int)attr->val.len, attr->val.str);
        else
            printf(""%.*s"n", (int)attr->name.len, attr->name.str);
    }
}

static void handle_endtag(void *cbdata, ekhtml_string_t *str){
    tester_cbdata *tdata = cbdata;
    
    assert(tdata->magic_doodie == MAGIC_DOODIE);
    tdata->n_endtags++;
    if(tdata->only_parse)
        return;
    
    printf("END: "%.*s"n", (int)str->len, str->str);
}

static void handle_comment(void *cbdata, ekhtml_string_t *str){
    tester_cbdata *tdata = cbdata;
    
    assert(tdata->magic_doodie == MAGIC_DOODIE);
    tdata->n_comments++;
    if(tdata->only_parse)
        return;
    
    printf("COMMENT: "%.*s"n", (int)str->len, str->str);
}

static void handle_data(void *cbdata, ekhtml_string_t *str){
    tester_cbdata *tdata = cbdata;
    
    assert(tdata->magic_doodie == MAGIC_DOODIE);
    tdata->n_data++;
    if(tdata->only_parse)
        return;
    
    fwrite(str->str, str->len, 1, stdout);
}

int main(int argc, char *argv[]){
    tester_cbdata cbdata;
    ekhtml_parser_t *ekparser;
    char *buf;
    size_t nbuf;
    int feedsize;
    
    if(argc < 2){
        fprintf(stderr, "Syntax: %s <feedsize> [1|0 (to print debug)]n", 
                argv[0]);
        return -1;
    }
    
    feedsize = atoi(argv[1]);
    
    ekparser = ekhtml_parser_new(NULL);
    
    cbdata.n_starttags  = 0;
    cbdata.n_endtags    = 0;
    cbdata.n_comments   = 0;
    cbdata.n_data       = 0;
    cbdata.magic_doodie = MAGIC_DOODIE;
    cbdata.only_parse   = argc == 3;
    
    ekhtml_parser_datacb_set(ekparser, handle_data);
    ekhtml_parser_commentcb_set(ekparser, handle_comment);
    ekhtml_parser_startcb_add(ekparser, "WAY", handle_starttag_way);
    ekhtml_parser_startcb_add(ekparser, NULL, handle_starttag);
    ekhtml_parser_endcb_add(ekparser, NULL, handle_endtag);
    ekhtml_parser_cbdata_set(ekparser, &cbdata);
    buf = malloc(feedsize);
    
    while((nbuf = fread(buf, 1, feedsize, stdin))){
        ekhtml_string_t str;

        str.str = buf;
        str.len = nbuf;
        ekhtml_parser_feed(ekparser, &str);
        ekhtml_parser_flush(ekparser, 0);
    }
    ekhtml_parser_flush(ekparser, 1);
    ekhtml_parser_destroy(ekparser);
    free(buf);
    
    if(argc == 3){
        fprintf(stderr, 
                "# starttags: %un"
                "# endtags:   %un"
                "# comments:  %un"
                "# data:      %un", cbdata.n_starttags,
                cbdata.n_endtags, cbdata.n_comments, cbdata.n_data);
    }
    
    return 0;
}

1
2
3
4
5
6
7
typedef struct ekhtml_attr_t {
    ekhtml_string_t       name;       /**< Name of the attribute             */
    ekhtml_string_t       val;        /**< Value of the attribute            */
    unsigned int          isBoolean;  /**< True of the attribute is boolean  */
    struct ekhtml_attr_t *next;  /**< Pointer to next attribute in the list  */
} ekhtml_attr_t;

1
2
3
4
5
typedef struct ekhtml_string_t {
    const char *str;    /**< Actual string data          */
    size_t      len;    /**< Length of the data in `str` */
} ekhtml_string_t;

1
typedef void (*ekhtml_data_cb_t)(void *cbdata, ekhtml_string_t *data);