*/}}

la_data.c 179 KB

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