author | waspe <waspe> | 2003-11-04 17:18:09 (UTC) |
---|---|---|
committer | waspe <waspe> | 2003-11-04 17:18:09 (UTC) |
commit | dcb673c3b856bc0392414116d36659f5f4bf18a5 (patch) (unidiff) | |
tree | 6f5903334cb7457552082909d70a16dd7f2b049f /library/backend/vcc.y | |
parent | 8dc71d4826633fba63618a509e84ca4a30f5addb (diff) | |
download | opie-dcb673c3b856bc0392414116d36659f5f4bf18a5.zip opie-dcb673c3b856bc0392414116d36659f5f4bf18a5.tar.gz opie-dcb673c3b856bc0392414116d36659f5f4bf18a5.tar.bz2 |
resolved merge conflict
-rw-r--r-- | library/backend/vcc.y | 2438 |
1 files changed, 1219 insertions, 1219 deletions
diff --git a/library/backend/vcc.y b/library/backend/vcc.y index bec2955..eca7c32 100644 --- a/library/backend/vcc.y +++ b/library/backend/vcc.y | |||
@@ -1,1219 +1,1219 @@ | |||
1 | %{ | 1 | %{ |
2 | 2 | ||
3 | /*************************************************************************** | 3 | /*************************************************************************** |
4 | (C) Copyright 1996 Apple Computer, Inc., AT&T Corp., International | 4 | (C) Copyright 1996 Apple Computer, Inc., AT&T Corp., International |
5 | Business Machines Corporation and Siemens Rolm Communications Inc. | 5 | Business Machines Corporation and Siemens Rolm Communications Inc. |
6 | 6 | ||
7 | For purposes of this license notice, the term Licensors shall mean, | 7 | For purposes of this license notice, the term Licensors shall mean, |
8 | collectively, Apple Computer, Inc., AT&T Corp., International | 8 | collectively, Apple Computer, Inc., AT&T Corp., International |
9 | Business Machines Corporation and Siemens Rolm Communications Inc. | 9 | Business Machines Corporation and Siemens Rolm Communications Inc. |
10 | The term Licensor shall mean any of the Licensors. | 10 | The term Licensor shall mean any of the Licensors. |
11 | 11 | ||
12 | Subject to acceptance of the following conditions, permission is hereby | 12 | Subject to acceptance of the following conditions, permission is hereby |
13 | granted by Licensors without the need for written agreement and without | 13 | granted by Licensors without the need for written agreement and without |
14 | license or royalty fees, to use, copy, modify and distribute this | 14 | license or royalty fees, to use, copy, modify and distribute this |
15 | software for any purpose. | 15 | software for any purpose. |
16 | 16 | ||
17 | The above copyright notice and the following four paragraphs must be | 17 | The above copyright notice and the following four paragraphs must be |
18 | reproduced in all copies of this software and any software including | 18 | reproduced in all copies of this software and any software including |
19 | this software. | 19 | this software. |
20 | 20 | ||
21 | THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS AND NO LICENSOR SHALL HAVE | 21 | THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS AND NO LICENSOR SHALL HAVE |
22 | ANY OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS OR | 22 | ANY OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS OR |
23 | MODIFICATIONS. | 23 | MODIFICATIONS. |
24 | 24 | ||
25 | IN NO EVENT SHALL ANY LICENSOR BE LIABLE TO ANY PARTY FOR DIRECT, | 25 | IN NO EVENT SHALL ANY LICENSOR BE LIABLE TO ANY PARTY FOR DIRECT, |
26 | INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES OR LOST PROFITS ARISING OUT | 26 | INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES OR LOST PROFITS ARISING OUT |
27 | OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH | 27 | OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH |
28 | DAMAGE. | 28 | DAMAGE. |
29 | 29 | ||
30 | EACH LICENSOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED, | 30 | EACH LICENSOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED, |
31 | INCLUDING BUT NOT LIMITED TO ANY WARRANTY OF NONINFRINGEMENT OR THE | 31 | INCLUDING BUT NOT LIMITED TO ANY WARRANTY OF NONINFRINGEMENT OR THE |
32 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 32 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
33 | PURPOSE. | 33 | PURPOSE. |
34 | 34 | ||
35 | The software is provided with RESTRICTED RIGHTS. Use, duplication, or | 35 | The software is provided with RESTRICTED RIGHTS. Use, duplication, or |
36 | disclosure by the government are subject to restrictions set forth in | 36 | disclosure by the government are subject to restrictions set forth in |
37 | DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. | 37 | DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. |
38 | 38 | ||
39 | ***************************************************************************/ | 39 | ***************************************************************************/ |
40 | 40 | ||
41 | /* | 41 | /* |
42 | * src: vcc.c | 42 | * src: vcc.c |
43 | * doc: Parser for vCard and vCalendar. Note that this code is | 43 | * doc: Parser for vCard and vCalendar. Note that this code is |
44 | * generated by a yacc parser generator. Generally it should not | 44 | * generated by a yacc parser generator. Generally it should not |
45 | * be edited by hand. The real source is vcc.y. The #line directives | 45 | * be edited by hand. The real source is vcc.y. The #line directives |
46 | * can be commented out here to make it easier to trace through | 46 | * can be commented out here to make it easier to trace through |
47 | * in a debugger. However, if a bug is found it should | 47 | * in a debugger. However, if a bug is found it should |
48 | * be fixed in vcc.y and this file regenerated. | 48 | * be fixed in vcc.y and this file regenerated. |
49 | */ | 49 | */ |
50 | 50 | ||
51 | 51 | ||
52 | /* debugging utilities */ | 52 | /* debugging utilities */ |
53 | #if __DEBUG | 53 | #if __DEBUG |
54 | #define DBG_(x) printf x | 54 | #define DBG_(x) printf x |
55 | #else | 55 | #else |
56 | #define DBG_(x) | 56 | #define DBG_(x) |
57 | #endif | 57 | #endif |
58 | 58 | ||
59 | /**** External Functions ****/ | 59 | /**** External Functions ****/ |
60 | 60 | ||
61 | /* assign local name to parser variables and functions so that | 61 | /* assign local name to parser variables and functions so that |
62 | we can use more than one yacc based parser. | 62 | we can use more than one yacc based parser. |
63 | */ | 63 | */ |
64 | 64 | ||
65 | #if 0 | 65 | #if 0 |
66 | #define yyparse mime_parse | 66 | #define yyparse mime_parse |
67 | #define yylex mime_lex | 67 | #define yylex mime_lex |
68 | #define yyerror mime_error | 68 | #define yyerror mime_error |
69 | #define yychar mime_char | 69 | #define yychar mime_char |
70 | /* #define p_yyval p_mime_val */ | 70 | /* #define p_yyval p_mime_val */ |
71 | #undef yyval | 71 | #undef yyval |
72 | #define yyval mime_yyval | 72 | #define yyval mime_yyval |
73 | /* #define p_yylval p_mime_lval */ | 73 | /* #define p_yylval p_mime_lval */ |
74 | #undef yylval | 74 | #undef yylval |
75 | #define yylval mime_yylval | 75 | #define yylval mime_yylval |
76 | #define yydebug mime_debug | 76 | #define yydebug mime_debug |
77 | #define yynerrs mime_nerrs | 77 | #define yynerrs mime_nerrs |
78 | #define yyerrflag mime_errflag | 78 | #define yyerrflag mime_errflag |
79 | #define yyss mime_ss | 79 | #define yyss mime_ss |
80 | #define yyssp mime_ssp | 80 | #define yyssp mime_ssp |
81 | #define yyvs mime_vs | 81 | #define yyvs mime_vs |
82 | #define yyvsp mime_vsp | 82 | #define yyvsp mime_vsp |
83 | #define yylhs mime_lhs | 83 | #define yylhs mime_lhs |
84 | #define yylen mime_len | 84 | #define yylen mime_len |
85 | #define yydefred mime_defred | 85 | #define yydefred mime_defred |
86 | #define yydgoto mime_dgoto | 86 | #define yydgoto mime_dgoto |
87 | #define yysindex mime_sindex | 87 | #define yysindex mime_sindex |
88 | #define yyrindex mime_rindex | 88 | #define yyrindex mime_rindex |
89 | #define yygindex mime_gindex | 89 | #define yygindex mime_gindex |
90 | #define yytable mime_table | 90 | #define yytable mime_table |
91 | #define yycheck mime_check | 91 | #define yycheck mime_check |
92 | #define yyname mime_name | 92 | #define yyname mime_name |
93 | #define yyrule mime_rule | 93 | #define yyrule mime_rule |
94 | #ifdef YYPREFIX | 94 | #ifdef YYPREFIX |
95 | #undef YYPREFIX | 95 | #undef YYPREFIX |
96 | #endif | 96 | #endif |
97 | #define YYPREFIX "mime_" | 97 | #define YYPREFIX "mime_" |
98 | #endif | 98 | #endif |
99 | 99 | ||
100 | 100 | ||
101 | #ifndef _NO_LINE_FOLDING | 101 | #ifndef _NO_LINE_FOLDING |
102 | #define _SUPPORT_LINE_FOLDING 1 | 102 | #define _SUPPORT_LINE_FOLDING 1 |
103 | #endif | 103 | #endif |
104 | 104 | ||
105 | /* undef below if compile with MFC */ | 105 | /* undef below if compile with MFC */ |
106 | /* #define INCLUDEMFC 1 */ | 106 | /* #define INCLUDEMFC 1 */ |
107 | 107 | ||
108 | #if defined(WIN32) || defined(_WIN32) | 108 | #if defined(WIN32) || defined(_WIN32) |
109 | #ifdef INCLUDEMFC | 109 | #ifdef INCLUDEMFC |
110 | #include <afx.h> | 110 | #include <afx.h> |
111 | #endif | 111 | #endif |
112 | #endif | 112 | #endif |
113 | 113 | ||
114 | #include <string.h> | 114 | #include <string.h> |
115 | #ifndef __MWERKS__ | 115 | #ifndef __MWERKS__ |
116 | #include <stdlib.h> | 116 | #include <stdlib.h> |
117 | #endif | 117 | #endif |
118 | #include <stdio.h> | 118 | #include <stdio.h> |
119 | #include <stdlib.h> | 119 | #include <stdlib.h> |
120 | #include <ctype.h> | 120 | #include <ctype.h> |
121 | 121 | ||
122 | //#ifdef PALMTOPCENTER | 122 | //#ifdef PALMTOPCENTER |
123 | //#include <qpe/vobject_p.h> | 123 | //#include <qpe/vobject_p.h> |
124 | //#else | 124 | //#else |
125 | #include "vobject_p.h" | 125 | #include "vobject_p.h" |
126 | //#endif | 126 | //#endif |
127 | 127 | ||
128 | /**** Types, Constants ****/ | 128 | /**** Types, Constants ****/ |
129 | 129 | ||
130 | #define YYDEBUG 0/* 1 to compile in some debugging code */ | 130 | #define YYDEBUG 0/* 1 to compile in some debugging code */ |
131 | #define MAXTOKEN 256/* maximum token (line) length */ | 131 | #define MAXTOKEN 256/* maximum token (line) length */ |
132 | #define YYSTACKSIZE 100// ~unref ? | 132 | #define YYSTACKSIZE 100// ~unref ? |
133 | #define MAXLEVEL 10/* max # of nested objects parseable */ | 133 | #define MAXLEVEL 10/* max # of nested objects parseable */ |
134 | /* (includes outermost) */ | 134 | /* (includes outermost) */ |
135 | 135 | ||
136 | 136 | ||
137 | /**** Global Variables ****/ | 137 | /**** Global Variables ****/ |
138 | int mime_lineNum, mime_numErrors; /* yyerror() can use these */ | 138 | int mime_lineNum, mime_numErrors; /* yyerror() can use these */ |
139 | static VObject* vObjList; | 139 | static VObject* vObjList; |
140 | static VObject *curProp; | 140 | static VObject *curProp; |
141 | static VObject *curObj; | 141 | static VObject *curObj; |
142 | static VObject* ObjStack[MAXLEVEL]; | 142 | static VObject* ObjStack[MAXLEVEL]; |
143 | static int ObjStackTop; | 143 | static int ObjStackTop; |
144 | 144 | ||
145 | 145 | ||
146 | /* A helpful utility for the rest of the app. */ | 146 | /* A helpful utility for the rest of the app. */ |
147 | #if __CPLUSPLUS__ | 147 | #if __CPLUSPLUS__ |
148 | extern "C" { | 148 | extern "C" { |
149 | #endif | 149 | #endif |
150 | 150 | ||
151 | extern void yyerror(char *s); | 151 | extern void yyerror(char *s); |
152 | 152 | ||
153 | #if __CPLUSPLUS__ | 153 | #if __CPLUSPLUS__ |
154 | }; | 154 | }; |
155 | #endif | 155 | #endif |
156 | 156 | ||
157 | int yyparse(); | 157 | int yyparse(); |
158 | 158 | ||
159 | enum LexMode { | 159 | enum LexMode { |
160 | L_NORMAL, | 160 | L_NORMAL, |
161 | L_VCARD, | 161 | L_VCARD, |
162 | L_VCAL, | 162 | L_VCAL, |
163 | L_VEVENT, | 163 | L_VEVENT, |
164 | L_VTODO, | 164 | L_VTODO, |
165 | L_VALUES, | 165 | L_VALUES, |
166 | L_BASE64, | 166 | L_BASE64, |
167 | L_QUOTED_PRINTABLE | 167 | L_QUOTED_PRINTABLE |
168 | }; | 168 | }; |
169 | 169 | ||
170 | /**** Private Forward Declarations ****/ | 170 | /**** Private Forward Declarations ****/ |
171 | static int pushVObject(const char *prop); | 171 | static int pushVObject(const char *prop); |
172 | static VObject* popVObject(); | 172 | static VObject* popVObject(); |
173 | static void lexPopMode(int top); | 173 | static void lexPopMode(int top); |
174 | static int lexWithinMode(enum LexMode mode); | 174 | static int lexWithinMode(enum LexMode mode); |
175 | static void lexPushMode(enum LexMode mode); | 175 | static void lexPushMode(enum LexMode mode); |
176 | static void enterProps(const char *s); | 176 | static void enterProps(const char *s); |
177 | static void enterAttr(const char *s1, const char *s2); | 177 | static void enterAttr(const char *s1, const char *s2); |
178 | static void enterValues(const char *value); | 178 | static void enterValues(const char *value); |
179 | #define mime_error yyerror | 179 | #define mime_error yyerror |
180 | void mime_error(char *s); | 180 | void mime_error(char *s); |
181 | void mime_error_(char *s); | 181 | void mime_error_(char *s); |
182 | 182 | ||
183 | %} | 183 | %} |
184 | 184 | ||
185 | /***************************************************************************/ | 185 | /***************************************************************************/ |
186 | /*** The grammar ****/ | 186 | /*** The grammar ****/ |
187 | /***************************************************************************/ | 187 | /***************************************************************************/ |
188 | 188 | ||
189 | %union { | 189 | %union { |
190 | char *str; | 190 | char *str; |
191 | VObject *vobj; | 191 | VObject *vobj; |
192 | } | 192 | } |
193 | 193 | ||
194 | %token | 194 | %token |
195 | EQ COLON DOT SEMICOLON SPACE HTAB LINESEP NEWLINE | 195 | EQ COLON DOT SEMICOLON SPACE HTAB LINESEP NEWLINE |
196 | BEGIN_VCARD END_VCARD BEGIN_VCAL END_VCAL | 196 | BEGIN_VCARD END_VCARD BEGIN_VCAL END_VCAL |
197 | BEGIN_VEVENT END_VEVENT BEGIN_VTODO END_VTODO | 197 | BEGIN_VEVENT END_VEVENT BEGIN_VTODO END_VTODO |
198 | ID | 198 | ID |
199 | 199 | ||
200 | /* | 200 | /* |
201 | * NEWLINE is the token that would occur outside a vCard, | 201 | * NEWLINE is the token that would occur outside a vCard, |
202 | * while LINESEP is the token that would occur inside a vCard. | 202 | * while LINESEP is the token that would occur inside a vCard. |
203 | */ | 203 | */ |
204 | 204 | ||
205 | %token <str> | 205 | %token <str> |
206 | STRING ID | 206 | STRING ID |
207 | 207 | ||
208 | %type <str> name value | 208 | %type <str> name value |
209 | 209 | ||
210 | %type <vobj> vcard vcal vobject | 210 | %type <vobj> vcard vcal vobject |
211 | 211 | ||
212 | %start mime | 212 | %start mime |
213 | 213 | ||
214 | %% | 214 | %% |
215 | 215 | ||
216 | 216 | ||
217 | mime: vobjects | 217 | mime: vobjects |
218 | ; | 218 | ; |
219 | 219 | ||
220 | vobjects: vobjects vobject | 220 | vobjects: vobjects vobject |
221 | { addList(&vObjList, $2); curObj = 0; } | 221 | { addList(&vObjList, $2); curObj = 0; } |
222 | | vobject | 222 | | vobject |
223 | { addList(&vObjList, $1); curObj = 0; } | 223 | { addList(&vObjList, $1); curObj = 0; } |
224 | ; | 224 | ; |
225 | 225 | ||
226 | vobject: vcard | 226 | vobject: vcard |
227 | | vcal | 227 | | vcal |
228 | ; | 228 | ; |
229 | 229 | ||
230 | vcard: | 230 | vcard: |
231 | BEGIN_VCARD | 231 | BEGIN_VCARD |
232 | { | 232 | { |
233 | lexPushMode(L_VCARD); | 233 | lexPushMode(L_VCARD); |
234 | if (!pushVObject(VCCardProp)) YYERROR; | 234 | if (!pushVObject(VCCardProp)) YYERROR; |
235 | } | 235 | } |
236 | items END_VCARD | 236 | items END_VCARD |
237 | { | 237 | { |
238 | lexPopMode(0); | 238 | lexPopMode(0); |
239 | $$ = popVObject(); | 239 | $$ = popVObject(); |
240 | } | 240 | } |
241 | | BEGIN_VCARD | 241 | | BEGIN_VCARD |
242 | { | 242 | { |
243 | lexPushMode(L_VCARD); | 243 | lexPushMode(L_VCARD); |
244 | if (!pushVObject(VCCardProp)) YYERROR; | 244 | if (!pushVObject(VCCardProp)) YYERROR; |
245 | } | 245 | } |
246 | END_VCARD | 246 | END_VCARD |
247 | { | 247 | { |
248 | lexPopMode(0); | 248 | lexPopMode(0); |
249 | $$ = popVObject(); | 249 | $$ = popVObject(); |
250 | } | 250 | } |
251 | ; | 251 | ; |
252 | 252 | ||
253 | items: items item | 253 | items: items item |
254 | | item | 254 | | item |
255 | ; | 255 | ; |
256 | 256 | ||
257 | item: prop COLON | 257 | item: prop COLON |
258 | { | 258 | { |
259 | lexPushMode(L_VALUES); | 259 | lexPushMode(L_VALUES); |
260 | } | 260 | } |
261 | values LINESEP | 261 | values LINESEP |
262 | { | 262 | { |
263 | if (lexWithinMode(L_BASE64) || lexWithinMode(L_QUOTED_PRINTABLE)) | 263 | if (lexWithinMode(L_BASE64) || lexWithinMode(L_QUOTED_PRINTABLE)) |
264 | lexPopMode(0); | 264 | lexPopMode(0); |
265 | lexPopMode(0); | 265 | lexPopMode(0); |
266 | } | 266 | } |
267 | | error | 267 | | error |
268 | ; | 268 | ; |
269 | 269 | ||
270 | prop: name | 270 | prop: name |
271 | { | 271 | { |
272 | enterProps($1); | 272 | enterProps($1); |
273 | } | 273 | } |
274 | attr_params | 274 | attr_params |
275 | | name | 275 | | name |
276 | { | 276 | { |
277 | enterProps($1); | 277 | enterProps($1); |
278 | } | 278 | } |
279 | ; | 279 | ; |
280 | 280 | ||
281 | attr_params: attr_params attr_param | 281 | attr_params: attr_params attr_param |
282 | | attr_param | 282 | | attr_param |
283 | ; | 283 | ; |
284 | 284 | ||
285 | attr_param: SEMICOLON attr | 285 | attr_param: SEMICOLON attr |
286 | ; | 286 | ; |
287 | 287 | ||
288 | attr: name | 288 | attr: name |
289 | { | 289 | { |
290 | enterAttr($1,0); | 290 | enterAttr($1,0); |
291 | } | 291 | } |
292 | | name EQ name | 292 | | name EQ name |
293 | { | 293 | { |
294 | enterAttr($1,$3); | 294 | enterAttr($1,$3); |
295 | 295 | ||
296 | } | 296 | } |
297 | ; | 297 | ; |
298 | 298 | ||
299 | name: ID | 299 | name: ID |
300 | ; | 300 | ; |
301 | 301 | ||
302 | values: value SEMICOLON { enterValues($1); } values | 302 | values: value SEMICOLON { enterValues($1); } values |
303 | | value | 303 | | value |
304 | { enterValues($1); } | 304 | { enterValues($1); } |
305 | ; | 305 | ; |
306 | 306 | ||
307 | value: STRING | 307 | value: STRING |
308 | | | 308 | | |
309 | { $$ = 0; } | 309 | { $$ = 0; } |
310 | ; | 310 | ; |
311 | 311 | ||
312 | vcal: | 312 | vcal: |
313 | BEGIN_VCAL | 313 | BEGIN_VCAL |
314 | { if (!pushVObject(VCCalProp)) YYERROR; } | 314 | { if (!pushVObject(VCCalProp)) YYERROR; } |
315 | calitems | 315 | calitems |
316 | END_VCAL | 316 | END_VCAL |
317 | { $$ = popVObject(); } | 317 | { $$ = popVObject(); } |
318 | | BEGIN_VCAL | 318 | | BEGIN_VCAL |
319 | { if (!pushVObject(VCCalProp)) YYERROR; } | 319 | { if (!pushVObject(VCCalProp)) YYERROR; } |
320 | END_VCAL | 320 | END_VCAL |
321 | { $$ = popVObject(); } | 321 | { $$ = popVObject(); } |
322 | ; | 322 | ; |
323 | 323 | ||
324 | calitems: calitems calitem | 324 | calitems: calitems calitem |
325 | | calitem | 325 | | calitem |
326 | ; | 326 | ; |
327 | 327 | ||
328 | calitem: | 328 | calitem: |
329 | eventitem | 329 | eventitem |
330 | | todoitem | 330 | | todoitem |
331 | | items | 331 | | items |
332 | ; | 332 | ; |
333 | 333 | ||
334 | eventitem: | 334 | eventitem: |
335 | BEGIN_VEVENT | 335 | BEGIN_VEVENT |
336 | { | 336 | { |
337 | lexPushMode(L_VEVENT); | 337 | lexPushMode(L_VEVENT); |
338 | if (!pushVObject(VCEventProp)) YYERROR; | 338 | if (!pushVObject(VCEventProp)) YYERROR; |
339 | } | 339 | } |
340 | items | 340 | items |
341 | END_VEVENT | 341 | END_VEVENT |
342 | { | 342 | { |
343 | lexPopMode(0); | 343 | lexPopMode(0); |
344 | popVObject(); | 344 | popVObject(); |
345 | } | 345 | } |
346 | | BEGIN_VEVENT | 346 | | BEGIN_VEVENT |
347 | { | 347 | { |
348 | lexPushMode(L_VEVENT); | 348 | lexPushMode(L_VEVENT); |
349 | if (!pushVObject(VCEventProp)) YYERROR; | 349 | if (!pushVObject(VCEventProp)) YYERROR; |
350 | } | 350 | } |
351 | END_VEVENT | 351 | END_VEVENT |
352 | { | 352 | { |
353 | lexPopMode(0); | 353 | lexPopMode(0); |
354 | popVObject(); | 354 | popVObject(); |
355 | } | 355 | } |
356 | ; | 356 | ; |
357 | 357 | ||
358 | todoitem: | 358 | todoitem: |
359 | BEGIN_VTODO | 359 | BEGIN_VTODO |
360 | { | 360 | { |
361 | lexPushMode(L_VTODO); | 361 | lexPushMode(L_VTODO); |
362 | if (!pushVObject(VCTodoProp)) YYERROR; | 362 | if (!pushVObject(VCTodoProp)) YYERROR; |
363 | } | 363 | } |
364 | items | 364 | items |
365 | END_VTODO | 365 | END_VTODO |
366 | { | 366 | { |
367 | lexPopMode(0); | 367 | lexPopMode(0); |
368 | popVObject(); | 368 | popVObject(); |
369 | } | 369 | } |
370 | | BEGIN_VTODO | 370 | | BEGIN_VTODO |
371 | { | 371 | { |
372 | lexPushMode(L_VTODO); | 372 | lexPushMode(L_VTODO); |
373 | if (!pushVObject(VCTodoProp)) YYERROR; | 373 | if (!pushVObject(VCTodoProp)) YYERROR; |
374 | } | 374 | } |
375 | END_VTODO | 375 | END_VTODO |
376 | { | 376 | { |
377 | lexPopMode(0); | 377 | lexPopMode(0); |
378 | popVObject(); | 378 | popVObject(); |
379 | } | 379 | } |
380 | ; | 380 | ; |
381 | 381 | ||
382 | %% | 382 | %% |
383 | /*------------------------------------*/ | 383 | /*------------------------------------*/ |
384 | static int pushVObject(const char *prop) | 384 | static int pushVObject(const char *prop) |
385 | { | 385 | { |
386 | VObject *newObj; | 386 | VObject *newObj; |
387 | if (ObjStackTop == MAXLEVEL) | 387 | if (ObjStackTop == MAXLEVEL) |
388 | return FALSE; | 388 | return FALSE; |
389 | 389 | ||
390 | ObjStack[++ObjStackTop] = curObj; | 390 | ObjStack[++ObjStackTop] = curObj; |
391 | 391 | ||
392 | if (curObj) { | 392 | if (curObj) { |
393 | newObj = addProp(curObj,prop); | 393 | newObj = addProp(curObj,prop); |
394 | curObj = newObj; | 394 | curObj = newObj; |
395 | } | 395 | } |
396 | else | 396 | else |
397 | curObj = newVObject(prop); | 397 | curObj = newVObject(prop); |
398 | 398 | ||
399 | return TRUE; | 399 | return TRUE; |
400 | } | 400 | } |
401 | 401 | ||
402 | 402 | ||
403 | /*---------------------------------------*/ | 403 | /*---------------------------------------*/ |
404 | /* This pops the recently built vCard off the stack and returns it. */ | 404 | /* This pops the recently built vCard off the stack and returns it. */ |
405 | static VObject* popVObject() | 405 | static VObject* popVObject() |
406 | { | 406 | { |
407 | VObject *oldObj; | 407 | VObject *oldObj; |
408 | if (ObjStackTop < 0) { | 408 | if (ObjStackTop < 0) { |
409 | yyerror("pop on empty Object Stack\n"); | 409 | yyerror("pop on empty Object Stack\n"); |
410 | return 0; | 410 | return 0; |
411 | } | 411 | } |
412 | oldObj = curObj; | 412 | oldObj = curObj; |
413 | curObj = ObjStack[ObjStackTop--]; | 413 | curObj = ObjStack[ObjStackTop--]; |
414 | 414 | ||
415 | return oldObj; | 415 | return oldObj; |
416 | } | 416 | } |
417 | 417 | ||
418 | 418 | ||
419 | static void enterValues(const char *value) | 419 | static void enterValues(const char *value) |
420 | { | 420 | { |
421 | if (fieldedProp && *fieldedProp) { | 421 | if (fieldedProp && *fieldedProp) { |
422 | if (value) { | 422 | if (value) { |
423 | addPropValue(curProp,*fieldedProp,value); | 423 | addPropValue(curProp,*fieldedProp,value); |
424 | } | 424 | } |
425 | /* else this field is empty, advance to next field */ | 425 | /* else this field is empty, advance to next field */ |
426 | fieldedProp++; | 426 | fieldedProp++; |
427 | } | 427 | } |
428 | else { | 428 | else { |
429 | if (value) { | 429 | if (value) { |
430 | setVObjectStringZValue_(curProp,strdup( value )); | 430 | setVObjectStringZValue_(curProp,strdup( value )); |
431 | } | 431 | } |
432 | } | 432 | } |
433 | deleteStr(value); | 433 | deleteStr(value); |
434 | } | 434 | } |
435 | 435 | ||
436 | static void enterProps(const char *s) | 436 | static void enterProps(const char *s) |
437 | { | 437 | { |
438 | curProp = addGroup(curObj,s); | 438 | curProp = addGroup(curObj,s); |
439 | deleteStr(s); | 439 | deleteStr(s); |
440 | } | 440 | } |
441 | 441 | ||
442 | static void enterAttr(const char *s1, const char *s2) | 442 | static void enterAttr(const char *s1, const char *s2) |
443 | { | 443 | { |
444 | const char *p1, *p2=0; | 444 | const char *p1, *p2=0; |
445 | p1 = lookupProp_(s1); | 445 | p1 = lookupProp_(s1); |
446 | if (s2) { | 446 | if (s2) { |
447 | VObject *a; | 447 | VObject *a; |
448 | p2 = lookupProp_(s2); | 448 | p2 = lookupProp_(s2); |
449 | a = addProp(curProp,p1); | 449 | a = addProp(curProp,p1); |
450 | setVObjectStringZValue(a,p2); | 450 | setVObjectStringZValue(a,p2); |
451 | } | 451 | } |
452 | else | 452 | else |
453 | addProp(curProp,p1); | 453 | addProp(curProp,p1); |
454 | if (qstricmp(p1,VCBase64Prop) == 0 || (s2 && qstricmp(p2,VCBase64Prop)==0)) | 454 | if (qstricmp(p1,VCBase64Prop) == 0 || (s2 && qstricmp(p2,VCBase64Prop)==0)) |
455 | lexPushMode(L_BASE64); | 455 | lexPushMode(L_BASE64); |
456 | else if (qstricmp(p1,VCQuotedPrintableProp) == 0 | 456 | else if (qstricmp(p1,VCQuotedPrintableProp) == 0 |
457 | || (s2 && qstricmp(p2,VCQuotedPrintableProp)==0)) | 457 | || (s2 && qstricmp(p2,VCQuotedPrintableProp)==0)) |
458 | lexPushMode(L_QUOTED_PRINTABLE); | 458 | lexPushMode(L_QUOTED_PRINTABLE); |
459 | deleteStr(s1); deleteStr(s2); | 459 | deleteStr(s1); deleteStr(s2); |
460 | } | 460 | } |
461 | 461 | ||
462 | 462 | ||
463 | #define MAX_LEX_LOOKAHEAD_0 32 | 463 | #define MAX_LEX_LOOKAHEAD_0 32 |
464 | #define MAX_LEX_LOOKAHEAD 64 | 464 | #define MAX_LEX_LOOKAHEAD 64 |
465 | #define MAX_LEX_MODE_STACK_SIZE 10 | 465 | #define MAX_LEX_MODE_STACK_SIZE 10 |
466 | #define LEXMODE() (lexBuf.lexModeStack[lexBuf.lexModeStackTop]) | 466 | #define LEXMODE() (lexBuf.lexModeStack[lexBuf.lexModeStackTop]) |
467 | 467 | ||
468 | struct LexBuf { | 468 | struct LexBuf { |
469 | /* input */ | 469 | /* input */ |
470 | #ifdef INCLUDEMFC | 470 | #ifdef INCLUDEMFC |
471 | CFile *inputFile; | 471 | CFile *inputFile; |
472 | #else | 472 | #else |
473 | FILE *inputFile; | 473 | FILE *inputFile; |
474 | #endif | 474 | #endif |
475 | char *inputString; | 475 | char *inputString; |
476 | unsigned long curPos; | 476 | unsigned long curPos; |
477 | unsigned long inputLen; | 477 | unsigned long inputLen; |
478 | /* lookahead buffer */ | 478 | /* lookahead buffer */ |
479 | /* -- lookahead buffer is short instead of char so that EOF | 479 | /* -- lookahead buffer is short instead of char so that EOF |
480 | / can be represented correctly. | 480 | / can be represented correctly. |
481 | */ | 481 | */ |
482 | unsigned long len; | 482 | unsigned long len; |
483 | short buf[MAX_LEX_LOOKAHEAD]; | 483 | short buf[MAX_LEX_LOOKAHEAD]; |
484 | unsigned long getPtr; | 484 | unsigned long getPtr; |
485 | /* context stack */ | 485 | /* context stack */ |
486 | unsigned long lexModeStackTop; | 486 | unsigned long lexModeStackTop; |
487 | enum LexMode lexModeStack[MAX_LEX_MODE_STACK_SIZE]; | 487 | enum LexMode lexModeStack[MAX_LEX_MODE_STACK_SIZE]; |
488 | /* token buffer */ | 488 | /* token buffer */ |
489 | unsigned long maxToken; | 489 | unsigned long maxToken; |
490 | char *strs; | 490 | char *strs; |
491 | unsigned long strsLen; | 491 | unsigned long strsLen; |
492 | } lexBuf; | 492 | } lexBuf; |
493 | 493 | ||
494 | static void lexPushMode(enum LexMode mode) | 494 | static void lexPushMode(enum LexMode mode) |
495 | { | 495 | { |
496 | if (lexBuf.lexModeStackTop == (MAX_LEX_MODE_STACK_SIZE-1)) | 496 | if (lexBuf.lexModeStackTop == (MAX_LEX_MODE_STACK_SIZE-1)) |
497 | yyerror("lexical context stack overflow"); | 497 | yyerror("lexical context stack overflow"); |
498 | else { | 498 | else { |
499 | lexBuf.lexModeStack[++lexBuf.lexModeStackTop] = mode; | 499 | lexBuf.lexModeStack[++lexBuf.lexModeStackTop] = mode; |
500 | } | 500 | } |
501 | } | 501 | } |
502 | 502 | ||
503 | static void lexPopMode(int top) | 503 | static void lexPopMode(int top) |
504 | { | 504 | { |
505 | /* special case of pop for ease of error recovery -- this | 505 | /* special case of pop for ease of error recovery -- this |
506 | version will never underflow */ | 506 | version will never underflow */ |
507 | if (top) | 507 | if (top) |
508 | lexBuf.lexModeStackTop = 0; | 508 | lexBuf.lexModeStackTop = 0; |
509 | else | 509 | else |
510 | if (lexBuf.lexModeStackTop > 0) lexBuf.lexModeStackTop--; | 510 | if (lexBuf.lexModeStackTop > 0) lexBuf.lexModeStackTop--; |
511 | } | 511 | } |
512 | 512 | ||
513 | static int lexWithinMode(enum LexMode mode) { | 513 | static int lexWithinMode(enum LexMode mode) { |
514 | unsigned long i; | 514 | unsigned long i; |
515 | for (i=0;i<lexBuf.lexModeStackTop;i++) | 515 | for (i=0;i<lexBuf.lexModeStackTop;i++) |
516 | if (mode == lexBuf.lexModeStack[i]) return 1; | 516 | if (mode == lexBuf.lexModeStack[i]) return 1; |
517 | return 0; | 517 | return 0; |
518 | } | 518 | } |
519 | 519 | ||
520 | static int lexGetc_() | 520 | static int lexGetc_() |
521 | { | 521 | { |
522 | /* get next char from input, no buffering. */ | 522 | /* get next char from input, no buffering. */ |
523 | if (lexBuf.curPos == lexBuf.inputLen) | 523 | if (lexBuf.curPos == lexBuf.inputLen) |
524 | return EOF; | 524 | return EOF; |
525 | else if (lexBuf.inputString) | 525 | else if (lexBuf.inputString) |
526 | return *(lexBuf.inputString + lexBuf.curPos++); | 526 | return *(lexBuf.inputString + lexBuf.curPos++); |
527 | else { | 527 | else { |
528 | #ifdef INCLUDEMFC | 528 | #ifdef INCLUDEMFC |
529 | char result; | 529 | char result; |
530 | return lexBuf.inputFile->Read(&result, 1) == 1 ? result : EOF; | 530 | return lexBuf.inputFile->Read(&result, 1) == 1 ? result : EOF; |
531 | #else | 531 | #else |
532 | return fgetc(lexBuf.inputFile); | 532 | return fgetc(lexBuf.inputFile); |
533 | #endif | 533 | #endif |
534 | } | 534 | } |
535 | } | 535 | } |
536 | 536 | ||
537 | static int lexGeta() | 537 | static int lexGeta() |
538 | { | 538 | { |
539 | ++lexBuf.len; | 539 | ++lexBuf.len; |
540 | return (lexBuf.buf[lexBuf.getPtr] = lexGetc_()); | 540 | return (lexBuf.buf[lexBuf.getPtr] = lexGetc_()); |
541 | } | 541 | } |
542 | 542 | ||
543 | static int lexGeta_(int i) | 543 | static int lexGeta_(int i) |
544 | { | 544 | { |
545 | ++lexBuf.len; | 545 | ++lexBuf.len; |
546 | return (lexBuf.buf[(lexBuf.getPtr+i)%MAX_LEX_LOOKAHEAD] = lexGetc_()); | 546 | return (lexBuf.buf[(lexBuf.getPtr+i)%MAX_LEX_LOOKAHEAD] = lexGetc_()); |
547 | } | 547 | } |
548 | 548 | ||
549 | static void lexSkipLookahead() { | 549 | static void lexSkipLookahead() { |
550 | if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) { | 550 | if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) { |
551 | /* don't skip EOF. */ | 551 | /* don't skip EOF. */ |
552 | lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD; | 552 | lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD; |
553 | lexBuf.len--; | 553 | lexBuf.len--; |
554 | } | 554 | } |
555 | } | 555 | } |
556 | 556 | ||
557 | static int lexLookahead() { | 557 | static int lexLookahead() { |
558 | int c = (lexBuf.len)? | 558 | int c = (lexBuf.len)? |
559 | lexBuf.buf[lexBuf.getPtr]: | 559 | lexBuf.buf[lexBuf.getPtr]: |
560 | lexGeta(); | 560 | lexGeta(); |
561 | /* do the \r\n -> \n or \r -> \n translation here */ | 561 | /* do the \r\n -> \n or \r -> \n translation here */ |
562 | if (c == '\r') { | 562 | if (c == '\r') { |
563 | int a = (lexBuf.len>1)? | 563 | int a = (lexBuf.len>1)? |
564 | lexBuf.buf[(lexBuf.getPtr+1)%MAX_LEX_LOOKAHEAD]: | 564 | lexBuf.buf[(lexBuf.getPtr+1)%MAX_LEX_LOOKAHEAD]: |
565 | lexGeta_(1); | 565 | lexGeta_(1); |
566 | if (a == '\n') { | 566 | if (a == '\n') { |
567 | lexSkipLookahead(); | 567 | lexSkipLookahead(); |
568 | } | 568 | } |
569 | lexBuf.buf[lexBuf.getPtr] = c = '\n'; | 569 | lexBuf.buf[lexBuf.getPtr] = c = '\n'; |
570 | } | 570 | } |
571 | else if (c == '\n') { | 571 | else if (c == '\n') { |
572 | int a = (lexBuf.len>1)? | 572 | int a = (lexBuf.len>1)? |
573 | lexBuf.buf[lexBuf.getPtr+1]: | 573 | lexBuf.buf[lexBuf.getPtr+1]: |
574 | lexGeta_(1); | 574 | lexGeta_(1); |
575 | if (a == '\r') { | 575 | if (a == '\r') { |
576 | lexSkipLookahead(); | 576 | lexSkipLookahead(); |
577 | } | 577 | } |
578 | lexBuf.buf[lexBuf.getPtr] = '\n'; | 578 | lexBuf.buf[lexBuf.getPtr] = '\n'; |
579 | } | 579 | } |
580 | return c; | 580 | return c; |
581 | } | 581 | } |
582 | 582 | ||
583 | static int lexGetc() { | 583 | static int lexGetc() { |
584 | int c = lexLookahead(); | 584 | int c = lexLookahead(); |
585 | if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) { | 585 | if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) { |
586 | /* EOF will remain in lookahead buffer */ | 586 | /* EOF will remain in lookahead buffer */ |
587 | lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD; | 587 | lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD; |
588 | lexBuf.len--; | 588 | lexBuf.len--; |
589 | } | 589 | } |
590 | return c; | 590 | return c; |
591 | } | 591 | } |
592 | 592 | ||
593 | static void lexSkipLookaheadWord() { | 593 | static void lexSkipLookaheadWord() { |
594 | if (lexBuf.strsLen <= lexBuf.len) { | 594 | if (lexBuf.strsLen <= lexBuf.len) { |
595 | lexBuf.len -= lexBuf.strsLen; | 595 | lexBuf.len -= lexBuf.strsLen; |
596 | lexBuf.getPtr = (lexBuf.getPtr + lexBuf.strsLen) % MAX_LEX_LOOKAHEAD; | 596 | lexBuf.getPtr = (lexBuf.getPtr + lexBuf.strsLen) % MAX_LEX_LOOKAHEAD; |
597 | } | 597 | } |
598 | } | 598 | } |
599 | 599 | ||
600 | static void lexClearToken() | 600 | static void lexClearToken() |
601 | { | 601 | { |
602 | lexBuf.strsLen = 0; | 602 | lexBuf.strsLen = 0; |
603 | } | 603 | } |
604 | 604 | ||
605 | static void lexAppendc(int c) | 605 | static void lexAppendc(int c) |
606 | { | 606 | { |
607 | lexBuf.strs[lexBuf.strsLen] = c; | 607 | lexBuf.strs[lexBuf.strsLen] = c; |
608 | /* append up to zero termination */ | 608 | /* append up to zero termination */ |
609 | if (c == 0) return; | 609 | if (c == 0) return; |
610 | lexBuf.strsLen++; | 610 | lexBuf.strsLen++; |
611 | if (lexBuf.strsLen > lexBuf.maxToken) { | 611 | if (lexBuf.strsLen > lexBuf.maxToken) { |
612 | /* double the token string size */ | 612 | /* double the token string size */ |
613 | lexBuf.maxToken <<= 1; | 613 | lexBuf.maxToken <<= 1; |
614 | lexBuf.strs = (char*) realloc(lexBuf.strs,(size_t)lexBuf.maxToken); | 614 | lexBuf.strs = (char*) realloc(lexBuf.strs,(size_t)lexBuf.maxToken); |
615 | } | 615 | } |
616 | } | 616 | } |
617 | 617 | ||
618 | static char* lexStr() { | 618 | static char* lexStr() { |
619 | return dupStr(lexBuf.strs,(size_t)lexBuf.strsLen+1); | 619 | return dupStr(lexBuf.strs,(size_t)lexBuf.strsLen+1); |
620 | } | 620 | } |
621 | 621 | ||
622 | static void lexSkipWhite() { | 622 | static void lexSkipWhite() { |
623 | int c = lexLookahead(); | 623 | int c = lexLookahead(); |
624 | while (c == ' ' || c == '\t') { | 624 | while (c == ' ' || c == '\t') { |
625 | lexSkipLookahead(); | 625 | lexSkipLookahead(); |
626 | c = lexLookahead(); | 626 | c = lexLookahead(); |
627 | } | 627 | } |
628 | } | 628 | } |
629 | 629 | ||
630 | static char* lexGetWord() { | 630 | static char* lexGetWord() { |
631 | int c; | 631 | int c; |
632 | lexSkipWhite(); | 632 | lexSkipWhite(); |
633 | lexClearToken(); | 633 | lexClearToken(); |
634 | c = lexLookahead(); | 634 | c = lexLookahead(); |
635 | while (c != EOF && !strchr("\t\n ;:=",c)) { | 635 | while (c != EOF && !strchr("\t\n ;:=",c)) { |
636 | lexAppendc(c); | 636 | lexAppendc(c); |
637 | lexSkipLookahead(); | 637 | lexSkipLookahead(); |
638 | c = lexLookahead(); | 638 | c = lexLookahead(); |
639 | } | 639 | } |
640 | lexAppendc(0); | 640 | lexAppendc(0); |
641 | return lexStr(); | 641 | return lexStr(); |
642 | } | 642 | } |
643 | 643 | ||
644 | static void lexPushLookaheadc(int c) { | 644 | static void lexPushLookaheadc(int c) { |
645 | int putptr; | 645 | int putptr; |
646 | /* can't putback EOF, because it never leaves lookahead buffer */ | 646 | /* can't putback EOF, because it never leaves lookahead buffer */ |
647 | if (c == EOF) return; | 647 | if (c == EOF) return; |
648 | putptr = (int)lexBuf.getPtr - 1; | 648 | putptr = (int)lexBuf.getPtr - 1; |
649 | if (putptr < 0) putptr += MAX_LEX_LOOKAHEAD; | 649 | if (putptr < 0) putptr += MAX_LEX_LOOKAHEAD; |
650 | lexBuf.getPtr = putptr; | 650 | lexBuf.getPtr = putptr; |
651 | lexBuf.buf[putptr] = c; | 651 | lexBuf.buf[putptr] = c; |
652 | lexBuf.len += 1; | 652 | lexBuf.len += 1; |
653 | } | 653 | } |
654 | 654 | ||
655 | static char* lexLookaheadWord() { | 655 | static char* lexLookaheadWord() { |
656 | /* this function can lookahead word with max size of MAX_LEX_LOOKAHEAD_0 | 656 | /* this function can lookahead word with max size of MAX_LEX_LOOKAHEAD_0 |
657 | / and thing bigger than that will stop the lookahead and return 0; | 657 | / and thing bigger than that will stop the lookahead and return 0; |
658 | / leading white spaces are not recoverable. | 658 | / leading white spaces are not recoverable. |
659 | */ | 659 | */ |
660 | int c; | 660 | int c; |
661 | int len = 0; | 661 | int len = 0; |
662 | int curgetptr = 0; | 662 | int curgetptr = 0; |
663 | lexSkipWhite(); | 663 | lexSkipWhite(); |
664 | lexClearToken(); | 664 | lexClearToken(); |
665 | curgetptr = (int)lexBuf.getPtr;// remember! | 665 | curgetptr = (int)lexBuf.getPtr;// remember! |
666 | while (len < (MAX_LEX_LOOKAHEAD_0)) { | 666 | while (len < (MAX_LEX_LOOKAHEAD_0)) { |
667 | c = lexGetc(); | 667 | c = lexGetc(); |
668 | len++; | 668 | len++; |
669 | if (c == EOF || strchr("\t\n ;:=", c)) { | 669 | if (c == EOF || strchr("\t\n ;:=", c)) { |
670 | lexAppendc(0); | 670 | lexAppendc(0); |
671 | /* restore lookahead buf. */ | 671 | /* restore lookahead buf. */ |
672 | lexBuf.len += len; | 672 | lexBuf.len += len; |
673 | lexBuf.getPtr = curgetptr; | 673 | lexBuf.getPtr = curgetptr; |
674 | return lexStr(); | 674 | return lexStr(); |
675 | } | 675 | } |
676 | else | 676 | else |
677 | lexAppendc(c); | 677 | lexAppendc(c); |
678 | } | 678 | } |
679 | lexBuf.len += len;/* char that has been moved to lookahead buffer */ | 679 | lexBuf.len += len;/* char that has been moved to lookahead buffer */ |
680 | lexBuf.getPtr = curgetptr; | 680 | lexBuf.getPtr = curgetptr; |
681 | return 0; | 681 | return 0; |
682 | } | 682 | } |
683 | 683 | ||
684 | #ifdef _SUPPORT_LINE_FOLDING | 684 | #ifdef _SUPPORT_LINE_FOLDING |
685 | static void handleMoreRFC822LineBreak(int c) { | 685 | static void handleMoreRFC822LineBreak(int c) { |
686 | /* suport RFC 822 line break in cases like | 686 | /* suport RFC 822 line break in cases like |
687 | *ADR: foo; | 687 | *ADR: foo; |
688 | * morefoo; | 688 | * morefoo; |
689 | * more foo; | 689 | * more foo; |
690 | */ | 690 | */ |
691 | if (c == ';') { | 691 | if (c == ';') { |
692 | int a; | 692 | int a; |
693 | lexSkipLookahead(); | 693 | lexSkipLookahead(); |
694 | /* skip white spaces */ | 694 | /* skip white spaces */ |
695 | a = lexLookahead(); | 695 | a = lexLookahead(); |
696 | while (a == ' ' || a == '\t') { | 696 | while (a == ' ' || a == '\t') { |
697 | lexSkipLookahead(); | 697 | lexSkipLookahead(); |
698 | a = lexLookahead(); | 698 | a = lexLookahead(); |
699 | } | 699 | } |
700 | if (a == '\n') { | 700 | if (a == '\n') { |
701 | lexSkipLookahead(); | 701 | lexSkipLookahead(); |
702 | a = lexLookahead(); | 702 | a = lexLookahead(); |
703 | if (a == ' ' || a == '\t') { | 703 | if (a == ' ' || a == '\t') { |
704 | /* continuation, throw away all the \n and spaces read so | 704 | /* continuation, throw away all the \n and spaces read so |
705 | * far | 705 | * far |
706 | */ | 706 | */ |
707 | lexSkipWhite(); | 707 | lexSkipWhite(); |
708 | lexPushLookaheadc(';'); | 708 | lexPushLookaheadc(';'); |
709 | } | 709 | } |
710 | else { | 710 | else { |
711 | lexPushLookaheadc('\n'); | 711 | lexPushLookaheadc('\n'); |
712 | lexPushLookaheadc(';'); | 712 | lexPushLookaheadc(';'); |
713 | } | 713 | } |
714 | } | 714 | } |
715 | else { | 715 | else { |
716 | lexPushLookaheadc(';'); | 716 | lexPushLookaheadc(';'); |
717 | } | 717 | } |
718 | } | 718 | } |
719 | } | 719 | } |
720 | 720 | ||
721 | static char* lexGet1Value() { | 721 | static char* lexGet1Value() { |
722 | int c; | 722 | int c; |
723 | lexSkipWhite(); | 723 | lexSkipWhite(); |
724 | c = lexLookahead(); | 724 | c = lexLookahead(); |
725 | lexClearToken(); | 725 | lexClearToken(); |
726 | while (c != EOF && (c != ';' || !fieldedProp)) { | 726 | while (c != EOF && (c != ';' || !fieldedProp)) { |
727 | if (c == '\\' ) { | 727 | if (c == '\\' ) { |
728 | int a; | 728 | int a; |
729 | lexSkipLookahead(); | 729 | lexSkipLookahead(); |
730 | a = lexLookahead(); | 730 | a = lexLookahead(); |
731 | if ( a == ';' ) { | 731 | if ( a == ';' ) { |
732 | lexAppendc( ';' ); | 732 | lexAppendc( ';' ); |
733 | lexSkipLookahead(); | 733 | lexSkipLookahead(); |
734 | } else if ( a == '\n' ) { | 734 | } else if ( a == '\n' ) { |
735 | lexAppendc( '\n' ); | 735 | lexAppendc( '\n' ); |
736 | lexSkipLookahead(); | 736 | lexSkipLookahead(); |
737 | } else if ( a == '\\' ) { | 737 | } else if ( a == '\\' ) { |
738 | lexAppendc( '\\' ); | 738 | lexAppendc( '\\' ); |
739 | lexSkipLookahead(); | 739 | lexSkipLookahead(); |
740 | } else { | 740 | } else { |
741 | lexAppendc('\\'); | 741 | lexAppendc('\\'); |
742 | } | 742 | } |
743 | } else if (c == '\n') { | 743 | } else if (c == '\n') { |
744 | int a; | 744 | int a; |
745 | lexSkipLookahead(); | 745 | lexSkipLookahead(); |
746 | a = lexLookahead(); | 746 | a = lexLookahead(); |
747 | if (a == ' ' || a == '\t') { | 747 | if (a == ' ' || a == '\t') { |
748 | lexAppendc(' '); | 748 | lexAppendc(' '); |
749 | lexSkipLookahead(); | 749 | lexSkipLookahead(); |
750 | } | 750 | } |
751 | else { | 751 | else { |
752 | lexPushLookaheadc('\n'); | 752 | lexPushLookaheadc('\n'); |
753 | break; | 753 | break; |
754 | } | 754 | } |
755 | } | 755 | } |
756 | else { | 756 | else { |
757 | lexAppendc(c); | 757 | lexAppendc(c); |
758 | lexSkipLookahead(); | 758 | lexSkipLookahead(); |
759 | } | 759 | } |
760 | c = lexLookahead(); | 760 | c = lexLookahead(); |
761 | } | 761 | } |
762 | lexAppendc(0); | 762 | lexAppendc(0); |
763 | handleMoreRFC822LineBreak(c); | 763 | handleMoreRFC822LineBreak(c); |
764 | return c==EOF?0:lexStr(); | 764 | return c==EOF?0:lexStr(); |
765 | } | 765 | } |
766 | #endif | 766 | #endif |
767 | 767 | ||
768 | static int match_begin_name(int end) { | 768 | static int match_begin_name(int end) { |
769 | char *n = lexLookaheadWord(); | 769 | char *n = lexLookaheadWord(); |
770 | int token = ID; | 770 | int token = ID; |
771 | if (n) { | 771 | if (n) { |
772 | if (!qstricmp(n,"vcard")) token = end?END_VCARD:BEGIN_VCARD; | 772 | if (!qstricmp(n,"vcard")) token = end?END_VCARD:BEGIN_VCARD; |
773 | else if (!qstricmp(n,"vcalendar")) token = end?END_VCAL:BEGIN_VCAL; | 773 | else if (!qstricmp(n,"vcalendar")) token = end?END_VCAL:BEGIN_VCAL; |
774 | else if (!qstricmp(n,"vevent")) token = end?END_VEVENT:BEGIN_VEVENT; | 774 | else if (!qstricmp(n,"vevent")) token = end?END_VEVENT:BEGIN_VEVENT; |
775 | else if (!qstricmp(n,"vtodo")) token = end?END_VTODO:BEGIN_VTODO; | 775 | else if (!qstricmp(n,"vtodo")) token = end?END_VTODO:BEGIN_VTODO; |
776 | deleteStr(n); | 776 | deleteStr(n); |
777 | return token; | 777 | return token; |
778 | } | 778 | } |
779 | return 0; | 779 | return 0; |
780 | } | 780 | } |
781 | 781 | ||
782 | 782 | ||
783 | #ifdef INCLUDEMFC | 783 | #ifdef INCLUDEMFC |
784 | void initLex(const char *inputstring, unsigned long inputlen, CFile *inputfile) | 784 | void initLex(const char *inputstring, unsigned long inputlen, CFile *inputfile) |
785 | #else | 785 | #else |
786 | void initLex(const char *inputstring, unsigned long inputlen, FILE *inputfile) | 786 | void initLex(const char *inputstring, unsigned long inputlen, FILE *inputfile) |
787 | #endif | 787 | #endif |
788 | { | 788 | { |
789 | // initialize lex mode stack | 789 | // initialize lex mode stack |
790 | lexBuf.lexModeStack[lexBuf.lexModeStackTop=0] = L_NORMAL; | 790 | lexBuf.lexModeStack[lexBuf.lexModeStackTop=0] = L_NORMAL; |
791 | 791 | ||
792 | // iniatialize lex buffer. | 792 | // iniatialize lex buffer. |
793 | lexBuf.inputString = (char*) inputstring; | 793 | lexBuf.inputString = (char*) inputstring; |
794 | lexBuf.inputLen = inputlen; | 794 | lexBuf.inputLen = inputlen; |
795 | lexBuf.curPos = 0; | 795 | lexBuf.curPos = 0; |
796 | lexBuf.inputFile = inputfile; | 796 | lexBuf.inputFile = inputfile; |
797 | 797 | ||
798 | lexBuf.len = 0; | 798 | lexBuf.len = 0; |
799 | lexBuf.getPtr = 0; | 799 | lexBuf.getPtr = 0; |
800 | 800 | ||
801 | lexBuf.maxToken = MAXTOKEN; | 801 | lexBuf.maxToken = MAXTOKEN; |
802 | lexBuf.strs = (char*)malloc(MAXTOKEN); | 802 | lexBuf.strs = (char*)malloc(MAXTOKEN); |
803 | lexBuf.strsLen = 0; | 803 | lexBuf.strsLen = 0; |
804 | 804 | ||
805 | } | 805 | } |
806 | 806 | ||
807 | static void finiLex() { | 807 | static void finiLex() { |
808 | free(lexBuf.strs); | 808 | free(lexBuf.strs); |
809 | } | 809 | } |
810 | 810 | ||
811 | 811 | ||
812 | /*-----------------------------------*/ | 812 | /*-----------------------------------*/ |
813 | /* This parses and converts the base64 format for binary encoding into | 813 | /* This parses and converts the base64 format for binary encoding into |
814 | * a decoded buffer (allocated with new). See RFC 1521. | 814 | * a decoded buffer (allocated with new). See RFC 1521. |
815 | */ | 815 | */ |
816 | static int lexGetDataFromBase64() | 816 | static int lexGetDataFromBase64() |
817 | { | 817 | { |
818 | unsigned long bytesLen = 0, bytesMax = 0; | 818 | unsigned long bytesLen = 0, bytesMax = 0; |
819 | int quadIx = 0, pad = 0; | 819 | int quadIx = 0, pad = 0; |
820 | unsigned long trip = 0; | 820 | unsigned long trip = 0; |
821 | unsigned char b; | 821 | unsigned char b; |
822 | int c; | 822 | int c; |
823 | unsigned char *bytes = NULL; | 823 | unsigned char *bytes = NULL; |
824 | unsigned char *oldBytes = NULL; | 824 | unsigned char *oldBytes = NULL; |
825 | 825 | ||
826 | DBG_(("db: lexGetDataFromBase64\n")); | 826 | DBG_(("db: lexGetDataFromBase64\n")); |
827 | while (1) { | 827 | while (1) { |
828 | c = lexGetc(); | 828 | c = lexGetc(); |
829 | lexSkipWhite(); | 829 | lexSkipWhite(); |
830 | if (c == '\n') { | 830 | if (c == '\n') { |
831 | ++mime_lineNum; | 831 | ++mime_lineNum; |
832 | if (lexLookahead() == '\n') { | 832 | if (lexLookahead() == '\n') { |
833 | /* a '\n' character by itself means end of data */ | 833 | /* a '\n' character by itself means end of data */ |
834 | break; | 834 | break; |
835 | } | 835 | } |
836 | else continue; /* ignore '\n' */ | 836 | else continue; /* ignore '\n' */ |
837 | } | 837 | } |
838 | else { | 838 | else { |
839 | if ((c >= 'A') && (c <= 'Z')) | 839 | if ((c >= 'A') && (c <= 'Z')) |
840 | b = (unsigned char)(c - 'A'); | 840 | b = (unsigned char)(c - 'A'); |
841 | else if ((c >= 'a') && (c <= 'z')) | 841 | else if ((c >= 'a') && (c <= 'z')) |
842 | b = (unsigned char)(c - 'a') + 26; | 842 | b = (unsigned char)(c - 'a') + 26; |
843 | else if ((c >= '0') && (c <= '9')) | 843 | else if ((c >= '0') && (c <= '9')) |
844 | b = (unsigned char)(c - '0') + 52; | 844 | b = (unsigned char)(c - '0') + 52; |
845 | else if (c == '+') | 845 | else if (c == '+') |
846 | b = 62; | 846 | b = 62; |
847 | else if (c == '/') | 847 | else if (c == '/') |
848 | b = 63; | 848 | b = 63; |
849 | else if (c == '=') { | 849 | else if (c == '=') { |
850 | b = 0; | 850 | b = 0; |
851 | pad++; | 851 | pad++; |
852 | } else { /* error condition */ | 852 | } else { /* error condition */ |
853 | if (bytes) free(bytes); | 853 | if (bytes) free(bytes); |
854 | else if (oldBytes) free(oldBytes); | 854 | else if (oldBytes) free(oldBytes); |
855 | // error recovery: skip until 2 adjacent newlines. | 855 | // error recovery: skip until 2 adjacent newlines. |
856 | DBG_(("db: invalid character 0x%x '%c'\n", c,c)); | 856 | DBG_(("db: invalid character 0x%x '%c'\n", c,c)); |
857 | if (c != EOF) { | 857 | if (c != EOF) { |
858 | c = lexGetc(); | 858 | c = lexGetc(); |
859 | while (c != EOF) { | 859 | while (c != EOF) { |
860 | if (c == '\n') { | 860 | if (c == '\n') { |
861 | lexSkipWhite(); | 861 | lexSkipWhite(); |
862 | if(lexLookahead() == '\n') { | 862 | if(lexLookahead() == '\n') { |
863 | ++mime_lineNum; | 863 | ++mime_lineNum; |
864 | break; | 864 | break; |
865 | } | 865 | } |
866 | } | 866 | } |
867 | c = lexGetc(); | 867 | c = lexGetc(); |
868 | } | 868 | } |
869 | } | 869 | } |
870 | return c != EOF; | 870 | return c != EOF; |
871 | } | 871 | } |
872 | trip = (trip << 6) | b; | 872 | trip = (trip << 6) | b; |
873 | if (++quadIx == 4) { | 873 | if (++quadIx == 4) { |
874 | unsigned char outBytes[3]; | 874 | unsigned char outBytes[3]; |
875 | int numOut; | 875 | int numOut; |
876 | int i; | 876 | int i; |
877 | for (i = 0; i < 3; i++) { | 877 | for (i = 0; i < 3; i++) { |
878 | outBytes[2-i] = (unsigned char)(trip & 0xFF); | 878 | outBytes[2-i] = (unsigned char)(trip & 0xFF); |
879 | trip >>= 8; | 879 | trip >>= 8; |
880 | } | 880 | } |
881 | numOut = 3 - pad; | 881 | numOut = 3 - pad; |
882 | if (bytesLen + numOut > bytesMax) { | 882 | if (bytesLen + numOut > bytesMax) { |
883 | if (!bytes) { | 883 | if (!bytes) { |
884 | bytesMax = 1024; | 884 | bytesMax = 1024; |
885 | bytes = (unsigned char*)malloc((size_t)bytesMax); | 885 | bytes = (unsigned char*)malloc((size_t)bytesMax); |
886 | } | 886 | } |
887 | else { | 887 | else { |
888 | bytesMax <<= 2; | 888 | bytesMax <<= 2; |
889 | oldBytes = bytes; | 889 | oldBytes = bytes; |
890 | bytes = (unsigned char*)realloc(bytes,(size_t)bytesMax); | 890 | bytes = (unsigned char*)realloc(bytes,(size_t)bytesMax); |
891 | } | 891 | } |
892 | if (bytes == 0) { | 892 | if (bytes == 0) { |
893 | mime_error("out of memory while processing BASE64 data\n"); | 893 | mime_error("out of memory while processing BASE64 data\n"); |
894 | } | 894 | } |
895 | } | 895 | } |
896 | if (bytes) { | 896 | if (bytes) { |
897 | memcpy(bytes + bytesLen, outBytes, numOut); | 897 | memcpy(bytes + bytesLen, outBytes, numOut); |
898 | bytesLen += numOut; | 898 | bytesLen += numOut; |
899 | } | 899 | } |
900 | trip = 0; | 900 | trip = 0; |
901 | quadIx = 0; | 901 | quadIx = 0; |
902 | } | 902 | } |
903 | } | 903 | } |
904 | } /* while */ | 904 | } /* while */ |
905 | DBG_(("db: bytesLen = %d\n", bytesLen)); | 905 | DBG_(("db: bytesLen = %d\n", bytesLen)); |
906 | /* kludge: all this won't be necessary if we have tree form | 906 | /* kludge: all this won't be necessary if we have tree form |
907 | representation */ | 907 | representation */ |
908 | if (bytes) { | 908 | if (bytes) { |
909 | setValueWithSize(curProp,bytes,(unsigned int)bytesLen); | 909 | setValueWithSize(curProp,bytes,(unsigned int)bytesLen); |
910 | free(bytes); | 910 | free(bytes); |
911 | } | 911 | } |
912 | else if (oldBytes) { | 912 | else if (oldBytes) { |
913 | setValueWithSize(curProp,oldBytes,(unsigned int)bytesLen); | 913 | setValueWithSize(curProp,oldBytes,(unsigned int)bytesLen); |
914 | free(oldBytes); | 914 | free(oldBytes); |
915 | } | 915 | } |
916 | return bytesLen; | 916 | return bytesLen; |
917 | } | 917 | } |
918 | 918 | ||
919 | static int match_begin_end_name(int end) { | 919 | static int match_begin_end_name(int end) { |
920 | int token; | 920 | int token; |
921 | lexSkipWhite(); | 921 | lexSkipWhite(); |
922 | if (lexLookahead() != ':') return ID; | 922 | if (lexLookahead() != ':') return ID; |
923 | lexSkipLookahead(); | 923 | lexSkipLookahead(); |
924 | lexSkipWhite(); | 924 | lexSkipWhite(); |
925 | token = match_begin_name(end); | 925 | token = match_begin_name(end); |
926 | if (token == ID) { | 926 | if (token == ID) { |
927 | lexPushLookaheadc(':'); | 927 | lexPushLookaheadc(':'); |
928 | DBG_(("db: ID '%s'\n", yylval.str)); | 928 | DBG_(("db: ID '%s'\n", yylval.str)); |
929 | return ID; | 929 | return ID; |
930 | } | 930 | } |
931 | else if (token != 0) { | 931 | else if (token != 0) { |
932 | lexSkipLookaheadWord(); | 932 | lexSkipLookaheadWord(); |
933 | deleteStr(yylval.str); | 933 | deleteStr(yylval.str); |
934 | DBG_(("db: begin/end %d\n", token)); | 934 | DBG_(("db: begin/end %d\n", token)); |
935 | return token; | 935 | return token; |
936 | } | 936 | } |
937 | return 0; | 937 | return 0; |
938 | } | 938 | } |
939 | 939 | ||
940 | static char* lexGetQuotedPrintable() | 940 | static char* lexGetQuotedPrintable() |
941 | { | 941 | { |
942 | int c; | 942 | int c; |
943 | lexSkipWhite(); | 943 | lexSkipWhite(); |
944 | c = lexLookahead(); | 944 | c = lexLookahead(); |
945 | lexClearToken(); | 945 | lexClearToken(); |
946 | 946 | ||
947 | while (c != EOF && (c != ';' || !fieldedProp)) { | 947 | while (c != EOF && (c != ';' || !fieldedProp)) { |
948 | if (c == '\n') { | 948 | if (c == '\n') { |
949 | // break, leave '\n' on remaining chars. | 949 | // break, leave '\n' on remaining chars. |
950 | break; | 950 | break; |
951 | } else if (c == '=') { | 951 | } else if (c == '=') { |
952 | int cur = 0; | 952 | int cur = 0; |
953 | int next; | 953 | int next; |
954 | 954 | ||
955 | lexSkipLookahead(); // skip '=' | 955 | lexSkipLookahead(); // skip '=' |
956 | next = lexLookahead(); | 956 | next = lexLookahead(); |
957 | 957 | ||
958 | if (next == '\n') { | 958 | if (next == '\n') { |
959 | // skip and only skip the \n | 959 | // skip and only skip the \n |
960 | lexSkipLookahead(); | 960 | lexSkipLookahead(); |
961 | c = lexLookahead(); | 961 | c = lexLookahead(); |
962 | ++mime_lineNum; // aid in error reporting | 962 | ++mime_lineNum; // aid in error reporting |
963 | continue; | 963 | continue; |
964 | } else if (next >= '0' && next <= '9') { | 964 | } else if (next >= '0' && next <= '9') { |
965 | cur = next - '0'; | 965 | cur = next - '0'; |
966 | } else if (next >= 'A' && next <= 'F') { | 966 | } else if (next >= 'A' && next <= 'F') { |
967 | cur = next - 'A' + 10; | 967 | cur = next - 'A' + 10; |
968 | } else { | 968 | } else { |
969 | // we have been sent buggy stuff. doesn't matter | 969 | // we have been sent buggy stuff. doesn't matter |
970 | // what we do so long as we keep going. | 970 | // what we do so long as we keep going. |
971 | // should probably spit an error here | 971 | // should probably spit an error here |
972 | lexSkipLookahead(); | 972 | lexSkipLookahead(); |
973 | c = lexLookahead(); | 973 | c = lexLookahead(); |
974 | continue; | 974 | continue; |
975 | } | 975 | } |
976 | 976 | ||
977 | lexSkipLookahead(); // skip A-Z0-9 | 977 | lexSkipLookahead(); // skip A-Z0-9 |
978 | next = lexLookahead(); | 978 | next = lexLookahead(); |
979 | 979 | ||
980 | cur = cur * 16; | 980 | cur = cur * 16; |
981 | // this time really just expecting 0-9A-F | 981 | // this time really just expecting 0-9A-F |
982 | if (next >= '0' && next <= '9') { | 982 | if (next >= '0' && next <= '9') { |
983 | cur += next - '0'; | 983 | cur += next - '0'; |
984 | } else if (next >= 'A' && next <= 'F') { | 984 | } else if (next >= 'A' && next <= 'F') { |
985 | cur += next - 'A' + 10; | 985 | cur += next - 'A' + 10; |
986 | } else { | 986 | } else { |
987 | // we have been sent buggy stuff. doesn't matter | 987 | // we have been sent buggy stuff. doesn't matter |
988 | // what we do so long as we keep going. | 988 | // what we do so long as we keep going. |
989 | // should probably spit an error here | 989 | // should probably spit an error here |
990 | lexSkipLookahead(); | 990 | lexSkipLookahead(); |
991 | c = lexLookahead(); | 991 | c = lexLookahead(); |
992 | continue; | 992 | continue; |
993 | } | 993 | } |
994 | 994 | ||
995 | // got a valid escaped =. append it. | 995 | // got a valid escaped =. append it. |
996 | lexSkipLookahead(); // skip second 0-9A-F | 996 | lexSkipLookahead(); // skip second 0-9A-F |
997 | lexAppendc(cur); | 997 | lexAppendc(cur); |
998 | } else { | 998 | } else { |
999 | lexSkipLookahead(); // skip whatever we just read. | 999 | lexSkipLookahead(); // skip whatever we just read. |
1000 | lexAppendc(c); // and append it. | 1000 | lexAppendc(c); // and append it. |
1001 | } | 1001 | } |
1002 | c = lexLookahead(); | 1002 | c = lexLookahead(); |
1003 | } | 1003 | } |
1004 | lexAppendc(0); | 1004 | lexAppendc(0); |
1005 | return c==EOF?0:lexStr(); | 1005 | return c==EOF?0:lexStr(); |
1006 | } | 1006 | } |
1007 | 1007 | ||
1008 | static int yylex() { | 1008 | static int yylex() { |
1009 | 1009 | ||
1010 | int lexmode = LEXMODE(); | 1010 | int lexmode = LEXMODE(); |
1011 | if (lexmode == L_VALUES) { | 1011 | if (lexmode == L_VALUES) { |
1012 | int c = lexGetc(); | 1012 | int c = lexGetc(); |
1013 | if (c == ';' && fieldedProp) { | 1013 | if (c == ';' && fieldedProp) { |
1014 | DBG_(("db: SEMICOLON\n")); | 1014 | DBG_(("db: SEMICOLON\n")); |
1015 | lexPushLookaheadc(c); | 1015 | lexPushLookaheadc(c); |
1016 | handleMoreRFC822LineBreak(c); | 1016 | handleMoreRFC822LineBreak(c); |
1017 | lexSkipLookahead(); | 1017 | lexSkipLookahead(); |
1018 | return SEMICOLON; | 1018 | return SEMICOLON; |
1019 | } | 1019 | } |
1020 | else if (strchr("\n",c)) { | 1020 | else if (strchr("\n",c)) { |
1021 | ++mime_lineNum; | 1021 | ++mime_lineNum; |
1022 | /* consume all line separator(s) adjacent to each other */ | 1022 | /* consume all line separator(s) adjacent to each other */ |
1023 | c = lexLookahead(); | 1023 | c = lexLookahead(); |
1024 | while (strchr("\n",c)) { | 1024 | while (strchr("\n",c)) { |
1025 | lexSkipLookahead(); | 1025 | lexSkipLookahead(); |
1026 | c = lexLookahead(); | 1026 | c = lexLookahead(); |
1027 | ++mime_lineNum; | 1027 | ++mime_lineNum; |
1028 | } | 1028 | } |
1029 | DBG_(("db: LINESEP\n")); | 1029 | DBG_(("db: LINESEP\n")); |
1030 | return LINESEP; | 1030 | return LINESEP; |
1031 | } | 1031 | } |
1032 | else { | 1032 | else { |
1033 | char *p = 0; | 1033 | char *p = 0; |
1034 | lexPushLookaheadc(c); | 1034 | lexPushLookaheadc(c); |
1035 | if (lexWithinMode(L_BASE64)) { | 1035 | if (lexWithinMode(L_BASE64)) { |
1036 | /* get each char and convert to bin on the fly... */ | 1036 | /* get each char and convert to bin on the fly... */ |
1037 | yylval.str = NULL; | 1037 | yylval.str = NULL; |
1038 | return lexGetDataFromBase64() ? STRING : 0; | 1038 | return lexGetDataFromBase64() ? STRING : 0; |
1039 | } | 1039 | } |
1040 | else if (lexWithinMode(L_QUOTED_PRINTABLE)) { | 1040 | else if (lexWithinMode(L_QUOTED_PRINTABLE)) { |
1041 | p = lexGetQuotedPrintable(); | 1041 | p = lexGetQuotedPrintable(); |
1042 | } | 1042 | } |
1043 | else { | 1043 | else { |
1044 | #ifdef _SUPPORT_LINE_FOLDING | 1044 | #ifdef _SUPPORT_LINE_FOLDING |
1045 | p = lexGet1Value(); | 1045 | p = lexGet1Value(); |
1046 | #else | 1046 | #else |
1047 | p = lexGetStrUntil(";\n"); | 1047 | p = lexGetStrUntil(";\n"); |
1048 | #endif | 1048 | #endif |
1049 | } | 1049 | } |
1050 | if (p) { | 1050 | if (p) { |
1051 | DBG_(("db: STRING: '%s'\n", p)); | 1051 | DBG_(("db: STRING: '%s'\n", p)); |
1052 | yylval.str = p; | 1052 | yylval.str = p; |
1053 | return STRING; | 1053 | return STRING; |
1054 | } | 1054 | } |
1055 | else return 0; | 1055 | else return 0; |
1056 | } | 1056 | } |
1057 | } | 1057 | } |
1058 | else { | 1058 | else { |
1059 | /* normal mode */ | 1059 | /* normal mode */ |
1060 | while (1) { | 1060 | while (1) { |
1061 | int c = lexGetc(); | 1061 | int c = lexGetc(); |
1062 | switch(c) { | 1062 | switch(c) { |
1063 | case ':': { | 1063 | case ':': { |
1064 | /* consume all line separator(s) adjacent to each other */ | 1064 | /* consume all line separator(s) adjacent to each other */ |
1065 | /* ignoring linesep immediately after colon. */ | 1065 | /* ignoring linesep immediately after colon. */ |
1066 | /* I don't see this in the spec, and it breaks null values -- WA | 1066 | /* I don't see this in the spec, and it breaks null values -- WA |
1067 | c = lexLookahead(); | 1067 | c = lexLookahead(); |
1068 | while (strchr("\n",c)) { | 1068 | while (strchr("\n",c)) { |
1069 | lexSkipLookahead(); | 1069 | lexSkipLookahead(); |
1070 | c = lexLookahead(); | 1070 | c = lexLookahead(); |
1071 | ++mime_lineNum; | 1071 | ++mime_lineNum; |
1072 | } | 1072 | } |
1073 | */ | 1073 | */ |
1074 | DBG_(("db: COLON\n")); | 1074 | DBG_(("db: COLON\n")); |
1075 | return COLON; | 1075 | return COLON; |
1076 | } | 1076 | } |
1077 | case ';': | 1077 | case ';': |
1078 | DBG_(("db: SEMICOLON\n")); | 1078 | DBG_(("db: SEMICOLON\n")); |
1079 | return SEMICOLON; | 1079 | return SEMICOLON; |
1080 | case '=': | 1080 | case '=': |
1081 | DBG_(("db: EQ\n")); | 1081 | DBG_(("db: EQ\n")); |
1082 | return EQ; | 1082 | return EQ; |
1083 | /* ignore whitespace in this mode */ | 1083 | /* ignore whitespace in this mode */ |
1084 | case '\t': | 1084 | case '\t': |
1085 | case ' ': continue; | 1085 | case ' ': continue; |
1086 | case '\n': { | 1086 | case '\n': { |
1087 | ++mime_lineNum; | 1087 | ++mime_lineNum; |
1088 | continue; | 1088 | continue; |
1089 | } | 1089 | } |
1090 | case EOF: return 0; | 1090 | case EOF: return 0; |
1091 | break; | 1091 | break; |
1092 | default: { | 1092 | default: { |
1093 | lexPushLookaheadc(c); | 1093 | lexPushLookaheadc(c); |
1094 | if (isalnum(c)) { | 1094 | if (isalnum(c)) { |
1095 | char *t = lexGetWord(); | 1095 | char *t = lexGetWord(); |
1096 | yylval.str = t; | 1096 | yylval.str = t; |
1097 | if (!qstricmp(t, "begin")) { | 1097 | if (!qstricmp(t, "begin")) { |
1098 | return match_begin_end_name(0); | 1098 | return match_begin_end_name(0); |
1099 | } | 1099 | } |
1100 | else if (!qstricmp(t,"end")) { | 1100 | else if (!qstricmp(t,"end")) { |
1101 | return match_begin_end_name(1); | 1101 | return match_begin_end_name(1); |
1102 | } | 1102 | } |
1103 | else { | 1103 | else { |
1104 | DBG_(("db: ID '%s'\n", t)); | 1104 | DBG_(("db: ID '%s'\n", t)); |
1105 | return ID; | 1105 | return ID; |
1106 | } | 1106 | } |
1107 | } | 1107 | } |
1108 | else { | 1108 | else { |
1109 | /* unknow token */ | 1109 | /* unknow token */ |
1110 | return 0; | 1110 | return 0; |
1111 | } | 1111 | } |
1112 | break; | 1112 | break; |
1113 | } | 1113 | } |
1114 | } | 1114 | } |
1115 | } | 1115 | } |
1116 | } | 1116 | } |
1117 | return 0; | 1117 | return 0; |
1118 | } | 1118 | } |
1119 | 1119 | ||
1120 | 1120 | ||
1121 | /***************************************************************************/ | 1121 | /***************************************************************************/ |
1122 | /*** Public Functions ****/ | 1122 | /*** Public Functions ****/ |
1123 | /***************************************************************************/ | 1123 | /***************************************************************************/ |
1124 | 1124 | ||
1125 | static VObject* Parse_MIMEHelper() | 1125 | static VObject* Parse_MIMEHelper() |
1126 | { | 1126 | { |
1127 | ObjStackTop = -1; | 1127 | ObjStackTop = -1; |
1128 | mime_numErrors = 0; | 1128 | mime_numErrors = 0; |
1129 | mime_lineNum = 1; | 1129 | mime_lineNum = 1; |
1130 | vObjList = 0; | 1130 | vObjList = 0; |
1131 | curObj = 0; | 1131 | curObj = 0; |
1132 | 1132 | ||
1133 | if (yyparse() != 0) | 1133 | if (yyparse() != 0) |
1134 | return 0; | 1134 | return 0; |
1135 | 1135 | ||
1136 | finiLex(); | 1136 | finiLex(); |
1137 | return vObjList; | 1137 | return vObjList; |
1138 | } | 1138 | } |
1139 | 1139 | ||
1140 | /*--------------------------------------------*/ | 1140 | /*--------------------------------------------*/ |
1141 | DLLEXPORT(VObject*) Parse_MIME(const char *input, unsigned long len) | 1141 | DLLEXPORT(VObject*) Parse_MIME(const char *input, unsigned long len) |
1142 | { | 1142 | { |
1143 | initLex(input, len, 0); | 1143 | initLex(input, len, 0); |
1144 | return Parse_MIMEHelper(); | 1144 | return Parse_MIMEHelper(); |
1145 | } | 1145 | } |
1146 | 1146 | ||
1147 | 1147 | ||
1148 | #if INCLUDEMFC | 1148 | #if INCLUDEMFC |
1149 | 1149 | ||
1150 | DLLEXPORT(VObject*) Parse_MIME_FromFile(CFile *file) | 1150 | DLLEXPORT(VObject*) Parse_MIME_FromFile(CFile *file) |
1151 | { | 1151 | { |
1152 | unsigned long startPos; | 1152 | unsigned long startPos; |
1153 | VObject *result; | 1153 | VObject *result; |
1154 | 1154 | ||
1155 | initLex(0,-1,file); | 1155 | initLex(0,-1,file); |
1156 | startPos = file->GetPosition(); | 1156 | startPos = file->GetPosition(); |
1157 | if (!(result = Parse_MIMEHelper())) | 1157 | if (!(result = Parse_MIMEHelper())) |
1158 | file->Seek(startPos, CFile::begin); | 1158 | file->Seek(startPos, CFile::begin); |
1159 | return result; | 1159 | return result; |
1160 | } | 1160 | } |
1161 | 1161 | ||
1162 | #else | 1162 | #else |
1163 | 1163 | ||
1164 | VObject* Parse_MIME_FromFile(FILE *file) | 1164 | VObject* Parse_MIME_FromFile(FILE *file) |
1165 | { | 1165 | { |
1166 | VObject *result; | 1166 | VObject *result; |
1167 | long startPos; | 1167 | long startPos; |
1168 | 1168 | ||
1169 | initLex(0,(unsigned long)-1,file); | 1169 | initLex(0,(unsigned long)-1,file); |
1170 | startPos = ftell(file); | 1170 | startPos = ftell(file); |
1171 | if (!(result = Parse_MIMEHelper())) { | 1171 | if (!(result = Parse_MIMEHelper())) { |
1172 | fseek(file,startPos,SEEK_SET); | 1172 | fseek(file,startPos,SEEK_SET); |
1173 | } | 1173 | } |
1174 | return result; | 1174 | return result; |
1175 | } | 1175 | } |
1176 | 1176 | ||
1177 | DLLEXPORT(VObject*) Parse_MIME_FromFileName(char *fname) | 1177 | DLLEXPORT(VObject*) Parse_MIME_FromFileName(char *fname) |
1178 | { | 1178 | { |
1179 | FILE *fp = fopen(fname,"r"); | 1179 | FILE *fp = fopen(fname,"r"); |
1180 | if (fp) { | 1180 | if (fp) { |
1181 | VObject* o = Parse_MIME_FromFile(fp); | 1181 | VObject* o = Parse_MIME_FromFile(fp); |
1182 | fclose(fp); | 1182 | fclose(fp); |
1183 | return o; | 1183 | return o; |
1184 | } | 1184 | } |
1185 | else { | 1185 | else { |
1186 | char msg[80]; | 1186 | char msg[80]; |
1187 | sprintf(msg, "can't open file '%s' for reading\n", fname); | 1187 | sprintf(msg, "can't open file '%s' for reading\n", fname); |
1188 | mime_error_(msg); | 1188 | mime_error_(msg); |
1189 | return 0; | 1189 | return 0; |
1190 | } | 1190 | } |
1191 | } | 1191 | } |
1192 | 1192 | ||
1193 | #endif | 1193 | #endif |
1194 | 1194 | ||
1195 | /*-------------------------------------*/ | 1195 | /*-------------------------------------*/ |
1196 | 1196 | ||
1197 | static MimeErrorHandler mimeErrorHandler; | 1197 | static MimeErrorHandler mimeErrorHandler; |
1198 | 1198 | ||
1199 | DLLEXPORT(void) registerMimeErrorHandler(MimeErrorHandler me) | 1199 | DLLEXPORT(void) registerMimeErrorHandler(MimeErrorHandler me) |
1200 | { | 1200 | { |
1201 | mimeErrorHandler = me; | 1201 | mimeErrorHandler = me; |
1202 | } | 1202 | } |
1203 | 1203 | ||
1204 | void mime_error(char *s) | 1204 | void mime_error(char *s) |
1205 | { | 1205 | { |
1206 | char msg[256]; | 1206 | char msg[256]; |
1207 | if (mimeErrorHandler) { | 1207 | if (mimeErrorHandler) { |
1208 | sprintf(msg,"%s at line %d", s, mime_lineNum); | 1208 | sprintf(msg,"%s at line %d", s, mime_lineNum); |
1209 | mimeErrorHandler(msg); | 1209 | mimeErrorHandler(msg); |
1210 | } | 1210 | } |
1211 | } | 1211 | } |
1212 | 1212 | ||
1213 | void mime_error_(char *s) | 1213 | void mime_error_(char *s) |
1214 | { | 1214 | { |
1215 | if (mimeErrorHandler) { | 1215 | if (mimeErrorHandler) { |
1216 | mimeErrorHandler(s); | 1216 | mimeErrorHandler(s); |
1217 | } | 1217 | } |
1218 | } | 1218 | } |
1219 | 1219 | ||