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.
19 #include <vppinfra/format.h>
20 #include <vppinfra/linux/sysfs.h>
21 #include <vlib/vlib.h>
23 #include <vlib/threads.h>
24 #include <vlib/unix/cj.h>
26 DECLARE_CJ_GLOBAL_LOG;
28 #define FRAME_QUEUE_NELTS 64
36 vlib_worker_thread_t *vlib_worker_threads;
37 vlib_thread_main_t vlib_thread_main;
40 * Barrier tracing can be enabled on a normal build to collect information
41 * on barrier use, including timings and call stacks. Deliberately not
42 * keyed off CLIB_DEBUG, because that can add significant overhead which
43 * imapacts observed timings.
47 elog_global_id_for_msg_name (const char *msg_name)
54 h = hash_create_string (0, sizeof (uword));
56 p = hash_get_mem (h, msg_name);
59 r = elog_string (&vlib_global_main.elog_main, "%s", msg_name);
61 name_copy = format (0, "%s%c", msg_name, 0);
63 hash_set_mem (h, name_copy, r);
69 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
71 if (!vlib_worker_threads->barrier_elog_enabled)
75 ELOG_TYPE_DECLARE (e) =
77 .format = "bar-trace-%s-#%d",
78 .format_args = "T4i4",
83 u32 caller, count, t_entry, t_open, t_closed;
86 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
87 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
88 ed->caller = elog_global_id_for_msg_name
89 (vlib_worker_threads[0].barrier_caller);
90 ed->t_entry = (int) (1000000.0 * t_entry);
91 ed->t_open = (int) (1000000.0 * t_open);
92 ed->t_closed = (int) (1000000.0 * t_closed);
96 barrier_trace_sync_rec (f64 t_entry)
98 if (!vlib_worker_threads->barrier_elog_enabled)
102 ELOG_TYPE_DECLARE (e) =
104 .format = "bar-syncrec-%s-#%d",
105 .format_args = "T4i4",
113 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
114 ed->depth = (int) vlib_worker_threads[0].recursion_level - 1;
115 ed->caller = elog_global_id_for_msg_name
116 (vlib_worker_threads[0].barrier_caller);
120 barrier_trace_release_rec (f64 t_entry)
122 if (!vlib_worker_threads->barrier_elog_enabled)
126 ELOG_TYPE_DECLARE (e) =
128 .format = "bar-relrrec-#%d",
137 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
138 ed->depth = (int) vlib_worker_threads[0].recursion_level;
142 barrier_trace_release (f64 t_entry, f64 t_closed_total, f64 t_update_main)
144 if (!vlib_worker_threads->barrier_elog_enabled)
148 ELOG_TYPE_DECLARE (e) =
150 .format = "bar-rel-#%d-e%d-u%d-t%d",
151 .format_args = "i4i4i4i4",
156 u32 count, t_entry, t_update_main, t_closed_total;
159 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
160 ed->t_entry = (int) (1000000.0 * t_entry);
161 ed->t_update_main = (int) (1000000.0 * t_update_main);
162 ed->t_closed_total = (int) (1000000.0 * t_closed_total);
163 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
165 /* Reset context for next trace */
166 vlib_worker_threads[0].barrier_context = NULL;
170 os_get_nthreads (void)
174 len = vec_len (vlib_thread_stacks);
182 vlib_set_thread_name (char *name)
184 int pthread_setname_np (pthread_t __target_thread, const char *__name);
186 pthread_t thread = pthread_self ();
190 rv = pthread_setname_np (thread, name);
192 clib_warning ("pthread_setname_np returned %d", rv);
197 sort_registrations_by_no_clone (void *a0, void *a1)
199 vlib_thread_registration_t **tr0 = a0;
200 vlib_thread_registration_t **tr1 = a1;
202 return ((i32) ((*tr0)->no_data_structure_clone)
203 - ((i32) ((*tr1)->no_data_structure_clone)));
207 clib_sysfs_list_to_bitmap (char *filename)
212 fp = fopen (filename, "r");
217 vec_validate (buffer, 256 - 1);
218 if (fgets ((char *) buffer, 256, fp))
221 unformat_init_string (&in, (char *) buffer,
222 strlen ((char *) buffer));
223 if (unformat (&in, "%U", unformat_bitmap_list, &r) != 1)
224 clib_warning ("unformat_bitmap_list failed");
234 /* Called early in the init sequence */
237 vlib_thread_init (vlib_main_t * vm)
239 vlib_thread_main_t *tm = &vlib_thread_main;
240 vlib_worker_thread_t *w;
241 vlib_thread_registration_t *tr;
242 u32 n_vlib_mains = 1;
247 /* get bitmaps of active cpu cores and sockets */
248 tm->cpu_core_bitmap =
249 clib_sysfs_list_to_bitmap ("/sys/devices/system/cpu/online");
250 tm->cpu_socket_bitmap =
251 clib_sysfs_list_to_bitmap ("/sys/devices/system/node/online");
253 avail_cpu = clib_bitmap_dup (tm->cpu_core_bitmap);
256 for (i = 0; i < tm->skip_cores; i++)
258 uword c = clib_bitmap_first_set (avail_cpu);
260 return clib_error_return (0, "no available cpus to skip");
262 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
265 /* grab cpu for main thread */
266 if (tm->main_lcore == ~0)
268 /* if main-lcore is not set, we try to use lcore 1 */
269 if (clib_bitmap_get (avail_cpu, 1))
272 tm->main_lcore = clib_bitmap_first_set (avail_cpu);
273 if (tm->main_lcore == (u8) ~ 0)
274 return clib_error_return (0, "no available cpus to be used for the"
279 if (clib_bitmap_get (avail_cpu, tm->main_lcore) == 0)
280 return clib_error_return (0, "cpu %u is not available to be used"
281 " for the main thread", tm->main_lcore);
283 avail_cpu = clib_bitmap_set (avail_cpu, tm->main_lcore, 0);
285 /* assume that there is socket 0 only if there is no data from sysfs */
286 if (!tm->cpu_socket_bitmap)
287 tm->cpu_socket_bitmap = clib_bitmap_set (0, 0, 1);
289 /* pin main thread to main_lcore */
290 if (tm->cb.vlib_thread_set_lcore_cb)
292 tm->cb.vlib_thread_set_lcore_cb (0, tm->main_lcore);
298 CPU_SET (tm->main_lcore, &cpuset);
299 pthread_setaffinity_np (pthread_self (), sizeof (cpu_set_t), &cpuset);
302 /* as many threads as stacks... */
303 vec_validate_aligned (vlib_worker_threads, vec_len (vlib_thread_stacks) - 1,
304 CLIB_CACHE_LINE_BYTES);
306 /* Preallocate thread 0 */
307 _vec_len (vlib_worker_threads) = 1;
308 w = vlib_worker_threads;
309 w->thread_mheap = clib_mem_get_heap ();
310 w->thread_stack = vlib_thread_stacks[0];
311 w->cpu_id = tm->main_lcore;
312 w->lwp = syscall (SYS_gettid);
313 w->thread_id = pthread_self ();
314 tm->n_vlib_mains = 1;
316 if (tm->sched_policy != ~0)
318 struct sched_param sched_param;
319 if (!sched_getparam (w->lwp, &sched_param))
321 if (tm->sched_priority != ~0)
322 sched_param.sched_priority = tm->sched_priority;
323 sched_setscheduler (w->lwp, tm->sched_policy, &sched_param);
327 /* assign threads to cores and set n_vlib_mains */
332 vec_add1 (tm->registrations, tr);
336 vec_sort_with_function (tm->registrations, sort_registrations_by_no_clone);
338 for (i = 0; i < vec_len (tm->registrations); i++)
341 tr = tm->registrations[i];
342 tr->first_index = first_index;
343 first_index += tr->count;
344 n_vlib_mains += (tr->no_data_structure_clone == 0) ? tr->count : 0;
346 /* construct coremask */
347 if (tr->use_pthreads || !tr->count)
354 clib_bitmap_foreach (c, tr->coremask, ({
355 if (clib_bitmap_get(avail_cpu, c) == 0)
356 return clib_error_return (0, "cpu %u is not available to be used"
357 " for the '%s' thread",c, tr->name);
359 avail_cpu = clib_bitmap_set(avail_cpu, c, 0);
366 for (j = 0; j < tr->count; j++)
368 uword c = clib_bitmap_first_set (avail_cpu);
370 return clib_error_return (0,
371 "no available cpus to be used for"
372 " the '%s' thread", tr->name);
374 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
375 tr->coremask = clib_bitmap_set (tr->coremask, c, 1);
380 clib_bitmap_free (avail_cpu);
382 tm->n_vlib_mains = n_vlib_mains;
384 vec_validate_aligned (vlib_worker_threads, first_index - 1,
385 CLIB_CACHE_LINE_BYTES);
391 vlib_frame_queue_alloc (int nelts)
393 vlib_frame_queue_t *fq;
395 fq = clib_mem_alloc_aligned (sizeof (*fq), CLIB_CACHE_LINE_BYTES);
396 clib_memset (fq, 0, sizeof (*fq));
398 fq->vector_threshold = 128; // packets
399 vec_validate_aligned (fq->elts, nelts - 1, CLIB_CACHE_LINE_BYTES);
403 if (((uword) & fq->tail) & (CLIB_CACHE_LINE_BYTES - 1))
404 fformat (stderr, "WARNING: fq->tail unaligned\n");
405 if (((uword) & fq->head) & (CLIB_CACHE_LINE_BYTES - 1))
406 fformat (stderr, "WARNING: fq->head unaligned\n");
407 if (((uword) fq->elts) & (CLIB_CACHE_LINE_BYTES - 1))
408 fformat (stderr, "WARNING: fq->elts unaligned\n");
410 if (sizeof (fq->elts[0]) % CLIB_CACHE_LINE_BYTES)
411 fformat (stderr, "WARNING: fq->elts[0] size %d\n",
412 sizeof (fq->elts[0]));
413 if (nelts & (nelts - 1))
415 fformat (stderr, "FATAL: nelts MUST be a power of 2\n");
423 void vl_msg_api_handler_no_free (void *) __attribute__ ((weak));
425 vl_msg_api_handler_no_free (void *v)
429 /* Turned off, save as reference material... */
432 vlib_frame_queue_dequeue_internal (int thread_id,
433 vlib_main_t * vm, vlib_node_main_t * nm)
435 vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
436 vlib_frame_queue_elt_t *elt;
438 vlib_pending_frame_t *p;
439 vlib_node_runtime_t *r;
440 u32 node_runtime_index;
445 ASSERT (vm == vlib_mains[thread_id]);
449 if (fq->head == fq->tail)
452 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
457 before = clib_cpu_time_now ();
460 node_runtime_index = elt->node_runtime_index;
461 msg_type = elt->msg_type;
465 case VLIB_FRAME_QUEUE_ELT_FREE_BUFFERS:
466 vlib_buffer_free (vm, vlib_frame_vector_args (f), f->n_vectors);
467 /* note fallthrough... */
468 case VLIB_FRAME_QUEUE_ELT_FREE_FRAME:
469 r = vec_elt_at_index (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
471 vlib_frame_free (vm, r, f);
473 case VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME:
474 vec_add2 (vm->node_main.pending_frames, p, 1);
475 f->flags |= (VLIB_FRAME_PENDING | VLIB_FRAME_FREE_AFTER_DISPATCH);
476 p->node_runtime_index = elt->node_runtime_index;
477 p->frame_index = vlib_frame_index (vm, f);
478 p->next_frame_index = VLIB_PENDING_FRAME_NO_NEXT_FRAME;
479 fq->dequeue_vectors += (u64) f->n_vectors;
481 case VLIB_FRAME_QUEUE_ELT_API_MSG:
482 vl_msg_api_handler_no_free (f);
485 clib_warning ("bogus frame queue message, type %d", msg_type);
490 fq->dequeue_ticks += clib_cpu_time_now () - before;
491 CLIB_MEMORY_BARRIER ();
500 vlib_frame_queue_dequeue (int thread_id,
501 vlib_main_t * vm, vlib_node_main_t * nm)
503 return vlib_frame_queue_dequeue_internal (thread_id, vm, nm);
507 vlib_frame_queue_enqueue (vlib_main_t * vm, u32 node_runtime_index,
508 u32 frame_queue_index, vlib_frame_t * frame,
509 vlib_frame_queue_msg_type_t type)
511 vlib_frame_queue_t *fq = vlib_frame_queues[frame_queue_index];
512 vlib_frame_queue_elt_t *elt;
515 u64 before = clib_cpu_time_now ();
519 new_tail = clib_atomic_add_fetch (&fq->tail, 1);
521 /* Wait until a ring slot is available */
522 while (new_tail >= fq->head + fq->nelts)
524 f64 b4 = vlib_time_now_ticks (vm, before);
525 vlib_worker_thread_barrier_check (vm, b4);
526 /* Bad idea. Dequeue -> enqueue -> dequeue -> trouble */
527 // vlib_frame_queue_dequeue (vm->thread_index, vm, nm);
530 elt = fq->elts + (new_tail & (fq->nelts - 1));
532 /* this would be very bad... */
537 /* Once we enqueue the frame, frame->n_vectors is owned elsewhere... */
538 save_count = frame->n_vectors;
541 elt->node_runtime_index = node_runtime_index;
542 elt->msg_type = type;
543 CLIB_MEMORY_BARRIER ();
550 /* To be called by vlib worker threads upon startup */
552 vlib_worker_thread_init (vlib_worker_thread_t * w)
554 vlib_thread_main_t *tm = vlib_get_thread_main ();
557 * Note: disabling signals in worker threads as follows
558 * prevents the api post-mortem dump scheme from working
562 * pthread_sigmask (SIG_SETMASK, &s, 0);
566 clib_mem_set_heap (w->thread_mheap);
568 if (vec_len (tm->thread_prefix) && w->registration->short_name)
570 w->name = format (0, "%v_%s_%d%c", tm->thread_prefix,
571 w->registration->short_name, w->instance_id, '\0');
572 vlib_set_thread_name ((char *) w->name);
575 if (!w->registration->use_pthreads)
578 /* Initial barrier sync, for both worker and i/o threads */
579 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, 1);
581 while (*vlib_worker_threads->wait_at_barrier)
584 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, -1);
589 vlib_worker_thread_bootstrap_fn (void *arg)
592 vlib_worker_thread_t *w = arg;
594 w->lwp = syscall (SYS_gettid);
595 w->thread_id = pthread_self ();
597 __os_thread_index = w - vlib_worker_threads;
599 rv = (void *) clib_calljmp
600 ((uword (*)(uword)) w->thread_function,
601 (uword) arg, w->thread_stack + VLIB_THREAD_STACK_SIZE);
602 /* NOTREACHED, we hope */
607 vlib_get_thread_core_socket (vlib_worker_thread_t * w, unsigned cpu_id)
609 const char *sys_cpu_path = "/sys/devices/system/cpu/cpu";
611 int core_id = -1, socket_id = -1;
613 p = format (p, "%s%u/topology/core_id%c", sys_cpu_path, cpu_id, 0);
614 clib_sysfs_read ((char *) p, "%d", &core_id);
615 vec_reset_length (p);
617 format (p, "%s%u/topology/physical_package_id%c", sys_cpu_path, cpu_id,
619 clib_sysfs_read ((char *) p, "%d", &socket_id);
622 w->core_id = core_id;
623 w->socket_id = socket_id;
626 static clib_error_t *
627 vlib_launch_thread_int (void *fp, vlib_worker_thread_t * w, unsigned cpu_id)
629 vlib_thread_main_t *tm = &vlib_thread_main;
630 void *(*fp_arg) (void *) = fp;
633 vlib_get_thread_core_socket (w, cpu_id);
634 if (tm->cb.vlib_launch_thread_cb && !w->registration->use_pthreads)
635 return tm->cb.vlib_launch_thread_cb (fp, (void *) w, cpu_id);
641 CPU_SET (cpu_id, &cpuset);
643 if (pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w))
644 return clib_error_return_unix (0, "pthread_create");
646 if (pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset))
647 return clib_error_return_unix (0, "pthread_setaffinity_np");
653 static clib_error_t *
654 start_workers (vlib_main_t * vm)
657 vlib_worker_thread_t *w;
658 vlib_main_t *vm_clone;
660 vlib_thread_main_t *tm = &vlib_thread_main;
661 vlib_thread_registration_t *tr;
662 vlib_node_runtime_t *rt;
663 u32 n_vlib_mains = tm->n_vlib_mains;
664 u32 worker_thread_index;
665 u8 *main_heap = clib_mem_get_per_cpu_heap ();
667 vec_reset_length (vlib_worker_threads);
669 /* Set up the main thread */
670 vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
671 w->elog_track.name = "main thread";
672 elog_track_register (&vm->elog_main, &w->elog_track);
674 if (vec_len (tm->thread_prefix))
676 w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
677 vlib_set_thread_name ((char *) w->name);
681 clib_mem_alloc_aligned (CLIB_CACHE_LINE_BYTES, CLIB_CACHE_LINE_BYTES);
682 vm->elog_main.lock[0] = 0;
684 if (n_vlib_mains > 1)
686 /* Replace hand-crafted length-1 vector with a real vector */
689 vec_validate_aligned (vlib_mains, tm->n_vlib_mains - 1,
690 CLIB_CACHE_LINE_BYTES);
691 _vec_len (vlib_mains) = 0;
692 vec_add1_aligned (vlib_mains, vm, CLIB_CACHE_LINE_BYTES);
694 vlib_worker_threads->wait_at_barrier =
695 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
696 vlib_worker_threads->workers_at_barrier =
697 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
699 vlib_worker_threads->node_reforks_required =
700 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
702 /* We'll need the rpc vector lock... */
703 clib_spinlock_init (&vm->pending_rpc_lock);
705 /* Ask for an initial barrier sync */
706 *vlib_worker_threads->workers_at_barrier = 0;
707 *vlib_worker_threads->wait_at_barrier = 1;
709 /* Without update or refork */
710 *vlib_worker_threads->node_reforks_required = 0;
711 vm->need_vlib_worker_thread_node_runtime_update = 0;
714 vm->barrier_epoch = 0;
715 vm->barrier_no_close_before = 0;
717 worker_thread_index = 1;
719 for (i = 0; i < vec_len (tm->registrations); i++)
721 vlib_node_main_t *nm, *nm_clone;
722 vlib_buffer_free_list_t *fl_clone, *fl_orig;
723 vlib_buffer_free_list_t *orig_freelist_pool;
726 tr = tm->registrations[i];
731 for (k = 0; k < tr->count; k++)
735 vec_add2 (vlib_worker_threads, w, 1);
736 /* Currently unused, may not really work */
739 #if USE_DLMALLOC == 0
741 mheap_alloc (0 /* use VM */ , tr->mheap_size);
743 w->thread_mheap = create_mspace (tr->mheap_size,
748 w->thread_mheap = main_heap;
751 vlib_thread_stack_init (w - vlib_worker_threads);
752 w->thread_function = tr->function;
753 w->thread_function_arg = w;
755 w->registration = tr;
758 (char *) format (0, "%s %d", tr->name, k + 1);
759 vec_add1 (w->elog_track.name, 0);
760 elog_track_register (&vm->elog_main, &w->elog_track);
762 if (tr->no_data_structure_clone)
765 /* Fork vlib_global_main et al. Look for bugs here */
766 oldheap = clib_mem_set_heap (w->thread_mheap);
768 vm_clone = clib_mem_alloc_aligned (sizeof (*vm_clone),
769 CLIB_CACHE_LINE_BYTES);
770 clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
772 vm_clone->thread_index = worker_thread_index;
773 vm_clone->heap_base = w->thread_mheap;
774 vm_clone->heap_aligned_base = (void *)
775 (((uword) w->thread_mheap) & ~(VLIB_FRAME_ALIGN - 1));
776 vm_clone->init_functions_called =
777 hash_create (0, /* value bytes */ 0);
778 vm_clone->pending_rpc_requests = 0;
779 vec_validate (vm_clone->pending_rpc_requests, 0);
780 _vec_len (vm_clone->pending_rpc_requests) = 0;
781 clib_memset (&vm_clone->random_buffer, 0,
782 sizeof (vm_clone->random_buffer));
784 nm = &vlib_mains[0]->node_main;
785 nm_clone = &vm_clone->node_main;
786 /* fork next frames array, preserving node runtime indices */
787 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
788 CLIB_CACHE_LINE_BYTES);
789 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
791 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
792 u32 save_node_runtime_index;
795 save_node_runtime_index = nf->node_runtime_index;
796 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
797 vlib_next_frame_init (nf);
798 nf->node_runtime_index = save_node_runtime_index;
799 nf->flags = save_flags;
802 /* fork the frame dispatch queue */
803 nm_clone->pending_frames = 0;
804 vec_validate (nm_clone->pending_frames, 10); /* $$$$$?????? */
805 _vec_len (nm_clone->pending_frames) = 0;
810 /* Allocate all nodes in single block for speed */
811 n = clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*n));
813 for (j = 0; j < vec_len (nm->nodes); j++)
815 clib_memcpy (n, nm->nodes[j], sizeof (*n));
816 /* none of the copied nodes have enqueue rights given out */
817 n->owner_node_index = VLIB_INVALID_NODE_INDEX;
818 clib_memset (&n->stats_total, 0, sizeof (n->stats_total));
819 clib_memset (&n->stats_last_clear, 0,
820 sizeof (n->stats_last_clear));
821 vec_add1 (nm_clone->nodes, n);
824 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
825 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
826 CLIB_CACHE_LINE_BYTES);
828 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
830 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
831 rt->thread_index = vm_clone->thread_index;
832 /* copy initial runtime_data from node */
833 if (n->runtime_data && n->runtime_data_bytes > 0)
834 clib_memcpy (rt->runtime_data, n->runtime_data,
835 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
836 n->runtime_data_bytes));
839 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
840 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
841 CLIB_CACHE_LINE_BYTES);
842 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
844 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
845 rt->thread_index = vm_clone->thread_index;
846 /* copy initial runtime_data from node */
847 if (n->runtime_data && n->runtime_data_bytes > 0)
848 clib_memcpy (rt->runtime_data, n->runtime_data,
849 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
850 n->runtime_data_bytes));
853 nm_clone->processes = vec_dup_aligned (nm->processes,
854 CLIB_CACHE_LINE_BYTES);
856 /* zap the (per worker) frame freelists, etc */
857 nm_clone->frame_sizes = 0;
858 nm_clone->frame_size_hash = hash_create (0, sizeof (uword));
860 /* Packet trace buffers are guaranteed to be empty, nothing to do here */
862 clib_mem_set_heap (oldheap);
863 vec_add1_aligned (vlib_mains, vm_clone, CLIB_CACHE_LINE_BYTES);
865 vm_clone->error_main.counters = vec_dup_aligned
866 (vlib_mains[0]->error_main.counters, CLIB_CACHE_LINE_BYTES);
867 vm_clone->error_main.counters_last_clear = vec_dup_aligned
868 (vlib_mains[0]->error_main.counters_last_clear,
869 CLIB_CACHE_LINE_BYTES);
871 /* Fork the vlib_buffer_main_t free lists, etc. */
872 orig_freelist_pool = vm_clone->buffer_free_list_pool;
873 vm_clone->buffer_free_list_pool = 0;
876 pool_foreach (fl_orig, orig_freelist_pool,
878 pool_get_aligned (vm_clone->buffer_free_list_pool,
879 fl_clone, CLIB_CACHE_LINE_BYTES);
880 ASSERT (fl_orig - orig_freelist_pool
881 == fl_clone - vm_clone->buffer_free_list_pool);
883 fl_clone[0] = fl_orig[0];
884 fl_clone->buffers = 0;
885 vec_validate(fl_clone->buffers, 0);
886 vec_reset_length(fl_clone->buffers);
887 fl_clone->n_alloc = 0;
891 worker_thread_index++;
897 /* only have non-data-structure copy threads to create... */
898 for (i = 0; i < vec_len (tm->registrations); i++)
900 tr = tm->registrations[i];
902 for (j = 0; j < tr->count; j++)
904 vec_add2 (vlib_worker_threads, w, 1);
907 #if USE_DLMALLOC == 0
909 mheap_alloc (0 /* use VM */ , tr->mheap_size);
912 create_mspace (tr->mheap_size, 0 /* locked */ );
916 w->thread_mheap = main_heap;
918 vlib_thread_stack_init (w - vlib_worker_threads);
919 w->thread_function = tr->function;
920 w->thread_function_arg = w;
923 (char *) format (0, "%s %d", tr->name, j + 1);
924 w->registration = tr;
925 vec_add1 (w->elog_track.name, 0);
926 elog_track_register (&vm->elog_main, &w->elog_track);
931 worker_thread_index = 1;
933 for (i = 0; i < vec_len (tm->registrations); i++)
938 tr = tm->registrations[i];
940 if (tr->use_pthreads || tm->use_pthreads)
942 for (j = 0; j < tr->count; j++)
944 w = vlib_worker_threads + worker_thread_index++;
945 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
948 clib_error_report (err);
955 clib_bitmap_foreach (c, tr->coremask, ({
956 w = vlib_worker_threads + worker_thread_index++;
957 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
960 clib_error_report (err);
965 vlib_worker_thread_barrier_sync (vm);
966 vlib_worker_thread_barrier_release (vm);
970 VLIB_MAIN_LOOP_ENTER_FUNCTION (start_workers);
974 worker_thread_node_runtime_update_internal (void)
978 vlib_node_main_t *nm, *nm_clone;
979 vlib_main_t *vm_clone;
980 vlib_node_runtime_t *rt;
982 vlib_node_runtime_sync_stats (vlib_main_t * vm,
983 vlib_node_runtime_t * r,
985 uword n_vectors, uword n_clocks);
987 ASSERT (vlib_get_thread_index () == 0);
992 ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
995 * Scrape all runtime stats, so we don't lose node runtime(s) with
996 * pending counts, or throw away worker / io thread counts.
998 for (j = 0; j < vec_len (nm->nodes); j++)
1002 vlib_node_sync_stats (vm, n);
1005 for (i = 1; i < vec_len (vlib_mains); i++)
1009 vm_clone = vlib_mains[i];
1010 nm_clone = &vm_clone->node_main;
1012 for (j = 0; j < vec_len (nm_clone->nodes); j++)
1014 n = nm_clone->nodes[j];
1016 rt = vlib_node_get_runtime (vm_clone, n->index);
1017 vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
1021 /* Per-worker clone rebuilds are now done on each thread */
1026 vlib_worker_thread_node_refork (void)
1028 vlib_main_t *vm, *vm_clone;
1029 vlib_node_main_t *nm, *nm_clone;
1030 vlib_node_t **old_nodes_clone;
1031 vlib_node_runtime_t *rt, *old_rt;
1033 vlib_node_t *new_n_clone;
1038 nm = &vm->node_main;
1039 vm_clone = vlib_get_main ();
1040 nm_clone = &vm_clone->node_main;
1042 /* Re-clone error heap */
1043 u64 *old_counters = vm_clone->error_main.counters;
1044 u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
1046 clib_memcpy_fast (&vm_clone->error_main, &vm->error_main,
1047 sizeof (vm->error_main));
1048 j = vec_len (vm->error_main.counters) - 1;
1049 vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
1050 vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
1051 vm_clone->error_main.counters = old_counters;
1052 vm_clone->error_main.counters_last_clear = old_counters_all_clear;
1054 nm_clone = &vm_clone->node_main;
1055 vec_free (nm_clone->next_frames);
1056 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
1057 CLIB_CACHE_LINE_BYTES);
1059 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
1061 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
1062 u32 save_node_runtime_index;
1065 save_node_runtime_index = nf->node_runtime_index;
1066 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
1067 vlib_next_frame_init (nf);
1068 nf->node_runtime_index = save_node_runtime_index;
1069 nf->flags = save_flags;
1072 old_nodes_clone = nm_clone->nodes;
1073 nm_clone->nodes = 0;
1077 /* Allocate all nodes in single block for speed */
1079 clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*new_n_clone));
1080 for (j = 0; j < vec_len (nm->nodes); j++)
1082 vlib_node_t *old_n_clone;
1085 new_n = nm->nodes[j];
1086 old_n_clone = old_nodes_clone[j];
1088 clib_memcpy_fast (new_n_clone, new_n, sizeof (*new_n));
1089 /* none of the copied nodes have enqueue rights given out */
1090 new_n_clone->owner_node_index = VLIB_INVALID_NODE_INDEX;
1092 if (j >= vec_len (old_nodes_clone))
1094 /* new node, set to zero */
1095 clib_memset (&new_n_clone->stats_total, 0,
1096 sizeof (new_n_clone->stats_total));
1097 clib_memset (&new_n_clone->stats_last_clear, 0,
1098 sizeof (new_n_clone->stats_last_clear));
1102 /* Copy stats if the old data is valid */
1103 clib_memcpy_fast (&new_n_clone->stats_total,
1104 &old_n_clone->stats_total,
1105 sizeof (new_n_clone->stats_total));
1106 clib_memcpy_fast (&new_n_clone->stats_last_clear,
1107 &old_n_clone->stats_last_clear,
1108 sizeof (new_n_clone->stats_last_clear));
1110 /* keep previous node state */
1111 new_n_clone->state = old_n_clone->state;
1113 vec_add1 (nm_clone->nodes, new_n_clone);
1116 /* Free the old node clones */
1117 clib_mem_free (old_nodes_clone[0]);
1119 vec_free (old_nodes_clone);
1122 /* re-clone internal nodes */
1123 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL];
1124 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
1125 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
1126 CLIB_CACHE_LINE_BYTES);
1128 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
1130 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1131 rt->thread_index = vm_clone->thread_index;
1132 /* copy runtime_data, will be overwritten later for existing rt */
1133 if (n->runtime_data && n->runtime_data_bytes > 0)
1134 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1135 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1136 n->runtime_data_bytes));
1139 for (j = 0; j < vec_len (old_rt); j++)
1141 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1142 rt->state = old_rt[j].state;
1143 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1144 VLIB_NODE_RUNTIME_DATA_SIZE);
1149 /* re-clone input nodes */
1150 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
1151 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
1152 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
1153 CLIB_CACHE_LINE_BYTES);
1155 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
1157 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1158 rt->thread_index = vm_clone->thread_index;
1159 /* copy runtime_data, will be overwritten later for existing rt */
1160 if (n->runtime_data && n->runtime_data_bytes > 0)
1161 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1162 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1163 n->runtime_data_bytes));
1166 for (j = 0; j < vec_len (old_rt); j++)
1168 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1169 rt->state = old_rt[j].state;
1170 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1171 VLIB_NODE_RUNTIME_DATA_SIZE);
1176 nm_clone->processes = vec_dup_aligned (nm->processes,
1177 CLIB_CACHE_LINE_BYTES);
1181 vlib_worker_thread_node_runtime_update (void)
1184 * Make a note that we need to do a node runtime update
1185 * prior to releasing the barrier.
1187 vlib_global_main.need_vlib_worker_thread_node_runtime_update = 1;
1191 unformat_sched_policy (unformat_input_t * input, va_list * args)
1193 u32 *r = va_arg (*args, u32 *);
1196 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1197 foreach_sched_policy
1204 static clib_error_t *
1205 cpu_config (vlib_main_t * vm, unformat_input_t * input)
1207 vlib_thread_registration_t *tr;
1209 vlib_thread_main_t *tm = &vlib_thread_main;
1214 tm->thread_registrations_by_name = hash_create_string (0, sizeof (uword));
1216 tm->n_thread_stacks = 1; /* account for main thread */
1217 tm->sched_policy = ~0;
1218 tm->sched_priority = ~0;
1219 tm->main_lcore = ~0;
1225 hash_set_mem (tm->thread_registrations_by_name, tr->name, (uword) tr);
1229 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1231 if (unformat (input, "use-pthreads"))
1232 tm->use_pthreads = 1;
1233 else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1235 else if (unformat (input, "main-core %u", &tm->main_lcore))
1237 else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1239 else if (unformat (input, "coremask-%s %U", &name,
1240 unformat_bitmap_mask, &bitmap) ||
1241 unformat (input, "corelist-%s %U", &name,
1242 unformat_bitmap_list, &bitmap))
1244 p = hash_get_mem (tm->thread_registrations_by_name, name);
1246 return clib_error_return (0, "no such thread type '%s'", name);
1248 tr = (vlib_thread_registration_t *) p[0];
1250 if (tr->use_pthreads)
1251 return clib_error_return (0,
1252 "corelist cannot be set for '%s' threads",
1255 tr->coremask = bitmap;
1256 tr->count = clib_bitmap_count_set_bits (tr->coremask);
1260 (input, "scheduler-policy %U", unformat_sched_policy,
1263 else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1265 else if (unformat (input, "%s %u", &name, &count))
1267 p = hash_get_mem (tm->thread_registrations_by_name, name);
1269 return clib_error_return (0, "no such thread type 3 '%s'", name);
1271 tr = (vlib_thread_registration_t *) p[0];
1272 if (tr->fixed_count)
1273 return clib_error_return
1274 (0, "number of %s threads not configurable", tr->name);
1281 if (tm->sched_priority != ~0)
1283 if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1285 u32 prio_max = sched_get_priority_max (tm->sched_policy);
1286 u32 prio_min = sched_get_priority_min (tm->sched_policy);
1287 if (tm->sched_priority > prio_max)
1288 tm->sched_priority = prio_max;
1289 if (tm->sched_priority < prio_min)
1290 tm->sched_priority = prio_min;
1294 return clib_error_return
1296 "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1297 tm->sched_priority);
1302 if (!tm->thread_prefix)
1303 tm->thread_prefix = format (0, "vpp");
1307 tm->n_thread_stacks += tr->count;
1308 tm->n_pthreads += tr->count * tr->use_pthreads;
1309 tm->n_threads += tr->count * (tr->use_pthreads == 0);
1316 VLIB_EARLY_CONFIG_FUNCTION (cpu_config, "cpu");
1318 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1320 vnet_main_fixup (vlib_fork_fixup_t which)
1325 vlib_worker_thread_fork_fixup (vlib_fork_fixup_t which)
1327 vlib_main_t *vm = vlib_get_main ();
1329 if (vlib_mains == 0)
1332 ASSERT (vlib_get_thread_index () == 0);
1333 vlib_worker_thread_barrier_sync (vm);
1337 case VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX:
1338 vnet_main_fixup (VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX);
1344 vlib_worker_thread_barrier_release (vm);
1348 * Enforce minimum open time to minimize packet loss due to Rx overflow,
1349 * based on a test based heuristic that barrier should be open for at least
1350 * 3 time as long as it is closed (with an upper bound of 1ms because by that
1351 * point it is probably too late to make a difference)
1354 #ifndef BARRIER_MINIMUM_OPEN_LIMIT
1355 #define BARRIER_MINIMUM_OPEN_LIMIT 0.001
1358 #ifndef BARRIER_MINIMUM_OPEN_FACTOR
1359 #define BARRIER_MINIMUM_OPEN_FACTOR 3
1363 vlib_worker_thread_barrier_sync_int (vlib_main_t * vm)
1372 if (vec_len (vlib_mains) < 2)
1375 ASSERT (vlib_get_thread_index () == 0);
1377 count = vec_len (vlib_mains) - 1;
1379 /* Record entry relative to last close */
1380 now = vlib_time_now (vm);
1381 t_entry = now - vm->barrier_epoch;
1383 /* Tolerate recursive calls */
1384 if (++vlib_worker_threads[0].recursion_level > 1)
1386 barrier_trace_sync_rec (t_entry);
1390 vlib_worker_threads[0].barrier_sync_count++;
1392 /* Enforce minimum barrier open time to minimize packet loss */
1393 ASSERT (vm->barrier_no_close_before <= (now + BARRIER_MINIMUM_OPEN_LIMIT));
1397 now = vlib_time_now (vm);
1398 /* Barrier hold-down timer expired? */
1399 if (now >= vm->barrier_no_close_before)
1401 if ((vm->barrier_no_close_before - now)
1402 > (2.0 * BARRIER_MINIMUM_OPEN_LIMIT))
1404 clib_warning ("clock change: would have waited for %.4f seconds",
1405 (vm->barrier_no_close_before - now));
1409 /* Record time of closure */
1410 t_open = now - vm->barrier_epoch;
1411 vm->barrier_epoch = now;
1413 deadline = now + BARRIER_SYNC_TIMEOUT;
1415 *vlib_worker_threads->wait_at_barrier = 1;
1416 while (*vlib_worker_threads->workers_at_barrier != count)
1418 if ((now = vlib_time_now (vm)) > deadline)
1420 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1425 t_closed = now - vm->barrier_epoch;
1427 barrier_trace_sync (t_entry, t_open, t_closed);
1431 void vlib_stat_segment_lock (void) __attribute__ ((weak));
1433 vlib_stat_segment_lock (void)
1437 void vlib_stat_segment_unlock (void) __attribute__ ((weak));
1439 vlib_stat_segment_unlock (void)
1444 vlib_worker_thread_barrier_release (vlib_main_t * vm)
1451 f64 t_update_main = 0.0;
1452 int refork_needed = 0;
1454 if (vec_len (vlib_mains) < 2)
1457 ASSERT (vlib_get_thread_index () == 0);
1460 now = vlib_time_now (vm);
1461 t_entry = now - vm->barrier_epoch;
1463 if (--vlib_worker_threads[0].recursion_level > 0)
1465 barrier_trace_release_rec (t_entry);
1469 /* Update (all) node runtimes before releasing the barrier, if needed */
1470 if (vm->need_vlib_worker_thread_node_runtime_update)
1473 * Lock stat segment here, so we's safe when
1474 * rebuilding the stat segment node clones from the
1477 vlib_stat_segment_lock ();
1479 /* Do stats elements on main thread */
1480 worker_thread_node_runtime_update_internal ();
1481 vm->need_vlib_worker_thread_node_runtime_update = 0;
1483 /* Do per thread rebuilds in parallel */
1485 clib_atomic_fetch_add (vlib_worker_threads->node_reforks_required,
1486 (vec_len (vlib_mains) - 1));
1487 now = vlib_time_now (vm);
1488 t_update_main = now - vm->barrier_epoch;
1491 deadline = now + BARRIER_SYNC_TIMEOUT;
1493 *vlib_worker_threads->wait_at_barrier = 0;
1495 while (*vlib_worker_threads->workers_at_barrier > 0)
1497 if ((now = vlib_time_now (vm)) > deadline)
1499 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1504 /* Wait for reforks before continuing */
1507 now = vlib_time_now (vm);
1509 deadline = now + BARRIER_SYNC_TIMEOUT;
1511 while (*vlib_worker_threads->node_reforks_required > 0)
1513 if ((now = vlib_time_now (vm)) > deadline)
1515 fformat (stderr, "%s: worker thread refork deadlock\n",
1520 vlib_stat_segment_unlock ();
1523 t_closed_total = now - vm->barrier_epoch;
1525 minimum_open = t_closed_total * BARRIER_MINIMUM_OPEN_FACTOR;
1527 if (minimum_open > BARRIER_MINIMUM_OPEN_LIMIT)
1529 minimum_open = BARRIER_MINIMUM_OPEN_LIMIT;
1532 vm->barrier_no_close_before = now + minimum_open;
1534 /* Record barrier epoch (used to enforce minimum open time) */
1535 vm->barrier_epoch = now;
1537 barrier_trace_release (t_entry, t_closed_total, t_update_main);
1542 * Check the frame queue to see if any frames are available.
1543 * If so, pull the packets off the frames and put them to
1547 vlib_frame_queue_dequeue (vlib_main_t * vm, vlib_frame_queue_main_t * fqm)
1549 u32 thread_id = vm->thread_index;
1550 vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1551 vlib_frame_queue_elt_t *elt;
1560 ASSERT (vm == vlib_mains[thread_id]);
1562 if (PREDICT_FALSE (fqm->node_index == ~0))
1565 * Gather trace data for frame queues
1567 if (PREDICT_FALSE (fq->trace))
1569 frame_queue_trace_t *fqt;
1570 frame_queue_nelt_counter_t *fqh;
1573 fqt = &fqm->frame_queue_traces[thread_id];
1575 fqt->nelts = fq->nelts;
1576 fqt->head = fq->head;
1577 fqt->head_hint = fq->head_hint;
1578 fqt->tail = fq->tail;
1579 fqt->threshold = fq->vector_threshold;
1580 fqt->n_in_use = fqt->tail - fqt->head;
1581 if (fqt->n_in_use >= fqt->nelts)
1583 // if beyond max then use max
1584 fqt->n_in_use = fqt->nelts - 1;
1587 /* Record the number of elements in use in the histogram */
1588 fqh = &fqm->frame_queue_histogram[thread_id];
1589 fqh->count[fqt->n_in_use]++;
1591 /* Record a snapshot of the elements in use */
1592 for (elix = 0; elix < fqt->nelts; elix++)
1594 elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1595 if (1 || elt->valid)
1597 fqt->n_vectors[elix] = elt->n_vectors;
1605 if (fq->head == fq->tail)
1607 fq->head_hint = fq->head;
1611 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1615 fq->head_hint = fq->head;
1619 from = elt->buffer_index;
1620 msg_type = elt->msg_type;
1622 ASSERT (msg_type == VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME);
1623 ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1625 f = vlib_get_frame_to_node (vm, fqm->node_index);
1627 to = vlib_frame_vector_args (f);
1629 n_left_to_node = elt->n_vectors;
1631 while (n_left_to_node >= 4)
1639 n_left_to_node -= 4;
1642 while (n_left_to_node > 0)
1650 vectors += elt->n_vectors;
1651 f->n_vectors = elt->n_vectors;
1652 vlib_put_frame_to_node (vm, fqm->node_index, f);
1656 elt->msg_type = 0xfefefefe;
1657 CLIB_MEMORY_BARRIER ();
1662 * Limit the number of packets pushed into the graph
1664 if (vectors >= fq->vector_threshold)
1666 fq->head_hint = fq->head;
1675 vlib_worker_thread_fn (void *arg)
1677 vlib_worker_thread_t *w = (vlib_worker_thread_t *) arg;
1678 vlib_thread_main_t *tm = vlib_get_thread_main ();
1679 vlib_main_t *vm = vlib_get_main ();
1682 ASSERT (vm->thread_index == vlib_get_thread_index ());
1684 vlib_worker_thread_init (w);
1685 clib_time_init (&vm->clib_time);
1686 clib_mem_set_heap (w->thread_mheap);
1688 /* Wait until the dpdk init sequence is complete */
1689 while (tm->extern_thread_mgmt && tm->worker_thread_release == 0)
1690 vlib_worker_thread_barrier_check ();
1692 e = vlib_call_init_exit_functions
1693 (vm, vm->worker_init_function_registrations, 1 /* call_once */ );
1695 clib_error_report (e);
1697 vlib_worker_loop (vm);
1701 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1704 .function = vlib_worker_thread_fn,
1709 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1711 vlib_thread_main_t *tm = vlib_get_thread_main ();
1712 vlib_frame_queue_main_t *fqm;
1713 vlib_frame_queue_t *fq;
1716 if (frame_queue_nelts == 0)
1717 frame_queue_nelts = FRAME_QUEUE_NELTS;
1719 ASSERT (frame_queue_nelts >= 8);
1721 vec_add2 (tm->frame_queue_mains, fqm, 1);
1723 fqm->node_index = node_index;
1724 fqm->frame_queue_nelts = frame_queue_nelts;
1725 fqm->queue_hi_thresh = frame_queue_nelts - 2;
1727 vec_validate (fqm->vlib_frame_queues, tm->n_vlib_mains - 1);
1728 vec_validate (fqm->per_thread_data, tm->n_vlib_mains - 1);
1729 _vec_len (fqm->vlib_frame_queues) = 0;
1730 for (i = 0; i < tm->n_vlib_mains; i++)
1732 vlib_frame_queue_per_thread_data_t *ptd;
1733 fq = vlib_frame_queue_alloc (frame_queue_nelts);
1734 vec_add1 (fqm->vlib_frame_queues, fq);
1736 ptd = vec_elt_at_index (fqm->per_thread_data, i);
1737 vec_validate (ptd->handoff_queue_elt_by_thread_index,
1738 tm->n_vlib_mains - 1);
1739 vec_validate_init_empty (ptd->congested_handoff_queue_by_thread_index,
1740 tm->n_vlib_mains - 1,
1741 (vlib_frame_queue_t *) (~0));
1744 return (fqm - tm->frame_queue_mains);
1748 vlib_thread_cb_register (struct vlib_main_t *vm, vlib_thread_callbacks_t * cb)
1750 vlib_thread_main_t *tm = vlib_get_thread_main ();
1752 if (tm->extern_thread_mgmt)
1755 tm->cb.vlib_launch_thread_cb = cb->vlib_launch_thread_cb;
1756 tm->extern_thread_mgmt = 1;
1761 vlib_process_signal_event_mt_helper (vlib_process_signal_event_mt_args_t *
1764 ASSERT (vlib_get_thread_index () == 0);
1765 vlib_process_signal_event (vlib_get_main (), args->node_index,
1766 args->type_opaque, args->data);
1769 void *rpc_call_main_thread_cb_fn;
1772 vlib_rpc_call_main_thread (void *callback, u8 * args, u32 arg_size)
1774 if (rpc_call_main_thread_cb_fn)
1776 void (*fp) (void *, u8 *, u32) = rpc_call_main_thread_cb_fn;
1777 (*fp) (callback, args, arg_size);
1780 clib_warning ("BUG: rpc_call_main_thread_cb_fn NULL!");
1784 threads_init (vlib_main_t * vm)
1789 VLIB_INIT_FUNCTION (threads_init);
1792 * fd.io coding-style-patch-verification: ON
1795 * eval: (c-set-style "gnu")