bFile.cpp 37 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772
  1. /*
  2. bParse
  3. Copyright (c) 2006-2009 Charlie C & Erwin Coumans http://gamekit.googlecode.com
  4. This software is provided 'as-is', without any express or implied warranty.
  5. In no event will the authors be held liable for any damages arising from the use of this software.
  6. Permission is granted to anyone to use this software for any purpose,
  7. including commercial applications, and to alter it and redistribute it freely,
  8. subject to the following restrictions:
  9. 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
  10. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
  11. 3. This notice may not be removed or altered from any source distribution.
  12. */
  13. #include "bFile.h"
  14. #include "bCommon.h"
  15. #include "bChunk.h"
  16. #include "bDNA.h"
  17. #include <math.h>
  18. #include <string.h>
  19. #include <stdlib.h>
  20. #include "bDefines.h"
  21. #include "LinearMath/btSerializer.h"
  22. #include "LinearMath/btAlignedAllocator.h"
  23. #include "LinearMath/btMinMax.h"
  24. #define SIZEOFBLENDERHEADER 12
  25. #define MAX_ARRAY_LENGTH 512
  26. using namespace bParse;
  27. #define MAX_STRLEN 1024
  28. const char* getCleanName(const char* memName, char* buffer)
  29. {
  30. int slen = strlen(memName);
  31. assert(slen<MAX_STRLEN);
  32. slen=btMin(slen,MAX_STRLEN);
  33. for (int i=0;i<slen;i++)
  34. {
  35. if (memName[i]==']'||memName[i]=='[')
  36. {
  37. buffer[i] = 0;//'_';
  38. } else
  39. {
  40. buffer[i] = memName[i];
  41. }
  42. }
  43. buffer[slen]=0;
  44. return buffer;
  45. }
  46. int numallocs = 0;
  47. // ----------------------------------------------------- //
  48. bFile::bFile(const char *filename, const char headerString[7])
  49. : mOwnsBuffer(true),
  50. mFileBuffer(0),
  51. mFileLen(0),
  52. mVersion(0),
  53. mDataStart(0),
  54. mFileDNA(0),
  55. mMemoryDNA(0),
  56. mFlags(FD_INVALID)
  57. {
  58. for (int i=0;i<7;i++)
  59. {
  60. m_headerString[i] = headerString[i];
  61. }
  62. FILE *fp = fopen(filename, "rb");
  63. if (fp)
  64. {
  65. fseek(fp, 0L, SEEK_END);
  66. mFileLen = ftell(fp);
  67. fseek(fp, 0L, SEEK_SET);
  68. mFileBuffer = (char*)malloc(mFileLen+1);
  69. fread(mFileBuffer, mFileLen, 1, fp);
  70. fclose(fp);
  71. //
  72. parseHeader();
  73. }
  74. }
  75. // ----------------------------------------------------- //
  76. bFile::bFile( char *memoryBuffer, int len, const char headerString[7])
  77. : mOwnsBuffer(false),
  78. mFileBuffer(0),
  79. mFileLen(0),
  80. mVersion(0),
  81. mDataStart(0),
  82. mFileDNA(0),
  83. mMemoryDNA(0),
  84. mFlags(FD_INVALID)
  85. {
  86. for (int i=0;i<7;i++)
  87. {
  88. m_headerString[i] = headerString[i];
  89. }
  90. mFileBuffer = memoryBuffer;
  91. mFileLen = len;
  92. parseHeader();
  93. }
  94. // ----------------------------------------------------- //
  95. bFile::~bFile()
  96. {
  97. if (mOwnsBuffer && mFileBuffer)
  98. {
  99. free(mFileBuffer);
  100. mFileBuffer = 0;
  101. }
  102. delete mMemoryDNA;
  103. delete mFileDNA;
  104. }
  105. // ----------------------------------------------------- //
  106. void bFile::parseHeader()
  107. {
  108. if (!mFileLen || !mFileBuffer)
  109. return;
  110. char *blenderBuf = mFileBuffer;
  111. char header[SIZEOFBLENDERHEADER+1] ;
  112. memcpy(header, blenderBuf, SIZEOFBLENDERHEADER);
  113. header[SIZEOFBLENDERHEADER]='\0';
  114. if (strncmp(header, m_headerString, 6)!=0)
  115. {
  116. memcpy(header, m_headerString, SIZEOFBLENDERHEADER);
  117. return;
  118. }
  119. if (header[6] == 'd')
  120. {
  121. mFlags |= FD_DOUBLE_PRECISION;
  122. }
  123. char *ver = header+9;
  124. mVersion = atoi(ver);
  125. if (mVersion <= 241)
  126. {
  127. //printf("Warning, %d not fully tested : <= 242\n", mVersion);
  128. }
  129. int littleEndian= 1;
  130. littleEndian= ((char*)&littleEndian)[0];
  131. // swap ptr sizes...
  132. if (header[7]=='-')
  133. {
  134. mFlags |= FD_FILE_64;
  135. if (!VOID_IS_8)
  136. mFlags |= FD_BITS_VARIES;
  137. }
  138. else if (VOID_IS_8) mFlags |= FD_BITS_VARIES;
  139. // swap endian...
  140. if (header[8]=='V')
  141. {
  142. if (littleEndian ==1)
  143. mFlags |= FD_ENDIAN_SWAP;
  144. }
  145. else
  146. if (littleEndian==0)
  147. mFlags |= FD_ENDIAN_SWAP;
  148. mFlags |= FD_OK;
  149. }
  150. // ----------------------------------------------------- //
  151. bool bFile::ok()
  152. {
  153. return (mFlags &FD_OK)!=0;
  154. }
  155. void bFile::setFileDNA(int verboseMode, char* dnaBuffer, int dnaLen)
  156. {
  157. mFileDNA = new bDNA();
  158. ///mFileDNA->init will convert part of DNA file endianness to current CPU endianness if necessary
  159. mFileDNA->init((char*)dnaBuffer, dnaLen, (mFlags & FD_ENDIAN_SWAP)!=0);
  160. if (verboseMode & FD_VERBOSE_DUMP_DNA_TYPE_DEFINITIONS)
  161. mFileDNA->dumpTypeDefinitions();
  162. }
  163. // ----------------------------------------------------- //
  164. void bFile::parseInternal(int verboseMode, char* memDna,int memDnaLength)
  165. {
  166. if ( (mFlags &FD_OK) ==0)
  167. return;
  168. if (mFlags & FD_FILEDNA_IS_MEMDNA)
  169. {
  170. setFileDNA(verboseMode,memDna,memDnaLength);
  171. }
  172. if (mFileDNA==0)
  173. {
  174. char *blenderData = mFileBuffer;
  175. bChunkInd dna;
  176. dna.oldPtr = 0;
  177. char *tempBuffer = blenderData;
  178. for (int i=0; i<mFileLen; i++)
  179. {
  180. // looking for the data's starting position
  181. // and the start of SDNA decls
  182. if (!mDataStart && strncmp(tempBuffer, "REND", 4)==0)
  183. mDataStart = i;
  184. if (strncmp(tempBuffer, "DNA1", 4)==0)
  185. {
  186. // read the DNA1 block and extract SDNA
  187. if (getNextBlock(&dna, tempBuffer, mFlags) > 0)
  188. {
  189. if (strncmp((tempBuffer + ChunkUtils::getOffset(mFlags)), "SDNANAME", 8) ==0)
  190. dna.oldPtr = (tempBuffer + ChunkUtils::getOffset(mFlags));
  191. else dna.oldPtr = 0;
  192. }
  193. else dna.oldPtr = 0;
  194. }
  195. // Some Bullet files are missing the DNA1 block
  196. // In Blender it's DNA1 + ChunkUtils::getOffset() + SDNA + NAME
  197. // In Bullet tests its SDNA + NAME
  198. else if (strncmp(tempBuffer, "SDNANAME", 8) ==0)
  199. {
  200. dna.oldPtr = blenderData + i;
  201. dna.len = mFileLen-i;
  202. // Also no REND block, so exit now.
  203. if (mVersion==276) break;
  204. }
  205. if (mDataStart && dna.oldPtr) break;
  206. tempBuffer++;
  207. }
  208. if (!dna.oldPtr || !dna.len)
  209. {
  210. //printf("Failed to find DNA1+SDNA pair\n");
  211. mFlags &= ~FD_OK;
  212. return;
  213. }
  214. mFileDNA = new bDNA();
  215. ///mFileDNA->init will convert part of DNA file endianness to current CPU endianness if necessary
  216. mFileDNA->init((char*)dna.oldPtr, dna.len, (mFlags & FD_ENDIAN_SWAP)!=0);
  217. if (mVersion==276)
  218. {
  219. int i;
  220. for (i=0;i<mFileDNA->getNumNames();i++)
  221. {
  222. if (strcmp(mFileDNA->getName(i),"int")==0)
  223. {
  224. mFlags |= FD_BROKEN_DNA;
  225. }
  226. }
  227. if ((mFlags&FD_BROKEN_DNA)!=0)
  228. {
  229. //printf("warning: fixing some broken DNA version\n");
  230. }
  231. }
  232. if (verboseMode & FD_VERBOSE_DUMP_DNA_TYPE_DEFINITIONS)
  233. mFileDNA->dumpTypeDefinitions();
  234. }
  235. mMemoryDNA = new bDNA();
  236. int littleEndian= 1;
  237. littleEndian= ((char*)&littleEndian)[0];
  238. mMemoryDNA->init(memDna,memDnaLength,littleEndian==0);
  239. ///@todo we need a better version check, add version/sub version info from FileGlobal into memory DNA/header files
  240. if (mMemoryDNA->getNumNames() != mFileDNA->getNumNames())
  241. {
  242. mFlags |= FD_VERSION_VARIES;
  243. //printf ("Warning, file DNA is different than built in, performance is reduced. Best to re-export file with a matching version/platform");
  244. }
  245. // as long as it kept up to date it will be ok!!
  246. if (mMemoryDNA->lessThan(mFileDNA))
  247. {
  248. //printf ("Warning, file DNA is newer than built in.");
  249. }
  250. mFileDNA->initCmpFlags(mMemoryDNA);
  251. parseData();
  252. resolvePointers(verboseMode);
  253. updateOldPointers();
  254. }
  255. // ----------------------------------------------------- //
  256. void bFile::swap(char *head, bChunkInd& dataChunk, bool ignoreEndianFlag)
  257. {
  258. char *data = head;
  259. short *strc = mFileDNA->getStruct(dataChunk.dna_nr);
  260. const char s[] = "SoftBodyMaterialData";
  261. int szs = sizeof(s);
  262. if (strncmp((char*)&dataChunk.code,"ARAY",4)==0)
  263. {
  264. short *oldStruct = mFileDNA->getStruct(dataChunk.dna_nr);
  265. char *oldType = mFileDNA->getType(oldStruct[0]);
  266. if (strncmp(oldType,s,szs)==0)
  267. {
  268. return;
  269. }
  270. }
  271. int len = mFileDNA->getLength(strc[0]);
  272. for (int i=0; i<dataChunk.nr; i++)
  273. {
  274. swapStruct(dataChunk.dna_nr, data,ignoreEndianFlag);
  275. data+=len;
  276. }
  277. }
  278. void bFile::swapLen(char *dataPtr)
  279. {
  280. const bool VOID_IS_8 = ((sizeof(void*)==8));
  281. if (VOID_IS_8)
  282. {
  283. if (mFlags &FD_BITS_VARIES)
  284. {
  285. bChunkPtr4*c = (bChunkPtr4*) dataPtr;
  286. if ((c->code & 0xFFFF)==0)
  287. c->code >>=16;
  288. SWITCH_INT(c->len);
  289. SWITCH_INT(c->dna_nr);
  290. SWITCH_INT(c->nr);
  291. } else
  292. {
  293. bChunkPtr8* c = (bChunkPtr8*) dataPtr;
  294. if ((c->code & 0xFFFF)==0)
  295. c->code >>=16;
  296. SWITCH_INT(c->len);
  297. SWITCH_INT(c->dna_nr);
  298. SWITCH_INT(c->nr);
  299. }
  300. } else
  301. {
  302. if (mFlags &FD_BITS_VARIES)
  303. {
  304. bChunkPtr8*c = (bChunkPtr8*) dataPtr;
  305. if ((c->code & 0xFFFF)==0)
  306. c->code >>=16;
  307. SWITCH_INT(c->len);
  308. SWITCH_INT(c->dna_nr);
  309. SWITCH_INT(c->nr);
  310. } else
  311. {
  312. bChunkPtr4* c = (bChunkPtr4*) dataPtr;
  313. if ((c->code & 0xFFFF)==0)
  314. c->code >>=16;
  315. SWITCH_INT(c->len);
  316. SWITCH_INT(c->dna_nr);
  317. SWITCH_INT(c->nr);
  318. }
  319. }
  320. }
  321. void bFile::swapDNA(char* ptr)
  322. {
  323. bool swap = ((mFlags & FD_ENDIAN_SWAP)!=0);
  324. int offset = (mFlags & FD_FILE_64)? 24 : 20;
  325. char* data = &ptr[offset];
  326. // void bDNA::init(char *data, int len, bool swap)
  327. int *intPtr=0;short *shtPtr=0;
  328. char *cp = 0;int dataLen =0;long nr=0;
  329. intPtr = (int*)data;
  330. /*
  331. SDNA (4 bytes) (magic number)
  332. NAME (4 bytes)
  333. <nr> (4 bytes) amount of names (int)
  334. <string>
  335. <string>
  336. */
  337. if (strncmp(data, "SDNA", 4)==0)
  338. {
  339. // skip ++ NAME
  340. intPtr++;
  341. intPtr++;
  342. } else
  343. {
  344. if (strncmp(data+4, "SDNA", 4)==0)
  345. {
  346. // skip ++ NAME
  347. intPtr++;
  348. intPtr++;
  349. intPtr++;
  350. }
  351. }
  352. // Parse names
  353. if (swap)
  354. dataLen = ChunkUtils::swapInt(*intPtr);
  355. else
  356. dataLen = *intPtr;
  357. *intPtr = ChunkUtils::swapInt(*intPtr);
  358. intPtr++;
  359. cp = (char*)intPtr;
  360. int i;
  361. for ( i=0; i<dataLen; i++)
  362. {
  363. while (*cp)cp++;
  364. cp++;
  365. }
  366. cp = btAlignPointer(cp,4);
  367. /*
  368. TYPE (4 bytes)
  369. <nr> amount of types (int)
  370. <string>
  371. <string>
  372. */
  373. intPtr = (int*)cp;
  374. assert(strncmp(cp, "TYPE", 4)==0); intPtr++;
  375. if (swap)
  376. dataLen = ChunkUtils::swapInt(*intPtr);
  377. else
  378. dataLen = *intPtr;
  379. *intPtr = ChunkUtils::swapInt(*intPtr);
  380. intPtr++;
  381. cp = (char*)intPtr;
  382. for ( i=0; i<dataLen; i++)
  383. {
  384. while (*cp)cp++;
  385. cp++;
  386. }
  387. cp = btAlignPointer(cp,4);
  388. /*
  389. TLEN (4 bytes)
  390. <len> (short) the lengths of types
  391. <len>
  392. */
  393. // Parse type lens
  394. intPtr = (int*)cp;
  395. assert(strncmp(cp, "TLEN", 4)==0); intPtr++;
  396. shtPtr = (short*)intPtr;
  397. for ( i=0; i<dataLen; i++, shtPtr++)
  398. {
  399. //??????if (swap)
  400. shtPtr[0] = ChunkUtils::swapShort(shtPtr[0]);
  401. }
  402. if (dataLen & 1)
  403. shtPtr++;
  404. /*
  405. STRC (4 bytes)
  406. <nr> amount of structs (int)
  407. <typenr>
  408. <nr_of_elems>
  409. <typenr>
  410. <namenr>
  411. <typenr>
  412. <namenr>
  413. */
  414. intPtr = (int*)shtPtr;
  415. cp = (char*)intPtr;
  416. assert(strncmp(cp, "STRC", 4)==0);
  417. intPtr++;
  418. if (swap)
  419. dataLen = ChunkUtils::swapInt(*intPtr);
  420. else
  421. dataLen = *intPtr;
  422. *intPtr = ChunkUtils::swapInt(*intPtr);
  423. intPtr++;
  424. shtPtr = (short*)intPtr;
  425. for ( i=0; i<dataLen; i++)
  426. {
  427. //if (swap)
  428. {
  429. int len = shtPtr[1];
  430. shtPtr[0]= ChunkUtils::swapShort(shtPtr[0]);
  431. shtPtr[1]= ChunkUtils::swapShort(shtPtr[1]);
  432. shtPtr+= 2;
  433. for (int a=0; a<len; a++, shtPtr+=2)
  434. {
  435. shtPtr[0]= ChunkUtils::swapShort(shtPtr[0]);
  436. shtPtr[1]= ChunkUtils::swapShort(shtPtr[1]);
  437. }
  438. }
  439. // else
  440. // shtPtr+= (2*shtPtr[1])+2;
  441. }
  442. }
  443. void bFile::writeFile(const char* fileName)
  444. {
  445. FILE* f = fopen(fileName,"wb");
  446. fwrite(mFileBuffer,1,mFileLen,f);
  447. fclose(f);
  448. }
  449. void bFile::preSwap()
  450. {
  451. const bool brokenDNA = (mFlags&FD_BROKEN_DNA)!=0;
  452. //FD_ENDIAN_SWAP
  453. //byte 8 determines the endianness of the file, little (v) versus big (V)
  454. int littleEndian= 1;
  455. littleEndian= ((char*)&littleEndian)[0];
  456. if (mFileBuffer[8]=='V')
  457. {
  458. mFileBuffer[8]='v';
  459. }
  460. else
  461. {
  462. mFileBuffer[8]='V';
  463. }
  464. mDataStart = 12;
  465. char *dataPtr = mFileBuffer+mDataStart;
  466. bChunkInd dataChunk;
  467. dataChunk.code = 0;
  468. bool ignoreEndianFlag = true;
  469. //we always want to swap here
  470. int seek = getNextBlock(&dataChunk, dataPtr, mFlags);
  471. //dataPtr += ChunkUtils::getOffset(mFlags);
  472. char *dataPtrHead = 0;
  473. while (1)
  474. {
  475. // one behind
  476. if (dataChunk.code == SDNA || dataChunk.code==DNA1 || dataChunk.code == TYPE || dataChunk.code == TLEN || dataChunk.code==STRC)
  477. {
  478. swapDNA(dataPtr);
  479. break;
  480. } else
  481. {
  482. //if (dataChunk.code == DNA1) break;
  483. dataPtrHead = dataPtr+ChunkUtils::getOffset(mFlags);
  484. swapLen(dataPtr);
  485. if (dataChunk.dna_nr>=0)
  486. {
  487. swap(dataPtrHead, dataChunk,ignoreEndianFlag);
  488. } else
  489. {
  490. //printf("unknown chunk\n");
  491. }
  492. }
  493. // next please!
  494. dataPtr += seek;
  495. seek = getNextBlock(&dataChunk, dataPtr, mFlags);
  496. if (seek < 0)
  497. break;
  498. }
  499. if (mFlags & FD_ENDIAN_SWAP)
  500. {
  501. mFlags &= ~FD_ENDIAN_SWAP;
  502. } else
  503. {
  504. mFlags |= FD_ENDIAN_SWAP;
  505. }
  506. }
  507. // ----------------------------------------------------- //
  508. char* bFile::readStruct(char *head, bChunkInd& dataChunk)
  509. {
  510. bool ignoreEndianFlag = false;
  511. if (mFlags & FD_ENDIAN_SWAP)
  512. swap(head, dataChunk, ignoreEndianFlag);
  513. if (!mFileDNA->flagEqual(dataChunk.dna_nr))
  514. {
  515. // Ouch! need to rebuild the struct
  516. short *oldStruct,*curStruct;
  517. char *oldType, *newType;
  518. int oldLen, curLen, reverseOld;
  519. oldStruct = mFileDNA->getStruct(dataChunk.dna_nr);
  520. oldType = mFileDNA->getType(oldStruct[0]);
  521. oldLen = mFileDNA->getLength(oldStruct[0]);
  522. if ((mFlags&FD_BROKEN_DNA)!=0)
  523. {
  524. if ((strcmp(oldType,"btQuantizedBvhNodeData")==0)&&oldLen==20)
  525. {
  526. return 0;
  527. }
  528. if ((strcmp(oldType,"btShortIntIndexData")==0))
  529. {
  530. int allocLen = 2;
  531. char *dataAlloc = new char[(dataChunk.nr*allocLen)+1];
  532. memset(dataAlloc, 0, (dataChunk.nr*allocLen)+1);
  533. short* dest = (short*) dataAlloc;
  534. const short* src = (short*) head;
  535. for (int i=0;i<dataChunk.nr;i++)
  536. {
  537. dest[i] = src[i];
  538. if (mFlags &FD_ENDIAN_SWAP)
  539. {
  540. SWITCH_SHORT(dest[i]);
  541. }
  542. }
  543. addDataBlock(dataAlloc);
  544. return dataAlloc;
  545. }
  546. }
  547. ///don't try to convert Link block data, just memcpy it. Other data can be converted.
  548. if (strcmp("Link",oldType)!=0)
  549. {
  550. reverseOld = mMemoryDNA->getReverseType(oldType);
  551. if ((reverseOld!=-1))
  552. {
  553. // make sure it's here
  554. //assert(reverseOld!= -1 && "getReverseType() returned -1, struct required!");
  555. //
  556. curStruct = mMemoryDNA->getStruct(reverseOld);
  557. newType = mMemoryDNA->getType(curStruct[0]);
  558. curLen = mMemoryDNA->getLength(curStruct[0]);
  559. // make sure it's the same
  560. assert((strcmp(oldType, newType)==0) && "internal error, struct mismatch!");
  561. numallocs++;
  562. // numBlocks * length
  563. int allocLen = (curLen);
  564. char *dataAlloc = new char[(dataChunk.nr*allocLen)+1];
  565. memset(dataAlloc, 0, (dataChunk.nr*allocLen));
  566. // track allocated
  567. addDataBlock(dataAlloc);
  568. char *cur = dataAlloc;
  569. char *old = head;
  570. for (int block=0; block<dataChunk.nr; block++)
  571. {
  572. bool fixupPointers = true;
  573. parseStruct(cur, old, dataChunk.dna_nr, reverseOld, fixupPointers);
  574. mLibPointers.insert(old,(bStructHandle*)cur);
  575. cur += curLen;
  576. old += oldLen;
  577. }
  578. return dataAlloc;
  579. }
  580. } else
  581. {
  582. //printf("Link found\n");
  583. }
  584. } else
  585. {
  586. //#define DEBUG_EQUAL_STRUCTS
  587. #ifdef DEBUG_EQUAL_STRUCTS
  588. short *oldStruct;
  589. char *oldType;
  590. oldStruct = mFileDNA->getStruct(dataChunk.dna_nr);
  591. oldType = mFileDNA->getType(oldStruct[0]);
  592. printf("%s equal structure, just memcpy\n",oldType);
  593. #endif //
  594. }
  595. char *dataAlloc = new char[(dataChunk.len)+1];
  596. memset(dataAlloc, 0, dataChunk.len+1);
  597. // track allocated
  598. addDataBlock(dataAlloc);
  599. memcpy(dataAlloc, head, dataChunk.len);
  600. return dataAlloc;
  601. }
  602. // ----------------------------------------------------- //
  603. void bFile::parseStruct(char *strcPtr, char *dtPtr, int old_dna, int new_dna, bool fixupPointers)
  604. {
  605. if (old_dna == -1) return;
  606. if (new_dna == -1) return;
  607. //disable this, because we need to fixup pointers/ListBase
  608. if (0)//mFileDNA->flagEqual(old_dna))
  609. {
  610. short *strc = mFileDNA->getStruct(old_dna);
  611. int len = mFileDNA->getLength(strc[0]);
  612. memcpy(strcPtr, dtPtr, len);
  613. return;
  614. }
  615. // Ok, now build the struct
  616. char *memType, *memName, *cpc, *cpo;
  617. short *fileStruct, *filePtrOld, *memoryStruct, *firstStruct;
  618. int elementLength, size, revType, old_nr, new_nr, fpLen;
  619. short firstStructType;
  620. // File to memory lookup
  621. memoryStruct = mMemoryDNA->getStruct(new_dna);
  622. fileStruct = mFileDNA->getStruct(old_dna);
  623. firstStruct = fileStruct;
  624. filePtrOld = fileStruct;
  625. firstStructType = mMemoryDNA->getStruct(0)[0];
  626. // Get number of elements
  627. elementLength = memoryStruct[1];
  628. memoryStruct+=2;
  629. cpc = strcPtr; cpo = 0;
  630. for (int ele=0; ele<elementLength; ele++, memoryStruct+=2)
  631. {
  632. memType = mMemoryDNA->getType(memoryStruct[0]);
  633. memName = mMemoryDNA->getName(memoryStruct[1]);
  634. size = mMemoryDNA->getElementSize(memoryStruct[0], memoryStruct[1]);
  635. revType = mMemoryDNA->getReverseType(memoryStruct[0]);
  636. if (revType != -1 && memoryStruct[0]>=firstStructType && memName[0] != '*')
  637. {
  638. cpo = getFileElement(firstStruct, memName, memType, dtPtr, &filePtrOld);
  639. if (cpo)
  640. {
  641. int arrayLen = mFileDNA->getArraySizeNew(filePtrOld[1]);
  642. old_nr = mFileDNA->getReverseType(memType);
  643. new_nr = revType;
  644. fpLen = mFileDNA->getElementSize(filePtrOld[0], filePtrOld[1]);
  645. if (arrayLen==1)
  646. {
  647. parseStruct(cpc, cpo, old_nr, new_nr,fixupPointers);
  648. } else
  649. {
  650. char* tmpCpc = cpc;
  651. char* tmpCpo = cpo;
  652. for (int i=0;i<arrayLen;i++)
  653. {
  654. parseStruct(tmpCpc, tmpCpo, old_nr, new_nr,fixupPointers);
  655. tmpCpc += size/arrayLen;
  656. tmpCpo += fpLen/arrayLen;
  657. }
  658. }
  659. cpc+=size;
  660. cpo+=fpLen;
  661. }
  662. else
  663. cpc+=size;
  664. }
  665. else
  666. {
  667. getMatchingFileDNA(fileStruct, memName, memType, cpc, dtPtr,fixupPointers);
  668. cpc+=size;
  669. }
  670. }
  671. }
  672. // ----------------------------------------------------- //
  673. static void getElement(int arrayLen, const char *cur, const char *old, char *oldPtr, char *curData)
  674. {
  675. #define getEle(value, current, type, cast, size, ptr)\
  676. if (strcmp(current, type)==0)\
  677. {\
  678. value = (*(cast*)ptr);\
  679. ptr += size;\
  680. }
  681. #define setEle(value, current, type, cast, size, ptr)\
  682. if (strcmp(current, type)==0)\
  683. {\
  684. (*(cast*)ptr) = (cast)value;\
  685. ptr += size;\
  686. }
  687. double value = 0.0;
  688. for (int i=0; i<arrayLen; i++)
  689. {
  690. getEle(value, old, "char", char, sizeof(char), oldPtr);
  691. setEle(value, cur, "char", char, sizeof(char), curData);
  692. getEle(value, old, "short", short, sizeof(short), oldPtr);
  693. setEle(value, cur, "short", short, sizeof(short), curData);
  694. getEle(value, old, "ushort", unsigned short, sizeof(unsigned short), oldPtr);
  695. setEle(value, cur, "ushort", unsigned short, sizeof(unsigned short), curData);
  696. getEle(value, old, "int", int, sizeof(int), oldPtr);
  697. setEle(value, cur, "int", int, sizeof(int), curData);
  698. getEle(value, old, "long", int, sizeof(int), oldPtr);
  699. setEle(value, cur, "long", int, sizeof(int), curData);
  700. getEle(value, old, "float", float, sizeof(float), oldPtr);
  701. setEle(value, cur, "float", float, sizeof(float), curData);
  702. getEle(value, old, "double", double, sizeof(double), oldPtr);
  703. setEle(value, cur, "double", double, sizeof(double), curData);
  704. }
  705. }
  706. // ----------------------------------------------------- //
  707. void bFile::swapData(char *data, short type, int arraySize,bool ignoreEndianFlag)
  708. {
  709. if (ignoreEndianFlag || (mFlags &FD_ENDIAN_SWAP))
  710. {
  711. if (type == 2 || type == 3)
  712. {
  713. short *sp = (short*)data;
  714. for (int i=0; i<arraySize; i++)
  715. {
  716. sp[0] = ChunkUtils::swapShort(sp[0]);
  717. sp++;
  718. }
  719. }
  720. if (type>3 && type <8)
  721. {
  722. char c;
  723. char *cp = data;
  724. for (int i=0; i<arraySize; i++)
  725. {
  726. c = cp[0];
  727. cp[0] = cp[3];
  728. cp[3] = c;
  729. c = cp[1];
  730. cp[1] = cp[2];
  731. cp[2] = c;
  732. cp+=4;
  733. }
  734. }
  735. }
  736. }
  737. void bFile::safeSwapPtr(char *dst, const char *src)
  738. {
  739. int ptrFile = mFileDNA->getPointerSize();
  740. int ptrMem = mMemoryDNA->getPointerSize();
  741. if (!src && !dst)
  742. return;
  743. if (ptrFile == ptrMem)
  744. {
  745. memcpy(dst, src, ptrMem);
  746. }
  747. else if (ptrMem==4 && ptrFile==8)
  748. {
  749. btPointerUid* oldPtr = (btPointerUid*)src;
  750. btPointerUid* newPtr = (btPointerUid*)dst;
  751. if (oldPtr->m_uniqueIds[0] == oldPtr->m_uniqueIds[1])
  752. {
  753. //Bullet stores the 32bit unique ID in both upper and lower part of 64bit pointers
  754. //so it can be used to distinguish between .blend and .bullet
  755. newPtr->m_uniqueIds[0] = oldPtr->m_uniqueIds[0];
  756. } else
  757. {
  758. //deal with pointers the Blender .blend style way, see
  759. //readfile.c in the Blender source tree
  760. long64 longValue = *((long64*)src);
  761. //endian swap for 64bit pointer otherwise truncation will fail due to trailing zeros
  762. if (mFlags & FD_ENDIAN_SWAP)
  763. SWITCH_LONGINT(longValue);
  764. *((int*)dst) = (int)(longValue>>3);
  765. }
  766. }
  767. else if (ptrMem==8 && ptrFile==4)
  768. {
  769. btPointerUid* oldPtr = (btPointerUid*)src;
  770. btPointerUid* newPtr = (btPointerUid*)dst;
  771. if (oldPtr->m_uniqueIds[0] == oldPtr->m_uniqueIds[1])
  772. {
  773. newPtr->m_uniqueIds[0] = oldPtr->m_uniqueIds[0];
  774. newPtr->m_uniqueIds[1] = 0;
  775. } else
  776. {
  777. *((long64*)dst)= *((int*)src);
  778. }
  779. }
  780. else
  781. {
  782. printf ("%d %d\n", ptrFile,ptrMem);
  783. assert(0 && "Invalid pointer len");
  784. }
  785. }
  786. // ----------------------------------------------------- //
  787. void bFile::getMatchingFileDNA(short* dna_addr, const char* lookupName, const char* lookupType, char *strcData, char *data, bool fixupPointers)
  788. {
  789. // find the matching memory dna data
  790. // to the file being loaded. Fill the
  791. // memory with the file data...
  792. int len = dna_addr[1];
  793. dna_addr+=2;
  794. for (int i=0; i<len; i++, dna_addr+=2)
  795. {
  796. const char* type = mFileDNA->getType(dna_addr[0]);
  797. const char* name = mFileDNA->getName(dna_addr[1]);
  798. int eleLen = mFileDNA->getElementSize(dna_addr[0], dna_addr[1]);
  799. if ((mFlags&FD_BROKEN_DNA)!=0)
  800. {
  801. if ((strcmp(type,"short")==0)&&(strcmp(name,"int")==0))
  802. {
  803. eleLen = 0;
  804. }
  805. }
  806. if (strcmp(lookupName, name)==0)
  807. {
  808. //int arrayLenold = mFileDNA->getArraySize((char*)name.c_str());
  809. int arrayLen = mFileDNA->getArraySizeNew(dna_addr[1]);
  810. //assert(arrayLenold == arrayLen);
  811. if (name[0] == '*')
  812. {
  813. // cast pointers
  814. int ptrFile = mFileDNA->getPointerSize();
  815. int ptrMem = mMemoryDNA->getPointerSize();
  816. safeSwapPtr(strcData,data);
  817. if (fixupPointers)
  818. {
  819. if (arrayLen > 1)
  820. {
  821. //void **sarray = (void**)strcData;
  822. //void **darray = (void**)data;
  823. char *cpc, *cpo;
  824. cpc = (char*)strcData;
  825. cpo = (char*)data;
  826. for (int a=0; a<arrayLen; a++)
  827. {
  828. safeSwapPtr(cpc, cpo);
  829. m_pointerFixupArray.push_back(cpc);
  830. cpc += ptrMem;
  831. cpo += ptrFile;
  832. }
  833. }
  834. else
  835. {
  836. if (name[1] == '*')
  837. m_pointerPtrFixupArray.push_back(strcData);
  838. else
  839. m_pointerFixupArray.push_back(strcData);
  840. }
  841. }
  842. else
  843. {
  844. // printf("skipped %s %s : %x\n",type.c_str(),name.c_str(),strcData);
  845. }
  846. }
  847. else if (strcmp(type, lookupType)==0)
  848. memcpy(strcData, data, eleLen);
  849. else
  850. getElement(arrayLen, lookupType, type, data, strcData);
  851. // --
  852. return;
  853. }
  854. data+=eleLen;
  855. }
  856. }
  857. // ----------------------------------------------------- //
  858. char* bFile::getFileElement(short *firstStruct, char *lookupName, char *lookupType, char *data, short **foundPos)
  859. {
  860. short *old = firstStruct;//mFileDNA->getStruct(old_nr);
  861. int elementLength = old[1];
  862. old+=2;
  863. for (int i=0; i<elementLength; i++, old+=2)
  864. {
  865. char* type = mFileDNA->getType(old[0]);
  866. char* name = mFileDNA->getName(old[1]);
  867. int len = mFileDNA->getElementSize(old[0], old[1]);
  868. if (strcmp(lookupName, name)==0)
  869. {
  870. if (strcmp(type, lookupType)==0)
  871. {
  872. if (foundPos)
  873. *foundPos = old;
  874. return data;
  875. }
  876. return 0;
  877. }
  878. data+=len;
  879. }
  880. return 0;
  881. }
  882. // ----------------------------------------------------- //
  883. void bFile::swapStruct(int dna_nr, char *data,bool ignoreEndianFlag)
  884. {
  885. if (dna_nr == -1) return;
  886. short *strc = mFileDNA->getStruct(dna_nr);
  887. //short *firstStrc = strc;
  888. int elementLen= strc[1];
  889. strc+=2;
  890. short first = mFileDNA->getStruct(0)[0];
  891. char *buf = data;
  892. for (int i=0; i<elementLen; i++, strc+=2)
  893. {
  894. char *type = mFileDNA->getType(strc[0]);
  895. char *name = mFileDNA->getName(strc[1]);
  896. int size = mFileDNA->getElementSize(strc[0], strc[1]);
  897. if (strc[0] >= first && name[0]!='*')
  898. {
  899. int old_nr = mFileDNA->getReverseType(type);
  900. int arrayLen = mFileDNA->getArraySizeNew(strc[1]);
  901. if (arrayLen==1)
  902. {
  903. swapStruct(old_nr,buf,ignoreEndianFlag);
  904. } else
  905. {
  906. char* tmpBuf = buf;
  907. for (int i=0;i<arrayLen;i++)
  908. {
  909. swapStruct(old_nr,tmpBuf,ignoreEndianFlag);
  910. tmpBuf+=size/arrayLen;
  911. }
  912. }
  913. }
  914. else
  915. {
  916. //int arrayLenOld = mFileDNA->getArraySize(name);
  917. int arrayLen = mFileDNA->getArraySizeNew(strc[1]);
  918. //assert(arrayLenOld == arrayLen);
  919. swapData(buf, strc[0], arrayLen,ignoreEndianFlag);
  920. }
  921. buf+=size;
  922. }
  923. }
  924. void bFile::resolvePointersMismatch()
  925. {
  926. // printf("resolvePointersStructMismatch\n");
  927. int i;
  928. for (i=0;i< m_pointerFixupArray.size();i++)
  929. {
  930. char* cur = m_pointerFixupArray.at(i);
  931. void** ptrptr = (void**) cur;
  932. void* ptr = *ptrptr;
  933. ptr = findLibPointer(ptr);
  934. if (ptr)
  935. {
  936. //printf("Fixup pointer!\n");
  937. *(ptrptr) = ptr;
  938. } else
  939. {
  940. // printf("pointer not found: %x\n",cur);
  941. }
  942. }
  943. for (i=0; i<m_pointerPtrFixupArray.size(); i++)
  944. {
  945. char* cur= m_pointerPtrFixupArray.at(i);
  946. void** ptrptr = (void**)cur;
  947. bChunkInd *block = m_chunkPtrPtrMap.find(*ptrptr);
  948. if (block)
  949. {
  950. int ptrMem = mMemoryDNA->getPointerSize();
  951. int ptrFile = mFileDNA->getPointerSize();
  952. int blockLen = block->len / ptrFile;
  953. void *onptr = findLibPointer(*ptrptr);
  954. if (onptr)
  955. {
  956. char *newPtr = new char[blockLen * ptrMem];
  957. addDataBlock(newPtr);
  958. memset(newPtr, 0, blockLen * ptrMem);
  959. void **onarray = (void**)onptr;
  960. char *oldPtr = (char*)onarray;
  961. int p = 0;
  962. while (blockLen-- > 0)
  963. {
  964. btPointerUid dp = {{0}};
  965. safeSwapPtr((char*)dp.m_uniqueIds, oldPtr);
  966. void **tptr = (void**)(newPtr + p * ptrMem);
  967. *tptr = findLibPointer(dp.m_ptr);
  968. oldPtr += ptrFile;
  969. ++p;
  970. }
  971. *ptrptr = newPtr;
  972. }
  973. }
  974. }
  975. }
  976. ///this loop only works fine if the Blender DNA structure of the file matches the headerfiles
  977. void bFile::resolvePointersChunk(const bChunkInd& dataChunk, int verboseMode)
  978. {
  979. bParse::bDNA* fileDna = mFileDNA ? mFileDNA : mMemoryDNA;
  980. short int* oldStruct = fileDna->getStruct(dataChunk.dna_nr);
  981. short oldLen = fileDna->getLength(oldStruct[0]);
  982. //char* structType = fileDna->getType(oldStruct[0]);
  983. char* cur = (char*)findLibPointer(dataChunk.oldPtr);
  984. for (int block=0; block<dataChunk.nr; block++)
  985. {
  986. resolvePointersStructRecursive(cur,dataChunk.dna_nr, verboseMode,1);
  987. cur += oldLen;
  988. }
  989. }
  990. int bFile::resolvePointersStructRecursive(char *strcPtr, int dna_nr, int verboseMode,int recursion)
  991. {
  992. bParse::bDNA* fileDna = mFileDNA ? mFileDNA : mMemoryDNA;
  993. char* memType;
  994. char* memName;
  995. short firstStructType = fileDna->getStruct(0)[0];
  996. char* elemPtr= strcPtr;
  997. short int* oldStruct = fileDna->getStruct(dna_nr);
  998. int elementLength = oldStruct[1];
  999. oldStruct+=2;
  1000. int totalSize = 0;
  1001. for (int ele=0; ele<elementLength; ele++, oldStruct+=2)
  1002. {
  1003. memType = fileDna->getType(oldStruct[0]);
  1004. memName = fileDna->getName(oldStruct[1]);
  1005. int arrayLen = fileDna->getArraySizeNew(oldStruct[1]);
  1006. if (memName[0] == '*')
  1007. {
  1008. if (arrayLen > 1)
  1009. {
  1010. void **array= (void**)elemPtr;
  1011. for (int a=0; a<arrayLen; a++)
  1012. {
  1013. if (verboseMode & FD_VERBOSE_EXPORT_XML)
  1014. {
  1015. for (int i=0;i<recursion;i++)
  1016. {
  1017. printf(" ");
  1018. }
  1019. //skip the *
  1020. printf("<%s type=\"pointer\"> ",&memName[1]);
  1021. printf("%d ", array[a]);
  1022. printf("</%s>\n",&memName[1]);
  1023. }
  1024. array[a] = findLibPointer(array[a]);
  1025. }
  1026. }
  1027. else
  1028. {
  1029. void** ptrptr = (void**) elemPtr;
  1030. void* ptr = *ptrptr;
  1031. if (verboseMode & FD_VERBOSE_EXPORT_XML)
  1032. {
  1033. for (int i=0;i<recursion;i++)
  1034. {
  1035. printf(" ");
  1036. }
  1037. printf("<%s type=\"pointer\"> ",&memName[1]);
  1038. printf("%d ", ptr);
  1039. printf("</%s>\n",&memName[1]);
  1040. }
  1041. ptr = findLibPointer(ptr);
  1042. if (ptr)
  1043. {
  1044. // printf("Fixup pointer at 0x%x from 0x%x to 0x%x!\n",ptrptr,*ptrptr,ptr);
  1045. *(ptrptr) = ptr;
  1046. if (memName[1] == '*' && ptrptr && *ptrptr)
  1047. {
  1048. // This will only work if the given **array is continuous
  1049. void **array= (void**)*(ptrptr);
  1050. void *np= array[0];
  1051. int n=0;
  1052. while (np)
  1053. {
  1054. np= findLibPointer(array[n]);
  1055. if (np) array[n]= np;
  1056. n++;
  1057. }
  1058. }
  1059. } else
  1060. {
  1061. // printf("Cannot fixup pointer at 0x%x from 0x%x to 0x%x!\n",ptrptr,*ptrptr,ptr);
  1062. }
  1063. }
  1064. } else
  1065. {
  1066. int revType = fileDna->getReverseType(oldStruct[0]);
  1067. if (oldStruct[0]>=firstStructType) //revType != -1 &&
  1068. {
  1069. char cleanName[MAX_STRLEN];
  1070. getCleanName(memName,cleanName);
  1071. int arrayLen = fileDna->getArraySizeNew(oldStruct[1]);
  1072. int byteOffset = 0;
  1073. if (verboseMode & FD_VERBOSE_EXPORT_XML)
  1074. {
  1075. for (int i=0;i<recursion;i++)
  1076. {
  1077. printf(" ");
  1078. }
  1079. if (arrayLen>1)
  1080. {
  1081. printf("<%s type=\"%s\" count=%d>\n",cleanName,memType, arrayLen);
  1082. } else
  1083. {
  1084. printf("<%s type=\"%s\">\n",cleanName,memType);
  1085. }
  1086. }
  1087. for (int i=0;i<arrayLen;i++)
  1088. {
  1089. byteOffset += resolvePointersStructRecursive(elemPtr+byteOffset,revType, verboseMode,recursion+1);
  1090. }
  1091. if (verboseMode & FD_VERBOSE_EXPORT_XML)
  1092. {
  1093. for (int i=0;i<recursion;i++)
  1094. {
  1095. printf(" ");
  1096. }
  1097. printf("</%s>\n",cleanName);
  1098. }
  1099. } else
  1100. {
  1101. //export a simple type
  1102. if (verboseMode & FD_VERBOSE_EXPORT_XML)
  1103. {
  1104. if (arrayLen>MAX_ARRAY_LENGTH)
  1105. {
  1106. printf("too long\n");
  1107. } else
  1108. {
  1109. //printf("%s %s\n",memType,memName);
  1110. bool isIntegerType = (strcmp(memType,"char")==0) || (strcmp(memType,"int")==0) || (strcmp(memType,"short")==0);
  1111. if (isIntegerType)
  1112. {
  1113. const char* newtype="int";
  1114. int dbarray[MAX_ARRAY_LENGTH];
  1115. int* dbPtr = 0;
  1116. char* tmp = elemPtr;
  1117. dbPtr = &dbarray[0];
  1118. if (dbPtr)
  1119. {
  1120. char cleanName[MAX_STRLEN];
  1121. getCleanName(memName,cleanName);
  1122. int i;
  1123. getElement(arrayLen, newtype,memType, tmp, (char*)dbPtr);
  1124. for (i=0;i<recursion;i++)
  1125. printf(" ");
  1126. if (arrayLen==1)
  1127. printf("<%s type=\"%s\">",cleanName,memType);
  1128. else
  1129. printf("<%s type=\"%s\" count=%d>",cleanName,memType,arrayLen);
  1130. for (i=0;i<arrayLen;i++)
  1131. printf(" %d ",dbPtr[i]);
  1132. printf("</%s>\n",cleanName);
  1133. }
  1134. } else
  1135. {
  1136. const char* newtype="double";
  1137. double dbarray[MAX_ARRAY_LENGTH];
  1138. double* dbPtr = 0;
  1139. char* tmp = elemPtr;
  1140. dbPtr = &dbarray[0];
  1141. if (dbPtr)
  1142. {
  1143. int i;
  1144. getElement(arrayLen, newtype,memType, tmp, (char*)dbPtr);
  1145. for (i=0;i<recursion;i++)
  1146. printf(" ");
  1147. char cleanName[MAX_STRLEN];
  1148. getCleanName(memName,cleanName);
  1149. if (arrayLen==1)
  1150. {
  1151. printf("<%s type=\"%s\">",memName,memType);
  1152. }
  1153. else
  1154. {
  1155. printf("<%s type=\"%s\" count=%d>",cleanName,memType,arrayLen);
  1156. }
  1157. for (i=0;i<arrayLen;i++)
  1158. printf(" %f ",dbPtr[i]);
  1159. printf("</%s>\n",cleanName);
  1160. }
  1161. }
  1162. }
  1163. }
  1164. }
  1165. }
  1166. int size = fileDna->getElementSize(oldStruct[0], oldStruct[1]);
  1167. totalSize += size;
  1168. elemPtr+=size;
  1169. }
  1170. return totalSize;
  1171. }
  1172. ///Resolve pointers replaces the original pointers in structures, and linked lists by the new in-memory structures
  1173. void bFile::resolvePointers(int verboseMode)
  1174. {
  1175. bParse::bDNA* fileDna = mFileDNA ? mFileDNA : mMemoryDNA;
  1176. //char *dataPtr = mFileBuffer+mDataStart;
  1177. if (1) //mFlags & (FD_BITS_VARIES | FD_VERSION_VARIES))
  1178. {
  1179. resolvePointersMismatch();
  1180. }
  1181. {
  1182. if (verboseMode & FD_VERBOSE_EXPORT_XML)
  1183. {
  1184. printf("<?xml version=\"1.0\" encoding=\"utf-8\"?>\n");
  1185. int numitems = m_chunks.size();
  1186. printf("<bullet_physics version=%d itemcount = %d>\n", btGetVersion(), numitems);
  1187. }
  1188. for (int i=0;i<m_chunks.size();i++)
  1189. {
  1190. const bChunkInd& dataChunk = m_chunks.at(i);
  1191. if (!mFileDNA || fileDna->flagEqual(dataChunk.dna_nr))
  1192. {
  1193. //dataChunk.len
  1194. short int* oldStruct = fileDna->getStruct(dataChunk.dna_nr);
  1195. char* oldType = fileDna->getType(oldStruct[0]);
  1196. if (verboseMode & FD_VERBOSE_EXPORT_XML)
  1197. printf(" <%s pointer=%d>\n",oldType,dataChunk.oldPtr);
  1198. resolvePointersChunk(dataChunk, verboseMode);
  1199. if (verboseMode & FD_VERBOSE_EXPORT_XML)
  1200. printf(" </%s>\n",oldType);
  1201. } else
  1202. {
  1203. //printf("skipping mStruct\n");
  1204. }
  1205. }
  1206. if (verboseMode & FD_VERBOSE_EXPORT_XML)
  1207. {
  1208. printf("</bullet_physics>\n");
  1209. }
  1210. }
  1211. }
  1212. // ----------------------------------------------------- //
  1213. void* bFile::findLibPointer(void *ptr)
  1214. {
  1215. bStructHandle** ptrptr = getLibPointers().find(ptr);
  1216. if (ptrptr)
  1217. return *ptrptr;
  1218. return 0;
  1219. }
  1220. void bFile::updateOldPointers()
  1221. {
  1222. int i;
  1223. for (i=0;i<m_chunks.size();i++)
  1224. {
  1225. bChunkInd& dataChunk = m_chunks[i];
  1226. dataChunk.oldPtr = findLibPointer(dataChunk.oldPtr);
  1227. }
  1228. }
  1229. void bFile::dumpChunks(bParse::bDNA* dna)
  1230. {
  1231. int i;
  1232. for (i=0;i<m_chunks.size();i++)
  1233. {
  1234. bChunkInd& dataChunk = m_chunks[i];
  1235. char* codeptr = (char*)&dataChunk.code;
  1236. char codestr[5] = {codeptr[0],codeptr[1],codeptr[2],codeptr[3],0};
  1237. short* newStruct = dna->getStruct(dataChunk.dna_nr);
  1238. char* typeName = dna->getType(newStruct[0]);
  1239. printf("%3d: %s ",i,typeName);
  1240. printf("code=%s ",codestr);
  1241. printf("ptr=%p ",dataChunk.oldPtr);
  1242. printf("len=%d ",dataChunk.len);
  1243. printf("nr=%d ",dataChunk.nr);
  1244. if (dataChunk.nr!=1)
  1245. {
  1246. printf("not 1\n");
  1247. }
  1248. printf("\n");
  1249. }
  1250. #if 0
  1251. IDFinderData ifd;
  1252. ifd.success = 0;
  1253. ifd.IDname = NULL;
  1254. ifd.just_print_it = 1;
  1255. for (i=0; i<bf->m_blocks.size(); ++i)
  1256. {
  1257. BlendBlock* bb = bf->m_blocks[i];
  1258. printf("tag='%s'\tptr=%p\ttype=%s\t[%4d]", bb->tag, bb,bf->types[bb->type_index].name,bb->m_array_entries_.size());
  1259. block_ID_finder(bb, bf, &ifd);
  1260. printf("\n");
  1261. }
  1262. #endif
  1263. }
  1264. void bFile::writeChunks(FILE* fp, bool fixupPointers)
  1265. {
  1266. bParse::bDNA* fileDna = mFileDNA ? mFileDNA : mMemoryDNA;
  1267. for (int i=0;i<m_chunks.size();i++)
  1268. {
  1269. bChunkInd& dataChunk = m_chunks.at(i);
  1270. // Ouch! need to rebuild the struct
  1271. short *oldStruct,*curStruct;
  1272. char *oldType, *newType;
  1273. int curLen, reverseOld;
  1274. oldStruct = fileDna->getStruct(dataChunk.dna_nr);
  1275. oldType = fileDna->getType(oldStruct[0]);
  1276. //int oldLen = fileDna->getLength(oldStruct[0]);
  1277. ///don't try to convert Link block data, just memcpy it. Other data can be converted.
  1278. reverseOld = mMemoryDNA->getReverseType(oldType);
  1279. if ((reverseOld!=-1))
  1280. {
  1281. // make sure it's here
  1282. //assert(reverseOld!= -1 && "getReverseType() returned -1, struct required!");
  1283. //
  1284. curStruct = mMemoryDNA->getStruct(reverseOld);
  1285. newType = mMemoryDNA->getType(curStruct[0]);
  1286. // make sure it's the same
  1287. assert((strcmp(oldType, newType)==0) && "internal error, struct mismatch!");
  1288. curLen = mMemoryDNA->getLength(curStruct[0]);
  1289. dataChunk.dna_nr = reverseOld;
  1290. if (strcmp("Link",oldType)!=0)
  1291. {
  1292. dataChunk.len = curLen * dataChunk.nr;
  1293. } else
  1294. {
  1295. // printf("keep length of link = %d\n",dataChunk.len);
  1296. }
  1297. //write the structure header
  1298. fwrite(&dataChunk,sizeof(bChunkInd),1,fp);
  1299. short int* curStruct1;
  1300. curStruct1 = mMemoryDNA->getStruct(dataChunk.dna_nr);
  1301. assert(curStruct1 == curStruct);
  1302. char* cur = fixupPointers ? (char*)findLibPointer(dataChunk.oldPtr) : (char*)dataChunk.oldPtr;
  1303. //write the actual contents of the structure(s)
  1304. fwrite(cur,dataChunk.len,1,fp);
  1305. } else
  1306. {
  1307. printf("serious error, struct mismatch: don't write\n");
  1308. }
  1309. }
  1310. }
  1311. // ----------------------------------------------------- //
  1312. int bFile::getNextBlock(bChunkInd *dataChunk, const char *dataPtr, const int flags)
  1313. {
  1314. bool swap = false;
  1315. bool varies = false;
  1316. if (flags &FD_ENDIAN_SWAP)
  1317. swap = true;
  1318. if (flags &FD_BITS_VARIES)
  1319. varies = true;
  1320. if (VOID_IS_8)
  1321. {
  1322. if (varies)
  1323. {
  1324. bChunkPtr4 head;
  1325. memcpy(&head, dataPtr, sizeof(bChunkPtr4));
  1326. bChunkPtr8 chunk;
  1327. chunk.code = head.code;
  1328. chunk.len = head.len;
  1329. chunk.m_uniqueInts[0] = head.m_uniqueInt;
  1330. chunk.m_uniqueInts[1] = 0;
  1331. chunk.dna_nr = head.dna_nr;
  1332. chunk.nr = head.nr;
  1333. if (swap)
  1334. {
  1335. if ((chunk.code & 0xFFFF)==0)
  1336. chunk.code >>=16;
  1337. SWITCH_INT(chunk.len);
  1338. SWITCH_INT(chunk.dna_nr);
  1339. SWITCH_INT(chunk.nr);
  1340. }
  1341. memcpy(dataChunk, &chunk, sizeof(bChunkInd));
  1342. }
  1343. else
  1344. {
  1345. bChunkPtr8 c;
  1346. memcpy(&c, dataPtr, sizeof(bChunkPtr8));
  1347. if (swap)
  1348. {
  1349. if ((c.code & 0xFFFF)==0)
  1350. c.code >>=16;
  1351. SWITCH_INT(c.len);
  1352. SWITCH_INT(c.dna_nr);
  1353. SWITCH_INT(c.nr);
  1354. }
  1355. memcpy(dataChunk, &c, sizeof(bChunkInd));
  1356. }
  1357. }
  1358. else
  1359. {
  1360. if (varies)
  1361. {
  1362. bChunkPtr8 head;
  1363. memcpy(&head, dataPtr, sizeof(bChunkPtr8));
  1364. bChunkPtr4 chunk;
  1365. chunk.code = head.code;
  1366. chunk.len = head.len;
  1367. if (head.m_uniqueInts[0]==head.m_uniqueInts[1])
  1368. {
  1369. chunk.m_uniqueInt = head.m_uniqueInts[0];
  1370. } else
  1371. {
  1372. long64 oldPtr =0;
  1373. memcpy(&oldPtr, &head.m_uniqueInts[0], 8);
  1374. if (swap)
  1375. SWITCH_LONGINT(oldPtr);
  1376. chunk.m_uniqueInt = (int)(oldPtr >> 3);
  1377. }
  1378. chunk.dna_nr = head.dna_nr;
  1379. chunk.nr = head.nr;
  1380. if (swap)
  1381. {
  1382. if ((chunk.code & 0xFFFF)==0)
  1383. chunk.code >>=16;
  1384. SWITCH_INT(chunk.len);
  1385. SWITCH_INT(chunk.dna_nr);
  1386. SWITCH_INT(chunk.nr);
  1387. }
  1388. memcpy(dataChunk, &chunk, sizeof(bChunkInd));
  1389. }
  1390. else
  1391. {
  1392. bChunkPtr4 c;
  1393. memcpy(&c, dataPtr, sizeof(bChunkPtr4));
  1394. if (swap)
  1395. {
  1396. if ((c.code & 0xFFFF)==0)
  1397. c.code >>=16;
  1398. SWITCH_INT(c.len);
  1399. SWITCH_INT(c.dna_nr);
  1400. SWITCH_INT(c.nr);
  1401. }
  1402. memcpy(dataChunk, &c, sizeof(bChunkInd));
  1403. }
  1404. }
  1405. if (dataChunk->len < 0)
  1406. return -1;
  1407. #if 0
  1408. print ("----------");
  1409. print (dataChunk->code);
  1410. print (dataChunk->len);
  1411. print (dataChunk->old);
  1412. print (dataChunk->dna_nr);
  1413. print (dataChunk->nr);
  1414. #endif
  1415. return (dataChunk->len+ChunkUtils::getOffset(flags));
  1416. }
  1417. //eof