1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
|
/*
* Copyright (c) 2015 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef included_vlib_threads_h
#define included_vlib_threads_h
#include <vlib/main.h>
#include <vppinfra/callback.h>
#ifdef __linux__
#include <linux/sched.h>
#elif __FreeBSD__
#include <sys/sched.h>
#endif /* __linux__ */
void vlib_set_thread_name (char *name);
/* arg is actually a vlib__thread_t * */
typedef void (vlib_thread_function_t) (void *arg);
typedef struct vlib_thread_registration_
{
/* constructor generated list of thread registrations */
struct vlib_thread_registration_ *next;
/* config parameters */
char *name;
char *short_name;
vlib_thread_function_t *function;
uword mheap_size;
int fixed_count;
u32 count;
int no_data_structure_clone;
u32 frame_queue_nelts;
/* All threads of this type run on pthreads */
int use_pthreads;
u32 first_index;
uword *coremask;
} vlib_thread_registration_t;
#define VLIB_LOG2_THREAD_STACK_SIZE (21)
#define VLIB_THREAD_STACK_SIZE (1<<VLIB_LOG2_THREAD_STACK_SIZE)
typedef struct
{
CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
volatile u32 valid;
u32 maybe_trace : 1;
u32 n_vectors;
u32 offset;
STRUCT_MARK (end_of_reset);
CLIB_CACHE_LINE_ALIGN_MARK (cacheline1);
u32 buffer_index[VLIB_FRAME_SIZE];
u32 aux_data[VLIB_FRAME_SIZE];
}
vlib_frame_queue_elt_t;
typedef struct
{
/* First cache line */
CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
volatile u32 *wait_at_barrier;
volatile u32 *workers_at_barrier;
/* Second Cache Line */
CLIB_CACHE_LINE_ALIGN_MARK (cacheline1);
void *thread_mheap;
u8 *thread_stack;
void (*thread_function) (void *);
void *thread_function_arg;
i64 recursion_level;
elog_track_t elog_track;
u32 instance_id;
vlib_thread_registration_t *registration;
u8 *name;
u64 barrier_sync_count;
u8 barrier_elog_enabled;
const char *barrier_caller;
const char *barrier_context;
volatile u32 *node_reforks_required;
volatile u32 wait_before_barrier;
volatile u32 workers_before_barrier;
volatile u32 done_work_before_barrier;
long lwp;
int cpu_id;
int core_id;
int numa_id;
pthread_t thread_id;
} vlib_worker_thread_t;
extern vlib_worker_thread_t *vlib_worker_threads;
typedef struct
{
/* static data */
CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
vlib_frame_queue_elt_t *elts;
u64 vector_threshold;
u64 trace;
u32 nelts;
/* modified by enqueue side */
CLIB_CACHE_LINE_ALIGN_MARK (cacheline1);
volatile u64 tail;
/* modified by dequeue side */
CLIB_CACHE_LINE_ALIGN_MARK (cacheline2);
volatile u64 head;
}
vlib_frame_queue_t;
struct vlib_frame_queue_main_t_;
typedef u32 (vlib_frame_queue_dequeue_fn_t) (
vlib_main_t *vm, struct vlib_frame_queue_main_t_ *fqm);
typedef struct vlib_frame_queue_main_t_
{
u32 node_index;
u32 frame_queue_nelts;
vlib_frame_queue_t **vlib_frame_queues;
/* for frame queue tracing */
frame_queue_trace_t *frame_queue_traces;
frame_queue_nelt_counter_t *frame_queue_histogram;
vlib_frame_queue_dequeue_fn_t *frame_queue_dequeue_fn;
} vlib_frame_queue_main_t;
typedef struct
{
uword node_index;
uword type_opaque;
uword data;
} vlib_process_signal_event_mt_args_t;
/* Called early, in thread 0's context */
clib_error_t *vlib_thread_init (vlib_main_t * vm);
void vlib_worker_thread_node_runtime_update (void);
void vlib_create_worker_threads (vlib_main_t * vm, int n,
void (*thread_function) (void *));
void vlib_worker_thread_init (vlib_worker_thread_t * w);
u32 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts);
/* Check for a barrier sync request every 30ms */
#define BARRIER_SYNC_DELAY (0.030000)
#if CLIB_DEBUG > 0
/* long barrier timeout, for gdb... */
#define BARRIER_SYNC_TIMEOUT (600.1)
#else
#define BARRIER_SYNC_TIMEOUT (1.0)
#endif
#define vlib_worker_thread_barrier_sync(X) {vlib_worker_thread_barrier_sync_int(X, __FUNCTION__);}
void vlib_worker_thread_barrier_sync_int (vlib_main_t * vm,
const char *func_name);
void vlib_worker_thread_barrier_release (vlib_main_t * vm);
u8 vlib_worker_thread_barrier_held (void);
void vlib_worker_thread_initial_barrier_sync_and_release (vlib_main_t * vm);
void vlib_worker_thread_node_refork (void);
/**
* Wait until each of the workers has been once around the track
*/
void vlib_worker_wait_one_loop (void);
/**
* Flush worker's pending rpc requests to main thread's rpc queue
*/
void vlib_worker_flush_pending_rpc_requests (vlib_main_t *vm);
static_always_inline uword
vlib_get_thread_index (void)
{
return __os_thread_index;
}
always_inline void
vlib_smp_unsafe_warning (void)
{
if (CLIB_DEBUG > 0)
{
if (vlib_get_thread_index ())
fformat (stderr, "%s: SMP unsafe warning...\n", __FUNCTION__);
}
}
always_inline int
__foreach_vlib_main_helper (vlib_main_t *ii, vlib_main_t **p, int checks)
{
vlib_main_t *vm;
u32 index = ii - (vlib_main_t *) 0;
if (index >= vec_len (vlib_global_main.vlib_mains))
return 0;
*p = vm = vlib_global_main.vlib_mains[index];
ASSERT (!checks || index == 0 || vm->parked_at_barrier == 1);
return 1;
}
#define foreach_vlib_main__(checks) \
for (vlib_main_t *ii = 0, *this_vlib_main; \
__foreach_vlib_main_helper (ii, &this_vlib_main, checks); ii++) \
if (this_vlib_main)
#define foreach_vlib_main() foreach_vlib_main__ (1)
#define foreach_sched_policy_posix \
_ (SCHED_OTHER, OTHER, "other") \
_ (SCHED_FIFO, FIFO, "fifo") \
_ (SCHED_RR, RR, "rr")
#define foreach_sched_policy_linux \
_ (SCHED_BATCH, BATCH, "batch") \
_ (SCHED_IDLE, IDLE, "idle")
#ifdef __linux__
#define foreach_sched_policy \
foreach_sched_policy_posix foreach_sched_policy_linux
#else
#define foreach_sched_policy foreach_sched_policy_posix
#endif /* __linux__ */
typedef enum
{
#define _(v,f,s) SCHED_POLICY_##f = v,
foreach_sched_policy
#undef _
SCHED_POLICY_N,
} sched_policy_t;
typedef struct
{
/* Link list of registrations, built by constructors */
vlib_thread_registration_t *next;
/* Vector of registrations, w/ non-data-structure clones at the top */
vlib_thread_registration_t **registrations;
uword *thread_registrations_by_name;
vlib_worker_thread_t *worker_threads;
int use_pthreads;
/* Number of vlib_main / vnet_main clones */
u32 n_vlib_mains;
/* Number of thread stacks to create */
u32 n_thread_stacks;
/* Number of pthreads */
u32 n_pthreads;
/* Number of threads */
u32 n_threads;
/* Number of cores to skip, must match the core mask */
u32 skip_cores;
/* Thread prefix name */
u8 *thread_prefix;
/* main thread lcore */
u32 main_lcore;
/* Bitmap of available CPU cores */
uword *cpu_core_bitmap;
/* Bitmap of available CPU sockets (NUMA nodes) */
uword *cpu_socket_bitmap;
/* Worker handoff queues */
vlib_frame_queue_main_t *frame_queue_mains;
/* worker thread initialization barrier */
volatile u32 worker_thread_release;
/* scheduling policy */
u32 sched_policy;
/* scheduling policy priority */
u32 sched_priority;
/* NUMA-bound heap size */
uword numa_heap_size;
} vlib_thread_main_t;
extern vlib_thread_main_t vlib_thread_main;
#include <vlib/global_funcs.h>
#define VLIB_REGISTER_THREAD(x,...) \
__VA_ARGS__ vlib_thread_registration_t x; \
static void __vlib_add_thread_registration_##x (void) \
__attribute__((__constructor__)) ; \
static void __vlib_add_thread_registration_##x (void) \
{ \
vlib_thread_main_t * tm = &vlib_thread_main; \
x.next = tm->next; \
tm->next = &x; \
} \
static void __vlib_rm_thread_registration_##x (void) \
__attribute__((__destructor__)) ; \
static void __vlib_rm_thread_registration_##x (void) \
{ \
vlib_thread_main_t * tm = &vlib_thread_main; \
VLIB_REMOVE_FROM_LINKED_LIST (tm->next, &x, next); \
} \
__VA_ARGS__ vlib_thread_registration_t x
always_inline u32
vlib_num_workers ()
{
return vlib_thread_main.n_vlib_mains - 1;
}
always_inline u32
vlib_get_worker_thread_index (u32 worker_index)
{
return worker_index + 1;
}
always_inline u32
vlib_get_worker_index (u32 thread_index)
{
return thread_index - 1;
}
always_inline u32
vlib_get_current_worker_index ()
{
return vlib_get_thread_index () - 1;
}
static inline void
vlib_worker_thread_barrier_check (void)
{
if (PREDICT_FALSE (*vlib_worker_threads->wait_at_barrier))
{
vlib_global_main_t *vgm = vlib_get_global_main ();
vlib_main_t *vm = vlib_get_main ();
u32 thread_index = vm->thread_index;
f64 t = vlib_time_now (vm);
if (PREDICT_FALSE (vec_len (vm->barrier_perf_callbacks) != 0))
clib_call_callbacks (vm->barrier_perf_callbacks, vm,
vm->clib_time.last_cpu_time, 0 /* enter */ );
if (PREDICT_FALSE (vlib_worker_threads->barrier_elog_enabled))
{
vlib_worker_thread_t *w = vlib_worker_threads + thread_index;
ELOG_TYPE_DECLARE (e) = {
.format = "barrier-wait-thread-%d",
.format_args = "i4",
};
struct
{
u32 thread_index;
} __clib_packed *ed;
ed = ELOG_TRACK_DATA (&vlib_global_main.elog_main, e, w->elog_track);
ed->thread_index = thread_index;
}
if (CLIB_DEBUG > 0)
{
vm = vlib_get_main ();
vm->parked_at_barrier = 1;
}
clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, 1);
while (*vlib_worker_threads->wait_at_barrier)
;
/*
* Recompute the offset from thread-0 time.
* Note that vlib_time_now adds vm->time_offset, so
* clear it first. Save the resulting idea of "now", to
* see how well we're doing. See show_clock_command_fn(...)
*/
{
f64 now;
vm->time_offset = 0.0;
now = vlib_time_now (vm);
vm->time_offset = vgm->vlib_mains[0]->time_last_barrier_release - now;
vm->time_last_barrier_release = vlib_time_now (vm);
}
if (CLIB_DEBUG > 0)
vm->parked_at_barrier = 0;
clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, -1);
if (PREDICT_FALSE (*vlib_worker_threads->node_reforks_required))
{
if (PREDICT_FALSE (vlib_worker_threads->barrier_elog_enabled))
{
t = vlib_time_now (vm) - t;
vlib_worker_thread_t *w = vlib_worker_threads + thread_index;
ELOG_TYPE_DECLARE (e) = {
.format = "barrier-refork-thread-%d",
.format_args = "i4",
};
struct
{
u32 thread_index;
} __clib_packed *ed;
ed = ELOG_TRACK_DATA (&vlib_global_main.elog_main, e,
w->elog_track);
ed->thread_index = thread_index;
}
vlib_worker_thread_node_refork ();
clib_atomic_fetch_add (vlib_worker_threads->node_reforks_required,
-1);
while (*vlib_worker_threads->node_reforks_required)
;
}
if (PREDICT_FALSE (vlib_worker_threads->barrier_elog_enabled))
{
t = vlib_time_now (vm) - t;
vlib_worker_thread_t *w = vlib_worker_threads + thread_index;
ELOG_TYPE_DECLARE (e) = {
.format = "barrier-released-thread-%d: %dus",
.format_args = "i4i4",
};
struct
{
u32 thread_index;
u32 duration;
} __clib_packed *ed;
ed = ELOG_TRACK_DATA (&vlib_global_main.elog_main, e, w->elog_track);
ed->thread_index = thread_index;
ed->duration = (int) (1000000.0 * t);
}
if (PREDICT_FALSE (vec_len (vm->barrier_perf_callbacks) != 0))
clib_call_callbacks (vm->barrier_perf_callbacks, vm,
vm->clib_time.last_cpu_time, 1 /* leave */ );
}
}
always_inline vlib_main_t *
vlib_get_worker_vlib_main (u32 worker_index)
{
vlib_main_t *vm;
vlib_thread_main_t *tm = &vlib_thread_main;
ASSERT (worker_index < tm->n_vlib_mains - 1);
vm = vlib_get_main_by_index (worker_index + 1);
ASSERT (vm);
return vm;
}
static inline u8
vlib_thread_is_main_w_barrier (void)
{
return (!vlib_num_workers ()
|| ((vlib_get_thread_index () == 0
&& vlib_worker_threads->wait_at_barrier[0])));
}
u8 *vlib_thread_stack_init (uword thread_index);
extern void *rpc_call_main_thread_cb_fn;
void
vlib_process_signal_event_mt_helper (vlib_process_signal_event_mt_args_t *
args);
void vlib_rpc_call_main_thread (void *function, u8 * args, u32 size);
void vlib_get_thread_core_numa (vlib_worker_thread_t * w, unsigned cpu_id);
vlib_thread_main_t *vlib_get_thread_main_not_inline (void);
/**
* Force workers sync from within worker
*
* Must be paired with @ref vlib_workers_continue
*/
void vlib_workers_sync (void);
/**
* Release barrier after workers sync
*/
void vlib_workers_continue (void);
#endif /* included_vlib_threads_h */
/*
* fd.io coding-style-patch-verification: ON
*
* Local Variables:
* eval: (c-set-style "gnu")
* End:
*/
|