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
175
176
177
178
179
180
181
182
183
|
/* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */
/*
* Copyright (c) 1997 The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Network Research
* Group at Lawrence Berkeley National Laboratory.
* 4. Neither the name of the University nor of the Laboratory may be used
* to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $Header: /cvsroot/nsnam/ns-2/classifier/classifier-hash.h,v 1.10 2010/03/08 05:54:49 tom_henderson Exp $
*/
#include "classifier.h"
#include "ip.h"
class Flow;
/* class defs for HashClassifier (base), SrcDest, SrcDestFid HashClassifiers */
class HashClassifier : public Classifier {
public:
HashClassifier(int keylen) : default_(-1), keylen_(keylen) {
// shift + mask picked up from underlying Classifier object
bind("default_", &default_);
Tcl_InitHashTable(&ht_, keylen);
}
~HashClassifier() {
Tcl_DeleteHashTable(&ht_);
};
virtual int classify(Packet *p);
virtual long lookup(Packet* p) {
hdr_ip* h = hdr_ip::access(p);
return get_hash(mshift(h->saddr()), mshift(h->daddr()),
h->flowid());
}
virtual long unknown(Packet* p) {
hdr_ip* h = hdr_ip::access(p);
Tcl::instance().evalf("%s unknown-flow %u %u %u",
name(), h->saddr(), h->daddr(),
h->flowid());
return lookup(p);
};
void set_default(int slot) { default_ = slot; }
int do_set_hash(nsaddr_t src, nsaddr_t dst, int fid, int slot) {
return (set_hash(src,dst,fid,slot));
}
void set_table_size(int nn);
protected:
union hkey {
struct {
int fid;
} Fid;
struct {
nsaddr_t dst;
} Dst;
struct {
nsaddr_t src, dst;
} SrcDst;
struct {
nsaddr_t src, dst;
int fid;
} SrcDstFid;
};
long lookup(nsaddr_t src, nsaddr_t dst, int fid) {
return get_hash(src, dst, fid);
}
int newflow(Packet* pkt) {
hdr_ip* h = hdr_ip::access(pkt);
Tcl::instance().evalf("%s unknown-flow %u %u %u",
name(), h->saddr(), h->daddr(),
h->flowid());
return lookup(pkt);
};
void reset() {
Tcl_DeleteHashTable(&ht_);
Tcl_InitHashTable(&ht_, keylen_);
}
virtual const char* hashkey(nsaddr_t, nsaddr_t, int)=0;
int set_hash(nsaddr_t src, nsaddr_t dst, int fid, long slot) {
int newEntry;
Tcl_HashEntry *ep= Tcl_CreateHashEntry(&ht_,
hashkey(src, dst, fid),
&newEntry);
if (ep) {
Tcl_SetHashValue(ep, slot);
return slot;
}
return -1;
}
long get_hash(nsaddr_t src, nsaddr_t dst, int fid) {
Tcl_HashEntry *ep= Tcl_FindHashEntry(&ht_,
hashkey(src, dst, fid));
if (ep)
return (long)Tcl_GetHashValue(ep);
return -1;
}
virtual int command(int argc, const char*const* argv);
int default_;
Tcl_HashTable ht_;
hkey buf_;
int keylen_;
};
class SrcDestFidHashClassifier : public HashClassifier {
public:
SrcDestFidHashClassifier() : HashClassifier(3) {
}
protected:
const char* hashkey(nsaddr_t src, nsaddr_t dst, int fid) {
buf_.SrcDstFid.src= mshift(src);
buf_.SrcDstFid.dst= mshift(dst);
buf_.SrcDstFid.fid= fid;
return (const char*) &buf_;
}
};
class SrcDestHashClassifier : public HashClassifier {
public:
SrcDestHashClassifier() : HashClassifier(2) {
int command(int argc, const char*const* argv);
int classify(Packet *p);
}
protected:
const char* hashkey(nsaddr_t src, nsaddr_t dst, int) {
buf_.SrcDst.src= mshift(src);
buf_.SrcDst.dst= mshift(dst);
return (const char*) &buf_;
}
};
class FidHashClassifier : public HashClassifier {
public:
FidHashClassifier() : HashClassifier(TCL_ONE_WORD_KEYS) {
}
protected:
const char* hashkey(nsaddr_t, nsaddr_t, int fid) {
long key = fid;
return (const char*) key;
}
};
class DestHashClassifier : public HashClassifier {
public:
DestHashClassifier() : HashClassifier(TCL_ONE_WORD_KEYS) {}
virtual int command(int argc, const char*const* argv);
int classify(Packet *p);
virtual void do_install(char *dst, NsObject *target);
protected:
const char* hashkey(nsaddr_t, nsaddr_t dst, int) {
long key = mshift(dst);
return (const char*) key;
}
};
|
