*/}}

la_data.c 180 KB

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