arenas.c 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404
  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 0;
  41. a->arena = arena;
  42. a->next = ahash[h];
  43. ahash[h] = a;
  44. return 1;
  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 1;
  72. }
  73. last = a;
  74. }
  75. return 0;
  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);
  86. if(b == nil || !readPart(part, PartBlank, b->data, HeadSize)){
  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){
  99. setErr(ECorrupt, "corrupted arena partition header: %R");
  100. freeArenaPart(ap, 0);
  101. return nil;
  102. }
  103. ap->tabBase = (PartBlank + HeadSize + ap->blockSize - 1) & ~(ap->blockSize - 1);
  104. if(ap->version != ArenaPartVersion){
  105. setErr(ECorrupt, "unknown arena partition version %d", ap->version);
  106. freeArenaPart(ap, 0);
  107. return nil;
  108. }
  109. if(ap->blockSize & (ap->blockSize - 1)){
  110. setErr(ECorrupt, "illegal non-power-of-2 block size %d\n", ap->blockSize);
  111. freeArenaPart(ap, 0);
  112. return nil;
  113. }
  114. if(ap->tabBase >= ap->arenaBase){
  115. setErr(ECorrupt, "arena partition table overlaps with arena storage");
  116. freeArenaPart(ap, 0);
  117. return nil;
  118. }
  119. ap->tabSize = ap->arenaBase - ap->tabBase;
  120. partBlockSize(part, ap->blockSize);
  121. ap->size = ap->part->size & ~(u64int)(ap->blockSize - 1);
  122. if(!readArenaMap(&amn, part, ap->tabBase, ap->tabSize)){
  123. freeArenaPart(ap, 0);
  124. return nil;
  125. }
  126. ap->narenas = amn.n;
  127. ap->map = amn.map;
  128. if(!okAMap(ap->map, ap->narenas, ap->arenaBase, ap->size, "arena table")){
  129. freeArenaPart(ap, 0);
  130. return nil;
  131. }
  132. ap->arenas = MKNZ(Arena*, ap->narenas);
  133. for(i = 0; i < ap->narenas; i++){
  134. ap->arenas[i] = initArena(part, ap->map[i].start, ap->map[i].stop - ap->map[i].start, ap->blockSize);
  135. if(ap->arenas[i] == nil){
  136. freeArenaPart(ap, 1);
  137. return nil;
  138. }
  139. if(!nameEq(ap->map[i].name, ap->arenas[i]->name)){
  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)){
  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"))
  187. return 0;
  188. b = allocZBlock(HeadSize, 1);
  189. if(b == nil)
  190. //ZZZ set error message?
  191. return 0;
  192. if(!packArenaPart(ap, b->data)){
  193. setErr(ECorrupt, "can't make arena partition header: %R");
  194. freeZBlock(b);
  195. return 0;
  196. }
  197. if(!writePart(ap->part, PartBlank, b->data, HeadSize)){
  198. setErr(EAdmin, "can't write arena partition header: %R");
  199. freeZBlock(b);
  200. return 0;
  201. }
  202. freeZBlock(b);
  203. return wbArenaMap(ap->map, ap->narenas, ap->part, ap->tabBase, ap->tabSize);
  204. }
  205. void
  206. freeArenaPart(ArenaPart *ap, int freeArenas)
  207. {
  208. int i;
  209. if(ap == nil)
  210. return;
  211. if(freeArenas){
  212. for(i = 0; i < ap->narenas; i++){
  213. if(ap->arenas[i] == nil)
  214. continue;
  215. delArena(ap->arenas[i]);
  216. freeArena(ap->arenas[i]);
  217. }
  218. }
  219. free(ap->map);
  220. free(ap->arenas);
  221. free(ap);
  222. }
  223. int
  224. okAMap(AMap *am, int n, u64int start, u64int stop, char *what)
  225. {
  226. u64int last;
  227. u32int i;
  228. last = start;
  229. for(i = 0; i < n; i++){
  230. if(am[i].start < last){
  231. if(i == 0)
  232. setErr(ECorrupt, "invalid start address in %s", what);
  233. else
  234. setErr(ECorrupt, "overlapping ranges in %s", what);
  235. return 0;
  236. }
  237. if(am[i].stop < am[i].start){
  238. setErr(ECorrupt, "invalid range in %s", what);
  239. return 0;
  240. }
  241. last = am[i].stop;
  242. }
  243. if(last > stop){
  244. setErr(ECorrupt, "invalid ending address in %s", what);
  245. return 0;
  246. }
  247. return 1;
  248. }
  249. int
  250. mapArenas(AMap *am, Arena **arenas, int n, char *what)
  251. {
  252. u32int i;
  253. for(i = 0; i < n; i++){
  254. arenas[i] = findArena(am[i].name);
  255. if(arenas[i] == nil){
  256. setErr(EAdmin, "can't find arena '%s' for '%s'\n", am[i].name, what);
  257. return 0;
  258. }
  259. }
  260. return 1;
  261. }
  262. int
  263. readArenaMap(AMapN *amn, Part *part, u64int base, u32int size)
  264. {
  265. IFile f;
  266. u32int ok;
  267. if(!partIFile(&f, part, base, size))
  268. return 0;
  269. ok = parseAMap(&f, amn);
  270. freeIFile(&f);
  271. return ok;
  272. }
  273. int
  274. wbArenaMap(AMap *am, int n, Part *part, u64int base, u64int size)
  275. {
  276. Fmt f;
  277. ZBlock *b;
  278. b = allocZBlock(size, 1);
  279. if(b == nil)
  280. return 0;
  281. fmtZBInit(&f, b);
  282. if(!outputAMap(&f, am, n)){
  283. setErr(ECorrupt, "arena set size too small");
  284. freeZBlock(b);
  285. return 0;
  286. }
  287. if(!writePart(part, base, b->data, size)){
  288. setErr(EAdmin, "can't write arena set: %R");
  289. freeZBlock(b);
  290. return 0;
  291. }
  292. freeZBlock(b);
  293. return 1;
  294. }
  295. /*
  296. * amap: n '\n' amapelem * n
  297. * n: u32int
  298. * amapelem: name '\t' astart '\t' asize '\n'
  299. * astart, asize: u64int
  300. */
  301. int
  302. parseAMap(IFile *f, AMapN *amn)
  303. {
  304. AMap *am;
  305. u64int v64;
  306. u32int v;
  307. char *s, *flds[4];
  308. int i, n;
  309. /*
  310. * arenas
  311. */
  312. if(!ifileU32Int(f, &v)){
  313. setErr(ECorrupt, "syntax error: bad number of elements in %s", f->name);
  314. return 0;
  315. }
  316. n = v;
  317. if(n > MaxAMap){
  318. setErr(ECorrupt, "illegal number of elements in %s", f->name);
  319. return 0;
  320. }
  321. am = MKNZ(AMap, n);
  322. if(am == nil)
  323. return 0;
  324. for(i = 0; i < n; i++){
  325. s = ifileLine(f);
  326. if(s == nil || getfields(s, flds, 4, 0, "\t") != 3)
  327. return 0;
  328. if(!nameOk(flds[0]))
  329. return 0;
  330. nameCp(am[i].name, flds[0]);
  331. if(!strU64Int(flds[1], &v64)){
  332. setErr(ECorrupt, "syntax error: bad arena base address in %s", f->name);
  333. free(am);
  334. return 0;
  335. }
  336. am[i].start = v64;
  337. if(!strU64Int(flds[2], &v64)){
  338. setErr(ECorrupt, "syntax error: bad arena size in %s", f->name);
  339. free(am);
  340. return 0;
  341. }
  342. am[i].stop = v64;
  343. }
  344. amn->map = am;
  345. amn->n = n;
  346. return 1;
  347. }
  348. int
  349. outputAMap(Fmt *f, AMap *am, int n)
  350. {
  351. int i;
  352. if(fmtprint(f, "%ud\n", n) < 0)
  353. return 0;
  354. for(i = 0; i < n; i++)
  355. if(fmtprint(f, "%s\t%llud\t%llud\n", am[i].name, am[i].start, am[i].stop) < 0)
  356. return 0;
  357. return 1;
  358. }