*/}}

la_data.c 167 KB

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