FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
cryptopp/basecode.cpp at master · doublethinkco/cryptopp · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
doublethinkco
/
cryptopp
Public
forked from
weidai11/cryptopp
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
cryptopp
/
basecode.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
247 lines (210 loc) · 5.93 KB
Breadcrumbs
cryptopp
/
basecode.cpp
Copy path
File metadata and controls
247 lines (210 loc) · 5.93 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
//
basecode.cpp - written and placed in the public domain by Wei Dai
#
include
"
pch.h
"
#
include
"
config.h
"
#
if
CRYPTOPP_MSC_VERSION
#
pragma
warning(disable: 4100)
#
endif
#
if
CRYPTOPP_GCC_DIAGNOSTIC_AVAILABLE
#
pragma
GCC diagnostic ignored "-Wunused-value"
#
endif
#
ifndef
CRYPTOPP_IMPORTS
#
include
"
basecode.h
"
#
include
"
fltrimpl.h
"
#
include
<
ctype.h
>
NAMESPACE_BEGIN
(CryptoPP)
void
BaseN_Encoder::IsolatedInitialize
(
const
NameValuePairs ¶meters)
{
parameters.
GetRequiredParameter
(
"
BaseN_Encoder
"
,
Name::EncodingLookupArray
(), m_alphabet);
parameters.
GetRequiredIntParameter
(
"
BaseN_Encoder
"
,
Name::Log2Base
(), m_bitsPerChar);
if
(m_bitsPerChar <=
0
|| m_bitsPerChar >=
8
)
throw
InvalidArgument
(
"
BaseN_Encoder: Log2Base must be between 1 and 7 inclusive
"
);
byte padding;
bool
pad;
if
(parameters.
GetValue
(
Name::PaddingByte
(), padding))
pad = parameters.
GetValueWithDefault
(
Name::Pad
(),
true
);
else
pad =
false
;
m_padding = pad ? padding : -
1
;
m_bytePos = m_bitPos =
0
;
int
i =
8
;
while
(i%m_bitsPerChar !=
0
)
i +=
8
;
m_outputBlockSize = i/m_bitsPerChar;
m_outBuf.
New
(m_outputBlockSize);
}
size_t
BaseN_Encoder::Put2
(
const
byte *begin,
size_t
length,
int
messageEnd,
bool
blocking)
{
FILTER_BEGIN
;
while
(m_inputPosition < length)
{
if
(m_bytePos ==
0
)
memset
(m_outBuf,
0
, m_outputBlockSize);
{
unsigned
int
b = begin[m_inputPosition++], bitsLeftInSource =
8
;
while
(
true
)
{
assert
(m_bitsPerChar-m_bitPos >=
0
);
unsigned
int
bitsLeftInTarget = (
unsigned
int
)(m_bitsPerChar-m_bitPos);
m_outBuf[m_bytePos] |= b >> (
8
-bitsLeftInTarget);
if
(bitsLeftInSource >= bitsLeftInTarget)
{
m_bitPos =
0
;
++m_bytePos;
bitsLeftInSource -= bitsLeftInTarget;
if
(bitsLeftInSource ==
0
)
break
;
b <<= bitsLeftInTarget;
b &=
0xff
;
}
else
{
m_bitPos += bitsLeftInSource;
break
;
}
}
}
assert
(m_bytePos <= m_outputBlockSize);
if
(m_bytePos == m_outputBlockSize)
{
int
i;
for
(i=
0
; i<m_bytePos; i++)
{
assert
(m_outBuf[i] < (
1
<< m_bitsPerChar));
m_outBuf[i] = m_alphabet[m_outBuf[i]];
}
FILTER_OUTPUT
(
1
, m_outBuf, m_outputBlockSize,
0
);
m_bytePos = m_bitPos =
0
;
}
}
if
(messageEnd)
{
if
(m_bitPos >
0
)
++m_bytePos;
int
i;
for
(i=
0
; i<m_bytePos; i++)
m_outBuf[i] = m_alphabet[m_outBuf[i]];
if
(m_padding != -
1
&& m_bytePos >
0
)
{
memset
(m_outBuf+m_bytePos, m_padding, m_outputBlockSize-m_bytePos);
m_bytePos = m_outputBlockSize;
}
FILTER_OUTPUT
(
2
, m_outBuf, m_bytePos, messageEnd);
m_bytePos = m_bitPos =
0
;
}
FILTER_END_NO_MESSAGE_END
;
}
void
BaseN_Decoder::IsolatedInitialize
(
const
NameValuePairs ¶meters)
{
parameters.
GetRequiredParameter
(
"
BaseN_Decoder
"
,
Name::DecodingLookupArray
(), m_lookup);
parameters.
GetRequiredIntParameter
(
"
BaseN_Decoder
"
,
Name::Log2Base
(), m_bitsPerChar);
if
(m_bitsPerChar <=
0
|| m_bitsPerChar >=
8
)
throw
InvalidArgument
(
"
BaseN_Decoder: Log2Base must be between 1 and 7 inclusive
"
);
m_bytePos = m_bitPos =
0
;
int
i = m_bitsPerChar;
while
(i%
8
!=
0
)
i += m_bitsPerChar;
m_outputBlockSize = i/
8
;
m_outBuf.
New
(m_outputBlockSize);
}
size_t
BaseN_Decoder::Put2
(
const
byte *begin,
size_t
length,
int
messageEnd,
bool
blocking)
{
FILTER_BEGIN
;
while
(m_inputPosition < length)
{
unsigned
int
value;
value = m_lookup[begin[m_inputPosition++]];
if
(value >=
256
)
continue
;
if
(m_bytePos ==
0
&& m_bitPos ==
0
)
memset
(m_outBuf,
0
, m_outputBlockSize);
{
int
newBitPos = m_bitPos + m_bitsPerChar;
if
(newBitPos <=
8
)
m_outBuf[m_bytePos] |= value << (
8
-newBitPos);
else
{
m_outBuf[m_bytePos] |= value >> (newBitPos-
8
);
m_outBuf[m_bytePos+
1
] |= value << (
16
-newBitPos);
}
m_bitPos = newBitPos;
while
(m_bitPos >=
8
)
{
m_bitPos -=
8
;
++m_bytePos;
}
}
if
(m_bytePos == m_outputBlockSize)
{
FILTER_OUTPUT
(
1
, m_outBuf, m_outputBlockSize,
0
);
m_bytePos = m_bitPos =
0
;
}
}
if
(messageEnd)
{
FILTER_OUTPUT
(
2
, m_outBuf, m_bytePos, messageEnd);
m_bytePos = m_bitPos =
0
;
}
FILTER_END_NO_MESSAGE_END
;
}
void
BaseN_Decoder::InitializeDecodingLookupArray
(
int
*lookup,
const
byte *alphabet,
unsigned
int
base,
bool
caseInsensitive)
{
std::fill
(lookup, lookup+
256
, -
1
);
for
(
unsigned
int
i=
0
; i<base; i++)
{
if
(caseInsensitive &&
isalpha
(alphabet[i]))
{
assert
(lookup[
toupper
(alphabet[i])] == -
1
);
lookup[
toupper
(alphabet[i])] = i;
assert
(lookup[
tolower
(alphabet[i])] == -
1
);
lookup[
tolower
(alphabet[i])] = i;
}
else
{
assert
(lookup[alphabet[i]] == -
1
);
lookup[alphabet[i]] = i;
}
}
}
void
Grouper::IsolatedInitialize
(
const
NameValuePairs ¶meters)
{
m_groupSize = parameters.
GetIntValueWithDefault
(
Name::GroupSize
(),
0
);
ConstByteArrayParameter separator, terminator;
if
(m_groupSize)
parameters.
GetRequiredParameter
(
"
Grouper
"
,
Name::Separator
(), separator);
else
parameters.
GetValue
(
Name::Separator
(), separator);
parameters.
GetValue
(
Name::Terminator
(), terminator);
m_separator.
Assign
(separator.
begin
(), separator.
size
());
m_terminator.
Assign
(terminator.
begin
(), terminator.
size
());
m_counter =
0
;
}
size_t
Grouper::Put2
(
const
byte *begin,
size_t
length,
int
messageEnd,
bool
blocking)
{
FILTER_BEGIN
;
if
(m_groupSize)
{
while
(m_inputPosition < length)
{
if
(m_counter == m_groupSize)
{
FILTER_OUTPUT
(
1
, m_separator, m_separator.
size
(),
0
);
m_counter =
0
;
}
size_t
len;
FILTER_OUTPUT2
(
2
, len =
STDMIN
(length-m_inputPosition, m_groupSize-m_counter),
begin+m_inputPosition, len,
0
);
m_inputPosition += len;
m_counter += len;
}
}
else
FILTER_OUTPUT
(
3
, begin, length,
0
);
if
(messageEnd)
{
FILTER_OUTPUT
(
4
, m_terminator, m_terminator.
size
(), messageEnd);
m_counter =
0
;
}
FILTER_END_NO_MESSAGE_END
}
NAMESPACE_END
#
endif
Back
|
FazBrowse Home
|
New Git URL