FD.io VPP  v19.04.3-1-gdfec10d13
Vector Packet Processing
node.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  * node.c: VLIB processing nodes
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 <vlib/threads.h>
42 
43 /* Query node given name. */
46 {
47  vlib_node_main_t *nm = &vm->node_main;
48  uword *p;
49  u8 *key = name;
50  if (!clib_mem_is_heap_object (vec_header (key, 0)))
51  key = format (0, "%s", key);
52  p = hash_get (nm->node_by_name, key);
53  if (key != name)
54  vec_free (key);
55  return p ? vec_elt (nm->nodes, p[0]) : 0;
56 }
57 
58 static void
60 {
61  vlib_node_t *n = vlib_get_node (vm, node_index);
63 
64  t = vec_elt_at_index (vm->node_call_elog_event_types, node_index);
65  vec_free (t->format);
66  t->format = (char *) format (0, "%v-call: %%d%c", n->name, 0);
67 
68  t = vec_elt_at_index (vm->node_return_elog_event_types, node_index);
69  vec_free (t->format);
70  t->format = (char *) format (0, "%v-return: %%d%c", n->name, 0);
71 
72  n->name_elog_string = elog_string (&vm->elog_main, "%v%c", n->name, 0);
73 }
74 
75 static void
77 {
78  int i;
79  vlib_main_t *vm;
80  vlib_node_t *n;
81 
82  if (vec_len (vlib_mains) == 1)
83  return;
84 
85  vm = vlib_mains[0];
86  n = vlib_get_node (vm, node_index);
87 
88  ASSERT (vlib_get_thread_index () == 0);
90 
91  for (i = 1; i < vec_len (vlib_mains); i++)
92  {
93  vlib_main_t *vm_worker = vlib_mains[i];
94  vlib_node_t *n_worker = vlib_get_node (vm_worker, node_index);
95 
96  n_worker->name = n->name;
97  n_worker->name_elog_string = n->name_elog_string;
98  }
99 }
100 
101 void
102 vlib_node_rename (vlib_main_t * vm, u32 node_index, char *fmt, ...)
103 {
104  va_list va;
105  vlib_node_main_t *nm = &vm->node_main;
106  vlib_node_t *n = vlib_get_node (vm, node_index);
107 
108  va_start (va, fmt);
109  hash_unset (nm->node_by_name, n->name);
110  vec_free (n->name);
111  n->name = va_format (0, fmt, &va);
112  va_end (va);
113  hash_set (nm->node_by_name, n->name, n->index);
114 
115  node_set_elog_name (vm, node_index);
116 
117  /* Propagate the change to all worker threads */
118  vlib_worker_thread_node_rename (node_index);
119 }
120 
121 static void
122 vlib_node_runtime_update (vlib_main_t * vm, u32 node_index, u32 next_index)
123 {
124  vlib_node_main_t *nm = &vm->node_main;
125  vlib_node_runtime_t *r, *s;
126  vlib_node_t *node, *next_node;
127  vlib_next_frame_t *nf;
129  i32 i, j, n_insert;
130 
131  ASSERT (vlib_get_thread_index () == 0);
132 
134 
135  node = vec_elt (nm->nodes, node_index);
136  r = vlib_node_get_runtime (vm, node_index);
137 
138  n_insert = vec_len (node->next_nodes) - r->n_next_nodes;
139  if (n_insert > 0)
140  {
141  i = r->next_frame_index + r->n_next_nodes;
142  vec_insert (nm->next_frames, n_insert, i);
143 
144  /* Initialize newly inserted next frames. */
145  for (j = 0; j < n_insert; j++)
146  vlib_next_frame_init (nm->next_frames + i + j);
147 
148  /* Relocate other next frames at higher indices. */
149  for (j = 0; j < vec_len (nm->nodes); j++)
150  {
151  s = vlib_node_get_runtime (vm, j);
152  if (j != node_index && s->next_frame_index >= i)
153  s->next_frame_index += n_insert;
154  }
155 
156  /* Pending frames may need to be relocated also. */
157  vec_foreach (pf, nm->pending_frames)
158  {
160  && pf->next_frame_index >= i)
161  pf->next_frame_index += n_insert;
162  }
163  /* *INDENT-OFF* */
165  if (pf->next_frame_index != ~0 && pf->next_frame_index >= i)
166  pf->next_frame_index += n_insert;
167  }));
168  /* *INDENT-ON* */
169 
170  r->n_next_nodes = vec_len (node->next_nodes);
171  }
172 
173  /* Set frame's node runtime index. */
174  next_node = vlib_get_node (vm, node->next_nodes[next_index]);
175  nf = nm->next_frames + r->next_frame_index + next_index;
176  nf->node_runtime_index = next_node->runtime_index;
177 
179 
181 }
182 
183 uword
184 vlib_node_get_next (vlib_main_t * vm, uword node_index, uword next_node_index)
185 {
186  vlib_node_main_t *nm = &vm->node_main;
187  vlib_node_t *node;
188  uword *p;
189 
190  node = vec_elt (nm->nodes, node_index);
191 
192  /* Runtime has to be initialized. */
194 
195  if ((p = hash_get (node->next_slot_by_node, next_node_index)))
196  {
197  return p[0];
198  }
199 
200  return (~0);
201 }
202 
203 /* Add next node to given node in given slot. */
204 uword
206  uword node_index,
207  uword next_node_index, uword slot)
208 {
209  vlib_node_main_t *nm = &vm->node_main;
210  vlib_node_t *node, *next;
211  uword *p;
212 
213  node = vec_elt (nm->nodes, node_index);
214  next = vec_elt (nm->nodes, next_node_index);
215 
216  /* Runtime has to be initialized. */
218 
219  if ((p = hash_get (node->next_slot_by_node, next_node_index)))
220  {
221  /* Next already exists: slot must match. */
222  if (slot != ~0)
223  ASSERT (slot == p[0]);
224  return p[0];
225  }
226 
227  if (slot == ~0)
228  slot = vec_len (node->next_nodes);
229 
230  vec_validate_init_empty (node->next_nodes, slot, ~0);
231  vec_validate (node->n_vectors_by_next_node, slot);
232 
233  node->next_nodes[slot] = next_node_index;
234  hash_set (node->next_slot_by_node, next_node_index, slot);
235 
236  vlib_node_runtime_update (vm, node_index, slot);
237 
238  next->prev_node_bitmap = clib_bitmap_ori (next->prev_node_bitmap,
239  node_index);
240 
241  /* Siblings all get same node structure. */
242  {
243  uword sib_node_index, sib_slot;
244  vlib_node_t *sib_node;
245  /* *INDENT-OFF* */
246  clib_bitmap_foreach (sib_node_index, node->sibling_bitmap, ({
247  sib_node = vec_elt (nm->nodes, sib_node_index);
248  if (sib_node != node)
249  {
250  sib_slot = vlib_node_add_next_with_slot (vm, sib_node_index, next_node_index, slot);
251  ASSERT (sib_slot == slot);
252  }
253  }));
254  /* *INDENT-ON* */
255  }
256 
257  return slot;
258 }
259 
260 /* Add named next node to given node in given slot. */
261 uword
263  uword node, char *name, uword slot)
264 {
265  vlib_node_main_t *nm;
266  vlib_node_t *n, *n_next;
267 
268  nm = &vm->node_main;
269  n = vlib_get_node (vm, node);
270 
271  n_next = vlib_get_node_by_name (vm, (u8 *) name);
272  if (!n_next)
273  {
275  return ~0;
276 
277  if (slot == ~0)
278  slot = clib_max (vec_len (n->next_node_names),
279  vec_len (n->next_nodes));
280  vec_validate (n->next_node_names, slot);
281  n->next_node_names[slot] = name;
282  return slot;
283  }
284 
285  return vlib_node_add_next_with_slot (vm, node, n_next->index, slot);
286 }
287 
288 static void
290 {
292 
293  clib_memset (&t, 0, sizeof (t));
294 
295  /* 2 event types for this node: one when node function is called.
296  One when it returns. */
298  vm->node_call_elog_event_types[ni] = t;
299 
301  vm->node_return_elog_event_types[ni] = t;
302 
303  node_set_elog_name (vm, ni);
304 }
305 
306 #ifdef CLIB_UNIX
307 #define STACK_ALIGN (clib_mem_get_page_size())
308 #else
309 #define STACK_ALIGN CLIB_CACHE_LINE_BYTES
310 #endif
311 
312 static void
314 {
315  vlib_node_main_t *nm = &vm->node_main;
316  vlib_node_t *n;
317  u32 page_size = clib_mem_get_page_size ();
318  int i;
319 
320  if (CLIB_DEBUG > 0)
321  {
322  /* Default (0) type should match INTERNAL. */
323  vlib_node_t zero = { 0 };
325  }
326 
327  if (r->node_fn_registrations)
328  {
329  vlib_node_fn_registration_t *fnr = r->node_fn_registrations;
330  int priority = -1;
331 
332  /* to avoid confusion, please remove ".function " statiement from
333  CLIB_NODE_REGISTRATION() if using function function candidates */
334  ASSERT (r->function == 0);
335 
336  while (fnr)
337  {
338  if (fnr->priority > priority)
339  {
340  priority = fnr->priority;
341  r->function = fnr->function;
342  }
343  fnr = fnr->next_registration;
344  }
345  }
346 
347  ASSERT (r->function != 0);
348 
349  n = clib_mem_alloc_no_fail (sizeof (n[0]));
350  clib_memset (n, 0, sizeof (n[0]));
351  n->index = vec_len (nm->nodes);
352  n->node_fn_registrations = r->node_fn_registrations;
353  n->protocol_hint = r->protocol_hint;
354 
355  vec_add1 (nm->nodes, n);
356 
357  /* Name is always a vector so it can be formatted with %v. */
358  if (clib_mem_is_heap_object (vec_header (r->name, 0)))
359  n->name = vec_dup ((u8 *) r->name);
360  else
361  n->name = format (0, "%s", r->name);
362 
363  if (!nm->node_by_name)
364  nm->node_by_name = hash_create_vec ( /* size */ 32,
365  sizeof (n->name[0]), sizeof (uword));
366 
367  /* Node names must be unique. */
368  {
369  vlib_node_t *o = vlib_get_node_by_name (vm, n->name);
370  if (o)
371  clib_error ("more than one node named `%v'", n->name);
372  }
373 
374  hash_set (nm->node_by_name, n->name, n->index);
375 
376  r->index = n->index; /* save index in registration */
377  n->function = r->function;
378 
379  /* Node index of next sibling will be filled in by vlib_node_main_init. */
380  n->sibling_of = r->sibling_of;
381  if (r->sibling_of && r->n_next_nodes > 0)
382  clib_error ("sibling node should not have any next nodes `%v'", n->name);
383 
384  if (r->type == VLIB_NODE_TYPE_INTERNAL)
385  ASSERT (r->vector_size > 0);
386 
387 #define _(f) n->f = r->f
388 
389  _(type);
390  _(flags);
391  _(state);
392  _(scalar_size);
393  _(vector_size);
394  _(format_buffer);
395  _(unformat_buffer);
396  _(format_trace);
397  _(validate_frame);
398 
399  /* Register error counters. */
400  vlib_register_errors (vm, n->index, r->n_errors, r->error_strings);
401  node_elog_init (vm, n->index);
402 
403  _(runtime_data_bytes);
404  if (r->runtime_data_bytes > 0)
405  {
406  vec_resize (n->runtime_data, r->runtime_data_bytes);
407  if (r->runtime_data)
408  clib_memcpy (n->runtime_data, r->runtime_data, r->runtime_data_bytes);
409  }
410 
411  vec_resize (n->next_node_names, r->n_next_nodes);
412  for (i = 0; i < r->n_next_nodes; i++)
413  n->next_node_names[i] = r->next_nodes[i];
414 
415  vec_validate_init_empty (n->next_nodes, r->n_next_nodes - 1, ~0);
416  vec_validate (n->n_vectors_by_next_node, r->n_next_nodes - 1);
417 
418  n->owner_node_index = n->owner_next_index = ~0;
419 
420  /* Initialize node runtime. */
421  {
423  u32 i;
424 
425  if (n->type == VLIB_NODE_TYPE_PROCESS)
426  {
427  vlib_process_t *p;
428  uword log2_n_stack_bytes;
429 
430  log2_n_stack_bytes = clib_max (r->process_log2_n_stack_bytes, 15);
431 
432 #ifdef CLIB_UNIX
433  /*
434  * Bump the stack size if running over a kernel with a large page size,
435  * and the stack isn't any too big to begin with. Otherwise, we'll
436  * trip over the stack guard page for sure.
437  */
438  if ((page_size > (4 << 10)) && log2_n_stack_bytes < 19)
439  {
440  if ((1 << log2_n_stack_bytes) <= page_size)
441  log2_n_stack_bytes = min_log2 (page_size) + 1;
442  else
443  log2_n_stack_bytes++;
444  }
445 #endif
446 
448  (sizeof (p[0]) + (1 << log2_n_stack_bytes),
450  0 /* no, don't call os_out_of_memory */ );
451  if (p == 0)
452  clib_panic ("failed to allocate process stack (%d bytes)",
453  1 << log2_n_stack_bytes);
454 
455  clib_memset (p, 0, sizeof (p[0]));
456  p->log2_n_stack_bytes = log2_n_stack_bytes;
457 
458  /* Process node's runtime index is really index into process
459  pointer vector. */
460  n->runtime_index = vec_len (nm->processes);
461 
462  vec_add1 (nm->processes, p);
463 
464  /* Paint first stack word with magic number so we can at least
465  detect process stack overruns. */
466  p->stack[0] = VLIB_PROCESS_STACK_MAGIC;
467 
468  /* Node runtime is stored inside of process. */
469  rt = &p->node_runtime;
470 
471 #ifdef CLIB_UNIX
472  /*
473  * Disallow writes to the bottom page of the stack, to
474  * catch stack overflows.
475  */
476  if (mprotect (p->stack, page_size, PROT_READ) < 0)
477  clib_unix_warning ("process stack");
478 #endif
479 
480  }
481  else
482  {
483  vec_add2_aligned (nm->nodes_by_type[n->type], rt, 1,
484  /* align */ CLIB_CACHE_LINE_BYTES);
485  n->runtime_index = rt - nm->nodes_by_type[n->type];
486  }
487 
488  if (n->type == VLIB_NODE_TYPE_INPUT)
489  nm->input_node_counts_by_state[n->state] += 1;
490 
491  rt->function = n->function;
492  rt->flags = n->flags;
493  rt->state = n->state;
494  rt->node_index = n->index;
495 
496  rt->n_next_nodes = r->n_next_nodes;
498 
500  for (i = 0; i < rt->n_next_nodes; i++)
502 
503  vec_resize (rt->errors, r->n_errors);
504  for (i = 0; i < vec_len (rt->errors); i++)
505  rt->errors[i] = n->error_heap_index + i;
506 
509 
510  if (vec_len (n->runtime_data) > 0)
512  vec_len (n->runtime_data));
513 
514  vec_free (n->runtime_data);
515  }
516 }
517 
518 /* Register new packet processing node. */
519 u32
521 {
522  register_node (vm, r);
523  return r->index;
524 }
525 
526 static uword
528  vlib_node_runtime_t * node, vlib_frame_t * frame)
529 {
530  u16 n_vectors = frame->n_vectors;
531 
532  vlib_node_increment_counter (vm, node->node_index, 0, n_vectors);
533  vlib_buffer_free (vm, vlib_frame_vector_args (frame), n_vectors);
534  vlib_frame_free (vm, node, frame);
535 
536  return n_vectors;
537 }
538 
539 void
541 {
543 
544  static char *null_node_error_strings[] = {
545  "blackholed packets",
546  };
547 
548  static vlib_node_registration_t null_node_reg = {
549  .function = null_node_fn,
550  .vector_size = sizeof (u32),
551  .name = "null-node",
552  .n_errors = 1,
553  .error_strings = null_node_error_strings,
554  };
555 
556  /* make sure that node index 0 is not used by
557  real node */
558  register_node (vm, &null_node_reg);
559 
561  while (r)
562  {
563  register_node (vm, r);
564  r = r->next_registration;
565  }
566 }
567 
568 void
569 vlib_node_get_nodes (vlib_main_t * vm, u32 max_threads, int include_stats,
570  int barrier_sync, vlib_node_t **** node_dupsp,
571  vlib_main_t *** stat_vmsp)
572 {
573  vlib_node_main_t *nm = &vm->node_main;
574  vlib_node_t *n;
575  vlib_node_t ***node_dups = *node_dupsp;
576  vlib_node_t **nodes;
577  vlib_main_t **stat_vms = *stat_vmsp;
578  vlib_main_t *stat_vm;
579  uword i, j;
580  u32 threads_to_serialize;
581 
582  if (vec_len (stat_vms) == 0)
583  {
584  for (i = 0; i < vec_len (vlib_mains); i++)
585  {
586  stat_vm = vlib_mains[i];
587  if (stat_vm)
588  vec_add1 (stat_vms, stat_vm);
589  }
590  }
591 
592  threads_to_serialize = clib_min (max_threads, vec_len (stat_vms));
593 
594  vec_validate (node_dups, threads_to_serialize - 1);
595 
596  /*
597  * Barrier sync across stats scraping.
598  * Otherwise, the counts will be grossly inaccurate.
599  */
600  if (barrier_sync)
602 
603  for (j = 0; j < threads_to_serialize; j++)
604  {
605  stat_vm = stat_vms[j];
606  nm = &stat_vm->node_main;
607 
608  if (include_stats)
609  {
610  for (i = 0; i < vec_len (nm->nodes); i++)
611  {
612  n = nm->nodes[i];
613  vlib_node_sync_stats (stat_vm, n);
614  }
615  }
616 
617  nodes = node_dups[j];
618  vec_validate (nodes, vec_len (nm->nodes) - 1);
619  clib_memcpy (nodes, nm->nodes, vec_len (nm->nodes) * sizeof (nodes[0]));
620  node_dups[j] = nodes;
621  }
622 
623  if (barrier_sync)
625 
626  *node_dupsp = node_dups;
627  *stat_vmsp = stat_vms;
628 }
629 
630 clib_error_t *
632 {
633  vlib_node_main_t *nm = &vm->node_main;
634  clib_error_t *error = 0;
635  vlib_node_t *n;
636  uword ni;
637 
639 #ifdef VLIB_SUPPORTS_ARBITRARY_SCALAR_SIZES
640  nm->frame_size_hash = hash_create (0, sizeof (uword));
641 #endif
643 
644  /* Generate sibling relationships */
645  {
646  vlib_node_t *n, *sib;
647  uword si;
648 
649  for (ni = 0; ni < vec_len (nm->nodes); ni++)
650  {
651  n = vec_elt (nm->nodes, ni);
652 
653  if (!n->sibling_of)
654  continue;
655 
656  sib = vlib_get_node_by_name (vm, (u8 *) n->sibling_of);
657  if (!sib)
658  {
659  error = clib_error_create ("sibling `%s' not found for node `%v'",
660  n->sibling_of, n->name);
661  goto done;
662  }
663 
664  /* *INDENT-OFF* */
665  clib_bitmap_foreach (si, sib->sibling_bitmap, ({
666  vlib_node_t * m = vec_elt (nm->nodes, si);
667 
668  /* Connect all of sibling's siblings to us. */
669  m->sibling_bitmap = clib_bitmap_ori (m->sibling_bitmap, n->index);
670 
671  /* Connect us to all of sibling's siblings. */
672  n->sibling_bitmap = clib_bitmap_ori (n->sibling_bitmap, si);
673  }));
674  /* *INDENT-ON* */
675 
676  /* Connect sibling to us. */
677  sib->sibling_bitmap = clib_bitmap_ori (sib->sibling_bitmap, n->index);
678 
679  /* Connect us to sibling. */
680  n->sibling_bitmap = clib_bitmap_ori (n->sibling_bitmap, sib->index);
681  }
682  }
683 
684  /* Resolve next names into next indices. */
685  for (ni = 0; ni < vec_len (nm->nodes); ni++)
686  {
687  uword i;
688 
689  n = vec_elt (nm->nodes, ni);
690 
691  for (i = 0; i < vec_len (n->next_node_names); i++)
692  {
693  char *a = n->next_node_names[i];
694 
695  if (!a)
696  continue;
697 
698  if (~0 == vlib_node_add_named_next_with_slot (vm, n->index, a, i))
699  {
700  error = clib_error_create
701  ("node `%v' refers to unknown node `%s'", n->name, a);
702  goto done;
703  }
704  }
705 
707  }
708 
709  /* Set previous node pointers. */
710  for (ni = 0; ni < vec_len (nm->nodes); ni++)
711  {
712  vlib_node_t *n_next;
713  uword i;
714 
715  n = vec_elt (nm->nodes, ni);
716 
717  for (i = 0; i < vec_len (n->next_nodes); i++)
718  {
719  if (n->next_nodes[i] >= vec_len (nm->nodes))
720  continue;
721 
722  n_next = vec_elt (nm->nodes, n->next_nodes[i]);
723  n_next->prev_node_bitmap =
724  clib_bitmap_ori (n_next->prev_node_bitmap, n->index);
725  }
726  }
727 
728  {
729  vlib_next_frame_t *nf;
731  vlib_node_t *next;
732  uword i;
733 
735  {
736  if (r->n_next_nodes == 0)
737  continue;
738 
739  n = vlib_get_node (vm, r->node_index);
741 
742  for (i = 0; i < vec_len (n->next_nodes); i++)
743  {
744  next = vlib_get_node (vm, n->next_nodes[i]);
745 
746  /* Validate node runtime indices are correctly initialized. */
747  ASSERT (nf[i].node_runtime_index == next->runtime_index);
748 
749  nf[i].flags = 0;
752  }
753  }
754  }
755 
756 done:
757  return error;
758 }
759 
760 /*
761  * fd.io coding-style-patch-verification: ON
762  *
763  * Local Variables:
764  * eval: (c-set-style "gnu")
765  * End:
766  */
uword * sibling_bitmap
Definition: node.h:339
u32 * next_nodes
Definition: node.h:333
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:439
u32 error_heap_index
Definition: node.h:323
u32 next_frame_index
Start of next frames for this node.
Definition: node.h:492
#define hash_set(h, key, value)
Definition: hash.h:255
u32 flags
Definition: vhost_user.h:115
#define clib_min(x, y)
Definition: clib.h:295
vlib_process_t ** processes
Definition: node.h:739
static void * clib_mem_alloc_aligned_at_offset(uword size, uword align, uword align_offset, int os_out_of_memory_on_failure)
Definition: mem.h:81
#define hash_unset(h, key)
Definition: hash.h:261
vlib_node_runtime_t node_runtime
Definition: node.h:553
a
Definition: bitmap.h:538
#define VLIB_PENDING_FRAME_NO_NEXT_FRAME
Definition: node.h:460
static void vlib_buffer_free(vlib_main_t *vm, u32 *buffers, u32 n_buffers)
Free buffers Frees the entire buffer chain for each buffer.
Definition: buffer_funcs.h:865
u8 runtime_data[0]
Function dependent node-runtime data.
Definition: node.h:522
static void node_set_elog_name(vlib_main_t *vm, uword node_index)
Definition: node.c:59
uword vlib_node_add_named_next_with_slot(vlib_main_t *vm, uword node, char *name, uword slot)
Definition: node.c:262
#define clib_error(format, args...)
Definition: error.h:62
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
u32 index
Definition: node.h:279
#define vec_add2_aligned(V, P, N, A)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:572
#define STACK_ALIGN
Definition: node.c:307
u16 flags
Definition: node.h:288
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:522
int i
#define STRUCT_OFFSET_OF(t, f)
Definition: clib.h:65
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:424
u8 * va_format(u8 *s, const char *fmt, va_list *va)
Definition: format.c:387
char * format
Format string.
Definition: elog.h:92
void * runtime_data
Definition: node.h:285
vlib_error_t * errors
Vector of errors for this node.
Definition: node.h:469
vlib_main_t ** vlib_mains
Definition: buffer.c:321
unsigned char u8
Definition: types.h:56
static uword min_log2(uword x)
Definition: clib.h:144
u8 state
Definition: node.h:307
vlib_node_function_t * function
Definition: node.h:260
#define vlib_worker_thread_barrier_sync(X)
Definition: threads.h:204
#define clib_memcpy(d, s, n)
Definition: string.h:180
void vlib_register_errors(vlib_main_t *vm, u32 node_index, u32 n_errors, char *error_strings[])
Definition: error.c:131
#define VLIB_NODE_RUNTIME_DATA_SIZE
Definition: node.h:533
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:493
void vlib_worker_thread_node_runtime_update(void)
Definition: threads.c:1205
vlib_node_function_t * function
Node function to call.
Definition: node.h:467
void vlib_node_get_nodes(vlib_main_t *vm, u32 max_threads, int include_stats, int barrier_sync, vlib_node_t ****node_dupsp, vlib_main_t ***stat_vmsp)
Get list of nodes.
Definition: node.c:569
#define vec_new(T, N)
Create new vector of given type and length (unspecified alignment, no header).
Definition: vec.h:311
u16 log2_n_stack_bytes
Definition: node.h:576
vlib_node_t ** nodes
Definition: node.h:698
char ** next_node_names
Definition: node.h:330
char * sibling_of
Definition: node.h:336
uword vlib_node_add_next_with_slot(vlib_main_t *vm, uword node_index, uword next_node_index, uword slot)
Definition: node.c:205
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
struct _vlib_node_fn_registration vlib_node_fn_registration_t
vhost_vring_state_t state
Definition: vhost_user.h:120
#define vec_resize(V, N)
Resize a vector (no header, unspecified alignment) Add N elements to end of given vector V...
Definition: vec.h:242
unsigned int u32
Definition: types.h:88
#define clib_error_create(args...)
Definition: error.h:96
vlib_node_runtime_t * nodes_by_type[VLIB_N_NODE_TYPE]
Definition: node.h:708
clib_error_t * vlib_node_main_init(vlib_main_t *vm)
Definition: node.c:631
static void vlib_worker_thread_node_rename(u32 node_index)
Definition: node.c:76
vlib_worker_thread_t * vlib_worker_threads
Definition: threads.c:36
#define hash_get(h, key)
Definition: hash.h:249
#define clib_bitmap_foreach(i, ai, body)
Macro to iterate across set bits in a bitmap.
Definition: bitmap.h:361
u32 next_frame_index
Definition: node.h:457
#define vec_insert(V, N, M)
Insert N vector elements starting at element M, initialize new elements to zero (no header...
Definition: vec.h:685
u16 state
Input node state.
Definition: node.h:510
static void vlib_next_frame_init(vlib_next_frame_t *nf)
Definition: node.h:440
#define VLIB_FRAME_NO_FREE_AFTER_DISPATCH
Definition: node.h:413
unsigned short u16
Definition: types.h:57
uword clib_mem_get_page_size(void)
Definition: mem.c:51
vlib_node_registration_t * node_registrations
Definition: node.h:763
elog_event_type_t * node_return_elog_event_types
Definition: main.h:183
#define vec_dup(V)
Return copy of vector (no header, no alignment)
Definition: vec.h:375
void vlib_frame_free(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_frame_t *f)
Definition: main.c:218
u64 * n_vectors_by_next_node
Definition: node.h:342
u8 protocol_hint
Definition: node.h:313
u32 node_index
Node index.
Definition: node.h:495
#define VLIB_PROCESS_STACK_MAGIC
Definition: node.h:624
uword * frame_size_hash
Definition: node.h:754
u8 name[64]
Definition: memclnt.api:152
static void node_elog_init(vlib_main_t *vm, uword ni)
Definition: node.c:289
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1180
u8 * name
Definition: node.h:263
i32 priority
Definition: ipsec.api:91
u32 owner_node_index
Definition: node.h:353
void vlib_register_all_static_nodes(vlib_main_t *vm)
Definition: node.c:540
#define clib_mem_alloc_no_fail(size)
Definition: mem.h:176
u16 n_vectors
Definition: node.h:395
u32 runtime_index
Definition: node.h:282
static_always_inline uword vlib_get_thread_index(void)
Definition: threads.h:212
vlib_main_t * vm
Definition: buffer.c:312
vlib_pending_frame_t * pending_frames
Definition: node.h:724
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:341
#define VLIB_NODE_FLAG_FRAME_NO_FREE_AFTER_DISPATCH
Definition: node.h:292
static vlib_node_runtime_t * vlib_node_get_runtime(vlib_main_t *vm, u32 node_index)
Get node runtime by node index.
Definition: node_funcs.h:89
uword * node_by_name
Definition: node.h:701
elog_main_t elog_main
Definition: main.h:172
vlib_node_t * vlib_get_node_by_name(vlib_main_t *vm, u8 *name)
Definition: node.c:45
vlib_node_fn_registration_t * node_fn_registrations
Definition: node.h:370
static uword null_node_fn(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: node.c:527
volatile u32 * wait_at_barrier
Definition: threads.h:90
signed int i32
Definition: types.h:77
#define hash_create(elts, value_bytes)
Definition: hash.h:696
#define ASSERT(truth)
void vlib_node_rename(vlib_main_t *vm, u32 node_index, char *fmt,...)
Definition: node.c:102
u32 vlib_register_node(vlib_main_t *vm, vlib_node_registration_t *r)
Definition: node.c:520
uword * next_slot_by_node
Definition: node.h:347
static uword clib_mem_is_heap_object(void *p)
Definition: mem.h:182
uword * prev_node_bitmap
Definition: node.h:350
#define clib_max(x, y)
Definition: clib.h:288
uword vlib_node_get_next(vlib_main_t *vm, uword node_index, uword next_node_index)
Definition: node.c:184
void vlib_node_sync_stats(vlib_main_t *vm, vlib_node_t *n)
Definition: main.c:593
#define vec_elt(v, i)
Get vector value at index i.
struct _vlib_node_registration vlib_node_registration_t
#define hash_create_vec(elts, key_bytes, value_bytes)
Definition: hash.h:668
u32 elog_string(elog_main_t *em, char *fmt,...)
add a string to the event-log string table
Definition: elog.c:562
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
u32 input_node_counts_by_state[VLIB_N_NODE_STATE]
Definition: node.h:751
vlib_pending_frame_t * suspended_process_frames
Definition: node.h:745
vlib_node_main_t node_main
Definition: main.h:135
u64 uword
Definition: types.h:112
u32 owner_next_index
Definition: node.h:353
vlib_next_frame_t * next_frames
Definition: node.h:721
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:274
typedef key
Definition: ipsec.api:244
#define clib_unix_warning(format, args...)
Definition: error.h:68
static void register_node(vlib_main_t *vm, vlib_node_registration_t *r)
Definition: node.c:313
vlib_frame_size_t * frame_sizes
Definition: node.h:757
elog_event_type_t * node_call_elog_event_types
Definition: main.h:182
vlib_node_type_t type
Definition: node.h:276
u32 name_elog_string
Definition: node.h:266
void vlib_worker_thread_barrier_release(vlib_main_t *vm)
Definition: threads.c:1489
#define VLIB_NODE_MAIN_RUNTIME_STARTED
Definition: node.h:704
static void vlib_node_runtime_update(vlib_main_t *vm, u32 node_index, u32 next_index)
Definition: node.c:122
static void * vec_header(void *v, uword header_bytes)
Find a user vector header.
Definition: vec_bootstrap.h:93
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.
u16 flags
Copy of main node flags.
Definition: node.h:508
u32 node_runtime_index
Definition: node.h:407
#define vec_validate_init_empty(V, I, INIT)
Make sure vector is long enough for given index and initialize empty space (no header, unspecified alignment)
Definition: vec.h:486
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:59
#define STATIC_ASSERT_SIZEOF(d, s)
#define clib_panic(format, args...)
Definition: error.h:72