-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathb58.c
More file actions
177 lines (141 loc) · 4.01 KB
/
Copy pathb58.c
File metadata and controls
177 lines (141 loc) · 4.01 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
#include <stdint.h>
#include <stddef.h>
#include "b58.h"
static const char e58map[] = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
void e58( const uint8_t * bin, size_t binlen, char ** b58, size_t * b58len )
{
size_t i, z, s, h, l, j;
char * p;
for( i = 0; i < binlen; i++ )
if( bin[i] != 0 )
break;
z = i;
p = *b58;
s = *b58len;
h = s - 1;
l = h;
for( ; i < binlen; i++ )
{
uint32_t c = bin[i];
for( j = h;; j-- )
{
if( j == l )
if( c )
l--;
else
break;
else
c += (uint32_t)p[j] * 256;
p[j] = c % 58;
c /= 58;
}
}
for( i = 0; i < z; i++ )
p[( l + 1 - z ) + i] = '1';
for( i = l + 1; i <= h; i++ )
p[i] = e58map[((uint8_t *)p)[i]];
*b58 = p + ( l + 1 - z );
*b58len = s - ( l + 1 - z );
}
static const uint8_t d58map[] = {
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
0xFF, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
0xFF, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x10, 0xFF, 0x11, 0x12, 0x13, 0x14, 0x15, 0xFF,
0x16, 0x17, 0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
0xFF, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2A, 0x2B, 0xFF, 0x2C, 0x2D, 0x2E,
0x2F, 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
};
#if defined( WORDS_BIGENDIAN ) || !defined( NO_BSWAP32 )
#if !defined( WORDS_BIGENDIAN ) && !defined( BSWAP32 )
#ifdef _WIN32
#include <intrin.h>
#define BSWAP32( v ) _byteswap_ulong( v )
#else
#define BSWAP32( v ) __builtin_bswap32( v )
#endif
#endif
void d58( const char * b58, size_t b58len, uint8_t ** bin, size_t * binlen )
{
size_t i, z, s, h, l, j;
uint8_t * p;
for( i = 0; i < b58len; i++ )
if( b58[i] != '1' )
break;
z = i;
p = *bin;
s = *binlen;
h = s / 4 - 1;
l = h;
for( ; i < b58len; i++ )
{
uint64_t c = d58map[((uint8_t *)b58)[i]];
for( j = h;; j-- )
{
if( j == l )
if( c )
l--;
else
break;
else
c += (uint64_t)((uint32_t *)p)[j] * 58;
((uint32_t *)p)[j] = (uint32_t)c;
c >>= 32;
}
}
#ifndef WORDS_BIGENDIAN
for( i = ( l + 1 ); i <= h; i++ )
((uint32_t *)p)[i] = BSWAP32( ((uint32_t *)p)[i] );
#endif
for( i = ( l + 1 ) * 4; i <= h * 4 + 3; i++ )
if( p[i] )
break;
for( j = ( i - z ); j < ( l + 1 ) * 4; j++ )
p[j] = 0;
*bin = p + ( i - z );
*binlen = s - ( i - z );
}
#else
void d58( const char * b58, size_t b58len, uint8_t ** bin, size_t * binlen )
{
size_t i, z, s, h, l, j;
uint8_t * p;
for( i = 0; i < b58len; i++ )
if( b58[i] != '1' )
break;
z = i;
p = *bin;
s = *binlen;
h = s - 1;
l = h;
for( ; i < b58len; i++ )
{
uint32_t c = d58map[((uint8_t *)b58)[i]];
for( j = h;; j-- )
{
if( j == l )
if( c )
l--;
else
break;
else
c += (uint32_t)p[j] * 58;
p[j] = c % 256;
c /= 256;
}
}
for( i = 0; i < z; i++ )
p[( l + 1 - z ) + i] = 0;
*bin = p + ( l + 1 - z );
*binlen = s - ( l + 1 - z );
}
#endif
char c58( const char * b58, size_t b58len )
{
size_t i;
for( i = 0; i < b58len; i++ )
if( b58[i] < '1' || d58map[((uint8_t *)b58)[i]] == d58map[0] )
return 0;
return 1;
}