*/}}

la_data.c 182 KB

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