| 1 |
|
| /* |
| 2 |
|
| * basE91 encoding/decoding routines |
| 3 |
|
| * |
| 4 |
|
| * Copyright (c) 2000-2006 Joachim Henke |
| 5 |
|
| * All rights reserved. |
| 6 |
|
| * |
| 7 |
|
| * Redistribution and use in source and binary forms, with or without |
| 8 |
|
| * modification, are permitted provided that the following conditions are met: |
| 9 |
|
| * |
| 10 |
|
| * - Redistributions of source code must retain the above copyright notice, |
| 11 |
|
| * this list of conditions and the following disclaimer. |
| 12 |
|
| * - Redistributions in binary form must reproduce the above copyright notice, |
| 13 |
|
| * this list of conditions and the following disclaimer in the documentation |
| 14 |
|
| * and/or other materials provided with the distribution. |
| 15 |
|
| * - Neither the name of Joachim Henke nor the names of his contributors may |
| 16 |
|
| * be used to endorse or promote products derived from this software without |
| 17 |
|
| * specific prior written permission. |
| 18 |
|
| * |
| 19 |
|
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 20 |
|
| * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 21 |
|
| * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 22 |
|
| * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 23 |
|
| * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 24 |
|
| * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 25 |
|
| * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 26 |
|
| * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 27 |
|
| * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 28 |
|
| * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 29 |
|
| * POSSIBILITY OF SUCH DAMAGE. |
| 30 |
|
| */ |
| 31 |
|
| |
| 32 |
|
| #include "base91.h" |
| 33 |
|
| |
| 34 |
|
| const unsigned char enctab[91] = { |
| 35 |
|
| 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', |
| 36 |
|
| 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', |
| 37 |
|
| 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', |
| 38 |
|
| 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', |
| 39 |
|
| '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '!', '#', '$', |
| 40 |
|
| '%', '&', '(', ')', '*', '+', ',', '.', '/', ':', ';', '<', '=', |
| 41 |
|
| '>', '?', '@', '[', ']', '^', '_', '`', '{', '|', '}', '~', '"' |
| 42 |
|
| }; |
| 43 |
|
| const unsigned char dectab[256] = { |
| 44 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, |
| 45 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, |
| 46 |
|
| 91, 62, 90, 63, 64, 65, 66, 91, 67, 68, 69, 70, 71, 91, 72, 73, |
| 47 |
|
| 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 74, 75, 76, 77, 78, 79, |
| 48 |
|
| 80, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, |
| 49 |
|
| 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 81, 91, 82, 83, 84, |
| 50 |
|
| 85, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, |
| 51 |
|
| 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 86, 87, 88, 89, 91, |
| 52 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, |
| 53 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, |
| 54 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, |
| 55 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, |
| 56 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, |
| 57 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, |
| 58 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, |
| 59 |
|
| 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91 |
| 60 |
|
| }; |
| 61 |
|
| |
| 62 |
2 |
| void basE91_init(struct basE91 *b) |
| 63 |
|
| { |
| 64 |
2 |
| b->queue = 0; |
| 65 |
2 |
| b->nbits = 0; |
| 66 |
2 |
| b->val = -1; |
| 67 |
2 |
| } |
| 68 |
|
| |
| 69 |
5 |
| size_t basE91_encode(struct basE91 *b, const void *i, size_t len, void *o) |
| 70 |
|
| { |
| 71 |
5 |
| const unsigned char *ib = i; |
| 72 |
5 |
| unsigned char *ob = o; |
| 73 |
5 |
| size_t n = 0; |
| 74 |
|
| |
| 75 |
40 |
▶ | while (len--) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (len--) { |
35 |
5 |
40 |
|
| 76 |
35 |
| b->queue |= *ib++ << b->nbits; |
| 77 |
35 |
| b->nbits += 8; |
| 78 |
35 |
▶ | if (b->nbits > 13) { /* enough bits in queue */ |
Branch: 1 branch
| Branch | True | False | Total |
| if (b->nbits > 13) { /* enough bits in queue */ |
20 |
15 |
35 |
|
| 79 |
20 |
| unsigned int val = b->queue & 8191; |
| 80 |
|
| |
| 81 |
20 |
▶ | if (val > 88) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (val > 88) { |
18 |
2 |
20 |
|
| 82 |
18 |
| b->queue >>= 13; |
| 83 |
18 |
| b->nbits -= 13; |
| 84 |
|
| } else { /* we can take 14 bits */ |
| 85 |
2 |
| val = b->queue & 16383; |
| 86 |
2 |
| b->queue >>= 14; |
| 87 |
2 |
| b->nbits -= 14; |
| 88 |
|
| } |
| 89 |
20 |
| ob[n++] = enctab[val % 91]; |
| 90 |
20 |
| ob[n++] = enctab[val / 91]; |
| 91 |
|
| } |
| 92 |
|
| } |
| 93 |
|
| |
| 94 |
5 |
| return n; |
| 95 |
|
| } |
| 96 |
|
| |
| 97 |
|
| /* process remaining bits from bit queue; write up to 2 bytes */ |
| 98 |
|
| |
| 99 |
4 |
| size_t basE91_encode_end(struct basE91 *b, void *o) |
| 100 |
|
| { |
| 101 |
4 |
| unsigned char *ob = o; |
| 102 |
4 |
| size_t n = 0; |
| 103 |
|
| |
| 104 |
4 |
▶ | if (b->nbits) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (b->nbits) { |
3 |
1 |
4 |
|
| 105 |
3 |
| ob[n++] = enctab[b->queue % 91]; |
| 106 |
3 |
▶ | if (b->nbits > 7 || b->queue > 90) |
Branch: 2 branches
| Branch | True | False | Total |
| if (b->nbits > 7 || b->queue > 90) |
3 |
0 |
3 |
| if (b->nbits > 7 || b->queue > 90) |
0 |
3 |
3 |
|
| 107 |
0 |
| ob[n++] = enctab[b->queue / 91]; |
| 108 |
|
| } |
| 109 |
4 |
| b->queue = 0; |
| 110 |
4 |
| b->nbits = 0; |
| 111 |
4 |
| b->val = -1; |
| 112 |
|
| |
| 113 |
4 |
| return n; |
| 114 |
|
| } |
| 115 |
|
| |
| 116 |
5 |
| size_t basE91_decode(struct basE91 *b, const void *i, size_t len, void *o) |
| 117 |
|
| { |
| 118 |
5 |
| const unsigned char *ib = i; |
| 119 |
5 |
| unsigned char *ob = o; |
| 120 |
5 |
| size_t n = 0; |
| 121 |
|
| unsigned int d; |
| 122 |
|
| |
| 123 |
70 |
▶ | while (len--) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (len--) { |
65 |
5 |
70 |
|
| 124 |
65 |
| d = dectab[*ib++]; |
| 125 |
65 |
▶ | if (d == 91) |
Branch: 1 branch
| Branch | True | False | Total |
| if (d == 91) |
5 |
60 |
65 |
|
| 126 |
5 |
| continue; /* ignore non-alphabet chars */ |
| 127 |
60 |
▶ | if (b->val == -1) |
Branch: 1 branch
| Branch | True | False | Total |
| if (b->val == -1) |
32 |
28 |
60 |
|
| 128 |
32 |
| b->val = d; /* start next value */ |
| 129 |
|
| else { |
| 130 |
28 |
| b->val += d * 91; |
| 131 |
28 |
| b->queue |= b->val << b->nbits; |
| 132 |
28 |
▶ | b->nbits += (b->val & 8191) > 88 ? 13 : 14; |
Branch: 1 branch
| Branch | True | False | Total |
| b->nbits += (b->val & 8191) > 88 ? 13 : 14; |
25 |
3 |
28 |
|
| 133 |
|
| do { |
| 134 |
45 |
| ob[n++] = b->queue; |
| 135 |
45 |
| b->queue >>= 8; |
| 136 |
45 |
| b->nbits -= 8; |
| 137 |
45 |
▶ | } while (b->nbits > 7); |
Branch: 1 branch
| Branch | True | False | Total |
| } while (b->nbits > 7); |
17 |
28 |
45 |
|
| 138 |
28 |
| b->val = -1; /* mark value complete */ |
| 139 |
|
| } |
| 140 |
|
| } |
| 141 |
|
| |
| 142 |
5 |
| return n; |
| 143 |
|
| } |
| 144 |
|
| |
| 145 |
|
| /* process remaining bits; write at most 1 byte */ |
| 146 |
|
| |
| 147 |
5 |
| size_t basE91_decode_end(struct basE91 *b, void *o) |
| 148 |
|
| { |
| 149 |
5 |
| unsigned char *ob = o; |
| 150 |
5 |
| size_t n = 0; |
| 151 |
|
| |
| 152 |
5 |
▶ | if (b->val != -1) |
Branch: 1 branch
| Branch | True | False | Total |
| if (b->val != -1) |
4 |
1 |
5 |
|
| 153 |
4 |
| ob[n++] = b->queue | b->val << b->nbits; |
| 154 |
5 |
| b->queue = 0; |
| 155 |
5 |
| b->nbits = 0; |
| 156 |
5 |
| b->val = -1; |
| 157 |
|
| |
| 158 |
5 |
| return n; |
| 159 |
|
| } |