buffer.c 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161
  1. #include "buffer.h"
  2. /* * * Inline extern prototypes * * */
  3. LSUP_Buffer *LSUP_buffer_new (const void *data, const size_t size);
  4. LSUP_rc LSUP_buffer_init (
  5. LSUP_Buffer *buf, const size_t size, const void *data);
  6. bool LSUP_buffer_eq (const LSUP_Buffer *buf1, const LSUP_Buffer *buf2);
  7. int LSUP_buffer_cmp (const LSUP_Buffer *buf1, const LSUP_Buffer *buf2);
  8. /* * * API * * */
  9. LSUP_rc
  10. LSUP_buffer_init (LSUP_Buffer *buf, const size_t size, const void *data)
  11. {
  12. // If size is zero, addr becomes NULL.
  13. void *tmp = realloc (buf->addr, size);
  14. if (UNLIKELY (size > 0 && tmp == NULL)) return LSUP_MEM_ERR;
  15. buf->addr = tmp;
  16. buf->size = size;
  17. if (data) memcpy (buf->addr, data, buf->size);
  18. return LSUP_OK;
  19. }
  20. void LSUP_buffer_print (const LSUP_Buffer *buf)
  21. {
  22. for (size_t i = 0; i < buf->size; i++) {
  23. char chr = ((char*)buf->addr)[i];
  24. if (isprint (chr)) {
  25. fputc (chr, stdout);
  26. } else {
  27. printf ("\\x%02x", chr);
  28. }
  29. }
  30. printf ("\n");
  31. }
  32. char *
  33. LSUP_buffer_as_str (const LSUP_Buffer *buf)
  34. {
  35. size_t i, str_size = 1; // terminating NUL
  36. // Calculate alloc size first.
  37. for (i = 0; i < buf->size; i++) {
  38. char chr = ((char*)buf->addr)[i];
  39. if (isprint (chr)) str_size ++;
  40. else str_size += 4; // 4 characters for ASCII representation (\xNN).
  41. }
  42. log_trace ("Byte buffer str size: %lu", str_size);
  43. char *cstr = malloc (str_size);
  44. size_t cur = 0; // Position in target string.
  45. for (i = 0; i < str_size - 1; i++) {
  46. char chr = ((char*)buf->addr)[i];
  47. if (isprint (chr)) {
  48. cstr[cur] = chr;
  49. cur ++;
  50. } else {
  51. sprintf (cstr + cur, "\\x%02x", chr);
  52. cur += 4;
  53. }
  54. }
  55. cstr[str_size - 1] = 0; // terminating NUL.
  56. return cstr;
  57. }
  58. void LSUP_buffer_done (LSUP_Buffer *buf)
  59. {
  60. if (LIKELY (buf)) free (buf->addr);
  61. }
  62. void LSUP_buffer_free (LSUP_Buffer *buf)
  63. {
  64. LSUP_buffer_done (buf);
  65. free (buf);
  66. }
  67. /*
  68. * Buffer triples.
  69. */
  70. LSUP_BufferTriple *
  71. LSUP_btriple_new(LSUP_Buffer *s, LSUP_Buffer *p, LSUP_Buffer *o)
  72. {
  73. LSUP_BufferTriple *sspo = malloc (sizeof (*sspo));
  74. if (!sspo) return NULL;
  75. if (UNLIKELY (LSUP_btriple_init (sspo, s, p, o))) {
  76. free (sspo);
  77. return NULL;
  78. }
  79. return sspo;
  80. }
  81. LSUP_rc
  82. LSUP_btriple_init (
  83. LSUP_BufferTriple *sspo, LSUP_Buffer *s, LSUP_Buffer *p, LSUP_Buffer *o)
  84. {
  85. sspo->s = s;
  86. sspo->p = p;
  87. sspo->o = o;
  88. return LSUP_OK;
  89. }
  90. void
  91. LSUP_btriple_done (LSUP_BufferTriple *sspo)
  92. {
  93. if (UNLIKELY (!sspo)) return;
  94. LSUP_buffer_done (sspo->s);
  95. LSUP_buffer_done (sspo->p);
  96. LSUP_buffer_done (sspo->o);
  97. }
  98. void
  99. LSUP_btriple_free (LSUP_BufferTriple *sspo)
  100. {
  101. if (UNLIKELY (!sspo)) return;
  102. LSUP_buffer_free (sspo->s);
  103. LSUP_buffer_free (sspo->p);
  104. LSUP_buffer_free (sspo->o);
  105. free (sspo);
  106. }
  107. void
  108. LSUP_btriple_free_shallow (LSUP_BufferTriple *sspo)
  109. {
  110. if (UNLIKELY (!sspo)) return;
  111. sspo->s->addr = sspo->p->addr = sspo->o->addr = NULL;
  112. LSUP_btriple_free (sspo);
  113. }
  114. /* Extern inline prototypes. */
  115. LSUP_Key LSUP_buffer_hash (const LSUP_Buffer *buf);
  116. LSUP_Key LSUP_btriple_hash (const LSUP_BufferTriple *strp);
  117. LSUP_Buffer *LSUP_btriple_pos (const LSUP_BufferTriple *trp, LSUP_TriplePos n);