*/}}

la_data.c 169 KB

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