jim.h 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370
  1. #ifndef JIM_H_
  2. #define JIM_H_
  3. #ifndef JIM_SCOPES_CAPACITY
  4. #define JIM_SCOPES_CAPACITY 128
  5. #endif // JIM_SCOPES_CAPACITY
  6. typedef void* Jim_Sink;
  7. typedef size_t (*Jim_Write)(const void *ptr, size_t size, size_t nmemb, Jim_Sink sink);
  8. typedef enum {
  9. JIM_OK = 0,
  10. JIM_WRITE_ERROR,
  11. JIM_SCOPES_OVERFLOW,
  12. JIM_SCOPES_UNDERFLOW,
  13. JIM_OUT_OF_SCOPE_KEY,
  14. JIM_DOUBLE_KEY
  15. } Jim_Error;
  16. const char *jim_error_string(Jim_Error error);
  17. typedef enum {
  18. JIM_ARRAY_SCOPE,
  19. JIM_OBJECT_SCOPE,
  20. } Jim_Scope_Kind;
  21. typedef struct {
  22. Jim_Scope_Kind kind;
  23. int tail;
  24. int key;
  25. } Jim_Scope;
  26. typedef struct {
  27. Jim_Sink sink;
  28. Jim_Write write;
  29. Jim_Error error;
  30. Jim_Scope scopes[JIM_SCOPES_CAPACITY];
  31. size_t scopes_size;
  32. } Jim;
  33. void jim_null(Jim *jim);
  34. void jim_bool(Jim *jim, int boolean);
  35. void jim_integer(Jim *jim, long long int x);
  36. void jim_float(Jim *jim, double x, int precision);
  37. void jim_string(Jim *jim, const char *str, const unsigned int *size);
  38. void jim_element_begin(Jim *jim);
  39. void jim_element_end(Jim *jim);
  40. void jim_array_begin(Jim *jim);
  41. void jim_array_end(Jim *jim);
  42. void jim_object_begin(Jim *jim);
  43. void jim_member_key(Jim *jim, const char *str, const unsigned int *size);
  44. void jim_object_end(Jim *jim);
  45. #endif // JIM_H_
  46. #ifdef JIM_IMPLEMENTATION
  47. static size_t jim_strlen(const char *s)
  48. {
  49. size_t count = 0;
  50. while (*(s + count)) {
  51. count += 1;
  52. }
  53. return count;
  54. }
  55. static void jim_scope_push(Jim *jim, Jim_Scope_Kind kind)
  56. {
  57. if (jim->error == JIM_OK) {
  58. if (jim->scopes_size < JIM_SCOPES_CAPACITY) {
  59. jim->scopes[jim->scopes_size].kind = kind;
  60. jim->scopes[jim->scopes_size].tail = 0;
  61. jim->scopes[jim->scopes_size].key = 0;
  62. jim->scopes_size += 1;
  63. } else {
  64. jim->error = JIM_SCOPES_OVERFLOW;
  65. }
  66. }
  67. }
  68. static void jim_scope_pop(Jim *jim)
  69. {
  70. if (jim->error == JIM_OK) {
  71. if (jim->scopes_size > 0) {
  72. jim->scopes_size--;
  73. } else {
  74. jim->error = JIM_SCOPES_UNDERFLOW;
  75. }
  76. }
  77. }
  78. static Jim_Scope *jim_current_scope(Jim *jim)
  79. {
  80. if (jim->error == JIM_OK) {
  81. if (jim->scopes_size > 0) {
  82. return &jim->scopes[jim->scopes_size - 1];
  83. }
  84. }
  85. return NULL;
  86. }
  87. static void jim_write(Jim *jim, const char *buffer, size_t size)
  88. {
  89. if (jim->error == JIM_OK) {
  90. if (jim->write(buffer, 1, size, jim->sink) < size) {
  91. jim->error = 1;
  92. }
  93. }
  94. }
  95. static void jim_write_cstr(Jim *jim, const char *cstr)
  96. {
  97. if (jim->error == JIM_OK) {
  98. jim_write(jim, cstr, jim_strlen(cstr));
  99. }
  100. }
  101. static int jim_get_utf8_char_len(unsigned char ch)
  102. {
  103. if ((ch & 0x80) == 0) return 1;
  104. switch (ch & 0xf0) {
  105. case 0xf0:
  106. return 4;
  107. case 0xe0:
  108. return 3;
  109. default:
  110. return 2;
  111. }
  112. }
  113. void jim_element_begin(Jim *jim)
  114. {
  115. if (jim->error == JIM_OK) {
  116. Jim_Scope *scope = jim_current_scope(jim);
  117. if (scope && scope->tail && !scope->key) {
  118. jim_write_cstr(jim, ",");
  119. }
  120. }
  121. }
  122. void jim_element_end(Jim *jim)
  123. {
  124. if (jim->error == JIM_OK) {
  125. Jim_Scope *scope = jim_current_scope(jim);
  126. if (scope) {
  127. scope->tail = 1;
  128. scope->key = 0;
  129. }
  130. }
  131. }
  132. const char *jim_error_string(Jim_Error error)
  133. {
  134. // TODO(#1): error strings are not particularly useful
  135. switch (error) {
  136. case JIM_OK:
  137. return "There is no error. The developer of this software just had a case of \"Task failed successfully\" https://i.imgur.com/Bdb3rkq.jpg - Please contact the developer and tell them that they are very lazy for not checking errors properly.";
  138. case JIM_WRITE_ERROR:
  139. return "Write error";
  140. case JIM_SCOPES_OVERFLOW:
  141. return "Stack of Scopes Overflow";
  142. case JIM_SCOPES_UNDERFLOW:
  143. return "Stack of Scopes Underflow";
  144. case JIM_OUT_OF_SCOPE_KEY:
  145. return "Out of Scope key";
  146. case JIM_DOUBLE_KEY:
  147. return "Tried to set the member key twice";
  148. default:
  149. return NULL;
  150. }
  151. }
  152. void jim_null(Jim *jim)
  153. {
  154. if (jim->error == JIM_OK) {
  155. jim_element_begin(jim);
  156. jim_write_cstr(jim, "null");
  157. jim_element_end(jim);
  158. }
  159. }
  160. void jim_bool(Jim *jim, int boolean)
  161. {
  162. if (jim->error == JIM_OK) {
  163. jim_element_begin(jim);
  164. if (boolean) {
  165. jim_write_cstr(jim, "true");
  166. } else {
  167. jim_write_cstr(jim, "false");
  168. }
  169. jim_element_end(jim);
  170. }
  171. }
  172. static void jim_integer_no_element(Jim *jim, long long int x)
  173. {
  174. if (jim->error == JIM_OK) {
  175. if (x < 0) {
  176. jim_write_cstr(jim, "-");
  177. x = -x;
  178. }
  179. if (x == 0) {
  180. jim_write_cstr(jim, "0");
  181. } else {
  182. char buffer[64];
  183. size_t count = 0;
  184. while (x > 0) {
  185. buffer[count++] = (x % 10) + '0';
  186. x /= 10;
  187. }
  188. for (size_t i = 0; i < count / 2; ++i) {
  189. char t = buffer[i];
  190. buffer[i] = buffer[count - i - 1];
  191. buffer[count - i - 1] = t;
  192. }
  193. jim_write(jim, buffer, count);
  194. }
  195. }
  196. }
  197. void jim_integer(Jim *jim, long long int x)
  198. {
  199. if (jim->error == JIM_OK) {
  200. jim_element_begin(jim);
  201. jim_integer_no_element(jim, x);
  202. jim_element_end(jim);
  203. }
  204. }
  205. static int is_nan_or_inf(double x)
  206. {
  207. unsigned long long int mask = (1ULL << 11ULL) - 1ULL;
  208. return (((*(unsigned long long int*) &x) >> 52ULL) & mask) == mask;
  209. }
  210. void jim_float(Jim *jim, double x, int precision)
  211. {
  212. if (jim->error == JIM_OK) {
  213. if (is_nan_or_inf(x)) {
  214. jim_null(jim);
  215. } else {
  216. jim_element_begin(jim);
  217. jim_integer_no_element(jim, (long long int) x);
  218. x -= (double) (long long int) x;
  219. while (precision-- > 0) {
  220. x *= 10.0;
  221. }
  222. jim_write_cstr(jim, ".");
  223. long long int y = (long long int) x;
  224. if (y < 0) {
  225. y = -y;
  226. }
  227. jim_integer_no_element(jim, y);
  228. jim_element_end(jim);
  229. }
  230. }
  231. }
  232. static void jim_string_no_element(Jim *jim, const char *str, const unsigned int *size)
  233. {
  234. if (jim->error == JIM_OK) {
  235. const char *hex_digits = "0123456789abcdef";
  236. const char *specials = "btnvfr";
  237. const char *p = str;
  238. size_t len = size ? *size : jim_strlen(str);
  239. jim_write_cstr(jim, "\"");
  240. size_t cl;
  241. for (size_t i = 0; i < len; i++) {
  242. unsigned char ch = ((unsigned char *) p)[i];
  243. if (ch == '"' || ch == '\\') {
  244. jim_write(jim, "\\", 1);
  245. jim_write(jim, p + i, 1);
  246. } else if (ch >= '\b' && ch <= '\r') {
  247. jim_write(jim, "\\", 1);
  248. jim_write(jim, &specials[ch - '\b'], 1);
  249. } else if (0x20 <= ch && ch <= 0x7F) { // is printable
  250. jim_write(jim, p + i, 1);
  251. } else if ((cl = jim_get_utf8_char_len(ch)) == 1) {
  252. jim_write(jim, "\\u00", 4);
  253. jim_write(jim, &hex_digits[(ch >> 4) % 0xf], 1);
  254. jim_write(jim, &hex_digits[ch % 0xf], 1);
  255. } else {
  256. jim_write(jim, p + i, cl);
  257. i += cl - 1;
  258. }
  259. }
  260. jim_write_cstr(jim, "\"");
  261. }
  262. }
  263. void jim_string(Jim *jim, const char *str, const unsigned int *size)
  264. {
  265. if (jim->error == JIM_OK) {
  266. jim_element_begin(jim);
  267. jim_string_no_element(jim, str, size);
  268. jim_element_end(jim);
  269. }
  270. }
  271. void jim_array_begin(Jim *jim)
  272. {
  273. if (jim->error == JIM_OK) {
  274. jim_element_begin(jim);
  275. jim_write_cstr(jim, "[");
  276. jim_scope_push(jim, JIM_ARRAY_SCOPE);
  277. }
  278. }
  279. void jim_array_end(Jim *jim)
  280. {
  281. if (jim->error == JIM_OK) {
  282. jim_write_cstr(jim, "]");
  283. jim_scope_pop(jim);
  284. jim_element_end(jim);
  285. }
  286. }
  287. void jim_object_begin(Jim *jim)
  288. {
  289. if (jim->error == JIM_OK) {
  290. jim_element_begin(jim);
  291. jim_write_cstr(jim, "{");
  292. jim_scope_push(jim, JIM_OBJECT_SCOPE);
  293. }
  294. }
  295. void jim_member_key(Jim *jim, const char *str, const unsigned int *size)
  296. {
  297. if (jim->error == JIM_OK) {
  298. jim_element_begin(jim);
  299. Jim_Scope *scope = jim_current_scope(jim);
  300. if (scope && scope->kind == JIM_OBJECT_SCOPE) {
  301. if (!scope->key) {
  302. jim_string_no_element(jim, str, size);
  303. jim_write_cstr(jim, ":");
  304. scope->key = 1;
  305. } else {
  306. jim->error = JIM_DOUBLE_KEY;
  307. }
  308. } else {
  309. jim->error = JIM_OUT_OF_SCOPE_KEY;
  310. }
  311. }
  312. }
  313. void jim_object_end(Jim *jim)
  314. {
  315. if (jim->error == JIM_OK) {
  316. jim_write_cstr(jim, "}");
  317. jim_scope_pop(jim);
  318. jim_element_end(jim);
  319. }
  320. }
  321. #endif // JIM_IMPLEMENTATION