| | | 1 | | // Licensed to the .NET Foundation under one or more agreements. |
| | | 2 | | // The .NET Foundation licenses this file to you under the MIT license. |
| | | 3 | | |
| | | 4 | | using System.Diagnostics; |
| | | 5 | | using System.Runtime; |
| | | 6 | | using System.Runtime.CompilerServices; |
| | | 7 | | using System.Runtime.InteropServices; |
| | | 8 | | using System.Text; |
| | | 9 | | using System.Diagnostics.CodeAnalysis; |
| | | 10 | | |
| | | 11 | | #if NET |
| | | 12 | | using System.Runtime.Intrinsics.Arm; |
| | | 13 | | using System.Runtime.Intrinsics.Wasm; |
| | | 14 | | using System.Runtime.Intrinsics.X86; |
| | | 15 | | using System.Runtime.Intrinsics; |
| | | 16 | | #endif |
| | | 17 | | |
| | | 18 | | namespace System.Buffers.Text |
| | | 19 | | { |
| | | 20 | | // AVX2 version based on https://github.com/aklomp/base64/tree/e516d769a2a432c08404f1981e73b431566057be/lib/arch/avx |
| | | 21 | | // Vector128 version based on https://github.com/aklomp/base64/tree/e516d769a2a432c08404f1981e73b431566057be/lib/arc |
| | | 22 | | internal static partial class Base64Helper |
| | | 23 | | { |
| | | 24 | | [SuppressReadyToRunCanonicalRooting] |
| | | 25 | | internal static unsafe OperationStatus DecodeFrom<TBase64Decoder, T>(TBase64Decoder decoder, ReadOnlySpan<T> sou |
| | | 26 | | out int bytesConsumed, out int bytesWritten, bool isFinalBlock, bool ignoreWhiteSpace) |
| | | 27 | | where TBase64Decoder : IBase64Decoder<T> |
| | | 28 | | where T : unmanaged |
| | | 29 | | { |
| | | 30 | | if (source.IsEmpty) |
| | | 31 | | { |
| | 0 | 32 | | bytesConsumed = 0; |
| | 0 | 33 | | bytesWritten = 0; |
| | 0 | 34 | | return OperationStatus.Done; |
| | | 35 | | } |
| | | 36 | | |
| | 0 | 37 | | fixed (T* srcBytes = &MemoryMarshal.GetReference(source)) |
| | 0 | 38 | | fixed (byte* destBytes = &MemoryMarshal.GetReference(bytes)) |
| | | 39 | | { |
| | 0 | 40 | | int srcLength = decoder.SrcLength(isFinalBlock, source.Length); |
| | 0 | 41 | | int destLength = bytes.Length; |
| | 0 | 42 | | int maxSrcLength = srcLength; |
| | 0 | 43 | | int decodedLength = decoder.GetMaxDecodedLength(srcLength); |
| | | 44 | | |
| | | 45 | | // max. 2 padding chars |
| | 0 | 46 | | if (destLength < decodedLength - 2) |
| | | 47 | | { |
| | | 48 | | // For overflow see comment below |
| | 0 | 49 | | maxSrcLength = destLength / 3 * 4; |
| | | 50 | | } |
| | | 51 | | |
| | 0 | 52 | | T* src = srcBytes; |
| | 0 | 53 | | byte* dest = destBytes; |
| | 0 | 54 | | T* srcEnd = srcBytes + (uint)srcLength; |
| | 0 | 55 | | T* srcMax = srcBytes + (uint)maxSrcLength; |
| | | 56 | | |
| | | 57 | | #if NET |
| | 0 | 58 | | if (maxSrcLength >= 24) |
| | | 59 | | { |
| | 0 | 60 | | T* end = srcMax - 88; |
| | 0 | 61 | | if (Vector512.IsHardwareAccelerated && Avx512Vbmi.IsSupported && (end >= src)) |
| | | 62 | | { |
| | 0 | 63 | | Avx512Decode(decoder, ref src, ref dest, end, maxSrcLength, destLength, srcBytes, destBytes); |
| | | 64 | | |
| | 0 | 65 | | if (src == srcEnd) |
| | | 66 | | { |
| | | 67 | | goto DoneExit; |
| | | 68 | | } |
| | | 69 | | } |
| | | 70 | | |
| | 0 | 71 | | end = srcMax - 45; |
| | 0 | 72 | | if (Avx2.IsSupported && (end >= src)) |
| | | 73 | | { |
| | 0 | 74 | | Avx2Decode(decoder, ref src, ref dest, end, maxSrcLength, destLength, srcBytes, destBytes); |
| | | 75 | | |
| | 0 | 76 | | if (src == srcEnd) |
| | | 77 | | { |
| | | 78 | | goto DoneExit; |
| | | 79 | | } |
| | | 80 | | } |
| | | 81 | | |
| | 0 | 82 | | end = srcMax - 66; |
| | | 83 | | if (AdvSimd.Arm64.IsSupported && (end >= src)) |
| | | 84 | | { |
| | | 85 | | AdvSimdDecode(decoder, ref src, ref dest, end, maxSrcLength, destLength, srcBytes, destBytes); |
| | | 86 | | |
| | | 87 | | if (src == srcEnd) |
| | | 88 | | { |
| | | 89 | | goto DoneExit; |
| | | 90 | | } |
| | | 91 | | } |
| | | 92 | | |
| | 0 | 93 | | end = srcMax - 24; |
| | 0 | 94 | | if ((Ssse3.IsSupported || AdvSimd.Arm64.IsSupported || PackedSimd.IsSupported) && BitConverter.IsLit |
| | | 95 | | { |
| | 0 | 96 | | Vector128Decode(decoder, ref src, ref dest, end, maxSrcLength, destLength, srcBytes, destBytes); |
| | | 97 | | |
| | 0 | 98 | | if (src == srcEnd) |
| | | 99 | | { |
| | | 100 | | goto DoneExit; |
| | | 101 | | } |
| | | 102 | | } |
| | | 103 | | } |
| | | 104 | | #endif |
| | | 105 | | |
| | | 106 | | // Last bytes could have padding characters, so process them separately and treat them as valid only if |
| | | 107 | | // if isFinalBlock is false, padding characters are considered invalid |
| | 0 | 108 | | int skipLastChunk = isFinalBlock ? 4 : 0; |
| | | 109 | | |
| | 0 | 110 | | if (destLength >= decodedLength) |
| | | 111 | | { |
| | 0 | 112 | | maxSrcLength = srcLength - skipLastChunk; |
| | | 113 | | } |
| | | 114 | | else |
| | | 115 | | { |
| | | 116 | | // This should never overflow since destLength here is less than int.MaxValue / 4 * 3 (i.e. 16106127 |
| | | 117 | | // Therefore, (destLength / 3) * 4 will always be less than 2147483641 |
| | 0 | 118 | | Debug.Assert(destLength < (int.MaxValue / 4 * 3)); |
| | | 119 | | #if NET |
| | 0 | 120 | | (maxSrcLength, int remainder) = int.DivRem(destLength, 3); |
| | 0 | 121 | | maxSrcLength *= 4; |
| | | 122 | | #else |
| | | 123 | | maxSrcLength = (destLength / 3) * 4; |
| | | 124 | | int remainder = (int)((uint)destLength % 3); |
| | | 125 | | #endif |
| | 0 | 126 | | if (isFinalBlock && remainder > 0) |
| | | 127 | | { |
| | 0 | 128 | | srcLength &= ~0x3; // In case of Base64UrlDecoder source can be not a multiple of 4, round down |
| | | 129 | | } |
| | | 130 | | } |
| | | 131 | | |
| | 0 | 132 | | ref sbyte decodingMap = ref MemoryMarshal.GetReference(decoder.DecodingMap); |
| | 0 | 133 | | srcMax = srcBytes + maxSrcLength; |
| | | 134 | | |
| | 0 | 135 | | while (src < srcMax) |
| | | 136 | | { |
| | 0 | 137 | | int result = decoder.DecodeFourElements(src, ref decodingMap); |
| | | 138 | | |
| | 0 | 139 | | if (result < 0) |
| | | 140 | | { |
| | | 141 | | goto InvalidDataExit; |
| | | 142 | | } |
| | | 143 | | |
| | 0 | 144 | | WriteThreeLowOrderBytes(dest, result); |
| | 0 | 145 | | src += 4; |
| | 0 | 146 | | dest += 3; |
| | | 147 | | } |
| | | 148 | | |
| | 0 | 149 | | if (maxSrcLength != srcLength - skipLastChunk) |
| | | 150 | | { |
| | | 151 | | goto DestinationTooSmallExit; |
| | | 152 | | } |
| | | 153 | | |
| | 0 | 154 | | if (src == srcEnd) |
| | | 155 | | { |
| | 0 | 156 | | if (isFinalBlock) |
| | | 157 | | { |
| | | 158 | | goto InvalidDataExit; |
| | | 159 | | } |
| | | 160 | | |
| | 0 | 161 | | if (src == srcBytes + source.Length) |
| | | 162 | | { |
| | 0 | 163 | | goto DoneExit; |
| | | 164 | | } |
| | | 165 | | |
| | | 166 | | goto NeedMoreDataExit; |
| | | 167 | | } |
| | | 168 | | |
| | | 169 | | // if isFinalBlock is false, we will never reach this point |
| | | 170 | | // Handle remaining bytes, for Base64 its always 4 bytes, for Base64Url up to 8 bytes left. |
| | | 171 | | // If more than 4 bytes remained it will end up in DestinationTooSmallExit or InvalidDataExit (might suc |
| | 0 | 172 | | long remaining = srcEnd - src; |
| | 0 | 173 | | Debug.Assert(typeof(TBase64Decoder) == typeof(Base64DecoderByte) ? remaining == 4 : remaining < 8); |
| | 0 | 174 | | int i0 = decoder.DecodeRemaining(srcEnd, ref decodingMap, remaining, out uint t2, out uint t3); |
| | | 175 | | |
| | 0 | 176 | | if (i0 < 0) |
| | | 177 | | { |
| | | 178 | | goto InvalidDataExit; |
| | | 179 | | } |
| | | 180 | | |
| | 0 | 181 | | byte* destMax = destBytes + (uint)destLength; |
| | | 182 | | |
| | 0 | 183 | | if (!decoder.IsValidPadding(t3)) |
| | | 184 | | { |
| | 0 | 185 | | int i2 = Unsafe.Add(ref decodingMap, (IntPtr)t2); |
| | 0 | 186 | | int i3 = Unsafe.Add(ref decodingMap, (IntPtr)t3); |
| | | 187 | | |
| | 0 | 188 | | i2 <<= 6; |
| | | 189 | | |
| | 0 | 190 | | i0 |= i3; |
| | 0 | 191 | | i0 |= i2; |
| | | 192 | | |
| | 0 | 193 | | if (i0 < 0) |
| | | 194 | | { |
| | | 195 | | goto InvalidDataExit; |
| | | 196 | | } |
| | 0 | 197 | | if (dest + 3 > destMax) |
| | | 198 | | { |
| | | 199 | | goto DestinationTooSmallExit; |
| | | 200 | | } |
| | | 201 | | |
| | 0 | 202 | | WriteThreeLowOrderBytes(dest, i0); |
| | 0 | 203 | | dest += 3; |
| | 0 | 204 | | src += 4; |
| | | 205 | | } |
| | 0 | 206 | | else if (!decoder.IsValidPadding(t2)) |
| | | 207 | | { |
| | 0 | 208 | | int i2 = Unsafe.Add(ref decodingMap, (IntPtr)t2); |
| | | 209 | | |
| | 0 | 210 | | i2 <<= 6; |
| | | 211 | | |
| | 0 | 212 | | i0 |= i2; |
| | | 213 | | |
| | 0 | 214 | | if ((i0 & 0x800000c0) != 0) // if negative or 2 unused bits are not 0. |
| | | 215 | | { |
| | | 216 | | goto InvalidDataExit; |
| | | 217 | | } |
| | 0 | 218 | | if (dest + 2 > destMax) |
| | | 219 | | { |
| | | 220 | | goto DestinationTooSmallExit; |
| | | 221 | | } |
| | | 222 | | |
| | 0 | 223 | | dest[0] = (byte)(i0 >> 16); |
| | 0 | 224 | | dest[1] = (byte)(i0 >> 8); |
| | 0 | 225 | | dest += 2; |
| | 0 | 226 | | src += remaining; |
| | | 227 | | } |
| | | 228 | | else |
| | | 229 | | { |
| | 0 | 230 | | if ((i0 & 0x8000F000) != 0) // if negative or 4 unused bits are not 0. |
| | | 231 | | { |
| | | 232 | | goto InvalidDataExit; |
| | | 233 | | } |
| | 0 | 234 | | if (dest + 1 > destMax) |
| | | 235 | | { |
| | | 236 | | goto DestinationTooSmallExit; |
| | | 237 | | } |
| | | 238 | | |
| | 0 | 239 | | dest[0] = (byte)(i0 >> 16); |
| | 0 | 240 | | dest += 1; |
| | 0 | 241 | | src += remaining; |
| | | 242 | | } |
| | | 243 | | |
| | 0 | 244 | | if (srcLength != source.Length) |
| | | 245 | | { |
| | | 246 | | goto InvalidDataExit; |
| | | 247 | | } |
| | | 248 | | |
| | | 249 | | DoneExit: |
| | 0 | 250 | | bytesConsumed = (int)(src - srcBytes); |
| | 0 | 251 | | bytesWritten = (int)(dest - destBytes); |
| | 0 | 252 | | return OperationStatus.Done; |
| | | 253 | | |
| | | 254 | | DestinationTooSmallExit: |
| | 0 | 255 | | if (srcLength != source.Length && isFinalBlock) |
| | | 256 | | { |
| | | 257 | | goto InvalidDataExit; // if input is not a multiple of 4, and there is no more data, return invalid |
| | | 258 | | } |
| | | 259 | | |
| | 0 | 260 | | if (ignoreWhiteSpace) |
| | | 261 | | { |
| | | 262 | | // Fall through to InvalidDataFallback which strips whitespace and re-evaluates destination size req |
| | | 263 | | goto InvalidDataExit; |
| | | 264 | | } |
| | | 265 | | |
| | 0 | 266 | | bytesConsumed = (int)(src - srcBytes); |
| | 0 | 267 | | bytesWritten = (int)(dest - destBytes); |
| | 0 | 268 | | return OperationStatus.DestinationTooSmall; |
| | | 269 | | |
| | | 270 | | NeedMoreDataExit: |
| | 0 | 271 | | bytesConsumed = (int)(src - srcBytes); |
| | 0 | 272 | | bytesWritten = (int)(dest - destBytes); |
| | 0 | 273 | | return OperationStatus.NeedMoreData; |
| | | 274 | | |
| | | 275 | | InvalidDataExit: |
| | 0 | 276 | | bytesConsumed = (int)(src - srcBytes); |
| | 0 | 277 | | bytesWritten = (int)(dest - destBytes); |
| | 0 | 278 | | return ignoreWhiteSpace ? |
| | 0 | 279 | | InvalidDataFallback(decoder, source, bytes, ref bytesConsumed, ref bytesWritten, isFinalBlock) : |
| | 0 | 280 | | OperationStatus.InvalidData; |
| | | 281 | | } |
| | | 282 | | |
| | | 283 | | [SuppressReadyToRunCanonicalRooting] |
| | | 284 | | static OperationStatus InvalidDataFallback(TBase64Decoder decoder, ReadOnlySpan<T> source, Span<byte> bytes, |
| | | 285 | | { |
| | 0 | 286 | | source = source.Slice(bytesConsumed); |
| | 0 | 287 | | bytes = bytes.Slice(bytesWritten); |
| | | 288 | | |
| | | 289 | | OperationStatus status; |
| | | 290 | | do |
| | | 291 | | { |
| | 0 | 292 | | int localConsumed = decoder.IndexOfAnyExceptWhiteSpace(source); |
| | 0 | 293 | | if (localConsumed < 0) |
| | | 294 | | { |
| | | 295 | | // The remainder of the input is all whitespace. Mark it all as having been consumed, |
| | | 296 | | // and mark the operation as being done. |
| | 0 | 297 | | bytesConsumed += source.Length; |
| | 0 | 298 | | status = OperationStatus.Done; |
| | 0 | 299 | | break; |
| | | 300 | | } |
| | | 301 | | |
| | 0 | 302 | | if (localConsumed == 0) |
| | | 303 | | { |
| | | 304 | | // Non-whitespace was found at the beginning of the input. Since it wasn't consumed |
| | | 305 | | // by the previous call to DecodeFromUtf8, it must be part of a Base64 sequence |
| | | 306 | | // that was interrupted by whitespace or something else considered invalid. |
| | | 307 | | // Fall back to block-wise decoding. This is very slow, but it's also very non-standard |
| | | 308 | | // formatting of the input; whitespace is typically only found between blocks, such as |
| | | 309 | | // when Convert.ToBase64String inserts a line break every 76 output characters. |
| | 0 | 310 | | return decoder.DecodeWithWhiteSpaceBlockwiseWrapper(decoder, source, bytes, ref bytesConsumed, r |
| | | 311 | | } |
| | | 312 | | |
| | | 313 | | // Skip over the starting whitespace and continue. |
| | 0 | 314 | | bytesConsumed += localConsumed; |
| | 0 | 315 | | source = source.Slice(localConsumed); |
| | | 316 | | |
| | | 317 | | // Try again after consumed whitespace |
| | 0 | 318 | | status = DecodeFrom(decoder, source, bytes, out localConsumed, out int localWritten, isFinalBlock, i |
| | 0 | 319 | | bytesConsumed += localConsumed; |
| | 0 | 320 | | bytesWritten += localWritten; |
| | | 321 | | |
| | 0 | 322 | | if (status is OperationStatus.Done or OperationStatus.NeedMoreData) |
| | | 323 | | { |
| | | 324 | | break; |
| | | 325 | | } |
| | | 326 | | |
| | | 327 | | // The DecodeFrom helper will return DestinationTooSmall if the destination is too small, |
| | | 328 | | // regardless of whether it's actually too small once you skip whitespace characters. |
| | | 329 | | // In that case we loop again and fall back to block-wise decoding if we can't make progress. |
| | | 330 | | |
| | 0 | 331 | | source = source.Slice(localConsumed); |
| | 0 | 332 | | bytes = bytes.Slice(localWritten); |
| | | 333 | | } |
| | 0 | 334 | | while (!source.IsEmpty); |
| | | 335 | | |
| | 0 | 336 | | return status; |
| | | 337 | | } |
| | | 338 | | } |
| | | 339 | | |
| | | 340 | | [SuppressReadyToRunCanonicalRooting] |
| | | 341 | | internal static unsafe OperationStatus DecodeFromUtf8InPlace<TBase64Decoder>(TBase64Decoder decoder, Span<byte> |
| | | 342 | | where TBase64Decoder : IBase64Decoder<byte> |
| | | 343 | | { |
| | | 344 | | if (buffer.IsEmpty) |
| | | 345 | | { |
| | 0 | 346 | | bytesWritten = 0; |
| | 0 | 347 | | return OperationStatus.Done; |
| | | 348 | | } |
| | | 349 | | |
| | 0 | 350 | | fixed (byte* bufferBytes = &MemoryMarshal.GetReference(buffer)) |
| | | 351 | | { |
| | 0 | 352 | | uint bufferLength = (uint)buffer.Length; |
| | 0 | 353 | | uint sourceIndex = 0; |
| | 0 | 354 | | uint destIndex = 0; |
| | | 355 | | |
| | 0 | 356 | | if (decoder.IsInvalidLength(buffer.Length)) |
| | | 357 | | { |
| | | 358 | | goto InvalidExit; |
| | | 359 | | } |
| | | 360 | | |
| | 0 | 361 | | ref sbyte decodingMap = ref MemoryMarshal.GetReference(decoder.DecodingMap); |
| | | 362 | | |
| | | 363 | | #if NET |
| | | 364 | | // Decode in place using the same vectorized helpers as DecodeFrom. This is safe because the |
| | | 365 | | // write cursor (dest) always trails the read cursor (src) by 25%, so each vector store -- including |
| | | 366 | | // its zero-padded overshoot -- ends at or before the next vector load and never clobbers source |
| | | 367 | | // that hasn't been read yet. |
| | 0 | 368 | | if (bufferLength >= 24) |
| | | 369 | | { |
| | 0 | 370 | | byte* src = bufferBytes; |
| | 0 | 371 | | byte* dest = bufferBytes; |
| | 0 | 372 | | int length = (int)bufferLength; |
| | 0 | 373 | | byte* srcMax = bufferBytes + length; |
| | | 374 | | |
| | 0 | 375 | | byte* end = srcMax - 88; |
| | 0 | 376 | | if (Vector512.IsHardwareAccelerated && Avx512Vbmi.IsSupported && (end >= src)) |
| | | 377 | | { |
| | 0 | 378 | | Avx512Decode(decoder, ref src, ref dest, end, length, length, bufferBytes, bufferBytes); |
| | | 379 | | } |
| | | 380 | | |
| | 0 | 381 | | end = srcMax - 45; |
| | 0 | 382 | | if (Avx2.IsSupported && (end >= src)) |
| | | 383 | | { |
| | 0 | 384 | | Avx2Decode(decoder, ref src, ref dest, end, length, length, bufferBytes, bufferBytes); |
| | | 385 | | } |
| | | 386 | | |
| | 0 | 387 | | end = srcMax - 66; |
| | | 388 | | if (AdvSimd.Arm64.IsSupported && (end >= src)) |
| | | 389 | | { |
| | | 390 | | AdvSimdDecode(decoder, ref src, ref dest, end, length, length, bufferBytes, bufferBytes); |
| | | 391 | | } |
| | | 392 | | |
| | 0 | 393 | | end = srcMax - 24; |
| | 0 | 394 | | if ((Ssse3.IsSupported || AdvSimd.Arm64.IsSupported || PackedSimd.IsSupported) && BitConverter.IsLit |
| | | 395 | | { |
| | 0 | 396 | | Vector128Decode(decoder, ref src, ref dest, end, length, length, bufferBytes, bufferBytes); |
| | | 397 | | } |
| | | 398 | | |
| | 0 | 399 | | sourceIndex = (uint)(src - bufferBytes); |
| | 0 | 400 | | destIndex = (uint)(dest - bufferBytes); |
| | | 401 | | } |
| | | 402 | | #endif |
| | | 403 | | |
| | 0 | 404 | | if (bufferLength > 4) |
| | | 405 | | { |
| | 0 | 406 | | while (sourceIndex < bufferLength - 4) |
| | | 407 | | { |
| | 0 | 408 | | int result = decoder.DecodeFourElements(bufferBytes + sourceIndex, ref decodingMap); |
| | 0 | 409 | | if (result < 0) |
| | | 410 | | { |
| | | 411 | | goto InvalidExit; |
| | | 412 | | } |
| | | 413 | | |
| | 0 | 414 | | WriteThreeLowOrderBytes(bufferBytes + destIndex, result); |
| | 0 | 415 | | destIndex += 3; |
| | 0 | 416 | | sourceIndex += 4; |
| | | 417 | | } |
| | | 418 | | } |
| | | 419 | | |
| | | 420 | | uint t0; |
| | | 421 | | uint t1; |
| | | 422 | | uint t2; |
| | | 423 | | uint t3; |
| | | 424 | | |
| | 0 | 425 | | switch (bufferLength - sourceIndex) |
| | | 426 | | { |
| | | 427 | | case 2: |
| | 0 | 428 | | t0 = bufferBytes[bufferLength - 2]; |
| | 0 | 429 | | t1 = bufferBytes[bufferLength - 1]; |
| | 0 | 430 | | t2 = EncodingPad; |
| | 0 | 431 | | t3 = EncodingPad; |
| | 0 | 432 | | break; |
| | | 433 | | case 3: |
| | 0 | 434 | | t0 = bufferBytes[bufferLength - 3]; |
| | 0 | 435 | | t1 = bufferBytes[bufferLength - 2]; |
| | 0 | 436 | | t2 = bufferBytes[bufferLength - 1]; |
| | 0 | 437 | | t3 = EncodingPad; |
| | 0 | 438 | | break; |
| | | 439 | | case 4: |
| | 0 | 440 | | t0 = bufferBytes[bufferLength - 4]; |
| | 0 | 441 | | t1 = bufferBytes[bufferLength - 3]; |
| | 0 | 442 | | t2 = bufferBytes[bufferLength - 2]; |
| | 0 | 443 | | t3 = bufferBytes[bufferLength - 1]; |
| | | 444 | | break; |
| | | 445 | | default: |
| | | 446 | | goto InvalidExit; |
| | | 447 | | } |
| | | 448 | | |
| | 0 | 449 | | int i0 = Unsafe.Add(ref decodingMap, (int)t0); |
| | 0 | 450 | | int i1 = Unsafe.Add(ref decodingMap, (int)t1); |
| | | 451 | | |
| | 0 | 452 | | i0 <<= 18; |
| | 0 | 453 | | i1 <<= 12; |
| | | 454 | | |
| | 0 | 455 | | i0 |= i1; |
| | | 456 | | |
| | 0 | 457 | | if (!decoder.IsValidPadding(t3)) |
| | | 458 | | { |
| | 0 | 459 | | int i2 = Unsafe.Add(ref decodingMap, (int)t2); |
| | 0 | 460 | | int i3 = Unsafe.Add(ref decodingMap, (int)t3); |
| | | 461 | | |
| | 0 | 462 | | i2 <<= 6; |
| | | 463 | | |
| | 0 | 464 | | i0 |= i3; |
| | 0 | 465 | | i0 |= i2; |
| | | 466 | | |
| | 0 | 467 | | if (i0 < 0) |
| | | 468 | | { |
| | | 469 | | goto InvalidExit; |
| | | 470 | | } |
| | | 471 | | |
| | 0 | 472 | | WriteThreeLowOrderBytes(bufferBytes + destIndex, i0); |
| | 0 | 473 | | destIndex += 3; |
| | | 474 | | } |
| | 0 | 475 | | else if (!decoder.IsValidPadding(t2)) |
| | | 476 | | { |
| | 0 | 477 | | int i2 = Unsafe.Add(ref decodingMap, (int)t2); |
| | | 478 | | |
| | 0 | 479 | | i2 <<= 6; |
| | | 480 | | |
| | 0 | 481 | | i0 |= i2; |
| | | 482 | | |
| | 0 | 483 | | if ((i0 & 0x800000c0) != 0) // if negative or 2 unused bits are not 0. |
| | | 484 | | { |
| | | 485 | | goto InvalidExit; |
| | | 486 | | } |
| | | 487 | | |
| | 0 | 488 | | bufferBytes[destIndex] = (byte)(i0 >> 16); |
| | 0 | 489 | | bufferBytes[destIndex + 1] = (byte)(i0 >> 8); |
| | 0 | 490 | | destIndex += 2; |
| | | 491 | | } |
| | | 492 | | else |
| | | 493 | | { |
| | 0 | 494 | | if ((i0 & 0x8000F000) != 0) // if negative or 4 unused bits are not 0. |
| | | 495 | | { |
| | | 496 | | goto InvalidExit; |
| | | 497 | | } |
| | | 498 | | |
| | 0 | 499 | | bufferBytes[destIndex] = (byte)(i0 >> 16); |
| | 0 | 500 | | destIndex += 1; |
| | | 501 | | } |
| | | 502 | | |
| | 0 | 503 | | bytesWritten = (int)destIndex; |
| | 0 | 504 | | return OperationStatus.Done; |
| | | 505 | | |
| | | 506 | | InvalidExit: |
| | 0 | 507 | | bytesWritten = (int)destIndex; |
| | 0 | 508 | | return ignoreWhiteSpace ? |
| | 0 | 509 | | DecodeWithWhiteSpaceFromUtf8InPlace<TBase64Decoder>(decoder, buffer, ref bytesWritten, sourceIndex) |
| | 0 | 510 | | OperationStatus.InvalidData; |
| | | 511 | | } |
| | | 512 | | } |
| | | 513 | | |
| | | 514 | | [SuppressReadyToRunCanonicalRooting] |
| | | 515 | | internal static unsafe OperationStatus DecodeWithWhiteSpaceBlockwise<TBase64Decoder>(TBase64Decoder decoder, Rea |
| | | 516 | | where TBase64Decoder : IBase64Decoder<byte> |
| | | 517 | | { |
| | | 518 | | const int BlockSize = 4; |
| | 0 | 519 | | Span<byte> buffer = stackalloc byte[BlockSize]; |
| | 0 | 520 | | OperationStatus status = OperationStatus.Done; |
| | | 521 | | |
| | 0 | 522 | | while (!source.IsEmpty) |
| | | 523 | | { |
| | | 524 | | // Skip over any leading whitespace |
| | 0 | 525 | | if (IsWhiteSpace(source[0])) |
| | | 526 | | { |
| | 0 | 527 | | source = source.Slice(1); |
| | 0 | 528 | | bytesConsumed++; |
| | 0 | 529 | | continue; |
| | | 530 | | } |
| | | 531 | | |
| | 0 | 532 | | int encodedIdx = 0; |
| | 0 | 533 | | int bufferIdx = 0; |
| | 0 | 534 | | int skipped = 0; |
| | | 535 | | |
| | 0 | 536 | | for (; encodedIdx < source.Length && (uint)bufferIdx < (uint)buffer.Length; ++encodedIdx) |
| | | 537 | | { |
| | 0 | 538 | | if (IsWhiteSpace(source[encodedIdx])) |
| | | 539 | | { |
| | 0 | 540 | | skipped++; |
| | | 541 | | } |
| | | 542 | | else |
| | | 543 | | { |
| | 0 | 544 | | buffer[bufferIdx] = source[encodedIdx]; |
| | 0 | 545 | | bufferIdx++; |
| | | 546 | | } |
| | | 547 | | } |
| | | 548 | | |
| | 0 | 549 | | source = source.Slice(encodedIdx); |
| | 0 | 550 | | Debug.Assert(bufferIdx > 0); |
| | | 551 | | |
| | | 552 | | bool hasAnotherBlock; |
| | | 553 | | |
| | 0 | 554 | | if (typeof(TBase64Decoder) == typeof(Base64DecoderByte)) |
| | | 555 | | { |
| | 0 | 556 | | hasAnotherBlock = source.Length >= BlockSize; |
| | | 557 | | } |
| | | 558 | | else |
| | | 559 | | { |
| | 0 | 560 | | hasAnotherBlock = source.Length > 1; |
| | | 561 | | } |
| | | 562 | | |
| | 0 | 563 | | bool localIsFinalBlock = !hasAnotherBlock; |
| | | 564 | | |
| | | 565 | | // If this block contains padding and there's another block, then only whitespace may follow for being v |
| | 0 | 566 | | if (hasAnotherBlock) |
| | | 567 | | { |
| | 0 | 568 | | int paddingCount = GetPaddingCount(decoder, ref buffer[BlockSize - 1]); |
| | 0 | 569 | | if (paddingCount > 0) |
| | | 570 | | { |
| | 0 | 571 | | hasAnotherBlock = false; |
| | 0 | 572 | | localIsFinalBlock = true; |
| | | 573 | | } |
| | | 574 | | } |
| | | 575 | | |
| | 0 | 576 | | if (localIsFinalBlock && !isFinalBlock) |
| | | 577 | | { |
| | 0 | 578 | | localIsFinalBlock = false; |
| | | 579 | | } |
| | | 580 | | |
| | 0 | 581 | | status = DecodeFrom<TBase64Decoder, byte>(decoder, buffer.Slice(0, bufferIdx), bytes, out int localConsu |
| | | 582 | | |
| | 0 | 583 | | if (status != OperationStatus.Done) |
| | | 584 | | { |
| | 0 | 585 | | Debug.Assert(localConsumed == 0 && localWritten == 0, "On failure, should not have consumed or writt |
| | 0 | 586 | | return status; |
| | | 587 | | } |
| | | 588 | | |
| | 0 | 589 | | bytesConsumed += skipped; |
| | 0 | 590 | | bytesConsumed += localConsumed; |
| | 0 | 591 | | bytesWritten += localWritten; |
| | | 592 | | |
| | | 593 | | // The remaining data must all be whitespace in order to be valid. |
| | 0 | 594 | | if (!hasAnotherBlock) |
| | | 595 | | { |
| | 0 | 596 | | for (int i = 0; i < source.Length; ++i) |
| | | 597 | | { |
| | 0 | 598 | | if (!IsWhiteSpace(source[i])) |
| | | 599 | | { |
| | | 600 | | // Revert previous dest increment, since an invalid state followed. |
| | 0 | 601 | | bytesConsumed -= localConsumed; |
| | 0 | 602 | | bytesWritten -= localWritten; |
| | | 603 | | |
| | 0 | 604 | | return OperationStatus.InvalidData; |
| | | 605 | | } |
| | | 606 | | |
| | 0 | 607 | | bytesConsumed++; |
| | | 608 | | } |
| | | 609 | | |
| | 0 | 610 | | break; |
| | | 611 | | } |
| | | 612 | | |
| | 0 | 613 | | bytes = bytes.Slice(localWritten); |
| | 0 | 614 | | Debug.Assert(!source.IsEmpty); |
| | | 615 | | } |
| | | 616 | | |
| | 0 | 617 | | return status; |
| | | 618 | | } |
| | | 619 | | |
| | | 620 | | [SuppressReadyToRunCanonicalRooting] |
| | | 621 | | internal static unsafe OperationStatus DecodeWithWhiteSpaceBlockwise<TBase64Decoder>(TBase64Decoder decoder, Rea |
| | | 622 | | where TBase64Decoder : IBase64Decoder<ushort> |
| | | 623 | | { |
| | | 624 | | const int BlockSize = 4; |
| | 0 | 625 | | Span<ushort> buffer = stackalloc ushort[BlockSize]; |
| | 0 | 626 | | OperationStatus status = OperationStatus.Done; |
| | | 627 | | |
| | 0 | 628 | | while (!source.IsEmpty) |
| | | 629 | | { |
| | | 630 | | // Skip over any leading whitespace |
| | 0 | 631 | | if (IsWhiteSpace(source[0])) |
| | | 632 | | { |
| | 0 | 633 | | source = source.Slice(1); |
| | 0 | 634 | | bytesConsumed++; |
| | 0 | 635 | | continue; |
| | | 636 | | } |
| | | 637 | | |
| | 0 | 638 | | int encodedIdx = 0; |
| | 0 | 639 | | int bufferIdx = 0; |
| | 0 | 640 | | int skipped = 0; |
| | | 641 | | |
| | 0 | 642 | | for (; encodedIdx < source.Length && (uint)bufferIdx < (uint)buffer.Length; ++encodedIdx) |
| | | 643 | | { |
| | 0 | 644 | | if (IsWhiteSpace(source[encodedIdx])) |
| | | 645 | | { |
| | 0 | 646 | | skipped++; |
| | | 647 | | } |
| | | 648 | | else |
| | | 649 | | { |
| | 0 | 650 | | buffer[bufferIdx] = source[encodedIdx]; |
| | 0 | 651 | | bufferIdx++; |
| | | 652 | | } |
| | | 653 | | } |
| | | 654 | | |
| | 0 | 655 | | source = source.Slice(encodedIdx); |
| | 0 | 656 | | Debug.Assert(bufferIdx > 0); |
| | | 657 | | |
| | | 658 | | bool hasAnotherBlock; |
| | | 659 | | |
| | 0 | 660 | | if (decoder is Base64DecoderChar) |
| | | 661 | | { |
| | 0 | 662 | | hasAnotherBlock = source.Length >= BlockSize; |
| | | 663 | | } |
| | | 664 | | else |
| | | 665 | | { |
| | 0 | 666 | | hasAnotherBlock = source.Length > 1; |
| | | 667 | | } |
| | | 668 | | |
| | 0 | 669 | | bool localIsFinalBlock = !hasAnotherBlock; |
| | | 670 | | |
| | | 671 | | // If this block contains padding and there's another block, then only whitespace may follow for being v |
| | 0 | 672 | | if (hasAnotherBlock) |
| | | 673 | | { |
| | 0 | 674 | | int paddingCount = GetPaddingCount(decoder, ref buffer[BlockSize - 1]); |
| | 0 | 675 | | if (paddingCount > 0) |
| | | 676 | | { |
| | 0 | 677 | | hasAnotherBlock = false; |
| | 0 | 678 | | localIsFinalBlock = true; |
| | | 679 | | } |
| | | 680 | | } |
| | | 681 | | |
| | 0 | 682 | | if (localIsFinalBlock && !isFinalBlock) |
| | | 683 | | { |
| | 0 | 684 | | localIsFinalBlock = false; |
| | | 685 | | } |
| | | 686 | | |
| | 0 | 687 | | status = DecodeFrom(decoder, buffer.Slice(0, bufferIdx), bytes, out int localConsumed, out int localWrit |
| | | 688 | | |
| | 0 | 689 | | if (status != OperationStatus.Done) |
| | | 690 | | { |
| | 0 | 691 | | Debug.Assert(localConsumed == 0 && localWritten == 0, "On failure, should not have consumed or writt |
| | 0 | 692 | | return status; |
| | | 693 | | } |
| | | 694 | | |
| | 0 | 695 | | bytesConsumed += skipped; |
| | 0 | 696 | | bytesConsumed += localConsumed; |
| | 0 | 697 | | bytesWritten += localWritten; |
| | | 698 | | |
| | | 699 | | // The remaining data must all be whitespace in order to be valid. |
| | 0 | 700 | | if (!hasAnotherBlock) |
| | | 701 | | { |
| | 0 | 702 | | for (int i = 0; i < source.Length; ++i) |
| | | 703 | | { |
| | 0 | 704 | | if (!IsWhiteSpace(source[i])) |
| | | 705 | | { |
| | | 706 | | // Revert previous dest increment, since an invalid state followed. |
| | 0 | 707 | | bytesConsumed -= localConsumed; |
| | 0 | 708 | | bytesWritten -= localWritten; |
| | | 709 | | |
| | 0 | 710 | | return OperationStatus.InvalidData; |
| | | 711 | | } |
| | | 712 | | } |
| | | 713 | | |
| | 0 | 714 | | bytesConsumed += source.Length; |
| | 0 | 715 | | break; |
| | | 716 | | } |
| | | 717 | | |
| | 0 | 718 | | bytes = bytes.Slice(localWritten); |
| | 0 | 719 | | Debug.Assert(!source.IsEmpty); |
| | | 720 | | } |
| | | 721 | | |
| | 0 | 722 | | return status; |
| | | 723 | | } |
| | | 724 | | |
| | | 725 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 726 | | [SuppressReadyToRunCanonicalRooting] |
| | | 727 | | private static int GetPaddingCount<TBase64Decoder>(TBase64Decoder decoder, ref byte ptrToLastElement) |
| | | 728 | | where TBase64Decoder : IBase64Decoder<byte> |
| | | 729 | | { |
| | 0 | 730 | | int padding = 0; |
| | | 731 | | |
| | 0 | 732 | | if (decoder.IsValidPadding(ptrToLastElement)) |
| | | 733 | | { |
| | 0 | 734 | | padding++; |
| | | 735 | | } |
| | | 736 | | |
| | 0 | 737 | | if (decoder.IsValidPadding(Unsafe.Subtract(ref ptrToLastElement, 1))) |
| | | 738 | | { |
| | 0 | 739 | | padding++; |
| | | 740 | | } |
| | | 741 | | |
| | 0 | 742 | | return padding; |
| | | 743 | | } |
| | | 744 | | |
| | | 745 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 746 | | [SuppressReadyToRunCanonicalRooting] |
| | | 747 | | private static int GetPaddingCount<TBase64Decoder>(TBase64Decoder decoder, ref ushort ptrToLastElement) |
| | | 748 | | where TBase64Decoder : IBase64Decoder<ushort> |
| | | 749 | | { |
| | 0 | 750 | | int padding = 0; |
| | | 751 | | |
| | 0 | 752 | | if (decoder.IsValidPadding(ptrToLastElement)) |
| | | 753 | | { |
| | 0 | 754 | | padding++; |
| | | 755 | | } |
| | | 756 | | |
| | 0 | 757 | | if (decoder.IsValidPadding(Unsafe.Subtract(ref ptrToLastElement, 1))) |
| | | 758 | | { |
| | 0 | 759 | | padding++; |
| | | 760 | | } |
| | | 761 | | |
| | 0 | 762 | | return padding; |
| | | 763 | | } |
| | | 764 | | |
| | | 765 | | [SuppressReadyToRunCanonicalRooting] |
| | | 766 | | private static unsafe OperationStatus DecodeWithWhiteSpaceFromUtf8InPlace<TBase64Decoder>(TBase64Decoder decoder |
| | | 767 | | where TBase64Decoder : IBase64Decoder<byte> |
| | | 768 | | { |
| | 0 | 769 | | int BlockSize = Math.Min(source.Length - (int)sourceIndex, 4); |
| | 0 | 770 | | Span<byte> buffer = stackalloc byte[BlockSize]; |
| | | 771 | | |
| | 0 | 772 | | OperationStatus status = OperationStatus.Done; |
| | 0 | 773 | | int localDestIndex = destIndex; |
| | 0 | 774 | | bool hasPaddingBeenProcessed = false; |
| | 0 | 775 | | int localBytesWritten = 0; |
| | | 776 | | |
| | 0 | 777 | | while (sourceIndex < (uint)source.Length) |
| | | 778 | | { |
| | 0 | 779 | | int bufferIdx = 0; |
| | | 780 | | |
| | 0 | 781 | | while (bufferIdx < BlockSize && sourceIndex < (uint)source.Length) |
| | | 782 | | { |
| | 0 | 783 | | if (!IsWhiteSpace(source[(int)sourceIndex])) |
| | | 784 | | { |
| | 0 | 785 | | buffer[bufferIdx] = source[(int)sourceIndex]; |
| | 0 | 786 | | bufferIdx++; |
| | | 787 | | } |
| | | 788 | | |
| | 0 | 789 | | sourceIndex++; |
| | | 790 | | } |
| | | 791 | | |
| | 0 | 792 | | if (bufferIdx == 0) |
| | | 793 | | { |
| | | 794 | | continue; |
| | | 795 | | } |
| | | 796 | | |
| | 0 | 797 | | if (bufferIdx != 4) |
| | | 798 | | { |
| | | 799 | | // Base64 require 4 bytes, for Base64Url it can be less than 4 bytes but not 1 byte. |
| | 0 | 800 | | if (decoder is Base64DecoderByte || bufferIdx == 1) |
| | | 801 | | { |
| | 0 | 802 | | status = OperationStatus.InvalidData; |
| | 0 | 803 | | break; |
| | | 804 | | } |
| | | 805 | | else // For Base64Url fill empty slots in last block with padding |
| | | 806 | | { |
| | 0 | 807 | | while (bufferIdx < BlockSize) // Can happen only for last block |
| | | 808 | | { |
| | 0 | 809 | | Debug.Assert(source.Length == sourceIndex); |
| | 0 | 810 | | buffer[bufferIdx++] = (byte)EncodingPad; |
| | | 811 | | } |
| | | 812 | | } |
| | | 813 | | } |
| | | 814 | | |
| | 0 | 815 | | if (hasPaddingBeenProcessed) |
| | | 816 | | { |
| | | 817 | | // Padding has already been processed, a new valid block cannot be processed. |
| | | 818 | | // Revert previous dest increment, since an invalid state followed. |
| | 0 | 819 | | localDestIndex -= localBytesWritten; |
| | 0 | 820 | | status = OperationStatus.InvalidData; |
| | 0 | 821 | | break; |
| | | 822 | | } |
| | | 823 | | |
| | 0 | 824 | | status = DecodeFromUtf8InPlace<TBase64Decoder>(decoder, buffer, out localBytesWritten, ignoreWhiteSpace: |
| | 0 | 825 | | localDestIndex += localBytesWritten; |
| | 0 | 826 | | hasPaddingBeenProcessed = localBytesWritten < 3; |
| | | 827 | | |
| | 0 | 828 | | if (status != OperationStatus.Done) |
| | | 829 | | { |
| | | 830 | | break; |
| | | 831 | | } |
| | | 832 | | |
| | | 833 | | // Write result to source span in place. |
| | 0 | 834 | | for (int i = 0; i < localBytesWritten; i++) |
| | | 835 | | { |
| | 0 | 836 | | source[localDestIndex - localBytesWritten + i] = buffer[i]; |
| | | 837 | | } |
| | | 838 | | } |
| | | 839 | | |
| | 0 | 840 | | destIndex = localDestIndex; |
| | 0 | 841 | | return status; |
| | | 842 | | } |
| | | 843 | | |
| | | 844 | | #if NET |
| | | 845 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 846 | | [CompExactlyDependsOn(typeof(Avx512BW))] |
| | | 847 | | [CompExactlyDependsOn(typeof(Avx512Vbmi))] |
| | | 848 | | [SuppressReadyToRunCanonicalRooting] |
| | | 849 | | private static unsafe void Avx512Decode<TBase64Decoder, T>(TBase64Decoder decoder, ref T* srcBytes, ref byte* de |
| | | 850 | | where TBase64Decoder : IBase64Decoder<T> |
| | | 851 | | where T : unmanaged |
| | | 852 | | { |
| | | 853 | | // Reference for VBMI implementation : https://github.com/WojciechMula/base64simd/tree/master/decode |
| | | 854 | | // If we have AVX512 support, pick off 64 bytes at a time for as long as we can, |
| | | 855 | | // but make sure that we quit before seeing any == markers at the end of the |
| | | 856 | | // string. Also, because we write 16 zeroes at the end of the output, ensure |
| | | 857 | | // that there are at least 22 valid bytes of input data remaining to close the |
| | | 858 | | // gap. 64 + 2 + 22 = 88 bytes. |
| | 0 | 859 | | T* src = srcBytes; |
| | 0 | 860 | | byte* dest = destBytes; |
| | | 861 | | |
| | | 862 | | // The JIT won't hoist these "constants", so help it |
| | 0 | 863 | | Vector512<sbyte> vbmiLookup0 = Vector512.Create(decoder.VbmiLookup0).AsSByte(); |
| | 0 | 864 | | Vector512<sbyte> vbmiLookup1 = Vector512.Create(decoder.VbmiLookup1).AsSByte(); |
| | 0 | 865 | | Vector512<byte> vbmiPackedLanesControl = Vector512.Create( |
| | 0 | 866 | | 0x06000102, 0x090a0405, 0x0c0d0e08, 0x16101112, |
| | 0 | 867 | | 0x191a1415, 0x1c1d1e18, 0x26202122, 0x292a2425, |
| | 0 | 868 | | 0x2c2d2e28, 0x36303132, 0x393a3435, 0x3c3d3e38, |
| | 0 | 869 | | 0x00000000, 0x00000000, 0x00000000, 0x00000000).AsByte(); |
| | | 870 | | |
| | 0 | 871 | | Vector512<sbyte> mergeConstant0 = Vector512.Create(0x01400140).AsSByte(); |
| | 0 | 872 | | Vector512<short> mergeConstant1 = Vector512.Create(0x00011000).AsInt16(); |
| | | 873 | | |
| | | 874 | | // This algorithm requires AVX512VBMI support. |
| | | 875 | | // Vbmi was first introduced in CannonLake and is available from IceLake on. |
| | | 876 | | do |
| | | 877 | | { |
| | 0 | 878 | | if (!decoder.TryLoadVector512(src, srcStart, sourceLength, out Vector512<sbyte> str)) |
| | | 879 | | { |
| | | 880 | | break; |
| | | 881 | | } |
| | | 882 | | |
| | | 883 | | // Step 1: Translate encoded Base64 input to their original indices |
| | | 884 | | // This step also checks for invalid inputs and exits. |
| | | 885 | | // After this, we have indices which are verified to have upper 2 bits set to 0 in each byte. |
| | | 886 | | // origIndex = [...|00dddddd|00cccccc|00bbbbbb|00aaaaaa] |
| | 0 | 887 | | Vector512<sbyte> origIndex = Avx512Vbmi.PermuteVar64x8x2(vbmiLookup0, str, vbmiLookup1); |
| | 0 | 888 | | Vector512<sbyte> errorVec = (origIndex.AsInt32() | str.AsInt32()).AsSByte(); |
| | 0 | 889 | | if (errorVec.ExtractMostSignificantBits() != 0) |
| | | 890 | | { |
| | | 891 | | break; |
| | | 892 | | } |
| | | 893 | | |
| | | 894 | | // Step 2: Now we need to reshuffle bits to remove the 0 bits. |
| | | 895 | | // multiAdd1: [...|0000cccc|ccdddddd|0000aaaa|aabbbbbb] |
| | 0 | 896 | | Vector512<short> multiAdd1 = Avx512BW.MultiplyAddAdjacent(origIndex.AsByte(), mergeConstant0); |
| | | 897 | | // multiAdd1: [...|00000000|aaaaaabb|bbbbcccc|ccdddddd] |
| | 0 | 898 | | Vector512<int> multiAdd2 = Avx512BW.MultiplyAddAdjacent(multiAdd1, mergeConstant1); |
| | | 899 | | |
| | | 900 | | // Step 3: Pack 48 bytes |
| | 0 | 901 | | str = Avx512Vbmi.PermuteVar64x8(multiAdd2.AsByte(), vbmiPackedLanesControl).AsSByte(); |
| | | 902 | | |
| | 0 | 903 | | AssertWrite<Vector512<sbyte>>(dest, destStart, destLength); |
| | 0 | 904 | | str.Store((sbyte*)dest); |
| | 0 | 905 | | src += 64; |
| | 0 | 906 | | dest += 48; |
| | | 907 | | } |
| | 0 | 908 | | while (src <= srcEnd); |
| | | 909 | | |
| | 0 | 910 | | srcBytes = src; |
| | 0 | 911 | | destBytes = dest; |
| | 0 | 912 | | } |
| | | 913 | | |
| | | 914 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 915 | | [CompExactlyDependsOn(typeof(Avx2))] |
| | | 916 | | [SuppressReadyToRunCanonicalRooting] |
| | | 917 | | private static unsafe void Avx2Decode<TBase64Decoder, T>(TBase64Decoder decoder, ref T* srcBytes, ref byte* dest |
| | | 918 | | where TBase64Decoder : IBase64Decoder<T> |
| | | 919 | | where T : unmanaged |
| | | 920 | | { |
| | | 921 | | // If we have AVX2 support, pick off 32 bytes at a time for as long as we can, |
| | | 922 | | // but make sure that we quit before seeing any == markers at the end of the |
| | | 923 | | // string. Also, because we write 8 zeroes at the end of the output, ensure |
| | | 924 | | // that there are at least 11 valid bytes of input data remaining to close the |
| | | 925 | | // gap. 32 + 2 + 11 = 45 bytes. |
| | | 926 | | |
| | | 927 | | // See SSSE3-version below for an explanation of how the code works. |
| | | 928 | | |
| | | 929 | | // The JIT won't hoist these "constants", so help it |
| | 0 | 930 | | Vector256<sbyte> lutHi = Vector256.Create(decoder.Avx2LutHigh); |
| | | 931 | | |
| | 0 | 932 | | Vector256<sbyte> lutLo = Vector256.Create(decoder.Avx2LutLow); |
| | | 933 | | |
| | 0 | 934 | | Vector256<sbyte> lutShift = Vector256.Create(decoder.Avx2LutShift); |
| | | 935 | | |
| | 0 | 936 | | Vector256<sbyte> packBytesInLaneMask = Vector256.Create( |
| | 0 | 937 | | 2, 1, 0, 6, |
| | 0 | 938 | | 5, 4, 10, 9, |
| | 0 | 939 | | 8, 14, 13, 12, |
| | 0 | 940 | | -1, -1, -1, -1, |
| | 0 | 941 | | 2, 1, 0, 6, |
| | 0 | 942 | | 5, 4, 10, 9, |
| | 0 | 943 | | 8, 14, 13, 12, |
| | 0 | 944 | | -1, -1, -1, -1); |
| | | 945 | | |
| | 0 | 946 | | Vector256<int> packLanesControl = Vector256.Create( |
| | 0 | 947 | | 0, 0, 0, 0, |
| | 0 | 948 | | 1, 0, 0, 0, |
| | 0 | 949 | | 2, 0, 0, 0, |
| | 0 | 950 | | 4, 0, 0, 0, |
| | 0 | 951 | | 5, 0, 0, 0, |
| | 0 | 952 | | 6, 0, 0, 0, |
| | 0 | 953 | | -1, -1, -1, -1, |
| | 0 | 954 | | -1, -1, -1, -1).AsInt32(); |
| | | 955 | | |
| | 0 | 956 | | Vector256<sbyte> maskSlashOrUnderscore = Vector256.Create((sbyte)decoder.MaskSlashOrUnderscore); |
| | 0 | 957 | | Vector256<sbyte> shiftForUnderscore = Vector256.Create((sbyte)33); |
| | 0 | 958 | | Vector256<sbyte> mergeConstant0 = Vector256.Create(0x01400140).AsSByte(); |
| | 0 | 959 | | Vector256<short> mergeConstant1 = Vector256.Create(0x00011000).AsInt16(); |
| | | 960 | | |
| | 0 | 961 | | T* src = srcBytes; |
| | 0 | 962 | | byte* dest = destBytes; |
| | | 963 | | |
| | | 964 | | //while (remaining >= 45) |
| | | 965 | | do |
| | | 966 | | { |
| | 0 | 967 | | if (!decoder.TryLoadAvxVector256(src, srcStart, sourceLength, out Vector256<sbyte> str)) |
| | | 968 | | { |
| | | 969 | | break; |
| | | 970 | | } |
| | | 971 | | |
| | 0 | 972 | | Vector256<sbyte> hiNibbles = ((str.AsInt32()) >>> 4).AsSByte() & maskSlashOrUnderscore; |
| | | 973 | | |
| | 0 | 974 | | if (!decoder.TryDecode256Core(str, hiNibbles, maskSlashOrUnderscore, lutLo, lutHi, lutShift, shiftForUnd |
| | | 975 | | { |
| | | 976 | | break; |
| | | 977 | | } |
| | | 978 | | |
| | | 979 | | // in, lower lane, bits, upper case are most significant bits, lower case are least significant bits: |
| | | 980 | | // 00llllll 00kkkkLL 00jjKKKK 00JJJJJJ |
| | | 981 | | // 00iiiiii 00hhhhII 00ggHHHH 00GGGGGG |
| | | 982 | | // 00ffffff 00eeeeFF 00ddEEEE 00DDDDDD |
| | | 983 | | // 00cccccc 00bbbbCC 00aaBBBB 00AAAAAA |
| | | 984 | | |
| | 0 | 985 | | Vector256<short> merge_ab_and_bc = Avx2.MultiplyAddAdjacent(str.AsByte(), mergeConstant0); |
| | | 986 | | // 0000kkkk LLllllll 0000JJJJ JJjjKKKK |
| | | 987 | | // 0000hhhh IIiiiiii 0000GGGG GGggHHHH |
| | | 988 | | // 0000eeee FFffffff 0000DDDD DDddEEEE |
| | | 989 | | // 0000bbbb CCcccccc 0000AAAA AAaaBBBB |
| | | 990 | | |
| | 0 | 991 | | Vector256<int> output = Avx2.MultiplyAddAdjacent(merge_ab_and_bc, mergeConstant1); |
| | | 992 | | // 00000000 JJJJJJjj KKKKkkkk LLllllll |
| | | 993 | | // 00000000 GGGGGGgg HHHHhhhh IIiiiiii |
| | | 994 | | // 00000000 DDDDDDdd EEEEeeee FFffffff |
| | | 995 | | // 00000000 AAAAAAaa BBBBbbbb CCcccccc |
| | | 996 | | |
| | | 997 | | // Pack bytes together in each lane: |
| | 0 | 998 | | output = Avx2.Shuffle(output.AsSByte(), packBytesInLaneMask).AsInt32(); |
| | | 999 | | // 00000000 00000000 00000000 00000000 |
| | | 1000 | | // LLllllll KKKKkkkk JJJJJJjj IIiiiiii |
| | | 1001 | | // HHHHhhhh GGGGGGgg FFffffff EEEEeeee |
| | | 1002 | | // DDDDDDdd CCcccccc BBBBbbbb AAAAAAaa |
| | | 1003 | | |
| | | 1004 | | // Pack lanes |
| | 0 | 1005 | | str = Avx2.PermuteVar8x32(output, packLanesControl).AsSByte(); |
| | | 1006 | | |
| | 0 | 1007 | | AssertWrite<Vector256<sbyte>>(dest, destStart, destLength); |
| | 0 | 1008 | | Avx.Store(dest, str.AsByte()); |
| | | 1009 | | |
| | 0 | 1010 | | src += 32; |
| | 0 | 1011 | | dest += 24; |
| | | 1012 | | } |
| | 0 | 1013 | | while (src <= srcEnd); |
| | | 1014 | | |
| | 0 | 1015 | | srcBytes = src; |
| | 0 | 1016 | | destBytes = dest; |
| | 0 | 1017 | | } |
| | | 1018 | | |
| | | 1019 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1020 | | [CompExactlyDependsOn(typeof(Ssse3))] |
| | | 1021 | | [CompExactlyDependsOn(typeof(AdvSimd.Arm64))] |
| | | 1022 | | [CompExactlyDependsOn(typeof(PackedSimd))] |
| | | 1023 | | internal static Vector128<byte> SimdShuffle(Vector128<byte> left, Vector128<byte> right, Vector128<byte> mask8F) |
| | | 1024 | | { |
| | | 1025 | | Debug.Assert((Ssse3.IsSupported || AdvSimd.Arm64.IsSupported || PackedSimd.IsSupported) && BitConverter.IsLi |
| | | 1026 | | |
| | 0 | 1027 | | if (Ssse3.IsSupported) |
| | | 1028 | | { |
| | 0 | 1029 | | return Ssse3.Shuffle(left, right); |
| | | 1030 | | } |
| | | 1031 | | else if (PackedSimd.IsSupported) |
| | | 1032 | | { |
| | | 1033 | | return PackedSimd.Swizzle(left, right & mask8F); |
| | | 1034 | | } |
| | | 1035 | | else |
| | | 1036 | | { |
| | 0 | 1037 | | return AdvSimd.Arm64.VectorTableLookup(left, right & mask8F); |
| | | 1038 | | } |
| | | 1039 | | } |
| | | 1040 | | |
| | | 1041 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1042 | | [CompExactlyDependsOn(typeof(AdvSimd.Arm64))] |
| | | 1043 | | [SuppressReadyToRunCanonicalRooting] |
| | | 1044 | | private static unsafe void AdvSimdDecode<TBase64Decoder, T>(TBase64Decoder decoder, ref T* srcBytes, ref byte* d |
| | | 1045 | | where TBase64Decoder : IBase64Decoder<T> |
| | | 1046 | | where T : unmanaged |
| | | 1047 | | { |
| | | 1048 | | // C# implementation of https://github.com/aklomp/base64/blob/3a5add8652076612a8407627a42c768736a4263f/lib/a |
| | | 1049 | | // If we have AdvSimd support, pick off 64 bytes at a time for as long as we can, |
| | | 1050 | | // but make sure that we quit before seeing any == markers at the end of the |
| | | 1051 | | // string. 64 + 2 = 66 bytes. |
| | | 1052 | | |
| | | 1053 | | // In the decoding process, we want to map each byte, representing a Base64 value, to its 6-bit (0-63) repre |
| | | 1054 | | // It uses the following mapping. Values outside the following groups are invalid and, we abort decoding whe |
| | | 1055 | | // |
| | | 1056 | | // # From To Char |
| | | 1057 | | // 1 [43] [62] + |
| | | 1058 | | // 2 [47] [63] / |
| | | 1059 | | // 3 [48..57] [52..61] 0..9 |
| | | 1060 | | // 4 [65..90] [0..25] A..Z |
| | | 1061 | | // 5 [97..122] [26..51] a..z |
| | | 1062 | | // |
| | | 1063 | | // To map an input value to its Base64 representation, we use look-up tables 'decLutOne' and 'decLutTwo'. |
| | | 1064 | | // 'decLutOne' helps to map groups 1, 2 and 3 while 'decLutTwo' maps groups 4 and 5 in the above list. |
| | | 1065 | | // After mapping, each value falls between 0-63. Consequently, the last six bits of each byte now hold a val |
| | | 1066 | | // We then compress four such bytes (with valid 4 * 6 = 24 bits) to three UTF8 bytes (3 * 8 = 24 bits). |
| | | 1067 | | // For faster decoding, we use SIMD operations that allow the processing of multiple bytes together. |
| | | 1068 | | // However, the compress operation on adjacent values of a vector could be slower. Thus, we de-interleave wh |
| | | 1069 | | // the input bytes that store adjacent bytes in separate vectors. This later simplifies the compress step wi |
| | | 1070 | | // of logical operations. This requires interleaving while storing the decoded result. |
| | | 1071 | | |
| | | 1072 | | // Values in 'decLutOne' maps input values from 0 to 63. |
| | | 1073 | | // 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255 |
| | | 1074 | | // 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255 |
| | | 1075 | | // 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 62, 255, 255, 255, 63 |
| | | 1076 | | // 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 255, 255, 255, 255, 255, 255 |
| | | 1077 | | var decLutOne = (Vector128<byte>.AllBitsSet, |
| | | 1078 | | Vector128<byte>.AllBitsSet, |
| | | 1079 | | Vector128.Create(decoder.AdvSimdLutOne3).AsByte(), |
| | | 1080 | | Vector128.Create(0x37363534, 0x3B3A3938, 0xFFFF3D3C, 0xFFFFFFFF).AsByte()); |
| | | 1081 | | |
| | | 1082 | | // Values in 'decLutTwo' maps input values from 63 to 127. |
| | | 1083 | | // 0, 255, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 |
| | | 1084 | | // 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 255, 255, 255, 255 |
| | | 1085 | | // 255, 255, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39 |
| | | 1086 | | // 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 255, 255, 255, 255 |
| | | 1087 | | var decLutTwo = (Vector128.Create(0x0100FF00, 0x05040302, 0x09080706, 0x0D0C0B0A).AsByte(), |
| | | 1088 | | Vector128.Create(0x11100F0E, 0x15141312, 0x19181716, 0xFFFFFFFF).AsByte(), |
| | | 1089 | | Vector128.Create(decoder.AdvSimdLutTwo3Uint1, 0x1F1E1D1C, 0x23222120, 0x27262524).AsByte(), |
| | | 1090 | | Vector128.Create(0x2B2A2928, 0x2F2E2D2C, 0x33323130, 0xFFFFFFFF).AsByte()); |
| | | 1091 | | |
| | | 1092 | | T* src = srcBytes; |
| | | 1093 | | byte* dest = destBytes; |
| | | 1094 | | Vector128<byte> offset = Vector128.Create<byte>(63); |
| | | 1095 | | |
| | | 1096 | | do |
| | | 1097 | | { |
| | | 1098 | | // Step 1: Load 64 bytes and de-interleave. |
| | | 1099 | | if (!decoder.TryLoadArmVector128x4(src, srcStart, sourceLength, |
| | | 1100 | | out Vector128<byte> str1, out Vector128<byte> str2, out Vector128<byte> str3, out Vector128<byte> st |
| | | 1101 | | { |
| | | 1102 | | break; |
| | | 1103 | | } |
| | | 1104 | | |
| | | 1105 | | // Step 2: Map each valid input to its Base64 value. |
| | | 1106 | | // We use two look-ups to compute partial results and combine them later. |
| | | 1107 | | |
| | | 1108 | | // Step 2.1: Detect valid Base64 values from the first three groups. Maps input as, |
| | | 1109 | | // 0 to 63 (Invalid) => 255 |
| | | 1110 | | // 0 to 63 (Valid) => Their Base64 equivalent |
| | | 1111 | | // 64 to 255 => 0 |
| | | 1112 | | |
| | | 1113 | | // Each input value acts as an index in the look-up table 'decLutOne'. |
| | | 1114 | | // e.g., for group 1: index 43 maps to 62 (Base64 '+'). |
| | | 1115 | | // Group 4 and 5 values are out-of-range (>64), so they are mapped to zero. |
| | | 1116 | | // Other valid indices but invalid values are mapped to 255. |
| | | 1117 | | Vector128<byte> decOne1 = AdvSimd.Arm64.VectorTableLookup(decLutOne, str1); |
| | | 1118 | | Vector128<byte> decOne2 = AdvSimd.Arm64.VectorTableLookup(decLutOne, str2); |
| | | 1119 | | Vector128<byte> decOne3 = AdvSimd.Arm64.VectorTableLookup(decLutOne, str3); |
| | | 1120 | | Vector128<byte> decOne4 = AdvSimd.Arm64.VectorTableLookup(decLutOne, str4); |
| | | 1121 | | |
| | | 1122 | | // Step 2.2: Detect valid Base64 values from groups 4 and 5. Maps input as, |
| | | 1123 | | // 0 to 63 => 0 |
| | | 1124 | | // 64 to 122 (Valid) => Their Base64 equivalent |
| | | 1125 | | // 64 to 122 (Invalid) => 255 |
| | | 1126 | | // 123 to 255 => Remains unchanged |
| | | 1127 | | |
| | | 1128 | | // Subtract/offset each input value by 63 so that it can be used as a valid offset. |
| | | 1129 | | // Subtract saturate makes values from the first three groups set to zero that are |
| | | 1130 | | // then mapped to zero in the subsequent look-up. |
| | | 1131 | | Vector128<byte> decTwo1 = AdvSimd.SubtractSaturate(str1, offset); |
| | | 1132 | | Vector128<byte> decTwo2 = AdvSimd.SubtractSaturate(str2, offset); |
| | | 1133 | | Vector128<byte> decTwo3 = AdvSimd.SubtractSaturate(str3, offset); |
| | | 1134 | | Vector128<byte> decTwo4 = AdvSimd.SubtractSaturate(str4, offset); |
| | | 1135 | | |
| | | 1136 | | // We use VTBX to map values where out-of-range indices are unchanged. |
| | | 1137 | | decTwo1 = AdvSimd.Arm64.VectorTableLookupExtension(decTwo1, decLutTwo, decTwo1); |
| | | 1138 | | decTwo2 = AdvSimd.Arm64.VectorTableLookupExtension(decTwo2, decLutTwo, decTwo2); |
| | | 1139 | | decTwo3 = AdvSimd.Arm64.VectorTableLookupExtension(decTwo3, decLutTwo, decTwo3); |
| | | 1140 | | decTwo4 = AdvSimd.Arm64.VectorTableLookupExtension(decTwo4, decLutTwo, decTwo4); |
| | | 1141 | | |
| | | 1142 | | // Step 3: Combine the partial result. |
| | | 1143 | | // Each look-up above maps valid values to their Base64 equivalent or zero. |
| | | 1144 | | // Thus the intermediate results 'decOne' and 'decTwo' could be OR-ed to get final values. |
| | | 1145 | | str1 = (decOne1 | decTwo1); |
| | | 1146 | | str2 = (decOne2 | decTwo2); |
| | | 1147 | | str3 = (decOne3 | decTwo3); |
| | | 1148 | | str4 = (decOne4 | decTwo4); |
| | | 1149 | | |
| | | 1150 | | // Step 4: Detect an invalid input value. |
| | | 1151 | | // Invalid values < 122 are set to 255 while the ones above 122 are unchanged. |
| | | 1152 | | // Check for invalid input, any value larger than 63. |
| | | 1153 | | Vector128<byte> classified = (Vector128.GreaterThan(str1, offset) |
| | | 1154 | | | Vector128.GreaterThan(str2, offset) |
| | | 1155 | | | Vector128.GreaterThan(str3, offset) |
| | | 1156 | | | Vector128.GreaterThan(str4, offset)); |
| | | 1157 | | |
| | | 1158 | | // Check that all bits are zero. |
| | | 1159 | | if (classified != Vector128<byte>.Zero) |
| | | 1160 | | { |
| | | 1161 | | break; |
| | | 1162 | | } |
| | | 1163 | | |
| | | 1164 | | // Step 5: Compress four bytes into three. |
| | | 1165 | | Vector128<byte> res1 = ((str1 << 2) | (str2 >> 4)); |
| | | 1166 | | Vector128<byte> res2 = ((str2 << 4) | (str3 >> 2)); |
| | | 1167 | | Vector128<byte> res3 = ((str3 << 6) | str4); |
| | | 1168 | | |
| | | 1169 | | // Step 6: Interleave and store decoded results. |
| | | 1170 | | AssertWrite<Vector128<byte>>(dest, destStart, destLength); |
| | | 1171 | | AdvSimd.Arm64.StoreVectorAndZip(dest, (res1, res2, res3)); |
| | | 1172 | | |
| | | 1173 | | src += 64; |
| | | 1174 | | dest += 48; |
| | | 1175 | | } |
| | | 1176 | | while (src <= srcEnd); |
| | | 1177 | | |
| | | 1178 | | srcBytes = src; |
| | | 1179 | | destBytes = dest; |
| | | 1180 | | } |
| | | 1181 | | |
| | | 1182 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1183 | | [CompExactlyDependsOn(typeof(AdvSimd.Arm64))] |
| | | 1184 | | [CompExactlyDependsOn(typeof(Ssse3))] |
| | | 1185 | | [CompExactlyDependsOn(typeof(PackedSimd))] |
| | | 1186 | | [SuppressReadyToRunCanonicalRooting] |
| | | 1187 | | private static unsafe void Vector128Decode<TBase64Decoder, T>(TBase64Decoder decoder, ref T* srcBytes, ref byte* |
| | | 1188 | | where TBase64Decoder : IBase64Decoder<T> |
| | | 1189 | | where T : unmanaged |
| | | 1190 | | { |
| | | 1191 | | Debug.Assert((Ssse3.IsSupported || AdvSimd.Arm64.IsSupported || PackedSimd.IsSupported) && BitConverter.IsLi |
| | | 1192 | | |
| | | 1193 | | // If we have Vector128 support, pick off 16 bytes at a time for as long as we can, |
| | | 1194 | | // but make sure that we quit before seeing any == markers at the end of the |
| | | 1195 | | // string. Also, because we write four zeroes at the end of the output, ensure |
| | | 1196 | | // that there are at least 6 valid bytes of input data remaining to close the |
| | | 1197 | | // gap. 16 + 2 + 6 = 24 bytes. |
| | | 1198 | | |
| | | 1199 | | // The input consists of six character sets in the Base64 alphabet, |
| | | 1200 | | // which we need to map back to the 6-bit values they represent. |
| | | 1201 | | // There are three ranges, two singles, and then there's the rest. |
| | | 1202 | | // |
| | | 1203 | | // # From To Add Characters |
| | | 1204 | | // 1 [43] [62] +19 + |
| | | 1205 | | // 2 [47] [63] +16 / |
| | | 1206 | | // 3 [48..57] [52..61] +4 0..9 |
| | | 1207 | | // 4 [65..90] [0..25] -65 A..Z |
| | | 1208 | | // 5 [97..122] [26..51] -71 a..z |
| | | 1209 | | // (6) Everything else => invalid input |
| | | 1210 | | |
| | | 1211 | | // We will use LUTS for character validation & offset computation |
| | | 1212 | | // Remember that 0x2X and 0x0X are the same index for _mm_shuffle_epi8, |
| | | 1213 | | // this allows to mask with 0x2F instead of 0x0F and thus save one constant declaration (register and/or mem |
| | | 1214 | | |
| | | 1215 | | // For offsets: |
| | | 1216 | | // Perfect hash for lut = ((src>>4)&0x2F)+((src==0x2F)?0xFF:0x00) |
| | | 1217 | | // 0000 = garbage |
| | | 1218 | | // 0001 = / |
| | | 1219 | | // 0010 = + |
| | | 1220 | | // 0011 = 0-9 |
| | | 1221 | | // 0100 = A-Z |
| | | 1222 | | // 0101 = A-Z |
| | | 1223 | | // 0110 = a-z |
| | | 1224 | | // 0111 = a-z |
| | | 1225 | | // 1000 >= garbage |
| | | 1226 | | |
| | | 1227 | | // For validation, here's the table. |
| | | 1228 | | // A character is valid if and only if the AND of the 2 lookups equals 0: |
| | | 1229 | | |
| | | 1230 | | // hi \ lo 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 |
| | | 1231 | | // LUT 0x15 0x11 0x11 0x11 0x11 0x11 0x11 0x11 0x11 0x11 0x13 0x1A 0x1B 0x1B 0x1B 0x1A |
| | | 1232 | | |
| | | 1233 | | // 0000 0X10 char NUL SOH STX ETX EOT ENQ ACK BEL BS HT LF VT FF CR SO SI |
| | | 1234 | | // andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1235 | | |
| | | 1236 | | // 0001 0x10 char DLE DC1 DC2 DC3 DC4 NAK SYN ETB CAN EM SUB ESC FS GS RS US |
| | | 1237 | | // andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1238 | | |
| | | 1239 | | // 0010 0x01 char ! " # $ % & ' ( ) * + , - . / |
| | | 1240 | | // andlut 0x01 0x01 0x01 0x01 0x01 0x01 0x01 0x01 0x01 0x01 0x01 0x00 0x01 0x01 0x01 0x00 |
| | | 1241 | | |
| | | 1242 | | // 0011 0x02 char 0 1 2 3 4 5 6 7 8 9 : ; < = > ? |
| | | 1243 | | // andlut 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x02 0x02 0x02 0x02 0x02 0x02 |
| | | 1244 | | |
| | | 1245 | | // 0100 0x04 char @ A B C D E F G H I J K L M N 0 |
| | | 1246 | | // andlut 0x04 0x00 0x00 0x00 0X00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 |
| | | 1247 | | |
| | | 1248 | | // 0101 0x08 char P Q R S T U V W X Y Z [ \ ] ^ _ |
| | | 1249 | | // andlut 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x08 0x08 0x08 0x08 0x08 |
| | | 1250 | | |
| | | 1251 | | // 0110 0x04 char ` a b c d e f g h i j k l m n o |
| | | 1252 | | // andlut 0x04 0x00 0x00 0x00 0X00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 |
| | | 1253 | | // 0111 0X08 char p q r s t u v w x y z { | } ~ |
| | | 1254 | | // andlut 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x08 0x08 0x08 0x08 0x08 |
| | | 1255 | | |
| | | 1256 | | // 1000 0x10 andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1257 | | // 1001 0x10 andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1258 | | // 1010 0x10 andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1259 | | // 1011 0x10 andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1260 | | // 1100 0x10 andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1261 | | // 1101 0x10 andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1262 | | // 1110 0x10 andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1263 | | // 1111 0x10 andlut 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 0x10 |
| | | 1264 | | |
| | | 1265 | | // The JIT won't hoist these "constants", so help it |
| | 0 | 1266 | | Vector128<byte> lutHi = Vector128.Create(decoder.Vector128LutHigh).AsByte(); |
| | 0 | 1267 | | Vector128<byte> lutLo = Vector128.Create(decoder.Vector128LutLow).AsByte(); |
| | 0 | 1268 | | Vector128<sbyte> lutShift = Vector128.Create(decoder.Vector128LutShift).AsSByte(); |
| | 0 | 1269 | | Vector128<sbyte> packBytesMask = Vector128.Create(0x06000102, 0x090A0405, 0x0C0D0E08, 0xffffffff).AsSByte(); |
| | 0 | 1270 | | Vector128<byte> mergeConstant0 = Vector128.Create(0x01400140).AsByte(); |
| | 0 | 1271 | | Vector128<short> mergeConstant1 = Vector128.Create(0x00011000).AsInt16(); |
| | 0 | 1272 | | Vector128<byte> one = Vector128<byte>.One; |
| | 0 | 1273 | | Vector128<byte> mask2F = Vector128.Create(decoder.MaskSlashOrUnderscore); |
| | 0 | 1274 | | Vector128<byte> mask8F = Vector128.Create((byte)0x8F); |
| | 0 | 1275 | | Vector128<byte> shiftForUnderscore = Vector128.Create((byte)33); |
| | 0 | 1276 | | T* src = srcBytes; |
| | 0 | 1277 | | byte* dest = destBytes; |
| | | 1278 | | |
| | | 1279 | | //while (remaining >= 24) |
| | | 1280 | | do |
| | | 1281 | | { |
| | 0 | 1282 | | if (!decoder.TryLoadVector128(src, srcStart, sourceLength, out Vector128<byte> str)) |
| | | 1283 | | { |
| | | 1284 | | break; |
| | | 1285 | | } |
| | | 1286 | | |
| | | 1287 | | // lookup |
| | 0 | 1288 | | Vector128<byte> hiNibbles = Vector128.ShiftRightLogical(str.AsInt32(), 4).AsByte() & mask2F; |
| | | 1289 | | |
| | 0 | 1290 | | if (!decoder.TryDecode128Core(str, hiNibbles, mask2F, mask8F, lutLo, lutHi, lutShift, shiftForUnderscore |
| | | 1291 | | { |
| | | 1292 | | break; |
| | | 1293 | | } |
| | | 1294 | | |
| | | 1295 | | // in, bits, upper case are most significant bits, lower case are least significant bits |
| | | 1296 | | // 00llllll 00kkkkLL 00jjKKKK 00JJJJJJ |
| | | 1297 | | // 00iiiiii 00hhhhII 00ggHHHH 00GGGGGG |
| | | 1298 | | // 00ffffff 00eeeeFF 00ddEEEE 00DDDDDD |
| | | 1299 | | // 00cccccc 00bbbbCC 00aaBBBB 00AAAAAA |
| | | 1300 | | |
| | | 1301 | | Vector128<short> merge_ab_and_bc; |
| | 0 | 1302 | | if (Ssse3.IsSupported) |
| | | 1303 | | { |
| | 0 | 1304 | | merge_ab_and_bc = Ssse3.MultiplyAddAdjacent(str.AsByte(), mergeConstant0.AsSByte()); |
| | | 1305 | | } |
| | | 1306 | | else if (AdvSimd.Arm64.IsSupported) |
| | | 1307 | | { |
| | | 1308 | | Vector128<ushort> evens = AdvSimd.ShiftLeftLogicalWideningLower(AdvSimd.Arm64.UnzipEven(str, one).Ge |
| | | 1309 | | Vector128<ushort> odds = AdvSimd.Arm64.TransposeOdd(str, Vector128<byte>.Zero).AsUInt16(); |
| | | 1310 | | merge_ab_and_bc = Vector128.Add(evens, odds).AsInt16(); |
| | | 1311 | | } |
| | | 1312 | | else if (PackedSimd.IsSupported) |
| | | 1313 | | { |
| | | 1314 | | // MultiplyAddAdjacent by {64,1,...} is the even byte (low of each u16 lane) times 64 plus the odd b |
| | | 1315 | | Vector128<ushort> u = str.AsUInt16(); |
| | | 1316 | | Vector128<ushort> evens = Vector128.ShiftLeft(u & Vector128.Create((ushort)0x00FF), 6); |
| | | 1317 | | Vector128<ushort> odds = Vector128.ShiftRightLogical(u, 8); |
| | | 1318 | | merge_ab_and_bc = (evens + odds).AsInt16(); |
| | | 1319 | | } |
| | | 1320 | | else |
| | | 1321 | | { |
| | | 1322 | | // We explicitly recheck each IsSupported query to ensure that the trimmer can see which paths are l |
| | 0 | 1323 | | ThrowUnreachableException(); |
| | | 1324 | | merge_ab_and_bc = default; |
| | | 1325 | | } |
| | | 1326 | | // 0000kkkk LLllllll 0000JJJJ JJjjKKKK |
| | | 1327 | | // 0000hhhh IIiiiiii 0000GGGG GGggHHHH |
| | | 1328 | | // 0000eeee FFffffff 0000DDDD DDddEEEE |
| | | 1329 | | // 0000bbbb CCcccccc 0000AAAA AAaaBBBB |
| | | 1330 | | |
| | | 1331 | | Vector128<int> output; |
| | 0 | 1332 | | if (Ssse3.IsSupported) |
| | | 1333 | | { |
| | 0 | 1334 | | output = Sse2.MultiplyAddAdjacent(merge_ab_and_bc, mergeConstant1); |
| | | 1335 | | } |
| | | 1336 | | else if (AdvSimd.Arm64.IsSupported) |
| | | 1337 | | { |
| | | 1338 | | Vector128<int> ievens = AdvSimd.ShiftLeftLogicalWideningLower(AdvSimd.Arm64.UnzipEven(merge_ab_and_b |
| | | 1339 | | Vector128<int> iodds = AdvSimd.Arm64.TransposeOdd(merge_ab_and_bc, Vector128<short>.Zero).AsInt32(); |
| | | 1340 | | output = Vector128.Add(ievens, iodds).AsInt32(); |
| | | 1341 | | } |
| | | 1342 | | else if (PackedSimd.IsSupported) |
| | | 1343 | | { |
| | | 1344 | | // MultiplyAddAdjacent by {4096,1,...} is the even i16 (low of each i32 lane) times 4096 plus the od |
| | | 1345 | | Vector128<uint> m = merge_ab_and_bc.AsUInt32(); |
| | | 1346 | | Vector128<uint> ievens = Vector128.ShiftLeft(m & Vector128.Create(0x0000FFFFu), 12); |
| | | 1347 | | Vector128<uint> iodds = Vector128.ShiftRightLogical(m, 16); |
| | | 1348 | | output = (ievens + iodds).AsInt32(); |
| | | 1349 | | } |
| | | 1350 | | else |
| | | 1351 | | { |
| | | 1352 | | // We explicitly recheck each IsSupported query to ensure that the trimmer can see which paths are l |
| | 0 | 1353 | | ThrowUnreachableException(); |
| | | 1354 | | output = default; |
| | | 1355 | | } |
| | | 1356 | | // 00000000 JJJJJJjj KKKKkkkk LLllllll |
| | | 1357 | | // 00000000 GGGGGGgg HHHHhhhh IIiiiiii |
| | | 1358 | | // 00000000 DDDDDDdd EEEEeeee FFffffff |
| | | 1359 | | // 00000000 AAAAAAaa BBBBbbbb CCcccccc |
| | | 1360 | | |
| | | 1361 | | // Pack bytes together: |
| | 0 | 1362 | | str = SimdShuffle(output.AsByte(), packBytesMask.AsByte(), mask8F); |
| | | 1363 | | // 00000000 00000000 00000000 00000000 |
| | | 1364 | | // LLllllll KKKKkkkk JJJJJJjj IIiiiiii |
| | | 1365 | | // HHHHhhhh GGGGGGgg FFffffff EEEEeeee |
| | | 1366 | | // DDDDDDdd CCcccccc BBBBbbbb AAAAAAaa |
| | | 1367 | | |
| | 0 | 1368 | | AssertWrite<Vector128<sbyte>>(dest, destStart, destLength); |
| | 0 | 1369 | | str.Store(dest); |
| | | 1370 | | |
| | 0 | 1371 | | src += 16; |
| | 0 | 1372 | | dest += 12; |
| | | 1373 | | } |
| | 0 | 1374 | | while (src <= srcEnd); |
| | | 1375 | | |
| | 0 | 1376 | | srcBytes = src; |
| | 0 | 1377 | | destBytes = dest; |
| | 0 | 1378 | | } |
| | | 1379 | | #endif |
| | | 1380 | | |
| | | 1381 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1382 | | private static unsafe void WriteThreeLowOrderBytes(byte* destination, int value) |
| | | 1383 | | { |
| | 0 | 1384 | | destination[0] = (byte)(value >> 16); |
| | 0 | 1385 | | destination[1] = (byte)(value >> 8); |
| | 0 | 1386 | | destination[2] = (byte)value; |
| | 0 | 1387 | | } |
| | | 1388 | | |
| | | 1389 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1390 | | internal static bool IsWhiteSpace(int value) |
| | | 1391 | | { |
| | 0 | 1392 | | Debug.Assert(value >= 0 && value <= ushort.MaxValue); |
| | | 1393 | | uint charMinusLowUInt32; |
| | 0 | 1394 | | return (int)((0xC8000100U << (short)(charMinusLowUInt32 = (ushort)(value - '\t'))) & (charMinusLowUInt32 - 3 |
| | | 1395 | | } |
| | | 1396 | | |
| | | 1397 | | internal readonly struct Base64DecoderByte : IBase64Decoder<byte> |
| | | 1398 | | { |
| | | 1399 | | // Pre-computing this table using a custom string(s_characters) and GenerateDecodingMapAndVerify (found in t |
| | | 1400 | | public ReadOnlySpan<sbyte> DecodingMap => |
| | 0 | 1401 | | [ |
| | 0 | 1402 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| | 0 | 1403 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| | 0 | 1404 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63, //62 is placed at index 43 ( |
| | 0 | 1405 | | 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1, //52-61 are placed at index |
| | 0 | 1406 | | -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, |
| | 0 | 1407 | | 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, //0-25 are placed at index 6 |
| | 0 | 1408 | | -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, |
| | 0 | 1409 | | 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1, //26-51 are placed at index |
| | 0 | 1410 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // Bytes over 122 ('z') are |
| | 0 | 1411 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // Hence, padding the map wi |
| | 0 | 1412 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| | 0 | 1413 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| | 0 | 1414 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| | 0 | 1415 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| | 0 | 1416 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| | 0 | 1417 | | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| | 0 | 1418 | | ]; |
| | | 1419 | | |
| | | 1420 | | public ReadOnlySpan<uint> VbmiLookup0 => |
| | 0 | 1421 | | [ |
| | 0 | 1422 | | 0x80808080, 0x80808080, 0x80808080, 0x80808080, |
| | 0 | 1423 | | 0x80808080, 0x80808080, 0x80808080, 0x80808080, |
| | 0 | 1424 | | 0x80808080, 0x80808080, 0x3e808080, 0x3f808080, |
| | 0 | 1425 | | 0x37363534, 0x3b3a3938, 0x80803d3c, 0x80808080 |
| | 0 | 1426 | | ]; |
| | | 1427 | | |
| | | 1428 | | public ReadOnlySpan<uint> VbmiLookup1 => |
| | 0 | 1429 | | [ |
| | 0 | 1430 | | 0x02010080, 0x06050403, 0x0a090807, 0x0e0d0c0b, |
| | 0 | 1431 | | 0x1211100f, 0x16151413, 0x80191817, 0x80808080, |
| | 0 | 1432 | | 0x1c1b1a80, 0x201f1e1d, 0x24232221, 0x28272625, |
| | 0 | 1433 | | 0x2c2b2a29, 0x302f2e2d, 0x80333231, 0x80808080 |
| | 0 | 1434 | | ]; |
| | | 1435 | | |
| | | 1436 | | public ReadOnlySpan<sbyte> Avx2LutHigh => |
| | 0 | 1437 | | [ |
| | 0 | 1438 | | 0x10, 0x10, 0x01, 0x02, |
| | 0 | 1439 | | 0x04, 0x08, 0x04, 0x08, |
| | 0 | 1440 | | 0x10, 0x10, 0x10, 0x10, |
| | 0 | 1441 | | 0x10, 0x10, 0x10, 0x10, |
| | 0 | 1442 | | 0x10, 0x10, 0x01, 0x02, |
| | 0 | 1443 | | 0x04, 0x08, 0x04, 0x08, |
| | 0 | 1444 | | 0x10, 0x10, 0x10, 0x10, |
| | 0 | 1445 | | 0x10, 0x10, 0x10, 0x10 |
| | 0 | 1446 | | ]; |
| | | 1447 | | |
| | | 1448 | | public ReadOnlySpan<sbyte> Avx2LutLow => |
| | 0 | 1449 | | [ |
| | 0 | 1450 | | 0x15, 0x11, 0x11, 0x11, |
| | 0 | 1451 | | 0x11, 0x11, 0x11, 0x11, |
| | 0 | 1452 | | 0x11, 0x11, 0x13, 0x1A, |
| | 0 | 1453 | | 0x1B, 0x1B, 0x1B, 0x1A, |
| | 0 | 1454 | | 0x15, 0x11, 0x11, 0x11, |
| | 0 | 1455 | | 0x11, 0x11, 0x11, 0x11, |
| | 0 | 1456 | | 0x11, 0x11, 0x13, 0x1A, |
| | 0 | 1457 | | 0x1B, 0x1B, 0x1B, 0x1A |
| | 0 | 1458 | | ]; |
| | | 1459 | | |
| | | 1460 | | public ReadOnlySpan<sbyte> Avx2LutShift => |
| | 0 | 1461 | | [ |
| | 0 | 1462 | | 0, 16, 19, 4, |
| | 0 | 1463 | | -65, -65, -71, -71, |
| | 0 | 1464 | | 0, 0, 0, 0, |
| | 0 | 1465 | | 0, 0, 0, 0, |
| | 0 | 1466 | | 0, 16, 19, 4, |
| | 0 | 1467 | | -65, -65, -71, -71, |
| | 0 | 1468 | | 0, 0, 0, 0, |
| | 0 | 1469 | | 0, 0, 0, 0 |
| | 0 | 1470 | | ]; |
| | | 1471 | | |
| | 0 | 1472 | | public byte MaskSlashOrUnderscore => (byte)'/'; |
| | | 1473 | | |
| | 0 | 1474 | | public ReadOnlySpan<int> Vector128LutHigh => [0x02011010, 0x08040804, 0x10101010, 0x10101010]; |
| | | 1475 | | |
| | 0 | 1476 | | public ReadOnlySpan<int> Vector128LutLow => [0x11111115, 0x11111111, 0x1A131111, 0x1A1B1B1B]; |
| | | 1477 | | |
| | 0 | 1478 | | public ReadOnlySpan<uint> Vector128LutShift => [0x04131000, 0xb9b9bfbf, 0x00000000, 0x00000000]; |
| | | 1479 | | |
| | 0 | 1480 | | public ReadOnlySpan<uint> AdvSimdLutOne3 => [0xFFFFFFFF, 0xFFFFFFFF, 0x3EFFFFFF, 0x3FFFFFFF]; |
| | | 1481 | | |
| | 0 | 1482 | | public uint AdvSimdLutTwo3Uint1 => 0x1B1AFFFF; |
| | | 1483 | | |
| | 0 | 1484 | | public int GetMaxDecodedLength(int utf8Length) => Base64.GetMaxDecodedFromUtf8Length(utf8Length); |
| | | 1485 | | |
| | 0 | 1486 | | public bool IsInvalidLength(int bufferLength) => bufferLength % 4 != 0; // only decode input if it is a mult |
| | | 1487 | | |
| | 0 | 1488 | | public bool IsValidPadding(uint padChar) => padChar == EncodingPad; |
| | | 1489 | | |
| | 0 | 1490 | | public int SrcLength(bool _, int utf8Length) => utf8Length & ~0x3; // only decode input up to the closest m |
| | | 1491 | | |
| | | 1492 | | #if NET |
| | | 1493 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1494 | | [CompExactlyDependsOn(typeof(AdvSimd.Arm64))] |
| | | 1495 | | [CompExactlyDependsOn(typeof(Ssse3))] |
| | | 1496 | | [CompExactlyDependsOn(typeof(PackedSimd))] |
| | | 1497 | | public bool TryDecode128Core( |
| | | 1498 | | Vector128<byte> str, |
| | | 1499 | | Vector128<byte> hiNibbles, |
| | | 1500 | | Vector128<byte> maskSlashOrUnderscore, |
| | | 1501 | | Vector128<byte> mask8F, |
| | | 1502 | | Vector128<byte> lutLow, |
| | | 1503 | | Vector128<byte> lutHigh, |
| | | 1504 | | Vector128<sbyte> lutShift, |
| | | 1505 | | Vector128<byte> _, |
| | | 1506 | | out Vector128<byte> result) |
| | | 1507 | | { |
| | 0 | 1508 | | Vector128<byte> loNibbles = str & maskSlashOrUnderscore; |
| | 0 | 1509 | | Vector128<byte> hi = SimdShuffle(lutHigh, hiNibbles, mask8F); |
| | 0 | 1510 | | Vector128<byte> lo = SimdShuffle(lutLow, loNibbles, mask8F); |
| | | 1511 | | |
| | | 1512 | | // Check for invalid input: if any "and" values from lo and hi are not zero, |
| | | 1513 | | // fall back on bytewise code to do error checking and reporting: |
| | 0 | 1514 | | if ((lo & hi) != Vector128<byte>.Zero) |
| | | 1515 | | { |
| | 0 | 1516 | | result = default; |
| | 0 | 1517 | | return false; |
| | | 1518 | | } |
| | | 1519 | | |
| | 0 | 1520 | | Vector128<byte> eq2F = Vector128.Equals(str, maskSlashOrUnderscore); |
| | 0 | 1521 | | Vector128<byte> shift = SimdShuffle(lutShift.AsByte(), (eq2F + hiNibbles), mask8F); |
| | | 1522 | | |
| | | 1523 | | // Now simply add the delta values to the input: |
| | 0 | 1524 | | result = str + shift; |
| | | 1525 | | |
| | 0 | 1526 | | return true; |
| | | 1527 | | } |
| | | 1528 | | |
| | | 1529 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1530 | | [CompExactlyDependsOn(typeof(Avx2))] |
| | | 1531 | | public bool TryDecode256Core( |
| | | 1532 | | Vector256<sbyte> str, |
| | | 1533 | | Vector256<sbyte> hiNibbles, |
| | | 1534 | | Vector256<sbyte> maskSlashOrUnderscore, |
| | | 1535 | | Vector256<sbyte> lutLow, |
| | | 1536 | | Vector256<sbyte> lutHigh, |
| | | 1537 | | Vector256<sbyte> lutShift, |
| | | 1538 | | Vector256<sbyte> _, |
| | | 1539 | | out Vector256<sbyte> result) |
| | | 1540 | | { |
| | 0 | 1541 | | Vector256<sbyte> loNibbles = str & maskSlashOrUnderscore; |
| | 0 | 1542 | | Vector256<sbyte> hi = Avx2.Shuffle(lutHigh, hiNibbles); |
| | 0 | 1543 | | Vector256<sbyte> lo = Avx2.Shuffle(lutLow, loNibbles); |
| | | 1544 | | |
| | 0 | 1545 | | if ((lo & hi) != Vector256<sbyte>.Zero) |
| | | 1546 | | { |
| | 0 | 1547 | | result = default; |
| | 0 | 1548 | | return false; |
| | | 1549 | | } |
| | | 1550 | | |
| | 0 | 1551 | | Vector256<sbyte> eq2F = Avx2.CompareEqual(str, maskSlashOrUnderscore); |
| | 0 | 1552 | | Vector256<sbyte> shift = Avx2.Shuffle(lutShift, eq2F + hiNibbles); |
| | | 1553 | | |
| | 0 | 1554 | | result = str + shift; |
| | | 1555 | | |
| | 0 | 1556 | | return true; |
| | | 1557 | | } |
| | | 1558 | | |
| | | 1559 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1560 | | public unsafe bool TryLoadVector512(byte* src, byte* srcStart, int sourceLength, out Vector512<sbyte> str) |
| | | 1561 | | { |
| | 0 | 1562 | | AssertRead<Vector512<sbyte>>(src, srcStart, sourceLength); |
| | 0 | 1563 | | str = Vector512.Load(src).AsSByte(); |
| | 0 | 1564 | | return true; |
| | | 1565 | | } |
| | | 1566 | | |
| | | 1567 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1568 | | [CompExactlyDependsOn(typeof(Avx2))] |
| | | 1569 | | public unsafe bool TryLoadAvxVector256(byte* src, byte* srcStart, int sourceLength, out Vector256<sbyte> str |
| | | 1570 | | { |
| | 0 | 1571 | | AssertRead<Vector256<sbyte>>(src, srcStart, sourceLength); |
| | 0 | 1572 | | str = Avx.LoadVector256(src).AsSByte(); |
| | 0 | 1573 | | return true; |
| | | 1574 | | } |
| | | 1575 | | |
| | | 1576 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1577 | | public unsafe bool TryLoadVector128(byte* src, byte* srcStart, int sourceLength, out Vector128<byte> str) |
| | | 1578 | | { |
| | 0 | 1579 | | AssertRead<Vector128<sbyte>>(src, srcStart, sourceLength); |
| | 0 | 1580 | | str = Vector128.LoadUnsafe(ref *src); |
| | 0 | 1581 | | return true; |
| | | 1582 | | } |
| | | 1583 | | |
| | | 1584 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1585 | | [CompExactlyDependsOn(typeof(AdvSimd.Arm64))] |
| | | 1586 | | public unsafe bool TryLoadArmVector128x4(byte* src, byte* srcStart, int sourceLength, |
| | | 1587 | | out Vector128<byte> str1, out Vector128<byte> str2, out Vector128<byte> str3, out Vector128<byte> str4) |
| | | 1588 | | { |
| | 0 | 1589 | | AssertRead<Vector128<byte>>(src, srcStart, sourceLength); |
| | 0 | 1590 | | (str1, str2, str3, str4) = AdvSimd.Arm64.Load4xVector128AndUnzip(src); |
| | | 1591 | | |
| | 0 | 1592 | | return true; |
| | | 1593 | | } |
| | | 1594 | | #endif // NET |
| | | 1595 | | |
| | | 1596 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1597 | | public unsafe int DecodeFourElements(byte* source, ref sbyte decodingMap) |
| | | 1598 | | { |
| | | 1599 | | // The 'source' span expected to have at least 4 elements, and the 'decodingMap' consists 256 sbytes |
| | 0 | 1600 | | uint t0 = source[0]; |
| | 0 | 1601 | | uint t1 = source[1]; |
| | 0 | 1602 | | uint t2 = source[2]; |
| | 0 | 1603 | | uint t3 = source[3]; |
| | | 1604 | | |
| | 0 | 1605 | | int i0 = Unsafe.Add(ref decodingMap, (int)t0); |
| | 0 | 1606 | | int i1 = Unsafe.Add(ref decodingMap, (int)t1); |
| | 0 | 1607 | | int i2 = Unsafe.Add(ref decodingMap, (int)t2); |
| | 0 | 1608 | | int i3 = Unsafe.Add(ref decodingMap, (int)t3); |
| | | 1609 | | |
| | 0 | 1610 | | i0 <<= 18; |
| | 0 | 1611 | | i1 <<= 12; |
| | 0 | 1612 | | i2 <<= 6; |
| | | 1613 | | |
| | 0 | 1614 | | i0 |= i3; |
| | 0 | 1615 | | i1 |= i2; |
| | | 1616 | | |
| | 0 | 1617 | | i0 |= i1; |
| | 0 | 1618 | | return i0; |
| | | 1619 | | } |
| | | 1620 | | |
| | | 1621 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1622 | | public unsafe int DecodeRemaining(byte* srcEnd, ref sbyte decodingMap, long remaining, out uint t2, out uint |
| | | 1623 | | { |
| | | 1624 | | uint t0; |
| | | 1625 | | uint t1; |
| | 0 | 1626 | | t2 = EncodingPad; |
| | 0 | 1627 | | t3 = EncodingPad; |
| | | 1628 | | switch (remaining) |
| | | 1629 | | { |
| | | 1630 | | case 2: |
| | 0 | 1631 | | t0 = srcEnd[-2]; |
| | 0 | 1632 | | t1 = srcEnd[-1]; |
| | 0 | 1633 | | break; |
| | | 1634 | | case 3: |
| | 0 | 1635 | | t0 = srcEnd[-3]; |
| | 0 | 1636 | | t1 = srcEnd[-2]; |
| | 0 | 1637 | | t2 = srcEnd[-1]; |
| | 0 | 1638 | | break; |
| | | 1639 | | case 4: |
| | 0 | 1640 | | t0 = srcEnd[-4]; |
| | 0 | 1641 | | t1 = srcEnd[-3]; |
| | 0 | 1642 | | t2 = srcEnd[-2]; |
| | 0 | 1643 | | t3 = srcEnd[-1]; |
| | 0 | 1644 | | break; |
| | | 1645 | | default: |
| | 0 | 1646 | | return -1; |
| | | 1647 | | } |
| | | 1648 | | |
| | 0 | 1649 | | int i0 = Unsafe.Add(ref decodingMap, (IntPtr)t0); |
| | 0 | 1650 | | int i1 = Unsafe.Add(ref decodingMap, (IntPtr)t1); |
| | | 1651 | | |
| | 0 | 1652 | | i0 <<= 18; |
| | 0 | 1653 | | i1 <<= 12; |
| | | 1654 | | |
| | 0 | 1655 | | i0 |= i1; |
| | 0 | 1656 | | return i0; |
| | | 1657 | | } |
| | | 1658 | | |
| | | 1659 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1660 | | public int IndexOfAnyExceptWhiteSpace(ReadOnlySpan<byte> span) |
| | | 1661 | | { |
| | 0 | 1662 | | for (int i = 0; i < span.Length; i++) |
| | | 1663 | | { |
| | 0 | 1664 | | if (!IsWhiteSpace(span[i])) |
| | | 1665 | | { |
| | 0 | 1666 | | return i; |
| | | 1667 | | } |
| | | 1668 | | } |
| | | 1669 | | |
| | 0 | 1670 | | return -1; |
| | | 1671 | | } |
| | | 1672 | | |
| | | 1673 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1674 | | [SuppressReadyToRunCanonicalRooting] |
| | | 1675 | | public OperationStatus DecodeWithWhiteSpaceBlockwiseWrapper<TBase64Decoder>(TBase64Decoder decoder, ReadOnly |
| | | 1676 | | Span<byte> bytes, ref int bytesConsumed, ref int bytesWritten, bool isFinalBlock = true) |
| | | 1677 | | where TBase64Decoder : IBase64Decoder<byte> => |
| | 0 | 1678 | | DecodeWithWhiteSpaceBlockwise(decoder, utf8, bytes, ref bytesConsumed, ref bytesWritten, isFinalBlock); |
| | | 1679 | | } |
| | | 1680 | | |
| | | 1681 | | internal readonly struct Base64DecoderChar : IBase64Decoder<ushort> |
| | | 1682 | | { |
| | 0 | 1683 | | public ReadOnlySpan<sbyte> DecodingMap => default(Base64DecoderByte).DecodingMap; |
| | | 1684 | | |
| | 0 | 1685 | | public ReadOnlySpan<uint> VbmiLookup0 => default(Base64DecoderByte).VbmiLookup0; |
| | | 1686 | | |
| | 0 | 1687 | | public ReadOnlySpan<uint> VbmiLookup1 => default(Base64DecoderByte).VbmiLookup1; |
| | | 1688 | | |
| | 0 | 1689 | | public ReadOnlySpan<sbyte> Avx2LutHigh => default(Base64DecoderByte).Avx2LutHigh; |
| | | 1690 | | |
| | 0 | 1691 | | public ReadOnlySpan<sbyte> Avx2LutLow => default(Base64DecoderByte).Avx2LutLow; |
| | | 1692 | | |
| | 0 | 1693 | | public ReadOnlySpan<sbyte> Avx2LutShift => default(Base64DecoderByte).Avx2LutShift; |
| | | 1694 | | |
| | 0 | 1695 | | public byte MaskSlashOrUnderscore => default(Base64DecoderByte).MaskSlashOrUnderscore; |
| | | 1696 | | |
| | 0 | 1697 | | public ReadOnlySpan<int> Vector128LutHigh => default(Base64DecoderByte).Vector128LutHigh; |
| | | 1698 | | |
| | 0 | 1699 | | public ReadOnlySpan<int> Vector128LutLow => default(Base64DecoderByte).Vector128LutLow; |
| | | 1700 | | |
| | 0 | 1701 | | public ReadOnlySpan<uint> Vector128LutShift => default(Base64DecoderByte).Vector128LutShift; |
| | | 1702 | | |
| | 0 | 1703 | | public ReadOnlySpan<uint> AdvSimdLutOne3 => default(Base64DecoderByte).AdvSimdLutOne3; |
| | | 1704 | | |
| | 0 | 1705 | | public uint AdvSimdLutTwo3Uint1 => default(Base64DecoderByte).AdvSimdLutTwo3Uint1; |
| | | 1706 | | |
| | 0 | 1707 | | public int GetMaxDecodedLength(int sourceLength) => Base64.GetMaxDecodedFromUtf8Length(sourceLength); |
| | | 1708 | | |
| | 0 | 1709 | | public bool IsInvalidLength(int bufferLength) => bufferLength % 4 != 0; |
| | | 1710 | | |
| | 0 | 1711 | | public bool IsValidPadding(uint padChar) => padChar == EncodingPad; |
| | | 1712 | | |
| | 0 | 1713 | | public int SrcLength(bool _, int sourceLength) => sourceLength & ~0x3; |
| | | 1714 | | |
| | | 1715 | | #if NET |
| | | 1716 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1717 | | [CompExactlyDependsOn(typeof(AdvSimd.Arm64))] |
| | | 1718 | | [CompExactlyDependsOn(typeof(Ssse3))] |
| | | 1719 | | [CompExactlyDependsOn(typeof(PackedSimd))] |
| | | 1720 | | public bool TryDecode128Core(Vector128<byte> str, Vector128<byte> hiNibbles, Vector128<byte> maskSlashOrUnde |
| | | 1721 | | Vector128<byte> lutLow, Vector128<byte> lutHigh, Vector128<sbyte> lutShift, Vector128<byte> shiftForUnde |
| | 0 | 1722 | | default(Base64DecoderByte).TryDecode128Core(str, hiNibbles, maskSlashOrUnderscore, mask8F, lutLow, lutHi |
| | | 1723 | | |
| | | 1724 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1725 | | [CompExactlyDependsOn(typeof(Avx2))] |
| | | 1726 | | public bool TryDecode256Core(Vector256<sbyte> str, Vector256<sbyte> hiNibbles, Vector256<sbyte> maskSlashOrU |
| | | 1727 | | Vector256<sbyte> lutHigh, Vector256<sbyte> lutShift, Vector256<sbyte> shiftForUnderscore, out Vector256< |
| | 0 | 1728 | | default(Base64DecoderByte).TryDecode256Core(str, hiNibbles, maskSlashOrUnderscore, lutLow, lutHigh, lutS |
| | | 1729 | | |
| | | 1730 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1731 | | public unsafe bool TryLoadVector512(ushort* src, ushort* srcStart, int sourceLength, out Vector512<sbyte> st |
| | | 1732 | | { |
| | 0 | 1733 | | AssertRead<Vector512<ushort>>(src, srcStart, sourceLength); |
| | 0 | 1734 | | Vector512<ushort> utf16VectorLower = Vector512.Load(src); |
| | 0 | 1735 | | Vector512<ushort> utf16VectorUpper = Vector512.Load(src + 32); |
| | 0 | 1736 | | if (Ascii.VectorContainsNonAsciiChar(utf16VectorLower | utf16VectorUpper)) |
| | | 1737 | | { |
| | 0 | 1738 | | str = default; |
| | 0 | 1739 | | return false; |
| | | 1740 | | } |
| | | 1741 | | |
| | 0 | 1742 | | str = Ascii.ExtractAsciiVector(utf16VectorLower, utf16VectorUpper).AsSByte(); |
| | 0 | 1743 | | return true; |
| | | 1744 | | } |
| | | 1745 | | |
| | | 1746 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1747 | | [CompExactlyDependsOn(typeof(Avx2))] |
| | | 1748 | | public unsafe bool TryLoadAvxVector256(ushort* src, ushort* srcStart, int sourceLength, out Vector256<sbyte> |
| | | 1749 | | { |
| | 0 | 1750 | | AssertRead<Vector256<sbyte>>(src, srcStart, sourceLength); |
| | 0 | 1751 | | Vector256<ushort> utf16VectorLower = Avx.LoadVector256(src); |
| | 0 | 1752 | | Vector256<ushort> utf16VectorUpper = Avx.LoadVector256(src + 16); |
| | | 1753 | | |
| | 0 | 1754 | | if (Ascii.VectorContainsNonAsciiChar(utf16VectorLower | utf16VectorUpper)) |
| | | 1755 | | { |
| | 0 | 1756 | | str = default; |
| | 0 | 1757 | | return false; |
| | | 1758 | | } |
| | | 1759 | | |
| | 0 | 1760 | | str = Ascii.ExtractAsciiVector(utf16VectorLower, utf16VectorUpper).AsSByte(); |
| | 0 | 1761 | | return true; |
| | | 1762 | | } |
| | | 1763 | | |
| | | 1764 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1765 | | public unsafe bool TryLoadVector128(ushort* src, ushort* srcStart, int sourceLength, out Vector128<byte> str |
| | | 1766 | | { |
| | 0 | 1767 | | AssertRead<Vector128<sbyte>>(src, srcStart, sourceLength); |
| | 0 | 1768 | | Vector128<ushort> utf16VectorLower = Vector128.LoadUnsafe(ref *src); |
| | 0 | 1769 | | Vector128<ushort> utf16VectorUpper = Vector128.LoadUnsafe(ref *src, 8); |
| | 0 | 1770 | | if (Ascii.VectorContainsNonAsciiChar(utf16VectorLower | utf16VectorUpper)) |
| | | 1771 | | { |
| | 0 | 1772 | | str = default; |
| | 0 | 1773 | | return false; |
| | | 1774 | | } |
| | | 1775 | | |
| | 0 | 1776 | | str = Ascii.ExtractAsciiVector(utf16VectorLower, utf16VectorUpper); |
| | 0 | 1777 | | return true; |
| | | 1778 | | } |
| | | 1779 | | |
| | | 1780 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1781 | | [CompExactlyDependsOn(typeof(AdvSimd.Arm64))] |
| | | 1782 | | public unsafe bool TryLoadArmVector128x4(ushort* src, ushort* srcStart, int sourceLength, |
| | | 1783 | | out Vector128<byte> str1, out Vector128<byte> str2, out Vector128<byte> str3, out Vector128<byte> str4) |
| | | 1784 | | { |
| | 0 | 1785 | | AssertRead<Vector128<sbyte>>(src, srcStart, sourceLength); |
| | 0 | 1786 | | var (s11, s12, s21, s22) = AdvSimd.Arm64.Load4xVector128AndUnzip(src); |
| | 0 | 1787 | | var (s31, s32, s41, s42) = AdvSimd.Arm64.Load4xVector128AndUnzip(src + 32); |
| | | 1788 | | |
| | 0 | 1789 | | if (Ascii.VectorContainsNonAsciiChar(s11 | s12 | s21 | s22 | s31 | s32 | s41 | s42)) |
| | | 1790 | | { |
| | 0 | 1791 | | str1 = str2 = str3 = str4 = default; |
| | 0 | 1792 | | return false; |
| | | 1793 | | } |
| | | 1794 | | |
| | 0 | 1795 | | str1 = Ascii.ExtractAsciiVector(s11, s31); |
| | 0 | 1796 | | str2 = Ascii.ExtractAsciiVector(s12, s32); |
| | 0 | 1797 | | str3 = Ascii.ExtractAsciiVector(s21, s41); |
| | 0 | 1798 | | str4 = Ascii.ExtractAsciiVector(s22, s42); |
| | | 1799 | | |
| | 0 | 1800 | | return true; |
| | | 1801 | | } |
| | | 1802 | | #endif // NET |
| | | 1803 | | |
| | | 1804 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1805 | | public unsafe int DecodeFourElements(ushort* source, ref sbyte decodingMap) |
| | | 1806 | | { |
| | | 1807 | | // The 'source' span expected to have at least 4 elements, and the 'decodingMap' consists 256 sbytes |
| | 0 | 1808 | | uint t0 = source[0]; |
| | 0 | 1809 | | uint t1 = source[1]; |
| | 0 | 1810 | | uint t2 = source[2]; |
| | 0 | 1811 | | uint t3 = source[3]; |
| | | 1812 | | |
| | 0 | 1813 | | if (((t0 | t1 | t2 | t3) & 0xffffff00) != 0) |
| | | 1814 | | { |
| | 0 | 1815 | | return -1; // One or more chars falls outside the 00..ff range, invalid Base64 character. |
| | | 1816 | | } |
| | | 1817 | | |
| | 0 | 1818 | | int i0 = Unsafe.Add(ref decodingMap, (int)t0); |
| | 0 | 1819 | | int i1 = Unsafe.Add(ref decodingMap, (int)t1); |
| | 0 | 1820 | | int i2 = Unsafe.Add(ref decodingMap, (int)t2); |
| | 0 | 1821 | | int i3 = Unsafe.Add(ref decodingMap, (int)t3); |
| | | 1822 | | |
| | 0 | 1823 | | i0 <<= 18; |
| | 0 | 1824 | | i1 <<= 12; |
| | 0 | 1825 | | i2 <<= 6; |
| | | 1826 | | |
| | 0 | 1827 | | i0 |= i3; |
| | 0 | 1828 | | i1 |= i2; |
| | | 1829 | | |
| | 0 | 1830 | | i0 |= i1; |
| | 0 | 1831 | | return i0; |
| | | 1832 | | } |
| | | 1833 | | |
| | | 1834 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1835 | | public unsafe int DecodeRemaining(ushort* srcEnd, ref sbyte decodingMap, long remaining, out uint t2, out ui |
| | | 1836 | | { |
| | | 1837 | | uint t0; |
| | | 1838 | | uint t1; |
| | 0 | 1839 | | t2 = EncodingPad; |
| | 0 | 1840 | | t3 = EncodingPad; |
| | | 1841 | | switch (remaining) |
| | | 1842 | | { |
| | | 1843 | | case 2: |
| | 0 | 1844 | | t0 = srcEnd[-2]; |
| | 0 | 1845 | | t1 = srcEnd[-1]; |
| | 0 | 1846 | | break; |
| | | 1847 | | case 3: |
| | 0 | 1848 | | t0 = srcEnd[-3]; |
| | 0 | 1849 | | t1 = srcEnd[-2]; |
| | 0 | 1850 | | t2 = srcEnd[-1]; |
| | 0 | 1851 | | break; |
| | | 1852 | | case 4: |
| | 0 | 1853 | | t0 = srcEnd[-4]; |
| | 0 | 1854 | | t1 = srcEnd[-3]; |
| | 0 | 1855 | | t2 = srcEnd[-2]; |
| | 0 | 1856 | | t3 = srcEnd[-1]; |
| | 0 | 1857 | | break; |
| | | 1858 | | default: |
| | 0 | 1859 | | return -1; |
| | | 1860 | | } |
| | | 1861 | | |
| | 0 | 1862 | | if (((t0 | t1 | t2 | t3) & 0xffffff00) != 0) |
| | | 1863 | | { |
| | 0 | 1864 | | return -1; |
| | | 1865 | | } |
| | | 1866 | | |
| | 0 | 1867 | | int i0 = Unsafe.Add(ref decodingMap, (IntPtr)t0); |
| | 0 | 1868 | | int i1 = Unsafe.Add(ref decodingMap, (IntPtr)t1); |
| | | 1869 | | |
| | 0 | 1870 | | i0 <<= 18; |
| | 0 | 1871 | | i1 <<= 12; |
| | | 1872 | | |
| | 0 | 1873 | | i0 |= i1; |
| | 0 | 1874 | | return i0; |
| | | 1875 | | } |
| | | 1876 | | |
| | | 1877 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1878 | | public int IndexOfAnyExceptWhiteSpace(ReadOnlySpan<ushort> span) |
| | | 1879 | | { |
| | 0 | 1880 | | for (int i = 0; i < span.Length; i++) |
| | | 1881 | | { |
| | 0 | 1882 | | if (!IsWhiteSpace(span[i])) |
| | | 1883 | | { |
| | 0 | 1884 | | return i; |
| | | 1885 | | } |
| | | 1886 | | } |
| | | 1887 | | |
| | 0 | 1888 | | return -1; |
| | | 1889 | | } |
| | | 1890 | | |
| | | 1891 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 1892 | | [SuppressReadyToRunCanonicalRooting] |
| | | 1893 | | public OperationStatus DecodeWithWhiteSpaceBlockwiseWrapper<TBase64Decoder>(TBase64Decoder decoder, ReadOnly |
| | | 1894 | | Span<byte> bytes, ref int bytesConsumed, ref int bytesWritten, bool isFinalBlock = true) where TBase64De |
| | 0 | 1895 | | DecodeWithWhiteSpaceBlockwise(default(Base64DecoderChar), source, bytes, ref bytesConsumed, ref bytesWri |
| | | 1896 | | } |
| | | 1897 | | } |
| | | 1898 | | } |