qirt.c 126 KB

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