2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
10 #include <afsconfig.h>
11 #include <afs/param.h>
23 #include "h/sysmacros.h"
28 #if defined(AFS_AIX_ENV) || defined(AFS_SGI_ENV) || defined(AFS_SUN5_ENV) || defined(AFS_LINUX20_ENV)
31 #if !defined(AFS_SUN5_ENV) && !defined(AFS_LINUX20_ENV)
35 #if defined(AFS_SUN56_ENV) || defined(AFS_HPUX_ENV) || defined(AFS_FBSD_ENV) || defined(AFS_DARWIN80_ENV)
36 #include "afs/sysincludes.h"
38 #if !defined(AFS_SGI64_ENV) && !defined(AFS_DARWIN60_ENV)
40 #endif /* AFS_SGI64_ENV */
43 #include <sys/mount.h>
44 #include <sys/vnode.h>
45 #include <ufs/inode.h>
47 #if !defined(AFS_SUN5_ENV) && !defined(AFS_LINUX20_ENV) && !defined(AFS_HPUX110_ENV)
50 #ifndef AFS_LINUX20_ENV
51 #include "netinet/in.h"
55 /* These are needed because afs_prototypes.h is not included here */
59 #else /* !defined(UKERNEL) */
61 #include "afs/sysincludes.h"
64 /* These are needed because afs_prototypes.h is not included here */
68 #endif /* !defined(UKERNEL) */
69 #include "afs/afs_osi.h"
73 #include "afs/longc_procs.h"
74 #ifdef AFS_LINUX20_ENV
78 /* generic renaming */
79 #define NameBlobs afs_dir_NameBlobs
80 #define GetBlob afs_dir_GetBlob
81 #define Create afs_dir_Create
82 #define Length afs_dir_Length
83 #define Delete afs_dir_Delete
84 #define MakeDir afs_dir_MakeDir
85 #define Lookup afs_dir_Lookup
86 #define LookupOffset afs_dir_LookupOffset
87 #define EnumerateDir afs_dir_EnumerateDir
88 #define IsEmpty afs_dir_IsEmpty
94 # include <sys/types.h>
100 #include <netinet/in.h>
106 #ifdef HAVE_STRINGS_H
114 /* Local static prototypes */
115 static struct DirEntry *FindItem(void *dir, char *ename,
116 unsigned short **previtem);
120 NameBlobs(char *name)
121 { /* Find out how many entries are required to store a name. */
123 i = strlen(name) + 1;
124 return 1 + ((i + 15) >> 5);
127 /* Create an entry in a file. Dir is a file representation, while entry is a string name. */
130 Create(void *dir, char *entry, void *voidfid)
132 afs_int32 *vfid = (afs_int32 *) voidfid;
135 register struct DirEntry *ep;
136 unsigned short *pp = NULL;
137 register struct DirHeader *dhp;
139 /* check name quality */
142 /* First check if file already exists. */
143 ep = FindItem(dir, entry, &pp);
149 blobs = NameBlobs(entry); /* number of entries required */
150 firstelt = FindBlobs(dir, blobs);
152 return EFBIG; /* directory is full */
153 /* First, we fill in the directory entry. */
154 ep = GetBlob(dir, firstelt);
158 ep->fid.vnode = htonl(vfid[1]);
159 ep->fid.vunique = htonl(vfid[2]);
160 strcpy(ep->name, entry);
161 /* Now we just have to thread it on the hash table list. */
162 dhp = (struct DirHeader *)DRead(dir, 0);
168 ep->next = dhp->hashTable[i];
169 dhp->hashTable[i] = htons(firstelt);
179 struct DirHeader *dhp;
180 dhp = (struct DirHeader *)DRead(dir, 0);
183 if (dhp->header.pgcount != 0)
184 ctr = ntohs(dhp->header.pgcount);
186 /* old style, count the pages */
188 for (i = 0; i < MAXPAGES; i++)
189 if (dhp->alloMap[i] != EPP)
193 return ctr * AFS_PAGESIZE;
197 Delete(void *dir, char *entry)
199 /* Delete an entry from a directory, including update of all free entry descriptors. */
201 register struct DirEntry *firstitem;
202 unsigned short *previtem;
203 firstitem = FindItem(dir, entry, &previtem);
206 *previtem = firstitem->next;
207 DRelease(previtem, 1);
208 index = DVOffset(firstitem) / 32;
209 nitems = NameBlobs(firstitem->name);
210 DRelease(firstitem, 0);
211 FreeBlobs(dir, index, nitems);
216 FindBlobs(void *dir, int nblobs)
218 /* Find a bunch of contiguous entries; at least nblobs in a row. */
219 register int i, j, k;
221 register struct DirHeader *dhp;
222 struct PageHeader *pp;
225 dhp = (struct DirHeader *)DRead(dir, 0); /* read the dir header in first. */
228 for (i = 0; i < BIGMAXPAGES; i++) {
229 if (i >= MAXPAGES || dhp->alloMap[i] >= nblobs) {
230 /* if page could contain enough entries */
231 /* If there are EPP free entries, then the page is not even allocated. */
233 /* this pages exists past the end of the old-style dir */
234 pgcount = ntohs(dhp->header.pgcount);
237 dhp->header.pgcount = htons(pgcount);
239 if (i > pgcount - 1) {
240 /* this page is bigger than last allocated page */
242 dhp->header.pgcount = htons(i + 1);
244 } else if (dhp->alloMap[i] == EPP) {
245 /* Add the page to the directory. */
247 dhp->alloMap[i] = EPP - 1;
248 dhp->header.pgcount = htons(i + 1);
250 pp = (struct PageHeader *)DRead(dir, i); /* read the page in. */
255 for (j = 0; j <= EPP - nblobs; j++) {
257 for (k = 0; k < nblobs; k++)
258 if ((pp->freebitmap[(j + k) >> 3] >> ((j + k) & 7)) & 1) {
267 /* Here we have the first index in j. We update the allocation maps
268 * and free up any resources we've got allocated. */
270 dhp->alloMap[i] -= nblobs;
272 for (k = 0; k < nblobs; k++)
273 pp->freebitmap[(j + k) >> 3] |= 1 << ((j + k) & 7);
277 DRelease(pp, 0); /* This dir page is unchanged. */
280 /* If we make it here, the directory is full. */
286 AddPage(void *dir, int pageno)
287 { /* Add a page to a directory. */
289 register struct PageHeader *pp;
291 pp = (struct PageHeader *)DNew(dir, pageno); /* Get a new buffer labelled dir,pageno */
292 pp->tag = htons(1234);
295 pp->freecount = EPP - 1; /* The first dude is already allocated */
296 pp->freebitmap[0] = 0x01;
297 for (i = 1; i < EPP / 8; i++) /* It's a constant */
298 pp->freebitmap[i] = 0;
302 /* Free a whole bunch of directory entries. */
305 FreeBlobs(void *dir, register int firstblob, int nblobs)
309 struct DirHeader *dhp;
310 struct PageHeader *pp;
311 page = firstblob / EPP;
312 firstblob -= EPP * page; /* convert to page-relative entry */
313 dhp = (struct DirHeader *)DRead(dir, 0);
317 dhp->alloMap[page] += nblobs;
319 pp = (struct PageHeader *)DRead(dir, page);
321 for (i = 0; i < nblobs; i++)
322 pp->freebitmap[(firstblob + i) >> 3] &=
323 ~(1 << ((firstblob + i) & 7));
328 * Format an empty directory properly. Note that the first 13 entries in a
329 * directory header page are allocated, 1 to the page header, 4 to the
330 * allocation map and 8 to the hash table.
333 MakeDir(void *dir, afs_int32 * me, afs_int32 * parent)
336 register struct DirHeader *dhp;
337 dhp = (struct DirHeader *)DNew(dir, 0);
338 dhp->header.pgcount = htons(1);
339 dhp->header.tag = htons(1234);
340 dhp->header.freecount = (EPP - DHE - 1);
341 dhp->header.freebitmap[0] = 0xff;
342 dhp->header.freebitmap[1] = 0x1f;
343 for (i = 2; i < EPP / 8; i++)
344 dhp->header.freebitmap[i] = 0;
345 dhp->alloMap[0] = (EPP - DHE - 1);
346 for (i = 1; i < MAXPAGES; i++)
347 dhp->alloMap[i] = EPP;
348 for (i = 0; i < NHASHENT; i++)
349 dhp->hashTable[i] = 0;
351 Create(dir, ".", me);
352 Create(dir, "..", parent); /* Virtue is its own .. */
356 /* Look up a file name in directory. */
359 Lookup(void *dir, char *entry, void *voidfid)
361 afs_int32 *fid = (afs_int32 *) voidfid;
362 register struct DirEntry *firstitem;
363 unsigned short *previtem;
365 firstitem = FindItem(dir, entry, &previtem);
368 DRelease(previtem, 0);
369 fid[1] = ntohl(firstitem->fid.vnode);
370 fid[2] = ntohl(firstitem->fid.vunique);
371 DRelease(firstitem, 0);
375 /* Look up a file name in directory. */
378 LookupOffset(void *dir, char *entry, void *voidfid, long *offsetp)
380 afs_int32 *fid = (afs_int32 *) voidfid;
381 register struct DirEntry *firstitem;
382 unsigned short *previtem;
384 firstitem = FindItem(dir, entry, &previtem);
387 DRelease(previtem, 0);
388 fid[1] = ntohl(firstitem->fid.vnode);
389 fid[2] = ntohl(firstitem->fid.vunique);
391 *offsetp = DVOffset(firstitem);
392 DRelease(firstitem, 0);
397 EnumerateDir(void *dir, int (*hookproc) (), void *hook)
399 /* Enumerate the contents of a directory. */
402 register struct DirHeader *dhp;
403 register struct DirEntry *ep;
405 dhp = (struct DirHeader *)DRead(dir, 0);
407 return EIO; /* first page should be there */
408 for (i = 0; i < NHASHENT; i++) {
409 /* For each hash chain, enumerate everyone on the list. */
410 num = ntohs(dhp->hashTable[i]);
412 /* Walk down the hash table list. */
414 ep = GetBlob(dir, num);
417 /* we failed, return why */
423 num = ntohs(ep->next);
424 (*hookproc) (hook, ep->name, ntohl(ep->fid.vnode),
425 ntohl(ep->fid.vunique));
436 /* Enumerate the contents of a directory. */
439 register struct DirHeader *dhp;
440 register struct DirEntry *ep;
441 dhp = (struct DirHeader *)DRead(dir, 0);
444 for (i = 0; i < NHASHENT; i++) {
445 /* For each hash chain, enumerate everyone on the list. */
446 num = ntohs(dhp->hashTable[i]);
448 /* Walk down the hash table list. */
449 ep = GetBlob(dir, num);
452 if (strcmp(ep->name, "..") && strcmp(ep->name, ".")) {
457 num = ntohs(ep->next);
466 GetBlob(void *dir, afs_int32 blobno)
468 /* Return a pointer to an entry, given its number. */
470 ep = DRead(dir, blobno >> LEPP);
473 return (struct DirEntry *)(((long)ep) + 32 * (blobno & (EPP - 1)));
477 DirHash(register char *string)
479 /* Hash a string to a number between 0 and NHASHENT. */
480 register unsigned char tc;
484 while ((tc = (*string++))) {
488 tval = hval & (NHASHENT - 1);
491 else if (hval >= 1<<31)
492 tval = NHASHENT - tval;
496 static struct DirEntry *
497 FindItem(void *dir, char *ename, unsigned short **previtem)
499 /* Find a directory entry, given its name. This entry returns a pointer to a locked buffer, and a pointer to a locked buffer (in previtem) referencing the found item (to aid the delete code). If no entry is found, however, no items are left locked, and a null pointer is returned instead. */
501 register struct DirHeader *dhp;
502 register unsigned short *lp;
503 register struct DirEntry *tp;
505 dhp = (struct DirHeader *)DRead(dir, 0);
508 if (dhp->hashTable[i] == 0) {
513 tp = GetBlob(dir, (u_short) ntohs(dhp->hashTable[i]));
518 lp = &(dhp->hashTable[i]);
520 /* Look at each hash conflict entry. */
521 if (!strcmp(ename, tp->name)) {
522 /* Found our entry. */
529 /* The end of the line */
530 DRelease(lp, 0); /* Release all locks. */
533 tp = GetBlob(dir, (u_short) ntohs(tp->next));