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>
21 #include "h/sysmacros.h"
26 #if defined(AFS_AIX_ENV) || defined(AFS_SGI_ENV) || defined(AFS_SUN5_ENV) || defined(AFS_LINUX20_ENV)
29 #if !defined(AFS_SUN5_ENV) && !defined(AFS_LINUX20_ENV)
33 #if defined(AFS_SUN56_ENV) || defined(AFS_HPUX_ENV) || defined(AFS_FBSD_ENV) || defined(AFS_DARWIN80_ENV)
34 #include "afs/sysincludes.h"
36 #if !defined(AFS_SGI64_ENV) && !defined(AFS_DARWIN60_ENV)
38 #endif /* AFS_SGI64_ENV */
41 #include <sys/mount.h>
42 #include <sys/vnode.h>
43 #include <ufs/inode.h>
45 #if !defined(AFS_SUN5_ENV) && !defined(AFS_LINUX20_ENV) && !defined(AFS_HPUX110_ENV)
48 #ifndef AFS_LINUX20_ENV
49 #include "netinet/in.h"
53 /* These are needed because afs_prototypes.h is not included here */
54 extern void *DRead(struct dcache *adc, int page);
55 extern void *DNew(struct dcache *adc, int page);
57 #else /* !defined(UKERNEL) */
59 #include "afs/sysincludes.h"
62 /* These are needed because afs_prototypes.h is not included here */
63 extern void *DRead(register afs_int32 *fid, register int page);
64 extern void *DNew(register afs_int32 *fid, register int page);
66 #endif /* !defined(UKERNEL) */
67 #include "afs/afs_osi.h"
71 #ifdef AFS_LINUX20_ENV
75 /* generic renaming */
76 #define NameBlobs afs_dir_NameBlobs
77 #define GetBlob afs_dir_GetBlob
78 #define Create afs_dir_Create
79 #define Length afs_dir_Length
80 #define Delete afs_dir_Delete
81 #define MakeDir afs_dir_MakeDir
82 #define Lookup afs_dir_Lookup
83 #define LookupOffset afs_dir_LookupOffset
84 #define EnumerateDir afs_dir_EnumerateDir
85 #define IsEmpty afs_dir_IsEmpty
86 #define InverseLookup afs_dir_InverseLookup
88 #if defined(AFS_DISCON_ENV)
89 #define ChangeFid afs_dir_ChangeFid
97 # include <sys/types.h>
101 #include <winsock2.h>
103 #include <netinet/in.h>
111 /* Local static prototypes */
112 static struct DirEntry *FindItem(void *dir, char *ename,
113 unsigned short **previtem);
117 NameBlobs(char *name)
118 { /* Find out how many entries are required to store a name. */
120 i = strlen(name) + 1;
121 return 1 + ((i + 15) >> 5);
124 /* Create an entry in a file. Dir is a file representation, while entry is a string name. */
127 Create(void *dir, char *entry, void *voidfid)
129 afs_int32 *vfid = (afs_int32 *) voidfid;
132 register struct DirEntry *ep;
133 unsigned short *pp = NULL;
134 register struct DirHeader *dhp;
136 /* check name quality */
139 /* First check if file already exists. */
140 ep = FindItem(dir, entry, &pp);
142 DRelease((struct buffer *)ep, 0);
143 DRelease((struct buffer *)pp, 0);
146 blobs = NameBlobs(entry); /* number of entries required */
147 firstelt = FindBlobs(dir, blobs);
149 return EFBIG; /* directory is full */
150 /* First, we fill in the directory entry. */
151 ep = GetBlob(dir, firstelt);
155 ep->fid.vnode = htonl(vfid[1]);
156 ep->fid.vunique = htonl(vfid[2]);
157 strcpy(ep->name, entry);
158 /* Now we just have to thread it on the hash table list. */
159 dhp = (struct DirHeader *)DRead(dir, 0);
161 DRelease((struct buffer *)ep, 1);
165 ep->next = dhp->hashTable[i];
166 dhp->hashTable[i] = htons(firstelt);
167 DRelease((struct buffer *)dhp, 1);
168 DRelease((struct buffer *)ep, 1);
176 struct DirHeader *dhp;
177 dhp = (struct DirHeader *)DRead(dir, 0);
180 if (dhp->header.pgcount != 0)
181 ctr = ntohs(dhp->header.pgcount);
183 /* old style, count the pages */
185 for (i = 0; i < MAXPAGES; i++)
186 if (dhp->alloMap[i] != EPP)
189 DRelease((struct buffer *)dhp, 0);
190 return ctr * AFS_PAGESIZE;
194 Delete(void *dir, char *entry)
196 /* Delete an entry from a directory, including update of all free entry descriptors. */
198 register struct DirEntry *firstitem;
199 unsigned short *previtem;
200 firstitem = FindItem(dir, entry, &previtem);
203 *previtem = firstitem->next;
204 DRelease((struct buffer *)previtem, 1);
205 index = DVOffset(firstitem) / 32;
206 nitems = NameBlobs(firstitem->name);
207 DRelease((struct buffer *)firstitem, 0);
208 FreeBlobs(dir, index, nitems);
213 FindBlobs(void *dir, int nblobs)
215 /* Find a bunch of contiguous entries; at least nblobs in a row. */
216 register int i, j, k;
218 register struct DirHeader *dhp;
219 struct PageHeader *pp;
222 dhp = (struct DirHeader *)DRead(dir, 0); /* read the dir header in first. */
225 for (i = 0; i < BIGMAXPAGES; i++) {
226 if (i >= MAXPAGES || dhp->alloMap[i] >= nblobs) {
227 /* if page could contain enough entries */
228 /* If there are EPP free entries, then the page is not even allocated. */
230 /* this pages exists past the end of the old-style dir */
231 pgcount = ntohs(dhp->header.pgcount);
234 dhp->header.pgcount = htons(pgcount);
236 if (i > pgcount - 1) {
237 /* this page is bigger than last allocated page */
239 dhp->header.pgcount = htons(i + 1);
241 } else if (dhp->alloMap[i] == EPP) {
242 /* Add the page to the directory. */
244 dhp->alloMap[i] = EPP - 1;
245 dhp->header.pgcount = htons(i + 1);
247 pp = (struct PageHeader *)DRead(dir, i); /* read the page in. */
249 DRelease((struct buffer *)dhp, 1);
252 for (j = 0; j <= EPP - nblobs; j++) {
254 for (k = 0; k < nblobs; k++)
255 if ((pp->freebitmap[(j + k) >> 3] >> ((j + k) & 7)) & 1) {
264 /* Here we have the first index in j. We update the allocation maps
265 * and free up any resources we've got allocated. */
267 dhp->alloMap[i] -= nblobs;
268 DRelease((struct buffer *)dhp, 1);
269 for (k = 0; k < nblobs; k++)
270 pp->freebitmap[(j + k) >> 3] |= 1 << ((j + k) & 7);
271 DRelease((struct buffer *)pp, 1);
274 DRelease((struct buffer *)pp, 0); /* This dir page is unchanged. */
277 /* If we make it here, the directory is full. */
278 DRelease((struct buffer *)dhp, 1);
283 AddPage(void *dir, int pageno)
284 { /* Add a page to a directory. */
286 register struct PageHeader *pp;
288 pp = (struct PageHeader *)DNew(dir, pageno); /* Get a new buffer labelled dir,pageno */
289 pp->tag = htons(1234);
292 pp->freecount = EPP - 1; /* The first dude is already allocated */
293 pp->freebitmap[0] = 0x01;
294 for (i = 1; i < EPP / 8; i++) /* It's a constant */
295 pp->freebitmap[i] = 0;
296 DRelease((struct buffer *)pp, 1);
299 /* Free a whole bunch of directory entries. */
302 FreeBlobs(void *dir, register int firstblob, int nblobs)
306 struct DirHeader *dhp;
307 struct PageHeader *pp;
308 page = firstblob / EPP;
309 firstblob -= EPP * page; /* convert to page-relative entry */
310 dhp = (struct DirHeader *)DRead(dir, 0);
314 dhp->alloMap[page] += nblobs;
315 DRelease((struct buffer *)dhp, 1);
316 pp = (struct PageHeader *)DRead(dir, page);
318 for (i = 0; i < nblobs; i++)
319 pp->freebitmap[(firstblob + i) >> 3] &=
320 ~(1 << ((firstblob + i) & 7));
321 DRelease((struct buffer *)pp, 1);
325 * Format an empty directory properly. Note that the first 13 entries in a
326 * directory header page are allocated, 1 to the page header, 4 to the
327 * allocation map and 8 to the hash table.
330 MakeDir(void *dir, afs_int32 * me, afs_int32 * parent)
333 register struct DirHeader *dhp;
334 dhp = (struct DirHeader *)DNew(dir, 0);
335 dhp->header.pgcount = htons(1);
336 dhp->header.tag = htons(1234);
337 dhp->header.freecount = (EPP - DHE - 1);
338 dhp->header.freebitmap[0] = 0xff;
339 dhp->header.freebitmap[1] = 0x1f;
340 for (i = 2; i < EPP / 8; i++)
341 dhp->header.freebitmap[i] = 0;
342 dhp->alloMap[0] = (EPP - DHE - 1);
343 for (i = 1; i < MAXPAGES; i++)
344 dhp->alloMap[i] = EPP;
345 for (i = 0; i < NHASHENT; i++)
346 dhp->hashTable[i] = 0;
347 DRelease((struct buffer *)dhp, 1);
348 Create(dir, ".", me);
349 Create(dir, "..", parent); /* Virtue is its own .. */
353 /* Look up a file name in directory. */
356 Lookup(void *dir, char *entry, void *voidfid)
358 afs_int32 *fid = (afs_int32 *) voidfid;
359 register struct DirEntry *firstitem;
360 unsigned short *previtem;
362 firstitem = FindItem(dir, entry, &previtem);
365 DRelease((struct buffer *)previtem, 0);
366 fid[1] = ntohl(firstitem->fid.vnode);
367 fid[2] = ntohl(firstitem->fid.vunique);
368 DRelease((struct buffer *)firstitem, 0);
372 /* Look up a file name in directory. */
375 LookupOffset(void *dir, char *entry, void *voidfid, long *offsetp)
377 afs_int32 *fid = (afs_int32 *) voidfid;
378 register struct DirEntry *firstitem;
379 unsigned short *previtem;
381 firstitem = FindItem(dir, entry, &previtem);
384 DRelease((struct buffer *)previtem, 0);
385 fid[1] = ntohl(firstitem->fid.vnode);
386 fid[2] = ntohl(firstitem->fid.vunique);
388 *offsetp = DVOffset(firstitem);
389 DRelease((struct buffer *)firstitem, 0);
394 EnumerateDir(void *dir, int (*hookproc) (void *dir, char *name,
395 afs_int32 vnode, afs_int32 unique),
398 /* Enumerate the contents of a directory.
399 * Break when hook function returns non 0.
403 register struct DirHeader *dhp;
404 register struct DirEntry *ep;
407 dhp = (struct DirHeader *)DRead(dir, 0);
409 return EIO; /* first page should be there */
411 for (i = 0; i < NHASHENT; i++) {
412 /* For each hash chain, enumerate everyone on the list. */
413 num = ntohs(dhp->hashTable[i]);
415 /* Walk down the hash table list. */
417 ep = GetBlob(dir, num);
420 /* we failed, return why */
421 DRelease((struct buffer *)dhp, 0);
427 num = ntohs(ep->next);
428 code = (*hookproc) (hook, ep->name, ntohl(ep->fid.vnode),
429 ntohl(ep->fid.vunique));
430 DRelease((struct buffer *)ep, 0);
435 DRelease((struct buffer *)dhp, 0);
442 /* Enumerate the contents of a directory. */
445 register struct DirHeader *dhp;
446 register struct DirEntry *ep;
447 dhp = (struct DirHeader *)DRead(dir, 0);
450 for (i = 0; i < NHASHENT; i++) {
451 /* For each hash chain, enumerate everyone on the list. */
452 num = ntohs(dhp->hashTable[i]);
454 /* Walk down the hash table list. */
455 ep = GetBlob(dir, num);
458 if (strcmp(ep->name, "..") && strcmp(ep->name, ".")) {
459 DRelease((struct buffer *)ep, 0);
460 DRelease((struct buffer *)dhp, 0);
463 num = ntohs(ep->next);
464 DRelease((struct buffer *)ep, 0);
467 DRelease((struct buffer *)dhp, 0);
472 GetBlob(void *dir, afs_int32 blobno)
474 /* Return a pointer to an entry, given its number. */
476 ep = DRead(dir, blobno >> LEPP);
479 return (struct DirEntry *)(((long)ep) + 32 * (blobno & (EPP - 1)));
483 DirHash(register char *string)
485 /* Hash a string to a number between 0 and NHASHENT. */
486 register unsigned char tc;
490 while ((tc = (*string++))) {
494 tval = hval & (NHASHENT - 1);
497 else if (hval >= 1<<31)
498 tval = NHASHENT - tval;
502 static struct DirEntry *
503 FindItem(void *dir, char *ename, unsigned short **previtem)
505 /* 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. */
507 register struct DirHeader *dhp;
508 register unsigned short *lp;
509 register struct DirEntry *tp;
511 dhp = (struct DirHeader *)DRead(dir, 0);
514 if (dhp->hashTable[i] == 0) {
516 DRelease((struct buffer *)dhp, 0);
519 tp = GetBlob(dir, (u_short) ntohs(dhp->hashTable[i]));
521 DRelease((struct buffer *)dhp, 0);
524 lp = &(dhp->hashTable[i]);
526 /* Look at each hash conflict entry. */
527 if (!strcmp(ename, tp->name)) {
528 /* Found our entry. */
532 DRelease((struct buffer *)lp, 0);
535 /* The end of the line */
536 DRelease((struct buffer *)lp, 0); /* Release all locks. */
539 tp = GetBlob(dir, (u_short) ntohs(tp->next));
541 DRelease((struct buffer *)lp, 0);
547 static struct DirEntry *
548 FindFid (void *dir, afs_uint32 vnode, afs_uint32 unique)
550 /* Find a directory entry, given the vnode and uniquifier of a object.
551 * This entry returns a pointer to a locked buffer. If no entry is found,
552 * however, no items are left locked, and a null pointer is returned
556 register struct DirHeader *dhp;
557 register unsigned short *lp;
558 register struct DirEntry *tp;
559 dhp = (struct DirHeader *) DRead(dir,0);
561 for (i=0; i<NHASHENT; i++) {
562 if (dhp->hashTable[i] != 0) {
563 tp = GetBlob(dir,(u_short)ntohs(dhp->hashTable[i]));
564 if (!tp) { /* should not happen */
569 if (vnode == ntohl(tp->fid.vnode)
570 && unique == ntohl(tp->fid.vunique)) {
577 tp = GetBlob(dir,(u_short)ntohs(tp->next));
584 return (struct DirEntry *)0;
588 InverseLookup (void *dir, afs_uint32 vnode, afs_uint32 unique, char *name,
591 /* Look for the name pointing to given vnode and unique in a directory */
592 register struct DirEntry *entry;
595 entry = FindFid(dir, vnode, unique);
598 if (strlen(entry->name) >= length)
601 strcpy(name, entry->name);
606 #if defined(AFS_DISCON_ENV)
608 * Change an entry fid.
611 * \param entry The entry name.
612 * \param old_fid The old find in MKFid format (host order).
613 * It can be omitted if you don't need a safety check...
614 * \param new_fid The new find in MKFid format (host order).
616 int ChangeFid(void *dir,
621 struct DirEntry *firstitem;
622 unsigned short *previtem;
623 struct MKFid *fid_old = (struct MKFid *) old_fid;
624 struct MKFid *fid_new = (struct MKFid *) new_fid;
627 firstitem = FindItem(dir, entry, &previtem);
628 if (firstitem == 0) {
631 DRelease(previtem, 1);
634 ((htonl(fid_old->vnode) == firstitem->fid.vnode) &&
635 (htonl(fid_old->vunique) == firstitem->fid.vunique))) {
637 firstitem->fid.vnode = htonl(fid_new->vnode);
638 firstitem->fid.vunique = htonl(fid_new->vunique);
641 DRelease(firstitem, 1);