| /* |
| * Copyright (C) 2014, Steven Rostedt <srostedt@redhat.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; version 2 of the License (not later!) |
| * |
| * 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, see <http://www.gnu.org/licenses> |
| * |
| * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ |
| */ |
| #include <stdio.h> |
| #include <stdlib.h> |
| #include <string.h> |
| #include <stdarg.h> |
| #include <errno.h> |
| |
| #include "trace-hash.h" |
| |
| int trace_hash_init(struct trace_hash *hash, int buckets) |
| { |
| memset(hash, 0, sizeof(*hash)); |
| |
| hash->buckets = calloc(sizeof(*hash->buckets), buckets); |
| if (!hash->buckets) |
| return -ENOMEM; |
| hash->nr_buckets = buckets; |
| |
| /* If a power of two then we can shortcut */ |
| if (!(buckets & (buckets - 1))) |
| hash->power = buckets - 1; |
| |
| return 0; |
| } |
| |
| void trace_hash_free(struct trace_hash *hash) |
| { |
| free(hash->buckets); |
| } |
| |
| int trace_hash_add(struct trace_hash *hash, struct trace_hash_item *item) |
| { |
| struct trace_hash_item *next; |
| int bucket = hash->power ? item->key & hash->power : |
| item->key % hash->nr_buckets; |
| |
| if (hash->buckets[bucket]) { |
| next = hash->buckets[bucket]; |
| next->prev = item; |
| } else |
| next = NULL; |
| |
| item->next = next; |
| item->prev = (struct trace_hash_item *)&hash->buckets[bucket]; |
| |
| hash->buckets[bucket] = item; |
| |
| return 1; |
| } |
| |
| struct trace_hash_item * |
| trace_hash_find(struct trace_hash *hash, unsigned long long key, |
| trace_hash_func match, void *data) |
| { |
| struct trace_hash_item *item; |
| int bucket = hash->power ? key & hash->power : |
| key % hash->nr_buckets; |
| |
| for (item = hash->buckets[bucket]; item; item = item->next) { |
| if (item->key == key) { |
| if (!match) |
| return item; |
| if (match(item, data)) |
| return item; |
| } |
| } |
| |
| return NULL; |
| } |