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 #ifdef AFS_LINUX20_ENV
77 /* generic renaming */
78 #define NameBlobs afs_dir_NameBlobs
79 #define GetBlob afs_dir_GetBlob
80 #define Create afs_dir_Create
81 #define Length afs_dir_Length
82 #define Delete afs_dir_Delete
83 #define MakeDir afs_dir_MakeDir
84 #define Lookup afs_dir_Lookup
85 #define LookupOffset afs_dir_LookupOffset
86 #define EnumerateDir afs_dir_EnumerateDir
87 #define IsEmpty afs_dir_IsEmpty
89 #if defined(AFS_DISCON_ENV)
90 #define ChangeFid afs_dir_ChangeFid
98 # include <sys/types.h>
102 #include <winsock2.h>
104 #include <netinet/in.h>
112 /* Local static prototypes */
113 static struct DirEntry *FindItem(void *dir, char *ename,
114 unsigned short **previtem);
118 NameBlobs(char *name)
119 { /* Find out how many entries are required to store a name. */
121 i = strlen(name) + 1;
122 return 1 + ((i + 15) >> 5);
125 /* Create an entry in a file. Dir is a file representation, while entry is a string name. */
128 Create(void *dir, char *entry, void *voidfid)
130 afs_int32 *vfid = (afs_int32 *) voidfid;
133 register struct DirEntry *ep;
134 unsigned short *pp = NULL;
135 register struct DirHeader *dhp;
137 /* check name quality */
140 /* First check if file already exists. */
141 ep = FindItem(dir, entry, &pp);
147 blobs = NameBlobs(entry); /* number of entries required */
148 firstelt = FindBlobs(dir, blobs);
150 return EFBIG; /* directory is full */
151 /* First, we fill in the directory entry. */
152 ep = GetBlob(dir, firstelt);
156 ep->fid.vnode = htonl(vfid[1]);
157 ep->fid.vunique = htonl(vfid[2]);
158 strcpy(ep->name, entry);
159 /* Now we just have to thread it on the hash table list. */
160 dhp = (struct DirHeader *)DRead(dir, 0);
166 ep->next = dhp->hashTable[i];
167 dhp->hashTable[i] = htons(firstelt);
177 struct DirHeader *dhp;
178 dhp = (struct DirHeader *)DRead(dir, 0);
181 if (dhp->header.pgcount != 0)
182 ctr = ntohs(dhp->header.pgcount);
184 /* old style, count the pages */
186 for (i = 0; i < MAXPAGES; i++)
187 if (dhp->alloMap[i] != EPP)
191 return ctr * AFS_PAGESIZE;
195 Delete(void *dir, char *entry)
197 /* Delete an entry from a directory, including update of all free entry descriptors. */
199 register struct DirEntry *firstitem;
200 unsigned short *previtem;
201 firstitem = FindItem(dir, entry, &previtem);
204 *previtem = firstitem->next;
205 DRelease(previtem, 1);
206 index = DVOffset(firstitem) / 32;
207 nitems = NameBlobs(firstitem->name);
208 DRelease(firstitem, 0);
209 FreeBlobs(dir, index, nitems);
214 FindBlobs(void *dir, int nblobs)
216 /* Find a bunch of contiguous entries; at least nblobs in a row. */
217 register int i, j, k;
219 register struct DirHeader *dhp;
220 struct PageHeader *pp;
223 dhp = (struct DirHeader *)DRead(dir, 0); /* read the dir header in first. */
226 for (i = 0; i < BIGMAXPAGES; i++) {
227 if (i >= MAXPAGES || dhp->alloMap[i] >= nblobs) {
228 /* if page could contain enough entries */
229 /* If there are EPP free entries, then the page is not even allocated. */
231 /* this pages exists past the end of the old-style dir */
232 pgcount = ntohs(dhp->header.pgcount);
235 dhp->header.pgcount = htons(pgcount);
237 if (i > pgcount - 1) {
238 /* this page is bigger than last allocated page */
240 dhp->header.pgcount = htons(i + 1);
242 } else if (dhp->alloMap[i] == EPP) {
243 /* Add the page to the directory. */
245 dhp->alloMap[i] = EPP - 1;
246 dhp->header.pgcount = htons(i + 1);
248 pp = (struct PageHeader *)DRead(dir, i); /* read the page in. */
253 for (j = 0; j <= EPP - nblobs; j++) {
255 for (k = 0; k < nblobs; k++)
256 if ((pp->freebitmap[(j + k) >> 3] >> ((j + k) & 7)) & 1) {
265 /* Here we have the first index in j. We update the allocation maps
266 * and free up any resources we've got allocated. */
268 dhp->alloMap[i] -= nblobs;
270 for (k = 0; k < nblobs; k++)
271 pp->freebitmap[(j + k) >> 3] |= 1 << ((j + k) & 7);
275 DRelease(pp, 0); /* This dir page is unchanged. */
278 /* If we make it here, the directory is full. */
284 AddPage(void *dir, int pageno)
285 { /* Add a page to a directory. */
287 register struct PageHeader *pp;
289 pp = (struct PageHeader *)DNew(dir, pageno); /* Get a new buffer labelled dir,pageno */
290 pp->tag = htons(1234);
293 pp->freecount = EPP - 1; /* The first dude is already allocated */
294 pp->freebitmap[0] = 0x01;
295 for (i = 1; i < EPP / 8; i++) /* It's a constant */
296 pp->freebitmap[i] = 0;
300 /* Free a whole bunch of directory entries. */
303 FreeBlobs(void *dir, register int firstblob, int nblobs)
307 struct DirHeader *dhp;
308 struct PageHeader *pp;
309 page = firstblob / EPP;
310 firstblob -= EPP * page; /* convert to page-relative entry */
311 dhp = (struct DirHeader *)DRead(dir, 0);
315 dhp->alloMap[page] += nblobs;
317 pp = (struct PageHeader *)DRead(dir, page);
319 for (i = 0; i < nblobs; i++)
320 pp->freebitmap[(firstblob + i) >> 3] &=
321 ~(1 << ((firstblob + i) & 7));
326 * Format an empty directory properly. Note that the first 13 entries in a
327 * directory header page are allocated, 1 to the page header, 4 to the
328 * allocation map and 8 to the hash table.
331 MakeDir(void *dir, afs_int32 * me, afs_int32 * parent)
334 register struct DirHeader *dhp;
335 dhp = (struct DirHeader *)DNew(dir, 0);
336 dhp->header.pgcount = htons(1);
337 dhp->header.tag = htons(1234);
338 dhp->header.freecount = (EPP - DHE - 1);
339 dhp->header.freebitmap[0] = 0xff;
340 dhp->header.freebitmap[1] = 0x1f;
341 for (i = 2; i < EPP / 8; i++)
342 dhp->header.freebitmap[i] = 0;
343 dhp->alloMap[0] = (EPP - DHE - 1);
344 for (i = 1; i < MAXPAGES; i++)
345 dhp->alloMap[i] = EPP;
346 for (i = 0; i < NHASHENT; i++)
347 dhp->hashTable[i] = 0;
349 Create(dir, ".", me);
350 Create(dir, "..", parent); /* Virtue is its own .. */
354 /* Look up a file name in directory. */
357 Lookup(void *dir, char *entry, void *voidfid)
359 afs_int32 *fid = (afs_int32 *) voidfid;
360 register struct DirEntry *firstitem;
361 unsigned short *previtem;
363 firstitem = FindItem(dir, entry, &previtem);
366 DRelease(previtem, 0);
367 fid[1] = ntohl(firstitem->fid.vnode);
368 fid[2] = ntohl(firstitem->fid.vunique);
369 DRelease(firstitem, 0);
373 /* Look up a file name in directory. */
376 LookupOffset(void *dir, char *entry, void *voidfid, long *offsetp)
378 afs_int32 *fid = (afs_int32 *) voidfid;
379 register struct DirEntry *firstitem;
380 unsigned short *previtem;
382 firstitem = FindItem(dir, entry, &previtem);
385 DRelease(previtem, 0);
386 fid[1] = ntohl(firstitem->fid.vnode);
387 fid[2] = ntohl(firstitem->fid.vunique);
389 *offsetp = DVOffset(firstitem);
390 DRelease(firstitem, 0);
395 EnumerateDir(void *dir, int (*hookproc) (), void *hook)
397 /* Enumerate the contents of a directory.
398 * Break when hook function returns non 0.
402 register struct DirHeader *dhp;
403 register struct DirEntry *ep;
406 dhp = (struct DirHeader *)DRead(dir, 0);
408 return EIO; /* first page should be there */
410 for (i = 0; i < NHASHENT; i++) {
411 /* For each hash chain, enumerate everyone on the list. */
412 num = ntohs(dhp->hashTable[i]);
414 /* Walk down the hash table list. */
416 ep = GetBlob(dir, num);
419 /* we failed, return why */
426 num = ntohs(ep->next);
427 code = (*hookproc) (hook, ep->name, ntohl(ep->fid.vnode),
428 ntohl(ep->fid.vunique));
441 /* Enumerate the contents of a directory. */
444 register struct DirHeader *dhp;
445 register struct DirEntry *ep;
446 dhp = (struct DirHeader *)DRead(dir, 0);
449 for (i = 0; i < NHASHENT; i++) {
450 /* For each hash chain, enumerate everyone on the list. */
451 num = ntohs(dhp->hashTable[i]);
453 /* Walk down the hash table list. */
454 ep = GetBlob(dir, num);
457 if (strcmp(ep->name, "..") && strcmp(ep->name, ".")) {
462 num = ntohs(ep->next);
471 GetBlob(void *dir, afs_int32 blobno)
473 /* Return a pointer to an entry, given its number. */
475 ep = DRead(dir, blobno >> LEPP);
478 return (struct DirEntry *)(((long)ep) + 32 * (blobno & (EPP - 1)));
482 DirHash(register char *string)
484 /* Hash a string to a number between 0 and NHASHENT. */
485 register unsigned char tc;
489 while ((tc = (*string++))) {
493 tval = hval & (NHASHENT - 1);
496 else if (hval >= 1<<31)
497 tval = NHASHENT - tval;
501 static struct DirEntry *
502 FindItem(void *dir, char *ename, unsigned short **previtem)
504 /* 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. */
506 register struct DirHeader *dhp;
507 register unsigned short *lp;
508 register struct DirEntry *tp;
510 dhp = (struct DirHeader *)DRead(dir, 0);
513 if (dhp->hashTable[i] == 0) {
518 tp = GetBlob(dir, (u_short) ntohs(dhp->hashTable[i]));
523 lp = &(dhp->hashTable[i]);
525 /* Look at each hash conflict entry. */
526 if (!strcmp(ename, tp->name)) {
527 /* Found our entry. */
534 /* The end of the line */
535 DRelease(lp, 0); /* Release all locks. */
538 tp = GetBlob(dir, (u_short) ntohs(tp->next));
546 #if defined(AFS_DISCON_ENV)
548 * Change an entry fid.
551 * \param entry The entry name.
552 * \param old_fid The old find in MKFid format (host order).
553 * It can be omitted if you don't need a safety check...
554 * \param new_fid The new find in MKFid format (host order).
556 int ChangeFid(void *dir,
561 struct DirEntry *firstitem;
562 unsigned short *previtem;
563 struct MKFid *fid_old = (struct MKFid *) old_fid;
564 struct MKFid *fid_new = (struct MKFid *) new_fid;
567 firstitem = FindItem(dir, entry, &previtem);
568 if (firstitem == 0) {
571 DRelease(previtem, 1);
574 ((htonl(fid_old->vnode) == firstitem->fid.vnode) &&
575 (htonl(fid_old->vunique) == firstitem->fid.vunique))) {
577 firstitem->fid.vnode = htonl(fid_new->vnode);
578 firstitem->fid.vunique = htonl(fid_new->vunique);
581 DRelease(firstitem, 1);