qirt.c 106 KB

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