arenas.c 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415
  1. #include "stdinc.h"
  2. #include "dat.h"
  3. #include "fns.h"
  4. typedef struct AHash AHash;
  5. /*
  6. * hash table for finding arena's based on their names.
  7. */
  8. struct AHash
  9. {
  10. AHash *next;
  11. Arena *arena;
  12. };
  13. enum
  14. {
  15. AHashSize = 512
  16. };
  17. static AHash *ahash[AHashSize];
  18. static u32int
  19. hashstr(char *s)
  20. {
  21. u32int h;
  22. int c;
  23. h = 0;
  24. for(; c = *s; s++){
  25. c ^= c << 6;
  26. h += (c << 11) ^ (c >> 1);
  27. c = *s;
  28. h ^= (c << 14) + (c << 7) + (c << 4) + c;
  29. }
  30. return h;
  31. }
  32. int
  33. addarena(Arena *arena)
  34. {
  35. AHash *a;
  36. u32int h;
  37. h = hashstr(arena->name) & (AHashSize - 1);
  38. a = MK(AHash);
  39. if(a == nil)
  40. return -1;
  41. a->arena = arena;
  42. a->next = ahash[h];
  43. ahash[h] = a;
  44. return 0;
  45. }
  46. Arena*
  47. findarena(char *name)
  48. {
  49. AHash *a;
  50. u32int h;
  51. h = hashstr(name) & (AHashSize - 1);
  52. for(a = ahash[h]; a != nil; a = a->next)
  53. if(strcmp(a->arena->name, name) == 0)
  54. return a->arena;
  55. return nil;
  56. }
  57. int
  58. delarena(Arena *arena)
  59. {
  60. AHash *a, *last;
  61. u32int h;
  62. h = hashstr(arena->name) & (AHashSize - 1);
  63. last = nil;
  64. for(a = ahash[h]; a != nil; a = a->next){
  65. if(a->arena == arena){
  66. if(last != nil)
  67. last->next = a->next;
  68. else
  69. ahash[h] = a->next;
  70. free(a);
  71. return 0;
  72. }
  73. last = a;
  74. }
  75. return -1;
  76. }
  77. ArenaPart*
  78. initarenapart(Part *part)
  79. {
  80. AMapN amn;
  81. ArenaPart *ap;
  82. ZBlock *b;
  83. u32int i;
  84. int ok;
  85. b = alloczblock(HeadSize, 0, 0);
  86. if(b == nil || readpart(part, PartBlank, b->data, HeadSize) < 0){
  87. seterr(EAdmin, "can't read arena partition header: %r");
  88. return nil;
  89. }
  90. ap = MKZ(ArenaPart);
  91. if(ap == nil){
  92. freezblock(b);
  93. return nil;
  94. }
  95. ap->part = part;
  96. ok = unpackarenapart(ap, b->data);
  97. freezblock(b);
  98. if(ok < 0){
  99. freearenapart(ap, 0);
  100. return nil;
  101. }
  102. ap->tabbase = (PartBlank + HeadSize + ap->blocksize - 1) & ~(ap->blocksize - 1);
  103. if(ap->version != ArenaPartVersion){
  104. seterr(ECorrupt, "unknown arena partition version %d", ap->version);
  105. freearenapart(ap, 0);
  106. return nil;
  107. }
  108. if(ap->blocksize & (ap->blocksize - 1)){
  109. seterr(ECorrupt, "illegal non-power-of-2 block size %d\n", ap->blocksize);
  110. freearenapart(ap, 0);
  111. return nil;
  112. }
  113. if(ap->tabbase >= ap->arenabase){
  114. seterr(ECorrupt, "arena partition table overlaps with arena storage");
  115. freearenapart(ap, 0);
  116. return nil;
  117. }
  118. ap->tabsize = ap->arenabase - ap->tabbase;
  119. partblocksize(part, ap->blocksize);
  120. ap->size = ap->part->size & ~(u64int)(ap->blocksize - 1);
  121. if(readarenamap(&amn, part, ap->tabbase, ap->tabsize) < 0){
  122. freearenapart(ap, 0);
  123. return nil;
  124. }
  125. ap->narenas = amn.n;
  126. ap->map = amn.map;
  127. if(okamap(ap->map, ap->narenas, ap->arenabase, ap->size, "arena table") < 0){
  128. freearenapart(ap, 0);
  129. return nil;
  130. }
  131. ap->arenas = MKNZ(Arena*, ap->narenas);
  132. for(i = 0; i < ap->narenas; i++){
  133. ap->arenas[i] = initarena(part, ap->map[i].start, ap->map[i].stop - ap->map[i].start, ap->blocksize);
  134. if(ap->arenas[i] == nil){
  135. seterr(ECorrupt, "%s: %r", ap->map[i].name);
  136. freearenapart(ap, 1);
  137. return nil;
  138. }
  139. if(namecmp(ap->map[i].name, ap->arenas[i]->name) != 0){
  140. seterr(ECorrupt, "arena name mismatches with expected name: %s vs. %s",
  141. ap->map[i].name, ap->arenas[i]->name);
  142. freearenapart(ap, 1);
  143. return nil;
  144. }
  145. if(findarena(ap->arenas[i]->name)){
  146. seterr(ECorrupt, "duplicate arena name %s in %s",
  147. ap->map[i].name, ap->part->name);
  148. freearenapart(ap, 1);
  149. return nil;
  150. }
  151. }
  152. for(i = 0; i < ap->narenas; i++)
  153. addarena(ap->arenas[i]);
  154. return ap;
  155. }
  156. ArenaPart*
  157. newarenapart(Part *part, u32int blocksize, u32int tabsize)
  158. {
  159. ArenaPart *ap;
  160. if(blocksize & (blocksize - 1)){
  161. seterr(ECorrupt, "illegal non-power-of-2 block size %d\n", blocksize);
  162. return nil;
  163. }
  164. ap = MKZ(ArenaPart);
  165. if(ap == nil)
  166. return nil;
  167. ap->version = ArenaPartVersion;
  168. ap->part = part;
  169. ap->blocksize = blocksize;
  170. partblocksize(part, blocksize);
  171. ap->size = part->size & ~(u64int)(blocksize - 1);
  172. ap->tabbase = (PartBlank + HeadSize + blocksize - 1) & ~(blocksize - 1);
  173. ap->arenabase = (ap->tabbase + tabsize + blocksize - 1) & ~(blocksize - 1);
  174. ap->tabsize = ap->arenabase - ap->tabbase;
  175. ap->narenas = 0;
  176. if(wbarenapart(ap) < 0){
  177. freearenapart(ap, 0);
  178. return nil;
  179. }
  180. return ap;
  181. }
  182. int
  183. wbarenapart(ArenaPart *ap)
  184. {
  185. ZBlock *b;
  186. if(okamap(ap->map, ap->narenas, ap->arenabase, ap->size, "arena table") < 0)
  187. return -1;
  188. b = alloczblock(HeadSize, 1, 0);
  189. if(b == nil)
  190. /* ZZZ set error message? */
  191. return -1;
  192. if(packarenapart(ap, b->data) < 0){
  193. seterr(ECorrupt, "can't make arena partition header: %r");
  194. freezblock(b);
  195. return -1;
  196. }
  197. if(writepart(ap->part, PartBlank, b->data, HeadSize) < 0 ||
  198. flushpart(ap->part) < 0){
  199. seterr(EAdmin, "can't write arena partition header: %r");
  200. freezblock(b);
  201. return -1;
  202. }
  203. freezblock(b);
  204. return wbarenamap(ap->map, ap->narenas, ap->part, ap->tabbase, ap->tabsize);
  205. }
  206. void
  207. freearenapart(ArenaPart *ap, int freearenas)
  208. {
  209. int i;
  210. if(ap == nil)
  211. return;
  212. if(freearenas){
  213. for(i = 0; i < ap->narenas; i++){
  214. if(ap->arenas[i] == nil)
  215. continue;
  216. delarena(ap->arenas[i]);
  217. freearena(ap->arenas[i]);
  218. }
  219. }
  220. free(ap->map);
  221. free(ap->arenas);
  222. free(ap);
  223. }
  224. int
  225. okamap(AMap *am, int n, u64int start, u64int stop, char *what)
  226. {
  227. u64int last;
  228. u32int i;
  229. last = start;
  230. for(i = 0; i < n; i++){
  231. if(am[i].start < last){
  232. if(i == 0)
  233. seterr(ECorrupt, "invalid start address in %s", what);
  234. else
  235. seterr(ECorrupt, "overlapping ranges in %s", what);
  236. return -1;
  237. }
  238. if(am[i].stop < am[i].start){
  239. seterr(ECorrupt, "invalid range in %s", what);
  240. return -1;
  241. }
  242. last = am[i].stop;
  243. }
  244. if(last > stop){
  245. seterr(ECorrupt, "invalid ending address in %s", what);
  246. return -1;
  247. }
  248. return 0;
  249. }
  250. int
  251. maparenas(AMap *am, Arena **arenas, int n, char *what)
  252. {
  253. u32int i;
  254. for(i = 0; i < n; i++){
  255. arenas[i] = findarena(am[i].name);
  256. if(arenas[i] == nil){
  257. seterr(EAdmin, "can't find arena '%s' for '%s'\n", am[i].name, what);
  258. return -1;
  259. }
  260. }
  261. return 0;
  262. }
  263. int
  264. readarenamap(AMapN *amn, Part *part, u64int base, u32int size)
  265. {
  266. IFile f;
  267. u32int ok;
  268. if(partifile(&f, part, base, size) < 0)
  269. return -1;
  270. ok = parseamap(&f, amn);
  271. freeifile(&f);
  272. return ok;
  273. }
  274. int
  275. wbarenamap(AMap *am, int n, Part *part, u64int base, u64int size)
  276. {
  277. Fmt f;
  278. ZBlock *b;
  279. b = alloczblock(size, 1, part->blocksize);
  280. if(b == nil)
  281. return -1;
  282. fmtzbinit(&f, b);
  283. if(outputamap(&f, am, n) < 0){
  284. seterr(ECorrupt, "arena set size too small");
  285. freezblock(b);
  286. return -1;
  287. }
  288. if(writepart(part, base, b->data, size) < 0 || flushpart(part) < 0){
  289. seterr(EAdmin, "can't write arena set: %r");
  290. freezblock(b);
  291. return -1;
  292. }
  293. freezblock(b);
  294. return 0;
  295. }
  296. /*
  297. * amap: n '\n' amapelem * n
  298. * n: u32int
  299. * amapelem: name '\t' astart '\t' astop '\n'
  300. * astart, astop: u64int
  301. */
  302. int
  303. parseamap(IFile *f, AMapN *amn)
  304. {
  305. AMap *am;
  306. u64int v64;
  307. u32int v;
  308. char *s, *t, *flds[4];
  309. int i, n;
  310. /*
  311. * arenas
  312. */
  313. if(ifileu32int(f, &v) < 0){
  314. seterr(ECorrupt, "syntax error: bad number of elements in %s", f->name);
  315. return -1;
  316. }
  317. n = v;
  318. if(n > MaxAMap){
  319. seterr(ECorrupt, "illegal number of elements in %s", f->name);
  320. return -1;
  321. }
  322. am = MKNZ(AMap, n);
  323. if(am == nil){
  324. fprint(2, "out of memory\n");
  325. return -1;
  326. }
  327. for(i = 0; i < n; i++){
  328. s = ifileline(f);
  329. if(s)
  330. t = estrdup(s);
  331. else
  332. t = nil;
  333. if(s == nil || getfields(s, flds, 4, 0, "\t") != 3){
  334. fprint(2, "early eof after %d of %d, %s:#%d: %s\n", i, n, f->name, f->pos, t);
  335. free(t);
  336. return -1;
  337. }
  338. free(t);
  339. if(nameok(flds[0]) < 0)
  340. return -1;
  341. namecp(am[i].name, flds[0]);
  342. if(stru64int(flds[1], &v64) < 0){
  343. seterr(ECorrupt, "syntax error: bad arena base address in %s", f->name);
  344. free(am);
  345. return -1;
  346. }
  347. am[i].start = v64;
  348. if(stru64int(flds[2], &v64) < 0){
  349. seterr(ECorrupt, "syntax error: bad arena size in %s", f->name);
  350. free(am);
  351. return -1;
  352. }
  353. am[i].stop = v64;
  354. }
  355. amn->map = am;
  356. amn->n = n;
  357. return 0;
  358. }
  359. int
  360. outputamap(Fmt *f, AMap *am, int n)
  361. {
  362. int i;
  363. if(fmtprint(f, "%ud\n", n) < 0)
  364. return -1;
  365. for(i = 0; i < n; i++)
  366. if(fmtprint(f, "%s\t%llud\t%llud\n", am[i].name, am[i].start, am[i].stop) < 0)
  367. return -1;
  368. return 0;
  369. }