3
0

uuencode.c 1.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
  1. /* vi: set sw=4 ts=4: */
  2. /*
  3. * Copyright 2006 Rob Landley <rob@landley.net>
  4. *
  5. * Licensed under GPLv2 or later, see file LICENSE in this tarball for details.
  6. */
  7. #include "libbb.h"
  8. /* Conversion table. for base 64 */
  9. const char bb_uuenc_tbl_base64[65] = {
  10. 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
  11. 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',
  12. 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
  13. 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',
  14. 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
  15. 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
  16. 'w', 'x', 'y', 'z', '0', '1', '2', '3',
  17. '4', '5', '6', '7', '8', '9', '+', '/',
  18. '=' /* termination character */
  19. };
  20. const char bb_uuenc_tbl_std[65] = {
  21. '`', '!', '"', '#', '$', '%', '&', '\'',
  22. '(', ')', '*', '+', ',', '-', '.', '/',
  23. '0', '1', '2', '3', '4', '5', '6', '7',
  24. '8', '9', ':', ';', '<', '=', '>', '?',
  25. '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G',
  26. 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',
  27. 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W',
  28. 'X', 'Y', 'Z', '[', '\\', ']', '^', '_',
  29. '`' /* termination character */
  30. };
  31. /*
  32. * Encode the string S of length LENGTH to base64 format and place it
  33. * to STORE. STORE will be 0-terminated, and must point to a writable
  34. * buffer of at least 1+BASE64_LENGTH(length) bytes.
  35. * where BASE64_LENGTH(len) = (4 * ((LENGTH + 2) / 3))
  36. */
  37. void bb_uuencode(const unsigned char *s, char *store, const int length, const char *tbl)
  38. {
  39. int i;
  40. char *p = store;
  41. /* Transform the 3x8 bits to 4x6 bits, as required by base64. */
  42. for (i = 0; i < length; i += 3) {
  43. *p++ = tbl[s[0] >> 2];
  44. *p++ = tbl[((s[0] & 3) << 4) + (s[1] >> 4)];
  45. *p++ = tbl[((s[1] & 0xf) << 2) + (s[2] >> 6)];
  46. *p++ = tbl[s[2] & 0x3f];
  47. s += 3;
  48. }
  49. /* Pad the result if necessary... */
  50. if (i == length + 1) {
  51. *(p - 1) = tbl[64];
  52. }
  53. else if (i == length + 2) {
  54. *(p - 1) = *(p - 2) = tbl[64];
  55. }
  56. /* ...and zero-terminate it. */
  57. *p = '\0';
  58. }