cstring.h 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234
  1. /**
  2. * @file cstring.h
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. Neither the name of the author nor the
  15. * names of its contributors may be used to endorse or promote products
  16. * derived from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  20. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  21. * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  22. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  23. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  24. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  25. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  27. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. */
  29. #ifndef BADVPN_COMPOSED_STRING_H
  30. #define BADVPN_COMPOSED_STRING_H
  31. #include <stddef.h>
  32. #include <string.h>
  33. #include <limits.h>
  34. #include <misc/debug.h>
  35. #include <misc/balloc.h>
  36. struct b_cstring_s;
  37. /**
  38. * Callback function which is called by {@link b_cstring_get} to access the underlying resource.
  39. * \a cstr points to the cstring being accessed, and the callback can use the userN members to
  40. * retrieve any state information.
  41. * \a offset is the offset from the beginning of the string; offset < cstr->length.
  42. * This callback must set *\a out_length and return a pointer, representing a continuous
  43. * region of the string that starts at the byte at index \a offset. Returning a region that
  44. * spans past the end of the string is allowed.
  45. */
  46. typedef const char * (*b_cstring_func) (const struct b_cstring_s *cstr, size_t offset, size_t *out_length);
  47. /**
  48. * An abstract string which is not necessarily continuous. Its data can be read using
  49. * {@link b_cstring_get}, which internally invokes the {@link b_cstring_func} callback.
  50. */
  51. typedef struct b_cstring_s {
  52. size_t length;
  53. b_cstring_func func;
  54. union {
  55. size_t size;
  56. void *ptr;
  57. void (*fptr) (void);
  58. } user1;
  59. union {
  60. size_t size;
  61. void *ptr;
  62. void (*fptr) (void);
  63. } user2;
  64. union {
  65. size_t size;
  66. void *ptr;
  67. void (*fptr) (void);
  68. } user3;
  69. } b_cstring;
  70. /**
  71. * Convenience function which makes a cstring pointing to a buffer.
  72. */
  73. static b_cstring b_cstring_make_buf (const char *data, size_t length);
  74. /**
  75. * Retrieves a pointer to a continuous region of the string.
  76. * \a offset specifies the starting offset of the region to retrieve, and must be < cstr.length.
  77. * \a maxlen specifies the maximum length of the returned region, and must be > 0.
  78. * The length of the region will be stored in *\a out_chunk_len, and it will always be > 0.
  79. * It is possible that the returned region spans past the end of the string, unless limited
  80. * by \a maxlen. The pointer to the region will be returned; it will point to the byte
  81. * at offset exactly \a offset into the string.
  82. */
  83. static const char * b_cstring_get (b_cstring cstr, size_t offset, size_t maxlen, size_t *out_chunk_len);
  84. /**
  85. * Asserts that the range given by \a offset and \a length is valid for the string.
  86. */
  87. static void b_cstring_assert_range (b_cstring cstr, size_t offset, size_t length);
  88. /**
  89. * Copies a range to an external buffer.
  90. */
  91. static void b_cstring_copy_to_buf (b_cstring cstr, size_t offset, size_t length, char *dest);
  92. /**
  93. * Performs a memcmp-like operation on the given ranges of two cstrings.
  94. */
  95. static int b_cstring_memcmp (b_cstring cstr1, b_cstring cstr2, size_t offset1, size_t offset2, size_t length);
  96. /**
  97. * Allocates a buffer for a range and copies it. The buffer is allocated using {@link BAlloc}.
  98. * An extra null byte will be appended. On failure, returns NULL.
  99. */
  100. static char * b_cstring_strdup (b_cstring cstr, size_t offset, size_t length);
  101. /**
  102. * Macro which iterates the continuous regions of a range within a cstring.
  103. * For reach region, the statements in \a body are executed, in order.
  104. * \a cstr is the string to be iterated.
  105. * \a offset and \a length specify the range of the string to iterate; they must
  106. * refer to a valid range for the string.
  107. * \a rel_pos_var, \a chunk_data_var and \a chunk_length_var specify names of variables
  108. * which will be available in \a body.
  109. * \a rel_pos_var will hold the offset of the current continuous region, relative to the beginning.
  110. * \a chunk_data_var will hold a pointer (const char *) to the beginning of the region, and
  111. * \a chunk_length_var will hold its length.
  112. *
  113. * See the implementation of {@link b_cstring_copy_to_buf} for a usage example.
  114. */
  115. #define B_CSTRING_LOOP_RANGE(cstr, offset, length, rel_pos_var, chunk_data_var, chunk_length_var, body) \
  116. { \
  117. size_t rel_pos_var = 0; \
  118. while (rel_pos_var < (length)) { \
  119. size_t chunk_length_var; \
  120. const char *chunk_data_var = b_cstring_get((cstr), (offset) + rel_pos_var, (length) - rel_pos_var, &chunk_length_var); \
  121. { body } \
  122. rel_pos_var += chunk_length_var; \
  123. } \
  124. }
  125. /**
  126. * Like {@link B_CSTRING_LOOP_RANGE}, but iterates the entire string,
  127. * i.e. offset==0 and length==cstr.length.
  128. */
  129. #define B_CSTRING_LOOP(cstr, rel_pos_var, chunk_data_var, chunk_length_var, body) B_CSTRING_LOOP_RANGE(cstr, 0, (cstr).length, rel_pos_var, chunk_data_var, chunk_length_var, body)
  130. static const char * b_cstring__buf_func (const b_cstring *cstr, size_t offset, size_t *out_length)
  131. {
  132. ASSERT(offset < cstr->length)
  133. ASSERT(out_length)
  134. ASSERT(cstr->func == b_cstring__buf_func)
  135. ASSERT(cstr->user1.ptr)
  136. *out_length = cstr->length - offset;
  137. return (const char *)cstr->user1.ptr + offset;
  138. }
  139. static b_cstring b_cstring_make_buf (const char *data, size_t length)
  140. {
  141. ASSERT(length == 0 || data)
  142. b_cstring cstr;
  143. cstr.length = length;
  144. cstr.func = b_cstring__buf_func;
  145. cstr.user1.ptr = (void *)data;
  146. return cstr;
  147. }
  148. static const char * b_cstring_get (b_cstring cstr, size_t offset, size_t maxlen, size_t *out_chunk_len)
  149. {
  150. ASSERT(offset < cstr.length)
  151. ASSERT(maxlen > 0)
  152. ASSERT(out_chunk_len)
  153. const char *data = cstr.func(&cstr, offset, out_chunk_len);
  154. ASSERT(data)
  155. ASSERT(*out_chunk_len > 0)
  156. if (*out_chunk_len > maxlen) {
  157. *out_chunk_len = maxlen;
  158. }
  159. return data;
  160. }
  161. static void b_cstring_assert_range (b_cstring cstr, size_t offset, size_t length)
  162. {
  163. ASSERT(offset <= cstr.length)
  164. ASSERT(length <= cstr.length - offset)
  165. }
  166. static void b_cstring_copy_to_buf (b_cstring cstr, size_t offset, size_t length, char *dest)
  167. {
  168. b_cstring_assert_range(cstr, offset, length);
  169. ASSERT(length == 0 || dest)
  170. B_CSTRING_LOOP_RANGE(cstr, offset, length, pos, chunk_data, chunk_length, {
  171. memcpy(dest + pos, chunk_data, chunk_length);
  172. })
  173. }
  174. static int b_cstring_memcmp (b_cstring cstr1, b_cstring cstr2, size_t offset1, size_t offset2, size_t length)
  175. {
  176. b_cstring_assert_range(cstr1, offset1, length);
  177. b_cstring_assert_range(cstr2, offset2, length);
  178. B_CSTRING_LOOP_RANGE(cstr1, offset1, length, pos1, chunk_data1, chunk_len1, {
  179. B_CSTRING_LOOP_RANGE(cstr2, offset2 + pos1, chunk_len1, pos2, chunk_data2, chunk_len2, {
  180. int cmp = memcmp(chunk_data1 + pos2, chunk_data2, chunk_len2);
  181. if (cmp) {
  182. return cmp;
  183. }
  184. })
  185. })
  186. return 0;
  187. }
  188. static char * b_cstring_strdup (b_cstring cstr, size_t offset, size_t length)
  189. {
  190. b_cstring_assert_range(cstr, offset, length);
  191. if (length == SIZE_MAX) {
  192. return NULL;
  193. }
  194. char *buf = BAlloc(length + 1);
  195. if (buf) {
  196. b_cstring_copy_to_buf(cstr, offset, length, buf);
  197. buf[length] = '\0';
  198. }
  199. return buf;
  200. }
  201. #endif