Blob


1 #include "stdinc.h"
2 #include "dat.h"
3 #include "fns.h"
5 typedef struct AHash AHash;
7 /*
8 * hash table for finding arena's based on their names.
9 */
10 struct AHash
11 {
12 AHash *next;
13 Arena *arena;
14 };
16 enum
17 {
18 AHashSize = 512
19 };
21 static AHash *ahash[AHashSize];
23 static u32int
24 hashstr(char *s)
25 {
26 u32int h;
27 int c;
29 h = 0;
30 for(; c = *s; s++){
31 c ^= c << 6;
32 h += (c << 11) ^ (c >> 1);
33 c = *s;
34 h ^= (c << 14) + (c << 7) + (c << 4) + c;
35 }
36 return h;
37 }
39 int
40 addarena(Arena *arena)
41 {
42 AHash *a;
43 u32int h;
45 h = hashstr(arena->name) & (AHashSize - 1);
46 a = MK(AHash);
47 if(a == nil)
48 return -1;
49 a->arena = arena;
50 a->next = ahash[h];
51 ahash[h] = a;
52 return 0;
53 }
55 Arena*
56 findarena(char *name)
57 {
58 AHash *a;
59 u32int h;
61 h = hashstr(name) & (AHashSize - 1);
62 for(a = ahash[h]; a != nil; a = a->next)
63 if(strcmp(a->arena->name, name) == 0)
64 return a->arena;
65 return nil;
66 }
68 int
69 delarena(Arena *arena)
70 {
71 AHash *a, *last;
72 u32int h;
74 h = hashstr(arena->name) & (AHashSize - 1);
75 last = nil;
76 for(a = ahash[h]; a != nil; a = a->next){
77 if(a->arena == arena){
78 if(last != nil)
79 last->next = a->next;
80 else
81 ahash[h] = a->next;
82 free(a);
83 return 0;
84 }
85 last = a;
86 }
87 return -1;
88 }
90 ArenaPart*
91 initarenapart(Part *part)
92 {
93 AMapN amn;
94 ArenaPart *ap;
95 ZBlock *b;
96 u32int i;
97 int ok;
99 b = alloczblock(HeadSize, 0);
100 if(b == nil || readpart(part, PartBlank, b->data, HeadSize) < 0){
101 seterr(EAdmin, "can't read arena partition header: %r");
102 return nil;
105 ap = MKZ(ArenaPart);
106 if(ap == nil){
107 freezblock(b);
108 return nil;
110 ap->part = part;
111 ok = unpackarenapart(ap, b->data);
112 freezblock(b);
113 if(ok < 0){
114 seterr(ECorrupt, "corrupted arena partition header: %r");
115 freearenapart(ap, 0);
116 return nil;
119 ap->tabbase = (PartBlank + HeadSize + ap->blocksize - 1) & ~(ap->blocksize - 1);
120 if(ap->version != ArenaPartVersion){
121 seterr(ECorrupt, "unknown arena partition version %d", ap->version);
122 freearenapart(ap, 0);
123 return nil;
125 if(ap->blocksize & (ap->blocksize - 1)){
126 seterr(ECorrupt, "illegal non-power-of-2 block size %d\n", ap->blocksize);
127 freearenapart(ap, 0);
128 return nil;
130 if(ap->tabbase >= ap->arenabase){
131 seterr(ECorrupt, "arena partition table overlaps with arena storage");
132 freearenapart(ap, 0);
133 return nil;
135 ap->tabsize = ap->arenabase - ap->tabbase;
136 partblocksize(part, ap->blocksize);
137 ap->size = ap->part->size & ~(u64int)(ap->blocksize - 1);
139 if(readarenamap(&amn, part, ap->tabbase, ap->tabsize) < 0){
140 freearenapart(ap, 0);
141 return nil;
143 ap->narenas = amn.n;
144 ap->map = amn.map;
145 if(okamap(ap->map, ap->narenas, ap->arenabase, ap->size, "arena table") < 0){
146 freearenapart(ap, 0);
147 return nil;
150 ap->arenas = MKNZ(Arena*, ap->narenas);
151 for(i = 0; i < ap->narenas; i++){
152 ap->arenas[i] = initarena(part, ap->map[i].start, ap->map[i].stop - ap->map[i].start, ap->blocksize);
153 if(ap->arenas[i] == nil){
154 freearenapart(ap, 1);
155 return nil;
157 if(namecmp(ap->map[i].name, ap->arenas[i]->name) != 0){
158 seterr(ECorrupt, "arena name mismatches with expected name: %s vs. %s",
159 ap->map[i].name, ap->arenas[i]->name);
160 freearenapart(ap, 1);
161 return nil;
163 if(findarena(ap->arenas[i]->name)){
164 seterr(ECorrupt, "duplicate arena name %s in %s",
165 ap->map[i].name, ap->part->name);
166 freearenapart(ap, 1);
167 return nil;
171 for(i = 0; i < ap->narenas; i++)
172 addarena(ap->arenas[i]);
174 return ap;
177 ArenaPart*
178 newarenapart(Part *part, u32int blocksize, u32int tabsize)
180 ArenaPart *ap;
182 if(blocksize & (blocksize - 1)){
183 seterr(ECorrupt, "illegal non-power-of-2 block size %d\n", blocksize);
184 return nil;
186 ap = MKZ(ArenaPart);
187 if(ap == nil)
188 return nil;
190 ap->version = ArenaPartVersion;
191 ap->part = part;
192 ap->blocksize = blocksize;
193 partblocksize(part, blocksize);
194 ap->size = part->size & ~(u64int)(blocksize - 1);
195 ap->tabbase = (PartBlank + HeadSize + blocksize - 1) & ~(blocksize - 1);
196 ap->arenabase = (ap->tabbase + tabsize + blocksize - 1) & ~(blocksize - 1);
197 ap->tabsize = ap->arenabase - ap->tabbase;
198 ap->narenas = 0;
200 if(wbarenapart(ap) < 0){
201 freearenapart(ap, 0);
202 return nil;
205 return ap;
208 int
209 wbarenapart(ArenaPart *ap)
211 ZBlock *b;
213 if(okamap(ap->map, ap->narenas, ap->arenabase, ap->size, "arena table") < 0)
214 return -1;
215 b = alloczblock(HeadSize, 1);
216 if(b == nil)
217 //ZZZ set error message?
218 return -1;
220 if(packarenapart(ap, b->data) < 0){
221 seterr(ECorrupt, "can't make arena partition header: %r");
222 freezblock(b);
223 return -1;
225 if(writepart(ap->part, PartBlank, b->data, HeadSize) < 0){
226 seterr(EAdmin, "can't write arena partition header: %r");
227 freezblock(b);
228 return -1;
230 freezblock(b);
232 return wbarenamap(ap->map, ap->narenas, ap->part, ap->tabbase, ap->tabsize);
235 void
236 freearenapart(ArenaPart *ap, int freearenas)
238 int i;
240 if(ap == nil)
241 return;
242 if(freearenas){
243 for(i = 0; i < ap->narenas; i++){
244 if(ap->arenas[i] == nil)
245 continue;
246 delarena(ap->arenas[i]);
247 freearena(ap->arenas[i]);
250 free(ap->map);
251 free(ap->arenas);
252 free(ap);
255 int
256 okamap(AMap *am, int n, u64int start, u64int stop, char *what)
258 u64int last;
259 u32int i;
261 last = start;
262 for(i = 0; i < n; i++){
263 if(am[i].start < last){
264 if(i == 0)
265 seterr(ECorrupt, "invalid start address in %s", what);
266 else
267 seterr(ECorrupt, "overlapping ranges in %s", what);
268 return -1;
270 if(am[i].stop < am[i].start){
271 seterr(ECorrupt, "invalid range in %s", what);
272 return -1;
274 last = am[i].stop;
276 if(last > stop){
277 seterr(ECorrupt, "invalid ending address in %s", what);
278 return -1;
280 return 0;
283 int
284 maparenas(AMap *am, Arena **arenas, int n, char *what)
286 u32int i;
288 for(i = 0; i < n; i++){
289 arenas[i] = findarena(am[i].name);
290 if(arenas[i] == nil){
291 seterr(EAdmin, "can't find arena '%s' for '%s'\n", am[i].name, what);
292 return -1;
295 return 0;
298 int
299 readarenamap(AMapN *amn, Part *part, u64int base, u32int size)
301 IFile f;
302 u32int ok;
304 if(partifile(&f, part, base, size) < 0)
305 return -1;
306 ok = parseamap(&f, amn);
307 freeifile(&f);
308 return ok;
311 int
312 wbarenamap(AMap *am, int n, Part *part, u64int base, u64int size)
314 Fmt f;
315 ZBlock *b;
317 b = alloczblock(size, 1);
318 if(b == nil)
319 return -1;
321 fmtzbinit(&f, b);
323 if(outputamap(&f, am, n) < 0){
324 seterr(ECorrupt, "arena set size too small");
325 freezblock(b);
326 return -1;
328 if(writepart(part, base, b->data, size) < 0){
329 seterr(EAdmin, "can't write arena set: %r");
330 freezblock(b);
331 return -1;
333 freezblock(b);
334 return 0;
337 /*
338 * amap: n '\n' amapelem * n
339 * n: u32int
340 * amapelem: name '\t' astart '\t' asize '\n'
341 * astart, asize: u64int
342 */
343 int
344 parseamap(IFile *f, AMapN *amn)
346 AMap *am;
347 u64int v64;
348 u32int v;
349 char *s, *flds[4];
350 int i, n;
352 /*
353 * arenas
354 */
355 if(ifileu32int(f, &v) < 0){
356 seterr(ECorrupt, "syntax error: bad number of elements in %s", f->name);
357 return -1;
359 n = v;
360 if(n > MaxAMap){
361 seterr(ECorrupt, "illegal number of elements in %s", f->name);
362 return -1;
364 am = MKNZ(AMap, n);
365 if(am == nil)
366 return -1;
367 for(i = 0; i < n; i++){
368 s = ifileline(f);
369 if(s == nil || getfields(s, flds, 4, 0, "\t") != 3)
370 return -1;
371 if(nameok(flds[0]) < 0)
372 return -1;
373 namecp(am[i].name, flds[0]);
374 if(stru64int(flds[1], &v64) < 0){
375 seterr(ECorrupt, "syntax error: bad arena base address in %s", f->name);
376 free(am);
377 return -1;
379 am[i].start = v64;
380 if(stru64int(flds[2], &v64) < 0){
381 seterr(ECorrupt, "syntax error: bad arena size in %s", f->name);
382 free(am);
383 return -1;
385 am[i].stop = v64;
388 amn->map = am;
389 amn->n = n;
390 return 0;
393 int
394 outputamap(Fmt *f, AMap *am, int n)
396 int i;
398 if(fmtprint(f, "%ud\n", n) < 0)
399 return -1;
400 for(i = 0; i < n; i++)
401 if(fmtprint(f, "%s\t%llud\t%llud\n", am[i].name, am[i].start, am[i].stop) < 0)
402 return -1;
403 return 0;