author | zautrix <zautrix> | 2004-06-29 11:59:46 (UTC) |
---|---|---|
committer | zautrix <zautrix> | 2004-06-29 11:59:46 (UTC) |
commit | da43dbdc6c82453228f34766fc74585615cba938 (patch) (unidiff) | |
tree | 16576932cea08bf117b2d0320b0d5f66ee8ad093 /libkcal/versit | |
parent | 627489ea2669d3997676bc3cee0f5d0d0c16c4d4 (diff) | |
download | kdepimpi-da43dbdc6c82453228f34766fc74585615cba938.zip kdepimpi-da43dbdc6c82453228f34766fc74585615cba938.tar.gz kdepimpi-da43dbdc6c82453228f34766fc74585615cba938.tar.bz2 |
New lib ical.Some minor changes as well.
-rw-r--r-- | libkcal/versit/port.h | 109 | ||||
-rw-r--r-- | libkcal/versit/vcc.c | 1817 | ||||
-rw-r--r-- | libkcal/versit/vcc.h | 12 | ||||
-rw-r--r-- | libkcal/versit/vobject.c | 363 | ||||
-rw-r--r-- | libkcal/versit/vobject.h | 173 |
5 files changed, 1327 insertions, 1147 deletions
diff --git a/libkcal/versit/port.h b/libkcal/versit/port.h index afc16dd..1768bee 100644 --- a/libkcal/versit/port.h +++ b/libkcal/versit/port.h | |||
@@ -1,73 +1,86 @@ | |||
1 | /*************************************************************************** | 1 | /*************************************************************************** |
2 | (C) Copyright 1996 Apple Computer, Inc., AT&T Corp., International | 2 | (C) Copyright 1996 Apple Computer, Inc., AT&T Corp., International |
3 | Business Machines Corporation and Siemens Rolm Communications Inc. | 3 | Business Machines Corporation and Siemens Rolm Communications Inc. |
4 | 4 | ||
5 | For purposes of this license notice, the term Licensors shall mean, | 5 | For purposes of this license notice, the term Licensors shall mean, |
6 | collectively, Apple Computer, Inc., AT&T Corp., International | 6 | collectively, Apple Computer, Inc., AT&T Corp., International |
7 | Business Machines Corporation and Siemens Rolm Communications Inc. | 7 | Business Machines Corporation and Siemens Rolm Communications Inc. |
8 | The term Licensor shall mean any of the Licensors. | 8 | The term Licensor shall mean any of the Licensors. |
9 | 9 | ||
10 | Subject to acceptance of the following conditions, permission is hereby | 10 | Subject to acceptance of the following conditions, permission is hereby |
11 | granted by Licensors without the need for written agreement and without | 11 | granted by Licensors without the need for written agreement and without |
12 | license or royalty fees, to use, copy, modify and distribute this | 12 | license or royalty fees, to use, copy, modify and distribute this |
13 | software for any purpose. | 13 | software for any purpose. |
14 | 14 | ||
15 | The above copyright notice and the following four paragraphs must be | 15 | The above copyright notice and the following four paragraphs must be |
16 | reproduced in all copies of this software and any software including | 16 | reproduced in all copies of this software and any software including |
17 | this software. | 17 | this software. |
18 | 18 | ||
19 | THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS AND NO LICENSOR SHALL HAVE | 19 | THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS AND NO LICENSOR SHALL HAVE |
20 | ANY OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS OR | 20 | ANY OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS OR |
21 | MODIFICATIONS. | 21 | MODIFICATIONS. |
22 | 22 | ||
23 | IN NO EVENT SHALL ANY LICENSOR BE LIABLE TO ANY PARTY FOR DIRECT, | 23 | IN NO EVENT SHALL ANY LICENSOR BE LIABLE TO ANY PARTY FOR DIRECT, |
24 | INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES OR LOST PROFITS ARISING OUT | 24 | INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES OR LOST PROFITS ARISING OUT |
25 | OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH | 25 | OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH |
26 | DAMAGE. | 26 | DAMAGE. |
27 | 27 | ||
28 | EACH LICENSOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED, | 28 | EACH LICENSOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED, |
29 | INCLUDING BUT NOT LIMITED TO ANY WARRANTY OF NONINFRINGEMENT OR THE | 29 | INCLUDING BUT NOT LIMITED TO ANY WARRANTY OF NONINFRINGEMENT OR THE |
30 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 30 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
31 | PURPOSE. | 31 | PURPOSE. |
32 | 32 | ||
33 | The software is provided with RESTRICTED RIGHTS. Use, duplication, or | 33 | The software is provided with RESTRICTED RIGHTS. Use, duplication, or |
34 | disclosure by the government are subject to restrictions set forth in | 34 | disclosure by the government are subject to restrictions set forth in |
35 | DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. | 35 | DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. |
36 | 36 | ||
37 | ***************************************************************************/ | 37 | ***************************************************************************/ |
38 | 38 | ||
39 | #ifndef __PORT_H__ | 39 | #ifndef __PORT_H__ |
40 | #define __PORT_H__ 1 | 40 | #define __PORT_H__ 1 |
41 | 41 | ||
42 | |||
42 | #if defined(__CPLUSPLUS__) || defined(__cplusplus) | 43 | #if defined(__CPLUSPLUS__) || defined(__cplusplus) |
43 | extern "C" { | 44 | extern "C" { |
44 | #endif | 45 | #endif |
45 | 46 | ||
46 | #define vCardClipboardFormat "+//ISBN 1-887687-00-9::versit::PDI//vCard" | 47 | /* some of these #defines are commented out because */ |
47 | #define vCalendarClipboardFormat "+//ISBN 1-887687-00-9::versit::PDI//vCalendar" | 48 | /* Visual C++ sets them on the compiler command line instead */ |
48 | 49 | ||
49 | /* The above strings vCardClipboardFormat and vCalendarClipboardFormat | 50 | /* #define _DEBUG */ |
50 | are globally unique IDs which can be used to generate clipboard format | 51 | /* #define WIN32 */ |
51 | ID's as per the requirements of a specific platform. For example, in | 52 | /* #define WIN16 */ |
52 | Windows they are used as the parameter in a call to RegisterClipboardFormat. | 53 | /* #define _WINDOWS */ |
54 | /* #define __MWERKS__ */ | ||
55 | /* #define INCLUDEMFC */ | ||
56 | |||
57 | #define vCardClipboardFormat "+//ISBN 1-887687-00-9::versit::PDI//vCard" | ||
58 | #define vCalendarClipboardFormat"+//ISBN 1-887687-00-9::versit::PDI//vCalendar" | ||
59 | |||
60 | /* The above strings vCardClipboardFormat and vCalendarClipboardFormat | ||
61 | are globally unique IDs which can be used to generate clipboard format | ||
62 | ID's as per the requirements of a specific platform. For example, in | ||
63 | Windows they are used as the parameter in a call to RegisterClipboardFormat. | ||
53 | For example: | 64 | For example: |
54 | 65 | ||
55 | CLIPFORMAT foo = RegisterClipboardFormat(vCardClipboardFormat); | 66 | CLIPFORMAT foo = RegisterClipboardFormat(vCardClipboardFormat); |
56 | 67 | ||
57 | */ | 68 | */ |
58 | 69 | ||
59 | #define vCardMimeType "text/x-vCard" | 70 | #define vCardMimeType "text/x-vCard" |
60 | #define vCalendarMimeType "text/x-vCalendar" | 71 | #define vCalendarMimeType"text/x-vCalendar" |
72 | |||
73 | #define DLLEXPORT(t) t | ||
61 | 74 | ||
62 | #ifndef FALSE | 75 | #ifndef FALSE |
63 | #define FALSE 0 | 76 | #define FALSE0 |
64 | #endif | 77 | #endif |
65 | #ifndef TRUE | 78 | #ifndef TRUE |
66 | #define TRUE 1 | 79 | #define TRUE1 |
67 | #endif | 80 | #endif |
68 | 81 | ||
69 | #define Parse_Debug(t) | 82 | #define stricmp strcasecmp |
70 | 83 | ||
71 | #if defined(__CPLUSPLUS__) || defined(__cplusplus) | 84 | #if defined(__CPLUSPLUS__) || defined(__cplusplus) |
72 | } | 85 | } |
73 | #endif | 86 | #endif |
diff --git a/libkcal/versit/vcc.c b/libkcal/versit/vcc.c index 350cac3..9be752d 100644 --- a/libkcal/versit/vcc.c +++ b/libkcal/versit/vcc.c | |||
@@ -1,70 +1,65 @@ | |||
1 | 1 | /* A Bison parser, made from vcc.y | |
2 | /* A Bison parser, made from ./vcc.y | 2 | by GNU bison 1.35. */ |
3 | by GNU Bison version 1.28 */ | ||
4 | 3 | ||
5 | #define YYBISON 1 /* Identify Bison output. */ | 4 | #define YYBISON 1 /* Identify Bison output. */ |
6 | 5 | ||
7 | #ifdef _WIN32_ | 6 | # define EQ257 |
8 | #define strcasecmp _stricmp | 7 | # define COLON258 |
9 | #endif | 8 | # define DOT259 |
10 | 9 | # define SEMICOLON260 | |
11 | #define EQ257 | 10 | # define SPACE261 |
12 | #define COLON258 | 11 | # define HTAB262 |
13 | #define DOT259 | 12 | # define LINESEP263 |
14 | #define SEMICOLON260 | 13 | # define NEWLINE264 |
15 | #define SPACE261 | 14 | # define BEGIN_VCARD265 |
16 | #define HTAB262 | 15 | # define END_VCARD266 |
17 | #define LINESEP263 | 16 | # define BEGIN_VCAL267 |
18 | #define NEWLINE264 | 17 | # define END_VCAL268 |
19 | #define BEGIN_VCARD265 | 18 | # define BEGIN_VEVENT269 |
20 | #define END_VCARD266 | 19 | # define END_VEVENT270 |
21 | #define BEGIN_VCAL267 | 20 | # define BEGIN_VTODO271 |
22 | #define END_VCAL268 | 21 | # define END_VTODO272 |
23 | #define BEGIN_VEVENT269 | 22 | # define ID273 |
24 | #define END_VEVENT270 | 23 | # define STRING274 |
25 | #define BEGIN_VTODO271 | 24 | |
26 | #define END_VTODO272 | 25 | #line 1 "vcc.y" |
27 | #define ID273 | ||
28 | #define STRING274 | ||
29 | |||
30 | #line 1 "./vcc.y" | ||
31 | 26 | ||
32 | 27 | ||
33 | /*************************************************************************** | 28 | /*************************************************************************** |
34 | (C) Copyright 1996 Apple Computer, Inc., AT&T Corp., International | 29 | (C) Copyright 1996 Apple Computer, Inc., AT&T Corp., International |
35 | Business Machines Corporation and Siemens Rolm Communications Inc. | 30 | Business Machines Corporation and Siemens Rolm Communications Inc. |
36 | 31 | ||
37 | For purposes of this license notice, the term Licensors shall mean, | 32 | For purposes of this license notice, the term Licensors shall mean, |
38 | collectively, Apple Computer, Inc., AT&T Corp., International | 33 | collectively, Apple Computer, Inc., AT&T Corp., International |
39 | Business Machines Corporation and Siemens Rolm Communications Inc. | 34 | Business Machines Corporation and Siemens Rolm Communications Inc. |
40 | The term Licensor shall mean any of the Licensors. | 35 | The term Licensor shall mean any of the Licensors. |
41 | 36 | ||
42 | Subject to acceptance of the following conditions, permission is hereby | 37 | Subject to acceptance of the following conditions, permission is hereby |
43 | granted by Licensors without the need for written agreement and without | 38 | granted by Licensors without the need for written agreement and without |
44 | license or royalty fees, to use, copy, modify and distribute this | 39 | license or royalty fees, to use, copy, modify and distribute this |
45 | software for any purpose. | 40 | software for any purpose. |
46 | 41 | ||
47 | The above copyright notice and the following four paragraphs must be | 42 | The above copyright notice and the following four paragraphs must be |
48 | reproduced in all copies of this software and any software including | 43 | reproduced in all copies of this software and any software including |
49 | this software. | 44 | this software. |
50 | 45 | ||
51 | THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS AND NO LICENSOR SHALL HAVE | 46 | THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS AND NO LICENSOR SHALL HAVE |
52 | ANY OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS OR | 47 | ANY OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS OR |
53 | MODIFICATIONS. | 48 | MODIFICATIONS. |
54 | 49 | ||
55 | IN NO EVENT SHALL ANY LICENSOR BE LIABLE TO ANY PARTY FOR DIRECT, | 50 | IN NO EVENT SHALL ANY LICENSOR BE LIABLE TO ANY PARTY FOR DIRECT, |
56 | INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES OR LOST PROFITS ARISING OUT | 51 | INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES OR LOST PROFITS ARISING OUT |
57 | OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH | 52 | OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH |
58 | DAMAGE. | 53 | DAMAGE. |
59 | 54 | ||
60 | EACH LICENSOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED, | 55 | EACH LICENSOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED, |
61 | INCLUDING BUT NOT LIMITED TO ANY WARRANTY OF NONINFRINGEMENT OR THE | 56 | INCLUDING BUT NOT LIMITED TO ANY WARRANTY OF NONINFRINGEMENT OR THE |
62 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 57 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
63 | PURPOSE. | 58 | PURPOSE. |
64 | 59 | ||
65 | The software is provided with RESTRICTED RIGHTS. Use, duplication, or | 60 | The software is provided with RESTRICTED RIGHTS. Use, duplication, or |
66 | disclosure by the government are subject to restrictions set forth in | 61 | disclosure by the government are subject to restrictions set forth in |
67 | DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. | 62 | DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. |
68 | 63 | ||
69 | ***************************************************************************/ | 64 | ***************************************************************************/ |
70 | 65 | ||
@@ -74,7 +69,7 @@ DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. | |||
74 | * generated by a yacc parser generator. Generally it should not | 69 | * generated by a yacc parser generator. Generally it should not |
75 | * be edited by hand. The real source is vcc.y. The #line directives | 70 | * be edited by hand. The real source is vcc.y. The #line directives |
76 | * can be commented out here to make it easier to trace through | 71 | * can be commented out here to make it easier to trace through |
77 | * in a debugger. However, if a bug is found it should | 72 | * in a debugger. However, if a bug is found it should |
78 | * be fixed in vcc.y and this file regenerated. | 73 | * be fixed in vcc.y and this file regenerated. |
79 | */ | 74 | */ |
80 | 75 | ||
@@ -86,6 +81,11 @@ DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. | |||
86 | #define DBG_(x) | 81 | #define DBG_(x) |
87 | #endif | 82 | #endif |
88 | 83 | ||
84 | #ifdef WIN32 | ||
85 | #define snprintf _snprintf | ||
86 | #define strcasecmp stricmp | ||
87 | #endif | ||
88 | |||
89 | /**** External Functions ****/ | 89 | /**** External Functions ****/ |
90 | 90 | ||
91 | /* assign local name to parser variables and functions so that | 91 | /* assign local name to parser variables and functions so that |
@@ -120,7 +120,6 @@ DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. | |||
120 | #define yycheck mime_check | 120 | #define yycheck mime_check |
121 | #define yyname mime_name | 121 | #define yyname mime_name |
122 | #define yyrule mime_rule | 122 | #define yyrule mime_rule |
123 | #undef YYPREFIX | ||
124 | #define YYPREFIX "mime_" | 123 | #define YYPREFIX "mime_" |
125 | 124 | ||
126 | 125 | ||
@@ -128,29 +127,26 @@ DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. | |||
128 | #define _SUPPORT_LINE_FOLDING 1 | 127 | #define _SUPPORT_LINE_FOLDING 1 |
129 | #endif | 128 | #endif |
130 | 129 | ||
131 | #include <string.h> | 130 | /* undef below if compile with MFC */ |
132 | #ifndef __FreeBSD__ | 131 | /* #define INCLUDEMFC 1 */ |
133 | #include <malloc.h> | 132 | |
133 | #if defined(WIN32) || defined(_WIN32) | ||
134 | #ifdef INCLUDEMFC | ||
135 | #include <afx.h> | ||
134 | #endif | 136 | #endif |
137 | #endif | ||
138 | |||
139 | #include <string.h> | ||
135 | #include <stdio.h> | 140 | #include <stdio.h> |
136 | #include <stdlib.h> | 141 | #include <stdlib.h> |
137 | #include <ctype.h> | 142 | #include <ctype.h> |
138 | #include "vcc.h" | 143 | #include "vcc.h" |
139 | 144 | ||
140 | /* The following is a hack that I hope will get things compiling | ||
141 | * on SunOS 4.1.x systems | ||
142 | */ | ||
143 | #ifndef SEEK_SET | ||
144 | #define SEEK_SET 0 /* Seek from beginning of file. */ | ||
145 | #define SEEK_CUR 1 /* Seek from current position. */ | ||
146 | #define SEEK_END 2 /* Seek from end of file. */ | ||
147 | #endif | ||
148 | |||
149 | /**** Types, Constants ****/ | 145 | /**** Types, Constants ****/ |
150 | 146 | ||
151 | #define YYDEBUG 0/* 1 to compile in some debugging code */ | 147 | #define YYDEBUG 1/* 1 to compile in some debugging code */ |
152 | #define MAXTOKEN 256/* maximum token (line) length */ | 148 | #define MAXTOKEN 256/* maximum token (line) length */ |
153 | #define YYSTACKSIZE 1000/* ~unref ? */ | 149 | #define YYSTACKSIZE 50/* ~unref ? */ |
154 | #define MAXLEVEL 10/* max # of nested objects parseable */ | 150 | #define MAXLEVEL 10/* max # of nested objects parseable */ |
155 | /* (includes outermost) */ | 151 | /* (includes outermost) */ |
156 | 152 | ||
@@ -169,7 +165,7 @@ static int ObjStackTop; | |||
169 | extern "C" { | 165 | extern "C" { |
170 | #endif | 166 | #endif |
171 | 167 | ||
172 | /* static void Parse_Debug(const char *s);*/ | 168 | extern void Parse_Debug(const char *s); |
173 | static void yyerror(char *s); | 169 | static void yyerror(char *s); |
174 | 170 | ||
175 | #if __CPLUSPLUS__ | 171 | #if __CPLUSPLUS__ |
@@ -177,7 +173,7 @@ extern "C" { | |||
177 | #endif | 173 | #endif |
178 | 174 | ||
179 | int yyparse(); | 175 | int yyparse(); |
180 | static int yylex(); | 176 | |
181 | enum LexMode { | 177 | enum LexMode { |
182 | L_NORMAL, | 178 | L_NORMAL, |
183 | L_VCARD, | 179 | L_VCARD, |
@@ -192,28 +188,26 @@ enum LexMode { | |||
192 | /**** Private Forward Declarations ****/ | 188 | /**** Private Forward Declarations ****/ |
193 | static int pushVObject(const char *prop); | 189 | static int pushVObject(const char *prop); |
194 | static VObject* popVObject(); | 190 | static VObject* popVObject(); |
195 | char* lexDataFromBase64(); | ||
196 | static void lexPopMode(int top); | 191 | static void lexPopMode(int top); |
197 | static int lexWithinMode(enum LexMode mode); | 192 | static int lexWithinMode(enum LexMode mode); |
198 | static void lexPushMode(enum LexMode mode); | 193 | static void lexPushMode(enum LexMode mode); |
199 | static void enterProps(const char *s); | 194 | static void enterProps(const char *s); |
200 | static void enterAttr(const char *s1, const char *s2); | 195 | static void enterAttr(const char *s1, const char *s2); |
201 | /* static void enterValues(const char *value); */ | 196 | static void enterValues(const char *value); |
202 | static void appendValue(const char *value); | ||
203 | static void mime_error_(char *s); | 197 | static void mime_error_(char *s); |
204 | 198 | ||
205 | 199 | ||
206 | #line 181 "./vcc.y" | 200 | #line 180 "vcc.y" |
201 | #ifndef YYSTYPE | ||
207 | typedef union { | 202 | typedef union { |
208 | char *str; | 203 | char *str; |
209 | VObject *vobj; | 204 | VObject *vobj; |
210 | } YYSTYPE; | 205 | } yystype; |
211 | #include <stdio.h> | 206 | # define YYSTYPE yystype |
212 | 207 | # define YYSTYPE_IS_TRIVIAL 1 | |
213 | #ifndef __cplusplus | ||
214 | #ifndef __STDC__ | ||
215 | #define const | ||
216 | #endif | 208 | #endif |
209 | #ifndef YYDEBUG | ||
210 | # define YYDEBUG 0 | ||
217 | #endif | 211 | #endif |
218 | 212 | ||
219 | 213 | ||
@@ -222,163 +216,186 @@ typedef union { | |||
222 | #define YYFLAG -32768 | 216 | #define YYFLAG -32768 |
223 | #define YYNTBASE21 | 217 | #define YYNTBASE21 |
224 | 218 | ||
219 | /* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */ | ||
225 | #define YYTRANSLATE(x) ((unsigned)(x) <= 274 ? yytranslate[x] : 51) | 220 | #define YYTRANSLATE(x) ((unsigned)(x) <= 274 ? yytranslate[x] : 51) |
226 | 221 | ||
227 | static const char yytranslate[] = { 0, | 222 | /* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */ |
228 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 223 | static const char yytranslate[] = |
229 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 224 | { |
230 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 225 | 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
231 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 226 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
232 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 227 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
233 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 228 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
234 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 229 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
235 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 230 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
236 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 231 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
237 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 232 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
238 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 233 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
239 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 234 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
240 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 235 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
241 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 236 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
242 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 237 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
243 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 238 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
244 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 239 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
245 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 240 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
246 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 241 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
247 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 242 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
248 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 243 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
249 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 244 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
250 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 245 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
251 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 246 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
252 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | 247 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
253 | 2, 2, 2, 2, 2, 1, 3, 4, 5, 6, | 248 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
254 | 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, | 249 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
255 | 17, 18, 19, 20 | 250 | 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, |
251 | 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, | ||
252 | 16, 17, 18, 19, 20 | ||
256 | }; | 253 | }; |
257 | 254 | ||
258 | #if YYDEBUG != 0 | 255 | #if YYDEBUG |
259 | static const short yyprhs[] = { 0, | 256 | static const short yyprhs[] = |
260 | 0, 2, 3, 7, 9, 11, 13, 14, 19, 20, | 257 | { |
261 | 24, 27, 29, 30, 36, 38, 39, 43, 45, 48, | 258 | 0, 0, 2, 3, 7, 9, 11, 13, 14, 19, |
262 | 50, 53, 55, 59, 61, 62, 67, 69, 71, 72, | 259 | 20, 24, 27, 29, 30, 36, 38, 39, 43, 45, |
263 | 73, 78, 79, 83, 86, 88, 90, 92, 94, 95, | 260 | 48, 50, 53, 55, 59, 61, 62, 67, 69, 71, |
264 | 100, 101, 105, 106, 111, 112 | 261 | 72, 73, 78, 79, 83, 86, 88, 90, 92, 94, |
262 | 95, 100, 101, 105, 106, 111, 112 | ||
265 | }; | 263 | }; |
266 | 264 | static const short yyrhs[] = | |
267 | static const short yyrhs[] = { 22, | 265 | { |
268 | 0, 0, 24, 23, 22, 0, 24, 0, 25, 0, | 266 | 22, 0, 0, 24, 23, 22, 0, 24, 0, 25, |
269 | 40, 0, 0, 11, 26, 28, 12, 0, 0, 11, | 267 | 0, 40, 0, 0, 11, 26, 28, 12, 0, 0, |
270 | 27, 12, 0, 29, 28, 0, 29, 0, 0, 31, | 268 | 11, 27, 12, 0, 29, 28, 0, 29, 0, 0, |
271 | 4, 30, 37, 9, 0, 1, 0, 0, 36, 32, | 269 | 31, 4, 30, 37, 9, 0, 1, 0, 0, 36, |
272 | 33, 0, 36, 0, 34, 33, 0, 34, 0, 6, | 270 | 32, 33, 0, 36, 0, 34, 33, 0, 34, 0, |
273 | 35, 0, 36, 0, 36, 3, 36, 0, 19, 0, | 271 | 6, 35, 0, 36, 0, 36, 3, 36, 0, 19, |
274 | 0, 39, 6, 38, 37, 0, 39, 0, 20, 0, | 272 | 0, 0, 39, 6, 38, 37, 0, 39, 0, 20, |
275 | 0, 0, 13, 41, 43, 14, 0, 0, 13, 42, | 273 | 0, 0, 0, 13, 41, 43, 14, 0, 0, 13, |
276 | 14, 0, 44, 43, 0, 44, 0, 45, 0, 48, | 274 | 42, 14, 0, 44, 43, 0, 44, 0, 45, 0, |
277 | 0, 28, 0, 0, 15, 46, 28, 16, 0, 0, | 275 | 48, 0, 28, 0, 0, 15, 46, 28, 16, 0, |
278 | 15, 47, 16, 0, 0, 17, 49, 28, 18, 0, | 276 | 0, 15, 47, 16, 0, 0, 17, 49, 28, 18, |
279 | 0, 17, 50, 18, 0 | 277 | 0, 0, 17, 50, 18, 0 |
280 | }; | 278 | }; |
281 | 279 | ||
282 | #endif | 280 | #endif |
283 | 281 | ||
284 | #if YYDEBUG != 0 | 282 | #if YYDEBUG |
285 | static const short yyrline[] = { 0, | 283 | /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ |
286 | 209, 212, 215, 215, 219, 220, 223, 229, 234, 240, | 284 | static const short yyrline[] = |
287 | 246, 247, 250, 254, 260, 263, 268, 268, 274, 275, | 285 | { |
288 | 278, 281, 285, 292, 295, 296, 296, 300, 301, 305, | 286 | 0, 208, 211, 211, 214, 218, 219, 222, 222, 233, |
289 | 309, 311, 314, 317, 318, 321, 323, 324, 327, 334, | 287 | 233, 245, 246, 249, 249, 259, 262, 262, 267, 273, |
290 | 339, 345, 351, 358, 363, 369 | 288 | 274, 277, 280, 284, 291, 294, 294, 295, 299, 300, |
289 | 303, 303, 309, 309, 315, 316, 319, 321, 322, 325, | ||
290 | 325, 337, 337, 349, 349, 361, 361 | ||
291 | }; | 291 | }; |
292 | #endif | 292 | #endif |
293 | 293 | ||
294 | 294 | ||
295 | #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) | 295 | #if (YYDEBUG) || defined YYERROR_VERBOSE |
296 | 296 | ||
297 | static const char * const yytname[] = { "$","error","$undefined.","EQ","COLON", | 297 | /* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */ |
298 | "DOT","SEMICOLON","SPACE","HTAB","LINESEP","NEWLINE","BEGIN_VCARD","END_VCARD", | 298 | static const char *const yytname[] = |
299 | "BEGIN_VCAL","END_VCAL","BEGIN_VEVENT","END_VEVENT","BEGIN_VTODO","END_VTODO", | 299 | { |
300 | "ID","STRING","mime","vobjects","@1","vobject","vcard","@2","@3","items","item", | 300 | "$", "error", "$undefined.", "EQ", "COLON", "DOT", "SEMICOLON", "SPACE", |
301 | "@4","prop","@5","attr_params","attr_param","attr","name","values","@6","value", | 301 | "HTAB", "LINESEP", "NEWLINE", "BEGIN_VCARD", "END_VCARD", "BEGIN_VCAL", |
302 | "vcal","@7","@8","calitems","calitem","eventitem","@9","@10","todoitem","@11", | 302 | "END_VCAL", "BEGIN_VEVENT", "END_VEVENT", "BEGIN_VTODO", "END_VTODO", |
303 | "@12", NULL | 303 | "ID", "STRING", "mime", "vobjects", "@1", "vobject", "vcard", "@2", |
304 | "@3", "items", "item", "@4", "prop", "@5", "attr_params", "attr_param", | ||
305 | "attr", "name", "values", "@6", "value", "vcal", "@7", "@8", "calitems", | ||
306 | "calitem", "eventitem", "@9", "@10", "todoitem", "@11", "@12", 0 | ||
304 | }; | 307 | }; |
305 | #endif | 308 | #endif |
306 | 309 | ||
307 | static const short yyr1[] = { 0, | 310 | /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ |
308 | 21, 23, 22, 22, 24, 24, 26, 25, 27, 25, | 311 | static const short yyr1[] = |
309 | 28, 28, 30, 29, 29, 32, 31, 31, 33, 33, | 312 | { |
310 | 34, 35, 35, 36, 38, 37, 37, 39, 39, 41, | 313 | 0, 21, 23, 22, 22, 24, 24, 26, 25, 27, |
311 | 40, 42, 40, 43, 43, 44, 44, 44, 46, 45, | 314 | 25, 28, 28, 30, 29, 29, 32, 31, 31, 33, |
312 | 47, 45, 49, 48, 50, 48 | 315 | 33, 34, 35, 35, 36, 38, 37, 37, 39, 39, |
316 | 41, 40, 42, 40, 43, 43, 44, 44, 44, 46, | ||
317 | 45, 47, 45, 49, 48, 50, 48 | ||
313 | }; | 318 | }; |
314 | 319 | ||
315 | static const short yyr2[] = { 0, | 320 | /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ |
316 | 1, 0, 3, 1, 1, 1, 0, 4, 0, 3, | 321 | static const short yyr2[] = |
317 | 2, 1, 0, 5, 1, 0, 3, 1, 2, 1, | 322 | { |
318 | 2, 1, 3, 1, 0, 4, 1, 1, 0, 0, | 323 | 0, 1, 0, 3, 1, 1, 1, 0, 4, 0, |
319 | 4, 0, 3, 2, 1, 1, 1, 1, 0, 4, | 324 | 3, 2, 1, 0, 5, 1, 0, 3, 1, 2, |
320 | 0, 3, 0, 4, 0, 3 | 325 | 1, 2, 1, 3, 1, 0, 4, 1, 1, 0, |
326 | 0, 4, 0, 3, 2, 1, 1, 1, 1, 0, | ||
327 | 4, 0, 3, 0, 4, 0, 3 | ||
321 | }; | 328 | }; |
322 | 329 | ||
323 | static const short yydefact[] = { 0, | 330 | /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE |
324 | 7, 30, 1, 2, 5, 6, 0, 0, 0, 0, | 331 | doesn't specify something else to do. Zero means the default is an |
325 | 0, 15, 24, 0, 0, 0, 16, 10, 39, 43, | 332 | error. */ |
326 | 38, 0, 0, 36, 37, 33, 3, 8, 11, 13, | 333 | static const short yydefact[] = |
327 | 0, 0, 0, 0, 0, 31, 34, 29, 0, 17, | 334 | { |
328 | 20, 0, 42, 0, 46, 28, 0, 27, 21, 22, | 335 | 0, 7, 30, 1, 2, 5, 6, 0, 0, 0, |
329 | 19, 40, 44, 14, 25, 0, 29, 23, 26, 0, | 336 | 0, 0, 15, 24, 0, 0, 0, 16, 10, 39, |
330 | 0, 0 | 337 | 43, 38, 0, 0, 36, 37, 33, 3, 8, 11, |
338 | 13, 0, 0, 0, 0, 0, 31, 34, 29, 0, | ||
339 | 17, 20, 0, 42, 0, 46, 28, 0, 27, 21, | ||
340 | 22, 19, 40, 44, 14, 25, 0, 29, 23, 26, | ||
341 | 0, 0, 0 | ||
331 | }; | 342 | }; |
332 | 343 | ||
333 | static const short yydefgoto[] = { 60, | 344 | static const short yydefgoto[] = |
334 | 3, 11, 4, 5, 7, 8, 21, 15, 38, 16, | 345 | { |
335 | 31, 40, 41, 49, 17, 47, 57, 48, 6, 9, | 346 | 60, 3, 11, 4, 5, 7, 8, 21, 15, 38, |
336 | 10, 22, 23, 24, 32, 33, 25, 34, 35 | 347 | 16, 31, 40, 41, 49, 17, 47, 57, 48, 6, |
348 | 9, 10, 22, 23, 24, 32, 33, 25, 34, 35 | ||
337 | }; | 349 | }; |
338 | 350 | ||
339 | static const short yypact[] = { -9, | 351 | static const short yypact[] = |
340 | -6, -5,-32768, 7,-32768,-32768, 2, -1, 19, 15, | 352 | { |
341 | -9,-32768,-32768, 1, 0, 26, 27,-32768, 16, 17, | 353 | -9, -6, -5,-32768, 7,-32768,-32768, 2, -1, 19, |
342 | -32768, 23, 9,-32768,-32768,-32768,-32768,-32768,-32768,-32768, | 354 | 15, -9,-32768,-32768, 1, 0, 26, 27,-32768, 16, |
343 | 33, 2, 24, 2, 25,-32768,-32768, 13, 22,-32768, | 355 | 17,-32768, 23, 9,-32768,-32768,-32768,-32768,-32768,-32768, |
344 | 33, 28,-32768, 29,-32768,-32768, 36, 40,-32768, 39, | 356 | -32768, 33, 2, 24, 2, 25,-32768,-32768, 13, 22, |
345 | -32768,-32768,-32768,-32768,-32768, 22, 13,-32768,-32768, 48, | 357 | -32768, 33, 28,-32768, 29,-32768,-32768, 36, 40,-32768, |
346 | 49,-32768 | 358 | 39,-32768,-32768,-32768,-32768,-32768, 22, 13,-32768,-32768, |
359 | 48, 49,-32768 | ||
347 | }; | 360 | }; |
348 | 361 | ||
349 | static const short yypgoto[] = {-32768, | 362 | static const short yypgoto[] = |
350 | 41,-32768,-32768,-32768,-32768,-32768, -7,-32768,-32768,-32768, | 363 | { |
351 | -32768, 10,-32768,-32768, -34, -4,-32768,-32768,-32768,-32768, | 364 | -32768, 41,-32768,-32768,-32768,-32768,-32768, -7,-32768,-32768, |
352 | -32768, 31,-32768,-32768,-32768,-32768,-32768,-32768,-32768 | 365 | -32768,-32768, 10,-32768,-32768, -34, -4,-32768,-32768,-32768, |
366 | -32768,-32768, 31,-32768,-32768,-32768,-32768,-32768,-32768,-32768 | ||
353 | }; | 367 | }; |
354 | 368 | ||
355 | 369 | ||
356 | #define YYLAST 54 | 370 | #define YYLAST 54 |
357 | 371 | ||
358 | 372 | ||
359 | static const short yytable[] = { 14, | 373 | static const short yytable[] = |
360 | 12, 1, 12, 2, 50, -9, -4, 29, -32, 12, | 374 | { |
361 | 18, -12, 28, -12, -12, -12, -12, -12, 13, 12, | 375 | 14, 12, 1, 12, 2, 50, -9, -4, 29, -32, |
362 | 13, 58, -35, 19, 42, 20, 44, 13, 26, 30, | 376 | 12, 18, -12, 28, -12, -12, -12, -12, -12, 13, |
363 | -18, -41, 46, 19, -45, 20, 36, 13, 39, 43, | 377 | 12, 13, 58, -35, 19, 42, 20, 44, 13, 26, |
364 | 13, 56, 45, 52, 54, 55, 53, 61, 62, 0, | 378 | 30, -18, -41, 46, 19, -45, 20, 36, 13, 39, |
365 | 51, 27, 59, 37 | 379 | 43, 13, 56, 45, 52, 54, 55, 53, 61, 62, |
380 | 0, 51, 27, 59, 37 | ||
366 | }; | 381 | }; |
367 | 382 | ||
368 | static const short yycheck[] = { 7, | 383 | static const short yycheck[] = |
369 | 1, 11, 1, 13, 39, 12, 0, 15, 14, 1, | 384 | { |
370 | 12, 12, 12, 14, 15, 16, 17, 18, 19, 1, | 385 | 7, 1, 11, 1, 13, 39, 12, 0, 15, 14, |
371 | 19, 56, 14, 15, 32, 17, 34, 19, 14, 4, | 386 | 1, 12, 12, 12, 14, 15, 16, 17, 18, 19, |
372 | 4, 16, 20, 15, 18, 17, 14, 19, 6, 16, | 387 | 1, 19, 56, 14, 15, 32, 17, 34, 19, 14, |
373 | 19, 3, 18, 16, 9, 6, 18, 0, 0, -1, | 388 | 4, 4, 16, 20, 15, 18, 17, 14, 19, 6, |
374 | 41, 11, 57, 23 | 389 | 16, 19, 3, 18, 16, 9, 6, 18, 0, 0, |
390 | -1, 41, 11, 57, 23 | ||
375 | }; | 391 | }; |
376 | /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ | 392 | /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ |
377 | #line 3 "/usr/share/bison.simple" | 393 | #line 3 "/usr/share/bison/bison.simple" |
378 | /* This file comes from bison-1.28. */ | ||
379 | 394 | ||
380 | /* Skeleton output parser for bison, | 395 | /* Skeleton output parser for bison, |
381 | Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc. | 396 | |
397 | Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software | ||
398 | Foundation, Inc. | ||
382 | 399 | ||
383 | This program is free software; you can redistribute it and/or modify | 400 | This program is free software; you can redistribute it and/or modify |
384 | it under the terms of the GNU General Public License as published by | 401 | it under the terms of the GNU General Public License as published by |
@@ -400,62 +417,131 @@ static const short yycheck[] = { 7, | |||
400 | This special exception was added by the Free Software Foundation | 417 | This special exception was added by the Free Software Foundation |
401 | in version 1.24 of Bison. */ | 418 | in version 1.24 of Bison. */ |
402 | 419 | ||
403 | /* This is the parser code that is written into each bison parser | 420 | /* This is the parser code that is written into each bison parser when |
404 | when the %semantic_parser declaration is not specified in the grammar. | 421 | the %semantic_parser declaration is not specified in the grammar. |
405 | It was written by Richard Stallman by simplifying the hairy parser | 422 | It was written by Richard Stallman by simplifying the hairy parser |
406 | used when %semantic_parser is specified. */ | 423 | used when %semantic_parser is specified. */ |
424 | |||
425 | /* All symbols defined below should begin with yy or YY, to avoid | ||
426 | infringing on user name space. This should be done even for local | ||
427 | variables, as they might otherwise be expanded by user macros. | ||
428 | There are some unavoidable exceptions within include files to | ||
429 | define necessary library symbols; they are noted "INFRINGES ON | ||
430 | USER NAME SPACE" below. */ | ||
431 | |||
432 | #if ! defined (yyoverflow) || defined (YYERROR_VERBOSE) | ||
433 | |||
434 | /* The parser invokes alloca or malloc; define the necessary symbols. */ | ||
435 | |||
436 | # if YYSTACK_USE_ALLOCA | ||
437 | # define YYSTACK_ALLOC alloca | ||
438 | # else | ||
439 | # ifndef YYSTACK_USE_ALLOCA | ||
440 | # if defined (alloca) || defined (_ALLOCA_H) | ||
441 | # define YYSTACK_ALLOC alloca | ||
442 | # else | ||
443 | # ifdef __GNUC__ | ||
444 | # define YYSTACK_ALLOC __builtin_alloca | ||
445 | # endif | ||
446 | # endif | ||
447 | # endif | ||
448 | # endif | ||
449 | |||
450 | # ifdef YYSTACK_ALLOC | ||
451 | /* Pacify GCC's `empty if-body' warning. */ | ||
452 | # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) | ||
453 | # else | ||
454 | # if defined (__STDC__) || defined (__cplusplus) | ||
455 | # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ | ||
456 | # define YYSIZE_T size_t | ||
457 | # endif | ||
458 | # define YYSTACK_ALLOC malloc | ||
459 | # define YYSTACK_FREE free | ||
460 | # endif | ||
461 | #endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */ | ||
462 | |||
463 | |||
464 | #if (! defined (yyoverflow) \ | ||
465 | && (! defined (__cplusplus) \ | ||
466 | || (YYLTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) | ||
467 | |||
468 | /* A type that is properly aligned for any stack member. */ | ||
469 | union yyalloc | ||
470 | { | ||
471 | short yyss; | ||
472 | YYSTYPE yyvs; | ||
473 | # if YYLSP_NEEDED | ||
474 | YYLTYPE yyls; | ||
475 | # endif | ||
476 | }; | ||
477 | |||
478 | /* The size of the maximum gap between one aligned stack and the next. */ | ||
479 | # define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1) | ||
480 | |||
481 | /* The size of an array large to enough to hold all stacks, each with | ||
482 | N elements. */ | ||
483 | # if YYLSP_NEEDED | ||
484 | # define YYSTACK_BYTES(N) \ | ||
485 | ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE))\ | ||
486 | + 2 * YYSTACK_GAP_MAX) | ||
487 | # else | ||
488 | # define YYSTACK_BYTES(N) \ | ||
489 | ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ | ||
490 | + YYSTACK_GAP_MAX) | ||
491 | # endif | ||
492 | |||
493 | /* Copy COUNT objects from FROM to TO. The source and destination do | ||
494 | not overlap. */ | ||
495 | # ifndef YYCOPY | ||
496 | # if 1 < __GNUC__ | ||
497 | # define YYCOPY(To, From, Count) \ | ||
498 | __builtin_memcpy (To, From, (Count) * sizeof (*(From))) | ||
499 | # else | ||
500 | # define YYCOPY(To, From, Count) \ | ||
501 | do \ | ||
502 | { \ | ||
503 | register YYSIZE_T yyi; \ | ||
504 | for (yyi = 0; yyi < (Count); yyi++)\ | ||
505 | (To)[yyi] = (From)[yyi]; \ | ||
506 | } \ | ||
507 | while (0) | ||
508 | # endif | ||
509 | # endif | ||
510 | |||
511 | /* Relocate STACK from its old location to the new one. The | ||
512 | local variables YYSIZE and YYSTACKSIZE give the old and new number of | ||
513 | elements in the stack, and YYPTR gives the new location of the | ||
514 | stack. Advance YYPTR to a properly aligned location for the next | ||
515 | stack. */ | ||
516 | # define YYSTACK_RELOCATE(Stack) \ | ||
517 | do \ | ||
518 | { \ | ||
519 | YYSIZE_T yynewbytes; \ | ||
520 | YYCOPY (&yyptr->Stack, Stack, yysize); \ | ||
521 | Stack = &yyptr->Stack; \ | ||
522 | yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAX;\ | ||
523 | yyptr += yynewbytes / sizeof (*yyptr); \ | ||
524 | } \ | ||
525 | while (0) | ||
407 | 526 | ||
408 | #ifndef YYSTACK_USE_ALLOCA | ||
409 | #ifdef alloca | ||
410 | #define YYSTACK_USE_ALLOCA | ||
411 | #else /* alloca not defined */ | ||
412 | #ifdef __GNUC__ | ||
413 | #define YYSTACK_USE_ALLOCA | ||
414 | #define alloca __builtin_alloca | ||
415 | #else /* not GNU C. */ | ||
416 | #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) | ||
417 | #define YYSTACK_USE_ALLOCA | ||
418 | #include <alloca.h> | ||
419 | #else /* not sparc */ | ||
420 | /* We think this test detects Watcom and Microsoft C. */ | ||
421 | /* This used to test MSDOS, but that is a bad idea | ||
422 | since that symbol is in the user namespace. */ | ||
423 | #if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__) | ||
424 | #if 0 /* No need for malloc.h, which pollutes the namespace; | ||
425 | instead, just don't use alloca. */ | ||
426 | #include <malloc.h> | ||
427 | #endif | 527 | #endif |
428 | #else /* not MSDOS, or __TURBOC__ */ | 528 | |
429 | #if defined(_AIX) | 529 | |
430 | /* I don't know what this was needed for, but it pollutes the namespace. | 530 | #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) |
431 | So I turned it off. rms, 2 May 1997. */ | 531 | # define YYSIZE_T __SIZE_TYPE__ |
432 | /* #include <malloc.h> */ | ||
433 | #pragma alloca | ||
434 | #define YYSTACK_USE_ALLOCA | ||
435 | #else /* not MSDOS, or __TURBOC__, or _AIX */ | ||
436 | #if 0 | ||
437 | #ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, | ||
438 | and on HPUX 10. Eventually we can turn this on. */ | ||
439 | #define YYSTACK_USE_ALLOCA | ||
440 | #define alloca __builtin_alloca | ||
441 | #endif /* __hpux */ | ||
442 | #endif | 532 | #endif |
443 | #endif /* not _AIX */ | 533 | #if ! defined (YYSIZE_T) && defined (size_t) |
444 | #endif /* not MSDOS, or __TURBOC__ */ | 534 | # define YYSIZE_T size_t |
445 | #endif /* not sparc */ | 535 | #endif |
446 | #endif /* not GNU C */ | 536 | #if ! defined (YYSIZE_T) |
447 | #endif /* alloca not defined */ | 537 | # if defined (__STDC__) || defined (__cplusplus) |
448 | #endif /* YYSTACK_USE_ALLOCA not defined */ | 538 | # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
449 | 539 | # define YYSIZE_T size_t | |
450 | #ifdef YYSTACK_USE_ALLOCA | 540 | # endif |
451 | #define YYSTACK_ALLOC alloca | 541 | #endif |
452 | #else | 542 | #if ! defined (YYSIZE_T) |
453 | #define YYSTACK_ALLOC malloc | 543 | # define YYSIZE_T unsigned int |
454 | #endif | 544 | #endif |
455 | |||
456 | /* Note: there must be only one dollar sign in this file. | ||
457 | It is replaced by the list of actions, each action | ||
458 | as one case of the switch. */ | ||
459 | 545 | ||
460 | #define yyerrok (yyerrstatus = 0) | 546 | #define yyerrok (yyerrstatus = 0) |
461 | #define yyclearin(yychar = YYEMPTY) | 547 | #define yyclearin(yychar = YYEMPTY) |
@@ -464,131 +550,161 @@ static const short yycheck[] = { 7, | |||
464 | #define YYACCEPTgoto yyacceptlab | 550 | #define YYACCEPTgoto yyacceptlab |
465 | #define YYABORT goto yyabortlab | 551 | #define YYABORT goto yyabortlab |
466 | #define YYERROR goto yyerrlab1 | 552 | #define YYERROR goto yyerrlab1 |
467 | /* Like YYERROR except do call yyerror. | 553 | /* Like YYERROR except do call yyerror. This remains here temporarily |
468 | This remains here temporarily to ease the | 554 | to ease the transition to the new meaning of YYERROR, for GCC. |
469 | transition to the new meaning of YYERROR, for GCC. | ||
470 | Once GCC version 2 has supplanted version 1, this can go. */ | 555 | Once GCC version 2 has supplanted version 1, this can go. */ |
471 | #define YYFAIL goto yyerrlab | 556 | #define YYFAIL goto yyerrlab |
472 | #define YYRECOVERING() (!!yyerrstatus) | 557 | #define YYRECOVERING() (!!yyerrstatus) |
473 | #define YYBACKUP(token, value) \ | 558 | #define YYBACKUP(Token, Value) \ |
474 | do \ | 559 | do \ |
475 | if (yychar == YYEMPTY && yylen == 1) \ | 560 | if (yychar == YYEMPTY && yylen == 1) \ |
476 | { yychar = (token), yylval = (value); \ | 561 | { \ |
562 | yychar = (Token); \ | ||
563 | yylval = (Value); \ | ||
477 | yychar1 = YYTRANSLATE (yychar); \ | 564 | yychar1 = YYTRANSLATE (yychar); \ |
478 | YYPOPSTACK; \ | 565 | YYPOPSTACK; \ |
479 | goto yybackup; \ | 566 | goto yybackup; \ |
480 | } \ | 567 | } \ |
481 | else \ | 568 | else \ |
482 | { yyerror ("syntax error: cannot back up"); YYERROR; }\ | 569 | { \ |
570 | yyerror ("syntax error: cannot back up"); \ | ||
571 | YYERROR; \ | ||
572 | } \ | ||
483 | while (0) | 573 | while (0) |
484 | 574 | ||
485 | #define YYTERROR1 | 575 | #define YYTERROR1 |
486 | #define YYERRCODE256 | 576 | #define YYERRCODE256 |
487 | 577 | ||
488 | #ifndef YYPURE | ||
489 | #define YYLEX yylex() | ||
490 | #endif | ||
491 | 578 | ||
492 | #ifdef YYPURE | 579 | /* YYLLOC_DEFAULT -- Compute the default location (before the actions |
493 | #ifdef YYLSP_NEEDED | 580 | are run). |
494 | #ifdef YYLEX_PARAM | ||
495 | #define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) | ||
496 | #else | ||
497 | #define YYLEX yylex(&yylval, &yylloc) | ||
498 | #endif | ||
499 | #else /* not YYLSP_NEEDED */ | ||
500 | #ifdef YYLEX_PARAM | ||
501 | #define YYLEX yylex(&yylval, YYLEX_PARAM) | ||
502 | #else | ||
503 | #define YYLEX yylex(&yylval) | ||
504 | #endif | ||
505 | #endif /* not YYLSP_NEEDED */ | ||
506 | #endif | ||
507 | 581 | ||
508 | /* If nonreentrant, generate the variables here */ | 582 | When YYLLOC_DEFAULT is run, CURRENT is set the location of the |
583 | first token. By default, to implement support for ranges, extend | ||
584 | its range to the last symbol. */ | ||
509 | 585 | ||
510 | #ifndef YYPURE | 586 | #ifndef YYLLOC_DEFAULT |
511 | 587 | # define YYLLOC_DEFAULT(Current, Rhs, N) \ | |
512 | int yychar; /* the lookahead symbol */ | 588 | Current.last_line = Rhs[N].last_line;\ |
513 | YYSTYPE yylval; /* the semantic value of the */ | 589 | Current.last_column = Rhs[N].last_column; |
514 | /* lookahead symbol */ | ||
515 | |||
516 | #ifdef YYLSP_NEEDED | ||
517 | YYLTYPE yylloc; /* location data for the lookahead*/ | ||
518 | /* symbol */ | ||
519 | #endif | 590 | #endif |
520 | 591 | ||
521 | int yynerrs; /* number of parse errors so far */ | ||
522 | #endif /* not YYPURE */ | ||
523 | |||
524 | #if YYDEBUG != 0 | ||
525 | int yydebug; /* nonzero means print parse trace*/ | ||
526 | /* Since this is uninitialized, it does not stop multiple parsers | ||
527 | from coexisting. */ | ||
528 | #endif | ||
529 | |||
530 | /* YYINITDEPTH indicates the initial size of the parser's stacks*/ | ||
531 | 592 | ||
593 | /* YYLEX -- calling `yylex' with the right arguments. */ | ||
594 | |||
595 | #if YYPURE | ||
596 | # if YYLSP_NEEDED | ||
597 | # ifdef YYLEX_PARAM | ||
598 | # define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) | ||
599 | # else | ||
600 | # define YYLEX yylex (&yylval, &yylloc) | ||
601 | # endif | ||
602 | # else /* !YYLSP_NEEDED */ | ||
603 | # ifdef YYLEX_PARAM | ||
604 | # define YYLEX yylex (&yylval, YYLEX_PARAM) | ||
605 | # else | ||
606 | # define YYLEX yylex (&yylval) | ||
607 | # endif | ||
608 | # endif /* !YYLSP_NEEDED */ | ||
609 | #else /* !YYPURE */ | ||
610 | # define YYLEX yylex () | ||
611 | #endif /* !YYPURE */ | ||
612 | |||
613 | |||
614 | /* Enable debugging if requested. */ | ||
615 | #if YYDEBUG | ||
616 | |||
617 | # ifndef YYFPRINTF | ||
618 | # include <stdio.h> /* INFRINGES ON USER NAME SPACE */ | ||
619 | # define YYFPRINTF fprintf | ||
620 | # endif | ||
621 | |||
622 | # define YYDPRINTF(Args) \ | ||
623 | do { \ | ||
624 | if (yydebug) \ | ||
625 | YYFPRINTF Args; \ | ||
626 | } while (0) | ||
627 | /* Nonzero means print parse trace. It is left uninitialized so that | ||
628 | multiple parsers can coexist. */ | ||
629 | int yydebug; | ||
630 | #else /* !YYDEBUG */ | ||
631 | # define YYDPRINTF(Args) | ||
632 | #endif /* !YYDEBUG */ | ||
633 | |||
634 | /* YYINITDEPTH -- initial size of the parser's stacks. */ | ||
532 | #ifndefYYINITDEPTH | 635 | #ifndefYYINITDEPTH |
533 | #define YYINITDEPTH 200 | 636 | # define YYINITDEPTH 200 |
534 | #endif | 637 | #endif |
535 | 638 | ||
536 | /* YYMAXDEPTH is the maximum size the stacks can grow to | 639 | /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only |
537 | (effective only if the built-in stack extension method is used). */ | 640 | if the built-in stack extension method is used). |
641 | |||
642 | Do not make this value too large; the results are undefined if | ||
643 | SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH) | ||
644 | evaluated with infinite-precision integer arithmetic. */ | ||
538 | 645 | ||
539 | #if YYMAXDEPTH == 0 | 646 | #if YYMAXDEPTH == 0 |
540 | #undef YYMAXDEPTH | 647 | # undef YYMAXDEPTH |
541 | #endif | 648 | #endif |
542 | 649 | ||
543 | #ifndef YYMAXDEPTH | 650 | #ifndef YYMAXDEPTH |
544 | #define YYMAXDEPTH 10000 | 651 | # define YYMAXDEPTH 10000 |
545 | #endif | 652 | #endif |
546 | 653 | ||
547 | /* Define __yy_memcpy. Note that the size argument | 654 | #ifdef YYERROR_VERBOSE |
548 | should be passed with type unsigned int, because that is what the non-GCC | ||
549 | definitions require. With GCC, __builtin_memcpy takes an arg | ||
550 | of type size_t, but it can handle unsigned int. */ | ||
551 | |||
552 | #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ | ||
553 | #define __yy_memcpy(TO,FROM,COUNT)__builtin_memcpy(TO,FROM,COUNT) | ||
554 | #else /* not GNU C or C++ */ | ||
555 | #ifndef __cplusplus | ||
556 | |||
557 | /* This is the most reliable way to avoid incompatibilities | ||
558 | in available built-in functions on various systems. */ | ||
559 | static void | ||
560 | __yy_memcpy (to, from, count) | ||
561 | char *to; | ||
562 | char *from; | ||
563 | unsigned int count; | ||
564 | { | ||
565 | register char *f = from; | ||
566 | register char *t = to; | ||
567 | register int i = count; | ||
568 | 655 | ||
569 | while (i-- > 0) | 656 | # ifndef yystrlen |
570 | *t++ = *f++; | 657 | # if defined (__GLIBC__) && defined (_STRING_H) |
571 | } | 658 | # define yystrlen strlen |
659 | # else | ||
660 | /* Return the length of YYSTR. */ | ||
661 | static YYSIZE_T | ||
662 | # if defined (__STDC__) || defined (__cplusplus) | ||
663 | yystrlen (const char *yystr) | ||
664 | # else | ||
665 | yystrlen (yystr) | ||
666 | const char *yystr; | ||
667 | # endif | ||
668 | { | ||
669 | register const char *yys = yystr; | ||
572 | 670 | ||
573 | #else /* __cplusplus */ | 671 | while (*yys++ != '\0') |
672 | continue; | ||
574 | 673 | ||
575 | /* This is the most reliable way to avoid incompatibilities | 674 | return yys - yystr - 1; |
576 | in available built-in functions on various systems. */ | 675 | } |
577 | static void | 676 | # endif |
578 | __yy_memcpy (char *to, char *from, unsigned int count) | 677 | # endif |
678 | |||
679 | # ifndef yystpcpy | ||
680 | # if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE) | ||
681 | # define yystpcpy stpcpy | ||
682 | # else | ||
683 | /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in | ||
684 | YYDEST. */ | ||
685 | static char * | ||
686 | # if defined (__STDC__) || defined (__cplusplus) | ||
687 | yystpcpy (char *yydest, const char *yysrc) | ||
688 | # else | ||
689 | yystpcpy (yydest, yysrc) | ||
690 | char *yydest; | ||
691 | const char *yysrc; | ||
692 | # endif | ||
579 | { | 693 | { |
580 | register char *t = to; | 694 | register char *yyd = yydest; |
581 | register char *f = from; | 695 | register const char *yys = yysrc; |
582 | register int i = count; | ||
583 | 696 | ||
584 | while (i-- > 0) | 697 | while ((*yyd++ = *yys++) != '\0') |
585 | *t++ = *f++; | 698 | continue; |
586 | } | ||
587 | 699 | ||
588 | #endif | 700 | return yyd - 1; |
701 | } | ||
702 | # endif | ||
703 | # endif | ||
589 | #endif | 704 | #endif |
590 | 705 | ||
591 | #line 217 "/usr/share/bison.simple" | 706 | #line 315 "/usr/share/bison/bison.simple" |
707 | |||
592 | 708 | ||
593 | /* The user can define YYPARSE_PARAM as the name of an argument to be passed | 709 | /* The user can define YYPARSE_PARAM as the name of an argument to be passed |
594 | into yyparse. The argument should have type void *. | 710 | into yyparse. The argument should have type void *. |
@@ -597,76 +713,121 @@ __yy_memcpy (char *to, char *from, unsigned int count) | |||
597 | to the proper pointer type. */ | 713 | to the proper pointer type. */ |
598 | 714 | ||
599 | #ifdef YYPARSE_PARAM | 715 | #ifdef YYPARSE_PARAM |
600 | #ifdef __cplusplus | 716 | # if defined (__STDC__) || defined (__cplusplus) |
601 | #define YYPARSE_PARAM_ARG void *YYPARSE_PARAM | 717 | # define YYPARSE_PARAM_ARG void *YYPARSE_PARAM |
602 | #define YYPARSE_PARAM_DECL | 718 | # define YYPARSE_PARAM_DECL |
603 | #else /* not __cplusplus */ | 719 | # else |
604 | #define YYPARSE_PARAM_ARG YYPARSE_PARAM | 720 | # define YYPARSE_PARAM_ARG YYPARSE_PARAM |
605 | #define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; | 721 | # define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; |
606 | #endif /* not __cplusplus */ | 722 | # endif |
607 | #else /* not YYPARSE_PARAM */ | 723 | #else /* !YYPARSE_PARAM */ |
608 | #define YYPARSE_PARAM_ARG | 724 | # define YYPARSE_PARAM_ARG |
609 | #define YYPARSE_PARAM_DECL | 725 | # define YYPARSE_PARAM_DECL |
610 | #endif /* not YYPARSE_PARAM */ | 726 | #endif /* !YYPARSE_PARAM */ |
611 | 727 | ||
612 | /* Prevent warning if -Wstrict-prototypes. */ | 728 | /* Prevent warning if -Wstrict-prototypes. */ |
613 | #if defined (__GNUC__) && ! defined (__cplusplus) | 729 | #ifdef __GNUC__ |
614 | #ifdef YYPARSE_PARAM | 730 | # ifdef YYPARSE_PARAM |
615 | int yyparse (void *); | 731 | int yyparse (void *); |
616 | #else | 732 | # else |
617 | int yyparse (void); | 733 | int yyparse (void); |
734 | # endif | ||
618 | #endif | 735 | #endif |
736 | |||
737 | /* YY_DECL_VARIABLES -- depending whether we use a pure parser, | ||
738 | variables are global, or local to YYPARSE. */ | ||
739 | |||
740 | #define YY_DECL_NON_LSP_VARIABLES \ | ||
741 | /* The lookahead symbol. */ \ | ||
742 | int yychar; \ | ||
743 | \ | ||
744 | /* The semantic value of the lookahead symbol. */\ | ||
745 | YYSTYPE yylval; \ | ||
746 | \ | ||
747 | /* Number of parse errors so far. */ \ | ||
748 | int yynerrs; | ||
749 | |||
750 | #if YYLSP_NEEDED | ||
751 | # define YY_DECL_VARIABLES \ | ||
752 | YY_DECL_NON_LSP_VARIABLES \ | ||
753 | \ | ||
754 | /* Location data for the lookahead symbol. */\ | ||
755 | YYLTYPE yylloc; | ||
756 | #else | ||
757 | # define YY_DECL_VARIABLES \ | ||
758 | YY_DECL_NON_LSP_VARIABLES | ||
619 | #endif | 759 | #endif |
620 | 760 | ||
761 | |||
762 | /* If nonreentrant, generate the variables here. */ | ||
763 | |||
764 | #if !YYPURE | ||
765 | YY_DECL_VARIABLES | ||
766 | #endif /* !YYPURE */ | ||
767 | |||
621 | int | 768 | int |
622 | yyparse(YYPARSE_PARAM_ARG) | 769 | yyparse (YYPARSE_PARAM_ARG) |
623 | YYPARSE_PARAM_DECL | 770 | YYPARSE_PARAM_DECL |
624 | { | 771 | { |
772 | /* If reentrant, generate the variables here. */ | ||
773 | #if YYPURE | ||
774 | YY_DECL_VARIABLES | ||
775 | #endif /* !YYPURE */ | ||
776 | |||
625 | register int yystate; | 777 | register int yystate; |
626 | register int yyn; | 778 | register int yyn; |
779 | int yyresult; | ||
780 | /* Number of tokens to shift before error messages enabled. */ | ||
781 | int yyerrstatus; | ||
782 | /* Lookahead token as an internal (translated) token number. */ | ||
783 | int yychar1 = 0; | ||
784 | |||
785 | /* Three stacks and their tools: | ||
786 | `yyss': related to states, | ||
787 | `yyvs': related to semantic values, | ||
788 | `yyls': related to locations. | ||
789 | |||
790 | Refer to the stacks thru separate pointers, to allow yyoverflow | ||
791 | to reallocate them elsewhere. */ | ||
792 | |||
793 | /* The state stack. */ | ||
794 | shortyyssa[YYINITDEPTH]; | ||
795 | short *yyss = yyssa; | ||
627 | register short *yyssp; | 796 | register short *yyssp; |
628 | register YYSTYPE *yyvsp; | ||
629 | int yyerrstatus;/* number of tokens to shift before error messages enabled */ | ||
630 | int yychar1 = 0; /* lookahead token as an internal (translated) token number */ | ||
631 | 797 | ||
632 | short yyssa[YYINITDEPTH]; /* the state stack */ | 798 | /* The semantic value stack. */ |
633 | YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ | 799 | YYSTYPE yyvsa[YYINITDEPTH]; |
634 | 800 | YYSTYPE *yyvs = yyvsa; | |
635 | short *yyss = yyssa; /* refer to the stacks thru separate pointers */ | 801 | register YYSTYPE *yyvsp; |
636 | YYSTYPE *yyvs = yyvsa;/* to allow yyoverflow to reallocate them elsewhere */ | ||
637 | 802 | ||
638 | #ifdef YYLSP_NEEDED | 803 | #if YYLSP_NEEDED |
639 | YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ | 804 | /* The location stack. */ |
805 | YYLTYPE yylsa[YYINITDEPTH]; | ||
640 | YYLTYPE *yyls = yylsa; | 806 | YYLTYPE *yyls = yylsa; |
641 | YYLTYPE *yylsp; | 807 | YYLTYPE *yylsp; |
808 | #endif | ||
642 | 809 | ||
643 | #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) | 810 | #if YYLSP_NEEDED |
811 | # define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) | ||
644 | #else | 812 | #else |
645 | #define YYPOPSTACK (yyvsp--, yyssp--) | 813 | # define YYPOPSTACK (yyvsp--, yyssp--) |
646 | #endif | 814 | #endif |
647 | 815 | ||
648 | int yystacksize = YYINITDEPTH; | 816 | YYSIZE_T yystacksize = YYINITDEPTH; |
649 | int yyfree_stacks = 0; | ||
650 | 817 | ||
651 | #ifdef YYPURE | ||
652 | int yychar; | ||
653 | YYSTYPE yylval; | ||
654 | int yynerrs; | ||
655 | #ifdef YYLSP_NEEDED | ||
656 | YYLTYPE yylloc; | ||
657 | #endif | ||
658 | #endif | ||
659 | 818 | ||
660 | YYSTYPE yyval; /* the variable used to return */ | 819 | /* The variables used to return semantic value and location from the |
661 | /* semantic values from the action*/ | 820 | action routines. */ |
662 | /* routines */ | 821 | YYSTYPE yyval; |
822 | #if YYLSP_NEEDED | ||
823 | YYLTYPE yyloc; | ||
824 | #endif | ||
663 | 825 | ||
826 | /* When reducing, the number of symbols on the RHS of the reduced | ||
827 | rule. */ | ||
664 | int yylen; | 828 | int yylen; |
665 | 829 | ||
666 | #if YYDEBUG != 0 | 830 | YYDPRINTF ((stderr, "Starting parse\n")); |
667 | if (yydebug) | ||
668 | fprintf(stderr, "Starting parse\n"); | ||
669 | #endif | ||
670 | 831 | ||
671 | yystate = 0; | 832 | yystate = 0; |
672 | yyerrstatus = 0; | 833 | yyerrstatus = 0; |
@@ -678,110 +839,110 @@ yyparse(YYPARSE_PARAM_ARG) | |||
678 | so that they stay on the same level as the state stack. | 839 | so that they stay on the same level as the state stack. |
679 | The wasted elements are never initialized. */ | 840 | The wasted elements are never initialized. */ |
680 | 841 | ||
681 | yyssp = yyss - 1; | 842 | yyssp = yyss; |
682 | yyvsp = yyvs; | 843 | yyvsp = yyvs; |
683 | #ifdef YYLSP_NEEDED | 844 | #if YYLSP_NEEDED |
684 | yylsp = yyls; | 845 | yylsp = yyls; |
685 | #endif | 846 | #endif |
847 | goto yysetstate; | ||
848 | |||
849 | /*------------------------------------------------------------. | ||
850 | | yynewstate -- Push a new state, which is found in yystate. | | ||
851 | `------------------------------------------------------------*/ | ||
852 | yynewstate: | ||
853 | /* In all cases, when you get here, the value and location stacks | ||
854 | have just been pushed. so pushing a state here evens the stacks. | ||
855 | */ | ||
856 | yyssp++; | ||
686 | 857 | ||
687 | /* Push a new state, which is found in yystate . */ | 858 | yysetstate: |
688 | /* In all cases, when you get here, the value and location stacks | 859 | *yyssp = yystate; |
689 | have just been pushed. so pushing a state here evens the stacks. */ | ||
690 | yynewstate: | ||
691 | |||
692 | *++yyssp = yystate; | ||
693 | 860 | ||
694 | if (yyssp >= yyss + yystacksize - 1) | 861 | if (yyssp >= yyss + yystacksize - 1) |
695 | { | 862 | { |
696 | /* Give user a chance to reallocate the stack */ | ||
697 | /* Use copies of these so that the &'s don't force the real ones into memory. */ | ||
698 | YYSTYPE *yyvs1 = yyvs; | ||
699 | short *yyss1 = yyss; | ||
700 | #ifdef YYLSP_NEEDED | ||
701 | YYLTYPE *yyls1 = yyls; | ||
702 | #endif | ||
703 | |||
704 | /* Get the current used size of the three stacks, in elements. */ | 863 | /* Get the current used size of the three stacks, in elements. */ |
705 | int size = yyssp - yyss + 1; | 864 | YYSIZE_T yysize = yyssp - yyss + 1; |
706 | 865 | ||
707 | #ifdef yyoverflow | 866 | #ifdef yyoverflow |
708 | /* Each stack pointer address is followed by the size of | 867 | { |
709 | the data in use in that stack, in bytes. */ | 868 | /* Give user a chance to reallocate the stack. Use copies of |
710 | #ifdef YYLSP_NEEDED | 869 | these so that the &'s don't force the real ones into |
711 | /* This used to be a conditional around just the two extra args, | 870 | memory. */ |
712 | but that might be undefined if yyoverflow is a macro. */ | 871 | YYSTYPE *yyvs1 = yyvs; |
713 | yyoverflow("parser stack overflow", | 872 | short *yyss1 = yyss; |
714 | &yyss1, size * sizeof (*yyssp), | 873 | |
715 | &yyvs1, size * sizeof (*yyvsp), | 874 | /* Each stack pointer address is followed by the size of the |
716 | &yyls1, size * sizeof (*yylsp), | 875 | data in use in that stack, in bytes. */ |
717 | &yystacksize); | 876 | # if YYLSP_NEEDED |
718 | #else | 877 | YYLTYPE *yyls1 = yyls; |
719 | yyoverflow("parser stack overflow", | 878 | /* This used to be a conditional around just the two extra args, |
720 | &yyss1, size * sizeof (*yyssp), | 879 | but that might be undefined if yyoverflow is a macro. */ |
721 | &yyvs1, size * sizeof (*yyvsp), | 880 | yyoverflow ("parser stack overflow", |
722 | &yystacksize); | 881 | &yyss1, yysize * sizeof (*yyssp), |
723 | #endif | 882 | &yyvs1, yysize * sizeof (*yyvsp), |
724 | 883 | &yyls1, yysize * sizeof (*yylsp), | |
725 | yyss = yyss1; yyvs = yyvs1; | 884 | &yystacksize); |
726 | #ifdef YYLSP_NEEDED | 885 | yyls = yyls1; |
727 | yyls = yyls1; | 886 | # else |
728 | #endif | 887 | yyoverflow ("parser stack overflow", |
888 | &yyss1, yysize * sizeof (*yyssp), | ||
889 | &yyvs1, yysize * sizeof (*yyvsp), | ||
890 | &yystacksize); | ||
891 | # endif | ||
892 | yyss = yyss1; | ||
893 | yyvs = yyvs1; | ||
894 | } | ||
729 | #else /* no yyoverflow */ | 895 | #else /* no yyoverflow */ |
896 | # ifndef YYSTACK_RELOCATE | ||
897 | goto yyoverflowlab; | ||
898 | # else | ||
730 | /* Extend the stack our own way. */ | 899 | /* Extend the stack our own way. */ |
731 | if (yystacksize >= YYMAXDEPTH) | 900 | if (yystacksize >= YYMAXDEPTH) |
732 | { | 901 | goto yyoverflowlab; |
733 | yyerror("parser stack overflow"); | ||
734 | if (yyfree_stacks) | ||
735 | { | ||
736 | free (yyss); | ||
737 | free (yyvs); | ||
738 | #ifdef YYLSP_NEEDED | ||
739 | free (yyls); | ||
740 | #endif | ||
741 | } | ||
742 | return 2; | ||
743 | } | ||
744 | yystacksize *= 2; | 902 | yystacksize *= 2; |
745 | if (yystacksize > YYMAXDEPTH) | 903 | if (yystacksize > YYMAXDEPTH) |
746 | yystacksize = YYMAXDEPTH; | 904 | yystacksize = YYMAXDEPTH; |
747 | #ifndef YYSTACK_USE_ALLOCA | 905 | |
748 | yyfree_stacks = 1; | 906 | { |
749 | #endif | 907 | short *yyss1 = yyss; |
750 | yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp)); | 908 | union yyalloc *yyptr = |
751 | __yy_memcpy ((char *)yyss, (char *)yyss1, | 909 | (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); |
752 | size * (unsigned int) sizeof (*yyssp)); | 910 | if (! yyptr) |
753 | yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp)); | 911 | goto yyoverflowlab; |
754 | __yy_memcpy ((char *)yyvs, (char *)yyvs1, | 912 | YYSTACK_RELOCATE (yyss); |
755 | size * (unsigned int) sizeof (*yyvsp)); | 913 | YYSTACK_RELOCATE (yyvs); |
756 | #ifdef YYLSP_NEEDED | 914 | # if YYLSP_NEEDED |
757 | yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp)); | 915 | YYSTACK_RELOCATE (yyls); |
758 | __yy_memcpy ((char *)yyls, (char *)yyls1, | 916 | # endif |
759 | size * (unsigned int) sizeof (*yylsp)); | 917 | # undef YYSTACK_RELOCATE |
760 | #endif | 918 | if (yyss1 != yyssa) |
919 | YYSTACK_FREE (yyss1); | ||
920 | } | ||
921 | # endif | ||
761 | #endif /* no yyoverflow */ | 922 | #endif /* no yyoverflow */ |
762 | 923 | ||
763 | yyssp = yyss + size - 1; | 924 | yyssp = yyss + yysize - 1; |
764 | yyvsp = yyvs + size - 1; | 925 | yyvsp = yyvs + yysize - 1; |
765 | #ifdef YYLSP_NEEDED | 926 | #if YYLSP_NEEDED |
766 | yylsp = yyls + size - 1; | 927 | yylsp = yyls + yysize - 1; |
767 | #endif | 928 | #endif |
768 | 929 | ||
769 | #if YYDEBUG != 0 | 930 | YYDPRINTF ((stderr, "Stack size increased to %lu\n", |
770 | if (yydebug) | 931 | (unsigned long int) yystacksize)); |
771 | fprintf(stderr, "Stack size increased to %d\n", yystacksize); | ||
772 | #endif | ||
773 | 932 | ||
774 | if (yyssp >= yyss + yystacksize - 1) | 933 | if (yyssp >= yyss + yystacksize - 1) |
775 | YYABORT; | 934 | YYABORT; |
776 | } | 935 | } |
777 | 936 | ||
778 | #if YYDEBUG != 0 | 937 | YYDPRINTF ((stderr, "Entering state %d\n", yystate)); |
779 | if (yydebug) | ||
780 | fprintf(stderr, "Entering state %d\n", yystate); | ||
781 | #endif | ||
782 | 938 | ||
783 | goto yybackup; | 939 | goto yybackup; |
784 | yybackup: | 940 | |
941 | |||
942 | /*-----------. | ||
943 | | yybackup. | | ||
944 | `-----------*/ | ||
945 | yybackup: | ||
785 | 946 | ||
786 | /* Do appropriate processing given the current state. */ | 947 | /* Do appropriate processing given the current state. */ |
787 | /* Read a lookahead token if we need one and don't already have one. */ | 948 | /* Read a lookahead token if we need one and don't already have one. */ |
@@ -800,10 +961,7 @@ yynewstate: | |||
800 | 961 | ||
801 | if (yychar == YYEMPTY) | 962 | if (yychar == YYEMPTY) |
802 | { | 963 | { |
803 | #if YYDEBUG != 0 | 964 | YYDPRINTF ((stderr, "Reading a token: ")); |
804 | if (yydebug) | ||
805 | fprintf(stderr, "Reading a token: "); | ||
806 | #endif | ||
807 | yychar = YYLEX; | 965 | yychar = YYLEX; |
808 | } | 966 | } |
809 | 967 | ||
@@ -814,25 +972,25 @@ yynewstate: | |||
814 | yychar1 = 0; | 972 | yychar1 = 0; |
815 | yychar = YYEOF; /* Don't call YYLEX any more */ | 973 | yychar = YYEOF; /* Don't call YYLEX any more */ |
816 | 974 | ||
817 | #if YYDEBUG != 0 | 975 | YYDPRINTF ((stderr, "Now at end of input.\n")); |
818 | if (yydebug) | ||
819 | fprintf(stderr, "Now at end of input.\n"); | ||
820 | #endif | ||
821 | } | 976 | } |
822 | else | 977 | else |
823 | { | 978 | { |
824 | yychar1 = YYTRANSLATE(yychar); | 979 | yychar1 = YYTRANSLATE (yychar); |
825 | 980 | ||
826 | #if YYDEBUG != 0 | 981 | #if YYDEBUG |
982 | /* We have to keep this `#if YYDEBUG', since we use variables | ||
983 | which are defined only if `YYDEBUG' is set. */ | ||
827 | if (yydebug) | 984 | if (yydebug) |
828 | { | 985 | { |
829 | fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); | 986 | YYFPRINTF (stderr, "Next token is %d (%s", |
830 | /* Give the individual parser a way to print the precise meaning | 987 | yychar, yytname[yychar1]); |
831 | of a token, for further debugging info. */ | 988 | /* Give the individual parser a way to print the precise |
832 | #ifdef YYPRINT | 989 | meaning of a token, for further debugging info. */ |
990 | # ifdef YYPRINT | ||
833 | YYPRINT (stderr, yychar, yylval); | 991 | YYPRINT (stderr, yychar, yylval); |
834 | #endif | 992 | # endif |
835 | fprintf (stderr, ")\n"); | 993 | YYFPRINTF (stderr, ")\n"); |
836 | } | 994 | } |
837 | #endif | 995 | #endif |
838 | } | 996 | } |
@@ -864,261 +1022,269 @@ yynewstate: | |||
864 | YYACCEPT; | 1022 | YYACCEPT; |
865 | 1023 | ||
866 | /* Shift the lookahead token. */ | 1024 | /* Shift the lookahead token. */ |
867 | 1025 | YYDPRINTF ((stderr, "Shifting token %d (%s), ", | |
868 | #if YYDEBUG != 0 | 1026 | yychar, yytname[yychar1])); |
869 | if (yydebug) | ||
870 | fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); | ||
871 | #endif | ||
872 | 1027 | ||
873 | /* Discard the token being shifted unless it is eof. */ | 1028 | /* Discard the token being shifted unless it is eof. */ |
874 | if (yychar != YYEOF) | 1029 | if (yychar != YYEOF) |
875 | yychar = YYEMPTY; | 1030 | yychar = YYEMPTY; |
876 | 1031 | ||
877 | *++yyvsp = yylval; | 1032 | *++yyvsp = yylval; |
878 | #ifdef YYLSP_NEEDED | 1033 | #if YYLSP_NEEDED |
879 | *++yylsp = yylloc; | 1034 | *++yylsp = yylloc; |
880 | #endif | 1035 | #endif |
881 | 1036 | ||
882 | /* count tokens shifted since error; after three, turn off error status. */ | 1037 | /* Count tokens shifted since error; after three, turn off error |
883 | if (yyerrstatus) yyerrstatus--; | 1038 | status. */ |
1039 | if (yyerrstatus) | ||
1040 | yyerrstatus--; | ||
884 | 1041 | ||
885 | yystate = yyn; | 1042 | yystate = yyn; |
886 | goto yynewstate; | 1043 | goto yynewstate; |
887 | 1044 | ||
888 | /* Do the default action for the current state. */ | ||
889 | yydefault: | ||
890 | 1045 | ||
1046 | /*-----------------------------------------------------------. | ||
1047 | | yydefault -- do the default action for the current state. | | ||
1048 | `-----------------------------------------------------------*/ | ||
1049 | yydefault: | ||
891 | yyn = yydefact[yystate]; | 1050 | yyn = yydefact[yystate]; |
892 | if (yyn == 0) | 1051 | if (yyn == 0) |
893 | goto yyerrlab; | 1052 | goto yyerrlab; |
1053 | goto yyreduce; | ||
894 | 1054 | ||
895 | /* Do a reduction. yyn is the number of a rule to reduce with. */ | 1055 | |
1056 | /*-----------------------------. | ||
1057 | | yyreduce -- Do a reduction. | | ||
1058 | `-----------------------------*/ | ||
896 | yyreduce: | 1059 | yyreduce: |
1060 | /* yyn is the number of a rule to reduce with. */ | ||
897 | yylen = yyr2[yyn]; | 1061 | yylen = yyr2[yyn]; |
898 | if (yylen > 0) | ||
899 | yyval = yyvsp[1-yylen]; /* implement default value of the action */ | ||
900 | 1062 | ||
901 | #if YYDEBUG != 0 | 1063 | /* If YYLEN is nonzero, implement the default value of the action: |
1064 | `$$ = $1'. | ||
1065 | |||
1066 | Otherwise, the following line sets YYVAL to the semantic value of | ||
1067 | the lookahead token. This behavior is undocumented and Bison | ||
1068 | users should not rely upon it. Assigning to YYVAL | ||
1069 | unconditionally makes the parser a bit smaller, and it avoids a | ||
1070 | GCC warning that YYVAL may be used uninitialized. */ | ||
1071 | yyval = yyvsp[1-yylen]; | ||
1072 | |||
1073 | #if YYLSP_NEEDED | ||
1074 | /* Similarly for the default location. Let the user run additional | ||
1075 | commands if for instance locations are ranges. */ | ||
1076 | yyloc = yylsp[1-yylen]; | ||
1077 | YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); | ||
1078 | #endif | ||
1079 | |||
1080 | #if YYDEBUG | ||
1081 | /* We have to keep this `#if YYDEBUG', since we use variables which | ||
1082 | are defined only if `YYDEBUG' is set. */ | ||
902 | if (yydebug) | 1083 | if (yydebug) |
903 | { | 1084 | { |
904 | int i; | 1085 | int yyi; |
905 | 1086 | ||
906 | fprintf (stderr, "Reducing via rule %d (line %d), ", | 1087 | YYFPRINTF (stderr, "Reducing via rule %d (line %d), ", |
907 | yyn, yyrline[yyn]); | 1088 | yyn, yyrline[yyn]); |
908 | 1089 | ||
909 | /* Print the symbols being reduced, and their result. */ | 1090 | /* Print the symbols being reduced, and their result. */ |
910 | for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) | 1091 | for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++) |
911 | fprintf (stderr, "%s ", yytname[yyrhs[i]]); | 1092 | YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); |
912 | fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); | 1093 | YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]); |
913 | } | 1094 | } |
914 | #endif | 1095 | #endif |
915 | 1096 | ||
916 | |||
917 | switch (yyn) { | 1097 | switch (yyn) { |
918 | 1098 | ||
919 | case 2: | 1099 | case 2: |
920 | #line 213 "./vcc.y" | 1100 | #line 212 "vcc.y" |
921 | { addList(&vObjList, yyvsp[0].vobj); curObj = 0; ; | 1101 | { addList(&vObjList, yyvsp[0].vobj); curObj = 0; } |
922 | break;} | 1102 | break; |
923 | case 4: | 1103 | case 4: |
924 | #line 216 "./vcc.y" | 1104 | #line 215 "vcc.y" |
925 | { addList(&vObjList, yyvsp[0].vobj); curObj = 0; ; | 1105 | { addList(&vObjList, yyvsp[0].vobj); curObj = 0; } |
926 | break;} | 1106 | break; |
927 | case 7: | 1107 | case 7: |
928 | #line 225 "./vcc.y" | 1108 | #line 224 "vcc.y" |
929 | { | 1109 | { |
930 | lexPushMode(L_VCARD); | 1110 | lexPushMode(L_VCARD); |
931 | if (!pushVObject(VCCardProp)) YYERROR; | 1111 | if (!pushVObject(VCCardProp)) YYERROR; |
932 | ; | 1112 | } |
933 | break;} | 1113 | break; |
934 | case 8: | 1114 | case 8: |
935 | #line 230 "./vcc.y" | 1115 | #line 229 "vcc.y" |
936 | { | 1116 | { |
937 | lexPopMode(0); | 1117 | lexPopMode(0); |
938 | yyval.vobj = popVObject(); | 1118 | yyval.vobj = popVObject(); |
939 | ; | 1119 | } |
940 | break;} | 1120 | break; |
941 | case 9: | 1121 | case 9: |
942 | #line 235 "./vcc.y" | 1122 | #line 234 "vcc.y" |
943 | { | 1123 | { |
944 | lexPushMode(L_VCARD); | 1124 | lexPushMode(L_VCARD); |
945 | if (!pushVObject(VCCardProp)) YYERROR; | 1125 | if (!pushVObject(VCCardProp)) YYERROR; |
946 | ; | 1126 | } |
947 | break;} | 1127 | break; |
948 | case 10: | 1128 | case 10: |
949 | #line 240 "./vcc.y" | 1129 | #line 239 "vcc.y" |
950 | { | 1130 | { |
951 | lexPopMode(0); | 1131 | lexPopMode(0); |
952 | yyval.vobj = popVObject(); | 1132 | yyval.vobj = popVObject(); |
953 | ; | 1133 | } |
954 | break;} | 1134 | break; |
955 | case 13: | 1135 | case 13: |
956 | #line 251 "./vcc.y" | 1136 | #line 250 "vcc.y" |
957 | { | 1137 | { |
958 | lexPushMode(L_VALUES); | 1138 | lexPushMode(L_VALUES); |
959 | ; | 1139 | } |
960 | break;} | 1140 | break; |
961 | case 14: | 1141 | case 14: |
962 | #line 255 "./vcc.y" | 1142 | #line 254 "vcc.y" |
963 | { | 1143 | { |
964 | if (lexWithinMode(L_BASE64) || lexWithinMode(L_QUOTED_PRINTABLE)) | 1144 | if (lexWithinMode(L_BASE64) || lexWithinMode(L_QUOTED_PRINTABLE)) |
965 | lexPopMode(0); | 1145 | lexPopMode(0); |
966 | lexPopMode(0); | 1146 | lexPopMode(0); |
967 | ; | 1147 | } |
968 | break;} | 1148 | break; |
969 | case 16: | 1149 | case 16: |
970 | #line 264 "./vcc.y" | 1150 | #line 263 "vcc.y" |
971 | { | 1151 | { |
972 | enterProps(yyvsp[0].str); | 1152 | enterProps(yyvsp[0].str); |
973 | ; | 1153 | } |
974 | break;} | 1154 | break; |
975 | case 18: | 1155 | case 18: |
976 | #line 269 "./vcc.y" | 1156 | #line 268 "vcc.y" |
977 | { | 1157 | { |
978 | enterProps(yyvsp[0].str); | 1158 | enterProps(yyvsp[0].str); |
979 | ; | 1159 | } |
980 | break;} | 1160 | break; |
981 | case 22: | 1161 | case 22: |
982 | #line 282 "./vcc.y" | 1162 | #line 281 "vcc.y" |
983 | { | 1163 | { |
984 | enterAttr(yyvsp[0].str,0); | 1164 | enterAttr(yyvsp[0].str,0); |
985 | ; | 1165 | } |
986 | break;} | 1166 | break; |
987 | case 23: | 1167 | case 23: |
988 | #line 286 "./vcc.y" | 1168 | #line 285 "vcc.y" |
989 | { | 1169 | { |
990 | enterAttr(yyvsp[-2].str,yyvsp[0].str); | 1170 | enterAttr(yyvsp[-2].str,yyvsp[0].str); |
991 | 1171 | ||
992 | ; | 1172 | } |
993 | break;} | 1173 | break; |
994 | case 25: | 1174 | case 25: |
995 | #line 295 "./vcc.y" | 1175 | #line 294 "vcc.y" |
996 | { appendValue(yyvsp[-1].str); ; | 1176 | { enterValues(yyvsp[-1].str); } |
997 | break;} | 1177 | break; |
998 | case 27: | 1178 | case 27: |
999 | #line 297 "./vcc.y" | 1179 | #line 296 "vcc.y" |
1000 | { appendValue(yyvsp[0].str); ; | 1180 | { enterValues(yyvsp[0].str); } |
1001 | break;} | 1181 | break; |
1002 | case 29: | 1182 | case 29: |
1003 | #line 302 "./vcc.y" | 1183 | #line 300 "vcc.y" |
1004 | { yyval.str = 0; ; | 1184 | { yyval.str = 0; } |
1005 | break;} | 1185 | break; |
1006 | case 30: | 1186 | case 30: |
1007 | #line 307 "./vcc.y" | 1187 | #line 305 "vcc.y" |
1008 | { if (!pushVObject(VCCalProp)) YYERROR; ; | 1188 | { if (!pushVObject(VCCalProp)) YYERROR; } |
1009 | break;} | 1189 | break; |
1010 | case 31: | 1190 | case 31: |
1011 | #line 310 "./vcc.y" | 1191 | #line 308 "vcc.y" |
1012 | { yyval.vobj = popVObject(); ; | 1192 | { yyval.vobj = popVObject(); } |
1013 | break;} | 1193 | break; |
1014 | case 32: | 1194 | case 32: |
1015 | #line 312 "./vcc.y" | 1195 | #line 310 "vcc.y" |
1016 | { if (!pushVObject(VCCalProp)) YYERROR; ; | 1196 | { if (!pushVObject(VCCalProp)) YYERROR; } |
1017 | break;} | 1197 | break; |
1018 | case 33: | 1198 | case 33: |
1019 | #line 314 "./vcc.y" | 1199 | #line 312 "vcc.y" |
1020 | { yyval.vobj = popVObject(); ; | 1200 | { yyval.vobj = popVObject(); } |
1021 | break;} | 1201 | break; |
1022 | case 39: | 1202 | case 39: |
1023 | #line 329 "./vcc.y" | 1203 | #line 327 "vcc.y" |
1024 | { | 1204 | { |
1025 | lexPushMode(L_VEVENT); | 1205 | lexPushMode(L_VEVENT); |
1026 | if (!pushVObject(VCEventProp)) YYERROR; | 1206 | if (!pushVObject(VCEventProp)) YYERROR; |
1027 | ; | 1207 | } |
1028 | break;} | 1208 | break; |
1029 | case 40: | 1209 | case 40: |
1030 | #line 335 "./vcc.y" | 1210 | #line 333 "vcc.y" |
1031 | { | 1211 | { |
1032 | lexPopMode(0); | 1212 | lexPopMode(0); |
1033 | popVObject(); | 1213 | popVObject(); |
1034 | ; | 1214 | } |
1035 | break;} | 1215 | break; |
1036 | case 41: | 1216 | case 41: |
1037 | #line 340 "./vcc.y" | 1217 | #line 338 "vcc.y" |
1038 | { | 1218 | { |
1039 | lexPushMode(L_VEVENT); | 1219 | lexPushMode(L_VEVENT); |
1040 | if (!pushVObject(VCEventProp)) YYERROR; | 1220 | if (!pushVObject(VCEventProp)) YYERROR; |
1041 | ; | 1221 | } |
1042 | break;} | 1222 | break; |
1043 | case 42: | 1223 | case 42: |
1044 | #line 345 "./vcc.y" | 1224 | #line 343 "vcc.y" |
1045 | { | 1225 | { |
1046 | lexPopMode(0); | 1226 | lexPopMode(0); |
1047 | popVObject(); | 1227 | popVObject(); |
1048 | ; | 1228 | } |
1049 | break;} | 1229 | break; |
1050 | case 43: | 1230 | case 43: |
1051 | #line 353 "./vcc.y" | 1231 | #line 351 "vcc.y" |
1052 | { | 1232 | { |
1053 | lexPushMode(L_VTODO); | 1233 | lexPushMode(L_VTODO); |
1054 | if (!pushVObject(VCTodoProp)) YYERROR; | 1234 | if (!pushVObject(VCTodoProp)) YYERROR; |
1055 | ; | 1235 | } |
1056 | break;} | 1236 | break; |
1057 | case 44: | 1237 | case 44: |
1058 | #line 359 "./vcc.y" | 1238 | #line 357 "vcc.y" |
1059 | { | 1239 | { |
1060 | lexPopMode(0); | 1240 | lexPopMode(0); |
1061 | popVObject(); | 1241 | popVObject(); |
1062 | ; | 1242 | } |
1063 | break;} | 1243 | break; |
1064 | case 45: | 1244 | case 45: |
1065 | #line 364 "./vcc.y" | 1245 | #line 362 "vcc.y" |
1066 | { | 1246 | { |
1067 | lexPushMode(L_VTODO); | 1247 | lexPushMode(L_VTODO); |
1068 | if (!pushVObject(VCTodoProp)) YYERROR; | 1248 | if (!pushVObject(VCTodoProp)) YYERROR; |
1069 | ; | 1249 | } |
1070 | break;} | 1250 | break; |
1071 | case 46: | 1251 | case 46: |
1072 | #line 369 "./vcc.y" | 1252 | #line 367 "vcc.y" |
1073 | { | 1253 | { |
1074 | lexPopMode(0); | 1254 | lexPopMode(0); |
1075 | popVObject(); | 1255 | popVObject(); |
1076 | ; | 1256 | } |
1077 | break;} | 1257 | break; |
1078 | } | 1258 | } |
1079 | /* the action file gets copied in in place of this dollarsign */ | ||
1080 | #line 543 "/usr/share/bison.simple" | ||
1081 | 1259 | ||
1260 | #line 705 "/usr/share/bison/bison.simple" | ||
1261 | |||
1262 | |||
1082 | yyvsp -= yylen; | 1263 | yyvsp -= yylen; |
1083 | yyssp -= yylen; | 1264 | yyssp -= yylen; |
1084 | #ifdef YYLSP_NEEDED | 1265 | #if YYLSP_NEEDED |
1085 | yylsp -= yylen; | 1266 | yylsp -= yylen; |
1086 | #endif | 1267 | #endif |
1087 | 1268 | ||
1088 | #if YYDEBUG != 0 | 1269 | #if YYDEBUG |
1089 | if (yydebug) | 1270 | if (yydebug) |
1090 | { | 1271 | { |
1091 | short *ssp1 = yyss - 1; | 1272 | short *yyssp1 = yyss - 1; |
1092 | fprintf (stderr, "state stack now"); | 1273 | YYFPRINTF (stderr, "state stack now"); |
1093 | while (ssp1 != yyssp) | 1274 | while (yyssp1 != yyssp) |
1094 | fprintf (stderr, " %d", *++ssp1); | 1275 | YYFPRINTF (stderr, " %d", *++yyssp1); |
1095 | fprintf (stderr, "\n"); | 1276 | YYFPRINTF (stderr, "\n"); |
1096 | } | 1277 | } |
1097 | #endif | 1278 | #endif |
1098 | 1279 | ||
1099 | *++yyvsp = yyval; | 1280 | *++yyvsp = yyval; |
1100 | 1281 | #if YYLSP_NEEDED | |
1101 | #ifdef YYLSP_NEEDED | 1282 | *++yylsp = yyloc; |
1102 | yylsp++; | ||
1103 | if (yylen == 0) | ||
1104 | { | ||
1105 | yylsp->first_line = yylloc.first_line; | ||
1106 | yylsp->first_column = yylloc.first_column; | ||
1107 | yylsp->last_line = (yylsp-1)->last_line; | ||
1108 | yylsp->last_column = (yylsp-1)->last_column; | ||
1109 | yylsp->text = 0; | ||
1110 | } | ||
1111 | else | ||
1112 | { | ||
1113 | yylsp->last_line = (yylsp+yylen-1)->last_line; | ||
1114 | yylsp->last_column = (yylsp+yylen-1)->last_column; | ||
1115 | } | ||
1116 | #endif | 1283 | #endif |
1117 | 1284 | ||
1118 | /* Now "shift" the result of the reduction. | 1285 | /* Now `shift' the result of the reduction. Determine what state |
1119 | Determine what state that goes to, | 1286 | that goes to, based on the state we popped back to and the rule |
1120 | based on the state we popped back to | 1287 | number reduced by. */ |
1121 | and the rule number reduced by. */ | ||
1122 | 1288 | ||
1123 | yyn = yyr1[yyn]; | 1289 | yyn = yyr1[yyn]; |
1124 | 1290 | ||
@@ -1130,10 +1296,13 @@ case 46: | |||
1130 | 1296 | ||
1131 | goto yynewstate; | 1297 | goto yynewstate; |
1132 | 1298 | ||
1133 | yyerrlab: /* here on detecting error */ | ||
1134 | 1299 | ||
1135 | if (! yyerrstatus) | 1300 | /*------------------------------------. |
1136 | /* If not already recovering from an error, report this error. */ | 1301 | | yyerrlab -- here on detecting error | |
1302 | `------------------------------------*/ | ||
1303 | yyerrlab: | ||
1304 | /* If not already recovering from an error, report this error. */ | ||
1305 | if (!yyerrstatus) | ||
1137 | { | 1306 | { |
1138 | ++yynerrs; | 1307 | ++yynerrs; |
1139 | 1308 | ||
@@ -1142,102 +1311,121 @@ yyerrlab: /* here on detecting error */ | |||
1142 | 1311 | ||
1143 | if (yyn > YYFLAG && yyn < YYLAST) | 1312 | if (yyn > YYFLAG && yyn < YYLAST) |
1144 | { | 1313 | { |
1145 | int size = 0; | 1314 | YYSIZE_T yysize = 0; |
1146 | char *msg; | 1315 | char *yymsg; |
1147 | int x, count; | 1316 | int yyx, yycount; |
1148 | 1317 | ||
1149 | count = 0; | 1318 | yycount = 0; |
1150 | /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ | 1319 | /* Start YYX at -YYN if negative to avoid negative indexes in |
1151 | for (x = (yyn < 0 ? -yyn : 0); | 1320 | YYCHECK. */ |
1152 | x < (sizeof(yytname) / sizeof(char *)); x++) | 1321 | for (yyx = yyn < 0 ? -yyn : 0; |
1153 | if (yycheck[x + yyn] == x) | 1322 | yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) |
1154 | size += strlen(yytname[x]) + 15, count++; | 1323 | if (yycheck[yyx + yyn] == yyx) |
1155 | msg = (char *) malloc(size + 15); | 1324 | yysize += yystrlen (yytname[yyx]) + 15, yycount++; |
1156 | if (msg != 0) | 1325 | yysize += yystrlen ("parse error, unexpected ") + 1; |
1326 | yysize += yystrlen (yytname[YYTRANSLATE (yychar)]); | ||
1327 | yymsg = (char *) YYSTACK_ALLOC (yysize); | ||
1328 | if (yymsg != 0) | ||
1157 | { | 1329 | { |
1158 | strcpy(msg, "parse error"); | 1330 | char *yyp = yystpcpy (yymsg, "parse error, unexpected "); |
1331 | yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]); | ||
1159 | 1332 | ||
1160 | if (count < 5) | 1333 | if (yycount < 5) |
1161 | { | 1334 | { |
1162 | count = 0; | 1335 | yycount = 0; |
1163 | for (x = (yyn < 0 ? -yyn : 0); | 1336 | for (yyx = yyn < 0 ? -yyn : 0; |
1164 | x < (sizeof(yytname) / sizeof(char *)); x++) | 1337 | yyx < (int) (sizeof (yytname) / sizeof (char *)); |
1165 | if (yycheck[x + yyn] == x) | 1338 | yyx++) |
1339 | if (yycheck[yyx + yyn] == yyx) | ||
1166 | { | 1340 | { |
1167 | strcat(msg, count == 0 ? ", expecting `" : " or `"); | 1341 | const char *yyq = ! yycount ? ", expecting " : " or "; |
1168 | strcat(msg, yytname[x]); | 1342 | yyp = yystpcpy (yyp, yyq); |
1169 | strcat(msg, "'"); | 1343 | yyp = yystpcpy (yyp, yytname[yyx]); |
1170 | count++; | 1344 | yycount++; |
1171 | } | 1345 | } |
1172 | } | 1346 | } |
1173 | yyerror(msg); | 1347 | yyerror (yymsg); |
1174 | free(msg); | 1348 | YYSTACK_FREE (yymsg); |
1175 | } | 1349 | } |
1176 | else | 1350 | else |
1177 | yyerror ("parse error; also virtual memory exceeded"); | 1351 | yyerror ("parse error; also virtual memory exhausted"); |
1178 | } | 1352 | } |
1179 | else | 1353 | else |
1180 | #endif /* YYERROR_VERBOSE */ | 1354 | #endif /* defined (YYERROR_VERBOSE) */ |
1181 | yyerror("parse error"); | 1355 | yyerror ("parse error"); |
1182 | } | 1356 | } |
1183 | |||
1184 | goto yyerrlab1; | 1357 | goto yyerrlab1; |
1185 | yyerrlab1: /* here on error raised explicitly by an action */ | ||
1186 | 1358 | ||
1359 | |||
1360 | /*--------------------------------------------------. | ||
1361 | | yyerrlab1 -- error raised explicitly by an action | | ||
1362 | `--------------------------------------------------*/ | ||
1363 | yyerrlab1: | ||
1187 | if (yyerrstatus == 3) | 1364 | if (yyerrstatus == 3) |
1188 | { | 1365 | { |
1189 | /* if just tried and failed to reuse lookahead token after an error, discard it. */ | 1366 | /* If just tried and failed to reuse lookahead token after an |
1367 | error, discard it. */ | ||
1190 | 1368 | ||
1191 | /* return failure if at end of input */ | 1369 | /* return failure if at end of input */ |
1192 | if (yychar == YYEOF) | 1370 | if (yychar == YYEOF) |
1193 | YYABORT; | 1371 | YYABORT; |
1194 | 1372 | YYDPRINTF ((stderr, "Discarding token %d (%s).\n", | |
1195 | #if YYDEBUG != 0 | 1373 | yychar, yytname[yychar1])); |
1196 | if (yydebug) | ||
1197 | fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); | ||
1198 | #endif | ||
1199 | |||
1200 | yychar = YYEMPTY; | 1374 | yychar = YYEMPTY; |
1201 | } | 1375 | } |
1202 | 1376 | ||
1203 | /* Else will try to reuse lookahead token | 1377 | /* Else will try to reuse lookahead token after shifting the error |
1204 | after shifting the error token. */ | 1378 | token. */ |
1205 | 1379 | ||
1206 | yyerrstatus = 3; /* Each real token shifted decrements this */ | 1380 | yyerrstatus = 3; /* Each real token shifted decrements this */ |
1207 | 1381 | ||
1208 | goto yyerrhandle; | 1382 | goto yyerrhandle; |
1209 | 1383 | ||
1210 | yyerrdefault: /* current state does not do anything special for the error token. */ | ||
1211 | 1384 | ||
1385 | /*-------------------------------------------------------------------. | ||
1386 | | yyerrdefault -- current state does not do anything special for the | | ||
1387 | | error token. | | ||
1388 | `-------------------------------------------------------------------*/ | ||
1389 | yyerrdefault: | ||
1212 | #if 0 | 1390 | #if 0 |
1213 | /* This is wrong; only states that explicitly want error tokens | 1391 | /* This is wrong; only states that explicitly want error tokens |
1214 | should shift them. */ | 1392 | should shift them. */ |
1215 | yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ | 1393 | |
1216 | if (yyn) goto yydefault; | 1394 | /* If its default is to accept any token, ok. Otherwise pop it. */ |
1395 | yyn = yydefact[yystate]; | ||
1396 | if (yyn) | ||
1397 | goto yydefault; | ||
1217 | #endif | 1398 | #endif |
1218 | 1399 | ||
1219 | yyerrpop: /* pop the current state because it cannot handle the error token */ | ||
1220 | 1400 | ||
1221 | if (yyssp == yyss) YYABORT; | 1401 | /*---------------------------------------------------------------. |
1402 | | yyerrpop -- pop the current state because it cannot handle the | | ||
1403 | | error token | | ||
1404 | `---------------------------------------------------------------*/ | ||
1405 | yyerrpop: | ||
1406 | if (yyssp == yyss) | ||
1407 | YYABORT; | ||
1222 | yyvsp--; | 1408 | yyvsp--; |
1223 | yystate = *--yyssp; | 1409 | yystate = *--yyssp; |
1224 | #ifdef YYLSP_NEEDED | 1410 | #if YYLSP_NEEDED |
1225 | yylsp--; | 1411 | yylsp--; |
1226 | #endif | 1412 | #endif |
1227 | 1413 | ||
1228 | #if YYDEBUG != 0 | 1414 | #if YYDEBUG |
1229 | if (yydebug) | 1415 | if (yydebug) |
1230 | { | 1416 | { |
1231 | short *ssp1 = yyss - 1; | 1417 | short *yyssp1 = yyss - 1; |
1232 | fprintf (stderr, "Error: state stack now"); | 1418 | YYFPRINTF (stderr, "Error: state stack now"); |
1233 | while (ssp1 != yyssp) | 1419 | while (yyssp1 != yyssp) |
1234 | fprintf (stderr, " %d", *++ssp1); | 1420 | YYFPRINTF (stderr, " %d", *++yyssp1); |
1235 | fprintf (stderr, "\n"); | 1421 | YYFPRINTF (stderr, "\n"); |
1236 | } | 1422 | } |
1237 | #endif | 1423 | #endif |
1238 | 1424 | ||
1425 | /*--------------. | ||
1426 | | yyerrhandle. | | ||
1427 | `--------------*/ | ||
1239 | yyerrhandle: | 1428 | yyerrhandle: |
1240 | |||
1241 | yyn = yypact[yystate]; | 1429 | yyn = yypact[yystate]; |
1242 | if (yyn == YYFLAG) | 1430 | if (yyn == YYFLAG) |
1243 | goto yyerrdefault; | 1431 | goto yyerrdefault; |
@@ -1260,46 +1448,48 @@ yyerrhandle: | |||
1260 | if (yyn == YYFINAL) | 1448 | if (yyn == YYFINAL) |
1261 | YYACCEPT; | 1449 | YYACCEPT; |
1262 | 1450 | ||
1263 | #if YYDEBUG != 0 | 1451 | YYDPRINTF ((stderr, "Shifting error token, ")); |
1264 | if (yydebug) | ||
1265 | fprintf(stderr, "Shifting error token, "); | ||
1266 | #endif | ||
1267 | 1452 | ||
1268 | *++yyvsp = yylval; | 1453 | *++yyvsp = yylval; |
1269 | #ifdef YYLSP_NEEDED | 1454 | #if YYLSP_NEEDED |
1270 | *++yylsp = yylloc; | 1455 | *++yylsp = yylloc; |
1271 | #endif | 1456 | #endif |
1272 | 1457 | ||
1273 | yystate = yyn; | 1458 | yystate = yyn; |
1274 | goto yynewstate; | 1459 | goto yynewstate; |
1275 | 1460 | ||
1276 | yyacceptlab: | ||
1277 | /* YYACCEPT comes here. */ | ||
1278 | if (yyfree_stacks) | ||
1279 | { | ||
1280 | free (yyss); | ||
1281 | free (yyvs); | ||
1282 | #ifdef YYLSP_NEEDED | ||
1283 | free (yyls); | ||
1284 | #endif | ||
1285 | } | ||
1286 | return 0; | ||
1287 | 1461 | ||
1288 | yyabortlab: | 1462 | /*-------------------------------------. |
1289 | /* YYABORT comes here. */ | 1463 | | yyacceptlab -- YYACCEPT comes here. | |
1290 | if (yyfree_stacks) | 1464 | `-------------------------------------*/ |
1291 | { | 1465 | yyacceptlab: |
1292 | free (yyss); | 1466 | yyresult = 0; |
1293 | free (yyvs); | 1467 | goto yyreturn; |
1294 | #ifdef YYLSP_NEEDED | 1468 | |
1295 | free (yyls); | 1469 | /*-----------------------------------. |
1470 | | yyabortlab -- YYABORT comes here. | | ||
1471 | `-----------------------------------*/ | ||
1472 | yyabortlab: | ||
1473 | yyresult = 1; | ||
1474 | goto yyreturn; | ||
1475 | |||
1476 | /*---------------------------------------------. | ||
1477 | | yyoverflowab -- parser overflow comes here. | | ||
1478 | `---------------------------------------------*/ | ||
1479 | yyoverflowlab: | ||
1480 | yyerror ("parser stack overflow"); | ||
1481 | yyresult = 2; | ||
1482 | /* Fall through. */ | ||
1483 | |||
1484 | yyreturn: | ||
1485 | #ifndef yyoverflow | ||
1486 | if (yyss != yyssa) | ||
1487 | YYSTACK_FREE (yyss); | ||
1296 | #endif | 1488 | #endif |
1297 | } | 1489 | return yyresult; |
1298 | return 1; | ||
1299 | } | 1490 | } |
1300 | #line 375 "./vcc.y" | 1491 | #line 373 "vcc.y" |
1301 | 1492 | ||
1302 | /****************************************************************************/ | ||
1303 | static int pushVObject(const char *prop) | 1493 | static int pushVObject(const char *prop) |
1304 | { | 1494 | { |
1305 | VObject *newObj; | 1495 | VObject *newObj; |
@@ -1319,7 +1509,6 @@ static int pushVObject(const char *prop) | |||
1319 | } | 1509 | } |
1320 | 1510 | ||
1321 | 1511 | ||
1322 | /****************************************************************************/ | ||
1323 | /* This pops the recently built vCard off the stack and returns it. */ | 1512 | /* This pops the recently built vCard off the stack and returns it. */ |
1324 | static VObject* popVObject() | 1513 | static VObject* popVObject() |
1325 | { | 1514 | { |
@@ -1335,59 +1524,44 @@ static VObject* popVObject() | |||
1335 | } | 1524 | } |
1336 | 1525 | ||
1337 | 1526 | ||
1338 | /* static void enterValues(const char *value) */ | 1527 | static void enterValues(const char *value) |
1339 | /* { */ | 1528 | { |
1340 | /* if (fieldedProp && *fieldedProp) { */ | 1529 | if (fieldedProp && *fieldedProp) { |
1341 | /* if (value) { */ | 1530 | if (value) { |
1342 | /* addPropValue(curProp,*fieldedProp,value); */ | 1531 | addPropValue(curProp,*fieldedProp,value); |
1343 | /* } */ | 1532 | } |
1344 | /* else this field is empty, advance to next field */ | 1533 | /* else this field is empty, advance to next field */ |
1345 | /* fieldedProp++; */ | 1534 | fieldedProp++; |
1346 | /* } */ | 1535 | } |
1347 | /* else { */ | 1536 | else { |
1348 | /* if (value) { */ | 1537 | if (value) { |
1349 | /* setVObjectUStringZValue_(curProp,fakeUnicode(value,0)); */ | 1538 | char *p1, *p2; |
1350 | /* } */ | 1539 | wchar_t *p3; |
1351 | /* } */ | 1540 | int i; |
1352 | /* deleteStr(value); */ | 1541 | |
1353 | /* } */ | 1542 | /* If the property already has a string value, we append this one, |
1354 | 1543 | using ';' to separate the values. */ | |
1355 | static void appendValue(const char *value) | 1544 | if (vObjectUStringZValue(curProp)) { |
1356 | { | 1545 | p1 = fakeCString(vObjectUStringZValue(curProp)); |
1357 | char *p1, *p2; | 1546 | p2 = malloc((strlen(p1)+strlen(value)+1)); |
1358 | wchar_t *p3; | 1547 | strcpy(p2, p1); |
1359 | int i; | 1548 | deleteStr(p1); |
1360 | 1549 | ||
1361 | if (fieldedProp && *fieldedProp) { | 1550 | i = strlen(p2); |
1362 | if (value) { | 1551 | p2[i] = ';'; |
1363 | addPropValue(curProp, *fieldedProp, value); | 1552 | p2[i+1] = '\0'; |
1553 | p2 = strcat(p2, value); | ||
1554 | p3 = (wchar_t *) vObjectUStringZValue(curProp); | ||
1555 | free(p3); | ||
1556 | setVObjectUStringZValue_(curProp,fakeUnicode(p2,0)); | ||
1557 | deleteStr(p2); | ||
1558 | } else { | ||
1559 | setVObjectUStringZValue_(curProp,fakeUnicode(value,0)); | ||
1560 | } | ||
1561 | } | ||
1364 | } | 1562 | } |
1365 | /* else this field is empty, advance to next field */ | 1563 | deleteStr(value); |
1366 | fieldedProp++; | ||
1367 | } else { | ||
1368 | if (value) { | ||
1369 | if (vObjectUStringZValue(curProp)) { | ||
1370 | p1 = fakeCString(vObjectUStringZValue(curProp)); | ||
1371 | p2 = malloc(sizeof(char *) * (strlen(p1)+strlen(value)+1)); | ||
1372 | strcpy(p2, p1); | ||
1373 | deleteStr(p1); | ||
1374 | |||
1375 | i = strlen(p2); | ||
1376 | p2[i] = ','; | ||
1377 | p2[i+1] = '\0'; | ||
1378 | p2 = strcat(p2, value); | ||
1379 | p3 = (wchar_t *) vObjectUStringZValue(curProp); | ||
1380 | free(p3); | ||
1381 | setVObjectUStringZValue_(curProp,fakeUnicode(p2,0)); | ||
1382 | deleteStr(p2); | ||
1383 | } else { | ||
1384 | setVObjectUStringZValue_(curProp,fakeUnicode(value,0)); | ||
1385 | } | ||
1386 | } | 1564 | } |
1387 | } | ||
1388 | deleteStr(value); | ||
1389 | } | ||
1390 | |||
1391 | 1565 | ||
1392 | static void enterProps(const char *s) | 1566 | static void enterProps(const char *s) |
1393 | { | 1567 | { |
@@ -1397,7 +1571,7 @@ static void enterProps(const char *s) | |||
1397 | 1571 | ||
1398 | static void enterAttr(const char *s1, const char *s2) | 1572 | static void enterAttr(const char *s1, const char *s2) |
1399 | { | 1573 | { |
1400 | const char *p1=0L, *p2=0L; | 1574 | const char *p1, *p2; |
1401 | p1 = lookupProp_(s1); | 1575 | p1 = lookupProp_(s1); |
1402 | if (s2) { | 1576 | if (s2) { |
1403 | VObject *a; | 1577 | VObject *a; |
@@ -1407,10 +1581,10 @@ static void enterAttr(const char *s1, const char *s2) | |||
1407 | } | 1581 | } |
1408 | else | 1582 | else |
1409 | addProp(curProp,p1); | 1583 | addProp(curProp,p1); |
1410 | if (strcasecmp(p1,VCBase64Prop) == 0 || (s2 && strcasecmp(p2,VCBase64Prop)==0)) | 1584 | if (stricmp(p1,VCBase64Prop) == 0 || (s2 && stricmp(p2,VCBase64Prop)==0)) |
1411 | lexPushMode(L_BASE64); | 1585 | lexPushMode(L_BASE64); |
1412 | else if (strcasecmp(p1,VCQuotedPrintableProp) == 0 | 1586 | else if (stricmp(p1,VCQuotedPrintableProp) == 0 |
1413 | || (s2 && strcasecmp(p2,VCQuotedPrintableProp)==0)) | 1587 | || (s2 && stricmp(p2,VCQuotedPrintableProp)==0)) |
1414 | lexPushMode(L_QUOTED_PRINTABLE); | 1588 | lexPushMode(L_QUOTED_PRINTABLE); |
1415 | deleteStr(s1); deleteStr(s2); | 1589 | deleteStr(s1); deleteStr(s2); |
1416 | } | 1590 | } |
@@ -1423,7 +1597,11 @@ static void enterAttr(const char *s1, const char *s2) | |||
1423 | 1597 | ||
1424 | struct LexBuf { | 1598 | struct LexBuf { |
1425 | /* input */ | 1599 | /* input */ |
1600 | #ifdef INCLUDEMFC | ||
1601 | CFile *inputFile; | ||
1602 | #else | ||
1426 | FILE *inputFile; | 1603 | FILE *inputFile; |
1604 | #endif | ||
1427 | char *inputString; | 1605 | char *inputString; |
1428 | unsigned long curPos; | 1606 | unsigned long curPos; |
1429 | unsigned long inputLen; | 1607 | unsigned long inputLen; |
@@ -1469,7 +1647,7 @@ static int lexWithinMode(enum LexMode mode) { | |||
1469 | return 0; | 1647 | return 0; |
1470 | } | 1648 | } |
1471 | 1649 | ||
1472 | static int lexGetc_() | 1650 | static char lexGetc_() |
1473 | { | 1651 | { |
1474 | /* get next char from input, no buffering. */ | 1652 | /* get next char from input, no buffering. */ |
1475 | if (lexBuf.curPos == lexBuf.inputLen) | 1653 | if (lexBuf.curPos == lexBuf.inputLen) |
@@ -1477,10 +1655,12 @@ static int lexGetc_() | |||
1477 | else if (lexBuf.inputString) | 1655 | else if (lexBuf.inputString) |
1478 | return *(lexBuf.inputString + lexBuf.curPos++); | 1656 | return *(lexBuf.inputString + lexBuf.curPos++); |
1479 | else { | 1657 | else { |
1480 | if (!feof(lexBuf.inputFile)) | 1658 | #ifdef INCLUDEMFC |
1481 | return fgetc(lexBuf.inputFile); | 1659 | char result; |
1482 | else | 1660 | return lexBuf.inputFile->Read(&result, 1) == 1 ? result : EOF; |
1483 | return EOF; | 1661 | #else |
1662 | return fgetc(lexBuf.inputFile); | ||
1663 | #endif | ||
1484 | } | 1664 | } |
1485 | } | 1665 | } |
1486 | 1666 | ||
@@ -1519,11 +1699,9 @@ static int lexLookahead() { | |||
1519 | lexBuf.buf[lexBuf.getPtr] = c = '\n'; | 1699 | lexBuf.buf[lexBuf.getPtr] = c = '\n'; |
1520 | } | 1700 | } |
1521 | else if (c == '\n') { | 1701 | else if (c == '\n') { |
1522 | int a; | 1702 | int a = (lexBuf.len>1)? |
1523 | if (lexBuf.len > 1) | 1703 | lexBuf.buf[lexBuf.getPtr+1]: |
1524 | a = lexBuf.buf[lexBuf.getPtr]; | 1704 | lexGeta_(1); |
1525 | else | ||
1526 | a = lexGeta_(1); | ||
1527 | if (a == '\r') { | 1705 | if (a == '\r') { |
1528 | lexSkipLookahead(); | 1706 | lexSkipLookahead(); |
1529 | } | 1707 | } |
@@ -1556,8 +1734,6 @@ static void lexClearToken() | |||
1556 | 1734 | ||
1557 | static void lexAppendc(int c) | 1735 | static void lexAppendc(int c) |
1558 | { | 1736 | { |
1559 | /* not sure if I am doing this right to fix purify report -- PGB */ | ||
1560 | lexBuf.strs = (char *) realloc(lexBuf.strs, (size_t) lexBuf.strsLen + 1); | ||
1561 | lexBuf.strs[lexBuf.strsLen] = c; | 1737 | lexBuf.strs[lexBuf.strsLen] = c; |
1562 | /* append up to zero termination */ | 1738 | /* append up to zero termination */ |
1563 | if (c == 0) return; | 1739 | if (c == 0) return; |
@@ -1586,10 +1762,7 @@ static char* lexGetWord() { | |||
1586 | lexSkipWhite(); | 1762 | lexSkipWhite(); |
1587 | lexClearToken(); | 1763 | lexClearToken(); |
1588 | c = lexLookahead(); | 1764 | c = lexLookahead(); |
1589 | /* some "words" have a space in them, like "NEEDS ACTION". | 1765 | while (c != EOF && !strchr("\t\n ;:=",c)) { |
1590 | this may be an oversight of the spec, but it is true nevertheless. | ||
1591 | while (c != EOF && !strchr("\t\n ;:=",c)) { */ | ||
1592 | while (c != EOF && !strchr("\n;:=",c)) { | ||
1593 | lexAppendc(c); | 1766 | lexAppendc(c); |
1594 | lexSkipLookahead(); | 1767 | lexSkipLookahead(); |
1595 | c = lexLookahead(); | 1768 | c = lexLookahead(); |
@@ -1598,22 +1771,6 @@ static char* lexGetWord() { | |||
1598 | return lexStr(); | 1771 | return lexStr(); |
1599 | } | 1772 | } |
1600 | 1773 | ||
1601 | void lexPushLookahead(char *s, int len) { | ||
1602 | int putptr; | ||
1603 | if (len == 0) len = strlen(s); | ||
1604 | putptr = (int)lexBuf.getPtr - len; | ||
1605 | /* this function assumes that length of word to push back | ||
1606 | / is not greater than MAX_LEX_LOOKAHEAD. | ||
1607 | */ | ||
1608 | if (putptr < 0) putptr += MAX_LEX_LOOKAHEAD; | ||
1609 | lexBuf.getPtr = putptr; | ||
1610 | while (*s) { | ||
1611 | lexBuf.buf[putptr] = *s++; | ||
1612 | putptr = (putptr + 1) % MAX_LEX_LOOKAHEAD; | ||
1613 | } | ||
1614 | lexBuf.len += len; | ||
1615 | } | ||
1616 | |||
1617 | static void lexPushLookaheadc(int c) { | 1774 | static void lexPushLookaheadc(int c) { |
1618 | int putptr; | 1775 | int putptr; |
1619 | /* can't putback EOF, because it never leaves lookahead buffer */ | 1776 | /* can't putback EOF, because it never leaves lookahead buffer */ |
@@ -1722,26 +1879,15 @@ static char* lexGet1Value() { | |||
1722 | } | 1879 | } |
1723 | #endif | 1880 | #endif |
1724 | 1881 | ||
1725 | char* lexGetStrUntil(char *termset) { | ||
1726 | int c = lexLookahead(); | ||
1727 | lexClearToken(); | ||
1728 | while (c != EOF && !strchr(termset,c)) { | ||
1729 | lexAppendc(c); | ||
1730 | lexSkipLookahead(); | ||
1731 | c = lexLookahead(); | ||
1732 | } | ||
1733 | lexAppendc(0); | ||
1734 | return c==EOF?0:lexStr(); | ||
1735 | } | ||
1736 | 1882 | ||
1737 | static int match_begin_name(int end) { | 1883 | static int match_begin_name(int end) { |
1738 | char *n = lexLookaheadWord(); | 1884 | char *n = lexLookaheadWord(); |
1739 | int token = ID; | 1885 | int token = ID; |
1740 | if (n) { | 1886 | if (n) { |
1741 | if (!strcasecmp(n,"vcard")) token = end?END_VCARD:BEGIN_VCARD; | 1887 | if (!stricmp(n,"vcard")) token = end?END_VCARD:BEGIN_VCARD; |
1742 | else if (!strcasecmp(n,"vcalendar")) token = end?END_VCAL:BEGIN_VCAL; | 1888 | else if (!stricmp(n,"vcalendar")) token = end?END_VCAL:BEGIN_VCAL; |
1743 | else if (!strcasecmp(n,"vevent")) token = end?END_VEVENT:BEGIN_VEVENT; | 1889 | else if (!stricmp(n,"vevent")) token = end?END_VEVENT:BEGIN_VEVENT; |
1744 | else if (!strcasecmp(n,"vtodo")) token = end?END_VTODO:BEGIN_VTODO; | 1890 | else if (!stricmp(n,"vtodo")) token = end?END_VTODO:BEGIN_VTODO; |
1745 | deleteStr(n); | 1891 | deleteStr(n); |
1746 | return token; | 1892 | return token; |
1747 | } | 1893 | } |
@@ -1749,7 +1895,11 @@ static int match_begin_name(int end) { | |||
1749 | } | 1895 | } |
1750 | 1896 | ||
1751 | 1897 | ||
1898 | #ifdef INCLUDEMFC | ||
1899 | void initLex(const char *inputstring, unsigned long inputlen, CFile *inputfile) | ||
1900 | #else | ||
1752 | void initLex(const char *inputstring, unsigned long inputlen, FILE *inputfile) | 1901 | void initLex(const char *inputstring, unsigned long inputlen, FILE *inputfile) |
1902 | #endif | ||
1753 | { | 1903 | { |
1754 | /* initialize lex mode stack */ | 1904 | /* initialize lex mode stack */ |
1755 | lexBuf.lexModeStack[lexBuf.lexModeStackTop=0] = L_NORMAL; | 1905 | lexBuf.lexModeStack[lexBuf.lexModeStackTop=0] = L_NORMAL; |
@@ -1774,7 +1924,6 @@ static void finiLex() { | |||
1774 | } | 1924 | } |
1775 | 1925 | ||
1776 | 1926 | ||
1777 | /****************************************************************************/ | ||
1778 | /* This parses and converts the base64 format for binary encoding into | 1927 | /* This parses and converts the base64 format for binary encoding into |
1779 | * a decoded buffer (allocated with new). See RFC 1521. | 1928 | * a decoded buffer (allocated with new). See RFC 1521. |
1780 | */ | 1929 | */ |
@@ -1957,7 +2106,7 @@ EndString: | |||
1957 | return lexStr(); | 2106 | return lexStr(); |
1958 | } /* LexQuotedPrintable */ | 2107 | } /* LexQuotedPrintable */ |
1959 | 2108 | ||
1960 | static int yylex() { | 2109 | int yylex() { |
1961 | 2110 | ||
1962 | int lexmode = LEXMODE(); | 2111 | int lexmode = LEXMODE(); |
1963 | if (lexmode == L_VALUES) { | 2112 | if (lexmode == L_VALUES) { |
@@ -1965,7 +2114,9 @@ static int yylex() { | |||
1965 | if (c == ';') { | 2114 | if (c == ';') { |
1966 | DBG_(("db: SEMICOLON\n")); | 2115 | DBG_(("db: SEMICOLON\n")); |
1967 | lexPushLookaheadc(c); | 2116 | lexPushLookaheadc(c); |
2117 | #ifdef _SUPPORT_LINE_FOLDING | ||
1968 | handleMoreRFC822LineBreak(c); | 2118 | handleMoreRFC822LineBreak(c); |
2119 | #endif | ||
1969 | lexSkipLookahead(); | 2120 | lexSkipLookahead(); |
1970 | return SEMICOLON; | 2121 | return SEMICOLON; |
1971 | } | 2122 | } |
@@ -2008,7 +2159,6 @@ static int yylex() { | |||
2008 | else return 0; | 2159 | else return 0; |
2009 | } | 2160 | } |
2010 | } | 2161 | } |
2011 | |||
2012 | else { | 2162 | else { |
2013 | /* normal mode */ | 2163 | /* normal mode */ |
2014 | while (1) { | 2164 | while (1) { |
@@ -2017,12 +2167,12 @@ static int yylex() { | |||
2017 | case ':': { | 2167 | case ':': { |
2018 | /* consume all line separator(s) adjacent to each other */ | 2168 | /* consume all line separator(s) adjacent to each other */ |
2019 | /* ignoring linesep immediately after colon. */ | 2169 | /* ignoring linesep immediately after colon. */ |
2020 | c = lexLookahead(); | 2170 | /* c = lexLookahead(); |
2021 | while (strchr("\n",c)) { | 2171 | while (strchr("\n",c)) { |
2022 | lexSkipLookahead(); | 2172 | lexSkipLookahead(); |
2023 | c = lexLookahead(); | 2173 | c = lexLookahead(); |
2024 | ++mime_lineNum; | 2174 | ++mime_lineNum; |
2025 | } | 2175 | }*/ |
2026 | DBG_(("db: COLON\n")); | 2176 | DBG_(("db: COLON\n")); |
2027 | return COLON; | 2177 | return COLON; |
2028 | } | 2178 | } |
@@ -2032,27 +2182,24 @@ static int yylex() { | |||
2032 | case '=': | 2182 | case '=': |
2033 | DBG_(("db: EQ\n")); | 2183 | DBG_(("db: EQ\n")); |
2034 | return EQ; | 2184 | return EQ; |
2035 | /* ignore tabs/newlines in this mode. We can't ignore | 2185 | /* ignore whitespace in this mode */ |
2036 | * spaces, because values like NEEDS ACTION have a space. */ | 2186 | case '\t': |
2037 | case '\t': continue; | 2187 | case ' ': continue; |
2038 | case '\n': { | 2188 | case '\n': { |
2039 | ++mime_lineNum; | 2189 | ++mime_lineNum; |
2040 | continue; | 2190 | continue; |
2041 | } | 2191 | } |
2042 | case EOF: return 0; | 2192 | case EOF: return 0; |
2043 | break; | 2193 | break; |
2044 | default: { | 2194 | default: { |
2045 | lexPushLookaheadc(c); | 2195 | lexPushLookaheadc(c); |
2046 | /* pending lutz : why linker error with isalpha(c)? */ | 2196 | if (isalpha(c)) { |
2047 | /*if ( isalpha(c) || c == ' ') { */ | ||
2048 | if ( ( c >= 'A' && c <= 'Z') || ( c >= 'a' && c <= 'z') || c == ' ') { | ||
2049 | |||
2050 | char *t = lexGetWord(); | 2197 | char *t = lexGetWord(); |
2051 | yylval.str = t; | 2198 | yylval.str = t; |
2052 | if (!strcasecmp(t, "begin")) { | 2199 | if (!stricmp(t, "begin")) { |
2053 | return match_begin_end_name(0); | 2200 | return match_begin_end_name(0); |
2054 | } | 2201 | } |
2055 | else if (!strcasecmp(t,"end")) { | 2202 | else if (!stricmp(t,"end")) { |
2056 | return match_begin_end_name(1); | 2203 | return match_begin_end_name(1); |
2057 | } | 2204 | } |
2058 | else { | 2205 | else { |
@@ -2061,21 +2208,20 @@ static int yylex() { | |||
2061 | } | 2208 | } |
2062 | } | 2209 | } |
2063 | else { | 2210 | else { |
2064 | /* unknown token */ | 2211 | /* unknow token */ |
2065 | return 0; | 2212 | return 0; |
2066 | } | 2213 | } |
2067 | break; | 2214 | break; |
2068 | } | 2215 | } |
2069 | } | 2216 | } |
2070 | } | 2217 | } |
2071 | } | 2218 | } |
2072 | |||
2073 | return 0; | 2219 | return 0; |
2074 | } | 2220 | } |
2075 | 2221 | ||
2076 | 2222 | ||
2077 | /***************************************************************************/ | 2223 | /***************************************************************************/ |
2078 | /*** Public Functions ****/ | 2224 | /*** Public Functions ****/ |
2079 | /***************************************************************************/ | 2225 | /***************************************************************************/ |
2080 | 2226 | ||
2081 | static VObject* Parse_MIMEHelper() | 2227 | static VObject* Parse_MIMEHelper() |
@@ -2093,17 +2239,32 @@ static VObject* Parse_MIMEHelper() | |||
2093 | return vObjList; | 2239 | return vObjList; |
2094 | } | 2240 | } |
2095 | 2241 | ||
2096 | /****************************************************************************/ | 2242 | DLLEXPORT(VObject*) Parse_MIME(const char *input, unsigned long len) |
2097 | VObject* Parse_MIME(const char *input, unsigned long len) | ||
2098 | { | 2243 | { |
2099 | initLex(input, len, 0); | 2244 | initLex(input, len, 0); |
2100 | return Parse_MIMEHelper(); | 2245 | return Parse_MIMEHelper(); |
2101 | } | 2246 | } |
2102 | 2247 | ||
2103 | 2248 | ||
2249 | #if INCLUDEMFC | ||
2250 | |||
2251 | DLLEXPORT(VObject*) Parse_MIME_FromFile(CFile *file) | ||
2252 | { | ||
2253 | unsigned long startPos; | ||
2254 | VObject *result; | ||
2255 | |||
2256 | initLex(0,-1,file); | ||
2257 | startPos = file->GetPosition(); | ||
2258 | if (!(result = Parse_MIMEHelper())) | ||
2259 | file->Seek(startPos, CFile::begin); | ||
2260 | return result; | ||
2261 | } | ||
2262 | |||
2263 | #else | ||
2264 | |||
2104 | VObject* Parse_MIME_FromFile(FILE *file) | 2265 | VObject* Parse_MIME_FromFile(FILE *file) |
2105 | { | 2266 | { |
2106 | VObject *result; | 2267 | VObject *result; |
2107 | long startPos; | 2268 | long startPos; |
2108 | 2269 | ||
2109 | initLex(0,(unsigned long)-1,file); | 2270 | initLex(0,(unsigned long)-1,file); |
@@ -2114,7 +2275,7 @@ VObject* Parse_MIME_FromFile(FILE *file) | |||
2114 | return result; | 2275 | return result; |
2115 | } | 2276 | } |
2116 | 2277 | ||
2117 | VObject* Parse_MIME_FromFileName(const char *fname) | 2278 | DLLEXPORT(VObject*) Parse_MIME_FromFileName(char *fname) |
2118 | { | 2279 | { |
2119 | FILE *fp = fopen(fname,"r"); | 2280 | FILE *fp = fopen(fname,"r"); |
2120 | if (fp) { | 2281 | if (fp) { |
@@ -2123,23 +2284,19 @@ VObject* Parse_MIME_FromFileName(const char *fname) | |||
2123 | return o; | 2284 | return o; |
2124 | } | 2285 | } |
2125 | else { | 2286 | else { |
2126 | char msg[255]; | 2287 | char msg[256]; |
2127 | sprintf(msg, "can't open file '%s' for reading\n", fname); | 2288 | snprintf(msg, sizeof(msg), "can't open file '%s' for reading\n", fname); |
2128 | mime_error_(msg); | 2289 | mime_error_(msg); |
2129 | return 0; | 2290 | return 0; |
2130 | } | 2291 | } |
2131 | } | 2292 | } |
2132 | 2293 | ||
2133 | /****************************************************************************/ | 2294 | #endif |
2134 | void YYDebug(const char *s) | ||
2135 | { | ||
2136 | Parse_Debug(s); | ||
2137 | } | ||
2138 | 2295 | ||
2139 | 2296 | ||
2140 | static MimeErrorHandler mimeErrorHandler; | 2297 | static MimeErrorHandler mimeErrorHandler; |
2141 | 2298 | ||
2142 | void registerMimeErrorHandler(MimeErrorHandler me) | 2299 | DLLEXPORT(void) registerMimeErrorHandler(MimeErrorHandler me) |
2143 | { | 2300 | { |
2144 | mimeErrorHandler = me; | 2301 | mimeErrorHandler = me; |
2145 | } | 2302 | } |
diff --git a/libkcal/versit/vcc.h b/libkcal/versit/vcc.h index 03886d1..0e52034 100644 --- a/libkcal/versit/vcc.h +++ b/libkcal/versit/vcc.h | |||
@@ -48,14 +48,14 @@ extern "C" { | |||
48 | 48 | ||
49 | typedef void (*MimeErrorHandler)(char *); | 49 | typedef void (*MimeErrorHandler)(char *); |
50 | 50 | ||
51 | extern void registerMimeErrorHandler(MimeErrorHandler); | 51 | extern DLLEXPORT(void) registerMimeErrorHandler(MimeErrorHandler); |
52 | 52 | ||
53 | extern VObject* Parse_MIME(const char *input, unsigned long len); | 53 | extern DLLEXPORT(VObject*) Parse_MIME(const char *input, unsigned long len); |
54 | extern VObject* Parse_MIME_FromFileName(const char* fname); | 54 | extern DLLEXPORT(VObject*) Parse_MIME_FromFileName(char* fname); |
55 | 55 | ||
56 | 56 | ||
57 | /* NOTE regarding Parse_MIME_FromFile | 57 | /* NOTE regarding Parse_MIME_FromFile |
58 | The function below, Parse_MIME_FromFile, come in two flavors, | 58 | The function above, Parse_MIME_FromFile, comes in two flavors, |
59 | neither of which is exported from the DLL. Each version takes | 59 | neither of which is exported from the DLL. Each version takes |
60 | a CFile or FILE* as a parameter, neither of which can be | 60 | a CFile or FILE* as a parameter, neither of which can be |
61 | passed across a DLL interface (at least that is my experience). | 61 | passed across a DLL interface (at least that is my experience). |
@@ -66,7 +66,11 @@ will get a link error. | |||
66 | */ | 66 | */ |
67 | 67 | ||
68 | 68 | ||
69 | #if INCLUDEMFC | ||
70 | extern VObject* Parse_MIME_FromFile(CFile *file); | ||
71 | #else | ||
69 | extern VObject* Parse_MIME_FromFile(FILE *file); | 72 | extern VObject* Parse_MIME_FromFile(FILE *file); |
73 | #endif | ||
70 | 74 | ||
71 | #if defined(__CPLUSPLUS__) || defined(__cplusplus) | 75 | #if defined(__CPLUSPLUS__) || defined(__cplusplus) |
72 | } | 76 | } |
diff --git a/libkcal/versit/vobject.c b/libkcal/versit/vobject.c index 637efb2..3fac63e 100644 --- a/libkcal/versit/vobject.c +++ b/libkcal/versit/vobject.c | |||
@@ -42,18 +42,19 @@ DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. | |||
42 | * vobject, and convert a vobject into its textual representation. | 42 | * vobject, and convert a vobject into its textual representation. |
43 | */ | 43 | */ |
44 | 44 | ||
45 | #include <stdlib.h> | 45 | #ifdef WIN32 |
46 | #define snprintf _snprintf | ||
47 | #define strcasecmp stricmp | ||
48 | #endif | ||
46 | 49 | ||
47 | #include "vobject.h" | 50 | #include "vobject.h" |
51 | #include <stdlib.h> | ||
48 | #include <string.h> | 52 | #include <string.h> |
49 | #include <stdio.h> | 53 | #include <stdio.h> |
50 | #ifdef _WIN32_ | 54 | #include <fcntl.h> |
51 | 55 | ||
52 | #define strcasecmp _stricmp | ||
53 | 56 | ||
54 | #endif | 57 | #define NAME_OF(o) o->id |
55 | |||
56 | #define NAME_OF(o) o->id | ||
57 | #define VALUE_TYPE(o) o->valType | 58 | #define VALUE_TYPE(o) o->valType |
58 | #define STRINGZ_VALUE_OF(o) o->val.strs | 59 | #define STRINGZ_VALUE_OF(o) o->val.strs |
59 | #define USTRINGZ_VALUE_OF(o)o->val.ustrs | 60 | #define USTRINGZ_VALUE_OF(o)o->val.ustrs |
@@ -62,6 +63,31 @@ DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable. | |||
62 | #define ANY_VALUE_OF(o) o->val.any | 63 | #define ANY_VALUE_OF(o) o->val.any |
63 | #define VOBJECT_VALUE_OF(o) o->val.vobj | 64 | #define VOBJECT_VALUE_OF(o) o->val.vobj |
64 | 65 | ||
66 | typedef union ValueItem { | ||
67 | const char *strs; | ||
68 | const wchar_t *ustrs; | ||
69 | unsigned int i; | ||
70 | unsigned long l; | ||
71 | void *any; | ||
72 | VObject *vobj; | ||
73 | } ValueItem; | ||
74 | |||
75 | struct VObject { | ||
76 | VObject *next; | ||
77 | const char *id; | ||
78 | VObject *prop; | ||
79 | unsigned short valType; | ||
80 | ValueItem val; | ||
81 | }; | ||
82 | |||
83 | typedef struct StrItem StrItem; | ||
84 | |||
85 | struct StrItem { | ||
86 | StrItem *next; | ||
87 | const char *s; | ||
88 | unsigned int refCnt; | ||
89 | }; | ||
90 | |||
65 | const char** fieldedProp; | 91 | const char** fieldedProp; |
66 | 92 | ||
67 | 93 | ||
@@ -76,7 +102,7 @@ const char** fieldedProp; | |||
76 | deleteStrItem | 102 | deleteStrItem |
77 | ----------------------------------------------------------------------*/ | 103 | ----------------------------------------------------------------------*/ |
78 | 104 | ||
79 | VObject* newVObject_(const char *id) | 105 | DLLEXPORT(VObject*) newVObject_(const char *id) |
80 | { | 106 | { |
81 | VObject *p = (VObject*)malloc(sizeof(VObject)); | 107 | VObject *p = (VObject*)malloc(sizeof(VObject)); |
82 | p->next = 0; | 108 | p->next = 0; |
@@ -87,21 +113,18 @@ VObject* newVObject_(const char *id) | |||
87 | return p; | 113 | return p; |
88 | } | 114 | } |
89 | 115 | ||
90 | VObject* newVObject(const char *id) | 116 | DLLEXPORT(VObject*) newVObject(const char *id) |
91 | { | 117 | { |
92 | return newVObject_(lookupStr(id)); | 118 | return newVObject_(lookupStr(id)); |
93 | } | 119 | } |
94 | 120 | ||
95 | void deleteVObject(VObject *p) | 121 | DLLEXPORT(void) deleteVObject(VObject *p) |
96 | { | 122 | { |
97 | if (p->id) | ||
98 | unUseStr(p->id); | 123 | unUseStr(p->id); |
99 | if (p) | ||
100 | free(p); | 124 | free(p); |
101 | p = NULL; | ||
102 | } | 125 | } |
103 | 126 | ||
104 | char* dupStr(const char *s, unsigned int size) | 127 | DLLEXPORT(char*) dupStr(const char *s, unsigned int size) |
105 | { | 128 | { |
106 | char *t; | 129 | char *t; |
107 | if (size == 0) { | 130 | if (size == 0) { |
@@ -118,11 +141,9 @@ char* dupStr(const char *s, unsigned int size) | |||
118 | } | 141 | } |
119 | } | 142 | } |
120 | 143 | ||
121 | void deleteStr(const char *p) | 144 | DLLEXPORT(void) deleteStr(const char *p) |
122 | { | 145 | { |
123 | if (p) | 146 | if (p) free((void*)p); |
124 | free((void*)p); | ||
125 | p = NULL; | ||
126 | } | 147 | } |
127 | 148 | ||
128 | 149 | ||
@@ -137,9 +158,7 @@ static StrItem* newStrItem(const char *s, StrItem *next) | |||
137 | 158 | ||
138 | static void deleteStrItem(StrItem *p) | 159 | static void deleteStrItem(StrItem *p) |
139 | { | 160 | { |
140 | if (p) | 161 | free((void*)p); |
141 | free((void*)p); | ||
142 | p = NULL; | ||
143 | } | 162 | } |
144 | 163 | ||
145 | 164 | ||
@@ -147,95 +166,95 @@ static void deleteStrItem(StrItem *p) | |||
147 | The following function provide accesses to VObject's value. | 166 | The following function provide accesses to VObject's value. |
148 | ----------------------------------------------------------------------*/ | 167 | ----------------------------------------------------------------------*/ |
149 | 168 | ||
150 | const char* vObjectName(VObject *o) | 169 | DLLEXPORT(const char*) vObjectName(VObject *o) |
151 | { | 170 | { |
152 | return NAME_OF(o); | 171 | return NAME_OF(o); |
153 | } | 172 | } |
154 | 173 | ||
155 | void setVObjectName(VObject *o, const char* id) | 174 | DLLEXPORT(void) setVObjectName(VObject *o, const char* id) |
156 | { | 175 | { |
157 | NAME_OF(o) = id; | 176 | NAME_OF(o) = id; |
158 | } | 177 | } |
159 | 178 | ||
160 | const char* vObjectStringZValue(VObject *o) | 179 | DLLEXPORT(const char*) vObjectStringZValue(VObject *o) |
161 | { | 180 | { |
162 | return STRINGZ_VALUE_OF(o); | 181 | return STRINGZ_VALUE_OF(o); |
163 | } | 182 | } |
164 | 183 | ||
165 | void setVObjectStringZValue(VObject *o, const char *s) | 184 | DLLEXPORT(void) setVObjectStringZValue(VObject *o, const char *s) |
166 | { | 185 | { |
167 | STRINGZ_VALUE_OF(o) = dupStr(s,0); | 186 | STRINGZ_VALUE_OF(o) = dupStr(s,0); |
168 | VALUE_TYPE(o) = VCVT_STRINGZ; | 187 | VALUE_TYPE(o) = VCVT_STRINGZ; |
169 | } | 188 | } |
170 | 189 | ||
171 | void setVObjectStringZValue_(VObject *o, const char *s) | 190 | DLLEXPORT(void) setVObjectStringZValue_(VObject *o, const char *s) |
172 | { | 191 | { |
173 | STRINGZ_VALUE_OF(o) = s; | 192 | STRINGZ_VALUE_OF(o) = s; |
174 | VALUE_TYPE(o) = VCVT_STRINGZ; | 193 | VALUE_TYPE(o) = VCVT_STRINGZ; |
175 | } | 194 | } |
176 | 195 | ||
177 | const wchar_t* vObjectUStringZValue(VObject *o) | 196 | DLLEXPORT(const wchar_t*) vObjectUStringZValue(VObject *o) |
178 | { | 197 | { |
179 | return USTRINGZ_VALUE_OF(o); | 198 | return USTRINGZ_VALUE_OF(o); |
180 | } | 199 | } |
181 | 200 | ||
182 | void setVObjectUStringZValue(VObject *o, const wchar_t *s) | 201 | DLLEXPORT(void) setVObjectUStringZValue(VObject *o, const wchar_t *s) |
183 | { | 202 | { |
184 | USTRINGZ_VALUE_OF(o) = (wchar_t*) dupStr((char*)s,(uStrLen(s)+1)*2); | 203 | USTRINGZ_VALUE_OF(o) = (wchar_t*) dupStr((char*)s,(uStrLen(s)+1)*2); |
185 | VALUE_TYPE(o) = VCVT_USTRINGZ; | 204 | VALUE_TYPE(o) = VCVT_USTRINGZ; |
186 | } | 205 | } |
187 | 206 | ||
188 | void setVObjectUStringZValue_(VObject *o, const wchar_t *s) | 207 | DLLEXPORT(void) setVObjectUStringZValue_(VObject *o, const wchar_t *s) |
189 | { | 208 | { |
190 | USTRINGZ_VALUE_OF(o) = s; | 209 | USTRINGZ_VALUE_OF(o) = s; |
191 | VALUE_TYPE(o) = VCVT_USTRINGZ; | 210 | VALUE_TYPE(o) = VCVT_USTRINGZ; |
192 | } | 211 | } |
193 | 212 | ||
194 | unsigned int vObjectIntegerValue(VObject *o) | 213 | DLLEXPORT(unsigned int) vObjectIntegerValue(VObject *o) |
195 | { | 214 | { |
196 | return INTEGER_VALUE_OF(o); | 215 | return INTEGER_VALUE_OF(o); |
197 | } | 216 | } |
198 | 217 | ||
199 | void setVObjectIntegerValue(VObject *o, unsigned int i) | 218 | DLLEXPORT(void) setVObjectIntegerValue(VObject *o, unsigned int i) |
200 | { | 219 | { |
201 | INTEGER_VALUE_OF(o) = i; | 220 | INTEGER_VALUE_OF(o) = i; |
202 | VALUE_TYPE(o) = VCVT_UINT; | 221 | VALUE_TYPE(o) = VCVT_UINT; |
203 | } | 222 | } |
204 | 223 | ||
205 | unsigned long vObjectLongValue(VObject *o) | 224 | DLLEXPORT(unsigned long) vObjectLongValue(VObject *o) |
206 | { | 225 | { |
207 | return LONG_VALUE_OF(o); | 226 | return LONG_VALUE_OF(o); |
208 | } | 227 | } |
209 | 228 | ||
210 | void setVObjectLongValue(VObject *o, unsigned long l) | 229 | DLLEXPORT(void) setVObjectLongValue(VObject *o, unsigned long l) |
211 | { | 230 | { |
212 | LONG_VALUE_OF(o) = l; | 231 | LONG_VALUE_OF(o) = l; |
213 | VALUE_TYPE(o) = VCVT_ULONG; | 232 | VALUE_TYPE(o) = VCVT_ULONG; |
214 | } | 233 | } |
215 | 234 | ||
216 | void* vObjectAnyValue(VObject *o) | 235 | DLLEXPORT(void*) vObjectAnyValue(VObject *o) |
217 | { | 236 | { |
218 | return ANY_VALUE_OF(o); | 237 | return ANY_VALUE_OF(o); |
219 | } | 238 | } |
220 | 239 | ||
221 | void setVObjectAnyValue(VObject *o, void *t) | 240 | DLLEXPORT(void) setVObjectAnyValue(VObject *o, void *t) |
222 | { | 241 | { |
223 | ANY_VALUE_OF(o) = t; | 242 | ANY_VALUE_OF(o) = t; |
224 | VALUE_TYPE(o) = VCVT_RAW; | 243 | VALUE_TYPE(o) = VCVT_RAW; |
225 | } | 244 | } |
226 | 245 | ||
227 | VObject* vObjectVObjectValue(VObject *o) | 246 | DLLEXPORT(VObject*) vObjectVObjectValue(VObject *o) |
228 | { | 247 | { |
229 | return VOBJECT_VALUE_OF(o); | 248 | return VOBJECT_VALUE_OF(o); |
230 | } | 249 | } |
231 | 250 | ||
232 | void setVObjectVObjectValue(VObject *o, VObject *p) | 251 | DLLEXPORT(void) setVObjectVObjectValue(VObject *o, VObject *p) |
233 | { | 252 | { |
234 | VOBJECT_VALUE_OF(o) = p; | 253 | VOBJECT_VALUE_OF(o) = p; |
235 | VALUE_TYPE(o) = VCVT_VOBJECT; | 254 | VALUE_TYPE(o) = VCVT_VOBJECT; |
236 | } | 255 | } |
237 | 256 | ||
238 | int vObjectValueType(VObject *o) | 257 | DLLEXPORT(int) vObjectValueType(VObject *o) |
239 | { | 258 | { |
240 | return VALUE_TYPE(o); | 259 | return VALUE_TYPE(o); |
241 | } | 260 | } |
@@ -245,7 +264,7 @@ int vObjectValueType(VObject *o) | |||
245 | The following functions can be used to build VObject. | 264 | The following functions can be used to build VObject. |
246 | ----------------------------------------------------------------------*/ | 265 | ----------------------------------------------------------------------*/ |
247 | 266 | ||
248 | VObject* addVObjectProp(VObject *o, VObject *p) | 267 | DLLEXPORT(VObject*) addVObjectProp(VObject *o, VObject *p) |
249 | { | 268 | { |
250 | /* circular link list pointed to tail */ | 269 | /* circular link list pointed to tail */ |
251 | /* | 270 | /* |
@@ -280,17 +299,17 @@ VObject* addVObjectProp(VObject *o, VObject *p) | |||
280 | return p; | 299 | return p; |
281 | } | 300 | } |
282 | 301 | ||
283 | VObject* addProp(VObject *o, const char *id) | 302 | DLLEXPORT(VObject*) addProp(VObject *o, const char *id) |
284 | { | 303 | { |
285 | return addVObjectProp(o,newVObject(id)); | 304 | return addVObjectProp(o,newVObject(id)); |
286 | } | 305 | } |
287 | 306 | ||
288 | VObject* addProp_(VObject *o, const char *id) | 307 | DLLEXPORT(VObject*) addProp_(VObject *o, const char *id) |
289 | { | 308 | { |
290 | return addVObjectProp(o,newVObject_(id)); | 309 | return addVObjectProp(o,newVObject_(id)); |
291 | } | 310 | } |
292 | 311 | ||
293 | void addList(VObject **o, VObject *p) | 312 | DLLEXPORT(void) addList(VObject **o, VObject *p) |
294 | { | 313 | { |
295 | p->next = 0; | 314 | p->next = 0; |
296 | if (*o == 0) { | 315 | if (*o == 0) { |
@@ -305,12 +324,12 @@ void addList(VObject **o, VObject *p) | |||
305 | } | 324 | } |
306 | } | 325 | } |
307 | 326 | ||
308 | VObject* nextVObjectInList(VObject *o) | 327 | DLLEXPORT(VObject*) nextVObjectInList(VObject *o) |
309 | { | 328 | { |
310 | return o->next; | 329 | return o->next; |
311 | } | 330 | } |
312 | 331 | ||
313 | VObject* setValueWithSize_(VObject *prop, void *val, unsigned int size) | 332 | DLLEXPORT(VObject*) setValueWithSize_(VObject *prop, void *val, unsigned int size) |
314 | { | 333 | { |
315 | VObject *sizeProp; | 334 | VObject *sizeProp; |
316 | setVObjectAnyValue(prop, val); | 335 | setVObjectAnyValue(prop, val); |
@@ -319,30 +338,30 @@ VObject* setValueWithSize_(VObject *prop, void *val, unsigned int size) | |||
319 | return prop; | 338 | return prop; |
320 | } | 339 | } |
321 | 340 | ||
322 | VObject* setValueWithSize(VObject *prop, void *val, unsigned int size) | 341 | DLLEXPORT(VObject*) setValueWithSize(VObject *prop, void *val, unsigned int size) |
323 | { | 342 | { |
324 | void *p = dupStr(val,size); | 343 | void *p = dupStr((const char *)val,size); |
325 | return setValueWithSize_(prop,p,p?size:0); | 344 | return setValueWithSize_(prop,p,p?size:0); |
326 | } | 345 | } |
327 | 346 | ||
328 | void initPropIterator(VObjectIterator *i, VObject *o) | 347 | DLLEXPORT(void) initPropIterator(VObjectIterator *i, VObject *o) |
329 | { | 348 | { |
330 | i->start = o->prop; | 349 | i->start = o->prop; |
331 | i->next = 0; | 350 | i->next = 0; |
332 | } | 351 | } |
333 | 352 | ||
334 | void initVObjectIterator(VObjectIterator *i, VObject *o) | 353 | DLLEXPORT(void) initVObjectIterator(VObjectIterator *i, VObject *o) |
335 | { | 354 | { |
336 | i->start = o->next; | 355 | i->start = o->next; |
337 | i->next = 0; | 356 | i->next = 0; |
338 | } | 357 | } |
339 | 358 | ||
340 | int moreIteration(VObjectIterator *i) | 359 | DLLEXPORT(int) moreIteration(VObjectIterator *i) |
341 | { | 360 | { |
342 | return (i->start && (i->next==0 || i->next!=i->start)); | 361 | return (i->start && (i->next==0 || i->next!=i->start)); |
343 | } | 362 | } |
344 | 363 | ||
345 | VObject* nextVObject(VObjectIterator *i) | 364 | DLLEXPORT(VObject*) nextVObject(VObjectIterator *i) |
346 | { | 365 | { |
347 | if (i->start && i->next != i->start) { | 366 | if (i->start && i->next != i->start) { |
348 | if (i->next == 0) { | 367 | if (i->next == 0) { |
@@ -357,19 +376,19 @@ VObject* nextVObject(VObjectIterator *i) | |||
357 | else return (VObject*)0; | 376 | else return (VObject*)0; |
358 | } | 377 | } |
359 | 378 | ||
360 | VObject* isAPropertyOf(VObject *o, const char *id) | 379 | DLLEXPORT(VObject*) isAPropertyOf(VObject *o, const char *id) |
361 | { | 380 | { |
362 | VObjectIterator i; | 381 | VObjectIterator i; |
363 | initPropIterator(&i,o); | 382 | initPropIterator(&i,o); |
364 | while (moreIteration(&i)) { | 383 | while (moreIteration(&i)) { |
365 | VObject *each = nextVObject(&i); | 384 | VObject *each = nextVObject(&i); |
366 | if (!strcasecmp(id,each->id)) | 385 | if (!stricmp(id,each->id)) |
367 | return each; | 386 | return each; |
368 | } | 387 | } |
369 | return (VObject*)0; | 388 | return (VObject*)0; |
370 | } | 389 | } |
371 | 390 | ||
372 | VObject* addGroup(VObject *o, const char *g) | 391 | DLLEXPORT(VObject*) addGroup(VObject *o, const char *g) |
373 | { | 392 | { |
374 | /* | 393 | /* |
375 | a.b.c | 394 | a.b.c |
@@ -410,7 +429,7 @@ VObject* addGroup(VObject *o, const char *g) | |||
410 | return addProp_(o,lookupProp(g)); | 429 | return addProp_(o,lookupProp(g)); |
411 | } | 430 | } |
412 | 431 | ||
413 | VObject* addPropValue(VObject *o, const char *p, const char *v) | 432 | DLLEXPORT(VObject*) addPropValue(VObject *o, const char *p, const char *v) |
414 | { | 433 | { |
415 | VObject *prop; | 434 | VObject *prop; |
416 | prop = addProp(o,p); | 435 | prop = addProp(o,p); |
@@ -418,7 +437,7 @@ VObject* addPropValue(VObject *o, const char *p, const char *v) | |||
418 | return prop; | 437 | return prop; |
419 | } | 438 | } |
420 | 439 | ||
421 | VObject* addPropSizedValue_(VObject *o, const char *p, const char *v, | 440 | DLLEXPORT(VObject*) addPropSizedValue_(VObject *o, const char *p, const char *v, |
422 | unsigned int size) | 441 | unsigned int size) |
423 | { | 442 | { |
424 | VObject *prop; | 443 | VObject *prop; |
@@ -427,7 +446,7 @@ VObject* addPropSizedValue_(VObject *o, const char *p, const char *v, | |||
427 | return prop; | 446 | return prop; |
428 | } | 447 | } |
429 | 448 | ||
430 | VObject* addPropSizedValue(VObject *o, const char *p, const char *v, | 449 | DLLEXPORT(VObject*) addPropSizedValue(VObject *o, const char *p, const char *v, |
431 | unsigned int size) | 450 | unsigned int size) |
432 | { | 451 | { |
433 | return addPropSizedValue_(o,p,dupStr(v,size),size); | 452 | return addPropSizedValue_(o,p,dupStr(v,size),size); |
@@ -528,7 +547,7 @@ void printVObject(FILE *fp,VObject *o) | |||
528 | printVObject_(fp,o,0); | 547 | printVObject_(fp,o,0); |
529 | } | 548 | } |
530 | 549 | ||
531 | void printVObjectToFile(char *fname,VObject *o) | 550 | DLLEXPORT(void) printVObjectToFile(char *fname,VObject *o) |
532 | { | 551 | { |
533 | FILE *fp = fopen(fname,"w"); | 552 | FILE *fp = fopen(fname,"w"); |
534 | if (fp) { | 553 | if (fp) { |
@@ -537,7 +556,7 @@ void printVObjectToFile(char *fname,VObject *o) | |||
537 | } | 556 | } |
538 | } | 557 | } |
539 | 558 | ||
540 | void printVObjectsToFile(char *fname,VObject *list) | 559 | DLLEXPORT(void) printVObjectsToFile(char *fname,VObject *list) |
541 | { | 560 | { |
542 | FILE *fp = fopen(fname,"w"); | 561 | FILE *fp = fopen(fname,"w"); |
543 | if (fp) { | 562 | if (fp) { |
@@ -549,7 +568,7 @@ void printVObjectsToFile(char *fname,VObject *list) | |||
549 | } | 568 | } |
550 | } | 569 | } |
551 | 570 | ||
552 | void cleanVObject(VObject *o) | 571 | DLLEXPORT(void) cleanVObject(VObject *o) |
553 | { | 572 | { |
554 | if (o == 0) return; | 573 | if (o == 0) return; |
555 | if (o->prop) { | 574 | if (o->prop) { |
@@ -573,7 +592,7 @@ void cleanVObject(VObject *o) | |||
573 | case VCVT_USTRINGZ: | 592 | case VCVT_USTRINGZ: |
574 | case VCVT_STRINGZ: | 593 | case VCVT_STRINGZ: |
575 | case VCVT_RAW: | 594 | case VCVT_RAW: |
576 | /* assume they are all allocated by malloc. */ | 595 | /* assume they are all allocated by malloc. */ |
577 | free((char*)STRINGZ_VALUE_OF(o)); | 596 | free((char*)STRINGZ_VALUE_OF(o)); |
578 | break; | 597 | break; |
579 | case VCVT_VOBJECT: | 598 | case VCVT_VOBJECT: |
@@ -583,7 +602,7 @@ void cleanVObject(VObject *o) | |||
583 | deleteVObject(o); | 602 | deleteVObject(o); |
584 | } | 603 | } |
585 | 604 | ||
586 | void cleanVObjects(VObject *list) | 605 | DLLEXPORT(void) cleanVObjects(VObject *list) |
587 | { | 606 | { |
588 | while (list) { | 607 | while (list) { |
589 | VObject *t = list; | 608 | VObject *t = list; |
@@ -610,69 +629,65 @@ static unsigned int hashStr(const char *s) | |||
610 | return h % STRTBLSIZE; | 629 | return h % STRTBLSIZE; |
611 | } | 630 | } |
612 | 631 | ||
613 | const char* lookupStr(const char *s) | 632 | DLLEXPORT(const char*) lookupStr(const char *s) |
614 | { | 633 | { |
615 | char *newS; | 634 | StrItem *t; |
616 | 635 | unsigned int h = hashStr(s); | |
617 | StrItem *t; | 636 | if ((t = strTbl[h]) != 0) { |
618 | unsigned int h = hashStr(s); | 637 | do { |
619 | if ((t = strTbl[h]) != 0) { | 638 | if (stricmp(t->s,s) == 0) { |
620 | do { | 639 | t->refCnt++; |
621 | if (strcasecmp(t->s,s) == 0) { | 640 | return t->s; |
622 | t->refCnt++; | 641 | } |
623 | return t->s; | 642 | t = t->next; |
624 | } | 643 | } while (t); |
625 | t = t->next; | 644 | } |
626 | } while (t); | 645 | s = dupStr(s,0); |
627 | } | 646 | strTbl[h] = newStrItem(s,strTbl[h]); |
628 | newS = dupStr(s,0); | 647 | return s; |
629 | strTbl[h] = newStrItem(newS,strTbl[h]); | ||
630 | return newS; | ||
631 | } | 648 | } |
632 | 649 | ||
633 | void unUseStr(const char *s) | 650 | DLLEXPORT(void) unUseStr(const char *s) |
634 | { | 651 | { |
635 | StrItem *cur, *prev; | 652 | StrItem *t, *p; |
636 | |||
637 | unsigned int h = hashStr(s); | 653 | unsigned int h = hashStr(s); |
638 | cur = strTbl[h]; | 654 | if ((t = strTbl[h]) != 0) { |
639 | prev = cur; | 655 | p = t; |
640 | while (cur != 0) { | 656 | do { |
641 | if (strcasecmp(cur->s,s) == 0) { | 657 | if (stricmp(t->s,s) == 0) { |
642 | cur->refCnt--; | 658 | t->refCnt--; |
643 | /* if that was the last reference to this string, kill it. */ | 659 | if (t->refCnt == 0) { |
644 | if (cur->refCnt == 0) { | 660 | if (p == strTbl[h]) { |
645 | if (cur == strTbl[h]) { | 661 | strTbl[h] = t->next; |
646 | strTbl[h] = cur->next; | 662 | } |
647 | deleteStr(prev->s); | 663 | else { |
648 | deleteStrItem(prev); | 664 | p->next = t->next; |
649 | } else { | 665 | } |
650 | prev->next = cur->next; | 666 | deleteStr(t->s); |
651 | deleteStr(cur->s); | 667 | deleteStrItem(t); |
652 | deleteStrItem(cur); | 668 | return; |
653 | } | 669 | } |
654 | return; | 670 | } |
671 | p = t; | ||
672 | t = t->next; | ||
673 | } while (t); | ||
655 | } | 674 | } |
656 | } | ||
657 | prev = cur; | ||
658 | cur = cur->next; | ||
659 | } | ||
660 | } | 675 | } |
661 | 676 | ||
662 | void cleanStrTbl() | 677 | DLLEXPORT(void) cleanStrTbl() |
663 | { | 678 | { |
664 | int i; | 679 | int i; |
665 | for (i=0; i<STRTBLSIZE;i++) { | 680 | for (i=0; i<STRTBLSIZE;i++) { |
666 | StrItem *t = strTbl[i]; | 681 | StrItem *t = strTbl[i]; |
667 | while (t) { | 682 | while (t) { |
668 | StrItem *p; | 683 | StrItem *p; |
669 | deleteStr(t->s); | 684 | deleteStr(t->s); |
670 | p = t; | 685 | p = t; |
671 | t = t->next; | 686 | t = t->next; |
672 | deleteStrItem(p); | 687 | deleteStrItem(p); |
673 | } | 688 | } while (t); |
674 | strTbl[i] = 0; | 689 | strTbl[i] = 0; |
675 | } | 690 | } |
676 | } | 691 | } |
677 | 692 | ||
678 | 693 | ||
@@ -807,7 +822,7 @@ static struct PreDefProp propNames[] = { | |||
807 | { VCEventProp, 0, 0, PD_BEGIN }, | 822 | { VCEventProp, 0, 0, PD_BEGIN }, |
808 | { VCEWorldProp, 0, 0, 0 }, | 823 | { VCEWorldProp, 0, 0, 0 }, |
809 | { VCExNumProp, 0, 0, 0 }, | 824 | { VCExNumProp, 0, 0, 0 }, |
810 | { VCExDateProp, 0, 0, 0 }, | 825 | { VCExpDateProp, 0, 0, 0 }, |
811 | { VCExpectProp, 0, 0, 0 }, | 826 | { VCExpectProp, 0, 0, 0 }, |
812 | { VCExtAddressProp, 0, 0, 0 }, | 827 | { VCExtAddressProp, 0, 0, 0 }, |
813 | { VCFamilyNameProp, 0, 0, 0 }, | 828 | { VCFamilyNameProp, 0, 0, 0 }, |
@@ -921,7 +936,7 @@ static struct PreDefProp* lookupPropInfo(const char* str) | |||
921 | int i; | 936 | int i; |
922 | 937 | ||
923 | for (i = 0; propNames[i].name; i++) | 938 | for (i = 0; propNames[i].name; i++) |
924 | if (strcasecmp(str, propNames[i].name) == 0) { | 939 | if (stricmp(str, propNames[i].name) == 0) { |
925 | return &propNames[i]; | 940 | return &propNames[i]; |
926 | } | 941 | } |
927 | 942 | ||
@@ -929,12 +944,12 @@ static struct PreDefProp* lookupPropInfo(const char* str) | |||
929 | } | 944 | } |
930 | 945 | ||
931 | 946 | ||
932 | const char* lookupProp_(const char* str) | 947 | DLLEXPORT(const char*) lookupProp_(const char* str) |
933 | { | 948 | { |
934 | int i; | 949 | int i; |
935 | 950 | ||
936 | for (i = 0; propNames[i].name; i++) | 951 | for (i = 0; propNames[i].name; i++) |
937 | if (strcasecmp(str, propNames[i].name) == 0) { | 952 | if (stricmp(str, propNames[i].name) == 0) { |
938 | const char* s; | 953 | const char* s; |
939 | s = propNames[i].alias?propNames[i].alias:propNames[i].name; | 954 | s = propNames[i].alias?propNames[i].alias:propNames[i].name; |
940 | return lookupStr(s); | 955 | return lookupStr(s); |
@@ -943,12 +958,12 @@ const char* lookupProp_(const char* str) | |||
943 | } | 958 | } |
944 | 959 | ||
945 | 960 | ||
946 | const char* lookupProp(const char* str) | 961 | DLLEXPORT(const char*) lookupProp(const char* str) |
947 | { | 962 | { |
948 | int i; | 963 | int i; |
949 | 964 | ||
950 | for (i = 0; propNames[i].name; i++) | 965 | for (i = 0; propNames[i].name; i++) |
951 | if (strcasecmp(str, propNames[i].name) == 0) { | 966 | if (stricmp(str, propNames[i].name) == 0) { |
952 | const char *s; | 967 | const char *s; |
953 | fieldedProp = propNames[i].fields; | 968 | fieldedProp = propNames[i].fields; |
954 | s = propNames[i].alias?propNames[i].alias:propNames[i].name; | 969 | s = propNames[i].alias?propNames[i].alias:propNames[i].name; |
@@ -972,11 +987,7 @@ typedef struct OFile { | |||
972 | int fail:1; | 987 | int fail:1; |
973 | } OFile; | 988 | } OFile; |
974 | 989 | ||
975 | |||
976 | /* vCalendar files need crlf linebreaks. The disabled functions didn't provide | ||
977 | that. */ | ||
978 | #if 0 | 990 | #if 0 |
979 | |||
980 | static void appendsOFile(OFile *fp, const char *s) | 991 | static void appendsOFile(OFile *fp, const char *s) |
981 | { | 992 | { |
982 | int slen; | 993 | int slen; |
@@ -995,10 +1006,7 @@ stuff: | |||
995 | else if (fp->alloc) { | 1006 | else if (fp->alloc) { |
996 | fp->limit = fp->limit + OFILE_REALLOC_SIZE; | 1007 | fp->limit = fp->limit + OFILE_REALLOC_SIZE; |
997 | if (OFILE_REALLOC_SIZE <= slen) fp->limit += slen; | 1008 | if (OFILE_REALLOC_SIZE <= slen) fp->limit += slen; |
998 | if (fp->s) | 1009 | fp->s = (char *) realloc(fp->s,fp->limit); |
999 | fp->s = realloc(fp->s,fp->limit); | ||
1000 | else | ||
1001 | fp->s = malloc(fp->limit); | ||
1002 | if (fp->s) goto stuff; | 1010 | if (fp->s) goto stuff; |
1003 | } | 1011 | } |
1004 | if (fp->alloc) | 1012 | if (fp->alloc) |
@@ -1023,7 +1031,7 @@ stuff: | |||
1023 | } | 1031 | } |
1024 | else if (fp->alloc) { | 1032 | else if (fp->alloc) { |
1025 | fp->limit = fp->limit + OFILE_REALLOC_SIZE; | 1033 | fp->limit = fp->limit + OFILE_REALLOC_SIZE; |
1026 | fp->s = realloc(fp->s,fp->limit); | 1034 | fp->s = (char *) realloc(fp->s,fp->limit); |
1027 | if (fp->s) goto stuff; | 1035 | if (fp->s) goto stuff; |
1028 | } | 1036 | } |
1029 | if (fp->alloc) | 1037 | if (fp->alloc) |
@@ -1032,9 +1040,7 @@ stuff: | |||
1032 | fp->fail = 1; | 1040 | fp->fail = 1; |
1033 | } | 1041 | } |
1034 | } | 1042 | } |
1035 | |||
1036 | #else | 1043 | #else |
1037 | |||
1038 | static void appendcOFile_(OFile *fp, char c) | 1044 | static void appendcOFile_(OFile *fp, char c) |
1039 | { | 1045 | { |
1040 | if (fp->fail) return; | 1046 | if (fp->fail) return; |
@@ -1115,7 +1121,7 @@ static int writeBase64(OFile *fp, unsigned char *s, long len) | |||
1115 | quad[4] = 0; | 1121 | quad[4] = 0; |
1116 | 1122 | ||
1117 | while (cur < len) { | 1123 | while (cur < len) { |
1118 | /* collect the triplet of bytes into 'trip' */ | 1124 | /* collect the triplet of bytes into 'trip' */ |
1119 | trip = 0; | 1125 | trip = 0; |
1120 | for (i = 0; i < 3; i++) { | 1126 | for (i = 0; i < 3; i++) { |
1121 | b = (cur < len) ? *(s + cur) : 0; | 1127 | b = (cur < len) ? *(s + cur) : 0; |
@@ -1127,7 +1133,7 @@ static int writeBase64(OFile *fp, unsigned char *s, long len) | |||
1127 | b = (unsigned char)(trip & 0x3F); | 1133 | b = (unsigned char)(trip & 0x3F); |
1128 | trip = trip >> 6; | 1134 | trip = trip >> 6; |
1129 | if ((3 - i) < (cur - len)) | 1135 | if ((3 - i) < (cur - len)) |
1130 | quad[i] = '='; /* pad char */ | 1136 | quad[i] = '='; /* pad char */ |
1131 | else if (b < 26) quad[i] = (char)b + 'A'; | 1137 | else if (b < 26) quad[i] = (char)b + 'A'; |
1132 | else if (b < 52) quad[i] = (char)(b - 26) + 'a'; | 1138 | else if (b < 52) quad[i] = (char)(b - 26) + 'a'; |
1133 | else if (b < 62) quad[i] = (char)(b - 52) + '0'; | 1139 | else if (b < 62) quad[i] = (char)(b - 52) + '0'; |
@@ -1145,42 +1151,55 @@ static int writeBase64(OFile *fp, unsigned char *s, long len) | |||
1145 | return 1; | 1151 | return 1; |
1146 | } | 1152 | } |
1147 | 1153 | ||
1148 | /* this function really sucks. Too basic. */ | 1154 | static void writeString(OFile *fp, const char *s) |
1149 | static void writeQPString(OFile *fp, const char *s, int qp) | 1155 | { |
1156 | appendsOFile(fp,s); | ||
1157 | } | ||
1158 | |||
1159 | static void writeQPString(OFile *fp, const char *s) | ||
1150 | { | 1160 | { |
1161 | char buf[4]; | ||
1162 | int count=0; | ||
1151 | const char *p = s; | 1163 | const char *p = s; |
1164 | |||
1152 | while (*p) { | 1165 | while (*p) { |
1153 | if (*p == '\n') { | 1166 | /* break up lines biggger than 75 chars */ |
1154 | if (p[1]) appendsOFile(fp,"=0A="); | 1167 | if(count >=74){ |
1155 | } | 1168 | count=0; |
1156 | if (*p == '=' && qp) | 1169 | appendsOFile(fp,"=\n"); |
1157 | appendsOFile(fp,"=3D"); | 1170 | } |
1158 | else | 1171 | |
1159 | appendcOFile(fp,*p); | 1172 | /* escape any non ASCII characters and '=' as per rfc1521 */ |
1160 | p++; | 1173 | if (*p<= 0x1f || *p >=0x7f || *p == '=' ) { |
1174 | sprintf(buf,"=%02X",(unsigned char)*p); | ||
1175 | appendsOFile(fp,buf); | ||
1176 | count+=3; | ||
1177 | } else { | ||
1178 | appendcOFile(fp,*p); | ||
1179 | count++; | ||
1180 | } | ||
1181 | p++; | ||
1161 | } | 1182 | } |
1162 | } | 1183 | } |
1163 | 1184 | ||
1185 | |||
1186 | |||
1164 | static void writeVObject_(OFile *fp, VObject *o); | 1187 | static void writeVObject_(OFile *fp, VObject *o); |
1165 | 1188 | ||
1166 | static void writeValue(OFile *fp, VObject *o, unsigned long size) | 1189 | static void writeValue(OFile *fp, VObject *o, unsigned long size,int quote) |
1167 | { | 1190 | { |
1168 | if (o == 0) return; | 1191 | if (o == 0) return; |
1169 | switch (VALUE_TYPE(o)) { | 1192 | switch (VALUE_TYPE(o)) { |
1170 | case VCVT_USTRINGZ: { | 1193 | case VCVT_USTRINGZ: { |
1171 | char *s = fakeCString(USTRINGZ_VALUE_OF(o)); | 1194 | char *s = fakeCString(USTRINGZ_VALUE_OF(o)); |
1172 | if (isAPropertyOf(o, VCQuotedPrintableProp)) | 1195 | if(quote) writeQPString(fp, s); |
1173 | writeQPString(fp, s, 1); | 1196 | else writeString(fp,s); |
1174 | else | ||
1175 | writeQPString(fp, s, 0); | ||
1176 | deleteStr(s); | 1197 | deleteStr(s); |
1177 | break; | 1198 | break; |
1178 | } | 1199 | } |
1179 | case VCVT_STRINGZ: { | 1200 | case VCVT_STRINGZ: { |
1180 | if (isAPropertyOf(o, VCQuotedPrintableProp)) | 1201 | if(quote) writeQPString(fp, STRINGZ_VALUE_OF(o)); |
1181 | writeQPString(fp, STRINGZ_VALUE_OF(o), 1); | 1202 | else writeString(fp,STRINGZ_VALUE_OF(o)); |
1182 | else | ||
1183 | writeQPString(fp, STRINGZ_VALUE_OF(o), 0); | ||
1184 | break; | 1203 | break; |
1185 | } | 1204 | } |
1186 | case VCVT_UINT: { | 1205 | case VCVT_UINT: { |
@@ -1220,7 +1239,7 @@ static void writeAttrValue(OFile *fp, VObject *o) | |||
1220 | appendcOFile(fp,';'); | 1239 | appendcOFile(fp,';'); |
1221 | if (VALUE_TYPE(o)) { | 1240 | if (VALUE_TYPE(o)) { |
1222 | appendcOFile(fp,'='); | 1241 | appendcOFile(fp,'='); |
1223 | writeValue(fp,o,0); | 1242 | writeValue(fp,o,0,0); |
1224 | } | 1243 | } |
1225 | } | 1244 | } |
1226 | 1245 | ||
@@ -1230,10 +1249,9 @@ static void writeGroup(OFile *fp, VObject *o) | |||
1230 | char buf2[256]; | 1249 | char buf2[256]; |
1231 | strcpy(buf1,NAME_OF(o)); | 1250 | strcpy(buf1,NAME_OF(o)); |
1232 | while ((o=isAPropertyOf(o,VCGroupingProp)) != 0) { | 1251 | while ((o=isAPropertyOf(o,VCGroupingProp)) != 0) { |
1233 | strncpy(buf2,STRINGZ_VALUE_OF(o),sizeof(buf2)); | 1252 | strcpy(buf2,STRINGZ_VALUE_OF(o)); |
1234 | buf2[sizeof(buf2)] = '\0'; | 1253 | strcat(buf2,"."); |
1235 | strncat(buf2,".",sizeof(buf2)-strlen(buf2)-1); | 1254 | strcat(buf2,buf1); |
1236 | strncat(buf2,buf1,sizeof(buf2)-strlen(buf2)-1); | ||
1237 | strcpy(buf1,buf2); | 1255 | strcpy(buf1,buf2); |
1238 | } | 1256 | } |
1239 | appendsOFile(fp,buf1); | 1257 | appendsOFile(fp,buf1); |
@@ -1243,7 +1261,7 @@ static int inList(const char **list, const char *s) | |||
1243 | { | 1261 | { |
1244 | if (list == 0) return 0; | 1262 | if (list == 0) return 0; |
1245 | while (*list) { | 1263 | while (*list) { |
1246 | if (strcasecmp(*list,s) == 0) return 1; | 1264 | if (stricmp(*list,s) == 0) return 1; |
1247 | list++; | 1265 | list++; |
1248 | } | 1266 | } |
1249 | return 0; | 1267 | return 0; |
@@ -1251,6 +1269,7 @@ static int inList(const char **list, const char *s) | |||
1251 | 1269 | ||
1252 | static void writeProp(OFile *fp, VObject *o) | 1270 | static void writeProp(OFile *fp, VObject *o) |
1253 | { | 1271 | { |
1272 | int isQuoted=0; | ||
1254 | if (NAME_OF(o)) { | 1273 | if (NAME_OF(o)) { |
1255 | struct PreDefProp *pi; | 1274 | struct PreDefProp *pi; |
1256 | VObjectIterator t; | 1275 | VObjectIterator t; |
@@ -1270,8 +1289,10 @@ static void writeProp(OFile *fp, VObject *o) | |||
1270 | const char *s; | 1289 | const char *s; |
1271 | VObject *eachProp = nextVObject(&t); | 1290 | VObject *eachProp = nextVObject(&t); |
1272 | s = NAME_OF(eachProp); | 1291 | s = NAME_OF(eachProp); |
1273 | if (strcasecmp(VCGroupingProp,s) && !inList(fields_,s)) | 1292 | if (stricmp(VCGroupingProp,s) && !inList(fields_,s)) |
1274 | writeAttrValue(fp,eachProp); | 1293 | writeAttrValue(fp,eachProp); |
1294 | if (stricmp(VCQPProp,s)==0 || stricmp(VCQuotedPrintableProp,s)==0) | ||
1295 | isQuoted=1; | ||
1275 | } | 1296 | } |
1276 | if (fields_) { | 1297 | if (fields_) { |
1277 | int i = 0, n = 0; | 1298 | int i = 0, n = 0; |
@@ -1279,14 +1300,14 @@ static void writeProp(OFile *fp, VObject *o) | |||
1279 | /* output prop as fields */ | 1300 | /* output prop as fields */ |
1280 | appendcOFile(fp,':'); | 1301 | appendcOFile(fp,':'); |
1281 | while (*fields) { | 1302 | while (*fields) { |
1282 | VObject *tl = isAPropertyOf(o,*fields); | 1303 | VObject *t = isAPropertyOf(o,*fields); |
1283 | i++; | 1304 | i++; |
1284 | if (tl) n = i; | 1305 | if (t) n = i; |
1285 | fields++; | 1306 | fields++; |
1286 | } | 1307 | } |
1287 | fields = fields_; | 1308 | fields = fields_; |
1288 | for (i=0;i<n;i++) { | 1309 | for (i=0;i<n;i++) { |
1289 | writeValue(fp,isAPropertyOf(o,*fields),0); | 1310 | writeValue(fp,isAPropertyOf(o,*fields),0,isQuoted); |
1290 | fields++; | 1311 | fields++; |
1291 | if (i<(n-1)) appendcOFile(fp,';'); | 1312 | if (i<(n-1)) appendcOFile(fp,';'); |
1292 | } | 1313 | } |
@@ -1298,7 +1319,7 @@ static void writeProp(OFile *fp, VObject *o) | |||
1298 | VObject *p = isAPropertyOf(o,VCDataSizeProp); | 1319 | VObject *p = isAPropertyOf(o,VCDataSizeProp); |
1299 | if (p) size = LONG_VALUE_OF(p); | 1320 | if (p) size = LONG_VALUE_OF(p); |
1300 | appendcOFile(fp,':'); | 1321 | appendcOFile(fp,':'); |
1301 | writeValue(fp,o,size); | 1322 | writeValue(fp,o,size,isQuoted); |
1302 | } | 1323 | } |
1303 | 1324 | ||
1304 | appendcOFile(fp,'\n'); | 1325 | appendcOFile(fp,'\n'); |
@@ -1335,7 +1356,7 @@ void writeVObject(FILE *fp, VObject *o) | |||
1335 | writeVObject_(&ofp,o); | 1356 | writeVObject_(&ofp,o); |
1336 | } | 1357 | } |
1337 | 1358 | ||
1338 | void writeVObjectToFile(char *fname, VObject *o) | 1359 | DLLEXPORT(void) writeVObjectToFile(char *fname, VObject *o) |
1339 | { | 1360 | { |
1340 | FILE *fp = fopen(fname,"w"); | 1361 | FILE *fp = fopen(fname,"w"); |
1341 | if (fp) { | 1362 | if (fp) { |
@@ -1344,7 +1365,7 @@ void writeVObjectToFile(char *fname, VObject *o) | |||
1344 | } | 1365 | } |
1345 | } | 1366 | } |
1346 | 1367 | ||
1347 | void writeVObjectsToFile(char *fname, VObject *list) | 1368 | DLLEXPORT(void) writeVObjectsToFile(char *fname, VObject *list) |
1348 | { | 1369 | { |
1349 | FILE *fp = fopen(fname,"w"); | 1370 | FILE *fp = fopen(fname,"w"); |
1350 | if (fp) { | 1371 | if (fp) { |
@@ -1356,7 +1377,7 @@ void writeVObjectsToFile(char *fname, VObject *list) | |||
1356 | } | 1377 | } |
1357 | } | 1378 | } |
1358 | 1379 | ||
1359 | char* writeMemVObject(char *s, int *len, VObject *o) | 1380 | DLLEXPORT(char*) writeMemVObject(char *s, int *len, VObject *o) |
1360 | { | 1381 | { |
1361 | OFile ofp; | 1382 | OFile ofp; |
1362 | initMemOFile(&ofp,s,len?*len:0); | 1383 | initMemOFile(&ofp,s,len?*len:0); |
@@ -1366,7 +1387,7 @@ char* writeMemVObject(char *s, int *len, VObject *o) | |||
1366 | return ofp.s; | 1387 | return ofp.s; |
1367 | } | 1388 | } |
1368 | 1389 | ||
1369 | char* writeMemVObjects(char *s, int *len, VObject *list) | 1390 | DLLEXPORT(char*) writeMemVObjects(char *s, int *len, VObject *list) |
1370 | { | 1391 | { |
1371 | OFile ofp; | 1392 | OFile ofp; |
1372 | initMemOFile(&ofp,s,len?*len:0); | 1393 | initMemOFile(&ofp,s,len?*len:0); |
@@ -1382,7 +1403,7 @@ char* writeMemVObjects(char *s, int *len, VObject *list) | |||
1382 | /*---------------------------------------------------------------------- | 1403 | /*---------------------------------------------------------------------- |
1383 | APIs to do fake Unicode stuff. | 1404 | APIs to do fake Unicode stuff. |
1384 | ----------------------------------------------------------------------*/ | 1405 | ----------------------------------------------------------------------*/ |
1385 | wchar_t* fakeUnicode(const char *ps, int *bytes) | 1406 | DLLEXPORT(wchar_t*) fakeUnicode(const char *ps, int *bytes) |
1386 | { | 1407 | { |
1387 | wchar_t *r, *pw; | 1408 | wchar_t *r, *pw; |
1388 | int len = strlen(ps)+1; | 1409 | int len = strlen(ps)+1; |
@@ -1405,18 +1426,18 @@ wchar_t* fakeUnicode(const char *ps, int *bytes) | |||
1405 | return r; | 1426 | return r; |
1406 | } | 1427 | } |
1407 | 1428 | ||
1408 | int uStrLen(const wchar_t *u) | 1429 | DLLEXPORT(int) uStrLen(const wchar_t *u) |
1409 | { | 1430 | { |
1410 | int i = 0; | 1431 | int i = 0; |
1411 | while (*u != (wchar_t)0) { u++; i++; } | 1432 | while (*u != (wchar_t)0) { u++; i++; } |
1412 | return i; | 1433 | return i; |
1413 | } | 1434 | } |
1414 | 1435 | ||
1415 | char* fakeCString(const wchar_t *u) | 1436 | DLLEXPORT(char*) fakeCString(const wchar_t *u) |
1416 | { | 1437 | { |
1417 | char *s, *t; | 1438 | char *s, *t; |
1418 | int len = uStrLen(u) + 1; | 1439 | int len = uStrLen(u) + 1; |
1419 | t = s = (char*)malloc(len+1); | 1440 | t = s = (char*)malloc(len); |
1420 | while (*u) { | 1441 | while (*u) { |
1421 | if (*u == (wchar_t)0x2028) | 1442 | if (*u == (wchar_t)0x2028) |
1422 | *t = '\n'; | 1443 | *t = '\n'; |
diff --git a/libkcal/versit/vobject.h b/libkcal/versit/vobject.h index 0ec8b31..85c299e 100644 --- a/libkcal/versit/vobject.h +++ b/libkcal/versit/vobject.h | |||
@@ -142,7 +142,7 @@ extern "C" { | |||
142 | #define VCEventProp "VEVENT" | 142 | #define VCEventProp "VEVENT" |
143 | #define VCEWorldProp "EWORLD" | 143 | #define VCEWorldProp "EWORLD" |
144 | #define VCExNumProp "EXNUM" | 144 | #define VCExNumProp "EXNUM" |
145 | #define VCExDateProp "EXDATE" | 145 | #define VCExpDateProp "EXDATE" |
146 | #define VCExpectProp "EXPECT" | 146 | #define VCExpectProp "EXPECT" |
147 | #define VCExtAddressProp "EXT ADD" | 147 | #define VCExtAddressProp "EXT ADD" |
148 | #define VCFamilyNameProp "F" | 148 | #define VCFamilyNameProp "F" |
@@ -247,111 +247,85 @@ extern "C" { | |||
247 | #define VCX509Prop "X509" | 247 | #define VCX509Prop "X509" |
248 | #define VCXRuleProp "XRULE" | 248 | #define VCXRuleProp "XRULE" |
249 | 249 | ||
250 | /* extensions for KOrganizer / KPilot */ | 250 | /* Extensions */ |
251 | #define KPilotIdProp "X-PILOTID" | ||
252 | #define KPilotStatusProp "X-PILOTSTAT" | ||
253 | 251 | ||
252 | #define XPilotIdProp "X-PILOTID" | ||
253 | #define XPilotStatusProp "X-PILOTSTAT" | ||
254 | /* extensions for iMIP / iTIP */ | 254 | /* extensions for iMIP / iTIP */ |
255 | #define ICOrganizerProp "X-ORGANIZER" | 255 | #define ICOrganizerProp "X-ORGANIZER" |
256 | #define ICMethodProp "X-METHOD" | 256 | #define ICMethodProp "X-METHOD" |
257 | #define ICRequestStatusProp "X-REQUEST-STATUS" | 257 | #define ICRequestStatusProp "X-REQUEST-STATUS" |
258 | |||
259 | typedef struct VObject VObject; | 258 | typedef struct VObject VObject; |
260 | 259 | ||
261 | typedef union ValueItem { | ||
262 | const char *strs; | ||
263 | const wchar_t *ustrs; | ||
264 | unsigned int i; | ||
265 | unsigned long l; | ||
266 | void *any; | ||
267 | VObject *vobj; | ||
268 | } ValueItem; | ||
269 | |||
270 | struct VObject { | ||
271 | VObject *next; | ||
272 | const char *id; | ||
273 | VObject *prop; | ||
274 | unsigned short valType; | ||
275 | ValueItem val; | ||
276 | }; | ||
277 | |||
278 | typedef struct StrItem StrItem; | ||
279 | |||
280 | struct StrItem { | ||
281 | StrItem *next; | ||
282 | const char *s; | ||
283 | unsigned int refCnt; | ||
284 | }; | ||
285 | |||
286 | typedef struct VObjectIterator { | 260 | typedef struct VObjectIterator { |
287 | VObject* start; | 261 | VObject* start; |
288 | VObject* next; | 262 | VObject* next; |
289 | } VObjectIterator; | 263 | } VObjectIterator; |
290 | 264 | ||
291 | extern VObject* newVObject(const char *id); | 265 | extern DLLEXPORT(VObject*) newVObject(const char *id); |
292 | extern void deleteVObject(VObject *p); | 266 | extern DLLEXPORT(void) deleteVObject(VObject *p); |
293 | extern char* dupStr(const char *s, unsigned int size); | 267 | extern DLLEXPORT(char*) dupStr(const char *s, unsigned int size); |
294 | extern void deleteStr(const char *p); | 268 | extern DLLEXPORT(void) deleteStr(const char *p); |
295 | extern void unUseStr(const char *s); | 269 | extern DLLEXPORT(void) unUseStr(const char *s); |
296 | 270 | ||
297 | extern void setVObjectName(VObject *o, const char* id); | 271 | extern DLLEXPORT(void) setVObjectName(VObject *o, const char* id); |
298 | extern void setVObjectStringZValue(VObject *o, const char *s); | 272 | extern DLLEXPORT(void) setVObjectStringZValue(VObject *o, const char *s); |
299 | extern void setVObjectStringZValue_(VObject *o, const char *s); | 273 | extern DLLEXPORT(void) setVObjectStringZValue_(VObject *o, const char *s); |
300 | extern void setVObjectUStringZValue(VObject *o, const wchar_t *s); | 274 | extern DLLEXPORT(void) setVObjectUStringZValue(VObject *o, const wchar_t *s); |
301 | extern void setVObjectUStringZValue_(VObject *o, const wchar_t *s); | 275 | extern DLLEXPORT(void) setVObjectUStringZValue_(VObject *o, const wchar_t *s); |
302 | extern void setVObjectIntegerValue(VObject *o, unsigned int i); | 276 | extern DLLEXPORT(void) setVObjectIntegerValue(VObject *o, unsigned int i); |
303 | extern void setVObjectLongValue(VObject *o, unsigned long l); | 277 | extern DLLEXPORT(void) setVObjectLongValue(VObject *o, unsigned long l); |
304 | extern void setVObjectAnyValue(VObject *o, void *t); | 278 | extern DLLEXPORT(void) setVObjectAnyValue(VObject *o, void *t); |
305 | extern VObject* setValueWithSize(VObject *prop, void *val, unsigned int size); | 279 | extern DLLEXPORT(VObject*) setValueWithSize(VObject *prop, void *val, unsigned int size); |
306 | extern VObject* setValueWithSize_(VObject *prop, void *val, unsigned int size); | 280 | extern DLLEXPORT(VObject*) setValueWithSize_(VObject *prop, void *val, unsigned int size); |
307 | 281 | ||
308 | extern const char* vObjectName(VObject *o); | 282 | extern DLLEXPORT(const char*) vObjectName(VObject *o); |
309 | extern const char* vObjectStringZValue(VObject *o); | 283 | extern DLLEXPORT(const char*) vObjectStringZValue(VObject *o); |
310 | extern const wchar_t* vObjectUStringZValue(VObject *o); | 284 | extern DLLEXPORT(const wchar_t*) vObjectUStringZValue(VObject *o); |
311 | extern unsigned int vObjectIntegerValue(VObject *o); | 285 | extern DLLEXPORT(unsigned int) vObjectIntegerValue(VObject *o); |
312 | extern unsigned long vObjectLongValue(VObject *o); | 286 | extern DLLEXPORT(unsigned long) vObjectLongValue(VObject *o); |
313 | extern void* vObjectAnyValue(VObject *o); | 287 | extern DLLEXPORT(void*) vObjectAnyValue(VObject *o); |
314 | extern VObject* vObjectVObjectValue(VObject *o); | 288 | extern DLLEXPORT(VObject*) vObjectVObjectValue(VObject *o); |
315 | extern void setVObjectVObjectValue(VObject *o, VObject *p); | 289 | extern DLLEXPORT(void) setVObjectVObjectValue(VObject *o, VObject *p); |
316 | 290 | ||
317 | extern VObject* addVObjectProp(VObject *o, VObject *p); | 291 | extern DLLEXPORT(VObject*) addVObjectProp(VObject *o, VObject *p); |
318 | extern VObject* addProp(VObject *o, const char *id); | 292 | extern DLLEXPORT(VObject*) addProp(VObject *o, const char *id); |
319 | extern VObject* addProp_(VObject *o, const char *id); | 293 | extern DLLEXPORT(VObject*) addProp_(VObject *o, const char *id); |
320 | extern VObject* addPropValue(VObject *o, const char *p, const char *v); | 294 | extern DLLEXPORT(VObject*) addPropValue(VObject *o, const char *p, const char *v); |
321 | extern VObject* addPropSizedValue_(VObject *o, const char *p, const char *v, unsigned int size); | 295 | extern DLLEXPORT(VObject*) addPropSizedValue_(VObject *o, const char *p, const char *v, unsigned int size); |
322 | extern VObject* addPropSizedValue(VObject *o, const char *p, const char *v, unsigned int size); | 296 | extern DLLEXPORT(VObject*) addPropSizedValue(VObject *o, const char *p, const char *v, unsigned int size); |
323 | extern VObject* addGroup(VObject *o, const char *g); | 297 | extern DLLEXPORT(VObject*) addGroup(VObject *o, const char *g); |
324 | extern void addList(VObject **o, VObject *p); | 298 | extern DLLEXPORT(void) addList(VObject **o, VObject *p); |
325 | 299 | ||
326 | extern VObject* isAPropertyOf(VObject *o, const char *id); | 300 | extern DLLEXPORT(VObject*) isAPropertyOf(VObject *o, const char *id); |
327 | 301 | ||
328 | extern VObject* nextVObjectInList(VObject *o); | 302 | extern DLLEXPORT(VObject*) nextVObjectInList(VObject *o); |
329 | extern void initPropIterator(VObjectIterator *i, VObject *o); | 303 | extern DLLEXPORT(void) initPropIterator(VObjectIterator *i, VObject *o); |
330 | extern int moreIteration(VObjectIterator *i); | 304 | extern DLLEXPORT(int) moreIteration(VObjectIterator *i); |
331 | extern VObject* nextVObject(VObjectIterator *i); | 305 | extern DLLEXPORT(VObject*) nextVObject(VObjectIterator *i); |
332 | 306 | ||
333 | extern char* writeMemVObject(char *s, int *len, VObject *o); | 307 | extern DLLEXPORT(char*) writeMemVObject(char *s, int *len, VObject *o); |
334 | extern char* writeMemVObjects(char *s, int *len, VObject *list); | 308 | extern DLLEXPORT(char*) writeMemVObjects(char *s, int *len, VObject *list); |
335 | 309 | ||
336 | extern const char* lookupStr(const char *s); | 310 | extern DLLEXPORT(const char*) lookupStr(const char *s); |
337 | extern void cleanStrTbl(); | 311 | extern DLLEXPORT(void) cleanStrTbl(); |
338 | 312 | ||
339 | extern void cleanVObject(VObject *o); | 313 | extern DLLEXPORT(void) cleanVObject(VObject *o); |
340 | extern void cleanVObjects(VObject *list); | 314 | extern DLLEXPORT(void) cleanVObjects(VObject *list); |
341 | 315 | ||
342 | extern const char* lookupProp(const char* str); | 316 | extern DLLEXPORT(const char*) lookupProp(const char* str); |
343 | extern const char* lookupProp_(const char* str); | 317 | extern DLLEXPORT(const char*) lookupProp_(const char* str); |
344 | 318 | ||
345 | extern wchar_t* fakeUnicode(const char *ps, int *bytes); | 319 | extern DLLEXPORT(wchar_t*) fakeUnicode(const char *ps, int *bytes); |
346 | extern int uStrLen(const wchar_t *u); | 320 | extern DLLEXPORT(int) uStrLen(const wchar_t *u); |
347 | extern char* fakeCString(const wchar_t *u); | 321 | extern DLLEXPORT(char*) fakeCString(const wchar_t *u); |
348 | 322 | ||
349 | extern void printVObjectToFile(char *fname,VObject *o); | 323 | extern DLLEXPORT(void) printVObjectToFile(char *fname,VObject *o); |
350 | extern void printVObjectsToFile(char *fname,VObject *list); | 324 | extern DLLEXPORT(void) printVObjectsToFile(char *fname,VObject *list); |
351 | extern void writeVObjectToFile(char *fname, VObject *o); | 325 | extern DLLEXPORT(void) writeVObjectToFile(char *fname, VObject *o); |
352 | extern void writeVObjectsToFile(char *fname, VObject *list); | 326 | extern DLLEXPORT(void) writeVObjectsToFile(char *fname, VObject *list); |
353 | 327 | ||
354 | extern int vObjectValueType(VObject *o); | 328 | extern DLLEXPORT(int) vObjectValueType(VObject *o); |
355 | 329 | ||
356 | /* return type of vObjectValueType: */ | 330 | /* return type of vObjectValueType: */ |
357 | #define VCVT_NOVALUE0 | 331 | #define VCVT_NOVALUE0 |
@@ -371,6 +345,17 @@ extern int vObjectValueType(VObject *o); | |||
371 | 345 | ||
372 | extern const char** fieldedProp; | 346 | extern const char** fieldedProp; |
373 | 347 | ||
348 | /* NOTE regarding printVObject and writeVObject | ||
349 | |||
350 | The functions below are not exported from the DLL because they | ||
351 | take a FILE* as a parameter, which cannot be passed across a DLL | ||
352 | interface (at least that is my experience). Instead you can use | ||
353 | their companion functions which take file names or pointers | ||
354 | to memory. However, if you are linking this code into | ||
355 | your build directly then you may find them a more convenient API | ||
356 | and you can go ahead and use them. If you try to use them with | ||
357 | the DLL LIB you will get a link error. | ||
358 | */ | ||
374 | extern void printVObject(FILE *fp,VObject *o); | 359 | extern void printVObject(FILE *fp,VObject *o); |
375 | extern void writeVObject(FILE *fp, VObject *o); | 360 | extern void writeVObject(FILE *fp, VObject *o); |
376 | 361 | ||