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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
/*
// 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.
*/
#ifndef _FLOWTABLE_H_
#define _FLOWTABLE_H_
#include <inttypes.h>
#include <sys/time.h>
#include <stdio.h>
#include <cstring>
#include <vector>
#include <list>
#include <cstddef>
#include <utility>
#include "crc.hpp"
#include "timestamp.hpp"
using namespace std;
template <typename K, typename T>
class FlowTable {
public:
struct entry {
entry(K key, T value, const struct timeval& tv, list<struct entry> *parent) :
key(key), value(value), tv(tv), parent(parent) {}
bool expired(const Timestamp &now, const Timestamp &maxDiff) const
{
return now - Timestamp(tv) > maxDiff;
}
K key;
T value;
struct timeval tv; /* List time entry has been hit */
list<struct entry> *parent;
};
class Iterator {
friend class FlowTable;
public:
bool operator!=(const Iterator& other) {
return m_v != other.m_v ||
m_vec_pos != other.m_vec_pos ||
m_a != other.m_a;
}
Iterator& operator++() {
m_a++;
while (m_vec_pos != m_v->size() - 1 && m_a == (*m_v)[m_vec_pos].end()) {
m_vec_pos++;
m_a = (*m_v)[m_vec_pos].begin();
}
return *this;
}
struct entry &operator*() {
return *m_a;
}
private:
Iterator(uint32_t vec_pos, vector<list<struct entry> > *v)
: m_vec_pos(vec_pos), m_v(v)
{
m_a = (*m_v)[vec_pos].begin();
while (m_vec_pos != m_v->size() - 1 && m_a == (*m_v)[m_vec_pos].end()) {
m_vec_pos++;
m_a = (*m_v)[m_vec_pos].begin();
}
}
Iterator(uint32_t vec_pos, vector<list<struct entry> > *v, const typename list< struct entry>::iterator& a)
: m_vec_pos(vec_pos), m_v(v), m_a(a)
{ }
uint32_t m_vec_pos;
vector<list<struct entry> > *m_v;
typename list<struct entry>::iterator m_a;
};
uint32_t getEntryCount() const {return m_entryCount;}
FlowTable(uint32_t size);
void expire(const struct timeval& tv);
struct entry* lookup(const K& key);
void remove(struct FlowTable<K,T>::entry* entry);
struct entry* insert(const K& key, const T& value, const struct timeval& tv);
Iterator begin() {return Iterator(0, &m_elems);}
Iterator end() {return Iterator(m_elems.size() - 1, &m_elems, m_elems.back().end());}
void clear();
private:
void clearBucket(list<struct entry> *l);
vector<list<struct entry> > m_elems;
uint32_t m_entryCount;
};
template <typename K, typename T>
FlowTable<K, T>::FlowTable(uint32_t size)
: m_elems(), m_entryCount(0)
{
m_elems.resize(size);
}
template <typename K, typename T>
struct FlowTable<K, T>::entry* FlowTable<K, T>::lookup(const K& key)
{
uint32_t ret = crc32((uint8_t*)&key, sizeof(K), 0);
list<struct entry> &l = m_elems[ret % m_elems.size()];
if (l.empty())
return NULL;
for (typename list<struct entry>::iterator it = l.begin(); it != l.end(); ++it) {
if (memcmp(&((*it).key), &key, sizeof(key)) == 0)
return &(*it);
}
return NULL;
}
template <typename K, typename T>
struct FlowTable<K, T>::entry *FlowTable<K, T>::insert(const K& key, const T& value, const struct timeval& tv)
{
uint32_t ret = crc32((uint8_t*)&key, sizeof(K), 0);
list<struct entry> &l = m_elems[ret % m_elems.size()];
l.push_back(entry(key, value, tv, &l));
struct entry &n = l.back();
m_entryCount++;
n.key = key;
n.value = value;
return &n;
}
template <typename K, typename T>
void FlowTable<K, T>::remove(struct FlowTable<K,T>::entry* entry)
{
list<struct entry> &l = *entry->parent;
for (typename list<struct entry>::iterator it = l.begin(); it != l.end(); ++it) {
if (memcmp(&((*it).key), &entry->key, sizeof(entry->key)) == 0) {
l.erase(it);
m_entryCount--;
return ;
}
}
}
template <typename K, typename T>
void FlowTable<K, T>::clearBucket(list<struct entry> *l)
{
while (!l->empty()) {
m_entryCount--;
l->erase(l->begin());
}
}
template <typename K, typename T>
void FlowTable<K, T>::clear()
{
for (size_t i = 0; i < m_elems.size(); ++i) {
clearBucket(&m_elems[i]);
}
}
#endif /* _FLOWTABLE_H_ */
|
