1 7285a491 2004-06-17 devnull #include <u.h>
2 7285a491 2004-06-17 devnull #include <libc.h>
3 7285a491 2004-06-17 devnull #include <bio.h>
4 7285a491 2004-06-17 devnull #include <libsec.h>
6 7285a491 2004-06-17 devnull #include "iso9660.h"
9 7285a491 2004-06-17 devnull mkdirec(Direc *direc, XDir *d)
11 7285a491 2004-06-17 devnull memset(direc, 0, sizeof(Direc));
12 7285a491 2004-06-17 devnull direc->name = atom(d->name);
13 7285a491 2004-06-17 devnull direc->uid = atom(d->uid);
14 7285a491 2004-06-17 devnull direc->gid = atom(d->gid);
15 7285a491 2004-06-17 devnull direc->uidno = d->uidno;
16 7285a491 2004-06-17 devnull direc->gidno = d->gidno;
17 7285a491 2004-06-17 devnull direc->mode = d->mode;
18 7285a491 2004-06-17 devnull direc->length = d->length;
19 7285a491 2004-06-17 devnull direc->mtime = d->mtime;
20 7285a491 2004-06-17 devnull direc->atime = d->atime;
21 7285a491 2004-06-17 devnull direc->ctime = d->ctime;
22 7285a491 2004-06-17 devnull direc->symlink = d->symlink;
25 7285a491 2004-06-17 devnull static int
26 7285a491 2004-06-17 devnull strecmp(char *a, char *ea, char *b)
30 7285a491 2004-06-17 devnull if((r = strncmp(a, b, ea-a)) != 0)
31 7285a491 2004-06-17 devnull return r;
33 7285a491 2004-06-17 devnull if(b[ea-a] == '\0')
34 7285a491 2004-06-17 devnull return 0;
35 7285a491 2004-06-17 devnull return 1;
39 7285a491 2004-06-17 devnull * Binary search a list of directories for the
40 7285a491 2004-06-17 devnull * entry with name name.
41 7285a491 2004-06-17 devnull * If no entry is found, return a pointer to
42 7285a491 2004-06-17 devnull * where a new such entry would go.
44 7285a491 2004-06-17 devnull static Direc*
45 7285a491 2004-06-17 devnull dbsearch(char *name, int nname, Direc *d, int n)
49 7285a491 2004-06-17 devnull while(n > 0) {
50 7285a491 2004-06-17 devnull i = strecmp(name, name+nname, d[n/2].name);
51 7285a491 2004-06-17 devnull if(i < 0)
53 7285a491 2004-06-17 devnull else if(i > 0) {
54 7285a491 2004-06-17 devnull d += n/2+1;
55 7285a491 2004-06-17 devnull n -= (n/2+1);
57 7285a491 2004-06-17 devnull return &d[n/2];
59 7285a491 2004-06-17 devnull return d;
63 7285a491 2004-06-17 devnull * Walk to name, starting at d.
66 7285a491 2004-06-17 devnull walkdirec(Direc *d, char *name)
68 7285a491 2004-06-17 devnull char *p, *nextp, *slashp;
69 7285a491 2004-06-17 devnull Direc *nd;
71 7285a491 2004-06-17 devnull for(p=name; p && *p; p=nextp) {
72 7285a491 2004-06-17 devnull if((slashp = strchr(p, '/')) != nil)
73 7285a491 2004-06-17 devnull nextp = slashp+1;
75 7285a491 2004-06-17 devnull nextp = slashp = p+strlen(p);
77 7285a491 2004-06-17 devnull nd = dbsearch(p, slashp-p, d->child, d->nchild);
78 7285a491 2004-06-17 devnull if(nd >= d->child+d->nchild || strecmp(p, slashp, nd->name) != 0)
79 7285a491 2004-06-17 devnull return nil;
82 7285a491 2004-06-17 devnull return d;
86 7285a491 2004-06-17 devnull * Add the file ``name'' with attributes d to the
87 7285a491 2004-06-17 devnull * directory ``root''. Name may contain multiple
88 7285a491 2004-06-17 devnull * elements; all but the last must exist already.
90 7285a491 2004-06-17 devnull * The child lists are kept sorted by utfname.
93 7285a491 2004-06-17 devnull adddirec(Direc *root, char *name, XDir *d)
96 7285a491 2004-06-17 devnull Direc *nd;
99 7285a491 2004-06-17 devnull if(name[0] == '/')
101 7285a491 2004-06-17 devnull if((p = strrchr(name, '/')) != nil) {
102 7285a491 2004-06-17 devnull *p = '\0';
103 7285a491 2004-06-17 devnull root = walkdirec(root, name);
104 7285a491 2004-06-17 devnull if(root == nil) {
105 7285a491 2004-06-17 devnull sysfatal("error in proto file: no entry for /%s but /%s/%s\n", name, name, p+1);
106 7285a491 2004-06-17 devnull return nil;
108 7285a491 2004-06-17 devnull *p = '/';
111 7285a491 2004-06-17 devnull p = name;
113 7285a491 2004-06-17 devnull nd = dbsearch(p, strlen(p), root->child, root->nchild);
114 7285a491 2004-06-17 devnull off = nd - root->child;
115 7285a491 2004-06-17 devnull if(off < root->nchild && strcmp(nd->name, p) == 0) {
116 7285a491 2004-06-17 devnull if ((d->mode & DMDIR) == 0)
117 7285a491 2004-06-17 devnull fprint(2, "warning: proto lists %s twice\n", name);
118 7285a491 2004-06-17 devnull return nil;
121 7285a491 2004-06-17 devnull if(root->nchild%Ndirblock == 0) {
122 7285a491 2004-06-17 devnull root->child = erealloc(root->child, (root->nchild+Ndirblock)*sizeof(Direc));
123 7285a491 2004-06-17 devnull nd = root->child + off;
126 7285a491 2004-06-17 devnull memmove(nd+1, nd, (root->nchild - off)*sizeof(Direc));
127 7285a491 2004-06-17 devnull mkdirec(nd, d);
128 7285a491 2004-06-17 devnull nd->name = atom(p);
129 7285a491 2004-06-17 devnull root->nchild++;
130 7285a491 2004-06-17 devnull return nd;
134 7285a491 2004-06-17 devnull * Copy the tree src into dst.
137 7285a491 2004-06-17 devnull copydirec(Direc *dst, Direc *src)
139 7285a491 2004-06-17 devnull int i, n;
141 7285a491 2004-06-17 devnull *dst = *src;
143 7285a491 2004-06-17 devnull if((src->mode & DMDIR) == 0)
146 7285a491 2004-06-17 devnull n = (src->nchild + Ndirblock - 1);
147 7285a491 2004-06-17 devnull n -= n%Ndirblock;
148 7285a491 2004-06-17 devnull dst->child = emalloc(n*sizeof(Direc));
150 7285a491 2004-06-17 devnull n = dst->nchild;
151 7285a491 2004-06-17 devnull for(i=0; i<n; i++)
152 7285a491 2004-06-17 devnull copydirec(&dst->child[i], &src->child[i]);
156 7285a491 2004-06-17 devnull * Turn the Dbadname flag on for any entries
157 7285a491 2004-06-17 devnull * that have non-conforming names.
159 7285a491 2004-06-17 devnull static void
160 7285a491 2004-06-17 devnull _checknames(Direc *d, int (*isbadname)(char*), int isroot)
164 7285a491 2004-06-17 devnull if(!isroot && isbadname(d->name))
165 7285a491 2004-06-17 devnull d->flags |= Dbadname;
167 7285a491 2004-06-17 devnull if(strcmp(d->name, "_conform.map") == 0)
168 7285a491 2004-06-17 devnull d->flags |= Dbadname;
170 7285a491 2004-06-17 devnull for(i=0; i<d->nchild; i++)
171 7285a491 2004-06-17 devnull _checknames(&d->child[i], isbadname, 0);
175 7285a491 2004-06-17 devnull checknames(Direc *d, int (*isbadname)(char*))
177 7285a491 2004-06-17 devnull _checknames(d, isbadname, 1);
181 7285a491 2004-06-17 devnull * Set the names to conform to 8.3
182 7285a491 2004-06-17 devnull * by changing them to numbers.
183 7285a491 2004-06-17 devnull * Plan 9 gets the right names from its
184 7285a491 2004-06-17 devnull * own directory entry.
186 7285a491 2004-06-17 devnull * We used to write a _conform.map file to translate
187 7285a491 2004-06-17 devnull * names. Joliet should take care of most of the
188 7285a491 2004-06-17 devnull * interoperability with other systems now.
191 7285a491 2004-06-17 devnull convertnames(Direc *d, char* (*cvt)(char*, char*))
194 7285a491 2004-06-17 devnull char new[1024];
196 7285a491 2004-06-17 devnull if(d->flags & Dbadname)
197 7285a491 2004-06-17 devnull cvt(new, conform(d->name, d->mode & DMDIR));
199 7285a491 2004-06-17 devnull cvt(new, d->name);
200 7285a491 2004-06-17 devnull d->confname = atom(new);
202 7285a491 2004-06-17 devnull for(i=0; i<d->nchild; i++)
203 7285a491 2004-06-17 devnull convertnames(&d->child[i], cvt);
207 7285a491 2004-06-17 devnull * Sort a directory with a given comparison function.
208 7285a491 2004-06-17 devnull * After this is called on a tree, adddirec should not be,
209 7285a491 2004-06-17 devnull * since the entries may no longer be sorted as adddirec expects.
212 7285a491 2004-06-17 devnull dsort(Direc *d, int (*cmp)(const void*, const void*))
214 7285a491 2004-06-17 devnull int i, n;
216 7285a491 2004-06-17 devnull n = d->nchild;
217 7285a491 2004-06-17 devnull qsort(d->child, n, sizeof(d[0]), cmp);
219 7285a491 2004-06-17 devnull for(i=0; i<n; i++)
220 7285a491 2004-06-17 devnull dsort(&d->child[i], cmp);
