*/}}

la_data.c 190 KB

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