FD.io VPP  v17.01.1-3-gc6833f8
Vector Packet Processing
threads.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2015 Cisco and/or its affiliates.
3  * Licensed under the Apache License, Version 2.0 (the "License");
4  * you may not use this file except in compliance with the License.
5  * You may obtain a copy of the License at:
6  *
7  * http://www.apache.org/licenses/LICENSE-2.0
8  *
9  * Unless required by applicable law or agreed to in writing, software
10  * distributed under the License is distributed on an "AS IS" BASIS,
11  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12  * See the License for the specific language governing permissions and
13  * limitations under the License.
14  */
15 #define _GNU_SOURCE
16 
17 #include <signal.h>
18 #include <math.h>
19 #include <vppinfra/format.h>
20 #include <vlib/vlib.h>
21 
22 #include <vlib/threads.h>
23 #include <vlib/unix/cj.h>
24 
25 
26 #if DPDK==1
27 #include <rte_config.h>
28 #include <rte_common.h>
29 #include <rte_eal.h>
30 #include <rte_launch.h>
31 #include <rte_lcore.h>
32 #endif
34 
35 #define FRAME_QUEUE_NELTS 32
36 
37 
38 #if DPDK==1
39 /*
40  * Weak definitions of DPDK symbols used in this file.
41  * Needed for linking test programs without DPDK libs.
42  */
43 unsigned __thread __attribute__ ((weak)) RTE_PER_LCORE (_lcore_id);
44 struct lcore_config __attribute__ ((weak)) lcore_config[];
45 unsigned __attribute__ ((weak)) rte_socket_id ();
46 int __attribute__ ((weak)) rte_eal_remote_launch ();
47 #endif
48 u32
49 vl (void *p)
50 {
51  return vec_len (p);
52 }
53 
56 
57 uword
59 {
60  void *sp;
61  uword n;
62  u32 len;
63 
65  if (len == 0)
66  return 0;
67 
68  /* Get any old stack address. */
69  sp = &sp;
70 
71  n = ((uword) sp - (uword) vlib_thread_stacks[0])
73 
74  /* "processes" have their own stacks, and they always run in thread 0 */
75  n = n >= len ? 0 : n;
76 
77  return n;
78 }
79 
80 uword
82 {
83  u32 len;
84 
86  if (len == 0)
87  return 1;
88  else
89  return len;
90 }
91 
92 void
94 {
95  int pthread_setname_np (pthread_t __target_thread, const char *__name);
96  int rv;
97  pthread_t thread = pthread_self ();
98 
99  if (thread)
100  {
101  rv = pthread_setname_np (thread, name);
102  if (rv)
103  clib_warning ("pthread_setname_np returned %d", rv);
104  }
105 }
106 
107 static int
108 sort_registrations_by_no_clone (void *a0, void *a1)
109 {
110  vlib_thread_registration_t **tr0 = a0;
111  vlib_thread_registration_t **tr1 = a1;
112 
113  return ((i32) ((*tr0)->no_data_structure_clone)
114  - ((i32) ((*tr1)->no_data_structure_clone)));
115 }
116 
117 static uword *
119 {
120  FILE *fp;
121  uword *r = 0;
122 
123  fp = fopen (filename, "r");
124 
125  if (fp != NULL)
126  {
127  u8 *buffer = 0;
128  vec_validate (buffer, 256 - 1);
129  if (fgets ((char *) buffer, 256, fp))
130  {
131  unformat_input_t in;
132  unformat_init_string (&in, (char *) buffer,
133  strlen ((char *) buffer));
134  if (unformat (&in, "%U", unformat_bitmap_list, &r) != 1)
135  clib_warning ("unformat_bitmap_list failed");
136  unformat_free (&in);
137  }
138  vec_free (buffer);
139  fclose (fp);
140  }
141  return r;
142 }
143 
144 
145 /* Called early in the init sequence */
146 
147 clib_error_t *
149 {
153  u32 n_vlib_mains = 1;
154  u32 first_index = 1;
155  u32 i;
156  uword *avail_cpu;
157 
158  /* get bitmaps of active cpu cores and sockets */
159  tm->cpu_core_bitmap =
160  vlib_sysfs_list_to_bitmap ("/sys/devices/system/cpu/online");
161  tm->cpu_socket_bitmap =
162  vlib_sysfs_list_to_bitmap ("/sys/devices/system/node/online");
163 
164  avail_cpu = clib_bitmap_dup (tm->cpu_core_bitmap);
165 
166  /* skip cores */
167  for (i = 0; i < tm->skip_cores; i++)
168  {
169  uword c = clib_bitmap_first_set (avail_cpu);
170  if (c == ~0)
171  return clib_error_return (0, "no available cpus to skip");
172 
173  avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
174  }
175 
176  /* grab cpu for main thread */
177  if (!tm->main_lcore)
178  {
179  tm->main_lcore = clib_bitmap_first_set (avail_cpu);
180  if (tm->main_lcore == (u8) ~ 0)
181  return clib_error_return (0, "no available cpus to be used for the"
182  " main thread");
183  }
184  else
185  {
186  if (clib_bitmap_get (avail_cpu, tm->main_lcore) == 0)
187  return clib_error_return (0, "cpu %u is not available to be used"
188  " for the main thread", tm->main_lcore);
189  }
190  avail_cpu = clib_bitmap_set (avail_cpu, tm->main_lcore, 0);
191 
192  /* assume that there is socket 0 only if there is no data from sysfs */
193  if (!tm->cpu_socket_bitmap)
194  tm->cpu_socket_bitmap = clib_bitmap_set (0, 0, 1);
195 
196  /* pin main thread to main_lcore */
197 #if DPDK==0
198  {
199  cpu_set_t cpuset;
200  CPU_ZERO (&cpuset);
201  CPU_SET (tm->main_lcore, &cpuset);
202  pthread_setaffinity_np (pthread_self (), sizeof (cpu_set_t), &cpuset);
203  }
204 #endif
205 
206  /* as many threads as stacks... */
207  vec_validate_aligned (vlib_worker_threads, vec_len (vlib_thread_stacks) - 1,
209 
210  /* Preallocate thread 0 */
211  _vec_len (vlib_worker_threads) = 1;
215  w->lcore_id = tm->main_lcore;
216  w->lwp = syscall (SYS_gettid);
217  w->thread_id = pthread_self ();
218  tm->n_vlib_mains = 1;
219 
220  if (tm->sched_policy != ~0)
221  {
222  struct sched_param sched_param;
223  if (!sched_getparam (w->lwp, &sched_param))
224  {
225  if (tm->sched_priority != ~0)
226  sched_param.sched_priority = tm->sched_priority;
227  sched_setscheduler (w->lwp, tm->sched_policy, &sched_param);
228  }
229  }
230 
231  /* assign threads to cores and set n_vlib_mains */
232  tr = tm->next;
233 
234  while (tr)
235  {
236  vec_add1 (tm->registrations, tr);
237  tr = tr->next;
238  }
239 
241 
242  for (i = 0; i < vec_len (tm->registrations); i++)
243  {
244  int j;
245  tr = tm->registrations[i];
246  tr->first_index = first_index;
247  first_index += tr->count;
248  n_vlib_mains += (tr->no_data_structure_clone == 0) ? tr->count : 0;
249 
250  /* construct coremask */
251  if (tr->use_pthreads || !tr->count)
252  continue;
253 
254  if (tr->coremask)
255  {
256  uword c;
257  /* *INDENT-OFF* */
258  clib_bitmap_foreach (c, tr->coremask, ({
259  if (clib_bitmap_get(avail_cpu, c) == 0)
260  return clib_error_return (0, "cpu %u is not available to be used"
261  " for the '%s' thread",c, tr->name);
262 
263  avail_cpu = clib_bitmap_set(avail_cpu, c, 0);
264  }));
265 /* *INDENT-ON* */
266 
267  }
268  else
269  {
270  for (j = 0; j < tr->count; j++)
271  {
272  uword c = clib_bitmap_first_set (avail_cpu);
273  if (c == ~0)
274  return clib_error_return (0,
275  "no available cpus to be used for"
276  " the '%s' thread", tr->name);
277 
278  avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
279  tr->coremask = clib_bitmap_set (tr->coremask, c, 1);
280  }
281  }
282  }
283 
284  clib_bitmap_free (avail_cpu);
285 
286  tm->n_vlib_mains = n_vlib_mains;
287 
288  vec_validate_aligned (vlib_worker_threads, first_index - 1,
290 
291  return 0;
292 }
293 
296 {
298 
299  if (vec_len (vlib_worker_threads) >= vec_len (vlib_thread_stacks))
300  {
301  clib_warning ("out of worker threads... Quitting...");
302  exit (1);
303  }
304  vec_add2 (vlib_worker_threads, w, 1);
306  return w;
307 }
308 
311 {
312  vlib_frame_queue_t *fq;
313 
314  fq = clib_mem_alloc_aligned (sizeof (*fq), CLIB_CACHE_LINE_BYTES);
315  memset (fq, 0, sizeof (*fq));
316  fq->nelts = nelts;
317  fq->vector_threshold = 128; // packets
319 
320  if (1)
321  {
322  if (((uword) & fq->tail) & (CLIB_CACHE_LINE_BYTES - 1))
323  fformat (stderr, "WARNING: fq->tail unaligned\n");
324  if (((uword) & fq->head) & (CLIB_CACHE_LINE_BYTES - 1))
325  fformat (stderr, "WARNING: fq->head unaligned\n");
326  if (((uword) fq->elts) & (CLIB_CACHE_LINE_BYTES - 1))
327  fformat (stderr, "WARNING: fq->elts unaligned\n");
328 
329  if (sizeof (fq->elts[0]) % CLIB_CACHE_LINE_BYTES)
330  fformat (stderr, "WARNING: fq->elts[0] size %d\n",
331  sizeof (fq->elts[0]));
332  if (nelts & (nelts - 1))
333  {
334  fformat (stderr, "FATAL: nelts MUST be a power of 2\n");
335  abort ();
336  }
337  }
338 
339  return (fq);
340 }
341 
342 void vl_msg_api_handler_no_free (void *) __attribute__ ((weak));
343 void
345 {
346 }
347 
348 /* Turned off, save as reference material... */
349 #if 0
350 static inline int
351 vlib_frame_queue_dequeue_internal (int thread_id,
352  vlib_main_t * vm, vlib_node_main_t * nm)
353 {
354  vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
356  vlib_frame_t *f;
359  u32 node_runtime_index;
360  int msg_type;
361  u64 before;
362  int processed = 0;
363 
364  ASSERT (vm == vlib_mains[thread_id]);
365 
366  while (1)
367  {
368  if (fq->head == fq->tail)
369  return processed;
370 
371  elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
372 
373  if (!elt->valid)
374  return processed;
375 
376  before = clib_cpu_time_now ();
377 
378  f = elt->frame;
379  node_runtime_index = elt->node_runtime_index;
380  msg_type = elt->msg_type;
381 
382  switch (msg_type)
383  {
384  case VLIB_FRAME_QUEUE_ELT_FREE_BUFFERS:
386  /* note fallthrough... */
387  case VLIB_FRAME_QUEUE_ELT_FREE_FRAME:
389  node_runtime_index);
390  vlib_frame_free (vm, r, f);
391  break;
393  vec_add2 (vm->node_main.pending_frames, p, 1);
395  p->node_runtime_index = elt->node_runtime_index;
396  p->frame_index = vlib_frame_index (vm, f);
398  fq->dequeue_vectors += (u64) f->n_vectors;
399  break;
400  case VLIB_FRAME_QUEUE_ELT_API_MSG:
402  break;
403  default:
404  clib_warning ("bogus frame queue message, type %d", msg_type);
405  break;
406  }
407  elt->valid = 0;
408  fq->dequeues++;
409  fq->dequeue_ticks += clib_cpu_time_now () - before;
411  fq->head++;
412  processed++;
413  }
414  ASSERT (0);
415  return processed;
416 }
417 
418 int
419 vlib_frame_queue_dequeue (int thread_id,
420  vlib_main_t * vm, vlib_node_main_t * nm)
421 {
422  return vlib_frame_queue_dequeue_internal (thread_id, vm, nm);
423 }
424 
425 int
426 vlib_frame_queue_enqueue (vlib_main_t * vm, u32 node_runtime_index,
427  u32 frame_queue_index, vlib_frame_t * frame,
429 {
430  vlib_frame_queue_t *fq = vlib_frame_queues[frame_queue_index];
432  u32 save_count;
433  u64 new_tail;
434  u64 before = clib_cpu_time_now ();
435 
436  ASSERT (fq);
437 
438  new_tail = __sync_add_and_fetch (&fq->tail, 1);
439 
440  /* Wait until a ring slot is available */
441  while (new_tail >= fq->head + fq->nelts)
442  {
443  f64 b4 = vlib_time_now_ticks (vm, before);
445  /* Bad idea. Dequeue -> enqueue -> dequeue -> trouble */
446  // vlib_frame_queue_dequeue (vm->cpu_index, vm, nm);
447  }
448 
449  elt = fq->elts + (new_tail & (fq->nelts - 1));
450 
451  /* this would be very bad... */
452  while (elt->valid)
453  {
454  }
455 
456  /* Once we enqueue the frame, frame->n_vectors is owned elsewhere... */
457  save_count = frame->n_vectors;
458 
459  elt->frame = frame;
460  elt->node_runtime_index = node_runtime_index;
461  elt->msg_type = type;
463  elt->valid = 1;
464 
465  return save_count;
466 }
467 #endif /* 0 */
468 
469 /* To be called by vlib worker threads upon startup */
470 void
472 {
474 
475  /*
476  * Note: disabling signals in worker threads as follows
477  * prevents the api post-mortem dump scheme from working
478  * {
479  * sigset_t s;
480  * sigfillset (&s);
481  * pthread_sigmask (SIG_SETMASK, &s, 0);
482  * }
483  */
484 
486 
487  if (vec_len (tm->thread_prefix) && w->registration->short_name)
488  {
489  w->name = format (0, "%v_%s_%d%c", tm->thread_prefix,
490  w->registration->short_name, w->instance_id, '\0');
491  vlib_set_thread_name ((char *) w->name);
492  }
493 
494  if (!w->registration->use_pthreads)
495  {
496 
497  /* Initial barrier sync, for both worker and i/o threads */
498  clib_smp_atomic_add (vlib_worker_threads->workers_at_barrier, 1);
499 
500  while (*vlib_worker_threads->wait_at_barrier)
501  ;
502 
503  clib_smp_atomic_add (vlib_worker_threads->workers_at_barrier, -1);
504  }
505 }
506 
507 void *
509 {
510  void *rv;
511  vlib_worker_thread_t *w = arg;
512 
513  w->lwp = syscall (SYS_gettid);
514  w->thread_id = pthread_self ();
515 
516  rv = (void *) clib_calljmp
517  ((uword (*)(uword)) w->thread_function,
519  /* NOTREACHED, we hope */
520  return rv;
521 }
522 
523 static int
524 vlib_launch_thread (void *fp, vlib_worker_thread_t * w, unsigned lcore_id)
525 {
526  void *(*fp_arg) (void *) = fp;
527 
528  w->lcore_id = lcore_id;
529 #if DPDK==1
530  if (!w->registration->use_pthreads)
531  if (rte_eal_remote_launch) /* do we have dpdk linked */
532  return rte_eal_remote_launch (fp, (void *) w, lcore_id);
533  else
534  return -1;
535  else
536 #endif
537  {
538  int ret;
539  pthread_t worker;
540  cpu_set_t cpuset;
541  CPU_ZERO (&cpuset);
542  CPU_SET (lcore_id, &cpuset);
543 
544  ret = pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w);
545  if (ret == 0)
546  return pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset);
547  else
548  return ret;
549  }
550 }
551 
552 static clib_error_t *
554 {
555  int i, j;
557  vlib_main_t *vm_clone;
558  void *oldheap;
562  u32 n_vlib_mains = tm->n_vlib_mains;
563  u32 worker_thread_index;
564  u8 *main_heap = clib_mem_get_per_cpu_heap ();
565  mheap_t *main_heap_header = mheap_header (main_heap);
566 
567  vec_reset_length (vlib_worker_threads);
568 
569  /* Set up the main thread */
570  vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
571  w->elog_track.name = "main thread";
573 
574  if (vec_len (tm->thread_prefix))
575  {
576  w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
577  vlib_set_thread_name ((char *) w->name);
578  }
579 
580  /*
581  * Truth of the matter: we always use at least two
582  * threads. So, make the main heap thread-safe
583  * and make the event log thread-safe.
584  */
585  main_heap_header->flags |= MHEAP_FLAG_THREAD_SAFE;
586  vm->elog_main.lock =
588  vm->elog_main.lock[0] = 0;
589 
590  if (n_vlib_mains > 1)
591  {
593  _vec_len (vlib_mains) = 0;
594  vec_add1 (vlib_mains, vm);
595 
596  vlib_worker_threads->wait_at_barrier =
598  vlib_worker_threads->workers_at_barrier =
600 
601  /* Ask for an initial barrier sync */
602  *vlib_worker_threads->workers_at_barrier = 0;
603  *vlib_worker_threads->wait_at_barrier = 1;
604 
605  worker_thread_index = 1;
606 
607  for (i = 0; i < vec_len (tm->registrations); i++)
608  {
609  vlib_node_main_t *nm, *nm_clone;
610  vlib_buffer_main_t *bm_clone;
611  vlib_buffer_free_list_t *fl_clone, *fl_orig;
612  vlib_buffer_free_list_t *orig_freelist_pool;
613  int k;
614 
615  tr = tm->registrations[i];
616 
617  if (tr->count == 0)
618  continue;
619 
620  for (k = 0; k < tr->count; k++)
621  {
622  vec_add2 (vlib_worker_threads, w, 1);
623  if (tr->mheap_size)
624  w->thread_mheap =
625  mheap_alloc (0 /* use VM */ , tr->mheap_size);
626  else
627  w->thread_mheap = main_heap;
629  w->thread_function = tr->function;
630  w->thread_function_arg = w;
631  w->instance_id = k;
632  w->registration = tr;
633 
634  w->elog_track.name =
635  (char *) format (0, "%s %d", tr->name, k + 1);
636  vec_add1 (w->elog_track.name, 0);
638 
639  if (tr->no_data_structure_clone)
640  continue;
641 
642  /* Fork vlib_global_main et al. Look for bugs here */
643  oldheap = clib_mem_set_heap (w->thread_mheap);
644 
645  vm_clone = clib_mem_alloc (sizeof (*vm_clone));
646  clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
647 
648  vm_clone->cpu_index = worker_thread_index;
649  vm_clone->heap_base = w->thread_mheap;
650  vm_clone->mbuf_alloc_list = 0;
651  memset (&vm_clone->random_buffer, 0,
652  sizeof (vm_clone->random_buffer));
653 
654  nm = &vlib_mains[0]->node_main;
655  nm_clone = &vm_clone->node_main;
656  /* fork next frames array, preserving node runtime indices */
657  nm_clone->next_frames = vec_dup (nm->next_frames);
658  for (j = 0; j < vec_len (nm_clone->next_frames); j++)
659  {
660  vlib_next_frame_t *nf = &nm_clone->next_frames[j];
661  u32 save_node_runtime_index;
662  u32 save_flags;
663 
664  save_node_runtime_index = nf->node_runtime_index;
665  save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
667  nf->node_runtime_index = save_node_runtime_index;
668  nf->flags = save_flags;
669  }
670 
671  /* fork the frame dispatch queue */
672  nm_clone->pending_frames = 0;
673  vec_validate (nm_clone->pending_frames, 10); /* $$$$$?????? */
674  _vec_len (nm_clone->pending_frames) = 0;
675 
676  /* fork nodes */
677  nm_clone->nodes = 0;
678  for (j = 0; j < vec_len (nm->nodes); j++)
679  {
680  vlib_node_t *n;
681  n = clib_mem_alloc_no_fail (sizeof (*n));
682  clib_memcpy (n, nm->nodes[j], sizeof (*n));
683  /* none of the copied nodes have enqueue rights given out */
685  memset (&n->stats_total, 0, sizeof (n->stats_total));
686  memset (&n->stats_last_clear, 0,
687  sizeof (n->stats_last_clear));
688  vec_add1 (nm_clone->nodes, n);
689  }
692 
696  rt->cpu_index = vm_clone->cpu_index;
697 
698  nm_clone->processes = vec_dup (nm->processes);
699 
700  /* zap the (per worker) frame freelists, etc */
701  nm_clone->frame_sizes = 0;
702  nm_clone->frame_size_hash = 0;
703 
704  /* Packet trace buffers are guaranteed to be empty, nothing to do here */
705 
706  clib_mem_set_heap (oldheap);
707  vec_add1 (vlib_mains, vm_clone);
708 
709  vm_clone->error_main.counters =
710  vec_dup (vlib_mains[0]->error_main.counters);
711  vm_clone->error_main.counters_last_clear =
712  vec_dup (vlib_mains[0]->error_main.counters_last_clear);
713 
714  /* Fork the vlib_buffer_main_t free lists, etc. */
715  bm_clone = vec_dup (vm_clone->buffer_main);
716  vm_clone->buffer_main = bm_clone;
717 
718  orig_freelist_pool = bm_clone->buffer_free_list_pool;
719  bm_clone->buffer_free_list_pool = 0;
720 
721  /* *INDENT-OFF* */
722  pool_foreach (fl_orig, orig_freelist_pool,
723  ({
725  fl_clone, CLIB_CACHE_LINE_BYTES);
726  ASSERT (fl_orig - orig_freelist_pool
727  == fl_clone - bm_clone->buffer_free_list_pool);
728 
729  fl_clone[0] = fl_orig[0];
730  fl_clone->aligned_buffers = 0;
731  fl_clone->unaligned_buffers = 0;
732  fl_clone->n_alloc = 0;
733  }));
734 /* *INDENT-ON* */
735 
736  worker_thread_index++;
737  }
738  }
739  }
740  else
741  {
742  /* only have non-data-structure copy threads to create... */
743  for (i = 0; i < vec_len (tm->registrations); i++)
744  {
745  tr = tm->registrations[i];
746 
747  for (j = 0; j < tr->count; j++)
748  {
749  vec_add2 (vlib_worker_threads, w, 1);
750  if (tr->mheap_size)
751  w->thread_mheap =
752  mheap_alloc (0 /* use VM */ , tr->mheap_size);
753  else
754  w->thread_mheap = main_heap;
756  w->thread_function = tr->function;
757  w->thread_function_arg = w;
758  w->instance_id = j;
759  w->elog_track.name =
760  (char *) format (0, "%s %d", tr->name, j + 1);
761  w->registration = tr;
762  vec_add1 (w->elog_track.name, 0);
764  }
765  }
766  }
767 
768  worker_thread_index = 1;
769 
770  for (i = 0; i < vec_len (tm->registrations); i++)
771  {
772  int j;
773 
774  tr = tm->registrations[i];
775 
776  if (tr->use_pthreads || tm->use_pthreads)
777  {
778  for (j = 0; j < tr->count; j++)
779  {
780  w = vlib_worker_threads + worker_thread_index++;
782  0)
783  clib_warning ("Couldn't start '%s' pthread ", tr->name);
784  }
785  }
786  else
787  {
788  uword c;
789  /* *INDENT-OFF* */
790  clib_bitmap_foreach (c, tr->coremask, ({
791  w = vlib_worker_threads + worker_thread_index++;
792  if (vlib_launch_thread (vlib_worker_thread_bootstrap_fn, w, c) < 0)
793  clib_warning ("Couldn't start DPDK lcore %d", c);
794 
795  }));
796 /* *INDENT-ON* */
797  }
798  }
801  return 0;
802 }
803 
805 
806 void
808 {
809  int i, j;
811  vlib_main_t *vm;
812  vlib_node_main_t *nm, *nm_clone;
813  vlib_node_t **old_nodes_clone;
814  vlib_main_t *vm_clone;
815  vlib_node_runtime_t *rt, *old_rt;
816  void *oldheap;
817  never_inline void
820  uword n_calls,
821  uword n_vectors, uword n_clocks);
822 
823  ASSERT (os_get_cpu_number () == 0);
824 
825  if (vec_len (vlib_mains) == 0)
826  return;
827 
828  vm = vlib_mains[0];
829  nm = &vm->node_main;
830 
831  ASSERT (os_get_cpu_number () == 0);
832  ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
833 
834  /*
835  * Scrape all runtime stats, so we don't lose node runtime(s) with
836  * pending counts, or throw away worker / io thread counts.
837  */
838  for (j = 0; j < vec_len (nm->nodes); j++)
839  {
840  vlib_node_t *n;
841  n = nm->nodes[j];
842  vlib_node_sync_stats (vm, n);
843  }
844 
845  for (i = 1; i < vec_len (vlib_mains); i++)
846  {
847  vlib_node_t *n;
848 
849  vm_clone = vlib_mains[i];
850  nm_clone = &vm_clone->node_main;
851 
852  for (j = 0; j < vec_len (nm_clone->nodes); j++)
853  {
854  n = nm_clone->nodes[j];
855 
856  rt = vlib_node_get_runtime (vm_clone, n->index);
857  vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
858  }
859  }
860 
861  for (i = 1; i < vec_len (vlib_mains); i++)
862  {
864  w = vlib_worker_threads + i;
865  oldheap = clib_mem_set_heap (w->thread_mheap);
866 
867  vm_clone = vlib_mains[i];
868 
869  /* Re-clone error heap */
870  u64 *old_counters = vm_clone->error_main.counters;
871  u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
872  clib_memcpy (&vm_clone->error_main, &vm->error_main,
873  sizeof (vm->error_main));
874  j = vec_len (vm->error_main.counters) - 1;
875  vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
876  vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
877  vm_clone->error_main.counters = old_counters;
878  vm_clone->error_main.counters_last_clear = old_counters_all_clear;
879 
880  nm_clone = &vm_clone->node_main;
881  vec_free (nm_clone->next_frames);
882  nm_clone->next_frames = vec_dup (nm->next_frames);
883 
884  for (j = 0; j < vec_len (nm_clone->next_frames); j++)
885  {
886  vlib_next_frame_t *nf = &nm_clone->next_frames[j];
887  u32 save_node_runtime_index;
888  u32 save_flags;
889 
890  save_node_runtime_index = nf->node_runtime_index;
891  save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
893  nf->node_runtime_index = save_node_runtime_index;
894  nf->flags = save_flags;
895  }
896 
897  old_nodes_clone = nm_clone->nodes;
898  nm_clone->nodes = 0;
899 
900  /* re-fork nodes */
901  for (j = 0; j < vec_len (nm->nodes); j++)
902  {
903  vlib_node_t *old_n_clone;
904  vlib_node_t *new_n, *new_n_clone;
905 
906  new_n = nm->nodes[j];
907  old_n_clone = old_nodes_clone[j];
908 
909  new_n_clone = clib_mem_alloc_no_fail (sizeof (*new_n_clone));
910  clib_memcpy (new_n_clone, new_n, sizeof (*new_n));
911  /* none of the copied nodes have enqueue rights given out */
913 
914  if (j >= vec_len (old_nodes_clone))
915  {
916  /* new node, set to zero */
917  memset (&new_n_clone->stats_total, 0,
918  sizeof (new_n_clone->stats_total));
919  memset (&new_n_clone->stats_last_clear, 0,
920  sizeof (new_n_clone->stats_last_clear));
921  }
922  else
923  {
924  /* Copy stats if the old data is valid */
925  clib_memcpy (&new_n_clone->stats_total,
926  &old_n_clone->stats_total,
927  sizeof (new_n_clone->stats_total));
928  clib_memcpy (&new_n_clone->stats_last_clear,
929  &old_n_clone->stats_last_clear,
930  sizeof (new_n_clone->stats_last_clear));
931 
932  /* keep previous node state */
933  new_n_clone->state = old_n_clone->state;
934  }
935  vec_add1 (nm_clone->nodes, new_n_clone);
936  }
937  /* Free the old node clone */
938  for (j = 0; j < vec_len (old_nodes_clone); j++)
939  clib_mem_free (old_nodes_clone[j]);
940  vec_free (old_nodes_clone);
941 
943 
946 
947  /* clone input node runtime */
948  old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
949 
952 
954  {
955  rt->cpu_index = vm_clone->cpu_index;
956  }
957 
958  for (j = 0; j < vec_len (old_rt); j++)
959  {
960  rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
961  rt->state = old_rt[j].state;
962  }
963 
964  vec_free (old_rt);
965 
966  nm_clone->processes = vec_dup (nm->processes);
967 
968  clib_mem_set_heap (oldheap);
969 
970  // vnet_main_fork_fixup (i);
971  }
972 }
973 
974 u32
975 unformat_sched_policy (unformat_input_t * input, va_list * args)
976 {
977  u32 *r = va_arg (*args, u32 *);
978 
979  if (0);
980 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
982 #undef _
983  else
984  return 0;
985  return 1;
986 }
987 
988 static clib_error_t *
990 {
992  uword *p;
994  u8 *name;
995  u64 coremask;
996  uword *bitmap;
997  u32 count;
998 
1000 
1001  tm->n_thread_stacks = 1; /* account for main thread */
1002  tm->sched_policy = ~0;
1003  tm->sched_priority = ~0;
1004 
1005  tr = tm->next;
1006 
1007  while (tr)
1008  {
1010  tr = tr->next;
1011  }
1012 
1013  while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1014  {
1015  if (unformat (input, "use-pthreads"))
1016  tm->use_pthreads = 1;
1017  else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1018  ;
1019  else if (unformat (input, "main-core %u", &tm->main_lcore))
1020  ;
1021  else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1022  ;
1023  else if (unformat (input, "coremask-%s %llx", &name, &coremask))
1024  {
1026  if (p == 0)
1027  return clib_error_return (0, "no such thread type '%s'", name);
1028 
1029  tr = (vlib_thread_registration_t *) p[0];
1030 
1031  if (tr->use_pthreads)
1032  return clib_error_return (0,
1033  "coremask cannot be set for '%s' threads",
1034  name);
1035 
1037  (tr->coremask, 0, coremask, BITS (coremask));
1039  }
1040  else if (unformat (input, "corelist-%s %U", &name, unformat_bitmap_list,
1041  &bitmap))
1042  {
1044  if (p == 0)
1045  return clib_error_return (0, "no such thread type '%s'", name);
1046 
1047  tr = (vlib_thread_registration_t *) p[0];
1048 
1049  if (tr->use_pthreads)
1050  return clib_error_return (0,
1051  "corelist cannot be set for '%s' threads",
1052  name);
1053 
1054  tr->coremask = bitmap;
1056  }
1057  else
1058  if (unformat
1059  (input, "scheduler-policy %U", unformat_sched_policy,
1060  &tm->sched_policy))
1061  ;
1062  else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1063  ;
1064  else if (unformat (input, "%s %u", &name, &count))
1065  {
1067  if (p == 0)
1068  return clib_error_return (0, "no such thread type 3 '%s'", name);
1069 
1070  tr = (vlib_thread_registration_t *) p[0];
1071  if (tr->fixed_count)
1072  return clib_error_return
1073  (0, "number of %s threads not configurable", tr->name);
1074  tr->count = count;
1075  }
1076  else
1077  break;
1078  }
1079 
1080  if (tm->sched_priority != ~0)
1081  {
1082  if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1083  {
1084  u32 prio_max = sched_get_priority_max (tm->sched_policy);
1085  u32 prio_min = sched_get_priority_min (tm->sched_policy);
1086  if (tm->sched_priority > prio_max)
1087  tm->sched_priority = prio_max;
1088  if (tm->sched_priority < prio_min)
1089  tm->sched_priority = prio_min;
1090  }
1091  else
1092  {
1093  return clib_error_return
1094  (0,
1095  "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1096  tm->sched_priority);
1097  }
1098  }
1099  tr = tm->next;
1100 
1101  if (!tm->thread_prefix)
1102  tm->thread_prefix = format (0, "vpp");
1103 
1104  while (tr)
1105  {
1106  tm->n_thread_stacks += tr->count;
1107  tm->n_pthreads += tr->count * tr->use_pthreads;
1108  tm->n_eal_threads += tr->count * (tr->use_pthreads == 0);
1109  tr = tr->next;
1110  }
1111 
1112  return 0;
1113 }
1114 
1116 
1117 #if !defined (__x86_64__) && !defined (__aarch64__) && !defined (__powerpc64__) && !defined(__arm__)
1118 void
1119 __sync_fetch_and_add_8 (void)
1120 {
1121  fformat (stderr, "%s called\n", __FUNCTION__);
1122  abort ();
1123 }
1124 
1125 void
1126 __sync_add_and_fetch_8 (void)
1127 {
1128  fformat (stderr, "%s called\n", __FUNCTION__);
1129  abort ();
1130 }
1131 #endif
1132 
1133 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1134 void
1136 {
1137 }
1138 
1139 void
1141 {
1142  vlib_main_t *vm = vlib_get_main ();
1143 
1144  if (vlib_mains == 0)
1145  return;
1146 
1147  ASSERT (os_get_cpu_number () == 0);
1149 
1150  switch (which)
1151  {
1154  break;
1155 
1156  default:
1157  ASSERT (0);
1158  }
1160 }
1161 
1162 void
1164 {
1165  f64 deadline;
1166  u32 count;
1167 
1168  if (!vlib_mains)
1169  return;
1170 
1171  count = vec_len (vlib_mains) - 1;
1172 
1173  /* Tolerate recursive calls */
1174  if (++vlib_worker_threads[0].recursion_level > 1)
1175  return;
1176 
1177  vlib_worker_threads[0].barrier_sync_count++;
1178 
1179  ASSERT (os_get_cpu_number () == 0);
1180 
1181  deadline = vlib_time_now (vm) + BARRIER_SYNC_TIMEOUT;
1182 
1183  *vlib_worker_threads->wait_at_barrier = 1;
1184  while (*vlib_worker_threads->workers_at_barrier != count)
1185  {
1186  if (vlib_time_now (vm) > deadline)
1187  {
1188  fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1189  os_panic ();
1190  }
1191  }
1192 }
1193 
1194 void
1196 {
1197  f64 deadline;
1198 
1199  if (!vlib_mains)
1200  return;
1201 
1202  if (--vlib_worker_threads[0].recursion_level > 0)
1203  return;
1204 
1205  deadline = vlib_time_now (vm) + BARRIER_SYNC_TIMEOUT;
1206 
1207  *vlib_worker_threads->wait_at_barrier = 0;
1208 
1209  while (*vlib_worker_threads->workers_at_barrier > 0)
1210  {
1211  if (vlib_time_now (vm) > deadline)
1212  {
1213  fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1214  os_panic ();
1215  }
1216  }
1217 }
1218 
1219 /*
1220  * Check the frame queue to see if any frames are available.
1221  * If so, pull the packets off the frames and put them to
1222  * the handoff node.
1223  */
1224 static inline int
1227 {
1228  u32 thread_id = vm->cpu_index;
1229  vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1231  u32 *from, *to;
1232  vlib_frame_t *f;
1233  int msg_type;
1234  int processed = 0;
1235  u32 n_left_to_node;
1236  u32 vectors = 0;
1237 
1238  ASSERT (fq);
1239  ASSERT (vm == vlib_mains[thread_id]);
1240 
1241  if (PREDICT_FALSE (fqm->node_index == ~0))
1242  return 0;
1243  /*
1244  * Gather trace data for frame queues
1245  */
1246  if (PREDICT_FALSE (fq->trace))
1247  {
1248  frame_queue_trace_t *fqt;
1250  u32 elix;
1251 
1252  fqt = &fqm->frame_queue_traces[thread_id];
1253 
1254  fqt->nelts = fq->nelts;
1255  fqt->head = fq->head;
1256  fqt->head_hint = fq->head_hint;
1257  fqt->tail = fq->tail;
1258  fqt->threshold = fq->vector_threshold;
1259  fqt->n_in_use = fqt->tail - fqt->head;
1260  if (fqt->n_in_use >= fqt->nelts)
1261  {
1262  // if beyond max then use max
1263  fqt->n_in_use = fqt->nelts - 1;
1264  }
1265 
1266  /* Record the number of elements in use in the histogram */
1267  fqh = &fqm->frame_queue_histogram[thread_id];
1268  fqh->count[fqt->n_in_use]++;
1269 
1270  /* Record a snapshot of the elements in use */
1271  for (elix = 0; elix < fqt->nelts; elix++)
1272  {
1273  elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1274  if (1 || elt->valid)
1275  {
1276  fqt->n_vectors[elix] = elt->n_vectors;
1277  }
1278  }
1279  fqt->written = 1;
1280  }
1281 
1282  while (1)
1283  {
1284  if (fq->head == fq->tail)
1285  {
1286  fq->head_hint = fq->head;
1287  return processed;
1288  }
1289 
1290  elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1291 
1292  if (!elt->valid)
1293  {
1294  fq->head_hint = fq->head;
1295  return processed;
1296  }
1297 
1298  from = elt->buffer_index;
1299  msg_type = elt->msg_type;
1300 
1302  ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1303 
1304  f = vlib_get_frame_to_node (vm, fqm->node_index);
1305 
1306  to = vlib_frame_vector_args (f);
1307 
1308  n_left_to_node = elt->n_vectors;
1309 
1310  while (n_left_to_node >= 4)
1311  {
1312  to[0] = from[0];
1313  to[1] = from[1];
1314  to[2] = from[2];
1315  to[3] = from[3];
1316  to += 4;
1317  from += 4;
1318  n_left_to_node -= 4;
1319  }
1320 
1321  while (n_left_to_node > 0)
1322  {
1323  to[0] = from[0];
1324  to++;
1325  from++;
1326  n_left_to_node--;
1327  }
1328 
1329  vectors += elt->n_vectors;
1330  f->n_vectors = elt->n_vectors;
1331  vlib_put_frame_to_node (vm, fqm->node_index, f);
1332 
1333  elt->valid = 0;
1334  elt->n_vectors = 0;
1335  elt->msg_type = 0xfefefefe;
1337  fq->head++;
1338  processed++;
1339 
1340  /*
1341  * Limit the number of packets pushed into the graph
1342  */
1343  if (vectors >= fq->vector_threshold)
1344  {
1345  fq->head_hint = fq->head;
1346  return processed;
1347  }
1348  }
1349  ASSERT (0);
1350  return processed;
1351 }
1352 
1355 {
1356  vlib_node_main_t *nm = &vm->node_main;
1358  u64 cpu_time_now = clib_cpu_time_now ();
1360 
1362 
1363  while (1)
1364  {
1366 
1367  vec_foreach (fqm, tm->frame_queue_mains)
1369 
1372  {
1373  cpu_time_now = dispatch_node (vm, n, VLIB_NODE_TYPE_INPUT,
1374  VLIB_NODE_STATE_POLLING, /* frame */ 0,
1375  cpu_time_now);
1376  }
1377 
1378  /* Next handle interrupts. */
1379  {
1380  uword l = _vec_len (nm->pending_interrupt_node_runtime_indices);
1381  uword i;
1382  if (l > 0)
1383  {
1384  _vec_len (nm->pending_interrupt_node_runtime_indices) = 0;
1385  for (i = 0; i < l; i++)
1386  {
1388  nm->
1389  pending_interrupt_node_runtime_indices
1390  [i]);
1391  cpu_time_now =
1393  VLIB_NODE_STATE_INTERRUPT,
1394  /* frame */ 0,
1395  cpu_time_now);
1396  }
1397  }
1398  }
1399 
1400  if (_vec_len (nm->pending_frames))
1401  {
1402  int i;
1403  cpu_time_now = clib_cpu_time_now ();
1404  for (i = 0; i < _vec_len (nm->pending_frames); i++)
1405  {
1407 
1408  p = nm->pending_frames + i;
1409 
1410  cpu_time_now = dispatch_pending_node (vm, p, cpu_time_now);
1411  }
1412  _vec_len (nm->pending_frames) = 0;
1413  }
1415 
1416  /* Record time stamp in case there are no enabled nodes and above
1417  calls do not update time stamp. */
1418  cpu_time_now = clib_cpu_time_now ();
1419  }
1420 }
1421 
1422 void
1424 {
1426  vlib_main_t *vm = vlib_get_main ();
1427 
1428  ASSERT (vm->cpu_index == os_get_cpu_number ());
1429 
1431  clib_time_init (&vm->clib_time);
1433 
1434 #if DPDK > 0
1435  /* Wait until the dpdk init sequence is complete */
1437  while (tm->worker_thread_release == 0)
1439 #endif
1440 
1442 }
1443 
1444 /* *INDENT-OFF* */
1445 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1446  .name = "workers",
1447  .short_name = "wk",
1448  .function = vlib_worker_thread_fn,
1449 };
1450 /* *INDENT-ON* */
1451 
1452 u32
1453 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1454 {
1457  vlib_frame_queue_t *fq;
1458  int i;
1459 
1460  if (frame_queue_nelts == 0)
1461  frame_queue_nelts = FRAME_QUEUE_NELTS;
1462 
1463  vec_add2 (tm->frame_queue_mains, fqm, 1);
1464 
1465  fqm->node_index = node_index;
1466 
1468  _vec_len (fqm->vlib_frame_queues) = 0;
1469  for (i = 0; i < tm->n_vlib_mains; i++)
1470  {
1471  fq = vlib_frame_queue_alloc (frame_queue_nelts);
1472  vec_add1 (fqm->vlib_frame_queues, fq);
1473  }
1474 
1475  return (fqm - tm->frame_queue_mains);
1476 }
1477 
1478 clib_error_t *
1480 {
1481  return 0;
1482 }
1483 
1485 
1486 /*
1487  * fd.io coding-style-patch-verification: ON
1488  *
1489  * Local Variables:
1490  * eval: (c-set-style "gnu")
1491  * End:
1492  */
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:396
u32 vl(void *p)
Definition: threads.c:49
sll srl srl sll sra u16x4 i
Definition: vector_sse2.h:343
uword unformat(unformat_input_t *i, char *fmt,...)
Definition: unformat.c:966
vlib_process_t ** processes
Definition: node.h:670
int vlib_frame_queue_enqueue(vlib_main_t *vm, u32 node_runtime_index, u32 frame_queue_index, vlib_frame_t *frame, vlib_frame_queue_msg_type_t type)
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:23
bad routing header type(not 4)") sr_error (NO_MORE_SEGMENTS
#define VLIB_MAIN_LOOP_ENTER_FUNCTION(x)
Definition: init.h:113
word elog_track_register(elog_main_t *em, elog_track_t *t)
Definition: elog.c:190
void * mheap_alloc(void *memory, uword size)
Definition: mheap.c:953
static void vlib_increment_main_loop_counter(vlib_main_t *vm)
Definition: main.h:284
#define UNFORMAT_END_OF_INPUT
Definition: format.h:143
#define NULL
Definition: clib.h:55
u32 index
Definition: node.h:237
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:182
#define vec_add2_aligned(V, P, N, A)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:533
clib_error_t * threads_init(vlib_main_t *vm)
Definition: threads.c:1479
void os_panic(void)
Definition: unix-misc.c:172
u32 vlib_frame_queue_main_init(u32 node_index, u32 frame_queue_nelts)
Definition: threads.c:1453
void * thread_function_arg
Definition: threads.h:98
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:482
static int sort_registrations_by_no_clone(void *a0, void *a1)
Definition: threads.c:108
static u64 clib_cpu_time_now(void)
Definition: time.h:73
frame_queue_trace_t * frame_queue_traces
Definition: threads.h:149
elog_track_t elog_track
Definition: threads.h:100
#define VLIB_FRAME_NO_FREE_AFTER_DISPATCH
Definition: node.h:365
#define vec_add2(V, P, N)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:521
static mheap_t * mheap_header(u8 *v)
vlib_buffer_main_t * buffer_main
Definition: main.h:104
void vnet_main_fixup(vlib_fork_fixup_t which)
Definition: threads.c:1135
static uword * clib_bitmap_set(uword *ai, uword i, uword value)
Sets the ith bit of a bitmap to new_value Removes trailing zeros from the bitmap. ...
Definition: bitmap.h:167
#define hash_set_mem(h, key, value)
Definition: hash.h:274
clib_time_t clib_time
Definition: main.h:62
void vlib_worker_thread_fn(void *arg)
Definition: threads.c:1423
u32 unformat_sched_policy(unformat_input_t *input, va_list *args)
Definition: threads.c:975
#define vec_validate_aligned(V, I, A)
Make sure vector is long enough for given index (no header, specified alignment)
Definition: vec.h:407
struct vlib_thread_registration_ * next
Definition: threads.h:31
#define MHEAP_FLAG_THREAD_SAFE
u32 buffer_index[VLIB_FRAME_SIZE]
Definition: threads.h:82
volatile u32 valid
Definition: threads.h:76
#define vec_alloc(V, N)
Allocate space for N more elements (no header, unspecified alignment)
Definition: vec.h:239
#define clib_bitmap_dup(v)
Duplicate a bitmap.
Definition: bitmap.h:87
#define vec_reset_length(v)
Reset vector length to zero NULL-pointer tolerant.
u8 state
Definition: node.h:265
u64 * counters_last_clear
Definition: error.h:81
static void vlib_worker_thread_barrier_check(void)
Definition: threads.h:214
#define VLIB_LOG2_THREAD_STACK_SIZE
Definition: threads.h:65
u32 * pending_interrupt_node_runtime_indices
Definition: node.h:643
vlib_thread_registration_t * next
Definition: threads.h:269
vlib_node_stats_t stats_last_clear
Definition: node.h:231
#define static_always_inline
Definition: clib.h:85
#define clib_smp_atomic_add(addr, increment)
Definition: smp.h:46
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:348
void vlib_worker_thread_node_runtime_update(void)
Definition: threads.c:807
u64 count[FRAME_QUEUE_MAX_NELTS]
Definition: node.h:714
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:111
u64 dispatch_pending_node(vlib_main_t *vm, vlib_pending_frame_t *p, u64 last_time_stamp)
Definition: main.c:1089
vlib_worker_thread_t * vlib_alloc_thread(vlib_main_t *vm)
Definition: threads.c:295
vlib_frame_queue_msg_type_t
Definition: threads.h:68
never_inline void vlib_node_runtime_sync_stats(vlib_main_t *vm, vlib_node_runtime_t *r, uword n_calls, uword n_vectors, uword n_clocks)
Definition: main.c:545
vlib_node_t ** nodes
Definition: node.h:630
int i32
Definition: types.h:81
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
uword * lock
Definition: elog.h:162
uword * cpu_core_bitmap
Definition: threads.h:306
static void unformat_free(unformat_input_t *i)
Definition: format.h:161
u32 cpu_index
Definition: main.h:159
#define clib_warning(format, args...)
Definition: error.h:59
unsigned long u64
Definition: types.h:89
static int vlib_launch_thread(void *fp, vlib_worker_thread_t *w, unsigned lcore_id)
Definition: threads.c:524
vlib_frame_queue_elt_t * elts
Definition: threads.h:138
void unformat_init_string(unformat_input_t *input, char *string, int string_len)
Definition: unformat.c:1017
vlib_node_runtime_t * nodes_by_type[VLIB_N_NODE_TYPE]
Definition: node.h:640
void vlib_set_thread_name(char *name)
Definition: threads.c:93
void vl_msg_api_handler_no_free(void *)
Definition: threads.c:344
#define hash_create_string(elts, value_bytes)
Definition: hash.h:652
vlib_fork_fixup_t
Definition: threads.h:205
#define BARRIER_SYNC_TIMEOUT
Definition: threads.h:187
VLIB_REGISTER_THREAD(worker_thread_reg, static)
unsigned __thread RTE_PER_LCORE(_lcore_id)
vlib_worker_thread_t * vlib_worker_threads
Definition: threads.c:54
#define clib_bitmap_foreach(i, ai, body)
Macro to iterate across set bits in a bitmap.
Definition: bitmap.h:361
void * thread_mheap
Definition: threads.h:95
u32 next_frame_index
Definition: node.h:406
int rte_eal_remote_launch()
vlib_node_stats_t stats_total
Definition: node.h:227
volatile u64 head
Definition: threads.h:125
static_always_inline void vlib_worker_thread_internal(vlib_main_t *vm)
Definition: threads.c:1354
static uword clib_bitmap_first_set(uword *ai)
Return the lowest numbered set bit in a bitmap.
Definition: bitmap.h:385
static int vlib_frame_queue_dequeue_internal(vlib_main_t *vm, vlib_frame_queue_main_t *fqm)
Definition: threads.c:1225
vlib_error_main_t error_main
Definition: main.h:124
static u32 vlib_frame_index(vlib_main_t *vm, vlib_frame_t *f)
Definition: node_funcs.h:231
void vlib_frame_free(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_frame_t *f)
Definition: main.c:216
#define v
Definition: acl.c:314
char * name
Definition: elog.h:106
#define vec_dup(V)
Return copy of vector (no header, no alignment)
Definition: vec.h:334
static void * clib_mem_get_per_cpu_heap(void)
Definition: mem.h:55
#define PREDICT_FALSE(x)
Definition: clib.h:97
#define VLIB_FRAME_PENDING
Definition: node.h:376
#define VLIB_FRAME_SIZE
Definition: node.h:328
void vlib_put_frame_to_node(vlib_main_t *vm, u32 to_node_index, vlib_frame_t *f)
Definition: main.c:196
#define VLIB_FRAME_FREE_AFTER_DISPATCH
Definition: node.h:379
void clib_time_init(clib_time_t *c)
Definition: time.c:169
uword * frame_size_hash
Definition: node.h:685
vlib_thread_main_t vlib_thread_main
Definition: threads.c:55
void(* thread_function)(void *)
Definition: threads.h:97
static clib_error_t * cpu_config(vlib_main_t *vm, unformat_input_t *input)
Definition: threads.c:989
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P (general version).
Definition: pool.h:169
i32 n_vectors[FRAME_QUEUE_MAX_NELTS]
Definition: node.h:709
u64 * counters
Definition: error.h:78
u32 owner_node_index
Definition: node.h:308
vlib_frame_queue_t * vlib_frame_queue_alloc(int nelts)
Definition: threads.c:310
uword os_get_ncpus(void)
Definition: threads.c:81
volatile u64 tail
Definition: threads.h:117
#define clib_mem_alloc_no_fail(size)
Definition: mem.h:153
#define VLIB_EARLY_CONFIG_FUNCTION(x, n,...)
Definition: init.h:139
svmdb_client_t * c
u16 n_vectors
Definition: node.h:344
vlib_frame_queue_t ** vlib_frame_queues
Definition: threads.h:146
u32 node_runtime_index
Definition: node.h:400
vlib_pending_frame_t * pending_frames
Definition: node.h:655
vlib_thread_function_t * function
Definition: threads.h:36
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:300
void * heap_base
Definition: main.h:101
static vlib_thread_main_t * vlib_get_thread_main()
Definition: global_funcs.h:32
static void * clib_mem_set_heap(void *heap)
Definition: mem.h:223
static vlib_node_runtime_t * vlib_node_get_runtime(vlib_main_t *vm, u32 node_index)
Get node runtime by node index.
Definition: node_funcs.h:88
#define clib_memcpy(a, b, c)
Definition: string.h:69
elog_main_t elog_main
Definition: main.h:141
frame_queue_nelt_counter_t * frame_queue_histogram
Definition: threads.h:150
static uword * clib_bitmap_set_multiple(uword *bitmap, uword i, uword value, uword n_bits)
sets the ith through ith + n_bits bits in a bitmap
Definition: bitmap.h:275
void vlib_worker_thread_barrier_sync(vlib_main_t *vm)
Definition: threads.c:1163
static uword clib_bitmap_get(uword *ai, uword i)
Gets the ith bit value from a bitmap.
Definition: bitmap.h:197
static void vlib_next_frame_init(vlib_next_frame_t *nf)
Definition: node.h:389
void vlib_worker_thread_init(vlib_worker_thread_t *w)
Definition: threads.c:471
static void * clib_mem_get_heap(void)
Definition: mem.h:217
int vlib_frame_queue_dequeue(int thread_id, vlib_main_t *vm, vlib_node_main_t *nm)
volatile u32 * wait_at_barrier
Definition: threads.h:90
#define FRAME_QUEUE_NELTS
Definition: threads.c:35
#define never_inline
Definition: clib.h:81
#define ASSERT(truth)
unsigned int u32
Definition: types.h:88
vlib_frame_queue_main_t * frame_queue_mains
Definition: threads.h:312
void vlib_buffer_free(vlib_main_t *vm, u32 *buffers, u32 n_buffers)
Free buffers Frees the entire buffer chain for each buffer.
u16 flags
Definition: node.h:335
static void clib_mem_free(void *p)
Definition: mem.h:176
#define clib_bitmap_free(v)
Free a bitmap.
Definition: bitmap.h:92
uword * thread_registrations_by_name
Definition: threads.h:274
static void * clib_mem_alloc(uword size)
Definition: mem.h:109
u64 uword
Definition: types.h:112
static uword clib_bitmap_count_set_bits(uword *ai)
Return the number of set bits in a bitmap.
Definition: bitmap.h:441
void ** mbuf_alloc_list
Definition: main.h:161
static clib_error_t * start_workers(vlib_main_t *vm)
Definition: threads.c:553
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
double f64
Definition: types.h:142
unsigned char u8
Definition: types.h:56
#define VLIB_PENDING_FRAME_NO_NEXT_FRAME
Definition: node.h:409
DECLARE_CJ_GLOBAL_LOG
Definition: threads.c:33
vlib_node_main_t node_main
Definition: main.h:115
static uword unformat_bitmap_list(unformat_input_t *input, va_list *va)
unformat a list of bit ranges into a bitmap (eg "0-3,5-7,11" )
Definition: bitmap.h:693
vlib_buffer_free_list_t * buffer_free_list_pool
Definition: buffer.h:309
vlib_next_frame_t * next_frames
Definition: node.h:652
#define vec_sort_with_function(vec, f)
Sort a vector using the supplied element comparison function.
Definition: vec.h:920
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:253
vlib_main_t ** vlib_mains
uword os_get_cpu_number(void)
Definition: threads.c:58
volatile u64 head_hint
Definition: threads.h:134
word fformat(FILE *f, char *fmt,...)
Definition: format.c:452
#define VLIB_THREAD_STACK_SIZE
Definition: threads.h:66
vlib_frame_size_t * frame_sizes
Definition: node.h:688
void vlib_node_sync_stats(vlib_main_t *vm, vlib_node_t *n)
Definition: main.c:575
#define hash_get_mem(h, key)
Definition: hash.h:268
static void * clib_mem_alloc_aligned(uword size, uword align)
Definition: mem.h:117
volatile u32 * workers_at_barrier
Definition: threads.h:91
uword clib_calljmp(uword(*func)(uword func_arg), uword func_arg, void *stack)
u64 dispatch_node(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_node_type_t type, vlib_node_state_t dispatch_state, vlib_frame_t *frame, u64 last_time_stamp)
Definition: main.c:921
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:169
void vlib_worker_thread_barrier_release(vlib_main_t *vm)
Definition: threads.c:1195
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:418
#define VLIB_INVALID_NODE_INDEX
Definition: node.h:325
static f64 vlib_time_now_ticks(vlib_main_t *vm, u64 n)
Definition: main.h:188
#define vec_foreach(var, vec)
Vector iterator.
void * vlib_worker_thread_bootstrap_fn(void *arg)
Definition: threads.c:508
#define CLIB_MEMORY_BARRIER()
Definition: clib.h:101
u32 node_runtime_index
Definition: node.h:359
uword * cpu_socket_bitmap
Definition: threads.h:309
static uword * vlib_sysfs_list_to_bitmap(char *filename)
Definition: threads.c:118
#define foreach_sched_policy
Definition: threads.h:251
#define clib_error_return(e, args...)
Definition: error.h:111
struct _unformat_input_t unformat_input_t
vlib_thread_registration_t ** registrations
Definition: threads.h:272
vlib_frame_t * vlib_get_frame_to_node(vlib_main_t *vm, u32 to_node_index)
Definition: main.c:187
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:67
u8 ** vlib_thread_stacks
Definition: main.c:475
pthread_t thread_id
Definition: threads.h:108
vlib_thread_registration_t * registration
Definition: threads.h:102
#define BITS(x)
Definition: clib.h:58
volatile u32 worker_thread_release
Definition: threads.h:315
void vlib_worker_thread_fork_fixup(vlib_fork_fixup_t which)
Definition: threads.c:1140
clib_random_buffer_t random_buffer
Definition: main.h:153
clib_error_t * vlib_thread_init(vlib_main_t *vm)
Definition: threads.c:148