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 #include <vlib/stat_weak_inlines.h>
28 DECLARE_CJ_GLOBAL_LOG;
37 vlib_worker_thread_t *vlib_worker_threads;
38 vlib_thread_main_t vlib_thread_main;
41 * Barrier tracing can be enabled on a normal build to collect information
42 * on barrier use, including timings and call stacks. Deliberately not
43 * keyed off CLIB_DEBUG, because that can add significant overhead which
44 * imapacts observed timings.
48 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
50 if (!vlib_worker_threads->barrier_elog_enabled)
54 ELOG_TYPE_DECLARE (e) =
56 .format = "bar-trace-%s-#%d",
57 .format_args = "T4i4",
62 u32 caller, count, t_entry, t_open, t_closed;
65 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
66 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
67 ed->caller = elog_string (&vlib_global_main.elog_main,
68 (char *) vlib_worker_threads[0].barrier_caller);
69 ed->t_entry = (int) (1000000.0 * t_entry);
70 ed->t_open = (int) (1000000.0 * t_open);
71 ed->t_closed = (int) (1000000.0 * t_closed);
75 barrier_trace_sync_rec (f64 t_entry)
77 if (!vlib_worker_threads->barrier_elog_enabled)
81 ELOG_TYPE_DECLARE (e) =
83 .format = "bar-syncrec-%s-#%d",
84 .format_args = "T4i4",
92 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
93 ed->depth = (int) vlib_worker_threads[0].recursion_level - 1;
94 ed->caller = elog_string (&vlib_global_main.elog_main,
95 (char *) vlib_worker_threads[0].barrier_caller);
99 barrier_trace_release_rec (f64 t_entry)
101 if (!vlib_worker_threads->barrier_elog_enabled)
105 ELOG_TYPE_DECLARE (e) =
107 .format = "bar-relrrec-#%d",
116 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
117 ed->depth = (int) vlib_worker_threads[0].recursion_level;
121 barrier_trace_release (f64 t_entry, f64 t_closed_total, f64 t_update_main)
123 if (!vlib_worker_threads->barrier_elog_enabled)
127 ELOG_TYPE_DECLARE (e) =
129 .format = "bar-rel-#%d-e%d-u%d-t%d",
130 .format_args = "i4i4i4i4",
135 u32 count, t_entry, t_update_main, t_closed_total;
138 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
139 ed->t_entry = (int) (1000000.0 * t_entry);
140 ed->t_update_main = (int) (1000000.0 * t_update_main);
141 ed->t_closed_total = (int) (1000000.0 * t_closed_total);
142 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
144 /* Reset context for next trace */
145 vlib_worker_threads[0].barrier_context = NULL;
149 os_get_nthreads (void)
151 return vec_len (vlib_thread_stacks);
155 vlib_set_thread_name (char *name)
157 int pthread_setname_np (pthread_t __target_thread, const char *__name);
159 pthread_t thread = pthread_self ();
163 rv = pthread_setname_np (thread, name);
165 clib_warning ("pthread_setname_np returned %d", rv);
170 sort_registrations_by_no_clone (void *a0, void *a1)
172 vlib_thread_registration_t **tr0 = a0;
173 vlib_thread_registration_t **tr1 = a1;
175 return ((i32) ((*tr0)->no_data_structure_clone)
176 - ((i32) ((*tr1)->no_data_structure_clone)));
180 clib_sysfs_list_to_bitmap (char *filename)
185 fp = fopen (filename, "r");
190 vec_validate (buffer, 256 - 1);
191 if (fgets ((char *) buffer, 256, fp))
194 unformat_init_string (&in, (char *) buffer,
195 strlen ((char *) buffer));
196 if (unformat (&in, "%U", unformat_bitmap_list, &r) != 1)
197 clib_warning ("unformat_bitmap_list failed");
207 /* Called early in the init sequence */
210 vlib_thread_init (vlib_main_t * vm)
212 vlib_thread_main_t *tm = &vlib_thread_main;
213 vlib_worker_thread_t *w;
214 vlib_thread_registration_t *tr;
215 u32 n_vlib_mains = 1;
220 /* get bitmaps of active cpu cores and sockets */
221 tm->cpu_core_bitmap =
222 clib_sysfs_list_to_bitmap ("/sys/devices/system/cpu/online");
223 tm->cpu_socket_bitmap =
224 clib_sysfs_list_to_bitmap ("/sys/devices/system/node/online");
226 avail_cpu = clib_bitmap_dup (tm->cpu_core_bitmap);
229 for (i = 0; i < tm->skip_cores; i++)
231 uword c = clib_bitmap_first_set (avail_cpu);
233 return clib_error_return (0, "no available cpus to skip");
235 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
238 /* grab cpu for main thread */
239 if (tm->main_lcore == ~0)
241 /* if main-lcore is not set, we try to use lcore 1 */
242 if (clib_bitmap_get (avail_cpu, 1))
245 tm->main_lcore = clib_bitmap_first_set (avail_cpu);
246 if (tm->main_lcore == (u8) ~ 0)
247 return clib_error_return (0, "no available cpus to be used for the"
252 if (clib_bitmap_get (avail_cpu, tm->main_lcore) == 0)
253 return clib_error_return (0, "cpu %u is not available to be used"
254 " for the main thread", tm->main_lcore);
256 avail_cpu = clib_bitmap_set (avail_cpu, tm->main_lcore, 0);
259 * Determine if the number of workers is greater than 0.
260 * If so, mark CPU 0 unavailable so workers will be numbered after main.
263 uword *p = hash_get_mem (tm->thread_registrations_by_name, "workers");
266 vlib_thread_registration_t *tr = (vlib_thread_registration_t *) p[0];
267 int worker_thread_count = tr->count;
268 n_workers = worker_thread_count;
270 if (tm->skip_cores == 0 && n_workers)
271 avail_cpu = clib_bitmap_set (avail_cpu, 0, 0);
273 /* assume that there is socket 0 only if there is no data from sysfs */
274 if (!tm->cpu_socket_bitmap)
275 tm->cpu_socket_bitmap = clib_bitmap_set (0, 0, 1);
277 /* pin main thread to main_lcore */
278 if (tm->cb.vlib_thread_set_lcore_cb)
280 tm->cb.vlib_thread_set_lcore_cb (0, tm->main_lcore);
286 CPU_SET (tm->main_lcore, &cpuset);
287 pthread_setaffinity_np (pthread_self (), sizeof (cpu_set_t), &cpuset);
290 /* Set up thread 0 */
291 vec_validate_aligned (vlib_worker_threads, 0, CLIB_CACHE_LINE_BYTES);
292 _vec_len (vlib_worker_threads) = 1;
293 w = vlib_worker_threads;
294 w->thread_mheap = clib_mem_get_heap ();
295 w->thread_stack = vlib_thread_stacks[0];
296 w->cpu_id = tm->main_lcore;
297 w->lwp = syscall (SYS_gettid);
298 w->thread_id = pthread_self ();
299 tm->n_vlib_mains = 1;
301 vlib_get_thread_core_numa (w, w->cpu_id);
303 if (tm->sched_policy != ~0)
305 struct sched_param sched_param;
306 if (!sched_getparam (w->lwp, &sched_param))
308 if (tm->sched_priority != ~0)
309 sched_param.sched_priority = tm->sched_priority;
310 sched_setscheduler (w->lwp, tm->sched_policy, &sched_param);
314 /* assign threads to cores and set n_vlib_mains */
319 vec_add1 (tm->registrations, tr);
323 vec_sort_with_function (tm->registrations, sort_registrations_by_no_clone);
325 for (i = 0; i < vec_len (tm->registrations); i++)
328 tr = tm->registrations[i];
329 tr->first_index = first_index;
330 first_index += tr->count;
331 n_vlib_mains += (tr->no_data_structure_clone == 0) ? tr->count : 0;
333 /* construct coremask */
334 if (tr->use_pthreads || !tr->count)
341 clib_bitmap_foreach (c, tr->coremask, ({
342 if (clib_bitmap_get(avail_cpu, c) == 0)
343 return clib_error_return (0, "cpu %u is not available to be used"
344 " for the '%s' thread",c, tr->name);
346 avail_cpu = clib_bitmap_set(avail_cpu, c, 0);
352 for (j = 0; j < tr->count; j++)
354 uword c = clib_bitmap_first_set (avail_cpu);
356 return clib_error_return (0,
357 "no available cpus to be used for"
358 " the '%s' thread", tr->name);
360 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
361 tr->coremask = clib_bitmap_set (tr->coremask, c, 1);
366 clib_bitmap_free (avail_cpu);
368 tm->n_vlib_mains = n_vlib_mains;
371 * Allocate the remaining worker threads, and thread stack vector slots
372 * from now on, calls to os_get_nthreads() will return the correct
375 vec_validate_aligned (vlib_worker_threads, first_index - 1,
376 CLIB_CACHE_LINE_BYTES);
377 vec_validate (vlib_thread_stacks, vec_len (vlib_worker_threads) - 1);
382 vlib_frame_queue_alloc (int nelts)
384 vlib_frame_queue_t *fq;
386 fq = clib_mem_alloc_aligned (sizeof (*fq), CLIB_CACHE_LINE_BYTES);
387 clib_memset (fq, 0, sizeof (*fq));
389 fq->vector_threshold = 128; // packets
390 vec_validate_aligned (fq->elts, nelts - 1, CLIB_CACHE_LINE_BYTES);
394 if (((uword) & fq->tail) & (CLIB_CACHE_LINE_BYTES - 1))
395 fformat (stderr, "WARNING: fq->tail unaligned\n");
396 if (((uword) & fq->head) & (CLIB_CACHE_LINE_BYTES - 1))
397 fformat (stderr, "WARNING: fq->head unaligned\n");
398 if (((uword) fq->elts) & (CLIB_CACHE_LINE_BYTES - 1))
399 fformat (stderr, "WARNING: fq->elts unaligned\n");
401 if (sizeof (fq->elts[0]) % CLIB_CACHE_LINE_BYTES)
402 fformat (stderr, "WARNING: fq->elts[0] size %d\n",
403 sizeof (fq->elts[0]));
404 if (nelts & (nelts - 1))
406 fformat (stderr, "FATAL: nelts MUST be a power of 2\n");
414 void vl_msg_api_handler_no_free (void *) __attribute__ ((weak));
416 vl_msg_api_handler_no_free (void *v)
420 /* Turned off, save as reference material... */
423 vlib_frame_queue_dequeue_internal (int thread_id,
424 vlib_main_t * vm, vlib_node_main_t * nm)
426 vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
427 vlib_frame_queue_elt_t *elt;
429 vlib_pending_frame_t *p;
430 vlib_node_runtime_t *r;
431 u32 node_runtime_index;
436 ASSERT (vm == vlib_mains[thread_id]);
440 if (fq->head == fq->tail)
443 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
448 before = clib_cpu_time_now ();
451 node_runtime_index = elt->node_runtime_index;
452 msg_type = elt->msg_type;
456 case VLIB_FRAME_QUEUE_ELT_FREE_BUFFERS:
457 vlib_buffer_free (vm, vlib_frame_vector_args (f), f->n_vectors);
458 /* note fallthrough... */
459 case VLIB_FRAME_QUEUE_ELT_FREE_FRAME:
460 r = vec_elt_at_index (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
462 vlib_frame_free (vm, r, f);
464 case VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME:
465 vec_add2 (vm->node_main.pending_frames, p, 1);
466 f->flags |= (VLIB_FRAME_PENDING | VLIB_FRAME_FREE_AFTER_DISPATCH);
467 p->node_runtime_index = elt->node_runtime_index;
468 p->frame_index = vlib_frame_index (vm, f);
469 p->next_frame_index = VLIB_PENDING_FRAME_NO_NEXT_FRAME;
470 fq->dequeue_vectors += (u64) f->n_vectors;
472 case VLIB_FRAME_QUEUE_ELT_API_MSG:
473 vl_msg_api_handler_no_free (f);
476 clib_warning ("bogus frame queue message, type %d", msg_type);
481 fq->dequeue_ticks += clib_cpu_time_now () - before;
482 CLIB_MEMORY_BARRIER ();
491 vlib_frame_queue_dequeue (int thread_id,
492 vlib_main_t * vm, vlib_node_main_t * nm)
494 return vlib_frame_queue_dequeue_internal (thread_id, vm, nm);
498 vlib_frame_queue_enqueue (vlib_main_t * vm, u32 node_runtime_index,
499 u32 frame_queue_index, vlib_frame_t * frame,
500 vlib_frame_queue_msg_type_t type)
502 vlib_frame_queue_t *fq = vlib_frame_queues[frame_queue_index];
503 vlib_frame_queue_elt_t *elt;
506 u64 before = clib_cpu_time_now ();
510 new_tail = clib_atomic_add_fetch (&fq->tail, 1);
512 /* Wait until a ring slot is available */
513 while (new_tail >= fq->head + fq->nelts)
515 f64 b4 = vlib_time_now_ticks (vm, before);
516 vlib_worker_thread_barrier_check (vm, b4);
517 /* Bad idea. Dequeue -> enqueue -> dequeue -> trouble */
518 // vlib_frame_queue_dequeue (vm->thread_index, vm, nm);
521 elt = fq->elts + (new_tail & (fq->nelts - 1));
523 /* this would be very bad... */
528 /* Once we enqueue the frame, frame->n_vectors is owned elsewhere... */
529 save_count = frame->n_vectors;
532 elt->node_runtime_index = node_runtime_index;
533 elt->msg_type = type;
534 CLIB_MEMORY_BARRIER ();
541 /* To be called by vlib worker threads upon startup */
543 vlib_worker_thread_init (vlib_worker_thread_t * w)
545 vlib_thread_main_t *tm = vlib_get_thread_main ();
548 * Note: disabling signals in worker threads as follows
549 * prevents the api post-mortem dump scheme from working
553 * pthread_sigmask (SIG_SETMASK, &s, 0);
557 clib_mem_set_heap (w->thread_mheap);
559 if (vec_len (tm->thread_prefix) && w->registration->short_name)
561 w->name = format (0, "%v_%s_%d%c", tm->thread_prefix,
562 w->registration->short_name, w->instance_id, '\0');
563 vlib_set_thread_name ((char *) w->name);
566 if (!w->registration->use_pthreads)
569 /* Initial barrier sync, for both worker and i/o threads */
570 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, 1);
572 while (*vlib_worker_threads->wait_at_barrier)
575 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, -1);
580 vlib_worker_thread_bootstrap_fn (void *arg)
583 vlib_worker_thread_t *w = arg;
585 w->lwp = syscall (SYS_gettid);
586 w->thread_id = pthread_self ();
588 __os_thread_index = w - vlib_worker_threads;
590 rv = (void *) clib_calljmp
591 ((uword (*)(uword)) w->thread_function,
592 (uword) arg, w->thread_stack + VLIB_THREAD_STACK_SIZE);
593 /* NOTREACHED, we hope */
598 vlib_get_thread_core_numa (vlib_worker_thread_t * w, unsigned cpu_id)
600 const char *sys_cpu_path = "/sys/devices/system/cpu/cpu";
602 int core_id = -1, numa_id = -1;
604 p = format (p, "%s%u/topology/core_id%c", sys_cpu_path, cpu_id, 0);
605 clib_sysfs_read ((char *) p, "%d", &core_id);
606 vec_reset_length (p);
607 p = format (p, "%s%u/topology/physical_package_id%c", sys_cpu_path,
609 clib_sysfs_read ((char *) p, "%d", &numa_id);
612 w->core_id = core_id;
613 w->numa_id = numa_id;
616 static clib_error_t *
617 vlib_launch_thread_int (void *fp, vlib_worker_thread_t * w, unsigned cpu_id)
619 vlib_thread_main_t *tm = &vlib_thread_main;
620 void *(*fp_arg) (void *) = fp;
624 vlib_get_thread_core_numa (w, cpu_id);
626 /* Set up NUMA-bound heap if indicated */
627 if (clib_per_numa_mheaps[w->numa_id] == 0)
629 /* If the user requested a NUMA heap, create it... */
630 if (tm->numa_heap_size)
632 numa_heap = clib_mem_init_thread_safe_numa
633 (0 /* DIY */ , tm->numa_heap_size, w->numa_id);
634 clib_per_numa_mheaps[w->numa_id] = numa_heap;
638 /* Or, use the main heap */
639 clib_per_numa_mheaps[w->numa_id] = w->thread_mheap;
643 if (tm->cb.vlib_launch_thread_cb && !w->registration->use_pthreads)
644 return tm->cb.vlib_launch_thread_cb (fp, (void *) w, cpu_id);
650 CPU_SET (cpu_id, &cpuset);
652 if (pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w))
653 return clib_error_return_unix (0, "pthread_create");
655 if (pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset))
656 return clib_error_return_unix (0, "pthread_setaffinity_np");
662 static clib_error_t *
663 start_workers (vlib_main_t * vm)
666 vlib_worker_thread_t *w;
667 vlib_main_t *vm_clone;
669 vlib_thread_main_t *tm = &vlib_thread_main;
670 vlib_thread_registration_t *tr;
671 vlib_node_runtime_t *rt;
672 u32 n_vlib_mains = tm->n_vlib_mains;
673 u32 worker_thread_index;
674 u8 *main_heap = clib_mem_get_per_cpu_heap ();
676 vec_reset_length (vlib_worker_threads);
678 /* Set up the main thread */
679 vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
680 w->elog_track.name = "main thread";
681 elog_track_register (&vm->elog_main, &w->elog_track);
683 if (vec_len (tm->thread_prefix))
685 w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
686 vlib_set_thread_name ((char *) w->name);
690 clib_mem_alloc_aligned (CLIB_CACHE_LINE_BYTES, CLIB_CACHE_LINE_BYTES);
691 vm->elog_main.lock[0] = 0;
693 if (n_vlib_mains > 1)
695 /* Replace hand-crafted length-1 vector with a real vector */
698 vec_validate_aligned (vlib_mains, tm->n_vlib_mains - 1,
699 CLIB_CACHE_LINE_BYTES);
700 _vec_len (vlib_mains) = 0;
701 vec_add1_aligned (vlib_mains, vm, CLIB_CACHE_LINE_BYTES);
703 vlib_worker_threads->wait_at_barrier =
704 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
705 vlib_worker_threads->workers_at_barrier =
706 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
708 vlib_worker_threads->node_reforks_required =
709 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
711 /* We'll need the rpc vector lock... */
712 clib_spinlock_init (&vm->pending_rpc_lock);
714 /* Ask for an initial barrier sync */
715 *vlib_worker_threads->workers_at_barrier = 0;
716 *vlib_worker_threads->wait_at_barrier = 1;
718 /* Without update or refork */
719 *vlib_worker_threads->node_reforks_required = 0;
720 vm->need_vlib_worker_thread_node_runtime_update = 0;
723 vm->barrier_epoch = 0;
724 vm->barrier_no_close_before = 0;
726 worker_thread_index = 1;
728 for (i = 0; i < vec_len (tm->registrations); i++)
730 vlib_node_main_t *nm, *nm_clone;
733 tr = tm->registrations[i];
738 for (k = 0; k < tr->count; k++)
742 vec_add2 (vlib_worker_threads, w, 1);
743 /* Currently unused, may not really work */
745 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->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
854 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
855 CLIB_CACHE_LINE_BYTES);
857 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
859 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
860 rt->thread_index = vm_clone->thread_index;
861 /* copy initial runtime_data from node */
862 if (n->runtime_data && n->runtime_data_bytes > 0)
863 clib_memcpy (rt->runtime_data, n->runtime_data,
864 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
865 n->runtime_data_bytes));
868 nm_clone->processes = vec_dup_aligned (nm->processes,
869 CLIB_CACHE_LINE_BYTES);
871 /* Create per-thread frame freelist */
872 nm_clone->frame_sizes = vec_new (vlib_frame_size_t, 1);
873 #ifdef VLIB_SUPPORTS_ARBITRARY_SCALAR_SIZES
874 nm_clone->frame_size_hash = hash_create (0, sizeof (uword));
876 nm_clone->node_by_error = nm->node_by_error;
878 /* Packet trace buffers are guaranteed to be empty, nothing to do here */
880 clib_mem_set_heap (oldheap);
881 vec_add1_aligned (vlib_mains, vm_clone, CLIB_CACHE_LINE_BYTES);
883 /* Switch to the stats segment ... */
884 void *oldheap = vlib_stats_push_heap (0);
885 vm_clone->error_main.counters = vec_dup_aligned
886 (vlib_mains[0]->error_main.counters, CLIB_CACHE_LINE_BYTES);
887 vlib_stats_pop_heap2 (vm_clone->error_main.counters,
888 worker_thread_index, oldheap, 1);
890 vm_clone->error_main.counters_last_clear = vec_dup_aligned
891 (vlib_mains[0]->error_main.counters_last_clear,
892 CLIB_CACHE_LINE_BYTES);
894 worker_thread_index++;
900 /* only have non-data-structure copy threads to create... */
901 for (i = 0; i < vec_len (tm->registrations); i++)
903 tr = tm->registrations[i];
905 for (j = 0; j < tr->count; j++)
907 vec_add2 (vlib_worker_threads, w, 1);
911 create_mspace (tr->mheap_size, 0 /* locked */ );
914 w->thread_mheap = main_heap;
916 vlib_thread_stack_init (w - vlib_worker_threads);
917 w->thread_function = tr->function;
918 w->thread_function_arg = w;
921 (char *) format (0, "%s %d", tr->name, j + 1);
922 w->registration = tr;
923 vec_add1 (w->elog_track.name, 0);
924 elog_track_register (&vm->elog_main, &w->elog_track);
929 worker_thread_index = 1;
931 for (i = 0; i < vec_len (tm->registrations); i++)
936 tr = tm->registrations[i];
938 if (tr->use_pthreads || tm->use_pthreads)
940 for (j = 0; j < tr->count; j++)
942 w = vlib_worker_threads + worker_thread_index++;
943 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
946 clib_error_report (err);
953 clib_bitmap_foreach (c, tr->coremask, ({
954 w = vlib_worker_threads + worker_thread_index++;
955 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
958 clib_error_report (err);
963 vlib_worker_thread_barrier_sync (vm);
964 vlib_worker_thread_barrier_release (vm);
968 VLIB_MAIN_LOOP_ENTER_FUNCTION (start_workers);
972 worker_thread_node_runtime_update_internal (void)
976 vlib_node_main_t *nm, *nm_clone;
977 vlib_main_t *vm_clone;
978 vlib_node_runtime_t *rt;
980 vlib_node_runtime_sync_stats (vlib_main_t * vm,
981 vlib_node_runtime_t * r,
983 uword n_vectors, uword n_clocks);
985 ASSERT (vlib_get_thread_index () == 0);
990 ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
993 * Scrape all runtime stats, so we don't lose node runtime(s) with
994 * pending counts, or throw away worker / io thread counts.
996 for (j = 0; j < vec_len (nm->nodes); j++)
1000 vlib_node_sync_stats (vm, n);
1003 for (i = 1; i < vec_len (vlib_mains); i++)
1007 vm_clone = vlib_mains[i];
1008 nm_clone = &vm_clone->node_main;
1010 for (j = 0; j < vec_len (nm_clone->nodes); j++)
1012 n = nm_clone->nodes[j];
1014 rt = vlib_node_get_runtime (vm_clone, n->index);
1015 vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
1019 /* Per-worker clone rebuilds are now done on each thread */
1024 vlib_worker_thread_node_refork (void)
1026 vlib_main_t *vm, *vm_clone;
1027 vlib_node_main_t *nm, *nm_clone;
1028 vlib_node_t **old_nodes_clone;
1029 vlib_node_runtime_t *rt, *old_rt;
1031 vlib_node_t *new_n_clone;
1036 nm = &vm->node_main;
1037 vm_clone = vlib_get_main ();
1038 nm_clone = &vm_clone->node_main;
1040 /* Re-clone error heap */
1041 u64 *old_counters = vm_clone->error_main.counters;
1042 u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
1044 clib_memcpy_fast (&vm_clone->error_main, &vm->error_main,
1045 sizeof (vm->error_main));
1046 j = vec_len (vm->error_main.counters) - 1;
1048 /* Switch to the stats segment ... */
1049 void *oldheap = vlib_stats_push_heap (0);
1050 vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
1051 vm_clone->error_main.counters = old_counters;
1052 vlib_stats_pop_heap2 (vm_clone->error_main.counters, vm_clone->thread_index,
1055 vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
1056 vm_clone->error_main.counters_last_clear = old_counters_all_clear;
1058 nm_clone = &vm_clone->node_main;
1059 vec_free (nm_clone->next_frames);
1060 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
1061 CLIB_CACHE_LINE_BYTES);
1063 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
1065 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
1066 u32 save_node_runtime_index;
1069 save_node_runtime_index = nf->node_runtime_index;
1070 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
1071 vlib_next_frame_init (nf);
1072 nf->node_runtime_index = save_node_runtime_index;
1073 nf->flags = save_flags;
1076 old_nodes_clone = nm_clone->nodes;
1077 nm_clone->nodes = 0;
1081 /* Allocate all nodes in single block for speed */
1083 clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*new_n_clone));
1084 for (j = 0; j < vec_len (nm->nodes); j++)
1086 vlib_node_t *new_n = nm->nodes[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 vlib_node_t *old_n_clone = old_nodes_clone[j];
1103 /* Copy stats if the old data is valid */
1104 clib_memcpy_fast (&new_n_clone->stats_total,
1105 &old_n_clone->stats_total,
1106 sizeof (new_n_clone->stats_total));
1107 clib_memcpy_fast (&new_n_clone->stats_last_clear,
1108 &old_n_clone->stats_last_clear,
1109 sizeof (new_n_clone->stats_last_clear));
1111 /* keep previous node state */
1112 new_n_clone->state = old_n_clone->state;
1114 vec_add1 (nm_clone->nodes, new_n_clone);
1117 /* Free the old node clones */
1118 clib_mem_free (old_nodes_clone[0]);
1120 vec_free (old_nodes_clone);
1123 /* re-clone internal nodes */
1124 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL];
1125 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
1126 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
1127 CLIB_CACHE_LINE_BYTES);
1129 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
1131 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1132 rt->thread_index = vm_clone->thread_index;
1133 /* copy runtime_data, will be overwritten later for existing rt */
1134 if (n->runtime_data && n->runtime_data_bytes > 0)
1135 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1136 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1137 n->runtime_data_bytes));
1140 for (j = 0; j < vec_len (old_rt); j++)
1142 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1143 rt->state = old_rt[j].state;
1144 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1145 VLIB_NODE_RUNTIME_DATA_SIZE);
1150 /* re-clone input nodes */
1151 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
1152 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
1153 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
1154 CLIB_CACHE_LINE_BYTES);
1156 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
1158 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1159 rt->thread_index = vm_clone->thread_index;
1160 /* copy runtime_data, will be overwritten later for existing rt */
1161 if (n->runtime_data && n->runtime_data_bytes > 0)
1162 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1163 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1164 n->runtime_data_bytes));
1167 for (j = 0; j < vec_len (old_rt); j++)
1169 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1170 rt->state = old_rt[j].state;
1171 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1172 VLIB_NODE_RUNTIME_DATA_SIZE);
1177 /* re-clone pre-input nodes */
1178 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT];
1179 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
1180 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
1181 CLIB_CACHE_LINE_BYTES);
1183 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
1185 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1186 rt->thread_index = vm_clone->thread_index;
1187 /* copy runtime_data, will be overwritten later for existing rt */
1188 if (n->runtime_data && n->runtime_data_bytes > 0)
1189 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1190 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1191 n->runtime_data_bytes));
1194 for (j = 0; j < vec_len (old_rt); j++)
1196 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1197 rt->state = old_rt[j].state;
1198 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1199 VLIB_NODE_RUNTIME_DATA_SIZE);
1204 nm_clone->processes = vec_dup_aligned (nm->processes,
1205 CLIB_CACHE_LINE_BYTES);
1206 nm_clone->node_by_error = nm->node_by_error;
1210 vlib_worker_thread_node_runtime_update (void)
1213 * Make a note that we need to do a node runtime update
1214 * prior to releasing the barrier.
1216 vlib_global_main.need_vlib_worker_thread_node_runtime_update = 1;
1220 unformat_sched_policy (unformat_input_t * input, va_list * args)
1222 u32 *r = va_arg (*args, u32 *);
1225 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1226 foreach_sched_policy
1233 static clib_error_t *
1234 cpu_config (vlib_main_t * vm, unformat_input_t * input)
1236 vlib_thread_registration_t *tr;
1238 vlib_thread_main_t *tm = &vlib_thread_main;
1243 tm->thread_registrations_by_name = hash_create_string (0, sizeof (uword));
1245 tm->n_thread_stacks = 1; /* account for main thread */
1246 tm->sched_policy = ~0;
1247 tm->sched_priority = ~0;
1248 tm->main_lcore = ~0;
1254 hash_set_mem (tm->thread_registrations_by_name, tr->name, (uword) tr);
1258 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1260 if (unformat (input, "use-pthreads"))
1261 tm->use_pthreads = 1;
1262 else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1264 else if (unformat (input, "main-core %u", &tm->main_lcore))
1266 else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1268 else if (unformat (input, "numa-heap-size %U",
1269 unformat_memory_size, &tm->numa_heap_size))
1271 else if (unformat (input, "coremask-%s %U", &name,
1272 unformat_bitmap_mask, &bitmap) ||
1273 unformat (input, "corelist-%s %U", &name,
1274 unformat_bitmap_list, &bitmap))
1276 p = hash_get_mem (tm->thread_registrations_by_name, name);
1278 return clib_error_return (0, "no such thread type '%s'", name);
1280 tr = (vlib_thread_registration_t *) p[0];
1282 if (tr->use_pthreads)
1283 return clib_error_return (0,
1284 "corelist cannot be set for '%s' threads",
1287 tr->coremask = bitmap;
1288 tr->count = clib_bitmap_count_set_bits (tr->coremask);
1292 (input, "scheduler-policy %U", unformat_sched_policy,
1295 else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1297 else if (unformat (input, "%s %u", &name, &count))
1299 p = hash_get_mem (tm->thread_registrations_by_name, name);
1301 return clib_error_return (0, "no such thread type 3 '%s'", name);
1303 tr = (vlib_thread_registration_t *) p[0];
1304 if (tr->fixed_count)
1305 return clib_error_return
1306 (0, "number of %s threads not configurable", tr->name);
1313 if (tm->sched_priority != ~0)
1315 if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1317 u32 prio_max = sched_get_priority_max (tm->sched_policy);
1318 u32 prio_min = sched_get_priority_min (tm->sched_policy);
1319 if (tm->sched_priority > prio_max)
1320 tm->sched_priority = prio_max;
1321 if (tm->sched_priority < prio_min)
1322 tm->sched_priority = prio_min;
1326 return clib_error_return
1328 "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1329 tm->sched_priority);
1334 if (!tm->thread_prefix)
1335 tm->thread_prefix = format (0, "vpp");
1339 tm->n_thread_stacks += tr->count;
1340 tm->n_pthreads += tr->count * tr->use_pthreads;
1341 tm->n_threads += tr->count * (tr->use_pthreads == 0);
1348 VLIB_EARLY_CONFIG_FUNCTION (cpu_config, "cpu");
1350 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1352 vnet_main_fixup (vlib_fork_fixup_t which)
1357 vlib_worker_thread_fork_fixup (vlib_fork_fixup_t which)
1359 vlib_main_t *vm = vlib_get_main ();
1361 if (vlib_mains == 0)
1364 ASSERT (vlib_get_thread_index () == 0);
1365 vlib_worker_thread_barrier_sync (vm);
1369 case VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX:
1370 vnet_main_fixup (VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX);
1376 vlib_worker_thread_barrier_release (vm);
1380 * Enforce minimum open time to minimize packet loss due to Rx overflow,
1381 * based on a test based heuristic that barrier should be open for at least
1382 * 3 time as long as it is closed (with an upper bound of 1ms because by that
1383 * point it is probably too late to make a difference)
1386 #ifndef BARRIER_MINIMUM_OPEN_LIMIT
1387 #define BARRIER_MINIMUM_OPEN_LIMIT 0.001
1390 #ifndef BARRIER_MINIMUM_OPEN_FACTOR
1391 #define BARRIER_MINIMUM_OPEN_FACTOR 3
1395 vlib_worker_thread_initial_barrier_sync_and_release (vlib_main_t * vm)
1398 f64 now = vlib_time_now (vm);
1399 u32 count = vec_len (vlib_mains) - 1;
1401 /* No worker threads? */
1405 deadline = now + BARRIER_SYNC_TIMEOUT;
1406 *vlib_worker_threads->wait_at_barrier = 1;
1407 while (*vlib_worker_threads->workers_at_barrier != count)
1409 if ((now = vlib_time_now (vm)) > deadline)
1411 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1416 *vlib_worker_threads->wait_at_barrier = 0;
1420 vlib_worker_thread_barrier_sync_int (vlib_main_t * vm, const char *func_name)
1427 f64 max_vector_rate;
1431 if (vec_len (vlib_mains) < 2)
1434 ASSERT (vlib_get_thread_index () == 0);
1436 vlib_worker_threads[0].barrier_caller = func_name;
1437 count = vec_len (vlib_mains) - 1;
1439 /* Record entry relative to last close */
1440 now = vlib_time_now (vm);
1441 t_entry = now - vm->barrier_epoch;
1443 /* Tolerate recursive calls */
1444 if (++vlib_worker_threads[0].recursion_level > 1)
1446 barrier_trace_sync_rec (t_entry);
1451 * Need data to decide if we're working hard enough to honor
1452 * the barrier hold-down timer.
1454 max_vector_rate = 0.0;
1455 for (i = 1; i < vec_len (vlib_mains); i++)
1457 clib_max (max_vector_rate,
1458 (f64) vlib_last_vectors_per_main_loop (vlib_mains[i]));
1460 vlib_worker_threads[0].barrier_sync_count++;
1462 /* Enforce minimum barrier open time to minimize packet loss */
1463 ASSERT (vm->barrier_no_close_before <= (now + BARRIER_MINIMUM_OPEN_LIMIT));
1466 * If any worker thread seems busy, which we define
1467 * as a vector rate above 10, we enforce the barrier hold-down timer
1469 if (max_vector_rate > 10.0)
1473 now = vlib_time_now (vm);
1474 /* Barrier hold-down timer expired? */
1475 if (now >= vm->barrier_no_close_before)
1477 if ((vm->barrier_no_close_before - now)
1478 > (2.0 * BARRIER_MINIMUM_OPEN_LIMIT))
1481 ("clock change: would have waited for %.4f seconds",
1482 (vm->barrier_no_close_before - now));
1487 /* Record time of closure */
1488 t_open = now - vm->barrier_epoch;
1489 vm->barrier_epoch = now;
1491 deadline = now + BARRIER_SYNC_TIMEOUT;
1493 *vlib_worker_threads->wait_at_barrier = 1;
1494 while (*vlib_worker_threads->workers_at_barrier != count)
1496 if ((now = vlib_time_now (vm)) > deadline)
1498 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1503 t_closed = now - vm->barrier_epoch;
1505 barrier_trace_sync (t_entry, t_open, t_closed);
1510 vlib_worker_thread_barrier_release (vlib_main_t * vm)
1517 f64 t_update_main = 0.0;
1518 int refork_needed = 0;
1520 if (vec_len (vlib_mains) < 2)
1523 ASSERT (vlib_get_thread_index () == 0);
1526 now = vlib_time_now (vm);
1527 t_entry = now - vm->barrier_epoch;
1529 if (--vlib_worker_threads[0].recursion_level > 0)
1531 barrier_trace_release_rec (t_entry);
1535 /* Update (all) node runtimes before releasing the barrier, if needed */
1536 if (vm->need_vlib_worker_thread_node_runtime_update)
1539 * Lock stat segment here, so we's safe when
1540 * rebuilding the stat segment node clones from the
1543 vlib_stat_segment_lock ();
1545 /* Do stats elements on main thread */
1546 worker_thread_node_runtime_update_internal ();
1547 vm->need_vlib_worker_thread_node_runtime_update = 0;
1549 /* Do per thread rebuilds in parallel */
1551 clib_atomic_fetch_add (vlib_worker_threads->node_reforks_required,
1552 (vec_len (vlib_mains) - 1));
1553 now = vlib_time_now (vm);
1554 t_update_main = now - vm->barrier_epoch;
1557 deadline = now + BARRIER_SYNC_TIMEOUT;
1560 * Note when we let go of the barrier.
1561 * Workers can use this to derive a reasonably accurate
1562 * time offset. See vlib_time_now(...)
1564 vm->time_last_barrier_release = vlib_time_now (vm);
1565 CLIB_MEMORY_STORE_BARRIER ();
1567 *vlib_worker_threads->wait_at_barrier = 0;
1569 while (*vlib_worker_threads->workers_at_barrier > 0)
1571 if ((now = vlib_time_now (vm)) > deadline)
1573 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1578 /* Wait for reforks before continuing */
1581 now = vlib_time_now (vm);
1583 deadline = now + BARRIER_SYNC_TIMEOUT;
1585 while (*vlib_worker_threads->node_reforks_required > 0)
1587 if ((now = vlib_time_now (vm)) > deadline)
1589 fformat (stderr, "%s: worker thread refork deadlock\n",
1594 vlib_stat_segment_unlock ();
1597 t_closed_total = now - vm->barrier_epoch;
1599 minimum_open = t_closed_total * BARRIER_MINIMUM_OPEN_FACTOR;
1601 if (minimum_open > BARRIER_MINIMUM_OPEN_LIMIT)
1603 minimum_open = BARRIER_MINIMUM_OPEN_LIMIT;
1606 vm->barrier_no_close_before = now + minimum_open;
1608 /* Record barrier epoch (used to enforce minimum open time) */
1609 vm->barrier_epoch = now;
1611 barrier_trace_release (t_entry, t_closed_total, t_update_main);
1616 * Check the frame queue to see if any frames are available.
1617 * If so, pull the packets off the frames and put them to
1621 vlib_frame_queue_dequeue (vlib_main_t * vm, vlib_frame_queue_main_t * fqm)
1623 u32 thread_id = vm->thread_index;
1624 vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1625 vlib_frame_queue_elt_t *elt;
1634 ASSERT (vm == vlib_mains[thread_id]);
1636 if (PREDICT_FALSE (fqm->node_index == ~0))
1639 * Gather trace data for frame queues
1641 if (PREDICT_FALSE (fq->trace))
1643 frame_queue_trace_t *fqt;
1644 frame_queue_nelt_counter_t *fqh;
1647 fqt = &fqm->frame_queue_traces[thread_id];
1649 fqt->nelts = fq->nelts;
1650 fqt->head = fq->head;
1651 fqt->head_hint = fq->head_hint;
1652 fqt->tail = fq->tail;
1653 fqt->threshold = fq->vector_threshold;
1654 fqt->n_in_use = fqt->tail - fqt->head;
1655 if (fqt->n_in_use >= fqt->nelts)
1657 // if beyond max then use max
1658 fqt->n_in_use = fqt->nelts - 1;
1661 /* Record the number of elements in use in the histogram */
1662 fqh = &fqm->frame_queue_histogram[thread_id];
1663 fqh->count[fqt->n_in_use]++;
1665 /* Record a snapshot of the elements in use */
1666 for (elix = 0; elix < fqt->nelts; elix++)
1668 elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1669 if (1 || elt->valid)
1671 fqt->n_vectors[elix] = elt->n_vectors;
1680 if (fq->head == fq->tail)
1682 fq->head_hint = fq->head;
1686 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1690 fq->head_hint = fq->head;
1694 from = elt->buffer_index;
1695 msg_type = elt->msg_type;
1697 ASSERT (msg_type == VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME);
1698 ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1700 f = vlib_get_frame_to_node (vm, fqm->node_index);
1702 /* If the first vector is traced, set the frame trace flag */
1703 b = vlib_get_buffer (vm, from[0]);
1704 if (b->flags & VLIB_BUFFER_IS_TRACED)
1705 f->frame_flags |= VLIB_NODE_FLAG_TRACE;
1707 to = vlib_frame_vector_args (f);
1709 n_left_to_node = elt->n_vectors;
1711 while (n_left_to_node >= 4)
1719 n_left_to_node -= 4;
1722 while (n_left_to_node > 0)
1730 vectors += elt->n_vectors;
1731 f->n_vectors = elt->n_vectors;
1732 vlib_put_frame_to_node (vm, fqm->node_index, f);
1736 elt->msg_type = 0xfefefefe;
1737 CLIB_MEMORY_BARRIER ();
1742 * Limit the number of packets pushed into the graph
1744 if (vectors >= fq->vector_threshold)
1746 fq->head_hint = fq->head;
1755 vlib_worker_thread_fn (void *arg)
1757 vlib_worker_thread_t *w = (vlib_worker_thread_t *) arg;
1758 vlib_thread_main_t *tm = vlib_get_thread_main ();
1759 vlib_main_t *vm = vlib_get_main ();
1762 ASSERT (vm->thread_index == vlib_get_thread_index ());
1764 vlib_worker_thread_init (w);
1765 clib_time_init (&vm->clib_time);
1766 clib_mem_set_heap (w->thread_mheap);
1768 e = vlib_call_init_exit_functions_no_sort
1769 (vm, &vm->worker_init_function_registrations, 1 /* call_once */ );
1771 clib_error_report (e);
1773 /* Wait until the dpdk init sequence is complete */
1774 while (tm->extern_thread_mgmt && tm->worker_thread_release == 0)
1775 vlib_worker_thread_barrier_check ();
1777 vlib_worker_loop (vm);
1781 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1784 .function = vlib_worker_thread_fn,
1789 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1791 vlib_thread_main_t *tm = vlib_get_thread_main ();
1792 vlib_frame_queue_main_t *fqm;
1793 vlib_frame_queue_t *fq;
1796 if (frame_queue_nelts == 0)
1797 frame_queue_nelts = FRAME_QUEUE_MAX_NELTS;
1799 ASSERT (frame_queue_nelts >= 8);
1801 vec_add2 (tm->frame_queue_mains, fqm, 1);
1803 fqm->node_index = node_index;
1804 fqm->frame_queue_nelts = frame_queue_nelts;
1805 fqm->queue_hi_thresh = frame_queue_nelts - 2;
1807 vec_validate (fqm->vlib_frame_queues, tm->n_vlib_mains - 1);
1808 vec_validate (fqm->per_thread_data, tm->n_vlib_mains - 1);
1809 _vec_len (fqm->vlib_frame_queues) = 0;
1810 for (i = 0; i < tm->n_vlib_mains; i++)
1812 vlib_frame_queue_per_thread_data_t *ptd;
1813 fq = vlib_frame_queue_alloc (frame_queue_nelts);
1814 vec_add1 (fqm->vlib_frame_queues, fq);
1816 ptd = vec_elt_at_index (fqm->per_thread_data, i);
1817 vec_validate (ptd->handoff_queue_elt_by_thread_index,
1818 tm->n_vlib_mains - 1);
1819 vec_validate_init_empty (ptd->congested_handoff_queue_by_thread_index,
1820 tm->n_vlib_mains - 1,
1821 (vlib_frame_queue_t *) (~0));
1824 return (fqm - tm->frame_queue_mains);
1828 vlib_thread_cb_register (struct vlib_main_t *vm, vlib_thread_callbacks_t * cb)
1830 vlib_thread_main_t *tm = vlib_get_thread_main ();
1832 if (tm->extern_thread_mgmt)
1835 tm->cb.vlib_launch_thread_cb = cb->vlib_launch_thread_cb;
1836 tm->extern_thread_mgmt = 1;
1841 vlib_process_signal_event_mt_helper (vlib_process_signal_event_mt_args_t *
1844 ASSERT (vlib_get_thread_index () == 0);
1845 vlib_process_signal_event (vlib_get_main (), args->node_index,
1846 args->type_opaque, args->data);
1849 void *rpc_call_main_thread_cb_fn;
1852 vlib_rpc_call_main_thread (void *callback, u8 * args, u32 arg_size)
1854 if (rpc_call_main_thread_cb_fn)
1856 void (*fp) (void *, u8 *, u32) = rpc_call_main_thread_cb_fn;
1857 (*fp) (callback, args, arg_size);
1860 clib_warning ("BUG: rpc_call_main_thread_cb_fn NULL!");
1864 threads_init (vlib_main_t * vm)
1869 VLIB_INIT_FUNCTION (threads_init);
1872 static clib_error_t *
1873 show_clock_command_fn (vlib_main_t * vm,
1874 unformat_input_t * input, vlib_cli_command_t * cmd)
1879 (void) unformat (input, "verbose %=", &verbose, 1);
1881 vlib_cli_output (vm, "%U", format_clib_time, &vm->clib_time, verbose);
1883 if (vec_len (vlib_mains) == 1)
1886 vlib_cli_output (vm, "Time last barrier release %.9f",
1887 vm->time_last_barrier_release);
1889 for (i = 1; i < vec_len (vlib_mains); i++)
1891 if (vlib_mains[i] == 0)
1894 vlib_cli_output (vm, "%d: %U", i, format_clib_time,
1895 &vlib_mains[i]->clib_time, verbose);
1897 vlib_cli_output (vm, "Thread %d offset %.9f error %.9f", i,
1898 vlib_mains[i]->time_offset,
1899 vm->time_last_barrier_release -
1900 vlib_mains[i]->time_last_barrier_release);
1906 VLIB_CLI_COMMAND (f_command, static) =
1908 .path = "show clock",
1909 .short_help = "show clock",
1910 .function = show_clock_command_fn,
1915 * fd.io coding-style-patch-verification: ON
1918 * eval: (c-set-style "gnu")