saa.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  1. /* ----------------------------------------------------------------------- *
  2. *
  3. * Copyright 1996-2017 The NASM Authors - All Rights Reserved
  4. * See the file AUTHORS included with the NASM distribution for
  5. * the specific copyright holders.
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following
  9. * conditions are met:
  10. *
  11. * * Redistributions of source code must retain the above copyright
  12. * notice, this list of conditions and the following disclaimer.
  13. * * Redistributions in binary form must reproduce the above
  14. * copyright notice, this list of conditions and the following
  15. * disclaimer in the documentation and/or other materials provided
  16. * with the distribution.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  19. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  20. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  21. * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  22. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  23. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  24. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  25. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  26. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  27. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  28. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
  29. * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
  30. * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  31. *
  32. * ----------------------------------------------------------------------- */
  33. #include "compiler.h"
  34. #include "nasmlib.h"
  35. #include "saa.h"
  36. /* Aggregate SAA components smaller than this */
  37. #define SAA_BLKSHIFT 16
  38. #define SAA_BLKLEN ((size_t)1 << SAA_BLKSHIFT)
  39. struct SAA *saa_init(size_t elem_len)
  40. {
  41. struct SAA *s;
  42. char *data;
  43. s = nasm_zalloc(sizeof(struct SAA));
  44. if (elem_len >= SAA_BLKLEN)
  45. s->blk_len = elem_len;
  46. else
  47. s->blk_len = SAA_BLKLEN - (SAA_BLKLEN % elem_len);
  48. s->elem_len = elem_len;
  49. s->length = s->blk_len;
  50. data = nasm_malloc(s->blk_len);
  51. s->nblkptrs = s->nblks = 1;
  52. s->blk_ptrs = nasm_malloc(sizeof(char *));
  53. s->blk_ptrs[0] = data;
  54. s->wblk = s->rblk = &s->blk_ptrs[0];
  55. return s;
  56. }
  57. void saa_free(struct SAA *s)
  58. {
  59. char **p;
  60. size_t n;
  61. for (p = s->blk_ptrs, n = s->nblks; n; p++, n--)
  62. nasm_free(*p);
  63. nasm_free(s->blk_ptrs);
  64. nasm_free(s);
  65. }
  66. /* Add one allocation block to an SAA */
  67. static void saa_extend(struct SAA *s)
  68. {
  69. size_t blkn = s->nblks++;
  70. if (blkn >= s->nblkptrs) {
  71. size_t rindex = s->rblk - s->blk_ptrs;
  72. size_t windex = s->wblk - s->blk_ptrs;
  73. s->nblkptrs <<= 1;
  74. s->blk_ptrs =
  75. nasm_realloc(s->blk_ptrs, s->nblkptrs * sizeof(char *));
  76. s->rblk = s->blk_ptrs + rindex;
  77. s->wblk = s->blk_ptrs + windex;
  78. }
  79. s->blk_ptrs[blkn] = nasm_malloc(s->blk_len);
  80. s->length += s->blk_len;
  81. }
  82. void *saa_wstruct(struct SAA *s)
  83. {
  84. void *p;
  85. nasm_assert((s->wpos % s->elem_len) == 0);
  86. if (s->wpos + s->elem_len > s->blk_len) {
  87. nasm_assert(s->wpos == s->blk_len);
  88. if (s->wptr + s->elem_len > s->length)
  89. saa_extend(s);
  90. s->wblk++;
  91. s->wpos = 0;
  92. }
  93. p = *s->wblk + s->wpos;
  94. s->wpos += s->elem_len;
  95. s->wptr += s->elem_len;
  96. if (s->wptr > s->datalen)
  97. s->datalen = s->wptr;
  98. return p;
  99. }
  100. void saa_wbytes(struct SAA *s, const void *data, size_t len)
  101. {
  102. const char *d = data;
  103. while (len) {
  104. size_t l = s->blk_len - s->wpos;
  105. if (l > len)
  106. l = len;
  107. if (l) {
  108. if (d) {
  109. memcpy(*s->wblk + s->wpos, d, l);
  110. d += l;
  111. } else
  112. memset(*s->wblk + s->wpos, 0, l);
  113. s->wpos += l;
  114. s->wptr += l;
  115. len -= l;
  116. if (s->datalen < s->wptr)
  117. s->datalen = s->wptr;
  118. }
  119. if (len) {
  120. if (s->wptr >= s->length)
  121. saa_extend(s);
  122. s->wblk++;
  123. s->wpos = 0;
  124. }
  125. }
  126. }
  127. /*
  128. * Writes a string, *including* the final null, to the specified SAA,
  129. * and return the number of bytes written.
  130. */
  131. size_t saa_wcstring(struct SAA *s, const char *str)
  132. {
  133. size_t bytes = strlen(str) + 1;
  134. saa_wbytes(s, str, bytes);
  135. return bytes;
  136. }
  137. void saa_rewind(struct SAA *s)
  138. {
  139. s->rblk = s->blk_ptrs;
  140. s->rpos = s->rptr = 0;
  141. }
  142. void *saa_rstruct(struct SAA *s)
  143. {
  144. void *p;
  145. if (s->rptr + s->elem_len > s->datalen)
  146. return NULL;
  147. nasm_assert((s->rpos % s->elem_len) == 0);
  148. if (s->rpos + s->elem_len > s->blk_len) {
  149. s->rblk++;
  150. s->rpos = 0;
  151. }
  152. p = *s->rblk + s->rpos;
  153. s->rpos += s->elem_len;
  154. s->rptr += s->elem_len;
  155. return p;
  156. }
  157. const void *saa_rbytes(struct SAA *s, size_t * lenp)
  158. {
  159. const void *p;
  160. size_t len;
  161. if (s->rptr >= s->datalen) {
  162. *lenp = 0;
  163. return NULL;
  164. }
  165. if (s->rpos >= s->blk_len) {
  166. s->rblk++;
  167. s->rpos = 0;
  168. }
  169. len = *lenp;
  170. if (len > s->datalen - s->rptr)
  171. len = s->datalen - s->rptr;
  172. if (len > s->blk_len - s->rpos)
  173. len = s->blk_len - s->rpos;
  174. *lenp = len;
  175. p = *s->rblk + s->rpos;
  176. s->rpos += len;
  177. s->rptr += len;
  178. return p;
  179. }
  180. void saa_rnbytes(struct SAA *s, void *data, size_t len)
  181. {
  182. char *d = data;
  183. nasm_assert(s->rptr + len <= s->datalen);
  184. while (len) {
  185. size_t l;
  186. const void *p;
  187. l = len;
  188. p = saa_rbytes(s, &l);
  189. memcpy(d, p, l);
  190. d += l;
  191. len -= l;
  192. }
  193. }
  194. /* Same as saa_rnbytes, except position the counter first */
  195. void saa_fread(struct SAA *s, size_t posn, void *data, size_t len)
  196. {
  197. size_t ix;
  198. nasm_assert(posn + len <= s->datalen);
  199. if (likely(s->blk_len == SAA_BLKLEN)) {
  200. ix = posn >> SAA_BLKSHIFT;
  201. s->rpos = posn & (SAA_BLKLEN - 1);
  202. } else {
  203. ix = posn / s->blk_len;
  204. s->rpos = posn % s->blk_len;
  205. }
  206. s->rptr = posn;
  207. s->rblk = &s->blk_ptrs[ix];
  208. saa_rnbytes(s, data, len);
  209. }
  210. /* Same as saa_wbytes, except position the counter first */
  211. void saa_fwrite(struct SAA *s, size_t posn, const void *data, size_t len)
  212. {
  213. size_t ix;
  214. /* Seek beyond the end of the existing array not supported */
  215. nasm_assert(posn <= s->datalen);
  216. if (likely(s->blk_len == SAA_BLKLEN)) {
  217. ix = posn >> SAA_BLKSHIFT;
  218. s->wpos = posn & (SAA_BLKLEN - 1);
  219. } else {
  220. ix = posn / s->blk_len;
  221. s->wpos = posn % s->blk_len;
  222. }
  223. s->wptr = posn;
  224. s->wblk = &s->blk_ptrs[ix];
  225. if (!s->wpos) {
  226. s->wpos = s->blk_len;
  227. s->wblk--;
  228. }
  229. saa_wbytes(s, data, len);
  230. }
  231. void saa_fpwrite(struct SAA *s, FILE * fp)
  232. {
  233. const char *data;
  234. size_t len;
  235. saa_rewind(s);
  236. while (len = s->datalen, (data = saa_rbytes(s, &len)) != NULL)
  237. nasm_write(data, len, fp);
  238. }
  239. void saa_write8(struct SAA *s, uint8_t v)
  240. {
  241. saa_wbytes(s, &v, 1);
  242. }
  243. void saa_write16(struct SAA *s, uint16_t v)
  244. {
  245. v = cpu_to_le16(v);
  246. saa_wbytes(s, &v, 2);
  247. }
  248. void saa_write32(struct SAA *s, uint32_t v)
  249. {
  250. v = cpu_to_le32(v);
  251. saa_wbytes(s, &v, 4);
  252. }
  253. void saa_write64(struct SAA *s, uint64_t v)
  254. {
  255. v = cpu_to_le64(v);
  256. saa_wbytes(s, &v, 8);
  257. }
  258. void saa_writeaddr(struct SAA *s, uint64_t v, size_t len)
  259. {
  260. v = cpu_to_le64(v);
  261. saa_wbytes(s, &v, len);
  262. }
  263. /* write unsigned LEB128 value to SAA */
  264. void saa_wleb128u(struct SAA *psaa, int value)
  265. {
  266. char temp[64], *ptemp;
  267. uint8_t byte;
  268. int len;
  269. ptemp = temp;
  270. len = 0;
  271. do {
  272. byte = value & 127;
  273. value >>= 7;
  274. if (value != 0) /* more bytes to come */
  275. byte |= 0x80;
  276. *ptemp = byte;
  277. ptemp++;
  278. len++;
  279. } while (value != 0);
  280. saa_wbytes(psaa, temp, len);
  281. }
  282. /* write signed LEB128 value to SAA */
  283. void saa_wleb128s(struct SAA *psaa, int value)
  284. {
  285. char temp[64], *ptemp;
  286. uint8_t byte;
  287. bool more, negative;
  288. int size, len;
  289. ptemp = temp;
  290. more = 1;
  291. negative = (value < 0);
  292. size = sizeof(int) * 8;
  293. len = 0;
  294. while (more) {
  295. byte = value & 0x7f;
  296. value >>= 7;
  297. if (negative)
  298. /* sign extend */
  299. value |= -(1 << (size - 7));
  300. /* sign bit of byte is second high order bit (0x40) */
  301. if ((value == 0 && !(byte & 0x40)) ||
  302. ((value == -1) && (byte & 0x40)))
  303. more = 0;
  304. else
  305. byte |= 0x80;
  306. *ptemp = byte;
  307. ptemp++;
  308. len++;
  309. }
  310. saa_wbytes(psaa, temp, len);
  311. }