bstruct_bstruct_test.h 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298
  1. /*
  2. DO NOT EDIT THIS FILE!
  3. This file was automatically generated by the bstruct generator.
  4. */
  5. #include <stdint.h>
  6. #include <limits.h>
  7. #include <misc/balign.h>
  8. #include <misc/debug.h>
  9. typedef struct str0_struct str0;
  10. typedef struct {
  11. size_t x_off;
  12. size_t x_size;
  13. #ifndef NDEBUG
  14. size_t x_count;
  15. #endif
  16. size_t len;
  17. size_t align;
  18. } str0Params;
  19. static int str0Params_Init (str0Params *o, int n) WARN_UNUSED;
  20. static int str0Params_Init (str0Params *o, int n)
  21. {
  22. size_t cur_size;
  23. size_t cur_align;
  24. size_t cur_count;
  25. o->len = 0;
  26. o->align = 1;
  27. if ((sizeof(int)) > SIZE_MAX) {
  28. return 0;
  29. }
  30. cur_size = (sizeof(int));
  31. if ((__alignof__(int)) > SIZE_MAX) {
  32. return 0;
  33. }
  34. cur_align = (__alignof__(int));
  35. if (n > SIZE_MAX) {
  36. return 0;
  37. }
  38. cur_count = (n);
  39. if (balign_up_overflows(o->len, cur_align)) {
  40. return 0;
  41. }
  42. o->x_off = balign_up(o->len, cur_align);
  43. o->x_size = cur_size;
  44. #ifndef NDEBUG
  45. o->x_count = cur_count;
  46. #endif
  47. if (cur_count > SIZE_MAX / cur_size) {
  48. return 0;
  49. }
  50. if (o->x_off > SIZE_MAX - cur_count * cur_size) {
  51. return 0;
  52. }
  53. o->len = o->x_off + cur_count * cur_size;
  54. o->align = (cur_align > o->align ? cur_align : o->align);
  55. return 1;
  56. }
  57. static int * str0_x (str0Params *o, str0 *s)
  58. {
  59. return (int *)((uint8_t *)s + o->x_off);
  60. }
  61. static int * str0_x_at (str0Params *o, str0 *s, size_t i)
  62. {
  63. ASSERT(i >= 0)
  64. ASSERT(i < o->x_count)
  65. return (int *)((uint8_t *)s + o->x_off + i * o->x_size);
  66. }
  67. typedef struct str1_struct str1;
  68. typedef struct {
  69. size_t a_off;
  70. size_t a_size;
  71. #ifndef NDEBUG
  72. size_t a_count;
  73. #endif
  74. size_t b_off;
  75. size_t b_size;
  76. #ifndef NDEBUG
  77. size_t b_count;
  78. #endif
  79. size_t c_off;
  80. size_t c_size;
  81. #ifndef NDEBUG
  82. size_t c_count;
  83. #endif
  84. str0Params d_params;
  85. size_t d_off;
  86. size_t d_size;
  87. #ifndef NDEBUG
  88. size_t d_count;
  89. #endif
  90. size_t len;
  91. size_t align;
  92. } str1Params;
  93. static int str1Params_Init (str1Params *o, int nb, int nc, int m) WARN_UNUSED;
  94. static int str1Params_Init (str1Params *o, int nb, int nc, int m)
  95. {
  96. size_t cur_size;
  97. size_t cur_align;
  98. size_t cur_count;
  99. o->len = 0;
  100. o->align = 1;
  101. if ((sizeof(int)) > SIZE_MAX) {
  102. return 0;
  103. }
  104. cur_size = (sizeof(int));
  105. if ((__alignof__(int)) > SIZE_MAX) {
  106. return 0;
  107. }
  108. cur_align = (__alignof__(int));
  109. if (1 > SIZE_MAX) {
  110. return 0;
  111. }
  112. cur_count = (1);
  113. if (balign_up_overflows(o->len, cur_align)) {
  114. return 0;
  115. }
  116. o->a_off = balign_up(o->len, cur_align);
  117. o->a_size = cur_size;
  118. #ifndef NDEBUG
  119. o->a_count = cur_count;
  120. #endif
  121. if (cur_count > SIZE_MAX / cur_size) {
  122. return 0;
  123. }
  124. if (o->a_off > SIZE_MAX - cur_count * cur_size) {
  125. return 0;
  126. }
  127. o->len = o->a_off + cur_count * cur_size;
  128. o->align = (cur_align > o->align ? cur_align : o->align);
  129. if ((sizeof(char)) > SIZE_MAX) {
  130. return 0;
  131. }
  132. cur_size = (sizeof(char));
  133. if ((__alignof__(char)) > SIZE_MAX) {
  134. return 0;
  135. }
  136. cur_align = (__alignof__(char));
  137. if (nb > SIZE_MAX) {
  138. return 0;
  139. }
  140. cur_count = (nb);
  141. if (balign_up_overflows(o->len, cur_align)) {
  142. return 0;
  143. }
  144. o->b_off = balign_up(o->len, cur_align);
  145. o->b_size = cur_size;
  146. #ifndef NDEBUG
  147. o->b_count = cur_count;
  148. #endif
  149. if (cur_count > SIZE_MAX / cur_size) {
  150. return 0;
  151. }
  152. if (o->b_off > SIZE_MAX - cur_count * cur_size) {
  153. return 0;
  154. }
  155. o->len = o->b_off + cur_count * cur_size;
  156. o->align = (cur_align > o->align ? cur_align : o->align);
  157. if ((sizeof(double)) > SIZE_MAX) {
  158. return 0;
  159. }
  160. cur_size = (sizeof(double));
  161. if ((__alignof__(double)) > SIZE_MAX) {
  162. return 0;
  163. }
  164. cur_align = (__alignof__(double));
  165. if (nc > SIZE_MAX) {
  166. return 0;
  167. }
  168. cur_count = (nc);
  169. if (balign_up_overflows(o->len, cur_align)) {
  170. return 0;
  171. }
  172. o->c_off = balign_up(o->len, cur_align);
  173. o->c_size = cur_size;
  174. #ifndef NDEBUG
  175. o->c_count = cur_count;
  176. #endif
  177. if (cur_count > SIZE_MAX / cur_size) {
  178. return 0;
  179. }
  180. if (o->c_off > SIZE_MAX - cur_count * cur_size) {
  181. return 0;
  182. }
  183. o->len = o->c_off + cur_count * cur_size;
  184. o->align = (cur_align > o->align ? cur_align : o->align);
  185. if (!str0Params_Init(&o->d_params, m)) {
  186. return 0;
  187. }
  188. if (o->d_params.len > SIZE_MAX) {
  189. return 0;
  190. }
  191. cur_size = o->d_params.len;
  192. if (o->d_params.align > SIZE_MAX) {
  193. return 0;
  194. }
  195. cur_align = o->d_params.align;
  196. if (1 > SIZE_MAX) {
  197. return 0;
  198. }
  199. cur_count = (1);
  200. if (balign_up_overflows(o->len, cur_align)) {
  201. return 0;
  202. }
  203. o->d_off = balign_up(o->len, cur_align);
  204. o->d_size = cur_size;
  205. #ifndef NDEBUG
  206. o->d_count = cur_count;
  207. #endif
  208. if (cur_count > SIZE_MAX / cur_size) {
  209. return 0;
  210. }
  211. if (o->d_off > SIZE_MAX - cur_count * cur_size) {
  212. return 0;
  213. }
  214. o->len = o->d_off + cur_count * cur_size;
  215. o->align = (cur_align > o->align ? cur_align : o->align);
  216. return 1;
  217. }
  218. static int * str1_a (str1Params *o, str1 *s)
  219. {
  220. return (int *)((uint8_t *)s + o->a_off);
  221. }
  222. static int * str1_a_at (str1Params *o, str1 *s, size_t i)
  223. {
  224. ASSERT(i >= 0)
  225. ASSERT(i < o->a_count)
  226. return (int *)((uint8_t *)s + o->a_off + i * o->a_size);
  227. }
  228. static char * str1_b (str1Params *o, str1 *s)
  229. {
  230. return (char *)((uint8_t *)s + o->b_off);
  231. }
  232. static char * str1_b_at (str1Params *o, str1 *s, size_t i)
  233. {
  234. ASSERT(i >= 0)
  235. ASSERT(i < o->b_count)
  236. return (char *)((uint8_t *)s + o->b_off + i * o->b_size);
  237. }
  238. static double * str1_c (str1Params *o, str1 *s)
  239. {
  240. return (double *)((uint8_t *)s + o->c_off);
  241. }
  242. static double * str1_c_at (str1Params *o, str1 *s, size_t i)
  243. {
  244. ASSERT(i >= 0)
  245. ASSERT(i < o->c_count)
  246. return (double *)((uint8_t *)s + o->c_off + i * o->c_size);
  247. }
  248. static str0 * str1_d (str1Params *o, str1 *s)
  249. {
  250. return (str0 *)((uint8_t *)s + o->d_off);
  251. }
  252. static str0 * str1_d_at (str1Params *o, str1 *s, size_t i)
  253. {
  254. ASSERT(i >= 0)
  255. ASSERT(i < o->d_count)
  256. return (str0 *)((uint8_t *)s + o->d_off + i * o->d_size);
  257. }