qirt.h 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442
  1. #ifndef _QI_RUNTIME_H
  2. #define _QI_RUNTIME_H
  3. #include <ctype.h>
  4. #include <math.h>
  5. #include <setjmp.h>
  6. #include <stdarg.h>
  7. #include <stdint.h>
  8. #include <stdio.h>
  9. #include <stdlib.h>
  10. #include <string.h>
  11. #include <time.h>
  12. typedef int bool;
  13. #define true 1
  14. #define false 0
  15. typedef unsigned long qi_size_t;
  16. typedef long qi_ssize_t;
  17. typedef struct _qi_list_t qi_list_t;
  18. struct _qi_list_t {
  19. void *value;
  20. qi_list_t *next;
  21. };
  22. #define qi_list_empty(list) (!(list)->value)
  23. #define qi_list_first(list) ((list)->value)
  24. #define qi_list_last(list) (qi_list_index((list), -1))
  25. typedef struct _qi_table_t qi_table_t;
  26. typedef struct _qi_table_entry_t qi_table_entry_t;
  27. struct _qi_table_entry_t {
  28. char *key;
  29. void *value;
  30. bool is_deleted;
  31. };
  32. struct _qi_table_t {
  33. qi_table_entry_t *entries;
  34. qi_size_t used;
  35. qi_size_t capacity;
  36. };
  37. #define QI_TABLE_MIN_SIZE 32
  38. #define qi_table_length(table) ((table)->used)
  39. #define qi_table_empty(table) ((table)->used == 0)
  40. #define qi_table_iterate(table, code) \
  41. { \
  42. if (!qi_table_empty(table)) { \
  43. qi_size_t i = 0; \
  44. while (i < (table)->capacity) { \
  45. qi_table_entry_t entry = (table)->entries[i]; \
  46. if (entry.key && !entry.is_deleted) { \
  47. code; \
  48. } \
  49. i++; \
  50. } \
  51. } \
  52. }
  53. typedef struct {
  54. char *str;
  55. qi_size_t used;
  56. qi_size_t allocated;
  57. } qi_buffer_t;
  58. typedef enum {
  59. QI_NULL,
  60. QI_BOOLEAN,
  61. QI_NUMBER,
  62. QI_STRING,
  63. QI_BYTES,
  64. QI_FILE,
  65. QI_LIST,
  66. QI_TUPLE,
  67. QI_TABLE,
  68. QI_FUNCTION,
  69. QI_DATA,
  70. QI_OBJECT
  71. } qi_type_t;
  72. static const char qi_type_names[12][10] = {
  73. "nil", "boolean", "number", "string", "bytes", "file",
  74. "list", "tuple", "table", "function", "data", "object"};
  75. #define qi_repr_type(type) (qi_type_names[(type)])
  76. typedef struct _qi_state_t qi_state_t;
  77. typedef struct _qi_value_t qi_value_t;
  78. typedef qi_value_t *(*qi_handle_t)(qi_state_t *, qi_size_t, qi_list_t *);
  79. typedef struct {
  80. unsigned char *data;
  81. qi_size_t size;
  82. } qi_bytes_t;
  83. struct _qi_value_t {
  84. qi_type_t type;
  85. void *lock;
  86. union {
  87. bool boolean;
  88. double number;
  89. char *string;
  90. qi_bytes_t *bytes;
  91. struct qi_file_t {
  92. FILE *fd;
  93. char mode[4];
  94. bool is_open;
  95. } file;
  96. qi_list_t *list;
  97. struct {
  98. qi_table_t *table;
  99. qi_value_t *metatable;
  100. } table;
  101. struct qi_function_t {
  102. qi_handle_t handle;
  103. char *name;
  104. qi_size_t pargc;
  105. qi_table_t *captured;
  106. qi_value_t *_this;
  107. bool is_builtin;
  108. bool is_pm;
  109. } function;
  110. struct {
  111. unsigned int tag;
  112. void *data;
  113. } data;
  114. } value;
  115. };
  116. struct _qi_state_t {
  117. qi_value_t *nil;
  118. qi_value_t *_true;
  119. qi_value_t *_false;
  120. qi_value_t *zero;
  121. qi_value_t *one;
  122. qi_value_t *nan;
  123. qi_value_t *infinity;
  124. qi_value_t *ninfinity;
  125. qi_value_t *empty_string;
  126. qi_value_t *empty_bytes;
  127. qi_value_t *empty_tuple;
  128. qi_value_t *_stdin;
  129. qi_value_t *_stderr;
  130. qi_value_t *_stdout;
  131. qi_value_t *nnumbers[8];
  132. qi_value_t *numbers[256];
  133. qi_table_t *pseudomethods;
  134. void *pseudomethods_lock;
  135. qi_table_t *intern_strs;
  136. void *intern_strs_lock;
  137. qi_list_t *traps;
  138. qi_list_t *scopes;
  139. qi_list_t *calltrace;
  140. const char *_debug_data;
  141. };
  142. typedef struct _qi_scope_t qi_scope_t;
  143. struct _qi_scope_t {
  144. qi_table_t *scope;
  145. qi_list_t *defers;
  146. bool is_barrier;
  147. void *lock;
  148. };
  149. typedef void (*qi_defer_t)(qi_state_t *);
  150. #define qi_has_metatable(obj) ((obj)->value.table.metatable->type == QI_TABLE)
  151. #define qi_get_metatable(obj) ((obj)->value.table.metatable->value.table.table)
  152. #define _is_meta_name(name) (strncmp((name), "__", 2) == 0)
  153. #define is_meta_name(name) \
  154. ((name)->type == QI_STRING && _is_meta_name((name)->value.string))
  155. #define qi_type(state, value) \
  156. (qi_make_string((state), _qi_type((state), (value))))
  157. #define qi_repr(state, value, quote) \
  158. (_qi_repr((state), qi_list_make(), (value), (quote)))
  159. #define qi_show(state, value) \
  160. (qi_repr(state, value, (value)->type != QI_STRING))
  161. typedef struct _qi_trap_t qi_trap_t;
  162. struct _qi_trap_t {
  163. qi_value_t *value;
  164. qi_defer_t finally;
  165. qi_scope_t *scope;
  166. qi_size_t scopes_count;
  167. qi_size_t calltrace_size;
  168. jmp_buf label;
  169. };
  170. #define qi_try(state, code, handle, defer) \
  171. { \
  172. qi_trap_t *trap = qi_set_trap(state, defer); \
  173. if (setjmp(trap->label)) { \
  174. qi_unset_trap(state, trap); \
  175. if (trap->finally) \
  176. qi_add_defer(state, 0, trap->finally); \
  177. handle; \
  178. if (trap->finally) { \
  179. qi_pop_defer(state, 0); \
  180. trap->finally(state); \
  181. } \
  182. } else { \
  183. code; \
  184. qi_unset_trap(state, trap); \
  185. if (trap->finally) \
  186. trap->finally(state); \
  187. } \
  188. }
  189. typedef struct _qi_symbol_t qi_symbol_t;
  190. struct _qi_symbol_t {
  191. qi_value_t *value;
  192. bool is_constant;
  193. };
  194. #define qi_set(state, is_pf, name, value) \
  195. (_qi_set((state), is_pf, false, (name), (value)))
  196. #define qi_bind(state, is_pf, name, value) \
  197. (_qi_set((state), is_pf, true, (name), (value)))
  198. #define qi_length(state, value) \
  199. (qi_make_number((state), _qi_length((state), (value))))
  200. #define qi_truthy(state, value) \
  201. (qi_make_boolean((state), _qi_truthy((state), (value))))
  202. #define qi_to_boolean(state, x) (qi_cast((state), QI_BOOLEAN, (x)))
  203. #define qi_to_number(state, x) (qi_cast((state), QI_NUMBER, (x)))
  204. #define qi_to_string(state, x) (qi_cast((state), QI_STRING, (x)))
  205. #define qi_to_bytes(state, x) (qi_cast((state), QI_BYTES, (x)))
  206. #define qi_to_list(state, x) (qi_cast((state), QI_LIST, (x)))
  207. #define qi_to_tuple(state, x) (qi_cast((state), QI_TUPLE, (x)))
  208. #define qi_to_table(state, x) (qi_cast((state), QI_TABLE, (x)))
  209. #define qi_get_boolean(state, x) \
  210. ((x)->type == QI_BOOLEAN ? (x)->value.boolean \
  211. : qi_to_boolean(state, x)->value.boolean)
  212. #define qi_get_number(state, x) \
  213. ((x)->type == QI_NUMBER ? (x)->value.number \
  214. : qi_to_number(state, x)->value.number)
  215. #define qi_get_string(state, x) \
  216. ((x)->type == QI_STRING ? (x)->value.string \
  217. : qi_to_string(state, x)->value.string)
  218. #define qi_get_bytes(state, x) \
  219. ((x)->type == QI_BYTES ? (x)->value.bytes \
  220. : qi_to_bytes(state, x)->value.bytes)
  221. #define qi_get_list(state, x) \
  222. ((x)->type == QI_LIST ? (x)->value.list : qi_to_list(state, x)->value.list)
  223. #define qi_get_table(state, x) \
  224. ((x)->type == QI_TABLE ? (x)->value.table.table \
  225. : qi_to_table(state, x)->value.table.table)
  226. #define qi_get_data(state, t, x) \
  227. ((x)->type != QI_DATA || (x)->value.data.tag != (t) \
  228. ? (qi_throw_format((state), "expected data (tag: %d)", (t)), NULL) \
  229. : (x)->value.data.data)
  230. #define qi_push_trace(state, fn, debug_data) \
  231. (qi_list_push((state)->calltrace, \
  232. qi_list_push(qi_list_push(qi_list_make(), (value)), \
  233. (void *)(debug_data))))
  234. #define qi_pop_trace(state) (qi_list_pop((state)->calltrace))
  235. #define qi_equals(state, a, b) \
  236. (qi_make_boolean((state), _qi_equals((state), (a), (b))))
  237. #define qi_not_equals(state, a, b) \
  238. (qi_make_boolean((state), !_qi_equals((state), (a), (b))))
  239. #define qi_is(state, a, b) (qi_make_boolean((state), (a) == (b)))
  240. #define qi_not_is(state, a, b) (qi_make_boolean((state), (a) != (b)))
  241. #define qi_in(state, a, b) (qi_make_boolean((state), _qi_in((state), (a), (b))))
  242. #define qi_not_in(state, a, b) \
  243. (qi_make_boolean((state), !_qi_in((state), (a), (b))))
  244. #define qi_lt(state, a, b) (qi_make_boolean((state), _qi_lt((state), (a), (b))))
  245. #define qi_gt(state, a, b) (qi_make_boolean((state), _qi_gt((state), (a), (b))))
  246. #define _qi_le(state, a, b) \
  247. (_qi_equals((state), (a), (b)) || _qi_lt((state), (a), (b)))
  248. #define _qi_ge(state, a, b) \
  249. (_qi_equals((state), (a), (b)) || _qi_gt((state), (a), (b)))
  250. #define qi_le(state, a, b) (qi_make_boolean((state), _qi_le((state), (a), (b))))
  251. #define qi_ge(state, a, b) (qi_make_boolean((state), _qi_ge((state), (a), (b))))
  252. #define _qi_or(state, a, b) \
  253. (_qi_truthy((state), (a)) || _qi_truthy((state), (b)))
  254. #define qi_or(state, a, b) (qi_make_boolean((state), _qi_or((state), (a), (b))))
  255. #define _qi_and(state, a, b) \
  256. (_qi_truthy((state), (a)) && _qi_truthy((state), (b)))
  257. #define qi_and(state, a, b) \
  258. (qi_make_boolean((state), _qi_and((state), (a), (b))))
  259. #define _qi_not(state, a) (!_qi_truthy((state), (a)))
  260. #define qi_not(state, a) (qi_make_boolean((state), _qi_not((state), (a))))
  261. #define qi_add_builtin(state, name, pargc, handle) \
  262. (qi_decl_const((state), name, \
  263. qi_make_builtin_function(state, name, pargc, handle)))
  264. #define LOCKED(value, code) \
  265. { \
  266. if ((value)->lock) \
  267. qi_lock_acquire((value)->lock); \
  268. code; \
  269. if ((value)->lock) \
  270. qi_lock_release((value)->lock); \
  271. }
  272. void *qi_malloc(qi_size_t size);
  273. void *qi_malloc_atomic(qi_size_t size);
  274. void *qi_realloc(void *old_ptr, qi_size_t size);
  275. void *qi_calloc(qi_size_t count, qi_size_t size);
  276. char *qi_strdup(const char *s);
  277. void qi_free(void *);
  278. qi_list_t *qi_list_make(void);
  279. qi_size_t qi_list_length(qi_list_t *list);
  280. void *qi_list_index(qi_list_t *list, qi_ssize_t index);
  281. qi_list_t *qi_list_push(qi_list_t *list, void *value);
  282. qi_list_t *qi_list_insert(qi_list_t **list, qi_ssize_t index, void *value);
  283. qi_list_t *qi_list_delete(qi_list_t **list, qi_ssize_t index);
  284. void *qi_list_set(qi_list_t *list, qi_ssize_t index, void *value);
  285. void *qi_list_pop(qi_list_t *list);
  286. bool qi_list_contains(qi_list_t *list, void *value);
  287. qi_list_t *qi_list_copy(qi_list_t *list);
  288. qi_table_t *qi_table_make(void);
  289. void *qi_table_get(qi_table_t *table, char *key);
  290. bool qi_table_has(qi_table_t *table, char *key);
  291. qi_table_t *qi_table_set(qi_table_t *table, char *key, void *value);
  292. qi_list_t *qi_table_keys(qi_table_t *table);
  293. bool qi_table_delete(qi_table_t *table, char *key);
  294. qi_table_t *qi_table_copy(qi_table_t *table);
  295. void qi_add_defer(qi_state_t *state, qi_ssize_t index, qi_defer_t defer);
  296. qi_defer_t qi_pop_defer(qi_state_t *state, qi_ssize_t index);
  297. void qi_new_scope(qi_state_t *state);
  298. bool qi_old_scope(qi_state_t *state);
  299. qi_value_t *qi_make_value(qi_type_t type);
  300. #define qi_make_boolean(state, x) ((x) ? (state)->_true : (state)->_false)
  301. qi_value_t *qi_make_number(qi_state_t *state, double number);
  302. qi_value_t *qi_make_string(qi_state_t *state, char *string);
  303. qi_value_t *qi_make_string_copy(qi_state_t *state, char *string);
  304. qi_value_t *qi_make_bytes(qi_state_t *state, unsigned char *bytes,
  305. qi_size_t size);
  306. qi_value_t *qi_make_char(qi_state_t *state, char c);
  307. qi_value_t *qi_make_file(qi_state_t *state, FILE *file, char *mode);
  308. qi_value_t *qi_make_list(qi_state_t *state, qi_list_t *list);
  309. qi_value_t *qi_make_tuple(qi_state_t *state, qi_list_t *tuple);
  310. qi_value_t *qi_make_table(qi_state_t *state, qi_table_t *table);
  311. qi_value_t *qi_make_function(qi_state_t *state, char *name, qi_size_t pargc,
  312. qi_handle_t handle, qi_table_t *captured);
  313. qi_value_t *qi_make_builtin_function(qi_state_t *state, char *name,
  314. qi_size_t pargc, qi_handle_t handle);
  315. qi_value_t *qi_make_data(qi_state_t *state, unsigned int tag, void *data);
  316. qi_value_t *qi_add_pseudomethod(qi_state_t *state, char *name, qi_size_t pargc,
  317. qi_handle_t handle);
  318. qi_value_t *qi_get_method(qi_state_t *state, qi_value_t *value, char *name);
  319. qi_value_t *qi_call_meta(qi_state_t *state, bool *fail_flag, qi_value_t *value,
  320. char *name, qi_size_t count, ...);
  321. char *_qi_type(qi_state_t *state, qi_value_t *value);
  322. char *_qi_repr(qi_state_t *state, qi_list_t *tempstack, qi_value_t *value,
  323. bool quote);
  324. void qi_finalize(void);
  325. void qi_fatal(qi_state_t *state, char *format, ...);
  326. qi_trap_t *qi_set_trap(qi_state_t *state, qi_defer_t finally);
  327. void qi_unset_trap(qi_state_t *state, qi_trap_t *trap);
  328. void qi_throw(qi_state_t *state, qi_value_t *value);
  329. void qi_throw_format(qi_state_t *state, char *format, ...);
  330. qi_value_t *qi_find(qi_state_t *state, char *name);
  331. qi_value_t *qi_get(qi_state_t *state, char *name);
  332. void qi_decl_const(qi_state_t *state, char *name, qi_value_t *value);
  333. void qi_decl(qi_state_t *state, char *name, qi_value_t *value);
  334. qi_value_t *_qi_set(qi_state_t *state, bool is_pf, bool is_constant,
  335. char *name, qi_value_t *value);
  336. size_t _qi_length(qi_state_t *state, qi_value_t *value);
  337. qi_value_t *qi_del(qi_state_t *state, qi_value_t *value, qi_value_t *index);
  338. bool _qi_truthy(qi_state_t *state, qi_value_t *value);
  339. qi_value_t *qi_cast(qi_state_t *state, qi_type_t type, qi_value_t *value);
  340. qi_value_t *qi_iter(qi_state_t *state, qi_value_t *value);
  341. qi_value_t *qi_index(qi_state_t *state, qi_value_t *value, qi_value_t *index);
  342. qi_value_t *qi_index_set(qi_state_t *state, bool is_pf, qi_value_t *value,
  343. qi_value_t *index, qi_value_t *newvalue);
  344. qi_value_t *qi_call(qi_state_t *state, qi_value_t *value, qi_list_t *pargs);
  345. qi_value_t *qi_call_debug(qi_state_t *state, qi_value_t *value,
  346. qi_list_t *pargs, const char *debug_data);
  347. bool _qi_equals(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  348. bool _qi_in(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  349. qi_value_t *qi_add(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  350. qi_value_t *qi_sub(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  351. qi_value_t *qi_mul(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  352. qi_value_t *qi_div(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  353. qi_value_t *qi_idiv(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  354. qi_value_t *qi_mod(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  355. qi_value_t *qi_pow(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  356. qi_value_t *qi_band(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  357. qi_value_t *qi_bor(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  358. qi_value_t *qi_xor(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  359. qi_value_t *qi_shl(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  360. qi_value_t *qi_shr(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  361. bool _qi_lt(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  362. bool _qi_gt(qi_state_t *state, qi_value_t *a, qi_value_t *b);
  363. qi_value_t *qi_negate(qi_state_t *state, qi_value_t *a);
  364. qi_value_t *qi_bnot(qi_state_t *state, qi_value_t *a);
  365. void *qi_thread_create(qi_state_t *state, qi_value_t *fn, qi_list_t *args);
  366. qi_value_t *qi_thread_join(qi_state_t *state, void *td);
  367. void qi_thread_exit(qi_state_t *state, qi_value_t *value);
  368. bool qi_thread_main(void);
  369. void *qi_lock_create(void);
  370. void qi_lock_destroy(void *lock);
  371. void qi_lock_acquire(void *lock);
  372. bool qi_lock_tryacquire(void *lock);
  373. bool qi_lock_acquired(void *lock);
  374. void qi_lock_release(void *lock);
  375. void qi_state_init(qi_state_t **state);
  376. void qi_state_init_debug(qi_state_t **state);
  377. #endif