Coverage Report

Created: 2024-11-25 06:26

/src/nettle/base64-decode.c
Line
Count
Source (jump to first uncovered line)
1
/* base64-encode.c
2
3
   Copyright (C) 2002 Niels Möller
4
5
   This file is part of GNU Nettle.
6
7
   GNU Nettle is free software: you can redistribute it and/or
8
   modify it under the terms of either:
9
10
     * the GNU Lesser General Public License as published by the Free
11
       Software Foundation; either version 3 of the License, or (at your
12
       option) any later version.
13
14
   or
15
16
     * the GNU General Public License as published by the Free
17
       Software Foundation; either version 2 of the License, or (at your
18
       option) any later version.
19
20
   or both in parallel, as here.
21
22
   GNU Nettle is distributed in the hope that it will be useful,
23
   but WITHOUT ANY WARRANTY; without even the implied warranty of
24
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
25
   General Public License for more details.
26
27
   You should have received copies of the GNU General Public License and
28
   the GNU Lesser General Public License along with this program.  If
29
   not, see http://www.gnu.org/licenses/.
30
*/
31
32
#if HAVE_CONFIG_H
33
# include "config.h"
34
#endif
35
36
#include <assert.h>
37
#include <stdlib.h>
38
39
#include "base64.h"
40
41
96
#define TABLE_INVALID -1
42
443
#define TABLE_SPACE -2
43
171
#define TABLE_END -3
44
45
void
46
base64_decode_init(struct base64_decode_ctx *ctx)
47
327
{
48
327
  static const signed char base64_decode_table[0x100] =
49
327
    {
50
      /* White space is HT, VT, FF, CR, LF and SPC */
51
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -2, -2, -2, -2, -2, -1, -1, 
52
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
53
327
      -2, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63,
54
327
      52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -3, -1, -1,
55
327
      -1,  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14,
56
327
      15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,
57
327
      -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
58
327
      41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1,
59
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
60
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
61
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
62
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
63
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
64
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
65
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
66
327
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
67
327
    };
68
69
327
  ctx->word = ctx->bits = ctx->padding = 0;
70
327
  ctx->table = base64_decode_table;
71
327
}
72
73
int
74
base64_decode_single(struct base64_decode_ctx *ctx,
75
         uint8_t *dst,
76
         char src)
77
9.94M
{
78
9.94M
  int data = ctx->table[(uint8_t) src];
79
80
9.94M
  switch(data)
81
9.94M
    {
82
9.94M
    default:
83
9.94M
      assert(data >= 0 && data < 0x40);
84
85
9.94M
      if (ctx->padding)
86
7
  return -1;
87
      
88
9.94M
      ctx->word = ctx->word << 6 | data;
89
9.94M
      ctx->bits += 6;
90
91
9.94M
      if (ctx->bits >= 8)
92
7.46M
  {
93
7.46M
    ctx->bits -= 8;
94
7.46M
    dst[0] = ctx->word >> ctx->bits;
95
7.46M
    return 1;
96
7.46M
  }
97
2.48M
      else return 0;
98
99
96
    case TABLE_INVALID:
100
96
      return -1;
101
102
443
    case TABLE_SPACE:
103
443
      return 0;
104
      
105
171
    case TABLE_END:
106
      /* There can be at most two padding characters. */
107
171
      if (!ctx->bits || ctx->padding > 2)
108
10
  return -1;
109
      
110
161
      if (ctx->word & ( (1<<ctx->bits) - 1))
111
  /* We shouldn't have any leftover bits */
112
7
  return -1;
113
114
154
      ctx->padding++;
115
154
      ctx->bits -= 2;
116
154
      return 0;
117
9.94M
    }
118
9.94M
}
119
120
int
121
base64_decode_update(struct base64_decode_ctx *ctx,
122
         size_t *dst_length,
123
         uint8_t *dst,
124
         size_t src_length,
125
         const char *src)
126
327
{
127
327
  size_t done;
128
327
  size_t i;
129
130
9.94M
  for (i = 0, done = 0; i<src_length; i++)
131
9.94M
    switch(base64_decode_single(ctx, dst + done, src[i]))
132
9.94M
      {
133
120
      case -1:
134
120
  return 0;
135
7.46M
      case 1:
136
7.46M
  done++;
137
  /* Fall through */
138
9.94M
      case 0:
139
9.94M
  break;
140
0
      default:
141
0
  abort();
142
9.94M
      }
143
  
144
207
  assert(done <= BASE64_DECODE_LENGTH(src_length));
145
146
207
  *dst_length = done;
147
207
  return 1;
148
207
}
149
150
int
151
base64_decode_final(struct base64_decode_ctx *ctx)
152
174
{
153
174
  return ctx->bits == 0;
154
174
}