FD.io VPP  v16.12-rc0-308-g931be3a
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 
55 
56 uword
58 {
59  void *sp;
60  uword n;
61  u32 len;
62 
64  if (len == 0)
65  return 0;
66 
67  /* Get any old stack address. */
68  sp = &sp;
69 
70  n = ((uword) sp - (uword) vlib_thread_stacks[0])
72 
73  /* "processes" have their own stacks, and they always run in thread 0 */
74  n = n >= len ? 0 : n;
75 
76  return n;
77 }
78 
79 uword
81 {
82  u32 len;
83 
85  if (len == 0)
86  return 1;
87  else
88  return len;
89 }
90 
91 void
93 {
94  int pthread_setname_np (pthread_t __target_thread, const char *__name);
95  int rv;
96  pthread_t thread = pthread_self ();
97 
98  if (thread)
99  {
100  rv = pthread_setname_np (thread, name);
101  if (rv)
102  clib_warning ("pthread_setname_np returned %d", rv);
103  }
104 }
105 
106 static int
107 sort_registrations_by_no_clone (void *a0, void *a1)
108 {
109  vlib_thread_registration_t **tr0 = a0;
110  vlib_thread_registration_t **tr1 = a1;
111 
112  return ((i32) ((*tr0)->no_data_structure_clone)
113  - ((i32) ((*tr1)->no_data_structure_clone)));
114 }
115 
116 static uword *
118 {
119  FILE *fp;
120  uword *r = 0;
121 
122  fp = fopen (filename, "r");
123 
124  if (fp != NULL)
125  {
126  u8 *buffer = 0;
127  vec_validate (buffer, 256 - 1);
128  if (fgets ((char *) buffer, 256, fp))
129  {
130  unformat_input_t in;
131  unformat_init_string (&in, (char *) buffer,
132  strlen ((char *) buffer));
133  if (unformat (&in, "%U", unformat_bitmap_list, &r) != 1)
134  clib_warning ("unformat_bitmap_list failed");
135  unformat_free (&in);
136  }
137  vec_free (buffer);
138  fclose (fp);
139  }
140  return r;
141 }
142 
143 
144 /* Called early in the init sequence */
145 
146 clib_error_t *
148 {
152  u32 n_vlib_mains = 1;
153  u32 first_index = 1;
154  u32 i;
155  uword *avail_cpu;
156 
157  /* get bitmaps of active cpu cores and sockets */
158  tm->cpu_core_bitmap =
159  vlib_sysfs_list_to_bitmap ("/sys/devices/system/cpu/online");
160  tm->cpu_socket_bitmap =
161  vlib_sysfs_list_to_bitmap ("/sys/devices/system/node/online");
162 
163  avail_cpu = clib_bitmap_dup (tm->cpu_core_bitmap);
164 
165  /* skip cores */
166  for (i = 0; i < tm->skip_cores; i++)
167  {
168  uword c = clib_bitmap_first_set (avail_cpu);
169  if (c == ~0)
170  return clib_error_return (0, "no available cpus to skip");
171 
172  avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
173  }
174 
175  /* grab cpu for main thread */
176  if (!tm->main_lcore)
177  {
178  tm->main_lcore = clib_bitmap_first_set (avail_cpu);
179  if (tm->main_lcore == (u8) ~ 0)
180  return clib_error_return (0, "no available cpus to be used for the"
181  " main thread");
182  }
183  else
184  {
185  if (clib_bitmap_get (avail_cpu, tm->main_lcore) == 0)
186  return clib_error_return (0, "cpu %u is not available to be used"
187  " for the main thread", tm->main_lcore);
188  }
189  avail_cpu = clib_bitmap_set (avail_cpu, tm->main_lcore, 0);
190 
191  /* assume that there is socket 0 only if there is no data from sysfs */
192  if (!tm->cpu_socket_bitmap)
193  tm->cpu_socket_bitmap = clib_bitmap_set (0, 0, 1);
194 
195  /* pin main thread to main_lcore */
196 #if DPDK==0
197  {
198  cpu_set_t cpuset;
199  CPU_ZERO (&cpuset);
200  CPU_SET (tm->main_lcore, &cpuset);
201  pthread_setaffinity_np (pthread_self (), sizeof (cpu_set_t), &cpuset);
202  }
203 #endif
204 
205  /* as many threads as stacks... */
208 
209  /* Preallocate thread 0 */
210  _vec_len (vlib_worker_threads) = 1;
214  w->lcore_id = tm->main_lcore;
215  w->lwp = syscall (SYS_gettid);
216  w->thread_id = pthread_self ();
217  tm->n_vlib_mains = 1;
218 
219  if (tm->sched_policy != ~0)
220  {
221  struct sched_param sched_param;
222  if (!sched_getparam (w->lwp, &sched_param))
223  {
224  if (tm->sched_priority != ~0)
225  sched_param.sched_priority = tm->sched_priority;
226  sched_setscheduler (w->lwp, tm->sched_policy, &sched_param);
227  }
228  }
229 
230  /* assign threads to cores and set n_vlib_mains */
231  tr = tm->next;
232 
233  while (tr)
234  {
235  vec_add1 (tm->registrations, tr);
236  tr = tr->next;
237  }
238 
240 
241  for (i = 0; i < vec_len (tm->registrations); i++)
242  {
243  int j;
244  tr = tm->registrations[i];
245  tr->first_index = first_index;
246  first_index += tr->count;
247  n_vlib_mains += (tr->no_data_structure_clone == 0) ? tr->count : 0;
248 
249  /* construct coremask */
250  if (tr->use_pthreads || !tr->count)
251  continue;
252 
253  if (tr->coremask)
254  {
255  uword c;
256  /* *INDENT-OFF* */
257  clib_bitmap_foreach (c, tr->coremask, ({
258  if (clib_bitmap_get(avail_cpu, c) == 0)
259  return clib_error_return (0, "cpu %u is not available to be used"
260  " for the '%s' thread",c, tr->name);
261 
262  avail_cpu = clib_bitmap_set(avail_cpu, c, 0);
263  }));
264 /* *INDENT-ON* */
265 
266  }
267  else
268  {
269  for (j = 0; j < tr->count; j++)
270  {
271  uword c = clib_bitmap_first_set (avail_cpu);
272  if (c == ~0)
273  return clib_error_return (0,
274  "no available cpus to be used for"
275  " the '%s' thread", tr->name);
276 
277  avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
278  tr->coremask = clib_bitmap_set (tr->coremask, c, 1);
279  }
280  }
281  }
282 
283  clib_bitmap_free (avail_cpu);
284 
285  tm->n_vlib_mains = n_vlib_mains;
286 
287  vec_validate_aligned (vlib_worker_threads, first_index - 1,
289 
290 
293  FRAME_QUEUE_NELTS) / 100);
294  return 0;
295 }
296 
299 {
301 
303  {
304  clib_warning ("out of worker threads... Quitting...");
305  exit (1);
306  }
309  return w;
310 }
311 
314 {
315  vlib_frame_queue_t *fq;
316 
317  fq = clib_mem_alloc_aligned (sizeof (*fq), CLIB_CACHE_LINE_BYTES);
318  memset (fq, 0, sizeof (*fq));
319  fq->nelts = nelts;
320  fq->vector_threshold = 128; // packets
322 
323  if (1)
324  {
325  if (((uword) & fq->tail) & (CLIB_CACHE_LINE_BYTES - 1))
326  fformat (stderr, "WARNING: fq->tail unaligned\n");
327  if (((uword) & fq->head) & (CLIB_CACHE_LINE_BYTES - 1))
328  fformat (stderr, "WARNING: fq->head unaligned\n");
329  if (((uword) fq->elts) & (CLIB_CACHE_LINE_BYTES - 1))
330  fformat (stderr, "WARNING: fq->elts unaligned\n");
331 
332  if (sizeof (fq->elts[0]) % CLIB_CACHE_LINE_BYTES)
333  fformat (stderr, "WARNING: fq->elts[0] size %d\n",
334  sizeof (fq->elts[0]));
335  if (nelts & (nelts - 1))
336  {
337  fformat (stderr, "FATAL: nelts MUST be a power of 2\n");
338  abort ();
339  }
340  }
341 
342  return (fq);
343 }
344 
345 void vl_msg_api_handler_no_free (void *) __attribute__ ((weak));
346 void
348 {
349 }
350 
351 /* Turned off, save as reference material... */
352 #if 0
353 static inline int
354 vlib_frame_queue_dequeue_internal (int thread_id,
355  vlib_main_t * vm, vlib_node_main_t * nm)
356 {
357  vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
359  vlib_frame_t *f;
362  u32 node_runtime_index;
363  int msg_type;
364  u64 before;
365  int processed = 0;
366 
367  ASSERT (vm == vlib_mains[thread_id]);
368 
369  while (1)
370  {
371  if (fq->head == fq->tail)
372  return processed;
373 
374  elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
375 
376  if (!elt->valid)
377  return processed;
378 
379  before = clib_cpu_time_now ();
380 
381  f = elt->frame;
382  node_runtime_index = elt->node_runtime_index;
383  msg_type = elt->msg_type;
384 
385  switch (msg_type)
386  {
387  case VLIB_FRAME_QUEUE_ELT_FREE_BUFFERS:
389  /* note fallthrough... */
390  case VLIB_FRAME_QUEUE_ELT_FREE_FRAME:
392  node_runtime_index);
393  vlib_frame_free (vm, r, f);
394  break;
396  vec_add2 (vm->node_main.pending_frames, p, 1);
398  p->node_runtime_index = elt->node_runtime_index;
399  p->frame_index = vlib_frame_index (vm, f);
401  fq->dequeue_vectors += (u64) f->n_vectors;
402  break;
403  case VLIB_FRAME_QUEUE_ELT_API_MSG:
405  break;
406  default:
407  clib_warning ("bogus frame queue message, type %d", msg_type);
408  break;
409  }
410  elt->valid = 0;
411  fq->dequeues++;
412  fq->dequeue_ticks += clib_cpu_time_now () - before;
414  fq->head++;
415  processed++;
416  }
417  ASSERT (0);
418  return processed;
419 }
420 
421 int
422 vlib_frame_queue_dequeue (int thread_id,
423  vlib_main_t * vm, vlib_node_main_t * nm)
424 {
425  return vlib_frame_queue_dequeue_internal (thread_id, vm, nm);
426 }
427 
428 int
429 vlib_frame_queue_enqueue (vlib_main_t * vm, u32 node_runtime_index,
430  u32 frame_queue_index, vlib_frame_t * frame,
432 {
433  vlib_frame_queue_t *fq = vlib_frame_queues[frame_queue_index];
435  u32 save_count;
436  u64 new_tail;
437  u64 before = clib_cpu_time_now ();
438 
439  ASSERT (fq);
440 
441  new_tail = __sync_add_and_fetch (&fq->tail, 1);
442 
443  /* Wait until a ring slot is available */
444  while (new_tail >= fq->head + fq->nelts)
445  {
446  f64 b4 = vlib_time_now_ticks (vm, before);
448  /* Bad idea. Dequeue -> enqueue -> dequeue -> trouble */
449  // vlib_frame_queue_dequeue (vm->cpu_index, vm, nm);
450  }
451 
452  elt = fq->elts + (new_tail & (fq->nelts - 1));
453 
454  /* this would be very bad... */
455  while (elt->valid)
456  {
457  }
458 
459  /* Once we enqueue the frame, frame->n_vectors is owned elsewhere... */
460  save_count = frame->n_vectors;
461 
462  elt->frame = frame;
463  elt->node_runtime_index = node_runtime_index;
464  elt->msg_type = type;
466  elt->valid = 1;
467 
468  return save_count;
469 }
470 #endif /* 0 */
471 
472 /* To be called by vlib worker threads upon startup */
473 void
475 {
477 
478  /* worker threads wants no signals. */
479  {
480  sigset_t s;
481  sigfillset (&s);
482  pthread_sigmask (SIG_SETMASK, &s, 0);
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 */
499 
501  ;
502 
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;
559  vlib_frame_queue_t *fq;
563  u32 n_vlib_mains = tm->n_vlib_mains;
564  u32 worker_thread_index;
565  u8 *main_heap = clib_mem_get_per_cpu_heap ();
566  mheap_t *main_heap_header = mheap_header (main_heap);
567 
569 
570  /* Set up the main thread */
572  w->elog_track.name = "main thread";
574 
575  if (vec_len (tm->thread_prefix))
576  {
577  w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
578  vlib_set_thread_name ((char *) w->name);
579  }
580 
581  /*
582  * Truth of the matter: we always use at least two
583  * threads. So, make the main heap thread-safe
584  * and make the event log thread-safe.
585  */
586  main_heap_header->flags |= MHEAP_FLAG_THREAD_SAFE;
587  vm->elog_main.lock =
589  vm->elog_main.lock[0] = 0;
590 
591  if (n_vlib_mains > 1)
592  {
594  _vec_len (vlib_mains) = 0;
595  vec_add1 (vlib_mains, vm);
596 
598  _vec_len (vlib_frame_queues) = 0;
601 
606 
607  /* Ask for an initial barrier sync */
610 
611  worker_thread_index = 1;
612 
613  for (i = 0; i < vec_len (tm->registrations); i++)
614  {
615  vlib_node_main_t *nm, *nm_clone;
616  vlib_buffer_main_t *bm_clone;
617  vlib_buffer_free_list_t *fl_clone, *fl_orig;
618  vlib_buffer_free_list_t *orig_freelist_pool;
619  int k;
620 
621  tr = tm->registrations[i];
622 
623  if (tr->count == 0)
624  continue;
625 
626  for (k = 0; k < tr->count; k++)
627  {
629  if (tr->mheap_size)
630  w->thread_mheap =
631  mheap_alloc (0 /* use VM */ , tr->mheap_size);
632  else
633  w->thread_mheap = main_heap;
635  w->thread_function = tr->function;
636  w->thread_function_arg = w;
637  w->instance_id = k;
638  w->registration = tr;
639 
640  w->elog_track.name =
641  (char *) format (0, "%s %d", tr->name, k + 1);
642  vec_add1 (w->elog_track.name, 0);
644 
645  if (tr->no_data_structure_clone)
646  continue;
647 
648  /* Allocate "to-worker-N" frame queue */
649  if (tr->frame_queue_nelts)
650  {
652  }
653  else
654  {
656  }
657 
658  vec_validate (vlib_frame_queues, worker_thread_index);
659  vlib_frame_queues[worker_thread_index] = fq;
660 
661  /* Fork vlib_global_main et al. Look for bugs here */
662  oldheap = clib_mem_set_heap (w->thread_mheap);
663 
664  vm_clone = clib_mem_alloc (sizeof (*vm_clone));
665  clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
666 
667  vm_clone->cpu_index = worker_thread_index;
668  vm_clone->heap_base = w->thread_mheap;
669  vm_clone->mbuf_alloc_list = 0;
670  memset (&vm_clone->random_buffer, 0,
671  sizeof (vm_clone->random_buffer));
672 
673  nm = &vlib_mains[0]->node_main;
674  nm_clone = &vm_clone->node_main;
675  /* fork next frames array, preserving node runtime indices */
676  nm_clone->next_frames = vec_dup (nm->next_frames);
677  for (j = 0; j < vec_len (nm_clone->next_frames); j++)
678  {
679  vlib_next_frame_t *nf = &nm_clone->next_frames[j];
680  u32 save_node_runtime_index;
681  u32 save_flags;
682 
683  save_node_runtime_index = nf->node_runtime_index;
684  save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
686  nf->node_runtime_index = save_node_runtime_index;
687  nf->flags = save_flags;
688  }
689 
690  /* fork the frame dispatch queue */
691  nm_clone->pending_frames = 0;
692  vec_validate (nm_clone->pending_frames, 10); /* $$$$$?????? */
693  _vec_len (nm_clone->pending_frames) = 0;
694 
695  /* fork nodes */
696  nm_clone->nodes = 0;
697  for (j = 0; j < vec_len (nm->nodes); j++)
698  {
699  vlib_node_t *n;
700  n = clib_mem_alloc_no_fail (sizeof (*n));
701  clib_memcpy (n, nm->nodes[j], sizeof (*n));
702  /* none of the copied nodes have enqueue rights given out */
704  memset (&n->stats_total, 0, sizeof (n->stats_total));
705  memset (&n->stats_last_clear, 0,
706  sizeof (n->stats_last_clear));
707  vec_add1 (nm_clone->nodes, n);
708  }
711 
715  rt->cpu_index = vm_clone->cpu_index;
716 
717  nm_clone->processes = vec_dup (nm->processes);
718 
719  /* zap the (per worker) frame freelists, etc */
720  nm_clone->frame_sizes = 0;
721  nm_clone->frame_size_hash = 0;
722 
723  /* Packet trace buffers are guaranteed to be empty, nothing to do here */
724 
725  clib_mem_set_heap (oldheap);
726  vec_add1 (vlib_mains, vm_clone);
727 
728  vm_clone->error_main.counters =
729  vec_dup (vlib_mains[0]->error_main.counters);
730  vm_clone->error_main.counters_last_clear =
731  vec_dup (vlib_mains[0]->error_main.counters_last_clear);
732 
733  /* Fork the vlib_buffer_main_t free lists, etc. */
734  bm_clone = vec_dup (vm_clone->buffer_main);
735  vm_clone->buffer_main = bm_clone;
736 
737  orig_freelist_pool = bm_clone->buffer_free_list_pool;
738  bm_clone->buffer_free_list_pool = 0;
739 
740  /* *INDENT-OFF* */
741  pool_foreach (fl_orig, orig_freelist_pool,
742  ({
744  fl_clone, CLIB_CACHE_LINE_BYTES);
745  ASSERT (fl_orig - orig_freelist_pool
746  == fl_clone - bm_clone->buffer_free_list_pool);
747 
748  fl_clone[0] = fl_orig[0];
749  fl_clone->aligned_buffers = 0;
750  fl_clone->unaligned_buffers = 0;
751  fl_clone->n_alloc = 0;
752  }));
753 /* *INDENT-ON* */
754 
755  worker_thread_index++;
756  }
757  }
758  }
759  else
760  {
761  /* only have non-data-structure copy threads to create... */
762  for (i = 0; i < vec_len (tm->registrations); i++)
763  {
764  tr = tm->registrations[i];
765 
766  for (j = 0; j < tr->count; j++)
767  {
769  if (tr->mheap_size)
770  w->thread_mheap =
771  mheap_alloc (0 /* use VM */ , tr->mheap_size);
772  else
773  w->thread_mheap = main_heap;
775  w->thread_function = tr->function;
776  w->thread_function_arg = w;
777  w->instance_id = j;
778  w->elog_track.name =
779  (char *) format (0, "%s %d", tr->name, j + 1);
780  w->registration = tr;
781  vec_add1 (w->elog_track.name, 0);
783  }
784  }
785  }
786 
787  worker_thread_index = 1;
788 
789  for (i = 0; i < vec_len (tm->registrations); i++)
790  {
791  int j;
792 
793  tr = tm->registrations[i];
794 
795  if (tr->use_pthreads || tm->use_pthreads)
796  {
797  for (j = 0; j < tr->count; j++)
798  {
799  w = vlib_worker_threads + worker_thread_index++;
801  0)
802  clib_warning ("Couldn't start '%s' pthread ", tr->name);
803  }
804  }
805  else
806  {
807  uword c;
808  /* *INDENT-OFF* */
809  clib_bitmap_foreach (c, tr->coremask, ({
810  w = vlib_worker_threads + worker_thread_index++;
811  if (vlib_launch_thread (vlib_worker_thread_bootstrap_fn, w, c) < 0)
812  clib_warning ("Couldn't start DPDK lcore %d", c);
813 
814  }));
815 /* *INDENT-ON* */
816  }
817  }
820  return 0;
821 }
822 
824 
825 void
827 {
828  int i, j;
830  vlib_main_t *vm;
831  vlib_node_main_t *nm, *nm_clone;
832  vlib_node_t **old_nodes_clone;
833  vlib_main_t *vm_clone;
834  vlib_node_runtime_t *rt, *old_rt;
835  void *oldheap;
836  never_inline void
839  uword n_calls,
840  uword n_vectors, uword n_clocks);
841 
842  ASSERT (os_get_cpu_number () == 0);
843 
844  if (vec_len (vlib_mains) == 0)
845  return;
846 
847  vm = vlib_mains[0];
848  nm = &vm->node_main;
849 
850  ASSERT (os_get_cpu_number () == 0);
852 
853  /*
854  * Scrape all runtime stats, so we don't lose node runtime(s) with
855  * pending counts, or throw away worker / io thread counts.
856  */
857  for (j = 0; j < vec_len (nm->nodes); j++)
858  {
859  vlib_node_t *n;
860  n = nm->nodes[j];
861  vlib_node_sync_stats (vm, n);
862  }
863 
864  for (i = 1; i < vec_len (vlib_mains); i++)
865  {
866  vlib_node_t *n;
867 
868  vm_clone = vlib_mains[i];
869  nm_clone = &vm_clone->node_main;
870 
871  for (j = 0; j < vec_len (nm_clone->nodes); j++)
872  {
873  n = nm_clone->nodes[j];
874 
875  rt = vlib_node_get_runtime (vm_clone, n->index);
876  vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
877  }
878  }
879 
880  for (i = 1; i < vec_len (vlib_mains); i++)
881  {
883  w = vlib_worker_threads + i;
884  oldheap = clib_mem_set_heap (w->thread_mheap);
885 
886  vm_clone = vlib_mains[i];
887 
888  /* Re-clone error heap */
889  u64 *old_counters = vm_clone->error_main.counters;
890  u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
891  clib_memcpy (&vm_clone->error_main, &vm->error_main,
892  sizeof (vm->error_main));
893  j = vec_len (vm->error_main.counters) - 1;
894  vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
895  vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
896  vm_clone->error_main.counters = old_counters;
897  vm_clone->error_main.counters_last_clear = old_counters_all_clear;
898 
899  nm_clone = &vm_clone->node_main;
900  vec_free (nm_clone->next_frames);
901  nm_clone->next_frames = vec_dup (nm->next_frames);
902 
903  for (j = 0; j < vec_len (nm_clone->next_frames); j++)
904  {
905  vlib_next_frame_t *nf = &nm_clone->next_frames[j];
906  u32 save_node_runtime_index;
907  u32 save_flags;
908 
909  save_node_runtime_index = nf->node_runtime_index;
910  save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
912  nf->node_runtime_index = save_node_runtime_index;
913  nf->flags = save_flags;
914  }
915 
916  old_nodes_clone = nm_clone->nodes;
917  nm_clone->nodes = 0;
918 
919  /* re-fork nodes */
920  for (j = 0; j < vec_len (nm->nodes); j++)
921  {
922  vlib_node_t *old_n_clone;
923  vlib_node_t *new_n, *new_n_clone;
924 
925  new_n = nm->nodes[j];
926  old_n_clone = old_nodes_clone[j];
927 
928  new_n_clone = clib_mem_alloc_no_fail (sizeof (*new_n_clone));
929  clib_memcpy (new_n_clone, new_n, sizeof (*new_n));
930  /* none of the copied nodes have enqueue rights given out */
932 
933  if (j >= vec_len (old_nodes_clone))
934  {
935  /* new node, set to zero */
936  memset (&new_n_clone->stats_total, 0,
937  sizeof (new_n_clone->stats_total));
938  memset (&new_n_clone->stats_last_clear, 0,
939  sizeof (new_n_clone->stats_last_clear));
940  }
941  else
942  {
943  /* Copy stats if the old data is valid */
944  clib_memcpy (&new_n_clone->stats_total,
945  &old_n_clone->stats_total,
946  sizeof (new_n_clone->stats_total));
947  clib_memcpy (&new_n_clone->stats_last_clear,
948  &old_n_clone->stats_last_clear,
949  sizeof (new_n_clone->stats_last_clear));
950 
951  /* keep previous node state */
952  new_n_clone->state = old_n_clone->state;
953  }
954  vec_add1 (nm_clone->nodes, new_n_clone);
955  }
956  /* Free the old node clone */
957  for (j = 0; j < vec_len (old_nodes_clone); j++)
958  clib_mem_free (old_nodes_clone[j]);
959  vec_free (old_nodes_clone);
960 
962 
965 
966  /* clone input node runtime */
967  old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
968 
971 
973  {
974  rt->cpu_index = vm_clone->cpu_index;
975  }
976 
977  for (j = 0; j < vec_len (old_rt); j++)
978  {
979  rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
980  rt->state = old_rt[j].state;
981  }
982 
983  vec_free (old_rt);
984 
985  nm_clone->processes = vec_dup (nm->processes);
986 
987  clib_mem_set_heap (oldheap);
988 
989  // vnet_main_fork_fixup (i);
990  }
991 }
992 
993 u32
994 unformat_sched_policy (unformat_input_t * input, va_list * args)
995 {
996  u32 *r = va_arg (*args, u32 *);
997 
998  if (0);
999 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1001 #undef _
1002  else
1003  return 0;
1004  return 1;
1005 }
1006 
1007 static clib_error_t *
1009 {
1011  uword *p;
1013  u8 *name;
1014  u64 coremask;
1015  uword *bitmap;
1016  u32 count;
1017 
1019 
1020  tm->n_thread_stacks = 1; /* account for main thread */
1021  tm->sched_policy = ~0;
1022  tm->sched_priority = ~0;
1023 
1024  tr = tm->next;
1025 
1026  while (tr)
1027  {
1029  tr = tr->next;
1030  }
1031 
1032  while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1033  {
1034  if (unformat (input, "use-pthreads"))
1035  tm->use_pthreads = 1;
1036  else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1037  ;
1038  else if (unformat (input, "main-core %u", &tm->main_lcore))
1039  ;
1040  else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1041  ;
1042  else if (unformat (input, "coremask-%s %llx", &name, &coremask))
1043  {
1045  if (p == 0)
1046  return clib_error_return (0, "no such thread type '%s'", name);
1047 
1048  tr = (vlib_thread_registration_t *) p[0];
1049 
1050  if (tr->use_pthreads)
1051  return clib_error_return (0,
1052  "coremask cannot be set for '%s' threads",
1053  name);
1054 
1056  (tr->coremask, 0, coremask, BITS (coremask));
1058  }
1059  else if (unformat (input, "corelist-%s %U", &name, unformat_bitmap_list,
1060  &bitmap))
1061  {
1063  if (p == 0)
1064  return clib_error_return (0, "no such thread type '%s'", name);
1065 
1066  tr = (vlib_thread_registration_t *) p[0];
1067 
1068  if (tr->use_pthreads)
1069  return clib_error_return (0,
1070  "corelist cannot be set for '%s' threads",
1071  name);
1072 
1073  tr->coremask = bitmap;
1075  }
1076  else
1077  if (unformat
1078  (input, "scheduler-policy %U", unformat_sched_policy,
1079  &tm->sched_policy))
1080  ;
1081  else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1082  ;
1083  else if (unformat (input, "%s %u", &name, &count))
1084  {
1086  if (p == 0)
1087  return clib_error_return (0, "no such thread type 3 '%s'", name);
1088 
1089  tr = (vlib_thread_registration_t *) p[0];
1090  if (tr->fixed_count)
1091  return clib_error_return
1092  (0, "number of %s threads not configurable", tr->name);
1093  tr->count = count;
1094  }
1095  else
1096  break;
1097  }
1098 
1099  if (tm->sched_priority != ~0)
1100  {
1101  if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1102  {
1103  u32 prio_max = sched_get_priority_max (tm->sched_policy);
1104  u32 prio_min = sched_get_priority_min (tm->sched_policy);
1105  if (tm->sched_priority > prio_max)
1106  tm->sched_priority = prio_max;
1107  if (tm->sched_priority < prio_min)
1108  tm->sched_priority = prio_min;
1109  }
1110  else
1111  {
1112  return clib_error_return
1113  (0,
1114  "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1115  tm->sched_priority);
1116  }
1117  }
1118  tr = tm->next;
1119 
1120  if (!tm->thread_prefix)
1121  tm->thread_prefix = format (0, "vpp");
1122 
1123  while (tr)
1124  {
1125  tm->n_thread_stacks += tr->count;
1126  tm->n_pthreads += tr->count * tr->use_pthreads;
1127  tm->n_eal_threads += tr->count * (tr->use_pthreads == 0);
1128  tr = tr->next;
1129  }
1130 
1131  return 0;
1132 }
1133 
1135 
1136 #if !defined (__x86_64__) && !defined (__aarch64__) && !defined (__powerpc64__) && !defined(__arm__)
1137 void
1138 __sync_fetch_and_add_8 (void)
1139 {
1140  fformat (stderr, "%s called\n", __FUNCTION__);
1141  abort ();
1142 }
1143 
1144 void
1145 __sync_add_and_fetch_8 (void)
1146 {
1147  fformat (stderr, "%s called\n", __FUNCTION__);
1148  abort ();
1149 }
1150 #endif
1151 
1152 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1153 void
1155 {
1156 }
1157 
1158 void
1160 {
1161  vlib_main_t *vm = vlib_get_main ();
1162 
1163  if (vlib_mains == 0)
1164  return;
1165 
1166  ASSERT (os_get_cpu_number () == 0);
1168 
1169  switch (which)
1170  {
1173  break;
1174 
1175  default:
1176  ASSERT (0);
1177  }
1179 }
1180 
1181 void
1183 {
1184  f64 deadline;
1185  u32 count;
1186 
1187  if (!vlib_mains)
1188  return;
1189 
1190  count = vec_len (vlib_mains) - 1;
1191 
1192  /* Tolerate recursive calls */
1193  if (++vlib_worker_threads[0].recursion_level > 1)
1194  return;
1195 
1197 
1198  ASSERT (os_get_cpu_number () == 0);
1199 
1200  deadline = vlib_time_now (vm) + BARRIER_SYNC_TIMEOUT;
1201 
1203  while (*vlib_worker_threads->workers_at_barrier != count)
1204  {
1205  if (vlib_time_now (vm) > deadline)
1206  {
1207  fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1208  os_panic ();
1209  }
1210  }
1211 }
1212 
1213 void
1215 {
1216  f64 deadline;
1217 
1218  if (!vlib_mains)
1219  return;
1220 
1221  if (--vlib_worker_threads[0].recursion_level > 0)
1222  return;
1223 
1224  deadline = vlib_time_now (vm) + BARRIER_SYNC_TIMEOUT;
1225 
1227 
1229  {
1230  if (vlib_time_now (vm) > deadline)
1231  {
1232  fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1233  os_panic ();
1234  }
1235  }
1236 }
1237 
1238 /*
1239  * Check the frame queue to see if any frames are available.
1240  * If so, pull the packets off the frames and put them to
1241  * the handoff node.
1242  */
1243 static inline int
1245 {
1246  u32 thread_id = vm->cpu_index;
1247  vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
1249  u32 *from, *to;
1250  vlib_frame_t *f;
1251  int msg_type;
1252  int processed = 0;
1253  u32 n_left_to_node;
1254  u32 vectors = 0;
1256 
1257  ASSERT (fq);
1258  ASSERT (vm == vlib_mains[thread_id]);
1259 
1261  return 0;
1262  /*
1263  * Gather trace data for frame queues
1264  */
1265  if (PREDICT_FALSE (fq->trace))
1266  {
1267  frame_queue_trace_t *fqt;
1269  u32 elix;
1270 
1271  fqt = &tm->frame_queue_traces[thread_id];
1272 
1273  fqt->nelts = fq->nelts;
1274  fqt->head = fq->head;
1275  fqt->head_hint = fq->head_hint;
1276  fqt->tail = fq->tail;
1277  fqt->threshold = fq->vector_threshold;
1278  fqt->n_in_use = fqt->tail - fqt->head;
1279  if (fqt->n_in_use >= fqt->nelts)
1280  {
1281  // if beyond max then use max
1282  fqt->n_in_use = fqt->nelts - 1;
1283  }
1284 
1285  /* Record the number of elements in use in the histogram */
1286  fqh = &tm->frame_queue_histogram[thread_id];
1287  fqh->count[fqt->n_in_use]++;
1288 
1289  /* Record a snapshot of the elements in use */
1290  for (elix = 0; elix < fqt->nelts; elix++)
1291  {
1292  elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1293  if (1 || elt->valid)
1294  {
1295  fqt->n_vectors[elix] = elt->n_vectors;
1296  }
1297  }
1298  fqt->written = 1;
1299  }
1300 
1301  while (1)
1302  {
1303  if (fq->head == fq->tail)
1304  {
1305  fq->head_hint = fq->head;
1306  return processed;
1307  }
1308 
1309  elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1310 
1311  if (!elt->valid)
1312  {
1313  fq->head_hint = fq->head;
1314  return processed;
1315  }
1316 
1317  from = elt->buffer_index;
1318  msg_type = elt->msg_type;
1319 
1321  ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1322 
1324 
1325  to = vlib_frame_vector_args (f);
1326 
1327  n_left_to_node = elt->n_vectors;
1328 
1329  while (n_left_to_node >= 4)
1330  {
1331  to[0] = from[0];
1332  to[1] = from[1];
1333  to[2] = from[2];
1334  to[3] = from[3];
1335  to += 4;
1336  from += 4;
1337  n_left_to_node -= 4;
1338  }
1339 
1340  while (n_left_to_node > 0)
1341  {
1342  to[0] = from[0];
1343  to++;
1344  from++;
1345  n_left_to_node--;
1346  }
1347 
1348  vectors += elt->n_vectors;
1349  f->n_vectors = elt->n_vectors;
1351 
1352  elt->valid = 0;
1353  elt->n_vectors = 0;
1354  elt->msg_type = 0xfefefefe;
1356  fq->head++;
1357  processed++;
1358 
1359  /*
1360  * Limit the number of packets pushed into the graph
1361  */
1362  if (vectors >= fq->vector_threshold)
1363  {
1364  fq->head_hint = fq->head;
1365  return processed;
1366  }
1367  }
1368  ASSERT (0);
1369  return processed;
1370 }
1371 
1374 {
1375  vlib_node_main_t *nm = &vm->node_main;
1376  u64 cpu_time_now = clib_cpu_time_now ();
1377 
1379 
1380  while (1)
1381  {
1383 
1385 
1388  {
1389  cpu_time_now = dispatch_node (vm, n, VLIB_NODE_TYPE_INPUT,
1390  VLIB_NODE_STATE_POLLING, /* frame */ 0,
1391  cpu_time_now);
1392  }
1393 
1394  /* Next handle interrupts. */
1395  {
1396  uword l = _vec_len (nm->pending_interrupt_node_runtime_indices);
1397  uword i;
1398  if (l > 0)
1399  {
1400  _vec_len (nm->pending_interrupt_node_runtime_indices) = 0;
1401  for (i = 0; i < l; i++)
1402  {
1404  nm->
1405  pending_interrupt_node_runtime_indices
1406  [i]);
1407  cpu_time_now =
1409  VLIB_NODE_STATE_INTERRUPT,
1410  /* frame */ 0,
1411  cpu_time_now);
1412  }
1413  }
1414  }
1415 
1416  if (_vec_len (nm->pending_frames))
1417  {
1418  int i;
1419  cpu_time_now = clib_cpu_time_now ();
1420  for (i = 0; i < _vec_len (nm->pending_frames); i++)
1421  {
1423 
1424  p = nm->pending_frames + i;
1425 
1426  cpu_time_now = dispatch_pending_node (vm, p, cpu_time_now);
1427  }
1428  _vec_len (nm->pending_frames) = 0;
1429  }
1431 
1432  /* Record time stamp in case there are no enabled nodes and above
1433  calls do not update time stamp. */
1434  cpu_time_now = clib_cpu_time_now ();
1435  }
1436 }
1437 
1438 void
1440 {
1443  vlib_main_t *vm = vlib_get_main ();
1444 
1445  ASSERT (vm->cpu_index == os_get_cpu_number ());
1446 
1448  clib_time_init (&vm->clib_time);
1450 
1451  /* Wait until the dpdk init sequence is complete */
1452  while (tm->worker_thread_release == 0)
1454 
1456 }
1457 
1458 /* *INDENT-OFF* */
1459 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1460  .name = "workers",
1461  .short_name = "wk",
1462  .function = vlib_worker_thread_fn,
1463 };
1464 /* *INDENT-ON* */
1465 
1466 clib_error_t *
1468 {
1470 
1471  tm->handoff_dispatch_node_index = ~0;
1472 
1473  return 0;
1474 }
1475 
1477 
1478 /*
1479  * fd.io coding-style-patch-verification: ON
1480  *
1481  * Local Variables:
1482  * eval: (c-set-style "gnu")
1483  * End:
1484  */
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:396
#define VLIB_EFD_DEF_WORKER_HI_THRESH_PCT
Definition: threads.h:249
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:673
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:1467
void os_panic(void)
Definition: unix-misc.c:172
void * thread_function_arg
Definition: threads.h:99
#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:107
static u64 clib_cpu_time_now(void)
Definition: time.h:73
elog_track_t elog_track
Definition: threads.h:101
frame_queue_trace_t * frame_queue_traces
Definition: threads.h:328
#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:1154
vlib_worker_thread_t * vlib_worker_threads
Definition: threads.h:112
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:1439
u32 unformat_sched_policy(unformat_input_t *input, va_list *args)
Definition: threads.c:994
#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:81
volatile u32 valid
Definition: threads.h:75
#define vec_alloc(V, N)
Allocate space for N more elements (no header, unspecified alignment)
Definition: vec.h:239
u32 handoff_dispatch_node_index
Definition: threads.h:325
#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:206
#define VLIB_LOG2_THREAD_STACK_SIZE
Definition: threads.h:65
u32 * pending_interrupt_node_runtime_indices
Definition: node.h:646
vlib_thread_registration_t * next
Definition: threads.h:280
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:826
u64 count[FRAME_QUEUE_MAX_NELTS]
Definition: node.h:717
#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:1087
vlib_worker_thread_t * vlib_alloc_thread(vlib_main_t *vm)
Definition: threads.c:298
vlib_frame_queue_msg_type_t
Definition: threads.h:68
u16 queue_hi_thresh
Definition: threads.h:255
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:543
vlib_node_t ** nodes
Definition: node.h:633
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:317
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:139
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:643
vlib_frame_queue_t ** vlib_frame_queues
Definition: threads.h:144
void vlib_set_thread_name(char *name)
Definition: threads.c:92
void vl_msg_api_handler_no_free(void *)
Definition: threads.c:347
#define hash_create_string(elts, value_bytes)
Definition: hash.h:652
vlib_fork_fixup_t
Definition: threads.h:197
#define BARRIER_SYNC_TIMEOUT
Definition: threads.h:179
vlib_main_t ** vlib_mains
Definition: dpdk_buffer.c:157
VLIB_REGISTER_THREAD(worker_thread_reg, static)
unsigned __thread RTE_PER_LCORE(_lcore_id)
#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:96
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:126
static_always_inline void vlib_worker_thread_internal(vlib_main_t *vm)
Definition: threads.c:1373
static uword clib_bitmap_first_set(uword *ai)
Return the lowest numbered set bit in a bitmap.
Definition: bitmap.h:385
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:214
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:194
#define VLIB_FRAME_FREE_AFTER_DISPATCH
Definition: node.h:379
void clib_time_init(clib_time_t *c)
Definition: time.c:165
uword * frame_size_hash
Definition: node.h:688
vlib_thread_main_t vlib_thread_main
Definition: threads.c:54
void(* thread_function)(void *)
Definition: threads.h:98
static clib_error_t * cpu_config(vlib_main_t *vm, unformat_input_t *input)
Definition: threads.c:1008
#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:712
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:313
uword os_get_ncpus(void)
Definition: threads.c:80
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
u32 node_runtime_index
Definition: node.h:400
vlib_pending_frame_t * pending_frames
Definition: node.h:658
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:64
elog_main_t elog_main
Definition: main.h:141
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:1182
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:474
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:91
#define FRAME_QUEUE_NELTS
Definition: threads.c:35
#define never_inline
Definition: clib.h:81
frame_queue_nelt_counter_t * frame_queue_histogram
Definition: threads.h:329
#define ASSERT(truth)
unsigned int u32
Definition: types.h:88
void vlib_buffer_free(vlib_main_t *vm, u32 *buffers, u32 n_buffers)
Free buffers Frees the entire buffer chain for each buffer.
Definition: dpdk_buffer.c:766
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:285
static void * clib_mem_alloc(uword size)
Definition: mem.h:109
#define VLIB_EFD_DISABLED
Definition: threads.h:245
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:305
vlib_next_frame_t * next_frames
Definition: node.h:655
#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
uword os_get_cpu_number(void)
Definition: threads.c:57
volatile u64 head_hint
Definition: threads.h:135
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:691
void vlib_node_sync_stats(vlib_main_t *vm, vlib_node_t *n)
Definition: main.c:573
#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:92
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:919
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:1214
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
static int vlib_frame_queue_dequeue_internal(vlib_main_t *vm)
Definition: threads.c:1244
#define CLIB_MEMORY_BARRIER()
Definition: clib.h:101
u32 node_runtime_index
Definition: node.h:359
uword * cpu_socket_bitmap
Definition: threads.h:320
static uword * vlib_sysfs_list_to_bitmap(char *filename)
Definition: threads.c:117
#define foreach_sched_policy
Definition: threads.h:262
#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:283
vlib_frame_t * vlib_get_frame_to_node(vlib_main_t *vm, u32 to_node_index)
Definition: main.c:185
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:67
u8 ** vlib_thread_stacks
Definition: main.h:318
pthread_t thread_id
Definition: threads.h:109
vlib_thread_registration_t * registration
Definition: threads.h:103
#define BITS(x)
Definition: clib.h:58
volatile u32 worker_thread_release
Definition: threads.h:332
void vlib_worker_thread_fork_fixup(vlib_fork_fixup_t which)
Definition: threads.c:1159
clib_random_buffer_t random_buffer
Definition: main.h:153
u16 enabled
Definition: threads.h:254
vlib_efd_t efd
Definition: threads.h:322
clib_error_t * vlib_thread_init(vlib_main_t *vm)
Definition: threads.c:147