arenas.c 8.6 KB

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