1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
|
/*
* Copyright (C) 1999-2000 Thomas Roessler <roessler@guug.de>
*
* This program is free software; you can redistribute it
* and/or modify it under the terms of the GNU General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later
* version.
*
* This program is distributed in the hope that it will be
* useful, but WITHOUT ANY WARRANTY; without even the implied
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
* PURPOSE. See the GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the Free
* Software Foundation, Inc., 675 Mass Ave, Cambridge, MA
* 02139, USA.
*/
/*
* Yet another MIME encoding for header data. This time, it's
* parameters, specified in RFC 2231, and modeled after the
* encoding used in URLs.
*
* Additionally, continuations and encoding are mixed in an, errrm,
* interesting manner.
*
*/
#include "mutt.h"
#include "mime.h"
#include "charset.h"
#include "rfc2047.h"
#include "rfc2231.h"
#include <ctype.h>
#include <string.h>
#include <stdlib.h>
struct rfc2231_parameter
{
char *attribute;
char *value;
int index;
int encoded;
struct rfc2231_parameter
*next;
};
static char *rfc2231_get_charset (char *, char *, size_t);
static struct rfc2231_parameter *rfc2231_new_parameter (void);
static void rfc2231_decode_one (char *, char *, char *);
static void rfc2231_free_parameter (struct rfc2231_parameter **);
static void rfc2231_join_continuations (PARAMETER **, struct rfc2231_parameter *);
static void rfc2231_list_insert (struct rfc2231_parameter **, struct rfc2231_parameter *);
static void purge_empty_parameters (PARAMETER **headp)
{
PARAMETER *p, *q, **last;
for (last = headp, p = *headp; p; p = q)
{
q = p->next;
if (!p->attribute || !p->value)
{
*last = q;
p->next = NULL;
mutt_free_parameter (&p);
}
else
last = &p->next;
}
}
void rfc2231_decode_parameters (PARAMETER **headp)
{
PARAMETER *head = NULL;
PARAMETER **last;
PARAMETER *p, *q;
struct rfc2231_parameter *conthead = NULL;
struct rfc2231_parameter *conttmp;
char *s, *t;
char charset[STRING];
int encoded;
int index;
short dirty = 0; /* set to 1 when we may have created
* empty parameters.
*/
if (!headp) return;
purge_empty_parameters (headp);
for (last = &head, p = *headp; p; p = q)
{
q = p->next;
if (!(s = strchr (p->attribute, '*')))
{
/*
* Using RFC 2047 encoding in MIME parameters is explicitly
* forbidden by that document. Nevertheless, it's being
* generated by some software, including certain Lotus Notes to
* Internet Gateways. So we actually decode it.
*/
if (option (OPTRFC2047PARAMS) && p->value && strstr (p->value, "=?"))
rfc2047_decode (p->value, p->value, strlen (p->value) + 1);
*last = p;
last = &p->next;
p->next = NULL;
}
else if (*(s + 1) == '\0')
{
*s = '\0';
s = rfc2231_get_charset (p->value, charset, sizeof (charset));
rfc2231_decode_one (p->value, s, charset);
*last = p;
last = &p->next;
p->next = NULL;
dirty = 1;
}
else
{
*s = '\0'; s++; /* let s point to the first character of index. */
for (t = s; *t && isdigit (*t); t++)
;
encoded = (*t == '*');
*t = '\0';
index = atoi (s);
conttmp = rfc2231_new_parameter ();
conttmp->attribute = p->attribute;
conttmp->value = p->value;
conttmp->encoded = encoded;
conttmp->index = index;
p->attribute = NULL;
p->value = NULL;
safe_free ((void **) &p);
rfc2231_list_insert (&conthead, conttmp);
}
}
if (conthead)
{
rfc2231_join_continuations (last, conthead);
dirty = 1;
}
*headp = head;
if (dirty)
purge_empty_parameters (headp);
}
static struct rfc2231_parameter *rfc2231_new_parameter (void)
{
return safe_calloc (sizeof (struct rfc2231_parameter), 1);
}
static void rfc2231_free_parameter (struct rfc2231_parameter **p)
{
if (*p)
{
safe_free ((void **) &(*p)->attribute);
safe_free ((void **) &(*p)->value);
safe_free ((void **) p);
}
}
static char *rfc2231_get_charset (char *value, char *charset, size_t chslen)
{
char *t, *u;
if (!(t = strchr (value, '\'')))
{
charset[0] = '\0';
return value;
}
*t = '\0';
strfcpy (charset, value, chslen);
if ((u = strchr (t + 1, '\'')))
return u + 1;
else
return t + 1;
}
static void rfc2231_decode_one (char *dest, char *src, char *chs)
{
char *d;
for (d = dest; *src; src++)
{
if (*src == '%' && isxdigit (*(src + 1)) && isxdigit (*(src + 2)))
{
*d++ = (hexval (*(src + 1)) << 4) | (hexval (*(src + 2)));
src += 2;
}
else
*d++ = *src;
}
*d = '\0';
if (chs && strcmp (chs, "us-ascii") && strcmp (chs, Charset))
{
if (mutt_is_utf8 (chs))
mutt_decode_utf8_string (dest, mutt_get_charset (Charset));
else
mutt_display_string (dest, mutt_get_translation (chs, Charset));
mutt_display_sanitize (dest);
}
}
/* insert parameter into an ordered list.
*
* Primary sorting key: attribute
* Secondary sorting key: index
*/
static void rfc2231_list_insert (struct rfc2231_parameter **list,
struct rfc2231_parameter *par)
{
struct rfc2231_parameter **last = list;
struct rfc2231_parameter *p = *list, *q;
int c;
while (p)
{
last = &p->next;
q = p; p = p->next;
c = strcmp (par->value, q->value);
if ((c > 0) || (c == 0 && par->index >= q->index))
break;
}
par->next = p;
*last = par;
}
/* process continuation parameters */
static void rfc2231_join_continuations (PARAMETER **head,
struct rfc2231_parameter *par)
{
struct rfc2231_parameter *q;
char attribute[STRING];
char charset[STRING];
char *value = NULL;
char *valp;
int encoded;
size_t l, vl;
while (par)
{
value = NULL; l = 0;
strfcpy (attribute, par->attribute, sizeof
|