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:
7 * http://www.apache.org/licenses/LICENSE-2.0
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.
16 * node.c: VLIB processing nodes
18 * Copyright (c) 2008 Eliot Dresselhaus
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:
28 * The above copyright notice and this permission notice shall be
29 * included in all copies or substantial portions of the Software.
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.
40 #include <vlib/vlib.h>
41 #include <vlib/threads.h>
43 /* Query node given name. */
45 vlib_get_node_by_name (vlib_main_t * vm, u8 * name)
47 vlib_node_main_t *nm = &vm->node_main;
50 key = format (0, "%s", key);
51 p = hash_get (nm->node_by_name, key);
54 return p ? vec_elt (nm->nodes, p[0]) : 0;
58 node_set_elog_name (vlib_main_t * vm, uword node_index)
60 vlib_node_t *n = vlib_get_node (vm, node_index);
63 t = vec_elt_at_index (vm->node_call_elog_event_types, node_index);
65 t->format = (char *) format (0, "%v-call: %%d%c", n->name, 0);
67 t = vec_elt_at_index (vm->node_return_elog_event_types, node_index);
69 t->format = (char *) format (0, "%v-return: %%d%c", n->name, 0);
72 elog_string (&vlib_global_main.elog_main, "%v%c", n->name, 0);
76 vlib_node_rename (vlib_main_t * vm, u32 node_index, char *fmt, ...)
79 vlib_node_main_t *nm = &vm->node_main;
80 vlib_node_t *n = vlib_get_node (vm, node_index);
83 hash_unset (nm->node_by_name, n->name);
85 n->name = va_format (0, fmt, &va);
87 hash_set (nm->node_by_name, n->name, n->index);
89 node_set_elog_name (vm, node_index);
91 /* Propagate the change to all worker threads */
92 vlib_worker_thread_node_runtime_update ();
96 vlib_node_runtime_update (vlib_main_t * vm, u32 node_index, u32 next_index)
98 vlib_node_main_t *nm = &vm->node_main;
99 vlib_node_runtime_t *r, *s;
100 vlib_node_t *node, *next_node;
101 vlib_next_frame_t *nf;
102 vlib_pending_frame_t *pf;
105 node = vec_elt (nm->nodes, node_index);
106 r = vlib_node_get_runtime (vm, node_index);
108 n_insert = vec_len (node->next_nodes) - r->n_next_nodes;
111 i = r->next_frame_index + r->n_next_nodes;
112 vec_insert (nm->next_frames, n_insert, i);
114 /* Initialize newly inserted next frames. */
115 for (j = 0; j < n_insert; j++)
116 vlib_next_frame_init (nm->next_frames + i + j);
118 /* Relocate other next frames at higher indices. */
119 for (j = 0; j < vec_len (nm->nodes); j++)
121 s = vlib_node_get_runtime (vm, j);
122 if (j != node_index && s->next_frame_index >= i)
123 s->next_frame_index += n_insert;
126 /* Pending frames may need to be relocated also. */
127 vec_foreach (pf, nm->pending_frames)
129 if (pf->next_frame_index != VLIB_PENDING_FRAME_NO_NEXT_FRAME
130 && pf->next_frame_index >= i)
131 pf->next_frame_index += n_insert;
134 pool_foreach (pf, nm->suspended_process_frames) {
135 if (pf->next_frame_index != ~0 && pf->next_frame_index >= i)
136 pf->next_frame_index += n_insert;
140 r->n_next_nodes = vec_len (node->next_nodes);
143 /* Set frame's node runtime index. */
144 next_node = vlib_get_node (vm, node->next_nodes[next_index]);
145 nf = nm->next_frames + r->next_frame_index + next_index;
146 nf->node_runtime_index = next_node->runtime_index;
148 vlib_worker_thread_node_runtime_update ();
152 vlib_node_get_next (vlib_main_t * vm, uword node_index, uword next_node_index)
154 vlib_node_main_t *nm = &vm->node_main;
158 node = vec_elt (nm->nodes, node_index);
160 /* Runtime has to be initialized. */
161 ASSERT (nm->flags & VLIB_NODE_MAIN_RUNTIME_STARTED);
163 if ((p = hash_get (node->next_slot_by_node, next_node_index)))
171 /* Add next node to given node in given slot. */
173 vlib_node_add_next_with_slot (vlib_main_t * vm,
175 uword next_node_index, uword slot)
177 vlib_node_main_t *nm = &vm->node_main;
178 vlib_node_t *node, *next, *old_next;
182 ASSERT (vlib_get_thread_index () == 0);
184 node = vec_elt (nm->nodes, node_index);
185 next = vec_elt (nm->nodes, next_node_index);
187 /* Runtime has to be initialized. */
188 ASSERT (nm->flags & VLIB_NODE_MAIN_RUNTIME_STARTED);
190 if ((p = hash_get (node->next_slot_by_node, next_node_index)))
192 /* Next already exists: slot must match. */
194 ASSERT (slot == p[0]);
198 vlib_worker_thread_barrier_sync (vm);
201 slot = vec_len (node->next_nodes);
203 vec_validate_init_empty (node->next_nodes, slot, ~0);
204 vec_validate (node->n_vectors_by_next_node, slot);
206 if ((old_next_index = node->next_nodes[slot]) != ~0u)
208 hash_unset (node->next_slot_by_node, old_next_index);
209 old_next = vlib_get_node (vm, old_next_index);
210 old_next->prev_node_bitmap =
211 clib_bitmap_andnoti (old_next->prev_node_bitmap, node_index);
214 node->next_nodes[slot] = next_node_index;
215 hash_set (node->next_slot_by_node, next_node_index, slot);
217 vlib_node_runtime_update (vm, node_index, slot);
219 next->prev_node_bitmap = clib_bitmap_ori (next->prev_node_bitmap,
222 /* Siblings all get same node structure. */
224 uword sib_node_index, sib_slot;
225 vlib_node_t *sib_node;
227 clib_bitmap_foreach (sib_node_index, node->sibling_bitmap) {
228 sib_node = vec_elt (nm->nodes, sib_node_index);
229 if (sib_node != node)
231 sib_slot = vlib_node_add_next_with_slot (vm, sib_node_index, next_node_index, slot);
232 ASSERT (sib_slot == slot);
238 vlib_worker_thread_barrier_release (vm);
242 /* Add named next node to given node in given slot. */
244 vlib_node_add_named_next_with_slot (vlib_main_t * vm,
245 uword node, char *name, uword slot)
247 vlib_node_main_t *nm;
248 vlib_node_t *n, *n_next;
251 n = vlib_get_node (vm, node);
253 n_next = vlib_get_node_by_name (vm, (u8 *) name);
256 if (nm->flags & VLIB_NODE_MAIN_RUNTIME_STARTED)
260 slot = clib_max (vec_len (n->next_node_names),
261 vec_len (n->next_nodes));
262 vec_validate (n->next_node_names, slot);
263 n->next_node_names[slot] = name;
267 return vlib_node_add_next_with_slot (vm, node, n_next->index, slot);
271 node_elog_init (vlib_main_t * vm, uword ni)
275 clib_memset (&t, 0, sizeof (t));
277 /* 2 event types for this node: one when node function is called.
278 One when it returns. */
279 vec_validate (vm->node_call_elog_event_types, ni);
280 vm->node_call_elog_event_types[ni] = t;
282 vec_validate (vm->node_return_elog_event_types, ni);
283 vm->node_return_elog_event_types[ni] = t;
285 node_set_elog_name (vm, ni);
289 #define STACK_ALIGN (clib_mem_get_page_size())
291 #define STACK_ALIGN CLIB_CACHE_LINE_BYTES
294 vlib_node_function_t *
295 vlib_node_get_preferred_node_fn_variant (vlib_main_t *vm,
296 vlib_node_fn_registration_t *regs)
298 vlib_node_main_t *nm = &vm->node_main;
299 vlib_node_fn_registration_t *r;
300 vlib_node_fn_variant_t *v;
301 vlib_node_function_t *fn = 0;
304 if (nm->node_fn_default_march_variant != ~0)
309 if (r->march_variant == nm->node_fn_default_march_variant)
311 r = r->next_registration;
318 v = vec_elt_at_index (nm->variants, r->march_variant);
319 if (v->priority > priority)
321 priority = v->priority;
324 r = r->next_registration;
332 vlib_register_node (vlib_main_t *vm, vlib_node_registration_t *r, char *fmt,
335 vlib_node_main_t *nm = &vm->node_main;
343 /* Default (0) type should match INTERNAL. */
344 vlib_node_t zero = { 0 };
345 ASSERT (VLIB_NODE_TYPE_INTERNAL == zero.type);
348 if (r->node_fn_registrations)
350 /* to avoid confusion, please remove ".function " statiement from
351 CLIB_NODE_REGISTRATION() if using function function candidates */
352 ASSERT (r->function == 0);
355 vlib_node_get_preferred_node_fn_variant (vm, r->node_fn_registrations);
358 ASSERT (r->function != 0);
360 n = clib_mem_alloc_no_fail (sizeof (n[0]));
361 clib_memset (n, 0, sizeof (n[0]));
362 n->index = vec_len (nm->nodes);
363 n->node_fn_registrations = r->node_fn_registrations;
364 n->protocol_hint = r->protocol_hint;
366 vec_add1 (nm->nodes, n);
369 n->name = va_format (0, fmt, &va);
372 if (!nm->node_by_name)
373 nm->node_by_name = hash_create_vec ( /* size */ 32,
374 sizeof (n->name[0]), sizeof (uword));
376 /* Node names must be unique. */
378 /* vlib_get_node_by_name() expects NULL-terminated strings */
379 u8 *name = format (0, "%v%c", n->name, 0);
380 vlib_node_t *o = vlib_get_node_by_name (vm, name);
383 clib_error ("more than one node named `%v'", n->name);
386 hash_set (nm->node_by_name, n->name, n->index);
388 r->index = n->index; /* save index in registration */
389 n->function = r->function;
391 /* Node index of next sibling will be filled in by vlib_node_main_init. */
392 n->sibling_of = r->sibling_of;
393 if (r->sibling_of && r->n_next_nodes > 0)
394 clib_error ("sibling node should not have any next nodes `%v'", n->name);
396 if (r->type == VLIB_NODE_TYPE_INTERNAL)
397 ASSERT (r->vector_size > 0);
399 #define _(f) n->f = r->f
409 size = round_pow2 (sizeof (vlib_frame_t), VLIB_FRAME_DATA_ALIGN);
411 /* scalar data size */
414 n->scalar_offset = size;
415 size += round_pow2 (r->scalar_size, VLIB_FRAME_DATA_ALIGN);
418 n->scalar_offset = 0;
420 /* Vecor data size */
421 n->vector_offset = size;
422 size += r->vector_size * VLIB_FRAME_SIZE;
424 /* Allocate a few extra slots of vector data to support
425 speculative vector enqueues which overflow vector data in next frame. */
426 size += r->vector_size * VLIB_FRAME_SIZE_EXTRA;
428 /* space for VLIB_FRAME_MAGIC */
429 n->magic_offset = size;
430 size += sizeof (u32);
432 /* round size to VLIB_FRAME_DATA_ALIGN */
433 size = round_pow2 (size, VLIB_FRAME_DATA_ALIGN);
437 n->aux_offset = size;
438 size += r->aux_size * VLIB_FRAME_SIZE;
444 n->frame_size = size = round_pow2 (size, CLIB_CACHE_LINE_BYTES);
445 ASSERT (size <= __UINT16_MAX__);
447 vlib_frame_size_t *fs = 0;
449 n->frame_size_index = (u16) ~0;
450 vec_foreach (fs, nm->frame_sizes)
451 if (fs->frame_size == size)
453 n->frame_size_index = fs - nm->frame_sizes;
457 if (n->frame_size_index == (u16) ~0)
459 vec_add2 (nm->frame_sizes, fs, 1);
460 fs->frame_size = size;
461 n->frame_size_index = fs - nm->frame_sizes;
464 /* Register error counters. */
465 vlib_register_errors (vm, n->index, r->n_errors, r->error_strings,
467 node_elog_init (vm, n->index);
469 _(runtime_data_bytes);
470 if (r->runtime_data_bytes > 0)
472 vec_resize (n->runtime_data, r->runtime_data_bytes);
474 clib_memcpy (n->runtime_data, r->runtime_data, r->runtime_data_bytes);
477 vec_resize (n->next_node_names, r->n_next_nodes);
478 for (i = 0; i < r->n_next_nodes; i++)
479 n->next_node_names[i] = r->next_nodes[i];
481 vec_validate_init_empty (n->next_nodes, r->n_next_nodes - 1, ~0);
482 vec_validate (n->n_vectors_by_next_node, r->n_next_nodes - 1);
484 n->owner_node_index = n->owner_next_index = ~0;
486 /* Initialize node runtime. */
488 vlib_node_runtime_t *rt;
491 if (n->type == VLIB_NODE_TYPE_PROCESS)
494 uword log2_n_stack_bytes;
496 log2_n_stack_bytes = clib_max (r->process_log2_n_stack_bytes,
497 VLIB_PROCESS_LOG2_STACK_SIZE);
498 log2_n_stack_bytes = clib_max (log2_n_stack_bytes,
499 clib_mem_get_log2_page_size ());
501 p = clib_mem_alloc_aligned (sizeof (p[0]), CLIB_CACHE_LINE_BYTES);
502 clib_memset (p, 0, sizeof (p[0]));
503 p->log2_n_stack_bytes = log2_n_stack_bytes;
505 p->stack = clib_mem_vm_map_stack (1ULL << log2_n_stack_bytes,
506 CLIB_MEM_PAGE_SZ_DEFAULT,
508 format_vlib_node_name, vm,
511 if (p->stack == CLIB_MEM_VM_MAP_FAILED)
512 clib_panic ("failed to allocate process stack (%d bytes)",
513 1ULL << log2_n_stack_bytes);
515 /* Process node's runtime index is really index into process
517 n->runtime_index = vec_len (nm->processes);
519 vec_add1 (nm->processes, p);
521 /* Paint first stack word with magic number so we can at least
522 detect process stack overruns. */
523 p->stack[0] = VLIB_PROCESS_STACK_MAGIC;
525 /* Node runtime is stored inside of process. */
526 rt = &p->node_runtime;
530 vec_add2_aligned (nm->nodes_by_type[n->type], rt, 1,
531 /* align */ CLIB_CACHE_LINE_BYTES);
532 if (n->type == VLIB_NODE_TYPE_INPUT)
533 clib_interrupt_resize (&nm->interrupts,
534 vec_len (nm->nodes_by_type[n->type]));
535 n->runtime_index = rt - nm->nodes_by_type[n->type];
538 if (n->type == VLIB_NODE_TYPE_INPUT)
539 nm->input_node_counts_by_state[n->state] += 1;
541 rt->function = n->function;
542 rt->flags = n->flags;
543 rt->state = n->state;
544 rt->node_index = n->index;
546 rt->n_next_nodes = r->n_next_nodes;
547 rt->next_frame_index = vec_len (nm->next_frames);
549 vec_resize (nm->next_frames, rt->n_next_nodes);
550 for (i = 0; i < rt->n_next_nodes; i++)
551 vlib_next_frame_init (nm->next_frames + rt->next_frame_index + i);
553 vec_resize (rt->errors, r->n_errors);
554 for (i = 0; i < vec_len (rt->errors); i++)
555 rt->errors[i] = n->error_heap_index + i;
557 STATIC_ASSERT_SIZEOF (vlib_node_runtime_t, 128);
558 ASSERT (vec_len (n->runtime_data) <= VLIB_NODE_RUNTIME_DATA_SIZE);
560 if (vec_len (n->runtime_data) > 0)
561 clib_memcpy (rt->runtime_data, n->runtime_data,
562 vec_len (n->runtime_data));
564 clib_memset (rt->runtime_data, 0, VLIB_NODE_RUNTIME_DATA_SIZE);
566 vec_free (n->runtime_data);
573 null_node_fn (vlib_main_t * vm,
574 vlib_node_runtime_t * node, vlib_frame_t * frame)
576 u16 n_vectors = frame->n_vectors;
578 vlib_node_increment_counter (vm, node->node_index, 0, n_vectors);
579 vlib_buffer_free (vm, vlib_frame_vector_args (frame), n_vectors);
580 vlib_frame_free (vm, node, frame);
586 vlib_register_all_node_march_variants (vlib_main_t *vm)
588 vlib_node_main_t *nm = &vm->node_main;
589 vlib_node_fn_variant_t *v;
592 nm->node_fn_default_march_variant = ~0;
593 ASSERT (nm->variants == 0);
594 vec_add2 (nm->variants, v, 1);
595 v->desc = v->suffix = "default";
596 v->index = CLIB_MARCH_VARIANT_TYPE;
599 vec_add2 (nm->variants, v, 1); \
601 v->index = CLIB_MARCH_VARIANT_TYPE_##s; \
602 v->priority = clib_cpu_march_priority_##s (); \
605 foreach_march_variant;
608 nm->node_fn_march_variant_by_suffix = hash_create_string (0, sizeof (u32));
610 vec_foreach (v, nm->variants)
612 ASSERT (v->index == v - nm->variants);
613 hash_set (nm->node_fn_march_variant_by_suffix, v->suffix, v->index);
614 if (v->priority > prio)
620 vlib_register_all_static_nodes (vlib_main_t * vm)
622 vlib_global_main_t *vgm = vlib_get_global_main ();
623 vlib_node_registration_t *r;
625 static char *null_node_error_strings[] = {
626 "blackholed packets",
629 static vlib_node_registration_t null_node_reg = {
630 .function = null_node_fn,
631 .vector_size = sizeof (u32),
633 .error_strings = null_node_error_strings,
636 /* make sure that node index 0 is not used by
638 vlib_register_node (vm, &null_node_reg, "null-node");
640 r = vgm->node_registrations;
643 vlib_register_node (vm, r, "%s", r->name);
644 r = r->next_registration;
649 vlib_node_get_nodes (vlib_main_t * vm, u32 max_threads, int include_stats,
650 int barrier_sync, vlib_node_t **** node_dupsp,
651 vlib_main_t *** stat_vmsp)
653 vlib_node_main_t *nm = &vm->node_main;
655 vlib_node_t ***node_dups = *node_dupsp;
657 vlib_main_t **stat_vms = *stat_vmsp;
658 vlib_main_t *stat_vm;
660 u32 threads_to_serialize;
662 if (vec_len (stat_vms) == 0)
664 for (i = 0; i < vlib_get_n_threads (); i++)
666 stat_vm = vlib_get_main_by_index (i);
668 vec_add1 (stat_vms, stat_vm);
672 threads_to_serialize = clib_min (max_threads, vec_len (stat_vms));
674 vec_validate (node_dups, threads_to_serialize - 1);
677 * Barrier sync across stats scraping.
678 * Otherwise, the counts will be grossly inaccurate.
681 vlib_worker_thread_barrier_sync (vm);
683 for (j = 0; j < threads_to_serialize; j++)
685 stat_vm = stat_vms[j];
686 nm = &stat_vm->node_main;
690 for (i = 0; i < vec_len (nm->nodes); i++)
693 vlib_node_sync_stats (stat_vm, n);
697 nodes = node_dups[j];
698 vec_validate (nodes, vec_len (nm->nodes) - 1);
699 clib_memcpy (nodes, nm->nodes, vec_len (nm->nodes) * sizeof (nodes[0]));
700 node_dups[j] = nodes;
704 vlib_worker_thread_barrier_release (vm);
706 *node_dupsp = node_dups;
707 *stat_vmsp = stat_vms;
711 vlib_node_main_init (vlib_main_t * vm)
713 vlib_node_main_t *nm = &vm->node_main;
714 clib_error_t *error = 0;
718 nm->flags |= VLIB_NODE_MAIN_RUNTIME_STARTED;
720 /* Generate sibling relationships */
722 vlib_node_t *n, *sib;
725 for (ni = 0; ni < vec_len (nm->nodes); ni++)
727 n = vec_elt (nm->nodes, ni);
732 sib = vlib_get_node_by_name (vm, (u8 *) n->sibling_of);
735 error = clib_error_create ("sibling `%s' not found for node `%v'",
736 n->sibling_of, n->name);
741 clib_bitmap_foreach (si, sib->sibling_bitmap) {
742 vlib_node_t * m = vec_elt (nm->nodes, si);
744 /* Connect all of sibling's siblings to us. */
745 m->sibling_bitmap = clib_bitmap_ori (m->sibling_bitmap, n->index);
747 /* Connect us to all of sibling's siblings. */
748 n->sibling_bitmap = clib_bitmap_ori (n->sibling_bitmap, si);
752 /* Connect sibling to us. */
753 sib->sibling_bitmap = clib_bitmap_ori (sib->sibling_bitmap, n->index);
755 /* Connect us to sibling. */
756 n->sibling_bitmap = clib_bitmap_ori (n->sibling_bitmap, sib->index);
760 /* Resolve next names into next indices. */
761 for (ni = 0; ni < vec_len (nm->nodes); ni++)
765 n = vec_elt (nm->nodes, ni);
767 for (i = 0; i < vec_len (n->next_node_names); i++)
769 char *a = n->next_node_names[i];
774 if (~0 == vlib_node_add_named_next_with_slot (vm, n->index, a, i))
776 error = clib_error_create
777 ("node `%v' refers to unknown node `%s'", n->name, a);
782 vec_free (n->next_node_names);
785 /* Set previous node pointers. */
786 for (ni = 0; ni < vec_len (nm->nodes); ni++)
791 n = vec_elt (nm->nodes, ni);
793 for (i = 0; i < vec_len (n->next_nodes); i++)
795 if (n->next_nodes[i] >= vec_len (nm->nodes))
798 n_next = vec_elt (nm->nodes, n->next_nodes[i]);
799 n_next->prev_node_bitmap =
800 clib_bitmap_ori (n_next->prev_node_bitmap, n->index);
805 vlib_next_frame_t *nf;
806 vlib_node_runtime_t *r;
810 vec_foreach (r, nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
812 if (r->n_next_nodes == 0)
815 n = vlib_get_node (vm, r->node_index);
816 nf = vec_elt_at_index (nm->next_frames, r->next_frame_index);
818 for (i = 0; i < vec_len (n->next_nodes); i++)
820 next = vlib_get_node (vm, n->next_nodes[i]);
822 /* Validate node runtime indices are correctly initialized. */
823 ASSERT (nf[i].node_runtime_index == next->runtime_index);
826 if (next->flags & VLIB_NODE_FLAG_FRAME_NO_FREE_AFTER_DISPATCH)
827 nf[i].flags |= VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
837 vlib_process_create (vlib_main_t * vm, char *name,
838 vlib_node_function_t * f, u32 log2_n_stack_bytes)
840 vlib_node_registration_t r;
843 memset (&r, 0, sizeof (r));
846 r.process_log2_n_stack_bytes = log2_n_stack_bytes;
847 r.type = VLIB_NODE_TYPE_PROCESS;
849 vlib_worker_thread_barrier_sync (vm);
851 vlib_register_node (vm, &r, "%s", name);
854 vlib_worker_thread_node_runtime_update ();
855 vlib_worker_thread_barrier_release (vm);
857 n = vlib_get_node (vm, r.index);
858 vlib_start_process (vm, n->runtime_index);
864 vlib_node_set_march_variant (vlib_main_t *vm, u32 node_index,
865 clib_march_variant_type_t march_variant)
867 vlib_node_fn_registration_t *fnr;
868 vlib_node_fn_variant_t *v;
869 vlib_node_t *n = vlib_get_node (vm, node_index);
871 if (n->node_fn_registrations == 0)
874 fnr = n->node_fn_registrations;
875 v = vec_elt_at_index (vm->node_main.variants, march_variant);
879 if (fnr->march_variant == v->index)
881 n->function = fnr->function;
883 for (int i = 0; i < vlib_get_n_threads (); i++)
885 vlib_node_runtime_t *nrt;
887 vlib_node_get_runtime (vlib_get_main_by_index (i), n->index);
888 nrt->function = fnr->function;
892 fnr = fnr->next_registration;
897 * fd.io coding-style-patch-verification: ON
900 * eval: (c-set-style "gnu")