qirt.c 126 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265
  1. #include "qirt.h"
  2. #include <stdio.h>
  3. #define GC_THREADS
  4. #include <gc.h>
  5. #include <pthread.h>
  6. static qi_bool __debug_enabled = false;
  7. static pthread_t __main_tid;
  8. static char *__recerror_msg = NULL;
  9. void *qi_malloc(qi_size_t size)
  10. {
  11. void *ptr = GC_MALLOC(size);
  12. if (!ptr)
  13. abort();
  14. return ptr;
  15. }
  16. void *qi_malloc_atomic(qi_size_t size)
  17. {
  18. void *ptr = GC_MALLOC_ATOMIC(size);
  19. if (!ptr)
  20. abort();
  21. return ptr;
  22. }
  23. void *qi_realloc(void *old_ptr, qi_size_t size)
  24. {
  25. void *ptr = GC_realloc(old_ptr, size);
  26. if (!ptr)
  27. abort();
  28. return ptr;
  29. }
  30. void *qi_calloc(qi_size_t count, qi_size_t size)
  31. {
  32. void *ptr = GC_MALLOC(count * size);
  33. if (!ptr)
  34. abort();
  35. return ptr;
  36. }
  37. char *qi_strdup(const char *s)
  38. {
  39. char *ptr = GC_strdup(s);
  40. if (!ptr)
  41. abort();
  42. return ptr;
  43. }
  44. void qi_free(void *ptr) { GC_FREE(ptr); }
  45. qi_list_t *qi_list_make(void)
  46. {
  47. qi_list_t *list = qi_malloc(sizeof(qi_list_t));
  48. list->data = NULL;
  49. list->length = 0;
  50. return list;
  51. }
  52. qi_list_t *qi_list_resize(qi_list_t *list, qi_size_t size)
  53. {
  54. if (list->length == size)
  55. return list;
  56. list->length = size;
  57. if (size == 0)
  58. {
  59. qi_free(list->data);
  60. list->data = NULL;
  61. }
  62. else
  63. list->data = qi_realloc(list->data, sizeof(void *) * list->length);
  64. return list;
  65. }
  66. void *qi_list_index(qi_list_t *list, qi_ssize_t index)
  67. {
  68. if (qi_list_empty(list))
  69. return NULL;
  70. if (index < 0)
  71. index += ((qi_ssize_t)qi_list_length(list));
  72. if (index < 0 || index >= qi_list_length(list))
  73. return NULL;
  74. return qi_list_data(list, index);
  75. }
  76. qi_list_t *qi_list_push(qi_list_t *list, void *value)
  77. {
  78. qi_list_resize(list, qi_list_length(list) + 1);
  79. qi_list_data(list, qi_list_length(list) - 1) = value;
  80. return list;
  81. }
  82. qi_bool qi_list_insert(qi_list_t *list, qi_ssize_t index, void *value)
  83. {
  84. if (index == -1 || index == (qi_ssize_t)qi_list_length(list))
  85. {
  86. qi_list_push(list, value);
  87. return true;
  88. }
  89. if (index < 0)
  90. index += (qi_ssize_t)qi_list_length(list);
  91. if (index < 0 || index > qi_list_length(list))
  92. return false;
  93. qi_list_resize(list, qi_list_length(list) + 1);
  94. for (qi_size_t i = qi_list_length(list); index == 0 ? i > 0 : i >= index; i--)
  95. qi_list_data(list, i) = qi_list_data(list, i - 1);
  96. qi_list_data(list, index) = value;
  97. return true;
  98. }
  99. qi_bool qi_list_delete(qi_list_t *list, qi_ssize_t index)
  100. {
  101. if (qi_list_empty(list))
  102. return false;
  103. if (index == -1 || index == (qi_ssize_t)qi_list_length(list))
  104. {
  105. qi_list_pop(list);
  106. return true;
  107. }
  108. if (index < 0)
  109. index += (qi_ssize_t)qi_list_length(list);
  110. if (index < 0 || index >= qi_list_length(list))
  111. return false;
  112. qi_list_data(list, index) = NULL;
  113. if (qi_list_length(list) == 1)
  114. {
  115. qi_list_resize(list, 0);
  116. return true;
  117. }
  118. for (qi_size_t i = index; i < qi_list_length(list) - 1; i++)
  119. qi_list_data(list, i) = qi_list_data(list, i + 1);
  120. qi_list_resize(list, qi_list_length(list) - 1);
  121. return true;
  122. }
  123. qi_bool qi_list_set(qi_list_t *list, qi_ssize_t index, void *value)
  124. {
  125. qi_size_t length = qi_list_length(list);
  126. if (index < 0)
  127. index += ((qi_ssize_t)length);
  128. if (index == ((qi_ssize_t)length))
  129. {
  130. qi_list_push(list, value);
  131. return true;
  132. }
  133. if (index < 0 || index >= length)
  134. return false;
  135. qi_list_data(list, index) = value;
  136. return true;
  137. }
  138. void *qi_list_pop(qi_list_t *list)
  139. {
  140. if (qi_list_empty(list))
  141. return NULL;
  142. void *value = qi_list_last(list);
  143. qi_list_resize(list, qi_list_length(list) - 1);
  144. return value;
  145. }
  146. qi_bool qi_list_contains(qi_list_t *list, void *value)
  147. {
  148. if (qi_list_empty(list))
  149. return false;
  150. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  151. if (qi_list_data(list, i) == value)
  152. return true;
  153. return false;
  154. }
  155. qi_list_t *qi_list_copy(qi_list_t *list)
  156. {
  157. qi_list_t *newlist = qi_list_make_n(qi_list_length(list));
  158. if (qi_list_empty(list))
  159. return newlist;
  160. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  161. newlist->data[i] = list->data[i];
  162. return newlist;
  163. }
  164. qi_table_t *qi_table_make(void)
  165. {
  166. qi_table_t *table = qi_malloc(sizeof(qi_table_t));
  167. table->used = 0;
  168. table->capacity = QI_TABLE_MIN_CAP;
  169. table->entries = qi_calloc(table->capacity, sizeof(qi_table_entry_t));
  170. return table;
  171. }
  172. static uint64_t MM86128(void *key, const int len, uint32_t seed)
  173. {
  174. #define ROTL32(x, r) ((x << r) | (x >> (32 - r)))
  175. #define FMIX32(h) \
  176. h ^= h >> 16; \
  177. h *= 0x85ebca6b; \
  178. h ^= h >> 13; \
  179. h *= 0xc2b2ae35; \
  180. h ^= h >> 16;
  181. const uint8_t *data = (const uint8_t *)key;
  182. const int nblocks = len / 16;
  183. uint32_t h1 = seed;
  184. uint32_t h2 = seed;
  185. uint32_t h3 = seed;
  186. uint32_t h4 = seed;
  187. uint32_t c1 = 0x239b961b;
  188. uint32_t c2 = 0xab0e9789;
  189. uint32_t c3 = 0x38b34ae5;
  190. uint32_t c4 = 0xa1e38b93;
  191. const uint32_t *blocks = (const uint32_t *)(data + nblocks * 16);
  192. for (int i = -nblocks; i; i++)
  193. {
  194. uint32_t k1 = blocks[i * 4 + 0];
  195. uint32_t k2 = blocks[i * 4 + 1];
  196. uint32_t k3 = blocks[i * 4 + 2];
  197. uint32_t k4 = blocks[i * 4 + 3];
  198. k1 *= c1;
  199. k1 = ROTL32(k1, 15);
  200. k1 *= c2;
  201. h1 ^= k1;
  202. h1 = ROTL32(h1, 19);
  203. h1 += h2;
  204. h1 = h1 * 5 + 0x561ccd1b;
  205. k2 *= c2;
  206. k2 = ROTL32(k2, 16);
  207. k2 *= c3;
  208. h2 ^= k2;
  209. h2 = ROTL32(h2, 17);
  210. h2 += h3;
  211. h2 = h2 * 5 + 0x0bcaa747;
  212. k3 *= c3;
  213. k3 = ROTL32(k3, 17);
  214. k3 *= c4;
  215. h3 ^= k3;
  216. h3 = ROTL32(h3, 15);
  217. h3 += h4;
  218. h3 = h3 * 5 + 0x96cd1c35;
  219. k4 *= c4;
  220. k4 = ROTL32(k4, 18);
  221. k4 *= c1;
  222. h4 ^= k4;
  223. h4 = ROTL32(h4, 13);
  224. h4 += h1;
  225. h4 = h4 * 5 + 0x32ac3b17;
  226. }
  227. const uint8_t *tail = (const uint8_t *)(data + nblocks * 16);
  228. uint32_t k1 = 0;
  229. uint32_t k2 = 0;
  230. uint32_t k3 = 0;
  231. uint32_t k4 = 0;
  232. switch (len & 15)
  233. {
  234. case 15:
  235. k4 ^= tail[14] << 16;
  236. case 14:
  237. k4 ^= tail[13] << 8;
  238. case 13:
  239. k4 ^= tail[12] << 0;
  240. k4 *= c4;
  241. k4 = ROTL32(k4, 18);
  242. k4 *= c1;
  243. h4 ^= k4;
  244. case 12:
  245. k3 ^= tail[11] << 24;
  246. case 11:
  247. k3 ^= tail[10] << 16;
  248. case 10:
  249. k3 ^= tail[9] << 8;
  250. case 9:
  251. k3 ^= tail[8] << 0;
  252. k3 *= c3;
  253. k3 = ROTL32(k3, 17);
  254. k3 *= c4;
  255. h3 ^= k3;
  256. case 8:
  257. k2 ^= tail[7] << 24;
  258. case 7:
  259. k2 ^= tail[6] << 16;
  260. case 6:
  261. k2 ^= tail[5] << 8;
  262. case 5:
  263. k2 ^= tail[4] << 0;
  264. k2 *= c2;
  265. k2 = ROTL32(k2, 16);
  266. k2 *= c3;
  267. h2 ^= k2;
  268. case 4:
  269. k1 ^= tail[3] << 24;
  270. case 3:
  271. k1 ^= tail[2] << 16;
  272. case 2:
  273. k1 ^= tail[1] << 8;
  274. case 1:
  275. k1 ^= tail[0] << 0;
  276. k1 *= c1;
  277. k1 = ROTL32(k1, 15);
  278. k1 *= c2;
  279. h1 ^= k1;
  280. }
  281. h1 ^= len;
  282. h2 ^= len;
  283. h3 ^= len;
  284. h4 ^= len;
  285. h1 += h2;
  286. h1 += h3;
  287. h1 += h4;
  288. h2 += h1;
  289. h3 += h1;
  290. h4 += h1;
  291. FMIX32(h1);
  292. FMIX32(h2);
  293. FMIX32(h3);
  294. FMIX32(h4);
  295. h1 += h2;
  296. h1 += h3;
  297. h1 += h4;
  298. h2 += h1;
  299. h3 += h1;
  300. h4 += h1;
  301. return (((uint64_t)h2) << 32) | h1;
  302. }
  303. static uint32_t QI_HASH_SEED = 0;
  304. void *qi_table_get(qi_table_t *table, char *key)
  305. {
  306. if (qi_table_empty(table))
  307. return NULL;
  308. uint64_t hash = MM86128(key, strlen(key), QI_HASH_SEED);
  309. qi_size_t index = hash % table->capacity;
  310. qi_size_t i = index;
  311. while (table->entries[i].key)
  312. {
  313. if (!table->entries[i].is_deleted &&
  314. strcmp(table->entries[i].key, key) == 0)
  315. return table->entries[i].value;
  316. i++;
  317. if (i >= table->capacity)
  318. i = 0;
  319. if (i == index)
  320. break;
  321. }
  322. return NULL;
  323. }
  324. qi_bool qi_table_has(qi_table_t *table, char *key)
  325. {
  326. if (qi_table_empty(table))
  327. return false;
  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. {
  333. if (!table->entries[i].is_deleted &&
  334. strcmp(table->entries[i].key, key) == 0)
  335. return true;
  336. i++;
  337. if (i >= table->capacity)
  338. i = 0;
  339. if (i == index)
  340. break;
  341. }
  342. return false;
  343. }
  344. static void qi_table_entry_set(qi_table_entry_t *entries, char *key,
  345. void *value, qi_size_t capacity,
  346. qi_size_t *used)
  347. {
  348. uint64_t hash = MM86128(key, strlen(key), QI_HASH_SEED);
  349. qi_size_t index = hash % capacity;
  350. qi_size_t i = index;
  351. while (entries[i].key)
  352. {
  353. if (strcmp(entries[i].key, key) == 0)
  354. {
  355. entries[i].value = value;
  356. if (entries[i].is_deleted)
  357. {
  358. if (used)
  359. (*used)++;
  360. entries[i].is_deleted = false;
  361. }
  362. return;
  363. }
  364. else if (entries[i].is_deleted)
  365. break;
  366. i++;
  367. if (i >= capacity)
  368. i = 0;
  369. if (i == index)
  370. break;
  371. }
  372. if (used)
  373. (*used)++;
  374. entries[i].key = key;
  375. entries[i].value = value;
  376. entries[i].is_deleted = false;
  377. }
  378. qi_table_t *qi_table_set(qi_table_t *table, char *key, void *value)
  379. {
  380. if (table->used >= table->capacity)
  381. {
  382. qi_size_t capacity = table->capacity + QI_TABLE_MIN_CAP;
  383. qi_table_entry_t *entries = qi_calloc(capacity, sizeof(qi_table_entry_t));
  384. for (qi_size_t i = 0; i < table->capacity; i++)
  385. {
  386. qi_table_entry_t entry = table->entries[i];
  387. if (entry.key && !entry.is_deleted)
  388. qi_table_entry_set(entries, entry.key, entry.value, capacity, NULL);
  389. }
  390. qi_free(table->entries);
  391. table->entries = entries;
  392. table->capacity = capacity;
  393. }
  394. qi_table_entry_set(table->entries, key, value, table->capacity, &table->used);
  395. return table;
  396. }
  397. qi_list_t *qi_table_keys(qi_table_t *table)
  398. {
  399. qi_list_t *list = qi_list_make();
  400. qi_table_iterate(table, { qi_list_push(list, entry.key); });
  401. return list;
  402. }
  403. qi_bool qi_table_delete(qi_table_t *table, char *key)
  404. {
  405. uint64_t hash = MM86128(key, strlen(key), QI_HASH_SEED);
  406. qi_size_t index = hash % table->capacity;
  407. qi_size_t i = index;
  408. while (table->entries[i].key)
  409. {
  410. if (!table->entries[i].is_deleted &&
  411. strcmp(table->entries[i].key, key) == 0)
  412. {
  413. table->entries[i].value = NULL;
  414. table->entries[i].is_deleted = true;
  415. table->used--;
  416. if (table->capacity > QI_TABLE_MIN_CAP &&
  417. table->used <= table->capacity - QI_TABLE_MIN_CAP)
  418. {
  419. qi_size_t capacity = table->capacity - QI_TABLE_MIN_CAP;
  420. qi_table_entry_t *entries =
  421. qi_calloc(capacity, sizeof(qi_table_entry_t));
  422. for (qi_size_t i = 0; i < table->capacity; i++)
  423. {
  424. qi_table_entry_t entry = table->entries[i];
  425. if (entry.key && !entry.is_deleted)
  426. qi_table_entry_set(entries, entry.key, entry.value, capacity, NULL);
  427. }
  428. qi_free(table->entries);
  429. table->entries = entries;
  430. table->capacity = capacity;
  431. }
  432. return true;
  433. }
  434. i++;
  435. if (i >= table->capacity)
  436. i = 0;
  437. if (i == index)
  438. break;
  439. }
  440. return false;
  441. }
  442. qi_table_t *qi_table_copy(qi_table_t *table)
  443. {
  444. qi_table_t *newtable = qi_table_make();
  445. qi_table_iterate(table, { qi_table_set(newtable, entry.key, entry.value); });
  446. return newtable;
  447. }
  448. static qi_buffer_t *qi_buffer_make(void)
  449. {
  450. qi_buffer_t *buf = qi_malloc(sizeof(qi_buffer_t));
  451. buf->str = NULL;
  452. buf->used = buf->allocated = 0;
  453. return buf;
  454. }
  455. static void qi_buffer_append(qi_buffer_t *buf, char c)
  456. {
  457. buf->used++;
  458. if (buf->used > buf->allocated)
  459. {
  460. buf->allocated++;
  461. buf->str = qi_realloc(buf->str, sizeof(char) * buf->allocated);
  462. }
  463. buf->str[buf->used - 1] = c;
  464. }
  465. static void qi_buffer_append_str(qi_buffer_t *buf, char *s)
  466. {
  467. while (*s)
  468. qi_buffer_append(buf, *s++);
  469. }
  470. static void qi_buffer_append_str_escaped(qi_buffer_t *buf, char *s)
  471. {
  472. while (*s)
  473. {
  474. char c = *s++;
  475. if (c == '"' || c == '\\')
  476. qi_buffer_append(buf, '\\');
  477. qi_buffer_append(buf, c);
  478. }
  479. }
  480. static char *qi_buffer_read(qi_buffer_t *buf)
  481. {
  482. if (buf->used == 0 || buf->str[buf->used - 1])
  483. qi_buffer_append(buf, 0);
  484. return buf->str;
  485. }
  486. void _qi_add_defer(qi_state_t *state, qi_ssize_t index, qi_defer_t defer,
  487. qi_bool is_local)
  488. {
  489. if (qi_list_empty(state->scopes))
  490. return;
  491. qi_scope_t *scope = NULL;
  492. if (is_local)
  493. {
  494. scope = qi_list_last(state->scopes);
  495. qi_list_insert(scope->defers, index, (void *)defer);
  496. return;
  497. }
  498. for (qi_ssize_t i = state->scopes->length - 1; i >= 0; i--)
  499. {
  500. qi_scope_t *tmp = qi_list_index(state->scopes, i);
  501. if (i == 0 || tmp->is_sticky)
  502. {
  503. scope = tmp;
  504. break;
  505. }
  506. else if (tmp->is_barrier)
  507. break;
  508. scope = tmp;
  509. }
  510. if (!scope)
  511. scope = qi_list_last(state->scopes);
  512. qi_list_insert(scope->defers, index, (void *)defer);
  513. }
  514. qi_defer_t qi_pop_defer(qi_state_t *state, qi_ssize_t index)
  515. {
  516. if (qi_list_empty(state->scopes))
  517. return NULL;
  518. qi_scope_t *scope = qi_list_last(state->scopes);
  519. qi_defer_t defer = qi_list_index(scope->defers, index);
  520. if (defer)
  521. qi_list_delete(scope->defers, index);
  522. return defer;
  523. }
  524. void qi_new_scope(qi_state_t *state)
  525. {
  526. qi_scope_t *scope = qi_malloc(sizeof(qi_scope_t));
  527. scope->scope = qi_table_make();
  528. scope->defers = qi_list_make();
  529. scope->is_barrier = false;
  530. scope->is_sticky = false;
  531. scope->mutex = qi_mutex_create();
  532. qi_list_push(state->scopes, scope);
  533. }
  534. void qi_new_sticky_scope(qi_state_t *state)
  535. {
  536. qi_new_scope(state);
  537. ((qi_scope_t *)qi_list_last(state->scopes))->is_sticky = true;
  538. }
  539. static void qi_scope_run_defers(qi_state_t *state, qi_scope_t *scope)
  540. {
  541. qi_mutex_lock(scope->mutex);
  542. qi_list_t *defers = scope->defers;
  543. if (qi_list_empty(defers))
  544. {
  545. qi_mutex_unlock(scope->mutex);
  546. return;
  547. }
  548. scope->defers = qi_list_make();
  549. qi_mutex_unlock(scope->mutex);
  550. for (qi_size_t i = 0; i < qi_list_length(defers); i++)
  551. {
  552. qi_defer_t defer = (qi_defer_t)(qi_list_data(defers, i));
  553. defer(state);
  554. }
  555. }
  556. static qi_bool _qi_old_scope(qi_state_t *state, qi_bool ignore_barriers)
  557. {
  558. qi_scope_t *scope;
  559. if (qi_list_empty(state->scopes))
  560. return false;
  561. scope = qi_list_last(state->scopes);
  562. if (!ignore_barriers && scope->is_barrier)
  563. return false;
  564. qi_scope_run_defers(state, scope);
  565. qi_list_pop(state->scopes);
  566. return true;
  567. }
  568. qi_bool qi_old_scope(qi_state_t *state) { return _qi_old_scope(state, false); }
  569. qi_value_t *qi_call_meta(qi_state_t *state, qi_bool *fail_flag,
  570. qi_value_t *value, char *name, qi_size_t count, ...);
  571. void qi_value_finalizer(GC_PTR _value, GC_PTR _state)
  572. {
  573. qi_state_t *state = (qi_state_t *)_state;
  574. qi_value_t *value = (qi_value_t *)_value;
  575. if (value->type == QI_TABLE && value->value.table.metatable)
  576. qi_call_meta(state, NULL, value, "__fin", 1, value);
  577. else if (value->type == QI_FILE && value->value.file.is_open &&
  578. value->value.file.fd != stdin && value->value.file.fd != stderr &&
  579. value->value.file.fd != stdout)
  580. {
  581. fclose(value->value.file.fd);
  582. value->value.file.is_open = false;
  583. }
  584. if (value->type == QI_TABLE || value->type == QI_LIST)
  585. {
  586. if (value->mutex)
  587. qi_mutex_destroy(value->mutex);
  588. value->mutex = NULL;
  589. }
  590. }
  591. qi_value_t *qi_make_value(qi_type_t type)
  592. {
  593. qi_value_t *value;
  594. if (type == QI_NUMBER || type == QI_BOOLEAN || type == QI_FILE)
  595. value = qi_malloc_atomic(sizeof(qi_value_t));
  596. else
  597. value = qi_malloc(sizeof(qi_value_t));
  598. value->type = type;
  599. value->mutex = NULL;
  600. return value;
  601. }
  602. qi_value_t *qi_make_number(qi_state_t *state, double number)
  603. {
  604. qi_value_t *value;
  605. if (isnan(number))
  606. return state->nan;
  607. else if (number == INFINITY)
  608. return state->infinity;
  609. else if (number == -INFINITY)
  610. return state->ninfinity;
  611. else if (number >= 0 && number < 256 && number == (double)((qi_size_t)number))
  612. return state->numbers[(qi_size_t)number];
  613. else if (number < 0 && number >= -8 &&
  614. fabs(number) == (double)((qi_size_t)fabs(number)))
  615. return state->nnumbers[((qi_size_t)fabs(number)) - 1];
  616. value = qi_make_value(QI_NUMBER);
  617. value->value.number = number;
  618. return value;
  619. }
  620. qi_value_t *qi_make_string(qi_state_t *state, char *string)
  621. {
  622. qi_value_t *value;
  623. qi_size_t len = strlen(string);
  624. if (len == 0)
  625. return state->empty_string;
  626. else if (len <= 24)
  627. {
  628. qi_mutex_lock(state->intern_strs_mutex);
  629. value = qi_table_get(state->intern_strs, string);
  630. qi_mutex_unlock(state->intern_strs_mutex);
  631. if (value)
  632. return value;
  633. }
  634. value = qi_make_value(QI_STRING);
  635. value->value.string = string;
  636. if (len <= 24)
  637. {
  638. qi_mutex_lock(state->intern_strs_mutex);
  639. qi_table_set(state->intern_strs, string, value);
  640. qi_mutex_unlock(state->intern_strs_mutex);
  641. }
  642. return value;
  643. }
  644. qi_value_t *qi_make_string_copy(qi_state_t *state, char *string)
  645. {
  646. return qi_make_string(state, qi_strdup(string));
  647. }
  648. qi_value_t *qi_make_bytes(qi_state_t *state, unsigned char *bytes,
  649. qi_size_t size)
  650. {
  651. qi_value_t *value;
  652. if (size == 0 || bytes == NULL)
  653. return state->empty_bytes;
  654. value = qi_make_value(QI_BYTES);
  655. value->value.bytes = qi_malloc(sizeof(qi_bytes_t));
  656. value->value.bytes->data = bytes;
  657. value->value.bytes->size = size;
  658. return value;
  659. }
  660. qi_value_t *qi_make_char(qi_state_t *state, char c)
  661. {
  662. char string[2];
  663. string[0] = c;
  664. string[1] = 0;
  665. qi_mutex_lock(state->intern_strs_mutex);
  666. qi_value_t *value = qi_table_get(state->intern_strs, string);
  667. qi_mutex_unlock(state->intern_strs_mutex);
  668. return value;
  669. }
  670. qi_value_t *qi_make_file(qi_state_t *state, FILE *file, char *mode)
  671. {
  672. qi_value_t *value = qi_make_value(QI_FILE);
  673. value->value.file.fd = file;
  674. strncpy(value->value.file.mode, mode, 4);
  675. value->value.file.is_open = true;
  676. GC_register_finalizer(value, qi_value_finalizer, (void *)state, NULL, NULL);
  677. return value;
  678. }
  679. qi_value_t *qi_make_list(qi_state_t *state, qi_list_t *list)
  680. {
  681. qi_value_t *value = qi_make_value(QI_LIST);
  682. value->mutex = qi_mutex_create();
  683. value->value.list = !list ? qi_list_make() : list;
  684. GC_register_finalizer(value, qi_value_finalizer, (void *)state, NULL, NULL);
  685. return value;
  686. }
  687. qi_value_t *qi_make_tuple(qi_state_t *state, qi_list_t *tuple)
  688. {
  689. qi_value_t *value;
  690. if (!tuple || qi_list_empty(tuple))
  691. return state->empty_tuple;
  692. value = qi_make_value(QI_TUPLE);
  693. value->value.list = tuple;
  694. return value;
  695. }
  696. qi_value_t *qi_make_table(qi_state_t *state, qi_table_t *table)
  697. {
  698. qi_value_t *value = qi_make_value(QI_TABLE);
  699. value->mutex = qi_mutex_create();
  700. value->value.table.table = !table ? qi_table_make() : table;
  701. value->value.table.metatable = state->nil;
  702. GC_register_finalizer(value, qi_value_finalizer, (void *)state, NULL, NULL);
  703. return value;
  704. }
  705. qi_value_t *qi_make_function(qi_state_t *state, char *name, qi_size_t pargc,
  706. qi_handle_t handle, qi_table_t *captured)
  707. {
  708. qi_value_t *value = qi_make_value(QI_FUNCTION);
  709. value->value.function.name = name;
  710. value->value.function.pargc = pargc;
  711. value->value.function.handle = handle;
  712. value->value.function.captured = captured;
  713. value->value.function.is_builtin = false;
  714. value->value.function.is_pm = false;
  715. return value;
  716. }
  717. qi_value_t *qi_make_builtin_function(qi_state_t *state, char *name,
  718. qi_size_t pargc, qi_handle_t handle)
  719. {
  720. qi_value_t *value = qi_make_value(QI_FUNCTION);
  721. value->value.function.name = name;
  722. value->value.function.pargc = pargc;
  723. value->value.function.handle = handle;
  724. value->value.function.captured = NULL;
  725. value->value.function.is_builtin = true;
  726. value->value.function.is_pm = false;
  727. return value;
  728. }
  729. qi_value_t *qi_make_data(qi_state_t *state, unsigned int tag, void *data)
  730. {
  731. qi_value_t *value = qi_make_value(QI_DATA);
  732. value->value.data.tag = tag;
  733. value->value.data.data = data;
  734. return value;
  735. }
  736. qi_value_t *qi_make_ref(qi_state_t *state, char *name)
  737. {
  738. qi_ssize_t scopes_count = qi_list_length(state->scopes);
  739. qi_scope_t *r = NULL;
  740. if (scopes_count > 0)
  741. for (qi_ssize_t i = scopes_count - 1; i >= 0; i--)
  742. {
  743. qi_scope_t *scope = qi_list_index(state->scopes, i);
  744. if (scope->is_barrier)
  745. continue;
  746. qi_mutex_lock(scope->mutex);
  747. qi_symbol_t *symbol = qi_table_get(scope->scope, name);
  748. qi_mutex_unlock(scope->mutex);
  749. if (symbol)
  750. {
  751. r = scope;
  752. break;
  753. }
  754. }
  755. if (!r)
  756. qi_throw_class(state, state->nameerror, "%s", name);
  757. qi_value_t *value = qi_make_value(QI_REFERENCE);
  758. value->value.ref.name = name;
  759. value->value.ref.scope = r;
  760. return value;
  761. }
  762. static qi_value_t *qi_get_pseudomethod(qi_state_t *state, qi_value_t *value,
  763. char *name)
  764. {
  765. qi_mutex_lock(state->pseudomethods_mutex);
  766. char pseudomethod_name[64];
  767. snprintf(pseudomethod_name, sizeof(pseudomethod_name), "%s.%s",
  768. qi_repr_type(value->type), name);
  769. qi_value_t *meta = qi_table_get(state->pseudomethods, pseudomethod_name);
  770. qi_mutex_unlock(state->pseudomethods_mutex);
  771. return meta;
  772. }
  773. qi_value_t *qi_add_pseudomethod(qi_state_t *state, char *name, qi_size_t pargc,
  774. qi_handle_t handle)
  775. {
  776. qi_value_t *method = qi_make_function(state, name, pargc + 1, handle, NULL);
  777. method->value.function.is_pm = true;
  778. qi_mutex_lock(state->pseudomethods_mutex);
  779. qi_table_set(state->pseudomethods, name, method);
  780. qi_mutex_unlock(state->pseudomethods_mutex);
  781. return method;
  782. }
  783. qi_value_t *qi_get_method(qi_state_t *state, qi_value_t *value, char *name)
  784. {
  785. if (value->type != QI_TABLE)
  786. return qi_get_pseudomethod(state, value, name);
  787. qi_value_t *method = NULL;
  788. LOCKED(value, {
  789. if (qi_has_metatable(value))
  790. method = qi_table_get(qi_get_metatable(value), name);
  791. });
  792. if (!method)
  793. return qi_get_pseudomethod(state, value, name);
  794. return method;
  795. }
  796. qi_value_t *qi_call_meta(qi_state_t *state, qi_bool *fail_flag,
  797. qi_value_t *value, char *name, qi_size_t count, ...)
  798. {
  799. qi_value_t *meta = qi_get_method(state, value, name);
  800. if (!meta)
  801. return NULL;
  802. qi_list_t *args = qi_list_make();
  803. va_list vargs;
  804. va_start(vargs, count);
  805. for (qi_size_t i = 0; i < count; i++)
  806. qi_list_push(args, va_arg(vargs, qi_value_t *));
  807. va_end(vargs);
  808. qi_value_t *ret = NULL;
  809. if (fail_flag)
  810. {
  811. qi_try(
  812. state, { ret = qi_call(state, meta, args); },
  813. {
  814. if (trap->value == state->nil)
  815. {
  816. *fail_flag = true;
  817. ret = NULL;
  818. }
  819. else
  820. qi_throw(state, trap->value);
  821. },
  822. NULL);
  823. }
  824. else
  825. ret = qi_call(state, meta, args);
  826. return ret;
  827. }
  828. char *_qi_type(qi_state_t *state, qi_value_t *value)
  829. {
  830. qi_value_t *meta;
  831. if ((meta = qi_call_meta(state, NULL, value, "__type", 1, value)))
  832. {
  833. if (meta->type != QI_STRING)
  834. qi_typeerror(state, "__type returned non-string value (%s)",
  835. _qi_type(state, meta));
  836. char *name = meta->value.string;
  837. for (int i = 0; i < sizeof(qi_type_names); i++)
  838. if (strcmp(qi_type_names[i], name) == 0)
  839. qi_throw_class(state, state->valueerror,
  840. "__type returned type name should not match builtin "
  841. "type names (got '%s')",
  842. name);
  843. return name;
  844. }
  845. if (value->type == QI_TABLE)
  846. {
  847. qi_mutex_lock(value->mutex);
  848. if (qi_has_metatable(value))
  849. {
  850. qi_mutex_unlock(value->mutex);
  851. return (char *)qi_repr_type(QI_OBJECT);
  852. }
  853. qi_mutex_unlock(value->mutex);
  854. }
  855. return (char *)qi_repr_type(value->type);
  856. }
  857. char *_qi_repr(qi_state_t *state, qi_list_t *tempstack, qi_value_t *value,
  858. qi_bool quote)
  859. {
  860. char string[128];
  861. qi_buffer_t *buffer;
  862. qi_bool flag;
  863. qi_value_t *meta;
  864. if ((meta = qi_call_meta(state, NULL, value, quote ? "__repr" : "__str", 1,
  865. value)))
  866. {
  867. if (meta->type != QI_STRING)
  868. qi_typeerror(state, "%s returned non-string value (%s)",
  869. quote ? "__repr" : "__str", _qi_type(state, meta));
  870. return meta->value.string;
  871. }
  872. else if (quote &&
  873. (meta = qi_call_meta(state, NULL, value, "__str", 1, value)))
  874. {
  875. if (meta->type != QI_STRING)
  876. qi_typeerror(state, "__str returned non-string value (%s)",
  877. _qi_type(state, meta));
  878. return meta->value.string;
  879. }
  880. if (value == state->nil)
  881. return qi_strdup("nil");
  882. else if (value == state->_true)
  883. return qi_strdup("true");
  884. else if (value == state->_false)
  885. return qi_strdup("false");
  886. else if (value == state->zero)
  887. return qi_strdup("0");
  888. else if (value == state->one)
  889. return qi_strdup("1");
  890. else if (value == state->nan)
  891. return qi_strdup("NAN");
  892. else if (value == state->infinity)
  893. return qi_strdup("INFINITY");
  894. else if (value == state->ninfinity)
  895. return qi_strdup("-INFINITY");
  896. else if (value == state->empty_string)
  897. {
  898. if (quote)
  899. return qi_strdup("\"\"");
  900. return qi_strdup("");
  901. }
  902. else if (value == state->empty_bytes)
  903. return qi_strdup("bytes([])");
  904. else if (value == state->empty_tuple)
  905. return qi_strdup("()");
  906. switch (value->type)
  907. {
  908. case QI_NULL:
  909. return qi_strdup("nil");
  910. case QI_BOOLEAN:
  911. return qi_strdup(value->value.boolean ? "True" : "False");
  912. case QI_NUMBER:
  913. if (isnan(value->value.number))
  914. return qi_strdup("NAN");
  915. else if (value->value.number == INFINITY)
  916. return qi_strdup("INFINITY");
  917. else if (value->value.number == -INFINITY)
  918. return qi_strdup("-INFINITY");
  919. snprintf(string, sizeof(string), "%.15g", value->value.number);
  920. return qi_strdup(string);
  921. case QI_STRING:
  922. buffer = qi_buffer_make();
  923. if (quote)
  924. qi_buffer_append(buffer, '"');
  925. for (qi_size_t i = 0; i < strlen(value->value.string); i++)
  926. {
  927. char c = value->value.string[i];
  928. if (quote)
  929. {
  930. switch (c)
  931. {
  932. case '"':
  933. case '\\':
  934. qi_buffer_append(buffer, '\\');
  935. break;
  936. case '\n':
  937. qi_buffer_append(buffer, '\\');
  938. qi_buffer_append(buffer, 'n');
  939. continue;
  940. case '\t':
  941. qi_buffer_append(buffer, '\\');
  942. qi_buffer_append(buffer, 't');
  943. continue;
  944. case '\r':
  945. qi_buffer_append(buffer, '\\');
  946. qi_buffer_append(buffer, 'r');
  947. continue;
  948. }
  949. if (!isprint(c))
  950. {
  951. char temp[8];
  952. snprintf(temp, sizeof(temp), "\\x%02x", (unsigned char)c);
  953. qi_buffer_append_str(buffer, temp);
  954. continue;
  955. }
  956. }
  957. qi_buffer_append(buffer, c);
  958. }
  959. if (quote)
  960. qi_buffer_append(buffer, '"');
  961. return qi_buffer_read(buffer);
  962. case QI_BYTES:
  963. if (!quote)
  964. {
  965. if (value->value.bytes->size == 0)
  966. return qi_strdup("");
  967. buffer = qi_buffer_make();
  968. qi_buffer_append_str(buffer, (char *)value->value.bytes->data);
  969. return qi_buffer_read(buffer);
  970. }
  971. if (value->value.bytes->size == 0)
  972. return qi_strdup("bytes([])");
  973. buffer = qi_buffer_make();
  974. qi_buffer_append_str(buffer, "bytes([");
  975. for (qi_size_t i = 0; i < value->value.bytes->size; i++)
  976. {
  977. snprintf(string, sizeof(string), "%d", value->value.bytes->data[i]);
  978. qi_buffer_append_str(buffer, string);
  979. if (i != value->value.bytes->size - 1)
  980. qi_buffer_append_str(buffer, ", ");
  981. }
  982. qi_buffer_append_str(buffer, "])");
  983. return qi_buffer_read(buffer);
  984. case QI_FILE:
  985. snprintf(string, sizeof(string), "<file %d>", fileno(value->value.file.fd));
  986. return qi_strdup(string);
  987. case QI_LIST:
  988. if (qi_list_contains(tempstack, value))
  989. return qi_strdup("[...]");
  990. LOCKED(value, {
  991. if (qi_list_empty(value->value.list))
  992. {
  993. qi_mutex_unlock(value->mutex);
  994. return qi_strdup("[]");
  995. }
  996. qi_list_push(tempstack, value);
  997. buffer = qi_buffer_make();
  998. qi_buffer_append(buffer, '[');
  999. for (qi_size_t i = 0; i < qi_list_length(value->value.list); i++)
  1000. {
  1001. qi_buffer_append_str(
  1002. buffer, _qi_repr(state, tempstack,
  1003. qi_list_data(value->value.list, i), true));
  1004. if (i != qi_list_length(value->value.list) - 1)
  1005. qi_buffer_append_str(buffer, ", ");
  1006. }
  1007. qi_buffer_append(buffer, ']');
  1008. });
  1009. return qi_buffer_read(buffer);
  1010. case QI_TUPLE:
  1011. if (qi_list_empty(value->value.list))
  1012. return qi_strdup("()");
  1013. if (qi_list_contains(tempstack, value))
  1014. return qi_strdup("(...)");
  1015. qi_list_push(tempstack, value);
  1016. buffer = qi_buffer_make();
  1017. qi_buffer_append(buffer, '(');
  1018. if (qi_list_length(value->value.list) == 1)
  1019. {
  1020. qi_buffer_append_str(
  1021. buffer,
  1022. _qi_repr(state, tempstack, qi_list_first(value->value.list), true));
  1023. qi_buffer_append_str(buffer, ", ");
  1024. }
  1025. else
  1026. for (qi_size_t i = 0; i < qi_list_length(value->value.list); i++)
  1027. {
  1028. qi_buffer_append_str(
  1029. buffer, _qi_repr(state, tempstack,
  1030. qi_list_data(value->value.list, i), true));
  1031. if (i != qi_list_length(value->value.list) - 1)
  1032. qi_buffer_append_str(buffer, ", ");
  1033. }
  1034. qi_buffer_append(buffer, ')');
  1035. return qi_buffer_read(buffer);
  1036. case QI_TABLE:
  1037. if (qi_list_contains(tempstack, value))
  1038. return qi_strdup("{...}");
  1039. LOCKED(value, {
  1040. if (qi_table_empty(value->value.table.table))
  1041. {
  1042. qi_mutex_unlock(value->mutex);
  1043. return qi_strdup(qi_has_metatable(value) ? "<object {}>" : "{}");
  1044. }
  1045. qi_list_push(tempstack, value);
  1046. buffer = qi_buffer_make();
  1047. flag = true;
  1048. if (qi_has_metatable(value))
  1049. qi_buffer_append_str(buffer, "<object ");
  1050. qi_buffer_append(buffer, '{');
  1051. qi_table_iterate(value->value.table.table, {
  1052. if (flag)
  1053. flag = false;
  1054. else
  1055. qi_buffer_append_str(buffer, ", ");
  1056. qi_buffer_append(buffer, '"');
  1057. qi_buffer_append_str_escaped(buffer, entry.key);
  1058. qi_buffer_append(buffer, '"');
  1059. qi_buffer_append_str(buffer, ": ");
  1060. qi_buffer_append_str(buffer,
  1061. _qi_repr(state, tempstack, entry.value, true));
  1062. });
  1063. qi_buffer_append(buffer, '}');
  1064. if (qi_has_metatable(value))
  1065. qi_buffer_append(buffer, '>');
  1066. });
  1067. return qi_buffer_read(buffer);
  1068. case QI_FUNCTION:
  1069. snprintf(string, sizeof(string),
  1070. value->value.function.is_builtin ? "<built-in function %s>"
  1071. : "<function %s>",
  1072. value->value.function.name);
  1073. return qi_strdup(string);
  1074. case QI_DATA:
  1075. snprintf(string, sizeof(string), "<data %d>", value->value.data.tag);
  1076. return qi_strdup(string);
  1077. case QI_REFERENCE:
  1078. snprintf(string, sizeof(string), "<reference %s>", value->value.ref.name);
  1079. return qi_strdup(string);
  1080. default:
  1081. return qi_strdup("<unknown>");
  1082. }
  1083. }
  1084. static void __fprint_pthread_t(FILE *fd, pthread_t td)
  1085. {
  1086. unsigned char *ptr = (unsigned char *)(void *)&td;
  1087. fprintf(fd, "0x");
  1088. for (qi_size_t i = 0; i < sizeof(td); i++)
  1089. fprintf(fd, "%02x", (unsigned)(ptr[i]));
  1090. }
  1091. void qi_finalize(void) { GC_invoke_finalizers(); }
  1092. void qi_fatal(qi_state_t *state, char *format, ...)
  1093. {
  1094. va_list args;
  1095. va_start(args, format);
  1096. if (state->_debug_data)
  1097. fprintf(stderr, "%s:\n ", state->_debug_data);
  1098. if (!qi_thread_main())
  1099. {
  1100. fputs("Runtime error (thread ", stderr);
  1101. __fprint_pthread_t(stderr, pthread_self());
  1102. fputs("): ", stderr);
  1103. }
  1104. else
  1105. fputs("Runtime error: ", stderr);
  1106. vfprintf(stderr, format, args);
  1107. fputc('\n', stderr);
  1108. va_end(args);
  1109. if (qi_list_length(state->exceptions) > 1)
  1110. {
  1111. for (qi_ssize_t i = (qi_ssize_t)qi_list_length(state->exceptions) - 2; i >= 0; i--)
  1112. {
  1113. char *s = qi_list_data(state->exceptions, i);
  1114. fprintf(stderr, " While handling an exception: %s\n", s);
  1115. }
  1116. }
  1117. if (__debug_enabled && !qi_list_empty(state->calltrace))
  1118. {
  1119. fputs("Traceback (more recent call last):\n", stderr);
  1120. for (qi_size_t i = 0; i < qi_list_length(state->calltrace); i++)
  1121. {
  1122. qi_list_t *entry = qi_list_data(state->calltrace, i);
  1123. qi_value_t *func = qi_list_data(entry, 0);
  1124. const char *debug_data = qi_list_data(entry, 1);
  1125. if (debug_data)
  1126. fprintf(stderr, " %s, call to %s\n", debug_data,
  1127. func->value.function.name);
  1128. else
  1129. fprintf(stderr, " Call to %s\n", func->value.function.name);
  1130. }
  1131. }
  1132. if (!qi_thread_main())
  1133. pthread_exit(NULL);
  1134. else
  1135. {
  1136. qi_finalize();
  1137. exit(1);
  1138. }
  1139. }
  1140. static void __qi_unset_trap(qi_state_t *state)
  1141. {
  1142. qi_trap_t *trap = qi_list_pop(state->traps);
  1143. if (trap->finally)
  1144. trap->finally(state);
  1145. }
  1146. qi_trap_t *qi_set_trap(qi_state_t *state, qi_defer_t finally)
  1147. {
  1148. qi_trap_t *trap = qi_malloc(sizeof(qi_trap_t));
  1149. trap->value = NULL;
  1150. trap->finally = finally;
  1151. trap->scope = qi_list_last(state->scopes);
  1152. trap->scopes_count = qi_list_length(state->scopes);
  1153. trap->calltrace_size = qi_list_length(state->calltrace);
  1154. qi_list_push(state->traps, trap);
  1155. qi_add_local_defer(state, 0, __qi_unset_trap);
  1156. return trap;
  1157. }
  1158. void qi_unset_trap(qi_state_t *state, qi_trap_t *trap)
  1159. {
  1160. qi_list_delete(trap->scope->defers, 0);
  1161. qi_list_pop(state->traps);
  1162. if (trap->value)
  1163. {
  1164. for (size_t i = 0, k = qi_list_length(state->scopes) - trap->scopes_count;
  1165. i < k; i++)
  1166. qi_old_scope(state);
  1167. for (size_t i = 0,
  1168. k = qi_list_length(state->calltrace) - trap->calltrace_size;
  1169. i < k; i++)
  1170. qi_list_pop(state->calltrace);
  1171. }
  1172. }
  1173. void qi_throw(qi_state_t *state, qi_value_t *value)
  1174. {
  1175. if (qi_list_empty(state->traps))
  1176. {
  1177. char *s = value == state->recursionerror ? __recerror_msg : qi_repr(state, value, false);
  1178. qi_list_push(state->exceptions, s);
  1179. while (qi_old_scope(state))
  1180. ;
  1181. qi_fatal(state, "uncaught exception: %s", s);
  1182. }
  1183. qi_trap_t *trap = qi_list_last(state->traps);
  1184. trap->value = value;
  1185. longjmp(trap->label, 1);
  1186. }
  1187. void qi_throw_format(qi_state_t *state, char *format, ...)
  1188. {
  1189. char buffer[512];
  1190. va_list args;
  1191. va_start(args, format);
  1192. vsnprintf(buffer, sizeof(buffer), format, args);
  1193. va_end(args);
  1194. qi_throw(state, qi_make_string_copy(state, buffer));
  1195. }
  1196. void qi_throw_class(qi_state_t *state, qi_value_t *class, char *format, ...)
  1197. {
  1198. char buffer[512];
  1199. va_list args;
  1200. va_start(args, format);
  1201. vsnprintf(buffer, sizeof(buffer), format, args);
  1202. va_end(args);
  1203. qi_list_t *pargs = qi_list_make_n(1);
  1204. qi_list_data(pargs, 0) = qi_make_string_copy(state, buffer);
  1205. qi_throw(state, qi_call(state, class, pargs));
  1206. }
  1207. qi_value_t *qi_find(qi_state_t *state, char *name)
  1208. {
  1209. qi_ssize_t scopes_count = qi_list_length(state->scopes);
  1210. if (scopes_count > 0)
  1211. for (qi_ssize_t i = scopes_count - 1; i >= 0; i--)
  1212. {
  1213. qi_scope_t *scope = qi_list_index(state->scopes, i);
  1214. if (scope->is_barrier)
  1215. continue;
  1216. qi_mutex_lock(scope->mutex);
  1217. qi_symbol_t *symbol = qi_table_get(scope->scope, name);
  1218. if (symbol)
  1219. {
  1220. qi_value_t *value = symbol->value;
  1221. qi_mutex_unlock(scope->mutex);
  1222. return value;
  1223. }
  1224. qi_mutex_unlock(scope->mutex);
  1225. }
  1226. return NULL;
  1227. }
  1228. qi_value_t *qi_get(qi_state_t *state, char *name)
  1229. {
  1230. qi_value_t *value;
  1231. if (strcmp(name, "nil") == 0)
  1232. return state->nil;
  1233. else if (strcmp(name, "true") == 0)
  1234. return state->_true;
  1235. else if (strcmp(name, "false") == 0)
  1236. return state->_false;
  1237. else if (strcmp(name, "STDIN") == 0)
  1238. return state->_stdin;
  1239. else if (strcmp(name, "STDERR") == 0)
  1240. return state->_stderr;
  1241. else if (strcmp(name, "STDOUT") == 0)
  1242. return state->_stdout;
  1243. else if (strcmp(name, "NAN") == 0)
  1244. return state->nan;
  1245. else if (strcmp(name, "INFINITY") == 0)
  1246. return state->infinity;
  1247. value = qi_find(state, name);
  1248. if (!value)
  1249. qi_throw_class(state, state->nameerror, "%s", name);
  1250. return value;
  1251. }
  1252. static void _qi_decl(qi_state_t *state, char *name, qi_value_t *value,
  1253. qi_bool is_constant)
  1254. {
  1255. qi_scope_t *scope = qi_list_last(state->scopes);
  1256. qi_symbol_t *symbol;
  1257. qi_mutex_lock(scope->mutex);
  1258. symbol = qi_table_get(scope->scope, name);
  1259. if (symbol)
  1260. {
  1261. if (is_constant || symbol->is_constant)
  1262. {
  1263. qi_mutex_unlock(scope->mutex);
  1264. qi_typeerror(state, "redeclaration of constant symbol: '%s'", name);
  1265. }
  1266. symbol->value = value;
  1267. }
  1268. else
  1269. {
  1270. symbol = qi_malloc(sizeof(qi_symbol_t));
  1271. symbol->value = value;
  1272. symbol->is_constant = is_constant;
  1273. qi_table_set(scope->scope, name, symbol);
  1274. }
  1275. qi_mutex_unlock(scope->mutex);
  1276. }
  1277. void qi_decl_const(qi_state_t *state, char *name, qi_value_t *value)
  1278. {
  1279. _qi_decl(state, name, value, true);
  1280. }
  1281. void qi_decl(qi_state_t *state, char *name, qi_value_t *value)
  1282. {
  1283. _qi_decl(state, name, value, false);
  1284. }
  1285. qi_value_t *qi_decl_expr(qi_state_t *state, char *name, qi_value_t *value)
  1286. {
  1287. _qi_decl(state, name, value, false);
  1288. return value;
  1289. }
  1290. qi_value_t *_qi_set(qi_state_t *state, qi_bool is_pf, qi_bool is_constant,
  1291. char *name, qi_value_t *value)
  1292. {
  1293. qi_ssize_t scopes_count = qi_list_length(state->scopes);
  1294. if (scopes_count > 1)
  1295. for (qi_ssize_t i = scopes_count - 1; i >= 0; i--)
  1296. {
  1297. qi_scope_t *scope = qi_list_index(state->scopes, i);
  1298. if (scope->is_barrier)
  1299. continue;
  1300. qi_mutex_lock(scope->mutex);
  1301. qi_symbol_t *symbol = qi_table_get(scope->scope, name);
  1302. if (symbol)
  1303. {
  1304. if (is_constant || symbol->is_constant)
  1305. {
  1306. qi_mutex_unlock(scope->mutex);
  1307. qi_typeerror(state, "redeclaration of constant symbol: '%s'",
  1308. name);
  1309. }
  1310. qi_value_t *old = symbol->value;
  1311. symbol->value = value;
  1312. qi_mutex_unlock(scope->mutex);
  1313. return !is_pf ? old : value;
  1314. }
  1315. qi_mutex_unlock(scope->mutex);
  1316. }
  1317. qi_symbol_t *symbol = NULL;
  1318. qi_scope_t *scope = qi_list_last(state->scopes);
  1319. qi_mutex_lock(scope->mutex);
  1320. symbol = qi_table_get(scope->scope, name);
  1321. if (symbol)
  1322. {
  1323. if (is_constant || symbol->is_constant)
  1324. {
  1325. qi_mutex_unlock(scope->mutex);
  1326. qi_typeerror(state, "redeclaration of constant symbol: '%s'", name);
  1327. }
  1328. qi_value_t *old = symbol->value;
  1329. symbol->value = value;
  1330. qi_mutex_unlock(scope->mutex);
  1331. return !is_pf ? old : value;
  1332. }
  1333. symbol = qi_malloc(sizeof(qi_symbol_t));
  1334. symbol->value = value;
  1335. symbol->is_constant = is_constant;
  1336. qi_table_set(scope->scope, name, symbol);
  1337. qi_mutex_unlock(scope->mutex);
  1338. return value;
  1339. }
  1340. qi_value_t *qi_deref(qi_state_t *state, qi_value_t *value)
  1341. {
  1342. qi_value_t *meta;
  1343. qi_bool fail = false;
  1344. if ((meta = qi_call_meta(state, &fail, value, "__deref", 1, value)))
  1345. return meta;
  1346. if (fail)
  1347. goto leave;
  1348. if (value->type == QI_REFERENCE)
  1349. {
  1350. qi_mutex_lock(value->value.ref.scope->mutex);
  1351. qi_symbol_t *symbol =
  1352. qi_table_get(value->value.ref.scope->scope, value->value.ref.name);
  1353. if (!symbol)
  1354. {
  1355. qi_mutex_unlock(value->value.ref.scope->mutex);
  1356. qi_throw_class(state, state->nameerror, "%s",
  1357. value->value.ref.name);
  1358. }
  1359. qi_value_t *r = symbol->value;
  1360. qi_mutex_unlock(value->value.ref.scope->mutex);
  1361. return r;
  1362. }
  1363. leave:
  1364. qi_typeerror(state, "cannot dereference %s", _qi_type(state, value));
  1365. return 0;
  1366. }
  1367. qi_value_t *qi_set_ref(qi_state_t *state, qi_bool is_pf, qi_value_t *ref,
  1368. qi_value_t *value)
  1369. {
  1370. qi_value_t *meta;
  1371. qi_bool fail = false;
  1372. if ((meta = qi_call_meta(state, &fail, ref, "__set_ref", 2, ref, value)))
  1373. return meta;
  1374. if (fail)
  1375. goto leave;
  1376. if (ref->type == QI_REFERENCE)
  1377. {
  1378. qi_mutex_lock(ref->value.ref.scope->mutex);
  1379. qi_symbol_t *symbol =
  1380. qi_table_get(ref->value.ref.scope->scope, ref->value.ref.name);
  1381. if (symbol)
  1382. {
  1383. if (symbol->is_constant)
  1384. {
  1385. qi_mutex_unlock(ref->value.ref.scope->mutex);
  1386. qi_typeerror(state,
  1387. "redeclaration of constant symbol (by reference): '%s'",
  1388. ref->value.ref.name);
  1389. }
  1390. qi_value_t *old = symbol->value;
  1391. symbol->value = value;
  1392. qi_mutex_unlock(ref->value.ref.scope->mutex);
  1393. return !is_pf ? old : value;
  1394. }
  1395. symbol = qi_malloc(sizeof(qi_symbol_t));
  1396. symbol->value = value;
  1397. qi_table_set(ref->value.ref.scope->scope, ref->value.ref.name, symbol);
  1398. qi_mutex_unlock(ref->value.ref.scope->mutex);
  1399. }
  1400. leave:
  1401. qi_typeerror(state, "cannot set %s by reference", _qi_type(state, ref));
  1402. return 0;
  1403. }
  1404. size_t _qi_length(qi_state_t *state, qi_value_t *value)
  1405. {
  1406. qi_value_t *meta;
  1407. qi_bool fail = false;
  1408. if ((meta = qi_call_meta(state, &fail, value, "__len", 1, value)))
  1409. {
  1410. if (meta->type != QI_NUMBER)
  1411. qi_typeerror(state, "__len returned non-number value (%s)",
  1412. _qi_type(state, meta));
  1413. return meta->value.number;
  1414. }
  1415. if (fail)
  1416. goto leave;
  1417. if (value == state->empty_string || value == state->empty_bytes ||
  1418. value == state->empty_tuple)
  1419. return 0;
  1420. switch (value->type)
  1421. {
  1422. case QI_STRING:
  1423. return strlen(value->value.string);
  1424. case QI_BYTES:
  1425. return value->value.bytes->size;
  1426. case QI_LIST:
  1427. {
  1428. qi_size_t length = 0;
  1429. LOCKED(value, { length = qi_list_length(value->value.list); });
  1430. return length;
  1431. }
  1432. case QI_TUPLE:
  1433. return qi_list_length(value->value.list);
  1434. case QI_TABLE:
  1435. {
  1436. qi_size_t length = 0;
  1437. LOCKED(value, { length = qi_table_length(value->value.table.table); });
  1438. return length;
  1439. }
  1440. default:
  1441. break;
  1442. }
  1443. leave:
  1444. qi_typeerror(state, "cannot get length of %s", _qi_type(state, value));
  1445. return 0;
  1446. }
  1447. qi_value_t *qi_del(qi_state_t *state, qi_value_t *value, qi_value_t *index)
  1448. {
  1449. qi_value_t *meta;
  1450. qi_bool fail = false;
  1451. if (index == NULL)
  1452. {
  1453. if ((meta = qi_call_meta(state, &fail, value, "__delval", 1, value)))
  1454. return meta;
  1455. }
  1456. else if ((meta = qi_call_meta(state, &fail, value, "__del", 2, value, index)))
  1457. return meta;
  1458. if (fail)
  1459. goto leave;
  1460. switch (value->type)
  1461. {
  1462. case QI_LIST:
  1463. if (index == NULL)
  1464. {
  1465. LOCKED(value, {
  1466. value->value.list = qi_list_resize(value->value.list, 0);
  1467. });
  1468. return value;
  1469. }
  1470. else if (index->type == QI_NUMBER)
  1471. {
  1472. qi_bool res;
  1473. LOCKED(value,
  1474. { res = qi_list_delete(value->value.list, index->value.number); });
  1475. if (!res)
  1476. qi_throw_class(state, state->indexerror, "%s",
  1477. qi_repr(state, index, true));
  1478. return value;
  1479. }
  1480. break;
  1481. case QI_TABLE:
  1482. if (index == NULL)
  1483. {
  1484. LOCKED(value, {
  1485. qi_free(value->value.table.table->entries);
  1486. value->value.table.table->used = 0;
  1487. value->value.table.table->capacity = QI_TABLE_MIN_CAP;
  1488. value->value.table.table->entries = qi_calloc(value->value.table.table->capacity, sizeof(qi_table_entry_t));
  1489. });
  1490. return value;
  1491. }
  1492. else if (index->type == QI_STRING)
  1493. {
  1494. qi_bool res;
  1495. LOCKED(value, {
  1496. res = qi_table_delete(value->value.table.table, index->value.string);
  1497. });
  1498. if (!res)
  1499. qi_throw_class(state, state->keyerror, "%s", qi_repr(state, index, true));
  1500. return value;
  1501. }
  1502. break;
  1503. default:
  1504. break;
  1505. }
  1506. leave:
  1507. if (index == NULL)
  1508. qi_typeerror(state, "cannot delete-value %s", _qi_type(state, value));
  1509. else
  1510. qi_typeerror(state, "cannot delete index %s with %s",
  1511. _qi_type(state, value), _qi_type(state, index));
  1512. return NULL;
  1513. }
  1514. qi_bool _qi_truthy(qi_state_t *state, qi_value_t *value)
  1515. {
  1516. qi_value_t *meta;
  1517. if ((meta = qi_call_meta(state, NULL, value, "__bool", 1, value)))
  1518. {
  1519. if (meta->type != QI_BOOLEAN)
  1520. qi_typeerror(state, "__bool returned non-boolean value (%s)",
  1521. _qi_type(state, meta));
  1522. return meta->value.boolean;
  1523. }
  1524. switch (value->type)
  1525. {
  1526. case QI_NULL:
  1527. return false;
  1528. case QI_BOOLEAN:
  1529. return value->value.boolean;
  1530. case QI_NUMBER:
  1531. return value->value.number != 0;
  1532. case QI_TABLE:
  1533. {
  1534. qi_bool res = false;
  1535. LOCKED(value, {
  1536. res = qi_has_metatable(value) &&
  1537. qi_table_length(qi_get_metatable(value)) != 0;
  1538. });
  1539. if (res)
  1540. return true;
  1541. }
  1542. case QI_STRING:
  1543. case QI_BYTES:
  1544. case QI_LIST:
  1545. case QI_TUPLE:
  1546. return _qi_length(state, value) != 0;
  1547. default:
  1548. return true;
  1549. }
  1550. return true;
  1551. }
  1552. qi_value_t *qi_cast(qi_state_t *state, qi_type_t type, qi_value_t *value)
  1553. {
  1554. if (value->type == type)
  1555. return value;
  1556. qi_bool fail = false;
  1557. switch (type)
  1558. {
  1559. case QI_BOOLEAN:
  1560. return qi_truthy(state, value);
  1561. case QI_NUMBER:
  1562. {
  1563. qi_value_t *meta;
  1564. if ((meta = qi_call_meta(state, &fail, value, "__num", 1, value)))
  1565. {
  1566. if (meta->type != QI_NUMBER)
  1567. qi_typeerror(state, "__num returned non-number value (%s)",
  1568. _qi_type(state, meta));
  1569. return meta;
  1570. }
  1571. if (fail)
  1572. goto leave;
  1573. switch (value->type)
  1574. {
  1575. case QI_NULL:
  1576. return state->zero;
  1577. case QI_BOOLEAN:
  1578. return qi_make_number(state, value->value.boolean);
  1579. case QI_STRING:
  1580. return qi_make_number(state, strtod(value->value.string, NULL));
  1581. default:
  1582. break;
  1583. }
  1584. }
  1585. break;
  1586. case QI_STRING:
  1587. if (value->type == QI_BYTES)
  1588. {
  1589. qi_buffer_t *buffer = qi_buffer_make();
  1590. for (qi_size_t i = 0;
  1591. i < value->value.bytes->size && value->value.bytes->data[i]; i++)
  1592. qi_buffer_append(buffer, value->value.bytes->data[i]);
  1593. return qi_make_string(state, qi_buffer_read(buffer));
  1594. }
  1595. return qi_make_string(state, qi_repr(state, value, false));
  1596. case QI_BYTES:
  1597. {
  1598. qi_value_t *meta;
  1599. if ((meta = qi_call_meta(state, &fail, value, "__bytes", 1, value)))
  1600. {
  1601. if (meta->type != QI_BYTES)
  1602. qi_typeerror(state, "__bytes returned non-bytes value (%s)",
  1603. _qi_type(state, meta));
  1604. return meta;
  1605. }
  1606. if (fail)
  1607. goto leave;
  1608. switch (value->type)
  1609. {
  1610. case QI_STRING:
  1611. return qi_make_bytes(state, (unsigned char *)(value->value.string),
  1612. strlen(value->value.string));
  1613. case QI_LIST:
  1614. {
  1615. qi_size_t length;
  1616. unsigned char *temp;
  1617. LOCKED(value, {
  1618. qi_list_t *list = value->value.list;
  1619. length = qi_list_length(list);
  1620. temp = qi_malloc(length);
  1621. if (!qi_list_empty(list))
  1622. for (qi_size_t i = 0; i < length; i++)
  1623. {
  1624. qi_value_t *byte = qi_list_data(list, i);
  1625. if (byte->type != QI_NUMBER)
  1626. {
  1627. qi_mutex_unlock(value->mutex);
  1628. qi_typeerror(state,
  1629. "cannot cast %s to %s (expected list of numbers, "
  1630. "but element #%zu is %s)",
  1631. _qi_type(state, value), qi_repr_type(type), i,
  1632. _qi_type(state, byte));
  1633. }
  1634. temp[i] = (unsigned char)(byte->value.number);
  1635. }
  1636. });
  1637. return qi_make_bytes(state, temp, length);
  1638. }
  1639. default:
  1640. break;
  1641. }
  1642. }
  1643. break;
  1644. case QI_LIST:
  1645. {
  1646. qi_value_t *meta;
  1647. if ((meta = qi_call_meta(state, &fail, value, "__list", 1, value)))
  1648. {
  1649. if (meta->type != QI_LIST)
  1650. qi_typeerror(state, "__list returned non-list value (%s)",
  1651. _qi_type(state, meta));
  1652. return meta;
  1653. }
  1654. if (fail)
  1655. goto leave;
  1656. switch (value->type)
  1657. {
  1658. case QI_STRING:
  1659. {
  1660. qi_size_t length = strlen(value->value.string);
  1661. qi_list_t *list = qi_list_make_n(length);
  1662. for (qi_size_t i = 0; i < length; i++)
  1663. qi_list_data(list, i) = qi_make_char(state, value->value.string[i]);
  1664. return qi_make_list(state, list);
  1665. }
  1666. case QI_BYTES:
  1667. {
  1668. qi_list_t *list = qi_list_make_n(value->value.bytes->size);
  1669. for (qi_size_t i = 0; i < value->value.bytes->size; i++)
  1670. qi_list_data(list, i) =
  1671. qi_make_number(state, value->value.bytes->data[i]);
  1672. return qi_make_list(state, list);
  1673. }
  1674. case QI_TABLE:
  1675. {
  1676. qi_list_t *keys;
  1677. LOCKED(value, { keys = qi_table_keys(value->value.table.table); });
  1678. for (qi_size_t i = 0; i < qi_list_length(keys); i++)
  1679. qi_list_data(keys, i) = qi_make_string(state, qi_list_data(keys, i));
  1680. return qi_make_list(state, keys);
  1681. }
  1682. case QI_TUPLE:
  1683. return qi_make_list(state, qi_list_copy(value->value.list));
  1684. default:
  1685. break;
  1686. }
  1687. }
  1688. break;
  1689. case QI_TABLE:
  1690. {
  1691. qi_value_t *meta;
  1692. if ((meta = qi_call_meta(state, &fail, value, "__table", 1, value)))
  1693. {
  1694. if (meta->type != QI_TABLE)
  1695. qi_typeerror(state, "__table returned non-table value (%s)",
  1696. _qi_type(state, meta));
  1697. return meta;
  1698. }
  1699. if (fail)
  1700. goto leave;
  1701. switch (value->type)
  1702. {
  1703. case QI_LIST:
  1704. case QI_TUPLE:
  1705. {
  1706. qi_table_t *table = qi_table_make();
  1707. if (value->type == QI_LIST)
  1708. qi_mutex_lock(value->mutex);
  1709. qi_list_t *list = value->value.list;
  1710. if (!qi_list_empty(list))
  1711. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  1712. {
  1713. qi_value_t *pair = qi_list_data(list, i);
  1714. if (pair->type == QI_LIST)
  1715. qi_mutex_lock(pair->mutex);
  1716. if ((pair->type != QI_LIST && pair->type != QI_TUPLE) ||
  1717. qi_list_length(pair->value.list) != 2)
  1718. {
  1719. if (value->type == QI_LIST)
  1720. qi_mutex_unlock(value->mutex);
  1721. if (pair->type == QI_LIST)
  1722. qi_mutex_unlock(pair->mutex);
  1723. qi_typeerror(state,
  1724. "cannot cast %s to %s (expected sequence of pairs)",
  1725. _qi_type(state, value), qi_repr_type(type));
  1726. }
  1727. qi_value_t *left = qi_list_data(pair->value.list, 0);
  1728. if (left->type != QI_STRING)
  1729. {
  1730. if (value->type == QI_LIST)
  1731. qi_mutex_unlock(value->mutex);
  1732. if (pair->type == QI_LIST)
  1733. qi_mutex_unlock(pair->mutex);
  1734. qi_typeerror(state,
  1735. "cannot cast %s to %s (expected first element of "
  1736. "pair to be a string)",
  1737. _qi_type(state, value), qi_repr_type(type));
  1738. }
  1739. qi_value_t *right = qi_list_data(pair->value.list, 1);
  1740. if (pair->type == QI_LIST)
  1741. qi_mutex_unlock(pair->mutex);
  1742. qi_table_set(table, left->value.string, right);
  1743. }
  1744. if (value->type == QI_LIST)
  1745. qi_mutex_unlock(value->mutex);
  1746. return qi_make_table(state, table);
  1747. }
  1748. default:
  1749. break;
  1750. }
  1751. }
  1752. break;
  1753. case QI_TUPLE:
  1754. {
  1755. qi_value_t *meta;
  1756. if ((meta = qi_call_meta(state, &fail, value, "__tuple", 1, value)))
  1757. {
  1758. if (meta->type != QI_TUPLE)
  1759. qi_typeerror(state, "__tuple returned non-tuple value (%s)",
  1760. _qi_type(state, meta));
  1761. return meta;
  1762. }
  1763. if (fail)
  1764. goto leave;
  1765. switch (value->type)
  1766. {
  1767. case QI_LIST:
  1768. {
  1769. qi_list_t *list;
  1770. LOCKED(value, { list = qi_list_copy(value->value.list); });
  1771. return qi_make_tuple(state, list);
  1772. }
  1773. case QI_BYTES:
  1774. {
  1775. qi_list_t *list = qi_list_make_n(value->value.bytes->size);
  1776. for (qi_size_t i = 0; i < value->value.bytes->size; i++)
  1777. qi_list_data(list, i) =
  1778. qi_make_number(state, value->value.bytes->data[i]);
  1779. return qi_make_tuple(state, list);
  1780. }
  1781. case QI_STRING:
  1782. {
  1783. qi_size_t length = strlen(value->value.string);
  1784. qi_list_t *list = qi_list_make_n(length);
  1785. for (qi_size_t i = 0; i < length; i++)
  1786. qi_list_data(list, i) = qi_make_char(state, value->value.string[i]);
  1787. return qi_make_tuple(state, list);
  1788. }
  1789. default:
  1790. break;
  1791. }
  1792. }
  1793. case QI_REFERENCE:
  1794. {
  1795. qi_value_t *meta;
  1796. if ((meta = qi_call_meta(state, &fail, value, "__ref", 1, value)))
  1797. {
  1798. if (meta->type != QI_REFERENCE)
  1799. qi_typeerror(state, "__ref returned non-reference value (%s)",
  1800. _qi_type(state, meta));
  1801. return meta;
  1802. }
  1803. if (fail)
  1804. goto leave;
  1805. switch (value->type)
  1806. {
  1807. case QI_STRING:
  1808. return qi_make_ref(state, value->value.string);
  1809. default:
  1810. break;
  1811. }
  1812. }
  1813. break;
  1814. default:
  1815. break;
  1816. }
  1817. leave:
  1818. qi_typeerror(state, "cannot cast %s to %s", _qi_type(state, value),
  1819. qi_repr_type(type));
  1820. return NULL;
  1821. }
  1822. qi_bool qi_is_iter(qi_state_t *state, qi_value_t *value)
  1823. {
  1824. return qi_get_method(state, value, "__begin") != NULL &&
  1825. qi_get_method(state, value, "__next") != NULL &&
  1826. qi_get_method(state, value, "__end") != NULL;
  1827. }
  1828. qi_value_t *qi_iter(qi_state_t *state, qi_value_t *value)
  1829. {
  1830. if (qi_is_iter(state, value))
  1831. return qi_iter_begin(state, value);
  1832. qi_value_t *meta;
  1833. qi_bool fail = false;
  1834. if ((meta = qi_call_meta(state, &fail, value, "__iter", 1, value)))
  1835. {
  1836. if (!qi_is_iter(state, meta))
  1837. qi_typeerror(state, "__iter returned not an iterator (%s)",
  1838. _qi_type(state, meta));
  1839. return meta;
  1840. }
  1841. if (fail)
  1842. goto leave;
  1843. if (value->type == QI_LIST || value->type == QI_TUPLE ||
  1844. value->type == QI_BYTES || value->type == QI_TABLE || value->type == QI_STRING)
  1845. {
  1846. qi_list_t *pargs = qi_list_make_n(1);
  1847. qi_list_data(pargs, 0) = value;
  1848. return qi_call(state, state->listiterator, pargs);
  1849. }
  1850. leave:
  1851. qi_typeerror(state, "cannot iterate %s", _qi_type(state, value));
  1852. return NULL;
  1853. }
  1854. qi_value_t *qi_index(qi_state_t *state, qi_value_t *value, qi_value_t *index)
  1855. {
  1856. qi_value_t *meta;
  1857. qi_bool fail = false;
  1858. if (index->type == QI_STRING &&
  1859. (meta = qi_get_method(state, value, index->value.string)))
  1860. {
  1861. if (meta->type == QI_FUNCTION && !meta->value.function.is_builtin)
  1862. {
  1863. qi_value_t *newmeta = qi_make_function(
  1864. state,
  1865. meta->value.function.is_pm ? meta->value.function.name
  1866. : index->value.string,
  1867. meta->value.function.pargc, meta->value.function.handle,
  1868. meta->value.function.captured);
  1869. if (!is_meta_name(index))
  1870. newmeta->value.function._this = value;
  1871. return newmeta;
  1872. }
  1873. return meta;
  1874. }
  1875. else if ((meta = qi_call_meta(state, &fail, value, "__index", 2, value,
  1876. index)))
  1877. return meta;
  1878. if (fail)
  1879. goto leave;
  1880. switch (value->type)
  1881. {
  1882. case QI_STRING:
  1883. if (index->type == QI_NUMBER)
  1884. {
  1885. qi_size_t length = strlen(value->value.string);
  1886. qi_ssize_t i = (qi_ssize_t)(index->value.number);
  1887. if (i < 0)
  1888. i += (qi_ssize_t)length;
  1889. if (i < 0 || i >= (qi_ssize_t)length)
  1890. qi_throw_class(state, state->indexerror, "%s",
  1891. qi_repr(state, index, true));
  1892. return qi_make_char(state, value->value.string[i]);
  1893. }
  1894. break;
  1895. case QI_BYTES:
  1896. if (index->type == QI_NUMBER)
  1897. {
  1898. qi_size_t length = value->value.bytes->size;
  1899. qi_ssize_t i = (qi_ssize_t)(index->value.number);
  1900. if (i < 0)
  1901. i += (qi_ssize_t)length;
  1902. if (i < 0 || i >= (qi_ssize_t)length)
  1903. qi_throw_class(state, state->indexerror, "%s",
  1904. qi_repr(state, index, true));
  1905. return qi_make_number(state, value->value.bytes->data[i]);
  1906. }
  1907. break;
  1908. case QI_LIST:
  1909. if (index->type == QI_NUMBER)
  1910. {
  1911. qi_value_t *indexed;
  1912. LOCKED(value, {
  1913. indexed =
  1914. qi_list_index(value->value.list, (qi_ssize_t)(index->value.number));
  1915. });
  1916. if (!indexed)
  1917. qi_throw_class(state, state->indexerror, "%s",
  1918. qi_repr(state, index, true));
  1919. return indexed;
  1920. }
  1921. break;
  1922. case QI_TUPLE:
  1923. if (index->type == QI_NUMBER)
  1924. {
  1925. qi_value_t *indexed =
  1926. qi_list_index(value->value.list, (qi_ssize_t)(index->value.number));
  1927. if (!indexed)
  1928. qi_throw_class(state, state->indexerror, "%s",
  1929. qi_repr(state, index, true));
  1930. return indexed;
  1931. }
  1932. break;
  1933. case QI_TABLE:
  1934. if (index->type == QI_STRING)
  1935. {
  1936. qi_value_t *indexed;
  1937. LOCKED(value, {
  1938. indexed = qi_table_get(value->value.table.table, index->value.string);
  1939. });
  1940. if (!indexed)
  1941. qi_throw_class(state, state->keyerror, "%s", qi_repr(state, index, true));
  1942. return indexed;
  1943. }
  1944. break;
  1945. default:
  1946. break;
  1947. }
  1948. leave:
  1949. qi_typeerror(state, "cannot index %s with %s", _qi_type(state, value),
  1950. _qi_type(state, index));
  1951. return NULL;
  1952. }
  1953. qi_value_t *qi_index_set(qi_state_t *state, qi_bool is_pf, qi_value_t *value,
  1954. qi_value_t *index, qi_value_t *newvalue)
  1955. {
  1956. qi_value_t *meta;
  1957. qi_bool fail = false;
  1958. if (value->type == QI_TABLE && index->type == QI_STRING)
  1959. {
  1960. qi_bool has_mt = false;
  1961. LOCKED(value, {
  1962. has_mt = qi_has_metatable(value) &&
  1963. qi_table_has(qi_get_metatable(value), index->value.string);
  1964. });
  1965. if (has_mt)
  1966. {
  1967. qi_value_t *old;
  1968. LOCKED(value, {
  1969. if (!is_pf)
  1970. old = qi_table_get(qi_get_metatable(value), index->value.string);
  1971. qi_table_set(qi_get_metatable(value), index->value.string, newvalue);
  1972. });
  1973. return !is_pf && old ? old : newvalue;
  1974. }
  1975. }
  1976. if ((meta = qi_call_meta(state, &fail, value, "__index_set", 3, value, index,
  1977. newvalue)))
  1978. return meta;
  1979. if (fail)
  1980. goto leave;
  1981. switch (value->type)
  1982. {
  1983. case QI_LIST:
  1984. if (index->type == QI_NUMBER)
  1985. {
  1986. qi_value_t *old;
  1987. LOCKED(value, {
  1988. if (!is_pf)
  1989. old = qi_list_index(value->value.list,
  1990. (qi_ssize_t)(index->value.number));
  1991. qi_list_set(value->value.list, (qi_ssize_t)(index->value.number),
  1992. newvalue);
  1993. });
  1994. if (!newvalue)
  1995. qi_throw_class(state, state->indexerror, "%s",
  1996. qi_repr(state, index, true));
  1997. return !is_pf && old ? old : newvalue;
  1998. }
  1999. break;
  2000. case QI_TABLE:
  2001. if (index->type == QI_STRING)
  2002. {
  2003. qi_value_t *old;
  2004. LOCKED(value, {
  2005. if (!is_pf)
  2006. old = qi_table_get(value->value.table.table, index->value.string);
  2007. qi_table_set(value->value.table.table, index->value.string, newvalue);
  2008. });
  2009. return !is_pf && old ? old : newvalue;
  2010. }
  2011. break;
  2012. default:
  2013. break;
  2014. }
  2015. leave:
  2016. qi_typeerror(state, "cannot set index %s with %s", _qi_type(state, value),
  2017. _qi_type(state, index));
  2018. return NULL;
  2019. }
  2020. static qi_value_t *_qi_call(qi_state_t *state, qi_value_t *value,
  2021. qi_list_t *pargs, const char *debug_data)
  2022. {
  2023. if (qi_list_length(state->calltrace) >= state->rlimit)
  2024. qi_throw(state, state->recursionerror);
  2025. if (value->type != QI_FUNCTION)
  2026. {
  2027. qi_value_t *meta;
  2028. if ((meta =
  2029. qi_call_meta(state, NULL, value, "__call", 2, value,
  2030. qi_make_list(state, pargs ? pargs : qi_list_make()))))
  2031. return meta;
  2032. qi_typeerror(state, "cannot call %s", _qi_type(state, value));
  2033. }
  2034. if (value->value.function._this)
  2035. {
  2036. qi_list_t *temp = !pargs ? qi_list_make() : qi_list_copy(pargs);
  2037. qi_list_insert(temp, 0, value->value.function._this);
  2038. pargs = temp;
  2039. }
  2040. qi_size_t pargc = !pargs ? 0 : qi_list_length(pargs);
  2041. if (pargc < value->value.function.pargc)
  2042. qi_typeerror(state,
  2043. "not enough positional arguments in call to '%s': need at "
  2044. "least %zu, got %zu",
  2045. value->value.function.name, value->value.function.pargc,
  2046. pargc);
  2047. qi_push_trace(state, value, debug_data);
  2048. if (!value->value.function.is_builtin)
  2049. {
  2050. qi_new_sticky_scope(state);
  2051. qi_decl_const(state, "it", value);
  2052. qi_decl(state, "arguments",
  2053. qi_make_list(state, pargs ? pargs : qi_list_make()));
  2054. if (value->value.function.captured)
  2055. {
  2056. qi_table_iterate(value->value.function.captured,
  2057. { qi_decl(state, entry.key, entry.value); });
  2058. }
  2059. }
  2060. qi_value_t *result = value->value.function.handle(state, pargc, pargs);
  2061. if (!value->value.function.is_builtin)
  2062. qi_old_scope(state);
  2063. qi_pop_trace(state);
  2064. return result;
  2065. }
  2066. qi_value_t *qi_call(qi_state_t *state, qi_value_t *value, qi_list_t *pargs)
  2067. {
  2068. return _qi_call(state, value, pargs, NULL);
  2069. }
  2070. qi_value_t *qi_call_debug(qi_state_t *state, qi_value_t *value,
  2071. qi_list_t *pargs, const char *debug_data)
  2072. {
  2073. return _qi_call(state, value, pargs, debug_data);
  2074. }
  2075. static qi_bool _qi_guarded_equals(qi_state_t *state, qi_size_t depth,
  2076. qi_list_t *tempstack, qi_value_t *a,
  2077. qi_value_t *b)
  2078. {
  2079. qi_value_t *meta;
  2080. if ((meta = qi_call_meta(state, NULL, a, "__equals", 2, a, b)))
  2081. {
  2082. if (meta->type != QI_BOOLEAN)
  2083. qi_typeerror(state, "__equals returned non-boolean value (%s)",
  2084. _qi_type(state, meta));
  2085. return meta->value.boolean;
  2086. }
  2087. else if ((meta = qi_call_meta(state, NULL, b, "__equals", 2, b, a)))
  2088. {
  2089. if (meta->type != QI_BOOLEAN)
  2090. qi_typeerror(state, "__equals returned non-boolean value (%s)",
  2091. _qi_type(state, meta));
  2092. return meta->value.boolean;
  2093. }
  2094. if (depth >= state->rlimit)
  2095. qi_throw(state, state->recursionerror);
  2096. if (a == b)
  2097. return true;
  2098. if (a->type != b->type)
  2099. return false;
  2100. switch (a->type)
  2101. {
  2102. case QI_NULL:
  2103. return true;
  2104. case QI_BOOLEAN:
  2105. return a->value.boolean == b->value.boolean;
  2106. case QI_NUMBER:
  2107. if (isnan(a->value.number) && isnan(b->value.number))
  2108. return true;
  2109. return a->value.number == b->value.number;
  2110. case QI_STRING:
  2111. return strcmp(a->value.string, b->value.string) == 0;
  2112. case QI_BYTES:
  2113. if (a->value.bytes->size != b->value.bytes->size)
  2114. return false;
  2115. return memcmp(a->value.bytes->data, b->value.bytes->data,
  2116. a->value.bytes->size) == 0;
  2117. case QI_FILE:
  2118. return fileno(a->value.file.fd) == fileno(b->value.file.fd);
  2119. case QI_LIST:
  2120. if (qi_list_contains(tempstack, a) || qi_list_contains(tempstack, b))
  2121. return true;
  2122. qi_list_push(tempstack, a);
  2123. qi_list_push(tempstack, b);
  2124. if (a->value.list == b->value.list)
  2125. return true;
  2126. qi_mutex_lock(a->mutex);
  2127. qi_mutex_lock(b->mutex);
  2128. if (qi_list_length(a->value.list) != qi_list_length(b->value.list))
  2129. {
  2130. qi_mutex_unlock(a->mutex);
  2131. qi_mutex_unlock(b->mutex);
  2132. return false;
  2133. }
  2134. for (qi_size_t i = 0; i < qi_list_length(a->value.list); i++)
  2135. if (!_qi_guarded_equals(state, depth + 1, tempstack,
  2136. qi_list_index(a->value.list, i),
  2137. qi_list_index(b->value.list, i)))
  2138. {
  2139. qi_mutex_unlock(a->mutex);
  2140. qi_mutex_unlock(b->mutex);
  2141. return false;
  2142. }
  2143. qi_mutex_unlock(a->mutex);
  2144. qi_mutex_unlock(b->mutex);
  2145. return true;
  2146. case QI_TUPLE:
  2147. if (a->value.list == b->value.list)
  2148. return true;
  2149. if (qi_list_length(a->value.list) != qi_list_length(b->value.list))
  2150. return false;
  2151. for (qi_size_t i = 0; i < qi_list_length(a->value.list); i++)
  2152. if (!_qi_guarded_equals(state, depth + 1, tempstack,
  2153. qi_list_index(a->value.list, i),
  2154. qi_list_index(b->value.list, i)))
  2155. return false;
  2156. return true;
  2157. case QI_TABLE:
  2158. if (qi_list_contains(tempstack, a) || qi_list_contains(tempstack, b))
  2159. return true;
  2160. qi_list_push(tempstack, a);
  2161. qi_list_push(tempstack, b);
  2162. if (a->value.table.table == b->value.table.table)
  2163. return true;
  2164. qi_mutex_lock(a->mutex);
  2165. qi_mutex_lock(b->mutex);
  2166. if (qi_table_length(a->value.table.table) !=
  2167. qi_table_length(b->value.table.table))
  2168. {
  2169. qi_mutex_unlock(a->mutex);
  2170. qi_mutex_unlock(b->mutex);
  2171. return false;
  2172. }
  2173. qi_table_iterate(a->value.table.table, {
  2174. qi_value_t *a_value = entry.value;
  2175. qi_value_t *b_value = qi_table_get(b->value.table.table, entry.key);
  2176. if (!b_value)
  2177. {
  2178. qi_mutex_unlock(a->mutex);
  2179. qi_mutex_unlock(b->mutex);
  2180. return false;
  2181. }
  2182. if (!_qi_guarded_equals(state, depth + 1, tempstack, a_value, b_value))
  2183. {
  2184. qi_mutex_unlock(a->mutex);
  2185. qi_mutex_unlock(b->mutex);
  2186. return false;
  2187. }
  2188. });
  2189. qi_mutex_unlock(a->mutex);
  2190. qi_mutex_unlock(b->mutex);
  2191. return true;
  2192. case QI_FUNCTION:
  2193. return strcmp(a->value.function.name, b->value.function.name) == 0 &&
  2194. a->value.function.handle == b->value.function.handle;
  2195. case QI_DATA:
  2196. return a->value.data.tag == b->value.data.tag &&
  2197. a->value.data.data == b->value.data.data;
  2198. case QI_REFERENCE:
  2199. return strcmp(a->value.ref.name, b->value.ref.name) == 0 &&
  2200. a->value.ref.scope == b->value.ref.scope;
  2201. default:
  2202. return true;
  2203. }
  2204. return true;
  2205. }
  2206. qi_bool _qi_equals(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2207. {
  2208. return _qi_guarded_equals(state, 0, qi_list_make(), a, b);
  2209. }
  2210. qi_bool _qi_in(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2211. {
  2212. qi_value_t *meta;
  2213. qi_bool fail = false;
  2214. if ((meta = qi_call_meta(state, &fail, b, "__in", 2, b, a)))
  2215. {
  2216. if (meta->type != QI_BOOLEAN)
  2217. qi_typeerror(state, "__in returned non-boolean value (%s)",
  2218. _qi_type(state, meta));
  2219. return meta->value.boolean;
  2220. }
  2221. if (fail)
  2222. goto leave;
  2223. if (a->type == QI_STRING && b->type == QI_STRING)
  2224. return strstr(b->value.string, a->value.string) != NULL;
  2225. else if (a->type == QI_NUMBER && b->type == QI_BYTES)
  2226. {
  2227. for (qi_size_t i = 0; i < b->value.bytes->size; i++)
  2228. if (b->value.bytes->data[i] == (unsigned char)(a->value.number))
  2229. return true;
  2230. return false;
  2231. }
  2232. else if (b->type == QI_LIST)
  2233. {
  2234. LOCKED(b, {
  2235. qi_list_t *list = b->value.list;
  2236. if (qi_list_empty(list))
  2237. {
  2238. qi_mutex_unlock(b->mutex);
  2239. return false;
  2240. }
  2241. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  2242. if (_qi_equals(state, a, qi_list_data(list, i)))
  2243. {
  2244. qi_mutex_unlock(b->mutex);
  2245. return true;
  2246. }
  2247. });
  2248. return false;
  2249. }
  2250. else if (b->type == QI_TUPLE)
  2251. {
  2252. qi_list_t *list = b->value.list;
  2253. if (qi_list_empty(list))
  2254. return false;
  2255. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  2256. if (_qi_equals(state, a, qi_list_data(list, i)))
  2257. return true;
  2258. return false;
  2259. }
  2260. else if (a->type == QI_STRING && b->type == QI_TABLE)
  2261. {
  2262. qi_bool res = false;
  2263. LOCKED(b, {
  2264. qi_table_t *table = b->value.table.table;
  2265. if (!qi_table_empty(table))
  2266. res = qi_table_has(table, a->value.string);
  2267. });
  2268. return res;
  2269. }
  2270. leave:
  2271. qi_typeerror(state, "unsupported operand types for in: %s and %s",
  2272. _qi_type(state, a), _qi_type(state, b));
  2273. return false;
  2274. }
  2275. qi_value_t *qi_add(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2276. {
  2277. qi_value_t *meta;
  2278. qi_bool fail = false;
  2279. if ((meta = qi_call_meta(state, &fail, a, "__add", 2, a, b)))
  2280. return meta;
  2281. else if (fail)
  2282. goto leave;
  2283. else if ((meta = qi_call_meta(state, &fail, b, "__add", 2, b, a)))
  2284. return meta;
  2285. if (fail)
  2286. goto leave;
  2287. if (a->type == QI_STRING && b->type == QI_STRING)
  2288. {
  2289. if (!*a->value.string && !*b->value.string)
  2290. return state->empty_string;
  2291. else if (!*a->value.string)
  2292. return b;
  2293. else if (!*b->value.string)
  2294. return a;
  2295. char *string =
  2296. qi_malloc(strlen(a->value.string) + strlen(b->value.string) + 1);
  2297. strcpy(string, a->value.string);
  2298. strcat(string, b->value.string);
  2299. return qi_make_string(state, string);
  2300. }
  2301. else if (a->type == QI_STRING && b->type == QI_NUMBER && *a->value.string &&
  2302. !a->value.string[1])
  2303. {
  2304. char buf[2];
  2305. buf[0] = *a->value.string + b->value.number;
  2306. buf[1] = 0;
  2307. return qi_make_string_copy(state, buf);
  2308. }
  2309. else if (a->type == QI_BYTES && b->type == QI_BYTES)
  2310. {
  2311. if (a->value.bytes->size == 0 && b->value.bytes->size == 0)
  2312. return state->empty_bytes;
  2313. else if (a->value.bytes->size == 0)
  2314. return b;
  2315. else if (b->value.bytes->size == 0)
  2316. return a;
  2317. qi_size_t size = a->value.bytes->size + b->value.bytes->size;
  2318. unsigned char *bytes = qi_malloc(size);
  2319. memcpy(bytes, a->value.bytes->data, a->value.bytes->size);
  2320. memcpy(bytes + a->value.bytes->size, b->value.bytes->data,
  2321. b->value.bytes->size);
  2322. return qi_make_bytes(state, bytes, size);
  2323. }
  2324. else if ((a->type == QI_LIST && b->type == QI_LIST) ||
  2325. (a->type == QI_TUPLE && b->type == QI_TUPLE))
  2326. {
  2327. if (a == state->empty_tuple && b == state->empty_tuple)
  2328. return state->empty_tuple;
  2329. else if (a == state->empty_tuple)
  2330. return b;
  2331. else if (b == state->empty_tuple)
  2332. return a;
  2333. qi_list_t *newlist = qi_list_make();
  2334. if (a->type == QI_LIST)
  2335. {
  2336. qi_mutex_lock(a->mutex);
  2337. qi_mutex_lock(b->mutex);
  2338. if (!a->value.list->length && !b->value.list->length)
  2339. {
  2340. qi_mutex_unlock(a->mutex);
  2341. qi_mutex_unlock(b->mutex);
  2342. return qi_make_list(state, newlist);
  2343. }
  2344. }
  2345. for (qi_size_t i = 0; i < qi_list_length(a->value.list); i++)
  2346. qi_list_push(newlist, qi_list_data(a->value.list, i));
  2347. if (a->type == QI_LIST)
  2348. qi_mutex_unlock(a->mutex);
  2349. for (qi_size_t i = 0; i < qi_list_length(b->value.list); i++)
  2350. qi_list_push(newlist, qi_list_data(b->value.list, i));
  2351. if (a->type == QI_LIST)
  2352. qi_mutex_unlock(b->mutex);
  2353. if (a->type == QI_TUPLE)
  2354. return qi_make_tuple(state, newlist);
  2355. return qi_make_list(state, newlist);
  2356. }
  2357. else if (a->type == QI_TABLE && b->type == QI_TABLE)
  2358. {
  2359. qi_table_t *newtable = qi_table_make();
  2360. qi_mutex_lock(a->mutex);
  2361. qi_mutex_lock(b->mutex);
  2362. qi_table_iterate(a->value.table.table,
  2363. { qi_table_set(newtable, entry.key, entry.value); });
  2364. qi_mutex_unlock(a->mutex);
  2365. qi_table_iterate(b->value.table.table,
  2366. { qi_table_set(newtable, entry.key, entry.value); });
  2367. qi_mutex_unlock(b->mutex);
  2368. return qi_make_table(state, newtable);
  2369. }
  2370. else if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2371. return qi_make_number(state, a->value.number + b->value.number);
  2372. leave:
  2373. qi_typeerror(state, "unsupported operand types for +: %s and %s",
  2374. _qi_type(state, a), _qi_type(state, b));
  2375. return NULL;
  2376. }
  2377. qi_value_t *qi_sub(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2378. {
  2379. qi_value_t *meta;
  2380. qi_bool fail = false;
  2381. if ((meta = qi_call_meta(state, &fail, a, "__sub", 2, a, b)))
  2382. return meta;
  2383. if (fail)
  2384. goto leave;
  2385. if (a->type == QI_STRING && b->type == QI_NUMBER && *a->value.string &&
  2386. !a->value.string[1])
  2387. {
  2388. char buf[2];
  2389. buf[0] = *a->value.string - b->value.number;
  2390. buf[1] = 0;
  2391. return qi_make_string_copy(state, buf);
  2392. }
  2393. else if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2394. return qi_make_number(state, a->value.number - b->value.number);
  2395. leave:
  2396. qi_typeerror(state, "unsupported operand types for -: %s and %s",
  2397. _qi_type(state, a), _qi_type(state, b));
  2398. return NULL;
  2399. }
  2400. qi_value_t *qi_mul(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2401. {
  2402. qi_value_t *meta;
  2403. qi_bool fail = false;
  2404. if ((meta = qi_call_meta(state, &fail, a, "__mul", 2, a, b)))
  2405. return meta;
  2406. else if (fail)
  2407. goto leave;
  2408. else if ((meta = qi_call_meta(state, &fail, b, "__mul", 2, b, a)))
  2409. return meta;
  2410. if (fail)
  2411. goto leave;
  2412. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2413. return qi_make_number(state, a->value.number * b->value.number);
  2414. else if (a->type == QI_STRING && b->type == QI_NUMBER)
  2415. {
  2416. qi_size_t n = (qi_size_t)fabs(b->value.number);
  2417. if (n < 1)
  2418. return state->empty_string;
  2419. else if (n == 1)
  2420. return a;
  2421. qi_buffer_t *buffer = qi_buffer_make();
  2422. for (qi_size_t i = 0; i < n; i++)
  2423. qi_buffer_append_str(buffer, a->value.string);
  2424. return qi_make_string(state, qi_buffer_read(buffer));
  2425. }
  2426. else if ((a->type == QI_LIST || a->type == QI_TUPLE) && b->type == QI_NUMBER)
  2427. {
  2428. qi_size_t n = (qi_size_t)fabs(b->value.number);
  2429. if (a->type == QI_TUPLE && n == 1)
  2430. return a;
  2431. if (a->type == QI_LIST)
  2432. qi_mutex_lock(a->mutex);
  2433. qi_size_t l = a->value.list->length;
  2434. qi_list_t *r = NULL;
  2435. if (l < 1 || n < 1)
  2436. {
  2437. if (a->type == QI_TUPLE)
  2438. return state->empty_tuple;
  2439. goto empty;
  2440. }
  2441. qi_size_t rl = l * n;
  2442. r = qi_list_make_n(rl);
  2443. for (qi_size_t i = 0, j = 0; i < rl; i++)
  2444. {
  2445. r->data[i] = a->value.list->data[j];
  2446. j++;
  2447. if (j >= l)
  2448. j = 0;
  2449. }
  2450. empty:
  2451. if (a->type == QI_LIST)
  2452. qi_mutex_unlock(a->mutex);
  2453. return a->type == QI_LIST ? qi_make_list(state, r) : qi_make_tuple(state, r);
  2454. }
  2455. else if (a->type == QI_BYTES && b->type == QI_NUMBER)
  2456. {
  2457. qi_size_t n = (qi_size_t)fabs(b->value.number);
  2458. if (n == 1)
  2459. return a;
  2460. else if (n < 1)
  2461. return state->empty_bytes;
  2462. qi_size_t l = a->value.bytes->size;
  2463. if (l < 1)
  2464. return state->empty_bytes;
  2465. qi_size_t rl = l * n;
  2466. unsigned char *r = qi_malloc_atomic(rl);
  2467. for (qi_size_t i = 0, j = 0; i < rl; i++)
  2468. {
  2469. r[i] = a->value.bytes->data[j];
  2470. j++;
  2471. if (j >= l)
  2472. j = 0;
  2473. }
  2474. return qi_make_bytes(state, r, rl);
  2475. }
  2476. leave:
  2477. qi_typeerror(state, "unsupported operand types for *: %s and %s",
  2478. _qi_type(state, a), _qi_type(state, b));
  2479. return NULL;
  2480. }
  2481. qi_value_t *qi_div(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2482. {
  2483. qi_value_t *meta;
  2484. qi_bool fail = false;
  2485. if ((meta = qi_call_meta(state, &fail, a, "__div", 2, a, b)))
  2486. return meta;
  2487. if (fail)
  2488. goto leave;
  2489. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2490. {
  2491. if (b->value.number == 0)
  2492. {
  2493. if (a->value.number == 0)
  2494. return state->nan;
  2495. return state->infinity;
  2496. }
  2497. return qi_make_number(state, a->value.number / b->value.number);
  2498. }
  2499. leave:
  2500. qi_typeerror(state, "unsupported operand types for /: %s and %s",
  2501. _qi_type(state, a), _qi_type(state, b));
  2502. return NULL;
  2503. }
  2504. qi_value_t *qi_idiv(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2505. {
  2506. qi_value_t *meta;
  2507. qi_bool fail = false;
  2508. if ((meta = qi_call_meta(state, &fail, a, "__idiv", 2, a, b)))
  2509. return meta;
  2510. if (fail)
  2511. goto leave;
  2512. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2513. {
  2514. if (b->value.number == 0)
  2515. {
  2516. if (a->value.number == 0)
  2517. return state->nan;
  2518. return state->infinity;
  2519. }
  2520. return qi_make_number(state, (long)(a->value.number / b->value.number));
  2521. }
  2522. leave:
  2523. qi_typeerror(state, "unsupported operand types for //: %s and %s",
  2524. _qi_type(state, a), _qi_type(state, b));
  2525. return NULL;
  2526. }
  2527. qi_value_t *qi_mod(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2528. {
  2529. qi_value_t *meta;
  2530. qi_bool fail = false;
  2531. if ((meta = qi_call_meta(state, &fail, a, "__mod", 2, a, b)))
  2532. return meta;
  2533. if (fail)
  2534. goto leave;
  2535. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2536. {
  2537. if (b->value.number == 0)
  2538. {
  2539. if (a->value.number == 0)
  2540. return state->nan;
  2541. return state->infinity;
  2542. }
  2543. return qi_make_number(state, fmod(a->value.number, b->value.number));
  2544. }
  2545. leave:
  2546. qi_typeerror(state, "unsupported operand types for %: %s and %s",
  2547. _qi_type(state, a), _qi_type(state, b));
  2548. return NULL;
  2549. }
  2550. qi_value_t *qi_pow(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2551. {
  2552. qi_value_t *meta;
  2553. qi_bool fail = false;
  2554. if ((meta = qi_call_meta(state, &fail, a, "__pow", 2, a, b)))
  2555. return meta;
  2556. if (fail)
  2557. goto leave;
  2558. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2559. return qi_make_number(state, powf(a->value.number, b->value.number));
  2560. leave:
  2561. qi_typeerror(state, "unsupported operand types for **: %s and %s",
  2562. _qi_type(state, a), _qi_type(state, b));
  2563. return NULL;
  2564. }
  2565. qi_value_t *qi_band(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2566. {
  2567. qi_value_t *meta;
  2568. qi_bool fail = false;
  2569. if ((meta = qi_call_meta(state, &fail, a, "__band", 2, a, b)))
  2570. return meta;
  2571. else if (fail)
  2572. goto leave;
  2573. else if ((meta = qi_call_meta(state, &fail, b, "__band", 2, b, a)))
  2574. return meta;
  2575. if (fail)
  2576. goto leave;
  2577. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2578. return qi_make_number(state,
  2579. (int)(a->value.number) & (int)(b->value.number));
  2580. leave:
  2581. qi_typeerror(state, "unsupported operand types for &: %s and %s",
  2582. _qi_type(state, a), _qi_type(state, b));
  2583. return NULL;
  2584. }
  2585. qi_value_t *qi_bor(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2586. {
  2587. qi_value_t *meta;
  2588. qi_bool fail = false;
  2589. if ((meta = qi_call_meta(state, &fail, a, "__bor", 2, a, b)))
  2590. return meta;
  2591. else if (fail)
  2592. goto leave;
  2593. else if ((meta = qi_call_meta(state, &fail, b, "__bor", 2, b, a)))
  2594. return meta;
  2595. if (fail)
  2596. goto leave;
  2597. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2598. return qi_make_number(state,
  2599. (int)(a->value.number) | (int)(b->value.number));
  2600. leave:
  2601. qi_typeerror(state, "unsupported operand types for |: %s and %s",
  2602. _qi_type(state, a), _qi_type(state, b));
  2603. return NULL;
  2604. }
  2605. qi_value_t *qi_xor(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2606. {
  2607. qi_value_t *meta;
  2608. qi_bool fail = false;
  2609. if ((meta = qi_call_meta(state, &fail, a, "__xor", 2, a, b)))
  2610. return meta;
  2611. else if (fail)
  2612. goto leave;
  2613. else if ((meta = qi_call_meta(state, &fail, b, "__xor", 2, b, a)))
  2614. return meta;
  2615. if (fail)
  2616. goto leave;
  2617. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2618. return qi_make_number(state,
  2619. (int)(a->value.number) ^ (int)(b->value.number));
  2620. leave:
  2621. qi_typeerror(state, "unsupported operand types for ^: %s and %s",
  2622. _qi_type(state, a), _qi_type(state, b));
  2623. return NULL;
  2624. }
  2625. qi_value_t *qi_shl(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2626. {
  2627. qi_value_t *meta;
  2628. qi_bool fail = false;
  2629. if ((meta = qi_call_meta(state, &fail, a, "__shl", 2, a, b)))
  2630. return meta;
  2631. if (fail)
  2632. goto leave;
  2633. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2634. return qi_make_number(state, (int)(a->value.number)
  2635. << (int)(b->value.number));
  2636. leave:
  2637. qi_typeerror(state, "unsupported operand types for <<: %s and %s",
  2638. _qi_type(state, a), _qi_type(state, b));
  2639. return NULL;
  2640. }
  2641. qi_value_t *qi_shr(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2642. {
  2643. qi_value_t *meta;
  2644. qi_bool fail = false;
  2645. if ((meta = qi_call_meta(state, &fail, a, "__shr", 2, a, b)))
  2646. return meta;
  2647. if (fail)
  2648. goto leave;
  2649. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2650. return qi_make_number(state,
  2651. (int)(a->value.number) >> (int)(b->value.number));
  2652. leave:
  2653. qi_typeerror(state, "unsupported operand types for >>: %s and %s",
  2654. _qi_type(state, a), _qi_type(state, b));
  2655. return NULL;
  2656. }
  2657. qi_bool _qi_lt(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2658. {
  2659. qi_value_t *meta;
  2660. qi_bool fail = false;
  2661. if ((meta = qi_call_meta(state, &fail, a, "__lt", 2, a, b)))
  2662. {
  2663. if (meta->type != QI_BOOLEAN)
  2664. qi_typeerror(state, "__lt returned non-boolean value (%s)",
  2665. _qi_type(state, meta));
  2666. return meta->value.boolean;
  2667. }
  2668. if (fail)
  2669. goto leave;
  2670. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2671. return a->value.number < b->value.number;
  2672. else if (a->type == QI_STRING && b->type == QI_STRING &&
  2673. (strlen(a->value.string) == strlen(b->value.string) == 1))
  2674. return a->value.string[0] < b->value.string[0];
  2675. leave:
  2676. qi_typeerror(state, "unsupported operand types for <: %s and %s",
  2677. _qi_type(state, a), _qi_type(state, b));
  2678. return false;
  2679. }
  2680. qi_bool _qi_gt(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2681. {
  2682. qi_value_t *meta;
  2683. qi_bool fail = false;
  2684. if ((meta = qi_call_meta(state, &fail, a, "__gt", 2, a, b)))
  2685. {
  2686. if (meta->type != QI_BOOLEAN)
  2687. qi_typeerror(state, "__gt returned non-boolean value (%s)",
  2688. _qi_type(state, meta));
  2689. return meta->value.boolean;
  2690. }
  2691. if (fail)
  2692. goto leave;
  2693. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2694. return a->value.number > b->value.number;
  2695. else if (a->type == QI_STRING && b->type == QI_STRING &&
  2696. (strlen(a->value.string) == strlen(b->value.string) == 1))
  2697. return a->value.string[0] > b->value.string[0];
  2698. leave:
  2699. qi_typeerror(state, "unsupported operand types for >: %s and %s",
  2700. _qi_type(state, a), _qi_type(state, b));
  2701. return false;
  2702. }
  2703. qi_value_t *qi_negate(qi_state_t *state, qi_value_t *a)
  2704. {
  2705. qi_value_t *meta;
  2706. qi_bool fail = false;
  2707. if ((meta = qi_call_meta(state, &fail, a, "__negate", 1, a)))
  2708. return meta;
  2709. if (fail)
  2710. goto leave;
  2711. if (a->type == QI_NUMBER)
  2712. return qi_make_number(state, -a->value.number);
  2713. leave:
  2714. qi_typeerror(state, "unsupported operand type for unary -: %s",
  2715. _qi_type(state, a));
  2716. return NULL;
  2717. }
  2718. qi_value_t *qi_unary_plus(qi_state_t *state, qi_value_t *a)
  2719. {
  2720. qi_value_t *meta;
  2721. qi_bool fail = false;
  2722. if ((meta = qi_call_meta(state, &fail, a, "__unary_plus", 1, a)))
  2723. return meta;
  2724. if (fail)
  2725. goto leave;
  2726. if (a->type == QI_NUMBER)
  2727. return a;
  2728. leave:
  2729. qi_typeerror(state, "unsupported operand type for unary +: %s",
  2730. _qi_type(state, a));
  2731. return NULL;
  2732. }
  2733. qi_value_t *qi_bnot(qi_state_t *state, qi_value_t *a)
  2734. {
  2735. qi_value_t *meta;
  2736. qi_bool fail = false;
  2737. if ((meta = qi_call_meta(state, &fail, a, "__bnot", 1, a)))
  2738. return meta;
  2739. if (fail)
  2740. goto leave;
  2741. if (a->type == QI_NUMBER)
  2742. return qi_make_number(state, ~(int)(a->value.number));
  2743. leave:
  2744. qi_typeerror(state, "unsupported operand type for unary ~: %s",
  2745. _qi_type(state, a));
  2746. return NULL;
  2747. }
  2748. static void qi_set_barrier(qi_state_t *state)
  2749. {
  2750. qi_scope_t *scope = qi_malloc(sizeof(qi_scope_t));
  2751. scope->scope = NULL;
  2752. scope->defers = NULL;
  2753. scope->is_barrier = true;
  2754. scope->mutex = NULL;
  2755. qi_list_push(state->scopes, scope);
  2756. }
  2757. static qi_state_t *qi_state_clone(qi_state_t *state)
  2758. {
  2759. qi_state_t *newstate = qi_malloc(sizeof(qi_state_t));
  2760. memcpy(newstate, state, sizeof(qi_state_t));
  2761. newstate->traps = qi_list_make();
  2762. newstate->exceptions = qi_list_make();
  2763. newstate->scopes = qi_list_copy(state->scopes);
  2764. qi_set_barrier(newstate);
  2765. newstate->calltrace = qi_list_copy(state->calltrace);
  2766. return newstate;
  2767. }
  2768. void qi_exit(qi_state_t *state, int code)
  2769. {
  2770. while (_qi_old_scope(state, true))
  2771. ;
  2772. qi_finalize();
  2773. exit(code);
  2774. }
  2775. static void *__thread_wrapper(void *_args)
  2776. {
  2777. qi_list_t *args = (qi_list_t *)_args;
  2778. qi_state_t *state = qi_list_index(args, 0);
  2779. qi_value_t *fn = qi_list_index(args, 1);
  2780. qi_list_t *pargs = qi_list_index(args, 2);
  2781. qi_value_t *value = qi_call(state, fn, qi_list_empty(pargs) ? NULL : pargs);
  2782. pthread_exit((void *)value);
  2783. return NULL;
  2784. }
  2785. void *qi_thread_create(qi_state_t *state, qi_value_t *fn, qi_list_t *args)
  2786. {
  2787. pthread_t *td = qi_malloc_atomic(sizeof(pthread_t));
  2788. qi_list_t *_args = qi_list_make();
  2789. qi_list_push(_args, qi_state_clone(state));
  2790. qi_list_push(_args, fn);
  2791. qi_list_push(_args, args);
  2792. pthread_create(td, NULL, __thread_wrapper, (void *)_args);
  2793. return (void *)td;
  2794. }
  2795. void qi_thread_exit(qi_state_t *state, qi_value_t *value)
  2796. {
  2797. if (!qi_thread_main())
  2798. while (qi_old_scope(state))
  2799. ;
  2800. if (!qi_thread_main())
  2801. pthread_exit((void *)value);
  2802. else
  2803. pthread_exit(NULL);
  2804. }
  2805. qi_bool qi_thread_main(void) { return pthread_self() == __main_tid; }
  2806. qi_value_t *qi_thread_join(qi_state_t *state, void *_td)
  2807. {
  2808. pthread_t *td = (pthread_t *)_td;
  2809. qi_value_t *ret = state->nil;
  2810. pthread_join(*td, (void *)&ret);
  2811. if (!ret)
  2812. return state->nil;
  2813. return ret;
  2814. }
  2815. void *qi_mutex_create(void)
  2816. {
  2817. pthread_mutex_t *mutex = qi_malloc_atomic(sizeof(pthread_mutex_t));
  2818. if (pthread_mutex_init(mutex, NULL) != 0)
  2819. return NULL;
  2820. return (void *)mutex;
  2821. }
  2822. void qi_mutex_destroy(void *mutex)
  2823. {
  2824. pthread_mutex_destroy((pthread_mutex_t *)mutex);
  2825. qi_free(mutex);
  2826. }
  2827. void qi_mutex_lock(void *mutex)
  2828. {
  2829. pthread_mutex_lock((pthread_mutex_t *)mutex);
  2830. }
  2831. qi_bool qi_mutex_trylock(void *mutex)
  2832. {
  2833. if (pthread_mutex_trylock((pthread_mutex_t *)mutex) == 0)
  2834. return true;
  2835. return false;
  2836. }
  2837. void qi_mutex_unlock(void *mutex)
  2838. {
  2839. pthread_mutex_unlock((pthread_mutex_t *)mutex);
  2840. }
  2841. void *qi_cond_create(void)
  2842. {
  2843. pthread_cond_t *cond = qi_malloc_atomic(sizeof(pthread_cond_t));
  2844. if (pthread_cond_init(cond, NULL) != 0)
  2845. return NULL;
  2846. return (void *)cond;
  2847. }
  2848. void qi_cond_destroy(void *cond)
  2849. {
  2850. pthread_cond_destroy((pthread_cond_t *)cond);
  2851. qi_free(cond);
  2852. }
  2853. void qi_cond_wait(void *cond, void *mutex)
  2854. {
  2855. pthread_cond_wait((pthread_cond_t *)cond, (pthread_mutex_t *)mutex);
  2856. }
  2857. void qi_cond_signal(void *cond) { pthread_cond_signal((pthread_cond_t *)cond); }
  2858. void qi_cond_broadcast(void *cond)
  2859. {
  2860. pthread_cond_broadcast((pthread_cond_t *)cond);
  2861. }
  2862. qi_value_t *qi_builtin_print(qi_state_t *state, qi_size_t pargc,
  2863. qi_list_t *pargs)
  2864. {
  2865. qi_bool first = true;
  2866. for (int i = 0; i < pargc; i++)
  2867. {
  2868. qi_value_t *a = qi_list_data(pargs, i);
  2869. if (first)
  2870. first = false;
  2871. else
  2872. fputc(' ', stdout);
  2873. fprintf(stdout, "%s", qi_show(state, a));
  2874. }
  2875. return state->nil;
  2876. }
  2877. qi_value_t *qi_builtin_println(qi_state_t *state, qi_size_t pargc,
  2878. qi_list_t *pargs)
  2879. {
  2880. qi_builtin_print(state, pargc, pargs);
  2881. fputc('\n', stdout);
  2882. return state->nil;
  2883. }
  2884. qi_value_t *qi_builtin_set_meta_table(qi_state_t *state, qi_size_t pargc,
  2885. qi_list_t *pargs)
  2886. {
  2887. qi_value_t *a = qi_list_data(pargs, 0);
  2888. qi_value_t *b = qi_list_data(pargs, 1);
  2889. if (a->type != QI_TABLE)
  2890. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2891. _qi_type(state, a));
  2892. if (b->type != QI_TABLE)
  2893. qi_typeerror(state, "expected second argument to be: table, but got: %s",
  2894. _qi_type(state, b));
  2895. LOCKED(a, { a->value.table.metatable = b; });
  2896. return a;
  2897. }
  2898. qi_value_t *qi_builtin_get_meta_table(qi_state_t *state, qi_size_t pargc,
  2899. qi_list_t *pargs)
  2900. {
  2901. qi_value_t *a = qi_list_data(pargs, 0);
  2902. if (a->type != QI_TABLE)
  2903. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2904. _qi_type(state, a));
  2905. qi_value_t *value;
  2906. LOCKED(a, { value = a->value.table.metatable; });
  2907. return value;
  2908. }
  2909. qi_value_t *qi_builtin_has_meta_table(qi_state_t *state, qi_size_t pargc,
  2910. qi_list_t *pargs)
  2911. {
  2912. qi_value_t *a = qi_list_data(pargs, 0);
  2913. if (a->type != QI_TABLE)
  2914. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2915. _qi_type(state, a));
  2916. qi_bool res = false;
  2917. LOCKED(a, { res = qi_has_metatable(a); });
  2918. return res ? state->_true : state->_false;
  2919. }
  2920. qi_value_t *qi_builtin_delete_meta_table(qi_state_t *state, qi_size_t pargc,
  2921. qi_list_t *pargs)
  2922. {
  2923. qi_value_t *a = qi_list_data(pargs, 0);
  2924. if (a->type != QI_TABLE)
  2925. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2926. _qi_type(state, a));
  2927. LOCKED(a, { a->value.table.metatable = state->nil; });
  2928. return state->nil;
  2929. }
  2930. qi_value_t *qi_builtin_has_method(qi_state_t *state, qi_size_t pargc,
  2931. qi_list_t *pargs)
  2932. {
  2933. qi_value_t *a = qi_list_data(pargs, 0);
  2934. qi_value_t *b = qi_list_data(pargs, 1);
  2935. if (a->type != QI_TABLE)
  2936. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2937. _qi_type(state, a));
  2938. if (b->type != QI_STRING)
  2939. qi_typeerror(state,
  2940. "expected second argument to be: string, but got: %s",
  2941. _qi_type(state, b));
  2942. qi_value_t *value;
  2943. qi_bool res = false;
  2944. LOCKED(a, {
  2945. res =
  2946. qi_has_metatable(a) &&
  2947. (value = qi_table_get(qi_get_metatable(a), b->value.string)) != NULL &&
  2948. value->type == QI_FUNCTION;
  2949. });
  2950. return res ? state->_true : state->_false;
  2951. }
  2952. qi_value_t *qi_builtin_delete_method(qi_state_t *state, qi_size_t pargc,
  2953. qi_list_t *pargs)
  2954. {
  2955. qi_value_t *a = qi_list_data(pargs, 0);
  2956. qi_value_t *b = qi_list_data(pargs, 1);
  2957. if (a->type != QI_TABLE)
  2958. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2959. _qi_type(state, a));
  2960. if (b->type != QI_STRING)
  2961. qi_typeerror(state,
  2962. "expected second argument to be: string, but got: %s",
  2963. _qi_type(state, b));
  2964. LOCKED(a, {
  2965. if (qi_has_metatable(a))
  2966. if (!qi_table_delete(qi_get_metatable(a), b->value.string))
  2967. {
  2968. qi_mutex_unlock(a->mutex);
  2969. qi_throw_class(state, state->keyerror, "%s", b->value.string);
  2970. }
  2971. });
  2972. return state->nil;
  2973. }
  2974. qi_value_t *qi_builtin_set_pseudomethod(qi_state_t *state, qi_size_t pargc,
  2975. qi_list_t *pargs)
  2976. {
  2977. qi_value_t *a = qi_list_data(pargs, 0);
  2978. qi_value_t *b = qi_list_data(pargs, 1);
  2979. if (a->type != QI_STRING)
  2980. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  2981. _qi_type(state, a));
  2982. if (b->type != QI_FUNCTION)
  2983. qi_typeerror(state,
  2984. "expected second argument to be: function, but got: %s",
  2985. _qi_type(state, b));
  2986. char *name = a->value.string;
  2987. qi_value_t *method = qi_make_function(state, name, b->value.function.pargc,
  2988. b->value.function.handle, NULL);
  2989. method->value.function.is_pm = true;
  2990. qi_mutex_lock(state->pseudomethods_mutex);
  2991. qi_table_set(state->pseudomethods, name, method);
  2992. qi_mutex_unlock(state->pseudomethods_mutex);
  2993. return method;
  2994. }
  2995. qi_value_t *qi_builtin_has_pseudomethod(qi_state_t *state, qi_size_t pargc,
  2996. qi_list_t *pargs)
  2997. {
  2998. qi_value_t *a = qi_list_data(pargs, 0);
  2999. if (a->type != QI_STRING)
  3000. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3001. _qi_type(state, a));
  3002. qi_mutex_lock(state->pseudomethods_mutex);
  3003. qi_bool res = qi_table_has(state->pseudomethods, a->value.string);
  3004. qi_mutex_unlock(state->pseudomethods_mutex);
  3005. return res ? state->_true : state->_false;
  3006. }
  3007. qi_value_t *qi_builtin_unset_pseudomethod(qi_state_t *state, qi_size_t pargc,
  3008. qi_list_t *pargs)
  3009. {
  3010. qi_value_t *a = qi_list_data(pargs, 0);
  3011. if (a->type != QI_STRING)
  3012. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3013. _qi_type(state, a));
  3014. qi_mutex_lock(state->pseudomethods_mutex);
  3015. qi_bool res = qi_table_delete(state->pseudomethods, a->value.string);
  3016. qi_mutex_unlock(state->pseudomethods_mutex);
  3017. if (!res)
  3018. qi_typeerror(state, "no such pseudomethod: '%s'", a->value.string);
  3019. return state->nil;
  3020. }
  3021. qi_value_t *qi_builtin_set_global(qi_state_t *state, qi_size_t pargc,
  3022. qi_list_t *pargs)
  3023. {
  3024. qi_value_t *a = qi_list_data(pargs, 0);
  3025. qi_value_t *b = qi_list_data(pargs, 1);
  3026. qi_value_t *c = qi_list_data(pargs, 2);
  3027. if (!c)
  3028. c = state->zero;
  3029. else if (c->type != QI_NUMBER)
  3030. qi_typeerror(state, "expected third argument to be: number, but got: %s",
  3031. _qi_type(state, c));
  3032. if (a->type != QI_STRING)
  3033. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3034. _qi_type(state, a));
  3035. char *name = a->value.string;
  3036. qi_symbol_t *symbol;
  3037. qi_size_t offset = (qi_size_t)(c->value.number);
  3038. qi_scope_t *scope;
  3039. if (offset > 0)
  3040. {
  3041. scope = qi_list_index(state->scopes, -((qi_ssize_t)offset));
  3042. if (!scope)
  3043. qi_throw_class(state, state->valueerror, "illegal scope index: %s",
  3044. qi_repr(state, c, true));
  3045. }
  3046. else
  3047. scope = qi_list_first(state->scopes);
  3048. qi_mutex_lock(scope->mutex);
  3049. symbol = qi_table_get(scope->scope, name);
  3050. if (symbol)
  3051. {
  3052. if (symbol->is_constant)
  3053. {
  3054. qi_mutex_unlock(scope->mutex);
  3055. qi_typeerror(state, "redeclaration of constant symbol: '%s'", name);
  3056. }
  3057. qi_value_t *ret = symbol->value;
  3058. symbol->value = b;
  3059. qi_mutex_unlock(scope->mutex);
  3060. return ret;
  3061. }
  3062. symbol = qi_malloc(sizeof(qi_symbol_t));
  3063. symbol->value = b;
  3064. symbol->is_constant = false;
  3065. qi_table_set(scope->scope, name, symbol);
  3066. qi_mutex_unlock(scope->mutex);
  3067. return b;
  3068. }
  3069. qi_value_t *qi_builtin_unset_global(qi_state_t *state, qi_size_t pargc,
  3070. qi_list_t *pargs)
  3071. {
  3072. qi_value_t *a = qi_list_data(pargs, 0);
  3073. qi_value_t *b = qi_list_data(pargs, 1);
  3074. if (!b)
  3075. b = state->zero;
  3076. else if (b->type != QI_NUMBER)
  3077. qi_typeerror(state,
  3078. "expected second argument to be: number, but got: %s",
  3079. _qi_type(state, b));
  3080. if (a->type != QI_STRING)
  3081. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3082. _qi_type(state, a));
  3083. char *name = a->value.string;
  3084. qi_symbol_t *symbol;
  3085. qi_size_t offset = (qi_size_t)(b->value.number);
  3086. qi_scope_t *scope;
  3087. if (offset > 0)
  3088. {
  3089. scope = qi_list_index(state->scopes, -((qi_ssize_t)offset));
  3090. if (!scope)
  3091. qi_throw_class(state, state->valueerror, "illegal scope index: %s",
  3092. qi_repr(state, b, true));
  3093. }
  3094. else
  3095. scope = qi_list_first(state->scopes);
  3096. qi_mutex_lock(scope->mutex);
  3097. symbol = qi_table_get(scope->scope, name);
  3098. if (symbol)
  3099. {
  3100. if (symbol->is_constant)
  3101. {
  3102. qi_mutex_unlock(scope->mutex);
  3103. qi_typeerror(state, "cannot unset constant symbol: '%s'", name);
  3104. }
  3105. qi_value_t *ret = symbol->value;
  3106. qi_table_delete(scope->scope, name);
  3107. qi_mutex_unlock(scope->mutex);
  3108. return ret;
  3109. }
  3110. qi_mutex_unlock(scope->mutex);
  3111. return state->nil;
  3112. }
  3113. qi_value_t *qi_builtin_get_global(qi_state_t *state, qi_size_t pargc,
  3114. qi_list_t *pargs)
  3115. {
  3116. qi_value_t *a = qi_list_data(pargs, 0);
  3117. qi_value_t *b = qi_list_data(pargs, 1);
  3118. if (!b)
  3119. b = state->zero;
  3120. else if (b->type != QI_NUMBER)
  3121. qi_typeerror(state,
  3122. "expected second argument to be: number, but got: %s",
  3123. _qi_type(state, b));
  3124. if (a->type != QI_STRING)
  3125. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3126. _qi_type(state, a));
  3127. char *name = a->value.string;
  3128. qi_value_t *ret = state->nil;
  3129. qi_size_t offset = (qi_size_t)(b->value.number);
  3130. qi_scope_t *scope;
  3131. if (offset > 0)
  3132. {
  3133. scope = qi_list_index(state->scopes, -((qi_ssize_t)offset));
  3134. if (!scope)
  3135. qi_throw_class(state, state->valueerror, "illegal scope index: %s",
  3136. qi_repr(state, b, true));
  3137. }
  3138. else
  3139. scope = qi_list_first(state->scopes);
  3140. qi_mutex_lock(scope->mutex);
  3141. qi_symbol_t *symbol = qi_table_get(scope->scope, name);
  3142. if (symbol)
  3143. ret = symbol->value;
  3144. qi_mutex_unlock(scope->mutex);
  3145. return ret;
  3146. }
  3147. qi_value_t *qi_builtin_get_globals(qi_state_t *state, qi_size_t pargc,
  3148. qi_list_t *pargs)
  3149. {
  3150. qi_table_t *table = qi_table_make();
  3151. qi_scope_t *scope = qi_list_first(state->scopes);
  3152. qi_mutex_lock(scope->mutex);
  3153. qi_table_iterate(scope->scope, {
  3154. qi_symbol_t *symbol = entry.value;
  3155. qi_table_set(table, entry.key, symbol->value);
  3156. });
  3157. qi_mutex_unlock(scope->mutex);
  3158. return qi_make_table(state, table);
  3159. }
  3160. qi_value_t *qi_builtin_get_rlimit(qi_state_t *state, qi_size_t pargc,
  3161. qi_list_t *pargs)
  3162. {
  3163. return qi_make_number(state, state->rlimit);
  3164. }
  3165. qi_value_t *qi_builtin_set_rlimit(qi_state_t *state, qi_size_t pargc,
  3166. qi_list_t *pargs)
  3167. {
  3168. qi_value_t *a = qi_list_data(pargs, 0);
  3169. if (a->type != QI_NUMBER)
  3170. qi_typeerror(state, "expected first argument to be: number, but got: %s",
  3171. _qi_type(state, a));
  3172. state->rlimit = (size_t)a->value.number;
  3173. return state->nil;
  3174. }
  3175. #define is_valid_mode(fmod) \
  3176. (strcmp((fmod), "w") == 0 || strcmp((fmod), "r") == 0 || \
  3177. strcmp((fmod), "a") == 0 || strcmp((fmod), "a+") == 0 || \
  3178. strcmp((fmod), "w+") == 0 || strcmp((fmod), "r+") == 0)
  3179. qi_value_t *qi_builtin_fopen(qi_state_t *state, qi_size_t pargc,
  3180. qi_list_t *pargs)
  3181. {
  3182. qi_value_t *a = qi_list_data(pargs, 0);
  3183. qi_value_t *b = qi_list_data(pargs, 1);
  3184. if (a->type != QI_STRING)
  3185. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3186. _qi_type(state, a));
  3187. if (b->type != QI_STRING)
  3188. qi_typeerror(state,
  3189. "expected second argument to be: string, but got: %s",
  3190. _qi_type(state, b));
  3191. if (!is_valid_mode(b->value.string))
  3192. qi_throw_class(state, state->valueerror, "invalid mode: %s", qi_repr(state, b, true));
  3193. char mode[4];
  3194. snprintf(mode, sizeof(mode), "%sb", b->value.string);
  3195. FILE *file = fopen(a->value.string, mode);
  3196. if (!file)
  3197. qi_throw_class(state, state->ioerror, "cannot open file: %s", qi_repr(state, a, true));
  3198. return qi_make_file(state, file, b->value.string);
  3199. }
  3200. static unsigned char *_read_stdin(qi_size_t *count)
  3201. {
  3202. *count = 0;
  3203. qi_buffer_t *buffer = qi_buffer_make();
  3204. int c;
  3205. while ((c = fgetc(stdin)) != EOF)
  3206. qi_buffer_append(buffer, c), (*count)++;
  3207. return (unsigned char *)qi_buffer_read(buffer);
  3208. }
  3209. #define is_valid_read_mode(fmod) \
  3210. (strcmp((fmod), "a+") == 0 || strcmp((fmod), "r") == 0 || \
  3211. strcmp((fmod), "w+") == 0 || strcmp((fmod), "r+") == 0)
  3212. qi_value_t *qi_builtin_fread(qi_state_t *state, qi_size_t pargc,
  3213. qi_list_t *pargs)
  3214. {
  3215. qi_value_t *a = qi_list_data(pargs, 0);
  3216. qi_value_t *b = qi_list_data(pargs, 1);
  3217. if (a->type != QI_FILE)
  3218. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3219. _qi_type(state, a));
  3220. if (b->type != QI_NUMBER)
  3221. qi_typeerror(state,
  3222. "expected second argument to be: number, but got: %s",
  3223. _qi_type(state, b));
  3224. if (!a->value.file.is_open)
  3225. qi_throw_class(state, state->ioerror, "file is already closed");
  3226. if (!is_valid_read_mode(a->value.file.mode))
  3227. qi_throw_class(state, state->ioerror, "file is not readable");
  3228. qi_size_t size;
  3229. if (b->value.number < 0)
  3230. {
  3231. if (a->value.file.fd == stdin)
  3232. {
  3233. qi_size_t count;
  3234. unsigned char *data = _read_stdin(&count);
  3235. return qi_make_bytes(state, data, count);
  3236. }
  3237. fseek(a->value.file.fd, 0, SEEK_END);
  3238. size = ftell(a->value.file.fd);
  3239. fseek(a->value.file.fd, 0, SEEK_SET);
  3240. }
  3241. else
  3242. size = (qi_size_t)(b->value.number);
  3243. unsigned char *data = qi_malloc_atomic(size);
  3244. qi_size_t count = fread(data, sizeof(unsigned char), size, a->value.file.fd);
  3245. return qi_make_bytes(state, data, count);
  3246. }
  3247. qi_value_t *qi_builtin_fgets(qi_state_t *state, qi_size_t pargc,
  3248. qi_list_t *pargs)
  3249. {
  3250. qi_value_t *a = qi_list_data(pargs, 0);
  3251. qi_value_t *b = qi_list_data(pargs, 1);
  3252. if (a->type != QI_FILE)
  3253. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3254. _qi_type(state, a));
  3255. if (b->type != QI_NUMBER)
  3256. qi_typeerror(state,
  3257. "expected second argument to be: number, but got: %s",
  3258. _qi_type(state, b));
  3259. if (!a->value.file.is_open)
  3260. qi_throw_class(state, state->ioerror, "file is already closed");
  3261. if (!is_valid_read_mode(a->value.file.mode))
  3262. qi_throw_class(state, state->ioerror, "file is not readable");
  3263. qi_size_t size = (qi_size_t)(b->value.number);
  3264. char *data = qi_malloc(size + 1);
  3265. if (!fgets(data, size, a->value.file.fd))
  3266. qi_throw_class(state, state->ioerror, "reached EOF");
  3267. return qi_make_string(state, data);
  3268. }
  3269. qi_value_t *qi_builtin_fgetc(qi_state_t *state, qi_size_t pargc,
  3270. qi_list_t *pargs)
  3271. {
  3272. qi_value_t *a = qi_list_data(pargs, 0);
  3273. if (a->type != QI_FILE)
  3274. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3275. _qi_type(state, a));
  3276. if (!a->value.file.is_open)
  3277. qi_throw_class(state, state->ioerror, "file is already closed");
  3278. if (!is_valid_read_mode(a->value.file.mode))
  3279. qi_throw_class(state, state->ioerror, "file is not readable");
  3280. int c = fgetc(a->value.file.fd);
  3281. return qi_make_number(state, c);
  3282. }
  3283. #define is_valid_write_mode(fmod) \
  3284. (strcmp((fmod), "a") == 0 || strcmp((fmod), "a+") == 0 || \
  3285. strcmp((fmod), "w") == 0 || strcmp((fmod), "w+") == 0 || \
  3286. strcmp((fmod), "r+") == 0)
  3287. qi_value_t *qi_builtin_fputc(qi_state_t *state, qi_size_t pargc,
  3288. qi_list_t *pargs)
  3289. {
  3290. qi_value_t *a = qi_list_data(pargs, 0);
  3291. qi_value_t *b = qi_list_data(pargs, 1);
  3292. if (a->type != QI_FILE)
  3293. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3294. _qi_type(state, a));
  3295. if (b->type != QI_NUMBER &&
  3296. (b->type != QI_STRING || strlen(b->value.string) != 1))
  3297. qi_typeerror(state,
  3298. "expected second argument to be: number or string of "
  3299. "length 1, but got: %s",
  3300. _qi_type(state, b));
  3301. if (!a->value.file.is_open)
  3302. qi_throw_class(state, state->ioerror, "file is already closed");
  3303. if (!is_valid_write_mode(a->value.file.mode))
  3304. qi_throw_class(state, state->ioerror, "file is not writeable");
  3305. fputc(b->type == QI_NUMBER ? b->value.number : b->value.string[0],
  3306. a->value.file.fd);
  3307. return state->nil;
  3308. }
  3309. qi_value_t *qi_builtin_fwrite(qi_state_t *state, qi_size_t pargc,
  3310. qi_list_t *pargs)
  3311. {
  3312. qi_value_t *a = qi_list_data(pargs, 0);
  3313. qi_value_t *b = qi_list_data(pargs, 1);
  3314. if (a->type != QI_FILE)
  3315. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3316. _qi_type(state, a));
  3317. if (b->type == QI_STRING || b->type == QI_LIST)
  3318. b = qi_to_bytes(state, b);
  3319. if (b->type != QI_BYTES)
  3320. qi_typeerror(state, "expected second argument to be: bytes, but got: %s",
  3321. _qi_type(state, b));
  3322. if (!a->value.file.is_open)
  3323. qi_throw_class(state, state->ioerror, "file is already closed");
  3324. if (!is_valid_write_mode(a->value.file.mode))
  3325. qi_throw_class(state, state->ioerror, "file is not writeable");
  3326. qi_size_t count = fwrite(b->value.bytes->data, sizeof(unsigned char),
  3327. b->value.bytes->size, a->value.file.fd);
  3328. return qi_make_number(state, count);
  3329. }
  3330. qi_value_t *qi_builtin_fputs(qi_state_t *state, qi_size_t pargc,
  3331. qi_list_t *pargs)
  3332. {
  3333. qi_value_t *a = qi_list_data(pargs, 0);
  3334. qi_value_t *b = qi_list_data(pargs, 1);
  3335. if (a->type != QI_FILE)
  3336. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3337. _qi_type(state, a));
  3338. if (b->type != QI_STRING)
  3339. qi_typeerror(state,
  3340. "expected second argument to be: string, but got: %s",
  3341. _qi_type(state, b));
  3342. if (!a->value.file.is_open)
  3343. qi_throw_class(state, state->ioerror, "file is already closed");
  3344. if (!is_valid_write_mode(a->value.file.mode))
  3345. qi_throw_class(state, state->ioerror, "file is not writeable");
  3346. qi_size_t count = fputs(b->value.string, a->value.file.fd);
  3347. return qi_make_number(state, count);
  3348. }
  3349. qi_value_t *qi_builtin_fseek(qi_state_t *state, qi_size_t pargc,
  3350. qi_list_t *pargs)
  3351. {
  3352. qi_value_t *a = qi_list_data(pargs, 0);
  3353. qi_value_t *b = qi_list_data(pargs, 1);
  3354. qi_value_t *c = qi_list_data(pargs, 2);
  3355. if (a->type != QI_FILE)
  3356. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3357. _qi_type(state, a));
  3358. if (b->type != QI_NUMBER)
  3359. qi_typeerror(state,
  3360. "expected second argument to be: number, but got: %s",
  3361. _qi_type(state, b));
  3362. if (c->type != QI_NUMBER)
  3363. qi_typeerror(state, "expected third argument to be: number, but got: %s",
  3364. _qi_type(state, c));
  3365. if (!a->value.file.is_open)
  3366. qi_throw_class(state, state->ioerror, "file is already closed");
  3367. qi_size_t offset = (qi_size_t)(b->value.number);
  3368. unsigned int origin = (unsigned int)(c->value.number);
  3369. fseek(a->value.file.fd, offset, origin);
  3370. return state->nil;
  3371. }
  3372. qi_value_t *qi_builtin_ftell(qi_state_t *state, qi_size_t pargc,
  3373. qi_list_t *pargs)
  3374. {
  3375. qi_value_t *a = qi_list_data(pargs, 0);
  3376. if (a->type != QI_FILE)
  3377. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3378. _qi_type(state, a));
  3379. if (!a->value.file.is_open)
  3380. qi_throw_class(state, state->ioerror, "file is already closed");
  3381. qi_size_t position = ftell(a->value.file.fd);
  3382. return qi_make_number(state, position);
  3383. }
  3384. qi_value_t *qi_builtin_fflush(qi_state_t *state, qi_size_t pargc,
  3385. qi_list_t *pargs)
  3386. {
  3387. qi_value_t *a = qi_list_data(pargs, 0);
  3388. if (a->type != QI_FILE)
  3389. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3390. _qi_type(state, a));
  3391. if (!a->value.file.is_open)
  3392. qi_throw_class(state, state->ioerror, "file is already closed");
  3393. fflush(a->value.file.fd);
  3394. return state->nil;
  3395. }
  3396. qi_value_t *qi_builtin_fclose(qi_state_t *state, qi_size_t pargc,
  3397. qi_list_t *pargs)
  3398. {
  3399. qi_value_t *a = qi_list_data(pargs, 0);
  3400. if (a->type != QI_FILE)
  3401. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3402. _qi_type(state, a));
  3403. if (!a->value.file.is_open)
  3404. qi_throw_class(state, state->ioerror, "file is already closed");
  3405. if (a->value.file.fd == stdin || a->value.file.fd == stderr ||
  3406. a->value.file.fd == stdout)
  3407. qi_throw_class(state, state->ioerror, "cannot close standard streams");
  3408. fclose(a->value.file.fd);
  3409. a->value.file.is_open = false;
  3410. return a;
  3411. }
  3412. qi_value_t *qi_builtin_fclosed(qi_state_t *state, qi_size_t pargc,
  3413. qi_list_t *pargs)
  3414. {
  3415. qi_value_t *a = qi_list_data(pargs, 0);
  3416. if (a->type != QI_FILE)
  3417. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3418. _qi_type(state, a));
  3419. return a->value.file.is_open ? state->_false : state->_true;
  3420. }
  3421. qi_value_t *qi_builtin_chr(qi_state_t *state, qi_size_t pargc,
  3422. qi_list_t *pargs)
  3423. {
  3424. qi_value_t *a = qi_list_data(pargs, 0);
  3425. if (a->type != QI_NUMBER)
  3426. qi_typeerror(state, "expected first argument to be: number, but got: %s",
  3427. _qi_type(state, a));
  3428. unsigned char c = (int)(a->value.number);
  3429. if (c == 0)
  3430. qi_throw_class(state, state->valueerror, "illegal character code");
  3431. return qi_make_char(state, c);
  3432. }
  3433. qi_value_t *qi_builtin_ord(qi_state_t *state, qi_size_t pargc,
  3434. qi_list_t *pargs)
  3435. {
  3436. qi_value_t *a = qi_list_data(pargs, 0);
  3437. if (a->type != QI_STRING || strlen(a->value.string) != 1)
  3438. qi_throw_class(
  3439. state, state->typeerror, "expected first argument to be: string of length 1, but got: %s",
  3440. _qi_type(state, a));
  3441. return qi_make_number(state, a->value.string[0]);
  3442. }
  3443. qi_value_t *qi_builtin_len(qi_state_t *state, qi_size_t pargc,
  3444. qi_list_t *pargs)
  3445. {
  3446. qi_value_t *a = qi_list_data(pargs, 0);
  3447. return qi_length(state, a);
  3448. }
  3449. qi_value_t *qi_builtin_type(qi_state_t *state, qi_size_t pargc,
  3450. qi_list_t *pargs)
  3451. {
  3452. qi_value_t *a = qi_list_data(pargs, 0);
  3453. return qi_type(state, a);
  3454. }
  3455. qi_value_t *qi_builtin_list_copy(qi_state_t *state, qi_size_t pargc,
  3456. qi_list_t *pargs)
  3457. {
  3458. qi_value_t *a = qi_list_data(pargs, 0);
  3459. if (a->type != QI_LIST)
  3460. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3461. _qi_type(state, a));
  3462. qi_list_t *list;
  3463. LOCKED(a, { list = qi_list_copy(a->value.list); });
  3464. return qi_make_list(state, list);
  3465. }
  3466. qi_value_t *qi_builtin_list_push(qi_state_t *state, qi_size_t pargc,
  3467. qi_list_t *pargs)
  3468. {
  3469. qi_value_t *a = qi_list_data(pargs, 0);
  3470. qi_value_t *b = qi_list_data(pargs, 1);
  3471. if (a->type != QI_LIST)
  3472. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3473. _qi_type(state, a));
  3474. LOCKED(a, { qi_list_push(a->value.list, b); });
  3475. return a;
  3476. }
  3477. qi_value_t *qi_builtin_list_insert(qi_state_t *state, qi_size_t pargc,
  3478. qi_list_t *pargs)
  3479. {
  3480. qi_value_t *a = qi_list_data(pargs, 0);
  3481. qi_value_t *b = qi_list_data(pargs, 1);
  3482. qi_value_t *c = qi_list_data(pargs, 2);
  3483. if (a->type != QI_LIST)
  3484. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3485. _qi_type(state, a));
  3486. if (b->type != QI_NUMBER)
  3487. qi_typeerror(state,
  3488. "expected second argument to be: number, but got: %s",
  3489. _qi_type(state, b));
  3490. qi_bool res = false;
  3491. LOCKED(a, { res = qi_list_insert(a->value.list, b->value.number, c); });
  3492. if (!res)
  3493. qi_throw_class(state, state->indexerror, "%s",
  3494. qi_repr(state, b, true));
  3495. return a;
  3496. }
  3497. qi_value_t *qi_builtin_list_delete(qi_state_t *state, qi_size_t pargc,
  3498. qi_list_t *pargs)
  3499. {
  3500. qi_value_t *a = qi_list_data(pargs, 0);
  3501. qi_value_t *b = qi_list_data(pargs, 1);
  3502. if (a->type != QI_LIST)
  3503. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3504. _qi_type(state, a));
  3505. if (b->type != QI_NUMBER)
  3506. qi_typeerror(state,
  3507. "expected second argument to be: number, but got: %s",
  3508. _qi_type(state, b));
  3509. qi_del(state, a, b);
  3510. return a;
  3511. }
  3512. qi_value_t *qi_builtin_list_pop(qi_state_t *state, qi_size_t pargc,
  3513. qi_list_t *pargs)
  3514. {
  3515. qi_value_t *a = qi_list_data(pargs, 0);
  3516. if (a->type != QI_LIST)
  3517. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3518. _qi_type(state, a));
  3519. qi_value_t *value = NULL;
  3520. LOCKED(a, { value = qi_list_pop(a->value.list); });
  3521. if (!value)
  3522. qi_throw_class(state, state->indexerror, "pop from empty list");
  3523. return value;
  3524. }
  3525. qi_value_t *qi_copy_object(qi_state_t *state, qi_value_t *value)
  3526. {
  3527. if (value->type != QI_TABLE)
  3528. return value;
  3529. qi_value_t *newvalue;
  3530. LOCKED(value, {
  3531. qi_table_t *table = qi_table_copy(value->value.table.table);
  3532. newvalue = qi_make_table(state, table);
  3533. if (qi_has_metatable(value) && newvalue->value.table.metatable != value)
  3534. newvalue->value.table.metatable =
  3535. qi_copy_object(state, newvalue->value.table.metatable);
  3536. });
  3537. return newvalue;
  3538. }
  3539. qi_value_t *qi_builtin_table_copy(qi_state_t *state, qi_size_t pargc,
  3540. qi_list_t *pargs)
  3541. {
  3542. qi_value_t *a = qi_list_data(pargs, 0);
  3543. if (a->type != QI_TABLE)
  3544. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  3545. _qi_type(state, a));
  3546. return qi_copy_object(state, a);
  3547. }
  3548. qi_value_t *qi_builtin_table_delete(qi_state_t *state, qi_size_t pargc,
  3549. qi_list_t *pargs)
  3550. {
  3551. qi_value_t *a = qi_list_data(pargs, 0);
  3552. qi_value_t *b = qi_list_data(pargs, 1);
  3553. if (a->type != QI_TABLE)
  3554. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  3555. _qi_type(state, a));
  3556. if (b->type != QI_STRING)
  3557. b = qi_to_string(state, b);
  3558. qi_del(state, a, b);
  3559. return a;
  3560. }
  3561. qi_value_t *qi_builtin_table_get(qi_state_t *state, qi_size_t pargc,
  3562. qi_list_t *pargs)
  3563. {
  3564. qi_value_t *a = qi_list_data(pargs, 0);
  3565. qi_value_t *b = qi_list_data(pargs, 1);
  3566. qi_value_t *c = pargc >= 3 ? qi_list_data(pargs, 2) : state->nil;
  3567. if (a->type != QI_TABLE)
  3568. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  3569. _qi_type(state, a));
  3570. if (b->type != QI_STRING)
  3571. b = qi_to_string(state, b);
  3572. LOCKED(a, {
  3573. qi_value_t *tmp = NULL;
  3574. if ((tmp = qi_table_get(a->value.table.table, b->value.string)))
  3575. c = tmp;
  3576. });
  3577. return c;
  3578. }
  3579. qi_value_t *qi_builtin_func_call(qi_state_t *state, qi_size_t pargc,
  3580. qi_list_t *pargs)
  3581. {
  3582. qi_value_t *a = qi_list_data(pargs, 0);
  3583. qi_value_t *b = qi_list_data(pargs, 1);
  3584. if (a->type != QI_FUNCTION)
  3585. qi_typeerror(state,
  3586. "expected first argument to be: function, but got: %s",
  3587. _qi_type(state, a));
  3588. if (b->type != QI_LIST && b->type != QI_TUPLE)
  3589. qi_typeerror(state,
  3590. "expected second argument to be: list or tuple, but got: %s",
  3591. _qi_type(state, b));
  3592. qi_list_t *list = NULL;
  3593. if (b->type == QI_TUPLE)
  3594. {
  3595. if (!qi_list_empty(b->value.list))
  3596. list = qi_list_copy(b->value.list);
  3597. }
  3598. else
  3599. {
  3600. LOCKED(b, {
  3601. if (!qi_list_empty(b->value.list))
  3602. list = qi_list_copy(b->value.list);
  3603. });
  3604. }
  3605. return qi_call(state, a, list);
  3606. }
  3607. qi_value_t *qi_builtin_func_name(qi_state_t *state, qi_size_t pargc,
  3608. qi_list_t *pargs)
  3609. {
  3610. qi_value_t *a = qi_list_data(pargs, 0);
  3611. if (a->type != QI_FUNCTION)
  3612. qi_typeerror(state,
  3613. "expected first argument to be: function, but got: %s",
  3614. _qi_type(state, a));
  3615. return qi_make_string(state, a->value.function.name);
  3616. }
  3617. qi_value_t *qi_builtin_func_argc(qi_state_t *state, qi_size_t pargc,
  3618. qi_list_t *pargs)
  3619. {
  3620. qi_value_t *a = qi_list_data(pargs, 0);
  3621. if (a->type != QI_FUNCTION)
  3622. qi_typeerror(state,
  3623. "expected first argument to be: function, but got: %s",
  3624. _qi_type(state, a));
  3625. return qi_make_number(state, a->value.function.pargc);
  3626. }
  3627. qi_value_t *qi_builtin_data_tag(qi_state_t *state, qi_size_t pargc,
  3628. qi_list_t *pargs)
  3629. {
  3630. qi_value_t *a = qi_list_data(pargs, 0);
  3631. if (a->type != QI_DATA)
  3632. qi_typeerror(state, "expected first argument to be: data, but got: %s",
  3633. _qi_type(state, a));
  3634. return qi_make_number(state, a->value.data.tag);
  3635. }
  3636. qi_value_t *qi_builtin_repr(qi_state_t *state, qi_size_t pargc,
  3637. qi_list_t *pargs)
  3638. {
  3639. qi_value_t *a = qi_list_data(pargs, 0);
  3640. return qi_make_string(state, qi_repr(state, a, true));
  3641. }
  3642. qi_value_t *qi_builtin_str(qi_state_t *state, qi_size_t pargc,
  3643. qi_list_t *pargs)
  3644. {
  3645. qi_value_t *a = qi_list_data(pargs, 0);
  3646. return qi_to_string(state, a);
  3647. }
  3648. qi_value_t *qi_builtin_bool(qi_state_t *state, qi_size_t pargc,
  3649. qi_list_t *pargs)
  3650. {
  3651. qi_value_t *a = qi_list_data(pargs, 0);
  3652. return qi_to_boolean(state, a);
  3653. }
  3654. qi_value_t *qi_builtin_num(qi_state_t *state, qi_size_t pargc,
  3655. qi_list_t *pargs)
  3656. {
  3657. qi_value_t *a = qi_list_data(pargs, 0);
  3658. return qi_to_number(state, a);
  3659. }
  3660. qi_value_t *qi_builtin_int(qi_state_t *state, qi_size_t pargc,
  3661. qi_list_t *pargs)
  3662. {
  3663. qi_value_t *a = qi_list_data(pargs, 0);
  3664. qi_value_t *value = qi_to_number(state, a);
  3665. value->value.number = (long)value->value.number;
  3666. return value;
  3667. }
  3668. qi_value_t *qi_builtin_bytes(qi_state_t *state, qi_size_t pargc,
  3669. qi_list_t *pargs)
  3670. {
  3671. qi_value_t *a = qi_list_data(pargs, 0);
  3672. return qi_to_bytes(state, a);
  3673. }
  3674. qi_value_t *qi_builtin_list(qi_state_t *state, qi_size_t pargc,
  3675. qi_list_t *pargs)
  3676. {
  3677. qi_value_t *a = qi_list_data(pargs, 0);
  3678. return qi_to_list(state, a);
  3679. }
  3680. qi_value_t *qi_builtin_tuple(qi_state_t *state, qi_size_t pargc,
  3681. qi_list_t *pargs)
  3682. {
  3683. qi_value_t *a = qi_list_data(pargs, 0);
  3684. return qi_to_tuple(state, a);
  3685. }
  3686. qi_value_t *qi_builtin_table(qi_state_t *state, qi_size_t pargc,
  3687. qi_list_t *pargs)
  3688. {
  3689. qi_value_t *a = qi_list_data(pargs, 0);
  3690. return qi_to_table(state, a);
  3691. }
  3692. qi_value_t *qi_builtin_ref(qi_state_t *state, qi_size_t pargc,
  3693. qi_list_t *pargs)
  3694. {
  3695. qi_value_t *a = qi_list_data(pargs, 0);
  3696. return qi_to_ref(state, a);
  3697. }
  3698. qi_value_t *qi_builtin_iter(qi_state_t *state, qi_size_t pargc,
  3699. qi_list_t *pargs)
  3700. {
  3701. qi_value_t *a = qi_list_data(pargs, 0);
  3702. return qi_iter(state, a);
  3703. }
  3704. qi_value_t *qi_builtin_iter_next(qi_state_t *state, qi_size_t pargc,
  3705. qi_list_t *pargs)
  3706. {
  3707. qi_value_t *a = qi_list_data(pargs, 0);
  3708. if (!qi_is_iter(state, a))
  3709. qi_typeerror(state,
  3710. "expected first argument to be an iterator, but got: %s",
  3711. _qi_type(state, a));
  3712. return qi_iter_next(state, a);
  3713. }
  3714. qi_value_t *qi_builtin_iter_end(qi_state_t *state, qi_size_t pargc,
  3715. qi_list_t *pargs)
  3716. {
  3717. qi_value_t *a = qi_list_data(pargs, 0);
  3718. if (!qi_is_iter(state, a))
  3719. qi_typeerror(state,
  3720. "expected first argument to be an iterator, but got: %s",
  3721. _qi_type(state, a));
  3722. return qi_make_boolean(state, qi_iter_end(state, a));
  3723. }
  3724. qi_value_t *qi_builtin_deref(qi_state_t *state, qi_size_t pargc,
  3725. qi_list_t *pargs)
  3726. {
  3727. qi_value_t *a = qi_list_data(pargs, 0);
  3728. if (a->type != QI_REFERENCE)
  3729. qi_typeerror(state,
  3730. "expected first argument to be: reference, but got: %s",
  3731. _qi_type(state, a));
  3732. return qi_deref(state, a);
  3733. }
  3734. qi_value_t *qi_builtin_ref_set(qi_state_t *state, qi_size_t pargc,
  3735. qi_list_t *pargs)
  3736. {
  3737. qi_value_t *a = qi_list_data(pargs, 0);
  3738. qi_value_t *b = qi_list_data(pargs, 1);
  3739. if (a->type != QI_REFERENCE)
  3740. qi_typeerror(state,
  3741. "expected first argument to be: reference, but got: %s",
  3742. _qi_type(state, a));
  3743. return qi_set_ref(state, false, a, b);
  3744. }
  3745. qi_value_t *qi_pseudomethod_func_call(qi_state_t *state, qi_size_t pargc,
  3746. qi_list_t *pargs)
  3747. {
  3748. return qi_builtin_func_call(state, pargc, pargs);
  3749. }
  3750. qi_value_t *qi_pseudomethod_file_write(qi_state_t *state, qi_size_t pargc,
  3751. qi_list_t *pargs)
  3752. {
  3753. return qi_builtin_fwrite(state, pargc, pargs);
  3754. }
  3755. qi_value_t *qi_pseudomethod_file_read(qi_state_t *state, qi_size_t pargc,
  3756. qi_list_t *pargs)
  3757. {
  3758. if (pargc < 2)
  3759. {
  3760. qi_list_t *new_pargs = qi_list_make_n(2);
  3761. qi_list_data(new_pargs, 0) = qi_list_first(pargs);
  3762. qi_list_data(new_pargs, 1) = qi_make_number(state, -1);
  3763. return qi_builtin_fread(state, 2, new_pargs);
  3764. }
  3765. return qi_builtin_fread(state, pargc, pargs);
  3766. }
  3767. qi_value_t *qi_pseudomethod_file_rewind(qi_state_t *state, qi_size_t pargc,
  3768. qi_list_t *pargs)
  3769. {
  3770. qi_list_t *new_pargs = qi_list_make_n(3);
  3771. qi_list_data(new_pargs, 0) = qi_list_first(pargs);
  3772. qi_list_data(new_pargs, 1) = qi_make_number(state, 0);
  3773. qi_list_data(new_pargs, 2) = qi_make_number(state, SEEK_SET);
  3774. return qi_builtin_fseek(state, 3, new_pargs);
  3775. }
  3776. qi_value_t *qi_pseudomethod_list_push(qi_state_t *state, qi_size_t pargc,
  3777. qi_list_t *pargs)
  3778. {
  3779. return qi_builtin_list_push(state, pargc, pargs);
  3780. }
  3781. qi_value_t *qi_pseudomethod_list_pop(qi_state_t *state, qi_size_t pargc,
  3782. qi_list_t *pargs)
  3783. {
  3784. return qi_builtin_list_pop(state, pargc, pargs);
  3785. }
  3786. qi_value_t *qi_pseudomethod_table_get(qi_state_t *state, qi_size_t pargc,
  3787. qi_list_t *pargs)
  3788. {
  3789. return qi_builtin_table_get(state, pargc, pargs);
  3790. }
  3791. #include "qistd.c"
  3792. static qi_bool is_little_endian()
  3793. {
  3794. unsigned int x = 1;
  3795. int e = (int)(((char *)&x)[0]);
  3796. return e ? true : false;
  3797. }
  3798. static void qi_state_setup(qi_state_t *state)
  3799. {
  3800. QI_HASH_SEED = time(NULL);
  3801. state->nil = qi_make_value(QI_NULL);
  3802. state->_true = qi_make_value(QI_BOOLEAN);
  3803. state->_true->value.boolean = true;
  3804. state->_false = qi_make_value(QI_BOOLEAN);
  3805. state->_false->value.boolean = false;
  3806. state->zero = qi_make_value(QI_NUMBER);
  3807. state->zero->value.number = 0;
  3808. state->one = qi_make_value(QI_NUMBER);
  3809. state->one->value.number = 1;
  3810. for (int i = 1; i <= 8; i++)
  3811. {
  3812. state->nnumbers[i - 1] = qi_make_value(QI_NUMBER);
  3813. state->nnumbers[i - 1]->value.number = -i;
  3814. }
  3815. state->numbers[0] = state->zero;
  3816. state->numbers[1] = state->one;
  3817. for (int i = 2; i < 256; i++)
  3818. {
  3819. state->numbers[i] = qi_make_value(QI_NUMBER);
  3820. state->numbers[i]->value.number = i;
  3821. }
  3822. state->intern_strs = qi_table_make();
  3823. state->intern_strs_mutex = qi_mutex_create();
  3824. for (int c = 1; c < 256; c++)
  3825. {
  3826. char buf[2];
  3827. buf[0] = c;
  3828. buf[1] = 0;
  3829. char *s = qi_strdup(buf);
  3830. qi_value_t *value = qi_make_value(QI_STRING);
  3831. value->value.string = s;
  3832. qi_table_set(state->intern_strs, s, value);
  3833. }
  3834. qi_table_set(state->intern_strs, __recerror_msg, qi_make_string(state, __recerror_msg));
  3835. state->pseudomethods = qi_table_make();
  3836. state->pseudomethods_mutex = qi_mutex_create();
  3837. state->nan = qi_make_value(QI_NUMBER);
  3838. state->nan->value.number = NAN;
  3839. state->infinity = qi_make_value(QI_NUMBER);
  3840. state->infinity->value.number = INFINITY;
  3841. state->ninfinity = qi_make_value(QI_NUMBER);
  3842. state->ninfinity->value.number = -INFINITY;
  3843. state->empty_string = qi_make_value(QI_STRING);
  3844. state->empty_string->value.string = qi_strdup("");
  3845. state->empty_bytes = qi_make_value(QI_BYTES);
  3846. state->empty_bytes->value.bytes = qi_malloc(sizeof(qi_bytes_t));
  3847. state->empty_bytes->value.bytes->data = (unsigned char *)qi_strdup("");
  3848. state->empty_bytes->value.bytes->size = 0;
  3849. state->empty_tuple = qi_make_value(QI_TUPLE);
  3850. state->empty_tuple->value.list = qi_list_make();
  3851. state->_stdin = qi_make_value(QI_FILE);
  3852. state->_stdin->value.file.fd = stdin;
  3853. strcpy(state->_stdin->value.file.mode, "r");
  3854. state->_stdin->value.file.is_open = true;
  3855. state->_stderr = qi_make_value(QI_FILE);
  3856. state->_stderr->value.file.fd = stderr;
  3857. strcpy(state->_stderr->value.file.mode, "w");
  3858. state->_stderr->value.file.is_open = true;
  3859. state->_stdout = qi_make_value(QI_FILE);
  3860. state->_stdout->value.file.fd = stdout;
  3861. strcpy(state->_stdout->value.file.mode, "w");
  3862. state->_stdout->value.file.is_open = true;
  3863. state->traps = qi_list_make();
  3864. state->exceptions = qi_list_make();
  3865. state->scopes = qi_list_make();
  3866. qi_new_sticky_scope(state);
  3867. state->calltrace = qi_list_make();
  3868. state->rlimit = QI_DEFAULT_RLIMIT;
  3869. qi_decl_const(state, "nil", state->nil);
  3870. qi_decl_const(state, "true", state->_true);
  3871. qi_decl_const(state, "false", state->_false);
  3872. qi_decl_const(state, "NAN", state->nan);
  3873. qi_decl_const(state, "INFINITY", state->infinity);
  3874. qi_decl_const(state, "__LIBQIRT",
  3875. qi_make_string(state, (char *)LIBQIRT_INFO));
  3876. qi_decl_const(state, "ENDIANNESS", qi_make_string(state, is_little_endian() ? "little" : "big"));
  3877. qi_decl_const(state, "STDIN", state->_stdin);
  3878. qi_decl_const(state, "STDERR", state->_stderr);
  3879. qi_decl_const(state, "STDOUT", state->_stdout);
  3880. qi_add_builtin(state, "print", 1, qi_builtin_print);
  3881. qi_add_builtin(state, "println", 1, qi_builtin_println);
  3882. qi_add_builtin(state, "set_meta_table", 2, qi_builtin_set_meta_table);
  3883. qi_add_builtin(state, "get_meta_table", 1, qi_builtin_get_meta_table);
  3884. qi_add_builtin(state, "has_meta_table", 1, qi_builtin_has_meta_table);
  3885. qi_add_builtin(state, "delete_meta_table", 1, qi_builtin_delete_meta_table);
  3886. qi_add_builtin(state, "has_method", 2, qi_builtin_has_method);
  3887. qi_add_builtin(state, "delete_method", 2, qi_builtin_delete_method);
  3888. qi_add_builtin(state, "set_pseudomethod", 2, qi_builtin_set_pseudomethod);
  3889. qi_add_builtin(state, "has_pseudomethod", 1, qi_builtin_has_pseudomethod);
  3890. qi_add_builtin(state, "unset_pseudomethod", 1, qi_builtin_unset_pseudomethod);
  3891. qi_add_builtin(state, "set_global", 2, qi_builtin_set_global);
  3892. qi_add_builtin(state, "unset_global", 1, qi_builtin_unset_global);
  3893. qi_add_builtin(state, "get_global", 1, qi_builtin_get_global);
  3894. qi_add_builtin(state, "get_globals", 0, qi_builtin_get_globals);
  3895. qi_add_builtin(state, "get_rlimit", 0, qi_builtin_get_rlimit);
  3896. qi_add_builtin(state, "set_rlimit", 1, qi_builtin_set_rlimit);
  3897. qi_add_builtin(state, "fopen", 2, qi_builtin_fopen);
  3898. qi_add_builtin(state, "fread", 2, qi_builtin_fread);
  3899. qi_add_builtin(state, "fgets", 2, qi_builtin_fgets);
  3900. qi_add_builtin(state, "fgetc", 1, qi_builtin_fgetc);
  3901. qi_add_builtin(state, "fputc", 2, qi_builtin_fputc);
  3902. qi_add_builtin(state, "fwrite", 2, qi_builtin_fwrite);
  3903. qi_add_builtin(state, "fputs", 2, qi_builtin_fputs);
  3904. qi_add_builtin(state, "fseek", 3, qi_builtin_fseek);
  3905. qi_add_builtin(state, "ftell", 1, qi_builtin_ftell);
  3906. qi_add_builtin(state, "fflush", 1, qi_builtin_fflush);
  3907. qi_add_builtin(state, "fclose", 1, qi_builtin_fclose);
  3908. qi_add_builtin(state, "fclosed", 1, qi_builtin_fclosed);
  3909. qi_add_builtin(state, "chr", 1, qi_builtin_chr);
  3910. qi_add_builtin(state, "ord", 1, qi_builtin_ord);
  3911. qi_add_builtin(state, "len", 1, qi_builtin_len);
  3912. qi_add_builtin(state, "type", 1, qi_builtin_type);
  3913. qi_add_builtin(state, "list_copy", 1, qi_builtin_list_copy);
  3914. qi_add_builtin(state, "list_push", 2, qi_builtin_list_push);
  3915. qi_add_builtin(state, "list_insert", 3, qi_builtin_list_insert);
  3916. qi_add_builtin(state, "list_delete", 2, qi_builtin_list_delete);
  3917. qi_add_builtin(state, "list_pop", 1, qi_builtin_list_pop);
  3918. qi_add_builtin(state, "table_copy", 1, qi_builtin_table_copy);
  3919. qi_add_builtin(state, "table_delete", 2, qi_builtin_table_delete);
  3920. qi_add_builtin(state, "table_get", 2, qi_builtin_table_get);
  3921. qi_add_builtin(state, "func_name", 1, qi_builtin_func_name);
  3922. qi_add_builtin(state, "func_argc", 1, qi_builtin_func_argc);
  3923. qi_add_builtin(state, "func_call", 2, qi_builtin_func_call);
  3924. qi_add_builtin(state, "data_tag", 1, qi_builtin_data_tag);
  3925. qi_add_builtin(state, "repr", 1, qi_builtin_repr);
  3926. qi_add_builtin(state, "str", 1, qi_builtin_str);
  3927. qi_add_builtin(state, "bool", 1, qi_builtin_bool);
  3928. qi_add_builtin(state, "num", 1, qi_builtin_num);
  3929. qi_add_builtin(state, "int", 1, qi_builtin_int);
  3930. qi_add_builtin(state, "bytes", 1, qi_builtin_bytes);
  3931. qi_add_builtin(state, "list", 1, qi_builtin_list);
  3932. qi_add_builtin(state, "tuple", 1, qi_builtin_tuple);
  3933. qi_add_builtin(state, "table", 1, qi_builtin_table);
  3934. qi_add_builtin(state, "ref", 1, qi_builtin_ref);
  3935. qi_add_builtin(state, "iter", 1, qi_builtin_iter);
  3936. qi_add_builtin(state, "iter_next", 1, qi_builtin_iter_next);
  3937. qi_add_builtin(state, "iter_end", 1, qi_builtin_iter_end);
  3938. qi_add_builtin(state, "deref", 1, qi_builtin_deref);
  3939. qi_add_builtin(state, "ref_set", 2, qi_builtin_ref_set);
  3940. qi_add_pseudomethod(state, "file.write", 0, qi_pseudomethod_file_write);
  3941. qi_add_pseudomethod(state, "file.read", 0, qi_pseudomethod_file_read);
  3942. qi_add_pseudomethod(state, "file.rewind", 0, qi_pseudomethod_file_rewind);
  3943. qi_add_pseudomethod(state, "list.push", 1, qi_pseudomethod_list_push);
  3944. qi_add_pseudomethod(state, "list.pop", 0, qi_pseudomethod_list_pop);
  3945. qi_add_pseudomethod(state, "table.get", 1, qi_pseudomethod_table_get);
  3946. qi_add_pseudomethod(state, "function.call", 1, qi_pseudomethod_func_call);
  3947. state->_debug_data = NULL;
  3948. qi_init_std(state);
  3949. state->listiterator = qi_get(state, "ListIterator");
  3950. state->typeerror = qi_get(state, "TypeError");
  3951. state->valueerror = qi_get(state, "ValueError");
  3952. state->indexerror = qi_get(state, "IndexError");
  3953. state->keyerror = qi_get(state, "KeyError");
  3954. {
  3955. state->recursionerror = qi_get(state, "RecursionError");
  3956. qi_list_t *pargs = qi_list_make_n(1);
  3957. qi_list_data(pargs, 0) = qi_make_string(state, __recerror_msg);
  3958. state->recursionerror = qi_call(state, state->recursionerror, pargs);
  3959. }
  3960. state->nameerror = qi_get(state, "NameError");
  3961. state->ioerror = qi_get(state, "IOError");
  3962. }
  3963. static void _qi_state_init(qi_state_t **state, qi_bool enable_debug)
  3964. {
  3965. GC_INIT();
  3966. GC_set_java_finalization(1);
  3967. *state = qi_malloc(sizeof(qi_state_t));
  3968. __debug_enabled = enable_debug;
  3969. __recerror_msg = qi_strdup("RecursionError: max. recursion depth reached");
  3970. qi_state_setup(*state);
  3971. __main_tid = pthread_self();
  3972. }
  3973. void qi_state_init(qi_state_t **state) { _qi_state_init(state, false); }
  3974. void qi_state_init_debug(qi_state_t **state) { _qi_state_init(state, true); }