Base64.sol 3.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
  1. // SPDX-License-Identifier: MIT
  2. // OpenZeppelin Contracts (last updated v4.5.0) (utils/Base64.sol)
  3. pragma solidity ^0.8.0;
  4. /**
  5. * @dev Provides a set of functions to operate with Base64 strings.
  6. *
  7. * _Available since v4.5._
  8. */
  9. library Base64 {
  10. /**
  11. * @dev Base64 Encoding/Decoding Table
  12. */
  13. string internal constant _TABLE = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  14. /**
  15. * @dev Converts a `bytes` to its Bytes64 `string` representation.
  16. */
  17. function encode(bytes memory data) internal pure returns (string memory) {
  18. /**
  19. * Inspired by Brecht Devos (Brechtpd) implementation - MIT licence
  20. * https://github.com/Brechtpd/base64/blob/e78d9fd951e7b0977ddca77d92dc85183770daf4/base64.sol
  21. */
  22. if (data.length == 0) return "";
  23. // Loads the table into memory
  24. string memory table = _TABLE;
  25. // Encoding takes 3 bytes chunks of binary data from `bytes` data parameter
  26. // and split into 4 numbers of 6 bits.
  27. // The final Base64 length should be `bytes` data length multiplied by 4/3 rounded up
  28. // - `data.length + 2` -> Round up
  29. // - `/ 3` -> Number of 3-bytes chunks
  30. // - `4 *` -> 4 characters for each chunk
  31. string memory result = new string(4 * ((data.length + 2) / 3));
  32. assembly {
  33. // Prepare the lookup table (skip the first "length" byte)
  34. let tablePtr := add(table, 1)
  35. // Prepare result pointer, jump over length
  36. let resultPtr := add(result, 32)
  37. // Run over the input, 3 bytes at a time
  38. for {
  39. let dataPtr := data
  40. let endPtr := add(data, mload(data))
  41. } lt(dataPtr, endPtr) {
  42. } {
  43. // Advance 3 bytes
  44. dataPtr := add(dataPtr, 3)
  45. let input := mload(dataPtr)
  46. // To write each character, shift the 3 bytes (18 bits) chunk
  47. // 4 times in blocks of 6 bits for each character (18, 12, 6, 0)
  48. // and apply logical AND with 0x3F which is the number of
  49. // the previous character in the ASCII table prior to the Base64 Table
  50. // The result is then added to the table to get the character to write,
  51. // and finally write it in the result pointer but with a left shift
  52. // of 256 (1 byte) - 8 (1 ASCII char) = 248 bits
  53. mstore8(resultPtr, mload(add(tablePtr, and(shr(18, input), 0x3F))))
  54. resultPtr := add(resultPtr, 1) // Advance
  55. mstore8(resultPtr, mload(add(tablePtr, and(shr(12, input), 0x3F))))
  56. resultPtr := add(resultPtr, 1) // Advance
  57. mstore8(resultPtr, mload(add(tablePtr, and(shr(6, input), 0x3F))))
  58. resultPtr := add(resultPtr, 1) // Advance
  59. mstore8(resultPtr, mload(add(tablePtr, and(input, 0x3F))))
  60. resultPtr := add(resultPtr, 1) // Advance
  61. }
  62. // When data `bytes` is not exactly 3 bytes long
  63. // it is padded with `=` characters at the end
  64. switch mod(mload(data), 3)
  65. case 1 {
  66. mstore8(sub(resultPtr, 1), 0x3d)
  67. mstore8(sub(resultPtr, 2), 0x3d)
  68. }
  69. case 2 {
  70. mstore8(sub(resultPtr, 1), 0x3d)
  71. }
  72. }
  73. return result;
  74. }
  75. }