vkey.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442
  1. /*##############################################################################
  2. HPCC SYSTEMS software Copyright (C) 2012 HPCC Systems®.
  3. Licensed under the Apache License, Version 2.0 (the "License");
  4. you may not use this file except in compliance with the License.
  5. You may obtain a copy of the License at
  6. http://www.apache.org/licenses/LICENSE-2.0
  7. Unless required by applicable law or agreed to in writing, software
  8. distributed under the License is distributed on an "AS IS" BASIS,
  9. WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  10. See the License for the specific language governing permissions and
  11. limitations under the License.
  12. ############################################################################## */
  13. #include "jlib.hpp"
  14. #include "ctfile.hpp"
  15. bool skipLeafLevel = false;
  16. bool checkCRC = false;
  17. bool quick = false;
  18. offset_t nodeAddress = 0;
  19. unsigned errors = 0;
  20. unsigned errorLimit = 10;
  21. const char *curFileName = NULL;
  22. inline void SwapBigEndian(KeyHdr &hdr)
  23. {
  24. _WINREV(hdr.phyrec);
  25. _WINREV(hdr.delstk);
  26. _WINREV(hdr.numrec);
  27. _WINREV(hdr.reshdr);
  28. _WINREV(hdr.lstmbr);
  29. _WINREV(hdr.sernum);
  30. _WINREV(hdr.nument);
  31. _WINREV(hdr.root);
  32. _WINREV(hdr.fileid);
  33. _WINREV(hdr.servid);
  34. _WINREV(hdr.verson);
  35. _WINREV(hdr.nodeSize);
  36. _WINREV(hdr.extsiz);
  37. _WINREV(hdr.flmode);
  38. _WINREV(hdr.maxkbl);
  39. _WINREV(hdr.maxkbn);
  40. // _WINREV(hdr.updflg);
  41. // _WINREV(hdr.autodup);
  42. // _WINREV(hdr.deltyp);
  43. // _WINREV(hdr.keypad);
  44. // _WINREV(hdr.flflvr);
  45. // _WINREV(hdr.flalgn);
  46. // _WINREV(hdr.flpntr);
  47. _WINREV(hdr.clstyp);
  48. _WINREV(hdr.length);
  49. _WINREV(hdr.nmem);
  50. _WINREV(hdr.kmem);
  51. _WINREV(hdr.lanchr);
  52. _WINREV(hdr.supid);
  53. _WINREV(hdr.hdrpos);
  54. _WINREV(hdr.sihdr);
  55. _WINREV(hdr.timeid);
  56. _WINREV(hdr.suptyp);
  57. _WINREV(hdr.maxmrk);
  58. _WINREV(hdr.namlen);
  59. _WINREV(hdr.xflmod);
  60. _WINREV(hdr.defrel);
  61. _WINREV(hdr.hghtrn);
  62. _WINREV(hdr.hdrseq);
  63. _WINREV(hdr.tstamp);
  64. _WINREV(hdr.rs3[0]);
  65. _WINREV(hdr.rs3[1]);
  66. _WINREV(hdr.rs3[2]);
  67. _WINREV(hdr.fposOffset);
  68. _WINREV(hdr.fileSize);
  69. _WINREV(hdr.nodeKeyLength);
  70. _WINREV(hdr.version);
  71. _WINREV(hdr.blobHead);
  72. _WINREV(hdr.metadataHead);
  73. }
  74. inline void swap(NodeHdr &hdr)
  75. {
  76. _WINREV(hdr.rightSib);
  77. _WINREV(hdr.leftSib);
  78. _WINREV(hdr.numKeys);
  79. _WINREV(hdr.keyBytes);
  80. _WINREV(hdr.crc32);
  81. // _WINREV(hdr.memNumber);
  82. // _WINREV(hdr.leafFlag);
  83. }
  84. //---------------------------------------------------------------------------
  85. static unsigned long crc_32_tab[] = { /* CRC polynomial 0xedb88320 */
  86. 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L, 0x706af48fL,
  87. 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L, 0xe0d5e91eL, 0x97d2d988L,
  88. 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L, 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L,
  89. 0xf3b97148L, 0x84be41deL, 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L,
  90. 0x136c9856L, 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
  91. 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L, 0xa2677172L,
  92. 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL, 0x35b5a8faL, 0x42b2986cL,
  93. 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L, 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L,
  94. 0x26d930acL, 0x51de003aL, 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L,
  95. 0xcfba9599L, 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
  96. 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L, 0x01db7106L,
  97. 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL, 0x9fbfe4a5L, 0xe8b8d433L,
  98. 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL, 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL,
  99. 0x91646c97L, 0xe6635c01L, 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL,
  100. 0x6c0695edL, 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
  101. 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L, 0xfbd44c65L,
  102. 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L, 0x4adfa541L, 0x3dd895d7L,
  103. 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL, 0x346ed9fcL, 0xad678846L, 0xda60b8d0L,
  104. 0x44042d73L, 0x33031de5L, 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL,
  105. 0xbe0b1010L, 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
  106. 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L, 0x2eb40d81L,
  107. 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L, 0x03b6e20cL, 0x74b1d29aL,
  108. 0xead54739L, 0x9dd277afL, 0x04db2615L, 0x73dc1683L, 0xe3630b12L, 0x94643b84L,
  109. 0x0d6d6a3eL, 0x7a6a5aa8L, 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L,
  110. 0xf00f9344L, 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
  111. 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL, 0x67dd4accL,
  112. 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L, 0xd6d6a3e8L, 0xa1d1937eL,
  113. 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L, 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL,
  114. 0xd80d2bdaL, 0xaf0a1b4cL, 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L,
  115. 0x316e8eefL, 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
  116. 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL, 0xb2bd0b28L,
  117. 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L, 0x2cd99e8bL, 0x5bdeae1dL,
  118. 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL, 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL,
  119. 0x72076785L, 0x05005713L, 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L,
  120. 0x92d28e9bL, 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
  121. 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L, 0x18b74777L,
  122. 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL, 0x8f659effL, 0xf862ae69L,
  123. 0x616bffd3L, 0x166ccf45L, 0xa00ae278L, 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L,
  124. 0xa7672661L, 0xd06016f7L, 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL,
  125. 0x40df0b66L, 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
  126. 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L, 0xcdd70693L,
  127. 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L, 0x5d681b02L, 0x2a6f2b94L,
  128. 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL, 0x2d02ef8dL
  129. };
  130. #define UPDC32(octet, crc) (crc_32_tab[((crc) ^ (octet)) & 0xff] ^ ((crc) >> 8))
  131. unsigned long mcrc32(const char *buf, unsigned len, unsigned long crc)
  132. {
  133. unsigned char c;
  134. while(len >= 12)
  135. {
  136. c = *buf++; crc = UPDC32(c,crc);
  137. c = *buf++; crc = UPDC32(c,crc);
  138. c = *buf++; crc = UPDC32(c,crc);
  139. c = *buf++; crc = UPDC32(c,crc);
  140. len -= 4;
  141. }
  142. switch (len)
  143. {
  144. case 11: c = *buf++; crc = UPDC32(c,crc);
  145. case 10: c = *buf++; crc = UPDC32(c,crc);
  146. case 9: c = *buf++; crc = UPDC32(c,crc);
  147. case 8: c = *buf++; crc = UPDC32(c,crc);
  148. case 7: c = *buf++; crc = UPDC32(c,crc);
  149. case 6: c = *buf++; crc = UPDC32(c,crc);
  150. case 5: c = *buf++; crc = UPDC32(c,crc);
  151. case 4: c = *buf++; crc = UPDC32(c,crc);
  152. case 3: c = *buf++; crc = UPDC32(c,crc);
  153. case 2: c = *buf++; crc = UPDC32(c,crc);
  154. case 1: c = *buf++; crc = UPDC32(c,crc);
  155. }
  156. return(crc);
  157. }
  158. void noteError(offset_t offset, const char *format, ...) __attribute__((format(printf, 2, 3)));
  159. void noteError(offset_t offset, const char *format, ...)
  160. {
  161. va_list arg;
  162. va_start(arg, format);
  163. fprintf(stderr, "%s: ", curFileName);
  164. if (offset)
  165. fprintf(stderr, "%" I64F "x: ", offset);
  166. vfprintf(stderr, format, arg);
  167. va_end(arg);
  168. errors++;
  169. if (errors >= errorLimit)
  170. exit(2);
  171. }
  172. void checkNode(int f, KeyHdr &h, offset_t thisnode)
  173. {
  174. _lseeki64(f, thisnode, SEEK_SET);
  175. char *nodeData = (char *) malloc(h.nodeSize);
  176. if (!nodeData || _read(f, nodeData, h.nodeSize) != h.nodeSize)
  177. {
  178. noteError(thisnode, "Could not read node (error %d)\n", errno);
  179. }
  180. else
  181. {
  182. NodeHdr &nodeHdr = *(NodeHdr *) nodeData;
  183. swap(nodeHdr);
  184. if ( nodeHdr.rightSib > h.phyrec ||
  185. nodeHdr.leftSib > h.phyrec ||
  186. nodeHdr.rightSib % h.nodeSize ||
  187. nodeHdr.leftSib % h.nodeSize ||
  188. nodeHdr.keyBytes == 0 ||
  189. nodeHdr.keyBytes > h.nodeSize )
  190. {
  191. noteError(thisnode, "Htree: Corrupt key node detected (keyBytes==%x)\n", nodeHdr.keyBytes );
  192. }
  193. else if (nodeHdr.crc32 && checkCRC)
  194. {
  195. unsigned crc = mcrc32(nodeData+sizeof(NodeHdr), nodeHdr.keyBytes, 0);
  196. if (nodeHdr.crc32 != crc)
  197. {
  198. noteError(thisnode, "CRC error on key node (keyBytes==%x)\n", nodeHdr.keyBytes );
  199. }
  200. }
  201. }
  202. free(nodeData);
  203. }
  204. unsigned countLevels(int f, KeyHdr &h, offset_t firstnode)
  205. {
  206. _lseeki64(f, firstnode, SEEK_SET);
  207. char *nodeData = (char *) malloc(h.nodeSize);
  208. if (!nodeData || _read(f, nodeData, h.nodeSize) != h.nodeSize)
  209. {
  210. noteError(firstnode, "Could not read node (error %d)\n", errno);
  211. free(nodeData);
  212. return 0;
  213. }
  214. else
  215. {
  216. NodeHdr &nodeHdr = *(NodeHdr *) nodeData;
  217. swap(nodeHdr);
  218. if (!nodeHdr.leafFlag)
  219. {
  220. unsigned __int64 fpos = *(unsigned __int64 *) (nodeData + sizeof(nodeHdr));
  221. _WINREV(fpos);
  222. free(nodeData);
  223. return countLevels(f, h, fpos)+1;
  224. }
  225. else
  226. {
  227. free(nodeData);
  228. return 1;
  229. }
  230. }
  231. }
  232. void checkLevel(int f, KeyHdr &h, unsigned &level, offset_t firstnode)
  233. {
  234. unsigned nodecount = 0;
  235. unsigned maxExpandSize = 0;
  236. unsigned __int64 totalExpandSize = 0;
  237. unsigned __int64 reccount = 0;
  238. unsigned __int64 maxcount = 0;
  239. offset_t thisnode = firstnode;
  240. while (thisnode)
  241. {
  242. _lseeki64(f, thisnode, SEEK_SET);
  243. char *nodeData = (char *) malloc(h.nodeSize);
  244. if (!nodeData || _read(f, nodeData, h.nodeSize) != h.nodeSize)
  245. {
  246. noteError(thisnode, "Could not read node (error %d)\n", errno);
  247. free(nodeData);
  248. return;
  249. }
  250. NodeHdr &nodeHdr = *(NodeHdr *) nodeData;
  251. swap(nodeHdr);
  252. if ( nodeHdr.rightSib > h.phyrec ||
  253. nodeHdr.leftSib > h.phyrec ||
  254. nodeHdr.rightSib % h.nodeSize ||
  255. nodeHdr.leftSib % h.nodeSize ||
  256. nodeHdr.keyBytes == 0 ||
  257. nodeHdr.keyBytes > h.nodeSize )
  258. {
  259. noteError(thisnode, "Htree: Corrupt key node detected (keyBytes==%x)\n", nodeHdr.keyBytes );
  260. }
  261. else if (nodeHdr.crc32 && checkCRC)
  262. {
  263. unsigned crc = mcrc32(nodeData+sizeof(NodeHdr), nodeHdr.keyBytes, 0);
  264. if (nodeHdr.crc32 != crc)
  265. {
  266. noteError(thisnode, "CRC error on key node (keyBytes==%x)\n", nodeHdr.keyBytes );
  267. }
  268. }
  269. if (nodeHdr.leafFlag)
  270. {
  271. if (skipLeafLevel)
  272. {
  273. level++;
  274. free(nodeData);
  275. return;
  276. }
  277. if ((h.ktype & (HTREE_COMPRESSED_KEY|HTREE_QUICK_COMPRESSED_KEY))==HTREE_COMPRESSED_KEY)
  278. {
  279. unsigned expandSize;
  280. memcpy(&expandSize, nodeData+sizeof(NodeHdr)+8, 4);
  281. _WINREV(expandSize);
  282. if (expandSize > maxExpandSize)
  283. maxExpandSize = expandSize;
  284. totalExpandSize += expandSize;
  285. }
  286. }
  287. else
  288. {
  289. unsigned nodeKeyLength = h.nodeKeyLength;
  290. if (nodeKeyLength==(unsigned)-1)
  291. nodeKeyLength = h.length;
  292. unsigned expandSize = nodeKeyLength * nodeHdr.numKeys;
  293. if (expandSize > maxExpandSize)
  294. maxExpandSize = expandSize;
  295. totalExpandSize += expandSize;
  296. if (!nodecount)
  297. {
  298. unsigned __int64 fpos = *(unsigned __int64 *) (nodeData + sizeof(nodeHdr));
  299. _WINREV(fpos);
  300. checkLevel(f, h, level, fpos);
  301. }
  302. }
  303. nodecount++;
  304. reccount+= nodeHdr.numKeys;
  305. if (nodeHdr.numKeys > maxcount)
  306. maxcount = nodeHdr.numKeys;
  307. thisnode = nodeHdr.rightSib;
  308. free(nodeData);
  309. }
  310. printf("%d nodes containing %" I64F "d records expanding to %" I64F "d bytes (average %.2f per node, maximum %" I64F "d, max expand %d) at level %d\n", nodecount, reccount, totalExpandSize, (float) reccount/nodecount, maxcount, maxExpandSize, level);
  311. level++;
  312. }
  313. void usage(int exitCode)
  314. {
  315. printf("vkey [options] keyfiles\n");
  316. printf(" -crc check node crc's match\n");
  317. printf(" -node <hexoffset> only check node at specified offset\n");
  318. printf(" -noleaf skip leaf level\n");
  319. printf(" -quick just check quick stats\n");
  320. exit(exitCode);
  321. }
  322. int main(int argc, const char *argv[])
  323. {
  324. if (argc<2)
  325. usage(0);
  326. int arg = 1;
  327. while (arg < argc)
  328. {
  329. if (stricmp(argv[arg], "-crc") == 0)
  330. {
  331. checkCRC = true;
  332. }
  333. else if (stricmp(argv[arg], "-errorLimit") == 0)
  334. {
  335. ++arg;
  336. if (arg>=argc)
  337. usage(1);
  338. errorLimit = strtoul(argv[arg], NULL, 10);
  339. if (!errorLimit)
  340. errorLimit = (unsigned) -1;
  341. }
  342. else if (stricmp(argv[arg], "-node") == 0)
  343. {
  344. ++arg;
  345. if (arg>=argc)
  346. usage(1);
  347. nodeAddress = strtoul(argv[arg], NULL, 16);
  348. checkCRC = true;
  349. }
  350. else if (stricmp(argv[arg], "-noleaf") == 0)
  351. {
  352. skipLeafLevel = true;
  353. }
  354. else if (stricmp(argv[arg], "-quick") == 0)
  355. {
  356. quick = true;
  357. }
  358. else if (*argv[arg]=='-')
  359. usage(1);
  360. ++arg;
  361. }
  362. arg = 1;
  363. while (arg < argc)
  364. {
  365. if (*argv[arg]!='-')
  366. {
  367. curFileName = argv[arg];
  368. printf("Processing key file %s\n", curFileName);
  369. int f = _open(argv[arg], _O_RDONLY|_O_BINARY);
  370. if (f==-1)
  371. {
  372. noteError(0, "Could not open file\n");
  373. }
  374. else
  375. {
  376. KeyHdr h;
  377. if (_read(f, &h, sizeof(h)) != sizeof(h))
  378. {
  379. noteError(0, "Could not read key header\n");
  380. }
  381. else
  382. {
  383. SwapBigEndian(h);
  384. if (h.ktype & USE_TRAILING_HEADER)
  385. {
  386. printf("Reading trailing key header\n");
  387. lseek(f, -h.nodeSize, SEEK_END);
  388. if (_read(f, &h, sizeof(h)) != sizeof(h))
  389. {
  390. noteError(0, "Could not read trailing key header\n");
  391. }
  392. SwapBigEndian(h);
  393. }
  394. if (nodeAddress)
  395. {
  396. checkNode(f, h, nodeAddress);
  397. }
  398. else if (quick)
  399. {
  400. int levels = countLevels(f, h, h.root);
  401. printf("%d levels found\n", levels);
  402. }
  403. else
  404. {
  405. unsigned level = 0;
  406. checkLevel(f, h, level, h.root);
  407. }
  408. }
  409. _close(f);
  410. }
  411. }
  412. arg++;
  413. }
  414. return errors;
  415. }