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 <vlib/vlib.h>
22 #include <vlib/threads.h>
23 #include <vlib/unix/cj.h>
25 DECLARE_CJ_GLOBAL_LOG;
27 #define FRAME_QUEUE_NELTS 32
35 vlib_worker_thread_t *vlib_worker_threads;
36 vlib_thread_main_t vlib_thread_main;
39 * Barrier tracing can be enabled on a normal build to collect information
40 * on barrier use, including timings and call stacks. Deliberately not
41 * keyed off CLIB_DEBUG, because that can add significant overhead which
42 * imapacts observed timings.
45 #ifdef BARRIER_TRACING
47 * Output of barrier tracing can be to syslog or elog as suits
49 #ifdef BARRIER_TRACING_ELOG
51 elog_id_for_msg_name (const char *msg_name)
58 h = hash_create_string (0, sizeof (uword));
60 p = hash_get_mem (h, msg_name);
63 r = elog_string (&vlib_global_main.elog_main, "%s", msg_name);
65 name_copy = format (0, "%s%c", msg_name, 0);
67 hash_set_mem (h, name_copy, r);
73 * elog Barrier trace functions, which are nulled out if BARRIER_TRACING isn't
78 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
81 ELOG_TYPE_DECLARE (e) =
83 .format = "barrier <%d#%s(O:%dus:%dus)(%dus)",
84 .format_args = "i4T4i4i4i4",
89 u32 count, caller, t_entry, t_open, t_closed;
92 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
93 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
94 ed->caller = elog_id_for_msg_name (vlib_worker_threads[0].barrier_caller);
95 ed->t_entry = (int) (1000000.0 * t_entry);
96 ed->t_open = (int) (1000000.0 * t_open);
97 ed->t_closed = (int) (1000000.0 * t_closed);
101 barrier_trace_sync_rec (f64 t_entry)
104 ELOG_TYPE_DECLARE (e) =
106 .format = "barrier <%d(%dus)%s",
107 .format_args = "i4i4T4",
112 u32 depth, t_entry, caller;
115 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
116 ed->depth = (int) vlib_worker_threads[0].recursion_level - 1;
117 ed->t_entry = (int) (1000000.0 * t_entry);
118 ed->caller = elog_id_for_msg_name (vlib_worker_threads[0].barrier_caller);
122 barrier_trace_release_rec (f64 t_entry)
125 ELOG_TYPE_DECLARE (e) =
127 .format = "barrier (%dus)%d>",
128 .format_args = "i4i4",
136 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
137 ed->t_entry = (int) (1000000.0 * t_entry);
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)
145 ELOG_TYPE_DECLARE (e) =
147 .format = "barrier (%dus){%d}(C:%dus)#%d>",
148 .format_args = "i4i4i4i4",
153 u32 t_entry, t_update_main, t_closed_total, count;
156 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
157 ed->t_entry = (int) (1000000.0 * t_entry);
158 ed->t_update_main = (int) (1000000.0 * t_update_main);
159 ed->t_closed_total = (int) (1000000.0 * t_closed_total);
160 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
162 /* Reset context for next trace */
163 vlib_worker_threads[0].barrier_context = NULL;
166 char barrier_trace[65536];
167 char *btp = barrier_trace;
170 * syslog Barrier trace functions, which are nulled out if BARRIER_TRACING
176 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
178 btp += sprintf (btp, "<%u#%s",
179 (unsigned int) vlib_worker_threads[0].barrier_sync_count,
180 vlib_worker_threads[0].barrier_caller);
182 if (vlib_worker_threads[0].barrier_context)
184 btp += sprintf (btp, "[%s]", vlib_worker_threads[0].barrier_context);
188 btp += sprintf (btp, "(O:%dus:%dus)(%dus):",
189 (int) (1000000.0 * t_entry),
190 (int) (1000000.0 * t_open), (int) (1000000.0 * t_closed));
195 barrier_trace_sync_rec (f64 t_entry)
197 btp += sprintf (btp, "<%u(%dus)%s:",
198 (int) vlib_worker_threads[0].recursion_level - 1,
199 (int) (1000000.0 * t_entry),
200 vlib_worker_threads[0].barrier_caller);
204 barrier_trace_release_rec (f64 t_entry)
206 btp += sprintf (btp, ":(%dus)%u>", (int) (1000000.0 * t_entry),
207 (int) vlib_worker_threads[0].recursion_level);
211 barrier_trace_release (f64 t_entry, f64 t_closed_total, f64 t_update_main)
214 btp += sprintf (btp, ":(%dus)", (int) (1000000.0 * t_entry));
215 if (t_update_main > 0)
217 btp += sprintf (btp, "{%dus}", (int) (1000000.0 * t_update_main));
220 btp += sprintf (btp, "(C:%dus)#%u>",
221 (int) (1000000.0 * t_closed_total),
222 (int) vlib_worker_threads[0].barrier_sync_count);
224 /* Dump buffer to syslog, and reset for next trace */
225 fformat (stderr, "BTRC %s\n", barrier_trace);
227 vlib_worker_threads[0].barrier_context = NULL;
232 /* Null functions for default case where barrier tracing isn't used */
234 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
239 barrier_trace_sync_rec (f64 t_entry)
244 barrier_trace_release_rec (f64 t_entry)
249 barrier_trace_release (f64 t_entry, f64 t_closed_total, f64 t_update_main)
255 os_get_nthreads (void)
259 len = vec_len (vlib_thread_stacks);
267 vlib_set_thread_name (char *name)
269 int pthread_setname_np (pthread_t __target_thread, const char *__name);
271 pthread_t thread = pthread_self ();
275 rv = pthread_setname_np (thread, name);
277 clib_warning ("pthread_setname_np returned %d", rv);
282 sort_registrations_by_no_clone (void *a0, void *a1)
284 vlib_thread_registration_t **tr0 = a0;
285 vlib_thread_registration_t **tr1 = a1;
287 return ((i32) ((*tr0)->no_data_structure_clone)
288 - ((i32) ((*tr1)->no_data_structure_clone)));
292 clib_sysfs_list_to_bitmap (char *filename)
297 fp = fopen (filename, "r");
302 vec_validate (buffer, 256 - 1);
303 if (fgets ((char *) buffer, 256, fp))
306 unformat_init_string (&in, (char *) buffer,
307 strlen ((char *) buffer));
308 if (unformat (&in, "%U", unformat_bitmap_list, &r) != 1)
309 clib_warning ("unformat_bitmap_list failed");
319 /* Called early in the init sequence */
322 vlib_thread_init (vlib_main_t * vm)
324 vlib_thread_main_t *tm = &vlib_thread_main;
325 vlib_worker_thread_t *w;
326 vlib_thread_registration_t *tr;
327 u32 n_vlib_mains = 1;
332 /* get bitmaps of active cpu cores and sockets */
333 tm->cpu_core_bitmap =
334 clib_sysfs_list_to_bitmap ("/sys/devices/system/cpu/online");
335 tm->cpu_socket_bitmap =
336 clib_sysfs_list_to_bitmap ("/sys/devices/system/node/online");
338 avail_cpu = clib_bitmap_dup (tm->cpu_core_bitmap);
340 /* by default we skip core 0, unless it is the only one available */
341 if (tm->skip_cores == ~0)
342 tm->skip_cores = (clib_bitmap_count_set_bits (avail_cpu) < 2) ? 0 : 1;
345 for (i = 0; i < tm->skip_cores; i++)
347 uword c = clib_bitmap_first_set (avail_cpu);
349 return clib_error_return (0, "no available cpus to skip");
351 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
354 /* grab cpu for main thread */
357 tm->main_lcore = clib_bitmap_first_set (avail_cpu);
358 if (tm->main_lcore == (u8) ~ 0)
359 return clib_error_return (0, "no available cpus to be used for the"
364 if (clib_bitmap_get (avail_cpu, tm->main_lcore) == 0)
365 return clib_error_return (0, "cpu %u is not available to be used"
366 " for the main thread", tm->main_lcore);
368 avail_cpu = clib_bitmap_set (avail_cpu, tm->main_lcore, 0);
370 /* assume that there is socket 0 only if there is no data from sysfs */
371 if (!tm->cpu_socket_bitmap)
372 tm->cpu_socket_bitmap = clib_bitmap_set (0, 0, 1);
374 /* pin main thread to main_lcore */
375 if (tm->cb.vlib_thread_set_lcore_cb)
377 tm->cb.vlib_thread_set_lcore_cb (0, tm->main_lcore);
380 /* as many threads as stacks... */
381 vec_validate_aligned (vlib_worker_threads, vec_len (vlib_thread_stacks) - 1,
382 CLIB_CACHE_LINE_BYTES);
384 /* Preallocate thread 0 */
385 _vec_len (vlib_worker_threads) = 1;
386 w = vlib_worker_threads;
387 w->thread_mheap = clib_mem_get_heap ();
388 w->thread_stack = vlib_thread_stacks[0];
389 w->lcore_id = tm->main_lcore;
390 w->lwp = syscall (SYS_gettid);
391 w->thread_id = pthread_self ();
392 tm->n_vlib_mains = 1;
394 if (tm->sched_policy != ~0)
396 struct sched_param sched_param;
397 if (!sched_getparam (w->lwp, &sched_param))
399 if (tm->sched_priority != ~0)
400 sched_param.sched_priority = tm->sched_priority;
401 sched_setscheduler (w->lwp, tm->sched_policy, &sched_param);
405 /* assign threads to cores and set n_vlib_mains */
410 vec_add1 (tm->registrations, tr);
414 vec_sort_with_function (tm->registrations, sort_registrations_by_no_clone);
416 for (i = 0; i < vec_len (tm->registrations); i++)
419 tr = tm->registrations[i];
420 tr->first_index = first_index;
421 first_index += tr->count;
422 n_vlib_mains += (tr->no_data_structure_clone == 0) ? tr->count : 0;
424 /* construct coremask */
425 if (tr->use_pthreads || !tr->count)
432 clib_bitmap_foreach (c, tr->coremask, ({
433 if (clib_bitmap_get(avail_cpu, c) == 0)
434 return clib_error_return (0, "cpu %u is not available to be used"
435 " for the '%s' thread",c, tr->name);
437 avail_cpu = clib_bitmap_set(avail_cpu, c, 0);
444 for (j = 0; j < tr->count; j++)
446 uword c = clib_bitmap_first_set (avail_cpu);
448 return clib_error_return (0,
449 "no available cpus to be used for"
450 " the '%s' thread", tr->name);
452 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
453 tr->coremask = clib_bitmap_set (tr->coremask, c, 1);
458 clib_bitmap_free (avail_cpu);
460 tm->n_vlib_mains = n_vlib_mains;
462 vec_validate_aligned (vlib_worker_threads, first_index - 1,
463 CLIB_CACHE_LINE_BYTES);
469 vlib_frame_queue_alloc (int nelts)
471 vlib_frame_queue_t *fq;
473 fq = clib_mem_alloc_aligned (sizeof (*fq), CLIB_CACHE_LINE_BYTES);
474 memset (fq, 0, sizeof (*fq));
476 fq->vector_threshold = 128; // packets
477 vec_validate_aligned (fq->elts, nelts - 1, CLIB_CACHE_LINE_BYTES);
481 if (((uword) & fq->tail) & (CLIB_CACHE_LINE_BYTES - 1))
482 fformat (stderr, "WARNING: fq->tail unaligned\n");
483 if (((uword) & fq->head) & (CLIB_CACHE_LINE_BYTES - 1))
484 fformat (stderr, "WARNING: fq->head unaligned\n");
485 if (((uword) fq->elts) & (CLIB_CACHE_LINE_BYTES - 1))
486 fformat (stderr, "WARNING: fq->elts unaligned\n");
488 if (sizeof (fq->elts[0]) % CLIB_CACHE_LINE_BYTES)
489 fformat (stderr, "WARNING: fq->elts[0] size %d\n",
490 sizeof (fq->elts[0]));
491 if (nelts & (nelts - 1))
493 fformat (stderr, "FATAL: nelts MUST be a power of 2\n");
501 void vl_msg_api_handler_no_free (void *) __attribute__ ((weak));
503 vl_msg_api_handler_no_free (void *v)
507 /* Turned off, save as reference material... */
510 vlib_frame_queue_dequeue_internal (int thread_id,
511 vlib_main_t * vm, vlib_node_main_t * nm)
513 vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
514 vlib_frame_queue_elt_t *elt;
516 vlib_pending_frame_t *p;
517 vlib_node_runtime_t *r;
518 u32 node_runtime_index;
523 ASSERT (vm == vlib_mains[thread_id]);
527 if (fq->head == fq->tail)
530 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
535 before = clib_cpu_time_now ();
538 node_runtime_index = elt->node_runtime_index;
539 msg_type = elt->msg_type;
543 case VLIB_FRAME_QUEUE_ELT_FREE_BUFFERS:
544 vlib_buffer_free (vm, vlib_frame_vector_args (f), f->n_vectors);
545 /* note fallthrough... */
546 case VLIB_FRAME_QUEUE_ELT_FREE_FRAME:
547 r = vec_elt_at_index (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
549 vlib_frame_free (vm, r, f);
551 case VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME:
552 vec_add2 (vm->node_main.pending_frames, p, 1);
553 f->flags |= (VLIB_FRAME_PENDING | VLIB_FRAME_FREE_AFTER_DISPATCH);
554 p->node_runtime_index = elt->node_runtime_index;
555 p->frame_index = vlib_frame_index (vm, f);
556 p->next_frame_index = VLIB_PENDING_FRAME_NO_NEXT_FRAME;
557 fq->dequeue_vectors += (u64) f->n_vectors;
559 case VLIB_FRAME_QUEUE_ELT_API_MSG:
560 vl_msg_api_handler_no_free (f);
563 clib_warning ("bogus frame queue message, type %d", msg_type);
568 fq->dequeue_ticks += clib_cpu_time_now () - before;
569 CLIB_MEMORY_BARRIER ();
578 vlib_frame_queue_dequeue (int thread_id,
579 vlib_main_t * vm, vlib_node_main_t * nm)
581 return vlib_frame_queue_dequeue_internal (thread_id, vm, nm);
585 vlib_frame_queue_enqueue (vlib_main_t * vm, u32 node_runtime_index,
586 u32 frame_queue_index, vlib_frame_t * frame,
587 vlib_frame_queue_msg_type_t type)
589 vlib_frame_queue_t *fq = vlib_frame_queues[frame_queue_index];
590 vlib_frame_queue_elt_t *elt;
593 u64 before = clib_cpu_time_now ();
597 new_tail = __sync_add_and_fetch (&fq->tail, 1);
599 /* Wait until a ring slot is available */
600 while (new_tail >= fq->head + fq->nelts)
602 f64 b4 = vlib_time_now_ticks (vm, before);
603 vlib_worker_thread_barrier_check (vm, b4);
604 /* Bad idea. Dequeue -> enqueue -> dequeue -> trouble */
605 // vlib_frame_queue_dequeue (vm->thread_index, vm, nm);
608 elt = fq->elts + (new_tail & (fq->nelts - 1));
610 /* this would be very bad... */
615 /* Once we enqueue the frame, frame->n_vectors is owned elsewhere... */
616 save_count = frame->n_vectors;
619 elt->node_runtime_index = node_runtime_index;
620 elt->msg_type = type;
621 CLIB_MEMORY_BARRIER ();
628 /* To be called by vlib worker threads upon startup */
630 vlib_worker_thread_init (vlib_worker_thread_t * w)
632 vlib_thread_main_t *tm = vlib_get_thread_main ();
635 * Note: disabling signals in worker threads as follows
636 * prevents the api post-mortem dump scheme from working
640 * pthread_sigmask (SIG_SETMASK, &s, 0);
644 clib_mem_set_heap (w->thread_mheap);
646 if (vec_len (tm->thread_prefix) && w->registration->short_name)
648 w->name = format (0, "%v_%s_%d%c", tm->thread_prefix,
649 w->registration->short_name, w->instance_id, '\0');
650 vlib_set_thread_name ((char *) w->name);
653 if (!w->registration->use_pthreads)
656 /* Initial barrier sync, for both worker and i/o threads */
657 clib_smp_atomic_add (vlib_worker_threads->workers_at_barrier, 1);
659 while (*vlib_worker_threads->wait_at_barrier)
662 clib_smp_atomic_add (vlib_worker_threads->workers_at_barrier, -1);
667 vlib_worker_thread_bootstrap_fn (void *arg)
670 vlib_worker_thread_t *w = arg;
672 w->lwp = syscall (SYS_gettid);
673 w->thread_id = pthread_self ();
675 __os_thread_index = w - vlib_worker_threads;
677 rv = (void *) clib_calljmp
678 ((uword (*)(uword)) w->thread_function,
679 (uword) arg, w->thread_stack + VLIB_THREAD_STACK_SIZE);
680 /* NOTREACHED, we hope */
684 static clib_error_t *
685 vlib_launch_thread_int (void *fp, vlib_worker_thread_t * w, unsigned lcore_id)
687 vlib_thread_main_t *tm = &vlib_thread_main;
688 void *(*fp_arg) (void *) = fp;
690 w->lcore_id = lcore_id;
691 if (tm->cb.vlib_launch_thread_cb && !w->registration->use_pthreads)
692 return tm->cb.vlib_launch_thread_cb (fp, (void *) w, lcore_id);
698 CPU_SET (lcore_id, &cpuset);
700 if (pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w))
701 return clib_error_return_unix (0, "pthread_create");
703 if (pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset))
704 return clib_error_return_unix (0, "pthread_setaffinity_np");
710 static clib_error_t *
711 start_workers (vlib_main_t * vm)
714 vlib_worker_thread_t *w;
715 vlib_main_t *vm_clone;
717 vlib_thread_main_t *tm = &vlib_thread_main;
718 vlib_thread_registration_t *tr;
719 vlib_node_runtime_t *rt;
720 u32 n_vlib_mains = tm->n_vlib_mains;
721 u32 worker_thread_index;
722 u8 *main_heap = clib_mem_get_per_cpu_heap ();
723 mheap_t *main_heap_header = mheap_header (main_heap);
725 vec_reset_length (vlib_worker_threads);
727 /* Set up the main thread */
728 vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
729 w->elog_track.name = "main thread";
730 elog_track_register (&vm->elog_main, &w->elog_track);
732 if (vec_len (tm->thread_prefix))
734 w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
735 vlib_set_thread_name ((char *) w->name);
739 * Truth of the matter: we always use at least two
740 * threads. So, make the main heap thread-safe
741 * and make the event log thread-safe.
743 main_heap_header->flags |= MHEAP_FLAG_THREAD_SAFE;
745 clib_mem_alloc_aligned (CLIB_CACHE_LINE_BYTES, CLIB_CACHE_LINE_BYTES);
746 vm->elog_main.lock[0] = 0;
748 if (n_vlib_mains > 1)
750 /* Replace hand-crafted length-1 vector with a real vector */
753 vec_validate_aligned (vlib_mains, tm->n_vlib_mains - 1,
754 CLIB_CACHE_LINE_BYTES);
755 _vec_len (vlib_mains) = 0;
756 vec_add1_aligned (vlib_mains, vm, CLIB_CACHE_LINE_BYTES);
758 vlib_worker_threads->wait_at_barrier =
759 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
760 vlib_worker_threads->workers_at_barrier =
761 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
763 vlib_worker_threads->node_reforks_required =
764 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
766 /* Ask for an initial barrier sync */
767 *vlib_worker_threads->workers_at_barrier = 0;
768 *vlib_worker_threads->wait_at_barrier = 1;
770 /* Without update or refork */
771 *vlib_worker_threads->node_reforks_required = 0;
772 vm->need_vlib_worker_thread_node_runtime_update = 0;
775 vm->barrier_epoch = 0;
776 vm->barrier_no_close_before = 0;
778 worker_thread_index = 1;
780 for (i = 0; i < vec_len (tm->registrations); i++)
782 vlib_node_main_t *nm, *nm_clone;
783 vlib_buffer_free_list_t *fl_clone, *fl_orig;
784 vlib_buffer_free_list_t *orig_freelist_pool;
787 tr = tm->registrations[i];
792 for (k = 0; k < tr->count; k++)
796 vec_add2 (vlib_worker_threads, w, 1);
799 mheap_alloc (0 /* use VM */ , tr->mheap_size);
801 w->thread_mheap = main_heap;
804 vlib_thread_stack_init (w - vlib_worker_threads);
805 w->thread_function = tr->function;
806 w->thread_function_arg = w;
808 w->registration = tr;
811 (char *) format (0, "%s %d", tr->name, k + 1);
812 vec_add1 (w->elog_track.name, 0);
813 elog_track_register (&vm->elog_main, &w->elog_track);
815 if (tr->no_data_structure_clone)
818 /* Fork vlib_global_main et al. Look for bugs here */
819 oldheap = clib_mem_set_heap (w->thread_mheap);
821 vm_clone = clib_mem_alloc_aligned (sizeof (*vm_clone),
822 CLIB_CACHE_LINE_BYTES);
823 clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
825 vm_clone->thread_index = worker_thread_index;
826 vm_clone->heap_base = w->thread_mheap;
827 vm_clone->init_functions_called =
828 hash_create (0, /* value bytes */ 0);
829 vm_clone->pending_rpc_requests = 0;
830 vec_validate (vm_clone->pending_rpc_requests, 0);
831 _vec_len (vm_clone->pending_rpc_requests) = 0;
832 memset (&vm_clone->random_buffer, 0,
833 sizeof (vm_clone->random_buffer));
835 nm = &vlib_mains[0]->node_main;
836 nm_clone = &vm_clone->node_main;
837 /* fork next frames array, preserving node runtime indices */
838 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
839 CLIB_CACHE_LINE_BYTES);
840 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
842 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
843 u32 save_node_runtime_index;
846 save_node_runtime_index = nf->node_runtime_index;
847 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
848 vlib_next_frame_init (nf);
849 nf->node_runtime_index = save_node_runtime_index;
850 nf->flags = save_flags;
853 /* fork the frame dispatch queue */
854 nm_clone->pending_frames = 0;
855 vec_validate (nm_clone->pending_frames, 10); /* $$$$$?????? */
856 _vec_len (nm_clone->pending_frames) = 0;
861 /* Allocate all nodes in single block for speed */
862 n = clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*n));
864 for (j = 0; j < vec_len (nm->nodes); j++)
866 clib_memcpy (n, nm->nodes[j], sizeof (*n));
867 /* none of the copied nodes have enqueue rights given out */
868 n->owner_node_index = VLIB_INVALID_NODE_INDEX;
869 memset (&n->stats_total, 0, sizeof (n->stats_total));
870 memset (&n->stats_last_clear, 0,
871 sizeof (n->stats_last_clear));
872 vec_add1 (nm_clone->nodes, n);
875 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
876 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
877 CLIB_CACHE_LINE_BYTES);
879 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
881 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
882 rt->thread_index = vm_clone->thread_index;
883 /* copy initial runtime_data from node */
884 if (n->runtime_data && n->runtime_data_bytes > 0)
885 clib_memcpy (rt->runtime_data, n->runtime_data,
886 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
887 n->runtime_data_bytes));
890 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
891 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
892 CLIB_CACHE_LINE_BYTES);
893 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
895 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
896 rt->thread_index = vm_clone->thread_index;
897 /* copy initial runtime_data from node */
898 if (n->runtime_data && n->runtime_data_bytes > 0)
899 clib_memcpy (rt->runtime_data, n->runtime_data,
900 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
901 n->runtime_data_bytes));
904 nm_clone->processes = vec_dup_aligned (nm->processes,
905 CLIB_CACHE_LINE_BYTES);
907 /* zap the (per worker) frame freelists, etc */
908 nm_clone->frame_sizes = 0;
909 nm_clone->frame_size_hash = hash_create (0, sizeof (uword));
911 /* Packet trace buffers are guaranteed to be empty, nothing to do here */
913 clib_mem_set_heap (oldheap);
914 vec_add1_aligned (vlib_mains, vm_clone, CLIB_CACHE_LINE_BYTES);
916 vm_clone->error_main.counters = vec_dup_aligned
917 (vlib_mains[0]->error_main.counters, CLIB_CACHE_LINE_BYTES);
918 vm_clone->error_main.counters_last_clear = vec_dup_aligned
919 (vlib_mains[0]->error_main.counters_last_clear,
920 CLIB_CACHE_LINE_BYTES);
922 /* Fork the vlib_buffer_main_t free lists, etc. */
923 orig_freelist_pool = vm_clone->buffer_free_list_pool;
924 vm_clone->buffer_free_list_pool = 0;
927 pool_foreach (fl_orig, orig_freelist_pool,
929 pool_get_aligned (vm_clone->buffer_free_list_pool,
930 fl_clone, CLIB_CACHE_LINE_BYTES);
931 ASSERT (fl_orig - orig_freelist_pool
932 == fl_clone - vm_clone->buffer_free_list_pool);
934 fl_clone[0] = fl_orig[0];
935 fl_clone->buffers = 0;
936 fl_clone->n_alloc = 0;
940 worker_thread_index++;
946 /* only have non-data-structure copy threads to create... */
947 for (i = 0; i < vec_len (tm->registrations); i++)
949 tr = tm->registrations[i];
951 for (j = 0; j < tr->count; j++)
953 vec_add2 (vlib_worker_threads, w, 1);
956 mheap_alloc (0 /* use VM */ , tr->mheap_size);
958 w->thread_mheap = main_heap;
960 vlib_thread_stack_init (w - vlib_worker_threads);
961 w->thread_function = tr->function;
962 w->thread_function_arg = w;
965 (char *) format (0, "%s %d", tr->name, j + 1);
966 w->registration = tr;
967 vec_add1 (w->elog_track.name, 0);
968 elog_track_register (&vm->elog_main, &w->elog_track);
973 worker_thread_index = 1;
975 for (i = 0; i < vec_len (tm->registrations); i++)
980 tr = tm->registrations[i];
982 if (tr->use_pthreads || tm->use_pthreads)
984 for (j = 0; j < tr->count; j++)
986 w = vlib_worker_threads + worker_thread_index++;
987 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
990 clib_error_report (err);
997 clib_bitmap_foreach (c, tr->coremask, ({
998 w = vlib_worker_threads + worker_thread_index++;
999 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
1002 clib_error_report (err);
1007 vlib_worker_thread_barrier_sync (vm);
1008 vlib_worker_thread_barrier_release (vm);
1012 VLIB_MAIN_LOOP_ENTER_FUNCTION (start_workers);
1016 worker_thread_node_runtime_update_internal (void)
1020 vlib_node_main_t *nm, *nm_clone;
1021 vlib_main_t *vm_clone;
1022 vlib_node_runtime_t *rt;
1024 vlib_node_runtime_sync_stats (vlib_main_t * vm,
1025 vlib_node_runtime_t * r,
1027 uword n_vectors, uword n_clocks);
1029 ASSERT (vlib_get_thread_index () == 0);
1032 nm = &vm->node_main;
1034 ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
1037 * Scrape all runtime stats, so we don't lose node runtime(s) with
1038 * pending counts, or throw away worker / io thread counts.
1040 for (j = 0; j < vec_len (nm->nodes); j++)
1044 vlib_node_sync_stats (vm, n);
1047 for (i = 1; i < vec_len (vlib_mains); i++)
1051 vm_clone = vlib_mains[i];
1052 nm_clone = &vm_clone->node_main;
1054 for (j = 0; j < vec_len (nm_clone->nodes); j++)
1056 n = nm_clone->nodes[j];
1058 rt = vlib_node_get_runtime (vm_clone, n->index);
1059 vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
1063 /* Per-worker clone rebuilds are now done on each thread */
1068 vlib_worker_thread_node_refork (void)
1070 vlib_main_t *vm, *vm_clone;
1071 vlib_node_main_t *nm, *nm_clone;
1072 vlib_node_t **old_nodes_clone;
1073 vlib_node_runtime_t *rt, *old_rt;
1075 vlib_node_t *new_n_clone;
1080 nm = &vm->node_main;
1081 vm_clone = vlib_get_main ();
1082 nm_clone = &vm_clone->node_main;
1084 /* Re-clone error heap */
1085 u64 *old_counters = vm_clone->error_main.counters;
1086 u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
1088 clib_memcpy (&vm_clone->error_main, &vm->error_main,
1089 sizeof (vm->error_main));
1090 j = vec_len (vm->error_main.counters) - 1;
1091 vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
1092 vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
1093 vm_clone->error_main.counters = old_counters;
1094 vm_clone->error_main.counters_last_clear = old_counters_all_clear;
1096 nm_clone = &vm_clone->node_main;
1097 vec_free (nm_clone->next_frames);
1098 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
1099 CLIB_CACHE_LINE_BYTES);
1101 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
1103 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
1104 u32 save_node_runtime_index;
1107 save_node_runtime_index = nf->node_runtime_index;
1108 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
1109 vlib_next_frame_init (nf);
1110 nf->node_runtime_index = save_node_runtime_index;
1111 nf->flags = save_flags;
1114 old_nodes_clone = nm_clone->nodes;
1115 nm_clone->nodes = 0;
1119 /* Allocate all nodes in single block for speed */
1121 clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*new_n_clone));
1122 for (j = 0; j < vec_len (nm->nodes); j++)
1124 vlib_node_t *old_n_clone;
1127 new_n = nm->nodes[j];
1128 old_n_clone = old_nodes_clone[j];
1130 clib_memcpy (new_n_clone, new_n, sizeof (*new_n));
1131 /* none of the copied nodes have enqueue rights given out */
1132 new_n_clone->owner_node_index = VLIB_INVALID_NODE_INDEX;
1134 if (j >= vec_len (old_nodes_clone))
1136 /* new node, set to zero */
1137 memset (&new_n_clone->stats_total, 0,
1138 sizeof (new_n_clone->stats_total));
1139 memset (&new_n_clone->stats_last_clear, 0,
1140 sizeof (new_n_clone->stats_last_clear));
1144 /* Copy stats if the old data is valid */
1145 clib_memcpy (&new_n_clone->stats_total,
1146 &old_n_clone->stats_total,
1147 sizeof (new_n_clone->stats_total));
1148 clib_memcpy (&new_n_clone->stats_last_clear,
1149 &old_n_clone->stats_last_clear,
1150 sizeof (new_n_clone->stats_last_clear));
1152 /* keep previous node state */
1153 new_n_clone->state = old_n_clone->state;
1155 vec_add1 (nm_clone->nodes, new_n_clone);
1158 /* Free the old node clones */
1159 clib_mem_free (old_nodes_clone[0]);
1161 vec_free (old_nodes_clone);
1164 /* re-clone internal nodes */
1165 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL];
1166 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
1167 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
1168 CLIB_CACHE_LINE_BYTES);
1170 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
1172 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1173 rt->thread_index = vm_clone->thread_index;
1174 /* copy runtime_data, will be overwritten later for existing rt */
1175 if (n->runtime_data && n->runtime_data_bytes > 0)
1176 clib_memcpy (rt->runtime_data, n->runtime_data,
1177 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1178 n->runtime_data_bytes));
1181 for (j = 0; j < vec_len (old_rt); j++)
1183 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1184 rt->state = old_rt[j].state;
1185 clib_memcpy (rt->runtime_data, old_rt[j].runtime_data,
1186 VLIB_NODE_RUNTIME_DATA_SIZE);
1191 /* re-clone input nodes */
1192 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
1193 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
1194 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
1195 CLIB_CACHE_LINE_BYTES);
1197 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
1199 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1200 rt->thread_index = vm_clone->thread_index;
1201 /* copy runtime_data, will be overwritten later for existing rt */
1202 if (n->runtime_data && n->runtime_data_bytes > 0)
1203 clib_memcpy (rt->runtime_data, n->runtime_data,
1204 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1205 n->runtime_data_bytes));
1208 for (j = 0; j < vec_len (old_rt); j++)
1210 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1211 rt->state = old_rt[j].state;
1212 clib_memcpy (rt->runtime_data, old_rt[j].runtime_data,
1213 VLIB_NODE_RUNTIME_DATA_SIZE);
1218 nm_clone->processes = vec_dup_aligned (nm->processes,
1219 CLIB_CACHE_LINE_BYTES);
1223 vlib_worker_thread_node_runtime_update (void)
1226 * Make a note that we need to do a node runtime update
1227 * prior to releasing the barrier.
1229 vlib_global_main.need_vlib_worker_thread_node_runtime_update = 1;
1233 unformat_sched_policy (unformat_input_t * input, va_list * args)
1235 u32 *r = va_arg (*args, u32 *);
1238 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1239 foreach_sched_policy
1246 static clib_error_t *
1247 cpu_config (vlib_main_t * vm, unformat_input_t * input)
1249 vlib_thread_registration_t *tr;
1251 vlib_thread_main_t *tm = &vlib_thread_main;
1257 tm->thread_registrations_by_name = hash_create_string (0, sizeof (uword));
1259 tm->n_thread_stacks = 1; /* account for main thread */
1260 tm->sched_policy = ~0;
1261 tm->sched_priority = ~0;
1262 tm->skip_cores = ~0;
1268 hash_set_mem (tm->thread_registrations_by_name, tr->name, (uword) tr);
1272 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1274 if (unformat (input, "use-pthreads"))
1275 tm->use_pthreads = 1;
1276 else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1278 else if (unformat (input, "main-core %u", &tm->main_lcore))
1280 else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1282 else if (unformat (input, "coremask-%s %llx", &name, &coremask))
1284 p = hash_get_mem (tm->thread_registrations_by_name, name);
1286 return clib_error_return (0, "no such thread type '%s'", name);
1288 tr = (vlib_thread_registration_t *) p[0];
1290 if (tr->use_pthreads)
1291 return clib_error_return (0,
1292 "coremask cannot be set for '%s' threads",
1295 tr->coremask = clib_bitmap_set_multiple
1296 (tr->coremask, 0, coremask, BITS (coremask));
1297 tr->count = clib_bitmap_count_set_bits (tr->coremask);
1299 else if (unformat (input, "corelist-%s %U", &name, unformat_bitmap_list,
1302 p = hash_get_mem (tm->thread_registrations_by_name, name);
1304 return clib_error_return (0, "no such thread type '%s'", name);
1306 tr = (vlib_thread_registration_t *) p[0];
1308 if (tr->use_pthreads)
1309 return clib_error_return (0,
1310 "corelist cannot be set for '%s' threads",
1313 tr->coremask = bitmap;
1314 tr->count = clib_bitmap_count_set_bits (tr->coremask);
1318 (input, "scheduler-policy %U", unformat_sched_policy,
1321 else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1323 else if (unformat (input, "%s %u", &name, &count))
1325 p = hash_get_mem (tm->thread_registrations_by_name, name);
1327 return clib_error_return (0, "no such thread type 3 '%s'", name);
1329 tr = (vlib_thread_registration_t *) p[0];
1330 if (tr->fixed_count)
1331 return clib_error_return
1332 (0, "number of %s threads not configurable", tr->name);
1339 if (tm->sched_priority != ~0)
1341 if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1343 u32 prio_max = sched_get_priority_max (tm->sched_policy);
1344 u32 prio_min = sched_get_priority_min (tm->sched_policy);
1345 if (tm->sched_priority > prio_max)
1346 tm->sched_priority = prio_max;
1347 if (tm->sched_priority < prio_min)
1348 tm->sched_priority = prio_min;
1352 return clib_error_return
1354 "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1355 tm->sched_priority);
1360 if (!tm->thread_prefix)
1361 tm->thread_prefix = format (0, "vpp");
1365 tm->n_thread_stacks += tr->count;
1366 tm->n_pthreads += tr->count * tr->use_pthreads;
1367 tm->n_threads += tr->count * (tr->use_pthreads == 0);
1374 VLIB_EARLY_CONFIG_FUNCTION (cpu_config, "cpu");
1376 #if !defined (__x86_64__) && !defined (__i386__) && !defined (__aarch64__) && !defined (__powerpc64__) && !defined(__arm__)
1378 __sync_fetch_and_add_8 (void)
1380 fformat (stderr, "%s called\n", __FUNCTION__);
1385 __sync_add_and_fetch_8 (void)
1387 fformat (stderr, "%s called\n", __FUNCTION__);
1392 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1394 vnet_main_fixup (vlib_fork_fixup_t which)
1399 vlib_worker_thread_fork_fixup (vlib_fork_fixup_t which)
1401 vlib_main_t *vm = vlib_get_main ();
1403 if (vlib_mains == 0)
1406 ASSERT (vlib_get_thread_index () == 0);
1407 vlib_worker_thread_barrier_sync (vm);
1411 case VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX:
1412 vnet_main_fixup (VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX);
1418 vlib_worker_thread_barrier_release (vm);
1422 * Enforce minimum open time to minimize packet loss due to Rx overflow,
1423 * based on a test based heuristic that barrier should be open for at least
1424 * 3 time as long as it is closed (with an upper bound of 1ms because by that
1425 * point it is probably too late to make a difference)
1428 #ifndef BARRIER_MINIMUM_OPEN_LIMIT
1429 #define BARRIER_MINIMUM_OPEN_LIMIT 0.001
1432 #ifndef BARRIER_MINIMUM_OPEN_FACTOR
1433 #define BARRIER_MINIMUM_OPEN_FACTOR 3
1437 vlib_worker_thread_barrier_sync_int (vlib_main_t * vm)
1446 if (vec_len (vlib_mains) < 2)
1449 ASSERT (vlib_get_thread_index () == 0);
1451 count = vec_len (vlib_mains) - 1;
1453 /* Record entry relative to last close */
1454 now = vlib_time_now (vm);
1455 t_entry = now - vm->barrier_epoch;
1457 /* Tolerate recursive calls */
1458 if (++vlib_worker_threads[0].recursion_level > 1)
1460 barrier_trace_sync_rec (t_entry);
1464 vlib_worker_threads[0].barrier_sync_count++;
1466 /* Enforce minimum barrier open time to minimize packet loss */
1467 ASSERT (vm->barrier_no_close_before <= (now + BARRIER_MINIMUM_OPEN_LIMIT));
1468 while ((now = vlib_time_now (vm)) < vm->barrier_no_close_before)
1471 /* Record time of closure */
1472 t_open = now - vm->barrier_epoch;
1473 vm->barrier_epoch = now;
1475 deadline = now + BARRIER_SYNC_TIMEOUT;
1477 *vlib_worker_threads->wait_at_barrier = 1;
1478 while (*vlib_worker_threads->workers_at_barrier != count)
1480 if ((now = vlib_time_now (vm)) > deadline)
1482 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1487 t_closed = now - vm->barrier_epoch;
1489 barrier_trace_sync (t_entry, t_open, t_closed);
1493 void vlib_stat_segment_lock (void) __attribute__ ((weak));
1495 vlib_stat_segment_lock (void)
1499 void vlib_stat_segment_unlock (void) __attribute__ ((weak));
1501 vlib_stat_segment_unlock (void)
1506 vlib_worker_thread_barrier_release (vlib_main_t * vm)
1513 f64 t_update_main = 0.0;
1514 int refork_needed = 0;
1516 if (vec_len (vlib_mains) < 2)
1519 ASSERT (vlib_get_thread_index () == 0);
1522 now = vlib_time_now (vm);
1523 t_entry = now - vm->barrier_epoch;
1525 if (--vlib_worker_threads[0].recursion_level > 0)
1527 barrier_trace_release_rec (t_entry);
1531 /* Update (all) node runtimes before releasing the barrier, if needed */
1532 if (vm->need_vlib_worker_thread_node_runtime_update)
1535 * Lock stat segment here, so we's safe when
1536 * rebuilding the stat segment node clones from the
1539 vlib_stat_segment_lock ();
1541 /* Do stats elements on main thread */
1542 worker_thread_node_runtime_update_internal ();
1543 vm->need_vlib_worker_thread_node_runtime_update = 0;
1545 /* Do per thread rebuilds in parallel */
1547 clib_smp_atomic_add (vlib_worker_threads->node_reforks_required,
1548 (vec_len (vlib_mains) - 1));
1549 now = vlib_time_now (vm);
1550 t_update_main = now - vm->barrier_epoch;
1553 deadline = now + BARRIER_SYNC_TIMEOUT;
1555 *vlib_worker_threads->wait_at_barrier = 0;
1557 while (*vlib_worker_threads->workers_at_barrier > 0)
1559 if ((now = vlib_time_now (vm)) > deadline)
1561 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1566 /* Wait for reforks before continuing */
1569 now = vlib_time_now (vm);
1571 deadline = now + BARRIER_SYNC_TIMEOUT;
1573 while (*vlib_worker_threads->node_reforks_required > 0)
1575 if ((now = vlib_time_now (vm)) > deadline)
1577 fformat (stderr, "%s: worker thread refork deadlock\n",
1582 vlib_stat_segment_unlock ();
1585 t_closed_total = now - vm->barrier_epoch;
1587 minimum_open = t_closed_total * BARRIER_MINIMUM_OPEN_FACTOR;
1589 if (minimum_open > BARRIER_MINIMUM_OPEN_LIMIT)
1591 minimum_open = BARRIER_MINIMUM_OPEN_LIMIT;
1594 vm->barrier_no_close_before = now + minimum_open;
1596 /* Record barrier epoch (used to enforce minimum open time) */
1597 vm->barrier_epoch = now;
1599 barrier_trace_release (t_entry, t_closed_total, t_update_main);
1604 * Check the frame queue to see if any frames are available.
1605 * If so, pull the packets off the frames and put them to
1609 vlib_frame_queue_dequeue (vlib_main_t * vm, vlib_frame_queue_main_t * fqm)
1611 u32 thread_id = vm->thread_index;
1612 vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1613 vlib_frame_queue_elt_t *elt;
1622 ASSERT (vm == vlib_mains[thread_id]);
1624 if (PREDICT_FALSE (fqm->node_index == ~0))
1627 * Gather trace data for frame queues
1629 if (PREDICT_FALSE (fq->trace))
1631 frame_queue_trace_t *fqt;
1632 frame_queue_nelt_counter_t *fqh;
1635 fqt = &fqm->frame_queue_traces[thread_id];
1637 fqt->nelts = fq->nelts;
1638 fqt->head = fq->head;
1639 fqt->head_hint = fq->head_hint;
1640 fqt->tail = fq->tail;
1641 fqt->threshold = fq->vector_threshold;
1642 fqt->n_in_use = fqt->tail - fqt->head;
1643 if (fqt->n_in_use >= fqt->nelts)
1645 // if beyond max then use max
1646 fqt->n_in_use = fqt->nelts - 1;
1649 /* Record the number of elements in use in the histogram */
1650 fqh = &fqm->frame_queue_histogram[thread_id];
1651 fqh->count[fqt->n_in_use]++;
1653 /* Record a snapshot of the elements in use */
1654 for (elix = 0; elix < fqt->nelts; elix++)
1656 elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1657 if (1 || elt->valid)
1659 fqt->n_vectors[elix] = elt->n_vectors;
1667 if (fq->head == fq->tail)
1669 fq->head_hint = fq->head;
1673 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1677 fq->head_hint = fq->head;
1681 from = elt->buffer_index;
1682 msg_type = elt->msg_type;
1684 ASSERT (msg_type == VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME);
1685 ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1687 f = vlib_get_frame_to_node (vm, fqm->node_index);
1689 to = vlib_frame_vector_args (f);
1691 n_left_to_node = elt->n_vectors;
1693 while (n_left_to_node >= 4)
1701 n_left_to_node -= 4;
1704 while (n_left_to_node > 0)
1712 vectors += elt->n_vectors;
1713 f->n_vectors = elt->n_vectors;
1714 vlib_put_frame_to_node (vm, fqm->node_index, f);
1718 elt->msg_type = 0xfefefefe;
1719 CLIB_MEMORY_BARRIER ();
1724 * Limit the number of packets pushed into the graph
1726 if (vectors >= fq->vector_threshold)
1728 fq->head_hint = fq->head;
1737 vlib_worker_thread_fn (void *arg)
1739 vlib_worker_thread_t *w = (vlib_worker_thread_t *) arg;
1740 vlib_thread_main_t *tm = vlib_get_thread_main ();
1741 vlib_main_t *vm = vlib_get_main ();
1744 ASSERT (vm->thread_index == vlib_get_thread_index ());
1746 vlib_worker_thread_init (w);
1747 clib_time_init (&vm->clib_time);
1748 clib_mem_set_heap (w->thread_mheap);
1750 /* Wait until the dpdk init sequence is complete */
1751 while (tm->extern_thread_mgmt && tm->worker_thread_release == 0)
1752 vlib_worker_thread_barrier_check ();
1754 e = vlib_call_init_exit_functions
1755 (vm, vm->worker_init_function_registrations, 1 /* call_once */ );
1757 clib_error_report (e);
1759 vlib_worker_loop (vm);
1763 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1766 .function = vlib_worker_thread_fn,
1771 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1773 vlib_thread_main_t *tm = vlib_get_thread_main ();
1774 vlib_frame_queue_main_t *fqm;
1775 vlib_frame_queue_t *fq;
1778 if (frame_queue_nelts == 0)
1779 frame_queue_nelts = FRAME_QUEUE_NELTS;
1781 vec_add2 (tm->frame_queue_mains, fqm, 1);
1783 fqm->node_index = node_index;
1785 vec_validate (fqm->vlib_frame_queues, tm->n_vlib_mains - 1);
1786 _vec_len (fqm->vlib_frame_queues) = 0;
1787 for (i = 0; i < tm->n_vlib_mains; i++)
1789 fq = vlib_frame_queue_alloc (frame_queue_nelts);
1790 vec_add1 (fqm->vlib_frame_queues, fq);
1793 return (fqm - tm->frame_queue_mains);
1797 vlib_thread_cb_register (struct vlib_main_t *vm, vlib_thread_callbacks_t * cb)
1799 vlib_thread_main_t *tm = vlib_get_thread_main ();
1801 if (tm->extern_thread_mgmt)
1804 tm->cb.vlib_launch_thread_cb = cb->vlib_launch_thread_cb;
1805 tm->extern_thread_mgmt = 1;
1810 vlib_process_signal_event_mt_helper (vlib_process_signal_event_mt_args_t *
1813 ASSERT (vlib_get_thread_index () == 0);
1814 vlib_process_signal_event (vlib_get_main (), args->node_index,
1815 args->type_opaque, args->data);
1818 void *rpc_call_main_thread_cb_fn;
1821 vlib_rpc_call_main_thread (void *callback, u8 * args, u32 arg_size)
1823 if (rpc_call_main_thread_cb_fn)
1825 void (*fp) (void *, u8 *, u32) = rpc_call_main_thread_cb_fn;
1826 (*fp) (callback, args, arg_size);
1829 clib_warning ("BUG: rpc_call_main_thread_cb_fn NULL!");
1833 threads_init (vlib_main_t * vm)
1838 VLIB_INIT_FUNCTION (threads_init);
1841 * fd.io coding-style-patch-verification: ON
1844 * eval: (c-set-style "gnu")