*/}}

la_data.c 170 KB

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