qirt.c 108 KB

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