#include "log.h"
#include "utils.h"
#include "module.h"
-#include "tiger.h"
#include "net.h"
#include "sysevents.h"
+#include <tiger.h>
struct scanstate
{
static int conf_share(int argc, wchar_t **argv);
static void freecache(struct sharecache *node);
static void checkhashes(void);
+static void writehashcache(int now);
static struct configvar myvars[] =
{
static struct scanqueue *scanqueue = NULL;
static struct sharepoint *shares = NULL;
static struct hashcache *hashcache = NULL;
+static struct timer *hashwritetimer = NULL;
/* Set initially to -1, but changed to 0 the first time run() is
* called. This is to avoid forking a hash job before daemonizing,
* since that would make the daemon unable to wait() for the hash
}
if(filldef)
{
- if((hcname = icswcstombs(confgetstr("cli", "hashcache"), NULL, NULL)) != NULL)
- {
- strcpy(ret, hcname);
- return(ret);
- } else if(getenv("HOME") != NULL) {
+ if(getenv("HOME") != NULL)
snprintf(ret, sizeof(ret), "%s/.dc-hashcache", getenv("HOME"));
- } else {
+ else
snprintf(ret, sizeof(ret), "/etc/%s", hcname);
- }
return(ret);
} else {
return(NULL);
fclose(stream);
}
-static void writehashcache(void)
+static void hashtimercb(int cancelled, void *uudata)
+{
+ hashwritetimer = NULL;
+ if(!cancelled)
+ writehashcache(1);
+}
+
+static void writehashcache(int now)
{
char *buf;
char *hcname;
FILE *stream;
struct hashcache *hc;
+ if(!now)
+ {
+ if(hashwritetimer == NULL)
+ hashwritetimer = timercallback(ntime() + 300, (void (*)(int, void *))hashtimercb, NULL);
+ return;
+ }
+ if(hashwritetimer != NULL)
+ canceltimer(hashwritetimer);
hcname = findhashcachefile(1);
if((stream = fopen(hcname, "w")) == NULL)
{
buf = base64decode(wv[3], NULL);
memcpy(hc->tth, buf, 24);
free(buf);
- writehashcache();
+ writehashcache(0);
}
memmove(hashbuf, lp, hashbufdata -= (lp - hashbuf));
}
continue;
if(!node->f.b.hastth)
{
- if((hc = findhashcache(node->dev, node->inode)) != NULL)
+ if(((hc = findhashcache(node->dev, node->inode)) != NULL) && (hc->mtime == node->mtime))
{
memcpy(node->hashtth, hc->tth, 24);
node->f.b.hastth = 1;