cmparenas.c 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317
  1. #include "stdinc.h"
  2. #include "dat.h"
  3. #include "fns.h"
  4. static int verbose;
  5. static int fd;
  6. static int fd1;
  7. static uchar *data;
  8. static uchar *data1;
  9. static int blocksize;
  10. static int sleepms;
  11. void
  12. usage(void)
  13. {
  14. fprint(2, "usage: cmparenas [-b blocksize] [-s ms] [-v] arenapart1 arenapart2 [name...]]\n");
  15. threadexitsall(0);
  16. }
  17. static int
  18. preadblock(int fd, uchar *buf, int n, vlong off)
  19. {
  20. int nr, m;
  21. for(nr = 0; nr < n; nr += m){
  22. m = n - nr;
  23. m = pread(fd, &buf[nr], m, off+nr);
  24. if(m <= 0){
  25. if(m == 0)
  26. werrstr("early eof");
  27. return -1;
  28. }
  29. }
  30. return 0;
  31. }
  32. static int
  33. readblock(int fd, uchar *buf, int n)
  34. {
  35. int nr, m;
  36. for(nr = 0; nr < n; nr += m){
  37. m = n - nr;
  38. m = read(fd, &buf[nr], m);
  39. if(m <= 0){
  40. if(m == 0)
  41. werrstr("early eof");
  42. return -1;
  43. }
  44. }
  45. return 0;
  46. }
  47. static int
  48. printheader(char *name, ArenaHead *head, int fd)
  49. {
  50. Arena arena;
  51. vlong baseoff, lo, hi, off;
  52. int clumpmax;
  53. off = seek(fd, 0, 1);
  54. seek(fd, off + head->size - head->blocksize, 0);
  55. if(readblock(fd, data, head->blocksize) < 0){
  56. fprint(2, "%s: reading arena tail: %r\n", name);
  57. return -1;
  58. }
  59. seek(fd, off, 0);
  60. memset(&arena, 0, sizeof arena);
  61. if(unpackarena(&arena, data) < 0){
  62. fprint(2, "%s: unpack arena tail: %r\n", name);
  63. return -1;
  64. }
  65. arena.blocksize = head->blocksize;
  66. arena.base = off + head->blocksize;
  67. arena.clumpmax = arena.blocksize / ClumpInfoSize;
  68. arena.size = head->size - 2*head->blocksize;
  69. fprint(2, "%s: base=%llx size=%llx blocksize=%x\n", name, off, head->size, head->blocksize);
  70. baseoff = head->blocksize;
  71. fprint(2, "\t%llx-%llx: head\n", (vlong)0, baseoff);
  72. lo = baseoff;
  73. hi = baseoff + arena.diskstats.used;
  74. fprint(2, "\t%llx-%llx: data (%llx)\n", lo, hi, hi - lo);
  75. hi = head->size - head->blocksize;
  76. clumpmax = head->blocksize / ClumpInfoSize;
  77. if(clumpmax > 0)
  78. lo = hi - (u64int)arena.diskstats.clumps/clumpmax * head->blocksize;
  79. else
  80. lo = hi;
  81. fprint(2, "\t%llx-%llx: clumps (%llx)\n", lo, hi, hi - lo);
  82. fprint(2, "\t%llx-%llx: tail\n", hi, hi + head->blocksize);
  83. fprint(2, "arena:\n");
  84. printarena(2, &arena);
  85. return 0;
  86. }
  87. static void
  88. cmparena(char *name, vlong len)
  89. {
  90. ArenaHead head;
  91. DigestState s;
  92. u64int n, e;
  93. u32int bs;
  94. int i, j;
  95. char buf[20];
  96. fprint(2, "cmp %s\n", name);
  97. memset(&s, 0, sizeof s);
  98. /*
  99. * read a little bit, which will include the header
  100. */
  101. if(readblock(fd, data, HeadSize) < 0){
  102. fprint(2, "%s: reading header: %r\n", name);
  103. return;
  104. }
  105. if(unpackarenahead(&head, data) < 0){
  106. fprint(2, "%s: corrupt arena header: %r\n", name);
  107. return;
  108. }
  109. if(head.version != ArenaVersion4 && head.version != ArenaVersion5)
  110. fprint(2, "%s: warning: unknown arena version %d\n", name, head.version);
  111. if(len != 0 && len != head.size)
  112. fprint(2, "%s: warning: unexpected length %lld != %lld\n", name, head.size, len);
  113. if(strcmp(name, "<stdin>") != 0 && strcmp(head.name, name) != 0)
  114. fprint(2, "%s: warning: unexpected name %s\n", name, head.name);
  115. if(readblock(fd1, data1, HeadSize) < 0){
  116. fprint(2, "%s: reading header: %r\n", name);
  117. return;
  118. }
  119. if(unpackarenahead(&head, data) < 0){
  120. fprint(2, "%s: corrupt arena header: %r\n", name);
  121. return;
  122. }
  123. if(head.version != ArenaVersion4 && head.version != ArenaVersion5)
  124. fprint(2, "%s: warning: unknown arena version %d\n", name, head.version);
  125. if(len != 0 && len != head.size)
  126. fprint(2, "%s: warning: unexpected length %lld != %lld\n", name, head.size, len);
  127. if(strcmp(name, "<stdin>") != 0 && strcmp(head.name, name) != 0)
  128. fprint(2, "%s: warning: unexpected name %s\n", name, head.name);
  129. seek(fd, -HeadSize, 1);
  130. seek(fd1, -HeadSize, 1);
  131. if(printheader(name, &head, fd) < 0)
  132. return;
  133. /*
  134. * now we know how much to read
  135. * read everything but the last block, which is special
  136. */
  137. e = head.size;
  138. bs = blocksize;
  139. for(n = 0; n < e; n += bs){
  140. if(n + bs > e)
  141. bs = e - n;
  142. if(readblock(fd, data, bs) < 0){
  143. fprint(2, "%s: read data: %r\n", name);
  144. return;
  145. }
  146. if(readblock(fd1, data1, bs) < 0){
  147. fprint(2, "%s: read data: %r\n", name);
  148. return;
  149. }
  150. if(memcmp(data, data1, bs) != 0){
  151. print("mismatch at %llx\n", n);
  152. for(i=0; i<bs; i+=16){
  153. if(memcmp(data+i, data1+i, 16) != 0){
  154. snprint(buf, sizeof buf, "%llx", n+i);
  155. print("%s ", buf);
  156. for(j=0; j<16; j++){
  157. print(" %.2ux", data[i+j]);
  158. if(j == 7)
  159. print(" -");
  160. }
  161. print("\n");
  162. print("%*s ", (int)strlen(buf), "");
  163. for(j=0; j<16; j++){
  164. print(" %.2ux", data1[i+j]);
  165. if(j == 7)
  166. print(" -");
  167. }
  168. print("\n");
  169. }
  170. }
  171. }
  172. }
  173. }
  174. static int
  175. shouldcheck(char *name, char **s, int n)
  176. {
  177. int i;
  178. if(n == 0)
  179. return 1;
  180. for(i=0; i<n; i++){
  181. if(s[i] && strcmp(name, s[i]) == 0){
  182. s[i] = nil;
  183. return 1;
  184. }
  185. }
  186. return 0;
  187. }
  188. char *
  189. readap(int fd, ArenaPart *ap)
  190. {
  191. char *table;
  192. if(preadblock(fd, data, 8192, PartBlank) < 0)
  193. sysfatal("read arena part header: %r");
  194. if(unpackarenapart(ap, data) < 0)
  195. sysfatal("corrupted arena part header: %r");
  196. fprint(2, "# arena part version=%d blocksize=%d arenabase=%d\n",
  197. ap->version, ap->blocksize, ap->arenabase);
  198. ap->tabbase = (PartBlank+HeadSize+ap->blocksize-1)&~(ap->blocksize-1);
  199. ap->tabsize = ap->arenabase - ap->tabbase;
  200. table = malloc(ap->tabsize+1);
  201. if(preadblock(fd, (uchar*)table, ap->tabsize, ap->tabbase) < 0)
  202. sysfatal("reading arena part directory: %r");
  203. table[ap->tabsize] = 0;
  204. return table;
  205. }
  206. void
  207. threadmain(int argc, char *argv[])
  208. {
  209. int i, nline;
  210. char *p, *q, *table, *table1, *f[10], line[256];
  211. vlong start, stop;
  212. ArenaPart ap;
  213. ArenaPart ap1;
  214. ventifmtinstall();
  215. blocksize = MaxIoSize;
  216. ARGBEGIN{
  217. case 'b':
  218. blocksize = unittoull(EARGF(usage()));
  219. break;
  220. case 's':
  221. sleepms = atoi(EARGF(usage()));
  222. break;
  223. case 'v':
  224. verbose++;
  225. break;
  226. default:
  227. usage();
  228. break;
  229. }ARGEND
  230. if(argc < 2)
  231. usage();
  232. data = vtmalloc(blocksize);
  233. data1 = vtmalloc(blocksize);
  234. if((fd = open(argv[0], OREAD)) < 0)
  235. sysfatal("open %s: %r", argv[0]);
  236. if((fd1 = open(argv[1], OREAD)) < 0)
  237. sysfatal("open %s: %r", argv[0]);
  238. table = readap(fd, &ap);
  239. table1 = readap(fd1, &ap1);
  240. if(strcmp(table, table1) != 0)
  241. sysfatal("arena partitions do not have identical tables");
  242. nline = atoi(table);
  243. p = strchr(table, '\n');
  244. if(p)
  245. p++;
  246. for(i=0; i<nline; i++){
  247. if(p == nil){
  248. fprint(2, "warning: unexpected arena table end\n");
  249. break;
  250. }
  251. q = strchr(p, '\n');
  252. if(q)
  253. *q++ = 0;
  254. if(strlen(p) >= sizeof line){
  255. fprint(2, "warning: long arena table line: %s\n", p);
  256. p = q;
  257. continue;
  258. }
  259. strcpy(line, p);
  260. memset(f, 0, sizeof f);
  261. if(tokenize(line, f, nelem(f)) < 3){
  262. fprint(2, "warning: bad arena table line: %s\n", p);
  263. p = q;
  264. continue;
  265. }
  266. p = q;
  267. if(shouldcheck(f[0], argv+1, argc-1)){
  268. start = strtoull(f[1], 0, 0);
  269. stop = strtoull(f[2], 0, 0);
  270. if(stop <= start){
  271. fprint(2, "%s: bad start,stop %lld,%lld\n", f[0], stop, start);
  272. continue;
  273. }
  274. if(seek(fd, start, 0) < 0)
  275. fprint(2, "%s: seek to start: %r\n", f[0]);
  276. if(seek(fd1, start, 0) < 0)
  277. fprint(2, "%s: seek to start: %r\n", f[0]);
  278. cmparena(f[0], stop - start);
  279. }
  280. }
  281. for(i=2; i<argc; i++)
  282. if(argv[i] != 0)
  283. fprint(2, "%s: did not find arena\n", argv[i]);
  284. threadexitsall(nil);
  285. }