*/}}

la_data.c 170 KB

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