*/}}

la_data.c 170 KB

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