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
|
/*
* Copyright (c) 2015 Cisco and/or its affiliates.
* 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.
*/
/*
Copyright (c) 2005 Eliot Dresselhaus
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include <vppinfra/phash.h>
#include <vppinfra/format.h>
#include <vppinfra/random.h>
static int verbose;
#define if_verbose(format,args...) \
if (verbose) { clib_warning(format, ## args); }
int
test_phash_main (unformat_input_t * input)
{
phash_main_t _pm = { 0 }, *pm = &_pm;
int n_keys, random_keys;
u32 seed;
clib_error_t *error;
random_keys = 1;
n_keys = 1000;
while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
{
if (0 == unformat (input, "keys %d", &n_keys)
&& 0 == unformat (input, "verbose %=", &verbose, 1)
&& 0 == unformat (input, "random-keys %=", &random_keys, 1)
&& 0 == unformat (input, "sequential-keys %=", &random_keys, 0)
&& 0 == unformat (input, "seed %d", &pm->random_seed)
&& 0 == unformat (input, "64-bit %|", &pm->flags, PHASH_FLAG_MIX64)
&& 0 == unformat (input, "32-bit %|", &pm->flags, PHASH_FLAG_MIX32)
&& 0 == unformat (input, "fast %|", &pm->flags,
PHASH_FLAG_FAST_MODE)
&& 0 == unformat (input, "slow %|", &pm->flags,
PHASH_FLAG_SLOW_MODE)
&& 0 == unformat (input, "minimal %|", &pm->flags,
PHASH_FLAG_MINIMAL)
&& 0 == unformat (input, "non-minimal %|", &pm->flags,
PHASH_FLAG_NON_MINIMAL))
clib_error ("unknown input `%U'", format_unformat_error, input);
}
if (!pm->random_seed)
pm->random_seed = random_default_seed ();
if_verbose
("%d %d-bit keys, random seed %d, %s mode, looking for %sminimal hash",
n_keys, (pm->flags & PHASH_FLAG_MIX64) ? 64 : 32, pm->random_seed,
(pm->flags & PHASH_FLAG_FAST_MODE) ? "fast" : "slow",
(pm->flags & PHASH
}
/*
* ip/ip6_neighbor.c: IP6 neighbor handling
*
* Copyright (c) 2010 Cisco and/or its affiliates.
* 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 <vnet/ip6-nd/ip6_nd.h>
#include <vnet/ip-neighbor/ip_neighbor.h>
#include <vnet/ip-neighbor/ip_neighbor_dp.h>
#include <vnet/fib/ip6_fib.h>
#include <vnet/ip/ip6_link.h>
#include <vnet/ip/ip6_ll_table.h>
/**
* @file
* @brief IPv6 Neighbor Adjacency and Neighbor Discovery.
*
* The files contains the API and CLI code for managing IPv6 neighbor
* adjacency tables and neighbor discovery logic.
*/
#define DEF_MAX_RADV_INTERVAL 200
#define DEF_MIN_RADV_INTERVAL .75 * DEF_MAX_RADV_INTERVAL
typedef struct ip6_nd_t_
{
/* local information */
u32 sw_if_index;
/* stats */
u32 n_solicitations_rcvd;
u32 n_solicitations_dropped;
} ip6_nd_t;
static ip6_link_delegate_id_t ip6_nd_delegate_id;
static ip6_nd_t *ip6_nd_pool;
typedef enum
{
ICMP6_NEIGHBOR_SOLICITATION_NEXT_DROP,
ICMP6_NEIGHBOR_SOLICITATION_NEXT_REPLY,
ICMP6_NEIGHBOR_SOLICITATION_N_NEXT,
} icmp6_neighbor_solicitation_or_advertisement_next_t;
static_always_inline uword
icmp6_neighbor_solicitation_or_advertisement (vlib_main_t * vm,
vlib_node_runtime_t * node,
vlib_frame_t * frame,
uword is_solicitation)
{
vnet_main_t *vnm = vnet_get_main ();
ip6_main_t *im = &ip6_main;
uword n_packets = frame->n_vectors;
u32 *from, *to_next;
u32 n_left_from, n_left_to_next, next_index, n_advertisements_sent;
icmp6_neighbor_discovery_option_type_t option_type;
vlib_node_runtime_t *error_node =
vlib_node_get_runtime (vm, ip6_icmp_input_node.index);
int bogus_length;
from = vlib_frame_vector_args (frame
|
