1 #include "stdinc.h"
2 #include "dat.h"
3 #include "fns.h"
4 
5 typedef struct AHash	AHash;
6 
7 /*
8  * hash table for finding arena's based on their names.
9  */
10 struct AHash
11 {
12 	AHash	*next;
13 	Arena	*arena;
14 };
15 
16 enum
17 {
18 	AHashSize	= 512
19 };
20 
21 static AHash	*ahash[AHashSize];
22 
23 static u32int
24 hashstr(char *s)
25 {
26 	u32int h;
27 	int c;
28 
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 }
38 
39 int
40 addarena(Arena *arena)
41 {
42 	AHash *a;
43 	u32int h;
44 
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 }
54 
55 Arena*
56 findarena(char *name)
57 {
58 	AHash *a;
59 	u32int h;
60 
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 }
67 
68 int
69 delarena(Arena *arena)
70 {
71 	AHash *a, *last;
72 	u32int h;
73 
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 }
89 
90 ArenaPart*
91 initarenapart(Part *part)
92 {
93 	AMapN amn;
94 	ArenaPart *ap;
95 	ZBlock *b;
96 	u32int i;
97 	int ok;
98 
99 	b = alloczblock(HeadSize, 0, 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;
103 	}
104 
105 	ap = MKZ(ArenaPart);
106 	if(ap == nil){
107 		freezblock(b);
108 		return nil;
109 	}
110 	ap->part = part;
111 	ok = unpackarenapart(ap, b->data);
112 	freezblock(b);
113 	if(ok < 0){
114 		freearenapart(ap, 0);
115 		return nil;
116 	}
117 
118 	ap->tabbase = (PartBlank + HeadSize + ap->blocksize - 1) & ~(ap->blocksize - 1);
119 	if(ap->version != ArenaPartVersion){
120 		seterr(ECorrupt, "unknown arena partition version %d", ap->version);
121 		freearenapart(ap, 0);
122 		return nil;
123 	}
124 	if(ap->blocksize & (ap->blocksize - 1)){
125 		seterr(ECorrupt, "illegal non-power-of-2 block size %d\n", ap->blocksize);
126 		freearenapart(ap, 0);
127 		return nil;
128 	}
129 	if(ap->tabbase >= ap->arenabase){
130 		seterr(ECorrupt, "arena partition table overlaps with arena storage");
131 		freearenapart(ap, 0);
132 		return nil;
133 	}
134 	ap->tabsize = ap->arenabase - ap->tabbase;
135 	partblocksize(part, ap->blocksize);
136 	ap->size = ap->part->size & ~(u64int)(ap->blocksize - 1);
137 
138 	if(readarenamap(&amn, part, ap->tabbase, ap->tabsize) < 0){
139 		freearenapart(ap, 0);
140 		return nil;
141 	}
142 	ap->narenas = amn.n;
143 	ap->map = amn.map;
144 	if(okamap(ap->map, ap->narenas, ap->arenabase, ap->size, "arena table") < 0){
145 		freearenapart(ap, 0);
146 		return nil;
147 	}
148 
149 	ap->arenas = MKNZ(Arena*, ap->narenas);
150 	for(i = 0; i < ap->narenas; i++){
151 		ap->arenas[i] = initarena(part, ap->map[i].start, ap->map[i].stop - ap->map[i].start, ap->blocksize);
152 		if(ap->arenas[i] == nil){
153 			seterr(ECorrupt, "%s: %r", ap->map[i].name);
154 			freearenapart(ap, 1);
155 			return nil;
156 		}
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;
162 		}
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;
168 		}
169 	}
170 
171 	for(i = 0; i < ap->narenas; i++)
172 		addarena(ap->arenas[i]);
173 
174 	return ap;
175 }
176 
177 ArenaPart*
178 newarenapart(Part *part, u32int blocksize, u32int tabsize)
179 {
180 	ArenaPart *ap;
181 
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 
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;
199 
200 	if(wbarenapart(ap) < 0){
201 		freearenapart(ap, 0);
202 		return nil;
203 	}
204 
205 	return ap;
206 }
207 
208 int
209 wbarenapart(ArenaPart *ap)
210 {
211 	ZBlock *b;
212 
213 	if(okamap(ap->map, ap->narenas, ap->arenabase, ap->size, "arena table") < 0)
214 		return -1;
215 	b = alloczblock(HeadSize, 1, 0);
216 	if(b == nil)
217 /* ZZZ set error message? */
218 		return -1;
219 
220 	if(packarenapart(ap, b->data) < 0){
221 		seterr(ECorrupt, "can't make arena partition header: %r");
222 		freezblock(b);
223 		return -1;
224 	}
225 	if(writepart(ap->part, PartBlank, b->data, HeadSize) < 0 ||
226 	   flushpart(ap->part) < 0){
227 		seterr(EAdmin, "can't write arena partition header: %r");
228 		freezblock(b);
229 		return -1;
230 	}
231 	freezblock(b);
232 
233 	return wbarenamap(ap->map, ap->narenas, ap->part, ap->tabbase, ap->tabsize);
234 }
235 
236 void
237 freearenapart(ArenaPart *ap, int freearenas)
238 {
239 	int i;
240 
241 	if(ap == nil)
242 		return;
243 	if(freearenas){
244 		for(i = 0; i < ap->narenas; i++){
245 			if(ap->arenas[i] == nil)
246 				continue;
247 			delarena(ap->arenas[i]);
248 			freearena(ap->arenas[i]);
249 		}
250 	}
251 	free(ap->map);
252 	free(ap->arenas);
253 	free(ap);
254 }
255 
256 int
257 okamap(AMap *am, int n, u64int start, u64int stop, char *what)
258 {
259 	u64int last;
260 	u32int i;
261 
262 	last = start;
263 	for(i = 0; i < n; i++){
264 		if(am[i].start < last){
265 			if(i == 0)
266 				seterr(ECorrupt, "invalid start address in %s", what);
267 			else
268 				seterr(ECorrupt, "overlapping ranges in %s", what);
269 			return -1;
270 		}
271 		if(am[i].stop < am[i].start){
272 			seterr(ECorrupt, "invalid range in %s", what);
273 			return -1;
274 		}
275 		last = am[i].stop;
276 	}
277 	if(last > stop){
278 		seterr(ECorrupt, "invalid ending address in %s", what);
279 		return -1;
280 	}
281 	return 0;
282 }
283 
284 int
285 maparenas(AMap *am, Arena **arenas, int n, char *what)
286 {
287 	u32int i;
288 
289 	for(i = 0; i < n; i++){
290 		arenas[i] = findarena(am[i].name);
291 		if(arenas[i] == nil){
292 			seterr(EAdmin, "can't find arena '%s' for '%s'\n", am[i].name, what);
293 			return -1;
294 		}
295 	}
296 	return 0;
297 }
298 
299 int
300 readarenamap(AMapN *amn, Part *part, u64int base, u32int size)
301 {
302 	IFile f;
303 	u32int ok;
304 
305 	if(partifile(&f, part, base, size) < 0)
306 		return -1;
307 	ok = parseamap(&f, amn);
308 	freeifile(&f);
309 	return ok;
310 }
311 
312 int
313 wbarenamap(AMap *am, int n, Part *part, u64int base, u64int size)
314 {
315 	Fmt f;
316 	ZBlock *b;
317 
318 	b = alloczblock(size, 1, part->blocksize);
319 	if(b == nil)
320 		return -1;
321 
322 	fmtzbinit(&f, b);
323 
324 	if(outputamap(&f, am, n) < 0){
325 		seterr(ECorrupt, "arena set size too small");
326 		freezblock(b);
327 		return -1;
328 	}
329 	if(writepart(part, base, b->data, size) < 0 || flushpart(part) < 0){
330 		seterr(EAdmin, "can't write arena set: %r");
331 		freezblock(b);
332 		return -1;
333 	}
334 	freezblock(b);
335 	return 0;
336 }
337 
338 /*
339  * amap: n '\n' amapelem * n
340  * n: u32int
341  * amapelem: name '\t' astart '\t' astop '\n'
342  * astart, astop: u64int
343  */
344 int
345 parseamap(IFile *f, AMapN *amn)
346 {
347 	AMap *am;
348 	u64int v64;
349 	u32int v;
350 	char *s, *t, *flds[4];
351 	int i, n;
352 
353 	/*
354 	 * arenas
355 	 */
356 	if(ifileu32int(f, &v) < 0){
357 		seterr(ECorrupt, "syntax error: bad number of elements in %s", f->name);
358 		return -1;
359 	}
360 	n = v;
361 	if(n > MaxAMap){
362 		seterr(ECorrupt, "illegal number of elements in %s", f->name);
363 		return -1;
364 	}
365 	am = MKNZ(AMap, n);
366 	if(am == nil){
367 		fprint(2, "out of memory\n");
368 		return -1;
369 	}
370 	for(i = 0; i < n; i++){
371 		s = ifileline(f);
372 		if(s)
373 			t = estrdup(s);
374 		else
375 			t = nil;
376 		if(s == nil || getfields(s, flds, 4, 0, "\t") != 3){
377 			fprint(2, "early eof after %d of %d, %s:#%d: %s\n", i, n, f->name, f->pos, t);
378 			free(t);
379 			return -1;
380 		}
381 		free(t);
382 		if(nameok(flds[0]) < 0)
383 			return -1;
384 		namecp(am[i].name, flds[0]);
385 		if(stru64int(flds[1], &v64) < 0){
386 			seterr(ECorrupt, "syntax error: bad arena base address in %s", f->name);
387 			free(am);
388 			return -1;
389 		}
390 		am[i].start = v64;
391 		if(stru64int(flds[2], &v64) < 0){
392 			seterr(ECorrupt, "syntax error: bad arena size in %s", f->name);
393 			free(am);
394 			return -1;
395 		}
396 		am[i].stop = v64;
397 	}
398 
399 	amn->map = am;
400 	amn->n = n;
401 	return 0;
402 }
403 
404 int
405 outputamap(Fmt *f, AMap *am, int n)
406 {
407 	int i;
408 
409 	if(fmtprint(f, "%ud\n", n) < 0)
410 		return -1;
411 	for(i = 0; i < n; i++)
412 		if(fmtprint(f, "%s\t%llud\t%llud\n", am[i].name, am[i].start, am[i].stop) < 0)
413 			return -1;
414 	return 0;
415 }