Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(148)

Side by Side Diff: third_party/WebKit/Source/wtf/text/Base64.cpp

Issue 2764283002: Move files in wtf/ to platform/wtf/ (Part 10). (Closed)
Patch Set: Rebase. Created 3 years, 9 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
(Empty)
1 /*
2 Copyright (C) 2000-2001 Dawit Alemayehu <adawit@kde.org>
3 Copyright (C) 2006 Alexey Proskuryakov <ap@webkit.org>
4 Copyright (C) 2007, 2008 Apple Inc. All rights reserved.
5 Copyright (C) 2010 Patrick Gansterer <paroga@paroga.com>
6
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU Lesser General Public License (LGPL)
9 version 2 as published by the Free Software Foundation.
10
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU Library General Public
17 License along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
19 USA.
20
21 This code is based on the java implementation in HTTPClient
22 package by Ronald Tschalaer Copyright (C) 1996-1999.
23 */
24
25 #include "wtf/text/Base64.h"
26
27 #include "wtf/StringExtras.h"
28 #include <limits.h>
29
30 namespace WTF {
31
32 static const char base64EncMap[64] = {
33 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48, 0x49, 0x4A, 0x4B,
34 0x4C, 0x4D, 0x4E, 0x4F, 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56,
35 0x57, 0x58, 0x59, 0x5A, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
36 0x68, 0x69, 0x6A, 0x6B, 0x6C, 0x6D, 0x6E, 0x6F, 0x70, 0x71, 0x72,
37 0x73, 0x74, 0x75, 0x76, 0x77, 0x78, 0x79, 0x7A, 0x30, 0x31, 0x32,
38 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x2B, 0x2F};
39
40 static const char base64DecMap[128] = {
41 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
42 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
43 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
44 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x3E, 0x00, 0x00, 0x00, 0x3F,
45 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, 0x3B, 0x3C, 0x3D, 0x00, 0x00,
46 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06,
47 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x10, 0x11, 0x12,
48 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0x00, 0x00, 0x00, 0x00, 0x00,
49 0x00, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20, 0x21, 0x22, 0x23, 0x24,
50 0x25, 0x26, 0x27, 0x28, 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F, 0x30,
51 0x31, 0x32, 0x33, 0x00, 0x00, 0x00, 0x00, 0x00};
52
53 String base64Encode(const char* data,
54 unsigned length,
55 Base64EncodePolicy policy) {
56 Vector<char> result;
57 base64Encode(data, length, result, policy);
58 return String(result.data(), result.size());
59 }
60
61 void base64Encode(const char* data,
62 unsigned len,
63 Vector<char>& out,
64 Base64EncodePolicy policy) {
65 out.clear();
66 if (!len)
67 return;
68
69 // If the input string is pathologically large, just return nothing.
70 // Note: Keep this in sync with the "outLength" computation below.
71 // Rather than being perfectly precise, this is a bit conservative.
72 const unsigned maxInputBufferSize = UINT_MAX / 77 * 76 / 4 * 3 - 2;
73 if (len > maxInputBufferSize)
74 return;
75
76 unsigned sidx = 0;
77 unsigned didx = 0;
78
79 unsigned outLength = ((len + 2) / 3) * 4;
80
81 // Deal with the 76 character per line limit specified in RFC 2045.
82 bool insertLFs = (policy == Base64InsertLFs && outLength > 76);
83 if (insertLFs)
84 outLength += ((outLength - 1) / 76);
85
86 int count = 0;
87 out.grow(outLength);
88
89 // 3-byte to 4-byte conversion + 0-63 to ascii printable conversion
90 if (len > 1) {
91 while (sidx < len - 2) {
92 if (insertLFs) {
93 if (count && !(count % 76))
94 out[didx++] = '\n';
95 count += 4;
96 }
97 out[didx++] = base64EncMap[(data[sidx] >> 2) & 077];
98 out[didx++] = base64EncMap[((data[sidx + 1] >> 4) & 017) |
99 ((data[sidx] << 4) & 077)];
100 out[didx++] = base64EncMap[((data[sidx + 2] >> 6) & 003) |
101 ((data[sidx + 1] << 2) & 077)];
102 out[didx++] = base64EncMap[data[sidx + 2] & 077];
103 sidx += 3;
104 }
105 }
106
107 if (sidx < len) {
108 if (insertLFs && (count > 0) && !(count % 76))
109 out[didx++] = '\n';
110
111 out[didx++] = base64EncMap[(data[sidx] >> 2) & 077];
112 if (sidx < len - 1) {
113 out[didx++] = base64EncMap[((data[sidx + 1] >> 4) & 017) |
114 ((data[sidx] << 4) & 077)];
115 out[didx++] = base64EncMap[(data[sidx + 1] << 2) & 077];
116 } else {
117 out[didx++] = base64EncMap[(data[sidx] << 4) & 077];
118 }
119 }
120
121 // Add padding
122 while (didx < out.size()) {
123 out[didx] = '=';
124 ++didx;
125 }
126 }
127
128 bool base64Decode(const Vector<char>& in,
129 Vector<char>& out,
130 CharacterMatchFunctionPtr shouldIgnoreCharacter,
131 Base64DecodePolicy policy) {
132 out.clear();
133
134 // If the input string is pathologically large, just return nothing.
135 if (in.size() > UINT_MAX)
136 return false;
137
138 return base64Decode(in.data(), in.size(), out, shouldIgnoreCharacter, policy);
139 }
140
141 template <typename T>
142 static inline bool base64DecodeInternal(
143 const T* data,
144 unsigned length,
145 Vector<char>& out,
146 CharacterMatchFunctionPtr shouldIgnoreCharacter,
147 Base64DecodePolicy policy) {
148 out.clear();
149 if (!length)
150 return true;
151
152 out.grow(length);
153
154 unsigned equalsSignCount = 0;
155 unsigned outLength = 0;
156 bool hadError = false;
157 for (unsigned idx = 0; idx < length; ++idx) {
158 UChar ch = data[idx];
159 if (ch == '=') {
160 ++equalsSignCount;
161 // There should never be more than 2 padding characters.
162 if (policy == Base64ValidatePadding && equalsSignCount > 2) {
163 hadError = true;
164 break;
165 }
166 } else if (('0' <= ch && ch <= '9') || ('A' <= ch && ch <= 'Z') ||
167 ('a' <= ch && ch <= 'z') || ch == '+' || ch == '/') {
168 if (equalsSignCount) {
169 hadError = true;
170 break;
171 }
172 out[outLength++] = base64DecMap[ch];
173 } else if (!shouldIgnoreCharacter || !shouldIgnoreCharacter(ch)) {
174 hadError = true;
175 break;
176 }
177 }
178
179 if (outLength < out.size())
180 out.shrink(outLength);
181
182 if (hadError)
183 return false;
184
185 if (!outLength)
186 return !equalsSignCount;
187
188 // There should be no padding if length is a multiple of 4.
189 // We use (outLength + equalsSignCount) instead of length because we don't
190 // want to account for ignored characters.
191 if (policy == Base64ValidatePadding && equalsSignCount &&
192 (outLength + equalsSignCount) % 4)
193 return false;
194
195 // Valid data is (n * 4 + [0,2,3]) characters long.
196 if ((outLength % 4) == 1)
197 return false;
198
199 // 4-byte to 3-byte conversion
200 outLength -= (outLength + 3) / 4;
201 if (!outLength)
202 return false;
203
204 unsigned sidx = 0;
205 unsigned didx = 0;
206 if (outLength > 1) {
207 while (didx < outLength - 2) {
208 out[didx] = (((out[sidx] << 2) & 255) | ((out[sidx + 1] >> 4) & 003));
209 out[didx + 1] =
210 (((out[sidx + 1] << 4) & 255) | ((out[sidx + 2] >> 2) & 017));
211 out[didx + 2] = (((out[sidx + 2] << 6) & 255) | (out[sidx + 3] & 077));
212 sidx += 4;
213 didx += 3;
214 }
215 }
216
217 if (didx < outLength)
218 out[didx] = (((out[sidx] << 2) & 255) | ((out[sidx + 1] >> 4) & 003));
219
220 if (++didx < outLength)
221 out[didx] = (((out[sidx + 1] << 4) & 255) | ((out[sidx + 2] >> 2) & 017));
222
223 if (outLength < out.size())
224 out.shrink(outLength);
225
226 return true;
227 }
228
229 bool base64Decode(const char* data,
230 unsigned length,
231 Vector<char>& out,
232 CharacterMatchFunctionPtr shouldIgnoreCharacter,
233 Base64DecodePolicy policy) {
234 return base64DecodeInternal<LChar>(reinterpret_cast<const LChar*>(data),
235 length, out, shouldIgnoreCharacter,
236 policy);
237 }
238
239 bool base64Decode(const UChar* data,
240 unsigned length,
241 Vector<char>& out,
242 CharacterMatchFunctionPtr shouldIgnoreCharacter,
243 Base64DecodePolicy policy) {
244 return base64DecodeInternal<UChar>(data, length, out, shouldIgnoreCharacter,
245 policy);
246 }
247
248 bool base64Decode(const String& in,
249 Vector<char>& out,
250 CharacterMatchFunctionPtr shouldIgnoreCharacter,
251 Base64DecodePolicy policy) {
252 if (in.isEmpty())
253 return base64DecodeInternal<LChar>(0, 0, out, shouldIgnoreCharacter,
254 policy);
255 if (in.is8Bit())
256 return base64DecodeInternal<LChar>(in.characters8(), in.length(), out,
257 shouldIgnoreCharacter, policy);
258 return base64DecodeInternal<UChar>(in.characters16(), in.length(), out,
259 shouldIgnoreCharacter, policy);
260 }
261
262 String base64URLEncode(const char* data,
263 unsigned length,
264 Base64EncodePolicy policy) {
265 return base64Encode(data, length, policy).replace('+', '-').replace('/', '_');
266 }
267
268 String normalizeToBase64(const String& encoding) {
269 return String(encoding).replace('-', '+').replace('_', '/');
270 }
271
272 } // namespace WTF
OLDNEW
« no previous file with comments | « third_party/WebKit/Source/wtf/text/Base64.h ('k') | third_party/WebKit/Source/wtf/text/Collator.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698