FD.io VPP  v18.07.1-13-g909ba93
Vector Packet Processing
input.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2015 Cisco and/or its affiliates.
3  * Licensed under the Apache License, Version 2.0 (the "License");
4  * you may not use this file except in compliance with the License.
5  * You may obtain a copy of the License at:
6  *
7  * http://www.apache.org/licenses/LICENSE-2.0
8  *
9  * Unless required by applicable law or agreed to in writing, software
10  * distributed under the License is distributed on an "AS IS" BASIS,
11  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12  * See the License for the specific language governing permissions and
13  * limitations under the License.
14  */
15 /*
16  * pg_input.c: buffer generator input
17  *
18  * Copyright (c) 2008 Eliot Dresselhaus
19  *
20  * Permission is hereby granted, free of charge, to any person obtaining
21  * a copy of this software and associated documentation files (the
22  * "Software"), to deal in the Software without restriction, including
23  * without limitation the rights to use, copy, modify, merge, publish,
24  * distribute, sublicense, and/or sell copies of the Software, and to
25  * permit persons to whom the Software is furnished to do so, subject to
26  * the following conditions:
27  *
28  * The above copyright notice and this permission notice shall be
29  * included in all copies or substantial portions of the Software.
30  *
31  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
32  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
33  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
34  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
35  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
36  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
37  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
38  */
39 
40 #include <vlib/vlib.h>
41 #include <vnet/pg/pg.h>
42 #include <vnet/vnet.h>
43 #include <vnet/feature/feature.h>
44 #include <vnet/devices/devices.h>
45 
46 static int
48  u32 data_offset, u32 n_bytes)
49 {
50  u8 *bd, *pd, *pm;
51  u32 i;
52 
53  bd = b->data;
54  pd = s->fixed_packet_data + data_offset;
55  pm = s->fixed_packet_data_mask + data_offset;
56 
57  if (pd + n_bytes >= vec_end (s->fixed_packet_data))
58  n_bytes = (pd < vec_end (s->fixed_packet_data)
59  ? vec_end (s->fixed_packet_data) - pd : 0);
60 
61  for (i = 0; i < n_bytes; i++)
62  if ((bd[i] & pm[i]) != pd[i])
63  break;
64 
65  if (i >= n_bytes)
66  return 1;
67 
68  clib_warning ("buffer %U", format_vnet_buffer, b);
69  clib_warning ("differ at index %d", i);
70  clib_warning ("is %U", format_hex_bytes, bd, n_bytes);
71  clib_warning ("mask %U", format_hex_bytes, pm, n_bytes);
72  clib_warning ("expect %U", format_hex_bytes, pd, n_bytes);
73  return 0;
74 }
75 
76 static int
78 {
79  return validate_buffer_data2 (b, s, 0, s->buffer_bytes);
80 }
81 
82 always_inline void
83 set_1 (void *a0,
84  u64 v0, u64 v_min, u64 v_max, u32 n_bits, u32 is_net_byte_order)
85 {
86  ASSERT (v0 >= v_min && v0 <= v_max);
87  if (n_bits == BITS (u8))
88  {
89  ((u8 *) a0)[0] = v0;
90  }
91  else if (n_bits == BITS (u16))
92  {
93  if (is_net_byte_order)
94  v0 = clib_host_to_net_u16 (v0);
95  clib_mem_unaligned (a0, u16) = v0;
96  }
97  else if (n_bits == BITS (u32))
98  {
99  if (is_net_byte_order)
100  v0 = clib_host_to_net_u32 (v0);
101  clib_mem_unaligned (a0, u32) = v0;
102  }
103  else if (n_bits == BITS (u64))
104  {
105  if (is_net_byte_order)
106  v0 = clib_host_to_net_u64 (v0);
107  clib_mem_unaligned (a0, u64) = v0;
108  }
109 }
110 
111 always_inline void
112 set_2 (void *a0, void *a1,
113  u64 v0, u64 v1,
114  u64 v_min, u64 v_max,
115  u32 n_bits, u32 is_net_byte_order, u32 is_increment)
116 {
117  ASSERT (v0 >= v_min && v0 <= v_max);
118  ASSERT (v1 >= v_min && v1 <= (v_max + is_increment));
119  if (n_bits == BITS (u8))
120  {
121  ((u8 *) a0)[0] = v0;
122  ((u8 *) a1)[0] = v1;
123  }
124  else if (n_bits == BITS (u16))
125  {
126  if (is_net_byte_order)
127  {
128  v0 = clib_host_to_net_u16 (v0);
129  v1 = clib_host_to_net_u16 (v1);
130  }
131  clib_mem_unaligned (a0, u16) = v0;
132  clib_mem_unaligned (a1, u16) = v1;
133  }
134  else if (n_bits == BITS (u32))
135  {
136  if (is_net_byte_order)
137  {
138  v0 = clib_host_to_net_u32 (v0);
139  v1 = clib_host_to_net_u32 (v1);
140  }
141  clib_mem_unaligned (a0, u32) = v0;
142  clib_mem_unaligned (a1, u32) = v1;
143  }
144  else if (n_bits == BITS (u64))
145  {
146  if (is_net_byte_order)
147  {
148  v0 = clib_host_to_net_u64 (v0);
149  v1 = clib_host_to_net_u64 (v1);
150  }
151  clib_mem_unaligned (a0, u64) = v0;
152  clib_mem_unaligned (a1, u64) = v1;
153  }
154 }
155 
158  pg_stream_t * s,
159  u32 * buffers,
160  u32 n_buffers,
161  u32 n_bits,
162  u32 byte_offset, u32 is_net_byte_order, u64 v_min, u64 v_max)
163 {
165 
166  while (n_buffers >= 4)
167  {
168  vlib_buffer_t *b0, *b1, *b2, *b3;
169  void *a0, *a1;
170 
171  b0 = vlib_get_buffer (vm, buffers[0]);
172  b1 = vlib_get_buffer (vm, buffers[1]);
173  b2 = vlib_get_buffer (vm, buffers[2]);
174  b3 = vlib_get_buffer (vm, buffers[3]);
175  buffers += 2;
176  n_buffers -= 2;
177 
178  a0 = (void *) b0 + byte_offset;
179  a1 = (void *) b1 + byte_offset;
180  CLIB_PREFETCH ((void *) b2 + byte_offset, sizeof (v_min), WRITE);
181  CLIB_PREFETCH ((void *) b3 + byte_offset, sizeof (v_min), WRITE);
182 
183  set_2 (a0, a1, v_min, v_min, v_min, v_max, n_bits, is_net_byte_order,
184  /* is_increment */ 0);
185 
186  ASSERT (validate_buffer_data (b0, s));
187  ASSERT (validate_buffer_data (b1, s));
188  }
189 
190  while (n_buffers > 0)
191  {
192  vlib_buffer_t *b0;
193  void *a0;
194 
195  b0 = vlib_get_buffer (vm, buffers[0]);
196  buffers += 1;
197  n_buffers -= 1;
198 
199  a0 = (void *) b0 + byte_offset;
200 
201  set_1 (a0, v_min, v_min, v_max, n_bits, is_net_byte_order);
202 
203  ASSERT (validate_buffer_data (b0, s));
204  }
205 }
206 
209  pg_stream_t * s,
210  u32 * buffers,
211  u32 n_buffers,
212  u32 n_bits,
213  u32 byte_offset,
214  u32 is_net_byte_order,
215  u32 want_sum, u64 * sum_result, u64 v_min, u64 v_max, u64 v)
216 {
218  u64 sum = 0;
219 
220  ASSERT (v >= v_min && v <= v_max);
221 
222  while (n_buffers >= 4)
223  {
224  vlib_buffer_t *b0, *b1, *b2, *b3;
225  void *a0, *a1;
226  u64 v_old;
227 
228  b0 = vlib_get_buffer (vm, buffers[0]);
229  b1 = vlib_get_buffer (vm, buffers[1]);
230  b2 = vlib_get_buffer (vm, buffers[2]);
231  b3 = vlib_get_buffer (vm, buffers[3]);
232  buffers += 2;
233  n_buffers -= 2;
234 
235  a0 = (void *) b0 + byte_offset;
236  a1 = (void *) b1 + byte_offset;
237  CLIB_PREFETCH ((void *) b2 + byte_offset, sizeof (v_min), WRITE);
238  CLIB_PREFETCH ((void *) b3 + byte_offset, sizeof (v_min), WRITE);
239 
240  v_old = v;
241  v = v_old + 2;
242  v = v > v_max ? v_min : v;
243  set_2 (a0, a1,
244  v_old + 0, v_old + 1, v_min, v_max, n_bits, is_net_byte_order,
245  /* is_increment */ 1);
246 
247  if (want_sum)
248  sum += 2 * v_old + 1;
249 
250  if (PREDICT_FALSE (v_old + 1 > v_max))
251  {
252  if (want_sum)
253  sum -= 2 * v_old + 1;
254 
255  v = v_old;
256  set_1 (a0, v + 0, v_min, v_max, n_bits, is_net_byte_order);
257  if (want_sum)
258  sum += v;
259  v += 1;
260 
261  v = v > v_max ? v_min : v;
262  set_1 (a1, v + 0, v_min, v_max, n_bits, is_net_byte_order);
263  if (want_sum)
264  sum += v;
265  v += 1;
266  }
267 
268  ASSERT (validate_buffer_data (b0, s));
269  ASSERT (validate_buffer_data (b1, s));
270  }
271 
272  while (n_buffers > 0)
273  {
274  vlib_buffer_t *b0;
275  void *a0;
276  u64 v_old;
277 
278  b0 = vlib_get_buffer (vm, buffers[0]);
279  buffers += 1;
280  n_buffers -= 1;
281 
282  a0 = (void *) b0 + byte_offset;
283 
284  v_old = v;
285  if (want_sum)
286  sum += v_old;
287  v += 1;
288  v = v > v_max ? v_min : v;
289 
290  ASSERT (v_old >= v_min && v_old <= v_max);
291  set_1 (a0, v_old, v_min, v_max, n_bits, is_net_byte_order);
292 
293  ASSERT (validate_buffer_data (b0, s));
294  }
295 
296  if (want_sum)
297  *sum_result = sum;
298 
299  return v;
300 }
301 
304  pg_stream_t * s,
305  u32 * buffers,
306  u32 n_buffers,
307  u32 n_bits,
308  u32 byte_offset,
309  u32 is_net_byte_order,
310  u32 want_sum, u64 * sum_result, u64 v_min, u64 v_max)
311 {
313  u64 v_diff = v_max - v_min + 1;
314  u64 r_mask = max_pow2 (v_diff) - 1;
315  u64 v0, v1;
316  u64 sum = 0;
317  void *random_data;
318 
319  random_data = clib_random_buffer_get_data
320  (&vm->random_buffer, n_buffers * n_bits / BITS (u8));
321 
322  v0 = v1 = v_min;
323 
324  while (n_buffers >= 4)
325  {
326  vlib_buffer_t *b0, *b1, *b2, *b3;
327  void *a0, *a1;
328  u64 r0 = 0, r1 = 0; /* warnings be gone */
329 
330  b0 = vlib_get_buffer (vm, buffers[0]);
331  b1 = vlib_get_buffer (vm, buffers[1]);
332  b2 = vlib_get_buffer (vm, buffers[2]);
333  b3 = vlib_get_buffer (vm, buffers[3]);
334  buffers += 2;
335  n_buffers -= 2;
336 
337  a0 = (void *) b0 + byte_offset;
338  a1 = (void *) b1 + byte_offset;
339  CLIB_PREFETCH ((void *) b2 + byte_offset, sizeof (v_min), WRITE);
340  CLIB_PREFETCH ((void *) b3 + byte_offset, sizeof (v_min), WRITE);
341 
342  switch (n_bits)
343  {
344 #define _(n) \
345  case BITS (u##n): \
346  { \
347  u##n * r = random_data; \
348  r0 = r[0]; \
349  r1 = r[1]; \
350  random_data = r + 2; \
351  } \
352  break;
353 
354  _(8);
355  _(16);
356  _(32);
357  _(64);
358 
359 #undef _
360  }
361 
362  /* Add power of 2 sized random number which may be out of range. */
363  v0 += r0 & r_mask;
364  v1 += r1 & r_mask;
365 
366  /* Twice should be enough to reduce to v_min .. v_max range. */
367  v0 = v0 > v_max ? v0 - v_diff : v0;
368  v1 = v1 > v_max ? v1 - v_diff : v1;
369  v0 = v0 > v_max ? v0 - v_diff : v0;
370  v1 = v1 > v_max ? v1 - v_diff : v1;
371 
372  if (want_sum)
373  sum += v0 + v1;
374 
375  set_2 (a0, a1, v0, v1, v_min, v_max, n_bits, is_net_byte_order,
376  /* is_increment */ 0);
377 
378  ASSERT (validate_buffer_data (b0, s));
379  ASSERT (validate_buffer_data (b1, s));
380  }
381 
382  while (n_buffers > 0)
383  {
384  vlib_buffer_t *b0;
385  void *a0;
386  u64 r0 = 0; /* warnings be gone */
387 
388  b0 = vlib_get_buffer (vm, buffers[0]);
389  buffers += 1;
390  n_buffers -= 1;
391 
392  a0 = (void *) b0 + byte_offset;
393 
394  switch (n_bits)
395  {
396 #define _(n) \
397  case BITS (u##n): \
398  { \
399  u##n * r = random_data; \
400  r0 = r[0]; \
401  random_data = r + 1; \
402  } \
403  break;
404 
405  _(8);
406  _(16);
407  _(32);
408  _(64);
409 
410 #undef _
411  }
412 
413  /* Add power of 2 sized random number which may be out of range. */
414  v0 += r0 & r_mask;
415 
416  /* Twice should be enough to reduce to v_min .. v_max range. */
417  v0 = v0 > v_max ? v0 - v_diff : v0;
418  v0 = v0 > v_max ? v0 - v_diff : v0;
419 
420  if (want_sum)
421  sum += v0;
422 
423  set_1 (a0, v0, v_min, v_max, n_bits, is_net_byte_order);
424 
425  ASSERT (validate_buffer_data (b0, s));
426  }
427 
428  if (want_sum)
429  *sum_result = sum;
430 }
431 
432 #define _(i,t) \
433  clib_mem_unaligned (a##i, t) = \
434  clib_host_to_net_##t ((clib_net_to_host_mem_##t (a##i) &~ mask) \
435  | (v##i << shift))
436 
437 always_inline void
438 setbits_1 (void *a0,
439  u64 v0,
440  u64 v_min, u64 v_max,
441  u32 max_bits, u32 n_bits, u64 mask, u32 shift)
442 {
443  ASSERT (v0 >= v_min && v0 <= v_max);
444  if (max_bits == BITS (u8))
445  ((u8 *) a0)[0] = (((u8 *) a0)[0] & ~mask) | (v0 << shift);
446 
447  else if (max_bits == BITS (u16))
448  {
449  _(0, u16);
450  }
451  else if (max_bits == BITS (u32))
452  {
453  _(0, u32);
454  }
455  else if (max_bits == BITS (u64))
456  {
457  _(0, u64);
458  }
459 }
460 
461 always_inline void
462 setbits_2 (void *a0, void *a1,
463  u64 v0, u64 v1,
464  u64 v_min, u64 v_max,
465  u32 max_bits, u32 n_bits, u64 mask, u32 shift, u32 is_increment)
466 {
467  ASSERT (v0 >= v_min && v0 <= v_max);
468  ASSERT (v1 >= v_min && v1 <= v_max + is_increment);
469  if (max_bits == BITS (u8))
470  {
471  ((u8 *) a0)[0] = (((u8 *) a0)[0] & ~mask) | (v0 << shift);
472  ((u8 *) a1)[0] = (((u8 *) a1)[0] & ~mask) | (v1 << shift);
473  }
474 
475  else if (max_bits == BITS (u16))
476  {
477  _(0, u16);
478  _(1, u16);
479  }
480  else if (max_bits == BITS (u32))
481  {
482  _(0, u32);
483  _(1, u32);
484  }
485  else if (max_bits == BITS (u64))
486  {
487  _(0, u64);
488  _(1, u64);
489  }
490 }
491 
492 #undef _
493 
496  pg_stream_t * s,
497  u32 * buffers,
498  u32 n_buffers,
499  u32 max_bits,
500  u32 n_bits,
501  u32 byte_offset, u64 v_min, u64 v_max, u64 mask, u32 shift)
502 {
504 
505  while (n_buffers >= 4)
506  {
507  vlib_buffer_t *b0, *b1, *b2, *b3;
508  void *a0, *a1;
509 
510  b0 = vlib_get_buffer (vm, buffers[0]);
511  b1 = vlib_get_buffer (vm, buffers[1]);
512  b2 = vlib_get_buffer (vm, buffers[2]);
513  b3 = vlib_get_buffer (vm, buffers[3]);
514  buffers += 2;
515  n_buffers -= 2;
516 
517  a0 = (void *) b0 + byte_offset;
518  a1 = (void *) b1 + byte_offset;
519  CLIB_PREFETCH ((void *) b2 + byte_offset, sizeof (v_min), WRITE);
520  CLIB_PREFETCH ((void *) b3 + byte_offset, sizeof (v_min), WRITE);
521 
522  setbits_2 (a0, a1,
523  v_min, v_min, v_min, v_max, max_bits, n_bits, mask, shift,
524  /* is_increment */ 0);
525 
526  ASSERT (validate_buffer_data (b0, s));
527  ASSERT (validate_buffer_data (b1, s));
528  }
529 
530  while (n_buffers > 0)
531  {
532  vlib_buffer_t *b0;
533  void *a0;
534 
535  b0 = vlib_get_buffer (vm, buffers[0]);
536  buffers += 1;
537  n_buffers -= 1;
538 
539  a0 = (void *) b0 + byte_offset;
540 
541  setbits_1 (a0, v_min, v_min, v_max, max_bits, n_bits, mask, shift);
542  ASSERT (validate_buffer_data (b0, s));
543  }
544 }
545 
548  pg_stream_t * s,
549  u32 * buffers,
550  u32 n_buffers,
551  u32 max_bits,
552  u32 n_bits,
553  u32 byte_offset,
554  u64 v_min, u64 v_max, u64 v, u64 mask, u32 shift)
555 {
557 
558  ASSERT (v >= v_min && v <= v_max);
559 
560  while (n_buffers >= 4)
561  {
562  vlib_buffer_t *b0, *b1, *b2, *b3;
563  void *a0, *a1;
564  u64 v_old;
565 
566  b0 = vlib_get_buffer (vm, buffers[0]);
567  b1 = vlib_get_buffer (vm, buffers[1]);
568  b2 = vlib_get_buffer (vm, buffers[2]);
569  b3 = vlib_get_buffer (vm, buffers[3]);
570  buffers += 2;
571  n_buffers -= 2;
572 
573  a0 = (void *) b0 + byte_offset;
574  a1 = (void *) b1 + byte_offset;
575  CLIB_PREFETCH ((void *) b2 + byte_offset, sizeof (v_min), WRITE);
576  CLIB_PREFETCH ((void *) b3 + byte_offset, sizeof (v_min), WRITE);
577 
578  v_old = v;
579  v = v_old + 2;
580  v = v > v_max ? v_min : v;
581  setbits_2 (a0, a1,
582  v_old + 0, v_old + 1,
583  v_min, v_max, max_bits, n_bits, mask, shift,
584  /* is_increment */ 1);
585 
586  if (PREDICT_FALSE (v_old + 1 > v_max))
587  {
588  v = v_old;
589  setbits_1 (a0, v + 0, v_min, v_max, max_bits, n_bits, mask, shift);
590  v += 1;
591 
592  v = v > v_max ? v_min : v;
593  setbits_1 (a1, v + 0, v_min, v_max, max_bits, n_bits, mask, shift);
594  v += 1;
595  }
596  ASSERT (validate_buffer_data (b0, s));
597  ASSERT (validate_buffer_data (b1, s));
598  }
599 
600  while (n_buffers > 0)
601  {
602  vlib_buffer_t *b0;
603  void *a0;
604  u64 v_old;
605 
606  b0 = vlib_get_buffer (vm, buffers[0]);
607  buffers += 1;
608  n_buffers -= 1;
609 
610  a0 = (void *) b0 + byte_offset;
611 
612  v_old = v;
613  v = v_old + 1;
614  v = v > v_max ? v_min : v;
615 
616  ASSERT (v_old >= v_min && v_old <= v_max);
617  setbits_1 (a0, v_old, v_min, v_max, max_bits, n_bits, mask, shift);
618 
619  ASSERT (validate_buffer_data (b0, s));
620  }
621 
622  return v;
623 }
624 
627  pg_stream_t * s,
628  u32 * buffers,
629  u32 n_buffers,
630  u32 max_bits,
631  u32 n_bits,
632  u32 byte_offset, u64 v_min, u64 v_max, u64 mask, u32 shift)
633 {
635  u64 v_diff = v_max - v_min + 1;
636  u64 r_mask = max_pow2 (v_diff) - 1;
637  u64 v0, v1;
638  void *random_data;
639 
640  random_data = clib_random_buffer_get_data
641  (&vm->random_buffer, n_buffers * max_bits / BITS (u8));
642  v0 = v1 = v_min;
643 
644  while (n_buffers >= 4)
645  {
646  vlib_buffer_t *b0, *b1, *b2, *b3;
647  void *a0, *a1;
648  u64 r0 = 0, r1 = 0; /* warnings be gone */
649 
650  b0 = vlib_get_buffer (vm, buffers[0]);
651  b1 = vlib_get_buffer (vm, buffers[1]);
652  b2 = vlib_get_buffer (vm, buffers[2]);
653  b3 = vlib_get_buffer (vm, buffers[3]);
654  buffers += 2;
655  n_buffers -= 2;
656 
657  a0 = (void *) b0 + byte_offset;
658  a1 = (void *) b1 + byte_offset;
659  CLIB_PREFETCH ((void *) b2 + byte_offset, sizeof (v_min), WRITE);
660  CLIB_PREFETCH ((void *) b3 + byte_offset, sizeof (v_min), WRITE);
661 
662  switch (max_bits)
663  {
664 #define _(n) \
665  case BITS (u##n): \
666  { \
667  u##n * r = random_data; \
668  r0 = r[0]; \
669  r1 = r[1]; \
670  random_data = r + 2; \
671  } \
672  break;
673 
674  _(8);
675  _(16);
676  _(32);
677  _(64);
678 
679 #undef _
680  }
681 
682  /* Add power of 2 sized random number which may be out of range. */
683  v0 += r0 & r_mask;
684  v1 += r1 & r_mask;
685 
686  /* Twice should be enough to reduce to v_min .. v_max range. */
687  v0 = v0 > v_max ? v0 - v_diff : v0;
688  v1 = v1 > v_max ? v1 - v_diff : v1;
689  v0 = v0 > v_max ? v0 - v_diff : v0;
690  v1 = v1 > v_max ? v1 - v_diff : v1;
691 
692  setbits_2 (a0, a1, v0, v1, v_min, v_max, max_bits, n_bits, mask, shift,
693  /* is_increment */ 0);
694 
695  ASSERT (validate_buffer_data (b0, s));
696  ASSERT (validate_buffer_data (b1, s));
697  }
698 
699  while (n_buffers > 0)
700  {
701  vlib_buffer_t *b0;
702  void *a0;
703  u64 r0 = 0; /* warnings be gone */
704 
705  b0 = vlib_get_buffer (vm, buffers[0]);
706  buffers += 1;
707  n_buffers -= 1;
708 
709  a0 = (void *) b0 + byte_offset;
710 
711  switch (max_bits)
712  {
713 #define _(n) \
714  case BITS (u##n): \
715  { \
716  u##n * r = random_data; \
717  r0 = r[0]; \
718  random_data = r + 1; \
719  } \
720  break;
721 
722  _(8);
723  _(16);
724  _(32);
725  _(64);
726 
727 #undef _
728  }
729 
730  /* Add power of 2 sized random number which may be out of range. */
731  v0 += r0 & r_mask;
732 
733  /* Twice should be enough to reduce to v_min .. v_max range. */
734  v0 = v0 > v_max ? v0 - v_diff : v0;
735  v0 = v0 > v_max ? v0 - v_diff : v0;
736 
737  setbits_1 (a0, v0, v_min, v_max, max_bits, n_bits, mask, shift);
738 
739  ASSERT (validate_buffer_data (b0, s));
740  }
741 }
742 
743 static u64
745  pg_stream_t * s,
746  u32 * buffers,
747  u32 n_buffers,
748  u32 lo_bit, u32 hi_bit,
749  u64 v_min, u64 v_max, u64 v, pg_edit_type_t edit_type)
750 {
751  u32 max_bits, l0, l1, h1, start_bit;
752 
753  if (v_min == v_max)
754  edit_type = PG_EDIT_FIXED;
755 
756  l0 = lo_bit / BITS (u8);
757  l1 = lo_bit % BITS (u8);
758  h1 = hi_bit % BITS (u8);
759 
760  start_bit = l0 * BITS (u8);
761 
762  max_bits = hi_bit - start_bit;
763  ASSERT (max_bits <= 64);
764 
765 #define _(n) \
766  case (n): \
767  if (edit_type == PG_EDIT_INCREMENT) \
768  v = do_set_increment (pg, s, buffers, n_buffers, \
769  BITS (u##n), \
770  l0, \
771  /* is_net_byte_order */ 1, \
772  /* want sum */ 0, 0, \
773  v_min, v_max, \
774  v); \
775  else if (edit_type == PG_EDIT_RANDOM) \
776  do_set_random (pg, s, buffers, n_buffers, \
777  BITS (u##n), \
778  l0, \
779  /* is_net_byte_order */ 1, \
780  /* want sum */ 0, 0, \
781  v_min, v_max); \
782  else /* edit_type == PG_EDIT_FIXED */ \
783  do_set_fixed (pg, s, buffers, n_buffers, \
784  BITS (u##n), \
785  l0, \
786  /* is_net_byte_order */ 1, \
787  v_min, v_max); \
788  goto done;
789 
790  if (l1 == 0 && h1 == 0)
791  {
792  switch (max_bits)
793  {
794  _(8);
795  _(16);
796  _(32);
797  _(64);
798  }
799  }
800 
801 #undef _
802 
803  {
804  u64 mask;
805  u32 shift = l1;
806  u32 n_bits = max_bits;
807 
808  max_bits = clib_max (max_pow2 (n_bits), 8);
809 
810  mask = ((u64) 1 << (u64) n_bits) - 1;
811  mask &= ~(((u64) 1 << (u64) shift) - 1);
812 
813  mask <<= max_bits - n_bits;
814  shift += max_bits - n_bits;
815 
816  switch (max_bits)
817  {
818 #define _(n) \
819  case (n): \
820  if (edit_type == PG_EDIT_INCREMENT) \
821  v = do_setbits_increment (pg, s, buffers, n_buffers, \
822  BITS (u##n), n_bits, \
823  l0, v_min, v_max, v, \
824  mask, shift); \
825  else if (edit_type == PG_EDIT_RANDOM) \
826  do_setbits_random (pg, s, buffers, n_buffers, \
827  BITS (u##n), n_bits, \
828  l0, v_min, v_max, \
829  mask, shift); \
830  else /* edit_type == PG_EDIT_FIXED */ \
831  do_setbits_fixed (pg, s, buffers, n_buffers, \
832  BITS (u##n), n_bits, \
833  l0, v_min, v_max, \
834  mask, shift); \
835  goto done;
836 
837  _(8);
838  _(16);
839  _(32);
840  _(64);
841 
842 #undef _
843  }
844  }
845 
846 done:
847  return v;
848 }
849 
850 static void
852  pg_stream_t * s, u32 * buffers, u32 n_buffers)
853 {
854  u64 v_min, v_max, length_sum;
855  pg_edit_type_t edit_type;
856 
857  v_min = s->min_packet_bytes;
858  v_max = s->max_packet_bytes;
859  edit_type = s->packet_size_edit_type;
860 
861  if (edit_type == PG_EDIT_INCREMENT)
863  = do_set_increment (pg, s, buffers, n_buffers,
864  8 * STRUCT_SIZE_OF (vlib_buffer_t, current_length),
865  STRUCT_OFFSET_OF (vlib_buffer_t, current_length),
866  /* is_net_byte_order */ 0,
867  /* want sum */ 1, &length_sum,
868  v_min, v_max, s->last_increment_packet_size);
869 
870  else if (edit_type == PG_EDIT_RANDOM)
871  do_set_random (pg, s, buffers, n_buffers,
872  8 * STRUCT_SIZE_OF (vlib_buffer_t, current_length),
873  STRUCT_OFFSET_OF (vlib_buffer_t, current_length),
874  /* is_net_byte_order */ 0,
875  /* want sum */ 1, &length_sum,
876  v_min, v_max);
877 
878  else /* edit_type == PG_EDIT_FIXED */
879  {
880  do_set_fixed (pg, s, buffers, n_buffers,
881  8 * STRUCT_SIZE_OF (vlib_buffer_t, current_length),
882  STRUCT_OFFSET_OF (vlib_buffer_t, current_length),
883  /* is_net_byte_order */ 0,
884  v_min, v_max);
885  length_sum = v_min * n_buffers;
886  }
887 
888  {
889  vnet_main_t *vnm = vnet_get_main ();
891  vnet_sw_interface_t *si =
893 
897  si->sw_if_index, n_buffers, length_sum);
898  }
899 
900 }
901 
902 static void
904  pg_stream_t * s,
905  u32 * buffers, u32 n_buffers)
906 {
908  pg_buffer_index_t *pbi;
909  uword n_bytes_left;
910  static u32 *unused_buffers = 0;
911 
912  while (n_buffers > 0)
913  {
914  vlib_buffer_t *b;
915  u32 bi;
916 
917  bi = buffers[0];
918  b = vlib_get_buffer (vm, bi);
919 
920  /* Current length here is length of whole packet. */
921  n_bytes_left = b->current_length;
922 
923  pbi = s->buffer_indices;
924  while (1)
925  {
926  uword n = clib_min (n_bytes_left, s->buffer_bytes);
927 
928  b->current_length = n;
929  n_bytes_left -= n;
930  if (n_bytes_left > 0)
931  b->flags |= VLIB_BUFFER_NEXT_PRESENT;
932  else
933  b->flags &= ~VLIB_BUFFER_NEXT_PRESENT;
934 
935  /* Return unused buffers to fifos. */
936  if (n == 0)
937  vec_add1 (unused_buffers, bi);
938 
939  pbi++;
940  if (pbi >= vec_end (s->buffer_indices))
941  break;
942 
943  bi = b->next_buffer;
944  b = vlib_get_buffer (vm, bi);
945  }
946  ASSERT (n_bytes_left == 0);
947 
948  buffers += 1;
949  n_buffers -= 1;
950  }
951 
952  if (vec_len (unused_buffers) > 0)
953  {
954  vlib_buffer_free_no_next (vm, unused_buffers, vec_len (unused_buffers));
955  _vec_len (unused_buffers) = 0;
956  }
957 }
958 
959 static void
961  pg_stream_t * s, u32 * buffers, u32 n_buffers)
962 {
963  pg_edit_t *e;
964 
966  {
967  switch (e->type)
968  {
969  case PG_EDIT_RANDOM:
970  case PG_EDIT_INCREMENT:
971  {
972  u32 lo_bit, hi_bit;
973  u64 v_min, v_max;
974 
975  v_min = pg_edit_get_value (e, PG_EDIT_LO);
976  v_max = pg_edit_get_value (e, PG_EDIT_HI);
977 
978  hi_bit = (BITS (u8) * STRUCT_OFFSET_OF (vlib_buffer_t, data)
979  + BITS (u8) + e->lsb_bit_offset);
980  lo_bit = hi_bit - e->n_bits;
981 
983  = do_it (pg, s, buffers, n_buffers, lo_bit, hi_bit, v_min, v_max,
984  e->last_increment_value, e->type);
985  }
986  break;
987 
988  case PG_EDIT_UNSPECIFIED:
989  break;
990 
991  default:
992  /* Should not be any fixed edits left. */
993  ASSERT (0);
994  break;
995  }
996  }
997 
998  /* Call any edit functions to e.g. completely IP lengths, checksums, ... */
999  {
1000  int i;
1001  for (i = vec_len (s->edit_groups) - 1; i >= 0; i--)
1002  {
1003  pg_edit_group_t *g = s->edit_groups + i;
1004  if (g->edit_function)
1005  g->edit_function (pg, s, g, buffers, n_buffers);
1006  }
1007  }
1008 }
1009 
1010 static void
1012  pg_stream_t * s,
1013  u32 * buffers, u32 * next_buffers, u32 n_buffers)
1014 {
1016 
1017  while (n_buffers >= 4)
1018  {
1019  u32 ni0, ni1;
1020  vlib_buffer_t *b0, *b1;
1021 
1022  b0 = vlib_get_buffer (vm, buffers[0]);
1023  b1 = vlib_get_buffer (vm, buffers[1]);
1024  ni0 = next_buffers[0];
1025  ni1 = next_buffers[1];
1026 
1027  vlib_prefetch_buffer_with_index (vm, buffers[2], WRITE);
1028  vlib_prefetch_buffer_with_index (vm, buffers[3], WRITE);
1029 
1030  b0->flags |= VLIB_BUFFER_NEXT_PRESENT;
1031  b1->flags |= VLIB_BUFFER_NEXT_PRESENT;
1032  b0->next_buffer = ni0;
1033  b1->next_buffer = ni1;
1034 
1035  buffers += 2;
1036  next_buffers += 2;
1037  n_buffers -= 2;
1038  }
1039 
1040  while (n_buffers > 0)
1041  {
1042  u32 ni0;
1043  vlib_buffer_t *b0;
1044 
1045  b0 = vlib_get_buffer (vm, buffers[0]);
1046  ni0 = next_buffers[0];
1047  buffers += 1;
1048  next_buffers += 1;
1049  n_buffers -= 1;
1050 
1051  b0->flags |= VLIB_BUFFER_NEXT_PRESENT;
1052  b0->next_buffer = ni0;
1053  }
1054 }
1055 
1058  pg_stream_t * s,
1059  u32 * buffers,
1060  u32 n_buffers, u32 data_offset, u32 n_data)
1061 {
1062  u32 n_left, *b, i, l;
1063 
1064  n_left = n_buffers;
1065  b = buffers;
1068 
1069  while (n_left >= 1)
1070  {
1071  u32 bi0, n0;
1072  vlib_buffer_t *b0;
1073  u8 *d0;
1074 
1075  bi0 = b[0];
1076  b += 1;
1077  n_left -= 1;
1078 
1079  b0 = vlib_get_buffer (vm, bi0);
1080 
1081  vnet_buffer (b0)->sw_if_index[VLIB_RX] = s->sw_if_index[VLIB_RX];
1082  /* was s->sw_if_index[VLIB_TX]; */
1083  vnet_buffer (b0)->sw_if_index[VLIB_TX] = (u32) ~ 0;
1084 
1085  d0 = vec_elt (s->replay_packet_templates, i);
1086  vnet_buffer2 (b0)->pg_replay_timestamp = s->replay_packet_timestamps[i];
1087 
1088  n0 = n_data;
1089  if (data_offset + n_data >= vec_len (d0))
1090  n0 = vec_len (d0) > data_offset ? vec_len (d0) - data_offset : 0;
1091 
1092  b0->current_length = n0;
1093 
1094  clib_memcpy (b0->data, d0 + data_offset, n0);
1095  i = i + 1 == l ? 0 : i + 1;
1096  }
1097 }
1098 
1101  pg_stream_t * s,
1102  u32 * buffers,
1103  u32 n_buffers, u32 data_offset, u32 n_data, u32 set_data)
1104 {
1105  u32 n_left, *b;
1106  u8 *data, *mask;
1107 
1108  if (vec_len (s->replay_packet_templates) > 0)
1109  return init_replay_buffers_inline (vm, s, buffers, n_buffers, data_offset,
1110  n_data);
1111 
1112  data = s->fixed_packet_data + data_offset;
1113  mask = s->fixed_packet_data_mask + data_offset;
1114  if (data + n_data >= vec_end (s->fixed_packet_data))
1115  n_data = (data < vec_end (s->fixed_packet_data)
1116  ? vec_end (s->fixed_packet_data) - data : 0);
1117  if (n_data > 0)
1118  {
1119  ASSERT (data + n_data <= vec_end (s->fixed_packet_data));
1120  ASSERT (mask + n_data <= vec_end (s->fixed_packet_data_mask));
1121  }
1122 
1123  n_left = n_buffers;
1124  b = buffers;
1125 
1126  while (n_left >= 4)
1127  {
1128  u32 bi0, bi1;
1129  vlib_buffer_t *b0, *b1;
1130 
1131  /* Prefetch next iteration. */
1132  vlib_prefetch_buffer_with_index (vm, b[2], STORE);
1133  vlib_prefetch_buffer_with_index (vm, b[3], STORE);
1134 
1135  bi0 = b[0];
1136  bi1 = b[1];
1137  b += 2;
1138  n_left -= 2;
1139 
1140  b0 = vlib_get_buffer (vm, bi0);
1141  b1 = vlib_get_buffer (vm, bi1);
1142 
1143  vnet_buffer (b0)->sw_if_index[VLIB_RX] =
1144  vnet_buffer (b1)->sw_if_index[VLIB_RX] = s->sw_if_index[VLIB_RX];
1145 
1146  vnet_buffer (b0)->sw_if_index[VLIB_TX] =
1147  vnet_buffer (b1)->sw_if_index[VLIB_TX] = (u32) ~ 0;
1148 
1149  if (set_data)
1150  {
1151  clib_memcpy (b0->data, data, n_data);
1152  clib_memcpy (b1->data, data, n_data);
1153  }
1154  else
1155  {
1156  ASSERT (validate_buffer_data2 (b0, s, data_offset, n_data));
1157  ASSERT (validate_buffer_data2 (b1, s, data_offset, n_data));
1158  }
1159  }
1160 
1161  while (n_left >= 1)
1162  {
1163  u32 bi0;
1164  vlib_buffer_t *b0;
1165 
1166  bi0 = b[0];
1167  b += 1;
1168  n_left -= 1;
1169 
1170  b0 = vlib_get_buffer (vm, bi0);
1171  vnet_buffer (b0)->sw_if_index[VLIB_RX] = s->sw_if_index[VLIB_RX];
1172  /* s->sw_if_index[VLIB_TX]; */
1173  vnet_buffer (b0)->sw_if_index[VLIB_TX] = (u32) ~ 0;
1174 
1175  if (set_data)
1176  clib_memcpy (b0->data, data, n_data);
1177  else
1178  ASSERT (validate_buffer_data2 (b0, s, data_offset, n_data));
1179  }
1180 }
1181 
1182 static u32
1184  pg_stream_t * s,
1185  pg_buffer_index_t * bi,
1186  u32 * buffers, u32 * next_buffers, u32 n_alloc)
1187 {
1189  uword is_start_of_packet = bi == s->buffer_indices;
1190  u32 n_allocated;
1191 
1192  n_allocated = vlib_buffer_alloc_from_free_list (vm,
1193  buffers,
1194  n_alloc,
1195  bi->free_list_index);
1196  if (n_allocated == 0)
1197  return 0;
1198 
1199  /*
1200  * We can't assume we got all the buffers we asked for...
1201  * This never worked until recently.
1202  */
1203  n_alloc = n_allocated;
1204 
1205  /* Reinitialize buffers */
1207  (vm, s,
1208  buffers,
1209  n_alloc, (bi - s->buffer_indices) * s->buffer_bytes /* data offset */ ,
1210  s->buffer_bytes,
1211  /* set_data */ 1);
1212 
1213  if (next_buffers)
1214  pg_set_next_buffer_pointers (pg, s, buffers, next_buffers, n_alloc);
1215 
1216  if (is_start_of_packet)
1217  {
1218  if (vec_len (s->replay_packet_templates) > 0)
1219  {
1220  vnet_main_t *vnm = vnet_get_main ();
1222  vnet_sw_interface_t *si =
1224  u32 l = 0;
1225  u32 i;
1226  for (i = 0; i < n_alloc; i++)
1227  l += vlib_buffer_index_length_in_chain (vm, buffers[i]);
1231  si->sw_if_index, n_alloc, l);
1232  s->current_replay_packet_index += n_alloc;
1235  }
1236  else
1237  {
1238  pg_generate_set_lengths (pg, s, buffers, n_alloc);
1239  if (vec_len (s->buffer_indices) > 1)
1240  pg_generate_fix_multi_buffer_lengths (pg, s, buffers, n_alloc);
1241 
1242  pg_generate_edit (pg, s, buffers, n_alloc);
1243  }
1244  }
1245 
1246  return n_alloc;
1247 }
1248 
1249 static u32
1250 pg_stream_fill (pg_main_t * pg, pg_stream_t * s, u32 n_buffers)
1251 {
1252  pg_buffer_index_t *bi;
1253  word i, n_in_fifo, n_alloc, n_free, n_added;
1254  u32 *tail, *start, *end, *last_tail, *last_start;
1255 
1256  bi = s->buffer_indices;
1257 
1258  n_in_fifo = clib_fifo_elts (bi->buffer_fifo);
1259  if (n_in_fifo >= n_buffers)
1260  return n_in_fifo;
1261 
1262  n_alloc = n_buffers - n_in_fifo;
1263 
1264  /* Round up, but never generate more than limit. */
1265  n_alloc = clib_max (VLIB_FRAME_SIZE, n_alloc);
1266 
1267  if (s->n_packets_limit > 0
1268  && s->n_packets_generated + n_in_fifo + n_alloc >= s->n_packets_limit)
1269  {
1270  n_alloc = s->n_packets_limit - s->n_packets_generated - n_in_fifo;
1271  if (n_alloc < 0)
1272  n_alloc = 0;
1273  }
1274 
1275  /* All buffer fifos should have the same size. */
1276  if (CLIB_DEBUG > 0)
1277  {
1278  uword l = ~0, e;
1279  vec_foreach (bi, s->buffer_indices)
1280  {
1281  e = clib_fifo_elts (bi->buffer_fifo);
1282  if (bi == s->buffer_indices)
1283  l = e;
1284  ASSERT (l == e);
1285  }
1286  }
1287 
1288  last_tail = last_start = 0;
1289  n_added = n_alloc;
1290 
1291  for (i = vec_len (s->buffer_indices) - 1; i >= 0; i--)
1292  {
1293  bi = vec_elt_at_index (s->buffer_indices, i);
1294 
1295  n_free = clib_fifo_free_elts (bi->buffer_fifo);
1296  if (n_free < n_alloc)
1297  clib_fifo_resize (bi->buffer_fifo, n_alloc - n_free);
1298 
1299  tail = clib_fifo_advance_tail (bi->buffer_fifo, n_alloc);
1300  start = bi->buffer_fifo;
1301  end = clib_fifo_end (bi->buffer_fifo);
1302 
1303  if (tail + n_alloc <= end)
1304  {
1305  n_added =
1306  pg_stream_fill_helper (pg, s, bi, tail, last_tail, n_alloc);
1307  }
1308  else
1309  {
1310  u32 n = clib_min (end - tail, n_alloc);
1311  n_added = pg_stream_fill_helper (pg, s, bi, tail, last_tail, n);
1312 
1313  if (n_added == n && n_alloc > n_added)
1314  {
1315  n_added += pg_stream_fill_helper
1316  (pg, s, bi, start, last_start, n_alloc - n_added);
1317  }
1318  }
1319 
1320  if (PREDICT_FALSE (n_added < n_alloc))
1321  tail = clib_fifo_advance_tail (bi->buffer_fifo, n_added - n_alloc);
1322 
1323  last_tail = tail;
1324  last_start = start;
1325 
1326  /* Verify that pkts in the fifo are properly allocated */
1327  }
1328 
1329  return n_in_fifo + n_added;
1330 }
1331 
1332 typedef struct
1333 {
1335 
1338 
1339  /* Use pre data for packet data. */
1342 
1343 static u8 *
1344 format_pg_input_trace (u8 * s, va_list * va)
1345 {
1346  vlib_main_t *vm = va_arg (*va, vlib_main_t *);
1347  CLIB_UNUSED (vlib_node_t * node) = va_arg (*va, vlib_node_t *);
1348  pg_input_trace_t *t = va_arg (*va, pg_input_trace_t *);
1349  pg_main_t *pg = &pg_main;
1350  pg_stream_t *stream;
1351  vlib_node_t *n;
1352  u32 indent = format_get_indent (s);
1353 
1354  stream = 0;
1355  if (!pool_is_free_index (pg->streams, t->stream_index))
1356  stream = pool_elt_at_index (pg->streams, t->stream_index);
1357 
1358  if (stream)
1359  s = format (s, "stream %v", pg->streams[t->stream_index].name);
1360  else
1361  s = format (s, "stream %d", t->stream_index);
1362 
1363  s = format (s, ", %d bytes", t->packet_length);
1364  s = format (s, ", %d sw_if_index", t->sw_if_index);
1365 
1366  s = format (s, "\n%U%U",
1368 
1369  s = format (s, "\n%U", format_white_space, indent);
1370 
1371  n = 0;
1372  if (stream)
1373  n = vlib_get_node (vm, stream->node_index);
1374 
1375  if (n && n->format_buffer)
1376  s = format (s, "%U", n->format_buffer,
1377  t->buffer.pre_data, sizeof (t->buffer.pre_data));
1378  else
1379  s = format (s, "%U",
1381  ARRAY_LEN (t->buffer.pre_data));
1382  return s;
1383 }
1384 
1385 static void
1387  vlib_node_runtime_t * node,
1388  pg_stream_t * s, u32 * buffers, u32 n_buffers)
1389 {
1391  u32 *b, n_left, stream_index, next_index;
1392 
1393  n_left = n_buffers;
1394  b = buffers;
1395  stream_index = s - pg->streams;
1396  next_index = s->next_index;
1397 
1398  while (n_left >= 2)
1399  {
1400  u32 bi0, bi1;
1401  vlib_buffer_t *b0, *b1;
1402  pg_input_trace_t *t0, *t1;
1403 
1404  bi0 = b[0];
1405  bi1 = b[1];
1406  b += 2;
1407  n_left -= 2;
1408 
1409  b0 = vlib_get_buffer (vm, bi0);
1410  b1 = vlib_get_buffer (vm, bi1);
1411 
1412  vlib_trace_buffer (vm, node, next_index, b0, /* follow_chain */ 1);
1413  vlib_trace_buffer (vm, node, next_index, b1, /* follow_chain */ 1);
1414 
1415  t0 = vlib_add_trace (vm, node, b0, sizeof (t0[0]));
1416  t1 = vlib_add_trace (vm, node, b1, sizeof (t1[0]));
1417 
1418  t0->stream_index = stream_index;
1419  t1->stream_index = stream_index;
1420 
1423 
1424  t0->sw_if_index = vnet_buffer (b0)->sw_if_index[VLIB_RX];
1425  t1->sw_if_index = vnet_buffer (b1)->sw_if_index[VLIB_RX];
1426 
1427  clib_memcpy (&t0->buffer, b0, sizeof (b0[0]) - sizeof (b0->pre_data));
1428  clib_memcpy (&t1->buffer, b1, sizeof (b1[0]) - sizeof (b1->pre_data));
1429 
1430  clib_memcpy (t0->buffer.pre_data, b0->data,
1431  sizeof (t0->buffer.pre_data));
1432  clib_memcpy (t1->buffer.pre_data, b1->data,
1433  sizeof (t1->buffer.pre_data));
1434  }
1435 
1436  while (n_left >= 1)
1437  {
1438  u32 bi0;
1439  vlib_buffer_t *b0;
1440  pg_input_trace_t *t0;
1441 
1442  bi0 = b[0];
1443  b += 1;
1444  n_left -= 1;
1445 
1446  b0 = vlib_get_buffer (vm, bi0);
1447 
1448  vlib_trace_buffer (vm, node, next_index, b0, /* follow_chain */ 1);
1449  t0 = vlib_add_trace (vm, node, b0, sizeof (t0[0]));
1450 
1451  t0->stream_index = stream_index;
1453  t0->sw_if_index = vnet_buffer (b0)->sw_if_index[VLIB_RX];
1454  clib_memcpy (&t0->buffer, b0, sizeof (b0[0]) - sizeof (b0->pre_data));
1455  clib_memcpy (t0->buffer.pre_data, b0->data,
1456  sizeof (t0->buffer.pre_data));
1457  }
1458 }
1459 
1460 static uword
1462  pg_main_t * pg,
1463  pg_stream_t * s, uword n_packets_to_generate)
1464 {
1466  u32 *to_next, n_this_frame, n_left, n_trace, n_packets_in_fifo;
1467  uword n_packets_generated;
1468  pg_buffer_index_t *bi, *bi0;
1469  u32 next_index = s->next_index;
1472  u8 feature_arc_index = fm->device_input_feature_arc_index;
1473  cm = &fm->feature_config_mains[feature_arc_index];
1474  u32 current_config_index = ~(u32) 0;
1475  int i;
1476 
1477  bi0 = s->buffer_indices;
1478 
1479  n_packets_in_fifo = pg_stream_fill (pg, s, n_packets_to_generate);
1480  n_packets_to_generate = clib_min (n_packets_in_fifo, n_packets_to_generate);
1481  n_packets_generated = 0;
1482 
1483  if (PREDICT_FALSE
1484  (vnet_have_features (feature_arc_index, s->sw_if_index[VLIB_RX])))
1485  {
1486  current_config_index =
1488  vnet_get_config_data (&cm->config_main, &current_config_index,
1489  &next_index, 0);
1490  }
1491 
1492  while (n_packets_to_generate > 0)
1493  {
1494  u32 *head, *start, *end;
1495 
1496  vlib_get_next_frame (vm, node, next_index, to_next, n_left);
1497 
1498  n_this_frame = n_packets_to_generate;
1499  if (n_this_frame > n_left)
1500  n_this_frame = n_left;
1501 
1502  start = bi0->buffer_fifo;
1503  end = clib_fifo_end (bi0->buffer_fifo);
1504  head = clib_fifo_head (bi0->buffer_fifo);
1505 
1506  if (head + n_this_frame <= end)
1507  vlib_copy_buffers (to_next, head, n_this_frame);
1508  else
1509  {
1510  u32 n = end - head;
1511  vlib_copy_buffers (to_next + 0, head, n);
1512  vlib_copy_buffers (to_next + n, start, n_this_frame - n);
1513  }
1514 
1515  vec_foreach (bi, s->buffer_indices)
1516  clib_fifo_advance_head (bi->buffer_fifo, n_this_frame);
1517 
1518  if (current_config_index != ~(u32) 0)
1519  for (i = 0; i < n_this_frame; i++)
1520  {
1521  vlib_buffer_t *b;
1522  b = vlib_get_buffer (vm, to_next[i]);
1523  vnet_buffer (b)->device_input_feat.saved_next_index =
1524  s->next_index;
1525  vnet_buffer (b)->device_input_feat.buffer_advance = 0;
1526  b->current_config_index = current_config_index;
1527  vnet_buffer (b)->feature_arc_index = feature_arc_index;
1528  }
1529 
1530  n_trace = vlib_get_trace_count (vm, node);
1531  if (n_trace > 0)
1532  {
1533  u32 n = clib_min (n_trace, n_this_frame);
1534  pg_input_trace (pg, node, s, to_next, n);
1535  vlib_set_trace_count (vm, node, n_trace - n);
1536  }
1537  n_packets_to_generate -= n_this_frame;
1538  n_packets_generated += n_this_frame;
1539  n_left -= n_this_frame;
1540  vlib_put_next_frame (vm, node, next_index, n_left);
1541  }
1542 
1543  return n_packets_generated;
1544 }
1545 
1546 static uword
1548 {
1550  uword n_packets;
1551  f64 time_now, dt;
1552 
1553  if (s->n_packets_limit > 0 && s->n_packets_generated >= s->n_packets_limit)
1554  {
1555  pg_stream_enable_disable (pg, s, /* want_enabled */ 0);
1556  return 0;
1557  }
1558 
1559  /* Apply rate limit. */
1560  time_now = vlib_time_now (vm);
1561  if (s->time_last_generate == 0)
1562  s->time_last_generate = time_now;
1563 
1564  dt = time_now - s->time_last_generate;
1565  s->time_last_generate = time_now;
1566 
1567  n_packets = VLIB_FRAME_SIZE;
1568  if (s->rate_packets_per_second > 0)
1569  {
1571  n_packets = s->packet_accumulator;
1572 
1573  /* Never allow accumulator to grow if we get behind. */
1574  s->packet_accumulator -= n_packets;
1575  }
1576 
1577  /* Apply fixed limit. */
1578  if (s->n_packets_limit > 0
1579  && s->n_packets_generated + n_packets > s->n_packets_limit)
1580  n_packets = s->n_packets_limit - s->n_packets_generated;
1581 
1582  /* Generate up to one frame's worth of packets. */
1583  if (n_packets > VLIB_FRAME_SIZE)
1584  n_packets = VLIB_FRAME_SIZE;
1585 
1586  if (n_packets > 0)
1587  n_packets = pg_generate_packets (node, pg, s, n_packets);
1588 
1589  s->n_packets_generated += n_packets;
1590 
1591  return n_packets;
1592 }
1593 
1594 uword
1596 {
1597  uword i;
1598  pg_main_t *pg = &pg_main;
1599  uword n_packets = 0;
1600  u32 worker_index = 0;
1601 
1602  if (vlib_num_workers ())
1603  worker_index = vlib_get_current_worker_index ();
1604 
1605  /* *INDENT-OFF* */
1606  clib_bitmap_foreach (i, pg->enabled_streams[worker_index], ({
1607  pg_stream_t *s = vec_elt_at_index (pg->streams, i);
1608  n_packets += pg_input_stream (node, pg, s);
1609  }));
1610  /* *INDENT-ON* */
1611 
1612  return n_packets;
1613 }
1614 
1615 /* *INDENT-OFF* */
1617  .function = pg_input,
1618  .name = "pg-input",
1619  .sibling_of = "device-input",
1620  .type = VLIB_NODE_TYPE_INPUT,
1621 
1622  .format_trace = format_pg_input_trace,
1623 
1624  /* Input node will be left disabled until a stream is active. */
1625  .state = VLIB_NODE_STATE_DISABLED,
1626 };
1627 /* *INDENT-ON* */
1628 
1629 /*
1630  * fd.io coding-style-patch-verification: ON
1631  *
1632  * Local Variables:
1633  * eval: (c-set-style "gnu")
1634  * End:
1635  */
vnet_config_main_t config_main
Definition: feature.h:65
Definition: edit.h:64
static uword pg_generate_packets(vlib_node_runtime_t *node, pg_main_t *pg, pg_stream_t *s, uword n_packets_to_generate)
Definition: input.c:1461
u32 next_index
Definition: pg.h:150
#define PG_EDIT_LO
Definition: edit.h:83
u64 n_packets_limit
Definition: pg.h:159
#define clib_min(x, y)
Definition: clib.h:289
#define clib_fifo_head(v)
Definition: fifo.h:254
#define CLIB_UNUSED(x)
Definition: clib.h:79
u8 * fixed_packet_data
Definition: pg.h:123
static u32 vlib_get_trace_count(vlib_main_t *vm, vlib_node_runtime_t *rt)
Definition: trace_funcs.h:143
static void vlib_increment_combined_counter(vlib_combined_counter_main_t *cm, u32 thread_index, u32 index, u64 n_packets, u64 n_bytes)
Increment a combined counter.
Definition: counter.h:213
u32 current_config_index
Used by feature subgraph arcs to visit enabled feature nodes.
Definition: buffer.h:132
static uword clib_fifo_elts(void *v)
Definition: fifo.h:66
vnet_main_t * vnet_get_main(void)
Definition: misc.c:47
static void setbits_1(void *a0, u64 v0, u64 v_min, u64 v_max, u32 max_bits, u32 n_bits, u64 mask, u32 shift)
Definition: input.c:438
#define vnet_buffer2(b)
Definition: buffer.h:403
Definition: pg.h:316
static void pg_generate_fix_multi_buffer_lengths(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers)
Definition: input.c:903
vnet_interface_main_t interface_main
Definition: vnet.h:56
static u64 do_it(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers, u32 lo_bit, u32 hi_bit, u64 v_min, u64 v_max, u64 v, pg_edit_type_t edit_type)
Definition: input.c:744
unsigned long u64
Definition: types.h:89
pg_edit_group_t * edit_groups
Definition: pg.h:109
#define clib_fifo_advance_tail(f, n_elts)
Definition: fifo.h:161
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:225
#define clib_fifo_resize(f, n_elts)
Definition: fifo.h:101
static void * clib_random_buffer_get_data(clib_random_buffer_t *b, uword n_bytes)
Definition: random_buffer.h:78
void(* edit_function)(struct pg_main_t *pg, struct pg_stream_t *s, struct pg_edit_group_t *g, u32 *buffers, u32 n_buffers)
Definition: pg.h:73
pg_edit_type_t
Definition: edit.h:46
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:523
static_always_inline u64 do_set_increment(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers, u32 n_bits, u32 byte_offset, u32 is_net_byte_order, u32 want_sum, u64 *sum_result, u64 v_min, u64 v_max, u64 v)
Definition: input.c:208
static void pg_generate_set_lengths(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers)
Definition: input.c:851
int i
static u32 format_get_indent(u8 *s)
Definition: format.h:72
#define STRUCT_OFFSET_OF(t, f)
Definition: clib.h:62
static vnet_sw_interface_t * vnet_get_sw_interface(vnet_main_t *vnm, u32 sw_if_index)
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:419
u64 last_increment_value
Definition: edit.h:87
static_always_inline int vnet_have_features(u8 arc, u32 sw_if_index)
Definition: feature.h:183
vlib_buffer_free_list_index_t free_list_index
Definition: pg.h:93
pg_buffer_index_t * buffer_indices
Definition: pg.h:169
static_always_inline void init_buffers_inline(vlib_main_t *vm, pg_stream_t *s, u32 *buffers, u32 n_buffers, u32 data_offset, u32 n_data, u32 set_data)
Definition: input.c:1100
pg_edit_type_t packet_size_edit_type
Definition: pg.h:111
static uword vlib_buffer_length_in_chain(vlib_main_t *vm, vlib_buffer_t *b)
Get length in bytes of the buffer chain.
Definition: buffer_funcs.h:250
unsigned char u8
Definition: types.h:56
u8 * fixed_packet_data_mask
Definition: pg.h:123
static_always_inline void do_set_fixed(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers, u32 n_bits, u32 byte_offset, u32 is_net_byte_order, u64 v_min, u64 v_max)
Definition: input.c:157
static void set_1(void *a0, u64 v0, u64 v_min, u64 v_max, u32 n_bits, u32 is_net_byte_order)
Definition: input.c:83
double f64
Definition: types.h:142
static void vlib_trace_buffer(vlib_main_t *vm, vlib_node_runtime_t *r, u32 next_index, vlib_buffer_t *b, int follow_chain)
Definition: trace_funcs.h:104
static void pg_generate_edit(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers)
Definition: input.c:960
#define PG_EDIT_HI
Definition: edit.h:84
#define static_always_inline
Definition: clib.h:93
static void pg_set_next_buffer_pointers(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 *next_buffers, u32 n_buffers)
Definition: input.c:1011
i64 word
Definition: types.h:111
#define vlib_prefetch_buffer_with_index(vm, bi, type)
Prefetch buffer metadata by buffer index The first 64 bytes of buffer contains most header informatio...
Definition: buffer_funcs.h:324
static_always_inline u64 do_setbits_increment(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers, u32 max_bits, u32 n_bits, u32 byte_offset, u64 v_min, u64 v_max, u64 v, u64 mask, u32 shift)
Definition: input.c:547
#define always_inline
Definition: clib.h:92
static_always_inline void do_setbits_fixed(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers, u32 max_bits, u32 n_bits, u32 byte_offset, u64 v_min, u64 v_max, u64 mask, u32 shift)
Definition: input.c:495
vlib_combined_counter_main_t * combined_sw_if_counters
Definition: interface.h:811
u8 * format_white_space(u8 *s, va_list *va)
Definition: std-formats.c:113
static uword clib_fifo_free_elts(void *v)
Definition: fifo.h:82
pg_edit_type_t type
Definition: edit.h:66
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
u8 * format_hex_bytes(u8 *s, va_list *va)
Definition: std-formats.c:84
u8 pre_data[VLIB_BUFFER_PRE_DATA_SIZE]
Space for inserting data before buffer start.
Definition: buffer.h:164
static uword pg_input_stream(vlib_node_runtime_t *node, pg_main_t *pg, pg_stream_t *s)
Definition: input.c:1547
i32 lsb_bit_offset
Definition: edit.h:73
unsigned int u32
Definition: types.h:88
static u32 vlib_get_current_worker_index()
Definition: threads.h:393
#define vec_end(v)
End (last data address) of vector.
static int validate_buffer_data(vlib_buffer_t *b, pg_stream_t *s)
Definition: input.c:77
static void vlib_copy_buffers(u32 *dst, u32 *src, u32 n)
Definition: buffer_funcs.h:687
#define VLIB_FRAME_SIZE
Definition: node.h:364
u32 buffer_bytes
Definition: pg.h:127
f64 packet_accumulator
Definition: pg.h:167
u32 last_increment_packet_size
Definition: pg.h:130
#define clib_bitmap_foreach(i, ai, body)
Macro to iterate across set bits in a bitmap.
Definition: bitmap.h:361
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
Definition: pool.h:464
format_function_t format_vnet_buffer
Definition: buffer.h:413
u16 current_length
Nbytes between current data and the end of this buffer.
Definition: buffer.h:108
u32 current_replay_packet_index
Definition: pg.h:173
#define v
Definition: acl.c:491
u8 * name
Definition: pg.h:99
unsigned short u16
Definition: types.h:57
static u64 pg_edit_get_value(pg_edit_t *e, int hi_or_lo)
Definition: edit.h:173
static void * vnet_get_config_data(vnet_config_main_t *cm, u32 *config_index, u32 *next_index, u32 n_data_bytes)
Definition: config.h:122
#define PREDICT_FALSE(x)
Definition: clib.h:105
format_function_t * format_buffer
Definition: node.h:347
#define vlib_get_next_frame(vm, node, next_index, vectors, n_vectors_left)
Get pointer to next frame vector data by (vlib_node_runtime_t, next_index).
Definition: node_funcs.h:364
uword ** enabled_streams
Definition: pg.h:322
u32 n_bits
Definition: edit.h:79
vlib_buffer_t buffer
Definition: input.c:1340
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:153
static void vlib_buffer_free_no_next(vlib_main_t *vm, u32 *buffers, u32 n_buffers)
Free buffers, does not free the buffer chain for each buffer.
Definition: buffer_funcs.h:555
static_always_inline uword vlib_get_thread_index(void)
Definition: threads.h:221
#define CLIB_PREFETCH(addr, size, type)
Definition: cache.h:77
vlib_main_t * vm
Definition: buffer.c:294
static_always_inline void do_set_random(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers, u32 n_bits, u32 byte_offset, u32 is_net_byte_order, u32 want_sum, u64 *sum_result, u64 v_min, u64 v_max)
Definition: input.c:303
u64 * replay_packet_timestamps
Definition: pg.h:172
static u32 pg_stream_fill(pg_main_t *pg, pg_stream_t *s, u32 n_buffers)
Definition: input.c:1250
u32 min_packet_bytes
Definition: pg.h:114
u32 max_packet_bytes
Definition: pg.h:114
#define clib_warning(format, args...)
Definition: error.h:59
#define clib_memcpy(a, b, c)
Definition: string.h:75
static void set_2(void *a0, void *a1, u64 v0, u64 v1, u64 v_min, u64 v_max, u32 n_bits, u32 is_net_byte_order, u32 is_increment)
Definition: input.c:112
static uword max_pow2(uword x)
Definition: clib.h:220
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:271
#define ARRAY_LEN(x)
Definition: clib.h:59
void vlib_put_next_frame(vlib_main_t *vm, vlib_node_runtime_t *r, u32 next_index, u32 n_vectors_left)
Release pointer to next frame vector data.
Definition: main.c:454
pg_edit_t * non_fixed_edits
Definition: pg.h:118
u8 ** replay_packet_templates
Definition: pg.h:171
static uword clib_fifo_advance_head(void *v, uword n_elts)
Definition: fifo.h:169
static int validate_buffer_data2(vlib_buffer_t *b, pg_stream_t *s, u32 data_offset, u32 n_bytes)
Definition: input.c:47
pg_stream_t * streams
Definition: pg.h:319
#define ASSERT(truth)
u32 next_buffer
Next buffer for this linked-list of buffers.
Definition: buffer.h:126
void pg_stream_enable_disable(pg_main_t *pg, pg_stream_t *s, int is_enable)
Definition: stream.c:49
static uword vlib_buffer_index_length_in_chain(vlib_main_t *vm, u32 bi)
Get length in bytes of the buffer index buffer chain.
Definition: buffer_funcs.h:270
#define clib_mem_unaligned(pointer, type)
Definition: types.h:155
Definition: pg.h:96
#define clib_max(x, y)
Definition: clib.h:282
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:23
#define clib_fifo_end(v)
Definition: fifo.h:63
static u32 vlib_buffer_alloc_from_free_list(vlib_main_t *vm, u32 *buffers, u32 n_buffers, vlib_buffer_free_list_index_t index)
Allocate buffers from specific freelist into supplied array.
Definition: buffer_funcs.h:431
static void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
Definition: trace_funcs.h:55
#define vec_elt(v, i)
Get vector value at index i.
u8 device_input_feature_arc_index
Feature arc index for device-input.
Definition: feature.h:93
static_always_inline void do_setbits_random(pg_main_t *pg, pg_stream_t *s, u32 *buffers, u32 n_buffers, u32 max_bits, u32 n_bits, u32 byte_offset, u64 v_min, u64 v_max, u64 mask, u32 shift)
Definition: input.c:626
u32 node_index
Definition: pg.h:144
Definition: defs.h:47
u32 sw_if_index[VLIB_N_RX_TX]
Definition: pg.h:141
static void pg_input_trace(pg_main_t *pg, vlib_node_runtime_t *node, pg_stream_t *s, u32 *buffers, u32 n_buffers)
Definition: input.c:1386
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
u64 uword
Definition: types.h:112
u32 packet_length
Definition: input.c:1336
f64 rate_packets_per_second
Definition: pg.h:163
static u8 * format_pg_input_trace(u8 *s, va_list *va)
Definition: input.c:1344
#define vnet_buffer(b)
Definition: buffer.h:360
static u32 pg_stream_fill_helper(pg_main_t *pg, pg_stream_t *s, pg_buffer_index_t *bi, u32 *buffers, u32 *next_buffers, u32 n_alloc)
Definition: input.c:1183
static u32 vlib_num_workers()
Definition: threads.h:375
#define STRUCT_SIZE_OF(t, f)
Definition: clib.h:64
u64 n_packets_generated
Definition: pg.h:155
vlib_node_registration_t pg_input_node
(constructor) VLIB_REGISTER_NODE (pg_input_node)
Definition: input.c:1616
pg_main_t pg_main
Definition: init.c:44
u8 data[0]
Packet data.
Definition: buffer.h:172
static vlib_node_t * vlib_get_node(vlib_main_t *vm, u32 i)
Get vlib node by index.
Definition: node_funcs.h:59
#define vec_foreach(var, vec)
Vector iterator.
static void vlib_set_trace_count(vlib_main_t *vm, vlib_node_runtime_t *rt, u32 count)
Definition: trace_funcs.h:159
vnet_feature_config_main_t * feature_config_mains
feature config main objects
Definition: feature.h:81
u32 stream_index
Definition: input.c:1334
u32 flags
buffer flags: VLIB_BUFFER_FREE_LIST_INDEX_MASK: bits used to store free list index, VLIB_BUFFER_IS_TRACED: trace this buffer.
Definition: buffer.h:111
uword pg_input(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: input.c:1595
#define BITS(x)
Definition: clib.h:58
f64 time_last_generate
Definition: pg.h:165
vnet_feature_main_t feature_main
Definition: feature.c:19
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:57
clib_random_buffer_t random_buffer
Definition: main.h:170
static void setbits_2(void *a0, void *a1, u64 v0, u64 v1, u64 v_min, u64 v_max, u32 max_bits, u32 n_bits, u64 mask, u32 shift, u32 is_increment)
Definition: input.c:462
static_always_inline void init_replay_buffers_inline(vlib_main_t *vm, pg_stream_t *s, u32 *buffers, u32 n_buffers, u32 data_offset, u32 n_data)
Definition: input.c:1057
Definition: defs.h:46
u32 * buffer_fifo
Definition: pg.h:90