Coverage Report

Created: 2024-11-25 06:29

/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
0
#define TABLE_INVALID -1
42
0
#define TABLE_SPACE -2
43
12.3k
#define TABLE_END -3
44
45
void
46
base64_decode_init(struct base64_decode_ctx *ctx)
47
18.5k
{
48
18.5k
  static const signed char base64_decode_table[0x100] =
49
18.5k
    {
50
      /* White space is HT, VT, FF, CR, LF and SPC */
51
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -2, -2, -2, -2, -2, -1, -1, 
52
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
53
18.5k
      -2, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63,
54
18.5k
      52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -3, -1, -1,
55
18.5k
      -1,  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14,
56
18.5k
      15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,
57
18.5k
      -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
58
18.5k
      41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1,
59
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
60
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
61
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
62
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
63
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
64
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
65
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
66
18.5k
      -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
67
18.5k
    };
68
69
18.5k
  ctx->word = ctx->bits = ctx->padding = 0;
70
18.5k
  ctx->table = base64_decode_table;
71
18.5k
}
72
73
int
74
base64_decode_single(struct base64_decode_ctx *ctx,
75
         uint8_t *dst,
76
         char src)
77
21.5M
{
78
21.5M
  int data = ctx->table[(uint8_t) src];
79
80
21.5M
  switch(data)
81
21.5M
    {
82
21.5M
    default:
83
21.5M
      assert(data >= 0 && data < 0x40);
84
85
21.5M
      if (ctx->padding)
86
0
  return -1;
87
      
88
21.5M
      ctx->word = ctx->word << 6 | data;
89
21.5M
      ctx->bits += 6;
90
91
21.5M
      if (ctx->bits >= 8)
92
16.1M
  {
93
16.1M
    ctx->bits -= 8;
94
16.1M
    dst[0] = ctx->word >> ctx->bits;
95
16.1M
    return 1;
96
16.1M
  }
97
5.37M
      else return 0;
98
99
0
    case TABLE_INVALID:
100
0
      return -1;
101
102
0
    case TABLE_SPACE:
103
0
      return 0;
104
      
105
12.3k
    case TABLE_END:
106
      /* There can be at most two padding characters. */
107
12.3k
      if (!ctx->bits || ctx->padding > 2)
108
0
  return -1;
109
      
110
12.3k
      if (ctx->word & ( (1<<ctx->bits) - 1))
111
  /* We shouldn't have any leftover bits */
112
0
  return -1;
113
114
12.3k
      ctx->padding++;
115
12.3k
      ctx->bits -= 2;
116
12.3k
      return 0;
117
21.5M
    }
118
21.5M
}
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
18.5k
{
127
18.5k
  size_t done;
128
18.5k
  size_t i;
129
130
21.5M
  for (i = 0, done = 0; i<src_length; i++)
131
21.5M
    switch(base64_decode_single(ctx, dst + done, src[i]))
132
21.5M
      {
133
0
      case -1:
134
0
  return 0;
135
16.1M
      case 1:
136
16.1M
  done++;
137
  /* Fall through */
138
21.5M
      case 0:
139
21.5M
  break;
140
0
      default:
141
0
  abort();
142
21.5M
      }
143
  
144
18.5k
  assert(done <= BASE64_DECODE_LENGTH(src_length));
145
146
18.5k
  *dst_length = done;
147
18.5k
  return 1;
148
18.5k
}
149
150
int
151
base64_decode_final(struct base64_decode_ctx *ctx)
152
18.5k
{
153
18.5k
  return ctx->bits == 0;
154
18.5k
}