FD.io VPP  v16.09
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 (key))
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 void
76 vlib_node_rename (vlib_main_t * vm, u32 node_index, char *fmt, ...)
77 {
78  va_list va;
79  vlib_node_main_t *nm = &vm->node_main;
80  vlib_node_t *n = vlib_get_node (vm, node_index);
81 
82  va_start (va, fmt);
83  hash_unset (nm->node_by_name, n->name);
84  vec_free (n->name);
85  n->name = va_format (0, fmt, &va);
86  va_end (va);
87  hash_set (nm->node_by_name, n->name, n->index);
88 
89  node_set_elog_name (vm, node_index);
90 }
91 
92 static void
93 vlib_node_runtime_update (vlib_main_t * vm, u32 node_index, u32 next_index)
94 {
95  vlib_node_main_t *nm = &vm->node_main;
96  vlib_node_runtime_t *r, *s;
97  vlib_node_t *node, *next_node;
100  i32 i, j, n_insert;
101 
102  ASSERT (os_get_cpu_number () == 0);
103 
105 
106  node = vec_elt (nm->nodes, node_index);
107  r = vlib_node_get_runtime (vm, node_index);
108 
109  n_insert = vec_len (node->next_nodes) - r->n_next_nodes;
110  if (n_insert > 0)
111  {
112  i = r->next_frame_index + r->n_next_nodes;
113  vec_insert (nm->next_frames, n_insert, i);
114 
115  /* Initialize newly inserted next frames. */
116  for (j = 0; j < n_insert; j++)
117  vlib_next_frame_init (nm->next_frames + i + j);
118 
119  /* Relocate other next frames at higher indices. */
120  for (j = 0; j < vec_len (nm->nodes); j++)
121  {
122  s = vlib_node_get_runtime (vm, j);
123  if (j != node_index && s->next_frame_index >= i)
124  s->next_frame_index += n_insert;
125  }
126 
127  /* Pending frames may need to be relocated also. */
128  vec_foreach (pf, nm->pending_frames)
129  {
131  && pf->next_frame_index >= i)
132  pf->next_frame_index += n_insert;
133  }
134  /* *INDENT-OFF* */
136  if (pf->next_frame_index != ~0 && pf->next_frame_index >= i)
137  pf->next_frame_index += n_insert;
138  }));
139  /* *INDENT-ON* */
140 
141  r->n_next_nodes = vec_len (node->next_nodes);
142  }
143 
144  /* Set frame's node runtime index. */
145  next_node = vlib_get_node (vm, node->next_nodes[next_index]);
146  nf = nm->next_frames + r->next_frame_index + next_index;
147  nf->node_runtime_index = next_node->runtime_index;
148 
150 
152 }
153 
154 /* Add next node to given node in given slot. */
155 uword
157  uword node_index,
158  uword next_node_index, uword slot)
159 {
160  vlib_node_main_t *nm = &vm->node_main;
161  vlib_node_t *node, *next;
162  uword *p;
163 
164  node = vec_elt (nm->nodes, node_index);
165  next = vec_elt (nm->nodes, next_node_index);
166 
167  /* Runtime has to be initialized. */
169 
170  if ((p = hash_get (node->next_slot_by_node, next_node_index)))
171  {
172  /* Next already exists: slot must match. */
173  if (slot != ~0)
174  ASSERT (slot == p[0]);
175  return p[0];
176  }
177 
178  if (slot == ~0)
179  slot = vec_len (node->next_nodes);
180 
181  vec_validate_init_empty (node->next_nodes, slot, ~0);
182  vec_validate (node->n_vectors_by_next_node, slot);
183 
184  node->next_nodes[slot] = next_node_index;
185  hash_set (node->next_slot_by_node, next_node_index, slot);
186 
187  vlib_node_runtime_update (vm, node_index, slot);
188 
189  next->prev_node_bitmap = clib_bitmap_ori (next->prev_node_bitmap,
190  node_index);
191 
192  /* Siblings all get same node structure. */
193  {
194  uword sib_node_index, sib_slot;
195  vlib_node_t *sib_node;
196  /* *INDENT-OFF* */
197  clib_bitmap_foreach (sib_node_index, node->sibling_bitmap, ({
198  sib_node = vec_elt (nm->nodes, sib_node_index);
199  if (sib_node != node)
200  {
201  sib_slot = vlib_node_add_next_with_slot (vm, sib_node_index, next_node_index, slot);
202  ASSERT (sib_slot == slot);
203  }
204  }));
205  /* *INDENT-ON* */
206  }
207 
208  return slot;
209 }
210 
211 /* Add named next node to given node in given slot. */
212 uword
214  uword node, char *name, uword slot)
215 {
216  vlib_node_main_t *nm;
217  vlib_node_t *n, *n_next;
218 
219  nm = &vm->node_main;
220  n = vlib_get_node (vm, node);
221 
222  n_next = vlib_get_node_by_name (vm, (u8 *) name);
223  if (!n_next)
224  {
226  return ~0;
227 
228  if (slot == ~0)
229  slot = clib_max (vec_len (n->next_node_names),
230  vec_len (n->next_nodes));
231  vec_validate (n->next_node_names, slot);
232  n->next_node_names[slot] = name;
233  return slot;
234  }
235 
236  return vlib_node_add_next_with_slot (vm, node, n_next->index, slot);
237 }
238 
239 static void
241 {
243 
244  memset (&t, 0, sizeof (t));
245 
246  /* 2 event types for this node: one when node function is called.
247  One when it returns. */
249  vm->node_call_elog_event_types[ni] = t;
250 
252  vm->node_return_elog_event_types[ni] = t;
253 
254  node_set_elog_name (vm, ni);
255 }
256 
257 #ifdef CLIB_UNIX
258 #define STACK_ALIGN (clib_mem_get_page_size())
259 #else
260 #define STACK_ALIGN CLIB_CACHE_LINE_BYTES
261 #endif
262 
263 static void
265 {
266  vlib_node_main_t *nm = &vm->node_main;
267  vlib_node_t *n;
268  u32 page_size = clib_mem_get_page_size ();
269  int i;
270 
271  if (CLIB_DEBUG > 0)
272  {
273  /* Default (0) type should match INTERNAL. */
274  vlib_node_t zero = { 0 };
276  }
277 
278  ASSERT (r->function != 0);
279 
280  n = clib_mem_alloc_no_fail (sizeof (n[0]));
281  memset (n, 0, sizeof (n[0]));
282  n->index = vec_len (nm->nodes);
283 
284  vec_add1 (nm->nodes, n);
285 
286  /* Name is always a vector so it can be formatted with %v. */
287  if (clib_mem_is_heap_object (vec_header (r->name, 0)))
288  n->name = vec_dup ((u8 *) r->name);
289  else
290  n->name = format (0, "%s", r->name);
291 
292  if (!nm->node_by_name)
293  nm->node_by_name = hash_create_vec ( /* size */ 32,
294  sizeof (n->name[0]), sizeof (uword));
295 
296  /* Node names must be unique. */
297  {
298  vlib_node_t *o = vlib_get_node_by_name (vm, n->name);
299  if (o)
300  clib_error ("more than one node named `%v'", n->name);
301  }
302 
303  hash_set (nm->node_by_name, n->name, n->index);
304 
305  r->index = n->index; /* save index in registration */
306  n->function = r->function;
307 
308  /* Node index of next sibling will be filled in by vlib_node_main_init. */
309  n->sibling_of = r->sibling_of;
310  if (r->sibling_of && r->n_next_nodes > 0)
311  clib_error ("sibling node should not have any next nodes `%v'", n->name);
312 
313  if (r->type == VLIB_NODE_TYPE_INTERNAL)
314  ASSERT (r->vector_size > 0);
315 
316 #define _(f) n->f = r->f
317 
318  _(type);
319  _(flags);
320  _(state);
321  _(scalar_size);
322  _(vector_size);
323  _(format_buffer);
324  _(unformat_buffer);
325  _(format_trace);
326  _(validate_frame);
327 
328  /* Register error counters. */
329  vlib_register_errors (vm, n->index, r->n_errors, r->error_strings);
330  node_elog_init (vm, n->index);
331 
332  _(runtime_data_bytes);
333  if (r->runtime_data_bytes > 0)
334  {
335  vec_resize (n->runtime_data, r->runtime_data_bytes);
336  if (r->runtime_data)
337  clib_memcpy (n->runtime_data, r->runtime_data, r->runtime_data_bytes);
338  }
339 
340  vec_resize (n->next_node_names, r->n_next_nodes);
341  for (i = 0; i < r->n_next_nodes; i++)
342  n->next_node_names[i] = r->next_nodes[i];
343 
344  vec_validate_init_empty (n->next_nodes, r->n_next_nodes - 1, ~0);
345  vec_validate (n->n_vectors_by_next_node, r->n_next_nodes - 1);
346 
347  n->owner_node_index = n->owner_next_index = ~0;
348 
349  /* Initialize node runtime. */
350  {
352  u32 i;
353 
354  if (n->type == VLIB_NODE_TYPE_PROCESS)
355  {
356  vlib_process_t *p;
357  uword log2_n_stack_bytes;
358 
359  log2_n_stack_bytes = clib_max (r->process_log2_n_stack_bytes, 15);
360 
361 #ifdef CLIB_UNIX
362  /*
363  * Bump the stack size if running over a kernel with a large page size,
364  * and the stack isn't any too big to begin with. Otherwise, we'll
365  * trip over the stack guard page for sure.
366  */
367  if ((page_size > (4 << 10)) && log2_n_stack_bytes < 19)
368  {
369  if ((1 << log2_n_stack_bytes) <= page_size)
370  log2_n_stack_bytes = min_log2 (page_size) + 1;
371  else
372  log2_n_stack_bytes++;
373  }
374 #endif
375 
377  (sizeof (p[0]) + (1 << log2_n_stack_bytes),
379  if (p == 0)
380  clib_panic ("failed to allocate process stack (%d bytes)",
381  1 << log2_n_stack_bytes);
382 
383  memset (p, 0, sizeof (p[0]));
384  p->log2_n_stack_bytes = log2_n_stack_bytes;
385 
386  /* Process node's runtime index is really index into process
387  pointer vector. */
388  n->runtime_index = vec_len (nm->processes);
389 
390  vec_add1 (nm->processes, p);
391 
392  /* Paint first stack word with magic number so we can at least
393  detect process stack overruns. */
394  p->stack[0] = VLIB_PROCESS_STACK_MAGIC;
395 
396  /* Node runtime is stored inside of process. */
397  rt = &p->node_runtime;
398 
399 #ifdef CLIB_UNIX
400  /*
401  * Disallow writes to the bottom page of the stack, to
402  * catch stack overflows.
403  */
404  if (mprotect (p->stack, page_size, PROT_READ) < 0)
405  clib_unix_warning ("process stack");
406 #endif
407 
408  }
409  else
410  {
411  vec_add2_aligned (nm->nodes_by_type[n->type], rt, 1,
412  /* align */ CLIB_CACHE_LINE_BYTES);
413  n->runtime_index = rt - nm->nodes_by_type[n->type];
414  }
415 
416  if (n->type == VLIB_NODE_TYPE_INPUT)
417  nm->input_node_counts_by_state[n->state] += 1;
418 
419  rt->function = n->function;
420  rt->flags = n->flags;
421  rt->state = n->state;
422  rt->node_index = n->index;
423 
424  rt->n_next_nodes = r->n_next_nodes;
426 
428  for (i = 0; i < rt->n_next_nodes; i++)
430 
431  vec_resize (rt->errors, r->n_errors);
432  for (i = 0; i < vec_len (rt->errors); i++)
433  rt->errors[i] = vlib_error_set (n->index, i);
434 
435  ASSERT (vec_len (n->runtime_data) <= sizeof (rt->runtime_data));
436  if (vec_len (n->runtime_data) > 0)
438  vec_len (n->runtime_data));
439 
440  vec_free (n->runtime_data);
441  }
442 }
443 
444 /* Register new packet processing node. */
445 u32
447 {
448  register_node (vm, r);
449  return r->index;
450 }
451 
452 void
454 {
456 
458  while (r)
459  {
460  register_node (vm, r);
461  r = r->next_registration;
462  }
463 }
464 
465 clib_error_t *
467 {
468  vlib_node_main_t *nm = &vm->node_main;
469  clib_error_t *error = 0;
470  vlib_node_t *n;
471  uword ni;
472 
474 
475  /* Generate sibling relationships */
476  {
477  vlib_node_t *n, *sib;
478  uword si;
479 
480  for (ni = 0; ni < vec_len (nm->nodes); ni++)
481  {
482  n = vec_elt (nm->nodes, ni);
483 
484  if (!n->sibling_of)
485  continue;
486 
487  sib = vlib_get_node_by_name (vm, (u8 *) n->sibling_of);
488  if (!sib)
489  {
490  error = clib_error_create ("sibling `%s' not found for node `%v'",
491  n->sibling_of, n->name);
492  goto done;
493  }
494 
495  /* *INDENT-OFF* */
496  clib_bitmap_foreach (si, sib->sibling_bitmap, ({
497  vlib_node_t * m = vec_elt (nm->nodes, si);
498 
499  /* Connect all of sibling's siblings to us. */
500  m->sibling_bitmap = clib_bitmap_ori (m->sibling_bitmap, n->index);
501 
502  /* Connect us to all of sibling's siblings. */
503  n->sibling_bitmap = clib_bitmap_ori (n->sibling_bitmap, si);
504  }));
505  /* *INDENT-ON* */
506 
507  /* Connect sibling to us. */
508  sib->sibling_bitmap = clib_bitmap_ori (sib->sibling_bitmap, n->index);
509 
510  /* Connect us to sibling. */
511  n->sibling_bitmap = clib_bitmap_ori (n->sibling_bitmap, sib->index);
512  }
513  }
514 
515  /* Resolve next names into next indices. */
516  for (ni = 0; ni < vec_len (nm->nodes); ni++)
517  {
518  uword i;
519 
520  n = vec_elt (nm->nodes, ni);
521 
522  for (i = 0; i < vec_len (n->next_node_names); i++)
523  {
524  char *a = n->next_node_names[i];
525 
526  if (!a)
527  continue;
528 
529  if (~0 == vlib_node_add_named_next_with_slot (vm, n->index, a, i))
530  {
531  error = clib_error_create
532  ("node `%v' refers to unknown node `%s'", n->name, a);
533  goto done;
534  }
535  }
536 
538  }
539 
540  /* Set previous node pointers. */
541  for (ni = 0; ni < vec_len (nm->nodes); ni++)
542  {
543  vlib_node_t *n_next;
544  uword i;
545 
546  n = vec_elt (nm->nodes, ni);
547 
548  for (i = 0; i < vec_len (n->next_nodes); i++)
549  {
550  if (n->next_nodes[i] >= vec_len (nm->nodes))
551  continue;
552 
553  n_next = vec_elt (nm->nodes, n->next_nodes[i]);
554  n_next->prev_node_bitmap =
555  clib_bitmap_ori (n_next->prev_node_bitmap, n->index);
556  }
557  }
558 
559  {
560  vlib_next_frame_t *nf;
562  vlib_node_t *next;
563  uword i;
564 
566  {
567  if (r->n_next_nodes == 0)
568  continue;
569 
570  n = vlib_get_node (vm, r->node_index);
572 
573  for (i = 0; i < vec_len (n->next_nodes); i++)
574  {
575  next = vlib_get_node (vm, n->next_nodes[i]);
576 
577  /* Validate node runtime indices are correctly initialized. */
578  ASSERT (nf[i].node_runtime_index == next->runtime_index);
579 
580  nf[i].flags = 0;
583  }
584  }
585  }
586 
587 done:
588  return error;
589 }
590 
591 /*
592  * fd.io coding-style-patch-verification: ON
593  *
594  * Local Variables:
595  * eval: (c-set-style "gnu")
596  * End:
597  */
uword * sibling_bitmap
Definition: node.h:294
u32 * next_nodes
Definition: node.h:288
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:396
u32 next_frame_index
Definition: node.h:436
#define hash_set(h, key, value)
Definition: hash.h:254
sll srl srl sll sra u16x4 i
Definition: vector_sse2.h:343
vlib_process_t ** processes
Definition: node.h:673
#define hash_unset(h, key)
Definition: hash.h:260
vlib_node_runtime_t node_runtime
Definition: node.h:494
a
Definition: bitmap.h:516
bad routing header type(not 4)") sr_error (NO_MORE_SEGMENTS
uword vlib_node_add_next_with_slot(vlib_main_t *vm, uword node_index, uword next_node_index, uword slot)
Definition: node.c:156
void vlib_register_errors(vlib_main_t *vm, u32 node_index, u32 n_errors, char *error_strings[])
Definition: error.c:145
u32 index
Definition: node.h:237
#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:533
#define clib_error(format, args...)
Definition: error.h:62
u16 flags
Definition: node.h:246
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:482
static void node_set_elog_name(vlib_main_t *vm, uword node_index)
Definition: node.c:59
#define VLIB_NODE_MAIN_RUNTIME_STARTED
Definition: node.h:639
clib_error_t * vlib_node_main_init(vlib_main_t *vm)
Definition: node.c:466
struct _vlib_node_registration vlib_node_registration_t
#define VLIB_FRAME_NO_FREE_AFTER_DISPATCH
Definition: node.h:365
#define STRUCT_OFFSET_OF(t, f)
Definition: clib.h:62
char * format
Definition: elog.h:82
void * runtime_data
Definition: node.h:243
vlib_error_t * errors
Definition: node.h:418
static uword min_log2(uword x)
Definition: clib.h:183
u8 state
Definition: node.h:265
vlib_node_function_t * function
Definition: node.h:218
u32 vlib_register_node(vlib_main_t *vm, vlib_node_registration_t *r)
Definition: node.c:446
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:348
void vlib_worker_thread_node_runtime_update(void)
Definition: threads.c:831
vlib_node_function_t * function
Definition: node.h:415
u16 log2_n_stack_bytes
Definition: node.h:517
vlib_node_t ** nodes
Definition: node.h:633
int i32
Definition: types.h:81
char ** next_node_names
Definition: node.h:285
char * sibling_of
Definition: node.h:291
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
#define vec_resize(V, N)
Resize a vector (no header, unspecified alignment) Add N elements to end of given vector V...
Definition: vec.h:201
vlib_node_runtime_t * nodes_by_type[VLIB_N_NODE_TYPE]
Definition: node.h:643
void vlib_node_rename(vlib_main_t *vm, u32 node_index, char *fmt,...)
Definition: node.c:76
char * name
Definition: main.h:98
#define hash_get(h, key)
Definition: hash.h:248
#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:406
#define vec_insert(V, N, M)
Insert N vector elements starting at element M, initialize new elements to zero (no header...
Definition: vec.h:646
#define STACK_ALIGN
Definition: node.c:258
void vlib_register_all_static_nodes(vlib_main_t *vm)
Definition: node.c:453
uword os_get_cpu_number(void)
Definition: unix-misc.c:224
vlib_node_registration_t * node_registrations
Definition: node.h:697
elog_event_type_t * node_return_elog_event_types
Definition: main.h:145
#define vec_dup(V)
Return copy of vector (no header, no alignment)
Definition: vec.h:334
u64 * n_vectors_by_next_node
Definition: node.h:297
#define clib_error_create(args...)
Definition: error.h:108
static void * clib_mem_alloc_aligned_at_offset(uword size, uword align, uword align_offset)
Definition: mem.h:72
u8 * name
Definition: node.h:221
u32 owner_node_index
Definition: node.h:308
#define clib_mem_alloc_no_fail(size)
Definition: mem.h:131
u32 runtime_index
Definition: node.h:240
u8 * va_format(u8 *s, char *fmt, va_list *va)
Definition: format.c:386
vlib_pending_frame_t * pending_frames
Definition: node.h:658
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:300
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:88
#define clib_memcpy(a, b, c)
Definition: string.h:63
#define clib_unix_warning(format, args...)
Definition: error.h:68
uword * node_by_name
Definition: node.h:636
elog_main_t elog_main
Definition: main.h:141
void vlib_worker_thread_barrier_sync(vlib_main_t *vm)
Definition: threads.c:1144
static void vlib_next_frame_init(vlib_next_frame_t *nf)
Definition: node.h:389
#define ASSERT(truth)
unsigned int u32
Definition: types.h:88
u8 * format(u8 *s, char *fmt,...)
Definition: format.c:418
#define VLIB_PROCESS_STACK_MAGIC
Definition: node.h:559
vhost_vring_state_t state
Definition: vhost-user.h:81
static void vlib_node_runtime_update(vlib_main_t *vm, u32 node_index, u32 next_index)
Definition: node.c:93
uword * next_slot_by_node
Definition: node.h:302
static uword clib_mem_is_heap_object(void *p)
Definition: mem.h:137
static void register_node(vlib_main_t *vm, vlib_node_registration_t *r)
Definition: node.c:264
uword * prev_node_bitmap
Definition: node.h:305
#define clib_max(x, y)
Definition: clib.h:319
u64 uword
Definition: types.h:112
#define vec_elt(v, i)
Get vector value at index i.
vlib_node_t * vlib_get_node_by_name(vlib_main_t *vm, u8 *name)
Definition: node.c:45
#define hash_create_vec(elts, key_bytes, value_bytes)
Definition: hash.h:633
u32 elog_string(elog_main_t *em, char *fmt,...)
Definition: elog.c:525
#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:685
unsigned char u8
Definition: types.h:56
#define VLIB_PENDING_FRAME_NO_NEXT_FRAME
Definition: node.h:409
vlib_pending_frame_t * suspended_process_frames
Definition: node.h:679
vlib_node_main_t node_main
Definition: main.h:115
u32 owner_next_index
Definition: node.h:308
vlib_next_frame_t * next_frames
Definition: node.h:655
elog_event_type_t * node_call_elog_event_types
Definition: main.h:144
vlib_node_type_t type
Definition: node.h:234
u32 name_elog_string
Definition: node.h:224
void vlib_worker_thread_barrier_release(vlib_main_t *vm)
Definition: threads.c:1176
static void node_elog_init(vlib_main_t *vm, uword ni)
Definition: node.c:240
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:58
#define clib_panic(format, args...)
Definition: error.h:72
#define vec_foreach(var, vec)
Vector iterator.
u32 node_runtime_index
Definition: node.h:359
static vlib_error_t vlib_error_set(u32 node_index, u32 code)
Definition: error.h:59
uword vlib_node_add_named_next_with_slot(vlib_main_t *vm, uword node, char *name, uword slot)
Definition: node.c:213
u32 flags
Definition: vhost-user.h:76
#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:445
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:67
uword clib_mem_get_page_size(void)
Definition: mem_mheap.c:110
#define VLIB_NODE_FLAG_FRAME_NO_FREE_AFTER_DISPATCH
Definition: node.h:250
uword runtime_data[(128-1 *sizeof(vlib_node_function_t *)-1 *sizeof(vlib_error_t *)-11 *sizeof(u32)-5 *sizeof(u16))/sizeof(uword)]
Definition: node.h:472