aboutsummaryrefslogtreecommitdiffstats
path: root/src/vnet/ip/ip6_ll_table.c
blob: b3f42daf26c5191a0da24c97ebf3311f3edc12df (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
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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
/*
 * Copyright (c) 2018 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 <vlib/vlib.h>
#include <vnet/dpo/drop_dpo.h>
#include <vnet/fib/ip6_fib.h>

#include <vnet/ip/ip6_ll_table.h>

/**
 * There's only one IP6 link local table
 */
static ip6_ll_table_t ip6_ll_table;

u32
ip6_ll_fib_get (u32 sw_if_index)
{
  ASSERT (vec_len (ip6_ll_table.ilt_fibs) > sw_if_index);

  return (ip6_ll_table.ilt_fibs[sw_if_index]);
}

fib_node_index_t
ip6_ll_table_lookup (const ip6_ll_prefix_t * prefix)
{
  return (ip6_fib_table_lookup (ip6_ll_fib_get (prefix->ilp_sw_if_index),
				&prefix->ilp_addr, 128));
}

fib_node_index_t
ip6_ll_table_lookup_exact_match (const ip6_ll_prefix_t * prefix)
{
  return (ip6_fib_table_lookup_exact_match
	  (ip6_ll_fib_get (prefix->ilp_sw_if_index), &prefix->ilp_addr, 128));
}

static void
ip6_ll_fib_create (u32 sw_if_index)
{
  vnet_main_t *vnm = vnet_get_main ();
  u8 *desc;

  desc = format (NULL, "IP6-link-local:%U",
		 format_vnet_sw_interface_name,
		 vnm, vnet_get_sw_interface (vnm, sw_if_index));

  ip6_ll_table.ilt_fibs[sw_if_index] =
    ip6_fib_table_create_and_lock (FIB_SOURCE_IP6_ND,
				   FIB_TABLE_FLAG_IP6_LL, desc);

  /*
   * leave the default route as a drop, but fix fe::/10 to be a glean
   * via the interface.
   */
    /* *INDENT-OFF* */
    fib_prefix_t pfx = {
	.fp_proto = FIB_PROTOCOL_IP6,
	.fp_len = 10,
	.fp_addr = {
	    .ip6 = {
		.as_u8 = {
                    [0] = 0xFE,
                    [1] = 0x80,
                }
	    },
	}
    };
    fib_table_entry_update_one_path(
        ip6_ll_table.ilt_fibs[sw_if_index],
        &pfx,
        FIB_SOURCE_SPECIAL,
        (FIB_ENTRY_FLAG_ATTACHED |
         FIB_ENTRY_FLAG_NO_ATTACHED_EXPORT),
        DPO_PROTO_IP6,
        NULL,
        sw_if_index,
        ~0,
        1,
        NULL,
        FIB_ROUTE_PATH_FLAG_NONE);
    /* *INDENT-ON* */
}

static void
ip6_ll_prefix_to_fib (const ip6_ll_prefix_t * ilp, fib_prefix_t * fp)
{
  fp->fp_proto = FIB_PROTOCOL_IP6;
  fp->fp_len = 128;
  fp->fp_addr.ip6 = ilp->ilp_addr;
  fp->___fp___pad = 0;
}

fib_node_index_t
ip6_ll_table_entry_update (const ip6_ll_prefix_t * ilp,
			   fib_route_path_flags_t flags)
{
  fib_node_index_t ip6_ll_entry_index;
  fib_route_path_t *rpaths, rpath = {
    .frp_flags = flags,
    .frp_sw_if_index = ilp->ilp_sw_if_index,
    .frp_proto = DPO_PROTO_IP6,
  };
  fib_prefix_t fp;

  vec_validate_init_empty (ip6_ll_table.ilt_fibs, ilp->ilp_sw_if_index, ~0);

  if (~0 == ip6_ll_fib_get (ilp->ilp_sw_if_index))
    {
      ip6_ll_fib_create (ilp->ilp_sw_if_index);
    }

  rpaths = NULL;
  vec_add1 (rpaths, rpath);

  ip6_ll_prefix_to_fib (ilp, &fp);
  ip6_ll_entry_index =
    fib_table_entry_update (ip6_ll_fib_get (ilp->ilp_sw_if_index), &fp,
			    FIB_SOURCE_IP6_ND,
			    (flags & FIB_ROUTE_PATH_LOCAL ?
			     FIB_ENTRY_FLAG_LOCAL : FIB_ENTRY_FLAG_NONE),
			    rpaths);
  vec_free (rpaths);

  return (ip6_ll_entry_index);
}

void
ip6_ll_table_entry_delete (const ip6_ll_prefix_t * ilp)
{
  fib_node_index_t ip6_ll_entry_index;
  u32 fib_index;

  ip6_ll_entry_index = ip6_ll_table_lookup_exact_match (ilp);

  if (FIB_NODE_INDEX_INVALID != ip6_ll_entry_index)
    fib_table_entry_delete_index (ip6_ll_entry_index, FIB_SOURCE_IP6_ND);

  /*
   * if there are no ND sourced prefixes left, then we can clean up this FIB
   */
  fib_index = ip6_ll_fib_get (ilp->ilp_sw_if_index);
  if (~0 != fib_index &&
      0 == fib_table_get_num_entries (fib_index, FIB_PROTOCOL_IP6,
				      FIB_SOURCE_IP6_ND))
    {
      fib_table_unlock (fib_index, FIB_PROTOCOL_IP6, FIB_SOURCE_IP6_ND);
      ip6_ll_table.ilt_fibs[ilp->ilp_sw_if_index] = ~0;
    }
}

static void
ip6_ll_table_show_one (vlib_main_t * vm, ip6_ll_prefix_t * ilp, int detail)
{
  vlib_cli_output (vm, "%U",
		   format_fib_entry,
		   ip6_ll_table_lookup (ilp),
		   (detail ?
		    FIB_ENTRY_FORMAT_DETAIL2 : FIB_ENTRY_FORMAT_DETAIL));
}

typedef struct ip6_ll_show_ctx_t_
{
  fib_node_index_t *entries;
} ip6_ll_show_ctx_t;

static fib_table_walk_rc_t
ip6_ll_table_show_walk (fib_node_index_t fib_entry_index, void *arg)
{
  ip6_ll_show_ctx_t *ctx = arg;

  vec_add1 (ctx->entries, fib_entry_index);

  return (FIB_TABLE_WALK_CONTINUE);
}

static void
ip6_ll_table_show_all (vlib_main_t * vm, u32 fib_index)
{
  fib_node_index_t *fib_entry_index;
  ip6_ll_show_ctx_t ctx = {
    .entries = NULL,
  };

  fib_table_walk (fib_index, FIB_PROTOCOL_IP6, ip6_ll_table_show_walk, &ctx);
  vec_sort_with_function (ctx.entries, fib_entry_cmp_for_sort);

  vec_foreach (fib_entry_index, ctx.entries)
  {
    vlib_cli_output (vm, "%U",
		     format_fib_entry,
		     *fib_entry_index, FIB_ENTRY_FORMAT_BRIEF);
  }

  vec_free (ctx.entries);
}

typedef struct
{
  u32 fib_index;
  u64 count_by_prefix_length[129];
} count_routes_in_fib_at_prefix_length_arg_t;

static int
count_routes_in_fib_at_prefix_length (clib_bihash_kv_24_8_t * kvp, void *arg)
{
  count_routes_in_fib_at_prefix_length_arg_t *ap = arg;
  int mask_width;

  if ((kvp->key[2] >> 32) != ap->fib_index)
    return (BIHASH_WALK_CONTINUE);

  mask_width = kvp->key[2] & 0xFF;

  ap->count_by_prefix_length[mask_width]++;

  return (BIHASH_WALK_CONTINUE);
}

static clib_error_t *
ip6_ll_show_fib (vlib_main_t * vm,
		 unformat_input_t * input, vlib_cli_command_t * cmd)
{
  count_routes_in_fib_at_prefix_length_arg_t _ca, *ca = &_ca;
  fib_table_t *fib_table;
  int verbose, matching;
  ip6_address_t matching_address;
  u32 mask_len = 128;
  u32 sw_if_index = ~0;
  int detail = 0;
  vnet_main_t *vnm = vnet_get_main ();
  u32 fib_index;

  verbose = 1;
  matching = 0;

  while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
    {
      if (unformat (input, "brief") ||
	  unformat (input, "summary") || unformat (input, "sum"))
	verbose = 0;

      else if (unformat (input, "detail") || unformat (input, "det"))
	detail = 1;

      else if (unformat (input, "%U/%d",
			 unformat_ip6_address, &matching_address, &mask_len))
	matching = 1;

      else
	if (unformat (input, "%U", unformat_ip6_address, &matching_address))
	matching = 1;
      else if (unformat (input, "%U",
			 unformat_vnet_sw_interface, vnm, &sw_if_index))
	;
      else
	break;
    }

  vec_foreach_index (sw_if_index, ip6_ll_table.ilt_fibs)
  {
    fib_source_t source;
    u8 *s = NULL;

    fib_index = ip6_ll_table.ilt_fibs[sw_if_index];
    if (~0 == fib_index)
      continue;

    fib_table = fib_table_get (fib_index, FIB_PROTOCOL_IP6);

    if (!(fib_table->ft_flags & FIB_TABLE_FLAG_IP6_LL))
      continue;

    s = format (s, "%U, fib_index:%d, locks:[",
		format_fib_table_name, fib_index,
		FIB_PROTOCOL_IP6, fib_index);
    vec_foreach_index (source, fib_table->ft_locks)
    {
      if (0 != fib_table->ft_locks[source])
	{
	  s = format (s, "%U:%d, ",
		      format_fib_source, source, fib_table->ft_locks[source]);
	}
    }
    s = format (s, "]");
    vlib_cli_output (vm, "%v", s);
    vec_free (s);

    /* Show summary? */
    if (!verbose)
      {
	clib_bihash_24_8_t *h =
	  &ip6_fib_table[IP6_FIB_TABLE_NON_FWDING].ip6_hash;
	int len;

	vlib_cli_output (vm, "%=20s%=16s", "Prefix length", "Count");

	clib_memset (ca, 0, sizeof (*ca));
	ca->fib_index = fib_index;

	clib_bihash_foreach_key_value_pair_24_8
	  (h, count_routes_in_fib_at_prefix_length, ca);

	for (len = 128; len >= 0; len--)
	  {
	    if (ca->count_by_prefix_length[len])
	      vlib_cli_output (vm, "%=20d%=16lld",
			       len, ca->count_by_prefix_length[len]);
	  }
	continue;
      }

    if (!matching)
      {
	ip6_ll_table_show_all (vm, fib_index);
      }
    else
      {
	if (~0 == sw_if_index)
	  {
	    vlib_cli_output (vm, "specify the interface");
	  }
	else
	  {
	    ip6_ll_prefix_t ilp = {
	      .ilp_addr = matching_address,
	      .ilp_sw_if_index = sw_if_index,
	    };
	    ip6_ll_table_show_one (vm, &ilp, detail);
	  }
      }
  };

  return 0;
}

/* *INDENT-OFF* */
VLIB_CLI_COMMAND (ip6_show_fib_command, static) = {
    .path = "show ip6-ll",
    .short_help = "show ip6-ll [summary] [interface] [<ip6-addr>[/<width>]] [detail]",
    .function = ip6_ll_show_fib,
};
/* *INDENT-ON* */

static clib_error_t *
ip6_ll_sw_interface_add_del (vnet_main_t *vnm, u32 sw_if_index, u32 is_add)
{
  vec_validate_init_empty (ip6_ll_table.ilt_fibs, sw_if_index, ~0);

  return (NULL);
}

VNET_SW_INTERFACE_ADD_DEL_FUNCTION (ip6_ll_sw_interface_add_del);

static clib_error_t *
ip6_ll_module_init (vlib_main_t * vm)
{
  clib_error_t *error;

  error = vlib_call_init_function (vm, ip6_lookup_init);

  return (error);
}

VLIB_INIT_FUNCTION (ip6_ll_module_init);

/*
 * fd.io coding-style-patch-verification: ON
 *
 * Local Variables:
 * eval: (c-set-style "gnu")
 * End:
 */
_(VEC_VALIDATE); _(VEC_FREE); _(VEC_INIT); _(VEC_CLONE); _(VEC_APPEND); _(VEC_PREPEND); _(VEC_INIT_H); _(VEC_RESIZE_H); _(VEC_FREE_H); default: s = format (s, "Unknown vec op (%d)", op); break; } #undef _ return s; } static void dump_call_stats (uword * stats) { uword i; fformat (stdout, "Call Stats\n----------\n"); for (i = 0; i < OP_MAX; i++) fformat (stdout, "%-8d %U\n", stats[i], format_vec_op_type, i); } /* XXX - Purposely low value for debugging the validator. Will be set it to a more sensible value later. */ #define MAX_VEC_LEN 10 #define create_random_vec_wh(elt_type, len, hdr_bytes, seed) \ ({ \ elt_type * _v(v) = NULL; \ uword _v(l) = (len); \ uword _v(h) = (hdr_bytes); \ u8 * _v(hdr); \ \ if (_v(l) == 0) \ goto __done__; \ \ /* ~0 means select random length between 0 and MAX_VEC_LEN. */ \ if (_v(l) == ~0) \ _v(l) = bounded_random_u32 (&(seed), 0, MAX_VEC_LEN); \ \ _v(v) = _vec_resize (NULL, _v(l), _v(l) * sizeof (elt_type), _v(h), 0); \ fill_with_random_data (_v(v), vec_bytes (_v(v)), (seed)); \ \ /* Fill header with random data as well. */ \ if (_v(h) > 0) \ { \ _v(hdr) = vec_header (_v(v), _v(h)); \ fill_with_random_data (_v(hdr), _v(h), (seed)); \ } \ \ __done__: \ _v(v); \ }) #define create_random_vec(elt_type, len, seed) \ create_random_vec_wh (elt_type, len, 0, seed) #define compute_vec_hash(hash, vec) \ ({ \ u8 * _v(v) = (u8 *) (vec); \ uword _v(n) = vec_len (vec) * sizeof ((vec)[0]); \ u8 _v(hh) = (u8) (hash); \ \ compute_mem_hash (_v(hh), _v(v), _v(n)); \ }) static elt_t * validate_vec_free (elt_t * vec) { vec_free (vec); ASSERT (vec == NULL); return vec; } static elt_t * validate_vec_free_h (elt_t * vec, uword hdr_bytes) { vec_free_h (vec, hdr_bytes); ASSERT (vec == NULL); return vec; } static void validate_vec_hdr (elt_t * vec, uword hdr_bytes) { u8 *hdr; u8 *hdr_end; vec_header_t *vh; if (!vec) return; vh = _vec_find (vec); hdr = vec_header (vec, hdr_bytes); hdr_end = vec_header_end (hdr, hdr_bytes); ASSERT (hdr_end == (u8 *) vec); ASSERT ((u8 *) vh - (u8 *) hdr >= hdr_bytes); } static void validate_vec_len (elt_t * vec) { u8 *ptr; u8 *end; uword len; uword bytes; uword i; elt_t *elt; if (!vec) return; ptr = (u8 *) vec; end = (u8 *) vec_end (vec); len = vec_len (vec); bytes = sizeof (vec[0]) * len; ASSERT (bytes == vec_bytes (vec)); ASSERT ((ptr + bytes) == end); i = 0; /* XXX - TODO: confirm that auto-incrementing in vec_is_member() would not have the expected result. */ while (vec_is_member (vec, (__typeof__ (vec[0]) *) ptr)) { ptr++; i++; } ASSERT (ptr == end); ASSERT (i == bytes); i = 0; vec_foreach (elt, vec) i++; ASSERT (i == len); } static void validate_vec (elt_t * vec, uword hdr_bytes) { validate_vec_hdr (vec, hdr_bytes); validate_vec_len (vec); if (!vec || vec_len (vec) == 0) { VERBOSE3 ("Vector at %p has zero elements.\n\n", vec); } else { if (hdr_bytes > 0) VERBOSE3 ("Header: %U\n", format_hex_bytes, vec_header (vec, sizeof (vec[0])), sizeof (vec[0])); VERBOSE3 ("%U\n\n", format_hex_bytes, vec, vec_len (vec) * sizeof (vec[0])); } } static elt_t * validate_vec_resize (elt_t * vec, uword num_elts) { uword len1 = vec_len (vec); uword len2; u8 hash = compute_vec_hash (0, vec); vec_resize (vec, num_elts); len2 = vec_len (vec); ASSERT (len2 == len1 + num_elts); ASSERT (compute_vec_hash (hash, vec) == 0); validate_vec (vec, 0); return vec; } static elt_t * validate_vec_resize_h (elt_t * vec, uword num_elts, uword hdr_bytes) { uword len1, len2; u8 *end1, *end2; u8 *hdr = NULL; u8 hash, hdr_hash; len1 = vec_len (vec); if (vec) hdr = vec_header (vec, hdr_bytes); hash = compute_vec_hash (0, vec); hdr_hash = compute_mem_hash (0, hdr, hdr_bytes); vec_resize_ha (vec, num_elts, hdr_bytes, 0); len2 = vec_len (vec); ASSERT (len2 == len1 + num_elts); end1 = (u8 *) (vec + len1); end2 = (u8 *) vec_end (vec); while (end1 != end2) { ASSERT (*end1 == 0); end1++; } if (vec) hdr = vec_header (vec, hdr_bytes); ASSERT (compute_vec_hash (hash, vec) == 0); ASSERT (compute_mem_hash (hdr_hash, hdr, hdr_bytes) == 0); validate_vec (vec, 1); return vec; } static elt_t * generic_validate_vec_add (elt_t * vec, uword num_elts, uword is_add2) { uword len1 = vec_len (vec); uword len2; u8 hash = compute_vec_hash (0, vec); elt_t *new; if (is_add2) { vec_add2 (vec, new, num_elts); } else { new = create_random_vec (elt_t, num_elts, g_seed); VERBOSE3 ("%U\n", format_hex_bytes, new, vec_len (new) * sizeof (new[0])); /* Add the hash value of the new elements to that of the old vector. */ hash = compute_vec_hash (hash, new); if (num_elts == 1) vec_add1 (vec, new[0]); else if (num_elts > 1) vec_add (vec, new, num_elts); vec_free (new); } len2 = vec_len (vec); ASSERT (len2 == len1 + num_elts); ASSERT (compute_vec_hash (hash, vec) == 0); validate_vec (vec, 0); return vec; } static elt_t * validate_vec_add1 (elt_t * vec) { return generic_validate_vec_add (vec, 1, 0); } static elt_t * validate_vec_add2 (elt_t * vec, uword num_elts) { return generic_validate_vec_add (vec, num_elts, 1); } static elt_t * validate_vec_add (elt_t * vec, uword num_elts) { return generic_validate_vec_add (vec, num_elts, 0); } static elt_t * validate_vec_insert (elt_t * vec, uword num_elts, uword start_elt) { uword len1 = vec_len (vec); uword len2; u8 hash; /* vec_insert() would not handle it properly. */ if (start_elt > len1 || num_elts == 0) return vec; hash = compute_vec_hash (0, vec); vec_insert (vec, num_elts, start_elt); len2 = vec_len (vec); ASSERT (len2 == len1 + num_elts); ASSERT (compute_vec_hash (hash, vec) == 0); validate_vec (vec, 0); return vec; } static elt_t * validate_vec_insert_elts (elt_t * vec, uword num_elts, uword start_elt) { uword len1 = vec_len (vec); uword len2; elt_t *new; u8 hash; /* vec_insert_elts() would not handle it properly. */ if (start_elt > len1 || num_elts == 0) return vec; new = create_random_vec (elt_t, num_elts, g_seed); VERBOSE3 ("%U\n", format_hex_bytes, new, vec_len (new) * sizeof (new[0])); /* Add the hash value of the new elements to that of the old vector. */ hash = compute_vec_hash (0, vec); hash = compute_vec_hash (hash, new); vec_insert_elts (vec, new, num_elts, start_elt); len2 = vec_len (vec); vec_free (new); ASSERT (len2 == len1 + num_elts); ASSERT (compute_vec_hash (hash, vec) == 0); validate_vec (vec, 0); return vec; } static elt_t * validate_vec_delete (elt_t * vec, uword num_elts, uword start_elt) { uword len1 = vec_len (vec); uword len2; u8 *start; u8 hash; u8 hash_del; /* vec_delete() would not handle it properly. */ if (start_elt + num_elts > len1) return vec; start = (u8 *) vec + (start_elt * sizeof (vec[0])); hash = compute_vec_hash (0, vec); hash_del = compute_mem_hash (0, start, num_elts * sizeof (vec[0])); hash ^= hash_del; vec_delete (vec, num_elts, start_elt); len2 = vec_len (vec); ASSERT (len2 == len1 - num_elts); ASSERT (compute_vec_hash (hash, vec) == 0); validate_vec (vec, 0); return vec; } static elt_t * validate_vec_dup (elt_t * vec) { elt_t *new; u8 hash; hash = compute_vec_hash (0, vec); new = vec_dup (vec); ASSERT (compute_vec_hash (hash, new) == 0); validate_vec (new, 0); return new; } static elt_t * validate_vec_zero (elt_t * vec) { u8 *ptr; u8 *end; vec_zero (vec); ptr = (u8 *) vec; end = (u8 *) (vec + vec_len (vec)); while (ptr != end) { ASSERT (ptr < (u8 *) vec_end (vec)); ASSERT (ptr[0] == 0); ptr++; } validate_vec (vec, 0); return vec; } static void validate_vec_is_equal (elt_t * vec) { elt_t *new = NULL; if (vec_len (vec) <= 0) return; new = vec_dup (vec); ASSERT (vec_is_equal (new, vec)); vec_free (new); } static elt_t * validate_vec_set (elt_t * vec) { uword i; uword len = vec_len (vec); elt_t *new; if (!vec) return NULL; new = create_random_vec (elt_t, 1, g_seed); VERBOSE3 ("%U\n", format_hex_bytes, new, vec_len (new) * sizeof (new[0])); vec_set (vec, new[0]); for (i = 0; i < len; i++) ASSERT (memcmp (&vec[i], &new[0], sizeof (vec[0])) == 0); vec_free (new); validate_vec (vec, 0); return vec; } static elt_t * validate_vec_validate (elt_t * vec, uword index) { uword len = vec_len (vec); word num_new = index - len + 1; u8 *ptr; u8 *end; u8 hash = compute_vec_hash (0, vec); if (num_new < 0) num_new = 0; vec_validate (vec, index); /* Old len but new vec pointer! */ ptr = (u8 *) (vec + len); end = (u8 *) (vec + len + num_new); ASSERT (len + num_new == vec_len (vec)); ASSERT (compute_vec_hash (hash, vec) == 0); while (ptr != end) { ASSERT (ptr < (u8 *) vec_end (vec)); ASSERT (ptr[0] == 0); ptr++; } validate_vec (vec, 0); return vec; } static elt_t * validate_vec_init (uword num_elts) { u8 *ptr; u8 *end; uword len; elt_t *new; new = vec_new (elt_t, num_elts); len = vec_len (new); ASSERT (len == num_elts); ptr = (u8 *) new; end = (u8 *) (new + len); while (ptr != end) { ASSERT (ptr < (u8 *) vec_end (new)); ASSERT (ptr[0] == 0); ptr++; } validate_vec (new, 0); return new; } static elt_t * validate_vec_init_h (uword num_elts, uword hdr_bytes) { uword i = 0; u8 *ptr; u8 *end; uword len; elt_t *new; new = vec_new_ha (elt_t, num_elts, hdr_bytes, 0); len = vec_len (new); ASSERT (len == num_elts); /* We have 2 zero-regions to check: header & vec data (skip _VEC struct). */ for (i = 0; i < 2; i++) { if (i == 0) { ptr = (u8 *) vec_header (new, hdr_bytes); end = ptr + hdr_bytes; } else { ptr = (u8 *) new; end = (u8 *) (new + len); } while (ptr != end) { ASSERT (ptr < (u8 *) vec_end (new)); ASSERT (ptr[0] == 0); ptr++; } } validate_vec (new, 1); return new; } /* XXX - I don't understand the purpose of the vec_clone() call. */ static elt_t * validate_vec_clone (elt_t * vec) { elt_t *new; vec_clone (new, vec); ASSERT (vec_len (new) == vec_len (vec)); ASSERT (compute_vec_hash (0, new) == 0); validate_vec (new, 0); return new; } static elt_t * validate_vec_append (elt_t * vec) { elt_t *new; uword num_elts = bounded_random_u32 (&g_seed, 0, MAX_CHANGE); uword len; u8 hash = 0; new = create_random_vec (elt_t, num_elts, g_seed); len = vec_len (vec) + vec_len (new); hash = compute_vec_hash (0, vec); hash = compute_vec_hash (hash, new); vec_append (vec, new); vec_free (new); ASSERT (vec_len (vec) == len); ASSERT (compute_vec_hash (hash, vec) == 0); validate_vec (vec, 0); return vec; } static elt_t * validate_vec_prepend (elt_t * vec) { elt_t *new; uword num_elts = bounded_random_u32 (&g_seed, 0, MAX_CHANGE); uword len; u8 hash = 0; new = create_random_vec (elt_t, num_elts, g_seed); len = vec_len (vec) + vec_len (new); hash = compute_vec_hash (0, vec); hash = compute_vec_hash (hash, new); vec_prepend (vec, new); vec_free (new); ASSERT (vec_len (vec) == len); ASSERT (compute_vec_hash (hash, vec) == 0); validate_vec (vec, 0); return vec; } static void run_validator_wh (uword iter) { elt_t *vec; uword i; uword op; uword num_elts; uword len; uword dump_time; f64 time[3]; /* [0]: start, [1]: last, [2]: current */ vec = create_random_vec_wh (elt_t, ~0, sizeof (hdr_t), g_seed); validate_vec (vec, 0); VERBOSE2 ("Start with len %d\n", vec_len (vec)); time[0] = unix_time_now (); time[1] = time[0]; dump_time = g_dump_period; for (i = 1; i <= iter; i++) { if (i >= g_set_verbose_at) g_verbose = 2; op = bounded_random_u32 (&g_seed, 0, vec_len (g_prob_wh) - 1); op = g_prob_wh[op]; switch (op) { case OP_IS_VEC_INIT_H: num_elts = bounded_random_u32 (&g_seed, 0, MAX_CHANGE); vec_free_h (vec, sizeof (hdr_t)); VERBOSE2 ("vec_init_h(), new elts %d\n", num_elts); vec = validate_vec_init_h (num_elts, sizeof (hdr_t)); break; case OP_IS_VEC_RESIZE_H: len = vec_len (vec); num_elts = bounded_random_u32 (&g_seed, len, len + MAX_CHANGE); VERBOSE2 ("vec_resize_h(), %d new elts.\n", num_elts); vec = validate_vec_resize_h (vec, num_elts, sizeof (hdr_t)); break; case OP_IS_VEC_FREE_H: VERBOSE2 ("vec_free_h()\n"); vec = validate_vec_free_h (vec, sizeof (hdr_t)); break; default: ASSERT (0); break; } g_call_stats[op]++; if (i == dump_time) { time[2] = unix_time_now (); VERBOSE1 ("%d vec ops in %f secs. (last %d in %f secs.).\n", i, time[2] - time[0], g_dump_period, time[2] - time[1]); time[1] = time[2]; dump_time += g_dump_period; VERBOSE1 ("vec len %d\n", vec_len (vec)); VERBOSE2 ("%U\n\n", format_hex_bytes, vec, vec_len (vec) * sizeof (vec[0])); } VERBOSE2 ("len %d\n", vec_len (vec)); } validate_vec (vec, sizeof (hdr_t)); vec_free_h (vec, sizeof (hdr_t)); } static void run_validator (uword iter) { elt_t *vec; elt_t *new; uword i; uword op; uword num_elts; uword index; uword len; uword dump_time; f64 time[3]; /* [0]: start, [1]: last, [2]: current */ vec = create_random_vec (elt_t, ~0, g_seed); validate_vec (vec, 0); VERBOSE2 ("Start with len %d\n", vec_len (vec)); time[0] = unix_time_now (); time[1] = time[0]; dump_time = g_dump_period; for (i = 1; i <= iter; i++) { if (i >= g_set_verbose_at) g_verbose = 2; op = bounded_random_u32 (&g_seed, 0, vec_len (g_prob) - 1); op = g_prob[op]; switch (op) { case OP_IS_VEC_RESIZE: len = vec_len (vec); num_elts = bounded_random_u32 (&g_seed, len, len + MAX_CHANGE); VERBOSE2 ("vec_resize(), %d new elts.\n", num_elts); vec = validate_vec_resize (vec, num_elts); break; case OP_IS_VEC_ADD1: VERBOSE2 ("vec_add1()\n"); vec = validate_vec_add1 (vec); break; case OP_IS_VEC_ADD2: num_elts = bounded_random_u32 (&g_seed, 0, MAX_CHANGE); VERBOSE2 ("vec_add2(), %d new elts.\n", num_elts); vec = validate_vec_add2 (vec, num_elts); break; case OP_IS_VEC_ADD: num_elts = bounded_random_u32 (&g_seed, 0, MAX_CHANGE); VERBOSE2 ("vec_add(), %d new elts.\n", num_elts); vec = validate_vec_add (vec, num_elts); break; case OP_IS_VEC_INSERT: len = vec_len (vec); num_elts = bounded_random_u32 (&g_seed, 0, MAX_CHANGE); index = bounded_random_u32 (&g_seed, 0, (len > 0) ? (len - 1) : (0)); VERBOSE2 ("vec_insert(), %d new elts, index %d.\n", num_elts, index); vec = validate_vec_insert (vec, num_elts, index); break; case OP_IS_VEC_INSERT_ELTS: len = vec_len (vec); num_elts = bounded_random_u32 (&g_seed, 0, MAX_CHANGE); index = bounded_random_u32 (&g_seed, 0, (len > 0) ? (len - 1) : (0)); VERBOSE2 ("vec_insert_elts(), %d new elts, index %d.\n", num_elts, index); vec = validate_vec_insert_elts (vec, num_elts, index); break; case OP_IS_VEC_DELETE: len = vec_len (vec); index = bounded_random_u32 (&g_seed, 0, len - 1); num_elts = bounded_random_u32 (&g_seed, 0, (len > index) ? (len - index) : (0)); VERBOSE2 ("vec_delete(), %d elts, index %d.\n", num_elts, index); vec = validate_vec_delete (vec, num_elts, index); break; case OP_IS_VEC_DUP: VERBOSE2 ("vec_dup()\n"); new = validate_vec_dup (vec); vec_free (new); break; case OP_IS_VEC_IS_EQUAL: VERBOSE2 ("vec_is_equal()\n"); validate_vec_is_equal (vec); break; case OP_IS_VEC_ZERO: VERBOSE2 ("vec_zero()\n"); vec = validate_vec_zero (vec); break; case OP_IS_VEC_SET: VERBOSE2 ("vec_set()\n"); vec = validate_vec_set (vec); break; case OP_IS_VEC_VALIDATE: len = vec_len (vec); index = bounded_random_u32 (&g_seed, 0, len - 1 + MAX_CHANGE); VERBOSE2 ("vec_validate(), index %d\n", index); vec = validate_vec_validate (vec, index); break; case OP_IS_VEC_FREE: VERBOSE2 ("vec_free()\n"); vec = validate_vec_free (vec); break; case OP_IS_VEC_INIT: num_elts = bounded_random_u32 (&g_seed, 0, MAX_CHANGE); vec_free (vec); VERBOSE2 ("vec_init(), new elts %d\n", num_elts); vec = validate_vec_init (num_elts); break; case OP_IS_VEC_CLONE: VERBOSE2 ("vec_clone()\n"); new = validate_vec_clone (vec); vec_free (new); break; case OP_IS_VEC_APPEND: VERBOSE2 ("vec_append()\n"); vec = validate_vec_append (vec); break; case OP_IS_VEC_PREPEND: VERBOSE2 ("vec_prepend()\n"); vec = validate_vec_prepend (vec); break; default: ASSERT (0); break; } g_call_stats[op]++; if (i == dump_time) { time[2] = unix_time_now (); VERBOSE1 ("%d vec ops in %f secs. (last %d in %f secs.).\n", i, time[2] - time[0], g_dump_period, time[2] - time[1]); time[1] = time[2]; dump_time += g_dump_period; VERBOSE1 ("vec len %d\n", vec_len (vec)); VERBOSE2 ("%U\n\n", format_hex_bytes, vec, vec_len (vec) * sizeof (vec[0])); } VERBOSE2 ("len %d\n", vec_len (vec)); } validate_vec (vec, 0); vec_free (vec); } static void prob_init (void) { uword i, j, ratio, len, index; /* Create the vector to implement the statistical profile: vec [ op1 op1 op1 op2 op3 op3 op3 op4 op4 .... ] */ for (i = FIRST_VEC_OP; i <= LAST_VEC_OP; i++) { ratio = g_prob_ratio[i]; if (ratio <= 0) continue; len = vec_len (g_prob); index = len - 1 + ratio; ASSERT (index >= 0); /* Pre-allocate new elements. */ vec_validate (g_prob, index); for (j = len; j <= index; j++) g_prob[j] = i; } /* Operations on vectors with headers. */ for (i = FIRST_VEC_HDR_OP; i <= LAST_VEC_HDR_OP; i++) { ratio = g_prob_ratio[i]; if (ratio <= 0) continue; len = vec_len (g_prob_wh); index = len - 1 + ratio; ASSERT (index >= 0); /* Pre-allocate new elements. */ vec_validate (g_prob_wh, index); for (j = len; j <= index; j++) g_prob_wh[j] = i; } VERBOSE3 ("prob_vec, len %d\n%U\n", vec_len (g_prob), format_hex_bytes, g_prob, vec_len (g_prob) * sizeof (g_prob[0])); VERBOSE3 ("prob_vec_wh, len %d\n%U\n", vec_len (g_prob_wh), format_hex_bytes, g_prob_wh, vec_len (g_prob_wh) * sizeof (g_prob_wh[0])); } static void prob_free (void) { vec_free (g_prob); vec_free (g_prob_wh); } int test_vec_main (unformat_input_t * input) { uword iter = 1000; uword help = 0; uword big = 0; while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT) { if (0 == unformat (input, "iter %d", &iter) && 0 == unformat (input, "seed %d", &g_seed) && 0 == unformat (input, "verbose %d", &g_verbose) && 0 == unformat (input, "set %d", &g_set_verbose_at) && 0 == unformat (input, "dump %d", &g_dump_period) && 0 == unformat (input, "help %=", &help, 1) && 0 == unformat (input, "big %=", &big, 1)) { clib_error ("unknown input `%U'", format_unformat_error, input); goto usage; } } if (big) { u8 *bigboy = 0; u64 one_gig = (1 << 30); u64 size; u64 index; fformat (stdout, "giant vector test..."); size = 5ULL * one_gig; vec_validate (bigboy, size); for (index = size; index >= 0; index--) bigboy[index] = index & 0xff; return 0; } if (help) goto usage; prob_init (); run_validator (iter); run_validator_wh (iter); if (verbose) dump_call_stats (g_call_stats); prob_free (); if (verbose) { memory_snap (); } return 0; usage: fformat (stdout, "Usage: test_vec iter <N> seed <N> verbose <N> " "set <N> dump <N>\n"); if (help) return 0; return -1; } #ifdef CLIB_UNIX int main (int argc, char *argv[]) { unformat_input_t i; int ret; mheap_alloc (0, (uword) 10ULL << 30); verbose = (argc > 1); unformat_init_command_line (&i, argv); ret = test_vec_main (&i); unformat_free (&i); return ret; } #endif /* CLIB_UNIX */ /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */