/* * a pity the code isn't also tiny... */ #include "u.h" #include "../port/lib.h" #include "mem.h" #include "dat.h" #include "fns.h" #include "../port/error.h" #include "devtab.h" enum{ Qdir, Qmedium, Maxfs= 10, /* max file systems */ Blen= 48, /* block length */ Nlen= 28, /* name length */ Dlen= Blen - 4, Tagdir= 'd', Tagdata= 'D', Tagend= 'e', Tagfree= 'f', Notapin= 0xffff, Notabno= 0xffff, Fcreating= 1, Frmonclose= 2, }; /* representation of a Tdir on medium */ typedef struct Mdir Mdir; struct Mdir { uchar type; uchar bno[2]; uchar pin[2]; char name[Nlen]; char pad[Blen - Nlen - 6]; uchar sum; }; /* representation of a Tdata/Tend on medium */ typedef struct Mdata Mdata; struct Mdata { uchar type; uchar bno[2]; char data[Dlen]; uchar sum; }; typedef struct Tfile Tfile; struct Tfile { Lock; int r; char name[NAMELEN]; ushort bno; ushort dbno; ushort pin; uchar flag; ulong length; }; typedef struct Tfs Tfs; struct Tfs { QLock; int r; Chan *c; uchar *map; int nblocks; Tfile *f; int nf; int fsize; }; struct { QLock; Tfs fs[Maxfs]; short nfs; } tinyfs; #define GETS(x) ((x)[0]|((x)[1]<<8)) #define PUTS(x, v) {(x)[0] = (v);(x)[1] = ((v)>>8);} #define GETL(x) (GETS(x)|(GETS(x+2)<<16)) #define PUTL(x, v) {PUTS(x, v);PUTS(x+2, (v)>>16)}; static uchar checksum(uchar *p) { uchar *e; uchar s; s = 0; for(e = p + Blen; p < e; p++) s += *p; return s; } static void mapclr(Tfs *fs, ulong bno) { fs->map[bno>>3] &= ~(1<<(bno&7)); } static void mapset(Tfs *fs, ulong bno) { fs->map[bno>>3] |= 1<<(bno&7); } static int isalloced(Tfs *fs, ulong bno) { return fs->map[bno>>3] & (1<<(bno&7)); } static int mapalloc(Tfs *fs) { int i, j, lim; uchar x; qlock(fs); lim = (fs->nblocks + 8 - 1)/8; for(i = 0; i < lim; i++){ x = fs->map[i]; if(x == 0xff) continue; for(j = 0; j < 8; j++) if((x & (1<map[i] = x|(1<bno); if(x >= fs->nblocks) return 0; return md; } static Mdata* validdata(Tfs *fs, uchar *p) { Mdata *md; ulong x; if(checksum(p) != 0) return 0; md = (Mdir*)p; switch(buf[0]){ case Tagdata: x = GETS(md->bno); if(x >= fs->nblocks) return 0; break; case Tagend: x = GETS(md->bno); if(x > Blen - 4) return 0; break; } return md; } static Mdata* readdata(Tfs *fs, ulong bno, uchar *buf) { if(bno >= fs->nblocks) return 0; n = devtab[fs->c->type].read(fs->c, buf, Blen, Blen*bno); if(n != Blen) return 0; return validdata(fs, buf); } static int writedir(Tfs *fs, Tfile *f) { Mdir *md; int n; uchar buf[Blen]; if(f->bno == Notabno) return Blen; md = (Mdir*)buf; memset(buf, 0, Blen); md->type = Tagdir; strncpy(md->name, f->name, sizeof(md->name)-1); PUTS(md->bno, f->dbno); PUTS(md->pin, f->pin); f->sum = 0 - checksum(buf); return devtab[fs->c->type].write(fs->c, buf, Blen, Blen*f->bno); } static void freefile(Tfs *fs, Tfile *f, ulong bend) { uchar buf[Blen]; ulong bno; int n; Mdata *md; /* remove blocks from map */ bno = f->dbno; while(bno != bend && bno != Notabno){ mapclr(fs, bno); n = devtab[fs->c->type].read(fs->c, buf, Blen, Blen*bno); if(n != Blen) break; md = validdata(buf); if(md == 0) break; if(md->type == Tagend) break; bno = GETS(md->bno); } /* change file type to free on medium */ if(f->bno != Notabno){ n = devtab[fs->c->type].read(fs->c, buf, Blen, Blen*f->bno); if(n != Blen) return; buf[0] = Tagfree; devtab[fs->c->type].write(fs->c, buf, Blen, Blen*f->bno); } /* forget we ever knew about it */ memset(f, 0, sizeof(*f)); } static void expand(Tfs *fs) { Tfile *f; fs->fsize += 8; f = smalloc(fs->fsize*sizeof(*f)); memmove(f, fs->f, fs->nf*sizoef(f)); free(fs->f); fs->f = f; } static Tfile* newfile(Tfs *fs, char *name) { int i; Tfile *f; /* find free entry in file table */ for(;;) { for(i = 0; i < fs->fsize; i++){ f = &fs->f[i]; if(f->name[0] == 0){ strncpy(f->name, name, sizeof(f->name)-1); break; } } if(i < fs->fsize) break; expand(fs); } f->flag = Fcreating; f->dbno = Notabno; f->bno = mapalloc(fs); /* write directory block */ if(waserror()){ filefree(fs, f, Notabno); nexterror(); } if(b->bno == Notabno) error("out of space"); writedir(fs, f); poperror(); return f; } /* * Read the whole medium and build a file table and used * block bitmap. Inconsistent files are purged. */ static void fsinit(Tfs *fs) { uchar buf[Blen+DIRLEN]; Dir d; ulong x, bno; int n; Tfile *f; Mdir *mdir; Mdata *mdat; devtab[fs->c->type].stat(fs->c, buf); convM2D(buf, &d); fs->nblocks = d.length/Blen; if(fs->nblocks < 3) error("tinyfs medium too small"); /* bitmap for block usage */ x = (fs->nblocks + 8 - 1)/8; fs->map = smalloc(x); memset(fs->map, 0x0, x); for(bno = fs->nblocks; bno < x*8; bno++) mapset(fs, bno); /* find files */ for(bno = 0; bno < fs->nblocks; bno++){ n = devtab[fs->c->type].read(fs->c, buf, Blen, Blen*bno); if(n != Blen) break; mdir = validdir(buf); if(mdir == 0) continue; if(fs->nfs <= fs->fsize) expand(fs); f = &fs->f[fs->nf++]; x = GETS(mdir->bno); mapset(fs, bno); strncpy(f->name, mdir->name, sizeof(f->name)); f->pin = GETS(mdir->pin); f->bno = bno; f->dbno = x; } /* follow files */ for(f = fs->f; f; f = f->next){ bno = fs->dbno; for(;;) { if(isalloced(fs, bno)){ freefile(f, bno); break; } n = devtab[fs->c->type].read(fs->c, buf, Blen, Blen*bno); if(n != Blen){ freefile(fs, f, bno); break; } mdata = validdata(fs, buf); if(mdata == 0){ freefile(fs, f, bno); break; } mapset(fs, bno); switch(mdata->type){ case Tagdata: bno = GETS(mdata->bno); f->len += Dlen; break; case Tagend: f->len += GETS(mdata->bno); break; } } } } /* * single directory */ static int tinyfsgen(Chan *c, Dirtab *tab, int ntab, int i, Dir *dp) { Tfs *fs; Tfile *f; Qid qid; fs = &tinyfs.fs[c->dev]; if(i >= fs->nf) return -1; f = &fs->f[i]; qid.path = i; qid.vers = 0; devdir(c, qid, f->name, f->length, eve, 0664, dp); return 1; } void tinyfsreset(void) { if(Nlen > NAMELEN) panic("tinyfsreset"); } void tinyfsinit(void) { } Chan * tinyfsattach(char *spec) { Tfs *fs; Chan *c, *cc; int i; cc = namec((char*)arg[0], Aopen, arg[1], 0); if(waserror()){ close(cc); qunlock(&tinyfs); nexterror(); } qlock(&tinyfs); for(i = 0; i < tinyfs.nfs; i++){ fs = &tinyfs.fs[i]; if(fs && eqchan(c, fs->c)) break; } if(i < tinyfs.nfs){ qlock(fs); fs->r++; qunlock(fs); close(cc); } else { if(tinyfs.nfs >= Maxfs) error("too many tinyfs's"); fs = &tinyfs.fs[tinyfs.nfs]; memset(fs, 0, sizeof(*fs)); fs->c = cc; fs->r = 1; fsinit(fs); tinyfs.nfs++; } qunlock(&tinyfs); poperror(); c = devattach('U', spec); c->dev = fs - tinyfs.fs; c->qid.path = CHDIR; c->qid.vers = 0; return c; } Chan * tinyfsclone(Chan *c, Chan *nc) { qlock(fs); fs->r++; qunlock(fs); return devclone(c, nc); } int tinyfswalk(Chan *c, char *name) { int n; qlock(fs); n = devwalk(c, name, 0, 0, tinyfsgen); if(n != 0 && c->qid.path != CHDIR){ fs = &tinyfs.fs[c->dev]; fs->f[c->qid.path].r++; } qunlock(fs); return n; } void tinyfsstat(Chan *c, char *db) { devstat(c, db, 0, 0, tinyfsgen); } Chan * tinyfsopen(Chan *c, int omode) { Tfs *fs; Tfile *f; fs = &tinyfs.fs[c->dev]; if(c->path & CHDIR){ if(omode != OREAD) error(Eperm); } else { qlock(fs); if(omode == (OTRUNC|ORDWR)){ f = newfile(fs, fs->f[c->qid.path]); c->qid.path = f - fs->f; } else if(omode != OREAD){ qunlock(fs); error(Eperm); } qunlock(fs); } return devopen(c, omode, 0, 0, tinyfsgen); } void tinyfscreate(Chan *c, char *name, int omode, ulong perm) { Tfs *fs; Tfile *f; if(perm & CHDIR) error("directory creation illegal"); qlock(fs); f = newfile(fs, name); qunlock(fs); c->qid.path = f - fs->f; c->qid.vers = 0; c->mode = openmode(omode); } void tinyfsremove(Chan *c) { USED(c); error(Eperm); } void tinyfswstat(Chan *c, char *dp) { USED(c, dp); error(Eperm); } void tinyfsclose(Chan *c) { Tfs *fs, **l; Tfile *f, *nf; int i; fs = c->aux; qlock(fs); /* dereference file and remove old versions */ if(c->qid.path != CHDIR){ f = &fs->f[c->qid.path]; f->r--; if(f->r == 0){ if(f->creating){ /* remove all other files with this name */ for(i = 0; i < fs->fsize; i++){ nf = &fs->f[i]; if(f == nf) continue; if(strcmp(nf->name, f->name) == 0){ if(nf->r) nf->flag |= Frmonclose; else freefile(fs, nf, Notabno); } } f->flag &= ~(Frmonclose|Fcreating); } if(f->flag & Frmonclose){ freefile(fs, f, Notabno); } } /* dereference fs and remove on zero refs */ fs->r--; unlock(fs); qlock(&tinyfs); if(fs->ref == 0){ for(l = &fs->l; *l;){ if(*l == fs){ *l = fs->next; break; } l = &(*l)->next; } free(fs-f); free(fs->map); close(fs->c); memset(fs, 0, sizeof(*fs)); } qunlock(&tinyfs); } long tinyfsread(Chan *c, void *a, long n, ulong offset) { Tfs *fs; Tfile *f; int sofar, i; ulong bno, tbno; Mdata *md; uchar buf[Blen]; if(c->qid.path & CHDIR) return devdirread(c, a, n, tinyfstab, Ntinyfstab, tinyfsgen); fs = tinyfs.fs[c->dev]; f = &fs->f[c->qid.path]; if(offset >= f->length) return 0; if(n + offset >= f->length) n = f->length - offset; /* walk to first data block */ bno = f->dbno; for(sofar = 0; sofar < offset; sofar += Blen){ md = readdata(fs, bno, buf); if(md == 0) error(Eio); bno = GETS(md->bno); } /* read first block */ i = offset%Blen; /* read data */ for(sofar = 0; sofar+Blen < offset; sofar += Blen){ return n; } Block* tinyfsbread(Chan *c, long n, ulong offset) { return devbread(c, n, offset); } long tinyfswrite(Chan *c, char *a, long n, ulong offset) { if(waserror()){ qunlock(&tinyfs); nexterror(); } qlock(&tinyfs); qunlock(&tinyfs); switch(c->qid.path & ~CHDIR){ case Qdata: break; default: error(Ebadusefd); } return n; } long tinyfsbwrite(Chan *c, Block *bp, ulong offset) { return devbwrite(c, bp, offset); }