summaryrefslogtreecommitdiff
path: root/src/cache.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/cache.c')
-rw-r--r--src/cache.c405
1 files changed, 405 insertions, 0 deletions
diff --git a/src/cache.c b/src/cache.c
new file mode 100644
index 0000000..7c41e54
--- /dev/null
+++ b/src/cache.c
@@ -0,0 +1,405 @@
+/*
+ * (C) 2006-2011 by Pablo Neira Ayuso <pablo@netfilter.org>
+ * (C) 2011 by Vyatta Inc. <http://www.vyatta.com>
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ */
+
+#include "cache.h"
+#include "jhash.h"
+#include "hash.h"
+#include "log.h"
+#include "conntrackd.h"
+
+#include <libnetfilter_conntrack/libnetfilter_conntrack.h>
+#include <errno.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+
+struct cache_feature *cache_feature[CACHE_MAX_FEATURE] = {
+ [TIMER_FEATURE] = &timer_feature,
+};
+
+struct cache *cache_create(const char *name, enum cache_type type,
+ unsigned int features,
+ struct cache_extra *extra,
+ struct cache_ops *ops)
+{
+ size_t size = sizeof(struct cache_object);
+ int i, j = 0;
+ struct cache *c;
+ struct cache_feature *feature_array[CACHE_MAX_FEATURE] = {};
+ unsigned int feature_offset[CACHE_MAX_FEATURE] = {};
+ unsigned int feature_type[CACHE_MAX_FEATURE] = {};
+
+ if (type == CACHE_T_NONE || type >= CACHE_T_MAX)
+ return NULL;
+
+ c = malloc(sizeof(struct cache));
+ if (!c)
+ return NULL;
+ memset(c, 0, sizeof(struct cache));
+
+ strcpy(c->name, name);
+ c->type = type;
+
+ for (i = 0; i < CACHE_MAX_FEATURE; i++) {
+ if ((1 << i) & features) {
+ feature_array[j] = cache_feature[i];
+ feature_offset[j] = size;
+ feature_type[i] = j;
+ size += cache_feature[i]->size;
+ j++;
+ }
+ }
+
+ memcpy(c->feature_type, feature_type, sizeof(feature_type));
+
+ c->features = malloc(sizeof(struct cache_feature) * j);
+ if (!c->features) {
+ free(c);
+ return NULL;
+ }
+ memcpy(c->features, feature_array, sizeof(struct cache_feature) * j);
+ c->num_features = j;
+
+ c->extra_offset = size;
+ c->extra = extra;
+ if (extra)
+ size += extra->size;
+
+ c->feature_offset = malloc(sizeof(unsigned int) * j);
+ if (!c->feature_offset) {
+ free(c->features);
+ free(c);
+ return NULL;
+ }
+ memcpy(c->feature_offset, feature_offset, sizeof(unsigned int) * j);
+
+ if (!ops || !ops->hash || !ops->cmp ||
+ !ops->alloc || !ops->copy || !ops->free) {
+ free(c->feature_offset);
+ free(c->features);
+ free(c);
+ return NULL;
+ }
+ c->ops = ops;
+
+ c->h = hashtable_create(CONFIG(hashsize),
+ CONFIG(limit),
+ c->ops->hash,
+ c->ops->cmp);
+ if (!c->h) {
+ free(c->features);
+ free(c->feature_offset);
+ free(c);
+ return NULL;
+ }
+ c->object_size = size;
+
+ return c;
+}
+
+void cache_destroy(struct cache *c)
+{
+ cache_flush(c);
+ hashtable_destroy(c->h);
+ free(c->features);
+ free(c->feature_offset);
+ free(c);
+}
+
+struct cache_object *cache_object_new(struct cache *c, void *ptr)
+{
+ struct cache_object *obj;
+
+ obj = calloc(c->object_size, 1);
+ if (obj == NULL) {
+ errno = ENOMEM;
+ c->stats.add_fail_enomem++;
+ return NULL;
+ }
+ obj->cache = c;
+
+ obj->ptr = c->ops->alloc();
+ if (obj->ptr == NULL) {
+ free(obj);
+ errno = ENOMEM;
+ c->stats.add_fail_enomem++;
+ return NULL;
+ }
+ c->ops->copy(obj->ptr, ptr, NFCT_CP_OVERRIDE);
+ obj->status = C_OBJ_NONE;
+ c->stats.objects++;
+
+ return obj;
+}
+
+void cache_object_free(struct cache_object *obj)
+{
+ obj->cache->stats.objects--;
+ obj->cache->ops->free(obj->ptr);
+
+ free(obj);
+}
+
+int cache_object_put(struct cache_object *obj)
+{
+ if (--obj->refcnt == 0) {
+ cache_del(obj->cache, obj);
+ cache_object_free(obj);
+ return 1;
+ }
+ return 0;
+}
+
+void cache_object_get(struct cache_object *obj)
+{
+ obj->refcnt++;
+}
+
+void cache_object_set_status(struct cache_object *obj, int status)
+{
+ if (status == C_OBJ_DEAD) {
+ obj->cache->stats.del_ok++;
+ obj->cache->stats.active--;
+ }
+ obj->status = status;
+}
+
+static int __add(struct cache *c, struct cache_object *obj, int id)
+{
+ int ret;
+ unsigned int i;
+ char *data = obj->data;
+
+ ret = hashtable_add(c->h, &obj->hashnode, id);
+ if (ret == -1)
+ return -1;
+
+ for (i = 0; i < c->num_features; i++) {
+ c->features[i]->add(obj, data);
+ data += c->features[i]->size;
+ }
+
+ if (c->extra && c->extra->add)
+ c->extra->add(obj, ((char *) obj) + c->extra_offset);
+
+ c->stats.active++;
+ obj->lifetime = obj->lastupdate = time_cached();
+ obj->status = C_OBJ_NEW;
+ obj->refcnt++;
+ return 0;
+}
+
+int cache_add(struct cache *c, struct cache_object *obj, int id)
+{
+ int ret;
+
+ ret = __add(c, obj, id);
+ if (ret == -1) {
+ c->stats.add_fail++;
+ if (errno == ENOSPC)
+ c->stats.add_fail_enospc++;
+ return -1;
+ }
+ c->stats.add_ok++;
+ return 0;
+}
+
+void cache_update(struct cache *c, struct cache_object *obj, int id, void *ptr)
+{
+ char *data = obj->data;
+ unsigned int i;
+
+ c->ops->copy(obj->ptr, ptr, NFCT_CP_META);
+
+ for (i = 0; i < c->num_features; i++) {
+ c->features[i]->update(obj, data);
+ data += c->features[i]->size;
+ }
+
+ if (c->extra && c->extra->update)
+ c->extra->update(obj, ((char *) obj) + c->extra_offset);
+
+ c->stats.upd_ok++;
+ obj->lastupdate = time_cached();
+ obj->status = C_OBJ_ALIVE;
+}
+
+static void __del(struct cache *c, struct cache_object *obj)
+{
+ unsigned i;
+ char *data = obj->data;
+
+ for (i = 0; i < c->num_features; i++) {
+ c->features[i]->destroy(obj, data);
+ data += c->features[i]->size;
+ }
+
+ if (c->extra && c->extra->destroy)
+ c->extra->destroy(obj, ((char *) obj) + c->extra_offset);
+
+ hashtable_del(c->h, &obj->hashnode);
+}
+
+void cache_del(struct cache *c, struct cache_object *obj)
+{
+ /*
+ * Do not increase stats if we are trying to
+ * kill an entry was previously deleted via
+ * __cache_del_timer.
+ */
+ if (obj->status != C_OBJ_DEAD) {
+ c->stats.del_ok++;
+ c->stats.active--;
+ }
+ __del(c, obj);
+}
+
+struct cache_object *cache_update_force(struct cache *c, void *ptr)
+{
+ struct cache_object *obj;
+ int id;
+
+ obj = cache_find(c, ptr, &id);
+ if (obj) {
+ if (obj->status != C_OBJ_DEAD) {
+ cache_update(c, obj, id, ptr);
+ return obj;
+ } else {
+ cache_del(c, obj);
+ cache_object_free(obj);
+ }
+ }
+ obj = cache_object_new(c, ptr);
+ if (obj == NULL)
+ return NULL;
+
+ if (cache_add(c, obj, id) == -1) {
+ cache_object_free(obj);
+ return NULL;
+ }
+
+ return obj;
+}
+
+struct cache_object *cache_find(struct cache *c, void *ptr, int *id)
+{
+ *id = hashtable_hash(c->h, ptr);
+ return ((struct cache_object *) hashtable_find(c->h, ptr, *id));
+}
+
+void *cache_get_extra(struct cache_object *obj)
+{
+ return (char*)obj + obj->cache->extra_offset;
+}
+
+void cache_stats(const struct cache *c, int fd)
+{
+ char buf[512];
+ int size;
+
+ size = sprintf(buf, "cache %s:\n"
+ "current active connections:\t%12u\n"
+ "connections created:\t\t%12u\tfailed:\t%12u\n"
+ "connections updated:\t\t%12u\tfailed:\t%12u\n"
+ "connections destroyed:\t\t%12u\tfailed:\t%12u\n\n",
+ c->name,
+ c->stats.active,
+ c->stats.add_ok,
+ c->stats.add_fail,
+ c->stats.upd_ok,
+ c->stats.upd_fail,
+ c->stats.del_ok,
+ c->stats.del_fail);
+ send(fd, buf, size, 0);
+}
+
+void cache_stats_extended(const struct cache *c, int fd)
+{
+ char buf[512];
+ int size;
+
+ size = snprintf(buf, sizeof(buf),
+ "cache:%s\tactive objects:\t\t%12u\n"
+ "\tactive/total entries:\t\t%12u/%12u\n"
+ "\tcreation OK/failed:\t\t%12u/%12u\n"
+ "\t\tno memory available:\t%12u\n"
+ "\t\tno space left in cache:\t%12u\n"
+ "\tupdate OK/failed:\t\t%12u/%12u\n"
+ "\t\tentry not found:\t%12u\n"
+ "\tdeletion created/failed:\t%12u/%12u\n"
+ "\t\tentry not found:\t%12u\n\n",
+ c->name, c->stats.objects,
+ c->stats.active, hashtable_counter(c->h),
+ c->stats.add_ok,
+ c->stats.add_fail,
+ c->stats.add_fail_enomem,
+ c->stats.add_fail_enospc,
+ c->stats.upd_ok,
+ c->stats.upd_fail,
+ c->stats.upd_fail_enoent,
+ c->stats.del_ok,
+ c->stats.del_fail,
+ c->stats.del_fail_enoent);
+
+ send(fd, buf, size, 0);
+}
+
+void cache_iterate(struct cache *c,
+ void *data,
+ int (*iterate)(void *data1, void *data2))
+{
+ hashtable_iterate(c->h, data, iterate);
+}
+
+void cache_iterate_limit(struct cache *c, void *data,
+ uint32_t from, uint32_t steps,
+ int (*iterate)(void *data1, void *data2))
+{
+ hashtable_iterate_limit(c->h, data, from, steps, iterate);
+}
+
+void cache_dump(struct cache *c, int fd, int type)
+{
+ struct __dump_container tmp = {
+ .fd = fd,
+ .type = type
+ };
+ hashtable_iterate(c->h, (void *) &tmp, c->ops->dump_step);
+}
+
+int cache_commit(struct cache *c, struct nfct_handle *h, int clientfd)
+{
+ return c->ops->commit(c, h, clientfd);
+}
+
+static int do_flush(void *data, void *n)
+{
+ struct cache *c = data;
+ struct cache_object *obj = n;
+
+ cache_del(c, obj);
+ cache_object_free(obj);
+ return 0;
+}
+
+void cache_flush(struct cache *c)
+{
+ hashtable_iterate(c->h, c, do_flush);
+ c->stats.flush++;
+}
generated by cgit v1.2.3 (git 2.39.1) at 2024-11-12 21:01:55 +0000