qirt.c 108 KB

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