qirt.c 110 KB

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