1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
/*
// Copyright (c) 2010-2017 Intel Corporation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
*/
#include <rte_hash_crc.h>
#include <string.h>
#include "prox_malloc.h"
#include "prox_assert.h"
#include "hash_set.h"
#define HASH_SET_ALLOC_CHUNCK 1024
#define HASH_SET_ALLOC_CHUNCK_MEM (sizeof(struct hash_set_entry) * 1024)
struct hash_set_entry {
uint32_t crc;
void *data;
size_t len;
struct hash_set_entry *next;
};
struct hash_set {
uint32_t n_buckets;
int socket_id;
struct hash_set_entry *alloc;
size_t alloc_count;
struct hash_set_entry *mem[0];
};
static struct hash_set_entry *hash_set_alloc_entry(struct hash_set *hs)
{
struct hash_set_entry *ret;
if (hs->alloc_count == 0) {
size_t mem_size = HASH_SET_ALLOC_CHUNCK *
sizeof(struct hash_set_entry);
hs->alloc = prox_zmalloc(mem_size, hs->socket_id);
hs->alloc_count = HASH_SET_ALLOC_CHUNCK;
}
ret = hs->alloc;
hs->alloc++;
hs->alloc_count--;
return ret;
}
struct hash_set *hash_set_create(uint32_t n_buckets, int socket_id)
{
struct hash_set *ret;
size_t mem_size = sizeof(*ret) + sizeof(ret->mem[0]) * n_buckets;
ret = prox_zmalloc(mem_size, socket_id);
ret->n_buckets = n_buckets;
ret->socket_id = socket_id;
return ret;
}
void *hash_set_find(struct hash_set *hs, void *data, size_t len)
{
uint32_t crc = rte_hash_crc(data, len, 0);
struct hash_set_entry *entry = hs->mem[crc % hs->n_buckets];
while (entry) {
if (entry->crc == crc && entry->len == len &&
memcmp(entry->data, data, len) == 0)
return entry->data;
entry = entry->next;
}
return NULL;
}
void hash_set_add(struct hash_set *hs, void *data, size_t len)
{
uint32_t crc = rte_hash_crc(data, len, 0);
struct hash_set_entry *new = hash_set_alloc_entry(hs);
new->data = data;
new->len = len;
new->crc = crc;
if (hs->mem[crc % hs->n_buckets]) {
struct hash_set_entry *entry = hs->mem[crc % hs->n_buckets];
while (entry->next)
entry = entry->next;
entry->next = new;
}
else {
hs->mem[crc % hs->n_buckets] = new;
}
}
|
