/*
- $Id: cache.c,v 1.4 2010-04-23 05:54:54 franklahm Exp $
Copyright (c) 2008,2009 Frank Lahm <franklahm@gmail.com>
This program is free software; you can redistribute it and/or modify
int i;
int ret = 0;
cacheduser_t *entry;
- char *uuidstring = NULL;
char timestr[200];
struct tm *tmp = NULL;
for ( i=0 ; i<256; i++) {
if ((entry = namecache[i]) != NULL) {
do {
- uuid_bin2string(entry->uuid, &uuidstring);
tmp = localtime(&entry->creationtime);
if (tmp == NULL)
continue;
if (strftime(timestr, 200, "%c", tmp) == 0)
continue;
LOG(log_debug9, logtype_default, "namecache{%d}: name:%s, uuid:%s, type: %s, cached: %s",
- i, entry->name, uuidstring, uuidtype[entry->type], timestr);
- free(uuidstring);
+ i, entry->name, uuid_bin2string(entry->uuid), uuidtype[entry->type], timestr);
} while ((entry = entry->next) != NULL);
}
}
for ( i=0; i<256; i++) {
if ((entry = uuidcache[i]) != NULL) {
do {
- uuid_bin2string(entry->uuid, &uuidstring);
+
tmp = localtime(&entry->creationtime);
if (tmp == NULL)
continue;
if (strftime(timestr, 200, "%c", tmp) == 0)
continue;
LOG(log_debug9, logtype_default, "uuidcache{%d}: uuid:%s, name:%s, type: %s, cached: %s",
- i, uuidstring, entry->name, uuidtype[entry->type], timestr);
- free(uuidstring);
+ i, uuid_bin2string(entry->uuid), entry->name, uuidtype[entry->type], timestr);
} while ((entry = entry->next) != NULL);
}
}
return index;
}
-/* hash uuid_t into unsigned char */
+/* hash atalk_uuid_t into unsigned char */
static unsigned char hashuuid(uuidp_t uuid) {
unsigned char index = 83;
int i;
cacheduser_t *entry;
unsigned char hash;
+#ifdef DEBUG
+ dumpcache();
+#endif
+
/* allocate mem and copy values */
name = malloc(strlen(inname)+1);
if (!name) {
if (cacheduser)
free(cacheduser);
}
+
+#ifdef DEBUG
+ dumpcache();
+#endif
+
return ret;
}
+/*
+ * Caller provides buffer uuid for result
+ */
int search_cachebyname( const char *name, uuidtype_t type, uuidp_t uuid) {
int ret;
unsigned char hash;
cacheduser_t *entry;
time_t tim;
+#ifdef DEBUG
+ dumpcache();
+#endif
+
hash = hashstring((unsigned char *)name);
if (! namecache[hash])
/* remove item */
if (entry->prev) /* 2nd to last in queue */
entry->prev->next = entry->next;
- else /* queue head */
- namecache[hash] = entry->next;
+ else { /* queue head */
+ if ((namecache[hash] = entry->next) != NULL)
+ namecache[hash]->prev = NULL;
+ }
free(entry->name);
free(entry->uuid);
free(entry);
+#ifdef DEBUG
+ dumpcache();
+#endif
return -1;
} else {
memcpy(uuid, entry->uuid, UUID_BINSIZE);
+#ifdef DEBUG
+ dumpcache();
+#endif
return 0;
}
}
entry = entry->next;
}
+#ifdef DEBUG
+ dumpcache();
+#endif
return -1;
}
+/*
+ * Caller must free allocated name
+ */
int search_cachebyuuid( uuidp_t uuidp, char **name, uuidtype_t *type) {
int ret;
unsigned char hash;
cacheduser_t *entry;
time_t tim;
+#ifdef DEBUG
+ dumpcache();
+#endif
+
hash = hashuuid(uuidp);
if (! uuidcache[hash])
if (ret == 0) {
tim = time(NULL);
if ((tim - entry->creationtime) > CACHESECONDS) {
- LOG(log_info, logtype_default, "search_cachebyuuid: expired: name:\'%s\' in queue {%d}", entry->name, hash);
- if (entry->prev)
+ LOG(log_debug, logtype_default, "search_cachebyuuid: expired: name:\'%s\' in queue {%d}", entry->name, hash);
+ if (entry->prev) /* 2nd to last in queue */
entry->prev->next = entry->next;
- else
- uuidcache[hash] = entry->next;
+ else { /* queue head */
+ if ((uuidcache[hash] = entry->next) != NULL)
+ uuidcache[hash]->prev = NULL;
+ }
free(entry->name);
free(entry->uuid);
free(entry);
+#ifdef DEBUG
+ dumpcache();
+#endif
return -1;
} else {
*name = malloc(strlen(entry->name)+1);
strcpy(*name, entry->name);
*type = entry->type;
+#ifdef DEBUG
+ dumpcache();
+#endif
return 0;
}
}
entry = entry->next;
}
+#ifdef DEBUG
+ dumpcache();
+#endif
+
return -1;
}
cacheduser_t *entry;
unsigned char hash;
+#ifdef DEBUG
+ dumpcache();
+#endif
+
/* allocate mem and copy values */
name = malloc(strlen(inname)+1);
if (!name) {
if (cacheduser)
free(cacheduser);
}
+
+#ifdef DEBUG
+ dumpcache();
+#endif
+
return ret;
}