qirt.c 126 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267
  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_NUMBER && b->type == QI_BYTES)
  2227. {
  2228. for (qi_size_t i = 0; i < b->value.bytes->size; i++)
  2229. if (b->value.bytes->data[i] == (unsigned char)(a->value.number))
  2230. return true;
  2231. return false;
  2232. }
  2233. else if (b->type == QI_LIST)
  2234. {
  2235. LOCKED(b, {
  2236. qi_list_t *list = b->value.list;
  2237. if (qi_list_empty(list))
  2238. {
  2239. qi_mutex_unlock(b->mutex);
  2240. return false;
  2241. }
  2242. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  2243. if (_qi_equals(state, a, qi_list_data(list, i)))
  2244. {
  2245. qi_mutex_unlock(b->mutex);
  2246. return true;
  2247. }
  2248. });
  2249. return false;
  2250. }
  2251. else if (b->type == QI_TUPLE)
  2252. {
  2253. qi_list_t *list = b->value.list;
  2254. if (qi_list_empty(list))
  2255. return false;
  2256. for (qi_size_t i = 0; i < qi_list_length(list); i++)
  2257. if (_qi_equals(state, a, qi_list_data(list, i)))
  2258. return true;
  2259. return false;
  2260. }
  2261. else if (a->type == QI_STRING && b->type == QI_TABLE)
  2262. {
  2263. qi_bool res = false;
  2264. LOCKED(b, {
  2265. qi_table_t *table = b->value.table.table;
  2266. if (!qi_table_empty(table))
  2267. res = qi_table_has(table, a->value.string);
  2268. });
  2269. return res;
  2270. }
  2271. leave:
  2272. qi_typeerror(state, "unsupported operand types for in: %s and %s",
  2273. _qi_type(state, a), _qi_type(state, b));
  2274. return false;
  2275. }
  2276. qi_value_t *qi_add(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2277. {
  2278. qi_value_t *meta;
  2279. qi_bool fail = false;
  2280. if ((meta = qi_call_meta(state, &fail, a, "__add", 2, a, b)))
  2281. return meta;
  2282. else if (fail)
  2283. goto leave;
  2284. else if ((meta = qi_call_meta(state, &fail, b, "__add", 2, b, a)))
  2285. return meta;
  2286. if (fail)
  2287. goto leave;
  2288. if (a->type == QI_STRING && b->type == QI_STRING)
  2289. {
  2290. if (!*a->value.string && !*b->value.string)
  2291. return state->empty_string;
  2292. else if (!*a->value.string)
  2293. return b;
  2294. else if (!*b->value.string)
  2295. return a;
  2296. char *string =
  2297. qi_malloc(strlen(a->value.string) + strlen(b->value.string) + 1);
  2298. strcpy(string, a->value.string);
  2299. strcat(string, b->value.string);
  2300. return qi_make_string(state, string);
  2301. }
  2302. else if (a->type == QI_STRING && b->type == QI_NUMBER && *a->value.string &&
  2303. !a->value.string[1])
  2304. {
  2305. char buf[2];
  2306. buf[0] = *a->value.string + b->value.number;
  2307. buf[1] = 0;
  2308. return qi_make_string_copy(state, buf);
  2309. }
  2310. else if (a->type == QI_BYTES && b->type == QI_BYTES)
  2311. {
  2312. if (a->value.bytes->size == 0 && b->value.bytes->size == 0)
  2313. return state->empty_bytes;
  2314. else if (a->value.bytes->size == 0)
  2315. return b;
  2316. else if (b->value.bytes->size == 0)
  2317. return a;
  2318. qi_size_t size = a->value.bytes->size + b->value.bytes->size;
  2319. unsigned char *bytes = qi_malloc(size);
  2320. memcpy(bytes, a->value.bytes->data, a->value.bytes->size);
  2321. memcpy(bytes + a->value.bytes->size, b->value.bytes->data,
  2322. b->value.bytes->size);
  2323. return qi_make_bytes(state, bytes, size);
  2324. }
  2325. else if ((a->type == QI_LIST && b->type == QI_LIST) ||
  2326. (a->type == QI_TUPLE && b->type == QI_TUPLE))
  2327. {
  2328. if (a == state->empty_tuple && b == state->empty_tuple)
  2329. return state->empty_tuple;
  2330. else if (a == state->empty_tuple)
  2331. return b;
  2332. else if (b == state->empty_tuple)
  2333. return a;
  2334. qi_list_t *newlist = qi_list_make();
  2335. if (a->type == QI_LIST)
  2336. {
  2337. qi_mutex_lock(a->mutex);
  2338. qi_mutex_lock(b->mutex);
  2339. if (!a->value.list->length && !b->value.list->length)
  2340. {
  2341. qi_mutex_unlock(a->mutex);
  2342. qi_mutex_unlock(b->mutex);
  2343. return qi_make_list(state, newlist);
  2344. }
  2345. }
  2346. for (qi_size_t i = 0; i < qi_list_length(a->value.list); i++)
  2347. qi_list_push(newlist, qi_list_data(a->value.list, i));
  2348. if (a->type == QI_LIST)
  2349. qi_mutex_unlock(a->mutex);
  2350. for (qi_size_t i = 0; i < qi_list_length(b->value.list); i++)
  2351. qi_list_push(newlist, qi_list_data(b->value.list, i));
  2352. if (a->type == QI_LIST)
  2353. qi_mutex_unlock(b->mutex);
  2354. if (a->type == QI_TUPLE)
  2355. return qi_make_tuple(state, newlist);
  2356. return qi_make_list(state, newlist);
  2357. }
  2358. else if (a->type == QI_TABLE && b->type == QI_TABLE)
  2359. {
  2360. qi_table_t *newtable = qi_table_make();
  2361. qi_mutex_lock(a->mutex);
  2362. qi_mutex_lock(b->mutex);
  2363. qi_table_iterate(a->value.table.table,
  2364. { qi_table_set(newtable, entry.key, entry.value); });
  2365. qi_mutex_unlock(a->mutex);
  2366. qi_table_iterate(b->value.table.table,
  2367. { qi_table_set(newtable, entry.key, entry.value); });
  2368. qi_mutex_unlock(b->mutex);
  2369. return qi_make_table(state, newtable);
  2370. }
  2371. else if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2372. return qi_make_number(state, a->value.number + b->value.number);
  2373. leave:
  2374. qi_typeerror(state, "unsupported operand types for +: %s and %s",
  2375. _qi_type(state, a), _qi_type(state, b));
  2376. return NULL;
  2377. }
  2378. qi_value_t *qi_sub(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2379. {
  2380. qi_value_t *meta;
  2381. qi_bool fail = false;
  2382. if ((meta = qi_call_meta(state, &fail, a, "__sub", 2, a, b)))
  2383. return meta;
  2384. if (fail)
  2385. goto leave;
  2386. if (a->type == QI_STRING && b->type == QI_NUMBER && *a->value.string &&
  2387. !a->value.string[1])
  2388. {
  2389. char buf[2];
  2390. buf[0] = *a->value.string - b->value.number;
  2391. buf[1] = 0;
  2392. return qi_make_string_copy(state, buf);
  2393. }
  2394. else if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2395. return qi_make_number(state, a->value.number - b->value.number);
  2396. leave:
  2397. qi_typeerror(state, "unsupported operand types for -: %s and %s",
  2398. _qi_type(state, a), _qi_type(state, b));
  2399. return NULL;
  2400. }
  2401. qi_value_t *qi_mul(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2402. {
  2403. qi_value_t *meta;
  2404. qi_bool fail = false;
  2405. if ((meta = qi_call_meta(state, &fail, a, "__mul", 2, a, b)))
  2406. return meta;
  2407. else if (fail)
  2408. goto leave;
  2409. else if ((meta = qi_call_meta(state, &fail, b, "__mul", 2, b, a)))
  2410. return meta;
  2411. if (fail)
  2412. goto leave;
  2413. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2414. return qi_make_number(state, a->value.number * b->value.number);
  2415. else if (a->type == QI_STRING && b->type == QI_NUMBER)
  2416. {
  2417. qi_size_t n = (qi_size_t)fabs(b->value.number);
  2418. if (n < 1)
  2419. return state->empty_string;
  2420. else if (n == 1)
  2421. return a;
  2422. qi_buffer_t *buffer = qi_buffer_make();
  2423. for (qi_size_t i = 0; i < n; i++)
  2424. qi_buffer_append_str(buffer, a->value.string);
  2425. return qi_make_string(state, qi_buffer_read(buffer));
  2426. }
  2427. else if ((a->type == QI_LIST || a->type == QI_TUPLE) && b->type == QI_NUMBER)
  2428. {
  2429. qi_size_t n = (qi_size_t)fabs(b->value.number);
  2430. if (a->type == QI_TUPLE && n == 1)
  2431. return a;
  2432. if (a->type == QI_LIST)
  2433. qi_mutex_lock(a->mutex);
  2434. qi_size_t l = a->value.list->length;
  2435. qi_list_t *r = NULL;
  2436. if (l < 1 || n < 1)
  2437. {
  2438. if (a->type == QI_TUPLE)
  2439. return state->empty_tuple;
  2440. goto empty;
  2441. }
  2442. qi_size_t rl = l * n;
  2443. r = qi_list_make_n(rl);
  2444. for (qi_size_t i = 0, j = 0; i < rl; i++)
  2445. {
  2446. r->data[i] = a->value.list->data[j];
  2447. j++;
  2448. if (j >= l)
  2449. j = 0;
  2450. }
  2451. empty:
  2452. if (a->type == QI_LIST)
  2453. qi_mutex_unlock(a->mutex);
  2454. return a->type == QI_LIST ? qi_make_list(state, r) : qi_make_tuple(state, r);
  2455. }
  2456. else if (a->type == QI_BYTES && b->type == QI_NUMBER)
  2457. {
  2458. qi_size_t n = (qi_size_t)fabs(b->value.number);
  2459. if (n == 1)
  2460. return a;
  2461. else if (n < 1)
  2462. return state->empty_bytes;
  2463. qi_size_t l = a->value.bytes->size;
  2464. if (l < 1)
  2465. return state->empty_bytes;
  2466. qi_size_t rl = l * n;
  2467. unsigned char *r = qi_malloc_atomic(rl);
  2468. for (qi_size_t i = 0, j = 0; i < rl; i++)
  2469. {
  2470. r[i] = a->value.bytes->data[j];
  2471. j++;
  2472. if (j >= l)
  2473. j = 0;
  2474. }
  2475. return qi_make_bytes(state, r, rl);
  2476. }
  2477. leave:
  2478. qi_typeerror(state, "unsupported operand types for *: %s and %s",
  2479. _qi_type(state, a), _qi_type(state, b));
  2480. return NULL;
  2481. }
  2482. qi_value_t *qi_div(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2483. {
  2484. qi_value_t *meta;
  2485. qi_bool fail = false;
  2486. if ((meta = qi_call_meta(state, &fail, a, "__div", 2, a, b)))
  2487. return meta;
  2488. if (fail)
  2489. goto leave;
  2490. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2491. {
  2492. if (b->value.number == 0)
  2493. {
  2494. if (a->value.number == 0)
  2495. return state->nan;
  2496. return state->infinity;
  2497. }
  2498. return qi_make_number(state, a->value.number / b->value.number);
  2499. }
  2500. leave:
  2501. qi_typeerror(state, "unsupported operand types for /: %s and %s",
  2502. _qi_type(state, a), _qi_type(state, b));
  2503. return NULL;
  2504. }
  2505. qi_value_t *qi_idiv(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2506. {
  2507. qi_value_t *meta;
  2508. qi_bool fail = false;
  2509. if ((meta = qi_call_meta(state, &fail, a, "__idiv", 2, a, b)))
  2510. return meta;
  2511. if (fail)
  2512. goto leave;
  2513. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2514. {
  2515. if (b->value.number == 0)
  2516. {
  2517. if (a->value.number == 0)
  2518. return state->nan;
  2519. return state->infinity;
  2520. }
  2521. return qi_make_number(state, (long)(a->value.number / b->value.number));
  2522. }
  2523. leave:
  2524. qi_typeerror(state, "unsupported operand types for //: %s and %s",
  2525. _qi_type(state, a), _qi_type(state, b));
  2526. return NULL;
  2527. }
  2528. qi_value_t *qi_mod(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2529. {
  2530. qi_value_t *meta;
  2531. qi_bool fail = false;
  2532. if ((meta = qi_call_meta(state, &fail, a, "__mod", 2, a, b)))
  2533. return meta;
  2534. if (fail)
  2535. goto leave;
  2536. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2537. {
  2538. if (b->value.number == 0)
  2539. {
  2540. if (a->value.number == 0)
  2541. return state->nan;
  2542. return state->infinity;
  2543. }
  2544. return qi_make_number(state, fmod(a->value.number, b->value.number));
  2545. }
  2546. leave:
  2547. qi_typeerror(state, "unsupported operand types for %: %s and %s",
  2548. _qi_type(state, a), _qi_type(state, b));
  2549. return NULL;
  2550. }
  2551. qi_value_t *qi_pow(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2552. {
  2553. qi_value_t *meta;
  2554. qi_bool fail = false;
  2555. if ((meta = qi_call_meta(state, &fail, a, "__pow", 2, a, b)))
  2556. return meta;
  2557. if (fail)
  2558. goto leave;
  2559. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2560. return qi_make_number(state, powf(a->value.number, b->value.number));
  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_band(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, "__band", 2, a, b)))
  2571. return meta;
  2572. else if (fail)
  2573. goto leave;
  2574. else if ((meta = qi_call_meta(state, &fail, b, "__band", 2, b, a)))
  2575. return meta;
  2576. if (fail)
  2577. goto leave;
  2578. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2579. return qi_make_number(state,
  2580. (int)(a->value.number) & (int)(b->value.number));
  2581. leave:
  2582. qi_typeerror(state, "unsupported operand types for &: %s and %s",
  2583. _qi_type(state, a), _qi_type(state, b));
  2584. return NULL;
  2585. }
  2586. qi_value_t *qi_bor(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2587. {
  2588. qi_value_t *meta;
  2589. qi_bool fail = false;
  2590. if ((meta = qi_call_meta(state, &fail, a, "__bor", 2, a, b)))
  2591. return meta;
  2592. else if (fail)
  2593. goto leave;
  2594. else if ((meta = qi_call_meta(state, &fail, b, "__bor", 2, b, a)))
  2595. return meta;
  2596. if (fail)
  2597. goto leave;
  2598. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2599. return qi_make_number(state,
  2600. (int)(a->value.number) | (int)(b->value.number));
  2601. leave:
  2602. qi_typeerror(state, "unsupported operand types for |: %s and %s",
  2603. _qi_type(state, a), _qi_type(state, b));
  2604. return NULL;
  2605. }
  2606. qi_value_t *qi_xor(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2607. {
  2608. qi_value_t *meta;
  2609. qi_bool fail = false;
  2610. if ((meta = qi_call_meta(state, &fail, a, "__xor", 2, a, b)))
  2611. return meta;
  2612. else if (fail)
  2613. goto leave;
  2614. else if ((meta = qi_call_meta(state, &fail, b, "__xor", 2, b, a)))
  2615. return meta;
  2616. if (fail)
  2617. goto leave;
  2618. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2619. return qi_make_number(state,
  2620. (int)(a->value.number) ^ (int)(b->value.number));
  2621. leave:
  2622. qi_typeerror(state, "unsupported operand types for ^: %s and %s",
  2623. _qi_type(state, a), _qi_type(state, b));
  2624. return NULL;
  2625. }
  2626. qi_value_t *qi_shl(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2627. {
  2628. qi_value_t *meta;
  2629. qi_bool fail = false;
  2630. if ((meta = qi_call_meta(state, &fail, a, "__shl", 2, a, b)))
  2631. return meta;
  2632. if (fail)
  2633. goto leave;
  2634. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2635. return qi_make_number(state, (int)(a->value.number)
  2636. << (int)(b->value.number));
  2637. leave:
  2638. qi_typeerror(state, "unsupported operand types for <<: %s and %s",
  2639. _qi_type(state, a), _qi_type(state, b));
  2640. return NULL;
  2641. }
  2642. qi_value_t *qi_shr(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2643. {
  2644. qi_value_t *meta;
  2645. qi_bool fail = false;
  2646. if ((meta = qi_call_meta(state, &fail, a, "__shr", 2, a, b)))
  2647. return meta;
  2648. if (fail)
  2649. goto leave;
  2650. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2651. return qi_make_number(state,
  2652. (int)(a->value.number) >> (int)(b->value.number));
  2653. leave:
  2654. qi_typeerror(state, "unsupported operand types for >>: %s and %s",
  2655. _qi_type(state, a), _qi_type(state, b));
  2656. return NULL;
  2657. }
  2658. qi_bool _qi_lt(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2659. {
  2660. qi_value_t *meta;
  2661. qi_bool fail = false;
  2662. if ((meta = qi_call_meta(state, &fail, a, "__lt", 2, a, b)))
  2663. {
  2664. if (meta->type != QI_BOOLEAN)
  2665. qi_typeerror(state, "__lt returned non-boolean value (%s)",
  2666. _qi_type(state, meta));
  2667. return meta->value.boolean;
  2668. }
  2669. if (fail)
  2670. goto leave;
  2671. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2672. return a->value.number < b->value.number;
  2673. else if (a->type == QI_STRING && b->type == QI_STRING &&
  2674. (strlen(a->value.string) == strlen(b->value.string) == 1))
  2675. return a->value.string[0] < b->value.string[0];
  2676. leave:
  2677. qi_typeerror(state, "unsupported operand types for <: %s and %s",
  2678. _qi_type(state, a), _qi_type(state, b));
  2679. return false;
  2680. }
  2681. qi_bool _qi_gt(qi_state_t *state, qi_value_t *a, qi_value_t *b)
  2682. {
  2683. qi_value_t *meta;
  2684. qi_bool fail = false;
  2685. if ((meta = qi_call_meta(state, &fail, a, "__gt", 2, a, b)))
  2686. {
  2687. if (meta->type != QI_BOOLEAN)
  2688. qi_typeerror(state, "__gt returned non-boolean value (%s)",
  2689. _qi_type(state, meta));
  2690. return meta->value.boolean;
  2691. }
  2692. if (fail)
  2693. goto leave;
  2694. if (a->type == QI_NUMBER && b->type == QI_NUMBER)
  2695. return a->value.number > b->value.number;
  2696. else if (a->type == QI_STRING && b->type == QI_STRING &&
  2697. (strlen(a->value.string) == strlen(b->value.string) == 1))
  2698. return a->value.string[0] > b->value.string[0];
  2699. leave:
  2700. qi_typeerror(state, "unsupported operand types for >: %s and %s",
  2701. _qi_type(state, a), _qi_type(state, b));
  2702. return false;
  2703. }
  2704. qi_value_t *qi_negate(qi_state_t *state, qi_value_t *a)
  2705. {
  2706. qi_value_t *meta;
  2707. qi_bool fail = false;
  2708. if ((meta = qi_call_meta(state, &fail, a, "__negate", 1, a)))
  2709. return meta;
  2710. if (fail)
  2711. goto leave;
  2712. if (a->type == QI_NUMBER)
  2713. return qi_make_number(state, -a->value.number);
  2714. leave:
  2715. qi_typeerror(state, "unsupported operand type for unary -: %s",
  2716. _qi_type(state, a));
  2717. return NULL;
  2718. }
  2719. qi_value_t *qi_unary_plus(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, "__unary_plus", 1, a)))
  2724. return meta;
  2725. if (fail)
  2726. goto leave;
  2727. if (a->type == QI_NUMBER)
  2728. return a;
  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_bnot(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, "__bnot", 1, a)))
  2739. return meta;
  2740. if (fail)
  2741. goto leave;
  2742. if (a->type == QI_NUMBER)
  2743. return qi_make_number(state, ~(int)(a->value.number));
  2744. leave:
  2745. qi_typeerror(state, "unsupported operand type for unary ~: %s",
  2746. _qi_type(state, a));
  2747. return NULL;
  2748. }
  2749. static void qi_set_barrier(qi_state_t *state)
  2750. {
  2751. qi_scope_t *scope = qi_malloc(sizeof(qi_scope_t));
  2752. scope->scope = NULL;
  2753. scope->defers = NULL;
  2754. scope->is_barrier = true;
  2755. scope->mutex = NULL;
  2756. qi_list_push(state->scopes, scope);
  2757. }
  2758. static qi_state_t *qi_state_clone(qi_state_t *state)
  2759. {
  2760. qi_state_t *newstate = qi_malloc(sizeof(qi_state_t));
  2761. memcpy(newstate, state, sizeof(qi_state_t));
  2762. newstate->traps = qi_list_make();
  2763. newstate->exceptions = qi_list_make();
  2764. newstate->scopes = qi_list_copy(state->scopes);
  2765. qi_set_barrier(newstate);
  2766. newstate->calltrace = qi_list_copy(state->calltrace);
  2767. return newstate;
  2768. }
  2769. void qi_exit(qi_state_t *state, int code)
  2770. {
  2771. while (_qi_old_scope(state, true))
  2772. ;
  2773. qi_finalize();
  2774. exit(code);
  2775. }
  2776. static void *__thread_wrapper(void *_args)
  2777. {
  2778. qi_list_t *args = (qi_list_t *)_args;
  2779. qi_state_t *state = qi_list_index(args, 0);
  2780. qi_value_t *fn = qi_list_index(args, 1);
  2781. qi_list_t *pargs = qi_list_index(args, 2);
  2782. qi_value_t *value = qi_call(state, fn, qi_list_empty(pargs) ? NULL : pargs);
  2783. pthread_exit((void *)value);
  2784. return NULL;
  2785. }
  2786. void *qi_thread_create(qi_state_t *state, qi_value_t *fn, qi_list_t *args)
  2787. {
  2788. pthread_t *td = qi_malloc_atomic(sizeof(pthread_t));
  2789. qi_list_t *_args = qi_list_make();
  2790. qi_list_push(_args, qi_state_clone(state));
  2791. qi_list_push(_args, fn);
  2792. qi_list_push(_args, args);
  2793. pthread_create(td, NULL, __thread_wrapper, (void *)_args);
  2794. return (void *)td;
  2795. }
  2796. void qi_thread_exit(qi_state_t *state, qi_value_t *value)
  2797. {
  2798. if (!qi_thread_main())
  2799. while (qi_old_scope(state))
  2800. ;
  2801. if (!qi_thread_main())
  2802. pthread_exit((void *)value);
  2803. else
  2804. pthread_exit(NULL);
  2805. }
  2806. qi_bool qi_thread_main(void) { return pthread_self() == __main_tid; }
  2807. qi_value_t *qi_thread_join(qi_state_t *state, void *_td)
  2808. {
  2809. pthread_t *td = (pthread_t *)_td;
  2810. qi_value_t *ret = state->nil;
  2811. pthread_join(*td, (void *)&ret);
  2812. if (!ret)
  2813. return state->nil;
  2814. return ret;
  2815. }
  2816. void *qi_mutex_create(void)
  2817. {
  2818. pthread_mutex_t *mutex = qi_malloc_atomic(sizeof(pthread_mutex_t));
  2819. if (pthread_mutex_init(mutex, NULL) != 0)
  2820. return NULL;
  2821. return (void *)mutex;
  2822. }
  2823. void qi_mutex_destroy(void *mutex)
  2824. {
  2825. pthread_mutex_destroy((pthread_mutex_t *)mutex);
  2826. qi_free(mutex);
  2827. }
  2828. void qi_mutex_lock(void *mutex)
  2829. {
  2830. pthread_mutex_lock((pthread_mutex_t *)mutex);
  2831. }
  2832. qi_bool qi_mutex_trylock(void *mutex)
  2833. {
  2834. if (pthread_mutex_trylock((pthread_mutex_t *)mutex) == 0)
  2835. return true;
  2836. return false;
  2837. }
  2838. void qi_mutex_unlock(void *mutex)
  2839. {
  2840. pthread_mutex_unlock((pthread_mutex_t *)mutex);
  2841. }
  2842. void *qi_cond_create(void)
  2843. {
  2844. pthread_cond_t *cond = qi_malloc_atomic(sizeof(pthread_cond_t));
  2845. if (pthread_cond_init(cond, NULL) != 0)
  2846. return NULL;
  2847. return (void *)cond;
  2848. }
  2849. void qi_cond_destroy(void *cond)
  2850. {
  2851. pthread_cond_destroy((pthread_cond_t *)cond);
  2852. qi_free(cond);
  2853. }
  2854. void qi_cond_wait(void *cond, void *mutex)
  2855. {
  2856. pthread_cond_wait((pthread_cond_t *)cond, (pthread_mutex_t *)mutex);
  2857. }
  2858. void qi_cond_signal(void *cond) { pthread_cond_signal((pthread_cond_t *)cond); }
  2859. void qi_cond_broadcast(void *cond)
  2860. {
  2861. pthread_cond_broadcast((pthread_cond_t *)cond);
  2862. }
  2863. qi_value_t *qi_builtin_print(qi_state_t *state, qi_size_t pargc,
  2864. qi_list_t *pargs)
  2865. {
  2866. qi_bool first = true;
  2867. for (int i = 0; i < pargc; i++)
  2868. {
  2869. qi_value_t *a = qi_list_data(pargs, i);
  2870. if (first)
  2871. first = false;
  2872. else
  2873. fputc(' ', stdout);
  2874. fprintf(stdout, "%s", qi_show(state, a));
  2875. }
  2876. return state->nil;
  2877. }
  2878. qi_value_t *qi_builtin_println(qi_state_t *state, qi_size_t pargc,
  2879. qi_list_t *pargs)
  2880. {
  2881. qi_builtin_print(state, pargc, pargs);
  2882. fputc('\n', stdout);
  2883. return state->nil;
  2884. }
  2885. qi_value_t *qi_builtin_set_meta_table(qi_state_t *state, qi_size_t pargc,
  2886. qi_list_t *pargs)
  2887. {
  2888. qi_value_t *a = qi_list_data(pargs, 0);
  2889. qi_value_t *b = qi_list_data(pargs, 1);
  2890. if (a->type != QI_TABLE)
  2891. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2892. _qi_type(state, a));
  2893. if (b->type != QI_TABLE)
  2894. qi_typeerror(state, "expected second argument to be: table, but got: %s",
  2895. _qi_type(state, b));
  2896. LOCKED(a, { a->value.table.metatable = b; });
  2897. return a;
  2898. }
  2899. qi_value_t *qi_builtin_get_meta_table(qi_state_t *state, qi_size_t pargc,
  2900. qi_list_t *pargs)
  2901. {
  2902. qi_value_t *a = qi_list_data(pargs, 0);
  2903. if (a->type != QI_TABLE)
  2904. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2905. _qi_type(state, a));
  2906. qi_value_t *value;
  2907. LOCKED(a, { value = a->value.table.metatable; });
  2908. return value;
  2909. }
  2910. qi_value_t *qi_builtin_has_meta_table(qi_state_t *state, qi_size_t pargc,
  2911. qi_list_t *pargs)
  2912. {
  2913. qi_value_t *a = qi_list_data(pargs, 0);
  2914. if (a->type != QI_TABLE)
  2915. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2916. _qi_type(state, a));
  2917. qi_bool res = false;
  2918. LOCKED(a, { res = qi_has_metatable(a); });
  2919. return res ? state->_true : state->_false;
  2920. }
  2921. qi_value_t *qi_builtin_delete_meta_table(qi_state_t *state, qi_size_t pargc,
  2922. qi_list_t *pargs)
  2923. {
  2924. qi_value_t *a = qi_list_data(pargs, 0);
  2925. if (a->type != QI_TABLE)
  2926. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2927. _qi_type(state, a));
  2928. LOCKED(a, { a->value.table.metatable = state->nil; });
  2929. return state->nil;
  2930. }
  2931. qi_value_t *qi_builtin_has_method(qi_state_t *state, qi_size_t pargc,
  2932. qi_list_t *pargs)
  2933. {
  2934. qi_value_t *a = qi_list_data(pargs, 0);
  2935. qi_value_t *b = qi_list_data(pargs, 1);
  2936. if (a->type != QI_TABLE)
  2937. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2938. _qi_type(state, a));
  2939. if (b->type != QI_STRING)
  2940. qi_typeerror(state,
  2941. "expected second argument to be: string, but got: %s",
  2942. _qi_type(state, b));
  2943. qi_value_t *value;
  2944. qi_bool res = false;
  2945. LOCKED(a, {
  2946. res =
  2947. qi_has_metatable(a) &&
  2948. (value = qi_table_get(qi_get_metatable(a), b->value.string)) != NULL &&
  2949. value->type == QI_FUNCTION;
  2950. });
  2951. return res ? state->_true : state->_false;
  2952. }
  2953. qi_value_t *qi_builtin_delete_method(qi_state_t *state, qi_size_t pargc,
  2954. qi_list_t *pargs)
  2955. {
  2956. qi_value_t *a = qi_list_data(pargs, 0);
  2957. qi_value_t *b = qi_list_data(pargs, 1);
  2958. if (a->type != QI_TABLE)
  2959. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  2960. _qi_type(state, a));
  2961. if (b->type != QI_STRING)
  2962. qi_typeerror(state,
  2963. "expected second argument to be: string, but got: %s",
  2964. _qi_type(state, b));
  2965. LOCKED(a, {
  2966. if (qi_has_metatable(a))
  2967. if (!qi_table_delete(qi_get_metatable(a), b->value.string))
  2968. {
  2969. qi_mutex_unlock(a->mutex);
  2970. qi_throw_class(state, state->keyerror, "%s", b->value.string);
  2971. }
  2972. });
  2973. return state->nil;
  2974. }
  2975. qi_value_t *qi_builtin_set_pseudomethod(qi_state_t *state, qi_size_t pargc,
  2976. qi_list_t *pargs)
  2977. {
  2978. qi_value_t *a = qi_list_data(pargs, 0);
  2979. qi_value_t *b = qi_list_data(pargs, 1);
  2980. if (a->type != QI_STRING)
  2981. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  2982. _qi_type(state, a));
  2983. if (b->type != QI_FUNCTION)
  2984. qi_typeerror(state,
  2985. "expected second argument to be: function, but got: %s",
  2986. _qi_type(state, b));
  2987. char *name = a->value.string;
  2988. qi_value_t *method = qi_make_function(state, name, b->value.function.pargc,
  2989. b->value.function.handle, NULL);
  2990. method->value.function.is_pm = true;
  2991. qi_mutex_lock(state->pseudomethods_mutex);
  2992. qi_table_set(state->pseudomethods, name, method);
  2993. qi_mutex_unlock(state->pseudomethods_mutex);
  2994. return method;
  2995. }
  2996. qi_value_t *qi_builtin_has_pseudomethod(qi_state_t *state, qi_size_t pargc,
  2997. qi_list_t *pargs)
  2998. {
  2999. qi_value_t *a = qi_list_data(pargs, 0);
  3000. if (a->type != QI_STRING)
  3001. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3002. _qi_type(state, a));
  3003. qi_mutex_lock(state->pseudomethods_mutex);
  3004. qi_bool res = qi_table_has(state->pseudomethods, a->value.string);
  3005. qi_mutex_unlock(state->pseudomethods_mutex);
  3006. return res ? state->_true : state->_false;
  3007. }
  3008. qi_value_t *qi_builtin_unset_pseudomethod(qi_state_t *state, qi_size_t pargc,
  3009. qi_list_t *pargs)
  3010. {
  3011. qi_value_t *a = qi_list_data(pargs, 0);
  3012. if (a->type != QI_STRING)
  3013. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3014. _qi_type(state, a));
  3015. qi_mutex_lock(state->pseudomethods_mutex);
  3016. qi_bool res = qi_table_delete(state->pseudomethods, a->value.string);
  3017. qi_mutex_unlock(state->pseudomethods_mutex);
  3018. if (!res)
  3019. qi_typeerror(state, "no such pseudomethod: '%s'", a->value.string);
  3020. return state->nil;
  3021. }
  3022. qi_value_t *qi_builtin_set_global(qi_state_t *state, qi_size_t pargc,
  3023. qi_list_t *pargs)
  3024. {
  3025. qi_value_t *a = qi_list_data(pargs, 0);
  3026. qi_value_t *b = qi_list_data(pargs, 1);
  3027. qi_value_t *c = qi_list_data(pargs, 2);
  3028. if (!c)
  3029. c = state->zero;
  3030. else if (c->type != QI_NUMBER)
  3031. qi_typeerror(state, "expected third argument to be: number, but got: %s",
  3032. _qi_type(state, c));
  3033. if (a->type != QI_STRING)
  3034. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3035. _qi_type(state, a));
  3036. char *name = a->value.string;
  3037. qi_symbol_t *symbol;
  3038. qi_size_t offset = (qi_size_t)(c->value.number);
  3039. qi_scope_t *scope;
  3040. if (offset > 0)
  3041. {
  3042. scope = qi_list_index(state->scopes, -((qi_ssize_t)offset));
  3043. if (!scope)
  3044. qi_throw_class(state, state->valueerror, "illegal scope index: %s",
  3045. qi_repr(state, c, true));
  3046. }
  3047. else
  3048. scope = qi_list_first(state->scopes);
  3049. qi_mutex_lock(scope->mutex);
  3050. symbol = qi_table_get(scope->scope, name);
  3051. if (symbol)
  3052. {
  3053. if (symbol->is_constant)
  3054. {
  3055. qi_mutex_unlock(scope->mutex);
  3056. qi_typeerror(state, "redeclaration of constant symbol: '%s'", name);
  3057. }
  3058. qi_value_t *ret = symbol->value;
  3059. symbol->value = b;
  3060. qi_mutex_unlock(scope->mutex);
  3061. return ret;
  3062. }
  3063. symbol = qi_malloc(sizeof(qi_symbol_t));
  3064. symbol->value = b;
  3065. symbol->is_constant = false;
  3066. qi_table_set(scope->scope, name, symbol);
  3067. qi_mutex_unlock(scope->mutex);
  3068. return b;
  3069. }
  3070. qi_value_t *qi_builtin_unset_global(qi_state_t *state, qi_size_t pargc,
  3071. qi_list_t *pargs)
  3072. {
  3073. qi_value_t *a = qi_list_data(pargs, 0);
  3074. qi_value_t *b = qi_list_data(pargs, 1);
  3075. if (!b)
  3076. b = state->zero;
  3077. else if (b->type != QI_NUMBER)
  3078. qi_typeerror(state,
  3079. "expected second argument to be: number, but got: %s",
  3080. _qi_type(state, b));
  3081. if (a->type != QI_STRING)
  3082. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3083. _qi_type(state, a));
  3084. char *name = a->value.string;
  3085. qi_symbol_t *symbol;
  3086. qi_size_t offset = (qi_size_t)(b->value.number);
  3087. qi_scope_t *scope;
  3088. if (offset > 0)
  3089. {
  3090. scope = qi_list_index(state->scopes, -((qi_ssize_t)offset));
  3091. if (!scope)
  3092. qi_throw_class(state, state->valueerror, "illegal scope index: %s",
  3093. qi_repr(state, b, true));
  3094. }
  3095. else
  3096. scope = qi_list_first(state->scopes);
  3097. qi_mutex_lock(scope->mutex);
  3098. symbol = qi_table_get(scope->scope, name);
  3099. if (symbol)
  3100. {
  3101. if (symbol->is_constant)
  3102. {
  3103. qi_mutex_unlock(scope->mutex);
  3104. qi_typeerror(state, "cannot unset constant symbol: '%s'", name);
  3105. }
  3106. qi_value_t *ret = symbol->value;
  3107. qi_table_delete(scope->scope, name);
  3108. qi_mutex_unlock(scope->mutex);
  3109. return ret;
  3110. }
  3111. qi_mutex_unlock(scope->mutex);
  3112. return state->nil;
  3113. }
  3114. qi_value_t *qi_builtin_get_global(qi_state_t *state, qi_size_t pargc,
  3115. qi_list_t *pargs)
  3116. {
  3117. qi_value_t *a = qi_list_data(pargs, 0);
  3118. qi_value_t *b = qi_list_data(pargs, 1);
  3119. if (!b)
  3120. b = state->zero;
  3121. else if (b->type != QI_NUMBER)
  3122. qi_typeerror(state,
  3123. "expected second argument to be: number, but got: %s",
  3124. _qi_type(state, b));
  3125. if (a->type != QI_STRING)
  3126. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3127. _qi_type(state, a));
  3128. char *name = a->value.string;
  3129. qi_value_t *ret = state->nil;
  3130. qi_size_t offset = (qi_size_t)(b->value.number);
  3131. qi_scope_t *scope;
  3132. if (offset > 0)
  3133. {
  3134. scope = qi_list_index(state->scopes, -((qi_ssize_t)offset));
  3135. if (!scope)
  3136. qi_throw_class(state, state->valueerror, "illegal scope index: %s",
  3137. qi_repr(state, b, true));
  3138. }
  3139. else
  3140. scope = qi_list_first(state->scopes);
  3141. qi_mutex_lock(scope->mutex);
  3142. qi_symbol_t *symbol = qi_table_get(scope->scope, name);
  3143. if (symbol)
  3144. ret = symbol->value;
  3145. qi_mutex_unlock(scope->mutex);
  3146. return ret;
  3147. }
  3148. qi_value_t *qi_builtin_get_globals(qi_state_t *state, qi_size_t pargc,
  3149. qi_list_t *pargs)
  3150. {
  3151. qi_table_t *table = qi_table_make();
  3152. qi_scope_t *scope = qi_list_first(state->scopes);
  3153. qi_mutex_lock(scope->mutex);
  3154. qi_table_iterate(scope->scope, {
  3155. qi_symbol_t *symbol = entry.value;
  3156. qi_table_set(table, entry.key, symbol->value);
  3157. });
  3158. qi_mutex_unlock(scope->mutex);
  3159. return qi_make_table(state, table);
  3160. }
  3161. qi_value_t *qi_builtin_get_rlimit(qi_state_t *state, qi_size_t pargc,
  3162. qi_list_t *pargs)
  3163. {
  3164. return qi_make_number(state, state->rlimit);
  3165. }
  3166. qi_value_t *qi_builtin_set_rlimit(qi_state_t *state, qi_size_t pargc,
  3167. qi_list_t *pargs)
  3168. {
  3169. qi_value_t *a = qi_list_data(pargs, 0);
  3170. if (a->type != QI_NUMBER)
  3171. qi_typeerror(state, "expected first argument to be: number, but got: %s",
  3172. _qi_type(state, a));
  3173. state->rlimit = (size_t)a->value.number;
  3174. return state->nil;
  3175. }
  3176. #define is_valid_mode(fmod) \
  3177. (strcmp((fmod), "w") == 0 || strcmp((fmod), "r") == 0 || \
  3178. strcmp((fmod), "a") == 0 || strcmp((fmod), "a+") == 0 || \
  3179. strcmp((fmod), "w+") == 0 || strcmp((fmod), "r+") == 0)
  3180. qi_value_t *qi_builtin_fopen(qi_state_t *state, qi_size_t pargc,
  3181. qi_list_t *pargs)
  3182. {
  3183. qi_value_t *a = qi_list_data(pargs, 0);
  3184. qi_value_t *b = qi_list_data(pargs, 1);
  3185. if (a->type != QI_STRING)
  3186. qi_typeerror(state, "expected first argument to be: string, but got: %s",
  3187. _qi_type(state, a));
  3188. if (b->type != QI_STRING)
  3189. qi_typeerror(state,
  3190. "expected second argument to be: string, but got: %s",
  3191. _qi_type(state, b));
  3192. if (!is_valid_mode(b->value.string))
  3193. qi_throw_class(state, state->valueerror, "invalid mode: %s", qi_repr(state, b, true));
  3194. char mode[4];
  3195. snprintf(mode, sizeof(mode), "%sb", b->value.string);
  3196. FILE *file = fopen(a->value.string, mode);
  3197. if (!file)
  3198. qi_throw_class(state, state->ioerror, "cannot open file: %s", qi_repr(state, a, true));
  3199. return qi_make_file(state, file, b->value.string);
  3200. }
  3201. static unsigned char *_read_stdin(qi_size_t *count)
  3202. {
  3203. *count = 0;
  3204. qi_buffer_t *buffer = qi_buffer_make();
  3205. int c;
  3206. while ((c = fgetc(stdin)) != EOF)
  3207. qi_buffer_append(buffer, c), (*count)++;
  3208. return (unsigned char *)qi_buffer_read(buffer);
  3209. }
  3210. #define is_valid_read_mode(fmod) \
  3211. (strcmp((fmod), "a+") == 0 || strcmp((fmod), "r") == 0 || \
  3212. strcmp((fmod), "w+") == 0 || strcmp((fmod), "r+") == 0)
  3213. qi_value_t *qi_builtin_fread(qi_state_t *state, qi_size_t pargc,
  3214. qi_list_t *pargs)
  3215. {
  3216. qi_value_t *a = qi_list_data(pargs, 0);
  3217. qi_value_t *b = qi_list_data(pargs, 1);
  3218. if (a->type != QI_FILE)
  3219. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3220. _qi_type(state, a));
  3221. if (b->type != QI_NUMBER)
  3222. qi_typeerror(state,
  3223. "expected second argument to be: number, but got: %s",
  3224. _qi_type(state, b));
  3225. if (!a->value.file.is_open)
  3226. qi_throw_class(state, state->ioerror, "file is already closed");
  3227. if (!is_valid_read_mode(a->value.file.mode))
  3228. qi_throw_class(state, state->ioerror, "file is not readable");
  3229. qi_size_t size;
  3230. if (b->value.number < 0)
  3231. {
  3232. if (a->value.file.fd == stdin)
  3233. {
  3234. qi_size_t count;
  3235. unsigned char *data = _read_stdin(&count);
  3236. return qi_make_bytes(state, data, count);
  3237. }
  3238. fseek(a->value.file.fd, 0, SEEK_END);
  3239. size = ftell(a->value.file.fd);
  3240. fseek(a->value.file.fd, 0, SEEK_SET);
  3241. }
  3242. else
  3243. size = (qi_size_t)(b->value.number);
  3244. unsigned char *data = qi_malloc_atomic(size);
  3245. qi_size_t count = fread(data, sizeof(unsigned char), size, a->value.file.fd);
  3246. return qi_make_bytes(state, data, count);
  3247. }
  3248. qi_value_t *qi_builtin_fgets(qi_state_t *state, qi_size_t pargc,
  3249. qi_list_t *pargs)
  3250. {
  3251. qi_value_t *a = qi_list_data(pargs, 0);
  3252. qi_value_t *b = qi_list_data(pargs, 1);
  3253. if (a->type != QI_FILE)
  3254. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3255. _qi_type(state, a));
  3256. if (b->type != QI_NUMBER)
  3257. qi_typeerror(state,
  3258. "expected second argument to be: number, but got: %s",
  3259. _qi_type(state, b));
  3260. if (!a->value.file.is_open)
  3261. qi_throw_class(state, state->ioerror, "file is already closed");
  3262. if (!is_valid_read_mode(a->value.file.mode))
  3263. qi_throw_class(state, state->ioerror, "file is not readable");
  3264. qi_size_t size = (qi_size_t)(b->value.number);
  3265. char *data = qi_malloc(size + 1);
  3266. if (!fgets(data, size, a->value.file.fd))
  3267. qi_throw_class(state, state->ioerror, "reached EOF");
  3268. return qi_make_string(state, data);
  3269. }
  3270. qi_value_t *qi_builtin_fgetc(qi_state_t *state, qi_size_t pargc,
  3271. qi_list_t *pargs)
  3272. {
  3273. qi_value_t *a = qi_list_data(pargs, 0);
  3274. if (a->type != QI_FILE)
  3275. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3276. _qi_type(state, a));
  3277. if (!a->value.file.is_open)
  3278. qi_throw_class(state, state->ioerror, "file is already closed");
  3279. if (!is_valid_read_mode(a->value.file.mode))
  3280. qi_throw_class(state, state->ioerror, "file is not readable");
  3281. int c = fgetc(a->value.file.fd);
  3282. return qi_make_number(state, c);
  3283. }
  3284. #define is_valid_write_mode(fmod) \
  3285. (strcmp((fmod), "a") == 0 || strcmp((fmod), "a+") == 0 || \
  3286. strcmp((fmod), "w") == 0 || strcmp((fmod), "w+") == 0 || \
  3287. strcmp((fmod), "r+") == 0)
  3288. qi_value_t *qi_builtin_fputc(qi_state_t *state, qi_size_t pargc,
  3289. qi_list_t *pargs)
  3290. {
  3291. qi_value_t *a = qi_list_data(pargs, 0);
  3292. qi_value_t *b = qi_list_data(pargs, 1);
  3293. if (a->type != QI_FILE)
  3294. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3295. _qi_type(state, a));
  3296. if (b->type != QI_NUMBER &&
  3297. (b->type != QI_STRING || strlen(b->value.string) != 1))
  3298. qi_typeerror(state,
  3299. "expected second argument to be: number or string of "
  3300. "length 1, but got: %s",
  3301. _qi_type(state, b));
  3302. if (!a->value.file.is_open)
  3303. qi_throw_class(state, state->ioerror, "file is already closed");
  3304. if (!is_valid_write_mode(a->value.file.mode))
  3305. qi_throw_class(state, state->ioerror, "file is not writeable");
  3306. fputc(b->type == QI_NUMBER ? b->value.number : b->value.string[0],
  3307. a->value.file.fd);
  3308. return state->nil;
  3309. }
  3310. qi_value_t *qi_builtin_fwrite(qi_state_t *state, qi_size_t pargc,
  3311. qi_list_t *pargs)
  3312. {
  3313. qi_value_t *a = qi_list_data(pargs, 0);
  3314. qi_value_t *b = qi_list_data(pargs, 1);
  3315. if (a->type != QI_FILE)
  3316. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3317. _qi_type(state, a));
  3318. if (b->type == QI_STRING || b->type == QI_LIST)
  3319. b = qi_to_bytes(state, b);
  3320. if (b->type != QI_BYTES)
  3321. qi_typeerror(state, "expected second argument to be: bytes, but got: %s",
  3322. _qi_type(state, b));
  3323. if (!a->value.file.is_open)
  3324. qi_throw_class(state, state->ioerror, "file is already closed");
  3325. if (!is_valid_write_mode(a->value.file.mode))
  3326. qi_throw_class(state, state->ioerror, "file is not writeable");
  3327. qi_size_t count = fwrite(b->value.bytes->data, sizeof(unsigned char),
  3328. b->value.bytes->size, a->value.file.fd);
  3329. return qi_make_number(state, count);
  3330. }
  3331. qi_value_t *qi_builtin_fputs(qi_state_t *state, qi_size_t pargc,
  3332. qi_list_t *pargs)
  3333. {
  3334. qi_value_t *a = qi_list_data(pargs, 0);
  3335. qi_value_t *b = qi_list_data(pargs, 1);
  3336. if (a->type != QI_FILE)
  3337. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3338. _qi_type(state, a));
  3339. if (b->type != QI_STRING)
  3340. qi_typeerror(state,
  3341. "expected second argument to be: string, but got: %s",
  3342. _qi_type(state, b));
  3343. if (!a->value.file.is_open)
  3344. qi_throw_class(state, state->ioerror, "file is already closed");
  3345. if (!is_valid_write_mode(a->value.file.mode))
  3346. qi_throw_class(state, state->ioerror, "file is not writeable");
  3347. qi_size_t count = fputs(b->value.string, a->value.file.fd);
  3348. return qi_make_number(state, count);
  3349. }
  3350. qi_value_t *qi_builtin_fseek(qi_state_t *state, qi_size_t pargc,
  3351. qi_list_t *pargs)
  3352. {
  3353. qi_value_t *a = qi_list_data(pargs, 0);
  3354. qi_value_t *b = qi_list_data(pargs, 1);
  3355. qi_value_t *c = qi_list_data(pargs, 2);
  3356. if (a->type != QI_FILE)
  3357. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3358. _qi_type(state, a));
  3359. if (b->type != QI_NUMBER)
  3360. qi_typeerror(state,
  3361. "expected second argument to be: number, but got: %s",
  3362. _qi_type(state, b));
  3363. if (c->type != QI_NUMBER)
  3364. qi_typeerror(state, "expected third argument to be: number, but got: %s",
  3365. _qi_type(state, c));
  3366. if (!a->value.file.is_open)
  3367. qi_throw_class(state, state->ioerror, "file is already closed");
  3368. qi_size_t offset = (qi_size_t)(b->value.number);
  3369. unsigned int origin = (unsigned int)(c->value.number);
  3370. fseek(a->value.file.fd, offset, origin);
  3371. return state->nil;
  3372. }
  3373. qi_value_t *qi_builtin_ftell(qi_state_t *state, qi_size_t pargc,
  3374. qi_list_t *pargs)
  3375. {
  3376. qi_value_t *a = qi_list_data(pargs, 0);
  3377. if (a->type != QI_FILE)
  3378. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3379. _qi_type(state, a));
  3380. if (!a->value.file.is_open)
  3381. qi_throw_class(state, state->ioerror, "file is already closed");
  3382. qi_size_t position = ftell(a->value.file.fd);
  3383. return qi_make_number(state, position);
  3384. }
  3385. qi_value_t *qi_builtin_fflush(qi_state_t *state, qi_size_t pargc,
  3386. qi_list_t *pargs)
  3387. {
  3388. qi_value_t *a = qi_list_data(pargs, 0);
  3389. if (a->type != QI_FILE)
  3390. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3391. _qi_type(state, a));
  3392. if (!a->value.file.is_open)
  3393. qi_throw_class(state, state->ioerror, "file is already closed");
  3394. fflush(a->value.file.fd);
  3395. return state->nil;
  3396. }
  3397. qi_value_t *qi_builtin_fclose(qi_state_t *state, qi_size_t pargc,
  3398. qi_list_t *pargs)
  3399. {
  3400. qi_value_t *a = qi_list_data(pargs, 0);
  3401. if (a->type != QI_FILE)
  3402. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3403. _qi_type(state, a));
  3404. if (!a->value.file.is_open)
  3405. qi_throw_class(state, state->ioerror, "file is already closed");
  3406. if (a->value.file.fd == stdin || a->value.file.fd == stderr ||
  3407. a->value.file.fd == stdout)
  3408. qi_throw_class(state, state->ioerror, "cannot close standard streams");
  3409. fclose(a->value.file.fd);
  3410. a->value.file.is_open = false;
  3411. return a;
  3412. }
  3413. qi_value_t *qi_builtin_fclosed(qi_state_t *state, qi_size_t pargc,
  3414. qi_list_t *pargs)
  3415. {
  3416. qi_value_t *a = qi_list_data(pargs, 0);
  3417. if (a->type != QI_FILE)
  3418. qi_typeerror(state, "expected first argument to be: file, but got: %s",
  3419. _qi_type(state, a));
  3420. return a->value.file.is_open ? state->_false : state->_true;
  3421. }
  3422. qi_value_t *qi_builtin_chr(qi_state_t *state, qi_size_t pargc,
  3423. qi_list_t *pargs)
  3424. {
  3425. qi_value_t *a = qi_list_data(pargs, 0);
  3426. if (a->type != QI_NUMBER)
  3427. qi_typeerror(state, "expected first argument to be: number, but got: %s",
  3428. _qi_type(state, a));
  3429. unsigned char c = (int)(a->value.number);
  3430. if (c == 0)
  3431. qi_throw_class(state, state->valueerror, "illegal character code");
  3432. return qi_make_char(state, c);
  3433. }
  3434. qi_value_t *qi_builtin_ord(qi_state_t *state, qi_size_t pargc,
  3435. qi_list_t *pargs)
  3436. {
  3437. qi_value_t *a = qi_list_data(pargs, 0);
  3438. if (a->type != QI_STRING || strlen(a->value.string) != 1)
  3439. qi_throw_class(
  3440. state, state->typeerror, "expected first argument to be: string of length 1, but got: %s",
  3441. _qi_type(state, a));
  3442. return qi_make_number(state, a->value.string[0]);
  3443. }
  3444. qi_value_t *qi_builtin_len(qi_state_t *state, qi_size_t pargc,
  3445. qi_list_t *pargs)
  3446. {
  3447. qi_value_t *a = qi_list_data(pargs, 0);
  3448. return qi_length(state, a);
  3449. }
  3450. qi_value_t *qi_builtin_type(qi_state_t *state, qi_size_t pargc,
  3451. qi_list_t *pargs)
  3452. {
  3453. qi_value_t *a = qi_list_data(pargs, 0);
  3454. return qi_type(state, a);
  3455. }
  3456. qi_value_t *qi_builtin_list_copy(qi_state_t *state, qi_size_t pargc,
  3457. qi_list_t *pargs)
  3458. {
  3459. qi_value_t *a = qi_list_data(pargs, 0);
  3460. if (a->type != QI_LIST)
  3461. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3462. _qi_type(state, a));
  3463. qi_list_t *list;
  3464. LOCKED(a, { list = qi_list_copy(a->value.list); });
  3465. return qi_make_list(state, list);
  3466. }
  3467. qi_value_t *qi_builtin_list_push(qi_state_t *state, qi_size_t pargc,
  3468. qi_list_t *pargs)
  3469. {
  3470. qi_value_t *a = qi_list_data(pargs, 0);
  3471. qi_value_t *b = qi_list_data(pargs, 1);
  3472. if (a->type != QI_LIST)
  3473. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3474. _qi_type(state, a));
  3475. LOCKED(a, { qi_list_push(a->value.list, b); });
  3476. return a;
  3477. }
  3478. qi_value_t *qi_builtin_list_insert(qi_state_t *state, qi_size_t pargc,
  3479. qi_list_t *pargs)
  3480. {
  3481. qi_value_t *a = qi_list_data(pargs, 0);
  3482. qi_value_t *b = qi_list_data(pargs, 1);
  3483. qi_value_t *c = qi_list_data(pargs, 2);
  3484. if (a->type != QI_LIST)
  3485. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3486. _qi_type(state, a));
  3487. if (b->type != QI_NUMBER)
  3488. qi_typeerror(state,
  3489. "expected second argument to be: number, but got: %s",
  3490. _qi_type(state, b));
  3491. qi_bool res = false;
  3492. LOCKED(a, { res = qi_list_insert(a->value.list, b->value.number, c); });
  3493. if (!res)
  3494. qi_throw_class(state, state->indexerror, "%s",
  3495. qi_repr(state, b, true));
  3496. return a;
  3497. }
  3498. qi_value_t *qi_builtin_list_delete(qi_state_t *state, qi_size_t pargc,
  3499. qi_list_t *pargs)
  3500. {
  3501. qi_value_t *a = qi_list_data(pargs, 0);
  3502. qi_value_t *b = qi_list_data(pargs, 1);
  3503. if (a->type != QI_LIST)
  3504. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3505. _qi_type(state, a));
  3506. if (b->type != QI_NUMBER)
  3507. qi_typeerror(state,
  3508. "expected second argument to be: number, but got: %s",
  3509. _qi_type(state, b));
  3510. qi_del(state, a, b);
  3511. return a;
  3512. }
  3513. qi_value_t *qi_builtin_list_pop(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. if (a->type != QI_LIST)
  3518. qi_typeerror(state, "expected first argument to be: list, but got: %s",
  3519. _qi_type(state, a));
  3520. qi_value_t *value = NULL;
  3521. LOCKED(a, { value = qi_list_pop(a->value.list); });
  3522. if (!value)
  3523. qi_throw_class(state, state->indexerror, "pop from empty list");
  3524. return value;
  3525. }
  3526. qi_value_t *qi_copy_object(qi_state_t *state, qi_value_t *value)
  3527. {
  3528. if (value->type != QI_TABLE)
  3529. return value;
  3530. qi_value_t *newvalue;
  3531. LOCKED(value, {
  3532. qi_table_t *table = qi_table_copy(value->value.table.table);
  3533. newvalue = qi_make_table(state, table);
  3534. if (qi_has_metatable(value) && newvalue->value.table.metatable != value)
  3535. newvalue->value.table.metatable =
  3536. qi_copy_object(state, newvalue->value.table.metatable);
  3537. });
  3538. return newvalue;
  3539. }
  3540. qi_value_t *qi_builtin_table_copy(qi_state_t *state, qi_size_t pargc,
  3541. qi_list_t *pargs)
  3542. {
  3543. qi_value_t *a = qi_list_data(pargs, 0);
  3544. if (a->type != QI_TABLE)
  3545. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  3546. _qi_type(state, a));
  3547. return qi_copy_object(state, a);
  3548. }
  3549. qi_value_t *qi_builtin_table_delete(qi_state_t *state, qi_size_t pargc,
  3550. qi_list_t *pargs)
  3551. {
  3552. qi_value_t *a = qi_list_data(pargs, 0);
  3553. qi_value_t *b = qi_list_data(pargs, 1);
  3554. if (a->type != QI_TABLE)
  3555. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  3556. _qi_type(state, a));
  3557. if (b->type != QI_STRING)
  3558. b = qi_to_string(state, b);
  3559. qi_del(state, a, b);
  3560. return a;
  3561. }
  3562. qi_value_t *qi_builtin_table_get(qi_state_t *state, qi_size_t pargc,
  3563. qi_list_t *pargs)
  3564. {
  3565. qi_value_t *a = qi_list_data(pargs, 0);
  3566. qi_value_t *b = qi_list_data(pargs, 1);
  3567. qi_value_t *c = pargc >= 3 ? qi_list_data(pargs, 2) : state->nil;
  3568. if (a->type != QI_TABLE)
  3569. qi_typeerror(state, "expected first argument to be: table, but got: %s",
  3570. _qi_type(state, a));
  3571. if (b->type != QI_STRING)
  3572. b = qi_to_string(state, b);
  3573. LOCKED(a, {
  3574. qi_value_t *tmp = NULL;
  3575. if ((tmp = qi_table_get(a->value.table.table, b->value.string)))
  3576. c = tmp;
  3577. });
  3578. return c;
  3579. }
  3580. qi_value_t *qi_builtin_func_call(qi_state_t *state, qi_size_t pargc,
  3581. qi_list_t *pargs)
  3582. {
  3583. qi_value_t *a = qi_list_data(pargs, 0);
  3584. qi_value_t *b = qi_list_data(pargs, 1);
  3585. if (a->type != QI_FUNCTION)
  3586. qi_typeerror(state,
  3587. "expected first argument to be: function, but got: %s",
  3588. _qi_type(state, a));
  3589. if (b->type != QI_LIST && b->type != QI_TUPLE)
  3590. qi_typeerror(state,
  3591. "expected second argument to be: list or tuple, but got: %s",
  3592. _qi_type(state, b));
  3593. qi_list_t *list = NULL;
  3594. if (b->type == QI_TUPLE)
  3595. {
  3596. if (!qi_list_empty(b->value.list))
  3597. list = qi_list_copy(b->value.list);
  3598. }
  3599. else
  3600. {
  3601. LOCKED(b, {
  3602. if (!qi_list_empty(b->value.list))
  3603. list = qi_list_copy(b->value.list);
  3604. });
  3605. }
  3606. return qi_call(state, a, list);
  3607. }
  3608. qi_value_t *qi_builtin_func_name(qi_state_t *state, qi_size_t pargc,
  3609. qi_list_t *pargs)
  3610. {
  3611. qi_value_t *a = qi_list_data(pargs, 0);
  3612. if (a->type != QI_FUNCTION)
  3613. qi_typeerror(state,
  3614. "expected first argument to be: function, but got: %s",
  3615. _qi_type(state, a));
  3616. return qi_make_string(state, a->value.function.name);
  3617. }
  3618. qi_value_t *qi_builtin_func_argc(qi_state_t *state, qi_size_t pargc,
  3619. qi_list_t *pargs)
  3620. {
  3621. qi_value_t *a = qi_list_data(pargs, 0);
  3622. if (a->type != QI_FUNCTION)
  3623. qi_typeerror(state,
  3624. "expected first argument to be: function, but got: %s",
  3625. _qi_type(state, a));
  3626. return qi_make_number(state, a->value.function.pargc);
  3627. }
  3628. qi_value_t *qi_builtin_data_tag(qi_state_t *state, qi_size_t pargc,
  3629. qi_list_t *pargs)
  3630. {
  3631. qi_value_t *a = qi_list_data(pargs, 0);
  3632. if (a->type != QI_DATA)
  3633. qi_typeerror(state, "expected first argument to be: data, but got: %s",
  3634. _qi_type(state, a));
  3635. return qi_make_number(state, a->value.data.tag);
  3636. }
  3637. qi_value_t *qi_builtin_repr(qi_state_t *state, qi_size_t pargc,
  3638. qi_list_t *pargs)
  3639. {
  3640. qi_value_t *a = qi_list_data(pargs, 0);
  3641. return qi_make_string(state, qi_repr(state, a, true));
  3642. }
  3643. qi_value_t *qi_builtin_str(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. return qi_to_string(state, a);
  3648. }
  3649. qi_value_t *qi_builtin_bool(qi_state_t *state, qi_size_t pargc,
  3650. qi_list_t *pargs)
  3651. {
  3652. qi_value_t *a = qi_list_data(pargs, 0);
  3653. return qi_to_boolean(state, a);
  3654. }
  3655. qi_value_t *qi_builtin_num(qi_state_t *state, qi_size_t pargc,
  3656. qi_list_t *pargs)
  3657. {
  3658. qi_value_t *a = qi_list_data(pargs, 0);
  3659. return qi_to_number(state, a);
  3660. }
  3661. qi_value_t *qi_builtin_int(qi_state_t *state, qi_size_t pargc,
  3662. qi_list_t *pargs)
  3663. {
  3664. qi_value_t *a = qi_list_data(pargs, 0);
  3665. qi_value_t *value = qi_to_number(state, a);
  3666. value->value.number = (long)value->value.number;
  3667. return value;
  3668. }
  3669. qi_value_t *qi_builtin_bytes(qi_state_t *state, qi_size_t pargc,
  3670. qi_list_t *pargs)
  3671. {
  3672. qi_value_t *a = qi_list_data(pargs, 0);
  3673. return qi_to_bytes(state, a);
  3674. }
  3675. qi_value_t *qi_builtin_list(qi_state_t *state, qi_size_t pargc,
  3676. qi_list_t *pargs)
  3677. {
  3678. qi_value_t *a = qi_list_data(pargs, 0);
  3679. return qi_to_list(state, a);
  3680. }
  3681. qi_value_t *qi_builtin_tuple(qi_state_t *state, qi_size_t pargc,
  3682. qi_list_t *pargs)
  3683. {
  3684. qi_value_t *a = qi_list_data(pargs, 0);
  3685. return qi_to_tuple(state, a);
  3686. }
  3687. qi_value_t *qi_builtin_table(qi_state_t *state, qi_size_t pargc,
  3688. qi_list_t *pargs)
  3689. {
  3690. qi_value_t *a = qi_list_data(pargs, 0);
  3691. return qi_to_table(state, a);
  3692. }
  3693. qi_value_t *qi_builtin_ref(qi_state_t *state, qi_size_t pargc,
  3694. qi_list_t *pargs)
  3695. {
  3696. qi_value_t *a = qi_list_data(pargs, 0);
  3697. return qi_to_ref(state, a);
  3698. }
  3699. qi_value_t *qi_builtin_iter(qi_state_t *state, qi_size_t pargc,
  3700. qi_list_t *pargs)
  3701. {
  3702. qi_value_t *a = qi_list_data(pargs, 0);
  3703. return qi_iter(state, a);
  3704. }
  3705. qi_value_t *qi_builtin_iter_next(qi_state_t *state, qi_size_t pargc,
  3706. qi_list_t *pargs)
  3707. {
  3708. qi_value_t *a = qi_list_data(pargs, 0);
  3709. if (!qi_is_iter(state, a))
  3710. qi_typeerror(state,
  3711. "expected first argument to be an iterator, but got: %s",
  3712. _qi_type(state, a));
  3713. return qi_iter_next(state, a);
  3714. }
  3715. qi_value_t *qi_builtin_iter_end(qi_state_t *state, qi_size_t pargc,
  3716. qi_list_t *pargs)
  3717. {
  3718. qi_value_t *a = qi_list_data(pargs, 0);
  3719. if (!qi_is_iter(state, a))
  3720. qi_typeerror(state,
  3721. "expected first argument to be an iterator, but got: %s",
  3722. _qi_type(state, a));
  3723. return qi_make_boolean(state, qi_iter_end(state, a));
  3724. }
  3725. qi_value_t *qi_builtin_deref(qi_state_t *state, qi_size_t pargc,
  3726. qi_list_t *pargs)
  3727. {
  3728. qi_value_t *a = qi_list_data(pargs, 0);
  3729. if (a->type != QI_REFERENCE)
  3730. qi_typeerror(state,
  3731. "expected first argument to be: reference, but got: %s",
  3732. _qi_type(state, a));
  3733. return qi_deref(state, a);
  3734. }
  3735. qi_value_t *qi_builtin_ref_set(qi_state_t *state, qi_size_t pargc,
  3736. qi_list_t *pargs)
  3737. {
  3738. qi_value_t *a = qi_list_data(pargs, 0);
  3739. qi_value_t *b = qi_list_data(pargs, 1);
  3740. if (a->type != QI_REFERENCE)
  3741. qi_typeerror(state,
  3742. "expected first argument to be: reference, but got: %s",
  3743. _qi_type(state, a));
  3744. return qi_set_ref(state, false, a, b);
  3745. }
  3746. qi_value_t *qi_pseudomethod_func_call(qi_state_t *state, qi_size_t pargc,
  3747. qi_list_t *pargs)
  3748. {
  3749. return qi_builtin_func_call(state, pargc, pargs);
  3750. }
  3751. qi_value_t *qi_pseudomethod_file_write(qi_state_t *state, qi_size_t pargc,
  3752. qi_list_t *pargs)
  3753. {
  3754. return qi_builtin_fwrite(state, pargc, pargs);
  3755. }
  3756. qi_value_t *qi_pseudomethod_file_read(qi_state_t *state, qi_size_t pargc,
  3757. qi_list_t *pargs)
  3758. {
  3759. if (pargc < 2)
  3760. {
  3761. qi_list_t *new_pargs = qi_list_make_n(2);
  3762. qi_list_data(new_pargs, 0) = qi_list_first(pargs);
  3763. qi_list_data(new_pargs, 1) = qi_make_number(state, -1);
  3764. return qi_builtin_fread(state, 2, new_pargs);
  3765. }
  3766. return qi_builtin_fread(state, pargc, pargs);
  3767. }
  3768. qi_value_t *qi_pseudomethod_file_rewind(qi_state_t *state, qi_size_t pargc,
  3769. qi_list_t *pargs)
  3770. {
  3771. qi_list_t *new_pargs = qi_list_make_n(3);
  3772. qi_list_data(new_pargs, 0) = qi_list_first(pargs);
  3773. qi_list_data(new_pargs, 1) = qi_make_number(state, 0);
  3774. qi_list_data(new_pargs, 2) = qi_make_number(state, SEEK_SET);
  3775. return qi_builtin_fseek(state, 3, new_pargs);
  3776. }
  3777. qi_value_t *qi_pseudomethod_list_push(qi_state_t *state, qi_size_t pargc,
  3778. qi_list_t *pargs)
  3779. {
  3780. return qi_builtin_list_push(state, pargc, pargs);
  3781. }
  3782. qi_value_t *qi_pseudomethod_list_pop(qi_state_t *state, qi_size_t pargc,
  3783. qi_list_t *pargs)
  3784. {
  3785. return qi_builtin_list_pop(state, pargc, pargs);
  3786. }
  3787. qi_value_t *qi_pseudomethod_table_get(qi_state_t *state, qi_size_t pargc,
  3788. qi_list_t *pargs)
  3789. {
  3790. return qi_builtin_table_get(state, pargc, pargs);
  3791. }
  3792. #include "qistd.c"
  3793. static qi_bool is_little_endian()
  3794. {
  3795. unsigned int x = 1;
  3796. int e = (int)(((char *)&x)[0]);
  3797. return e ? true : false;
  3798. }
  3799. static void qi_state_setup(qi_state_t *state)
  3800. {
  3801. QI_HASH_SEED = time(NULL);
  3802. state->nil = qi_make_value(QI_NULL);
  3803. state->_true = qi_make_value(QI_BOOLEAN);
  3804. state->_true->value.boolean = true;
  3805. state->_false = qi_make_value(QI_BOOLEAN);
  3806. state->_false->value.boolean = false;
  3807. state->zero = qi_make_value(QI_NUMBER);
  3808. state->zero->value.number = 0;
  3809. state->one = qi_make_value(QI_NUMBER);
  3810. state->one->value.number = 1;
  3811. for (int i = 1; i <= 8; i++)
  3812. {
  3813. state->nnumbers[i - 1] = qi_make_value(QI_NUMBER);
  3814. state->nnumbers[i - 1]->value.number = -i;
  3815. }
  3816. state->numbers[0] = state->zero;
  3817. state->numbers[1] = state->one;
  3818. for (int i = 2; i < 256; i++)
  3819. {
  3820. state->numbers[i] = qi_make_value(QI_NUMBER);
  3821. state->numbers[i]->value.number = i;
  3822. }
  3823. state->intern_strs = qi_table_make();
  3824. state->intern_strs_mutex = qi_mutex_create();
  3825. for (int c = 1; c < 256; c++)
  3826. {
  3827. char buf[2];
  3828. buf[0] = c;
  3829. buf[1] = 0;
  3830. char *s = qi_strdup(buf);
  3831. qi_value_t *value = qi_make_value(QI_STRING);
  3832. value->value.string = s;
  3833. qi_table_set(state->intern_strs, s, value);
  3834. }
  3835. qi_table_set(state->intern_strs, __recerror_msg, qi_make_string(state, __recerror_msg));
  3836. state->pseudomethods = qi_table_make();
  3837. state->pseudomethods_mutex = qi_mutex_create();
  3838. state->nan = qi_make_value(QI_NUMBER);
  3839. state->nan->value.number = NAN;
  3840. state->infinity = qi_make_value(QI_NUMBER);
  3841. state->infinity->value.number = INFINITY;
  3842. state->ninfinity = qi_make_value(QI_NUMBER);
  3843. state->ninfinity->value.number = -INFINITY;
  3844. state->empty_string = qi_make_value(QI_STRING);
  3845. state->empty_string->value.string = qi_strdup("");
  3846. state->empty_bytes = qi_make_value(QI_BYTES);
  3847. state->empty_bytes->value.bytes = qi_malloc(sizeof(qi_bytes_t));
  3848. state->empty_bytes->value.bytes->data = (unsigned char *)qi_strdup("");
  3849. state->empty_bytes->value.bytes->size = 0;
  3850. state->empty_tuple = qi_make_value(QI_TUPLE);
  3851. state->empty_tuple->value.list = qi_list_make();
  3852. state->_stdin = qi_make_value(QI_FILE);
  3853. state->_stdin->value.file.fd = stdin;
  3854. strcpy(state->_stdin->value.file.mode, "r");
  3855. state->_stdin->value.file.is_open = true;
  3856. state->_stderr = qi_make_value(QI_FILE);
  3857. state->_stderr->value.file.fd = stderr;
  3858. strcpy(state->_stderr->value.file.mode, "w");
  3859. state->_stderr->value.file.is_open = true;
  3860. state->_stdout = qi_make_value(QI_FILE);
  3861. state->_stdout->value.file.fd = stdout;
  3862. strcpy(state->_stdout->value.file.mode, "w");
  3863. state->_stdout->value.file.is_open = true;
  3864. state->traps = qi_list_make();
  3865. state->exceptions = qi_list_make();
  3866. state->scopes = qi_list_make();
  3867. qi_new_sticky_scope(state);
  3868. state->calltrace = qi_list_make();
  3869. state->rlimit = QI_DEFAULT_RLIMIT;
  3870. qi_decl_const(state, "nil", state->nil);
  3871. qi_decl_const(state, "true", state->_true);
  3872. qi_decl_const(state, "false", state->_false);
  3873. qi_decl_const(state, "NAN", state->nan);
  3874. qi_decl_const(state, "INFINITY", state->infinity);
  3875. qi_decl_const(state, "__LIBQIRT",
  3876. qi_make_string(state, (char *)LIBQIRT_INFO));
  3877. qi_decl_const(state, "ENDIANNESS", qi_make_string(state, is_little_endian() ? "little" : "big"));
  3878. qi_decl_const(state, "STDIN", state->_stdin);
  3879. qi_decl_const(state, "STDERR", state->_stderr);
  3880. qi_decl_const(state, "STDOUT", state->_stdout);
  3881. qi_add_builtin(state, "print", 1, qi_builtin_print);
  3882. qi_add_builtin(state, "println", 1, qi_builtin_println);
  3883. qi_add_builtin(state, "set_meta_table", 2, qi_builtin_set_meta_table);
  3884. qi_add_builtin(state, "get_meta_table", 1, qi_builtin_get_meta_table);
  3885. qi_add_builtin(state, "has_meta_table", 1, qi_builtin_has_meta_table);
  3886. qi_add_builtin(state, "delete_meta_table", 1, qi_builtin_delete_meta_table);
  3887. qi_add_builtin(state, "has_method", 2, qi_builtin_has_method);
  3888. qi_add_builtin(state, "delete_method", 2, qi_builtin_delete_method);
  3889. qi_add_builtin(state, "set_pseudomethod", 2, qi_builtin_set_pseudomethod);
  3890. qi_add_builtin(state, "has_pseudomethod", 1, qi_builtin_has_pseudomethod);
  3891. qi_add_builtin(state, "unset_pseudomethod", 1, qi_builtin_unset_pseudomethod);
  3892. qi_add_builtin(state, "set_global", 2, qi_builtin_set_global);
  3893. qi_add_builtin(state, "unset_global", 1, qi_builtin_unset_global);
  3894. qi_add_builtin(state, "get_global", 1, qi_builtin_get_global);
  3895. qi_add_builtin(state, "get_globals", 0, qi_builtin_get_globals);
  3896. qi_add_builtin(state, "get_rlimit", 0, qi_builtin_get_rlimit);
  3897. qi_add_builtin(state, "set_rlimit", 1, qi_builtin_set_rlimit);
  3898. qi_add_builtin(state, "fopen", 2, qi_builtin_fopen);
  3899. qi_add_builtin(state, "fread", 2, qi_builtin_fread);
  3900. qi_add_builtin(state, "fgets", 2, qi_builtin_fgets);
  3901. qi_add_builtin(state, "fgetc", 1, qi_builtin_fgetc);
  3902. qi_add_builtin(state, "fputc", 2, qi_builtin_fputc);
  3903. qi_add_builtin(state, "fwrite", 2, qi_builtin_fwrite);
  3904. qi_add_builtin(state, "fputs", 2, qi_builtin_fputs);
  3905. qi_add_builtin(state, "fseek", 3, qi_builtin_fseek);
  3906. qi_add_builtin(state, "ftell", 1, qi_builtin_ftell);
  3907. qi_add_builtin(state, "fflush", 1, qi_builtin_fflush);
  3908. qi_add_builtin(state, "fclose", 1, qi_builtin_fclose);
  3909. qi_add_builtin(state, "fclosed", 1, qi_builtin_fclosed);
  3910. qi_add_builtin(state, "chr", 1, qi_builtin_chr);
  3911. qi_add_builtin(state, "ord", 1, qi_builtin_ord);
  3912. qi_add_builtin(state, "len", 1, qi_builtin_len);
  3913. qi_add_builtin(state, "type", 1, qi_builtin_type);
  3914. qi_add_builtin(state, "list_copy", 1, qi_builtin_list_copy);
  3915. qi_add_builtin(state, "list_push", 2, qi_builtin_list_push);
  3916. qi_add_builtin(state, "list_insert", 3, qi_builtin_list_insert);
  3917. qi_add_builtin(state, "list_delete", 2, qi_builtin_list_delete);
  3918. qi_add_builtin(state, "list_pop", 1, qi_builtin_list_pop);
  3919. qi_add_builtin(state, "table_copy", 1, qi_builtin_table_copy);
  3920. qi_add_builtin(state, "table_delete", 2, qi_builtin_table_delete);
  3921. qi_add_builtin(state, "table_get", 2, qi_builtin_table_get);
  3922. qi_add_builtin(state, "func_name", 1, qi_builtin_func_name);
  3923. qi_add_builtin(state, "func_argc", 1, qi_builtin_func_argc);
  3924. qi_add_builtin(state, "func_call", 2, qi_builtin_func_call);
  3925. qi_add_builtin(state, "data_tag", 1, qi_builtin_data_tag);
  3926. qi_add_builtin(state, "repr", 1, qi_builtin_repr);
  3927. qi_add_builtin(state, "str", 1, qi_builtin_str);
  3928. qi_add_builtin(state, "bool", 1, qi_builtin_bool);
  3929. qi_add_builtin(state, "num", 1, qi_builtin_num);
  3930. qi_add_builtin(state, "int", 1, qi_builtin_int);
  3931. qi_add_builtin(state, "bytes", 1, qi_builtin_bytes);
  3932. qi_add_builtin(state, "list", 1, qi_builtin_list);
  3933. qi_add_builtin(state, "tuple", 1, qi_builtin_tuple);
  3934. qi_add_builtin(state, "table", 1, qi_builtin_table);
  3935. qi_add_builtin(state, "ref", 1, qi_builtin_ref);
  3936. qi_add_builtin(state, "iter", 1, qi_builtin_iter);
  3937. qi_add_builtin(state, "iter_next", 1, qi_builtin_iter_next);
  3938. qi_add_builtin(state, "iter_end", 1, qi_builtin_iter_end);
  3939. qi_add_builtin(state, "deref", 1, qi_builtin_deref);
  3940. qi_add_builtin(state, "ref_set", 2, qi_builtin_ref_set);
  3941. qi_add_pseudomethod(state, "file.write", 0, qi_pseudomethod_file_write);
  3942. qi_add_pseudomethod(state, "file.read", 0, qi_pseudomethod_file_read);
  3943. qi_add_pseudomethod(state, "file.rewind", 0, qi_pseudomethod_file_rewind);
  3944. qi_add_pseudomethod(state, "list.push", 1, qi_pseudomethod_list_push);
  3945. qi_add_pseudomethod(state, "list.pop", 0, qi_pseudomethod_list_pop);
  3946. qi_add_pseudomethod(state, "table.get", 1, qi_pseudomethod_table_get);
  3947. qi_add_pseudomethod(state, "function.call", 1, qi_pseudomethod_func_call);
  3948. state->_debug_data = NULL;
  3949. qi_init_std(state);
  3950. state->listiterator = qi_get(state, "ListIterator");
  3951. state->typeerror = qi_get(state, "TypeError");
  3952. state->valueerror = qi_get(state, "ValueError");
  3953. state->indexerror = qi_get(state, "IndexError");
  3954. state->keyerror = qi_get(state, "KeyError");
  3955. {
  3956. state->recursionerror = qi_get(state, "RecursionError");
  3957. qi_list_t *pargs = qi_list_make_n(1);
  3958. qi_list_data(pargs, 0) = qi_make_string(state, _RECERROR);
  3959. state->recursionerror = qi_call(state, state->recursionerror, pargs);
  3960. }
  3961. state->nameerror = qi_get(state, "NameError");
  3962. state->ioerror = qi_get(state, "IOError");
  3963. }
  3964. static void _qi_state_init(qi_state_t **state, qi_bool enable_debug)
  3965. {
  3966. GC_INIT();
  3967. GC_set_java_finalization(1);
  3968. *state = qi_malloc(sizeof(qi_state_t));
  3969. __debug_enabled = enable_debug;
  3970. __recerror_msg = qi_strdup("RecursionError: " _RECERROR);
  3971. qi_state_setup(*state);
  3972. __main_tid = pthread_self();
  3973. }
  3974. void qi_state_init(qi_state_t **state) { _qi_state_init(state, false); }
  3975. void qi_state_init_debug(qi_state_t **state) { _qi_state_init(state, true); }