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