2 * $Id: ofork.c,v 1.16 2002-06-17 11:40:11 didg Exp $
4 * Copyright (c) 1996 Regents of The University of Michigan.
5 * All Rights Reserved. See COPYRIGHT.
10 #endif /* HAVE_CONFIG_H */
15 #include <sys/stat.h> /* works around a bug */
16 #include <sys/param.h>
17 #include <atalk/logger.h>
20 #include <atalk/adouble.h>
24 #include "directory.h"
27 /* we need to have a hashed list of oforks (by name). just hash
29 #define OFORK_HASHSIZE 64
30 static struct ofork *ofork_table[OFORK_HASHSIZE];
32 static struct ofork **oforks = NULL;
33 static int nforks = 0;
34 static u_short lastrefnum = 0;
37 /* OR some of each character for the hash*/
38 static __inline__ unsigned long hashfn(const char *name)
43 i = ((i << 4) | (8*sizeof(i) - 4)) ^ *name++;
45 return i & (OFORK_HASHSIZE - 1);
48 static __inline__ void of_hash(struct ofork *of)
52 table = &ofork_table[hashfn(of->of_name)];
53 if ((of->next = *table) != NULL)
54 (*table)->prevp = &of->next;
59 static __inline__ void of_unhash(struct ofork *of)
63 of->next->prevp = of->prevp;
64 *(of->prevp) = of->next;
68 void of_pforkdesc( f )
76 for ( ofrefnum = 0; ofrefnum < nforks; ofrefnum++ ) {
77 if ( oforks[ ofrefnum ] != NULL ) {
78 fprintf( f, "%hu <%s>\n", ofrefnum, oforks[ ofrefnum ]->of_name);
83 int of_flush(const struct vol *vol)
90 for ( refnum = 0; refnum < nforks; refnum++ ) {
91 if (oforks[ refnum ] != NULL && (oforks[refnum]->of_vol == vol) &&
92 flushfork( oforks[ refnum ] ) < 0 ) {
93 LOG(log_error, logtype_afpd, "of_flush: %s", strerror(errno) );
100 int of_rename(vol, olddir, oldpath, newdir, newpath)
101 const struct vol *vol;
102 struct dir *olddir, *newdir;
103 const char *oldpath, *newpath;
105 struct ofork *of, *next, *d_ofork;
107 next = ofork_table[hashfn(oldpath)];
108 while ((of = next)) {
109 next = next->next; /* so we can unhash and still be all right. */
111 if ((vol == of->of_vol) && (olddir == of->of_dir) &&
112 (strcmp(of->of_name, oldpath) == 0)) {
114 strncpy( of->of_name, newpath, of->of_namelen);
115 of->of_d_prev->of_d_next = of->of_d_next;
116 of->of_d_next->of_d_prev = of->of_d_prev;
117 if (of->of_dir->d_ofork == of) {
118 of->of_dir->d_ofork = (of == of->of_d_next) ? NULL : of->of_d_next;
121 if (!(d_ofork = newdir->d_ofork)) {
122 newdir->d_ofork = of;
123 of->of_d_next = of->of_d_prev = of;
125 of->of_d_next = d_ofork;
126 of->of_d_prev = d_ofork->of_d_prev;
127 of->of_d_prev->of_d_next = of;
128 d_ofork->of_d_prev = of;
137 #define min(a,b) ((a)<(b)?(a):(b))
140 of_alloc(vol, dir, path, ofrefnum, eid, ad)
148 struct ofork *of, *d_ofork;
149 u_int16_t refnum, of_refnum;
154 nforks = (getdtablesize() - 10) / 2;
155 /* protect against insane ulimit -n */
156 nforks = min(nforks, 0xffff);
157 oforks = (struct ofork **) calloc(nforks, sizeof(struct ofork *));
162 for ( refnum = ++lastrefnum, i = 0; i < nforks; i++, refnum++ ) {
163 /* cf AFP3.0.pdf, File fork page 40 */
166 if ( oforks[ refnum % nforks ] == NULL ) {
170 /* grr, Apple and their 'uniquely identifies'
171 the next line is a protection against
186 same if lastrefnum++ rather than ++lastrefnum.
190 LOG(log_error, logtype_afpd, "of_alloc: maximum number of forks exceeded.");
194 of_refnum = refnum % nforks;
195 if (( oforks[ of_refnum ] =
196 (struct ofork *)malloc( sizeof( struct ofork ))) == NULL ) {
197 LOG(log_error, logtype_afpd, "of_alloc: malloc: %s", strerror(errno) );
200 of = oforks[of_refnum];
202 /* see if we need to allocate space for the adouble struct */
204 ad = malloc( sizeof( struct adouble ) );
206 LOG(log_error, logtype_afpd, "of_alloc: malloc: %s", strerror(errno) );
210 /* initialize to zero. This is important to ensure that
211 ad_open really does reinitialize the structure. */
212 memset( ad, 0, sizeof( struct adouble ) );
214 /* Increase the refcount on this struct adouble. This is
215 decremented again in oforc_dealloc. */
224 if (!(d_ofork = dir->d_ofork)) {
226 of->of_d_next = of->of_d_prev = of;
228 of->of_d_next = d_ofork;
229 of->of_d_prev = d_ofork->of_d_prev;
230 d_ofork->of_d_prev->of_d_next = of;
231 d_ofork->of_d_prev = of;
234 /* here's the deal: we allocate enough for the standard mac file length.
235 * in the future, we'll reallocate in fairly large jumps in case
236 * of long unicode names */
237 if (( of->of_name =(char *)malloc(255 + 1)) ==
239 LOG(log_error, logtype_afpd, "of_alloc: malloc: %s", strerror(errno) );
243 oforks[ of_refnum ] = NULL;
246 strncpy( of->of_name, path, of->of_namelen = 255 + 1);
248 of->of_refnum = refnum;
251 if (eid == ADEID_DFORK)
252 of->of_flags = AFPFORK_DATA;
254 of->of_flags = AFPFORK_RSRC;
259 struct ofork *of_find(const u_int16_t ofrefnum )
261 if (!oforks || !nforks)
264 return( oforks[ ofrefnum % nforks ] );
267 /* --------------------------
268 FIXME it doesn't work :-(
269 mac1 open file "test" with simple text
270 mac2 rename "test" ==> "test1"
272 now of_findname return NULL
277 of_findname(const struct vol *vol, const struct dir *dir, const char *name)
281 for (of = ofork_table[hashfn(name)]; of; of = of->next) {
282 if ((vol == of->of_vol) && (dir == of->of_dir) &&
283 (strcmp(of->of_name, name) == 0))
291 void of_dealloc( of )
300 of->of_d_prev->of_d_next = of->of_d_next;
301 of->of_d_next->of_d_prev = of->of_d_prev;
302 if (of->of_dir->d_ofork == of) {
303 of->of_dir->d_ofork = (of == of->of_d_next) ? NULL : of->of_d_next;
306 oforks[ of->of_refnum % nforks ] = NULL;
309 /* decrease refcount */
310 of->of_ad->ad_refcount--;
312 if ( of->of_ad->ad_refcount <= 0) {
314 } else {/* someone's still using it. just free this user's locks */
315 ad_unlock(of->of_ad, of->of_refnum);