7 typedef struct MetaChunk MetaChunk;
15 static int stringunpack(char **s, uchar **p, int *n);
18 * integer conversion routines
20 #define U8GET(p) ((p)[0])
21 #define U16GET(p) (((p)[0]<<8)|(p)[1])
22 #define U32GET(p) (((p)[0]<<24)|((p)[1]<<16)|((p)[2]<<8)|(p)[3])
23 #define U48GET(p) (((uvlong)U16GET(p)<<32)|(uvlong)U32GET((p)+2))
24 #define U64GET(p) (((uvlong)U32GET(p)<<32)|(uvlong)U32GET((p)+4))
26 #define U8PUT(p,v) (p)[0]=(v)&0xFF
27 #define U16PUT(p,v) (p)[0]=((v)>>8)&0xFF;(p)[1]=(v)&0xFF
28 #define U32PUT(p,v) (p)[0]=((v)>>24)&0xFF;(p)[1]=((v)>>16)&0xFF;(p)[2]=((v)>>8)&0xFF;(p)[3]=(v)&0xFF
29 #define U48PUT(p,v,t32) t32=(v)>>32;U16PUT(p,t32);t32=(v);U32PUT((p)+2,t32)
30 #define U64PUT(p,v,t32) t32=(v)>>32;U32PUT(p,t32);t32=(v);U32PUT((p)+4,t32)
33 stringunpack(char **s, uchar **p, int *n)
54 stringpack(char *s, uchar *p)
66 mbunpack(MetaBlock *mb, uchar *p, int n)
74 memset(mb, 0, sizeof(MetaBlock));
79 if(magic != MetaMagic && magic != MetaMagic+1) {
80 werrstr("bad meta block magic");
83 mb->size = U16GET(p+4);
84 mb->free = U16GET(p+6);
85 mb->maxindex = U16GET(p+8);
86 mb->nindex = U16GET(p+10);
87 mb->unbotch = (magic == MetaMagic+1);
90 werrstr("bad meta block size");
97 if(n < mb->maxindex*MetaIndexSize) {
98 werrstr("truncated meta block 2");
105 mbpack(MetaBlock *mb)
111 U32PUT(p, MetaMagic);
112 U16PUT(p+4, mb->size);
113 U16PUT(p+6, mb->free);
114 U16PUT(p+8, mb->maxindex);
115 U16PUT(p+10, mb->nindex);
120 mbdelete(MetaBlock *mb, int i, MetaEntry *me)
125 assert(i < mb->nindex);
127 if(me->p - mb->buf + me->size == mb->size)
128 mb->size -= me->size;
130 mb->free += me->size;
132 p = mb->buf + MetaHeaderSize + i*MetaIndexSize;
133 n = (mb->nindex-i-1)*MetaIndexSize;
134 memmove(p, p+MetaIndexSize, n);
135 memset(p+n, 0, MetaIndexSize);
140 mbinsert(MetaBlock *mb, int i, MetaEntry *me)
145 assert(mb->nindex < mb->maxindex);
150 mb->free -= mb->size - o;
155 p = mb->buf + MetaHeaderSize + i*MetaIndexSize;
156 n = (mb->nindex-i)*MetaIndexSize;
157 memmove(p+MetaIndexSize, p, n);
158 U16PUT(p, me->p - mb->buf);
159 U16PUT(p+2, me->size);
164 meunpack(MetaEntry *me, MetaBlock *mb, int i)
169 if(i < 0 || i >= mb->nindex) {
170 werrstr("bad meta entry index");
174 p = mb->buf + MetaHeaderSize + i*MetaIndexSize;
178 if(0)print("eo = %d en = %d\n", eo, en);
179 if(eo < MetaHeaderSize + mb->maxindex*MetaIndexSize) {
180 werrstr("corrupted entry in meta block");
184 if(eo+en > mb->size) {
185 werrstr("truncated meta block");
191 /* make sure entry looks ok and includes an elem name */
192 if(en < 8 || U32GET(p) != DirMagic || en < 8 + U16GET(p+6)) {
193 werrstr("corrupted meta block entry");
203 /* assumes a small amount of checking has been done in mbentry */
205 mecmp(MetaEntry *me, char *s)
216 assert(n + 8 < me->size);
233 mecmpnew(MetaEntry *me, char *s)
244 assert(n + 8 < me->size);
261 offsetcmp(const void *s0, const void *s1)
263 const MetaChunk *mc0, *mc1;
267 if(mc0->offset < mc1->offset)
269 if(mc0->offset > mc1->offset)
275 metachunks(MetaBlock *mb)
281 mc = vtmalloc(mb->nindex*sizeof(MetaChunk));
282 p = mb->buf + MetaHeaderSize;
283 for(i = 0; i<mb->nindex; i++) {
284 mc[i].offset = U16GET(p);
285 mc[i].size = U16GET(p+2);
290 qsort(mc, mb->nindex, sizeof(MetaChunk), offsetcmp);
292 /* check block looks ok */
293 oo = MetaHeaderSize + mb->maxindex*MetaIndexSize;
296 for(i=0; i<mb->nindex; i++) {
305 if(mb->size - oo != mb->free)
315 mbcompact(MetaBlock *mb, MetaChunk *mc)
319 oo = MetaHeaderSize + mb->maxindex*MetaIndexSize;
321 for(i=0; i<mb->nindex; i++) {
325 memmove(mb->buf + oo, mb->buf + o, n);
326 U16PUT(mb->buf + MetaHeaderSize + mc[i].index*MetaIndexSize, oo);
336 mballoc(MetaBlock *mb, int n)
342 if(mb->maxsize - mb->size >= n)
343 return mb->buf + mb->size;
345 /* check if possible */
346 if(mb->maxsize - mb->size + mb->free < n)
352 o = MetaHeaderSize + mb->maxindex*MetaIndexSize;
353 for(i=0; i<mb->nindex; i++) {
354 if(mc[i].offset - o >= n) {
358 o = mc[i].offset + mc[i].size;
361 if(mb->maxsize - o >= n) {
366 /* compact and return off the end */
370 assert(mb->maxsize - mb->size >= n);
371 return mb->buf + mb->size;
375 vdsize(VacDir *dir, int version)
379 if(version < 8 || version > 9)
380 sysfatal("bad version %d in vdpack", version);
402 n += 2 + strlen(dir->elem);
403 n += 2 + strlen(dir->uid);
404 n += 2 + strlen(dir->gid);
405 n += 2 + strlen(dir->mid);
407 /* optional sections */
408 if(version < 9 && dir->plan9) {
409 n += 3 + /* option header */
414 n += 3 + /* option header */
418 if(version < 9 && dir->gen) {
419 n += 3 + /* option header */
427 vdpack(VacDir *dir, MetaEntry *me, int version)
432 if(version < 8 || version > 9)
433 sysfatal("bad version %d in vdpack", version);
438 U16PUT(p+4, version); /* version */
441 p += stringpack(dir->elem, p);
443 U32PUT(p, dir->entry);
448 U32PUT(p+4, dir->mentry);
449 U32PUT(p+8, dir->mgen);
453 U64PUT(p, dir->qid, t32);
456 p += stringpack(dir->uid, p);
457 p += stringpack(dir->gid, p);
458 p += stringpack(dir->mid, p);
460 U32PUT(p, dir->mtime);
461 U32PUT(p+4, dir->mcount);
462 U32PUT(p+8, dir->ctime);
463 U32PUT(p+12, dir->atime);
464 U32PUT(p+16, dir->mode);
467 if(dir->plan9 && version < 9) {
468 U8PUT(p, DirPlan9Entry);
471 U64PUT(p, dir->p9path, t32);
472 U32PUT(p+8, dir->p9version);
477 U8PUT(p, DirQidSpaceEntry);
480 U64PUT(p, dir->qidoffset, t32);
481 U64PUT(p+8, dir->qidmax, t32);
485 if(dir->gen && version < 9) {
486 U8PUT(p, DirGenEntry);
493 assert(p == me->p + me->size);
497 vdunpack(VacDir *dir, MetaEntry *me)
499 int t, nn, n, version;
505 memset(dir, 0, sizeof(VacDir));
508 if(n < 4 || U32GET(p) != DirMagic)
517 if(version < 7 || version > 9)
523 if(stringunpack(&dir->elem, &p, &n) < 0)
529 dir->entry = U32GET(p);
535 dir->mentry = dir->entry+1;
540 dir->gen = U32GET(p);
541 dir->mentry = U32GET(p+4);
542 dir->mgen = U32GET(p+8);
547 /* size is gotten from DirEntry */
552 dir->qid = U64GET(p);
556 /* skip replacement */
565 if(stringunpack(&dir->uid, &p, &n) < 0)
569 if(stringunpack(&dir->gid, &p, &n) < 0)
573 if(stringunpack(&dir->mid, &p, &n) < 0)
578 dir->mtime = U32GET(p);
579 dir->mcount = U32GET(p+4);
580 dir->ctime = U32GET(p+8);
581 dir->atime = U32GET(p+12);
582 dir->mode = U32GET(p+16);
586 /* optional meta data */
598 /* not valid in version >= 9 */
601 if(dir->plan9 || nn != 12)
604 dir->p9path = U64GET(p);
605 dir->p9version = U32GET(p+8);
607 dir->mcount = dir->p9version;
610 /* not valid in version >= 9 */
614 case DirQidSpaceEntry:
615 if(dir->qidspace || nn != 16)
618 dir->qidoffset = U64GET(p);
619 dir->qidmax = U64GET(p+8);
626 if(p != me->p + me->size)
637 vdcleanup(VacDir *dir)
650 vdcopy(VacDir *dst, VacDir *src)
653 dst->elem = vtstrdup(dst->elem);
654 dst->uid = vtstrdup(dst->uid);
655 dst->gid = vtstrdup(dst->gid);
656 dst->mid = vtstrdup(dst->mid);
660 mbsearch(MetaBlock *mb, char *elem, int *ri, MetaEntry *me)
665 /* binary search within block */
670 if(meunpack(me, mb, i) < 0)
673 x = mecmpnew(me, elem);
690 *ri = b; /* b is the index to insert this entry */
691 memset(me, 0, sizeof(*me));
697 mbinit(MetaBlock *mb, uchar *p, int n, int entries)
699 memset(mb, 0, sizeof(MetaBlock));
702 mb->maxindex = entries;
703 mb->size = MetaHeaderSize + mb->maxindex*MetaIndexSize;
707 mbresize(MetaBlock *mb, MetaEntry *me, int n)
717 /* try and expand entry */
719 p = me->p + me->size;
720 ep = mb->buf + mb->maxsize;
721 while(p < ep && *p == 0)