qirt.c 107 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095
  1. #include "qirt.h"
  2. #include <stdio.h>
  3. #define GC_THREADS
  4. #include <gc.h>
  5. #include <pthread.h>
  6. static bool __debug_enabled = false;
  7. static pthread_t __main_tid;
  8. void *qi_malloc(qi_size_t size) {
  9. void *ptr = GC_MALLOC(size);
  10. if (!ptr)
  11. abort();
  12. return ptr;
  13. }
  14. void *qi_malloc_atomic(qi_size_t size) {
  15. void *ptr = GC_MALLOC_ATOMIC(size);
  16. if (!ptr)
  17. abort();
  18. return ptr;
  19. }
  20. void *qi_realloc(void *old_ptr, qi_size_t size) {
  21. void *ptr = GC_realloc(old_ptr, size);
  22. if (!ptr)
  23. abort();
  24. return ptr;
  25. }
  26. void *qi_calloc(qi_size_t count, qi_size_t size) {
  27. void *ptr = GC_MALLOC(count * size);
  28. if (!ptr)
  29. abort();
  30. return ptr;
  31. }
  32. char *qi_strdup(const char *s) {
  33. char *ptr = GC_strdup(s);
  34. if (!ptr)
  35. abort();
  36. return ptr;
  37. }
  38. void qi_free(void *ptr) { GC_FREE(ptr); }
  39. qi_list_t *qi_list_make(void) {
  40. qi_list_t *list = qi_malloc(sizeof(qi_list_t));
  41. list->data = NULL;
  42. list->length = 0;
  43. return list;
  44. }
  45. qi_list_t *qi_list_resize(qi_list_t *list, qi_size_t size) {
  46. if (list->length == size)
  47. return list;
  48. list->length = size;
  49. if (size == 0) {
  50. qi_free(list->data);
  51. list->data = NULL;
  52. } else
  53. list->data = qi_realloc(list->data, sizeof(void *) * list->length);
  54. return list;
  55. }
  56. void *qi_list_index(qi_list_t *list, qi_ssize_t index) {
  57. if (qi_list_empty(list))
  58. return NULL;
  59. if (index < 0)
  60. index += ((qi_ssize_t)qi_list_length(list));
  61. if (index < 0 || index >= qi_list_length(list))
  62. return NULL;
  63. return qi_list_data(list, index);
  64. }
  65. qi_list_t *qi_list_push(qi_list_t *list, void *value) {
  66. qi_list_resize(list, qi_list_length(list) + 1);
  67. qi_list_data(list, qi_list_length(list) - 1) = value;
  68. return list;
  69. }
  70. bool qi_list_insert(qi_list_t *list, qi_ssize_t index, void *value) {
  71. if (index == -1) {
  72. qi_list_push(list, value);
  73. return true;
  74. }
  75. if (index < 0)
  76. index += (qi_ssize_t)qi_list_length(list);
  77. if (index < 0 || index > qi_list_length(list))
  78. return false;
  79. qi_list_resize(list, qi_list_length(list) + 1);
  80. for (qi_size_t i = qi_list_length(list); index == 0? i > 0: i >= index; i--)
  81. qi_list_data(list, i) = qi_list_data(list, i - 1);
  82. qi_list_data(list, index) = value;
  83. return true;
  84. }
  85. bool qi_list_delete(qi_list_t *list, qi_ssize_t index) {
  86. if (qi_list_empty(list))
  87. return false;
  88. if (index < 0)
  89. index += (qi_ssize_t)qi_list_length(list);
  90. if (index < 0 || index >= qi_list_length(list))
  91. return false;
  92. qi_list_data(list, index) = NULL;
  93. if (qi_list_length(list) == 1) {
  94. qi_list_resize(list, 0);
  95. return true;
  96. }
  97. for (qi_size_t i = index; i < qi_list_length(list) - 1; i++)
  98. qi_list_data(list, i) = qi_list_data(list, i + 1);
  99. qi_list_resize(list, qi_list_length(list) - 1);
  100. return true;
  101. }
  102. bool qi_list_set(qi_list_t *list, qi_ssize_t index, void *value) {
  103. qi_size_t length = qi_list_length(list);
  104. if (index < 0)
  105. index += ((qi_ssize_t)length);
  106. if (index == ((qi_ssize_t)length)) {
  107. qi_list_push(list, value);
  108. return true;
  109. }
  110. if (index < 0 || index >= length)
  111. return false;
  112. qi_list_data(list, index) = value;
  113. return true;
  114. }
  115. void *qi_list_pop(qi_list_t *list) {
  116. if (qi_list_empty(list))
  117. return NULL;
  118. void *value = qi_list_last(list);
  119. qi_list_resize(list, qi_list_length(list) - 1);
  120. return value;
  121. }
  122. bool qi_list_contains(qi_list_t *list, void *value) {
  123. if (qi_list_empty(list))
  124. return false;
  125. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  126. if (qi_list_data(list, i) == value)
  127. return true;
  128. return false;
  129. }
  130. qi_list_t *qi_list_copy(qi_list_t *list) {
  131. qi_list_t *newlist = qi_list_make_n(qi_list_length(list));
  132. if (qi_list_empty(list))
  133. return newlist;
  134. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  135. newlist->data[i] = list->data[i];
  136. return newlist;
  137. }
  138. qi_table_t *qi_table_make(void) {
  139. qi_table_t *table = qi_malloc(sizeof(qi_table_t));
  140. table->used = 0;
  141. table->capacity = QI_TABLE_MIN_CAP;
  142. table->entries = qi_calloc(table->capacity, sizeof(qi_table_entry_t));
  143. return table;
  144. }
  145. static uint64_t MM86128(void *key, const int len, uint32_t seed) {
  146. #define ROTL32(x, r) ((x << r) | (x >> (32 - r)))
  147. #define FMIX32(h) \
  148. h ^= h >> 16; \
  149. h *= 0x85ebca6b; \
  150. h ^= h >> 13; \
  151. h *= 0xc2b2ae35; \
  152. h ^= h >> 16;
  153. const uint8_t *data = (const uint8_t *)key;
  154. const int nblocks = len / 16;
  155. uint32_t h1 = seed;
  156. uint32_t h2 = seed;
  157. uint32_t h3 = seed;
  158. uint32_t h4 = seed;
  159. uint32_t c1 = 0x239b961b;
  160. uint32_t c2 = 0xab0e9789;
  161. uint32_t c3 = 0x38b34ae5;
  162. uint32_t c4 = 0xa1e38b93;
  163. const uint32_t *blocks = (const uint32_t *)(data + nblocks * 16);
  164. for (int i = -nblocks; i; i++) {
  165. uint32_t k1 = blocks[i * 4 + 0];
  166. uint32_t k2 = blocks[i * 4 + 1];
  167. uint32_t k3 = blocks[i * 4 + 2];
  168. uint32_t k4 = blocks[i * 4 + 3];
  169. k1 *= c1;
  170. k1 = ROTL32(k1, 15);
  171. k1 *= c2;
  172. h1 ^= k1;
  173. h1 = ROTL32(h1, 19);
  174. h1 += h2;
  175. h1 = h1 * 5 + 0x561ccd1b;
  176. k2 *= c2;
  177. k2 = ROTL32(k2, 16);
  178. k2 *= c3;
  179. h2 ^= k2;
  180. h2 = ROTL32(h2, 17);
  181. h2 += h3;
  182. h2 = h2 * 5 + 0x0bcaa747;
  183. k3 *= c3;
  184. k3 = ROTL32(k3, 17);
  185. k3 *= c4;
  186. h3 ^= k3;
  187. h3 = ROTL32(h3, 15);
  188. h3 += h4;
  189. h3 = h3 * 5 + 0x96cd1c35;
  190. k4 *= c4;
  191. k4 = ROTL32(k4, 18);
  192. k4 *= c1;
  193. h4 ^= k4;
  194. h4 = ROTL32(h4, 13);
  195. h4 += h1;
  196. h4 = h4 * 5 + 0x32ac3b17;
  197. }
  198. const uint8_t *tail = (const uint8_t *)(data + nblocks * 16);
  199. uint32_t k1 = 0;
  200. uint32_t k2 = 0;
  201. uint32_t k3 = 0;
  202. uint32_t k4 = 0;
  203. switch (len & 15) {
  204. case 15:
  205. k4 ^= tail[14] << 16;
  206. case 14:
  207. k4 ^= tail[13] << 8;
  208. case 13:
  209. k4 ^= tail[12] << 0;
  210. k4 *= c4;
  211. k4 = ROTL32(k4, 18);
  212. k4 *= c1;
  213. h4 ^= k4;
  214. case 12:
  215. k3 ^= tail[11] << 24;
  216. case 11:
  217. k3 ^= tail[10] << 16;
  218. case 10:
  219. k3 ^= tail[9] << 8;
  220. case 9:
  221. k3 ^= tail[8] << 0;
  222. k3 *= c3;
  223. k3 = ROTL32(k3, 17);
  224. k3 *= c4;
  225. h3 ^= k3;
  226. case 8:
  227. k2 ^= tail[7] << 24;
  228. case 7:
  229. k2 ^= tail[6] << 16;
  230. case 6:
  231. k2 ^= tail[5] << 8;
  232. case 5:
  233. k2 ^= tail[4] << 0;
  234. k2 *= c2;
  235. k2 = ROTL32(k2, 16);
  236. k2 *= c3;
  237. h2 ^= k2;
  238. case 4:
  239. k1 ^= tail[3] << 24;
  240. case 3:
  241. k1 ^= tail[2] << 16;
  242. case 2:
  243. k1 ^= tail[1] << 8;
  244. case 1:
  245. k1 ^= tail[0] << 0;
  246. k1 *= c1;
  247. k1 = ROTL32(k1, 15);
  248. k1 *= c2;
  249. h1 ^= k1;
  250. }
  251. h1 ^= len;
  252. h2 ^= len;
  253. h3 ^= len;
  254. h4 ^= len;
  255. h1 += h2;
  256. h1 += h3;
  257. h1 += h4;
  258. h2 += h1;
  259. h3 += h1;
  260. h4 += h1;
  261. FMIX32(h1);
  262. FMIX32(h2);
  263. FMIX32(h3);
  264. FMIX32(h4);
  265. h1 += h2;
  266. h1 += h3;
  267. h1 += h4;
  268. h2 += h1;
  269. h3 += h1;
  270. h4 += h1;
  271. return (((uint64_t)h2) << 32) | h1;
  272. }
  273. static uint32_t QI_HASH_SEED = 0;
  274. void *qi_table_get(qi_table_t *table, char *key) {
  275. if (qi_table_empty(table))
  276. return NULL;
  277. uint64_t hash = MM86128(key, strlen(key), QI_HASH_SEED);
  278. qi_size_t index = hash % table->capacity;
  279. qi_size_t i = index;
  280. while (table->entries[i].key) {
  281. if (!table->entries[i].is_deleted &&
  282. strcmp(table->entries[i].key, key) == 0)
  283. return table->entries[i].value;
  284. i++;
  285. if (i >= table->capacity)
  286. i = 0;
  287. if (i == index)
  288. break;
  289. }
  290. return NULL;
  291. }
  292. bool qi_table_has(qi_table_t *table, char *key) {
  293. if (qi_table_empty(table))
  294. return false;
  295. uint64_t hash = MM86128(key, strlen(key), QI_HASH_SEED);
  296. qi_size_t index = hash % table->capacity;
  297. qi_size_t i = index;
  298. while (table->entries[i].key) {
  299. if (!table->entries[i].is_deleted &&
  300. strcmp(table->entries[i].key, key) == 0)
  301. return true;
  302. i++;
  303. if (i >= table->capacity)
  304. i = 0;
  305. if (i == index)
  306. break;
  307. }
  308. return false;
  309. }
  310. static void qi_table_entry_set(qi_table_entry_t *entries, char *key,
  311. void *value, qi_size_t capacity,
  312. qi_size_t *used) {
  313. uint64_t hash = MM86128(key, strlen(key), QI_HASH_SEED);
  314. qi_size_t index = hash % capacity;
  315. qi_size_t i = index;
  316. while (entries[i].key) {
  317. if (strcmp(entries[i].key, key) == 0) {
  318. entries[i].value = value;
  319. if (entries[i].is_deleted) {
  320. if (used)
  321. (*used)++;
  322. entries[i].is_deleted = false;
  323. }
  324. return;
  325. } else if (entries[i].is_deleted)
  326. break;
  327. i++;
  328. if (i >= capacity)
  329. i = 0;
  330. if (i == index)
  331. break;
  332. }
  333. if (used)
  334. (*used)++;
  335. entries[i].key = key;
  336. entries[i].value = value;
  337. entries[i].is_deleted = false;
  338. }
  339. qi_table_t *qi_table_set(qi_table_t *table, char *key, void *value) {
  340. if (table->used >= table->capacity) {
  341. qi_size_t capacity = table->capacity + QI_TABLE_MIN_CAP;
  342. qi_table_entry_t *entries = qi_calloc(capacity, sizeof(qi_table_entry_t));
  343. for (qi_size_t i = 0; i < table->capacity; i++) {
  344. qi_table_entry_t entry = table->entries[i];
  345. if (entry.key && !entry.is_deleted)
  346. qi_table_entry_set(entries, entry.key, entry.value, capacity, NULL);
  347. }
  348. qi_free(table->entries);
  349. table->entries = entries;
  350. table->capacity = capacity;
  351. }
  352. qi_table_entry_set(table->entries, key, value, table->capacity, &table->used);
  353. return table;
  354. }
  355. qi_list_t *qi_table_keys(qi_table_t *table) {
  356. qi_list_t *list = qi_list_make();
  357. qi_table_iterate(table, { qi_list_push(list, entry.key); });
  358. return list;
  359. }
  360. bool qi_table_delete(qi_table_t *table, char *key) {
  361. uint64_t hash = MM86128(key, strlen(key), QI_HASH_SEED);
  362. qi_size_t index = hash % table->capacity;
  363. qi_size_t i = index;
  364. while (table->entries[i].key) {
  365. if (!table->entries[i].is_deleted &&
  366. strcmp(table->entries[i].key, key) == 0) {
  367. table->entries[i].value = NULL;
  368. table->entries[i].is_deleted = true;
  369. table->used--;
  370. if (table->capacity > QI_TABLE_MIN_CAP &&
  371. table->used <= table->capacity - QI_TABLE_MIN_CAP) {
  372. qi_size_t capacity = table->capacity - QI_TABLE_MIN_CAP;
  373. qi_table_entry_t *entries =
  374. qi_calloc(capacity, sizeof(qi_table_entry_t));
  375. for (qi_size_t i = 0; i < table->capacity; i++) {
  376. qi_table_entry_t entry = table->entries[i];
  377. if (entry.key && !entry.is_deleted)
  378. qi_table_entry_set(entries, entry.key, entry.value, capacity, NULL);
  379. }
  380. qi_free(table->entries);
  381. table->entries = entries;
  382. table->capacity = capacity;
  383. }
  384. return true;
  385. }
  386. i++;
  387. if (i >= table->capacity)
  388. i = 0;
  389. if (i == index)
  390. break;
  391. }
  392. return false;
  393. }
  394. qi_table_t *qi_table_copy(qi_table_t *table) {
  395. qi_table_t *newtable = qi_table_make();
  396. qi_table_iterate(table, { qi_table_set(newtable, entry.key, entry.value); });
  397. return newtable;
  398. }
  399. static qi_buffer_t *qi_buffer_make(void) {
  400. qi_buffer_t *buf = qi_malloc(sizeof(qi_buffer_t));
  401. buf->str = NULL;
  402. buf->used = buf->allocated = 0;
  403. return buf;
  404. }
  405. static void qi_buffer_append(qi_buffer_t *buf, char c) {
  406. buf->used++;
  407. if (buf->used > buf->allocated) {
  408. buf->allocated++;
  409. buf->str = qi_realloc(buf->str, sizeof(char) * buf->allocated);
  410. }
  411. buf->str[buf->used - 1] = c;
  412. }
  413. static void qi_buffer_append_str(qi_buffer_t *buf, char *s) {
  414. while (*s)
  415. qi_buffer_append(buf, *s++);
  416. }
  417. static char *qi_buffer_read(qi_buffer_t *buf) {
  418. if (buf->used == 0 || buf->str[buf->used - 1])
  419. qi_buffer_append(buf, 0);
  420. return buf->str;
  421. }
  422. void qi_add_defer(qi_state_t *state, qi_ssize_t index, qi_defer_t defer) {
  423. if (qi_list_empty(state->scopes))
  424. return;
  425. qi_scope_t *scope = qi_list_last(state->scopes);
  426. qi_list_insert(scope->defers, index, (void *)defer);
  427. }
  428. qi_defer_t qi_pop_defer(qi_state_t *state, qi_ssize_t index) {
  429. if (qi_list_empty(state->scopes))
  430. return NULL;
  431. qi_scope_t *scope = qi_list_last(state->scopes);
  432. qi_defer_t defer = qi_list_index(scope->defers, index);
  433. if (defer)
  434. qi_list_delete(scope->defers, index);
  435. return defer;
  436. }
  437. void qi_new_scope(qi_state_t *state) {
  438. qi_scope_t *scope = qi_malloc(sizeof(qi_scope_t));
  439. scope->scope = qi_table_make();
  440. scope->defers = qi_list_make();
  441. scope->is_barrier = false;
  442. scope->lock = qi_lock_create();
  443. qi_list_push(state->scopes, scope);
  444. }
  445. bool qi_old_scope(qi_state_t *state) {
  446. qi_scope_t *scope;
  447. qi_list_t *defers;
  448. if (qi_list_empty(state->scopes))
  449. return false;
  450. scope = qi_list_last(state->scopes);
  451. if (scope->is_barrier)
  452. return false;
  453. defers = scope->defers;
  454. if (qi_list_empty(defers)) {
  455. qi_list_pop(state->scopes);
  456. return true;
  457. }
  458. scope->defers = qi_list_make();
  459. for (qi_size_t i = 0; i < qi_list_length(defers); i++) {
  460. qi_defer_t defer = (qi_defer_t)(qi_list_data(defers, i));
  461. defer(state);
  462. }
  463. qi_list_pop(state->scopes);
  464. return true;
  465. }
  466. qi_value_t *qi_call_meta(qi_state_t *state, bool *fail_flag, qi_value_t *value,
  467. char *name, qi_size_t count, ...);
  468. void qi_value_finalizer(GC_PTR _value, GC_PTR _state) {
  469. qi_state_t *state = (qi_state_t *)_state;
  470. qi_value_t *value = (qi_value_t *)_value;
  471. if (value->type == QI_TABLE && value->value.table.metatable)
  472. qi_call_meta(state, NULL, value, "__fin", 1, value);
  473. else if (value->type == QI_FILE && value->value.file.is_open &&
  474. value->value.file.fd != stdin && value->value.file.fd != stderr &&
  475. value->value.file.fd != stdout) {
  476. fclose(value->value.file.fd);
  477. value->value.file.is_open = false;
  478. }
  479. if (value->type == QI_TABLE || value->type == QI_LIST) {
  480. if (value->lock)
  481. qi_lock_destroy(value->lock);
  482. value->lock = NULL;
  483. }
  484. }
  485. qi_value_t *qi_make_value(qi_type_t type) {
  486. qi_value_t *value;
  487. if (type == QI_NUMBER || type == QI_BOOLEAN || type == QI_FILE)
  488. value = qi_malloc_atomic(sizeof(qi_value_t));
  489. else
  490. value = qi_malloc(sizeof(qi_value_t));
  491. value->type = type;
  492. value->lock = NULL;
  493. return value;
  494. }
  495. qi_value_t *qi_make_number(qi_state_t *state, double number) {
  496. qi_value_t *value;
  497. if (isnan(number))
  498. return state->nan;
  499. else if (number == INFINITY)
  500. return state->infinity;
  501. else if (number == -INFINITY)
  502. return state->ninfinity;
  503. else if (number >= 0 && number < 256 && number == (double)((qi_size_t)number))
  504. return state->numbers[(qi_size_t)number];
  505. else if (number < 0 && number >= -8 &&
  506. fabs(number) == (double)((qi_size_t)fabs(number)))
  507. return state->nnumbers[((qi_size_t)fabs(number)) - 1];
  508. value = qi_make_value(QI_NUMBER);
  509. value->value.number = number;
  510. return value;
  511. }
  512. qi_value_t *qi_make_string(qi_state_t *state, char *string) {
  513. qi_value_t *value;
  514. qi_size_t len = strlen(string);
  515. if (len == 0)
  516. return state->empty_string;
  517. else if (len <= 24) {
  518. qi_lock_acquire(state->intern_strs_lock);
  519. value = qi_table_get(state->intern_strs, string);
  520. qi_lock_release(state->intern_strs_lock);
  521. if (value)
  522. return value;
  523. }
  524. value = qi_make_value(QI_STRING);
  525. value->value.string = string;
  526. if (len <= 24) {
  527. qi_lock_acquire(state->intern_strs_lock);
  528. qi_table_set(state->intern_strs, string, value);
  529. qi_lock_release(state->intern_strs_lock);
  530. }
  531. return value;
  532. }
  533. qi_value_t *qi_make_string_copy(qi_state_t *state, char *string) {
  534. return qi_make_string(state, qi_strdup(string));
  535. }
  536. qi_value_t *qi_make_bytes(qi_state_t *state, unsigned char *bytes,
  537. qi_size_t size) {
  538. qi_value_t *value;
  539. if (size == 0)
  540. return state->empty_bytes;
  541. value = qi_make_value(QI_BYTES);
  542. value->value.bytes = qi_malloc(sizeof(qi_bytes_t));
  543. value->value.bytes->data = bytes;
  544. value->value.bytes->size = size;
  545. return value;
  546. }
  547. qi_value_t *qi_make_char(qi_state_t *state, char c) {
  548. qi_value_t *value = qi_make_value(QI_STRING);
  549. char string[2];
  550. string[0] = c;
  551. string[1] = 0;
  552. value->value.string = qi_strdup(string);
  553. return value;
  554. }
  555. qi_value_t *qi_make_file(qi_state_t *state, FILE *file, char *mode) {
  556. qi_value_t *value = qi_make_value(QI_FILE);
  557. value->value.file.fd = file;
  558. strncpy(value->value.file.mode, mode, 4);
  559. value->value.file.is_open = true;
  560. GC_register_finalizer(value, qi_value_finalizer, (void *)state, NULL, NULL);
  561. return value;
  562. }
  563. qi_value_t *qi_make_list(qi_state_t *state, qi_list_t *list) {
  564. qi_value_t *value = qi_make_value(QI_LIST);
  565. value->lock = qi_lock_create();
  566. value->value.list = !list? qi_list_make(): list;
  567. GC_register_finalizer(value, qi_value_finalizer, (void *)state, NULL, NULL);
  568. return value;
  569. }
  570. qi_value_t *qi_make_tuple(qi_state_t *state, qi_list_t *tuple) {
  571. qi_value_t *value;
  572. if (!tuple || qi_list_empty(tuple))
  573. return state->empty_tuple;
  574. value = qi_make_value(QI_TUPLE);
  575. value->value.list = tuple;
  576. return value;
  577. }
  578. qi_value_t *qi_make_table(qi_state_t *state, qi_table_t *table) {
  579. qi_value_t *value = qi_make_value(QI_TABLE);
  580. value->lock = qi_lock_create();
  581. value->value.table.table = !table? qi_table_make(): table;
  582. value->value.table.metatable = state->nil;
  583. GC_register_finalizer(value, qi_value_finalizer, (void *)state, NULL, NULL);
  584. return value;
  585. }
  586. qi_value_t *qi_make_function(qi_state_t *state, char *name, qi_size_t pargc,
  587. qi_handle_t handle, qi_table_t *captured) {
  588. qi_value_t *value = qi_make_value(QI_FUNCTION);
  589. value->value.function.name = name;
  590. value->value.function.pargc = pargc;
  591. value->value.function.handle = handle;
  592. value->value.function.captured = captured;
  593. value->value.function.is_builtin = false;
  594. value->value.function.is_pm = false;
  595. return value;
  596. }
  597. qi_value_t *qi_make_builtin_function(qi_state_t *state, char *name,
  598. qi_size_t pargc, qi_handle_t handle) {
  599. qi_value_t *value = qi_make_value(QI_FUNCTION);
  600. value->value.function.name = name;
  601. value->value.function.pargc = pargc;
  602. value->value.function.handle = handle;
  603. value->value.function.captured = NULL;
  604. value->value.function.is_builtin = true;
  605. value->value.function.is_pm = false;
  606. return value;
  607. }
  608. qi_value_t *qi_make_data(qi_state_t *state, unsigned int tag, void *data) {
  609. qi_value_t *value = qi_make_value(QI_DATA);
  610. value->value.data.tag = tag;
  611. value->value.data.data = data;
  612. return value;
  613. }
  614. static qi_value_t *qi_get_pseudomethod(qi_state_t *state, qi_value_t *value,
  615. char *name) {
  616. qi_lock_acquire(state->pseudomethods_lock);
  617. char pseudomethod_name[64];
  618. snprintf(pseudomethod_name, sizeof(pseudomethod_name), "%s.%s",
  619. qi_repr_type(value->type), name);
  620. qi_value_t *meta = qi_table_get(state->pseudomethods, pseudomethod_name);
  621. qi_lock_release(state->pseudomethods_lock);
  622. return meta;
  623. }
  624. qi_value_t *qi_add_pseudomethod(qi_state_t *state, char *name, qi_size_t pargc,
  625. qi_handle_t handle) {
  626. qi_value_t *method = qi_make_function(state, name, pargc + 1, handle, NULL);
  627. method->value.function.is_pm = true;
  628. qi_lock_acquire(state->pseudomethods_lock);
  629. qi_table_set(state->pseudomethods, name, method);
  630. qi_lock_release(state->pseudomethods_lock);
  631. return method;
  632. }
  633. qi_value_t *qi_get_method(qi_state_t *state, qi_value_t *value, char *name) {
  634. if (value->type != QI_TABLE)
  635. return qi_get_pseudomethod(state, value, name);
  636. qi_value_t *method = NULL;
  637. LOCKED(value, {
  638. if (qi_has_metatable(value))
  639. method = qi_table_get(qi_get_metatable(value), name);
  640. });
  641. if (!method)
  642. return qi_get_pseudomethod(state, value, name);
  643. return method;
  644. }
  645. qi_value_t *qi_call_meta(qi_state_t *state, bool *fail_flag, qi_value_t *value,
  646. char *name, qi_size_t count, ...) {
  647. qi_value_t *meta = qi_get_method(state, value, name);
  648. if (!meta)
  649. return NULL;
  650. qi_list_t *args = qi_list_make();
  651. va_list vargs;
  652. va_start(vargs, count);
  653. for (qi_size_t i = 0; i < count; i++)
  654. qi_list_push(args, va_arg(vargs, qi_value_t *));
  655. va_end(vargs);
  656. qi_value_t *ret = NULL;
  657. if (fail_flag) {
  658. qi_try(
  659. state, { ret = qi_call(state, meta, args); },
  660. {
  661. if (trap->value == state->nil) {
  662. *fail_flag = true;
  663. ret = NULL;
  664. } else
  665. qi_throw(state, trap->value);
  666. },
  667. NULL);
  668. } else
  669. ret = qi_call(state, meta, args);
  670. return ret;
  671. }
  672. char *_qi_type(qi_state_t *state, qi_value_t *value) {
  673. qi_value_t *meta;
  674. if ((meta = qi_call_meta(state, NULL, value, "__type", 1, value))) {
  675. if (meta->type != QI_STRING)
  676. qi_throw_format(state, "__type returned non-string value (%s)",
  677. _qi_type(state, meta));
  678. char *name = meta->value.string;
  679. for (int i = 0; i < sizeof(qi_type_names); i++)
  680. if (strcmp(qi_type_names[i], name) == 0)
  681. qi_throw_format(state,
  682. "__type returned type name should not match builtin "
  683. "type names (got '%s')",
  684. name);
  685. return name;
  686. }
  687. if (value->type == QI_TABLE) {
  688. qi_lock_acquire(value->lock);
  689. if (qi_has_metatable(value)) {
  690. qi_lock_release(value->lock);
  691. return (char *)qi_repr_type(QI_OBJECT);
  692. }
  693. qi_lock_release(value->lock);
  694. }
  695. return (char *)qi_repr_type(value->type);
  696. }
  697. char *_qi_repr(qi_state_t *state, qi_list_t *tempstack, qi_value_t *value,
  698. bool quote) {
  699. char string[128];
  700. qi_buffer_t *buffer;
  701. bool flag;
  702. qi_value_t *meta;
  703. if ((meta = qi_call_meta(state, NULL, value, quote ? "__repr" : "__str", 1,
  704. value))) {
  705. if (meta->type != QI_STRING)
  706. qi_throw_format(state, "%s returned non-string value (%s)",
  707. quote ? "__repr" : "__str", _qi_type(state, meta));
  708. return meta->value.string;
  709. } else if (quote &&
  710. (meta = qi_call_meta(state, NULL, value, "__str", 1, value))) {
  711. if (meta->type != QI_STRING)
  712. qi_throw_format(state, "__str returned non-string value (%s)",
  713. _qi_type(state, meta));
  714. return meta->value.string;
  715. }
  716. if (value == state->nil)
  717. return qi_strdup("nil");
  718. else if (value == state->_true)
  719. return qi_strdup("true");
  720. else if (value == state->_false)
  721. return qi_strdup("false");
  722. else if (value == state->zero)
  723. return qi_strdup("0");
  724. else if (value == state->one)
  725. return qi_strdup("1");
  726. else if (value == state->nan)
  727. return qi_strdup("NAN");
  728. else if (value == state->infinity)
  729. return qi_strdup("INFINITY");
  730. else if (value == state->ninfinity)
  731. return qi_strdup("-INFINITY");
  732. else if (value == state->empty_string) {
  733. if (quote)
  734. return qi_strdup("\"\"");
  735. return qi_strdup("");
  736. } else if (value == state->empty_bytes)
  737. return qi_strdup("bytes([])");
  738. else if (value == state->empty_tuple)
  739. return qi_strdup("()");
  740. switch (value->type) {
  741. case QI_NULL:
  742. return qi_strdup("nil");
  743. case QI_BOOLEAN:
  744. return qi_strdup(value->value.boolean ? "True" : "False");
  745. case QI_NUMBER:
  746. if (isnan(value->value.number))
  747. return qi_strdup("NAN");
  748. else if (value->value.number == INFINITY)
  749. return qi_strdup("INFINITY");
  750. else if (value->value.number == -INFINITY)
  751. return qi_strdup("-INFINITY");
  752. snprintf(string, sizeof(string), "%.15g", value->value.number);
  753. return qi_strdup(string);
  754. case QI_STRING:
  755. buffer = qi_buffer_make();
  756. if (quote)
  757. qi_buffer_append(buffer, '"');
  758. for (qi_size_t i = 0; i < strlen(value->value.string); i++) {
  759. char c = value->value.string[i];
  760. if (quote) {
  761. switch (c) {
  762. case '"':
  763. case '\\':
  764. qi_buffer_append(buffer, '\\');
  765. break;
  766. case '\n':
  767. qi_buffer_append(buffer, '\\');
  768. qi_buffer_append(buffer, 'n');
  769. continue;
  770. case '\t':
  771. qi_buffer_append(buffer, '\\');
  772. qi_buffer_append(buffer, 't');
  773. continue;
  774. case '\r':
  775. qi_buffer_append(buffer, '\\');
  776. qi_buffer_append(buffer, 'r');
  777. continue;
  778. }
  779. if (!isprint(c)) {
  780. char temp[8];
  781. snprintf(temp, sizeof(temp), "\\x%02x", (unsigned char)c);
  782. qi_buffer_append_str(buffer, temp);
  783. continue;
  784. }
  785. }
  786. qi_buffer_append(buffer, c);
  787. }
  788. if (quote)
  789. qi_buffer_append(buffer, '"');
  790. return qi_buffer_read(buffer);
  791. case QI_BYTES:
  792. if (!quote) {
  793. if (value->value.bytes->size == 0)
  794. return qi_strdup("");
  795. buffer = qi_buffer_make();
  796. qi_buffer_append_str(buffer, (char *)value->value.bytes->data);
  797. return qi_buffer_read(buffer);
  798. }
  799. if (value->value.bytes->size == 0)
  800. return qi_strdup("bytes([])");
  801. buffer = qi_buffer_make();
  802. qi_buffer_append_str(buffer, "bytes([");
  803. for (qi_size_t i = 0; i < value->value.bytes->size; i++) {
  804. snprintf(string, sizeof(string), "%d", value->value.bytes->data[i]);
  805. qi_buffer_append_str(buffer, string);
  806. if (i != value->value.bytes->size - 1)
  807. qi_buffer_append_str(buffer, ", ");
  808. }
  809. qi_buffer_append_str(buffer, "])");
  810. return qi_buffer_read(buffer);
  811. case QI_FILE:
  812. snprintf(string, sizeof(string), "<file %d>", fileno(value->value.file.fd));
  813. return qi_strdup(string);
  814. case QI_LIST:
  815. if (qi_list_contains(tempstack, value))
  816. return qi_strdup("[...]");
  817. LOCKED(value, {
  818. if (qi_list_empty(value->value.list)) {
  819. qi_lock_release(value->lock);
  820. return qi_strdup("[]");
  821. }
  822. qi_list_push(tempstack, value);
  823. buffer = qi_buffer_make();
  824. qi_buffer_append(buffer, '[');
  825. for (qi_size_t i = 0; i < qi_list_length(value->value.list); i++) {
  826. qi_buffer_append_str(buffer,
  827. _qi_repr(state, tempstack, qi_list_data(value->value.list, i), true));
  828. if (i != qi_list_length(value->value.list) - 1)
  829. qi_buffer_append_str(buffer, ", ");
  830. }
  831. qi_buffer_append(buffer, ']');
  832. });
  833. return qi_buffer_read(buffer);
  834. case QI_TUPLE:
  835. if (qi_list_empty(value->value.list))
  836. return qi_strdup("()");
  837. if (qi_list_contains(tempstack, value))
  838. return qi_strdup("(...)");
  839. qi_list_push(tempstack, value);
  840. buffer = qi_buffer_make();
  841. qi_buffer_append(buffer, '(');
  842. if (qi_list_length(value->value.list) == 1) {
  843. qi_buffer_append_str(buffer,
  844. _qi_repr(state, tempstack, qi_list_first(value->value.list), true));
  845. qi_buffer_append_str(buffer, ", ");
  846. } else
  847. for (qi_size_t i = 0; i < qi_list_length(value->value.list); i++) {
  848. qi_buffer_append_str(buffer,
  849. _qi_repr(state, tempstack, qi_list_data(value->value.list, i), true));
  850. if (i != qi_list_length(value->value.list) - 1)
  851. qi_buffer_append_str(buffer, ", ");
  852. }
  853. qi_buffer_append(buffer, ')');
  854. return qi_buffer_read(buffer);
  855. case QI_TABLE:
  856. if (qi_list_contains(tempstack, value))
  857. return qi_strdup("{...}");
  858. LOCKED(value, {
  859. if (qi_table_empty(value->value.table.table)) {
  860. qi_lock_release(value->lock);
  861. return qi_strdup(qi_has_metatable(value) ? "<object {}>" : "{}");
  862. }
  863. qi_list_push(tempstack, value);
  864. buffer = qi_buffer_make();
  865. flag = true;
  866. if (qi_has_metatable(value))
  867. qi_buffer_append_str(buffer, "<object ");
  868. qi_buffer_append(buffer, '{');
  869. qi_table_iterate(value->value.table.table, {
  870. if (flag)
  871. flag = false;
  872. else
  873. qi_buffer_append_str(buffer, ", ");
  874. qi_buffer_append(buffer, '"');
  875. qi_buffer_append_str(buffer, entry.key);
  876. qi_buffer_append(buffer, '"');
  877. qi_buffer_append_str(buffer, ": ");
  878. qi_buffer_append_str(buffer,
  879. _qi_repr(state, tempstack, entry.value, true));
  880. });
  881. qi_buffer_append(buffer, '}');
  882. if (qi_has_metatable(value))
  883. qi_buffer_append(buffer, '>');
  884. });
  885. return qi_buffer_read(buffer);
  886. case QI_FUNCTION:
  887. snprintf(string, sizeof(string),
  888. value->value.function.is_builtin ? "<built-in function %s>"
  889. : "<function %s>",
  890. value->value.function.name);
  891. return qi_strdup(string);
  892. case QI_DATA:
  893. snprintf(string, sizeof(string), "<data %d>", value->value.data.tag);
  894. return qi_strdup(string);
  895. default:
  896. return qi_strdup("<unknown>");
  897. }
  898. }
  899. static void __fprint_pthread_t(FILE *fd, pthread_t td) {
  900. unsigned char *ptr = (unsigned char *)(void *)&td;
  901. fprintf(fd, "0x");
  902. for (qi_size_t i = 0; i < sizeof(td); i++)
  903. fprintf(fd, "%02x", (unsigned)(ptr[i]));
  904. }
  905. void qi_finalize(void) { GC_invoke_finalizers(); }
  906. void qi_fatal(qi_state_t *state, char *format, ...) {
  907. va_list args;
  908. va_start(args, format);
  909. if (state->_debug_data)
  910. fprintf(stderr, "%s:\n ", state->_debug_data);
  911. if (!qi_thread_main()) {
  912. fputs("Runtime error (thread ", stderr);
  913. __fprint_pthread_t(stderr, pthread_self());
  914. fputs("): ", stderr);
  915. } else
  916. fputs("Runtime error: ", stderr);
  917. vfprintf(stderr, format, args);
  918. fputs(".\n", stderr);
  919. va_end(args);
  920. if (__debug_enabled && !qi_list_empty(state->calltrace)) {
  921. fputs("Traceback (more recent call last):\n", stderr);
  922. for (qi_size_t i = 0; i < qi_list_length(state->calltrace); i++) {
  923. qi_list_t *entry = qi_list_data(state->calltrace, i);
  924. qi_value_t *func = qi_list_data(entry, 0);
  925. const char *debug_data = qi_list_data(entry, 1);
  926. if (debug_data)
  927. fprintf(stderr, " %s, call to %s\n", debug_data,
  928. func->value.function.name);
  929. else
  930. fprintf(stderr, " File N/A, line N/A, call to %s\n",
  931. func->value.function.name);
  932. }
  933. }
  934. if (!qi_thread_main())
  935. pthread_exit(NULL);
  936. else {
  937. qi_finalize();
  938. exit(1);
  939. }
  940. }
  941. static void __qi_unset_trap(qi_state_t *state) {
  942. qi_trap_t *trap = qi_list_pop(state->traps);
  943. if (trap->finally)
  944. trap->finally(state);
  945. }
  946. qi_trap_t *qi_set_trap(qi_state_t *state, qi_defer_t finally) {
  947. qi_trap_t *trap = qi_malloc(sizeof(qi_trap_t));
  948. trap->value = NULL;
  949. trap->finally = finally;
  950. trap->scope = qi_list_last(state->scopes);
  951. trap->scopes_count = qi_list_length(state->scopes);
  952. trap->calltrace_size =
  953. !__debug_enabled ? 0 : qi_list_length(state->calltrace);
  954. qi_list_push(state->traps, trap);
  955. qi_add_defer(state, 0, __qi_unset_trap);
  956. return trap;
  957. }
  958. void qi_unset_trap(qi_state_t *state, qi_trap_t *trap) {
  959. qi_list_delete(trap->scope->defers, 0);
  960. qi_list_pop(state->traps);
  961. if (trap->value) {
  962. for (size_t i = 0, k = qi_list_length(state->scopes) - trap->scopes_count;
  963. i < k; i++)
  964. qi_old_scope(state);
  965. if (__debug_enabled)
  966. for (size_t i = 0,
  967. k = qi_list_length(state->calltrace) - trap->calltrace_size;
  968. i < k; i++)
  969. qi_list_pop(state->calltrace);
  970. }
  971. }
  972. void qi_throw(qi_state_t *state, qi_value_t *value) {
  973. if (qi_list_empty(state->traps)) {
  974. while (qi_old_scope(state))
  975. ;
  976. qi_fatal(state, "uncaught exception: %s", qi_repr(state, value, false));
  977. }
  978. qi_trap_t *trap = qi_list_last(state->traps);
  979. trap->value = value;
  980. longjmp(trap->label, 1);
  981. }
  982. void qi_throw_format(qi_state_t *state, char *format, ...) {
  983. char buffer[512];
  984. va_list args;
  985. va_start(args, format);
  986. vsnprintf(buffer, sizeof(buffer), format, args);
  987. va_end(args);
  988. qi_throw(state, qi_make_string_copy(state, buffer));
  989. }
  990. qi_value_t *qi_find(qi_state_t *state, char *name) {
  991. qi_ssize_t scopes_count = qi_list_length(state->scopes);
  992. if (scopes_count > 0)
  993. for (qi_ssize_t i = scopes_count - 1; i >= 0; i--) {
  994. qi_scope_t *scope = qi_list_index(state->scopes, i);
  995. if (scope->is_barrier)
  996. continue;
  997. qi_lock_acquire(scope->lock);
  998. qi_symbol_t *symbol = qi_table_get(scope->scope, name);
  999. qi_lock_release(scope->lock);
  1000. if (symbol)
  1001. return symbol->value;
  1002. }
  1003. return NULL;
  1004. }
  1005. qi_value_t *qi_get(qi_state_t *state, char *name) {
  1006. qi_value_t *value;
  1007. if (strcmp(name, "nil") == 0)
  1008. return state->nil;
  1009. else if (strcmp(name, "true") == 0)
  1010. return state->_true;
  1011. else if (strcmp(name, "false") == 0)
  1012. return state->_false;
  1013. else if (strcmp(name, "STDIN") == 0)
  1014. return state->_stdin;
  1015. else if (strcmp(name, "STDERR") == 0)
  1016. return state->_stderr;
  1017. else if (strcmp(name, "STDOUT") == 0)
  1018. return state->_stdout;
  1019. else if (strcmp(name, "NAN") == 0)
  1020. return state->nan;
  1021. else if (strcmp(name, "INFINITY") == 0)
  1022. return state->infinity;
  1023. value = qi_find(state, name);
  1024. if (!value)
  1025. qi_throw_format(state, "undefined symbol: '%s'", name);
  1026. return value;
  1027. }
  1028. static void _qi_decl(qi_state_t *state, char *name, qi_value_t *value,
  1029. bool is_constant) {
  1030. qi_scope_t *scope = qi_list_last(state->scopes);
  1031. qi_symbol_t *symbol;
  1032. qi_lock_acquire(scope->lock);
  1033. symbol = qi_table_get(scope->scope, name);
  1034. if (symbol) {
  1035. if (is_constant || symbol->is_constant) {
  1036. qi_lock_release(scope->lock);
  1037. qi_throw_format(state, "redeclaration of constant symbol: '%s'", name);
  1038. }
  1039. symbol->value = value;
  1040. } else {
  1041. symbol = qi_malloc(sizeof(qi_symbol_t));
  1042. symbol->value = value;
  1043. symbol->is_constant = is_constant;
  1044. qi_table_set(scope->scope, name, symbol);
  1045. }
  1046. qi_lock_release(scope->lock);
  1047. }
  1048. void qi_decl_const(qi_state_t *state, char *name, qi_value_t *value) {
  1049. _qi_decl(state, name, value, true);
  1050. }
  1051. void qi_decl(qi_state_t *state, char *name, qi_value_t *value) {
  1052. _qi_decl(state, name, value, false);
  1053. }
  1054. qi_value_t *_qi_set(qi_state_t *state, bool is_pf, bool is_constant,
  1055. char *name, qi_value_t *value) {
  1056. qi_ssize_t scopes_count = qi_list_length(state->scopes);
  1057. if (scopes_count > 1)
  1058. for (qi_ssize_t i = scopes_count - 1; i >= 0; i--) {
  1059. qi_scope_t *scope = qi_list_index(state->scopes, i);
  1060. if (scope->is_barrier)
  1061. continue;
  1062. qi_lock_acquire(scope->lock);
  1063. qi_symbol_t *symbol = qi_table_get(scope->scope, name);
  1064. if (symbol) {
  1065. if (is_constant || symbol->is_constant) {
  1066. qi_lock_release(scope->lock);
  1067. qi_throw_format(state, "redeclaration of constant symbol: '%s'",
  1068. name);
  1069. }
  1070. qi_value_t *old = symbol->value;
  1071. symbol->value = value;
  1072. qi_lock_release(scope->lock);
  1073. return !is_pf && old ? old : value;
  1074. }
  1075. qi_lock_release(scope->lock);
  1076. }
  1077. qi_symbol_t *symbol = qi_malloc(sizeof(qi_symbol_t));
  1078. symbol->value = value;
  1079. symbol->is_constant = is_constant;
  1080. qi_scope_t *scope = qi_list_last(state->scopes);
  1081. qi_lock_acquire(scope->lock);
  1082. qi_table_set(scope->scope, name, symbol);
  1083. qi_lock_release(scope->lock);
  1084. return value;
  1085. }
  1086. size_t _qi_length(qi_state_t *state, qi_value_t *value) {
  1087. qi_value_t *meta;
  1088. bool fail = false;
  1089. if ((meta = qi_call_meta(state, &fail, value, "__len", 1, value))) {
  1090. if (meta->type != QI_NUMBER)
  1091. qi_throw_format(state, "__len returned non-number value (%s)",
  1092. _qi_type(state, meta));
  1093. return meta->value.number;
  1094. }
  1095. if (fail)
  1096. goto leave;
  1097. if (value == state->empty_string || value == state->empty_bytes ||
  1098. value == state->empty_tuple)
  1099. return 0;
  1100. switch (value->type) {
  1101. case QI_STRING:
  1102. return strlen(value->value.string);
  1103. case QI_BYTES:
  1104. return value->value.bytes->size;
  1105. case QI_LIST: {
  1106. qi_size_t length = 0;
  1107. LOCKED(value, { length = qi_list_length(value->value.list); });
  1108. return length;
  1109. }
  1110. case QI_TUPLE:
  1111. return qi_list_length(value->value.list);
  1112. case QI_TABLE: {
  1113. qi_size_t length = 0;
  1114. LOCKED(value, { length = qi_table_length(value->value.table.table); });
  1115. return length;
  1116. }
  1117. default:
  1118. break;
  1119. }
  1120. leave:
  1121. qi_throw_format(state, "cannot get length of %s", _qi_type(state, value));
  1122. return 0;
  1123. }
  1124. qi_value_t *qi_del(qi_state_t *state, qi_value_t *value, qi_value_t *index) {
  1125. qi_value_t *meta;
  1126. bool fail = false;
  1127. if ((meta = qi_call_meta(state, &fail, value, "__del", 2, value, index)))
  1128. return meta;
  1129. if (fail)
  1130. goto leave;
  1131. switch (value->type) {
  1132. case QI_LIST:
  1133. if (index->type == QI_NUMBER) {
  1134. bool res;
  1135. LOCKED(value, {
  1136. res = qi_list_delete(value->value.list, index->value.number);
  1137. });
  1138. if (!res)
  1139. qi_throw_format(state, "list index out of range: %s",
  1140. qi_repr(state, index, true));
  1141. return value;
  1142. }
  1143. break;
  1144. case QI_TABLE:
  1145. if (index->type == QI_STRING) {
  1146. bool res;
  1147. LOCKED(value, {
  1148. res = qi_table_delete(value->value.table.table, index->value.string);
  1149. });
  1150. if (!res)
  1151. qi_throw_format(state, "no such key: %s", qi_repr(state, index, true));
  1152. return value;
  1153. }
  1154. break;
  1155. default:
  1156. break;
  1157. }
  1158. leave:
  1159. qi_throw_format(state, "cannot index %s with %s", _qi_type(state, value),
  1160. _qi_type(state, index));
  1161. return NULL;
  1162. }
  1163. bool _qi_truthy(qi_state_t *state, qi_value_t *value) {
  1164. qi_value_t *meta;
  1165. if ((meta = qi_call_meta(state, NULL, value, "__bool", 1, value))) {
  1166. if (meta->type != QI_BOOLEAN)
  1167. qi_throw_format(state, "__bool returned non-boolean value (%s)",
  1168. _qi_type(state, meta));
  1169. return meta->value.boolean;
  1170. }
  1171. switch (value->type) {
  1172. case QI_NULL:
  1173. return false;
  1174. case QI_BOOLEAN:
  1175. return value->value.boolean;
  1176. case QI_NUMBER:
  1177. return value->value.number != 0;
  1178. case QI_STRING:
  1179. case QI_BYTES:
  1180. case QI_LIST:
  1181. case QI_TUPLE:
  1182. case QI_TABLE:
  1183. return _qi_length(state, value) != 0;
  1184. default:
  1185. return true;
  1186. }
  1187. return true;
  1188. }
  1189. qi_value_t *qi_cast(qi_state_t *state, qi_type_t type, qi_value_t *value) {
  1190. if (value->type == type)
  1191. return value;
  1192. bool fail = false;
  1193. switch (type) {
  1194. case QI_BOOLEAN:
  1195. return qi_truthy(state, value);
  1196. case QI_NUMBER: {
  1197. qi_value_t *meta;
  1198. if ((meta = qi_call_meta(state, &fail, value, "__num", 1, value))) {
  1199. if (meta->type != QI_NUMBER)
  1200. qi_throw_format(state, "__num returned non-number value (%s)",
  1201. _qi_type(state, meta));
  1202. return meta;
  1203. }
  1204. if (fail)
  1205. goto leave;
  1206. switch (value->type) {
  1207. case QI_NULL:
  1208. return state->zero;
  1209. case QI_BOOLEAN:
  1210. return qi_make_number(state, value->value.boolean);
  1211. case QI_STRING:
  1212. return qi_make_number(state, strtod(value->value.string, NULL));
  1213. default:
  1214. break;
  1215. }
  1216. } break;
  1217. case QI_STRING:
  1218. if (value->type == QI_BYTES) {
  1219. qi_buffer_t *buffer = qi_buffer_make();
  1220. for (qi_size_t i = 0; i < value->value.bytes->size; i++)
  1221. qi_buffer_append(buffer, value->value.bytes->data[i]);
  1222. return qi_make_string(state, qi_buffer_read(buffer));
  1223. }
  1224. return qi_make_string(state, qi_repr(state, value, false));
  1225. case QI_BYTES: {
  1226. qi_value_t *meta;
  1227. if ((meta = qi_call_meta(state, &fail, value, "__bytes", 1, value))) {
  1228. if (meta->type != QI_BYTES)
  1229. qi_throw_format(state, "__bytes returned non-bytes value (%s)",
  1230. _qi_type(state, meta));
  1231. return meta;
  1232. }
  1233. if (fail)
  1234. goto leave;
  1235. switch (value->type) {
  1236. case QI_STRING:
  1237. return qi_make_bytes(state, (unsigned char *)(value->value.string),
  1238. strlen(value->value.string));
  1239. case QI_LIST: {
  1240. qi_size_t length;
  1241. unsigned char *temp;
  1242. LOCKED(value, {
  1243. qi_list_t *list = value->value.list;
  1244. length = qi_list_length(list);
  1245. temp = qi_malloc(length);
  1246. if (!qi_list_empty(list))
  1247. for (qi_size_t i = 0; i < length; i++) {
  1248. qi_value_t *byte = qi_list_data(list, i);
  1249. if (byte->type != QI_NUMBER) {
  1250. qi_lock_release(value->lock);
  1251. qi_throw_format(state,
  1252. "cannot cast %s to %s (expected list of numbers, but element #%zu is %s)",
  1253. _qi_type(state, value), qi_repr_type(type), i, _qi_type(state, byte));
  1254. }
  1255. temp[i] = (unsigned char)(byte->value.number);
  1256. }
  1257. });
  1258. return qi_make_bytes(state, temp, length);
  1259. }
  1260. default:
  1261. break;
  1262. }
  1263. } break;
  1264. case QI_LIST: {
  1265. qi_value_t *meta;
  1266. if ((meta = qi_call_meta(state, &fail, value, "__list", 1, value))) {
  1267. if (meta->type != QI_LIST)
  1268. qi_throw_format(state, "__list returned non-list value (%s)",
  1269. _qi_type(state, meta));
  1270. return meta;
  1271. }
  1272. if (fail)
  1273. goto leave;
  1274. switch (value->type) {
  1275. case QI_STRING: {
  1276. qi_size_t length = strlen(value->value.string);
  1277. qi_list_t *list = qi_list_make_n(length);
  1278. for (qi_size_t i = 0; i < length; i++)
  1279. qi_list_data(list, i) = qi_make_char(state, value->value.string[i]);
  1280. return qi_make_list(state, list);
  1281. }
  1282. case QI_BYTES: {
  1283. qi_list_t *list = qi_list_make_n(value->value.bytes->size);
  1284. for (qi_size_t i = 0; i < value->value.bytes->size; i++)
  1285. qi_list_data(list, i) = qi_make_number(state, value->value.bytes->data[i]);
  1286. return qi_make_list(state, list);
  1287. }
  1288. case QI_TABLE: {
  1289. qi_list_t *keys;
  1290. LOCKED(value, { keys = qi_table_keys(value->value.table.table); });
  1291. for (qi_size_t i = 0; i < qi_list_length(keys); i++)
  1292. qi_list_data(keys, i) = qi_make_string(state, qi_list_data(keys, i));
  1293. return qi_make_list(state, keys);
  1294. }
  1295. case QI_TUPLE: return qi_make_list(state, qi_list_copy(value->value.list));
  1296. default:
  1297. break;
  1298. }
  1299. } break;
  1300. case QI_TABLE: {
  1301. qi_value_t *meta;
  1302. if ((meta = qi_call_meta(state, &fail, value, "__table", 1, value))) {
  1303. if (meta->type != QI_TABLE)
  1304. qi_throw_format(state, "__table returned non-table value (%s)",
  1305. _qi_type(state, meta));
  1306. return meta;
  1307. }
  1308. if (fail)
  1309. goto leave;
  1310. switch (value->type) {
  1311. case QI_LIST:
  1312. case QI_TUPLE: {
  1313. qi_table_t *table = qi_table_make();
  1314. if (value->type == QI_LIST)
  1315. qi_lock_acquire(value->lock);
  1316. qi_list_t *list = value->value.list;
  1317. if (!qi_list_empty(list))
  1318. for (qi_size_t i = 0; i < qi_list_length(list); i++) {
  1319. qi_value_t *pair = qi_list_data(list, i);
  1320. if (pair->type == QI_LIST)
  1321. qi_lock_acquire(pair->lock);
  1322. if ((pair->type != QI_LIST && pair->type != QI_TUPLE) ||
  1323. qi_list_length(pair->value.list) != 2) {
  1324. if (value->type == QI_LIST)
  1325. qi_lock_release(value->lock);
  1326. if (pair->type == QI_LIST)
  1327. qi_lock_release(pair->lock);
  1328. qi_throw_format(state,
  1329. "cannot cast %s to %s (expected sequence of pairs)",
  1330. _qi_type(state, value), qi_repr_type(type));
  1331. }
  1332. qi_value_t *left = qi_list_data(pair->value.list, 0);
  1333. if (left->type != QI_STRING) {
  1334. if (value->type == QI_LIST)
  1335. qi_lock_release(value->lock);
  1336. if (pair->type == QI_LIST)
  1337. qi_lock_release(pair->lock);
  1338. qi_throw_format(state,
  1339. "cannot cast %s to %s (expected first element of "
  1340. "pair to be a string)",
  1341. _qi_type(state, value), qi_repr_type(type));
  1342. }
  1343. qi_value_t *right = qi_list_data(pair->value.list, 1);
  1344. if (pair->type == QI_LIST)
  1345. qi_lock_release(pair->lock);
  1346. qi_table_set(table, left->value.string, right);
  1347. }
  1348. if (value->type == QI_LIST)
  1349. qi_lock_release(value->lock);
  1350. return qi_make_table(state, table);
  1351. }
  1352. default:
  1353. break;
  1354. }
  1355. } break;
  1356. case QI_TUPLE: {
  1357. qi_value_t *meta;
  1358. if ((meta = qi_call_meta(state, &fail, value, "__tuple", 1, value))) {
  1359. if (meta->type != QI_TUPLE)
  1360. qi_throw_format(state, "__tuple returned non-tuple value (%s)",
  1361. _qi_type(state, meta));
  1362. return meta;
  1363. }
  1364. if (fail)
  1365. goto leave;
  1366. switch (value->type) {
  1367. case QI_LIST: {
  1368. qi_list_t *list;
  1369. LOCKED(value, {
  1370. list = qi_list_copy(value->value.list);
  1371. });
  1372. return qi_make_tuple(state, list);
  1373. }
  1374. case QI_BYTES: {
  1375. qi_list_t *list = qi_list_make_n(value->value.bytes->size);
  1376. for (qi_size_t i = 0; i < value->value.bytes->size; i++)
  1377. qi_list_data(list, i) = qi_make_number(state, value->value.bytes->data[i]);
  1378. return qi_make_tuple(state, list);
  1379. }
  1380. case QI_STRING: {
  1381. qi_size_t length = strlen(value->value.string);
  1382. qi_list_t *list = qi_list_make_n(length);
  1383. for (qi_size_t i = 0; i < length; i++)
  1384. qi_list_data(list, i) = qi_make_char(state, value->value.string[i]);
  1385. return qi_make_tuple(state, list);
  1386. }
  1387. default:
  1388. break;
  1389. }
  1390. }
  1391. default:
  1392. break;
  1393. }
  1394. leave:
  1395. qi_throw_format(state, "cannot cast %s to %s", _qi_type(state, value),
  1396. qi_repr_type(type));
  1397. return NULL;
  1398. }
  1399. qi_value_t *qi_iter(qi_state_t *state, qi_value_t *value) {
  1400. qi_value_t *meta;
  1401. bool fail = false;
  1402. if ((meta = qi_call_meta(state, &fail, value, "__iter", 1, value)))
  1403. return qi_iter(state, meta);
  1404. if (fail)
  1405. qi_throw_format(state, "cannot iterate %s", _qi_type(state, value));
  1406. return qi_to_list(state, value);
  1407. }
  1408. qi_value_t *qi_index(qi_state_t *state, qi_value_t *value, qi_value_t *index) {
  1409. qi_value_t *meta;
  1410. bool fail = false;
  1411. if (index->type == QI_STRING &&
  1412. (meta = qi_get_method(state, value, index->value.string))) {
  1413. if (meta->type == QI_FUNCTION && !meta->value.function.is_builtin) {
  1414. qi_value_t *newmeta = qi_make_function(
  1415. state,
  1416. meta->value.function.is_pm ? meta->value.function.name
  1417. : index->value.string,
  1418. meta->value.function.pargc, meta->value.function.handle,
  1419. meta->value.function.captured);
  1420. if (!is_meta_name(index))
  1421. newmeta->value.function._this = value;
  1422. return newmeta;
  1423. }
  1424. return meta;
  1425. } else if ((meta = qi_call_meta(state, &fail, value, "__index", 2, value,
  1426. index)))
  1427. return meta;
  1428. if (fail)
  1429. goto leave;
  1430. switch (value->type) {
  1431. case QI_STRING:
  1432. if (index->type == QI_NUMBER) {
  1433. qi_size_t length = strlen(value->value.string);
  1434. qi_ssize_t i = (qi_ssize_t)(index->value.number);
  1435. if (i < 0)
  1436. i += (qi_ssize_t)length;
  1437. if (i < 0 || i >= (qi_ssize_t)length)
  1438. qi_throw_format(state, "string index out of range: %s",
  1439. qi_repr(state, index, true));
  1440. return qi_make_char(state, value->value.string[i]);
  1441. }
  1442. break;
  1443. case QI_BYTES:
  1444. if (index->type == QI_NUMBER) {
  1445. qi_size_t length = value->value.bytes->size;
  1446. qi_ssize_t i = (qi_ssize_t)(index->value.number);
  1447. if (i < 0)
  1448. i += (qi_ssize_t)length;
  1449. if (i < 0 || i >= (qi_ssize_t)length)
  1450. qi_throw_format(state, "bytes index out of range: %s",
  1451. qi_repr(state, index, true));
  1452. return qi_make_number(state, value->value.bytes->data[i]);
  1453. }
  1454. break;
  1455. case QI_LIST:
  1456. if (index->type == QI_NUMBER) {
  1457. qi_value_t *indexed;
  1458. LOCKED(value, {
  1459. indexed =
  1460. qi_list_index(value->value.list, (qi_ssize_t)(index->value.number));
  1461. });
  1462. if (!indexed)
  1463. qi_throw_format(state, "list index out of range: %s",
  1464. qi_repr(state, index, true));
  1465. return indexed;
  1466. }
  1467. break;
  1468. case QI_TUPLE:
  1469. if (index->type == QI_NUMBER) {
  1470. qi_value_t *indexed =
  1471. qi_list_index(value->value.list, (qi_ssize_t)(index->value.number));
  1472. if (!indexed)
  1473. qi_throw_format(state, "tuple index out of range: %s",
  1474. qi_repr(state, index, true));
  1475. return indexed;
  1476. }
  1477. break;
  1478. case QI_TABLE:
  1479. if (index->type == QI_STRING) {
  1480. qi_value_t *indexed;
  1481. LOCKED(value, {
  1482. indexed = qi_table_get(value->value.table.table, index->value.string);
  1483. });
  1484. if (!indexed)
  1485. qi_throw_format(state, "no such key in table: %s",
  1486. qi_repr(state, index, true));
  1487. return indexed;
  1488. }
  1489. break;
  1490. default:
  1491. break;
  1492. }
  1493. leave:
  1494. qi_throw_format(state, "cannot index %s with %s", _qi_type(state, value),
  1495. _qi_type(state, index));
  1496. return NULL;
  1497. }
  1498. qi_value_t *qi_index_set(qi_state_t *state, bool is_pf, qi_value_t *value,
  1499. qi_value_t *index, qi_value_t *newvalue) {
  1500. qi_value_t *meta;
  1501. bool fail = false;
  1502. if ((meta = qi_call_meta(state, &fail, value, "__index_set", 3, value, index,
  1503. newvalue)))
  1504. return meta;
  1505. else if (fail)
  1506. goto leave;
  1507. else if (value->type == QI_TABLE && qi_has_metatable(value) &&
  1508. index->type == QI_STRING) {
  1509. if (qi_table_has(qi_get_metatable(value), index->value.string)) {
  1510. qi_value_t *old;
  1511. if (!is_pf)
  1512. old = qi_table_get(qi_get_metatable(value), index->value.string);
  1513. qi_table_set(qi_get_metatable(value), index->value.string, newvalue);
  1514. return !is_pf && old ? old : newvalue;
  1515. }
  1516. }
  1517. switch (value->type) {
  1518. case QI_LIST:
  1519. if (index->type == QI_NUMBER) {
  1520. qi_value_t *old;
  1521. LOCKED(value, {
  1522. if (!is_pf)
  1523. old = qi_list_index(value->value.list,
  1524. (qi_ssize_t)(index->value.number));
  1525. qi_list_set(value->value.list, (qi_ssize_t)(index->value.number), newvalue);
  1526. });
  1527. if (!newvalue)
  1528. qi_throw_format(state, "list index out of range: %s",
  1529. qi_repr(state, index, true));
  1530. return !is_pf && old ? old : newvalue;
  1531. }
  1532. break;
  1533. case QI_TABLE:
  1534. if (index->type == QI_STRING) {
  1535. qi_value_t *old;
  1536. LOCKED(value, {
  1537. if (!is_pf)
  1538. old = qi_table_get(value->value.table.table, index->value.string);
  1539. qi_table_set(value->value.table.table, index->value.string, newvalue);
  1540. });
  1541. return !is_pf && old ? old : newvalue;
  1542. }
  1543. break;
  1544. default:
  1545. break;
  1546. }
  1547. leave:
  1548. qi_throw_format(state, "cannot index %s with %s", _qi_type(state, value),
  1549. _qi_type(state, index));
  1550. return NULL;
  1551. }
  1552. static qi_value_t *_qi_call(qi_state_t *state, qi_value_t *value,
  1553. qi_list_t *pargs, const char *debug_data) {
  1554. if (value->type != QI_FUNCTION) {
  1555. qi_value_t *meta;
  1556. if ((meta =
  1557. qi_call_meta(state, NULL, value, "__call", 2, value,
  1558. qi_make_list(state, pargs ? pargs : qi_list_make()))))
  1559. return meta;
  1560. qi_throw_format(state, "cannot call %s", _qi_type(state, value));
  1561. }
  1562. if (value->value.function._this) {
  1563. qi_list_t *temp = !pargs? qi_list_make(): qi_list_copy(pargs);
  1564. qi_list_insert(temp, 0, value->value.function._this);
  1565. pargs = temp;
  1566. }
  1567. qi_size_t pargc = !pargs ? 0 : qi_list_length(pargs);
  1568. if (pargc < value->value.function.pargc)
  1569. qi_throw_format(state,
  1570. "not enough positional arguments in call to '%s': need at "
  1571. "least %zu, got %zu",
  1572. value->value.function.name, value->value.function.pargc,
  1573. pargc);
  1574. if (__debug_enabled)
  1575. qi_push_trace(state, value, debug_data);
  1576. if (!value->value.function.is_builtin) {
  1577. qi_new_scope(state);
  1578. qi_decl_const(state, "it", value);
  1579. qi_decl(state, "arguments",
  1580. qi_make_list(state, pargs ? pargs : qi_list_make()));
  1581. if (value->value.function.captured) {
  1582. qi_table_iterate(value->value.function.captured,
  1583. { qi_decl(state, entry.key, entry.value); });
  1584. }
  1585. }
  1586. qi_value_t *result = value->value.function.handle(state, pargc, pargs);
  1587. if (!value->value.function.is_builtin)
  1588. qi_old_scope(state);
  1589. if (__debug_enabled)
  1590. qi_pop_trace(state);
  1591. return result;
  1592. }
  1593. qi_value_t *qi_call(qi_state_t *state, qi_value_t *value, qi_list_t *pargs) {
  1594. return _qi_call(state, value, pargs, NULL);
  1595. }
  1596. qi_value_t *qi_call_debug(qi_state_t *state, qi_value_t *value,
  1597. qi_list_t *pargs, const char *debug_data) {
  1598. return _qi_call(state, value, pargs, debug_data);
  1599. }
  1600. bool _qi_equals(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1601. qi_value_t *meta;
  1602. if ((meta = qi_call_meta(state, NULL, a, "__equals", 2, a, b))) {
  1603. if (meta->type != QI_BOOLEAN)
  1604. qi_throw_format(state, "__equals returned non-boolean value (%s)",
  1605. _qi_type(state, meta));
  1606. return meta->value.boolean;
  1607. } else if ((meta = qi_call_meta(state, NULL, b, "__equals", 2, b, a))) {
  1608. if (meta->type != QI_BOOLEAN)
  1609. qi_throw_format(state, "__equals returned non-boolean value (%s)",
  1610. _qi_type(state, meta));
  1611. return meta->value.boolean;
  1612. }
  1613. if (a->type != b->type)
  1614. return false;
  1615. switch (a->type) {
  1616. case QI_NULL:
  1617. return true;
  1618. case QI_BOOLEAN:
  1619. return a->value.boolean == b->value.boolean;
  1620. case QI_NUMBER:
  1621. if (isnan(a->value.number) && isnan(b->value.number))
  1622. return true;
  1623. return a->value.number == b->value.number;
  1624. case QI_STRING:
  1625. return strcmp(a->value.string, b->value.string) == 0;
  1626. case QI_BYTES:
  1627. if (a->value.bytes->size != b->value.bytes->size)
  1628. return false;
  1629. return memcmp(a->value.bytes->data, b->value.bytes->data,
  1630. a->value.bytes->size) == 0;
  1631. case QI_FILE:
  1632. return fileno(a->value.file.fd) == fileno(b->value.file.fd);
  1633. case QI_LIST:
  1634. qi_lock_acquire(a->lock);
  1635. qi_lock_acquire(b->lock);
  1636. if (a->value.list == b->value.list) {
  1637. qi_lock_release(a->lock);
  1638. qi_lock_release(b->lock);
  1639. return true;
  1640. }
  1641. if (qi_list_length(a->value.list) != qi_list_length(b->value.list)) {
  1642. qi_lock_release(a->lock);
  1643. qi_lock_release(b->lock);
  1644. return false;
  1645. }
  1646. for (qi_size_t i = 0; i < qi_list_length(a->value.list); i++)
  1647. if (!_qi_equals(state, qi_list_index(a->value.list, i),
  1648. qi_list_index(b->value.list, i))) {
  1649. qi_lock_release(a->lock);
  1650. qi_lock_release(b->lock);
  1651. return false;
  1652. }
  1653. qi_lock_release(a->lock);
  1654. qi_lock_release(b->lock);
  1655. return true;
  1656. case QI_TUPLE:
  1657. if (a->value.list == b->value.list)
  1658. return true;
  1659. if (qi_list_length(a->value.list) != qi_list_length(b->value.list))
  1660. return false;
  1661. for (qi_size_t i = 0; i < qi_list_length(a->value.list); i++)
  1662. if (!_qi_equals(state, qi_list_index(a->value.list, i),
  1663. qi_list_index(b->value.list, i)))
  1664. return false;
  1665. return true;
  1666. case QI_TABLE:
  1667. qi_lock_acquire(a->lock);
  1668. qi_lock_acquire(b->lock);
  1669. if (a->value.table.table == b->value.table.table) {
  1670. qi_lock_release(a->lock);
  1671. qi_lock_release(b->lock);
  1672. return true;
  1673. }
  1674. if (qi_table_length(a->value.table.table) !=
  1675. qi_table_length(b->value.table.table)) {
  1676. qi_lock_release(a->lock);
  1677. qi_lock_release(b->lock);
  1678. return false;
  1679. }
  1680. qi_table_iterate(a->value.table.table, {
  1681. qi_value_t *a_value = entry.value;
  1682. qi_value_t *b_value = qi_table_get(b->value.table.table, entry.key);
  1683. if (!b_value) {
  1684. qi_lock_release(a->lock);
  1685. qi_lock_release(b->lock);
  1686. return false;
  1687. }
  1688. if (!_qi_equals(state, a_value, b_value)) {
  1689. qi_lock_release(a->lock);
  1690. qi_lock_release(b->lock);
  1691. return false;
  1692. }
  1693. });
  1694. qi_lock_release(a->lock);
  1695. qi_lock_release(b->lock);
  1696. return true;
  1697. case QI_FUNCTION:
  1698. return strcmp(a->value.function.name, b->value.function.name) == 0 &&
  1699. a->value.function.handle == b->value.function.handle;
  1700. case QI_DATA:
  1701. return a->value.data.tag == b->value.data.tag &&
  1702. a->value.data.data == b->value.data.data;
  1703. default:
  1704. return true;
  1705. }
  1706. return true;
  1707. }
  1708. bool _qi_in(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1709. qi_value_t *meta;
  1710. bool fail = false;
  1711. if ((meta = qi_call_meta(state, &fail, b, "__in", 2, b, a))) {
  1712. if (meta->type != QI_BOOLEAN)
  1713. qi_throw_format(state, "__in returned non-boolean value (%s)",
  1714. _qi_type(state, meta));
  1715. return meta->value.boolean;
  1716. }
  1717. if (fail)
  1718. goto leave;
  1719. if (a->type == QI_STRING && b->type == QI_STRING)
  1720. return strstr(b->value.string, a->value.string) != NULL;
  1721. else if (a->type == QI_NUMBER && b->type == QI_BYTES) {
  1722. for (qi_size_t i = 0; i < b->value.bytes->size; i++)
  1723. if (b->value.bytes->data[i] == (unsigned char)(a->value.number))
  1724. return true;
  1725. return false;
  1726. } else if (b->type == QI_LIST) {
  1727. LOCKED(b, {
  1728. qi_list_t *list = b->value.list;
  1729. if (qi_list_empty(list)) {
  1730. qi_lock_release(b->lock);
  1731. return false;
  1732. }
  1733. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  1734. if (_qi_equals(state, a, qi_list_data(list, i))) {
  1735. qi_lock_release(b->lock);
  1736. return true;
  1737. }
  1738. });
  1739. return false;
  1740. } else if (b->type == QI_TUPLE) {
  1741. qi_list_t *list = b->value.list;
  1742. if (qi_list_empty(list))
  1743. return false;
  1744. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  1745. if (_qi_equals(state, a, qi_list_data(list, i)))
  1746. return true;
  1747. return false;
  1748. } else if (a->type == QI_STRING && b->type == QI_TABLE) {
  1749. bool res = false;
  1750. LOCKED(b, {
  1751. qi_table_t *table = b->value.table.table;
  1752. if (!qi_table_empty(table))
  1753. res = qi_table_has(table, a->value.string);
  1754. });
  1755. return res;
  1756. }
  1757. leave:
  1758. qi_throw_format(state, "unsupported operand types for in: %s and %s",
  1759. _qi_type(state, a), _qi_type(state, b));
  1760. return false;
  1761. }
  1762. qi_value_t *qi_add(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1763. qi_value_t *meta;
  1764. bool fail = false;
  1765. if ((meta = qi_call_meta(state, &fail, a, "__add", 2, a, b)))
  1766. return meta;
  1767. else if (fail)
  1768. goto leave;
  1769. else if ((meta = qi_call_meta(state, &fail, b, "__add", 2, b, a)))
  1770. return meta;
  1771. if (fail)
  1772. goto leave;
  1773. if (a->type == QI_STRING && b->type == QI_STRING) {
  1774. if (!*a->value.string && !*b->value.string)
  1775. return state->empty_string;
  1776. else if (!*a->value.string)
  1777. return qi_make_string(state, b->value.string);
  1778. else if (!*b->value.string)
  1779. return qi_make_string(state, a->value.string);
  1780. char *string =
  1781. qi_malloc(strlen(a->value.string) + strlen(b->value.string) + 1);
  1782. strcpy(string, a->value.string);
  1783. strcat(string, b->value.string);
  1784. return qi_make_string(state, string);
  1785. } else if (a->type == QI_BYTES && b->type == QI_BYTES) {
  1786. if (a->value.bytes->size == 0 && b->value.bytes->size == 0)
  1787. return state->empty_bytes;
  1788. else if (a->value.bytes->size == 0)
  1789. return qi_make_bytes(state, b->value.bytes->data, b->value.bytes->size);
  1790. else if (b->value.bytes->size == 0)
  1791. return qi_make_bytes(state, a->value.bytes->data, a->value.bytes->size);
  1792. qi_size_t size = a->value.bytes->size + b->value.bytes->size;
  1793. unsigned char *bytes = qi_malloc(size);
  1794. memcpy(bytes, a->value.bytes->data, a->value.bytes->size);
  1795. memcpy(bytes + a->value.bytes->size, b->value.bytes->data,
  1796. b->value.bytes->size);
  1797. return qi_make_bytes(state, bytes, size);
  1798. } else if ((a->type == QI_LIST && b->type == QI_LIST) ||
  1799. (a->type == QI_TUPLE && b->type == QI_TUPLE)) {
  1800. if (a == state->empty_tuple && b == state->empty_tuple)
  1801. return state->empty_tuple;
  1802. else if (a == state->empty_tuple)
  1803. return b;
  1804. else if (b == state->empty_tuple)
  1805. return b;
  1806. qi_list_t *newlist = qi_list_make();
  1807. if (a->type == QI_LIST) {
  1808. qi_lock_acquire(a->lock);
  1809. qi_lock_acquire(b->lock);
  1810. }
  1811. for (qi_size_t i = 0; i < qi_list_length(a->value.list); i++)
  1812. qi_list_push(newlist, qi_list_data(a->value.list, i));
  1813. if (a->type == QI_LIST)
  1814. qi_lock_release(a->lock);
  1815. for (qi_size_t i = 0; i < qi_list_length(b->value.list); i++)
  1816. qi_list_push(newlist, qi_list_data(b->value.list, i));
  1817. if (a->type == QI_LIST)
  1818. qi_lock_release(b->lock);
  1819. if (a->type == QI_TUPLE)
  1820. return qi_make_tuple(state, newlist);
  1821. return qi_make_list(state, newlist);
  1822. } else if (a->type == QI_TABLE && b->type == QI_TABLE) {
  1823. qi_table_t *newtable = qi_table_make();
  1824. qi_lock_acquire(a->lock);
  1825. qi_lock_acquire(b->lock);
  1826. qi_table_iterate(a->value.table.table,
  1827. { qi_table_set(newtable, entry.key, entry.value); });
  1828. qi_lock_release(a->lock);
  1829. qi_table_iterate(b->value.table.table,
  1830. { qi_table_set(newtable, entry.key, entry.value); });
  1831. qi_lock_release(b->lock);
  1832. return qi_make_table(state, newtable);
  1833. } else if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  1834. return qi_make_number(state, a->value.number + b->value.number);
  1835. leave:
  1836. qi_throw_format(state, "unsupported operand types for +: %s and %s",
  1837. _qi_type(state, a), _qi_type(state, b));
  1838. return NULL;
  1839. }
  1840. qi_value_t *qi_sub(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1841. qi_value_t *meta;
  1842. bool fail = false;
  1843. if ((meta = qi_call_meta(state, &fail, a, "__sub", 2, a, b)))
  1844. return meta;
  1845. if (fail)
  1846. goto leave;
  1847. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  1848. return qi_make_number(state, a->value.number - b->value.number);
  1849. leave:
  1850. qi_throw_format(state, "unsupported operand types for -: %s and %s",
  1851. _qi_type(state, a), _qi_type(state, b));
  1852. return NULL;
  1853. }
  1854. qi_value_t *qi_mul(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1855. qi_value_t *meta;
  1856. bool fail = false;
  1857. if ((meta = qi_call_meta(state, &fail, a, "__mul", 2, a, b)))
  1858. return meta;
  1859. else if (fail)
  1860. goto leave;
  1861. else if ((meta = qi_call_meta(state, &fail, b, "__mul", 2, b, a)))
  1862. return meta;
  1863. if (fail)
  1864. goto leave;
  1865. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  1866. return qi_make_number(state, a->value.number * b->value.number);
  1867. leave:
  1868. qi_throw_format(state, "unsupported operand types for *: %s and %s",
  1869. _qi_type(state, a), _qi_type(state, b));
  1870. return NULL;
  1871. }
  1872. qi_value_t *qi_div(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1873. qi_value_t *meta;
  1874. bool fail = false;
  1875. if ((meta = qi_call_meta(state, &fail, a, "__div", 2, a, b)))
  1876. return meta;
  1877. if (fail)
  1878. goto leave;
  1879. if (a->type == QI_NUMBER && b->type == QI_NUMBER) {
  1880. if (b->value.number == 0) {
  1881. if (a->value.number == 0)
  1882. return state->nan;
  1883. return state->infinity;
  1884. }
  1885. return qi_make_number(state, a->value.number / b->value.number);
  1886. }
  1887. leave:
  1888. qi_throw_format(state, "unsupported operand types for /: %s and %s",
  1889. _qi_type(state, a), _qi_type(state, b));
  1890. return NULL;
  1891. }
  1892. qi_value_t *qi_idiv(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1893. qi_value_t *meta;
  1894. bool fail = false;
  1895. if ((meta = qi_call_meta(state, &fail, a, "__idiv", 2, a, b)))
  1896. return meta;
  1897. if (fail)
  1898. goto leave;
  1899. if (a->type == QI_NUMBER && b->type == QI_NUMBER) {
  1900. if (b->value.number == 0) {
  1901. if (a->value.number == 0)
  1902. return state->nan;
  1903. return state->infinity;
  1904. }
  1905. return qi_make_number(state, (long)(a->value.number / b->value.number));
  1906. }
  1907. leave:
  1908. qi_throw_format(state, "unsupported operand types for //: %s and %s",
  1909. _qi_type(state, a), _qi_type(state, b));
  1910. return NULL;
  1911. }
  1912. qi_value_t *qi_mod(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1913. qi_value_t *meta;
  1914. bool fail = false;
  1915. if ((meta = qi_call_meta(state, &fail, a, "__mod", 2, a, b)))
  1916. return meta;
  1917. if (fail)
  1918. goto leave;
  1919. if (a->type == QI_NUMBER && b->type == QI_NUMBER) {
  1920. if (b->value.number == 0) {
  1921. if (a->value.number == 0)
  1922. return state->nan;
  1923. return state->infinity;
  1924. }
  1925. return qi_make_number(state, fmod(a->value.number, b->value.number));
  1926. }
  1927. leave:
  1928. qi_throw_format(state, "unsupported operand types for %: %s and %s",
  1929. _qi_type(state, a), _qi_type(state, b));
  1930. return NULL;
  1931. }
  1932. qi_value_t *qi_pow(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1933. qi_value_t *meta;
  1934. bool fail = false;
  1935. if ((meta = qi_call_meta(state, &fail, a, "__pow", 2, a, b)))
  1936. return meta;
  1937. if (fail)
  1938. goto leave;
  1939. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  1940. return qi_make_number(state, powf(a->value.number, b->value.number));
  1941. leave:
  1942. qi_throw_format(state, "unsupported operand types for **: %s and %s",
  1943. _qi_type(state, a), _qi_type(state, b));
  1944. return NULL;
  1945. }
  1946. qi_value_t *qi_band(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1947. qi_value_t *meta;
  1948. bool fail = false;
  1949. if ((meta = qi_call_meta(state, &fail, a, "__band", 2, a, b)))
  1950. return meta;
  1951. else if (fail)
  1952. goto leave;
  1953. else if ((meta = qi_call_meta(state, &fail, b, "__band", 2, b, a)))
  1954. return meta;
  1955. if (fail)
  1956. goto leave;
  1957. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  1958. return qi_make_number(state,
  1959. (int)(a->value.number) & (int)(b->value.number));
  1960. leave:
  1961. qi_throw_format(state, "unsupported operand types for &: %s and %s",
  1962. _qi_type(state, a), _qi_type(state, b));
  1963. return NULL;
  1964. }
  1965. qi_value_t *qi_bor(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1966. qi_value_t *meta;
  1967. bool fail = false;
  1968. if ((meta = qi_call_meta(state, &fail, a, "__bor", 2, a, b)))
  1969. return meta;
  1970. else if (fail)
  1971. goto leave;
  1972. else if ((meta = qi_call_meta(state, &fail, b, "__bor", 2, b, a)))
  1973. return meta;
  1974. if (fail)
  1975. goto leave;
  1976. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  1977. return qi_make_number(state,
  1978. (int)(a->value.number) | (int)(b->value.number));
  1979. leave:
  1980. qi_throw_format(state, "unsupported operand types for |: %s and %s",
  1981. _qi_type(state, a), _qi_type(state, b));
  1982. return NULL;
  1983. }
  1984. qi_value_t *qi_xor(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  1985. qi_value_t *meta;
  1986. bool fail = false;
  1987. if ((meta = qi_call_meta(state, &fail, a, "__xor", 2, a, b)))
  1988. return meta;
  1989. else if (fail)
  1990. goto leave;
  1991. else if ((meta = qi_call_meta(state, &fail, b, "__xor", 2, b, a)))
  1992. return meta;
  1993. if (fail)
  1994. goto leave;
  1995. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  1996. return qi_make_number(state,
  1997. (int)(a->value.number) ^ (int)(b->value.number));
  1998. leave:
  1999. qi_throw_format(state, "unsupported operand types for ^: %s and %s",
  2000. _qi_type(state, a), _qi_type(state, b));
  2001. return NULL;
  2002. }
  2003. qi_value_t *qi_shl(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  2004. qi_value_t *meta;
  2005. bool fail = false;
  2006. if ((meta = qi_call_meta(state, &fail, a, "__shl", 2, a, b)))
  2007. return meta;
  2008. if (fail)
  2009. goto leave;
  2010. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2011. return qi_make_number(state, (int)(a->value.number)
  2012. << (int)(b->value.number));
  2013. leave:
  2014. qi_throw_format(state, "unsupported operand types for <<: %s and %s",
  2015. _qi_type(state, a), _qi_type(state, b));
  2016. return NULL;
  2017. }
  2018. qi_value_t *qi_shr(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  2019. qi_value_t *meta;
  2020. bool fail = false;
  2021. if ((meta = qi_call_meta(state, &fail, a, "__shr", 2, a, b)))
  2022. return meta;
  2023. if (fail)
  2024. goto leave;
  2025. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2026. return qi_make_number(state,
  2027. (int)(a->value.number) >> (int)(b->value.number));
  2028. leave:
  2029. qi_throw_format(state, "unsupported operand types for >>: %s and %s",
  2030. _qi_type(state, a), _qi_type(state, b));
  2031. return NULL;
  2032. }
  2033. bool _qi_lt(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  2034. qi_value_t *meta;
  2035. bool fail = false;
  2036. if ((meta = qi_call_meta(state, &fail, a, "__lt", 2, a, b))) {
  2037. if (meta->type != QI_BOOLEAN)
  2038. qi_throw_format(state, "__lt returned non-boolean value (%s)",
  2039. _qi_type(state, meta));
  2040. return meta->value.boolean;
  2041. }
  2042. if (fail)
  2043. goto leave;
  2044. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2045. return a->value.number < b->value.number;
  2046. else if (a->type == QI_STRING && b->type == QI_STRING &&
  2047. (strlen(a->value.string) == strlen(b->value.string) == 1))
  2048. return a->value.string[0] < b->value.string[0];
  2049. leave:
  2050. qi_throw_format(state, "unsupported operand types for <: %s and %s",
  2051. _qi_type(state, a), _qi_type(state, b));
  2052. return false;
  2053. }
  2054. bool _qi_gt(qi_state_t *state, qi_value_t *a, qi_value_t *b) {
  2055. qi_value_t *meta;
  2056. bool fail = false;
  2057. if ((meta = qi_call_meta(state, &fail, a, "__gt", 2, a, b))) {
  2058. if (meta->type != QI_BOOLEAN)
  2059. qi_throw_format(state, "__gt returned non-boolean value (%s)",
  2060. _qi_type(state, meta));
  2061. return meta->value.boolean;
  2062. }
  2063. if (fail)
  2064. goto leave;
  2065. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2066. return a->value.number > b->value.number;
  2067. else if (a->type == QI_STRING && b->type == QI_STRING &&
  2068. (strlen(a->value.string) == strlen(b->value.string) == 1))
  2069. return a->value.string[0] > b->value.string[0];
  2070. leave:
  2071. qi_throw_format(state, "unsupported operand types for >: %s and %s",
  2072. _qi_type(state, a), _qi_type(state, b));
  2073. return false;
  2074. }
  2075. qi_value_t *qi_negate(qi_state_t *state, qi_value_t *a) {
  2076. qi_value_t *meta;
  2077. bool fail = false;
  2078. if ((meta = qi_call_meta(state, &fail, a, "__negate", 1, a)))
  2079. return meta;
  2080. if (fail)
  2081. goto leave;
  2082. if (a->type == QI_NUMBER)
  2083. return qi_make_number(state, -a->value.number);
  2084. leave:
  2085. qi_throw_format(state, "unsupported operand type for unary -: %s",
  2086. _qi_type(state, a));
  2087. return NULL;
  2088. }
  2089. qi_value_t *qi_bnot(qi_state_t *state, qi_value_t *a) {
  2090. qi_value_t *meta;
  2091. bool fail = false;
  2092. if ((meta = qi_call_meta(state, &fail, a, "__bnot", 1, a)))
  2093. return meta;
  2094. if (fail)
  2095. goto leave;
  2096. if (a->type == QI_NUMBER)
  2097. return qi_make_number(state, ~(int)(a->value.number));
  2098. leave:
  2099. qi_throw_format(state, "unsupported operand type for unary ~: %s",
  2100. _qi_type(state, a));
  2101. return NULL;
  2102. }
  2103. static void qi_set_barrier(qi_state_t *state) {
  2104. qi_scope_t *scope = qi_malloc(sizeof(qi_scope_t));
  2105. scope->scope = NULL;
  2106. scope->defers = NULL;
  2107. scope->is_barrier = true;
  2108. scope->lock = NULL;
  2109. qi_list_push(state->scopes, scope);
  2110. }
  2111. static qi_state_t *qi_state_clone(qi_state_t *state) {
  2112. qi_state_t *newstate = qi_malloc(sizeof(qi_state_t));
  2113. memcpy(newstate, state, sizeof(qi_state_t));
  2114. newstate->traps = qi_list_make();
  2115. newstate->scopes = qi_list_copy(state->scopes);
  2116. qi_set_barrier(newstate);
  2117. if (__debug_enabled)
  2118. newstate->calltrace = qi_list_copy(state->calltrace);
  2119. return newstate;
  2120. }
  2121. static void *__thread_wrapper(void *_args) {
  2122. qi_list_t *args = (qi_list_t *)_args;
  2123. qi_state_t *state = qi_list_index(args, 0);
  2124. qi_value_t *fn = qi_list_index(args, 1);
  2125. qi_list_t *pargs = qi_list_index(args, 2);
  2126. qi_value_t *value = qi_call(state, fn, qi_list_empty(pargs) ? NULL : pargs);
  2127. pthread_exit((void *)value);
  2128. return NULL;
  2129. }
  2130. void *qi_thread_create(qi_state_t *state, qi_value_t *fn, qi_list_t *args) {
  2131. pthread_t *td = qi_malloc_atomic(sizeof(pthread_t));
  2132. qi_list_t *_args = qi_list_make();
  2133. qi_list_push(_args, qi_state_clone(state));
  2134. qi_list_push(_args, fn);
  2135. qi_list_push(_args, args);
  2136. pthread_create(td, NULL, __thread_wrapper, (void *)_args);
  2137. return (void *)td;
  2138. }
  2139. void qi_thread_exit(qi_state_t *state, qi_value_t *value) {
  2140. if (!qi_thread_main())
  2141. while (qi_old_scope(state))
  2142. ;
  2143. if (!qi_thread_main())
  2144. pthread_exit((void *)value);
  2145. else
  2146. pthread_exit(NULL);
  2147. }
  2148. bool qi_thread_main(void) { return pthread_self() == __main_tid; }
  2149. qi_value_t *qi_thread_join(qi_state_t *state, void *_td) {
  2150. pthread_t *td = (pthread_t *)_td;
  2151. qi_value_t *ret = state->nil;
  2152. pthread_join(*td, (void *)&ret);
  2153. if (!ret)
  2154. return state->nil;
  2155. return ret;
  2156. }
  2157. void *qi_lock_create(void) {
  2158. pthread_mutex_t *mutex = qi_malloc_atomic(sizeof(pthread_mutex_t));
  2159. if (pthread_mutex_init(mutex, NULL) != 0)
  2160. return NULL;
  2161. return (void *)mutex;
  2162. }
  2163. void qi_lock_destroy(void *lock) {
  2164. pthread_mutex_t *mutex = (pthread_mutex_t *)lock;
  2165. pthread_mutex_destroy(mutex);
  2166. }
  2167. bool qi_lock_acquired(void *lock) {
  2168. pthread_mutex_t *mutex = (pthread_mutex_t *)lock;
  2169. if (pthread_mutex_trylock(mutex) == 0) {
  2170. pthread_mutex_unlock(mutex);
  2171. return false;
  2172. }
  2173. return true;
  2174. }
  2175. void qi_lock_acquire(void *lock) {
  2176. pthread_mutex_t *mutex = (pthread_mutex_t *)lock;
  2177. pthread_mutex_lock(mutex);
  2178. }
  2179. bool qi_lock_tryacquire(void *lock) {
  2180. pthread_mutex_t *mutex = (pthread_mutex_t *)lock;
  2181. if (pthread_mutex_trylock(mutex) == 0)
  2182. return true;
  2183. return false;
  2184. }
  2185. void qi_lock_release(void *lock) {
  2186. pthread_mutex_t *mutex = (pthread_mutex_t *)lock;
  2187. pthread_mutex_unlock(mutex);
  2188. }
  2189. qi_value_t *qi_builtin_print(qi_state_t *state, qi_size_t pargc,
  2190. qi_list_t *pargs) {
  2191. bool first = true;
  2192. for (int i = 0; i < pargc; i++) {
  2193. qi_value_t *a = qi_list_data(pargs, i);
  2194. if (first)
  2195. first = false;
  2196. else
  2197. fputc(' ', stdout);
  2198. fprintf(stdout, "%s", qi_show(state, a));
  2199. }
  2200. return state->nil;
  2201. }
  2202. qi_value_t *qi_builtin_println(qi_state_t *state, qi_size_t pargc,
  2203. qi_list_t *pargs) {
  2204. qi_builtin_print(state, pargc, pargs);
  2205. fputc('\n', stdout);
  2206. return state->nil;
  2207. }
  2208. qi_value_t *qi_builtin_set_meta_table(qi_state_t *state, qi_size_t pargc,
  2209. qi_list_t *pargs) {
  2210. qi_value_t *a = qi_list_data(pargs, 0);
  2211. qi_value_t *b = qi_list_data(pargs, 1);
  2212. if (a->type != QI_TABLE)
  2213. qi_throw_format(state, "expected first argument to be: table, but got: %s",
  2214. _qi_type(state, a));
  2215. if (b->type != QI_TABLE)
  2216. qi_throw_format(state, "expected second argument to be: table, but got: %s",
  2217. _qi_type(state, b));
  2218. LOCKED(a, { a->value.table.metatable = b; });
  2219. return a;
  2220. }
  2221. qi_value_t *qi_builtin_get_meta_table(qi_state_t *state, qi_size_t pargc,
  2222. qi_list_t *pargs) {
  2223. qi_value_t *a = qi_list_data(pargs, 0);
  2224. if (a->type != QI_TABLE)
  2225. qi_throw_format(state, "expected first argument to be: table, but got: %s",
  2226. _qi_type(state, a));
  2227. qi_value_t *value;
  2228. LOCKED(a, { value = a->value.table.metatable; });
  2229. return value;
  2230. }
  2231. qi_value_t *qi_builtin_has_meta_table(qi_state_t *state, qi_size_t pargc,
  2232. qi_list_t *pargs) {
  2233. qi_value_t *a = qi_list_data(pargs, 0);
  2234. if (a->type != QI_TABLE)
  2235. qi_throw_format(state, "expected first argument to be: table, but got: %s",
  2236. _qi_type(state, a));
  2237. bool res = false;
  2238. LOCKED(a, { res = qi_has_metatable(a); });
  2239. return res ? state->_true : state->_false;
  2240. }
  2241. qi_value_t *qi_builtin_delete_meta_table(qi_state_t *state, qi_size_t pargc,
  2242. qi_list_t *pargs) {
  2243. qi_value_t *a = qi_list_data(pargs, 0);
  2244. if (a->type != QI_TABLE)
  2245. qi_throw_format(state, "expected first argument to be: table, but got: %s",
  2246. _qi_type(state, a));
  2247. LOCKED(a, { a->value.table.metatable = state->nil; });
  2248. return state->nil;
  2249. }
  2250. qi_value_t *qi_builtin_has_method(qi_state_t *state, qi_size_t pargc,
  2251. qi_list_t *pargs) {
  2252. qi_value_t *a = qi_list_data(pargs, 0);
  2253. qi_value_t *b = qi_list_data(pargs, 1);
  2254. if (a->type != QI_TABLE)
  2255. qi_throw_format(state, "expected first argument to be: table, but got: %s",
  2256. _qi_type(state, a));
  2257. if (b->type != QI_STRING)
  2258. qi_throw_format(state,
  2259. "expected second argument to be: string, but got: %s",
  2260. _qi_type(state, b));
  2261. qi_value_t *value;
  2262. bool res = false;
  2263. LOCKED(a, {
  2264. res =
  2265. qi_has_metatable(a) &&
  2266. (value = qi_table_get(qi_get_metatable(a), b->value.string)) != NULL &&
  2267. value->type == QI_FUNCTION;
  2268. });
  2269. return res ? state->_true : state->_false;
  2270. }
  2271. qi_value_t *qi_builtin_delete_method(qi_state_t *state, qi_size_t pargc,
  2272. qi_list_t *pargs) {
  2273. qi_value_t *a = qi_list_data(pargs, 0);
  2274. qi_value_t *b = qi_list_data(pargs, 1);
  2275. if (a->type != QI_TABLE)
  2276. qi_throw_format(state, "expected first argument to be: table, but got: %s",
  2277. _qi_type(state, a));
  2278. if (b->type != QI_STRING)
  2279. qi_throw_format(state,
  2280. "expected second argument to be: string, but got: %s",
  2281. _qi_type(state, b));
  2282. LOCKED(a, {
  2283. if (qi_has_metatable(a))
  2284. if (!qi_table_delete(qi_get_metatable(a), b->value.string)) {
  2285. qi_lock_release(a->lock);
  2286. qi_throw_format(state, "no such method: '%s'", b->value.string);
  2287. }
  2288. });
  2289. return state->nil;
  2290. }
  2291. qi_value_t *qi_builtin_set_pseudomethod(qi_state_t *state, qi_size_t pargc,
  2292. qi_list_t *pargs) {
  2293. qi_value_t *a = qi_list_data(pargs, 0);
  2294. qi_value_t *b = qi_list_data(pargs, 1);
  2295. if (a->type != QI_STRING)
  2296. qi_throw_format(state, "expected first argument to be: string, but got: %s",
  2297. _qi_type(state, a));
  2298. if (b->type != QI_FUNCTION)
  2299. qi_throw_format(state, "expected second argument to be: function, but got: %s",
  2300. _qi_type(state, b));
  2301. char *name = a->value.string;
  2302. qi_value_t *method = qi_make_function(state, name, b->value.function.pargc, b->value.function.handle, NULL);
  2303. method->value.function.is_pm = true;
  2304. qi_lock_acquire(state->pseudomethods_lock);
  2305. qi_table_set(state->pseudomethods, name, method);
  2306. qi_lock_release(state->pseudomethods_lock);
  2307. return method;
  2308. }
  2309. qi_value_t *qi_builtin_has_pseudomethod(qi_state_t *state, qi_size_t pargc,
  2310. qi_list_t *pargs) {
  2311. qi_value_t *a = qi_list_data(pargs, 0);
  2312. if (a->type != QI_STRING)
  2313. qi_throw_format(state, "expected first argument to be: string, but got: %s",
  2314. _qi_type(state, a));
  2315. qi_lock_acquire(state->pseudomethods_lock);
  2316. bool res = qi_table_has(state->pseudomethods, a->value.string);
  2317. qi_lock_release(state->pseudomethods_lock);
  2318. return res? state->_true: state->_false;
  2319. }
  2320. qi_value_t *qi_builtin_unset_pseudomethod(qi_state_t *state, qi_size_t pargc,
  2321. qi_list_t *pargs) {
  2322. qi_value_t *a = qi_list_data(pargs, 0);
  2323. if (a->type != QI_STRING)
  2324. qi_throw_format(state, "expected first argument to be: string, but got: %s",
  2325. _qi_type(state, a));
  2326. qi_lock_acquire(state->pseudomethods_lock);
  2327. bool res = qi_table_delete(state->pseudomethods, a->value.string);
  2328. qi_lock_release(state->pseudomethods_lock);
  2329. if (!res)
  2330. qi_throw_format(state, "no such pseudomethod: '%s'", a->value.string);
  2331. return state->nil;
  2332. }
  2333. qi_value_t *qi_builtin_set_global(qi_state_t *state, qi_size_t pargc,
  2334. qi_list_t *pargs) {
  2335. qi_value_t *a = qi_list_data(pargs, 0);
  2336. qi_value_t *b = qi_list_data(pargs, 1);
  2337. qi_value_t *c = qi_list_data(pargs, 2);
  2338. if (!c)
  2339. c = state->zero;
  2340. else if (c->type != QI_NUMBER)
  2341. qi_throw_format(state, "expected third argument to be: number, but got: %s",
  2342. _qi_type(state, c));
  2343. if (a->type != QI_STRING)
  2344. qi_throw_format(state, "expected first argument to be: string, but got: %s",
  2345. _qi_type(state, a));
  2346. char *name = a->value.string;
  2347. qi_symbol_t *symbol;
  2348. qi_size_t offset = (qi_size_t)(c->value.number);
  2349. qi_scope_t *scope;
  2350. if (offset > 0) {
  2351. scope = qi_list_index(state->scopes, -((qi_ssize_t)offset));
  2352. if (!scope)
  2353. qi_throw_format(state, "illegal scope index: %s",
  2354. qi_repr(state, c, true));
  2355. } else
  2356. scope = qi_list_first(state->scopes);
  2357. qi_lock_acquire(scope->lock);
  2358. symbol = qi_table_get(scope->scope, name);
  2359. if (symbol) {
  2360. if (symbol->is_constant) {
  2361. qi_lock_release(scope->lock);
  2362. qi_throw_format(state, "redeclaration of constant symbol: '%s'", name);
  2363. }
  2364. qi_value_t *ret = symbol->value;
  2365. symbol->value = b;
  2366. qi_lock_release(scope->lock);
  2367. return ret;
  2368. }
  2369. symbol = qi_malloc(sizeof(qi_symbol_t));
  2370. symbol->value = b;
  2371. symbol->is_constant = false;
  2372. qi_table_set(scope->scope, name, symbol);
  2373. qi_lock_release(scope->lock);
  2374. return b;
  2375. }
  2376. qi_value_t *qi_builtin_get_global(qi_state_t *state, qi_size_t pargc,
  2377. qi_list_t *pargs) {
  2378. qi_value_t *a = qi_list_data(pargs, 0);
  2379. qi_value_t *b = qi_list_data(pargs, 1);
  2380. if (!b)
  2381. b = state->zero;
  2382. else if (b->type != QI_NUMBER)
  2383. qi_throw_format(state,
  2384. "expected second argument to be: number, but got: %s",
  2385. _qi_type(state, b));
  2386. if (a->type != QI_STRING)
  2387. qi_throw_format(state, "expected first argument to be: string, but got: %s",
  2388. _qi_type(state, a));
  2389. char *name = a->value.string;
  2390. qi_value_t *ret = state->nil;
  2391. qi_size_t offset = (qi_size_t)(b->value.number);
  2392. qi_scope_t *scope;
  2393. if (offset > 0) {
  2394. scope = qi_list_index(state->scopes, -((qi_ssize_t)offset));
  2395. if (!scope)
  2396. qi_throw_format(state, "illegal scope index: %s",
  2397. qi_repr(state, b, true));
  2398. } else
  2399. scope = qi_list_first(state->scopes);
  2400. qi_lock_acquire(scope->lock);
  2401. qi_symbol_t *symbol = qi_table_get(scope->scope, name);
  2402. if (symbol)
  2403. ret = symbol->value;
  2404. qi_lock_release(scope->lock);
  2405. return ret;
  2406. }
  2407. qi_value_t *qi_builtin_get_globals(qi_state_t *state, qi_size_t pargc,
  2408. qi_list_t *pargs) {
  2409. qi_table_t *table = qi_table_make();
  2410. qi_scope_t *scope = qi_list_first(state->scopes);
  2411. qi_lock_acquire(scope->lock);
  2412. qi_table_iterate(scope->scope, {
  2413. qi_symbol_t *symbol = entry.value;
  2414. qi_table_set(table, entry.key, symbol->value);
  2415. });
  2416. qi_lock_release(scope->lock);
  2417. return qi_make_table(state, table);
  2418. }
  2419. #define is_valid_mode(fmod) \
  2420. (strcmp((fmod), "w") == 0 || strcmp((fmod), "r") == 0 || \
  2421. strcmp((fmod), "a") == 0 || strcmp((fmod), "a+") == 0 || \
  2422. strcmp((fmod), "w+") == 0 || strcmp((fmod), "r+") == 0)
  2423. qi_value_t *qi_builtin_fopen(qi_state_t *state, qi_size_t pargc,
  2424. qi_list_t *pargs) {
  2425. qi_value_t *a = qi_list_data(pargs, 0);
  2426. qi_value_t *b = qi_list_data(pargs, 1);
  2427. if (a->type != QI_STRING)
  2428. qi_throw_format(state, "expected first argument to be: string, but got: %s",
  2429. _qi_type(state, a));
  2430. if (b->type != QI_STRING)
  2431. qi_throw_format(state,
  2432. "expected second argument to be: string, but got: %s",
  2433. _qi_type(state, b));
  2434. if (!is_valid_mode(b->value.string))
  2435. qi_throw_format(state, "invalid mode: %s", qi_repr(state, b, true));
  2436. char mode[4];
  2437. snprintf(mode, sizeof(mode), "%sb", b->value.string);
  2438. FILE *file = fopen(a->value.string, mode);
  2439. if (!file)
  2440. qi_throw_format(state, "cannot open file: %s", qi_repr(state, a, true));
  2441. return qi_make_file(state, file, b->value.string);
  2442. }
  2443. #define is_valid_read_mode(fmod) \
  2444. (strcmp((fmod), "a+") == 0 || strcmp((fmod), "r") == 0 || \
  2445. strcmp((fmod), "w+") == 0 || strcmp((fmod), "r+") == 0)
  2446. qi_value_t *qi_builtin_fread(qi_state_t *state, qi_size_t pargc,
  2447. qi_list_t *pargs) {
  2448. qi_value_t *a = qi_list_data(pargs, 0);
  2449. qi_value_t *b = qi_list_data(pargs, 1);
  2450. if (a->type != QI_FILE)
  2451. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2452. _qi_type(state, a));
  2453. if (b->type != QI_NUMBER)
  2454. qi_throw_format(state,
  2455. "expected second argument to be: number, but got: %s",
  2456. _qi_type(state, b));
  2457. if (!a->value.file.is_open)
  2458. qi_throw_format(state, "file is closed");
  2459. if (!is_valid_read_mode(a->value.file.mode))
  2460. qi_throw_format(state, "file is not readable");
  2461. qi_size_t size;
  2462. if (b->value.number < 0) {
  2463. fseek(a->value.file.fd, 0, SEEK_END);
  2464. size = ftell(a->value.file.fd);
  2465. fseek(a->value.file.fd, 0, SEEK_SET);
  2466. } else
  2467. size = (qi_size_t)(b->value.number);
  2468. unsigned char *data = qi_malloc(size);
  2469. qi_size_t count = fread(data, sizeof(unsigned char), size, a->value.file.fd);
  2470. return qi_make_bytes(state, data, count);
  2471. }
  2472. qi_value_t *qi_builtin_fgets(qi_state_t *state, qi_size_t pargc,
  2473. qi_list_t *pargs) {
  2474. qi_value_t *a = qi_list_data(pargs, 0);
  2475. qi_value_t *b = qi_list_data(pargs, 1);
  2476. if (a->type != QI_FILE)
  2477. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2478. _qi_type(state, a));
  2479. if (b->type != QI_NUMBER)
  2480. qi_throw_format(state,
  2481. "expected second argument to be: number, but got: %s",
  2482. _qi_type(state, b));
  2483. if (!a->value.file.is_open)
  2484. qi_throw_format(state, "file is closed");
  2485. if (!is_valid_read_mode(a->value.file.mode))
  2486. qi_throw_format(state, "file is not readable");
  2487. qi_size_t size = (qi_size_t)(b->value.number);
  2488. char *data = qi_malloc(size + 1);
  2489. if (!fgets(data, size, a->value.file.fd))
  2490. qi_throw_format(state, "reached EOF");
  2491. return qi_make_string(state, data);
  2492. }
  2493. qi_value_t *qi_builtin_fgetc(qi_state_t *state, qi_size_t pargc,
  2494. qi_list_t *pargs) {
  2495. qi_value_t *a = qi_list_data(pargs, 0);
  2496. if (a->type != QI_FILE)
  2497. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2498. _qi_type(state, a));
  2499. if (!a->value.file.is_open)
  2500. qi_throw_format(state, "file is closed");
  2501. if (!is_valid_read_mode(a->value.file.mode))
  2502. qi_throw_format(state, "file is not readable");
  2503. int c = fgetc(a->value.file.fd);
  2504. return qi_make_number(state, c);
  2505. }
  2506. #define is_valid_write_mode(fmod) \
  2507. (strcmp((fmod), "a") == 0 || strcmp((fmod), "a+") == 0 || \
  2508. strcmp((fmod), "w") == 0 || strcmp((fmod), "w+") == 0 || \
  2509. strcmp((fmod), "r+") == 0)
  2510. qi_value_t *qi_builtin_fputc(qi_state_t *state, qi_size_t pargc,
  2511. qi_list_t *pargs) {
  2512. qi_value_t *a = qi_list_data(pargs, 0);
  2513. qi_value_t *b = qi_list_data(pargs, 1);
  2514. if (a->type != QI_FILE)
  2515. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2516. _qi_type(state, a));
  2517. if (b->type != QI_NUMBER &&
  2518. (b->type != QI_STRING || strlen(b->value.string) != 1))
  2519. qi_throw_format(state,
  2520. "expected second argument to be: number or string of "
  2521. "length 1, but got: %s",
  2522. _qi_type(state, b));
  2523. if (!a->value.file.is_open)
  2524. qi_throw_format(state, "file is closed");
  2525. if (!is_valid_write_mode(a->value.file.mode))
  2526. qi_throw_format(state, "file is not writeable");
  2527. fputc(b->type == QI_NUMBER ? b->value.number : b->value.string[0],
  2528. a->value.file.fd);
  2529. return state->nil;
  2530. }
  2531. qi_value_t *qi_builtin_fwrite(qi_state_t *state, qi_size_t pargc,
  2532. qi_list_t *pargs) {
  2533. qi_value_t *a = qi_list_data(pargs, 0);
  2534. qi_value_t *b = qi_list_data(pargs, 1);
  2535. if (a->type != QI_FILE)
  2536. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2537. _qi_type(state, a));
  2538. if (b->type != QI_BYTES)
  2539. qi_throw_format(state, "expected second argument to be: bytes, but got: %s",
  2540. _qi_type(state, b));
  2541. if (!a->value.file.is_open)
  2542. qi_throw_format(state, "file is closed");
  2543. if (!is_valid_write_mode(a->value.file.mode))
  2544. qi_throw_format(state, "file is not writeable");
  2545. qi_size_t count = fwrite(b->value.bytes->data, sizeof(unsigned char),
  2546. b->value.bytes->size, a->value.file.fd);
  2547. return qi_make_number(state, count);
  2548. }
  2549. qi_value_t *qi_builtin_fputs(qi_state_t *state, qi_size_t pargc,
  2550. qi_list_t *pargs) {
  2551. qi_value_t *a = qi_list_data(pargs, 0);
  2552. qi_value_t *b = qi_list_data(pargs, 1);
  2553. if (a->type != QI_FILE)
  2554. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2555. _qi_type(state, a));
  2556. if (b->type != QI_STRING)
  2557. qi_throw_format(state,
  2558. "expected second argument to be: string, but got: %s",
  2559. _qi_type(state, b));
  2560. if (!a->value.file.is_open)
  2561. qi_throw_format(state, "file is closed");
  2562. if (!is_valid_write_mode(a->value.file.mode))
  2563. qi_throw_format(state, "file is not writeable");
  2564. qi_size_t count = fputs(b->value.string, a->value.file.fd);
  2565. return qi_make_number(state, count);
  2566. }
  2567. qi_value_t *qi_builtin_fseek(qi_state_t *state, qi_size_t pargc,
  2568. qi_list_t *pargs) {
  2569. qi_value_t *a = qi_list_data(pargs, 0);
  2570. qi_value_t *b = qi_list_data(pargs, 1);
  2571. qi_value_t *c = qi_list_data(pargs, 2);
  2572. if (a->type != QI_FILE)
  2573. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2574. _qi_type(state, a));
  2575. if (b->type != QI_NUMBER)
  2576. qi_throw_format(state,
  2577. "expected second argument to be: number, but got: %s",
  2578. _qi_type(state, b));
  2579. if (c->type != QI_NUMBER)
  2580. qi_throw_format(state, "expected third argument to be: number, but got: %s",
  2581. _qi_type(state, c));
  2582. if (!a->value.file.is_open)
  2583. qi_throw_format(state, "file is closed");
  2584. qi_size_t offset = (qi_size_t)(b->value.number);
  2585. unsigned int origin = (unsigned int)(c->value.number);
  2586. fseek(a->value.file.fd, offset, origin);
  2587. return state->nil;
  2588. }
  2589. qi_value_t *qi_builtin_ftell(qi_state_t *state, qi_size_t pargc,
  2590. qi_list_t *pargs) {
  2591. qi_value_t *a = qi_list_data(pargs, 0);
  2592. if (a->type != QI_FILE)
  2593. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2594. _qi_type(state, a));
  2595. if (!a->value.file.is_open)
  2596. qi_throw_format(state, "file is closed");
  2597. qi_size_t position = ftell(a->value.file.fd);
  2598. return qi_make_number(state, position);
  2599. }
  2600. qi_value_t *qi_builtin_fflush(qi_state_t *state, qi_size_t pargc,
  2601. qi_list_t *pargs) {
  2602. qi_value_t *a = qi_list_data(pargs, 0);
  2603. if (a->type != QI_FILE)
  2604. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2605. _qi_type(state, a));
  2606. if (!a->value.file.is_open)
  2607. qi_throw_format(state, "file is closed");
  2608. fflush(a->value.file.fd);
  2609. return state->nil;
  2610. }
  2611. qi_value_t *qi_builtin_fclose(qi_state_t *state, qi_size_t pargc,
  2612. qi_list_t *pargs) {
  2613. qi_value_t *a = qi_list_data(pargs, 0);
  2614. if (a->type != QI_FILE)
  2615. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2616. _qi_type(state, a));
  2617. if (!a->value.file.is_open)
  2618. qi_throw_format(state, "already closed");
  2619. if (a->value.file.fd == stdin || a->value.file.fd == stderr ||
  2620. a->value.file.fd == stdout)
  2621. qi_throw_format(state, "cannot close standard streams");
  2622. fclose(a->value.file.fd);
  2623. a->value.file.is_open = false;
  2624. return a;
  2625. }
  2626. qi_value_t *qi_builtin_fclosed(qi_state_t *state, qi_size_t pargc,
  2627. qi_list_t *pargs) {
  2628. qi_value_t *a = qi_list_data(pargs, 0);
  2629. if (a->type != QI_FILE)
  2630. qi_throw_format(state, "expected first argument to be: file, but got: %s",
  2631. _qi_type(state, a));
  2632. return a->value.file.is_open ? state->_false : state->_true;
  2633. }
  2634. qi_value_t *qi_builtin_chr(qi_state_t *state, qi_size_t pargc,
  2635. qi_list_t *pargs) {
  2636. qi_value_t *a = qi_list_data(pargs, 0);
  2637. if (a->type != QI_NUMBER)
  2638. qi_throw_format(state, "expected first argument to be: number, but got: %s",
  2639. _qi_type(state, a));
  2640. unsigned char c = (int)(a->value.number);
  2641. return qi_make_char(state, c);
  2642. }
  2643. qi_value_t *qi_builtin_ord(qi_state_t *state, qi_size_t pargc,
  2644. qi_list_t *pargs) {
  2645. qi_value_t *a = qi_list_data(pargs, 0);
  2646. if (a->type != QI_STRING || strlen(a->value.string) != 1)
  2647. qi_throw_format(
  2648. state, "expected first argument to be: string of length 1, but got: %s",
  2649. _qi_type(state, a));
  2650. return qi_make_number(state, a->value.string[0]);
  2651. }
  2652. qi_value_t *qi_builtin_len(qi_state_t *state, qi_size_t pargc,
  2653. qi_list_t *pargs) {
  2654. qi_value_t *a = qi_list_data(pargs, 0);
  2655. return qi_length(state, a);
  2656. }
  2657. qi_value_t *qi_builtin_type(qi_state_t *state, qi_size_t pargc,
  2658. qi_list_t *pargs) {
  2659. qi_value_t *a = qi_list_data(pargs, 0);
  2660. return qi_type(state, a);
  2661. }
  2662. qi_value_t *qi_builtin_list_copy(qi_state_t *state, qi_size_t pargc,
  2663. qi_list_t *pargs) {
  2664. qi_value_t *a = qi_list_data(pargs, 0);
  2665. if (a->type != QI_LIST)
  2666. qi_throw_format(state, "expected first argument to be: list, but got: %s",
  2667. _qi_type(state, a));
  2668. qi_list_t *list;
  2669. LOCKED(a, { list = qi_list_copy(a->value.list); });
  2670. return qi_make_list(state, list);
  2671. }
  2672. qi_value_t *qi_builtin_list_push(qi_state_t *state, qi_size_t pargc,
  2673. qi_list_t *pargs) {
  2674. qi_value_t *a = qi_list_data(pargs, 0);
  2675. qi_value_t *b = qi_list_data(pargs, 1);
  2676. if (a->type != QI_LIST)
  2677. qi_throw_format(state, "expected first argument to be: list, but got: %s",
  2678. _qi_type(state, a));
  2679. LOCKED(a, { qi_list_push(a->value.list, b); });
  2680. return a;
  2681. }
  2682. qi_value_t *qi_builtin_list_insert(qi_state_t *state, qi_size_t pargc,
  2683. qi_list_t *pargs) {
  2684. qi_value_t *a = qi_list_data(pargs, 0);
  2685. qi_value_t *b = qi_list_data(pargs, 1);
  2686. qi_value_t *c = qi_list_data(pargs, 2);
  2687. if (a->type != QI_LIST)
  2688. qi_throw_format(state, "expected first argument to be: list, but got: %s",
  2689. _qi_type(state, a));
  2690. if (b->type != QI_NUMBER)
  2691. qi_throw_format(state,
  2692. "expected second argument to be: number, but got: %s",
  2693. _qi_type(state, b));
  2694. bool res = false;
  2695. LOCKED(a,
  2696. { res = qi_list_insert(a->value.list, b->value.number, c); });
  2697. if (!res)
  2698. qi_throw_format(state, "list index out of range: %s",
  2699. qi_repr(state, b, true));
  2700. return a;
  2701. }
  2702. qi_value_t *qi_builtin_list_delete(qi_state_t *state, qi_size_t pargc,
  2703. qi_list_t *pargs) {
  2704. qi_value_t *a = qi_list_data(pargs, 0);
  2705. qi_value_t *b = qi_list_data(pargs, 1);
  2706. if (a->type != QI_LIST)
  2707. qi_throw_format(state, "expected first argument to be: list, but got: %s",
  2708. _qi_type(state, a));
  2709. if (b->type != QI_NUMBER)
  2710. qi_throw_format(state,
  2711. "expected second argument to be: number, but got: %s",
  2712. _qi_type(state, b));
  2713. qi_del(state, a, b);
  2714. return a;
  2715. }
  2716. qi_value_t *qi_builtin_list_pop(qi_state_t *state, qi_size_t pargc,
  2717. qi_list_t *pargs) {
  2718. qi_value_t *a = qi_list_data(pargs, 0);
  2719. if (a->type != QI_LIST)
  2720. qi_throw_format(state, "expected first argument to be: list, but got: %s",
  2721. _qi_type(state, a));
  2722. qi_value_t *value = NULL;
  2723. LOCKED(a, { value = qi_list_pop(a->value.list); });
  2724. if (!value)
  2725. qi_throw_format(state, "pop from empty list");
  2726. return value;
  2727. }
  2728. qi_value_t *qi_copy_object(qi_state_t *state, qi_value_t *value) {
  2729. if (value->type != QI_TABLE)
  2730. return value;
  2731. qi_value_t *newvalue;
  2732. LOCKED(value, {
  2733. qi_table_t *table = qi_table_copy(value->value.table.table);
  2734. newvalue = qi_make_table(state, table);
  2735. if (qi_has_metatable(value) && newvalue->value.table.metatable != value)
  2736. newvalue->value.table.metatable =
  2737. qi_copy_object(state, newvalue->value.table.metatable);
  2738. });
  2739. return newvalue;
  2740. }
  2741. qi_value_t *qi_builtin_table_copy(qi_state_t *state, qi_size_t pargc,
  2742. qi_list_t *pargs) {
  2743. qi_value_t *a = qi_list_data(pargs, 0);
  2744. if (a->type != QI_TABLE)
  2745. qi_throw_format(state, "expected first argument to be: table, but got: %s",
  2746. _qi_type(state, a));
  2747. return qi_copy_object(state, a);
  2748. }
  2749. qi_value_t *qi_builtin_table_delete(qi_state_t *state, qi_size_t pargc,
  2750. qi_list_t *pargs) {
  2751. qi_value_t *a = qi_list_data(pargs, 0);
  2752. qi_value_t *b = qi_list_data(pargs, 1);
  2753. if (a->type != QI_TABLE)
  2754. qi_throw_format(state, "expected first argument to be: table, but got: %s",
  2755. _qi_type(state, a));
  2756. if (b->type != QI_STRING)
  2757. qi_throw_format(state,
  2758. "expected second argument to be: string, but got: %s",
  2759. _qi_type(state, b));
  2760. qi_del(state, a, b);
  2761. return a;
  2762. }
  2763. qi_value_t *qi_builtin_func_call(qi_state_t *state, qi_size_t pargc,
  2764. qi_list_t *pargs) {
  2765. qi_value_t *a = qi_list_data(pargs, 0);
  2766. qi_value_t *b = qi_list_data(pargs, 1);
  2767. if (a->type != QI_FUNCTION)
  2768. qi_throw_format(state,
  2769. "expected first argument to be: function, but got: %s",
  2770. _qi_type(state, a));
  2771. if (b->type != QI_LIST && b->type != QI_TUPLE)
  2772. qi_throw_format(
  2773. state, "expected second argument to be: list or tuple, but got: %s",
  2774. _qi_type(state, b));
  2775. qi_list_t *list = NULL;
  2776. if (b->type == QI_TUPLE) {
  2777. if (!qi_list_empty(b->value.list))
  2778. list = qi_list_copy(b->value.list);
  2779. } else {
  2780. LOCKED(b, {
  2781. if (!qi_list_empty(b->value.list))
  2782. list = qi_list_copy(b->value.list);
  2783. });
  2784. }
  2785. return qi_call(state, a, list);
  2786. }
  2787. qi_value_t *qi_builtin_func_name(qi_state_t *state, qi_size_t pargc,
  2788. qi_list_t *pargs) {
  2789. qi_value_t *a = qi_list_data(pargs, 0);
  2790. if (a->type != QI_FUNCTION)
  2791. qi_throw_format(state,
  2792. "expected first argument to be: function, but got: %s",
  2793. _qi_type(state, a));
  2794. return qi_make_string(state, a->value.function.name);
  2795. }
  2796. qi_value_t *qi_builtin_func_argc(qi_state_t *state, qi_size_t pargc,
  2797. qi_list_t *pargs) {
  2798. qi_value_t *a = qi_list_data(pargs, 0);
  2799. if (a->type != QI_FUNCTION)
  2800. qi_throw_format(state,
  2801. "expected first argument to be: function, but got: %s",
  2802. _qi_type(state, a));
  2803. return qi_make_number(state, a->value.function.pargc);
  2804. }
  2805. qi_value_t *qi_builtin_data_tag(qi_state_t *state, qi_size_t pargc,
  2806. qi_list_t *pargs) {
  2807. qi_value_t *a = qi_list_data(pargs, 0);
  2808. if (a->type != QI_DATA)
  2809. qi_throw_format(state, "expected first argument to be: data, but got: %s",
  2810. _qi_type(state, a));
  2811. return qi_make_number(state, a->value.data.tag);
  2812. }
  2813. qi_value_t *qi_builtin_repr(qi_state_t *state, qi_size_t pargc,
  2814. qi_list_t *pargs) {
  2815. qi_value_t *a = qi_list_data(pargs, 0);
  2816. return qi_make_string(state, qi_repr(state, a, true));
  2817. }
  2818. qi_value_t *qi_builtin_str(qi_state_t *state, qi_size_t pargc,
  2819. qi_list_t *pargs) {
  2820. qi_value_t *a = qi_list_data(pargs, 0);
  2821. return qi_to_string(state, a);
  2822. }
  2823. qi_value_t *qi_builtin_bool(qi_state_t *state, qi_size_t pargc,
  2824. qi_list_t *pargs) {
  2825. qi_value_t *a = qi_list_data(pargs, 0);
  2826. return qi_to_boolean(state, a);
  2827. }
  2828. qi_value_t *qi_builtin_num(qi_state_t *state, qi_size_t pargc,
  2829. qi_list_t *pargs) {
  2830. qi_value_t *a = qi_list_data(pargs, 0);
  2831. return qi_to_number(state, a);
  2832. }
  2833. qi_value_t *qi_builtin_bytes(qi_state_t *state, qi_size_t pargc,
  2834. qi_list_t *pargs) {
  2835. qi_value_t *a = qi_list_data(pargs, 0);
  2836. return qi_to_bytes(state, a);
  2837. }
  2838. qi_value_t *qi_builtin_list(qi_state_t *state, qi_size_t pargc,
  2839. qi_list_t *pargs) {
  2840. qi_value_t *a = qi_list_data(pargs, 0);
  2841. return qi_to_list(state, a);
  2842. }
  2843. qi_value_t *qi_builtin_tuple(qi_state_t *state, qi_size_t pargc,
  2844. qi_list_t *pargs) {
  2845. qi_value_t *a = qi_list_data(pargs, 0);
  2846. return qi_to_tuple(state, a);
  2847. }
  2848. qi_value_t *qi_builtin_table(qi_state_t *state, qi_size_t pargc,
  2849. qi_list_t *pargs) {
  2850. qi_value_t *a = qi_list_data(pargs, 0);
  2851. return qi_to_table(state, a);
  2852. }
  2853. qi_value_t *qi_pseudomethod_list_push(qi_state_t *state, qi_size_t pargc,
  2854. qi_list_t *pargs) {
  2855. return qi_builtin_list_push(state, pargc, pargs);
  2856. }
  2857. qi_value_t *qi_pseudomethod_list_pop(qi_state_t *state, qi_size_t pargc,
  2858. qi_list_t *pargs) {
  2859. return qi_builtin_list_pop(state, pargc, pargs);
  2860. }
  2861. qi_value_t *qi_pseudomethod_func_call(qi_state_t *state, qi_size_t pargc,
  2862. qi_list_t *pargs) {
  2863. return qi_builtin_func_call(state, pargc, pargs);
  2864. }
  2865. qi_value_t *qi_pseudomethod_file_write(qi_state_t *state, qi_size_t pargc,
  2866. qi_list_t *pargs) {
  2867. return qi_builtin_fwrite(state, pargc, pargs);
  2868. }
  2869. qi_value_t *qi_pseudomethod_file_read(qi_state_t *state, qi_size_t pargc,
  2870. qi_list_t *pargs) {
  2871. if (pargc < 2) {
  2872. qi_list_t *new_pargs = qi_list_make_n(2);
  2873. qi_list_data(new_pargs, 0) = qi_list_first(pargs);
  2874. qi_list_data(new_pargs, 1) = qi_make_number(state, -1);
  2875. return qi_builtin_fread(state, 2, new_pargs);
  2876. }
  2877. return qi_builtin_fread(state, pargc, pargs);
  2878. }
  2879. qi_value_t *qi_pseudomethod_file_rewind(qi_state_t *state, qi_size_t pargc,
  2880. qi_list_t *pargs) {
  2881. qi_list_t *new_pargs = qi_list_make_n(3);
  2882. qi_list_data(new_pargs, 0) = qi_list_first(pargs);
  2883. qi_list_data(new_pargs, 1) = qi_make_number(state, 0);
  2884. qi_list_data(new_pargs, 2) = qi_make_number(state, SEEK_SET);
  2885. return qi_builtin_fseek(state, 3, new_pargs);
  2886. }
  2887. static void qi_state_setup(qi_state_t *state) {
  2888. QI_HASH_SEED = time(NULL);
  2889. state->nil = qi_make_value(QI_NULL);
  2890. state->_true = qi_make_value(QI_BOOLEAN);
  2891. state->_true->value.boolean = true;
  2892. state->_false = qi_make_value(QI_BOOLEAN);
  2893. state->_false->value.boolean = false;
  2894. state->zero = qi_make_value(QI_NUMBER);
  2895. state->zero->value.number = 0;
  2896. state->one = qi_make_value(QI_NUMBER);
  2897. state->one->value.number = 1;
  2898. for (int i = 1; i <= 8; i++) {
  2899. state->nnumbers[i - 1] = qi_make_value(QI_NUMBER);
  2900. state->nnumbers[i - 1]->value.number = -i;
  2901. }
  2902. state->numbers[0] = state->zero;
  2903. state->numbers[1] = state->one;
  2904. for (int i = 2; i < 256; i++) {
  2905. state->numbers[i] = qi_make_value(QI_NUMBER);
  2906. state->numbers[i]->value.number = i;
  2907. }
  2908. state->intern_strs = qi_table_make();
  2909. state->intern_strs_lock = qi_lock_create();
  2910. state->pseudomethods = qi_table_make();
  2911. state->pseudomethods_lock = qi_lock_create();
  2912. state->nan = qi_make_value(QI_NUMBER);
  2913. state->nan->value.number = NAN;
  2914. state->infinity = qi_make_value(QI_NUMBER);
  2915. state->infinity->value.number = INFINITY;
  2916. state->ninfinity = qi_make_value(QI_NUMBER);
  2917. state->ninfinity->value.number = -INFINITY;
  2918. state->empty_string = qi_make_value(QI_STRING);
  2919. state->empty_string->value.string = qi_strdup("");
  2920. state->empty_bytes = qi_make_value(QI_BYTES);
  2921. state->empty_bytes->value.bytes = qi_malloc(sizeof(qi_bytes_t));
  2922. state->empty_bytes->value.bytes->data = (unsigned char *)qi_strdup("");
  2923. state->empty_bytes->value.bytes->size = 0;
  2924. state->empty_tuple = qi_make_value(QI_TUPLE);
  2925. state->empty_tuple->value.list = qi_list_make();
  2926. state->_stdin = qi_make_value(QI_FILE);
  2927. state->_stdin->value.file.fd = stdin;
  2928. strcpy(state->_stdin->value.file.mode, "r");
  2929. state->_stdin->value.file.is_open = true;
  2930. state->_stderr = qi_make_value(QI_FILE);
  2931. state->_stderr->value.file.fd = stderr;
  2932. strcpy(state->_stderr->value.file.mode, "w");
  2933. state->_stderr->value.file.is_open = true;
  2934. state->_stdout = qi_make_value(QI_FILE);
  2935. state->_stdout->value.file.fd = stdout;
  2936. strcpy(state->_stdout->value.file.mode, "w");
  2937. state->_stdout->value.file.is_open = true;
  2938. state->traps = qi_list_make();
  2939. state->scopes = qi_list_make();
  2940. qi_new_scope(state);
  2941. if (__debug_enabled)
  2942. state->calltrace = qi_list_make();
  2943. else
  2944. state->calltrace = NULL;
  2945. qi_decl_const(state, "nil", state->nil);
  2946. qi_decl_const(state, "true", state->_true);
  2947. qi_decl_const(state, "false", state->_false);
  2948. qi_decl_const(state, "NAN", state->nan);
  2949. qi_decl_const(state, "INFINITY", state->infinity);
  2950. qi_decl_const(state, "STDIN", state->_stdin);
  2951. qi_decl_const(state, "STDERR", state->_stderr);
  2952. qi_decl_const(state, "STDOUT", state->_stdout);
  2953. qi_add_builtin(state, "print", 1, qi_builtin_print);
  2954. qi_add_builtin(state, "println", 1, qi_builtin_println);
  2955. qi_add_builtin(state, "set_meta_table", 2, qi_builtin_set_meta_table);
  2956. qi_add_builtin(state, "get_meta_table", 1, qi_builtin_get_meta_table);
  2957. qi_add_builtin(state, "has_meta_table", 1, qi_builtin_has_meta_table);
  2958. qi_add_builtin(state, "delete_meta_table", 1, qi_builtin_delete_meta_table);
  2959. qi_add_builtin(state, "has_method", 2, qi_builtin_has_method);
  2960. qi_add_builtin(state, "delete_method", 2, qi_builtin_delete_method);
  2961. qi_add_builtin(state, "set_pseudomethod", 2, qi_builtin_set_pseudomethod);
  2962. qi_add_builtin(state, "has_pseudomethod", 1, qi_builtin_has_pseudomethod);
  2963. qi_add_builtin(state, "unset_pseudomethod", 1, qi_builtin_unset_pseudomethod);
  2964. qi_add_builtin(state, "set_global", 2, qi_builtin_set_global);
  2965. qi_add_builtin(state, "get_global", 1, qi_builtin_get_global);
  2966. qi_add_builtin(state, "get_globals", 0, qi_builtin_get_globals);
  2967. qi_add_builtin(state, "fopen", 2, qi_builtin_fopen);
  2968. qi_add_builtin(state, "fread", 2, qi_builtin_fread);
  2969. qi_add_builtin(state, "fgets", 2, qi_builtin_fgets);
  2970. qi_add_builtin(state, "fgetc", 1, qi_builtin_fgetc);
  2971. qi_add_builtin(state, "fputc", 2, qi_builtin_fputc);
  2972. qi_add_builtin(state, "fwrite", 2, qi_builtin_fwrite);
  2973. qi_add_builtin(state, "fputs", 2, qi_builtin_fputs);
  2974. qi_add_builtin(state, "fseek", 3, qi_builtin_fseek);
  2975. qi_add_builtin(state, "ftell", 1, qi_builtin_ftell);
  2976. qi_add_builtin(state, "fflush", 1, qi_builtin_fflush);
  2977. qi_add_builtin(state, "fclose", 1, qi_builtin_fclose);
  2978. qi_add_builtin(state, "fclosed", 1, qi_builtin_fclosed);
  2979. qi_add_builtin(state, "chr", 1, qi_builtin_chr);
  2980. qi_add_builtin(state, "ord", 1, qi_builtin_ord);
  2981. qi_add_builtin(state, "len", 1, qi_builtin_len);
  2982. qi_add_builtin(state, "type", 1, qi_builtin_type);
  2983. qi_add_builtin(state, "list_copy", 1, qi_builtin_list_copy);
  2984. qi_add_builtin(state, "list_push", 2, qi_builtin_list_push);
  2985. qi_add_builtin(state, "list_insert", 3, qi_builtin_list_insert);
  2986. qi_add_builtin(state, "list_delete", 2, qi_builtin_list_delete);
  2987. qi_add_builtin(state, "list_pop", 1, qi_builtin_list_pop);
  2988. qi_add_builtin(state, "table_copy", 1, qi_builtin_table_copy);
  2989. qi_add_builtin(state, "table_delete", 2, qi_builtin_table_delete);
  2990. qi_add_builtin(state, "func_name", 1, qi_builtin_func_name);
  2991. qi_add_builtin(state, "func_argc", 1, qi_builtin_func_argc);
  2992. qi_add_builtin(state, "func_call", 2, qi_builtin_func_call);
  2993. qi_add_builtin(state, "data_tag", 1, qi_builtin_data_tag);
  2994. qi_add_builtin(state, "repr", 1, qi_builtin_repr);
  2995. qi_add_builtin(state, "str", 1, qi_builtin_str);
  2996. qi_add_builtin(state, "bool", 1, qi_builtin_bool);
  2997. qi_add_builtin(state, "num", 1, qi_builtin_num);
  2998. qi_add_builtin(state, "bytes", 1, qi_builtin_bytes);
  2999. qi_add_builtin(state, "list", 1, qi_builtin_list);
  3000. qi_add_builtin(state, "tuple", 1, qi_builtin_tuple);
  3001. qi_add_builtin(state, "table", 1, qi_builtin_table);
  3002. qi_add_pseudomethod(state, "file.write", 0, qi_pseudomethod_file_write);
  3003. qi_add_pseudomethod(state, "file.read", 0, qi_pseudomethod_file_read);
  3004. qi_add_pseudomethod(state, "file.rewind", 0, qi_pseudomethod_file_rewind);
  3005. qi_add_pseudomethod(state, "list.push", 1, qi_pseudomethod_list_push);
  3006. qi_add_pseudomethod(state, "list.pop", 0, qi_pseudomethod_list_pop);
  3007. qi_add_pseudomethod(state, "function.call", 1, qi_pseudomethod_func_call);
  3008. state->_debug_data = NULL;
  3009. }
  3010. static void _qi_state_init(qi_state_t **state, bool enable_debug) {
  3011. GC_INIT();
  3012. GC_set_java_finalization(1);
  3013. *state = qi_malloc(sizeof(qi_state_t));
  3014. __debug_enabled = enable_debug;
  3015. qi_state_setup(*state);
  3016. __main_tid = pthread_self();
  3017. }
  3018. void qi_state_init(qi_state_t **state) { _qi_state_init(state, false); }
  3019. void qi_state_init_debug(qi_state_t **state) { _qi_state_init(state, true); }