ref: 3071c38b16cda2e1b5947ea28f64e4fd182250db
dir: /user.c/
#include <u.h>
#include <libc.h>
#include <fcall.h>
#include <avl.h>
#include <bio.h>
#include "dat.h"
#include "fns.h"
typedef struct User User;
char *defaultusers =
"-1:adm::\n"
"0:none::\n"
"1:tor:tor:\n"
"2:glenda:glenda:\n"
"10000:sys::\n"
"10001:map:map:\n"
"10002:doc::\n"
"10003:upas:upas:\n"
"10004:font::\n"
"10005:bootes:bootes:\n";
static int
walk1(Tree *t, vlong up, char *name, Qid *qid, vlong *len)
{
char *p, kbuf[Keymax], rbuf[Kvmax];
int err;
Xdir d;
Kvp kv;
Key k;
err = 0;
if((p = packdkey(kbuf, sizeof(kbuf), up, name)) == nil)
return -1;
k.k = kbuf;
k.nk = p - kbuf;
if(err)
return -1;
if(btlookup(t, &k, &kv, rbuf, sizeof(rbuf)) != nil)
return -1;
if(kv2dir(&kv, &d) == -1)
return -1;
*qid = d.qid;
*len = d.length;
return 0;
}
static char*
slurp(Tree *t, vlong path, vlong len)
{
char *e, *ret, buf[Offksz], kvbuf[Offksz + Ptrsz];
vlong o;
Blk *b;
Bptr bp;
Key k;
Kvp kv;
if((ret = malloc(len + 1)) == nil)
return Enomem;
k.k = buf;
k.nk = Offksz;
for(o = 0; o < len; o += Blksz){
k.k[0] = Kdat;
PBIT64(k.k+1, path);
PBIT64(k.k+9, o);
if((e = btlookup(t, &k, &kv, kvbuf, sizeof(kvbuf))) != nil)
return e;
bp = unpackbp(kv.v, kv.nv);
if((b = getblk(bp, GBraw)) == nil)
return Eio;
if(len - o >= Blksz)
memcpy(ret + o, b->buf, Blksz);
else
memcpy(ret + o, b->buf, len - o);
}
ret[len] = 0;
return ret;
}
static char*
readline(char **p, char *buf, int nbuf)
{
char *e;
int n;
if((e = strchr(*p, '\n')) == nil)
return nil;
n = (e - *p) + 1;
if(n >= nbuf)
n = nbuf - 1;
strecpy(buf, buf + n, *p);
*p = e+1;
return buf;
}
static char*
getfield(char **p, char delim)
{
char *r;
if(*p == nil)
return nil;
r = *p;
*p = strchr(*p, delim);
if(*p != nil){
**p = '\0';
*p += 1;
}
return r;
}
User*
name2user(char *name)
{
int i;
for(i = 0; i < fs->nusers; i++)
if(strcmp(fs->users[i].name, name) == 0)
return &fs->users[i];
return nil;
}
User*
uid2user(int id)
{
int i;
for(i = 0; i < fs->nusers; i++)
if(fs->users[i].id == id)
return &fs->users[i];
return nil;
}
static char*
parseusers(int fd, char *udata)
{
char *pu, *p, *f, *m, *err, buf[8192];
int i, j, lnum, ngrp, nusers, usersz;
User *u, *n, *users;
int *g, *grp;
i = 0;
err = nil;
nusers = 0;
usersz = 8;
if((users = calloc(usersz, sizeof(User))) == nil)
return Enomem;
pu = udata;
lnum = 0;
while((p = readline(&pu, buf, sizeof(buf))) != nil){
lnum++;
if(p[0] == '#' || p[0] == 0)
continue;
if(i == usersz){
usersz *= 2;
n = realloc(users, usersz*sizeof(User));
if(n == nil){
free(users);
return Enomem;
}
users = n;
}
if((f = getfield(&p, ':')) == nil){
fprint(fd, "/adm/users:%d: missing ':' after id\n", lnum);
err = Esyntax;
goto Error;
}
users[i].id = atol(f);
if((f = getfield(&p, ':')) == nil){
fprint(fd, "/adm/users:%d: missing ':' after name\n", lnum);
err = Esyntax;
goto Error;
}
snprint(users[i].name, sizeof(users[i].name), "%s", f);
users[i].memb = nil;
users[i].nmemb = 0;
i++;
}
nusers = i;
i = 0;
pu = udata;
lnum = 0;
while((p = readline(&pu, buf, sizeof(buf))) != nil){
lnum++;
if(buf[0] == '#' || buf[0] == 0)
continue;
getfield(&p, ':'); /* skip id */
getfield(&p, ':'); /* skip name */
if((f = getfield(&p, ':')) == nil)
return Esyntax;
if(f[0] != '\0'){
u = nil;
for(j = 0; j < nusers; j++)
if(strcmp(users[j].name, f) == 0)
u = &users[j];
if(u == nil){
fprint(fd, "/adm/users:%d: leader %s does not exist\n", lnum, f);
err = Enouser;
goto Error;
}
users[i].lead = u->id;
}
if((f = getfield(&p, ':')) == nil)
return Esyntax;
grp = nil;
ngrp = 0;
while((m = getfield(&f, ',')) != nil){
if(m[0] == '\0')
continue;
u = nil;
for(j = 0; j < nusers; j++)
if(strcmp(users[j].name, m) == 0)
u = &users[j];
if(u == nil){
fprint(fd, "/adm/users:%d: user %s does not exist\n", lnum, m);
err = Enouser;
goto Error;
}
if((g = realloc(grp, (ngrp+1)*sizeof(int))) == nil){
err = Enomem;
goto Error;
}
grp = g;
grp[ngrp++] = u->id;
}
users[i].memb = grp;
users[i].nmemb = ngrp;
i++;
}
wlock(&fs->userlk);
n = fs->users;
fs->users = users;
fs->nusers = nusers;
users = n;
wunlock(&fs->userlk);
Error:
if(users != nil)
for(i = 0; i < nusers; i++)
free(users[i].memb);
free(users);
return err;
}
char*
loadusers(int fd, Tree *t)
{
char *s, *e;
vlong len;
Qid q;
s = defaultusers;
if(walk1(t, -1, "", &q, &len) == -1)
return Efs;
if(walk1(t, q.path, "adm", &q, &len) == -1)
goto Defaulted;
if(walk1(t, q.path, "users", &q, &len) == -1)
goto Defaulted;
if(q.type != QTFILE)
return Etype;
if(len >= 1*MiB)
return Efsize;
if((s = slurp(t, q.path, len)) == nil)
return Eio;
Defaulted:
e = parseusers(fd, s);
if(s != defaultusers)
free(s);
return e;
}