xs_encdec.h 4.2 KB

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