bstruct_OTPChecker.h 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202
  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 oc_table_struct oc_table;
  10. typedef struct {
  11. size_t id_off;
  12. size_t id_size;
  13. #ifndef NDEBUG
  14. size_t id_count;
  15. #endif
  16. size_t entries_off;
  17. size_t entries_size;
  18. #ifndef NDEBUG
  19. size_t entries_count;
  20. #endif
  21. size_t len;
  22. size_t align;
  23. } oc_tableParams;
  24. static int oc_tableParams_Init (oc_tableParams *o, int num_entries) WARN_UNUSED;
  25. static int oc_tableParams_Init (oc_tableParams *o, int num_entries)
  26. {
  27. size_t cur_size;
  28. size_t cur_align;
  29. size_t cur_count;
  30. o->len = 0;
  31. o->align = 1;
  32. if ((sizeof(uint16_t)) > SIZE_MAX) {
  33. return 0;
  34. }
  35. cur_size = (sizeof(uint16_t));
  36. if ((__alignof__(uint16_t)) > SIZE_MAX) {
  37. return 0;
  38. }
  39. cur_align = (__alignof__(uint16_t));
  40. if (1 > SIZE_MAX) {
  41. return 0;
  42. }
  43. cur_count = (1);
  44. if (balign_up_overflows(o->len, cur_align)) {
  45. return 0;
  46. }
  47. o->id_off = balign_up(o->len, cur_align);
  48. o->id_size = cur_size;
  49. #ifndef NDEBUG
  50. o->id_count = cur_count;
  51. #endif
  52. if (cur_count > SIZE_MAX / cur_size) {
  53. return 0;
  54. }
  55. if (o->id_off > SIZE_MAX - cur_count * cur_size) {
  56. return 0;
  57. }
  58. o->len = o->id_off + cur_count * cur_size;
  59. o->align = (cur_align > o->align ? cur_align : o->align);
  60. if ((sizeof(struct OTPChecker_entry)) > SIZE_MAX) {
  61. return 0;
  62. }
  63. cur_size = (sizeof(struct OTPChecker_entry));
  64. if ((__alignof__(struct OTPChecker_entry)) > SIZE_MAX) {
  65. return 0;
  66. }
  67. cur_align = (__alignof__(struct OTPChecker_entry));
  68. if (num_entries > SIZE_MAX) {
  69. return 0;
  70. }
  71. cur_count = (num_entries);
  72. if (balign_up_overflows(o->len, cur_align)) {
  73. return 0;
  74. }
  75. o->entries_off = balign_up(o->len, cur_align);
  76. o->entries_size = cur_size;
  77. #ifndef NDEBUG
  78. o->entries_count = cur_count;
  79. #endif
  80. if (cur_count > SIZE_MAX / cur_size) {
  81. return 0;
  82. }
  83. if (o->entries_off > SIZE_MAX - cur_count * cur_size) {
  84. return 0;
  85. }
  86. o->len = o->entries_off + cur_count * cur_size;
  87. o->align = (cur_align > o->align ? cur_align : o->align);
  88. return 1;
  89. }
  90. static uint16_t * oc_table_id (oc_tableParams *o, oc_table *s)
  91. {
  92. return (uint16_t *)((uint8_t *)s + o->id_off);
  93. }
  94. static uint16_t * oc_table_id_at (oc_tableParams *o, oc_table *s, size_t i)
  95. {
  96. ASSERT(i >= 0)
  97. ASSERT(i < o->id_count)
  98. return (uint16_t *)((uint8_t *)s + o->id_off + i * o->id_size);
  99. }
  100. static struct OTPChecker_entry * oc_table_entries (oc_tableParams *o, oc_table *s)
  101. {
  102. return (struct OTPChecker_entry *)((uint8_t *)s + o->entries_off);
  103. }
  104. static struct OTPChecker_entry * oc_table_entries_at (oc_tableParams *o, oc_table *s, size_t i)
  105. {
  106. ASSERT(i >= 0)
  107. ASSERT(i < o->entries_count)
  108. return (struct OTPChecker_entry *)((uint8_t *)s + o->entries_off + i * o->entries_size);
  109. }
  110. typedef struct oc_tables_struct oc_tables;
  111. typedef struct {
  112. oc_tableParams tables_params;
  113. size_t tables_off;
  114. size_t tables_size;
  115. #ifndef NDEBUG
  116. size_t tables_count;
  117. #endif
  118. size_t len;
  119. size_t align;
  120. } oc_tablesParams;
  121. static int oc_tablesParams_Init (oc_tablesParams *o, int num_tables, int num_entries) WARN_UNUSED;
  122. static int oc_tablesParams_Init (oc_tablesParams *o, int num_tables, int num_entries)
  123. {
  124. size_t cur_size;
  125. size_t cur_align;
  126. size_t cur_count;
  127. o->len = 0;
  128. o->align = 1;
  129. if (!oc_tableParams_Init(&o->tables_params, num_entries)) {
  130. return 0;
  131. }
  132. if (o->tables_params.len > SIZE_MAX) {
  133. return 0;
  134. }
  135. cur_size = o->tables_params.len;
  136. if (o->tables_params.align > SIZE_MAX) {
  137. return 0;
  138. }
  139. cur_align = o->tables_params.align;
  140. if (num_tables > SIZE_MAX) {
  141. return 0;
  142. }
  143. cur_count = (num_tables);
  144. if (balign_up_overflows(o->len, cur_align)) {
  145. return 0;
  146. }
  147. o->tables_off = balign_up(o->len, cur_align);
  148. o->tables_size = cur_size;
  149. #ifndef NDEBUG
  150. o->tables_count = cur_count;
  151. #endif
  152. if (cur_count > SIZE_MAX / cur_size) {
  153. return 0;
  154. }
  155. if (o->tables_off > SIZE_MAX - cur_count * cur_size) {
  156. return 0;
  157. }
  158. o->len = o->tables_off + cur_count * cur_size;
  159. o->align = (cur_align > o->align ? cur_align : o->align);
  160. return 1;
  161. }
  162. static oc_table * oc_tables_tables (oc_tablesParams *o, oc_tables *s)
  163. {
  164. return (oc_table *)((uint8_t *)s + o->tables_off);
  165. }
  166. static oc_table * oc_tables_tables_at (oc_tablesParams *o, oc_tables *s, size_t i)
  167. {
  168. ASSERT(i >= 0)
  169. ASSERT(i < o->tables_count)
  170. return (oc_table *)((uint8_t *)s + o->tables_off + i * o->tables_size);
  171. }