1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
|
/*
Copyright (C) 1997,98,99,2001,02 Free Software Foundation, Inc.
Written by Thomas Bushnell, n/BSG.
This file is part of the GNU Hurd.
The GNU Hurd is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2, or (at
your option) any later version.
The GNU Hurd is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA. */
#include <string.h>
#include <stdlib.h>
#include <dirent.h>
#include "isofs.h"
/* From inode.c */
int use_file_start_id (struct dirrect *record, struct rrip_lookup *rr);
/* Forward */
static error_t dirscanblock (void *, const char *, size_t,
struct dirrect **, struct rrip_lookup *);
static int
isonamematch (const char *dirname, size_t dnamelen,
const char *username, size_t unamelen)
{
/* Special representations for `.' and `..' */
if (dnamelen == 1 && dirname[0] == '\0')
return unamelen == 1 && username[0] == '.';
if (dnamelen == 1 && dirname[0] == '\1')
return unamelen == 2 && username[0] == '.' && username[1] == '.';
if (unamelen > dnamelen)
return 0;
if (!strncasecmp (dirname, username, unamelen))
{
/* A prefix has matched. Check if it's acceptable. */
if (dnamelen == unamelen)
return 1;
/* User has omitted the version number */
if (dirname[unamelen] == ';')
return 1;
/* User has omitted an empty extension */
if (dirname[unamelen] == '.'
&& (dirname[unamelen+1] == '\0' || dirname[unamelen+1] == ';'))
return 1;
}
return 0;
}
/* Implement the diskfs_lookup callback from the diskfs library. See
<hurd/diskfs.h> for the interface specification. */
error_t
diskfs_lookup_hard (struct node *dp, const char *name, enum lookup_type type,
struct node **npp, struct dirstat *ds, struct protid *cred)
{
error_t err = 0;
struct dirrect *record;
int namelen;
int spec_dotdot;
void *buf;
void *blockaddr;
struct rrip_lookup rr;
if ((type == REMOVE) || (type == RENAME))
assert (npp);
if (npp)
*npp = 0;
spec_dotdot = type & SPEC_DOTDOT;
type &= ~SPEC_DOTDOT;
namelen = strlen (name);
/* This error is constant, but the errors for CREATE and REMOVE depend
on whether NAME exists. */
if (type == RENAME)
return EROFS;
buf = disk_image + (dp->dn->file_start << store->log2_block_size);
for (blockaddr = buf;
blockaddr < buf + dp->dn_stat.st_size;
blockaddr += logical_sector_size)
{
err = dirscanblock (blockaddr, name, namelen, &record, &rr);
if (!err)
break;
if (err != ENOENT)
return err;
}
if ((!err && type == REMOVE)
|| (err == ENOENT && type == CREATE))
err = EROFS;
if (err)
return err;
/* Load the inode */
if (namelen == 2 && name[0] == '.' && name[1] == '.')
{
if (dp == diskfs_root_node)
err = EAGAIN;
else if (spec_dotdot)
{
/* renames and removes can't get this far. */
assert (type == LOOKUP);
diskfs_nput (dp);
err = load_inode (npp, record, &rr);
}
else
{
/* We don't have to do the normal rigamarole, because
we are permanently read-only, so things are necessarily
quiescent. Just be careful to honor the locking order. */
pthread_mutex_unlock (&dp->lock);
err = load_inode (npp, record, &rr);
pthread_mutex_lock (&dp->lock);
}
}
else if (namelen == 1 && name[0] == '.')
{
*npp = dp;
diskfs_nref (dp);
}
else
err = load_inode (npp, record, &rr);
release_rrip (&rr);
return err;
}
/* Scan one logical sector of directory contents (at address BLKADDR)
for NAME of length NAMELEN. Return its address in *RECORD. */
static error_t
dirscanblock (void *blkaddr, const char *name, size_t namelen,
struct dirrect **record, struct rrip_lookup *rr)
{
struct dirrect *entry;
void *currentoff;
size_t reclen;
size_t entry_namelen;
int matchrr;
int matchnormal;
for (currentoff = blkaddr;
currentoff < blkaddr + logical_sector_size;
currentoff += reclen)
{
entry = (struct dirrect *) currentoff;
reclen = entry->len;
/* Validate reclen */
if (reclen == 0
|| reclen < sizeof (struct dirrect)
|| currentoff + reclen > blkaddr + logical_sector_size)
break;
entry_namelen = entry->namelen;
/* More validation */
if (reclen < sizeof (struct dirrect) + entry_namelen)
break;
/* Check to see if the name matches the directory entry. */
if (isonamematch ((const char *) entry->name, entry_namelen, name, namelen))
matchnormal = 1;
else
matchnormal = 0;
/* Now scan for RRIP fields */
matchrr = rrip_match_lookup (entry, name, namelen, rr);
/* Ignore RE entries */
if (rr->valid & VALID_RE)
{
release_rrip (rr);
continue;
}
/* See if the name matches */
if (((rr->valid & VALID_NM) && matchrr)
|| (!(rr->valid & VALID_NM) && matchnormal))
{
/* We've got it. Return success */
*record = entry;
return 0;
}
release_rrip (rr);
}
/* Wasn't there. */
*record = 0;
return ENOENT;
}
error_t
diskfs_get_directs (struct node *dp,
int entry,
int nentries,
char **data,
size_t *datacnt,
vm_size_t bufsiz,
int *amt)
{
volatile vm_size_t allocsize;
struct dirrect *ep;
struct dirent *userp;
int i;
void *dirbuf, *bufp;
char *datap;
volatile int ouralloc = 0;
error_t err;
/* Allocate some space to hold the returned data. */
allocsize = bufsiz ? round_page (bufsiz) : vm_page_size * 4;
if (allocsize > *datacnt)
{
*data = mmap (0, allocsize, PROT_READ|PROT_WRITE, MAP_ANON, 0, 0);
ouralloc = 1;
}
err = diskfs_catch_exception ();
if (err)
{
if (ouralloc)
munmap (*data, allocsize);
return err;
}
/* Skip to ENTRY */
dirbuf = disk_image + (dp->dn->file_start << store->log2_block_size);
bufp = dirbuf;
for (i = 0; i < entry; i ++)
{
struct rrip_lookup rr;
ep = (struct dirrect *) bufp;
rrip_lookup (ep, &rr, 0);
/* Ignore and skip RE entries */
if (rr.valid & VALID_RE)
i--;
else
{
if (bufp - dirbuf >= dp->dn_stat.st_size)
{
/* Not that many entries in the directory; return nothing. */
release_rrip (&rr);
if (allocsize > *datacnt)
munmap (data, allocsize);
*datacnt = 0;
*amt = 0;
return 0;
}
}
bufp = bufp + ep->len;
release_rrip (&rr);
/* If BUFP points at a null, then we have hit the last
record in this logical sector. In that case, skip up to
the next logical sector. */
if (*(char *)bufp == '\0')
bufp = (void *) (((long) bufp & ~(logical_sector_size - 1))
+ logical_sector_size);
}
/* Now copy entries one at a time */
i = 0;
datap = *data;
while (((nentries == -1) || (i < nentries))
&& (!bufsiz || datap - *data < bufsiz)
&& ((void *) bufp - dirbuf < dp->dn_stat.st_size))
{
struct rrip_lookup rr;
const char *name;
size_t namlen, reclen;
ep = (struct dirrect *) bufp;
/* Fetch Rock-Ridge information for this file */
rrip_lookup (ep, &rr, 0);
/* Ignore and skip RE entries */
if (! (rr.valid & VALID_RE))
{
/* See if there's room to hold this one */
name = rr.valid & VALID_NM ? rr.name : (char *) ep->name;
namlen = rr.valid & VALID_NM ? strlen (name) : ep->namelen;
/* Name frobnication */
if (!(rr.valid & VALID_NM))
{
if (namlen == 1 && name[0] == '\0')
{
name = ".";
namlen = 1;
}
else if (namlen == 1 && name[0] == '\1')
{
name = "..";
namlen = 2;
}
/* Perhaps downcase it too? */
}
reclen = sizeof (struct dirent) + namlen;
reclen = (reclen + 3) & ~3;
/* Expand buffer if necessary */
if (datap - *data + reclen > allocsize)
{
vm_address_t newdata;
vm_allocate (mach_task_self (), &newdata,
(ouralloc
? (allocsize *= 2)
: (allocsize = vm_page_size * 2)), 1);
memcpy ((void *) newdata, (void *) *data, datap - *data);
if (ouralloc)
munmap (*data, allocsize / 2);
datap = (char *) newdata + (datap - *data);
*data = (char *) newdata;
ouralloc = 1;
}
userp = (struct dirent *) datap;
/* Fill in entry */
if (use_file_start_id (ep, &rr))
{
off_t file_start;
err = calculate_file_start (ep, &file_start, &rr);
if (err)
{
release_rrip (&rr);
diskfs_end_catch_exception ();
if (ouralloc)
munmap (*data, allocsize);
return err;
}
userp->d_fileno = file_start << store->log2_block_size;
}
else
userp->d_fileno = (ino_t) ((void *) ep - (void *) disk_image);
userp->d_type = DT_UNKNOWN;
userp->d_reclen = reclen;
userp->d_namlen = namlen;
memcpy (userp->d_name, name, namlen);
userp->d_name[namlen] = '\0';
/* And move along */
datap = datap + reclen;
i++;
}
release_rrip (&rr);
bufp = bufp + ep->len;
/* If BUFP points at a null, then we have hit the last
record in this logical sector. In that case, skip up to
the next logical sector. */
if (*(char *)bufp == '\0')
bufp = (void *) (((long) bufp & ~(logical_sector_size - 1))
+ logical_sector_size);
}
diskfs_end_catch_exception ();
/* If we didn't use all the pages of a buffer we allocated, free
the excess. */
if (ouralloc
&& round_page (datap - *data) < round_page (allocsize))
munmap ((caddr_t) round_page (datap),
round_page (allocsize) - round_page (datap - *data));
/* Return */
*amt = i;
*datacnt = datap - *data;
return 0;
}
/* We have no dirstats at all. */
const size_t diskfs_dirstat_size = 0;
void
diskfs_null_dirstat (struct dirstat *ds)
{
}
error_t
diskfs_drop_dirstat (struct node *dp, struct dirstat *ds)
{
return 0;
}
/* These should never be called. */
error_t
diskfs_direnter_hard(struct node *dp,
const char *name,
struct node *np,
struct dirstat *ds,
struct protid *cred)
{
abort ();
}
error_t
diskfs_dirremove_hard(struct node *dp,
struct dirstat *ds)
{
abort ();
}
error_t
diskfs_dirrewrite_hard(struct node *dp,
struct node *np,
struct dirstat *ds)
{
abort ();
}
int
diskfs_dirempty(struct node *dp,
struct protid *cred)
{
abort ();
}
|