1*37da2899SCharles.Forsyth #include "lib9.h"
2*37da2899SCharles.Forsyth #include "fcall.h"
3*37da2899SCharles.Forsyth
4*37da2899SCharles.Forsyth uint
sizeD2M(Dir * d)5*37da2899SCharles.Forsyth sizeD2M(Dir *d)
6*37da2899SCharles.Forsyth {
7*37da2899SCharles.Forsyth char *sv[4];
8*37da2899SCharles.Forsyth int i, ns;
9*37da2899SCharles.Forsyth
10*37da2899SCharles.Forsyth sv[0] = d->name;
11*37da2899SCharles.Forsyth sv[1] = d->uid;
12*37da2899SCharles.Forsyth sv[2] = d->gid;
13*37da2899SCharles.Forsyth sv[3] = d->muid;
14*37da2899SCharles.Forsyth
15*37da2899SCharles.Forsyth ns = 0;
16*37da2899SCharles.Forsyth for(i = 0; i < 4; i++)
17*37da2899SCharles.Forsyth if(sv[i])
18*37da2899SCharles.Forsyth ns += strlen(sv[i]);
19*37da2899SCharles.Forsyth
20*37da2899SCharles.Forsyth return STATFIXLEN + ns;
21*37da2899SCharles.Forsyth }
22*37da2899SCharles.Forsyth
23*37da2899SCharles.Forsyth uint
convD2M(Dir * d,uchar * buf,uint nbuf)24*37da2899SCharles.Forsyth convD2M(Dir *d, uchar *buf, uint nbuf)
25*37da2899SCharles.Forsyth {
26*37da2899SCharles.Forsyth uchar *p, *ebuf;
27*37da2899SCharles.Forsyth char *sv[4];
28*37da2899SCharles.Forsyth int i, ns, nsv[4], ss;
29*37da2899SCharles.Forsyth
30*37da2899SCharles.Forsyth if(nbuf < BIT16SZ)
31*37da2899SCharles.Forsyth return 0;
32*37da2899SCharles.Forsyth
33*37da2899SCharles.Forsyth p = buf;
34*37da2899SCharles.Forsyth ebuf = buf + nbuf;
35*37da2899SCharles.Forsyth
36*37da2899SCharles.Forsyth sv[0] = d->name;
37*37da2899SCharles.Forsyth sv[1] = d->uid;
38*37da2899SCharles.Forsyth sv[2] = d->gid;
39*37da2899SCharles.Forsyth sv[3] = d->muid;
40*37da2899SCharles.Forsyth
41*37da2899SCharles.Forsyth ns = 0;
42*37da2899SCharles.Forsyth for(i = 0; i < 4; i++){
43*37da2899SCharles.Forsyth if(sv[i])
44*37da2899SCharles.Forsyth nsv[i] = strlen(sv[i]);
45*37da2899SCharles.Forsyth else
46*37da2899SCharles.Forsyth nsv[i] = 0;
47*37da2899SCharles.Forsyth ns += nsv[i];
48*37da2899SCharles.Forsyth }
49*37da2899SCharles.Forsyth
50*37da2899SCharles.Forsyth ss = STATFIXLEN + ns;
51*37da2899SCharles.Forsyth
52*37da2899SCharles.Forsyth /* set size befor erroring, so user can know how much is needed */
53*37da2899SCharles.Forsyth /* note that length excludes count field itself */
54*37da2899SCharles.Forsyth PBIT16(p, ss-BIT16SZ);
55*37da2899SCharles.Forsyth p += BIT16SZ;
56*37da2899SCharles.Forsyth
57*37da2899SCharles.Forsyth if(ss > nbuf)
58*37da2899SCharles.Forsyth return BIT16SZ;
59*37da2899SCharles.Forsyth
60*37da2899SCharles.Forsyth PBIT16(p, d->type);
61*37da2899SCharles.Forsyth p += BIT16SZ;
62*37da2899SCharles.Forsyth PBIT32(p, d->dev);
63*37da2899SCharles.Forsyth p += BIT32SZ;
64*37da2899SCharles.Forsyth PBIT8(p, d->qid.type);
65*37da2899SCharles.Forsyth p += BIT8SZ;
66*37da2899SCharles.Forsyth PBIT32(p, d->qid.vers);
67*37da2899SCharles.Forsyth p += BIT32SZ;
68*37da2899SCharles.Forsyth PBIT64(p, d->qid.path);
69*37da2899SCharles.Forsyth p += BIT64SZ;
70*37da2899SCharles.Forsyth PBIT32(p, d->mode);
71*37da2899SCharles.Forsyth p += BIT32SZ;
72*37da2899SCharles.Forsyth PBIT32(p, d->atime);
73*37da2899SCharles.Forsyth p += BIT32SZ;
74*37da2899SCharles.Forsyth PBIT32(p, d->mtime);
75*37da2899SCharles.Forsyth p += BIT32SZ;
76*37da2899SCharles.Forsyth PBIT64(p, d->length);
77*37da2899SCharles.Forsyth p += BIT64SZ;
78*37da2899SCharles.Forsyth
79*37da2899SCharles.Forsyth for(i = 0; i < 4; i++){
80*37da2899SCharles.Forsyth ns = nsv[i];
81*37da2899SCharles.Forsyth if(p + ns + BIT16SZ > ebuf)
82*37da2899SCharles.Forsyth return 0;
83*37da2899SCharles.Forsyth PBIT16(p, ns);
84*37da2899SCharles.Forsyth p += BIT16SZ;
85*37da2899SCharles.Forsyth if(ns)
86*37da2899SCharles.Forsyth memmove(p, sv[i], ns);
87*37da2899SCharles.Forsyth p += ns;
88*37da2899SCharles.Forsyth }
89*37da2899SCharles.Forsyth
90*37da2899SCharles.Forsyth if(ss != p - buf)
91*37da2899SCharles.Forsyth return 0;
92*37da2899SCharles.Forsyth
93*37da2899SCharles.Forsyth return p - buf;
94*37da2899SCharles.Forsyth }
95