xs_encdec.h 4.8 KB

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