b3File.cpp 37 KB

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