FD.io VPP  v20.01-48-g3e0dafb74
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  node = vec_elt (nm->nodes, node_index);
132  r = vlib_node_get_runtime (vm, node_index);
133 
134  n_insert = vec_len (node->next_nodes) - r->n_next_nodes;
135  if (n_insert > 0)
136  {
137  i = r->next_frame_index + r->n_next_nodes;
138  vec_insert (nm->next_frames, n_insert, i);
139 
140  /* Initialize newly inserted next frames. */
141  for (j = 0; j < n_insert; j++)
142  vlib_next_frame_init (nm->next_frames + i + j);
143 
144  /* Relocate other next frames at higher indices. */
145  for (j = 0; j < vec_len (nm->nodes); j++)
146  {
147  s = vlib_node_get_runtime (vm, j);
148  if (j != node_index && s->next_frame_index >= i)
149  s->next_frame_index += n_insert;
150  }
151 
152  /* Pending frames may need to be relocated also. */
153  vec_foreach (pf, nm->pending_frames)
154  {
156  && pf->next_frame_index >= i)
157  pf->next_frame_index += n_insert;
158  }
159  /* *INDENT-OFF* */
161  if (pf->next_frame_index != ~0 && pf->next_frame_index >= i)
162  pf->next_frame_index += n_insert;
163  }));
164  /* *INDENT-ON* */
165 
166  r->n_next_nodes = vec_len (node->next_nodes);
167  }
168 
169  /* Set frame's node runtime index. */
170  next_node = vlib_get_node (vm, node->next_nodes[next_index]);
171  nf = nm->next_frames + r->next_frame_index + next_index;
172  nf->node_runtime_index = next_node->runtime_index;
173 
175 }
176 
177 uword
178 vlib_node_get_next (vlib_main_t * vm, uword node_index, uword next_node_index)
179 {
180  vlib_node_main_t *nm = &vm->node_main;
181  vlib_node_t *node;
182  uword *p;
183 
184  node = vec_elt (nm->nodes, 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  return p[0];
192  }
193 
194  return (~0);
195 }
196 
197 /* Add next node to given node in given slot. */
198 uword
200  uword node_index,
201  uword next_node_index, uword slot)
202 {
203  vlib_node_main_t *nm = &vm->node_main;
204  vlib_node_t *node, *next, *old_next;
205  u32 old_next_index;
206  uword *p;
207 
208  ASSERT (vlib_get_thread_index () == 0);
209 
210  node = vec_elt (nm->nodes, node_index);
211  next = vec_elt (nm->nodes, next_node_index);
212 
213  /* Runtime has to be initialized. */
215 
216  if ((p = hash_get (node->next_slot_by_node, next_node_index)))
217  {
218  /* Next already exists: slot must match. */
219  if (slot != ~0)
220  ASSERT (slot == p[0]);
221  return p[0];
222  }
223 
225 
226  if (slot == ~0)
227  slot = vec_len (node->next_nodes);
228 
229  vec_validate_init_empty (node->next_nodes, slot, ~0);
230  vec_validate (node->n_vectors_by_next_node, slot);
231 
232  if ((old_next_index = node->next_nodes[slot]) != ~0u)
233  {
234  hash_unset (node->next_slot_by_node, old_next_index);
235  old_next = vlib_get_node (vm, old_next_index);
236  old_next->prev_node_bitmap =
237  clib_bitmap_andnoti (old_next->prev_node_bitmap, node_index);
238  }
239 
240  node->next_nodes[slot] = next_node_index;
241  hash_set (node->next_slot_by_node, next_node_index, slot);
242 
243  vlib_node_runtime_update (vm, node_index, slot);
244 
245  next->prev_node_bitmap = clib_bitmap_ori (next->prev_node_bitmap,
246  node_index);
247 
248  /* Siblings all get same node structure. */
249  {
250  uword sib_node_index, sib_slot;
251  vlib_node_t *sib_node;
252  /* *INDENT-OFF* */
253  clib_bitmap_foreach (sib_node_index, node->sibling_bitmap, ({
254  sib_node = vec_elt (nm->nodes, sib_node_index);
255  if (sib_node != node)
256  {
257  sib_slot = vlib_node_add_next_with_slot (vm, sib_node_index, next_node_index, slot);
258  ASSERT (sib_slot == slot);
259  }
260  }));
261  /* *INDENT-ON* */
262  }
263 
265  return slot;
266 }
267 
268 /* Add named next node to given node in given slot. */
269 uword
271  uword node, char *name, uword slot)
272 {
273  vlib_node_main_t *nm;
274  vlib_node_t *n, *n_next;
275 
276  nm = &vm->node_main;
277  n = vlib_get_node (vm, node);
278 
279  n_next = vlib_get_node_by_name (vm, (u8 *) name);
280  if (!n_next)
281  {
283  return ~0;
284 
285  if (slot == ~0)
286  slot = clib_max (vec_len (n->next_node_names),
287  vec_len (n->next_nodes));
288  vec_validate (n->next_node_names, slot);
289  n->next_node_names[slot] = name;
290  return slot;
291  }
292 
293  return vlib_node_add_next_with_slot (vm, node, n_next->index, slot);
294 }
295 
296 static void
298 {
300 
301  clib_memset (&t, 0, sizeof (t));
302 
303  /* 2 event types for this node: one when node function is called.
304  One when it returns. */
306  vm->node_call_elog_event_types[ni] = t;
307 
309  vm->node_return_elog_event_types[ni] = t;
310 
311  node_set_elog_name (vm, ni);
312 }
313 
314 #ifdef CLIB_UNIX
315 #define STACK_ALIGN (clib_mem_get_page_size())
316 #else
317 #define STACK_ALIGN CLIB_CACHE_LINE_BYTES
318 #endif
319 
320 static void
322 {
323  vlib_node_main_t *nm = &vm->node_main;
324  vlib_node_t *n;
325  u32 page_size = clib_mem_get_page_size ();
326  int i;
327 
328  if (CLIB_DEBUG > 0)
329  {
330  /* Default (0) type should match INTERNAL. */
331  vlib_node_t zero = { 0 };
333  }
334 
335  if (r->node_fn_registrations)
336  {
337  vlib_node_fn_registration_t *fnr = r->node_fn_registrations;
338  int priority = -1;
339 
340  /* to avoid confusion, please remove ".function " statiement from
341  CLIB_NODE_REGISTRATION() if using function function candidates */
342  ASSERT (r->function == 0);
343 
344  while (fnr)
345  {
346  if (fnr->priority > priority)
347  {
348  priority = fnr->priority;
349  r->function = fnr->function;
350  }
351  fnr = fnr->next_registration;
352  }
353  }
354 
355  ASSERT (r->function != 0);
356 
357  n = clib_mem_alloc_no_fail (sizeof (n[0]));
358  clib_memset (n, 0, sizeof (n[0]));
359  n->index = vec_len (nm->nodes);
360  n->node_fn_registrations = r->node_fn_registrations;
361  n->protocol_hint = r->protocol_hint;
362 
363  vec_add1 (nm->nodes, n);
364 
365  /* Name is always a vector so it can be formatted with %v. */
366  if (clib_mem_is_heap_object (vec_header (r->name, 0)))
367  n->name = vec_dup ((u8 *) r->name);
368  else
369  n->name = format (0, "%s", r->name);
370 
371  if (!nm->node_by_name)
372  nm->node_by_name = hash_create_vec ( /* size */ 32,
373  sizeof (n->name[0]), sizeof (uword));
374 
375  /* Node names must be unique. */
376  {
377  vlib_node_t *o = vlib_get_node_by_name (vm, n->name);
378  if (o)
379  clib_error ("more than one node named `%v'", n->name);
380  }
381 
382  hash_set (nm->node_by_name, n->name, n->index);
383 
384  r->index = n->index; /* save index in registration */
385  n->function = r->function;
386 
387  /* Node index of next sibling will be filled in by vlib_node_main_init. */
388  n->sibling_of = r->sibling_of;
389  if (r->sibling_of && r->n_next_nodes > 0)
390  clib_error ("sibling node should not have any next nodes `%v'", n->name);
391 
392  if (r->type == VLIB_NODE_TYPE_INTERNAL)
393  ASSERT (r->vector_size > 0);
394 
395 #define _(f) n->f = r->f
396 
397  _(type);
398  _(flags);
399  _(state);
400  _(scalar_size);
401  _(vector_size);
402  _(format_buffer);
403  _(unformat_buffer);
404  _(format_trace);
405  _(validate_frame);
406 
407  /* Register error counters. */
408  vlib_register_errors (vm, n->index, r->n_errors, r->error_strings);
409  node_elog_init (vm, n->index);
410 
411  _(runtime_data_bytes);
412  if (r->runtime_data_bytes > 0)
413  {
414  vec_resize (n->runtime_data, r->runtime_data_bytes);
415  if (r->runtime_data)
416  clib_memcpy (n->runtime_data, r->runtime_data, r->runtime_data_bytes);
417  }
418 
419  vec_resize (n->next_node_names, r->n_next_nodes);
420  for (i = 0; i < r->n_next_nodes; i++)
421  n->next_node_names[i] = r->next_nodes[i];
422 
423  vec_validate_init_empty (n->next_nodes, r->n_next_nodes - 1, ~0);
424  vec_validate (n->n_vectors_by_next_node, r->n_next_nodes - 1);
425 
426  n->owner_node_index = n->owner_next_index = ~0;
427 
428  /* Initialize node runtime. */
429  {
431  u32 i;
432 
433  if (n->type == VLIB_NODE_TYPE_PROCESS)
434  {
435  vlib_process_t *p;
436  uword log2_n_stack_bytes;
437 
438  log2_n_stack_bytes = clib_max (r->process_log2_n_stack_bytes, 15);
439 
440 #ifdef CLIB_UNIX
441  /*
442  * Bump the stack size if running over a kernel with a large page size,
443  * and the stack isn't any too big to begin with. Otherwise, we'll
444  * trip over the stack guard page for sure.
445  */
446  if ((page_size > (4 << 10)) && log2_n_stack_bytes < 19)
447  {
448  if ((1 << log2_n_stack_bytes) <= page_size)
449  log2_n_stack_bytes = min_log2 (page_size) + 1;
450  else
451  log2_n_stack_bytes++;
452  }
453 #endif
454 
456  (sizeof (p[0]) + (1 << log2_n_stack_bytes),
458  0 /* no, don't call os_out_of_memory */ );
459  if (p == 0)
460  clib_panic ("failed to allocate process stack (%d bytes)",
461  1 << log2_n_stack_bytes);
462 
463  clib_memset (p, 0, sizeof (p[0]));
464  p->log2_n_stack_bytes = log2_n_stack_bytes;
465 
466  /* Process node's runtime index is really index into process
467  pointer vector. */
468  n->runtime_index = vec_len (nm->processes);
469 
470  vec_add1 (nm->processes, p);
471 
472  /* Paint first stack word with magic number so we can at least
473  detect process stack overruns. */
474  p->stack[0] = VLIB_PROCESS_STACK_MAGIC;
475 
476  /* Node runtime is stored inside of process. */
477  rt = &p->node_runtime;
478 
479 #ifdef CLIB_UNIX
480  /*
481  * Disallow writes to the bottom page of the stack, to
482  * catch stack overflows.
483  */
484  if (mprotect (p->stack, page_size, PROT_READ) < 0)
485  clib_unix_warning ("process stack");
486 #endif
487 
488  }
489  else
490  {
491  vec_add2_aligned (nm->nodes_by_type[n->type], rt, 1,
492  /* align */ CLIB_CACHE_LINE_BYTES);
493  n->runtime_index = rt - nm->nodes_by_type[n->type];
494  }
495 
496  if (n->type == VLIB_NODE_TYPE_INPUT)
497  nm->input_node_counts_by_state[n->state] += 1;
498 
499  rt->function = n->function;
500  rt->flags = n->flags;
501  rt->state = n->state;
502  rt->node_index = n->index;
503 
504  rt->n_next_nodes = r->n_next_nodes;
506 
508  for (i = 0; i < rt->n_next_nodes; i++)
510 
511  vec_resize (rt->errors, r->n_errors);
512  for (i = 0; i < vec_len (rt->errors); i++)
513  rt->errors[i] = n->error_heap_index + i;
514 
517 
518  if (vec_len (n->runtime_data) > 0)
520  vec_len (n->runtime_data));
521 
522  vec_free (n->runtime_data);
523  }
524 }
525 
526 /* Register new packet processing node. */
527 u32
529 {
530  register_node (vm, r);
531  return r->index;
532 }
533 
534 static uword
537 {
538  u16 n_vectors = frame->n_vectors;
539 
540  vlib_node_increment_counter (vm, node->node_index, 0, n_vectors);
541  vlib_buffer_free (vm, vlib_frame_vector_args (frame), n_vectors);
542  vlib_frame_free (vm, node, frame);
543 
544  return n_vectors;
545 }
546 
547 void
549 {
551 
552  static char *null_node_error_strings[] = {
553  "blackholed packets",
554  };
555 
556  static vlib_node_registration_t null_node_reg = {
557  .function = null_node_fn,
558  .vector_size = sizeof (u32),
559  .name = "null-node",
560  .n_errors = 1,
561  .error_strings = null_node_error_strings,
562  };
563 
564  /* make sure that node index 0 is not used by
565  real node */
566  register_node (vm, &null_node_reg);
567 
569  while (r)
570  {
571  register_node (vm, r);
572  r = r->next_registration;
573  }
574 }
575 
576 void
577 vlib_node_get_nodes (vlib_main_t * vm, u32 max_threads, int include_stats,
578  int barrier_sync, vlib_node_t **** node_dupsp,
579  vlib_main_t *** stat_vmsp)
580 {
581  vlib_node_main_t *nm = &vm->node_main;
582  vlib_node_t *n;
583  vlib_node_t ***node_dups = *node_dupsp;
584  vlib_node_t **nodes;
585  vlib_main_t **stat_vms = *stat_vmsp;
586  vlib_main_t *stat_vm;
587  uword i, j;
588  u32 threads_to_serialize;
589 
590  if (vec_len (stat_vms) == 0)
591  {
592  for (i = 0; i < vec_len (vlib_mains); i++)
593  {
594  stat_vm = vlib_mains[i];
595  if (stat_vm)
596  vec_add1 (stat_vms, stat_vm);
597  }
598  }
599 
600  threads_to_serialize = clib_min (max_threads, vec_len (stat_vms));
601 
602  vec_validate (node_dups, threads_to_serialize - 1);
603 
604  /*
605  * Barrier sync across stats scraping.
606  * Otherwise, the counts will be grossly inaccurate.
607  */
608  if (barrier_sync)
610 
611  for (j = 0; j < threads_to_serialize; j++)
612  {
613  stat_vm = stat_vms[j];
614  nm = &stat_vm->node_main;
615 
616  if (include_stats)
617  {
618  for (i = 0; i < vec_len (nm->nodes); i++)
619  {
620  n = nm->nodes[i];
621  vlib_node_sync_stats (stat_vm, n);
622  }
623  }
624 
625  nodes = node_dups[j];
626  vec_validate (nodes, vec_len (nm->nodes) - 1);
627  clib_memcpy (nodes, nm->nodes, vec_len (nm->nodes) * sizeof (nodes[0]));
628  node_dups[j] = nodes;
629  }
630 
631  if (barrier_sync)
633 
634  *node_dupsp = node_dups;
635  *stat_vmsp = stat_vms;
636 }
637 
638 clib_error_t *
640 {
641  vlib_node_main_t *nm = &vm->node_main;
642  clib_error_t *error = 0;
643  vlib_node_t *n;
644  uword ni;
645 
647 #ifdef VLIB_SUPPORTS_ARBITRARY_SCALAR_SIZES
648  nm->frame_size_hash = hash_create (0, sizeof (uword));
649 #endif
651 
652  /* Generate sibling relationships */
653  {
654  vlib_node_t *n, *sib;
655  uword si;
656 
657  for (ni = 0; ni < vec_len (nm->nodes); ni++)
658  {
659  n = vec_elt (nm->nodes, ni);
660 
661  if (!n->sibling_of)
662  continue;
663 
664  sib = vlib_get_node_by_name (vm, (u8 *) n->sibling_of);
665  if (!sib)
666  {
667  error = clib_error_create ("sibling `%s' not found for node `%v'",
668  n->sibling_of, n->name);
669  goto done;
670  }
671 
672  /* *INDENT-OFF* */
673  clib_bitmap_foreach (si, sib->sibling_bitmap, ({
674  vlib_node_t * m = vec_elt (nm->nodes, si);
675 
676  /* Connect all of sibling's siblings to us. */
677  m->sibling_bitmap = clib_bitmap_ori (m->sibling_bitmap, n->index);
678 
679  /* Connect us to all of sibling's siblings. */
680  n->sibling_bitmap = clib_bitmap_ori (n->sibling_bitmap, si);
681  }));
682  /* *INDENT-ON* */
683 
684  /* Connect sibling to us. */
685  sib->sibling_bitmap = clib_bitmap_ori (sib->sibling_bitmap, n->index);
686 
687  /* Connect us to sibling. */
688  n->sibling_bitmap = clib_bitmap_ori (n->sibling_bitmap, sib->index);
689  }
690  }
691 
692  /* Resolve next names into next indices. */
693  for (ni = 0; ni < vec_len (nm->nodes); ni++)
694  {
695  uword i;
696 
697  n = vec_elt (nm->nodes, ni);
698 
699  for (i = 0; i < vec_len (n->next_node_names); i++)
700  {
701  char *a = n->next_node_names[i];
702 
703  if (!a)
704  continue;
705 
706  if (~0 == vlib_node_add_named_next_with_slot (vm, n->index, a, i))
707  {
708  error = clib_error_create
709  ("node `%v' refers to unknown node `%s'", n->name, a);
710  goto done;
711  }
712  }
713 
715  }
716 
717  /* Set previous node pointers. */
718  for (ni = 0; ni < vec_len (nm->nodes); ni++)
719  {
720  vlib_node_t *n_next;
721  uword i;
722 
723  n = vec_elt (nm->nodes, ni);
724 
725  for (i = 0; i < vec_len (n->next_nodes); i++)
726  {
727  if (n->next_nodes[i] >= vec_len (nm->nodes))
728  continue;
729 
730  n_next = vec_elt (nm->nodes, n->next_nodes[i]);
731  n_next->prev_node_bitmap =
732  clib_bitmap_ori (n_next->prev_node_bitmap, n->index);
733  }
734  }
735 
736  {
737  vlib_next_frame_t *nf;
739  vlib_node_t *next;
740  uword i;
741 
743  {
744  if (r->n_next_nodes == 0)
745  continue;
746 
747  n = vlib_get_node (vm, r->node_index);
749 
750  for (i = 0; i < vec_len (n->next_nodes); i++)
751  {
752  next = vlib_get_node (vm, n->next_nodes[i]);
753 
754  /* Validate node runtime indices are correctly initialized. */
755  ASSERT (nf[i].node_runtime_index == next->runtime_index);
756 
757  nf[i].flags = 0;
760  }
761  }
762  }
763 
764 done:
765  return error;
766 }
767 
768 u32
770  vlib_node_function_t * f, u32 log2_n_stack_bytes)
771 {
773  vlib_node_t *n;
774 
775  memset (&r, 0, sizeof (r));
776 
777  r.name = (char *) format (0, "%s", name, 0);
778  r.function = f;
779  r.process_log2_n_stack_bytes = log2_n_stack_bytes;
780  r.type = VLIB_NODE_TYPE_PROCESS;
781 
783 
784  vlib_register_node (vm, &r);
785  vec_free (r.name);
786 
789 
790  n = vlib_get_node (vm, r.index);
792 
793  return (r.index);
794 }
795 
796 /*
797  * fd.io coding-style-patch-verification: ON
798  *
799  * Local Variables:
800  * eval: (c-set-style "gnu")
801  * End:
802  */
uword * sibling_bitmap
Definition: node.h:341
u32 * next_nodes
Definition: node.h:335
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:440
u32 error_heap_index
Definition: node.h:325
u32 next_frame_index
Start of next frames for this node.
Definition: node.h:493
#define hash_set(h, key, value)
Definition: hash.h:255
#define clib_min(x, y)
Definition: clib.h:295
vlib_process_t ** processes
Definition: node.h:740
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:113
#define hash_unset(h, key)
Definition: hash.h:261
vlib_node_runtime_t node_runtime
Definition: node.h:554
a
Definition: bitmap.h:538
#define VLIB_PENDING_FRAME_NO_NEXT_FRAME
Definition: node.h:461
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:890
u8 runtime_data[0]
Function dependent node-runtime data.
Definition: node.h:523
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:270
#define clib_error(format, args...)
Definition: error.h:62
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
u32 index
Definition: node.h:280
#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:573
#define STACK_ALIGN
Definition: node.c:315
u16 flags
Definition: node.h:289
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:523
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:286
vlib_error_t * errors
Vector of errors for this node.
Definition: node.h:470
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:144
u8 state
Definition: node.h:309
vlib_node_function_t * function
Definition: node.h:261
#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:117
#define VLIB_NODE_RUNTIME_DATA_SIZE
Definition: node.h:534
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:498
void vlib_worker_thread_node_runtime_update(void)
Definition: threads.c:1187
vlib_node_function_t * function
Node function to call.
Definition: node.h:468
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:577
#define vec_new(T, N)
Create new vector of given type and length (unspecified alignment, no header).
Definition: vec.h:312
u16 log2_n_stack_bytes
Definition: node.h:577
vlib_node_t ** nodes
Definition: node.h:699
char ** next_node_names
Definition: node.h:332
char * sibling_of
Definition: node.h:338
uword vlib_node_add_next_with_slot(vlib_main_t *vm, uword node_index, uword next_node_index, uword slot)
Definition: node.c:199
#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
#define vec_resize(V, N)
Resize a vector (no header, unspecified alignment) Add N elements to end of given vector V...
Definition: vec.h:243
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:709
clib_error_t * vlib_node_main_init(vlib_main_t *vm)
Definition: node.c:639
static void vlib_worker_thread_node_rename(u32 node_index)
Definition: node.c:76
i32 priority
Definition: ipsec.api:92
vl_api_fib_path_type_t type
Definition: fib_types.api:123
vlib_worker_thread_t * vlib_worker_threads
Definition: threads.c:37
#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 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:769
u32 next_frame_index
Definition: node.h:458
#define vec_insert(V, N, M)
Insert N vector elements starting at element M, initialize new elements to zero (no header...
Definition: vec.h:686
u16 state
Input node state.
Definition: node.h:511
static void vlib_next_frame_init(vlib_next_frame_t *nf)
Definition: node.h:442
#define VLIB_FRAME_NO_FREE_AFTER_DISPATCH
Definition: node.h:415
static const __m128i zero
Definition: aes_gcm.c:39
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:764
elog_event_type_t * node_return_elog_event_types
Definition: main.h:204
#define vec_dup(V)
Return copy of vector (no header, no alignment)
Definition: vec.h:376
void vlib_frame_free(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_frame_t *f)
Definition: main.c:214
u64 * n_vectors_by_next_node
Definition: node.h:344
u8 protocol_hint
Definition: node.h:315
u32 node_index
Node index.
Definition: node.h:496
#define VLIB_PROCESS_STACK_MAGIC
Definition: node.h:625
uword * frame_size_hash
Definition: node.h:755
vlib_main_t * vm
Definition: in2out_ed.c:1810
static void node_elog_init(vlib_main_t *vm, uword ni)
Definition: node.c:297
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1150
u8 * name
Definition: node.h:264
u8 slot
Definition: pci_types.api:22
u32 owner_node_index
Definition: node.h:355
void vlib_register_all_static_nodes(vlib_main_t *vm)
Definition: node.c:548
#define clib_mem_alloc_no_fail(size)
Definition: mem.h:197
u32 flags
Definition: vhost_user.h:141
u16 n_vectors
Definition: node.h:397
u32 runtime_index
Definition: node.h:283
static_always_inline uword vlib_get_thread_index(void)
Definition: threads.h:218
vlib_pending_frame_t * pending_frames
Definition: node.h:725
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:342
#define VLIB_NODE_FLAG_FRAME_NO_FREE_AFTER_DISPATCH
Definition: node.h:293
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:702
elog_main_t elog_main
Definition: main.h:193
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:372
string name[64]
Definition: ip.api:44
vlib_main_t vlib_node_runtime_t * node
Definition: in2out_ed.c:1810
static uword null_node_fn(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: node.c:535
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:528
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 * next_slot_by_node
Definition: node.h:349
static uword clib_mem_is_heap_object(void *p)
Definition: mem.h:203
uword * prev_node_bitmap
Definition: node.h:352
#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:178
void vlib_node_sync_stats(vlib_main_t *vm, vlib_node_t *n)
Definition: main.c:584
#define vec_elt(v, i)
Get vector value at index i.
typedef key
Definition: ipsec_types.api:83
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:752
vlib_pending_frame_t * suspended_process_frames
Definition: node.h:746
vlib_node_main_t node_main
Definition: main.h:158
u64 uword
Definition: types.h:112
u32 owner_next_index
Definition: node.h:355
vlib_next_frame_t * next_frames
Definition: node.h:722
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h: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:321
vlib_frame_size_t * frame_sizes
Definition: node.h:758
elog_event_type_t * node_call_elog_event_types
Definition: main.h:203
vlib_node_type_t type
Definition: node.h:277
u32 name_elog_string
Definition: node.h:267
void vlib_worker_thread_barrier_release(vlib_main_t *vm)
Definition: threads.c:1496
#define VLIB_NODE_MAIN_RUNTIME_STARTED
Definition: node.h:705
static void vlib_node_runtime_update(vlib_main_t *vm, u32 node_index, u32 next_index)
Definition: node.c:122
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: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.
vlib_main_t vlib_node_runtime_t vlib_frame_t * frame
Definition: in2out_ed.c:1811
u16 flags
Copy of main node flags.
Definition: node.h:509
u32 node_runtime_index
Definition: node.h:409
#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:487
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:59
void vlib_start_process(vlib_main_t *vm, uword process_index)
Definition: main.c:1590
#define STATIC_ASSERT_SIZEOF(d, s)
#define clib_panic(format, args...)
Definition: error.h:72