xs_encdec.h 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197
  1. /* copyright (c) 2022 grunfink - MIT license */
  2. #ifndef _XS_ENCDEC_H
  3. #define _XS_ENCDEC_H
  4. d_char *xs_hex_enc(const char *data, int size);
  5. d_char *xs_hex_dec(const char *hex);
  6. d_char *xs_base64_enc(const char *data, int sz);
  7. d_char *xs_base64_dec(const char *data, int *size);
  8. d_char *xs_utf8_enc(d_char *str, unsigned int cpoint);
  9. #ifdef XS_IMPLEMENTATION
  10. d_char *xs_hex_enc(const char *data, int size)
  11. /* returns an hexdump of data */
  12. {
  13. d_char *s;
  14. char *p;
  15. int n;
  16. p = s = calloc(size * 2 + 1, 1);
  17. for (n = 0; n < size; n++) {
  18. sprintf(p, "%02x", (unsigned char)data[n]);
  19. p += 2;
  20. }
  21. return s;
  22. }
  23. d_char *xs_hex_dec(const char *hex)
  24. /* decodes an hexdump into data */
  25. {
  26. int sz = strlen(hex);
  27. d_char *s = NULL;
  28. char *p;
  29. int n;
  30. if (sz % 2)
  31. return s;
  32. p = s = calloc(sz / 2, 1);
  33. for (n = 0; n < sz; n += 2) {
  34. int i;
  35. if (sscanf(&hex[n], "%02x", &i) == 0) {
  36. /* decoding error */
  37. free(s);
  38. s = NULL;
  39. }
  40. else
  41. *p = i;
  42. p++;
  43. }
  44. return s;
  45. }
  46. d_char *xs_base64_enc(const char *data, int sz)
  47. /* encodes data to base64 */
  48. {
  49. d_char *s;
  50. unsigned char *p;
  51. char *i;
  52. int bsz, n;
  53. static char *b64_tbl = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
  54. "abcdefghijklmnopqrstuvwxyz"
  55. "0123456789+/";
  56. bsz = ((sz + 3 - 1) / 3) * 4;
  57. i = s = calloc(bsz + 1, 1);
  58. p = (unsigned char *)data;
  59. for (n = 0; n < sz; n += 3) {
  60. int l = sz - n;
  61. if (l == 1) {
  62. *i++ = b64_tbl[(p[n] >> 2) & 0x3f];
  63. *i++ = b64_tbl[(p[n] << 4) & 0x3f];
  64. *i++ = '=';
  65. *i++ = '=';
  66. }
  67. else
  68. if (l == 2) {
  69. *i++ = b64_tbl[(p[n] >> 2) & 0x3f];
  70. *i++ = b64_tbl[(p[n] << 4 | p[n + 1] >> 4) & 0x3f];
  71. *i++ = b64_tbl[(p[n + 1] << 2) & 0x3f];
  72. *i++ = '=';
  73. }
  74. else {
  75. *i++ = b64_tbl[(p[n] >> 2) & 0x3f];
  76. *i++ = b64_tbl[(p[n] << 4 | p[n + 1] >> 4) & 0x3f];
  77. *i++ = b64_tbl[(p[n + 1] << 2 | p[n + 2] >> 6) & 0x3f];
  78. *i++ = b64_tbl[(p[n + 2]) & 0x3f];
  79. }
  80. }
  81. return s;
  82. }
  83. d_char *xs_base64_dec(const char *data, int *size)
  84. /* decodes data from base64 */
  85. {
  86. d_char *s = NULL;
  87. int sz = 0;
  88. char *p;
  89. static char *b64_tbl = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
  90. "abcdefghijklmnopqrstuvwxyz"
  91. "0123456789+/=";
  92. p = (char *)data;
  93. /* size of data must be a multiple of 4 */
  94. if (strlen(p) % 4)
  95. return s;
  96. for (p = (char *)data; *p; p += 4) {
  97. int cs[4];
  98. int n;
  99. unsigned char tmp[3];
  100. for (n = 0; n < 4; n++) {
  101. char *ss = strchr(b64_tbl, p[n]);
  102. if (ss == NULL) {
  103. /* not a base64 char */
  104. free(s);
  105. return NULL;
  106. }
  107. cs[n] = ss - b64_tbl;
  108. }
  109. n = 0;
  110. /* first byte */
  111. tmp[n++] = cs[0] << 2 | ((cs[1] >> 4) & 0x0f);
  112. /* second byte */
  113. if (cs[2] != 64)
  114. tmp[n++] = cs[1] << 4 | ((cs[2] >> 2) & 0x3f);
  115. /* third byte */
  116. if (cs[3] != 64)
  117. tmp[n++] = cs[2] << 6 | (cs[3] & 0x3f);
  118. /* must be done manually because data can be pure binary */
  119. s = realloc(s, sz + n);
  120. memcpy(s + sz, tmp, n);
  121. sz += n;
  122. }
  123. *size = sz;
  124. return s;
  125. }
  126. d_char *xs_utf8_enc(d_char *str, unsigned int cpoint)
  127. /* encodes an Unicode codepoint to utf8 */
  128. {
  129. unsigned char tmp[4];
  130. int n = 0;
  131. if (cpoint < 0x80)
  132. tmp[n++] = cpoint & 0xff;
  133. else
  134. if (cpoint < 0x800) {
  135. tmp[n++] = 0xc0 | (cpoint >> 6);
  136. tmp[n++] = 0x80 | (cpoint & 0x3f);
  137. }
  138. else
  139. if (cpoint < 0x10000) {
  140. tmp[n++] = 0xe0 | (cpoint >> 12);
  141. tmp[n++] = 0x80 | ((cpoint >> 6) & 0x3f);
  142. tmp[n++] = 0x80 | (cpoint & 0x3f);
  143. }
  144. else
  145. if (cpoint < 0x200000) {
  146. tmp[n++] = 0xf0 | (cpoint >> 18);
  147. tmp[n++] = 0x80 | ((cpoint >> 12) & 0x3f);
  148. tmp[n++] = 0x80 | ((cpoint >> 6) & 0x3f);
  149. tmp[n++] = 0x80 | (cpoint & 0x3f);
  150. }
  151. return xs_append_m(str, (char *)tmp, n);
  152. }
  153. #endif /* XS_IMPLEMENTATION */
  154. #endif /* _XS_ENCDEC_H */