2 Copyright (c) 2010 Frank Lahm <franklahm@gmail.com>
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
17 #endif /* HAVE_CONFIG_H */
25 #include <atalk/util.h>
26 #include <atalk/cnid.h>
27 #include <atalk/logger.h>
28 #include <atalk/volume.h>
29 #include <atalk/directory.h>
30 #include <atalk/queue.h>
31 #include <atalk/bstrlib.h>
32 #include <atalk/bstradd.h>
35 #include "directory.h"
40 * Dircache and indexes
41 * ====================
42 * The maximum dircache size is:
43 * max(DEFAULT_MAX_DIRCACHE_SIZE, min(size, MAX_POSSIBLE_DIRCACHE_SIZE)).
44 * It is a hashtable which we use to store "struct dir"s in. If the cache get full, oldest
45 * entries are evicted in chunks of DIRCACHE_FREE.
46 * We have/need two indexes:
47 * - a DID/name index on the main dircache, another hashtable
48 * - a queue index on the dircache, for evicting the oldest entries
49 * The cache supports locking of struct dir elements through the DIRF_CACHELOCK flag. A dir
50 * locked this way wont ever be removed from the cache, so be careful.
52 * Sending SIGHUP to a afpd child causes it to dump the dircache to a file
53 * "/tmp/dircache.PID".
56 /********************************************************
57 * Local funcs and variables
58 ********************************************************/
60 /*****************************
63 static hash_t *dircache; /* The actual cache */
64 static unsigned int dircache_maxsize; /* cache maximum size */
67 static hash_val_t hash_vid_did(const void *key)
69 const struct dir *k = (const struct dir *)key;
70 hash_val_t hash = 2166136261;
72 hash ^= k->d_vid >> 8;
77 hash ^= k->d_did >> 24;
79 hash ^= (k->d_did >> 16) & 0xff;
81 hash ^= (k->d_did >> 8) & 0xff;
83 hash ^= (k->d_did >> 0) & 0xff;
89 static int hash_comp_vid_did(const void *key1, const void *key2)
91 const struct dir *k1 = key1;
92 const struct dir *k2 = key2;
94 return !(k1->d_did == k2->d_did && k1->d_vid == k2->d_vid);
97 /**************************************************
98 * DID/name index on dircache (another hashtable) */
100 static hash_t *index_didname;
103 #if (defined(__GNUC__) && defined(__i386__)) || defined(__WATCOMC__) \
104 || defined(_MSC_VER) || defined (__BORLANDC__) || defined (__TURBOC__)
105 #define get16bits(d) (*((const uint16_t *) (d)))
108 #if !defined (get16bits)
109 #define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) << 8) \
110 +(uint32_t)(((const uint8_t *)(d))[0]) )
113 static hash_val_t hash_didname(const void *p)
115 const struct dir *key = (const struct dir *)p;
116 const unsigned char *data = key->d_u_name->data;
117 int len = key->d_u_name->slen;
118 hash_val_t hash = key->d_pdid + key->d_vid;
125 for (;len > 0; len--) {
126 hash += get16bits (data);
127 tmp = (get16bits (data+2) << 11) ^ hash;
128 hash = (hash << 16) ^ tmp;
129 data += 2*sizeof (uint16_t);
133 /* Handle end cases */
135 case 3: hash += get16bits (data);
137 hash ^= data[sizeof (uint16_t)] << 18;
140 case 2: hash += get16bits (data);
144 case 1: hash += *data;
149 /* Force "avalanching" of final 127 bits */
160 static int hash_comp_didname(const void *k1, const void *k2)
162 const struct dir *key1 = (const struct dir *)k1;
163 const struct dir *key2 = (const struct dir *)k2;
165 return ! (key1->d_vid == key2->d_vid
166 && key1->d_pdid == key2->d_pdid
167 && (bstrcmp(key1->d_u_name, key2->d_u_name) == 0) );
170 /***************************
171 * queue index on dircache */
173 static q_t *index_queue; /* the index itself */
174 static unsigned int queue_count;
177 * @brief Remove a fixed number of (oldest) entries from the cache and indexes
179 * The default is to remove the 256 oldest entries from the cache.
180 * 1. Get the oldest entry
181 * 2. If it's in use ie open forks reference it or it's curdir requeue it,
182 * or it's locked (from catsearch) dont remove it
183 * 3. Remove the dir from the main cache and the didname index
184 * 4. Free the struct dir structure and all its members
186 static void dircache_evict(void)
188 int i = DIRCACHE_FREE_QUANTUM;
191 LOG(log_debug, logtype_afpd, "dircache: {starting cache eviction}");
194 if ((dir = (struct dir *)dequeue(index_queue)) == NULL) { /* 1 */
196 AFP_PANIC("dircache_evict");
202 || (dir->d_flags & DIRF_CACHELOCK)) { /* 2 */
203 if ((dir->qidx_node = enqueue(index_queue, dir)) == NULL) {
205 AFP_PANIC("dircache_evict");
211 dircache_remove(NULL, dir, DIRCACHE | DIDNAME_INDEX); /* 3 */
212 dir_free(dir); /* 4 */
215 AFP_ASSERT(queue_count == dircache->hash_nodecount);
217 LOG(log_debug, logtype_afpd, "dircache: {finished cache eviction}");
221 /********************************************************
223 ********************************************************/
226 * @brief Search the dircache via a DID
228 * @param vol (r) pointer to struct vol
229 * @param did (r) CNID of the directory
231 * @returns Pointer to struct dir if found, else NULL
233 struct dir *dircache_search_by_did(const struct vol *vol, cnid_t did)
235 struct dir *cdir = NULL;
240 AFP_ASSERT(ntohl(did) >= CNID_START);
242 key.d_vid = vol->v_vid;
244 if ((hn = hash_lookup(dircache, &key)))
245 cdir = hnode_get(hn);
248 LOG(log_debug, logtype_afpd, "dircache(did:%u): {cached: path:'%s'}",
249 ntohl(did), cfrombstring(cdir->d_u_name));
251 LOG(log_debug, logtype_afpd, "dircache(did:%u): {not in cache}", ntohl(did));
257 * @brief Search the cache via did/name hashtable
259 * @param vol (r) volume
260 * @param dir (r) directory
261 * @param name (r) name (server side encoding)
262 * @parma len (r) strlen of name
264 * @returns pointer to struct dir if found in cache, else NULL
266 struct dir *dircache_search_by_name(const struct vol *vol, const struct dir *dir, char *name, int len)
268 struct dir *cdir = NULL;
271 static_bstring uname = {-1, len, (unsigned char *)name};
276 AFP_ASSERT(len == strlen(name));
277 AFP_ASSERT(len < 256);
279 LOG(log_debug, logtype_afpd, "dircache_search_by_name(did:%u, \"%s\")",
280 ntohl(dir->d_did), name);
282 if (dir->d_did != DIRDID_ROOT_PARENT) {
283 key.d_vid = vol->v_vid;
284 key.d_pdid = dir->d_did;
285 key.d_u_name = &uname;
287 if ((hn = hash_lookup(index_didname, &key)))
288 cdir = hnode_get(hn);
292 LOG(log_debug, logtype_afpd, "dircache(did:%u, '%s'): {found in cache}",
293 ntohl(dir->d_did), name);
295 LOG(log_debug, logtype_afpd, "dircache(did:%u,'%s'): {not in cache}",
296 ntohl(dir->d_did), name);
302 * @brief create struct dir from struct path
304 * Add a struct dir to the cache and its indexes.
306 * @param dir (r) pointer to parrent directory
308 * @returns 0 on success, -1 on error which should result in an abort
310 int dircache_add(struct dir *dir)
313 AFP_ASSERT(ntohl(dir->d_pdid) >= 2);
314 AFP_ASSERT(ntohl(dir->d_did) >= CNID_START);
315 AFP_ASSERT(dir->d_u_name);
316 AFP_ASSERT(dir->d_vid);
317 AFP_ASSERT(dircache->hash_nodecount <= dircache_maxsize);
319 /* Check if cache is full */
320 if (dircache->hash_nodecount == dircache_maxsize)
323 /* Add it to the main dircache */
324 if (hash_alloc_insert(dircache, dir, dir) == 0) {
329 /* Add it to the did/name index */
330 if (hash_alloc_insert(index_didname, dir, dir) == 0) {
335 /* Add it to the fifo queue index */
336 if ((dir->qidx_node = enqueue(index_queue, dir)) == NULL) {
343 LOG(log_debug, logtype_afpd, "dircache(did:%u,'%s'): {added}", ntohl(dir->d_did), cfrombstring(dir->d_u_name));
345 AFP_ASSERT(queue_count == index_didname->hash_nodecount
346 && queue_count == dircache->hash_nodecount);
352 * @brief Remove an entry from the dircache
354 * Callers outside of dircache.c should call this with
355 * flags = QUEUE_INDEX | DIDNAME_INDEX | DIRCACHE.
357 void dircache_remove(const struct vol *vol _U_, struct dir *dir, int flags)
362 AFP_ASSERT((flags & ~(QUEUE_INDEX | DIDNAME_INDEX | DIRCACHE)) == 0);
364 if (dir->d_flags & DIRF_CACHELOCK)
367 if (flags & QUEUE_INDEX) {
368 /* remove it from the queue index */
369 dequeue(dir->qidx_node->prev); /* this effectively deletes the dequeued node */
373 if (flags & DIDNAME_INDEX) {
374 if ((hn = hash_lookup(index_didname, dir)) == NULL) {
375 LOG(log_error, logtype_default, "dircache_remove(%u,%s): not in didname index",
376 ntohl(dir->d_did), dir->d_u_name);
378 AFP_PANIC("dircache_remove");
380 hash_delete_free(index_didname, hn);
383 if (flags & DIRCACHE) {
384 if ((hn = hash_lookup(dircache, dir)) == NULL) {
385 LOG(log_error, logtype_default, "dircache_remove(%u,%s): not in dircache",
386 ntohl(dir->d_did), dir->d_u_name);
388 AFP_PANIC("dircache_remove");
390 hash_delete_free(dircache, hn);
393 LOG(log_debug, logtype_afpd, "dircache(did:%u,'%s'): {removed}", ntohl(dir->d_did), dir->d_u_name);
395 AFP_ASSERT(queue_count == index_didname->hash_nodecount
396 && queue_count == dircache->hash_nodecount);
400 * @brief Initialize the dircache and indexes
402 * This is called in child afpd initialisation. The maximum cache size will be
403 * max(DEFAULT_MAX_DIRCACHE_SIZE, min(size, MAX_POSSIBLE_DIRCACHE_SIZE)).
404 * It initializes a hashtable which we use to store a directory cache in.
405 * It also initializes two indexes:
406 * - a DID/name index on the main dircache
407 * - a queue index on the dircache
409 * @param size (r) requested maximum size from afpd.conf
411 * @return 0 on success, -1 on error
413 int dircache_init(int reqsize)
415 dircache_maxsize = DEFAULT_MAX_DIRCACHE_SIZE;
417 /* Initialize the main dircache */
418 if (reqsize > DEFAULT_MAX_DIRCACHE_SIZE && reqsize < MAX_POSSIBLE_DIRCACHE_SIZE) {
419 while ((dircache_maxsize < MAX_POSSIBLE_DIRCACHE_SIZE) && (dircache_maxsize < reqsize))
420 dircache_maxsize *= 2;
422 if ((dircache = hash_create(dircache_maxsize, hash_comp_vid_did, hash_vid_did)) == NULL)
425 LOG(log_debug, logtype_afpd, "dircache_init: done. max dircache size: %u", dircache_maxsize);
427 /* Initialize did/name index hashtable */
428 if ((index_didname = hash_create(dircache_maxsize, hash_comp_didname, hash_didname)) == NULL)
431 /* Initialize index queue */
432 if ((index_queue = queue_init()) == NULL)
437 /* As long as directory.c hasn't got its own initializer call, we do it for it */
438 rootParent.d_did = DIRDID_ROOT_PARENT;
439 rootParent.d_fullpath = bfromcstr("ROOT_PARENT");
440 rootParent.d_m_name = bfromcstr("ROOT_PARENT");
441 rootParent.d_u_name = rootParent.d_m_name;
447 * @brief Dump dircache to /tmp/dircache.PID
449 void dircache_dump(void)
453 qnode_t *n = index_queue->next;
454 const struct dir *dir;
456 LOG(log_warning, logtype_afpd, "Dumping directory cache...");
458 sprintf(tmpnam, "/tmp/dircache.%u", getpid());
459 if ((dump = fopen(tmpnam, "w+")) == NULL) {
460 LOG(log_error, logtype_afpd, "dircache_dump: %s", strerror(errno));
465 fprintf(dump, "Number of cache entries: %u\n", queue_count);
466 fprintf(dump, "Configured maximum cache size: %u\n", dircache_maxsize);
467 fprintf(dump, "==================================================\n\n");
469 for (int i = 1; i <= queue_count; i++) {
470 if (n == index_queue)
472 dir = (struct dir *)n->data;
473 fprintf(dump, "%05u: vid:%u, pdid:%6u, did:%6u, path:%s, locked:%3s, oforks:%s\n",
474 i, ntohs(dir->d_vid), ntohl(dir->d_pdid), ntohl(dir->d_did),
475 cfrombstring(dir->d_u_name),
476 (dir->d_flags & DIRF_CACHELOCK) ? "yes" : "no",
477 dir->d_ofork ? "yes" : "no");