mime_cte.c

   1 /*@ S-nail - a mail user agent derived from Berkeley Mail.
   2  *@ Content-Transfer-Encodings as defined in RFC 2045:
   3  *@ - Quoted-Printable, section 6.7
   4  *@ - Base64, section 6.8
   5  *
   6  * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
   7  * Copyright (c) 2012 - 2014 Steffen (Daode) Nurpmeso <sdaoden@users.sf.net>.
   8  */
   9 /* QP quoting idea, _b64_decode(), b64_encode() taken from NetBSDs mailx(1): */
  10 /* $NetBSD: mime_codecs.c,v 1.9 2009/04/10 13:08:25 christos Exp $ */
  11 /*
  12  * Copyright (c) 2006 The NetBSD Foundation, Inc.
  13  * All rights reserved.
  14  *
  15  * This code is derived from software contributed to The NetBSD Foundation
  16  * by Anon Ymous.
  17  *
  18  * Redistribution and use in source and binary forms, with or without
  19  * modification, are permitted provided that the following conditions
  20  * are met:
  21  * 1. Redistributions of source code must retain the above copyright
  22  *    notice, this list of conditions and the following disclaimer.
  23  * 2. Redistributions in binary form must reproduce the above copyright
  24  *    notice, this list of conditions and the following disclaimer in the
  25  *    documentation and/or other materials provided with the distribution.
  26  *
  27  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
  28  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
  29  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  30  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
  31  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  32  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  33  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  34  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  35  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  36  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  37  * POSSIBILITY OF SUCH DAMAGE.
  38  */
  39
  40 #ifndef HAVE_AMALGAMATION
  41 # include "nail.h"
  42 #endif
  43
  44 enum _qact {
  45     N =   0,   /* Do not quote */
  46     Q =   1,   /* Must quote */
  47    SP =   2,   /* sp */
  48    XF =   3,   /* Special character 'F' - maybe quoted */
  49    XD =   4,   /* Special character '.' - maybe quoted */
  50    US = '_',   /* In header, special character ' ' quoted as '_' */
  51    QM = '?',   /* In header, special character ? not always quoted */
  52    EQ =   Q,   /* '=' must be quoted */
  53    TB =  SP,   /* Treat '\t' as a space */
  54    NL =   N,   /* Don't quote '\n' (NL) */
  55    CR =   Q    /* Always quote a '\r' (CR) */
  56 };
  57
  58 /* Lookup tables to decide wether a character must be encoded or not.
  59  * Email header differences according to RFC 2047, section 4.2:
  60  * - also quote SP (as the underscore _), TAB, ?, _, CR, LF
  61  * - don't care about the special ^F[rom] and ^.$ */
  62 static ui8_t const   _qtab_body[] = {
  63     Q, Q, Q, Q,  Q, Q, Q, Q,  Q,TB,NL, Q,  Q,CR, Q, Q,
  64     Q, Q, Q, Q,  Q, Q, Q, Q,  Q, Q, Q, Q,  Q, Q, Q, Q,
  65    SP, N, N, N,  N, N, N, N,  N, N, N, N,  N, N,XD, N,
  66     N, N, N, N,  N, N, N, N,  N, N, N, N,  N,EQ, N, N,
  67
  68     N, N, N, N,  N, N,XF, N,  N, N, N, N,  N, N, N, N,
  69     N, N, N, N,  N, N, N, N,  N, N, N, N,  N, N, N, N,
  70     N, N, N, N,  N, N, N, N,  N, N, N, N,  N, N, N, N,
  71     N, N, N, N,  N, N, N, N,  N, N, N, N,  N, N, N, Q,
  72 },
  73                      _qtab_head[] = {
  74     Q, Q, Q, Q,  Q, Q, Q, Q,  Q, Q, Q, Q,  Q, Q, Q, Q,
  75     Q, Q, Q, Q,  Q, Q, Q, Q,  Q, Q, Q, Q,  Q, Q, Q, Q,
  76    US, N, N, N,  N, N, N, N,  N, N, N, N,  N, N, N, N,
  77     N, N, N, N,  N, N, N, N,  N, N, N, N,  N,EQ, N,QM,
  78
  79     N, N, N, N,  N, N, N, N,  N, N, N, N,  N, N, N, N,
  80     N, N, N, N,  N, N, N, N,  N, N, N, N,  N, N, N, Q,
  81     N, N, N, N,  N, N, N, N,  N, N, N, N,  N, N, N, N,
  82     N, N, N, N,  N, N, N, N,  N, N, N, N,  N, N, N, Q,
  83 };
  84
  85 /* Check wether **s* must be quoted according to *ishead*, else body rules;
  86  * *sol* indicates wether we are at the first character of a line/field */
  87 SINLINE enum _qact   _mustquote(char const *s, char const *e, bool_t sol,
  88                         bool_t ishead);
  89
  90 /* Convert c to/from a hexadecimal character string */
  91 SINLINE char *       _qp_ctohex(char *store, char c);
  92 SINLINE si32_t       _qp_cfromhex(char const *hex);
  93
  94 /* Trim WS and make *work* point to the decodable range of *in*.
  95  * Return the amount of bytes a b64_decode operation on that buffer requires */
  96 static size_t        _b64_decode_prepare(struct str *work,
  97                         struct str const *in);
  98
  99 /* Perform b64_decode on sufficiently spaced & multiple-of-4 base *in*put.
 100  * Return number of useful bytes in *out* or -1 on error */
 101 static ssize_t       _b64_decode(struct str *out, struct str *in);
 102
 103 SINLINE enum _qact
 104 _mustquote(char const *s, char const *e, bool_t sol, bool_t ishead)
 105 {
 106    ui8_t const *qtab;
 107    enum _qact a, r;
 108    NYD2_ENTER;
 109
 110    qtab = ishead ? _qtab_head : _qtab_body;
 111    a = ((ui8_t)*s > 0x7F) ? Q : qtab[(ui8_t)*s];
 112
 113    if ((r = a) == N || (r = a) == Q)
 114       goto jleave;
 115    r = Q;
 116
 117    /* Special header fields */
 118    if (ishead) {
 119       /* ' ' -> '_' */
 120       if (a == US) {
 121          r = US;
 122          goto jleave;
 123       }
 124       /* Treat '?' only special if part of '=?' .. '?=' (still too much quoting
 125        * since it's '=?CHARSET?CTE?stuff?=', and especially the trailing ?=
 126        * should be hard too match */
 127       if (a == QM && ((!sol && s[-1] == '=') || (s < e && s[1] == '=')))
 128          goto jleave;
 129       goto jnquote;
 130    }
 131
 132    /* Body-only */
 133
 134    if (a == SP) {
 135       /* WS only if trailing white space */
 136       if (PTRCMP(s + 1, ==, e) || s[1] == '\n')
 137          goto jleave;
 138       goto jnquote;
 139    }
 140
 141    /* Rest are special begin-of-line cases */
 142    if (!sol)
 143       goto jnquote;
 144
 145    /* ^From */
 146    if (a == XF) {
 147       if (PTRCMP(s + 4, <, e) && s[1] == 'r' && s[2] == 'o' && s[3] == 'm')
 148          goto jleave;
 149       goto jnquote;
 150    }
 151    /* ^.$ */
 152    if (a == XD && (PTRCMP(s + 1, ==, e) || s[1] == '\n'))
 153       goto jleave;
 154 jnquote:
 155    r = N;
 156 jleave:
 157    NYD2_LEAVE;
 158    return r;
 159 }
 160
 161 SINLINE char *
 162 _qp_ctohex(char *store, char c)
 163 {
 164    static char const hexmap[] = "0123456789ABCDEF";
 165    NYD2_ENTER;
 166
 167    store[2] = '\0';
 168    store[1] = hexmap[(ui8_t)c & 0x0F];
 169    c = ((ui8_t)c >> 4) & 0x0F;
 170    store[0] = hexmap[(ui8_t)c];
 171    NYD2_LEAVE;
 172    return store;
 173 }
 174
 175 SINLINE si32_t
 176 _qp_cfromhex(char const *hex)
 177 {
 178    /* Be robust, allow lowercase hexadecimal letters, too */
 179    static ui8_t const atoi16[] = {
 180       0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, /* 0x30-0x37 */
 181       0x08, 0x09, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, /* 0x38-0x3F */
 182       0xFF, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0xFF, /* 0x40-0x47 */
 183       0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, /* 0x48-0x4f */
 184       0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, /* 0x50-0x57 */
 185       0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, /* 0x58-0x5f */
 186       0xFF, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0xFF  /* 0x60-0x67 */
 187    };
 188
 189    ui8_t i1, i2;
 190    si32_t r;
 191    NYD2_ENTER;
 192
 193    if ((i1 = (ui8_t)hex[0] - '0') >= NELEM(atoi16) ||
 194          (i2 = (ui8_t)hex[1] - '0') >= NELEM(atoi16))
 195       goto jerr;
 196    i1 = atoi16[i1];
 197    i2 = atoi16[i2];
 198    if ((i1 | i2) & 0xF0u)
 199       goto jerr;
 200    r = i1;
 201    r <<= 4;
 202    r += i2;
 203 jleave:
 204    NYD2_LEAVE;
 205    return r;
 206 jerr:
 207    r = -1;
 208    goto jleave;
 209 }
 210
 211 static size_t
 212 _b64_decode_prepare(struct str *work, struct str const *in)
 213 {
 214    char *cp;
 215    size_t cp_len;
 216    NYD2_ENTER;
 217
 218    cp = in->s;
 219    cp_len = in->l;
 220
 221    while (cp_len > 0 && spacechar(*cp))
 222       ++cp, --cp_len;
 223    work->s = cp;
 224
 225    for (cp += cp_len; cp_len > 0; --cp_len) {
 226       char c = *--cp;
 227       if (!spacechar(c))
 228          break;
 229    }
 230    work->l = cp_len;
 231
 232    if (cp_len > 16)
 233       cp_len = ((cp_len * 3) >> 2) + (cp_len >> 3);
 234    NYD2_LEAVE;
 235    return cp_len;
 236 }
 237
 238 static ssize_t
 239 _b64_decode(struct str *out, struct str *in)
 240 {
 241    static signed char const b64index[] = {
 242       -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
 243       -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
 244       -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,62, -1,-1,-1,63,
 245       52,53,54,55, 56,57,58,59, 60,61,-1,-1, -1,-2,-1,-1,
 246       -1, 0, 1, 2,  3, 4, 5, 6,  7, 8, 9,10, 11,12,13,14,
 247       15,16,17,18, 19,20,21,22, 23,24,25,-1, -1,-1,-1,-1,
 248       -1,26,27,28, 29,30,31,32, 33,34,35,36, 37,38,39,40,
 249       41,42,43,44, 45,46,47,48, 49,50,51,-1, -1,-1,-1,-1
 250    };
 251 #define EQU          (ui32_t)-2
 252 #define BAD          (ui32_t)-1
 253 #define uchar64(c)   ((c) >= sizeof(b64index) ? BAD : (ui32_t)b64index[(c)])
 254
 255    ssize_t ret = -1;
 256    ui8_t *p;
 257    ui8_t const *q, *end;
 258    NYD2_ENTER;
 259
 260    p = (ui8_t*)out->s;
 261    q = (ui8_t const*)in->s;
 262    out->l = 0;
 263
 264    for (end = q + in->l; PTRCMP(q + 4, <=, end); q += 4) {
 265       ui32_t a = uchar64(q[0]), b = uchar64(q[1]), c = uchar64(q[2]),
 266          d = uchar64(q[3]);
 267
 268       if (a >= EQU || b >= EQU || c == BAD || d == BAD)
 269          goto jleave;
 270
 271       *p++ = ((a << 2) | ((b & 0x30) >> 4));
 272       if (c == EQU)  { /* got '=' */
 273          if (d != EQU)
 274             goto jleave;
 275          break;
 276       }
 277       *p++ = (((b & 0x0F) << 4) | ((c & 0x3C) >> 2));
 278       if (d == EQU) /* got '=' */
 279          break;
 280       *p++ = (((c & 0x03) << 6) | d);
 281    }
 282 #undef uchar64
 283 #undef EQU
 284 #undef BAD
 285
 286    ret = PTR2SIZE((char*)p - out->s);
 287    out->l = (size_t)ret;
 288 jleave:
 289    in->l -= PTR2SIZE((char*)UNCONST(q) - in->s);
 290    in->s = UNCONST(q);
 291    NYD2_LEAVE;
 292    return ret;
 293 }
 294
 295 FL char *
 296 mime_char_to_hexseq(char store[3], char c)
 297 {
 298    char *rv;
 299    NYD2_ENTER;
 300
 301    rv = _qp_ctohex(store, c);
 302    NYD2_LEAVE;
 303    return rv;
 304 }
 305
 306 FL si32_t
 307 mime_hexseq_to_char(char const *hex)
 308 {
 309    si32_t rv;
 310    NYD2_ENTER;
 311
 312    rv = _qp_cfromhex(hex);
 313    NYD2_LEAVE;
 314    return rv;
 315 }
 316
 317 FL size_t
 318 mime_cte_mustquote(char const *ln, size_t lnlen, bool_t ishead)
 319 {
 320    size_t ret;
 321    bool_t sol;
 322    NYD_ENTER;
 323
 324    for (ret = 0, sol = TRU1; lnlen > 0; sol = FAL0, ++ln, --lnlen)
 325       ret += (_mustquote(ln, ln + lnlen, sol, ishead) != N);
 326    NYD_LEAVE;
 327    return ret;
 328 }
 329
 330 FL size_t
 331 qp_encode_calc_size(size_t len)
 332 {
 333    NYD_ENTER;
 334    /* Worst case: 'CRLF' -> '=0D=0A=\n\0' */
 335    len = (len * 3) + 1/* soft NL */ + 1/* visual NL */ + 1/* NUL */;
 336    NYD_LEAVE;
 337    return len;
 338 }
 339
 340 #ifdef notyet
 341 FL struct str *
 342 qp_encode_cp(struct str *out, char const *cp, enum qpflags flags)
 343 {
 344    struct str in;
 345    NYD_ENTER;
 346
 347    in.s = UNCONST(cp);
 348    in.l = strlen(cp);
 349    out = qp_encode(out, &in, flags);
 350    NYD_LEAVE;
 351    return out;
 352 }
 353
 354 FL struct str *
 355 qp_encode_buf(struct str *out, void const *vp, size_t vp_len,
 356    enum qpflags flags)
 357 {
 358    struct str in;
 359    NYD_ENTER;
 360
 361    in.s = UNCONST(vp);
 362    in.l = vp_len;
 363    out = qp_encode(out, &in, flags);
 364    NYD_LEAVE;
 365    return out;
 366 }
 367 #endif /* notyet */
 368
 369 FL struct str *
 370 qp_encode(struct str *out, struct str const *in, enum qpflags flags)
 371 {
 372    bool_t sol = (flags & QP_ISHEAD ? FAL0 : TRU1), seenx;
 373    ssize_t lnlen;
 374    char *qp;
 375    char const *is, *ie;
 376    NYD_ENTER;
 377
 378    if (!(flags & QP_BUF)) {
 379       lnlen = qp_encode_calc_size(in->l);
 380       out->s = (flags & QP_SALLOC) ? salloc(lnlen) : srealloc(out->s, lnlen);
 381    }
 382    qp = out->s;
 383    is = in->s;
 384    ie = is + in->l;
 385
 386    /* QP_ISHEAD? */
 387    if (!sol) {
 388       for (seenx = FAL0, sol = TRU1; is < ie; sol = FAL0, ++qp) {
 389          enum _qact mq = _mustquote(is, ie, sol, TRU1);
 390          char c = *is++;
 391
 392          if (mq == N) {
 393             /* We convert into a single *encoded-word*, that'll end up in
 394              * =?C?Q??=; quote '?' from when we're inside there on */
 395             if (seenx && c == '?')
 396                goto jheadq;
 397             *qp = c;
 398          } else if (mq == US)
 399             *qp = US;
 400          else {
 401             seenx = TRU1;
 402 jheadq:
 403             *qp++ = '=';
 404             qp = _qp_ctohex(qp, c) + 1;
 405          }
 406       }
 407       goto jleave;
 408    }
 409
 410    /* The body needs to take care for soft line breaks etc. */
 411    for (lnlen = 0, seenx = FAL0; is < ie; sol = FAL0) {
 412       enum _qact mq = _mustquote(is, ie, sol, FAL0);
 413       char c = *is++;
 414
 415       if (mq == N && (c != '\n' || !seenx)) {
 416          *qp++ = c;
 417          if (++lnlen < QP_LINESIZE - 1)
 418             continue;
 419          /* Don't write a soft line break when we're in the last possible
 420           * column and either an LF has been written or only an LF follows, as
 421           * that'll end the line anyway */
 422          /* XXX but - ensure is+1>=ie, then??
 423           * xxx and/or - what about resetting lnlen; that contra
 424           * xxx dicts input==1 input line assertion, though */
 425          if (c == '\n' || is == ie || *is == '\n')
 426             continue;
 427 jsoftnl:
 428          qp[0] = '=';
 429          qp[1] = '\n';
 430          qp += 2;
 431          lnlen = 0;
 432          continue;
 433       }
 434
 435       if (lnlen > QP_LINESIZE - 3 - 1) {
 436          qp[0] = '=';
 437          qp[1] = '\n';
 438          qp += 2;
 439          lnlen = 0;
 440       }
 441       *qp++ = '=';
 442       qp = _qp_ctohex(qp, c);
 443       qp += 2;
 444       lnlen += 3;
 445       if (c != '\n' || !seenx)
 446          seenx = (c == '\r');
 447       else {
 448          seenx = FAL0;
 449          goto jsoftnl;
 450       }
 451    }
 452
 453    /* Enforce soft line break if we haven't seen LF */
 454    if (in->l > 0 && *--is != '\n') {
 455       qp[0] = '=';
 456       qp[1] = '\n';
 457       qp += 2;
 458    }
 459 jleave:
 460    out->l = PTR2SIZE(qp - out->s);
 461    out->s[out->l] = '\0';
 462    NYD_LEAVE;
 463    return out;
 464 }
 465
 466 FL int
 467 qp_decode(struct str *out, struct str const *in, struct str *rest)
 468 {
 469    int ret = STOP;
 470    char *os, *oc;
 471    char const *is, *ie;
 472    NYD_ENTER;
 473
 474    if (rest != NULL && rest->l != 0) {
 475       os = out->s;
 476       *out = *rest;
 477       rest->s = os;
 478       rest->l = 0;
 479    }
 480
 481    oc = os =
 482    out->s = srealloc(out->s, out->l + in->l + 3);
 483    oc += out->l;
 484    is = in->s;
 485    ie = is + in->l;
 486
 487    /* Decoding encoded-word (RFC 2049) in a header field? */
 488    if (rest == NULL) {
 489       while (is < ie) {
 490          si32_t c = *is++;
 491          if (c == '=') {
 492             if (PTRCMP(is + 1, >=, ie)) {
 493                ++is;
 494                goto jehead;
 495             }
 496             c = _qp_cfromhex(is);
 497             is += 2;
 498             if (c >= 0)
 499                *oc++ = (char)c;
 500             else {
 501                /* Invalid according to RFC 2045, section 6.7. Almost follow */
 502 jehead:
 503                /* TODO 0xFFFD
 504                *oc[0] = '['; oc[1] = '?'; oc[2] = ']';
 505                *oc += 3; 0xFFFD TODO
 506                */ *oc++ = '?';
 507             }
 508          } else
 509             *oc++ = (c == '_') ? ' ' : (char)c;
 510       }
 511       goto jleave; /* XXX QP decode, header: errors not reported */
 512    }
 513
 514    /* Decoding a complete message/mimepart body line */
 515    while (is < ie) {
 516       si32_t c = *is++;
 517       if (c != '=') {
 518          *oc++ = (char)c;
 519          continue;
 520       }
 521
 522       /* RFC 2045, 6.7:
 523        *   Therefore, when decoding a Quoted-Printable body, any
 524        *   trailing white space on a line must be deleted, as it will
 525        *   necessarily have been added by intermediate transport
 526        *   agents */
 527       for (; is < ie && blankchar(*is); ++is)
 528          ;
 529       if (PTRCMP(is + 1, >=, ie)) {
 530          /* Soft line break? */
 531          if (*is == '\n')
 532             goto jsoftnl;
 533          ++is;
 534          goto jebody;
 535       }
 536
 537       /* Not a soft line break? */
 538       if (*is != '\n') {
 539          c = _qp_cfromhex(is);
 540          is += 2;
 541          if (c >= 0)
 542             *oc++ = (char)c;
 543          else {
 544             /* Invalid according to RFC 2045, section 6.7.
 545              * Almost follow it and include the = and the follow char */
 546 jebody:
 547             /* TODO 0xFFFD
 548             *oc[0] = '['; oc[1] = '?'; oc[2] = ']';
 549             *oc += 3; 0xFFFD TODO
 550             */ *oc++ = '?';
 551          }
 552          continue;
 553       }
 554
 555       /* CRLF line endings are encoded as QP, followed by a soft line break, so
 556        * check for this special case, and simply forget we have seen one, so as
 557        * not to end up with the entire DOS file in a contiguous buffer */
 558 jsoftnl:
 559       if (oc > os && oc[-1] == '\n') {
 560 #if 0       /* TODO qp_decode() we do not normalize CRLF
 561           * TODO to LF because for that we would need
 562           * TODO to know if we are about to write to
 563           * TODO the display or do save the file!
 564           * TODO 'hope the MIME/send layer rewrite will
 565           * TODO offer the possibility to DTRT */
 566          if (oc - 1 > os && oc[-2] == '\r') {
 567             --oc;
 568             oc[-1] = '\n';
 569          }
 570 #endif
 571          break;
 572       }
 573       out->l = PTR2SIZE(oc - os);
 574       rest->s = srealloc(rest->s, rest->l + out->l);
 575       memcpy(rest->s + rest->l, out->s, out->l);
 576       rest->l += out->l;
 577       oc = os;
 578       break;
 579    }
 580    /* XXX RFC: QP decode should check no trailing WS on line */
 581 jleave:
 582    out->l = PTR2SIZE(oc - os);
 583    ret = OKAY;
 584    NYD_LEAVE;
 585    return ret;
 586 }
 587
 588 FL size_t
 589 b64_encode_calc_size(size_t len)
 590 {
 591    NYD_ENTER;
 592    len = (len * 4) / 3;
 593    len += (((len / B64_ENCODE_INPUT_PER_LINE) + 1) * 3);
 594    len += 2 + 1; /* CRLF, \0 */
 595    NYD_LEAVE;
 596    return len;
 597 }
 598
 599 FL struct str *
 600 b64_encode(struct str *out, struct str const *in, enum b64flags flags)
 601 {
 602    static char const b64table[] =
 603        "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
 604
 605    ui8_t const *p;
 606    ssize_t i, lnlen;
 607    char *b64;
 608    NYD_ENTER;
 609
 610    p = (ui8_t const*)in->s;
 611
 612    if (!(flags & B64_BUF)) {
 613       i = b64_encode_calc_size(in->l);
 614       out->s = (flags & B64_SALLOC) ? salloc(i) : srealloc(out->s, i);
 615    }
 616    b64 = out->s;
 617
 618    if (!(flags & (B64_CRLF | B64_LF)))
 619       flags &= ~B64_MULTILINE;
 620
 621    for (lnlen = 0, i = (ssize_t)in->l; i > 0; p += 3, i -= 3) {
 622       ui32_t a = p[0], b, c;
 623
 624       b64[0] = b64table[a >> 2];
 625       switch (i) {
 626       case 1:
 627          b64[1] = b64table[((a & 0x3) << 4)];
 628          b64[2] =
 629          b64[3] = '=';
 630          break;
 631       case 2:
 632          b = p[1];
 633          b64[1] = b64table[((a & 0x03) << 4) | ((b & 0xF0u) >> 4)];
 634          b64[2] = b64table[((b & 0x0F) << 2)];
 635          b64[3] = '=';
 636          break;
 637       default:
 638          b = p[1];
 639          c = p[2];
 640          b64[1] = b64table[((a & 0x03) << 4) | ((b & 0xF0u) >> 4)];
 641          b64[2] = b64table[((b & 0x0F) << 2) | ((c & 0xC0u) >> 6)];
 642          b64[3] = b64table[c & 0x3F];
 643          break;
 644       }
 645
 646       b64 += 4;
 647       if (!(flags & B64_MULTILINE))
 648          continue;
 649       lnlen += 4;
 650       if (lnlen < B64_LINESIZE)
 651          continue;
 652
 653       lnlen = 0;
 654       if (flags & B64_CRLF)
 655          *b64++ = '\r';
 656       if (flags & (B64_CRLF | B64_LF))
 657          *b64++ = '\n';
 658    }
 659
 660    if ((flags & (B64_CRLF | B64_LF)) &&
 661          (!(flags & B64_MULTILINE) || lnlen != 0)) {
 662       if (flags & B64_CRLF)
 663          *b64++ = '\r';
 664       if (flags & (B64_CRLF | B64_LF))
 665          *b64++ = '\n';
 666    }
 667    out->l = PTR2SIZE(b64 - out->s);
 668    out->s[out->l] = '\0';
 669    NYD_LEAVE;
 670    return out;
 671 }
 672
 673 FL struct str *
 674 b64_encode_buf(struct str *out, void const *vp, size_t vp_len,
 675    enum b64flags flags)
 676 {
 677    struct str in;
 678    NYD_ENTER;
 679
 680    in.s = UNCONST(vp);
 681    in.l = vp_len;
 682    out = b64_encode(out, &in, flags);
 683    NYD_LEAVE;
 684    return out;
 685 }
 686
 687 #ifdef HAVE_SMTP
 688 FL struct str *
 689 b64_encode_cp(struct str *out, char const *cp, enum b64flags flags)
 690 {
 691    struct str in;
 692    NYD_ENTER;
 693
 694    in.s = UNCONST(cp);
 695    in.l = strlen(cp);
 696    out = b64_encode(out, &in, flags);
 697    NYD_LEAVE;
 698    return out;
 699 }
 700 #endif
 701
 702 FL int
 703 b64_decode(struct str *out, struct str const *in, struct str *rest)
 704 {
 705    struct str work;
 706    char *x;
 707    int ret = STOP;
 708    size_t len;
 709    NYD_ENTER;
 710
 711    len = _b64_decode_prepare(&work, in);
 712
 713    /* Ignore an empty input, as may happen for an empty final line */
 714    if (work.l == 0) {
 715       /* With B64_T there may be leftover decoded data for iconv(3), even if
 716        * that means it's incomplete multibyte character we have to copy over */
 717       /* XXX strictly speaking this should not be handled in here,
 718        * XXX since its leftover decoded data from an iconv(3);
 719        * XXX like this we shared the prototype with QP, though?? */
 720       if (rest != NULL && rest->l > 0) {
 721          x = out->s;
 722          *out = *rest;
 723          rest->s = x;
 724          rest->l = 0;
 725       } else
 726          out->l = 0;
 727       ret = OKAY;
 728       goto jleave;
 729    }
 730    if (work.l >= 4 && !(work.l & 3)) {
 731       out->s = srealloc(out->s, len);
 732       ret = OKAY;
 733    }
 734    if (ret != OKAY || (ssize_t)(len = _b64_decode(out, &work)) < 0)
 735       goto jerr;
 736 jleave:
 737    NYD_LEAVE;
 738    return ret;
 739
 740 jerr: {
 741    char const *err = _("[Invalid Base64 encoding ignored]\n");
 742    len = strlen(err);
 743    x = out->s = srealloc(out->s, len + 1 +1);
 744    if (rest != NULL && rest->l)
 745       *x++ = '\n';
 746    memcpy(x, err, len);
 747    x += len;
 748    *x = '\0';
 749    out->l = PTR2SIZE(x - out->s);
 750    if (rest != NULL)
 751       rest->l = 0;
 752    ret = STOP;
 753    goto jleave;
 754    }
 755 }
 756
 757 /* s-it-mode */