lib/libalpm/base64.c

   1 /*
   2  *  RFC 1521 base64 encoding/decoding
   3  *
   4  *  Copyright (C) 2006-2010, Brainspark B.V.
   5  *
   6  *  This file is part of PolarSSL (http://www.polarssl.org)
   7  *  Lead Maintainer: Paul Bakker <polarssl_maintainer at polarssl.org>
   8  *
   9  *  All rights reserved.
  10  *
  11  *  This program is free software; you can redistribute it and/or modify
  12  *  it under the terms of the GNU General Public License as published by
  13  *  the Free Software Foundation; either version 2 of the License, or
  14  *  (at your option) any later version.
  15  *
  16  *  This program is distributed in the hope that it will be useful,
  17  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  18  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  19  *  GNU General Public License for more details.
  20  *
  21  *  You should have received a copy of the GNU General Public License
  22  *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
  23  */
  24 /*
  25  *  Pacman Notes:
  26  *
  27  *  Taken from the PolarSSL project at www.polarssl.org under terms of the
  28  *  GPL. This is from version 0.14.2 of the library, and has been modified
  29  *  as following, which may be helpful for future updates:
  30  *  * remove "polarssl/config.h" include
  31  *  * change include from "polarssl/base64.h" to "base64.h"
  32  *  * removal of SELF_TEST code
  33  */
  34
  35 #include <stdint.h>
  36
  37 #include "base64.h"
  38
  39 static const unsigned char base64_enc_map[64] =
  40 {
  41     'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J',
  42     'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T',
  43     'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd',
  44     'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
  45     'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x',
  46     'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7',
  47     '8', '9', '+', '/'
  48 };
  49
  50 static const unsigned char base64_dec_map[128] =
  51 {
  52     127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  53     127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  54     127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  55     127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  56     127, 127, 127,  62, 127, 127, 127,  63,  52,  53,
  57      54,  55,  56,  57,  58,  59,  60,  61, 127, 127,
  58     127,  64, 127, 127, 127,   0,   1,   2,   3,   4,
  59       5,   6,   7,   8,   9,  10,  11,  12,  13,  14,
  60      15,  16,  17,  18,  19,  20,  21,  22,  23,  24,
  61      25, 127, 127, 127, 127, 127, 127,  26,  27,  28,
  62      29,  30,  31,  32,  33,  34,  35,  36,  37,  38,
  63      39,  40,  41,  42,  43,  44,  45,  46,  47,  48,
  64      49,  50,  51, 127, 127, 127, 127, 127
  65 };
  66
  67 #if 0
  68 /*
  69  * Encode a buffer into base64 format
  70  */
  71 int base64_encode( unsigned char *dst, size_t *dlen,
  72                    const unsigned char *src, size_t slen )
  73 {
  74     size_t i, n;
  75     int C1, C2, C3;
  76     unsigned char *p;
  77
  78     if( slen == 0 )
  79         return( 0 );
  80
  81     n = (slen << 3) / 6;
  82
  83     switch( (slen << 3) - (n * 6) )
  84     {
  85         case  2: n += 3; break;
  86         case  4: n += 2; break;
  87         default: break;
  88     }
  89
  90     if( *dlen < n + 1 )
  91     {
  92         *dlen = n + 1;
  93         return( POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL );
  94     }
  95
  96     n = (slen / 3) * 3;
  97
  98     for( i = 0, p = dst; i < n; i += 3 )
  99     {
 100         C1 = *src++;
 101         C2 = *src++;
 102         C3 = *src++;
 103
 104         *p++ = base64_enc_map[(C1 >> 2) & 0x3F];
 105         *p++ = base64_enc_map[(((C1 &  3) << 4) + (C2 >> 4)) & 0x3F];
 106         *p++ = base64_enc_map[(((C2 & 15) << 2) + (C3 >> 6)) & 0x3F];
 107         *p++ = base64_enc_map[C3 & 0x3F];
 108     }
 109
 110     if( i < slen )
 111     {
 112         C1 = *src++;
 113         C2 = ((i + 1) < slen) ? *src++ : 0;
 114
 115         *p++ = base64_enc_map[(C1 >> 2) & 0x3F];
 116         *p++ = base64_enc_map[(((C1 & 3) << 4) + (C2 >> 4)) & 0x3F];
 117
 118         if( (i + 1) < slen )
 119              *p++ = base64_enc_map[((C2 & 15) << 2) & 0x3F];
 120         else *p++ = '=';
 121
 122         *p++ = '=';
 123     }
 124
 125     *dlen = p - dst;
 126     *p = 0;
 127
 128     return( 0 );
 129 }
 130 #endif
 131
 132 /*
 133  * Decode a base64-formatted buffer
 134  */
 135 int base64_decode( unsigned char *dst, size_t *dlen,
 136                    const unsigned char *src, size_t slen )
 137 {
 138     size_t i, n;
 139     uint32_t j, x;
 140     unsigned char *p;
 141
 142     for( i = j = n = 0; i < slen; i++ )
 143     {
 144         if( ( slen - i ) >= 2 &&
 145             src[i] == '\r' && src[i + 1] == '\n' )
 146             continue;
 147
 148         if( src[i] == '\n' )
 149             continue;
 150
 151         if( src[i] == '=' && ++j > 2 )
 152             return( POLARSSL_ERR_BASE64_INVALID_CHARACTER );
 153
 154         if( src[i] > 127 || base64_dec_map[src[i]] == 127 )
 155             return( POLARSSL_ERR_BASE64_INVALID_CHARACTER );
 156
 157         if( base64_dec_map[src[i]] < 64 && j != 0 )
 158             return( POLARSSL_ERR_BASE64_INVALID_CHARACTER );
 159
 160         n++;
 161     }
 162
 163     if( n == 0 )
 164         return( 0 );
 165
 166     n = ((n * 6) + 7) >> 3;
 167
 168     if( *dlen < n )
 169     {
 170         *dlen = n;
 171         return( POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL );
 172     }
 173
 174    for( j = 3, n = x = 0, p = dst; i > 0; i--, src++ )
 175    {
 176         if( *src == '\r' || *src == '\n' )
 177             continue;
 178
 179         j -= ( base64_dec_map[*src] == 64 );
 180         x  = (x << 6) | ( base64_dec_map[*src] & 0x3F );
 181
 182         if( ++n == 4 )
 183         {
 184             n = 0;
 185             if( j > 0 ) *p++ = (unsigned char)( x >> 16 );
 186             if( j > 1 ) *p++ = (unsigned char)( x >>  8 );
 187             if( j > 2 ) *p++ = (unsigned char)( x       );
 188         }
 189     }
 190
 191     *dlen = p - dst;
 192
 193     return( 0 );
 194 }