qirt.c 131 KB

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