*/}}

la_data.c 191 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842
  1. /*
  2. * LaGUI: A graphical application framework.
  3. * Copyright (C) 2022-2023 Wu Yiming
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation, either version 3 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. */
  18. #include "la_5.h"
  19. extern LA MAIN;
  20. const char* LA_UDF_EXTENSION_STRINGS[]={
  21. "LA_UDF_EXTENSION_FLOAT32",
  22. "LA_UDF_EXTENSION_RAW",
  23. "LA_UDF_EXTENSION_QUICK_SEEK",
  24. "",
  25. };
  26. int la_IsThisProp(const laProp *p, const char *id){
  27. return (!strcmp(p->Identifier, id));
  28. }
  29. laProp *la_PropLookup(laListHandle *lst, const char *ID){
  30. laProp *p = 0, *ip;
  31. if (!lst) return 0;
  32. p = lstFindItem(ID, la_IsThisProp, lst);
  33. if (!p) if (strSame(ID, "identifier")){
  34. for (ip = lst->pFirst; ip; ip = ip->Item.pNext){
  35. if (ip->Tag & LA_AS_IDENTIFIER) return ip;
  36. }
  37. }
  38. return p;
  39. }
  40. laProp *la_PropLookupIdentifierItem(laListHandle *lst){
  41. laProp *p;
  42. if (!lst) return 0;
  43. for (p = lst->pFirst; p; p = p->Item.pNext){
  44. if (p->Tag & LA_AS_IDENTIFIER) return p;
  45. elif (la_IsThisProp(p, "identifier")) return p;
  46. }
  47. return 0;
  48. }
  49. int la_IsThisContainer(laPropContainer *p, char *id){
  50. return (!strcmp(p->Identifier, id));
  51. }
  52. laPropContainer *la_ContainerLookup(const char *ID){
  53. laPropContainer* pc= lstFindItem(ID, la_IsThisContainer, &MAIN.PropContainers);
  54. return pc;
  55. }
  56. void la_CopyPropStepRecursive(laPropPack* From, laPropPack* To){
  57. if(From->RawThis){ la_CopyPropStepRecursive(From->RawThis,To); }
  58. laPropStep *ps,*fps,*LastPs=To->LastPs;
  59. for (fps = From->Go; fps; fps = fps->pNext) {
  60. ps = memAcquireSimple(sizeof(laPropStep));
  61. ps->p = fps->p;
  62. ps->UseInstance = fps->UseInstance;
  63. ps->Type = fps->Type;
  64. if (LastPs) LastPs->pNext = ps;
  65. else To->Go = ps;
  66. LastPs = ps;
  67. }
  68. To->LastPs = LastPs;
  69. }
  70. void la_CopyPropPack(laPropPack* From, laPropPack* To) {
  71. laPropStep* ps,*fps,*LastPs=0;
  72. To->EndInstance = From->EndInstance;
  73. To->Go = To->LastPs = 0;
  74. la_FreePropStepCache(To->Go);
  75. la_CopyPropStepRecursive(From, To);
  76. if(!To->LastPs){
  77. ps = memAcquireSimple(sizeof(laPropStep));
  78. ps->p = From->LastPs->p;
  79. ps->UseInstance = From->LastPs->UseInstance;
  80. ps->Type = From->LastPs->Type;
  81. To->LastPs = ps;
  82. }
  83. }
  84. laListHandle* laGetUserList(void* HyperUserMem, laProp* Which, int* IsLocal){
  85. laListHandle* users;
  86. if(Which && Which->Container){
  87. laPropContainer* pc=Which->Container;
  88. if(pc->OtherAlloc || (!pc->Hyper)){
  89. *IsLocal=1;
  90. return &pc->LocalUsers;
  91. }
  92. }
  93. *IsLocal=0;
  94. return memGetUserList(HyperUserMem);
  95. }
  96. int laCountUserSpecific(laListHandle* users, laProp* which, int* r_count){
  97. int spec=0,count=0;
  98. for(laItemUserLinker* iul=users->pFirst;iul;iul=iul->Pointer.pNext){
  99. if(which == iul->Which){ spec++; } count++;
  100. }
  101. if(r_count){ *r_count=count; }
  102. return spec;
  103. }
  104. laItemUserLinker *laUseDataBlock(void *HyperUserMem, laProp *Which, unsigned int FrameDistinguish, void *User, laUserRemoveFunc Remover, int ForceRecalc){
  105. laItemUserLinker *iul; laItemUserLinkerLocal *iull; int local;
  106. if (!HyperUserMem) return 0;
  107. laListHandle* users = laGetUserList(HyperUserMem, Which, &local); if(!users) return 0;
  108. for (iul = users->pFirst; iul; iul = iul->Pointer.pNext){
  109. if(local && (iull=iul) && iull->Instance!=HyperUserMem) continue;
  110. if (iul->Which == Which && iul->Pointer.p == User){
  111. iul->FrameDistinguish = FrameDistinguish;
  112. if(ForceRecalc) iul->ForceRecalc = ForceRecalc;
  113. return iul;
  114. }
  115. }
  116. iul = lstAppendPointerSized(users, User, local?sizeof(laItemUserLinkerLocal):sizeof(laItemUserLinker));
  117. iul->Which = Which;
  118. iul->FrameDistinguish = FrameDistinguish;
  119. iul->Remove = Remover;
  120. iul->ForceRecalc = ForceRecalc;
  121. if(local){ iull=iul; iull->Instance=HyperUserMem; }
  122. return iul;
  123. }
  124. void laStopUsingDataBlock(void *HyperUserMem, laProp *prop, laPanel* p){
  125. laItemUserLinker *iul,*next_iul; laItemUserLinkerLocal *iull; int local;
  126. if (!HyperUserMem) return;
  127. laListHandle* users = laGetUserList(HyperUserMem, prop, &local); if(!users) return;
  128. for (iul = users->pFirst; iul; iul = next_iul){
  129. next_iul = iul->Pointer.pNext;
  130. if(local && (iull=iul) && iull->Instance!=HyperUserMem) continue;
  131. if (/*prop == iul->Which &&*/ iul->Pointer.p == p||iul->Additional==p){
  132. lstRemoveItem(users,iul);
  133. memFree(iul);
  134. }
  135. }
  136. }
  137. void laDataBlockNoLongerExists(void *HyperUserMem, laListHandle* UserList){
  138. laItemUserLinker *iul,*next_iul;
  139. for (iul = UserList->pFirst; iul; iul = next_iul){
  140. next_iul = iul->Pointer.pNext;
  141. iul->Remove(HyperUserMem, iul);
  142. lstRemoveItem(UserList,iul);
  143. memFree(iul);
  144. }
  145. }
  146. void la_PrintUserList(void* HyperUserMem){
  147. laItemUserLinker* iul, * next_iul; laItemUserLinkerLocal* iull; int local;
  148. if (!HyperUserMem) return;
  149. laListHandle* users = laGetUserList(HyperUserMem, 0, &local); if (!users) return;
  150. for (iul = users->pFirst; iul; iul = next_iul) {
  151. next_iul = iul->Pointer.pNext;
  152. printf("p %llx which %s add %llx\n", iul->Pointer.p, iul->Which ? iul->Which->Identifier : "-", iul->Additional);
  153. }
  154. }
  155. //laProp* la_GetGeneralPropFromPath(laProp* General, const char * Path) {
  156. // laProp* p;
  157. // laListHandle* lst = &General->Sub;
  158. // laStringSplitor* ss = strSplitPathByDot(Path);
  159. // laStringPart* sp = ss->parts.pFirst;
  160. //
  161. // while (sp) {
  162. // p = la_PropLookup(lst, sp->Content);
  163. // lst = &p->Sub;
  164. // sp = sp->Item.pNext;
  165. // }
  166. //
  167. // strDestroyStringSplitor(&ss);
  168. // return p;
  169. //}
  170. //laProp* la_GetPropFromPath(laPropPack* Base,const char * Path) {
  171. // laProp* p,*LastP=Base?Base->P:0;
  172. // laListHandle* lst;
  173. // laStringSplitor* ss = strSplitPathByDot(Path);
  174. // laStringPart* sp = ss->parts.pFirst;
  175. //
  176. // if(!Base || !Base->P)
  177. // lst = &MAIN.DataRoot.Root->Sub;
  178. // else lst = &Base->P->Sub;
  179. //
  180. //
  181. // while (sp) {
  182. // p = la_PropLookup(lst, sp->Content);
  183. // if (!p && LastP) {
  184. // p = la_PropLookup(&la_GetGeneralProp(LastP)->Sub, sp->Content);
  185. // }
  186. // LastP = p;
  187. // lst = &p->Sub;
  188. // sp = sp->Item.pNext;
  189. // }
  190. //
  191. // strDestroyStringSplitor(&ss);
  192. //
  193. // return p;
  194. //}
  195. void la_NewPropStep(laPropPack *Self, laProp *P, void *UseInstance, char Type){
  196. laPropStep *ps = memAcquireSimple(sizeof(laPropStep));
  197. if (Type == U'.' || Type == U'$'){
  198. ps->p = P;
  199. ps->UseInstance = UseInstance;
  200. ps->Type = Type;
  201. }elif (Type == U'@' || Type == U'=' || Type == U'#'){
  202. ps->p = CreateNewBuffer(char, strlen(P) + 1);
  203. strcpy(ps->p, P);
  204. ps->UseInstance = UseInstance;
  205. ps->Type = Type;
  206. }
  207. if (!Self->Go){
  208. Self->Go = ps;
  209. Self->LastPs = ps;
  210. }else{
  211. Self->LastPs->pNext = ps;
  212. Self->LastPs = ps;
  213. }
  214. }
  215. void la_FreePropStepCache(laPropStep *GoTarget){
  216. if (!GoTarget) return;
  217. if (GoTarget->pNext){
  218. la_FreePropStepCache(GoTarget->pNext);
  219. }
  220. if (GoTarget->Type == U'@' || GoTarget->Type == U'=' || GoTarget->Type == U'#') FreeMem(GoTarget->p);
  221. memFree(GoTarget);
  222. }
  223. void *la_FindMatchingInstance(void *From, laProp *Sub, laProp *p, laPropStep *Value){
  224. laPropPack Fake;
  225. laPropStep FakePs;
  226. laPropIterator pi = {0};
  227. void *Inst;
  228. char _buf[LA_RAW_CSTR_MAX_LEN]={0}; char*buf=_buf;
  229. int val;
  230. Fake.LastPs = &FakePs;
  231. FakePs.p = p;
  232. Inst = laGetInstance(Sub, From, &pi);
  233. if (p->PropertyType == LA_PROP_STRING){
  234. _buf[0] = 0;
  235. FakePs.UseInstance = Inst;
  236. laGetString(&Fake, _buf, &buf);
  237. while (!strSame(buf, Value->p)){
  238. Inst = laGetNextInstance(Sub, Inst, &pi);
  239. if (!Inst) return 0;
  240. _buf[0] = 0;
  241. FakePs.UseInstance = Inst;
  242. laGetString(&Fake, _buf, &buf);
  243. }
  244. return Inst;
  245. }elif (p->PropertyType == LA_PROP_INT){
  246. FakePs.UseInstance = Inst;
  247. val = laGetInt(&Fake); char buf[64]; int compareval=0;
  248. int status=sscanf(buf,"%d",&compareval);
  249. while (status && status!=EOF && val != compareval){
  250. Inst = laGetNextInstance(Sub, From, &pi);
  251. if (!Inst) return 0;
  252. FakePs.UseInstance = Inst;
  253. val = laGetInt(&Fake);
  254. }
  255. return Inst;
  256. }
  257. return 0;
  258. }
  259. int la_GetPropFromPath(laPropPack *Self, laPropPack *Base, const char *Path, void **SpecifiedInstance){
  260. laProp *p = 0;
  261. laListHandle *lst=0, *lstB = 0;
  262. laStringSplitor *ss = strSplitPath(Path,0);
  263. laStringPart *sp = ss ? ss->parts.pFirst : 0;
  264. int InstanceNum = 0;
  265. if ((!ss && !Base) || !MAIN.DataRoot.Root){ strDestroyStringSplitor(&ss); return 0; }
  266. if (!Base || !Base->LastPs){
  267. lst = &MAIN.DataRoot.Root->Props;
  268. Self->RawThis = 0;
  269. }else{
  270. Self->RawThis = Base;
  271. if (Base->LastPs->p->PropertyType==LA_PROP_SUB && ((laSubProp*)Base->LastPs->p)->GetType && Base->EndInstance){
  272. laPropContainer* pc=((laSubProp*)Base->LastPs->p)->GetType(Base->EndInstance);
  273. lst = &pc->Props;
  274. lstB = pc ? &pc->Props : 0;
  275. }
  276. if(!lst){
  277. if (!Base->LastPs->p->SubProp){
  278. laProp *p = Base->LastPs->p;
  279. p->SubProp = la_ContainerLookup(((laSubProp *)p)->TargetID);
  280. }
  281. if(Base->LastPs->p->SubProp) lst = &Base->LastPs->p->SubProp->Props;
  282. }
  283. lstB = Base->LastPs->p->SubExtra ? &Base->LastPs->p->SubExtra->Props : 0;
  284. if (!Path || !Path[0] || !ss){
  285. if (Base){
  286. Self->LastPs = Base->LastPs;
  287. //Self->ReusedPs = 1;
  288. //la_NewPropStep(Self, Base->LastPs->p,Base->LastPs->UseInstance,Base->LastPs->Type);
  289. }
  290. }
  291. }
  292. while (sp){
  293. if (sp->Type == U'.' || sp->Type == U'$'){
  294. void *inst = 0;
  295. p = la_PropLookup(lst, sp->Content);
  296. if (!p) p = la_PropLookup(lstB, sp->Content);
  297. if (!p){
  298. la_FreePropStepCache(Self->Go);
  299. Self->Go = Self->LastPs = 0;
  300. strDestroyStringSplitor(&ss);
  301. return 0; // |-----------------Here Should Include Dollar Instance
  302. } // V
  303. if (sp->Type == U'$'){
  304. inst = SpecifiedInstance[InstanceNum];
  305. InstanceNum++;
  306. }else
  307. inst = 0;
  308. /*if(Base == &MAIN.PropMatcherContextP->PropLinkPP)la_NewPropStep(Self, p, inst, '*');
  309. else */
  310. la_NewPropStep(Self, p, inst, sp->Type);
  311. if (p->PropertyType == LA_PROP_SUB && !p->SubProp){
  312. p->SubProp = la_ContainerLookup(((laSubProp *)p)->TargetID);
  313. }
  314. lst = p->SubProp ? &p->SubProp->Props : 0;
  315. lstB = p->SubExtra ? &p->SubExtra->Props : 0;
  316. }else{
  317. if (sp->Type == U'@' || sp->Type == U'=' || sp->Type == U'#'){ // || sp->Type== U'~'
  318. la_NewPropStep(Self, sp->Content, 0, sp->Type);
  319. }
  320. }
  321. sp = sp->Item.pNext;
  322. }
  323. strDestroyStringSplitor(&ss);
  324. return 1;
  325. }
  326. void la_StepPropPack(laPropPack *pp){
  327. laPropStep *ps = pp->Go;
  328. laPropPack *This = pp->RawThis;
  329. laPropIterator pi;
  330. laProp *Lookup;
  331. laPropStep *Value;
  332. void *UseInstance = 0;
  333. if (This){
  334. UseInstance = This->EndInstance;
  335. if (ps) ps->UseInstance = UseInstance;
  336. }else{
  337. if (!ps) return;
  338. UseInstance = MAIN.DataRoot.RootInstance;
  339. ps->UseInstance = UseInstance;
  340. }
  341. if (This && !ps){
  342. pp->EndInstance = UseInstance;
  343. pp->LastPs = This->LastPs;
  344. return;
  345. }
  346. while (ps){
  347. // Looks like we have these kind of access grammar:
  348. // sub.prop
  349. // sub@prop=str_or_int
  350. // sub#identifier
  351. // TODO: Add sub~index grammar
  352. if (ps->p->PropertyType == LA_PROP_SUB){
  353. if (ps->Type == U'@' || ps->Type == U'#'){
  354. }
  355. if (ps->Type == U'$') UseInstance = ps->UseInstance;
  356. elif (ps->pNext && ps->pNext->Type != U'.'){
  357. if (ps->pNext->Type == U'@'){
  358. Value = ps->pNext->pNext;
  359. Lookup = la_PropLookup(&ps->p->SubProp->Props, ps->pNext->p);
  360. }elif (ps->pNext->Type == U'#'){
  361. Value = ps->pNext;
  362. Lookup = la_PropLookupIdentifierItem(&ps->p->SubProp->Props);
  363. }
  364. if (Value->Type == U'=' || Value->Type == U'#'){ //MUST!
  365. UseInstance = la_FindMatchingInstance(ps->UseInstance, ps->p, Lookup, Value);
  366. }
  367. Value->UseInstance = UseInstance;
  368. if(Value->pNext) Value->pNext->UseInstance = UseInstance;
  369. ps = Value->pNext;
  370. continue;
  371. }else{
  372. void *inst;
  373. if(((laSubProp*)ps->p)->IsDetached){ UseInstance = ((laSubProp*)ps->p)->Detached; }
  374. else{
  375. inst = laGetActiveInstanceStrict(ps->p, UseInstance);
  376. if (!inst) inst = laGetInstance(ps->p, UseInstance, 0);
  377. UseInstance = inst;
  378. }
  379. }
  380. if (!ps->pNext){
  381. pp->EndInstance = UseInstance;
  382. break;
  383. }else{
  384. ps->pNext->UseInstance = UseInstance;
  385. ps = ps->pNext;
  386. }
  387. continue;
  388. }else{
  389. ps->UseInstance = UseInstance;
  390. if (!ps->pNext){
  391. pp->EndInstance = UseInstance;
  392. break;
  393. }else{
  394. ps->pNext->UseInstance = ps;
  395. UseInstance = ps;
  396. ps = ps->pNext;
  397. }
  398. }
  399. }
  400. }
  401. void la_RemovePropUserNode(laPropStep *ps){
  402. laPropUserPanel *pup = 0;
  403. laPropUser *pu = 0;
  404. for (pup = ps->p->UserPanels.pFirst; pup; pup = pup->Item.pNext){
  405. if (pup->Panel == MAIN.PropMatcherContextP) break;
  406. }
  407. if (!pup) return;
  408. for (pu = pup->UserPacks.pFirst; pu; pu = pu->Item.pNext){
  409. if (pu->User == ps) break;
  410. }
  411. //if (!pu)printf("PROP USER NODE NOT FOUND!\laPropUserPanel:%d,%s,Ps:%s\n",pup->Panel,pup->Panel->Title->Ptr,ps->p->Identifier);
  412. //else {
  413. if (pu){
  414. lstRemoveItem(&pup->UserPacks, pu);
  415. memFree(pu);
  416. if (!pup->UserPacks.pFirst){
  417. lstRemoveItem(&ps->p->UserPanels, pup);
  418. memFree(pup);
  419. }
  420. }
  421. //}
  422. }
  423. void la_AddPropUserNode(laPropStep *ps){
  424. laPropUserPanel *pup = 0;
  425. laPropUser *pu = 0;
  426. for (pup = ps->p->UserPanels.pFirst; pup; pup = pup->Item.pNext){
  427. if (pup->Panel == MAIN.PropMatcherContextP) break;
  428. }
  429. if (!pup){
  430. pup = memAcquireSimple(sizeof(laPropUserPanel));
  431. pup->Panel = MAIN.PropMatcherContextP;
  432. lstAppendItem(&ps->p->UserPanels, pup);
  433. }
  434. for (pu = pup->UserPacks.pFirst; pu; pu = pu->Item.pNext){
  435. if (pu->User == ps){
  436. pu->FrameDistinguish = MAIN.PropMatcherContextP->FrameDistinguish;
  437. return;
  438. }
  439. }
  440. //ELSE
  441. pu = memAcquireSimple(sizeof(laPropUser));
  442. pu->User = ps;
  443. pu->FrameDistinguish = MAIN.PropMatcherContextP->FrameDistinguish;
  444. lstAppendItem(&pup->UserPacks, pu);
  445. }
  446. void la_UsePropPack(laPropPack *pp, int ForceRecalc){
  447. laPropStep *ps = 0;
  448. //if(pp->LastPs && pp->LastPs->p)printf("%s\n",pp->LastPs->p->Identifier);
  449. if((!pp->Go) && pp->LastPs){
  450. if (pp->LastPs->Type==U'.'){
  451. laUseDataBlock(pp->RawThis->LastPs->UseInstance, pp->LastPs->p, MAIN.PropMatcherContextP->FrameDistinguish, MAIN.PropMatcherContextP, la_PropPanelUserRemover, ForceRecalc);
  452. }
  453. }
  454. for (ps = pp->Go; ps; ps = ps->pNext){
  455. if (ps->Type==U'.'){
  456. laUseDataBlock(ps->UseInstance, ps->p, MAIN.PropMatcherContextP->FrameDistinguish, MAIN.PropMatcherContextP, la_PropPanelUserRemover, ForceRecalc);
  457. }
  458. }
  459. }
  460. void la_StopUsingPropPack(laPropPack *pp){
  461. laPropStep *ps;
  462. if((!pp->Go) && pp->LastPs){
  463. if (pp->LastPs->Type==U'.'&&pp->LastPs->p->Container &&pp->LastPs->p->Container->Hyper){
  464. laStopUsingDataBlock(pp->RawThis->LastPs->UseInstance, pp->LastPs->p, MAIN.PropMatcherContextP);
  465. }
  466. }
  467. for (ps = pp->Go; ps; ps = ps->pNext){
  468. if (ps->Type==U'.'&&ps->p->Container&&ps->p->Container->Hyper){
  469. laStopUsingDataBlock(ps->UseInstance, ps->p, MAIN.PropMatcherContextP);
  470. }
  471. //la_RemovePropUserNode(ps);
  472. }
  473. }
  474. void laNotifyUsersPP(laPropPack *pp){
  475. if(!pp->LastPs) return;
  476. void *hi = pp->LastPs->UseInstance;
  477. laItemUserLinker *iul; laItemUserLinkerLocal *iull; int local;
  478. if (!hi) return;
  479. laListHandle* users = laGetUserList(hi, pp->LastPs->p, &local); if(!users) return;
  480. for (iul = users->pFirst; iul; iul = iul->Pointer.pNext){
  481. if(local && (iull=iul) && iull->Instance!=hi) continue;
  482. if (iul->Remove == la_PropPanelUserRemover){
  483. laPanel *p = iul->Pointer.p;
  484. if (iul->Which == pp->LastPs->p && iul->FrameDistinguish == p->FrameDistinguish){
  485. //laSpinLock(&MAIN.csNotifier);
  486. if ((iul->Which->PropertyType & LA_PROP_SUB) || iul->ForceRecalc) laRecalcPanel(p);
  487. else laRedrawPanel(p);
  488. //laSpinUnlock(&MAIN.csNotifier);
  489. }
  490. }
  491. }
  492. }
  493. void laNotifyUsersPPPath(laPropPack *pp, char *path){
  494. laPropPack PP = {0};
  495. if(!path){ laNotifyUsersPP(pp); return; }
  496. la_GetPropFromPath(&PP, pp, path, 0);
  497. la_StepPropPack(&PP);
  498. laNotifyUsersPP(&PP);
  499. la_FreePropStepCache(PP.Go);
  500. }
  501. void laNotifySubPropUsers(laProp *prop, void *Instance){
  502. void *hi = Instance;
  503. laItemUserLinker *iul; laItemUserLinkerLocal *iull; int local;
  504. if (!hi) return;
  505. laListHandle* users = laGetUserList(hi, prop, &local); if(!users) return;
  506. for (iul = users->pFirst; iul; iul = iul->Pointer.pNext){
  507. if(local && (iull=iul) && iull->Instance!=hi) continue;
  508. if (iul->Remove == la_PropPanelUserRemover){
  509. laPanel *p = iul->Pointer.p;
  510. if (iul->Which == prop && iul->FrameDistinguish == p->FrameDistinguish){
  511. //laSpinLock(&MAIN.csNotifier);
  512. laRecalcPanel(p);
  513. //laSpinUnlock(&MAIN.csNotifier);
  514. }
  515. }
  516. }
  517. }
  518. void laNotifyInstanceUsers(void *Instance){
  519. void *hi = Instance;
  520. laItemUserLinker *iul; laItemUserLinkerLocal *iull; int local; if (!hi) return;
  521. laListHandle* users = laGetUserList(hi, 0, &local); if(!users) return;
  522. for (iul = users->pFirst; iul; iul = iul->Pointer.pNext){
  523. if(local && (iull=iul) && iull->Instance!=hi) continue;
  524. if (iul->Remove == la_PropPanelUserRemover){
  525. laPanel *p = iul->Pointer.p;
  526. if (iul->FrameDistinguish == p->FrameDistinguish){
  527. laRedrawPanel(p);
  528. if(iul->Which&&iul->Which->PropertyType==LA_PROP_SUB){ laRecalcPanel(p); }
  529. }
  530. }
  531. }
  532. }
  533. void laNotifyUsers(char *Path){
  534. laPropPack PP = {0};
  535. la_GetPropFromPath(&PP, 0, Path, 0);
  536. la_StepPropPack(&PP);
  537. laNotifyUsersPP(&PP);
  538. la_FreePropStepCache(PP.Go);
  539. }
  540. void laThreadNotifyUsers(char *Path){
  541. laThreadNotifier *tn = CreateNew(laThreadNotifier);
  542. strCopyFull(tn->Path, Path);
  543. //laSpinLock(&MAIN.csNotifier);
  544. lstAppendItem(&MAIN.ThreadNotifiers, tn);
  545. //laSpinUnlock(&MAIN.csNotifier);
  546. }
  547. void la_PanelResetDetachedReference(laPanel*p,void*Old,void*New){
  548. for(laSubProp* sp=p->PropLinkContainer->Props.pFirst;sp;sp=sp->Base.Item.pNext){
  549. if(sp->Base.PropertyType!=LA_PROP_SUB) continue;
  550. if(sp->Detached == Old){ memAssignRef(sp, &sp->Detached, New); }
  551. }
  552. for(laPanel* sp=p->SubPanels.pFirst;sp;sp=sp->Item.pNext){
  553. la_PanelResetDetachedReference(sp,Old,New);
  554. }
  555. }
  556. void la_NotifyDetachedRecursive(laBlock* b, void* Old, void* New){
  557. if(b->B1){ la_NotifyDetachedRecursive(b->B1,Old,New);la_NotifyDetachedRecursive(b->B2,Old,New); return; }
  558. for(laPanel* p=b->Panels.pFirst;p;p=p->Item.pNext){
  559. la_PanelResetDetachedReference(p,Old,New);
  560. }
  561. }
  562. void laNotifyDetached(void* OldInstance, void* NewInstance){
  563. for(laWindow* w=MAIN.Windows.pFirst;w;w=w->Item.pNext){
  564. for(laLayout* l=w->Layouts.pFirst;l;l=l->Item.pNext){
  565. la_NotifyDetachedRecursive(l->FirstBlock,OldInstance,NewInstance);
  566. }
  567. for(laPanel* p=w->Panels.pFirst;p;p=p->Item.pNext){
  568. la_PanelResetDetachedReference(p,OldInstance,NewInstance);
  569. }
  570. }
  571. }
  572. void laDetachedTrySet(char* prop_identifier,void* NewInstance){
  573. laPanel* p=MAIN.CurrentPanel; for(laSubProp* sp=p->PropLinkContainer->Props.pFirst;sp;sp=sp->Base.Item.pNext){
  574. if(sp->Base.PropertyType!=LA_PROP_SUB){ continue; }
  575. if(strSame(sp->Base.Identifier,prop_identifier)){ memAssignRef(sp,&sp->Detached,NewInstance); }
  576. }
  577. }
  578. void la_SetPropMathcerContext(laPanel *p){
  579. MAIN.PropMatcherContextP = p;
  580. }
  581. int laget_InstanceHyperLevel(void* instance){
  582. int level; memGetHead(instance,&level);
  583. return level;
  584. }
  585. int laget_InstanceModified(void* instance){
  586. int level; laMemNodeHyper* m=memGetHead(instance,&level);
  587. if(level==2) return m->Modified?1:0;
  588. return 0;
  589. }
  590. void* laget_InstanceUDF(void* unused, laPropIterator* unusedpi){
  591. return MAIN.ManagedUDFs.pFirst;
  592. }
  593. void* laget_InstanceActiveUDF(void* instance){
  594. int level; laMemNodeHyper* m=memGetHead(instance,&level);
  595. if(level==2) return m->FromFile;
  596. return 0;
  597. }
  598. void* laget_DummyManagedUDFSingle(void* unused){
  599. return MAIN.DummyManageUDFSingle;
  600. }
  601. void* laget_DummyManagedUDFSingleForce(void* unused){
  602. return MAIN.DummyManageUDFSingleForce;
  603. }
  604. void laset_InstanceUDFFromSingle(void* instance, laUDF* udf){
  605. if(!MAIN._CONTAINER_SETTING || !MAIN._CONTAINER_SETTING->UDFPropagate || !instance){ return; }
  606. if(udf == MAIN.DummyManageUDF){
  607. laInvoke(0, "LA_managed_save_new_file", 0,0,0,0);
  608. }
  609. MAIN._CONTAINER_SETTING->UDFPropagate(instance,udf,0);
  610. }
  611. void laset_InstanceUDFFromSingleForce(void* instance, laUDF* udf){
  612. if(!MAIN._CONTAINER_SETTING || !MAIN._CONTAINER_SETTING->UDFPropagate || !instance){ return; }
  613. if(udf == MAIN.DummyManageUDF){
  614. laInvoke(0, "LA_managed_save_new_file", 0,0,0,0);
  615. }
  616. MAIN._CONTAINER_SETTING->UDFPropagate(instance,udf,0);
  617. }
  618. void laset_InstanceUDF(void* instance, void* set){
  619. int level; laMemNodeHyper* m=memGetHead(instance,&level);
  620. if(level==2) memAssignRef(instance, &m->FromFile, set);
  621. if(set == MAIN.DummyManageUDF){
  622. laInvoke(0, "LA_managed_save_new_file", 0,0,0,0);
  623. }
  624. }
  625. void* laget_InstanceSelf(void* instace){
  626. return instace;
  627. }
  628. const char* LA_N_A="N/A";
  629. void *la_GetReadDBInstNUID(char *ReferReadNUID);
  630. void laget_InstanceUID(void* instance, char* buf, const char** ptr){
  631. int level; laMemNodeHyper* m=memGetHead(instance,&level);
  632. if(level!=2||!m) return; *ptr=LA_N_A;
  633. *ptr=m->NUID.String;
  634. }
  635. void laset_InstanceUID(void* instance, char* buf){
  636. int level; laMemNodeHyper* m=memGetHead(instance,&level);
  637. if(level!=2||!m) return;
  638. char _buf[40];
  639. if(!buf[0]){ memCreateNUID(_buf,m); buf=_buf; }
  640. laListHandle *l = hsh65536DoHashNUID(&MAIN.DBInst2, m->NUID.String);
  641. laMemNodeHyper* im=0;
  642. for (im = l->pFirst; im; im = m->Item.pNext){ if(im==m) break; }
  643. if(im){ lstRemoveItem(l,im); laListHandle *nl = hsh65536DoHashNUID(&MAIN.DBInst2, buf); lstAppendItem(nl,im); }else{ im=m; /* Unlikely */ }
  644. sprintf(m->NUID.String,"%.30s",buf);
  645. }
  646. void* laget_SaverDummy(void* instance, laPropIterator* pi){
  647. laSubProp* p=MAIN._PROP_SETTING; laListHandle* l = (((char*)instance)+p->ListHandleOffset);
  648. if(!l->pFirst){
  649. laSaverDummy* sd=memAcquireHyper(sizeof(laSaverDummy)); lstAppendItem(l,sd);
  650. }
  651. while(l->pFirst!=l->pLast){ memLeave(lstPopItem(l)); }
  652. return l->pFirst;
  653. }
  654. laSaverDummy* laGetSaverDummy(void* instance, laSubProp* p){
  655. laListHandle* l = (((char*)instance)+p->ListHandleOffset);
  656. if(!l->pFirst){ laSaverDummy* sd=memAcquireHyper(sizeof(laSaverDummy)); lstAppendItem(l,sd); }
  657. while(l->pFirst!=l->pLast){ memLeave(lstPopItem(l)); }
  658. return l->pFirst;
  659. }
  660. void laPurgeSaverDummy(void* instance, laSubProp* p){
  661. laListHandle* l = (((char*)instance)+p->ListHandleOffset);
  662. while(l->pFirst){ memLeave(lstPopItem(l)); }
  663. }
  664. void la_FreeProperty(laProp* p){
  665. laIntProp *ip;laFloatProp *fp;laEnumProp *ep;laSubProp *sp;
  666. if(p->DetachedPP.Go){
  667. la_FreePropStepCache(p->DetachedPP.Go);
  668. switch (p->PropertyType){
  669. case LA_PROP_INT:
  670. case LA_PROP_INT | LA_PROP_ARRAY:
  671. ip = p; free(ip->Detached);
  672. break;
  673. case LA_PROP_FLOAT:
  674. case LA_PROP_FLOAT | LA_PROP_ARRAY:
  675. fp = p; free(fp->Detached);
  676. break;
  677. case LA_PROP_ENUM:
  678. case LA_PROP_ENUM | LA_PROP_ARRAY:
  679. ep = p; free(ep->Detached);
  680. }
  681. }
  682. if(p->PropertyType&LA_PROP_ENUM){ ep = p; laEnumItem* ei; while(ei=lstPopItem(&ep->Items)){ memFree(ei); } }
  683. memFree(p);
  684. }
  685. void la_FreePropertyContainer(laPropContainer* pc){
  686. laProp* p;
  687. while(p=lstPopItem(&pc->Props)){
  688. la_FreeProperty(p);
  689. }
  690. memFree(pc);
  691. }
  692. laPropContainer *laAddPropertyContainer(const char *Identifier, const char *Name, const char *Description, uint32_t IconID,
  693. laUiDefineFunc DefaultUiDefine,
  694. int NodeSize, laContainerPostReadFunc PostRead, laContainerPostReadFunc PostReadIm, int IsHyper){
  695. laPropContainer *pc = memAcquire(sizeof(laPropContainer));
  696. pc->Identifier = Identifier;
  697. pc->Name = Name;
  698. pc->Description = Description;
  699. pc->UiDefine = DefaultUiDefine;
  700. pc->IconID = IconID ? IconID : U'📦';
  701. pc->OtherAlloc = (IsHyper&LA_PROP_OTHER_ALLOC)?1:0;
  702. pc->Hyper = pc->OtherAlloc?0:(IsHyper&LA_PROP_HYPER_BITS);
  703. pc->PostRead = PostRead;
  704. pc->PostReadIm = PostReadIm;
  705. pc->NodeSize = NodeSize;
  706. if (!pc->OtherAlloc){
  707. laAddSubGroup(pc, "__file", "File", "The file this block came from/saves to", "managed_udf",
  708. 0,LA_WIDGET_COLLECTION_SELECTOR,laui_ManagedUDFItem,-1,laget_InstanceUDF,laget_InstanceActiveUDF,laget_ListNext,laset_InstanceUDF,0,0,0,LA_UDF_REFER|LA_UDF_IGNORE);
  709. laAddIntProperty(pc, "__hyper", "Hyper", "Hyper level of this data block", 0,0,0,0,0,0,0,0,-1,laget_InstanceHyperLevel,0,0,0,0,0,0,0,0,0,LA_READ_ONLY|LA_UDF_IGNORE);
  710. laProp* p=laAddEnumProperty(pc, "__modified", "Modified", "Data block is modified", LA_WIDGET_ENUM_ICON_PLAIN,0,0,0,0,-1,laget_InstanceModified,0,0,0,0,0,0,0,0,LA_READ_ONLY|LA_UDF_IGNORE);
  711. laAddEnumItemAs(p, "MODIFIED", "Modified", "Data block is modified", 1, U'🌑');
  712. laAddEnumItemAs(p, "CLEAN", "Clean", "Data block is clean", 0, 0);
  713. laAddStringProperty(pc, "__uid","UID","UID for shared resoure lookup",0,0,0,0,0,-1,0,laget_InstanceUID,laset_InstanceUID,0,LA_UDF_IGNORE);
  714. }
  715. laAddSubGroup(pc, "__self", "Self", "Own instance", Identifier,0,0,0,-1,0,laget_InstanceSelf,0,0,0,0,0,LA_UDF_REFER|LA_UDF_IGNORE);
  716. lstAppendItem(&MAIN.PropContainers, pc);
  717. return pc;
  718. }
  719. void laPropContainerExtraFunctions(laPropContainer* pc, laContainerBeforeFreeF BeforeFree, laContainerResetF Reset, laContainerUndoTouchedF Touched, laContainerpUDFPropagateF UDFPropagate, laUiDefineFunc MenuUi){
  720. pc->BeforeFree=BeforeFree; pc->Reset=Reset; pc->UndoTouched=Touched; pc->UDFPropagate=UDFPropagate; pc->MenuUiDefine=MenuUi;
  721. if(!pc->OtherAlloc && UDFPropagate){
  722. laAddOperatorProperty(pc,"__udf_propagate","Propagate","Propagate UDF to all child nodes", "LA_udf_propagate", 0,0);
  723. laAddSubGroup(pc,"__single_udf_propagate","Save to","Assign file to all child nodes (From a ingle-instanced parent)","managed_udf",
  724. 0,LA_WIDGET_COLLECTION_SELECTOR,laui_ManagedUDFItem,-1,laget_InstanceUDF,laget_DummyManagedUDFSingle,laget_ListNext,laset_InstanceUDFFromSingle,0,0,0,LA_UDF_REFER|LA_UDF_IGNORE);
  725. //laAddSubGroup(pc,"__single_udf_propagate_force","Force","Assign file to all child nodes (From a ingle-instanced parent)","managed_udf",
  726. // 0,LA_WIDGET_COLLECTION_SELECTOR,laui_ManagedUDFItem,-1,laget_InstanceUDF,laget_DummyManagedUDFSingleForce,laget_ListNext,laset_InstanceUDFFromSingleForce,0,0,0,LA_UDF_REFER|LA_UDF_IGNORE);
  727. }
  728. }
  729. laProp* laPropContainerManageable(laPropContainer* pc, int offset_of_dummy_list){
  730. if(!pc || pc->OtherAlloc || !offset_of_dummy_list) return 0;
  731. if(!MAIN.SaverDummyContainer){
  732. MAIN.SaverDummyContainer = laAddPropertyContainer("la_saver_dummy","Saver Dummy","Saver dummy",0,0,sizeof(laSaverDummy),0,0,2);
  733. laAddSubGroup(MAIN.SaverDummyContainer, "__file", "File", "The file this block came from/saves to", "managed_udf",
  734. 0,LA_WIDGET_COLLECTION_SELECTOR,laui_ManagedUDFItem,-1,laget_InstanceUDF,laget_InstanceActiveUDF,laget_ListNext,laset_InstanceUDF,0,0,0,LA_UDF_REFER|LA_UDF_IGNORE);
  735. }
  736. pc->SaverDummy=laAddSubGroup(pc,"__single_saver_dummy","Saver","Saver dummy","la_saver_dummy",0,0,0,-1,0,0,0,0,0,0,offset_of_dummy_list,0);
  737. return pc->SaverDummy;
  738. }
  739. void laContainerAnimationFunctions(laPropContainer* pc, laActionHolderVerifyF ActionHolderVerify){
  740. pc->ActionHolderVerify=ActionHolderVerify;
  741. }
  742. int la_GetKeyablePropertyStorageSize(laProp* p){
  743. switch(p->PropertyType){
  744. case LA_PROP_INT: case LA_PROP_FLOAT: case LA_PROP_ENUM:
  745. return sizeof(uint64_t);
  746. case LA_PROP_INT | LA_PROP_ARRAY: case LA_PROP_FLOAT | LA_PROP_ARRAY: case LA_PROP_ENUM | LA_PROP_ARRAY:
  747. if(p->GetLen){ return 0; }
  748. return sizeof(uint64_t)*p->Len;
  749. case LA_PROP_SUB: case LA_PROP_OPERATOR: case LA_PROP_STRING: case LA_PROP_RAW: default:
  750. return 0;
  751. }
  752. }
  753. int la_GetPropertySize(int Type){
  754. switch (Type){
  755. case LA_PROP_INT:
  756. case LA_PROP_INT | LA_PROP_ARRAY:
  757. return sizeof(laIntProp);
  758. case LA_PROP_FLOAT:
  759. case LA_PROP_FLOAT | LA_PROP_ARRAY:
  760. return sizeof(laFloatProp);
  761. case LA_PROP_ENUM:
  762. case LA_PROP_ENUM | LA_PROP_ARRAY:
  763. return sizeof(laEnumProp);
  764. case LA_PROP_SUB: return sizeof(laSubProp);
  765. case LA_PROP_OPERATOR: return sizeof(laOperatorProp);
  766. case LA_PROP_STRING: return sizeof(laStringProp);
  767. case LA_PROP_RAW: return sizeof(laRawProp);
  768. }
  769. return 0;
  770. }
  771. const char LA_PROP_STR_INT[] = "LA_PROP_INT";
  772. const char LA_PROP_STR_INT_ARR[] = "LA_PROP_INT_ARR";
  773. const char LA_PROP_STR_FLOAT[] = "LA_PROP_FLOAT";
  774. const char LA_PROP_STR_FLOAT_ARR[] = "LA_PROP_FLOAT_ARR";
  775. const char LA_PROP_STR_ENUM[] = "LA_PROP_ENUM";
  776. const char LA_PROP_STR_ENUM_ARR[] = "LA_PROP_ENUM_ARR";
  777. const char LA_PROP_STR_ACT[] = "LA_PROP_ACT";
  778. const char LA_PROP_STR_STR[] = "LA_PROP_STR";
  779. const char LA_PROP_STR_SUB[] = "LA_PROP_SUB";
  780. const char *la_GetPropertyTypeString(int Type){
  781. switch (Type){
  782. case LA_PROP_INT:
  783. return LA_PROP_STR_INT;
  784. case LA_PROP_INT | LA_PROP_ARRAY:
  785. return LA_PROP_STR_INT_ARR;
  786. case LA_PROP_FLOAT:
  787. return LA_PROP_STR_FLOAT;
  788. case LA_PROP_FLOAT | LA_PROP_ARRAY:
  789. return LA_PROP_STR_FLOAT_ARR;
  790. case LA_PROP_ENUM:
  791. return LA_PROP_STR_ENUM;
  792. case LA_PROP_ENUM | LA_PROP_ARRAY:
  793. return LA_PROP_STR_ENUM_ARR;
  794. case LA_PROP_SUB:
  795. return LA_PROP_STR_SUB;
  796. case LA_PROP_OPERATOR:
  797. return LA_PROP_STR_ACT;
  798. case LA_PROP_STRING:
  799. return LA_PROP_STR_STR;
  800. }
  801. return 0;
  802. }
  803. void la_AssignPropertyGeneralSub(laProp *p){
  804. switch (p->PropertyType){
  805. case LA_PROP_INT: p->SubProp = MAIN.GeneralIntSub; break;
  806. case LA_PROP_INT | LA_PROP_ARRAY: p->SubProp = MAIN.GeneralIntArraySub; break;
  807. case LA_PROP_FLOAT: p->SubProp = MAIN.GeneralFloatSub; break;
  808. case LA_PROP_FLOAT | LA_PROP_ARRAY: p->SubProp = MAIN.GeneralFloatArraySub; break;
  809. case LA_PROP_ENUM: p->SubProp = MAIN.GeneralEnumSub; break;
  810. case LA_PROP_ENUM | LA_PROP_ARRAY: p->SubProp = MAIN.GeneralEnumArraySub; break;
  811. case LA_PROP_STRING: p->SubProp = MAIN.GeneralStringSub; break;
  812. case LA_PROP_OPERATOR: p->SubProp = MAIN.GeneralOperatorSub; break;
  813. case LA_PROP_SUB: p->SubExtra = MAIN.GeneralCollectionSub; break;
  814. case LA_PROP_RAW: p->SubExtra = MAIN.GeneralRawSub; break;
  815. }
  816. }
  817. laProp *la_CreateProperty(laPropContainer *Container, int Type, const char *Identifier, const char *Name, const char *Description,
  818. const char *Prefix, const char *Unit, laWidget* DefaultWidget, u64bit Tag){
  819. laProp *p = memAcquire(la_GetPropertySize(Type));
  820. p->Identifier = Identifier;
  821. p->Name = Name;
  822. p->Description = Description;
  823. p->Prefix = Prefix;
  824. p->Unit = Unit;
  825. if(DefaultWidget){ p->DefaultUiType = DefaultWidget->Type; p->DefaultFlags = DefaultWidget->Flags; }
  826. p->PropertyType = Type;
  827. p->Tag = Tag;
  828. p->Container = Container;
  829. if (Container) lstAppendItem(&Container->Props, p);
  830. p->UDFIsRefer = (Tag & LA_UDF_REFER) ? 1 : 0;
  831. p->UDFIgnore = (Tag & LA_UDF_IGNORE) ? 1 : 0;
  832. p->UDFOnly = (Tag & LA_UDF_ONLY) ? 1 : 0;
  833. p->ReadOnly = (Tag & LA_READ_ONLY) ? 1 : 0;
  834. p->IsRadAngle = (Tag & LA_RAD_ANGLE)? 1 : 0;
  835. p->UDFHideInSave = ((Tag & LA_HIDE_IN_SAVE) || p->UDFIgnore)? 1 : 0;
  836. p->UDFReadProgress = (Tag & LA_PROP_READ_PROGRESS)?1:0;
  837. p->CanTranslate = (Tag & LA_TRANSLATE)?1:0;
  838. if(p->IsRadAngle&&(!p->Unit)) p->Unit="°";
  839. p->Keyable = (Tag & LA_PROP_KEYABLE)? 1 : 0;
  840. if(Tag&LA_PROP_ROTATION){ p->KeySpecialInterpolation=LA_PROP_KEY_INTERPOLATION_ROTATION; }
  841. return p;
  842. }
  843. void la_ClearDetachedProp(laPanel* p){
  844. laProp *np; while(np=lstPopItem(&p->PropLinkContainer->Props)){ free(np->Identifier); memFree(np); }
  845. }
  846. laProp *la_MakeDetachedProp(laPanel* p, const char *From, const char *Rename){
  847. laIntProp *ip;
  848. laFloatProp *fp;
  849. laEnumProp *ep;
  850. laSubProp *sp;
  851. laPropPack TempPP = {0};
  852. int result = 0;
  853. result = la_GetPropFromPath(&TempPP, 0, From, 0);
  854. if(!result) return 0;
  855. laProp *np = memAcquire(la_GetPropertySize(TempPP.LastPs->p->PropertyType));
  856. memcpy(np, TempPP.LastPs->p, la_GetPropertySize(TempPP.LastPs->p->PropertyType));
  857. np->Identifier = CreateNewBuffer(char, 128);
  858. strcpy(np->Identifier, Rename);
  859. np->DetachedPP.Go = 0;
  860. np->DetachedPP.RawThis = 0;
  861. np->DetachedPP.LastPs = 0;
  862. la_CopyPropPack(&TempPP, &np->DetachedPP);
  863. switch (np->PropertyType){
  864. case LA_PROP_INT:
  865. case LA_PROP_INT | LA_PROP_ARRAY:
  866. ip = np; if(!np->Len){ np->Len=1; }
  867. ip->Detached = CreateNewBuffer(int, np->Len);
  868. for(int i=0;i<np->Len;i++){ ((int*)ip->Detached)[i]=ip->DefVal; }
  869. break;
  870. case LA_PROP_FLOAT:
  871. case LA_PROP_FLOAT | LA_PROP_ARRAY:
  872. fp = np; if(!np->Len){ np->Len=1; }
  873. fp->Detached = CreateNewBuffer(real, np->Len);
  874. for(int i=0;i<np->Len;i++){ ((real*)fp->Detached)[i]=fp->DefVal; }
  875. break;
  876. case LA_PROP_ENUM:
  877. case LA_PROP_ENUM | LA_PROP_ARRAY:
  878. ep = np;
  879. ep->Detached = CreateNewBuffer(int, 1);
  880. ep->Detached[0] = ep->DefVal;
  881. break;
  882. case LA_PROP_SUB:
  883. sp=np; sp->GetCategory=((laSubProp*)np)->GetCategory;
  884. sp->IsDetached=1;
  885. break;
  886. }
  887. lstAppendItem(&p->PropLinkContainer->Props, np);
  888. la_AssignPropertyGeneralSub(np);
  889. la_FreePropStepCache(TempPP.Go);
  890. return np;
  891. }
  892. laProp *laAddIntProperty(laPropContainer *Container, const char *Identifier, const char *Name, const char *Description, laWidget* DefaultWidget,
  893. const char *Prefix, const char *Unit, int Max, int Min, int Step, int DefVal, const int *DefArr,
  894. int OffsetSize, laIntGetF Get, laIntSetF Set, int ArrayLength, laArrayGetLenF GetLen,
  895. laIntArraySetF SetArr, laIntArrayGetAllF GetAll, laIntArraySetAllF SetAll, laIntArraySetAllArrayF SetAllArr,
  896. laIntReadF Read, laIntArrayReadAllF ReadAll,
  897. u64bit Tag){
  898. laIntProp *p = la_CreateProperty(Container, LA_PROP_INT, Identifier, Name, Description, Prefix, Unit, DefaultWidget, Tag);
  899. if (ArrayLength > 1){
  900. p->Base.Len = ArrayLength;
  901. p->Base.PropertyType |= LA_PROP_ARRAY;
  902. }else if (GetLen)
  903. p->Base.GetLen = GetLen;
  904. p->Get = Get;
  905. p->Set = Set;
  906. p->SetAll = SetAll;
  907. p->GetAll = GetAll;
  908. p->SetAllArr = SetAllArr;
  909. p->SetArr = SetArr;
  910. p->DefArr = DefArr;
  911. p->DefVal = DefVal;
  912. p->Max = Max;
  913. p->Min = Min;
  914. p->Step = Step ? Step : 1;
  915. p->Base.Offset = OffsetSize;
  916. p->Base.OffsetIsPointer = (Tag&LA_UDF_REFER) ? 1 : 0;
  917. p->Read = Read;
  918. p->ReadAll = ReadAll;
  919. la_AssignPropertyGeneralSub(p);
  920. return p;
  921. }
  922. laProp *laAddFloatProperty(laPropContainer *Container, const char *Identifier, const char *Name, const char *Description, laWidget* DefaultWidget,
  923. const char *Prefix, const char *Unit, real Max, real Min, real Step, real DefVal, const real *DefArr,
  924. int OffsetSize, laFloatGetF Get, laFloatSetF Set, int ArrayLength, laArrayGetLenF GetLen,
  925. laFloatArraySetF SetArr, laFloatArrayGetAllF GetAll, laFloatArraySetAllF SetAll, laFloatArraySetAllArrayF SetAllArr,
  926. laFloatReadF Read, laFloatArrayReadAllF ReadAll,
  927. u64bit Tag){
  928. laFloatProp *p = la_CreateProperty(Container, LA_PROP_FLOAT, Identifier, Name, Description, Prefix, Unit, DefaultWidget, Tag);
  929. if (ArrayLength > 1){
  930. p->Base.Len = ArrayLength;
  931. p->Base.PropertyType |= LA_PROP_ARRAY;
  932. }else if (GetLen)
  933. p->Base.GetLen = GetLen;
  934. p->Get = Get;
  935. p->Set = Set;
  936. p->SetAll = SetAll;
  937. p->GetAll = GetAll;
  938. p->SetAllArr = SetAllArr;
  939. p->SetArr = SetArr;
  940. p->DefArr = DefArr;
  941. p->DefVal = DefVal;
  942. p->Max = Max;
  943. p->Min = Min;
  944. p->Step = Step ? Step : 0.01;
  945. p->Base.Offset = OffsetSize;
  946. p->Base.OffsetIsPointer = (Tag&LA_UDF_REFER) ? 1 : 0;
  947. p->Read = Read;
  948. p->ReadAll = ReadAll;
  949. la_AssignPropertyGeneralSub(p);
  950. return p;
  951. }
  952. laProp *laAddEnumProperty(laPropContainer *Container, const char *Identifier, const char *Name, const char *Description, laWidget* DefaultWidget,
  953. const char *Prefix, const char *Unit, int DefVal, const int *DefArr,
  954. int OffsetSize, laEnumGetF Get, laEnumSetF Set, int ArrayLength, laArrayGetLenF GetLen,
  955. laEnumArraySetF SetArr, laEnumArrayGetAllF GetAll, laEnumArraySetAllF SetAll,
  956. laEnumReadF Read, laEnumArrayReadAllF ReadAll,
  957. u64bit Tag){
  958. laEnumProp *p = la_CreateProperty(Container, LA_PROP_ENUM, Identifier, Name, Description, Prefix, Unit, DefaultWidget, Tag);
  959. if (ArrayLength > 1){
  960. p->Base.Len = ArrayLength;
  961. p->Base.PropertyType |= LA_PROP_ARRAY;
  962. }else if (GetLen)
  963. p->Base.GetLen = GetLen;
  964. p->Get = Get;
  965. p->Set = Set;
  966. p->SetAll = SetAll;
  967. p->GetAll = GetAll;
  968. p->SetArr = SetArr;
  969. p->DefArr = DefArr;
  970. p->DefVal = DefVal;
  971. p->Base.Offset = OffsetSize;
  972. p->Base.OffsetIsPointer = (Tag&LA_UDF_REFER) ? 1 : 0;
  973. p->Read = Read;
  974. p->ReadAll = ReadAll;
  975. la_AssignPropertyGeneralSub(p);
  976. return p;
  977. }
  978. int laAddEnumItem(laProp *p, const char *Identifier, const char *Name, const char *Description, uint32_t IconID){
  979. laEnumItem *ei = memAcquire(sizeof(laEnumItem));
  980. laEnumProp *ep = p;
  981. ei->Identifier = Identifier;
  982. ei->Name = Name;
  983. ei->Description = Description;
  984. ei->IconID = IconID;
  985. ei->Index = ep->Items.pLast ? ((laEnumItem *)ep->Items.pLast)->Index + 1 : 0;
  986. lstAppendItem(&ep->Items, ei);
  987. return 1;
  988. }
  989. int laAddEnumItemAs(laProp *p, const char *Identifier, const char *Name, const char *Description, int Index, uint32_t IconID){
  990. laEnumItem *ei = memAcquire(sizeof(laEnumItem));
  991. laEnumProp *ep = p;
  992. ei->Identifier = Identifier;
  993. ei->Name = Name;
  994. ei->Description = Description;
  995. ei->IconID = IconID;
  996. ei->Index = Index;
  997. lstAppendItem(&ep->Items, ei);
  998. return 1;
  999. }
  1000. laProp *laAddStringProperty(laPropContainer *Container, const char *Identifier, const char *Name, const char *Description, laWidget* DefaultWidget,
  1001. const char *Prefix, const char *Unit, const char *DefStr,
  1002. int IsSafeString, int OffsetSize, laStringGetLenF GetLen, laStringGetF Get, laStringSetF Set,
  1003. laStringReadF Read,
  1004. u64bit Tag){
  1005. laStringProp *p = la_CreateProperty(Container, LA_PROP_STRING, Identifier, Name, Description, Prefix, Unit, DefaultWidget, Tag);
  1006. p->Get = Get;
  1007. p->Set = Set;
  1008. p->Getstrlen = GetLen;
  1009. p->DefStr = DefStr;
  1010. p->Base.Offset = OffsetSize;
  1011. p->Base.OffsetIsPointer = (Tag&LA_UDF_LOCAL) ? 0 : 1;
  1012. p->Read = Read;
  1013. p->IsSafeString = IsSafeString;
  1014. la_AssignPropertyGeneralSub(p);
  1015. return p;
  1016. }
  1017. laProp *laAddSubGroup(laPropContainer *Container, const char *Identifier, const char *Name, const char *Description,
  1018. const char *TargetId, laGetNodeTypeFunc GetType, laWidget* DefaultWidget, laUiDefineFunc DefaultUiDef,
  1019. int OffsetSize, laSubGetInstanceF Get, laSubGetInstanceF GetActive, laSubGetNextF GetNext, laSubSetInstanceF Set,
  1020. laSubGetStateF GetState, laSubSetStateF SetState, int ListHandleOffset, u64bit Tag){
  1021. laSubProp *p = la_CreateProperty(Container, LA_PROP_SUB, Identifier, Name, Description, 0, 0, DefaultWidget, Tag);
  1022. p->Base.Offset = OffsetSize;
  1023. p->Get = Get;
  1024. p->GetNext = GetNext;
  1025. p->GetActive = GetActive;
  1026. p->Set = Set;
  1027. p->GetState = GetState;
  1028. p->SetState = SetState;
  1029. p->TargetID = TargetId;
  1030. p->Base.OffsetIsPointer = (Tag & LA_UDF_LOCAL) ? 0 : 1;
  1031. p->Base.UiDefine = DefaultUiDef;
  1032. p->GetType = GetType;
  1033. p->ListHandleOffset = ListHandleOffset;
  1034. p->Base.UDFNoCreate = (Tag & LA_UDF_LOCAL) ? 1 : 0;
  1035. if (Tag & LA_UDF_SINGLE || (p->Base.OffsetIsPointer && !p->ListHandleOffset && !p->GetNext && !(Tag & LA_UDF_REFER))) p->Base.UDFIsSingle = 1;
  1036. la_AssignPropertyGeneralSub(p);
  1037. return p;
  1038. }
  1039. void laSubGroupExtraFunctions(laProp* p, laSubUIFilterF* UiFilter, laSubSaveFilterF* SaveFilter, laSubUIThemeF* GetTheme, laSubUIGapF GetGap, laSubUICategoryF GetCategory){
  1040. laSubProp *sp=p;
  1041. sp->UiFilter=UiFilter; sp->SaveFilter=SaveFilter; sp->GetTheme=GetTheme; sp->GetGap=GetGap; sp->GetCategory=GetCategory;
  1042. }
  1043. void laSubGroupDetachable(laProp *SubProp, laSubTypeDetachedGet DetachedGet, laSubTypeDetachedGetNext DetachedGetNext){
  1044. laSubProp *sp = SubProp;
  1045. SubProp->Tag |= LA_DETACHABLE;
  1046. sp->DetachedGet = DetachedGet;
  1047. sp->DetachedGetNext = DetachedGetNext;
  1048. }
  1049. laProp *laAddOperatorProperty(laPropContainer *Container, const char *Identifier, const char *Name, const char *Description,
  1050. const char *OperatorID, uint32_t IconID, laWidget* DefaultWidget){
  1051. laOperatorProp *p = la_CreateProperty(Container, LA_PROP_OPERATOR, Identifier, Name, Description, 0, 0, DefaultWidget, 0);
  1052. p->OperatorID = OperatorID;
  1053. p->Base.IconID = IconID;
  1054. la_AssignPropertyGeneralSub(p);
  1055. return p;
  1056. }
  1057. laProp *laAddRawProperty(laPropContainer *Container, const char *Identifier, const char *Name, const char *Description, int OffsetSize, laRawGetSizeF GetSize, laRawGetF RawGet, laRawSetF RawSet, u64bit Tag){
  1058. if(!RawGet && !GetSize) return 0;
  1059. laRawProp *p = la_CreateProperty(Container, LA_PROP_RAW, Identifier, Name, Description, 0, 0, 0, Tag);
  1060. p->Base.Offset = OffsetSize;
  1061. p->Base.OffsetIsPointer = (Tag & LA_UDF_LOCAL) ? 0 : 1;
  1062. p->RawGet=RawGet;
  1063. p->RawGetSize=GetSize;
  1064. p->RawSet=RawSet;
  1065. la_AssignPropertyGeneralSub(p);
  1066. return p;
  1067. }
  1068. void laRawPropertyExtraFunctions(laProp* p, laRawMultiGetF MultiGet, laRawMultiCanGetF CanMultiGet){
  1069. laRawProp *rp=p; rp->RawMultiCanGet=CanMultiGet; rp->RawMultiGet=MultiGet;
  1070. }
  1071. //void laPropertySignal(laProp* p, int Throw, int Catch) {
  1072. // p->SignalThrow = Throw;
  1073. // p->SignalCatch = Catch;
  1074. //}
  1075. int laIsPropertyReadOnly(laPropPack *pp){
  1076. if (pp && pp->LastPs && pp->LastPs->p->ReadOnly) return 1;
  1077. return 0;
  1078. }
  1079. int laGetPrefixP(laPropPack *p, char buf[8][64]){
  1080. char *prefix = transLate(p->LastPs->p->Prefix);
  1081. int i = 0, row = 0;
  1082. if (!prefix) return 0;
  1083. int len=strlen(prefix);
  1084. while ((prefix[i] != U'\0') && (i+=1+strGetStringTerminateBy(&prefix[i], U',', &buf[row]))){
  1085. row++; if(i>=len){break;}
  1086. }
  1087. return 1;
  1088. }
  1089. int laGetPrefix(laProp *p, char buf[8][64]){
  1090. char *prefix = transLate(p->Prefix);
  1091. int i = 0, row = 0;
  1092. if (!prefix) return 0;
  1093. while ((prefix[i] != U'\0') && (i += 1 + strGetStringTerminateBy(&prefix[i], U',', &buf[row]))) row++;
  1094. return 1;
  1095. }
  1096. laPropContainer* laGetInstanceType(laPropPack* pp, void* instance){
  1097. if(pp->LastPs->p->PropertyType != LA_PROP_SUB) return 0;
  1098. laSubProp* sp = pp->LastPs->p;
  1099. if(instance && sp->GetType){ return sp->GetType(instance); }
  1100. return pp->LastPs->p->SubProp;
  1101. }
  1102. laUiDefineFunc laGetPropertyUiDefine(laPropPack* pp, void* instance){
  1103. if(pp->LastPs->p->UiDefine) return pp->LastPs->p->UiDefine;
  1104. laPropContainer* pc=laGetInstanceType(pp, instance);
  1105. if(pc && pc->UiDefine) return pc->UiDefine;
  1106. return laui_SubPropInfoDefault;
  1107. }
  1108. laPropContainer* la_EnsureSubTarget(laSubProp* sp, void* optional_instance){
  1109. if(sp->Base.PropertyType!=LA_PROP_SUB){return sp->Base.SubProp;}
  1110. if(optional_instance && sp->GetType) return sp->GetType(optional_instance);
  1111. if(sp->Base.SubProp){ return sp->Base.SubProp; }
  1112. if(sp->TargetID)sp->Base.SubProp=la_ContainerLookup(sp->TargetID); return sp->Base.SubProp;
  1113. }
  1114. int laReadInt(laPropPack *pp, int n){
  1115. if (pp->LastPs->p->PropertyType & LA_PROP_INT){
  1116. laIntProp *p = pp->LastPs->p;
  1117. if (p->Read) p->Read(pp->LastPs->UseInstance, n);
  1118. else
  1119. laSetInt(pp, n);
  1120. laNotifyUsersPP(pp);
  1121. return 1;
  1122. }
  1123. return 0;
  1124. }
  1125. int laSetInt(laPropPack *pp, int n){
  1126. if (pp->LastPs->p->PropertyType & LA_PROP_INT){
  1127. laIntProp *p = pp->LastPs->p;
  1128. if (p->Max != p->Min){
  1129. n = n > p->Max ? p->Max : (n < p->Min ? p->Min : n);
  1130. }
  1131. if (p->Base.DetachedPP.LastPs){
  1132. p->Detached[0] = n;
  1133. laNotifyUsersPP(pp);
  1134. return 1;
  1135. }
  1136. if (p->Set) p->Set(pp->LastPs->UseInstance, n);
  1137. elif (pp->LastPs->p->Offset>=0){
  1138. if (!p->Base.ElementBytes || p->Base.ElementBytes == 4){
  1139. if (pp->LastPs->p->OffsetIsPointer) (**((int **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1140. else (*((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1141. }elif (p->Base.ElementBytes == 2){
  1142. if (pp->LastPs->p->OffsetIsPointer) (**((short **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1143. else (*((short *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1144. }elif (p->Base.ElementBytes == 1){
  1145. if (pp->LastPs->p->OffsetIsPointer) (**((char **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1146. else (*((BYTE *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1147. }
  1148. }
  1149. laNotifyUsersPP(pp);
  1150. return 1;
  1151. }
  1152. return 0;
  1153. }
  1154. int laGetInt(laPropPack *pp){
  1155. int n;
  1156. if (pp->LastPs->p->PropertyType & LA_PROP_INT){
  1157. laIntProp *p = pp->LastPs->p;
  1158. if (p->Base.DetachedPP.LastPs){
  1159. return p->Detached[0];
  1160. }
  1161. if (!pp->LastPs->UseInstance) return 0;
  1162. if (((laIntProp *)pp->LastPs->p)->Get) return ((laIntProp *)pp->LastPs->p)->Get(pp->LastPs->UseInstance);
  1163. elif (pp->LastPs->p->Offset>=0){
  1164. if (!p->Base.ElementBytes || p->Base.ElementBytes == 4){
  1165. if (pp->LastPs->p->OffsetIsPointer) n = (**((int **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1166. else n = (*((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1167. }elif (p->Base.ElementBytes == 2){
  1168. if (pp->LastPs->p->OffsetIsPointer) n = (**((short **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1169. else n = (*((short *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1170. }elif (p->Base.ElementBytes == 1){
  1171. if (pp->LastPs->p->OffsetIsPointer) n = (**((char **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1172. else n = (*((BYTE *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1173. }
  1174. return n;
  1175. }
  1176. }
  1177. return 0;
  1178. }
  1179. int laReadFloat(laPropPack *pp, real n){
  1180. if (pp->LastPs->p->PropertyType & LA_PROP_FLOAT){
  1181. laFloatProp *p = pp->LastPs->p;
  1182. if (p->Read) p->Read(pp->LastPs->UseInstance, n);
  1183. else
  1184. laSetFloat(pp, n);
  1185. laNotifyUsersPP(pp);
  1186. return 1;
  1187. }
  1188. return 0;
  1189. }
  1190. int laSetFloat(laPropPack *pp, real n){
  1191. if (pp->LastPs->p->PropertyType & LA_PROP_FLOAT){
  1192. laFloatProp *p = pp->LastPs->p;
  1193. if (p->Max != p->Min){
  1194. n = n > p->Max ? p->Max : (n < p->Min ? p->Min : n);
  1195. }
  1196. if (p->Base.DetachedPP.LastPs){
  1197. p->Detached[0] = n;
  1198. laNotifyUsersPP(pp);
  1199. return 1;
  1200. }
  1201. if (p->Set) p->Set(pp->LastPs->UseInstance, n);
  1202. elif (pp->LastPs->p->Offset>=0){
  1203. if (pp->LastPs->p->OffsetIsPointer) (**((real **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1204. else (*((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1205. }
  1206. laNotifyUsersPP(pp);
  1207. return 1;
  1208. }
  1209. return 0;
  1210. }
  1211. real laGetFloat(laPropPack *pp){
  1212. if (pp->LastPs->p->PropertyType & LA_PROP_FLOAT){
  1213. laFloatProp *p = pp->LastPs->p;
  1214. if (p->Base.DetachedPP.LastPs){
  1215. return p->Detached[0];
  1216. }
  1217. if (!pp->LastPs->UseInstance) return 0;
  1218. if (((laFloatProp *)pp->LastPs->p)->Get) return ((laFloatProp *)pp->LastPs->p)->Get(pp->LastPs->UseInstance);
  1219. elif (pp->LastPs->p->Offset>=0){
  1220. if (pp->LastPs->p->OffsetIsPointer) return (**((real **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1221. else return (*((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1222. }
  1223. }
  1224. return 0;
  1225. }
  1226. int laGetArrayLength(laPropPack *pp){
  1227. if (!pp->LastPs->p) return 0;
  1228. if (pp->LastPs->p->GetLen) return pp->LastPs->p->GetLen(pp->LastPs->UseInstance);
  1229. else{
  1230. if(pp->LastPs->p->Len==0) pp->LastPs->p->Len=1;
  1231. return pp->LastPs->p->Len;
  1232. }
  1233. }
  1234. int laSetIntArraySingle(laPropPack *pp, int index, int n){
  1235. laIntProp *p = pp->LastPs->p;
  1236. if (p->Max != p->Min){
  1237. n = n > p->Max ? p->Max : (n < p->Min ? p->Min : n);
  1238. }
  1239. if (p->Base.DetachedPP.LastPs){
  1240. p->Detached[index] = n;
  1241. laNotifyUsersPP(pp);
  1242. return 1;
  1243. }
  1244. if (!pp->LastPs->UseInstance) return 0;
  1245. if (pp->LastPs->p->PropertyType & LA_PROP_INT){
  1246. if (p->SetArr){
  1247. p->SetArr(pp->LastPs->UseInstance, index, n);
  1248. laNotifyUsersPP(pp);
  1249. return 1;
  1250. }elif(p->SetAllArr){
  1251. int len = laGetArrayLength(pp); int* t=malloc(len*sizeof(int));
  1252. laGetIntArray(pp, t); t[index]=n;
  1253. laSetIntArrayAllArray(pp, t); free(t);
  1254. return 1;
  1255. }elif(p->Set){
  1256. laSetInt(pp, n);
  1257. return 1;
  1258. }elif (pp->LastPs->p->Offset>=0){
  1259. int *src = (pp->LastPs->p->OffsetIsPointer) ? ((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) : ((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1260. switch(pp->LastPs->p->ElementBytes){
  1261. default: case 4: src[index] = n; break;
  1262. case 2: ((short*)src)[index]=n; break;
  1263. case 1: ((char*)src)[index]=n; break;
  1264. }
  1265. laNotifyUsersPP(pp); return 1;
  1266. }
  1267. }
  1268. return 0;
  1269. }
  1270. int laSetIntArrayAll(laPropPack *pp, int n){
  1271. laIntProp *p = pp->LastPs->p;
  1272. if (p->Max != p->Min){
  1273. n = n > p->Max ? p->Max : (n < p->Min ? p->Min : n);
  1274. }
  1275. if (p->Base.DetachedPP.LastPs){
  1276. int i = 0, len = laGetArrayLength(pp);
  1277. for (i; i < len; i++){
  1278. p->Detached[i] = n;
  1279. }
  1280. laNotifyUsersPP(pp);
  1281. return 1;
  1282. }
  1283. if (!pp->LastPs->UseInstance) return 0;
  1284. if (pp->LastPs->p->PropertyType & LA_PROP_INT){
  1285. if (p->SetAll) p->SetAll(pp->LastPs->UseInstance, n);
  1286. else if (p->SetArr){
  1287. int i = 0, len = laGetArrayLength(pp);
  1288. for (i; i < len; i++){
  1289. p->SetArr(pp->LastPs->UseInstance, i, n);
  1290. }
  1291. }elif (pp->LastPs->p->Offset>=0){
  1292. int *src = (pp->LastPs->p->OffsetIsPointer) ? ((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) : ((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1293. int i = 0, len = laGetArrayLength(pp);
  1294. for (i; i < len; i++){
  1295. switch(pp->LastPs->p->ElementBytes){
  1296. default: case 4: src[i] = n; break;
  1297. case 2: ((short*)src)[i]=n; break;
  1298. case 1: ((char*)src)[i]=n; break;
  1299. }
  1300. }
  1301. }
  1302. laNotifyUsersPP(pp);
  1303. return 1;
  1304. }
  1305. return 0;
  1306. }
  1307. int laReadIntArrayAllArray(laPropPack *pp, int *arr){
  1308. if (pp->LastPs->p->PropertyType & LA_PROP_INT){
  1309. if (((laIntProp *)pp->LastPs->p)->Base.DetachedPP.LastPs){
  1310. int i = 0, len = laGetArrayLength(pp);
  1311. for (i; i < len; i++){
  1312. ((laIntProp *)pp->LastPs->p)->Detached[i] = arr[i];
  1313. }
  1314. return 1;
  1315. }
  1316. if (!pp->LastPs->UseInstance) return 0;
  1317. if (((laIntProp *)pp->LastPs->p)->SetAllArr) ((laIntProp *)pp->LastPs->p)->SetAllArr(pp->LastPs->UseInstance, arr);
  1318. else
  1319. laSetIntArrayAllArray(pp, arr);
  1320. laNotifyUsersPP(pp);
  1321. return 1;
  1322. }
  1323. return 0;
  1324. }
  1325. int laSetIntArrayAllArray(laPropPack *pp, int *arr){
  1326. if (pp->LastPs->p->PropertyType & LA_PROP_INT){
  1327. if (((laIntProp *)pp->LastPs->p)->Base.DetachedPP.LastPs){
  1328. int i = 0, len = laGetArrayLength(pp);
  1329. for (i; i < len; i++){
  1330. ((laIntProp *)pp->LastPs->p)->Detached[i] = arr[i];
  1331. }
  1332. laNotifyUsersPP(pp);
  1333. return 1;
  1334. }
  1335. if (!pp->LastPs->UseInstance) return 0;
  1336. if (((laIntProp *)pp->LastPs->p)->SetAllArr) ((laIntProp *)pp->LastPs->p)->SetAllArr(pp->LastPs->UseInstance, arr);
  1337. else if (((laIntProp *)pp->LastPs->p)->SetArr){
  1338. int i = 0, len = laGetArrayLength(pp);
  1339. for (i; i < len; i++){
  1340. ((laIntProp *)pp->LastPs->p)->SetArr(pp->LastPs->UseInstance, i, arr[i]);
  1341. }
  1342. }else if (pp->LastPs->p->Offset>=0){
  1343. int *src = (pp->LastPs->p->OffsetIsPointer) ? ((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) : ((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1344. int i = 0, len = laGetArrayLength(pp);
  1345. for (i; i < len; i++){
  1346. switch(pp->LastPs->p->ElementBytes){
  1347. default: case 4: src[i] =arr[i]; break;
  1348. case 2: ((short*)src)[i]=arr[i]; break;
  1349. case 1: ((char*)src)[i]=arr[i]; break;
  1350. }
  1351. }
  1352. }
  1353. laNotifyUsersPP(pp);
  1354. return 1;
  1355. }
  1356. return 0;
  1357. }
  1358. int laGetIntArray(laPropPack *pp, int *result){
  1359. if (pp->LastPs->p->PropertyType & LA_PROP_INT){
  1360. laIntProp *p = pp->LastPs->p;
  1361. if (p->Base.DetachedPP.LastPs){
  1362. int len = laGetArrayLength(pp);
  1363. memcpy(result, p->Detached, len * sizeof(int));
  1364. return 1;
  1365. }
  1366. if (!pp->LastPs->UseInstance) return 0;
  1367. if (!((laIntProp *)pp->LastPs->p)->GetAll){
  1368. int len = laGetArrayLength(pp);
  1369. if(len==1){ *result=laGetInt(pp); return 1; }
  1370. if(pp->LastPs->p->Offset>=0){
  1371. int *src = (pp->LastPs->p->OffsetIsPointer) ? ((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) : ((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1372. switch(pp->LastPs->p->ElementBytes){
  1373. default: case 4: memcpy(result, src, len * sizeof(int)); break;
  1374. case 2: for(int i=0;i<len;i++){ result[i]=((short*)src)[i]; } break;
  1375. case 1: for(int i=0;i<len;i++){ result[i]=((char*)src)[i]; } break;
  1376. }
  1377. }else{ *result=0; }
  1378. return 1;
  1379. }else{
  1380. ((laIntProp *)pp->LastPs->p)->GetAll(pp->LastPs->UseInstance, result);
  1381. return 1;
  1382. }
  1383. }
  1384. return 0;
  1385. }
  1386. int laSetFloatArraySingle(laPropPack *pp, int index, real n){
  1387. laFloatProp *p = pp->LastPs->p;
  1388. if (p->Max != p->Min){
  1389. n = n > p->Max ? p->Max : (n < p->Min ? p->Min : n);
  1390. }
  1391. if (p->Base.DetachedPP.LastPs){
  1392. p->Detached[index] = n;
  1393. laNotifyUsersPP(pp);
  1394. return 1;
  1395. }
  1396. if (!pp->LastPs->UseInstance) return 0;
  1397. if (pp->LastPs->p->PropertyType & LA_PROP_FLOAT){
  1398. if (p->SetArr){
  1399. p->SetArr(pp->LastPs->UseInstance, index, n);
  1400. laNotifyUsersPP(pp);
  1401. return 1;
  1402. }elif(p->SetAllArr){
  1403. int len = laGetArrayLength(pp); real* t=malloc(len*sizeof(real));
  1404. laGetFloatArray(pp, t); t[index]=n;
  1405. laSetFloatArrayAllArray(pp, t); free(t);
  1406. return 1;
  1407. }elif(p->Set){
  1408. laSetFloat(pp, n);
  1409. return 1;
  1410. }elif (pp->LastPs->p->Offset>=0){
  1411. real *src = (pp->LastPs->p->OffsetIsPointer) ? ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) : ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1412. src[index] = n;
  1413. laNotifyUsersPP(pp);
  1414. return 1;
  1415. }
  1416. }
  1417. return 0;
  1418. }
  1419. int laSetFloatArrayAll(laPropPack *pp, real n){
  1420. laFloatProp *p = pp->LastPs->p;
  1421. if (p->Max != p->Min){
  1422. n = n > p->Max ? p->Max : (n < p->Min ? p->Min : n);
  1423. }
  1424. if (p->Base.DetachedPP.LastPs){
  1425. int i = 0, len = laGetArrayLength(pp);
  1426. for (i; i < len; i++){
  1427. p->Detached[i] = n;
  1428. }
  1429. laNotifyUsersPP(pp);
  1430. return 1;
  1431. }
  1432. if (!pp->LastPs->UseInstance) return 0;
  1433. if (pp->LastPs->p->PropertyType & LA_PROP_FLOAT){
  1434. if (p->SetAll) p->SetAll(pp->LastPs->UseInstance, n);
  1435. else if (p->SetArr){
  1436. int i = 0, len = laGetArrayLength(pp);
  1437. for (i; i < len; i++){
  1438. p->SetArr(pp->LastPs->UseInstance, i, n);
  1439. }
  1440. }else if (pp->LastPs->p->Offset>=0){
  1441. real *src = (pp->LastPs->p->OffsetIsPointer) ? ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) : ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1442. int i = 0, len = laGetArrayLength(pp);
  1443. for (i; i < len; i++){ src[i] = n; }
  1444. }
  1445. laNotifyUsersPP(pp);
  1446. return 1;
  1447. }
  1448. return 0;
  1449. }
  1450. int laReadFloatArrayAllArray(laPropPack *pp, real *arr){
  1451. if (((laFloatProp *)pp->LastPs->p)->Base.DetachedPP.LastPs){
  1452. int i = 0, len = laGetArrayLength(pp);
  1453. for (i; i < len; i++){
  1454. ((laFloatProp *)pp->LastPs->p)->Detached[i] = arr[i];
  1455. }
  1456. return 1;
  1457. }
  1458. if (!pp->LastPs->UseInstance) return 0;
  1459. if (pp->LastPs->p->PropertyType & LA_PROP_FLOAT){
  1460. if (((laFloatProp *)pp->LastPs->p)->ReadAll) ((laFloatProp *)pp->LastPs->p)->ReadAll(pp->LastPs->UseInstance, arr);
  1461. else if (((laFloatProp *)pp->LastPs->p)->SetArr){
  1462. int i = 0, len = laGetArrayLength(pp);
  1463. for (i; i < len; i++){
  1464. ((laFloatProp *)pp->LastPs->p)->SetArr(pp->LastPs->UseInstance, i, arr[i]);
  1465. }
  1466. }else if (pp->LastPs->p->Offset>=0){
  1467. real *src = (pp->LastPs->p->OffsetIsPointer) ? ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) : ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1468. int i = 0, len = laGetArrayLength(pp);
  1469. for (i; i < len; i++){ src[i] = arr[i]; }
  1470. }
  1471. laNotifyUsersPP(pp);
  1472. return 1;
  1473. }
  1474. return 0;
  1475. }
  1476. int laSetFloatArrayAllArray(laPropPack *pp, real *arr){
  1477. if (((laFloatProp *)pp->LastPs->p)->Base.DetachedPP.LastPs){
  1478. int i = 0, len = laGetArrayLength(pp);
  1479. for (i; i < len; i++){
  1480. ((laFloatProp *)pp->LastPs->p)->Detached[i] = arr[i];
  1481. }
  1482. laNotifyUsersPP(pp);
  1483. return 1;
  1484. }
  1485. if (!pp->LastPs->UseInstance) return 0;
  1486. if (pp->LastPs->p->PropertyType & LA_PROP_FLOAT){
  1487. if (((laFloatProp *)pp->LastPs->p)->SetAllArr) ((laFloatProp *)pp->LastPs->p)->SetAllArr(pp->LastPs->UseInstance, arr);
  1488. else if (((laFloatProp *)pp->LastPs->p)->SetArr){
  1489. int i = 0, len = laGetArrayLength(pp);
  1490. for (i; i < len; i++){
  1491. ((laFloatProp *)pp->LastPs->p)->SetArr(pp->LastPs->UseInstance, i, arr[i]);
  1492. }
  1493. }else if (pp->LastPs->p->Offset>=0){
  1494. real *src = (pp->LastPs->p->OffsetIsPointer) ? ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) : ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1495. int i = 0, len = laGetArrayLength(pp);
  1496. for (i; i < len; i++){ src[i] = arr[i]; }
  1497. }
  1498. laNotifyUsersPP(pp);
  1499. return 1;
  1500. }
  1501. return 0;
  1502. }
  1503. int laGetFloatArray(laPropPack *pp, real *result){
  1504. if (pp->LastPs->p->PropertyType & LA_PROP_FLOAT){
  1505. laFloatProp *p = pp->LastPs->p;
  1506. if (p->Base.DetachedPP.LastPs){
  1507. int len = laGetArrayLength(pp);
  1508. memcpy(result, p->Detached, len * sizeof(real));
  1509. return 1;
  1510. }
  1511. if (!pp->LastPs->UseInstance) return 0;
  1512. if (!((laFloatProp *)pp->LastPs->p)->GetAll){
  1513. int len = laGetArrayLength(pp);
  1514. if(len==1){ *result=laGetFloat(pp); return 1; }
  1515. if(pp->LastPs->p->Offset>=0){
  1516. real *src = (pp->LastPs->p->OffsetIsPointer) ? ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) : ((real *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1517. memcpy(result, src, len * sizeof(real));
  1518. }else{ *result=0; }
  1519. return 1;
  1520. }else{
  1521. ((laFloatProp *)pp->LastPs->p)->GetAll(pp->LastPs->UseInstance, result);
  1522. return 1;
  1523. }
  1524. }
  1525. return 0;
  1526. }
  1527. int laReadEnum(laPropPack *pp, int n){
  1528. if (pp->LastPs->p->PropertyType & LA_PROP_ENUM){
  1529. if (((laEnumProp *)pp->LastPs->p)->Read) ((laEnumProp *)pp->LastPs->p)->Read(pp->LastPs->UseInstance, n);
  1530. else laSetEnum(pp, n);
  1531. laNotifyUsersPP(pp);
  1532. return 1;
  1533. }
  1534. return 0;
  1535. }
  1536. int laSetEnumExternal(laPropPack *pp, int n){
  1537. if (pp->LastPs->p->PropertyType & LA_PROP_ENUM){
  1538. laEnumProp *ep = pp->LastPs->p;
  1539. laEnumItem *ei;
  1540. int i = 0;
  1541. for (ei = ep->Items.pFirst; ei; ei = ei->Item.pNext){
  1542. if (i == n) break; i++;
  1543. }
  1544. laSetEnum(pp, ei->Index);
  1545. }
  1546. return 0;
  1547. }
  1548. int laSetEnum(laPropPack *pp, int n){
  1549. if (pp->LastPs->p->PropertyType & LA_PROP_ENUM){
  1550. laEnumProp *p = pp->LastPs->p;
  1551. if (p->Base.DetachedPP.LastPs){
  1552. p->Detached[0] = n;
  1553. laNotifyUsersPP(pp);
  1554. return 1;
  1555. }
  1556. if (!pp->LastPs->UseInstance) return 0;
  1557. if (p->Set) p->Set(pp->LastPs->UseInstance, n);
  1558. elif(p->Base.Offset>=0) {
  1559. if (!p->Base.ElementBytes || p->Base.ElementBytes == 4){
  1560. if (pp->LastPs->p->OffsetIsPointer) (**((int **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1561. else (*((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1562. }elif (p->Base.ElementBytes == 2){
  1563. if (pp->LastPs->p->OffsetIsPointer) (**((short **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1564. else (*((short *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1565. }elif (p->Base.ElementBytes == 1){
  1566. if (pp->LastPs->p->OffsetIsPointer) (**((char **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1567. else (*((BYTE *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset))) = n;
  1568. }
  1569. }
  1570. laNotifyUsersPP(pp);
  1571. return 1;
  1572. }
  1573. return 0;
  1574. }
  1575. int laReadEnumArrayAll(laPropPack *pp, int *n){
  1576. int i, len = pp->LastPs->p->Len;
  1577. if (pp->LastPs->p->PropertyType & LA_PROP_ENUM){
  1578. if (((laEnumProp *)pp->LastPs->p)->ReadAll) ((laEnumProp *)pp->LastPs->p)->ReadAll(pp->LastPs->UseInstance, n);
  1579. else
  1580. for (i = 0; i < len; i++){
  1581. laSetEnumArrayIndexed(pp, i, n[i]);
  1582. }
  1583. laNotifyUsersPP(pp);
  1584. return 1;
  1585. }
  1586. return 0;
  1587. }
  1588. int laSetEnumArrayIndexedExternal(laPropPack *pp, int index, int n){
  1589. if (pp->LastPs->p->PropertyType & LA_PROP_ENUM){
  1590. laEnumProp *ep = pp->LastPs->p;
  1591. laEnumItem *ei;
  1592. int i = 0;
  1593. for (ei = ep->Items.pFirst; ei; ei = ei->Item.pNext){
  1594. if (i == n) break;
  1595. i++;
  1596. }
  1597. laSetEnumArrayIndexed(pp, index,ei->Index);
  1598. }
  1599. return 0;
  1600. }
  1601. int laSetEnumArrayIndexed(laPropPack *pp, int index, int n){
  1602. if (pp->LastPs->p->PropertyType & LA_PROP_ENUM){
  1603. laEnumProp *p = pp->LastPs->p;
  1604. if (p->Base.DetachedPP.LastPs){
  1605. p->Detached[index] = n;
  1606. laNotifyUsersPP(pp);return 1;
  1607. }
  1608. if (!pp->LastPs->UseInstance) return 0;
  1609. if (p->SetArr) p->SetArr(pp->LastPs->UseInstance, index, n);
  1610. elif(p->Set && index==0){ laSetEnum(pp, n); }
  1611. elif(p->Base.Offset>=0){
  1612. if (!p->Base.ElementBytes || p->Base.ElementBytes == 4){
  1613. if (pp->LastPs->p->OffsetIsPointer) (**((int **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset + sizeof(int) * index))) = n;
  1614. else (*((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset + sizeof(int) * index))) = n;
  1615. }elif (p->Base.ElementBytes == 2){
  1616. if (pp->LastPs->p->OffsetIsPointer) (**((short **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset + sizeof(short) * index))) = n;
  1617. else (*((short *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset + sizeof(short) * index))) = n;
  1618. }elif (p->Base.ElementBytes == 1){
  1619. if (pp->LastPs->p->OffsetIsPointer) (**((char **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset + sizeof(char) * index))) = n;
  1620. else (*((BYTE *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset + sizeof(char) * index))) = n;
  1621. }
  1622. }
  1623. laNotifyUsersPP(pp);
  1624. return 1;
  1625. }
  1626. return 0;
  1627. }
  1628. int laSetEnumArrayAllArray(laPropPack* pp, laEnumItem** ei){
  1629. int len=laGetArrayLength(pp);
  1630. for(int i=0;i<len;i++){
  1631. laSetEnumArrayIndexed(pp,i,ei[i]->Index);
  1632. }
  1633. return 0;
  1634. }
  1635. int laSetEnumArrayAll(laPropPack* pp, int EnumN){
  1636. int len=laGetArrayLength(pp);
  1637. laEnumProp *ep = pp->LastPs->p; laEnumItem *ei;
  1638. int i = 0; for (ei = ep->Items.pFirst; ei; ei = ei->Item.pNext){ if (i == EnumN) break; i++; }
  1639. for(int i=0;i<len;i++){
  1640. laSetEnumArrayIndexed(pp,i,ei->Index);
  1641. }
  1642. return 0;
  1643. }
  1644. laEnumItem *laGetEnum(laPropPack *pp){
  1645. int n;
  1646. laEnumItem *ei;
  1647. if (pp->LastPs->p->PropertyType & LA_PROP_ENUM){
  1648. laEnumProp *p = pp->LastPs->p;
  1649. if (p->Base.DetachedPP.LastPs){
  1650. n = p->Detached[0];
  1651. }elif (!pp->LastPs->UseInstance) return 0;
  1652. elif (p->Get) n = p->Get(pp->LastPs->UseInstance);
  1653. elif(p->Base.Offset>=0){
  1654. if (!pp->LastPs->UseInstance) n = 0;
  1655. elif (!p->Base.ElementBytes || p->Base.ElementBytes == 4){
  1656. if (pp->LastPs->p->OffsetIsPointer) n = (**((int **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1657. else n = (*((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1658. }elif (p->Base.ElementBytes == 2){
  1659. if (pp->LastPs->p->OffsetIsPointer) n = (**((short **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1660. else n = (*((short *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1661. }elif (p->Base.ElementBytes == 1){
  1662. if (pp->LastPs->p->OffsetIsPointer) n = (**((char **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1663. else n = (*((BYTE *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)));
  1664. }
  1665. }
  1666. for (ei = p->Items.pFirst; ei; ei = ei->Item.pNext){
  1667. if (n == ei->Index) return ei;
  1668. }
  1669. }
  1670. return ((laEnumProp *)pp->LastPs->p)->Items.pFirst;
  1671. }
  1672. laEnumItem *laGetEnumArrayIndexed(laPropPack *pp, int index){
  1673. int n;
  1674. int i = 0;
  1675. laEnumItem *ei;
  1676. int result[16];
  1677. if (pp->LastPs->p->PropertyType & LA_PROP_ENUM){
  1678. laEnumProp *p = pp->LastPs->p;
  1679. if (p->Base.DetachedPP.LastPs){
  1680. n = p->Detached[index];
  1681. }elif (!p->GetAll){
  1682. if(laGetArrayLength(pp)==1){return laGetEnum(pp);}
  1683. if(p->Base.Offset>=0){
  1684. if (!pp->LastPs->UseInstance) n = 0;
  1685. elif (!p->Base.ElementBytes || p->Base.ElementBytes == 4){
  1686. if (pp->LastPs->p->OffsetIsPointer) n = (**((int **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) + index * sizeof(int));
  1687. else n = (*((int *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset + index * sizeof(int))));
  1688. }elif (p->Base.ElementBytes == 2){
  1689. if (pp->LastPs->p->OffsetIsPointer) n = (**((short **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) + index * sizeof(short));
  1690. else n = (*((short *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset + index * sizeof(short))));
  1691. }elif (p->Base.ElementBytes == 1){
  1692. if (pp->LastPs->p->OffsetIsPointer) n = (**((char **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset)) + index * sizeof(char));
  1693. else n = (*((BYTE *)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset + index * sizeof(char))));
  1694. }
  1695. }
  1696. }else{
  1697. if (!pp->LastPs->UseInstance) n = 0;
  1698. else{
  1699. p->GetAll(pp->LastPs->UseInstance, result);
  1700. n = result[index];
  1701. }
  1702. }
  1703. for (ei = p->Items.pFirst; ei; ei = ei->Item.pNext){
  1704. if (n == ei->Index) return ei;
  1705. }
  1706. }
  1707. return 0;
  1708. }
  1709. int laGetEnumArray(laPropPack *pp, laEnumItem **result){
  1710. int len = laGetArrayLength(pp);
  1711. int i = 0;
  1712. laEnumItem *ei;
  1713. int Results[16];
  1714. laEnumProp *p = pp->LastPs->p;
  1715. if (p->Base.DetachedPP.LastPs){
  1716. for (int i = 0; i < len; i++){
  1717. Results[i] = p->Detached[i];
  1718. for (ei = ((laEnumProp *)pp->LastPs->p)->Items.pFirst; ei; ei = ei->Item.pNext){
  1719. if (ei->Index == Results[i]){result[i] = ei; break;}
  1720. }
  1721. }
  1722. }elif (!((laEnumProp *)pp->LastPs->p)->GetAll){
  1723. for (i; i < len; i++){
  1724. result[i] = laGetEnumArrayIndexed(pp, i);
  1725. }
  1726. return 1;
  1727. }else{
  1728. int a = 0;
  1729. ((laEnumProp *)pp->LastPs->p)->GetAll(pp->LastPs->UseInstance, Results);
  1730. for (i = 0; i < len; i++){
  1731. for (ei = ((laEnumProp *)pp->LastPs->p)->Items.pFirst; ei; ei = ei->Item.pNext){
  1732. if (ei->Index == Results[i]){ result[i] = ei; break; }
  1733. }
  1734. }
  1735. }
  1736. return 0;
  1737. }
  1738. laEnumItem *laGetEnumFromIdentifier(laEnumProp *p, char *Identifier){
  1739. laEnumItem *ei;
  1740. for (ei = p->Items.pFirst; ei; ei = ei->Item.pNext){
  1741. if (!strcmp(ei->Identifier, Identifier)) return ei;
  1742. }
  1743. return p->Items.pFirst;
  1744. }
  1745. int laEnumHasIcon(laPropPack *pp){
  1746. laEnumProp *p = pp->LastPs->p;
  1747. laEnumItem *ei;
  1748. if ((p->Base.PropertyType & LA_PROP_ENUM) != LA_PROP_ENUM) return 0;
  1749. for (ei = p->Items.pFirst; ei; ei = ei->Item.pNext){
  1750. if (ei->IconID) return 1;
  1751. }
  1752. return 0;
  1753. }
  1754. int laGetEnumEntryLen(laPropPack *pp){
  1755. int i = 0;
  1756. laEnumItem *ei;
  1757. if (pp->LastPs->p->PropertyType & LA_PROP_ENUM){
  1758. if (((laEnumProp *)pp->LastPs->p)->GetLen) return ((laEnumProp *)pp->LastPs->p)->GetLen(pp->LastPs->UseInstance);
  1759. for (ei = ((laEnumProp *)pp->LastPs->p)->Items.pFirst; ei; ei = ei->Item.pNext){
  1760. i += 1;
  1761. }
  1762. return i;
  1763. }
  1764. return 0;
  1765. }
  1766. int laReadString(laPropPack *pp, char *str){
  1767. if (pp->LastPs->p->PropertyType == LA_PROP_STRING){
  1768. if (((laStringProp *)pp->LastPs->p)->Read) ((laStringProp *)pp->LastPs->p)->Read(pp->LastPs->UseInstance, str);
  1769. else
  1770. laSetString(pp, str);
  1771. laNotifyUsersPP(pp);
  1772. return 1;
  1773. }
  1774. return 0;
  1775. }
  1776. int laSetString(laPropPack *pp, char *str){
  1777. char **add = 0;
  1778. if (pp->LastPs->p->PropertyType == LA_PROP_STRING){
  1779. laStringProp *p = pp->LastPs->p;
  1780. if (p->Base.DetachedPP.LastPs){
  1781. strCopyFull(p->Detached, str);
  1782. laNotifyUsersPP(pp);
  1783. return 1;
  1784. }
  1785. if (p->Set){
  1786. p->Set(pp->LastPs->UseInstance, str);
  1787. laNotifyUsersPP(pp);
  1788. return 1;
  1789. }
  1790. if (!pp->LastPs->UseInstance) return 0;
  1791. if (p->IsSafeString){
  1792. add = ((char **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1793. strSafeSet(add, str);
  1794. laNotifyUsersPP(pp);
  1795. return 1;
  1796. }
  1797. if (p->Base.Offset){
  1798. if (p->Base.OffsetIsPointer){
  1799. add = ((char **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1800. if (!(*add)) return 0;
  1801. strCopyFull(*add, str);
  1802. }else strCopyFull(((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset), str);
  1803. }
  1804. laNotifyUsersPP(pp);
  1805. return 1;
  1806. }
  1807. return 0;
  1808. }
  1809. int laGetString(laPropPack *pp, char *result, char** direct_result){
  1810. if (pp->LastPs->p->PropertyType == LA_PROP_STRING){
  1811. laStringProp *p = pp->LastPs->p;
  1812. if (p->Base.DetachedPP.LastPs){
  1813. strCopyFull(result, p->Detached);
  1814. return 1;
  1815. }
  1816. if (!pp->LastPs->UseInstance) return 0;
  1817. if (p->Get){ p->Get(pp->LastPs->UseInstance, result, direct_result); return 1; }
  1818. if (pp->LastPs->p->Offset>=0){
  1819. if (p->IsSafeString){
  1820. laSafeString **add = ((laSafeString **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1821. //printf(" -- %s\n",p->Base.Identifier);
  1822. if ((!pp->LastPs->UseInstance) || (!*add)) return 0;
  1823. if((*add)->Ptr){ *direct_result = (*add)->Ptr; return 1;}
  1824. return 0;
  1825. }else{
  1826. if (pp->LastPs->p->OffsetIsPointer) *direct_result=*((char **)((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset));
  1827. else *direct_result=((BYTE *)pp->LastPs->UseInstance + pp->LastPs->p->Offset);
  1828. }
  1829. }
  1830. return 1;
  1831. }
  1832. return 0;
  1833. }
  1834. void *laGetInstance(laProp *sub, void *FromInstance, laPropIterator *Iter){
  1835. laSubProp *sp = sub;
  1836. laPropIterator IT = {0};
  1837. if (!Iter) Iter = &IT;
  1838. if (Iter) Iter->Parent = FromInstance;
  1839. if (sub->PropertyType == LA_PROP_SUB){
  1840. if (sp->Base.DetachedPP.LastPs){ if(sp->DetachedGet) return sp->DetachedGet(0, Iter);
  1841. return sp->Detached;
  1842. }
  1843. if (!FromInstance) return 0;
  1844. if (sp->Get) return sp->Get(FromInstance, Iter);
  1845. else if (sp->ListHandleOffset){
  1846. void *address = *((u64bit*)((BYTE *)FromInstance + sp->ListHandleOffset));
  1847. return address;
  1848. }else return laGetActiveInstance(sub, FromInstance, Iter);
  1849. }
  1850. return 0;
  1851. }
  1852. void *laGetNextInstance(laProp *sub, void *ThisInstance, laPropIterator *Iter){
  1853. laSubProp *sp = sub;
  1854. if (sub->PropertyType == LA_PROP_SUB){
  1855. if (sp->Base.DetachedPP.LastPs && sp->DetachedGetNext) return sp->DetachedGetNext(ThisInstance, Iter);
  1856. if (!ThisInstance) return 0;
  1857. if (sp->GetNext) return (sp->GetNext(ThisInstance, Iter));
  1858. else if (sp->ListHandleOffset){
  1859. laListItem *li = ThisInstance;
  1860. return li->pNext;
  1861. }
  1862. }
  1863. return 0;
  1864. }
  1865. void *laGetActiveInstanceStrict(laProp *sub, void *FromInstance){
  1866. laSubProp *sp = sub;
  1867. if (sub->PropertyType == LA_PROP_SUB){
  1868. if (sp->Base.DetachedPP.LastPs){
  1869. return sp->Detached;
  1870. }
  1871. if (!FromInstance) return 0;
  1872. if (sp->GetActive) return sp->GetActive(FromInstance, 0);
  1873. if (sub->Offset>=0){
  1874. if (sub->OffsetIsPointer /*&& (sp->Get||sp->ListHandleOffset)*/){
  1875. void **a = (void **)((BYTE *)FromInstance + sub->Offset); return *a;
  1876. }else return ((BYTE *)FromInstance + sub->Offset);
  1877. }
  1878. }
  1879. return 0; // laGetInstance(sub, FromInstance, 0);
  1880. }
  1881. void *laGetActiveInstance(laProp *sub, void *FromInstance, laPropIterator *Iter){
  1882. laSubProp *sp = sub;
  1883. if (sub->PropertyType == LA_PROP_SUB){
  1884. if (sp->Base.DetachedPP.LastPs){
  1885. return sp->Detached;
  1886. }
  1887. if (!FromInstance) return 0;
  1888. if (sp->GetActive) return sp->GetActive(FromInstance, Iter);
  1889. if (sp->Get) return laGetInstance(sub, FromInstance, Iter);
  1890. if (sub->Offset>=0){
  1891. if (sub->OffsetIsPointer){
  1892. void **a = (void **)((BYTE *)FromInstance + sub->Offset); return *a;
  1893. }else return ((BYTE *)FromInstance + sub->Offset);
  1894. }
  1895. }
  1896. return 0;
  1897. }
  1898. void laSetActiveInstance(laProp *sub, void *FromInstance, void *Instance){
  1899. laSubProp *sp = sub;
  1900. if (sub->PropertyType == LA_PROP_SUB){
  1901. MAIN._CONTAINER_SETTING=sub->Container;
  1902. MAIN._PROP_SETTING=sub;
  1903. if (sp->Base.DetachedPP.LastPs){
  1904. memAssignRef(sp, &sp->Detached, Instance);
  1905. laNotifySubPropUsers(sp, FromInstance);
  1906. return;
  1907. }
  1908. if (!FromInstance) return;
  1909. if (sp->SetState){
  1910. laNotifySubPropUsers(sp, FromInstance);
  1911. sp->SetState(FromInstance, Instance, LA_UI_ACTIVE);
  1912. }
  1913. if (sp->Set){
  1914. laNotifySubPropUsers(sp, FromInstance);
  1915. sp->Set(FromInstance, Instance);
  1916. }
  1917. if (sub->OffsetIsPointer && sub->Offset>=0){
  1918. void **a = (void **)((BYTE *)FromInstance + sub->Offset);
  1919. laNotifySubPropUsers(sp, FromInstance);
  1920. memAssignRefSafe(sub->Container->Hyper?sp:0,FromInstance, a, Instance);
  1921. }
  1922. }
  1923. return;
  1924. }
  1925. void laAppendInstance(laSubProp *sub, void *FromInstance, void *Instance){
  1926. if (sub->ListHandleOffset){
  1927. lstAppendItem((BYTE *)FromInstance + sub->ListHandleOffset, Instance);
  1928. }
  1929. }
  1930. void* laGetRaw(laPropPack *pp, int* r_size, int* return_is_a_copy){
  1931. if (pp->LastPs->p->PropertyType == LA_PROP_RAW){
  1932. laRawProp* rp=pp->LastPs->p;
  1933. if(rp->RawGet){ return rp->RawGet(pp->LastPs->UseInstance, r_size, return_is_a_copy); }
  1934. int s=rp->RawGetSize(pp->LastPs->UseInstance); void* data=0;
  1935. if(rp->Base.OffsetIsPointer){ data=*((void**)(((char*)pp->LastPs->UseInstance)+rp->Base.Offset)); }
  1936. else{ data=((char*)pp->LastPs->UseInstance)+rp->Base.Offset; }
  1937. *return_is_a_copy=0; if(r_size) *r_size=s;
  1938. return data;
  1939. } return 0;
  1940. }
  1941. int laGetMultiRaw(laPropPack* pp, int* r_chunks, int* r_sizes, void** pointers){
  1942. if (pp->LastPs->p->PropertyType == LA_PROP_RAW){
  1943. laRawProp* rp=pp->LastPs->p; if(!rp->RawMultiGet){ return 0; }
  1944. rp->RawMultiGet(pp->LastPs->UseInstance,r_chunks,r_sizes,pointers);
  1945. if(*r_chunks>0){ return 1; } return 0;
  1946. }
  1947. return 0;
  1948. }
  1949. int laSetRaw(laPropPack *pp, void* data, uint32_t _size){
  1950. if (pp->LastPs->p->PropertyType == LA_PROP_RAW){ laRawProp* rp=pp->LastPs->p;
  1951. if(rp->RawSet){ rp->RawSet(pp->LastPs->UseInstance, data, _size); return 1; }
  1952. if(rp->Base.OffsetIsPointer){ void** target=(((char*)pp->LastPs->UseInstance)+rp->Base.Offset); if(*target) free(*target);
  1953. void* newd=_size?calloc(1,_size):0; if(_size)memcpy(newd, data, _size); (*target)=newd;
  1954. }
  1955. else{ memcpy(((char*)pp->LastPs->UseInstance)+rp->Base.Offset,data,_size); }
  1956. return 1;
  1957. } return 0;
  1958. }
  1959. int laTryGetInstanceIdentifier(void* Instance, laPropContainer* pc, char* identifier, char** here){
  1960. if(!Instance || !pc) return 0;
  1961. laProp* p=la_PropLookupIdentifierItem(&pc->Props);
  1962. if(p){
  1963. laPropPack PP={0}; laPropStep PS={0};
  1964. PS.p=p; PS.Type='.'; PS.UseInstance=Instance; PP.LastPs=&PS; PP.EndInstance=Instance;
  1965. if(p->PropertyType==LA_PROP_STRING){ laGetString(&PP,identifier,here); }
  1966. elif(p->PropertyType&LA_PROP_INT){ int r[16]={0}; laGetIntArray(&PP,r); sprintf("(%s=%d)",p->Identifier,r[0]); }
  1967. elif(p->PropertyType&LA_PROP_FLOAT){ real r[16]={0}; laGetFloatArray(&PP,r); sprintf("(%s=%lf)",p->Identifier,r[0]); }
  1968. elif(p->PropertyType&LA_PROP_ENUM){ laEnumItem *r[16]={0}; laGetEnumArray(&PP,r); sprintf("(%s=%lf)",p->Identifier,r[0]?r[0]->Identifier:"?"); }
  1969. else{ sprintf("(%.6x)",identifier,Instance); }
  1970. return 1;
  1971. }
  1972. return 0;
  1973. }
  1974. int laGetIntRange(laPropPack *pp, int *min, int *max){
  1975. laIntProp *p = pp->LastPs->p;
  1976. if (p->Max != p->Min){
  1977. *min = p->Min;
  1978. *max = p->Max;
  1979. return 1;
  1980. }
  1981. return 0;
  1982. }
  1983. int laGetFloatRange(laPropPack *pp, real *min, real *max){
  1984. laFloatProp *p = pp->LastPs->p;
  1985. if (p->Max != p->Min){
  1986. *min = p->Min;
  1987. *max = p->Max;
  1988. return 1;
  1989. }
  1990. return 0;
  1991. }
  1992. int laCanGetMultiRaw(laProp *p,void* inst){
  1993. laRawProp *rp = p; if (p->PropertyType == LA_PROP_RAW){
  1994. if (rp->RawMultiGet && (!rp->RawMultiCanGet || rp->RawMultiCanGet(inst))) return 1; } return 0;
  1995. }
  1996. int laCanGetState(laProp *sub){ laSubProp *sp = sub; if (sub->PropertyType == LA_PROP_SUB){ if (sp->GetState) return 1; } return 0; }
  1997. int laCanGetTheme(laProp *sub){ laSubProp *sp = sub; if (sub->PropertyType == LA_PROP_SUB){ if (sp->GetTheme) return 1; } return 0; }
  1998. int laCanGetGap(laProp *sub){ laSubProp *sp = sub; if (sub->PropertyType == LA_PROP_SUB){ if (sp->GetGap) return 1; } return 0; }
  1999. int laCanGetCategory(laProp *sub){ laSubProp *sp = sub; if (sub->PropertyType == LA_PROP_SUB){ if (sp->GetCategory) return 1; } return 0; }
  2000. int laGetUiState(laProp *sub, void *Instance){
  2001. laSubProp *sp = sub; if (sub->PropertyType == LA_PROP_SUB){ if (sp->GetState) return sp->GetState(Instance); } return 0;
  2002. }
  2003. laTheme* laGetUiTheme(laProp *sub, void* parent, void *Instance){
  2004. laSubProp *sp = sub; if (sub->PropertyType == LA_PROP_SUB){ if (sp->GetTheme) return sp->GetTheme(parent,Instance); } return 0;
  2005. }
  2006. int laGetUiGap(laProp *sub, void* parent, void *Instance){
  2007. laSubProp *sp = sub; if (sub->PropertyType == LA_PROP_SUB){ if (sp->GetGap) return sp->GetGap(parent,Instance); } return 0;
  2008. }
  2009. void laGetCategory(laProp *sub, void* parent, void *Instance, char* buf, char** buf_ptr){
  2010. laSubProp *sp = sub; if (sub->PropertyType == LA_PROP_SUB){ if (sp->GetCategory) sp->GetCategory(parent,Instance, buf, buf_ptr); }
  2011. }
  2012. int laSetState(laProp *sub, void *FromInstance, void *Instance, int State){
  2013. laSubProp *sp = sub;
  2014. if (sub->PropertyType == LA_PROP_SUB){
  2015. if (sp->SetState){
  2016. laNotifySubPropUsers(sub, FromInstance);
  2017. return sp->SetState(FromInstance, Instance, State);
  2018. }
  2019. }
  2020. return 0;
  2021. }
  2022. int laActuateProp(laPropPack *This, laPropPack *RunPP, laOperator *OptionalFrom, laEvent *e){
  2023. if (RunPP->LastPs->p->PropertyType & LA_PROP_OPERATOR){
  2024. if (!((laOperatorProp *)RunPP->LastPs->p)->OperatorType){
  2025. ((laOperatorProp *)RunPP->LastPs->p)->OperatorType = laGetOperatorType(((laOperatorProp *)RunPP->LastPs->p)->OperatorID);
  2026. }
  2027. return laInvokeP(OptionalFrom, ((laOperatorProp *)RunPP->LastPs->p)->OperatorType, e, This, 0, 0); //ARGS
  2028. }
  2029. return LA_CANCELED;
  2030. }
  2031. void laMarkPropChanged(laPropPack* pp){
  2032. if(!pp) return;
  2033. if(!pp->Go){ if(pp->LastPs&&pp->LastPs->p->Container && pp->LastPs->p->Container->Hyper==2 && pp->LastPs->UseInstance){
  2034. laMemNodeHyper* m=memGetHead(pp->LastPs->UseInstance,0); m->Modified=1; } }
  2035. else for(laPropStep* ps=pp->Go;ps;ps=ps->pNext){
  2036. if(ps->Type=='.' && ps->p->Container->Hyper==2 && ps->UseInstance){
  2037. laMemNodeHyper* m=memGetHead(ps->UseInstance,0); m->Modified=1; }
  2038. }
  2039. laMarkPropChanged(pp->RawThis);
  2040. }
  2041. void laMarkMemChanged(void* memuser){
  2042. int level; laMemNodeHyper* m=memGetHead(memuser,&level); if(level!=2) return;
  2043. m->Modified=1;
  2044. }
  2045. void laMarkMemClean(void* memuser){
  2046. int level; laMemNodeHyper* m=memGetHead(memuser,&level); if(level!=2) return;
  2047. m->Modified=0;
  2048. }
  2049. laPropContainer *la_SetGeneralRoot(laPropContainer **GeneralRoot, const char *Identifier, const char *Name, const char *Description){
  2050. laPropContainer* ret =memAcquire(sizeof(laPropContainer));
  2051. *GeneralRoot = ret;
  2052. ret->Identifier = Identifier;
  2053. ret->Name = Name;
  2054. ret->Description = Description;
  2055. ret->OtherAlloc=1;
  2056. lstAppendItem(&MAIN.PropContainers, ret);
  2057. return ret;
  2058. }
  2059. void laSetRootInstance(void *root){
  2060. MAIN.DataRoot.RootInstance = root;
  2061. }
  2062. laPropContainer *laDefineRoot(){
  2063. if (!MAIN.DataRoot.Root) MAIN.DataRoot.Root = laAddPropertyContainer("root", "__ROOT__", "Root Node In NUL4.0 Data System", U'🞈', 0, 0, 0, 0, 2|LA_PROP_OTHER_ALLOC);
  2064. return MAIN.DataRoot.Root;
  2065. }
  2066. void laThrowToTrashBin(void *Data, char *ContainerString){
  2067. laPropContainer *pc = la_ContainerLookup(ContainerString);
  2068. lstAppendItem(&pc->TrashBin, Data);
  2069. }
  2070. int laValidateHyper2(laPropContainer* pc, laPropContainer* ParentHyper2, laSafeString** errors){
  2071. int pass=1;
  2072. for(laProp* p=pc->Props.pFirst;p;p=p->Item.pNext){
  2073. if(p->PropertyType!=LA_PROP_SUB) continue;
  2074. laSubProp* sp=p;
  2075. if(!p->SubProp && !sp->GetType){
  2076. p->SubProp=la_ContainerLookup(sp->TargetID);
  2077. if(!p->SubProp){
  2078. strSafePrint(errors, "Unable to locate property container \"%s\".\n", sp->TargetID); pass=0; continue; }
  2079. laPropContainer* spc=p->SubProp;
  2080. laPropContainer* sNoHyper2 = ParentHyper2;
  2081. if(!ParentHyper2){
  2082. if(pc->Hyper==2 && (!(p->UDFNoCreate||p->UDFIsRefer||p->UDFIsSingle))){
  2083. sNoHyper2=pc; }
  2084. }
  2085. if(sNoHyper2){
  2086. if(spc->Hyper==2 && !sp->Base.UDFIsRefer){ strSafePrint(errors,\
  2087. "Hyper2 list (\"%s\") under another Hyper2 container (\"%s\") is not allowed.\n",
  2088. sp->TargetID, sNoHyper2->Identifier); pass=0; }
  2089. }
  2090. if(!laValidateHyper2(p->SubProp, sNoHyper2, errors)){pass=0;}
  2091. if(ParentHyper2) ParentHyper2->validated=1;
  2092. }
  2093. }
  2094. return pass;
  2095. }
  2096. int laValidateProperties(){
  2097. laSafeString* errors=0; int pass=1;
  2098. for(laPropContainer* pc=MAIN.PropContainers.pFirst;pc;pc=pc->Item.pNext){
  2099. if(pc->validated){continue;}
  2100. if(!laValidateHyper2(pc, 0, &errors)){ pass=0; }
  2101. pc->validated=1;
  2102. }
  2103. if(!pass){
  2104. printf("laValidateHyper2 Failed:\n"); printf("%s",SSTR(errors));
  2105. }
  2106. return pass;
  2107. }
  2108. //==================================[RW]
  2109. void la_GetWorkingDirectoryInternal(){
  2110. #ifdef LAGUI_ANDROID
  2111. strSafeSet(&MAIN.WorkingDirectory, ""); return;
  2112. #endif
  2113. char mbuf[2048];
  2114. #ifdef LA_LINUX
  2115. readlink("/proc/self/exe", mbuf, 2048);
  2116. strDiscardLastSegmentSeperateBy(mbuf, '/');
  2117. chdir(mbuf);
  2118. #endif
  2119. #ifdef _WIN32
  2120. GetModuleFileName(NULL, mbuf, 2048);
  2121. strDiscardLastSegmentSeperateBy(mbuf, '\\');
  2122. _chdir(mbuf);
  2123. #endif
  2124. int len=strlen(mbuf);if(mbuf[len]!=LA_PATH_SEP){ mbuf[len]=LA_PATH_SEP; mbuf[len+1]=0; }
  2125. strSafeSet(&MAIN.WorkingDirectory, mbuf);
  2126. }
  2127. int laGetRelativeDirectory(char *FullFrom, char *FullTo, char *Result){
  2128. return 0;
  2129. //WIN32_FIND_DATA fd;
  2130. //HANDLE h;
  2131. //char *PathFrom = 0, *PathTo = 0;
  2132. //char FullFromP[1024], FullToP[1024]={0};
  2133. //char *FileNameOnly = 0;
  2134. //int seg, i;
  2135. //
  2136. //Result[0] = 0;
  2137. //
  2138. //if (!FullFrom || !FullTo || FullFrom[0] != FullTo[0])
  2139. // return 0;
  2140. //
  2141. //strcpy(FullFromP, FullFrom);
  2142. //strcpy(FullToP, FullTo);
  2143. //
  2144. //while (h = FindFirstFile(FullFromP, &fd))
  2145. //{
  2146. // if (h == INVALID_HANDLE_VALUE || (!(fd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)))
  2147. // {
  2148. // strDiscardLastSegmentSeperateBy(FullFromP, '/');
  2149. // continue;
  2150. // }
  2151. // break;
  2152. //}
  2153. //
  2154. //while (h = FindFirstFile(FullToP, &fd))
  2155. //{
  2156. // if (!(fd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY))
  2157. // {
  2158. // FileNameOnly = strGetLastSegment(FullToP, '/');
  2159. // strDiscardLastSegmentSeperateBy(FullToP, '/');
  2160. // continue;
  2161. // }
  2162. // elif (h == INVALID_HANDLE_VALUE)
  2163. // {
  2164. // strDiscardLastSegmentSeperateBy(FullToP, '/');
  2165. // continue;
  2166. // }
  2167. // break;
  2168. //}
  2169. //
  2170. //strDiscardSameBeginningSeperatedBy(FullFromP, FullToP, &PathFrom, &PathTo, '/');
  2171. //
  2172. //seg = strCountSegmentSeperateBy(PathFrom, '/');
  2173. //
  2174. //for (i = 0; i < seg; i++)
  2175. //{
  2176. // strcat(Result, "../");
  2177. //}
  2178. //
  2179. //strcat(Result, PathTo);
  2180. //
  2181. //if (FileNameOnly)
  2182. //{
  2183. // strcat(Result, "/");
  2184. // strcat(Result, FileNameOnly);
  2185. //}
  2186. //
  2187. //return 1;
  2188. }
  2189. void laGetUDFRelativeDirectory(laUDF *From, laUDF *To, char *Result){
  2190. if (!From || !To) return;
  2191. laGetRelativeDirectory(From->FileName->Ptr, To->FileName->Ptr, Result);
  2192. }
  2193. void laGetFullPath(char *FullFrom, char *Relative, char *Result){
  2194. //WIN32_FIND_DATA fd;
  2195. //HANDLE h;
  2196. //char *PathFrom = 0, *PathTo = 0;
  2197. //char FullFromP[1024] = {0};
  2198. //int seg, i;
  2199. //
  2200. //Result[0] = 0;
  2201. //
  2202. //if (!FullFrom)
  2203. // return 0;
  2204. //
  2205. //strcpy(FullFromP, FullFrom);
  2206. //
  2207. //while (h = FindFirstFile(FullFromP, &fd))
  2208. //{
  2209. // if (h == INVALID_HANDLE_VALUE || (!(fd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)))
  2210. // {
  2211. // strDiscardLastSegmentSeperateBy(FullFromP, '/');
  2212. // continue;
  2213. // }
  2214. // break;
  2215. //}
  2216. //strcpy(Result, FullFromP);
  2217. ////strcat(Result, "/");
  2218. //strcat(Result, Relative);
  2219. }
  2220. laUDF *laPrepareUDF(char *FileName){
  2221. laUDF *udf = memAcquire(sizeof(laUDF));
  2222. strSafeSet(&udf->FileName, FileName);
  2223. return udf;
  2224. }
  2225. void laWriteProp(laUDF *udf, char *Path){
  2226. laUDFPropSegment *ps = CreateNew(laUDFPropSegment);
  2227. strSafeSet(&ps->Path, Path);
  2228. la_GetPropFromPath(&ps->PP, 0, Path, 0);
  2229. la_StepPropPack(&ps->PP);
  2230. lstAppendItem(&udf->PropsToOperate, ps);
  2231. udf->NumSegmets++;
  2232. }
  2233. void laWritePropP(laUDF *udf, laPropPack *pp){
  2234. char buf[LA_RAW_CSTR_MAX_LEN] = {0};
  2235. laUDFPropSegment *ps = CreateNew(laUDFPropSegment);
  2236. ps->PPP = pp;
  2237. udf->NumSegmets++;
  2238. //la_GetPropPackFullPath(pp, Buf);
  2239. //strSafeSet(&ps->Path, Buf);
  2240. lstAppendItem(&udf->PropsToOperate, ps);
  2241. }
  2242. void la_IncludeHyper2Instance(laUDF *udf, laPropContainer* pc, void* Instance){
  2243. laUDFH2Instance *h2 = memAcquire(sizeof(laUDFH2Instance));
  2244. h2->pc=pc; h2->Instance = Instance;
  2245. lstAppendItem(&udf->H2Instances, h2);
  2246. udf->HasInstances=1;
  2247. }
  2248. void la_ClearHyper2Instances(laUDF* udf){
  2249. laUDFH2Instance *h2;
  2250. while(h2=lstPopItem(&udf->H2Instances)){ memFree(h2); }
  2251. udf->HasInstances=0;
  2252. }
  2253. //void la_UDFAppendPointerRecord(void* UseInstance, laSubProp* p, void** PendingReference,void* ReadInstance) {
  2254. // //laUDFPointerRecord* upr = &MAIN.PendingPointers[MAIN.NextPendingPointer];
  2255. // //if (!ReadInstance) return;
  2256. // //upr->ReadInstance = ReadInstance;
  2257. // //upr->PendingReference = PendingReference;
  2258. // //upr->SubProp = p;
  2259. // //upr->UseInstance = UseInstance;
  2260. // //MAIN.NextPendingPointer++;
  2261. //}
  2262. //void la_UDFAppendNUIDRecord(void* UseInstance, laSubProp* p, void** PendingReference, char * ReadNUID) {
  2263. // //laUDFPointerRecord* upr = &MAIN.PendingPointers[MAIN.NextPendingPointer];
  2264. // //if (!ReadNUID) return;
  2265. // //upr->NUID = CreateNewBuffer(char, 23);
  2266. // //strcpy(upr->NUID, ReadNUID);
  2267. // //upr->PendingReference = PendingReference;
  2268. // //upr->SubProp = p;
  2269. // //upr->UseInstance = UseInstance;
  2270. // //MAIN.NextPendingPointer++;
  2271. //}
  2272. //void la_UDFAppendPointerSync(void* ReadInstance, void* ActualInstance) {
  2273. // //laUDFPointerSync* ups = CreateNew(laUDFPointerSync);
  2274. // //ups->ReadPointer = ReadInstance;
  2275. // //ups->ActualPointer = ActualInstance;
  2276. // //hsh65536InsertItem(&MAIN.PointerSync, ups, ReadInstance);
  2277. //}
  2278. //void la_UDFAppendNUIDSync(char * ReadNUID, void* ActualInstance) {
  2279. // //laUDFPointerSync* ups = CreateNew(laUDFPointerSync);
  2280. // //ups->NUID = CreateNewBuffer(char, 23);
  2281. // //memcpy(ups->NUID, ReadNUID,sizeof(char)*23);
  2282. // //ups->ActualPointer = ActualInstance;
  2283. // //hsh65536InsertItem(&MAIN.PointerSync, ups, (long)ReadNUID[15]);
  2284. //}
  2285. void la_UDFAppendSharedTypePointer(char *ID, void *Pointer){
  2286. laSharedTypeItem *sti = memAcquireSimple(sizeof(laSharedTypeItem));
  2287. strCopyFull(sti->ID, ID);
  2288. sti->Pointer = Pointer;
  2289. lstAppendItem(&MAIN.SharedTypePointerSync, sti);
  2290. }
  2291. #define la_UseUDF(udf) udf->Used = 1
  2292. u64bit la_Tell(laUDF *udf){
  2293. if (udf->DiskFile) return ftell(udf->DiskFile);
  2294. else return udf->Seek;
  2295. }
  2296. int la_Seek(laUDF *udf, u64bit Offset){
  2297. if (udf->DiskFile) return fseek(udf->DiskFile, Offset, SEEK_SET);
  2298. udf->Seek = Offset;
  2299. return 1;
  2300. }
  2301. u64bit la_FileSize(laUDF* udf){
  2302. if(udf->DiskFile){ u64bit a=ftell(udf->DiskFile); fseek(udf->DiskFile,0,SEEK_END); u64bit sz=ftell(udf->DiskFile); fseek(udf->DiskFile,a,SEEK_SET); return sz; }
  2303. return udf->FileContentSize;
  2304. }
  2305. void la_WriteString(laUDF *udf, const char *String){
  2306. short size = strlen(String);
  2307. fwrite(&size, sizeof(short), 1, udf->DiskFile);
  2308. if (size) fwrite(String, size*sizeof(char), 1, udf->DiskFile);
  2309. }
  2310. void la_WriteOnlyString(laUDF *udf, const char *String){
  2311. fwrite(String, strlen(String), 1, udf->DiskFile);
  2312. }
  2313. void la_WriteOnlyMBString(laUDF *udf, const char *String){
  2314. fwrite(String, strlen(String), 1, udf->DiskFile);
  2315. }
  2316. void la_WriteInt(laUDF *udf, int Data){
  2317. fwrite(&Data, sizeof(int), 1, udf->DiskFile);
  2318. }
  2319. void la_WriteUInt(laUDF *udf, uint32_t Data){
  2320. fwrite(&Data, sizeof(uint32_t), 1, udf->DiskFile);
  2321. }
  2322. void la_WriteUByte(laUDF *udf, unsigned char Data){
  2323. fwrite(&Data, sizeof(unsigned char), 1, udf->DiskFile);
  2324. }
  2325. void la_WriteShort(laUDF *udf, short Data){
  2326. fwrite(&Data, sizeof(short), 1, udf->DiskFile);
  2327. }
  2328. void la_WriteLong(laUDF *udf, u64bit Data){
  2329. fwrite(&Data, sizeof(u64bit), 1, udf->DiskFile);
  2330. }
  2331. void la_WritePointer(laUDF *udf, void *Data){
  2332. fwrite(&Data, sizeof(void *), 1, udf->DiskFile);
  2333. }
  2334. void la_WriteFloat(laUDF *udf, real Data){
  2335. fwrite(&Data, sizeof(real), 1, udf->DiskFile);
  2336. }
  2337. void la_WriteSized(laUDF *udf, void* Data, int size){
  2338. printf("%llx %d\n",Data,size);
  2339. fwrite(Data, size, 1, udf->DiskFile);
  2340. }
  2341. short la_ReadShort(laUDF *udf){
  2342. short result;
  2343. if(!udf->FileContent){ fread(&result, sizeof(short), 1, udf->DiskFile); }
  2344. else{ memcpy(&result, udf->FileContent + udf->Seek, sizeof(short)); udf->Seek += sizeof(short); }
  2345. return result;
  2346. }
  2347. u8bit la_ReadUByte(laUDF *udf){
  2348. u8bit result;
  2349. if(!udf->FileContent){ fread(&result, sizeof(u8bit), 1, udf->DiskFile); }
  2350. else{ memcpy(&result, udf->FileContent + udf->Seek, sizeof(u8bit)); udf->Seek += sizeof(u8bit); }
  2351. return result;
  2352. }
  2353. int la_ReadInt(laUDF *udf){
  2354. int result;
  2355. if(!udf->FileContent){ fread(&result, sizeof(int), 1, udf->DiskFile); }
  2356. else{ memcpy(&result, udf->FileContent + udf->Seek, sizeof(int)); udf->Seek += sizeof(int); }
  2357. return result;
  2358. }
  2359. uint32_t la_ReadUInt(laUDF *udf){
  2360. uint32_t result;
  2361. if(!udf->FileContent){ fread(&result, sizeof(uint32_t), 1, udf->DiskFile); }
  2362. else{ memcpy(&result, udf->FileContent + udf->Seek, sizeof(uint32_t)); udf->Seek += sizeof(uint32_t); }
  2363. return result;
  2364. }
  2365. u64bit la_ReadLong(laUDF *udf){
  2366. u64bit result;
  2367. if(!udf->FileContent){ fread(&result, sizeof(u64bit), 1, udf->DiskFile); }
  2368. else{ memcpy(&result, udf->FileContent + udf->Seek, sizeof(u64bit)); udf->Seek += sizeof(u64bit); }
  2369. return result;
  2370. }
  2371. void *la_ReadPointer(laUDF *udf){
  2372. u64bit result = 0;
  2373. if(!udf->FileContent){ fread(&result, sizeof(u64bit), 1, udf->DiskFile); }
  2374. else{ memcpy(&result, udf->FileContent + udf->Seek, sizeof(u64bit)); udf->Seek += sizeof(u64bit); }
  2375. return (void *)result;
  2376. }
  2377. real la_ReadFloat(laUDF *udf){
  2378. real result;
  2379. if(!udf->FileContent){ fread(&result, sizeof(real), 1, udf->DiskFile); }
  2380. else{ memcpy(&result, udf->FileContent + udf->Seek, sizeof(real)); udf->Seek += sizeof(real); }
  2381. return result;
  2382. }
  2383. void la_ReadString(laUDF *udf, char *buffer){
  2384. short len = la_ReadShort(udf);
  2385. if (len){
  2386. if(!udf->FileContent){ fread(buffer, sizeof(char) * len, 1, udf->DiskFile); }
  2387. else{ memcpy(buffer, udf->FileContent + udf->Seek, sizeof(char) * len); udf->Seek += sizeof(char) * len; }
  2388. }
  2389. buffer[len] = 0;
  2390. }
  2391. void la_ReadOnlyString(laUDF *udf, short len, char *buffer){
  2392. if(!udf->FileContent){ fread(buffer, sizeof(char) * len, 1, udf->DiskFile); }
  2393. else{ memcpy(buffer, udf->FileContent + udf->Seek, sizeof(char) * len); udf->Seek += sizeof(char) * len; }
  2394. buffer[len] = 0;
  2395. }
  2396. void la_ReadHyperData(laUDF *udf, void* HyperUserMem){
  2397. short NumUsers, i;
  2398. //void *CreatorInstance = la_ReadLong(udf);
  2399. laMemNodeHyper h_ = {0};
  2400. laMemNodeHyper *h=HyperUserMem?memGetHead(HyperUserMem, 0):&h_;
  2401. //la_UDFAppendPointerRecord(0, 0, &h->CreatedBy,CreatorInstance);
  2402. la_ReadString(udf, h->NUID.String);
  2403. h->TimeCreated.Year = la_ReadShort(udf);
  2404. h->TimeCreated.Month = la_ReadUByte(udf);
  2405. h->TimeCreated.Day = la_ReadUByte(udf);
  2406. h->TimeCreated.Hour = la_ReadUByte(udf);
  2407. h->TimeCreated.Minute = la_ReadUByte(udf);
  2408. h->TimeCreated.Second = la_ReadUByte(udf);
  2409. }
  2410. void la_PeekHyperUID(laUDF *udf, char* buf){
  2411. int pos=la_Tell(udf);
  2412. la_ReadString(udf, buf);
  2413. la_Seek(udf, pos);
  2414. }
  2415. void la_ReadBuffer(laUDF *udf, u64bit Size, void *Result){
  2416. if(!udf->FileContent){ fread(Result, Size, 1, udf->DiskFile); }
  2417. else{ memcpy(Result, udf->FileContent + udf->Seek, Size); udf->Seek += Size; }
  2418. }
  2419. void* la_ReadRaw(laUDF *udf, uint32_t* _sz){
  2420. uint32_t _size = la_ReadUInt(udf);
  2421. if(_sz){
  2422. if (_size){
  2423. void* data=calloc(1,_size);
  2424. la_ReadBuffer(udf, _size, data);
  2425. if(_sz) *_sz=_size;
  2426. return data;
  2427. } return 0;
  2428. }else{
  2429. la_Seek(udf, la_Tell(udf)+_size); return 0;
  2430. }
  2431. }
  2432. void la_WriteSingleProperty(laUDF *udf, void *FromInstance, laProp *p){
  2433. la_WriteString(udf, p->Identifier);
  2434. }
  2435. void la_GetPropPackFullPath(laPropPack *pp, char *result){
  2436. char buf[1024], upbuf[1024]={0}; if(!pp){result[0]=0; return;}
  2437. laPropStep *ps;
  2438. buf[0] = U'\0';
  2439. upbuf[0] = 0;
  2440. if (pp->Go){
  2441. for (ps = pp->Go; ps; ps = ps->pNext){
  2442. //if (!ps->p||!ps->p->Identifier) strcat(buf, "?");
  2443. if(ps->Type=='.') strcat(buf, ps->p->Identifier);
  2444. if(ps->Type=='#' ||ps->Type=='@' ||ps->Type=='=') {char b2[2]={0}; b2[0]= ps->Type; strcat(buf, b2); strcat(buf, ps->p);}
  2445. if (ps->pNext && ps->pNext->Type=='.') strcat(buf, ".");
  2446. }
  2447. }else{
  2448. if(pp->LastPs){ if(pp->LastPs->p->Identifier) strcat(buf, pp->LastPs->p->Identifier); else { strcat(buf,"?"); } }
  2449. if (pp->RawThis && pp->RawThis->LastPs->p != pp->LastPs->p) strcat(buf, pp->LastPs->p->Identifier);
  2450. }
  2451. if (pp->RawThis){
  2452. la_GetPropPackFullPath(pp->RawThis, upbuf);
  2453. if (pp->RawThis->LastPs->p != pp->LastPs->p) strcat(upbuf, ".");
  2454. strcat(upbuf, buf);
  2455. strCopyFull(result, upbuf);
  2456. }else
  2457. strCopyFull(result, buf);
  2458. }
  2459. void la_GetPropPackPath(laPropPack *pp, char *result){
  2460. char buf[1024], upbuf[1024]={0};
  2461. laPropStep *ps;
  2462. buf[0] = U'\0';
  2463. upbuf[0] = 0;
  2464. char Sep[2] = {0};
  2465. for (ps = pp->Go; ps; ps = ps->pNext){
  2466. if (!ps->p->Identifier) break;
  2467. if (ps->Type == U'.' || !ps->Type) strcat(buf, ps->p->Identifier);
  2468. else
  2469. strcat(buf, ps->p);
  2470. if (ps->pNext) strcat(buf, (Sep[0] = ((laPropStep *)ps->pNext)->Type) ? Sep : ".");
  2471. }
  2472. strCopyFull(result, buf);
  2473. }
  2474. int la_ReadIntProp(laUDF *udf, laPropPack *pp){
  2475. laProp *p;
  2476. int Data[16] = {0};
  2477. int len = 0;
  2478. int i;
  2479. if (!pp){
  2480. int mode = la_ReadShort(udf);
  2481. if (mode == LA_UDF_ARRAY_MARK_32){
  2482. len = la_ReadShort(udf);
  2483. for (i = 0; i < len; i++)
  2484. la_ReadInt(udf);
  2485. }else
  2486. Data[0] = la_ReadInt(udf);
  2487. return Data[0];
  2488. }
  2489. p = pp->LastPs->p;
  2490. short mark=la_ReadShort(udf);
  2491. if(mark==LA_UDF_ARRAY_MARK_64 || mark==LA_UDF_ARRAY_MARK_32){ len = la_ReadShort(udf);
  2492. for(i=0;i<len;i++){ Data[i] = la_ReadInt(udf); }
  2493. }else{
  2494. Data[0] = la_ReadInt(udf);
  2495. }
  2496. if (p->PropertyType & LA_PROP_ARRAY){
  2497. if (pp) laReadIntArrayAllArray(pp, Data);
  2498. }else{
  2499. if (pp) laReadInt(pp, Data[0]);
  2500. }
  2501. return Data[0];
  2502. }
  2503. real la_ReadFloatProp(laUDF *udf, laPropPack *pp){
  2504. laProp *p;
  2505. real Data[16] = {0};
  2506. int len = 0; int i;
  2507. if (!pp){
  2508. int mode = la_ReadShort(udf);
  2509. if (mode == LA_UDF_ARRAY_MARK_64){
  2510. len = la_ReadShort(udf);
  2511. for (i = 0; i < len; i++)
  2512. la_ReadFloat(udf);
  2513. }else
  2514. Data[0] = la_ReadFloat(udf);
  2515. return Data[0];
  2516. }
  2517. p = pp->LastPs->p;
  2518. short mark=la_ReadShort(udf);
  2519. if(mark==LA_UDF_ARRAY_MARK_64 || mark==LA_UDF_ARRAY_MARK_32){ len = la_ReadShort(udf);
  2520. for(i=0;i<len;i++){ Data[i] = la_ReadFloat(udf); }
  2521. }else{
  2522. Data[0] = la_ReadFloat(udf);
  2523. }
  2524. if (p->PropertyType & LA_PROP_ARRAY){
  2525. if (pp) laReadFloatArrayAllArray(pp, Data);
  2526. }else{
  2527. if (pp) laReadFloat(pp, Data[0]);
  2528. }
  2529. return Data[0];
  2530. }
  2531. void la_ReadStringProp(laUDF *udf, laPropPack *pp){
  2532. char buf[LA_RAW_CSTR_MAX_LEN]={0}; //XXX: long string not correct...
  2533. int len = 0;
  2534. int i;
  2535. buf[0] = 0;
  2536. la_ReadShort(udf);
  2537. la_ReadString(udf, buf);
  2538. if (pp) laReadString(pp, buf);
  2539. }
  2540. void la_ReadStringPropAsIdentifier(laUDF *udf, char *buf){
  2541. //char buf[LA_RAW_CSTR_MAX_LEN]={0};
  2542. int len = 0;
  2543. int i;
  2544. buf[0] = 0;
  2545. la_ReadShort(udf);
  2546. la_ReadString(udf, buf);
  2547. }
  2548. void la_WriteIntProp(laUDF *udf, laPropPack *pp){
  2549. laProp *p = pp->LastPs->p;
  2550. int Data[16] = {0};
  2551. int len = 0;
  2552. int i;
  2553. if (p->PropertyType & LA_PROP_ARRAY){
  2554. la_WriteShort(udf, LA_UDF_ARRAY_MARK_32);
  2555. laGetIntArray(pp, Data);
  2556. len = laGetArrayLength(pp);
  2557. la_WriteShort(udf, len);
  2558. for (i = 0; i < len; i++){
  2559. la_WriteInt(udf, Data[i]);
  2560. }
  2561. }else{
  2562. la_WriteShort(udf, LA_UDF_REGULAR_MARK_32);
  2563. Data[0] = laGetInt(pp);
  2564. la_WriteInt(udf, Data[0]);
  2565. }
  2566. }
  2567. void la_WriteFloatProp(laUDF *udf, laPropPack *pp){
  2568. laProp *p = pp->LastPs->p;
  2569. real Data[16] = {0};
  2570. int len = 0;
  2571. int i;
  2572. if (p->PropertyType & LA_PROP_ARRAY){
  2573. la_WriteShort(udf, LA_UDF_ARRAY_MARK_64);
  2574. laGetFloatArray(pp, Data);
  2575. len = laGetArrayLength(pp);
  2576. la_WriteShort(udf, len);
  2577. for (i = 0; i < len; i++){
  2578. la_WriteFloat(udf, Data[i]);
  2579. }
  2580. }else{
  2581. la_WriteShort(udf, LA_UDF_REGULAR_MARK_64);
  2582. Data[0] = laGetFloat(pp);
  2583. la_WriteFloat(udf, Data[0]);
  2584. }
  2585. }
  2586. void la_WriteStringProp(laUDF *udf, laPropPack *pp){
  2587. laProp *p = pp->LastPs->p;
  2588. char _buf[LA_RAW_CSTR_MAX_LEN]={0}; char* buf=_buf;
  2589. int len = 0;
  2590. int i;
  2591. buf[0] = 0;
  2592. la_WriteShort(udf, LA_UDF_STRING_MARK);
  2593. laGetString(pp, _buf, &buf);
  2594. la_WriteString(udf, buf);
  2595. }
  2596. void la_ReadEnumProp(laUDF *udf, laPropPack *pp, char* orig_string){
  2597. laProp *p;
  2598. int Data[16] = {0};
  2599. int len = 0;
  2600. int i;
  2601. char buf[LA_RAW_CSTR_MAX_LEN]={0};
  2602. if (!pp){
  2603. int mode = la_ReadShort(udf);
  2604. if (mode == LA_UDF_ARRAY_MARK_32){
  2605. len = la_ReadShort(udf);
  2606. for (i = 0; i < len; i++)
  2607. la_ReadString(udf, buf); //la_ReadInt(udf);
  2608. }else
  2609. la_ReadString(udf, buf); //la_ReadInt(udf);
  2610. if(orig_string)strcpy(orig_string, buf);
  2611. return;
  2612. }
  2613. p = pp->LastPs->p;
  2614. if (p->PropertyType & LA_PROP_ARRAY){
  2615. la_ReadShort(udf);
  2616. len = la_ReadShort(udf);
  2617. for (i = 0; i < len; i++){
  2618. la_ReadString(udf, buf);
  2619. Data[i] = laGetEnumFromIdentifier(p, buf)->Index;
  2620. //Data[i] = la_ReadInt(udf);
  2621. }
  2622. if (pp) laReadEnumArrayAll(pp, Data);
  2623. }else{
  2624. la_ReadShort(udf);
  2625. la_ReadString(udf, buf);
  2626. Data[0] = laGetEnumFromIdentifier(p, buf)->Index;
  2627. //Data[0] = la_ReadInt(udf);
  2628. if (pp) laReadEnum(pp, Data[0]);
  2629. }
  2630. }
  2631. void la_WriteEnumProp(laUDF *udf, laPropPack *pp){
  2632. laProp *p = pp->LastPs->p;
  2633. laEnumItem *Data[16] = {0};
  2634. int len = 0;
  2635. int i;
  2636. if (p->PropertyType & LA_PROP_ARRAY){
  2637. la_WriteShort(udf, (LA_UDF_ARRAY_MARK_32 | LA_UDF_STRING_MARK));
  2638. laGetEnumArray(pp, Data);
  2639. len = laGetArrayLength(pp);
  2640. la_WriteShort(udf, len);
  2641. for (i = 0; i < len; i++){
  2642. la_WriteString(udf, Data[i]->Identifier);
  2643. //la_WriteInt(udf, Data[i]->Index);
  2644. }
  2645. }else{
  2646. la_WriteShort(udf, LA_UDF_STRING_MARK);
  2647. Data[0] = laGetEnum(pp);
  2648. la_WriteString(udf, Data[0]->Identifier);
  2649. //la_WriteInt(udf, Data[0]->Index);
  2650. }
  2651. }
  2652. void la_ReadRawProp(laUDF *udf, laPropPack *pp){
  2653. la_ReadShort(udf);//mark
  2654. if (pp) {
  2655. uint32_t _size=0;
  2656. void* data=la_ReadRaw(udf,&_size);
  2657. laSetRaw(pp, data, _size); free(data);
  2658. }else{
  2659. la_ReadRaw(udf,0);
  2660. }
  2661. }
  2662. void la_WriteRawProp(laUDF *udf, laPropPack *pp){
  2663. laProp *p = pp->LastPs->p;
  2664. la_WriteShort(udf, LA_UDF_RAW_MARK);
  2665. if(laCanGetMultiRaw(p,pp->LastPs->UseInstance)){
  2666. int chunks=0; uint32_t sizes[128]={0}; void* pointers[128]={0};
  2667. uint32_t totalsize=0;
  2668. if(laGetMultiRaw(pp,&chunks,sizes,pointers)){ TNS_CLAMP(chunks,1,128);
  2669. for(int i=0;i<chunks;i++){ totalsize+=sizes[i]; } la_WriteUInt(udf,totalsize);
  2670. if(totalsize){
  2671. for(int i=0;i<chunks;i++){ if(sizes[i] && pointers[i]){ la_WriteSized(udf,pointers[i],sizes[i]); free(pointers[i]); } }
  2672. }
  2673. }else{
  2674. la_WriteUInt(udf,0); // no size
  2675. }
  2676. return;
  2677. }
  2678. void* data; uint32_t _size=0, IsCopy=0;
  2679. data=laGetRaw(pp, &_size, &IsCopy);
  2680. if(!data){ _size=0; }
  2681. la_WriteUInt(udf,_size);
  2682. if(_size){ la_WriteSized(udf,data,_size); }
  2683. if(IsCopy && data){ free(data); }
  2684. }
  2685. void la_WriteHyperData(laUDF *udf, void *HyperUserMem){
  2686. int loc = 0, res = 0, i = 0;
  2687. laItemUserLinker *iul;
  2688. laMemNodeHyper* h=memGetHead(HyperUserMem, 0);
  2689. //la_WriteLong(udf, h->CreatedBy);
  2690. la_WriteString(udf, h->NUID.String);
  2691. la_WriteShort(udf, h->TimeCreated.Year);
  2692. la_WriteUByte(udf, h->TimeCreated.Month);
  2693. la_WriteUByte(udf, h->TimeCreated.Day);
  2694. la_WriteUByte(udf, h->TimeCreated.Hour);
  2695. la_WriteUByte(udf, h->TimeCreated.Minute);
  2696. la_WriteUByte(udf, h->TimeCreated.Second);
  2697. }
  2698. laSharedTypeItem *la_ReferringToSharedResource(void *p){
  2699. laSharedTypeItem *sti;
  2700. for (sti = MAIN.SharedTypePointerSync.pFirst; sti; sti = sti->Item.pNext){
  2701. if (sti->Pointer == p)
  2702. return sti;
  2703. }
  2704. return 0;
  2705. }
  2706. void *la_FindSharedResouce(char *id){
  2707. laSharedTypeItem *sti;
  2708. for (sti = MAIN.SharedTypePointerSync.pFirst; sti; sti = sti->Item.pNext){
  2709. if (strSame(id, sti->ID))
  2710. return sti->Pointer;
  2711. }
  2712. return 0;
  2713. }
  2714. void la_AppendHyperRecord(laUDF *udf, void *HyperUserMem, laPropContainer* pc, u64bit Seek){
  2715. // this happens when theres a type{base{} ... } like tnsobject, should not be problematic...?
  2716. if(lstHasPointer(&udf->HyperRecords, HyperUserMem)) return;
  2717. laUDFHyperRecordItem *hri = lstAppendPointerSized(&udf->HyperRecords, HyperUserMem, sizeof(laUDFHyperRecordItem));
  2718. hri->Seek = Seek;
  2719. hri->pc = pc;
  2720. }
  2721. void la_NextH2Instance(laUDF* udf){
  2722. udf->CurrentH2Instance=(udf->CurrentH2Instance?udf->CurrentH2Instance->Item.pNext:0);
  2723. }
  2724. int la_WriteProp(laUDF *udf, laPropPack *pp, int FromThis, int UseInstanceList){
  2725. laProp *p = pp->LastPs->p, *subp = 0;
  2726. laPropStep SubPS = {0};
  2727. laPropPack SubPP = {0};
  2728. laPropIterator pi = {0};
  2729. laSharedTypeItem *sti;
  2730. laMemNodeHyper *hi;
  2731. void *inst = 0;
  2732. u64bit pReserve = 0, pContinue = 0;
  2733. int ItemNum = 0, PropNum = 0;
  2734. int counted = 0;
  2735. u64bit pEachCount;
  2736. SubPP.LastPs = &SubPS;
  2737. if (p->PropertyType == LA_PROP_OPERATOR) return 0;
  2738. if ((!pp->RawThis) || FromThis){
  2739. char FullPath[1024]={0};
  2740. FullPath[0] = 0;
  2741. la_GetPropPackFullPath(pp, FullPath);
  2742. la_WriteString(udf, FullPath);
  2743. }else{
  2744. la_WriteString(udf, p->Identifier);
  2745. }
  2746. switch (p->PropertyType){
  2747. case LA_PROP_SUB:
  2748. if (p->UDFIsRefer){
  2749. inst = laGetActiveInstanceStrict(p, pp->LastPs->UseInstance);
  2750. if (sti = la_ReferringToSharedResource(inst)){
  2751. la_WriteShort(udf, LA_UDF_SHARE_RESOURCE);
  2752. la_WriteString(udf, sti->ID);
  2753. }else{
  2754. if (!p->SubProp){
  2755. p->SubProp = la_ContainerLookup(((laSubProp *)p)->TargetID);
  2756. }
  2757. if (p->SubProp->Hyper == 2){
  2758. la_WriteShort(udf, LA_UDF_REFER | LA_UDF_HYPER_ITEM);
  2759. if (!inst) la_WriteString(udf, "");
  2760. else
  2761. la_WriteString(udf, ((laMemNodeHyper *)memGetHead(inst,0))->NUID.String);
  2762. udf->TotalRefs++;
  2763. }else{
  2764. la_WriteShort(udf, LA_UDF_REFER);
  2765. la_WritePointer(udf, inst);
  2766. }
  2767. pp->EndInstance = inst;
  2768. }
  2769. udf->TotalRefs++;
  2770. }else{
  2771. la_EnsureSubTarget(p,0);
  2772. la_WriteShort(udf, LA_UDF_COLLECTION);
  2773. pReserve = la_Tell(udf); la_WriteInt(udf, 0); //num items
  2774. if (((laSubProp*)p)->GetType) la_WriteInt(udf, LA_UDF_VARIABLE_NODE_SIZE);
  2775. else la_WriteInt(udf, LA_UDF_FIXED_NODE_SIZE);
  2776. la_WriteShort(udf, LA_UDF_ACTIVE);
  2777. la_WritePointer(udf, laGetActiveInstance(p, pp->LastPs->UseInstance, &pi));
  2778. if (FromThis){
  2779. inst = pp->EndInstance;
  2780. }else{
  2781. inst = laGetInstance(p, pp->LastPs->UseInstance, &pi);
  2782. pp->EndInstance = inst;
  2783. }
  2784. while (inst){
  2785. if(((laSubProp*)p)->SaveFilter && (!((laSubProp*)p)->SaveFilter(pp->LastPs->UseInstance, inst))){
  2786. inst = laGetNextInstance(p, inst, &pi); pp->EndInstance = inst; continue;
  2787. }
  2788. laPropContainer* pc=p->SubProp; int need_type=0;
  2789. if (((laSubProp*)p)->GetType){ pc=((laSubProp*)p)->GetType(inst); need_type=1; }
  2790. if (pc->Hyper == 2){
  2791. void* compare=udf->CurrentH2Instance?udf->CurrentH2Instance->Instance:0;
  2792. if((!p->UDFIsSingle) && UseInstanceList && inst!=compare){
  2793. inst = laGetNextInstance(p, inst, &pi); pp->EndInstance = inst; continue;}
  2794. if(need_type){ la_WriteString(udf, pc->Identifier); }
  2795. hi = inst;
  2796. la_WriteShort(udf, LA_UDF_HYPER_ITEM);
  2797. la_AppendHyperRecord(udf, inst, p->SubProp, la_Tell(udf));
  2798. la_WriteHyperData(udf, inst);
  2799. memMarkClean(inst);
  2800. }else{
  2801. if(need_type){ la_WriteString(udf, pc->Identifier); }
  2802. la_WriteShort(udf, LA_UDF_ITEM);
  2803. }
  2804. ItemNum++;
  2805. la_WritePointer(udf, inst);
  2806. la_WriteInt(udf, laGetUiState(p, pp->LastPs->UseInstance));
  2807. PropNum=0; pEachCount = la_Tell(udf); la_WriteShort(udf, 0);
  2808. for (subp = pc->Props.pFirst; subp; subp = subp->Item.pNext){
  2809. if (subp->UDFIgnore) continue;
  2810. SubPP.RawThis = pp;
  2811. SubPS.p = subp;
  2812. SubPS.UseInstance = inst;
  2813. if (la_WriteProp(udf, &SubPP, 0, UseInstanceList)) PropNum++;
  2814. }
  2815. if (FromThis){ inst = 0; }else{
  2816. inst = laGetNextInstance(p, inst, &pi);
  2817. pp->EndInstance = inst;
  2818. if(UseInstanceList&&pc->Hyper==2&&(!p->UDFIsSingle)&&(!p->UDFNoCreate)){
  2819. la_NextH2Instance(udf); if(!udf->CurrentH2Instance) inst=0; }
  2820. }
  2821. pContinue = la_Tell(udf);
  2822. la_Seek(udf, pEachCount); la_WriteShort(udf, PropNum);
  2823. la_Seek(udf, pContinue);
  2824. }
  2825. pContinue = la_Tell(udf);
  2826. la_Seek(udf, pReserve); la_WriteInt(udf, ItemNum);
  2827. la_Seek(udf, pContinue);
  2828. }
  2829. break;
  2830. case LA_PROP_INT:
  2831. case LA_PROP_ARRAY | LA_PROP_INT:
  2832. la_WriteIntProp(udf, pp);
  2833. break;
  2834. case LA_PROP_FLOAT:
  2835. case LA_PROP_ARRAY | LA_PROP_FLOAT:
  2836. la_WriteFloatProp(udf, pp);
  2837. break;
  2838. case LA_PROP_STRING:
  2839. la_WriteStringProp(udf, pp);
  2840. break;
  2841. case LA_PROP_ENUM:
  2842. case LA_PROP_ARRAY | LA_PROP_ENUM:
  2843. la_WriteEnumProp(udf, pp);
  2844. break;
  2845. case LA_PROP_RAW:
  2846. la_WriteRawProp(udf, pp);
  2847. break;
  2848. default:
  2849. break;
  2850. }
  2851. return 1;
  2852. }
  2853. void la_AddPostReadNode(void *Instance, laContainerPostReadFunc Func){
  2854. laUDFPostRead *upr = lstAppendPointerSized(&MAIN.PostReadNodes, Instance, sizeof(laUDFPostRead));
  2855. upr->Instance = Instance;
  2856. upr->Func = Func;
  2857. }
  2858. void *la_GetReadDBInstNUID(char *ReferReadNUID){
  2859. if (!ReferReadNUID) return 0;
  2860. laListHandle *l = hsh65536DoHashNUID(&MAIN.DBInst2, ReferReadNUID);
  2861. for (laMemNodeHyper* m = l->pFirst; m; m = m->Item.pNext){
  2862. if (!strcmp(ReferReadNUID, m->NUID.String))
  2863. return ((unsigned char*)m)+sizeof(laMemNodeHyper);
  2864. }
  2865. return 0;
  2866. }
  2867. void *la_GetReadDBInstPtr(void *ReferRead){
  2868. if (!ReferRead) return 0;
  2869. laListHandle *l = hsh65536DoHashLongPtr(&MAIN.DBInst1, ReferRead);
  2870. for (laMemNode* m = l->pFirst; m; m = m->Item.pNext){
  2871. if (ReferRead == m->ReadInstance)
  2872. return ((unsigned char*)m)+sizeof(laMemNode);
  2873. }
  2874. return 0;
  2875. }
  2876. void la_AddDataInst(void *ReadInstance, char *ReadNUID, void *ActualInstance){
  2877. laListHandle* l=0;
  2878. void* head=memGetHead(ActualInstance, 0);
  2879. if (ReadNUID) l = hsh65536DoHashNUID(&MAIN.DBInst2, ReadNUID);
  2880. else { l = hsh65536DoHashLongPtr(&MAIN.DBInst1, ReadInstance); ((laMemNode*)head)->ReadInstance = ReadInstance; }
  2881. lstPushItem(l, head); //always push so we get the latest during ptr sync.
  2882. }
  2883. laPtrSync *la_AddPtrSyncDirect(void *Refer, void *Parent, laProp *Sub){
  2884. laPtrSync *ps = memAcquireSimple(sizeof(laPtrSync));
  2885. ps->RefDB = Refer;
  2886. ps->Parent = Parent;
  2887. ps->Prop = Sub;
  2888. return ps;
  2889. }
  2890. laPtrSyncCommand *la_AddPtrSyncCommand(void *ReadRefer, void *ParentInst, char *ReadNUID, laProp *Sub){
  2891. laPtrSyncCommand *psc = memAcquireSimple(sizeof(laPtrSyncCommand));
  2892. psc->Target = la_AddPtrSyncDirect(0, ParentInst, Sub);
  2893. psc->ReadInstance = ReadRefer;
  2894. if (ReadNUID){ strcpy(psc->ReadNUID.String, ReadNUID); lstAppendItem(&MAIN.PtrSyncHyper2Commands, psc); }
  2895. else{ lstAppendItem(&MAIN.PtrSyncAddressCommands, psc); }
  2896. return psc;
  2897. }
  2898. void la_ResetInstance(void* inst, laPropContainer* pc, int IsListItem);
  2899. void laRequestAdditionalRegistry(laUDFRegistry* r);
  2900. laUDFOwnHyperItem* laNewHyperResource(char* uid);
  2901. laUDFOwnHyperItem* laFindHyperResource(char* uid);
  2902. void la_LoadAdditionalRegistries(){
  2903. laUDFRegistry* r;
  2904. while(r=lstPopPointer(&MAIN.PendingResourceRequests)){
  2905. laManagedUDF* m;
  2906. logPrint("[INFO] Loading additional resource: %s\n",r->Path->Ptr);
  2907. laUDF* udf = laOpenUDF(r->Path->Ptr, 1, 0, &m);
  2908. if (udf){ laExtractUDF(udf, m, LA_UDF_MODE_OVERWRITE); laCloseUDF(udf); }else{ logPrint("[WARN] Can't open resource: %s\n",r->Path->Ptr); }
  2909. }
  2910. }
  2911. void la_ExecutePtrSyncCommand(int Mode){
  2912. int i;
  2913. laPtrSyncCommand *psc,*NextPSC;
  2914. laPtrSync *ps;
  2915. void *dbi;
  2916. laListHandle *lps, *ldbi;
  2917. laListHandle L2 = {0};
  2918. int FailCount = 0, AllCount = 0;
  2919. while (psc = lstPopItem(&MAIN.PtrSyncAddressCommands)){
  2920. ps = psc->Target; dbi=0; if (psc->ReadInstance) dbi = la_GetReadDBInstPtr(psc->ReadInstance);
  2921. if (dbi){
  2922. //if (Mode == LA_udf_read)dbi->ReadInst = dbi->ActualInst; //??
  2923. ps->RefDB = dbi; laSetActiveInstance(ps->Prop, ps->Parent, dbi);
  2924. }else{ FailCount++; }
  2925. AllCount++; memFree(psc);
  2926. }
  2927. laUDFOwnHyperItem* ohi;
  2928. for(psc=MAIN.PtrSyncHyper2Commands.pFirst;psc;psc=NextPSC){
  2929. NextPSC=psc->Item.pNext; ps = psc->Target; dbi=0; if (psc->ReadNUID.String[0]) dbi = la_GetReadDBInstNUID(psc->ReadNUID.String);
  2930. if (dbi){
  2931. //if (Mode == LA_udf_read)dbi->ReadInst = dbi->ActualInst; //??
  2932. ps->RefDB = dbi; laSetActiveInstance(ps->Prop, ps->Parent, dbi);
  2933. lstRemoveItem(&MAIN.PtrSyncHyper2Commands,psc);memFree(psc);
  2934. }else{
  2935. if(!(ohi=laFindHyperResource(psc->ReadNUID.String))){
  2936. logPrint("Can't find resource %s\n", psc->ReadNUID.String);
  2937. lstRemoveItem(&MAIN.PtrSyncHyper2Commands,psc);memFree(psc);
  2938. FailCount++;
  2939. }else{
  2940. laRequestAdditionalRegistry(ohi->Registry);
  2941. lstRemoveItem(&MAIN.PtrSyncHyper2Commands,psc);
  2942. lstPushItem(&MAIN.PtrSyncHyper2Commands,psc); continue;
  2943. }
  2944. }
  2945. AllCount++;
  2946. }
  2947. logPrint("Reference Match: Total %d, Failed %d\n", AllCount, FailCount);
  2948. la_LoadAdditionalRegistries();
  2949. }
  2950. int la_ExtractFakeProp(laUDF *udf){
  2951. char buf[LA_RAW_CSTR_MAX_LEN] = {0};
  2952. void *Instance = 0;
  2953. void *ReadInstance;
  2954. int ReadState;
  2955. int NumItems;
  2956. short PropNumPerItem;
  2957. void *ActiveInstance;
  2958. int i, j;
  2959. int ItemType;
  2960. short mode, len;
  2961. int VariableNodeSize;
  2962. short PreMode;
  2963. mode = la_ReadShort(udf);
  2964. switch (mode){
  2965. case LA_UDF_REGULAR_MARK_32:
  2966. la_ReadInt(udf);
  2967. break;
  2968. case LA_UDF_REGULAR_MARK_64:
  2969. la_ReadFloat(udf);
  2970. break;
  2971. case (LA_UDF_ARRAY_MARK_32 | LA_UDF_STRING_MARK):
  2972. len = la_ReadShort(udf);
  2973. for (i = 0; i < len; i++)
  2974. la_ReadString(udf, buf);
  2975. break;
  2976. case LA_UDF_ARRAY_MARK_32:
  2977. len = la_ReadShort(udf);
  2978. for (i = 0; i < len; i++)
  2979. la_ReadInt(udf);
  2980. break;
  2981. case LA_UDF_ARRAY_MARK_64:
  2982. len = la_ReadShort(udf);
  2983. for (i = 0; i < len; i++)
  2984. la_ReadFloat(udf);
  2985. break;
  2986. case LA_UDF_STRING_MARK:
  2987. la_ReadString(udf, buf);
  2988. break;
  2989. case LA_UDF_SHARE_RESOURCE:
  2990. la_ReadString(udf, buf);
  2991. break;
  2992. case LA_UDF_REFER:
  2993. la_ReadPointer(udf);
  2994. break;
  2995. case (short)(LA_UDF_REFER | LA_UDF_HYPER_ITEM):
  2996. la_ReadString(udf, buf);
  2997. break;
  2998. case LA_UDF_COLLECTION:
  2999. NumItems = la_ReadInt(udf);
  3000. VariableNodeSize = la_ReadInt(udf);
  3001. VariableNodeSize = (VariableNodeSize == LA_UDF_VARIABLE_NODE_SIZE) ? 1 : 0;
  3002. la_ReadShort(udf); //active mark
  3003. ActiveInstance = la_ReadPointer(udf);
  3004. for (i = 0; i < NumItems; i++){
  3005. if(VariableNodeSize){ la_ReadString(udf,buf); }
  3006. ItemType = la_ReadShort(udf);
  3007. if (ItemType == LA_UDF_HYPER_ITEM){ la_ReadHyperData(udf, 0); }
  3008. ReadInstance = la_ReadPointer(udf);
  3009. ReadState = la_ReadInt(udf);
  3010. PropNumPerItem=la_ReadShort(udf);
  3011. for (j = 0; j < PropNumPerItem; j++){
  3012. la_ReadString(udf, buf);
  3013. la_ExtractFakeProp(udf);
  3014. }
  3015. }
  3016. break;
  3017. case LA_PROP_RAW:
  3018. la_ReadRawProp(udf, 0);
  3019. break;
  3020. default:
  3021. ReadState = ReadState;
  3022. break;
  3023. }
  3024. return 0;
  3025. }
  3026. int la_ExtractProp(laUDF *udf, laManagedUDF* mUDF, laPropPack *pp, void *ParentInst, int Mode){
  3027. laPropStep SubPS = {0};
  3028. laPropPack SubPP = {0};
  3029. char buf[LA_RAW_CSTR_MAX_LEN] = {0};
  3030. laProp *p = pp->LastPs->p, *subp;
  3031. short SubMode, ItemType = 0;
  3032. void *Instance = 0;
  3033. void *ReadInstance;
  3034. int ReadState;
  3035. int NumItems;
  3036. short PropNumPerItem;
  3037. void *ActiveInstance;
  3038. short PreReadMode;
  3039. int i, j;
  3040. int VariableNodeSize;
  3041. char NodeType[128]={0};
  3042. int EStatus = 0;
  3043. real ReadF;
  3044. int ReadI;
  3045. int IsExceptionNode = 0;
  3046. SubPP.LastPs = &SubPS;
  3047. switch (p->PropertyType){
  3048. case LA_PROP_SUB:
  3049. la_EnsureSubTarget(p, 0);
  3050. SubMode = la_ReadShort(udf);
  3051. if (SubMode == LA_UDF_SHARE_RESOURCE){
  3052. la_ReadString(udf, buf);
  3053. laSetActiveInstance(p, pp->LastPs->UseInstance, la_FindSharedResouce(buf));
  3054. }elif (SubMode == LA_UDF_REFER){
  3055. Instance = la_ReadPointer(udf);
  3056. if (Instance && p->Offset>=0){
  3057. if (p->OffsetIsPointer) la_AddPtrSyncCommand(Instance, ParentInst, 0, p);
  3058. else la_AddDataInst(Instance, 0, ((BYTE *)pp->LastPs->UseInstance + p->Offset));
  3059. }
  3060. }elif (SubMode == (short)(LA_UDF_REFER | LA_UDF_HYPER_ITEM)){
  3061. char NUID[32]={0};
  3062. NUID[0] = 0;
  3063. la_ReadString(udf, NUID);
  3064. if (NUID[0]){
  3065. la_AddPtrSyncCommand(0, ParentInst, NUID, p);
  3066. }
  3067. }elif (SubMode == LA_UDF_COLLECTION){
  3068. laProp **PreList = 0; void *ThisDBInst = 0;
  3069. NumItems = la_ReadInt(udf);
  3070. VariableNodeSize = la_ReadInt(udf);
  3071. VariableNodeSize = (VariableNodeSize == LA_UDF_VARIABLE_NODE_SIZE) ? 1 : 0;
  3072. la_ReadShort(udf); //active mark
  3073. ActiveInstance = la_ReadPointer(udf);
  3074. if (NumItems == 0) break;
  3075. if (p->UDFNoCreate){
  3076. laPropIterator PI = {0};
  3077. ItemType = la_ReadShort(udf);
  3078. Instance = laGetInstance(p, pp->LastPs->UseInstance, &PI);
  3079. la_ResetInstance(Instance, p->SubProp,0);
  3080. if (ItemType == LA_UDF_HYPER_ITEM){
  3081. if (p->SubProp->Hyper == 2){
  3082. if (!IsExceptionNode) la_ReadHyperData(udf, Instance);
  3083. else la_ReadHyperData(udf, 0);
  3084. if(mUDF) memAssignRef(Instance, &((laMemNodeHyper*)memGetHead(Instance, 0))->FromFile, mUDF);
  3085. memMarkClean(Instance);
  3086. }else la_ReadHyperData(udf, 0);
  3087. if(Mode==LA_UDF_MODE_APPEND){ lstAppendPointer(&MAIN.RenewHyper2s,Instance); }
  3088. }
  3089. if (p->SubProp->PostRead) la_AddPostReadNode(Instance, p->SubProp->PostRead);
  3090. ReadInstance = la_ReadPointer(udf);
  3091. ReadState = la_ReadInt(udf);
  3092. ThisDBInst=Instance;
  3093. PropNumPerItem = la_ReadShort(udf);
  3094. for (j = 0; j < PropNumPerItem; j++){
  3095. int result;
  3096. la_ReadString(udf, buf);
  3097. subp = la_PropLookup(&p->SubProp->Props, buf);
  3098. SubPP.RawThis = pp;
  3099. SubPS.p = subp;
  3100. SubPS.UseInstance = Instance;
  3101. if ((!subp) ||subp->UDFIgnore){la_ExtractFakeProp(udf); continue;}
  3102. if (subp&&!subp->SubProp){ subp->SubProp = la_ContainerLookup(((laSubProp *)subp)->TargetID); }
  3103. result = (IsExceptionNode||!subp) ? result = la_ExtractFakeProp(udf) : la_ExtractProp(udf, mUDF, &SubPP, ThisDBInst, Mode);
  3104. EStatus = result ? result : EStatus;
  3105. }
  3106. if (p->SubProp->PostReadIm) p->SubProp->PostReadIm(Instance);
  3107. }else{
  3108. if(Mode==LA_UDF_MODE_APPEND && p->UDFIsSingle){
  3109. logPrint("[Note] Mode is APPEND but property '%s' only allows one instance, will overwrite.\n", p->Identifier);
  3110. }
  3111. for (i = 0; i < NumItems; i++){
  3112. int RealSize=0; laUDF *SaveUDF = 0; int SaveItemType = 0;IsExceptionNode = 0; Instance=0;
  3113. laPropContainer* pc=p->SubProp;
  3114. if(VariableNodeSize){ la_ReadString(udf, NodeType); pc=la_ContainerLookup(NodeType);
  3115. if(!pc){pc=p->SubProp;} RealSize=pc->NodeSize;
  3116. }
  3117. ItemType = la_ReadShort(udf);
  3118. if(p->UDFReadProgress){
  3119. #ifdef LAGUI_ANDROID // Unbind GLES context so progress can be drawn in the thread.
  3120. eglMakeCurrent(MAIN.egl_dpy,0,0,0);
  3121. #endif
  3122. laShowProgress((real)i/NumItems,-1);
  3123. } //printf("add pc %s\n",pc->Identifier);
  3124. if(pc==LA_PC_SOCKET_OUT || pc==LA_PC_SOCKET_IN){ laGraphRequestRebuild(); }
  3125. int replaced=0;
  3126. if (udf){
  3127. int IsItem=((laSubProp*)p)->ListHandleOffset?1:0;
  3128. RealSize = RealSize ? RealSize : p->SubProp->NodeSize;
  3129. if (!IsExceptionNode){
  3130. if (p->UDFIsSingle && (pp->EndInstance=laGetActiveInstanceStrict(pp->LastPs->p,pp->LastPs->UseInstance))){
  3131. Instance = pp->EndInstance; la_ResetInstance(Instance, pc, IsItem); replaced=1;
  3132. }
  3133. else{
  3134. // if overwrite, find the instance here for hyper2, if not Hyper 2 then notice can't overwrite.
  3135. if (pc->Hyper == 2){
  3136. if(Mode==LA_UDF_MODE_OVERWRITE && ItemType == LA_UDF_HYPER_ITEM){
  3137. laUID uid; la_PeekHyperUID(udf, &uid.String);
  3138. Instance = la_GetReadDBInstNUID(uid.String);
  3139. if(Instance){ la_ResetInstance(Instance, pc,IsItem); replaced=1; }
  3140. else{ /*logPrint("[Note] Hyper2 item [%s] from property '%s' hasn't been loaded yet, will append.\n", uid.String, p->Identifier);*/ }
  3141. }
  3142. if(!Instance) Instance = memAcquireHyperNoAppend(RealSize);
  3143. memMarkClean(Instance);
  3144. }elif (pc->Hyper == 1) Instance = memAcquire(RealSize);
  3145. else Instance = memAcquireSimple(RealSize);
  3146. }
  3147. }
  3148. if (ItemType == LA_UDF_HYPER_ITEM){
  3149. if (pc->Hyper == 2){
  3150. la_ReadHyperData(udf, Instance);
  3151. if(mUDF) memAssignRef(Instance, &((laMemNodeHyper*)memGetHead(Instance, 0))->FromFile, mUDF);
  3152. }
  3153. else la_ReadHyperData(udf, 0);
  3154. if(Mode==LA_UDF_MODE_APPEND){ lstAppendPointer(&MAIN.RenewHyper2s,Instance); }
  3155. }
  3156. if (!IsExceptionNode){
  3157. if (pc->PostRead) la_AddPostReadNode(Instance, pc->PostRead);
  3158. }
  3159. ReadInstance = la_ReadPointer(udf);
  3160. ReadState = la_ReadInt(udf);
  3161. if (!IsExceptionNode && !replaced){
  3162. la_AddDataInst(ReadInstance, pc->Hyper == 2 ? ((laMemNodeHyper *)memGetHead(Instance,0))->NUID.String : 0, Instance);
  3163. }
  3164. ThisDBInst = Instance;
  3165. PropNumPerItem = la_ReadShort(udf);
  3166. for (j = 0; j < PropNumPerItem; j++){
  3167. u64bit ThisSeek;
  3168. la_ReadString(udf, buf);
  3169. subp = la_PropLookup(&pc->Props, buf);
  3170. if ((!subp) || subp->UDFIgnore) la_ExtractFakeProp(udf);
  3171. else{
  3172. int result;
  3173. ThisSeek = la_Tell(udf);
  3174. SubPP.RawThis = pp; SubPS.p = subp; SubPS.UseInstance = Instance;
  3175. la_EnsureSubTarget(subp, 0);
  3176. result = IsExceptionNode ? la_ExtractFakeProp(udf) : la_ExtractProp(udf, mUDF, &SubPP, ThisDBInst, Mode);
  3177. EStatus = result ? result : EStatus;
  3178. }
  3179. }
  3180. if (pc->PostReadIm) pc->PostReadIm(Instance);
  3181. if (!IsExceptionNode && !replaced){
  3182. if (pp->LastPs->UseInstance){
  3183. if (!p->UDFIsSingle){
  3184. if (((laSubProp *)p)->ListHandleOffset){
  3185. laListHandle* inst_lst=(BYTE *)pp->LastPs->UseInstance + ((laSubProp *)p)->ListHandleOffset;
  3186. if(p->Container->SaverDummy && p==p->Container->SaverDummy){ laPurgeSaverDummy(pp->LastPs->UseInstance,p); }
  3187. lstAppendItem(inst_lst, Instance);
  3188. }else{ lstAppendItem(&pc->FailedNodes, Instance); EStatus = 1; }
  3189. }else{ if (!p->UDFNoCreate){ laSetActiveInstance(p, pp->LastPs->UseInstance, Instance); } }
  3190. if (ReadInstance == ActiveInstance) laSetActiveInstance(p, pp->LastPs->UseInstance, Instance);
  3191. }else{
  3192. if (!p->UDFIsSingle){ lstAppendItem(&pc->FailedNodes, Instance); EStatus = 1; }
  3193. }
  3194. }
  3195. }
  3196. }
  3197. }
  3198. if (PreList) memFree(PreList);
  3199. }
  3200. break;
  3201. case LA_PROP_INT:
  3202. case LA_PROP_ARRAY | LA_PROP_INT:
  3203. ReadI = la_ReadIntProp(udf, pp);
  3204. break;
  3205. case LA_PROP_FLOAT:
  3206. case LA_PROP_ARRAY | LA_PROP_FLOAT:
  3207. ReadF = la_ReadFloatProp(udf, pp);
  3208. break;
  3209. case LA_PROP_STRING:
  3210. la_ReadStringProp(udf, pp);
  3211. break;
  3212. case LA_PROP_ENUM:
  3213. case LA_PROP_ARRAY | LA_PROP_ENUM:
  3214. la_ReadEnumProp(udf, pp, buf);
  3215. break;
  3216. case LA_PROP_RAW:
  3217. la_ReadRawProp(udf, pp);
  3218. break;
  3219. default:
  3220. break;
  3221. }
  3222. return EStatus;
  3223. }
  3224. void la_RematchPointers(int Mode){
  3225. laUDFPostRead *uprd;
  3226. void* inst;
  3227. la_ExecutePtrSyncCommand(Mode);
  3228. while(uprd=lstPopItem(&MAIN.PostReadNodes)){ uprd->Func(uprd->Instance); memFree(uprd); }
  3229. while(inst=lstPopPointer(&MAIN.RenewHyper2s)){ laMemNodeHyper* h=memGetHead(inst,0);memMakeHyperData(h);memAssignRef(h,&h->FromFile,0); }
  3230. }
  3231. int la_WriteHyperRecords(laUDF *udf){
  3232. int i = 0;
  3233. u64bit CountSeek = la_Tell(udf);
  3234. u64bit EndSeek;
  3235. laUDFHyperRecordItem *hri;
  3236. laMemNodeHyper* h;
  3237. la_WriteLong(udf, 0);
  3238. while (hri = lstPopItem(&udf->HyperRecords)){
  3239. h=memGetHead(hri->HyperUserMem, 0);
  3240. la_WriteString(udf, h->NUID.String);
  3241. if(hri->pc) la_WriteString(udf, hri->pc->Identifier); else la_WriteString(udf, "");
  3242. la_WritePointer(udf, hri->Seek);
  3243. i++; memFree(hri);
  3244. }
  3245. EndSeek = la_Tell(udf);
  3246. la_Seek(udf, CountSeek); la_WriteLong(udf, i); la_Seek(udf, EndSeek);
  3247. return i;
  3248. }
  3249. void la_WritePropQuickSeek(laUDF *udf){
  3250. for(laUDFPropSegment* ps=udf->PropsToOperate.pFirst;ps;ps=ps->Item.pNext){
  3251. la_WriteString(udf,SSTR(ps->Path)); la_WriteLong(udf,ps->WriteQuickSeek);
  3252. }
  3253. }
  3254. int laPackUDF(laUDF *udf, int UseInstanceList, int DoBackup){
  3255. laUDFPropSegment *ps;
  3256. short NumSegments = 0;
  3257. u64bit RefPos;
  3258. u64bit nuidSeekRef;
  3259. u64bit nuidActualSeek;
  3260. char FilePath[PATH_MAX];
  3261. char OldPath[PATH_MAX];
  3262. char OldPathSwap[PATH_MAX];
  3263. if(DoBackup){
  3264. char BackupPath[1024]; sprintf(BackupPath,"%s~",SSTR(udf->FileName));
  3265. if(laCopyFile(BackupPath,SSTR(udf->FileName))){
  3266. logPrintNew("UDF backup written to \"%s\".\n", BackupPath);
  3267. }else{
  3268. logPrintNew("Error trying to back up \"%s\".\n", SSTR(udf->FileName));
  3269. }
  3270. }
  3271. sprintf(OldPath,"%s",SSTR(udf->FileName));
  3272. sprintf(FilePath,"%s.incomplete",SSTR(udf->FileName));
  3273. udf->DiskFile = fopen(FilePath, "wb");
  3274. if (!udf->DiskFile) return 0;
  3275. la_WriteOnlyMBString(udf, LA_UDF_IDENTIFIER);
  3276. u64bit SizeAndExt=la_Tell(udf);
  3277. // reserved for extension switches and file size verifications.
  3278. la_WritePointer(udf, 0);
  3279. RefPos = la_Tell(udf);
  3280. la_WriteLong(udf, 0); //How Many Refs.
  3281. la_WriteShort(udf, udf->NumSegmets);
  3282. la_WriteLong(udf, LA_UDF_NUID_SEEK);
  3283. nuidSeekRef = la_Tell(udf);
  3284. la_WritePointer(udf, 0); //Seek pos for nuid list;
  3285. logPrintNew("Packing %s:\n", SSTR(udf->FileName));
  3286. udf->CurrentH2Instance=udf->H2Instances.pFirst;
  3287. for(laUDFPropSegment* ps=udf->PropsToOperate.pFirst;ps;ps=ps->Item.pNext){
  3288. printf(" %-15s\n", ps->Path ? ps->Path->Ptr : ps->PPP->LastPs->p->Identifier);
  3289. ps->WriteQuickSeek = la_Tell(udf);
  3290. la_WriteProp(udf, ps->PPP ? ps->PPP : &ps->PP, ps->PPP ? 1 : 0, UseInstanceList);
  3291. }
  3292. nuidActualSeek = la_Tell(udf);
  3293. la_WritePropQuickSeek(udf);
  3294. la_WriteHyperRecords(udf);
  3295. u64bit ActualSize=la_Tell(udf);
  3296. la_Seek(udf, RefPos); la_WriteLong(udf, udf->TotalRefs);
  3297. la_Seek(udf, nuidSeekRef); la_WritePointer(udf, nuidActualSeek);
  3298. la_Seek(udf, SizeAndExt); la_WritePointer(udf, ((ActualSize&(0x0000ffffffffffff))<<16)|LA_UDF_EXTENSIONS_ENABLED);
  3299. udf->Modified = 0;
  3300. while(ps = lstPopItem(&udf->PropsToOperate)){
  3301. la_FreePropStepCache(ps->PP.Go);
  3302. strSafeDestroy(&ps->Path);
  3303. FreeMem(ps);
  3304. }
  3305. laCloseUDF(udf);
  3306. /* Move disk file to final name and remove the old file. */
  3307. sprintf(OldPathSwap,"%s.swap",OldPath);
  3308. if(rename(OldPath,OldPathSwap)){ logPrint("Failed to rename old file %s\n",OldPath); }
  3309. if(rename(FilePath,OldPath)){ logPrint("Failed to rename file to final name: %s\n",OldPath); }
  3310. elif(remove(OldPathSwap)){ logPrint("Failed to remove old swap file %s\n",OldPathSwap); }
  3311. logPrint("[ALL DONE]\n");
  3312. laHideProgress();
  3313. return 1;
  3314. }
  3315. void laExtractProp(laUDF *udf, char* Path){
  3316. laUDFPropSegment *ps = CreateNew(laUDFPropSegment);
  3317. strSafeSet(&ps->Path, Path);
  3318. }
  3319. int la_PropIsSelected(laUDF* udf, char* Path){
  3320. if(!udf->PropsToOperate.pFirst) return 1;
  3321. for(laUDFPropSegment* ps=udf->PropsToOperate.pFirst;ps;ps=ps->Item.pNext){
  3322. if(strSame(SSTR(ps->Path),Path)) return 1;
  3323. }
  3324. return 0;
  3325. }
  3326. int laExtractUDF(laUDF *udf, laManagedUDF* mUDF, int Mode){
  3327. char Identifier[9] = {0};
  3328. char buf[1024]={0};
  3329. short Version, NumSegments;
  3330. //laPropStep SubPS = { 0 };
  3331. int PointerBits;
  3332. laPropPack SubPP = {0};
  3333. int i;
  3334. int EStatus = 0;
  3335. u64bit SeekRef;
  3336. int IsPart;
  3337. ma_device_stop(&MAIN.Audio->AudioDevice);
  3338. if(MAIN.InitArgs.HasAudio) laSpinLock(&MAIN.Audio->AudioStatusLock);
  3339. MAIN.IsReadingUDF = 1;
  3340. la_ReadBuffer(udf, sizeof(LA_UDF_IDENTIFIER) - 1, Identifier);
  3341. // file size verification and extension switches.
  3342. u64bit verification=la_ReadPointer(udf);
  3343. u64bit FileSize=verification>>16; int Extensions=verification&LA_UDF_ALL_EXTENSIONS;
  3344. if(FileSize && FileSize<la_FileSize(udf)){ logPrintNew("UDF verification failed for %s\n", udf->FileName->Ptr); return 0; }
  3345. /*udf->TotalRefs = */ la_ReadLong(udf);
  3346. NumSegments = la_ReadShort(udf);
  3347. la_ReadLong(udf); //seek mark
  3348. SeekRef = la_ReadPointer(udf);
  3349. logPrintNew("Extracting UDF [0x%x] %s:\n", udf->Extensions, udf->FileName->Ptr);
  3350. //MAIN.NextPendingPointer = 0;
  3351. //MAIN.PendingPointers = CreateNewBuffer(laUDFPointerRecord, udf->TotalRefs);
  3352. //SubPP.LastPs = &SubP;
  3353. for (i = 0; i < NumSegments; i++){
  3354. void *dbi = 0;
  3355. int result, LastOffset, selected=0;
  3356. la_ReadString(udf, buf);
  3357. LastOffset = strlen(buf) - 1;
  3358. buf[LastOffset] = buf[LastOffset] == U'.' ? 0 : buf[LastOffset];
  3359. logPrint(" Prop Segment \"%s\" ...", buf);
  3360. selected = la_PropIsSelected(udf, buf);
  3361. la_GetPropFromPath(&SubPP, 0, buf, 0);
  3362. la_StepPropPack(&SubPP);
  3363. dbi = SubPP.EndInstance; //la_GetWriteDBInst(SubPP.EndInstance);
  3364. result = (SubPP.LastPs&&SubPP.LastPs->p&&selected)?
  3365. la_ExtractProp(udf, mUDF, &SubPP, dbi, Mode):
  3366. la_ExtractFakeProp(udf);
  3367. EStatus = result ? result : EStatus;
  3368. //if(SubPP.LastPs->p->PropertyType!=LA_PROP_RAW){
  3369. // laNotifyUsersPP(&SubPP);
  3370. //}
  3371. logPrint(" [Done]\n", buf);
  3372. la_FreePropStepCache(SubPP.Go);
  3373. SubPP.Go = 0;
  3374. }
  3375. la_RematchPointers(Mode);
  3376. laHideProgress();
  3377. MAIN.IsReadingUDF = 0;
  3378. laUDFPropSegment* ps; while (ps = lstPopItem(&udf->PropsToOperate)){ strSafeDestroy(&ps->Path); FreeMem(ps); }
  3379. if(MAIN.InitArgs.HasAudio) laSpinUnlock(&MAIN.Audio->AudioStatusLock);
  3380. return EStatus;
  3381. }
  3382. int laExtractQuickRaw(FILE* fp, char* path, uint8_t** buf, size_t* size){
  3383. laUDF _udf={0},*udf=&_udf; udf->DiskFile = fp;
  3384. char str[128];
  3385. char Identifier[32];
  3386. la_Seek(udf,0);
  3387. la_ReadBuffer(udf, sizeof(LA_UDF_IDENTIFIER) - 1, Identifier);
  3388. u64bit verification=la_ReadPointer(udf);
  3389. u64bit FileSize=verification>>16; int Extensions=verification&LA_UDF_ALL_EXTENSIONS;
  3390. if(FileSize && FileSize<la_FileSize(udf)){ return 0; }
  3391. if(!(Extensions & LA_UDF_EXTENSION_QUICK_SEEK)){ return 0; }
  3392. /*udf->TotalRefs = */ la_ReadLong(udf);
  3393. short NumSegments = la_ReadShort(udf);
  3394. la_ReadLong(udf); //seek mark
  3395. off_t SeekRef = la_ReadPointer(udf);
  3396. la_Seek(udf,SeekRef);
  3397. for(int i=0;i<NumSegments;i++){
  3398. la_ReadString(udf,str);
  3399. int Seek = la_ReadLong(udf);
  3400. if(strSame(str,path)){
  3401. la_Seek(udf,Seek);
  3402. la_ReadString(udf, str); // prop name
  3403. la_ReadShort(udf);// raw mark
  3404. void* data=la_ReadRaw(udf,size);
  3405. *buf=data; if(data){ return 1; }
  3406. break;
  3407. }
  3408. }
  3409. return 0;
  3410. }
  3411. laManagedUDF* la_FindManagedUDF(char* FileName){
  3412. for(laManagedUDF* m=MAIN.ManagedUDFs.pFirst;m;m=m->Item.pNext){
  3413. if(m->udf&&m->udf->FileName&&!strcmp(m->udf->FileName->Ptr,FileName)) return m;
  3414. }
  3415. return 0;
  3416. }
  3417. laManagedUDF* la_EnsureManagedUDF(char* FileName, int PutAtTop){
  3418. laManagedUDF* m;
  3419. if(!(m=la_FindManagedUDF(FileName))){
  3420. m=memAcquire(sizeof(laManagedUDF)); strSafeSet(&m->BaseName, strGetLastSegment(FileName,LA_PATH_SEP));
  3421. if(PutAtTop) lstPushItem(&MAIN.ManagedUDFs, m); else lstAppendItem(&MAIN.ManagedUDFs, m);
  3422. }
  3423. return m;
  3424. }
  3425. void la_MakeDummyManagedUDF(){
  3426. MAIN.DummyManageUDF=la_EnsureManagedUDF(transLate("< Save as a new file >"), 1);
  3427. if(!MAIN.DummyManageUDFSingle){
  3428. MAIN.DummyManageUDFSingle=memAcquire(sizeof(laManagedUDF)); strSafeSet(&MAIN.DummyManageUDFSingle->BaseName, transLate("< Choose file >"));
  3429. MAIN.DummyManageUDFSingleForce=memAcquire(sizeof(laManagedUDF)); strSafeSet(&MAIN.DummyManageUDFSingleForce->BaseName, transLate("< Force >"));
  3430. }
  3431. }
  3432. laManagedSaveProp* laSaveProp(char* path){
  3433. if(!path || !path[0]) return 0; laManagedSaveProp* msp=0;
  3434. for(laManagedSaveProp* m=MAIN.ManagedSaveProps.pFirst;m;m=m->Item.pNext){
  3435. if(!strcmp(m->Path->Ptr,path)){ msp=m; break; }
  3436. }
  3437. if(!msp){ msp=memAcquireSimple(sizeof(laManagedSaveProp)); lstAppendItem(&MAIN.ManagedSaveProps, msp); }
  3438. strSafeSet(&msp->Path, path);
  3439. return msp;
  3440. }
  3441. void laSaveAlongside(laManagedSaveProp* parent, char* path){
  3442. if(!path || !path[0] || !parent) return; laManagedSaveProp* msp=0;
  3443. for(laManagedSaveProp* m=parent->SaveAlongside.pFirst;m;m=m->Item.pNext){
  3444. if(!strcmp(m->Path->Ptr,path)){ msp=m; break; }
  3445. }
  3446. if(!msp){ msp=memAcquireSimple(sizeof(laManagedSaveProp)); lstAppendItem(&parent->SaveAlongside, msp); }
  3447. strSafeSet(&msp->Path, path);
  3448. }
  3449. void laSetThumbnailProp(char* path){
  3450. strSafeSet(&MAIN.ThumbnailProp,path);
  3451. }
  3452. void laClearSaveProp(){
  3453. laManagedSaveProp* m; while(m=lstPopItem(&MAIN.ManagedSaveProps)) {
  3454. laManagedSaveProp* ma; while(ma=lstPopItem(&m->SaveAlongside)){ strSafeDestroy(&ma->Path); memFree(ma); }
  3455. strSafeDestroy(&m->Path); memFree(m);
  3456. }
  3457. }
  3458. int la_ScanForModifiedRecursive(laPropPack* pp, int ReturnIfAnyMod, int ReturnIfAnyEmpty, int* rempty, int RegisterToUDF){
  3459. int result=0;
  3460. laProp* p=pp->LastPs->p; laPropIterator pi={0};
  3461. if(p->PropertyType!=LA_PROP_SUB || p->UDFIsRefer || p->UDFIgnore || p->UDFOnly) return 0;
  3462. la_EnsureSubTarget(p, 0); //if(p->SubProp && p->SubProp->Hyper!=2) return 0;
  3463. void* inst = laGetInstance(p, pp->LastPs->UseInstance, &pi);
  3464. while(inst){
  3465. laPropContainer* pc=la_EnsureSubTarget(p, inst);
  3466. if(pc->Hyper!=2){
  3467. laPropPack spp={0}; laPropStep sps={0}; spp.LastPs=&sps;
  3468. for(laProp* sp=pc->Props.pFirst;sp;sp=sp->Item.pNext){
  3469. sps.UseInstance=inst; sps.p=sp;
  3470. if(sp->PropertyType==LA_PROP_SUB) {
  3471. result|=la_ScanForModifiedRecursive(&spp, ReturnIfAnyMod, ReturnIfAnyEmpty, rempty, RegisterToUDF);
  3472. if((ReturnIfAnyMod||ReturnIfAnyEmpty)&&result)return result;
  3473. }
  3474. }
  3475. }else{
  3476. laMemNodeHyper* m = memGetHead(inst,0);
  3477. int DummyClean=((p!=p->Container->SaverDummy)||((p==p->Container->SaverDummy)&&(!m->Modified)));
  3478. if(!m->FromFile || m->FromFile==MAIN.DummyManageUDF){
  3479. if(!DummyClean){
  3480. result|=1; if(rempty)*rempty|=1; if((ReturnIfAnyMod||ReturnIfAnyEmpty)&&result)return result;
  3481. }
  3482. }
  3483. if((!p->UDFIsSingle)&&(!p->UDFNoCreate)&&RegisterToUDF&&m->FromFile&&m->FromFile->udf){ la_IncludeHyper2Instance(m->FromFile->udf, pc, inst); }
  3484. if(m->Modified){
  3485. if(m->FromFile && m->FromFile->udf){ m->FromFile->udf->Modified=1; }
  3486. result|=1; if(ReturnIfAnyMod&&result)return result;
  3487. }
  3488. }
  3489. inst=laGetNextInstance(p,inst,&pi);
  3490. }
  3491. return result;
  3492. }
  3493. int laRegisterModifications(int ReturnIfAnyMod, int ReturnIfAnyEmpty, int* rempty, int RegisterToUDF){
  3494. int result=0, registered; if(RegisterToUDF){ReturnIfAnyMod=ReturnIfAnyEmpty=0;}
  3495. for(laManagedUDF* m=MAIN.ManagedUDFs.pFirst;m;m=m->Item.pNext){
  3496. if(!m->udf)continue;
  3497. m->udf->Modified=0;
  3498. la_ClearHyper2Instances(m->udf);
  3499. }
  3500. for(laManagedSaveProp* msp=MAIN.ManagedSaveProps.pFirst;msp;msp=msp->Item.pNext){
  3501. laPropPack PP={0}; registered=0;
  3502. if(msp->Path&&msp->Path->Ptr&&la_GetPropFromPath(&PP, 0, msp->Path->Ptr, 0)){
  3503. la_StepPropPack(&PP);
  3504. result|=la_ScanForModifiedRecursive(&PP, ReturnIfAnyMod, ReturnIfAnyEmpty, rempty, RegisterToUDF);
  3505. for(laManagedUDF* m=MAIN.ManagedUDFs.pFirst;m;m=m->Item.pNext){
  3506. if(!m->udf)continue;
  3507. if(m->udf->HasInstances){ laWriteProp(m->udf,SSTR(msp->Path));
  3508. for(laManagedSaveProp* am=msp->SaveAlongside.pFirst;am;am=am->Item.pNext){
  3509. laWriteProp(m->udf,SSTR(am->Path));
  3510. }
  3511. m->udf->HasInstances=0;
  3512. }
  3513. }
  3514. if((ReturnIfAnyMod||ReturnIfAnyEmpty)&&result)return result;
  3515. la_FreePropStepCache(PP.Go);
  3516. }
  3517. }
  3518. return result;
  3519. }
  3520. void la_ReadUDFToMemory(laUDF *udf){
  3521. if (udf->FileContent)
  3522. return;
  3523. fseek(udf->DiskFile, 0, SEEK_END);
  3524. u64bit SeekEnd = ftell(udf->DiskFile);
  3525. fseek(udf->DiskFile, 0, SEEK_SET);
  3526. udf->FileContent = calloc(1, SeekEnd);
  3527. udf->FileContentSize=SeekEnd;
  3528. fread(udf->FileContent, SeekEnd, 1, udf->DiskFile);
  3529. udf->Seek = 0;
  3530. }
  3531. void la_ReadOwnHyperItems(laUDF *udf, laUDFRegistry* r){
  3532. int Count, i;
  3533. laUDFOwnHyperItem *ohi;
  3534. Count = la_ReadLong(udf);
  3535. int Seek;
  3536. char name[256]; laUID uid;
  3537. for (i = 0; i < Count; i++){
  3538. la_ReadString(udf, uid.String);
  3539. la_ReadString(udf, name);
  3540. Seek=la_ReadPointer(udf);
  3541. laPropContainer* pc = la_ContainerLookup(name);
  3542. if(!laFindHyperResource(uid.String)){
  3543. ohi = laNewHyperResource(uid.String);
  3544. ohi->Registry = r;
  3545. ohi->Seek = Seek;
  3546. strcpy(ohi->NUID.String, uid.String);
  3547. //logPrint("Found Resource: %s | %s\n",ohi->NUID.String,name);
  3548. } else {logPrint("Duplicated Resource: %s | %s\n",uid.String,name);}
  3549. }
  3550. }
  3551. void la_ReadPropQuickSeek(laUDF *udf){
  3552. char* buf[128];
  3553. for(int i=0;i<udf->NumSegmets;i++){
  3554. laUDFPropQuickSeek *qs = memAcquireSimple(sizeof(laUDFPropQuickSeek));
  3555. la_ReadString(udf,buf); strSafeSet(&qs->Path,buf);
  3556. qs->QuickSeek = la_ReadLong(udf);
  3557. lstAppendItem(&udf->QuickSeeks,qs);
  3558. //logPrint(" %dx QuickSeeks\n",qs->QuickSeek,SSTR(qs->Path));
  3559. }
  3560. }
  3561. laUDF *laOpenUDF(char *FileName, int ReadToMemory, laUDFRegistry* ReadRegistryRef, laManagedUDF** UseManaged){
  3562. char Identifier[9] = {0};
  3563. u64bit SeekRef;
  3564. laUDF *udf;
  3565. u64bit extensions;
  3566. char FilePath[1024]={0};
  3567. udf=memAcquire(sizeof(laUDF));
  3568. strSafeSet(&udf->FileName, FileName);
  3569. udf->DiskFile = fopen(SSTR(udf->FileName), "rb");
  3570. if (!udf->DiskFile) return 0;
  3571. if(ReadToMemory){ la_ReadUDFToMemory(udf); fclose(udf->DiskFile); udf->DiskFile = 0; }
  3572. la_ReadBuffer(udf, sizeof(LA_UDF_IDENTIFIER) - 1, Identifier);
  3573. if (!strSame(Identifier, LA_UDF_IDENTIFIER)){ laCloseUDF(udf); logPrintNew("\"%s\" is not a UDF file.\n", FileName); return 0; }
  3574. if(UseManaged){
  3575. laManagedUDF* m=la_EnsureManagedUDF(FileName, 0);
  3576. if(!m->udf) m->udf=udf; udf->Managed=1; *UseManaged=m;
  3577. }
  3578. extensions = la_ReadPointer(udf);
  3579. udf->Extensions = extensions & LA_UDF_ALL_EXTENSIONS;
  3580. if((udf->Extensions | LA_UDF_EXTENSIONS_ENABLED)!=LA_UDF_EXTENSIONS_ENABLED){
  3581. logPrint("Unsupported UDF extension 0x%x (0x%x enabled), it's probably saved with a newer version of the program.\n",
  3582. udf->Extensions,LA_UDF_EXTENSIONS_ENABLED);
  3583. laCloseUDF(udf);
  3584. return 0;
  3585. }
  3586. udf->TotalRefs = la_ReadLong(udf); //total refs
  3587. udf->NumSegmets = la_ReadShort(udf); //num segments
  3588. la_ReadLong(udf); //seek mark
  3589. SeekRef = la_ReadPointer(udf);
  3590. la_Seek(udf, SeekRef);
  3591. if(ReadRegistryRef){
  3592. if(udf->Extensions & LA_UDF_EXTENSION_QUICK_SEEK){
  3593. la_ReadPropQuickSeek(udf);
  3594. }
  3595. la_ReadOwnHyperItems(udf, ReadRegistryRef);
  3596. }
  3597. la_Seek(udf, 0);
  3598. udf->Opened = 1;
  3599. return udf;
  3600. }
  3601. void laCloseUDF(laUDF *udf){
  3602. laUDFOwnHyperItem *ohi;
  3603. laUDFHyperRecordItem *hri;
  3604. laUDFPropSegment *ps;
  3605. laUDFPropQuickSeek *qs;
  3606. if (udf->DiskFile){ fclose(udf->DiskFile); udf->DiskFile=0; };
  3607. while (lstPopPointer(&udf->OwnHyperItems));
  3608. while (lstPopPointer(&udf->HyperRecords));
  3609. while (qs = lstPopItem(&udf->QuickSeeks)){ strSafeDestroy(&qs->Path); memFree(qs); }
  3610. if(udf->CurrentH2Instance){ logPrint("[WARN] udf->CurrentH2Instance!=0 after UDF packing.\n"); udf->CurrentH2Instance=0; }
  3611. udf->NumSegmets=0;
  3612. la_ClearHyper2Instances(udf);
  3613. if(udf->FileContent) FreeMem(udf->FileContent);
  3614. if(!udf->Managed){ strSafeDestroy(&udf->FileName); memFree(udf); }
  3615. }
  3616. int laLoadHyperResources(char* uid_search){
  3617. int count=0;
  3618. logPrintNew("Loading extra resources \"%s\"\n",uid_search);
  3619. for(laUDFOwnHyperItem* ohi=MAIN.UDFResources.pFirst;ohi;ohi=ohi->Item.pNext){
  3620. if(strstr(ohi->NUID.String,uid_search)){ laRequestAdditionalRegistry(ohi->Registry); count++; };
  3621. }
  3622. if(count){ la_LoadAdditionalRegistries(); } return count;
  3623. }
  3624. laUDFOwnHyperItem* laFindHyperResource(char* uid){
  3625. for(laUDFOwnHyperItem* ohi=MAIN.UDFResources.pFirst;ohi;ohi=ohi->Item.pNext){
  3626. if(!strcmp(uid, ohi->NUID.String)) return ohi;
  3627. }
  3628. return 0;
  3629. }
  3630. laUDFOwnHyperItem* laNewHyperResource(char* uid){
  3631. laUDFOwnHyperItem* ohi = memAcquireSimple(sizeof(laUDFOwnHyperItem));
  3632. lstAppendItem(&MAIN.UDFResources, ohi); return ohi;
  3633. }
  3634. laUDFRegistry* laFindUDFRegistry(char* Path){
  3635. for(laUDFRegistry* r=MAIN.ResourceRegistries.pFirst;r;r=r->Item.pNext){
  3636. if(r->Path && !strcmp(Path, r->Path->Ptr)) return r;
  3637. }
  3638. return 0;
  3639. }
  3640. laUDFRegistry* laCreateUDFRegistry(char* Path){
  3641. if(!Path) return 0;
  3642. laUDFRegistry* r = memAcquire(sizeof(laUDFRegistry));
  3643. strSafeSet(&r->Path, Path);
  3644. lstAppendItem(&MAIN.ResourceRegistries, r);
  3645. return r;
  3646. }
  3647. void laRequestAdditionalRegistry(laUDFRegistry* r){
  3648. if(la_FindManagedUDF(r->Path->Ptr)) return;
  3649. if(lstHasPointer(&MAIN.PendingResourceRequests, r)) return;
  3650. logPrint("[INFO] Request additional resources in: %s\n", r->Path->Ptr);
  3651. lstAppendPointer(&MAIN.PendingResourceRequests,r);
  3652. }
  3653. void laClearUDFRegistries(){
  3654. laUDFOwnHyperItem* ohi; laUDFRegistry* r;
  3655. while(ohi=lstPopItem(&MAIN.UDFResources)) memFree(ohi);
  3656. while(r=lstPopItem(&MAIN.ResourceRegistries)){
  3657. strSafeDestroy(&r->Path); memFree(r);
  3658. }
  3659. }
  3660. void laGetSubResourceDirectories(char* rootpath_with_slash, laListHandle* out){
  3661. laSafeString*s=0; strSafePrint(&s, "%sUDFExtra" LA_PATH_SEPSTR, rootpath_with_slash); lstAppendPointer(out,s);
  3662. char Final[1024];
  3663. sprintf(Final, "%s.udfextra",rootpath_with_slash);
  3664. FILE* f=fopen(Final, "r"); if(!f){ return; }
  3665. char dir[1024];
  3666. while(fgets(dir,1024,f)){ laSafeString*s=0; strSafePrint(&s, "%s%s" LA_PATH_SEPSTR, rootpath_with_slash, dir); lstAppendPointer(out,s); }
  3667. fclose(f);
  3668. }
  3669. void laRefreshUDFResourcesIn(char* rootpath){
  3670. char Final[2048];
  3671. int NumFiles=-1;
  3672. int len = strlen(rootpath);
  3673. if (len && rootpath[len - 1] != LA_PATH_SEP) strcat(rootpath, LA_PATH_SEPSTR);
  3674. #if defined(__linux__) || defined(LAGUI_ANDROID)
  3675. struct dirent **NameList=0;
  3676. NumFiles=scandir(rootpath,&NameList,0,alphasort);
  3677. logPrintNew("%d %s",NumFiles,rootpath);
  3678. for(int i=0;i<NumFiles;i++){
  3679. struct dirent* d = NameList[i]; int dlen;
  3680. char *format = strGetLastSegment(d->d_name, '.'); int file_okay=0;
  3681. for(laExtensionType* et=MAIN.ExtraExtensions.pFirst;et;et=et->Item.pNext){ if(et->FileType==LA_FILETYPE_UDF && strSame(et->Extension,format)){file_okay=1;break;} }
  3682. if(!file_okay) continue;
  3683. struct stat s;
  3684. sprintf(Final, "%s%s",rootpath,d->d_name);
  3685. stat(Final, &s);
  3686. if (!S_ISDIR(s.st_mode)){
  3687. if(!laFindUDFRegistry(Final)){
  3688. laUDFRegistry* r = laCreateUDFRegistry(Final);
  3689. laUDF* udf = laOpenUDF(Final, 0, r, 0);
  3690. if(udf) laCloseUDF(udf);
  3691. }
  3692. }
  3693. }
  3694. for (int i=0;i<NumFiles;i++){ free(NameList[i]); } if(NameList) free(NameList);
  3695. #endif
  3696. #ifdef _WIN32
  3697. WIN32_FIND_DATA FindFileData;
  3698. HANDLE hFind;
  3699. SYSTEMTIME stUTC, stLocal;
  3700. char Lookup[PATH_MAX];
  3701. strCopyFull(Lookup, rootpath); strcat(Lookup, "*.*");
  3702. hFind = FindFirstFile(Lookup, &FindFileData);
  3703. if (hFind == INVALID_HANDLE_VALUE) return;
  3704. while (1){
  3705. NumFiles++;
  3706. char* format = strGetLastSegment(FindFileData.cFileName, '.'); int file_okay = 0;
  3707. for (laExtensionType* et = MAIN.ExtraExtensions.pFirst; et; et = et->Item.pNext) { if (et->FileType == LA_FILETYPE_UDF && strSame(et->Extension, format)) { file_okay = 1; break; } }
  3708. if (file_okay) {
  3709. sprintf(Final, "%s%s", rootpath, FindFileData.cFileName);
  3710. struct stat s; stat(Final, &s);
  3711. if (!(s.st_mode & S_IFDIR)) {
  3712. if (!laFindUDFRegistry(Final)) {
  3713. laUDFRegistry* r = laCreateUDFRegistry(Final);
  3714. laUDF* udf = laOpenUDF(Final, 0, r, 0);
  3715. if (udf) laCloseUDF(udf);
  3716. }
  3717. }
  3718. }
  3719. if (!FindNextFile(hFind, &FindFileData))
  3720. break;
  3721. }
  3722. #endif
  3723. if (NumFiles >= 0) {
  3724. laListHandle additionals = { 0 }; laSafeString* s;
  3725. laGetSubResourceDirectories(rootpath, &additionals);
  3726. while (s = lstPopPointer(&additionals)) { laRefreshUDFResourcesIn(s->Ptr); strSafeDestroy(&s); }
  3727. }
  3728. }
  3729. void laRefreshUDFRegistries(){
  3730. laClearUDFRegistries();
  3731. char LookupM[PATH_MAX];
  3732. /* Always scan root directory. */
  3733. #ifdef LAGUI_ANDROID
  3734. const char* rootdir="";
  3735. sprintf(LookupM,"%s",rootdir);
  3736. laRefreshUDFResourcesIn(LookupM);
  3737. sprintf(LookupM,"%s/%s",MAIN.ExternalDataPath,rootdir);
  3738. laRefreshUDFResourcesIn(LookupM);
  3739. sprintf(LookupM,"%s/%s",MAIN.InternalDataPath,rootdir);
  3740. laRefreshUDFResourcesIn(LookupM);
  3741. #else
  3742. const char* rootdir=".";
  3743. realpath(rootdir, LookupM);
  3744. laRefreshUDFResourcesIn(LookupM);
  3745. #endif
  3746. for(laResourceFolder* rf = MAIN.ResourceFolders.pFirst;rf;rf=rf->Item.pNext){
  3747. #ifdef LAGUI_ANDROID
  3748. sprintf(LookupM,"%s",SSTR(rf->Path));
  3749. laRefreshUDFResourcesIn(LookupM);
  3750. sprintf(LookupM,"%s/%s",MAIN.ExternalDataPath,SSTR(rf->Path));
  3751. laRefreshUDFResourcesIn(LookupM);
  3752. sprintf(LookupM,"%s/%s",MAIN.InternalDataPath,SSTR(rf->Path));
  3753. laRefreshUDFResourcesIn(LookupM);
  3754. #else
  3755. realpath(SSTR(rf->Path), LookupM);
  3756. laRefreshUDFResourcesIn(LookupM);
  3757. #endif
  3758. }
  3759. }
  3760. void laStopManageUDF(laManagedUDF* m){
  3761. if(!m) return;
  3762. lstRemoveItem(&MAIN.ManagedUDFs,m);
  3763. if(m->udf) { m->udf->Managed=0; laCloseUDF(m->udf); };
  3764. strSafeDestroy(&m->BaseName);
  3765. memFree(m);
  3766. }
  3767. void laClearManagedUDF(){
  3768. laManagedUDF* m;
  3769. while(m=MAIN.ManagedUDFs.pFirst){ laStopManageUDF(m); }
  3770. }
  3771. int laSaveManagedUDF(int ModifiedOnly){
  3772. int allsuccess=1;
  3773. laRegisterModifications(0,0,0,1);
  3774. if(MAIN.PreSave){ MAIN.PreSave(); }
  3775. for(laManagedUDF* m=MAIN.ManagedUDFs.pFirst;m;m=m->Item.pNext){
  3776. if(!m->udf) continue;
  3777. if(ModifiedOnly && !m->udf->Modified){ continue; }
  3778. if(m->udf->PropsToOperate.pFirst){ if(!laPackUDF(m->udf, 1, 1)){ allsuccess=0; }; }
  3779. laCloseUDF(m->udf);// just in case
  3780. }
  3781. if(MAIN.PostSave){ MAIN.PostSave(); }
  3782. return allsuccess;
  3783. }
  3784. void laPropagateUDF(laPropContainer* pc, void* inst, int force){
  3785. if(!pc->UDFPropagate) return;
  3786. void* udf=laget_InstanceActiveUDF(inst); if(udf==MAIN.DummyManageUDF) return;
  3787. pc->UDFPropagate(inst, udf, force);
  3788. }
  3789. void laSetSaveCallback(laPreSaveF PreSave, laPostSaveF PostSave){
  3790. MAIN.PreSave=PreSave;
  3791. MAIN.PostSave=PostSave;
  3792. }
  3793. //==========================================================================[Manifest]
  3794. void laAddResourceFolder(char* Path){
  3795. laResourceFolder* rf=memAcquire(sizeof(laResourceFolder));
  3796. if(Path) strSafeSet(&rf->Path, Path);
  3797. lstAppendItem(&MAIN.ResourceFolders, rf);
  3798. }
  3799. void laRemoveResourceFolder(laResourceFolder* rf){
  3800. strSafeDestroy(&rf->Path);
  3801. lstRemoveItem(&MAIN.ResourceFolders, rf);
  3802. memFree(rf);
  3803. }
  3804. void la_ClearUDFRegistryAndFolders(){
  3805. laResourceFolder* rf; while(rf=MAIN.ResourceFolders.pFirst){ laRemoveResourceFolder(rf); }
  3806. laClearUDFRegistries();
  3807. }
  3808. //==========================================================================[undo]
  3809. void laPushDifferenceOnly(char* Description, u64bit hint){
  3810. laDiff* d=memAcquire(sizeof(laDiff));
  3811. lstAppendItem(&MAIN.Differences, d);
  3812. if(MAIN.HeadDifference && Description) strSafeSet(&MAIN.HeadDifference->Description,Description);
  3813. d->Hint=hint; MAIN.HeadDifference=d;
  3814. laNotifyUsers("la.differences");
  3815. }
  3816. void laPushDifferences(char* Description, u64bit hint){
  3817. memFreeRemainingLeftNodes();
  3818. laPushDifferenceOnly(Description,hint);
  3819. }
  3820. void la_FreeInstance(void* inst, laPropContainer* pc, int no_free);
  3821. void la_FreeDBInst(laDBInst* dbi, int no_freeinst, int cleanup_only, int SkipInstances);
  3822. void la_FreeDBProp(laDBProp* dbp, int cleanup_only, int SkipInstances){
  3823. //printf("free dbp %s %x\n",dbp->p->Identifier,dbp);
  3824. if(dbp->p->PropertyType==LA_PROP_SUB){
  3825. if((((laSubProp*)dbp->p)->ListHandleOffset||dbp->p->UDFNoCreate||dbp->p->UDFIsSingle)&&(!dbp->p->UDFIsRefer)&&(!SkipInstances)){
  3826. laDBSubProp* dsp=dbp; laDBInst* si;
  3827. //printf("fdbp %s %x %x %x\n",dbp->p->Identifier,dsp->Instances.pFirst,dsp->Instances.pLast,((laListItem*)dsp->Instances.pFirst)->pNext);
  3828. while(si=lstPopItem(&dsp->Instances)){ la_FreeDBInst(si,dbp->p->UDFNoCreate||(!dbp->p->OffsetIsPointer),cleanup_only,SkipInstances); }
  3829. } // prevent freeing the data;
  3830. }elif(dbp->p->PropertyType==LA_PROP_STRING && ((laStringProp*)dbp->p)->IsSafeString){
  3831. strSafeSet(&dbp->Data,0);
  3832. }elif(dbp->p->PropertyType==LA_PROP_RAW){
  3833. //printf("raw dbp %s\n",dbp->p->Identifier);
  3834. free(dbp->Data);
  3835. }else{
  3836. //printf("-data- %x\n",dbp->Data);
  3837. memFree(dbp->Data);
  3838. }
  3839. memFree(dbp);
  3840. }
  3841. void la_FreeDBInst(laDBInst* dbi, int no_freeinst, int cleanup_only, int SkipInstances){
  3842. laListHandle* l=hsh65536DoHashLongPtr(MAIN.DBInstLink,dbi->OriginalInstance); lstRemoveItem(l, &dbi->Item2);
  3843. //printf("free dbi %s %x\n", dbi->pc->Identifier,dbi);
  3844. laDBProp* dbp; while(dbp=lstPopItem(&dbi->Props)){ la_FreeDBProp(dbp, cleanup_only,SkipInstances); }
  3845. if(dbi->OriginalInstance && (!cleanup_only)) la_FreeInstance(dbi->OriginalInstance, dbi->pc, no_freeinst);
  3846. memFree(dbi);
  3847. }
  3848. void la_FreeDiffCommand(laDiffCommand* dc, laDiff* d, int FromLeft){
  3849. //printf("freedc %s\n",dc->p->Identifier);
  3850. if(dc->p->PropertyType==LA_PROP_SUB && (((laSubProp*)dc->p)->ListHandleOffset||dc->p->UDFNoCreate||dc->p->UDFIsSingle) && (!dc->p->UDFIsRefer)){
  3851. laDiffCommandInst* dci; laDiffCommandSub* dcs=dc;
  3852. while(dci=lstPopItem(&dcs->AddedInst)){ if(!FromLeft) la_FreeDBInst(dci->DBInst,(dc->p->UDFNoCreate||(!dc->p->OffsetIsPointer)),0,0); memFree(dci); }
  3853. while(dci=lstPopItem(&dcs->MovedInst)){ memFree(dci); }
  3854. while(dci=lstPopItem(&dcs->RemovedInst)){ if(FromLeft) la_FreeDBInst(dci->DBInst,(dc->p->UDFNoCreate||(!dc->p->OffsetIsPointer)),0,1); memFree(dci); }
  3855. }elif(dc->p->PropertyType==LA_PROP_STRING && ((laStringProp*)dc->p)->IsSafeString){
  3856. strSafeSet(&dc->Data,0);
  3857. }elif(dc->p->PropertyType==LA_PROP_RAW){
  3858. //printf("raw %s\n",dc->p->Identifier);
  3859. free(dc->Data);
  3860. }
  3861. memFree(dc);
  3862. }
  3863. void la_FreeDifference(laDiff* d, int FromLeft){
  3864. laDiffCommand* dc; laDiffCommandCustom* dcc; laDiffExtraTouched* det;
  3865. while(dc=lstPopItem(&d->Commands)){ la_FreeDiffCommand(dc,d,FromLeft); }
  3866. while(dcc=lstPopItem(&d->CustomCommands)){ if(dcc->Free) dcc->Free(dcc->Data, FromLeft); }
  3867. while(det=lstPopItem(&d->ExtraTouched)){ memFree(det); }
  3868. //if(d->Description&&d->Description->Ptr){printf("%s\n",d->Description->Ptr);}
  3869. strSafeDestroy(&d->Description);
  3870. }
  3871. void laFreeNewerDifferences(){
  3872. laDiff* PrevD;
  3873. if(MAIN.HeadDifference==MAIN.Differences.pLast) return;
  3874. for(laDiff* d=MAIN.Differences.pLast;d;d=PrevD){
  3875. PrevD=d->Item.pPrev;
  3876. lstRemoveItem(&MAIN.Differences,d);
  3877. la_FreeDifference(d,0);
  3878. if(MAIN.HeadDifference==d){ MAIN.HeadDifference=PrevD; laPushDifferenceOnly(0,0); break; }
  3879. }
  3880. }
  3881. void laFreeOlderDifferences(int KeepHowMany){
  3882. laDiff* endd; int count=0;
  3883. for(endd=MAIN.HeadDifference;endd;endd=endd->Item.pPrev){
  3884. if(count>=KeepHowMany) break; count++;
  3885. }
  3886. if(!endd) return; laDiff* d,*NextD;
  3887. while(d=lstPopItem(&MAIN.Differences)){
  3888. NextD=MAIN.Differences.pFirst;
  3889. la_FreeDifference(d,1);
  3890. if(MAIN.HeadDifference==d){ MAIN.HeadDifference=NextD; laPushDifferenceOnly(0,0); break; }
  3891. if(d==endd){ break; }
  3892. }
  3893. }
  3894. void la_FreeAllDifferences(){
  3895. laFreeNewerDifferences();
  3896. laFreeOlderDifferences(1);
  3897. }
  3898. void la_NoLongerRecordUndo(){
  3899. la_FreeAllDifferences();
  3900. laDBProp*dbp; while(dbp=lstPopItem(&MAIN.RootDBInst.Props)){ la_FreeDBProp(dbp,1,0); }
  3901. laDBRecordedProp* p; while(p=lstPopItem(&MAIN.DBRecordedProps)){ strSafeDestroy(&p->OriginalPath); memFree(p); }
  3902. hshFree(&MAIN.DBInstLink);
  3903. }
  3904. void la_RelinkDBInst(laDBInst* dbi, void* New_OriginalInstance){
  3905. if(dbi->OriginalInstance){
  3906. laListHandle* l=hsh65536DoHashLongPtr(MAIN.DBInstLink,dbi->OriginalInstance); lstRemoveItem(l, &dbi->Item2);
  3907. }
  3908. dbi->OriginalInstance = New_OriginalInstance;
  3909. laListHandle* l=hsh65536DoHashLongPtr(MAIN.DBInstLink,dbi->OriginalInstance); lstPushItem(l, &dbi->Item2);
  3910. }
  3911. laDBInst* laAddDBInst(laDBProp* parent, void* inst, laPropContainer* pc, laDiff* Begin){
  3912. laDBInst* dbi=memAcquire(sizeof(laDBInst)); if(!Begin) Begin=MAIN.HeadDifference;
  3913. dbi->pc=pc;
  3914. if(parent){ lstAppendItem(&((laDBSubProp*)parent)->Instances, dbi); }
  3915. la_RelinkDBInst(dbi, inst);
  3916. return dbi;
  3917. }
  3918. laDBProp* laAddDBProp(laDBInst* dbi, laProp* p, void* data){
  3919. int size=sizeof(laDBProp);
  3920. if(p->PropertyType==LA_PROP_SUB && (!p->UDFIsRefer)){size=sizeof(laDBSubProp);}
  3921. elif(p->PropertyType==LA_PROP_RAW){size=sizeof(laDBRawProp);}
  3922. laDBProp* dbp=memAcquire(size);
  3923. dbp->p=p; dbp->Data=data;
  3924. lstAppendItem(&dbi->Props, dbp);
  3925. return dbp;
  3926. }
  3927. void laAddDBPReferAcquire(laDBProp* dbp){
  3928. if(!dbp->Data) return; if(!lstHasPointer(&MAIN.DBInstPendingAcquireDBP, dbp)) lstAppendPointer(&MAIN.DBInstPendingAcquireDBP, dbp);
  3929. }
  3930. void laAddDiffCMDReferAcquire(laDiffCommand* ds){
  3931. if(!ds->Data) return; if(!lstHasPointer(&MAIN.DBInstPendingAcquireDiffCMD, ds)) lstAppendPointer(&MAIN.DBInstPendingAcquireDiffCMD, ds);
  3932. }
  3933. laDiffCommand* la_GiveDiffCommand(laDiff* diff, laDBInst* Instance, laProp* p, void* Data){
  3934. for(laDiffCommand* dc=diff->Commands.pFirst;dc;dc=dc->Item.pNext){
  3935. if(dc->Instance == Instance && dc->p == p) return dc;
  3936. }
  3937. int size=sizeof(laDiffCommand);
  3938. if(p->PropertyType==LA_PROP_SUB && (!(p->UDFIsRefer||p->UDFIsSingle||p->UDFNoCreate))){size=sizeof(laDiffCommandSub);}
  3939. elif(p->PropertyType==LA_PROP_RAW){size=sizeof(laDiffCommandRaw);}
  3940. laDiffCommand* dc = memAcquire(size);
  3941. dc->Instance=Instance; dc->p=p; dc->Data = Data;
  3942. lstAppendItem(&diff->Commands,dc);
  3943. return dc;
  3944. }
  3945. void la_GiveExtraTouched(laDiff* diff, laDBInst* dbi){
  3946. if(!dbi->pc->UndoTouched) return;
  3947. laDiffExtraTouched* det=memAcquire(sizeof(laDiffExtraTouched));
  3948. det->dbi=dbi; lstAppendItem(&diff->ExtraTouched,det);
  3949. }
  3950. int la_AddIntDBProp(laDBInst* dbi, laDBProp* dbp, laDiff* diff, laPropPack *pp){
  3951. laProp *p = pp->LastPs->p; int *Data; int len = laGetArrayLength(pp); int ret=0;
  3952. Data= memAcquireSimple(sizeof(int)*len);
  3953. laGetIntArray(pp, Data); if(diff&&dbp){
  3954. if(memcmp(dbp->Data, Data, sizeof(int)*len)){ la_GiveDiffCommand(diff, dbi, p, dbp->Data); dbp->Data=Data; ret=1; } else memFree(Data);
  3955. }
  3956. else laAddDBProp(dbi, p, Data);
  3957. return ret;
  3958. }
  3959. int la_AddFloatDBProp(laDBInst* dbi, laDBProp* dbp, laDiff* diff, laPropPack *pp){
  3960. laProp *p = pp->LastPs->p; real *Data; int len = laGetArrayLength(pp); int ret=0;
  3961. Data= memAcquireSimple(sizeof(real)*len);
  3962. laGetFloatArray(pp, Data); if(diff&&dbp){
  3963. if(memcmp(dbp->Data, Data, sizeof(real)*len)){ la_GiveDiffCommand(diff, dbi, p, dbp->Data); dbp->Data=Data; ret=1; } else memFree(Data);
  3964. }
  3965. else laAddDBProp(dbi, p, Data);
  3966. return ret;
  3967. }
  3968. int la_AddStringDBProp(laDBInst* dbi, laDBProp* dbp, laDiff* diff, laPropPack *pp){
  3969. laProp *p = pp->LastPs->p; char _buf[LA_RAW_CSTR_MAX_LEN]={0}; char* buf=_buf; int ret=0;
  3970. laGetString(pp, _buf, &buf); if(diff&&dbp){
  3971. if((!dbp->Data&&buf[0]) || (buf[0] && strcmp(buf, ((laSafeString*)dbp->Data)->Ptr)) || (!buf[0]&&dbp->Data)){
  3972. laDiffCommand* dc=la_GiveDiffCommand(diff, dbi, p, dbp->Data); dbp->Data=0; strSafeSet(&dbp->Data, buf); ret=1; }
  3973. }else{
  3974. laDBProp* dbp=laAddDBProp(dbi, p, 0); strSafeSet(&dbp->Data, buf);
  3975. }
  3976. return ret;
  3977. }
  3978. int la_AddEnumDBProp(laDBInst* dbi, laDBProp* dbp, laDiff* diff, laPropPack *pp){
  3979. laProp *p = pp->LastPs->p; laEnumItem **Data=0; int len = laGetArrayLength(pp); int ret=0;
  3980. Data= memAcquireSimple(sizeof(laEnumItem*)*len);
  3981. laGetEnumArray(pp, Data); if(diff&&dbp){
  3982. if(memcmp(dbp->Data, Data, sizeof(laEnumItem*)*len)){ la_GiveDiffCommand(diff, dbi, p, dbp->Data); dbp->Data=Data; ret=1; } else memFree(Data);
  3983. }else laAddDBProp(dbi, p, Data);
  3984. return ret;
  3985. }
  3986. int la_AddRawDBProp(laDBInst* dbi, laDBRawProp* dbp, laDiff* diff, laPropPack *pp){
  3987. laProp *p = pp->LastPs->p; int *Data; int s=0; int ret=0; int IsCopy=0;
  3988. Data=laGetRaw(pp,&s,&IsCopy); if(diff&&dbp){
  3989. if(dbp->DataSize!=s || (!dbp->Data&&Data) || (!Data&&dbp->Data) || (dbp->Data&&Data&&memcmp(dbp->Data, Data, s))){
  3990. //printf("s%d %x %d \n",s,Data,dbp->DataSize);
  3991. void* NewData=(s&&Data)?calloc(1,s):0;
  3992. if(s&&Data)memcpy(NewData, Data, s);
  3993. laDiffCommandRaw* dcr=la_GiveDiffCommand(diff, dbi, p, dbp->Data);
  3994. dcr->DataSize=dbp->DataSize; dbp->Data=NewData; dbp->DataSize=s; ret=1;
  3995. }
  3996. }
  3997. else{
  3998. void* NewData=s?calloc(1,s):0; if(s) memcpy(NewData, Data, s);
  3999. laDBRawProp* dbp=laAddDBProp(dbi, p, NewData); dbp->DataSize=s;
  4000. }
  4001. if(IsCopy){ free(Data); }
  4002. return ret;
  4003. }
  4004. laDiffCommandInst* la_NewDiffCommandInst(laDBInst* DBInst, laDBInst* Prev, laDBInst* Next){
  4005. laDiffCommandInst* dci=memAcquire(sizeof(laDiffCommandInst));
  4006. dci->DBInst = DBInst; dci->OriginalPrev = Prev; dci->OriginalNext = Next;
  4007. dci->BeforePrev = DBInst->Item.pPrev; dci->BeforeNext = DBInst->Item.pNext;
  4008. return dci;
  4009. }
  4010. laDBInst* la_GetDiffDBInst(laListHandle* NewAdded, laListHandle* Master, void* instance){
  4011. if(!instance) return 0;
  4012. for(laDiffTemp* dt=NewAdded->pFirst;dt;dt=dt->Item.pNext){
  4013. if(((laDBInst*)dt->p)->OriginalInstance == instance) return dt->p;
  4014. }
  4015. for(laDBInst* dbi=Master->pFirst;dbi;dbi=dbi->Item.pNext){
  4016. if(dbi->OriginalInstance==instance) return dbi;
  4017. }
  4018. return 0;
  4019. }
  4020. int laIterateDB(laDBInst* parent, laPropPack* pp, laDiff* diff, laDBProp* dp);
  4021. int la_GenerateListDifferences(laDBInst* dbi, laDBSubProp* dbp, laPropPack* pp, laDiff* diff){
  4022. laProp *p = pp->LastPs->p, *subp = 0;
  4023. laPropIterator pi={0};
  4024. void* inst; int any=0;
  4025. laListHandle New={0}, NewAdded={0}, NewDeleted={0}, NewMoved={0};
  4026. inst = laGetInstance(p, pp->LastPs->UseInstance, &pi);
  4027. pp->EndInstance = inst;
  4028. while (inst){
  4029. if(p->UDFIsSingle){ memTake(inst); /* For single must take or it will be freed. */ }
  4030. lstAppendPointer(&New, inst);
  4031. inst = laGetNextInstance(p, inst, &pi);
  4032. pp->EndInstance = inst;
  4033. }
  4034. for(laDBInst* dbi=dbp->Instances.pFirst;dbi;dbi=dbi->Item.pNext){
  4035. void* OldPrev=dbi->Item.pPrev?((laDBInst*)dbi->Item.pPrev)->OriginalInstance:0;
  4036. void* OldNext=dbi->Item.pNext?((laDBInst*)dbi->Item.pNext)->OriginalInstance:0;
  4037. int found=0; for(laListItemPointer* lip=New.pFirst;lip;lip=lip->pNext){
  4038. void* NewPrev=lip->pPrev?((laListItemPointer*)lip->pPrev)->p:0;
  4039. void* NewNext=lip->pNext?((laListItemPointer*)lip->pNext)->p:0;
  4040. if(lip->p == dbi->OriginalInstance){
  4041. found=1;
  4042. if(OldPrev==NewPrev && OldNext==NewNext){break;}
  4043. else{ laDiffTemp* dt=lstAppendPointerSized(&NewMoved, dbi, sizeof(laDiffTemp));
  4044. dt->tPrev=dbi->Item.pPrev; dt->tNext=dbi->Item.pNext; dt->nPrev=NewPrev; dt->nNext=NewNext;break;}
  4045. }
  4046. }
  4047. if(!found){
  4048. laDiffTemp* dt=lstAppendPointerSized(&NewDeleted, dbi, sizeof(laDiffTemp));dt->tPrev=dbi->Item.pPrev;dt->tNext=dbi->Item.pNext; any++;
  4049. }
  4050. }
  4051. for(laListItemPointer* lip=New.pFirst;lip;lip=lip->pNext){
  4052. int found=0; for(laDBInst* dbi=dbp->Instances.pFirst;dbi;dbi=dbi->Item.pNext){
  4053. if(lip->p == dbi->OriginalInstance){ found=1; }
  4054. }
  4055. if(!found){ any++;
  4056. laDiffTemp* dt=lstAppendPointerSized(&NewAdded, lip->p, sizeof(laDiffTemp));
  4057. void* NewPrev=lip->pPrev?((laListItemPointer*)lip->pPrev)->p:0;
  4058. void* NewNext=lip->pNext?((laListItemPointer*)lip->pNext)->p:0;
  4059. dt->tPrev=NewPrev; dt->tNext=NewNext;
  4060. laPropContainer* spc=p->SubProp; if(((laSubProp*)p)->GetType){spc=((laSubProp*)p)->GetType(lip->p);}
  4061. laDBInst* newdbi=laAddDBInst(0, lip->p, spc, diff); dt->p=newdbi;
  4062. for (subp = spc->Props.pFirst; subp; subp = subp->Item.pNext){
  4063. if (subp->UDFIgnore || subp->UDFOnly) continue;
  4064. if (subp->PropertyType == LA_PROP_OPERATOR) continue;
  4065. laPropStep SubPS = {0}; laPropPack SubPP = {0}; laPropIterator pi={0};
  4066. SubPP.RawThis = pp; SubPS.p = subp; SubPS.UseInstance = lip->p; SubPP.LastPs=&SubPS;
  4067. any+=laIterateDB(newdbi, &SubPP, 0, 0);
  4068. }
  4069. }
  4070. }
  4071. for(laDiffTemp* lip=NewAdded.pFirst;lip;lip=lip->Item.pNext){
  4072. laDBInst* newdbi=lip->p;
  4073. lip->tPrev = la_GetDiffDBInst(&NewAdded, &dbp->Instances, lip->tPrev);
  4074. lip->tNext = la_GetDiffDBInst(&NewAdded, &dbp->Instances, lip->tNext);
  4075. }
  4076. for(laDiffTemp* lip=NewMoved.pFirst;lip;lip=lip->Item.pNext){
  4077. laDBInst* newdbi=lip->p;
  4078. lip->tPrev = la_GetDiffDBInst(&NewAdded, &dbp->Instances, lip->nPrev);
  4079. lip->tNext = la_GetDiffDBInst(&NewAdded, &dbp->Instances, lip->nNext);
  4080. }
  4081. laDiffCommandSub* dc=(NewAdded.pFirst||NewDeleted.pFirst||NewMoved.pFirst)?la_GiveDiffCommand(diff, dbi, p, 0):0;
  4082. for(laDiffTemp* lip=NewAdded.pFirst;lip;lip=lip->Item.pNext){
  4083. lstAppendItem(&dc->AddedInst, la_NewDiffCommandInst(lip->p, 0, 0));
  4084. laDBInst* newdbi=lip->p;
  4085. newdbi->Item.pPrev = lip->tPrev; newdbi->Item.pNext = lip->tNext;
  4086. if(!newdbi->Item.pPrev){dbp->Instances.pFirst=newdbi;}
  4087. if(!newdbi->Item.pNext){dbp->Instances.pLast=newdbi;}
  4088. }
  4089. for(laDiffTemp* lip=NewMoved.pFirst;lip;lip=lip->Item.pNext){
  4090. laDBInst* dbi=lip->p; lstAppendItem(&dc->MovedInst, la_NewDiffCommandInst(dbi, lip->tPrev, lip->tNext));
  4091. laDBInst* newdbi=lip->p;
  4092. newdbi->Item.pPrev = lip->tPrev; newdbi->Item.pNext = lip->tNext;
  4093. if(!dbi->Item.pPrev){dbp->Instances.pFirst=dbi;}
  4094. if(!dbi->Item.pNext){dbp->Instances.pLast=dbi;}
  4095. }
  4096. if(!New.pFirst){ dbp->Instances.pFirst=dbp->Instances.pLast=0; }
  4097. for(laDiffTemp* lip=NewDeleted.pFirst;lip;lip=lip->Item.pNext){printf("deleted %llx %llx\n", dbi, dbi->OriginalInstance);
  4098. laDBInst* dbi=lip->p; lstAppendItem(&dc->RemovedInst, la_NewDiffCommandInst(dbi, lip->tPrev, lip->tNext));
  4099. memTake(dbi->OriginalInstance);
  4100. //if(!dbi->Item.pPrev){dbp->Instances.pFirst=dbi->Item.pNext;}
  4101. //if(!dbi->Item.pNext){dbp->Instances.pLast=dbi->Item.pPrev;}
  4102. dbi->Item.pPrev=dbi->Item.pNext=0; //lstRemoveItem(&dbp->Instances, dbi);
  4103. laPropStep SubPS = {0}; laPropPack SubPP = {0}; laPropIterator pi={0}; laDBProp* dpi=0; SubPP.LastPs = &SubPS;
  4104. laPropContainer* spc=p->SubProp; if(((laSubProp*)p)->GetType){spc=((laSubProp*)p)->GetType(dbi->OriginalInstance);}
  4105. dpi=dbi->Props.pFirst;
  4106. for (subp = spc->Props.pFirst; subp; subp = subp->Item.pNext){
  4107. if (subp->PropertyType == LA_PROP_OPERATOR) continue;
  4108. if (subp->UDFIgnore || subp->UDFOnly) continue;
  4109. if((!dpi)||dpi->p!=subp) printf("Prop doesn't match\n");
  4110. SubPP.RawThis = pp; SubPS.p = subp; SubPS.UseInstance = dbi->OriginalInstance;
  4111. int thisany=laIterateDB(dbi, &SubPP, diff, dpi);
  4112. dpi=dpi->Item.pNext;
  4113. if(thisany){ any+=thisany; la_GiveExtraTouched(diff,dbi); }
  4114. }
  4115. dbi=dbi->Item.pNext;
  4116. }
  4117. //printf("%x ~ %x\n", dbp->Instances.pFirst, dbp->Instances.pLast);
  4118. //laListItem* item = laGetInstance(p, pp->LastPs->UseInstance, &pi);
  4119. //while (item){
  4120. // printf(" %x [%x] %x\n",item->pPrev, item, item->pNext);
  4121. // item = laGetNextInstance(p, item, &pi);
  4122. //}
  4123. return any;
  4124. }
  4125. int laIterateDB(laDBInst* parent, laPropPack* pp, laDiff* diff, laDBProp* dp){
  4126. laProp *p = pp->LastPs->p, *subp = 0;
  4127. laPropStep SubPS = {0}; laPropPack SubPP = {0}; laPropIterator pi={0};
  4128. laDBProp* dbp; laDBSubProp* dsp; laDBInst* dbi; laDBProp* dpi=0;
  4129. void *inst = 0;
  4130. SubPP.LastPs = &SubPS;
  4131. int any=0;
  4132. switch (p->PropertyType){
  4133. case LA_PROP_SUB:
  4134. if (p->UDFIsRefer){ if(!parent) return 0;
  4135. inst = laGetActiveInstanceStrict(p, pp->LastPs->UseInstance);
  4136. if(diff){
  4137. if(inst!=dp->Data) la_GiveDiffCommand(diff, parent, p, dp->Data); dp->Data=inst; any++;
  4138. }else{
  4139. laDBProp* rdbp=laAddDBProp(parent, p, inst);
  4140. }
  4141. }else{
  4142. if (!p->SubProp) p->SubProp = la_ContainerLookup(((laSubProp *)p)->TargetID);
  4143. if(diff){ any+=la_GenerateListDifferences(parent, dp, pp, diff); dsp=dp; dbi=dsp->Instances.pFirst; dbp=dsp; }
  4144. else{ dbp=laAddDBProp(parent, p, laGetActiveInstance(p, pp->LastPs->UseInstance, &pi)); }
  4145. inst = laGetInstance(p, pp->LastPs->UseInstance, &pi);
  4146. pp->EndInstance = inst;
  4147. while (inst){ //printf("work %x\n",inst);
  4148. laPropContainer* spc=p->SubProp; if(((laSubProp*)p)->GetType){spc=((laSubProp*)p)->GetType(inst);}
  4149. if(!spc){ inst = laGetNextInstance(p, inst, &pi); continue; } // unlikely, because not registered
  4150. if(diff){
  4151. if(dbi->OriginalInstance != inst){
  4152. printf("dbi/inst doesn't match.\n"); }
  4153. dpi=dbi->Props.pFirst;
  4154. }else{ dbi = laAddDBInst(dbp, inst, spc, 0); }
  4155. for (subp = spc->Props.pFirst; subp; subp = subp->Item.pNext){
  4156. if (subp->PropertyType == LA_PROP_OPERATOR) continue;
  4157. if (subp->UDFIgnore || subp->UDFOnly) continue;
  4158. if(diff && ((!dpi)||dpi->p!=subp)){
  4159. printf("Prop doesn't match\n");}
  4160. SubPP.RawThis = pp; SubPS.p = subp; SubPS.UseInstance = inst;
  4161. int thisany=laIterateDB(dbi, &SubPP, diff, dpi);
  4162. if(diff && dpi){ dpi=dpi->Item.pNext;
  4163. if(thisany){ any+=thisany;
  4164. la_GiveExtraTouched(diff,dbi); }
  4165. }
  4166. }
  4167. inst = laGetNextInstance(p, inst, &pi);
  4168. pp->EndInstance = inst;
  4169. if(diff){ dbi=dbi->Item.pNext; }
  4170. }
  4171. }
  4172. break;
  4173. case LA_PROP_INT: case LA_PROP_ARRAY | LA_PROP_INT:
  4174. any+=la_AddIntDBProp(parent, dp, diff, pp); break;
  4175. case LA_PROP_FLOAT: case LA_PROP_ARRAY | LA_PROP_FLOAT:
  4176. any+=la_AddFloatDBProp(parent, dp, diff, pp); break;
  4177. case LA_PROP_STRING:
  4178. any+=la_AddStringDBProp(parent, dp, diff, pp); break;
  4179. case LA_PROP_ENUM: case LA_PROP_ARRAY | LA_PROP_ENUM:
  4180. any+=la_AddEnumDBProp(parent, dp, diff, pp); break;
  4181. case LA_PROP_RAW:
  4182. any+=la_AddRawDBProp(parent,dp,diff,pp); break;
  4183. default: break;
  4184. }
  4185. return any;
  4186. }
  4187. void la_RestoreIntDBProp(laDBProp* dbp, laDiffCommand* dc){
  4188. laPropPack pp={0}; laPropStep ps={0}; ps.p=dc->p; pp.LastPs=&ps; ps.UseInstance=dc->Instance->OriginalInstance;
  4189. int *Data; Data=dc->Data; dc->Data=dbp->Data; dbp->Data=Data;
  4190. laSetIntArrayAllArray(&pp, dbp->Data);
  4191. }
  4192. void la_RestoreFloatDBProp(laDBProp* dbp, laDiffCommand* dc){
  4193. laPropPack pp={0}; laPropStep ps={0}; ps.p=dc->p; pp.LastPs=&ps; ps.UseInstance=dc->Instance->OriginalInstance;
  4194. int *Data; Data=dc->Data; dc->Data=dbp->Data; dbp->Data=Data;
  4195. laSetFloatArrayAllArray(&pp, dbp->Data);
  4196. }
  4197. void la_RestoreStringDBProp(laDBProp* dbp, laDiffCommand* dc){
  4198. laPropPack pp={0}; laPropStep ps={0}; ps.p=dc->p; pp.LastPs=&ps; ps.UseInstance=dc->Instance->OriginalInstance;
  4199. int *Data; Data=dc->Data; dc->Data=dbp->Data; dbp->Data=Data;
  4200. laSetString(&pp, dbp->Data?((laSafeString*)dbp->Data)->Ptr:0);
  4201. }
  4202. void la_RestoreEnumDBProp(laDBProp* dbp, laDiffCommand* dc){
  4203. laPropPack pp={0}; laPropStep ps={0}; ps.p=dc->p; pp.LastPs=&ps; ps.UseInstance=dc->Instance->OriginalInstance;
  4204. int *Data; Data=dc->Data; dc->Data=dbp->Data; dbp->Data=Data;
  4205. laSetEnumArrayAllArray(&pp, dbp->Data);
  4206. }
  4207. void la_RestoreRawDBProp(laDBRawProp* dbp, laDiffCommandRaw* dc){
  4208. laPropPack pp={0}; laPropStep ps={0}; ps.p=dc->p; pp.LastPs=&ps; ps.UseInstance=dc->Instance->OriginalInstance;
  4209. int *Data; Data=dc->Data; dc->Data=dbp->Data; dbp->Data=Data; LA_SWAP(int, dc->DataSize, dbp->DataSize);
  4210. laSetRaw(&pp,dbp->Data,dbp->DataSize);
  4211. }
  4212. void la_AddUndoPostNode(laDBInst* dbi){
  4213. if((!dbi->pc) || (!dbi->pc->UndoTouched)) return;
  4214. for(laDiffPost* dp=MAIN.DiffTouched.pLast;dp;dp=dp->Item.pPrev){ if(dp->instance==dbi->OriginalInstance&&dp->Touched==dbi->pc->UndoTouched) return; }
  4215. laDiffPost* dp=lstAppendPointerSized(&MAIN.DiffTouched, dbi->OriginalInstance, sizeof(laDiffPost));
  4216. dp->Touched=dbi->pc->UndoTouched;
  4217. }
  4218. void la_ExecUndoPtrSync(laDiff* d){
  4219. int hint=d->Hint; laDiffPtrSync* dps; laDiffPost* dp; laDBInstPendingRelink* dpr;
  4220. while(dp=lstPopItem(&MAIN.DiffTouched)){
  4221. dp->Touched(dp->instance, hint);
  4222. memFree(dp);
  4223. }
  4224. for(laDiffExtraTouched*det=d->ExtraTouched.pFirst;det;det=det->Item.pNext){
  4225. det->dbi->pc->UndoTouched(det->dbi->OriginalInstance, hint);
  4226. }
  4227. }
  4228. void la_FreeInstance(void* inst, laPropContainer* pc, int no_free){
  4229. //if(p->PropertyType!=LA_PROP_SUB) return;
  4230. //if(!p->SubProp || ((laSubProp*)p)->TargetID) p->SubProp=la_ContainerLookup(((laSubProp*)p)->TargetID);
  4231. //laPropContainer* pc=p->SubProp; if(((laSubProp*)p)->GetType) pc=((laSubProp*)p)->GetType(inst);
  4232. //printf("freeinst %s %x\n",pc->Name,inst);
  4233. if(pc->BeforeFree) pc->BeforeFree(inst);
  4234. laPropStep SubPS = {0}; laPropPack SubPP = {0}; laPropIterator pi={0}; SubPP.LastPs=&SubPS;
  4235. for(laProp* p=pc->Props.pFirst;p;p=p->Item.pNext){
  4236. if(p->PropertyType==LA_PROP_STRING && ((laStringProp*)p)->IsSafeString){ SubPS.p=p; SubPS.UseInstance=inst; laSetString(&SubPP, 0); continue; }
  4237. //if(p->PropertyType!=LA_PROP_SUB || p->UDFIsRefer) continue;
  4238. //void* si = laGetInstance(p, SubPP.LastPs->UseInstance, &pi); SubPP.EndInstance = si; void* NextSi=0;
  4239. //printf("freeinst p %s\n",p->Name);
  4240. //while (si){
  4241. // printf("%x --inst %x\n",SubPP.LastPs->UseInstance,si);
  4242. // NextSi = laGetNextInstance(p, si, &pi);
  4243. // if(!p->UDFNoCreate){ laSubProp* sp=p;
  4244. // if(!sp->ListHandleOffset){ logPrint("[WARN] prop '%s' UDFNoCreate==0 and no ListHandleOffset. Node not removed.\n", p->Identifier); }
  4245. // else{ lstRemoveItem(inst + sp->ListHandleOffset, si); }
  4246. // }
  4247. // la_FreeInstance(si, p, p->UDFNoCreate||(!p->OffsetIsPointer));
  4248. // si=NextSi; SubPP.EndInstance = si;
  4249. //}
  4250. }
  4251. if(!no_free && !pc->OtherAlloc) memFree(inst);
  4252. }
  4253. void la_ResetInstance(void* inst, laPropContainer* pc, int IsListItem){
  4254. if(pc->SaverDummy) laMarkMemClean(((char*)inst)+((laSubProp*)pc->SaverDummy)->ListHandleOffset);
  4255. if(pc->Reset) pc->Reset(inst); //else { int a=IsListItem?sizeof(laListItem):0; memset(((char*)inst)+a,0,pc->NodeSize-a); }
  4256. }
  4257. laListHandle* la_GetOriginalListHandle(laDiffCommandSub* dcs){
  4258. laProp*p =dcs->Base.p;
  4259. if(p->PropertyType!=LA_PROP_SUB||p->UDFIsRefer||!((laSubProp*)p)->ListHandleOffset) return 0;
  4260. laSubProp* sp=dcs->Base.p;
  4261. void* addr=((char*)dcs->Base.Instance->OriginalInstance)+((laSubProp*)p)->ListHandleOffset;
  4262. return addr;
  4263. }
  4264. void la_UndoListDifferences(laDBSubProp* dsp, laDiffCommandSub* dcs){
  4265. laListHandle* ol=la_GetOriginalListHandle(dcs);
  4266. for(laDiffCommandInst* dci=dcs->AddedInst.pFirst;dci;dci=dci->Item.pNext){
  4267. if(dcs->Base.p->UDFNoCreate){ la_ResetInstance(dci->DBInst->OriginalInstance,dci->DBInst->pc,((laSubProp*)dcs->Base.p)->ListHandleOffset?1:0); continue; }
  4268. dci->OriginalPrev = dci->DBInst->Item.pPrev; dci->OriginalNext = dci->DBInst->Item.pNext;
  4269. //if(dsp->Instances.pFirst == dci->DBInst){ dsp->Instances.pFirst=dci->DBInst->Item.pNext; ol->pFirst=dci->DBInst->Item.pNext?((laDBInst*)dci->DBInst->Item.pNext)->OriginalInstance:0; }
  4270. //if(dsp->Instances.pLast == dci->DBInst){ dsp->Instances.pLast=dci->DBInst->Item.pPrev; ol->pLast=dci->DBInst->Item.pPrev?((laDBInst*)dci->DBInst->Item.pPrev)->OriginalInstance:0; }
  4271. //dci->DBInst->Item.pPrev = dci->DBInst->Item.pNext=0;
  4272. }
  4273. for(laDiffCommandInst* dci=dcs->AddedInst.pFirst;dci;dci=dci->Item.pNext){
  4274. if(dcs->Base.p->UDFNoCreate){ continue; }
  4275. lstRemoveItem(&dsp->Instances, dci->DBInst); lstRemoveItem(ol, dci->DBInst->OriginalInstance);
  4276. laListItem* li = dci->DBInst->OriginalInstance;
  4277. }
  4278. for(laDiffCommandInst* dci=dcs->RemovedInst.pFirst;dci;dci=dci->Item.pNext){ if(dcs->Base.p->UDFNoCreate) continue;
  4279. dci->DBInst->Item.pPrev = dci->OriginalPrev;
  4280. dci->DBInst->Item.pNext = dci->OriginalNext; printf("add removed %s %llx \n",dci->DBInst->pc->Identifier, dci->DBInst->OriginalInstance);
  4281. void* orig = dci->DBInst->OriginalInstance;
  4282. }
  4283. for(laDiffCommandInst* dci=dcs->RemovedInst.pFirst;dci;dci=dci->Item.pNext){ if(dcs->Base.p->UDFNoCreate) continue;
  4284. ((laListItem*)dci->DBInst->OriginalInstance)->pPrev=dci->OriginalPrev?dci->OriginalPrev->OriginalInstance:0;
  4285. ((laListItem*)dci->DBInst->OriginalInstance)->pNext=dci->OriginalNext?dci->OriginalNext->OriginalInstance:0;
  4286. if(!dci->DBInst->Item.pPrev){ dsp->Instances.pFirst=dci->DBInst; ol->pFirst=dci->DBInst->OriginalInstance; }
  4287. if(!dci->DBInst->Item.pNext){ dsp->Instances.pLast=dci->DBInst; ol->pLast=dci->DBInst->OriginalInstance; }
  4288. }
  4289. for(laDiffCommandInst* dci=dcs->MovedInst.pFirst;dci;dci=dci->Item.pNext){
  4290. dci->DBInst->Item.pPrev = dci->BeforePrev; ((laListItem*)dci->DBInst->OriginalInstance)->pPrev=dci->BeforePrev?dci->BeforePrev->OriginalInstance:0;
  4291. dci->DBInst->Item.pNext = dci->BeforeNext; ((laListItem*)dci->DBInst->OriginalInstance)->pNext=dci->BeforeNext?dci->BeforeNext->OriginalInstance:0;
  4292. if(!dci->DBInst->Item.pPrev){ dsp->Instances.pFirst=dci->DBInst; ol->pFirst=dci->DBInst->OriginalInstance; }
  4293. if(!dci->DBInst->Item.pNext){ dsp->Instances.pLast=dci->DBInst; ol->pLast=dci->DBInst->OriginalInstance; }
  4294. }
  4295. }
  4296. void la_RedoListDifferences(laDBSubProp* dsp, laDiffCommandSub* dcs){
  4297. laListHandle* ol=la_GetOriginalListHandle(dcs);
  4298. for(laDiffCommandInst* dci=dcs->RemovedInst.pFirst;dci;dci=dci->Item.pNext){
  4299. if(dcs->Base.p->UDFNoCreate){ la_ResetInstance(dci->DBInst->OriginalInstance,dci->DBInst->pc,((laSubProp*)dcs->Base.p)->ListHandleOffset?1:0); continue; }
  4300. //dci->OriginalPrev = dci->DBInst->Item.pPrev;
  4301. //dci->OriginalNext = dci->DBInst->Item.pNext;
  4302. lstRemoveItem(&dsp->Instances, dci->DBInst); lstRemoveItem(ol, dci->DBInst->OriginalInstance);
  4303. laListItem* li = dci->DBInst->OriginalInstance;
  4304. printf("remove %llx \n", dci->DBInst->OriginalInstance);
  4305. }
  4306. for(laDiffCommandInst* dci=dcs->AddedInst.pFirst;dci;dci=dci->Item.pNext){ if(dcs->Base.p->UDFNoCreate) continue;
  4307. dci->DBInst->Item.pPrev = dci->OriginalPrev;
  4308. dci->DBInst->Item.pNext = dci->OriginalNext;
  4309. void* orig = dci->DBInst->OriginalInstance;
  4310. }
  4311. for(laDiffCommandInst* dci=dcs->AddedInst.pFirst;dci;dci=dci->Item.pNext){ if(dcs->Base.p->UDFNoCreate) continue;
  4312. ((laListItem*)dci->DBInst->OriginalInstance)->pPrev=dci->OriginalPrev?dci->OriginalPrev->OriginalInstance:0;
  4313. ((laListItem*)dci->DBInst->OriginalInstance)->pNext=dci->OriginalNext?dci->OriginalNext->OriginalInstance:0;
  4314. if(!dci->DBInst->Item.pPrev){ dsp->Instances.pFirst=dci->DBInst; ol->pFirst=dci->DBInst->OriginalInstance; }
  4315. if(!dci->DBInst->Item.pNext){ dsp->Instances.pLast=dci->DBInst; ol->pLast=dci->DBInst->OriginalInstance; }
  4316. }
  4317. for(laDiffCommandInst* dci=dcs->MovedInst.pFirst;dci;dci=dci->Item.pNext){
  4318. dci->DBInst->Item.pPrev = dci->OriginalPrev; ((laListItem*)dci->DBInst->OriginalInstance)->pPrev=dci->OriginalPrev?dci->OriginalPrev->OriginalInstance:0;
  4319. dci->DBInst->Item.pNext = dci->OriginalNext; ((laListItem*)dci->DBInst->OriginalInstance)->pNext=dci->OriginalNext?dci->OriginalNext->OriginalInstance:0;
  4320. if(!dci->DBInst->Item.pPrev){ dsp->Instances.pFirst=dci->DBInst; ol->pFirst=dci->DBInst->OriginalInstance; }
  4321. if(!dci->DBInst->Item.pNext){ dsp->Instances.pLast=dci->DBInst; ol->pLast=dci->DBInst->OriginalInstance; }
  4322. }
  4323. }
  4324. laDBProp* la_FindDBProp(laDBInst* dbi, laProp* p){
  4325. for(laDBProp* dbp=dbi->Props.pFirst;dbp;dbp=dbp->Item.pNext){
  4326. if(dbp->p==p) return dbp;
  4327. }
  4328. return 0;
  4329. }
  4330. void tnsPrintMaterials();
  4331. laDiff* laSwapDBState(int Redo){
  4332. laDiff* diff=MAIN.HeadDifference; if(!diff) return 0;
  4333. if(Redo){ if(diff==MAIN.Differences.pLast) return 0; }else{ diff=diff->Item.pPrev; if(!diff) return 0; }
  4334. for(laDiffCommand* dc=diff->Commands.pFirst;dc;dc=dc->Item.pNext){
  4335. //printf("do %s\n",dc->p->Identifier);
  4336. laDBProp* dbp=la_FindDBProp(dc->Instance, dc->p);
  4337. if(!dbp){ printf("Can't find dbp from prop!\n");}
  4338. switch (dc->p->PropertyType){
  4339. case LA_PROP_SUB:
  4340. if(dc->p->UDFIsRefer){
  4341. LA_SWAP(void*,dc->Data,dbp->Data);
  4342. laSetActiveInstance(dbp->p, dc->Instance->OriginalInstance, dbp->Data);
  4343. }else{
  4344. if(Redo) la_RedoListDifferences(dbp,dc);
  4345. else la_UndoListDifferences(dbp,dc);
  4346. }
  4347. la_AddUndoPostNode(dc->Instance);
  4348. break;
  4349. case LA_PROP_INT: case LA_PROP_ARRAY | LA_PROP_INT:
  4350. la_RestoreIntDBProp(dbp, dc); la_AddUndoPostNode(dc->Instance); break;
  4351. case LA_PROP_FLOAT: case LA_PROP_ARRAY | LA_PROP_FLOAT:
  4352. la_RestoreFloatDBProp(dbp, dc); la_AddUndoPostNode(dc->Instance); break;
  4353. case LA_PROP_STRING:
  4354. la_RestoreStringDBProp(dbp, dc); la_AddUndoPostNode(dc->Instance); break;
  4355. case LA_PROP_ENUM: case LA_PROP_ARRAY | LA_PROP_ENUM:
  4356. la_RestoreEnumDBProp(dbp, dc); la_AddUndoPostNode(dc->Instance); break;
  4357. case LA_PROP_RAW:
  4358. la_RestoreRawDBProp(dbp, dc); la_AddUndoPostNode(dc->Instance); break;
  4359. default: break;
  4360. }
  4361. laPropPack PP={0}; laPropStep PS={0}; PP.LastPs=&PS; PS.p=dbp->p; PS.UseInstance=dc->Instance->OriginalInstance;
  4362. laNotifyUsersPP(&PP);
  4363. }
  4364. for(laDiffCommandCustom* dcc=diff->CustomCommands.pFirst;dcc;dcc=dcc->Item.pNext){
  4365. if(Redo){ if(dcc->Redo) dcc->Redo(dcc->Data); } else { if(dcc->Undo) dcc->Undo(dcc->Data); }
  4366. }
  4367. tnsPrintMaterials();
  4368. if(Redo){ MAIN.HeadDifference=diff->Item.pNext; }
  4369. else{ MAIN.HeadDifference=diff; }
  4370. return diff;
  4371. }
  4372. void laUndo(){ laDiff* d; if(d=laSwapDBState(0)){ la_ExecUndoPtrSync(d); laNotifyUsers("la.differences"); } }
  4373. void laRedo(){ laDiff* d; if(d=laSwapDBState(1)){ la_ExecUndoPtrSync(d); laNotifyUsers("la.differences"); } }
  4374. void laPrintDBInst(laDBInst* dbi, int Level){
  4375. if(dbi!=&MAIN.RootDBInst){
  4376. logPrintNew("%*c", Level, ' ');
  4377. logPrint("%s | %.6x [%.6x] %.6x | %.6x [%.6x] %.6x\n",
  4378. dbi->pc->Identifier, dbi->Item.pPrev, dbi, dbi->Item.pNext,
  4379. dbi->Item.pPrev?((laDBInst*)dbi->Item.pPrev)->OriginalInstance:0, dbi->OriginalInstance, dbi->Item.pNext?((laDBInst*)dbi->Item.pNext)->OriginalInstance:0);
  4380. }else{
  4381. logPrintNew("Root:\n");
  4382. }
  4383. for(laDBProp* dbp=dbi->Props.pFirst;dbp;dbp=dbp->Item.pNext){
  4384. if(dbp->p->PropertyType==LA_PROP_SUB && !dbp->p->UDFIsRefer){
  4385. laDBSubProp* dsp=dbp;
  4386. for(laDBInst* dbii=dsp->Instances.pFirst;dbii;dbii=dbii->Item.pNext){
  4387. laPrintDBInst(dbii, Level+4);
  4388. }
  4389. }
  4390. }
  4391. }
  4392. void laPrintDBInstInfo(){
  4393. laPrintDBInst(&MAIN.RootDBInst, 0);
  4394. }
  4395. void laAddRootDBInst(char* path){
  4396. laPropPack PP={0};
  4397. if(!la_GetPropFromPath(&PP,0,path,0)) return;
  4398. if(!MAIN.DBInstLink){ hsh65536Init(&MAIN.DBInstLink); }
  4399. la_StepPropPack(&PP);
  4400. laIterateDB(&MAIN.RootDBInst, &PP, 0, 0);
  4401. la_FreePropStepCache(PP.Go);
  4402. laDBRecordedProp* rp=lstAppendPointerSized(&MAIN.DBRecordedProps, 0, sizeof(laDBRecordedProp));
  4403. strSafeSet(&rp->OriginalPath,path);
  4404. }
  4405. void laPropPackToLocal(laPropPack* ToPP, laPropPack* pp){
  4406. if(pp->RawThis) laPropPackToLocal(ToPP, pp->RawThis);
  4407. for(laPropStep* ps=pp->Go;ps;ps=ps->pNext){
  4408. la_NewPropStep(ToPP, ps->p, ps->UseInstance, '.');
  4409. }
  4410. ToPP->EndInstance = pp->EndInstance;
  4411. }
  4412. laDBProp* laFindDBProp(laDBInst* parent, laProp* p, void* Instance, laDBInst** r_DBInst){
  4413. laDBProp* rp=0;
  4414. for(laDBProp* dp=parent->Props.pFirst;dp;dp=dp->Item.pNext){
  4415. if(dp->p == p) {rp=dp; break;}
  4416. } if(!rp) return 0;
  4417. if(rp->p->PropertyType==LA_PROP_SUB && !rp->p->UDFIsRefer && r_DBInst && Instance){
  4418. laDBSubProp* dsp=rp; for(laDBInst* dbii=dsp->Instances.pFirst;dbii;dbii=dbii->Item.pNext){
  4419. if(dbii->OriginalInstance == Instance) { *r_DBInst=dbii; break; }
  4420. }
  4421. }
  4422. return rp;
  4423. }
  4424. laDBProp* laFindStartingDBProp(laProp* p, void* Instance, laPropContainer* InstancePC, laDBInst** r_DBInst){
  4425. if(!Instance||Instance==MAIN.DataRoot.RootInstance){
  4426. for(laDBProp*dbp=MAIN.RootDBInst.Props.pFirst;dbp;dbp=dbp->Item.pNext){
  4427. if(dbp->p == p){ *r_DBInst=&MAIN.RootDBInst; return dbp; }
  4428. }
  4429. } /* If root not found try to find it in the hash. */
  4430. if(!MAIN.DBInstLink){ return 0; }
  4431. laListHandle* l=hsh65536DoHashLongPtr(MAIN.DBInstLink, Instance); if(!l) return 0;
  4432. for(laListItem* li=l->pFirst;li;li=li->pNext){
  4433. laDBInst* dbi=(laDBInst*)(((char*)li)-sizeof(laListItem)); if(dbi->OriginalInstance==Instance && dbi->pc==InstancePC){
  4434. if(p){ for(laDBProp*dbp=dbi->Props.pFirst;dbp;dbp=dbp->Item.pNext){ if(dbp->p == p){ *r_DBInst=dbi; return dbp; } } }
  4435. else{ *r_DBInst=dbi; return 0; }
  4436. }
  4437. }
  4438. return 0;
  4439. }
  4440. void laRecordCustomDifferences(void* Data, laDiffCommandUndoF Undo, laDiffCommandRedoF Redo, laDiffCommandFreeF Free){
  4441. laDiffCommandCustom* dcc=memAcquire(sizeof(laDiffCommandCustom));
  4442. dcc->Data=Data; dcc->Undo=Undo; dcc->Redo=Redo; dcc->Free=Free;
  4443. lstAppendItem(&MAIN.HeadDifference->CustomCommands,dcc);
  4444. }
  4445. int laRecordDifferences(laPropPack* base, char* path){
  4446. laPropPack PP={0};
  4447. if(!la_GetPropFromPath(&PP,base,path,0)) return 0;
  4448. la_StepPropPack(&PP);
  4449. //laPropPackToLocal(&LocalPP, &PP);
  4450. int success=0;
  4451. laDBInst* FromDBI; //=laSkipDB(&LocalPP, &MAIN.RootDBInst, &dbp);
  4452. laDBProp* dbp=laFindStartingDBProp(PP.LastPs->p, PP.LastPs->UseInstance, PP.LastPs->p->Container, &FromDBI);
  4453. if(FromDBI && dbp){
  4454. laFreeNewerDifferences();
  4455. laIterateDB(FromDBI, &PP, MAIN.HeadDifference, dbp);
  4456. if(MAIN.HeadDifference->Commands.pFirst){ success = 1; }
  4457. }else{
  4458. success = 0; //printf("Prop not recorded as DBInst.\n");
  4459. }
  4460. la_FreePropStepCache(PP.Go);
  4461. return success;
  4462. }
  4463. int laRecordInstanceDifferences(void* instance, const char* container){
  4464. laPropContainer* pc=la_ContainerLookup(container); if(!pc) return 0;
  4465. laDBInst* FromDBI=0;
  4466. laFindStartingDBProp(0,instance,pc,&FromDBI); if(!FromDBI) return 0;
  4467. laPropPack PP={0}; laPropStep PS={0}; PS.UseInstance=instance; PP.LastPs=&PS;
  4468. int freed=0, success=0, any=0;
  4469. for(laProp* p=pc->Props.pFirst;p;p=p->Item.pNext){
  4470. PS.p = p; laDBProp* dbp=laFindDBProp(FromDBI, p, 0,0);
  4471. if(FromDBI && dbp){
  4472. if(!freed){ laFreeNewerDifferences(); freed=1; }
  4473. any+=laIterateDB(FromDBI, &PP, MAIN.HeadDifference, dbp);
  4474. if(MAIN.HeadDifference->Commands.pFirst){ success = 1; }
  4475. }
  4476. }
  4477. if(any){ la_GiveExtraTouched(MAIN.HeadDifference,FromDBI); }
  4478. return success;
  4479. }
  4480. void laRecordAndPush(laPropPack* base, char* path, char* description, uint64_t hint){
  4481. if(laRecordDifferences(base, path)){ laPushDifferences(description, hint); }
  4482. }
  4483. void laRecordAndPushProp(laPropPack* base, char* path){
  4484. char buf[256]={0};
  4485. if(laRecordDifferences(base, path)){
  4486. la_GetPropPackFullPath(base,&buf[strlen(buf)]);if(path){sprintf(&buf[strlen(buf)],"%s%s",base?".":"",path);}
  4487. laPushDifferences(buf, 0);
  4488. }
  4489. }
  4490. void laRecordEverythingAndPush(){
  4491. for(laDBRecordedProp* rp=MAIN.DBRecordedProps.pFirst;rp;rp=rp->Item.pNext){
  4492. laRecordAndPushProp(0, rp->OriginalPath->Ptr);
  4493. }
  4494. if(MAIN.PushEverything){ MAIN.PushEverything(); }
  4495. }
  4496. void laSetDiffCallback(laDiffPushEverythingF PushEverything){
  4497. MAIN.PushEverything=PushEverything;
  4498. }