blob: 9093d73e2bfa2d3a9c692eecb75711757e35a38c (
plain)
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
|
/*
* Ouroboros - Copyright (C) 2016 - 2022
*
* Packet forwarding table (PFT) with chaining on collisions
*
* Dimitri Staessens <dimitri@ouroboros.rocks>
* Sander Vrijders <sander@ouroboros.rocks>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* 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., http://www.fsf.org/about/contact/.
*/
#ifndef OUROBOROS_PFT_H
#define OUROBOROS_PFT_H
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
struct pft;
/* Buckets is rounded up to the nearest power of 2 */
struct pft * pft_create(uint64_t buckets,
bool hash_key);
void pft_destroy(struct pft * table);
void pft_flush(struct pft * table);
/* Passes ownership of the block of memory */
int pft_insert(struct pft * pft,
uint64_t dst,
int * fds,
size_t len);
/* The block of memory returned is no copy */
int pft_lookup(struct pft * pft,
uint64_t dst,
int ** fds,
size_t * len);
int pft_delete(struct pft * pft,
uint64_t dst);
#endif /* OUROBOROS_PFT_H */
|
