blob: 337c98ca28e9fad5fd39103c7115ecfe10d1aa32 [file] [log] [blame]
Jim Cownie5e8470a2013-09-27 10:38:44 +00001/*
2 * kmp_tasking.c -- OpenMP 3.0 tasking support.
Jim Cownie5e8470a2013-09-27 10:38:44 +00003 */
4
5
6//===----------------------------------------------------------------------===//
7//
8// The LLVM Compiler Infrastructure
9//
10// This file is dual licensed under the MIT and the University of Illinois Open
11// Source Licenses. See LICENSE.txt for details.
12//
13//===----------------------------------------------------------------------===//
14
15
16#include "kmp.h"
17#include "kmp_i18n.h"
18#include "kmp_itt.h"
Jim Cownie4cc4bb42014-10-07 16:25:50 +000019#include "kmp_wait_release.h"
Jonathan Peyton45be4502015-08-11 21:36:41 +000020#include "kmp_stats.h"
Jim Cownie5e8470a2013-09-27 10:38:44 +000021
Andrey Churbanove5f44922015-04-29 16:22:07 +000022#if OMPT_SUPPORT
23#include "ompt-specific.h"
24#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +000025
Jim Cownie5e8470a2013-09-27 10:38:44 +000026/* ------------------------------------------------------------------------ */
27/* ------------------------------------------------------------------------ */
28
29
30/* forward declaration */
31static void __kmp_enable_tasking( kmp_task_team_t *task_team, kmp_info_t *this_thr );
32static void __kmp_alloc_task_deque( kmp_info_t *thread, kmp_thread_data_t *thread_data );
33static int __kmp_realloc_task_threads_data( kmp_info_t *thread, kmp_task_team_t *task_team );
34
Andrey Churbanov535b6fa2015-05-07 17:41:51 +000035#ifdef OMP_41_ENABLED
36static void __kmp_bottom_half_finish_proxy( kmp_int32 gtid, kmp_task_t * ptask );
37#endif
38
Jim Cownie4cc4bb42014-10-07 16:25:50 +000039static inline void __kmp_null_resume_wrapper(int gtid, volatile void *flag) {
Jonathan Peytona0e159f2015-10-08 18:23:38 +000040 if (!flag) return;
Jonathan Peyton3f5dfc22015-11-09 16:31:51 +000041 // Attempt to wake up a thread: examine its type and call appropriate template
Jim Cownie4cc4bb42014-10-07 16:25:50 +000042 switch (((kmp_flag_64 *)flag)->get_type()) {
43 case flag32: __kmp_resume_32(gtid, NULL); break;
44 case flag64: __kmp_resume_64(gtid, NULL); break;
45 case flag_oncore: __kmp_resume_oncore(gtid, NULL); break;
46 }
Jim Cownie5e8470a2013-09-27 10:38:44 +000047}
48
49#ifdef BUILD_TIED_TASK_STACK
50
51//---------------------------------------------------------------------------
52// __kmp_trace_task_stack: print the tied tasks from the task stack in order
53// from top do bottom
54//
55// gtid: global thread identifier for thread containing stack
56// thread_data: thread data for task team thread containing stack
57// threshold: value above which the trace statement triggers
58// location: string identifying call site of this function (for trace)
59
60static void
61__kmp_trace_task_stack( kmp_int32 gtid, kmp_thread_data_t *thread_data, int threshold, char *location )
62{
63 kmp_task_stack_t *task_stack = & thread_data->td.td_susp_tied_tasks;
64 kmp_taskdata_t **stack_top = task_stack -> ts_top;
65 kmp_int32 entries = task_stack -> ts_entries;
66 kmp_taskdata_t *tied_task;
67
68 KA_TRACE(threshold, ("__kmp_trace_task_stack(start): location = %s, gtid = %d, entries = %d, "
69 "first_block = %p, stack_top = %p \n",
70 location, gtid, entries, task_stack->ts_first_block, stack_top ) );
71
72 KMP_DEBUG_ASSERT( stack_top != NULL );
73 KMP_DEBUG_ASSERT( entries > 0 );
74
75 while ( entries != 0 )
76 {
77 KMP_DEBUG_ASSERT( stack_top != & task_stack->ts_first_block.sb_block[0] );
78 // fix up ts_top if we need to pop from previous block
79 if ( entries & TASK_STACK_INDEX_MASK == 0 )
80 {
81 kmp_stack_block_t *stack_block = (kmp_stack_block_t *) (stack_top) ;
82
83 stack_block = stack_block -> sb_prev;
84 stack_top = & stack_block -> sb_block[TASK_STACK_BLOCK_SIZE];
85 }
86
87 // finish bookkeeping
88 stack_top--;
89 entries--;
90
91 tied_task = * stack_top;
92
93 KMP_DEBUG_ASSERT( tied_task != NULL );
94 KMP_DEBUG_ASSERT( tied_task -> td_flags.tasktype == TASK_TIED );
95
96 KA_TRACE(threshold, ("__kmp_trace_task_stack(%s): gtid=%d, entry=%d, "
97 "stack_top=%p, tied_task=%p\n",
98 location, gtid, entries, stack_top, tied_task ) );
99 }
100 KMP_DEBUG_ASSERT( stack_top == & task_stack->ts_first_block.sb_block[0] );
101
102 KA_TRACE(threshold, ("__kmp_trace_task_stack(exit): location = %s, gtid = %d\n",
103 location, gtid ) );
104}
105
106//---------------------------------------------------------------------------
107// __kmp_init_task_stack: initialize the task stack for the first time
108// after a thread_data structure is created.
109// It should not be necessary to do this again (assuming the stack works).
110//
111// gtid: global thread identifier of calling thread
112// thread_data: thread data for task team thread containing stack
113
114static void
115__kmp_init_task_stack( kmp_int32 gtid, kmp_thread_data_t *thread_data )
116{
117 kmp_task_stack_t *task_stack = & thread_data->td.td_susp_tied_tasks;
118 kmp_stack_block_t *first_block;
119
120 // set up the first block of the stack
121 first_block = & task_stack -> ts_first_block;
122 task_stack -> ts_top = (kmp_taskdata_t **) first_block;
123 memset( (void *) first_block, '\0', TASK_STACK_BLOCK_SIZE * sizeof(kmp_taskdata_t *));
124
125 // initialize the stack to be empty
126 task_stack -> ts_entries = TASK_STACK_EMPTY;
127 first_block -> sb_next = NULL;
128 first_block -> sb_prev = NULL;
129}
130
131
132//---------------------------------------------------------------------------
133// __kmp_free_task_stack: free the task stack when thread_data is destroyed.
134//
135// gtid: global thread identifier for calling thread
136// thread_data: thread info for thread containing stack
137
138static void
139__kmp_free_task_stack( kmp_int32 gtid, kmp_thread_data_t *thread_data )
140{
141 kmp_task_stack_t *task_stack = & thread_data->td.td_susp_tied_tasks;
142 kmp_stack_block_t *stack_block = & task_stack -> ts_first_block;
143
144 KMP_DEBUG_ASSERT( task_stack -> ts_entries == TASK_STACK_EMPTY );
145 // free from the second block of the stack
146 while ( stack_block != NULL ) {
147 kmp_stack_block_t *next_block = (stack_block) ? stack_block -> sb_next : NULL;
148
149 stack_block -> sb_next = NULL;
150 stack_block -> sb_prev = NULL;
151 if (stack_block != & task_stack -> ts_first_block) {
152 __kmp_thread_free( thread, stack_block ); // free the block, if not the first
153 }
154 stack_block = next_block;
155 }
156 // initialize the stack to be empty
157 task_stack -> ts_entries = 0;
158 task_stack -> ts_top = NULL;
159}
160
161
162//---------------------------------------------------------------------------
163// __kmp_push_task_stack: Push the tied task onto the task stack.
164// Grow the stack if necessary by allocating another block.
165//
166// gtid: global thread identifier for calling thread
167// thread: thread info for thread containing stack
168// tied_task: the task to push on the stack
169
170static void
171__kmp_push_task_stack( kmp_int32 gtid, kmp_info_t *thread, kmp_taskdata_t * tied_task )
172{
173 // GEH - need to consider what to do if tt_threads_data not allocated yet
174 kmp_thread_data_t *thread_data = & thread -> th.th_task_team ->
175 tt.tt_threads_data[ __kmp_tid_from_gtid( gtid ) ];
176 kmp_task_stack_t *task_stack = & thread_data->td.td_susp_tied_tasks ;
177
178 if ( tied_task->td_flags.team_serial || tied_task->td_flags.tasking_ser ) {
179 return; // Don't push anything on stack if team or team tasks are serialized
180 }
181
182 KMP_DEBUG_ASSERT( tied_task -> td_flags.tasktype == TASK_TIED );
183 KMP_DEBUG_ASSERT( task_stack -> ts_top != NULL );
184
185 KA_TRACE(20, ("__kmp_push_task_stack(enter): GTID: %d; THREAD: %p; TASK: %p\n",
186 gtid, thread, tied_task ) );
187 // Store entry
188 * (task_stack -> ts_top) = tied_task;
189
190 // Do bookkeeping for next push
191 task_stack -> ts_top++;
192 task_stack -> ts_entries++;
193
194 if ( task_stack -> ts_entries & TASK_STACK_INDEX_MASK == 0 )
195 {
196 // Find beginning of this task block
197 kmp_stack_block_t *stack_block =
198 (kmp_stack_block_t *) (task_stack -> ts_top - TASK_STACK_BLOCK_SIZE);
199
200 // Check if we already have a block
201 if ( stack_block -> sb_next != NULL )
202 { // reset ts_top to beginning of next block
203 task_stack -> ts_top = & stack_block -> sb_next -> sb_block[0];
204 }
205 else
206 { // Alloc new block and link it up
207 kmp_stack_block_t *new_block = (kmp_stack_block_t *)
208 __kmp_thread_calloc(thread, sizeof(kmp_stack_block_t));
209
210 task_stack -> ts_top = & new_block -> sb_block[0];
211 stack_block -> sb_next = new_block;
212 new_block -> sb_prev = stack_block;
213 new_block -> sb_next = NULL;
214
215 KA_TRACE(30, ("__kmp_push_task_stack(): GTID: %d; TASK: %p; Alloc new block: %p\n",
216 gtid, tied_task, new_block ) );
217 }
218 }
219 KA_TRACE(20, ("__kmp_push_task_stack(exit): GTID: %d; TASK: %p\n", gtid, tied_task ) );
220}
221
222//---------------------------------------------------------------------------
223// __kmp_pop_task_stack: Pop the tied task from the task stack. Don't return
224// the task, just check to make sure it matches the ending task passed in.
225//
226// gtid: global thread identifier for the calling thread
227// thread: thread info structure containing stack
228// tied_task: the task popped off the stack
229// ending_task: the task that is ending (should match popped task)
230
231static void
232__kmp_pop_task_stack( kmp_int32 gtid, kmp_info_t *thread, kmp_taskdata_t *ending_task )
233{
234 // GEH - need to consider what to do if tt_threads_data not allocated yet
235 kmp_thread_data_t *thread_data = & thread -> th.th_task_team -> tt_threads_data[ __kmp_tid_from_gtid( gtid ) ];
236 kmp_task_stack_t *task_stack = & thread_data->td.td_susp_tied_tasks ;
237 kmp_taskdata_t *tied_task;
238
239 if ( ending_task->td_flags.team_serial || ending_task->td_flags.tasking_ser ) {
240 return; // Don't pop anything from stack if team or team tasks are serialized
241 }
242
243 KMP_DEBUG_ASSERT( task_stack -> ts_top != NULL );
244 KMP_DEBUG_ASSERT( task_stack -> ts_entries > 0 );
245
246 KA_TRACE(20, ("__kmp_pop_task_stack(enter): GTID: %d; THREAD: %p\n", gtid, thread ) );
247
248 // fix up ts_top if we need to pop from previous block
249 if ( task_stack -> ts_entries & TASK_STACK_INDEX_MASK == 0 )
250 {
251 kmp_stack_block_t *stack_block =
252 (kmp_stack_block_t *) (task_stack -> ts_top) ;
253
254 stack_block = stack_block -> sb_prev;
255 task_stack -> ts_top = & stack_block -> sb_block[TASK_STACK_BLOCK_SIZE];
256 }
257
258 // finish bookkeeping
259 task_stack -> ts_top--;
260 task_stack -> ts_entries--;
261
262 tied_task = * (task_stack -> ts_top );
263
264 KMP_DEBUG_ASSERT( tied_task != NULL );
265 KMP_DEBUG_ASSERT( tied_task -> td_flags.tasktype == TASK_TIED );
266 KMP_DEBUG_ASSERT( tied_task == ending_task ); // If we built the stack correctly
267
268 KA_TRACE(20, ("__kmp_pop_task_stack(exit): GTID: %d; TASK: %p\n", gtid, tied_task ) );
269 return;
270}
271#endif /* BUILD_TIED_TASK_STACK */
272
273//---------------------------------------------------
274// __kmp_push_task: Add a task to the thread's deque
275
276static kmp_int32
277__kmp_push_task(kmp_int32 gtid, kmp_task_t * task )
278{
279 kmp_info_t * thread = __kmp_threads[ gtid ];
280 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
281 kmp_task_team_t * task_team = thread->th.th_task_team;
282 kmp_int32 tid = __kmp_tid_from_gtid( gtid );
283 kmp_thread_data_t * thread_data;
284
285 KA_TRACE(20, ("__kmp_push_task: T#%d trying to push task %p.\n", gtid, taskdata ) );
286
287 // The first check avoids building task_team thread data if serialized
288 if ( taskdata->td_flags.task_serial ) {
289 KA_TRACE(20, ( "__kmp_push_task: T#%d team serialized; returning TASK_NOT_PUSHED for task %p\n",
290 gtid, taskdata ) );
291 return TASK_NOT_PUSHED;
292 }
293
294 // Now that serialized tasks have returned, we can assume that we are not in immediate exec mode
295 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
Andrey Churbanov6d224db2015-02-10 18:37:43 +0000296 if ( ! KMP_TASKING_ENABLED(task_team) ) {
Jim Cownie5e8470a2013-09-27 10:38:44 +0000297 __kmp_enable_tasking( task_team, thread );
298 }
299 KMP_DEBUG_ASSERT( TCR_4(task_team -> tt.tt_found_tasks) == TRUE );
300 KMP_DEBUG_ASSERT( TCR_PTR(task_team -> tt.tt_threads_data) != NULL );
301
302 // Find tasking deque specific to encountering thread
303 thread_data = & task_team -> tt.tt_threads_data[ tid ];
304
305 // No lock needed since only owner can allocate
306 if (thread_data -> td.td_deque == NULL ) {
307 __kmp_alloc_task_deque( thread, thread_data );
308 }
309
310 // Check if deque is full
311 if ( TCR_4(thread_data -> td.td_deque_ntasks) >= TASK_DEQUE_SIZE )
312 {
313 KA_TRACE(20, ( "__kmp_push_task: T#%d deque is full; returning TASK_NOT_PUSHED for task %p\n",
314 gtid, taskdata ) );
315 return TASK_NOT_PUSHED;
316 }
317
318 // Lock the deque for the task push operation
319 __kmp_acquire_bootstrap_lock( & thread_data -> td.td_deque_lock );
320
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000321#if OMP_41_ENABLED
322 // Need to recheck as we can get a proxy task from a thread outside of OpenMP
323 if ( TCR_4(thread_data -> td.td_deque_ntasks) >= TASK_DEQUE_SIZE )
324 {
325 __kmp_release_bootstrap_lock( & thread_data -> td.td_deque_lock );
326 KA_TRACE(20, ( "__kmp_push_task: T#%d deque is full on 2nd check; returning TASK_NOT_PUSHED for task %p\n",
327 gtid, taskdata ) );
328 return TASK_NOT_PUSHED;
329 }
330#else
Jim Cownie5e8470a2013-09-27 10:38:44 +0000331 // Must have room since no thread can add tasks but calling thread
332 KMP_DEBUG_ASSERT( TCR_4(thread_data -> td.td_deque_ntasks) < TASK_DEQUE_SIZE );
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000333#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +0000334
335 thread_data -> td.td_deque[ thread_data -> td.td_deque_tail ] = taskdata; // Push taskdata
336 // Wrap index.
337 thread_data -> td.td_deque_tail = ( thread_data -> td.td_deque_tail + 1 ) & TASK_DEQUE_MASK;
338 TCW_4(thread_data -> td.td_deque_ntasks, TCR_4(thread_data -> td.td_deque_ntasks) + 1); // Adjust task count
339
340 __kmp_release_bootstrap_lock( & thread_data -> td.td_deque_lock );
341
342 KA_TRACE(20, ("__kmp_push_task: T#%d returning TASK_SUCCESSFULLY_PUSHED: "
343 "task=%p ntasks=%d head=%u tail=%u\n",
344 gtid, taskdata, thread_data->td.td_deque_ntasks,
345 thread_data->td.td_deque_tail, thread_data->td.td_deque_head) );
346
347 return TASK_SUCCESSFULLY_PUSHED;
348}
349
350
351//-----------------------------------------------------------------------------------------
352// __kmp_pop_current_task_from_thread: set up current task from called thread when team ends
353// this_thr: thread structure to set current_task in.
354
355void
356__kmp_pop_current_task_from_thread( kmp_info_t *this_thr )
357{
358 KF_TRACE( 10, ("__kmp_pop_current_task_from_thread(enter): T#%d this_thread=%p, curtask=%p, "
359 "curtask_parent=%p\n",
360 0, this_thr, this_thr -> th.th_current_task,
361 this_thr -> th.th_current_task -> td_parent ) );
362
363 this_thr -> th.th_current_task = this_thr -> th.th_current_task -> td_parent;
364
365 KF_TRACE( 10, ("__kmp_pop_current_task_from_thread(exit): T#%d this_thread=%p, curtask=%p, "
366 "curtask_parent=%p\n",
367 0, this_thr, this_thr -> th.th_current_task,
368 this_thr -> th.th_current_task -> td_parent ) );
369}
370
371
372//---------------------------------------------------------------------------------------
373// __kmp_push_current_task_to_thread: set up current task in called thread for a new team
374// this_thr: thread structure to set up
375// team: team for implicit task data
376// tid: thread within team to set up
377
378void
379__kmp_push_current_task_to_thread( kmp_info_t *this_thr, kmp_team_t *team, int tid )
380{
381 // current task of the thread is a parent of the new just created implicit tasks of new team
382 KF_TRACE( 10, ( "__kmp_push_current_task_to_thread(enter): T#%d this_thread=%p curtask=%p "
383 "parent_task=%p\n",
384 tid, this_thr, this_thr->th.th_current_task,
385 team->t.t_implicit_task_taskdata[tid].td_parent ) );
386
387 KMP_DEBUG_ASSERT (this_thr != NULL);
388
389 if( tid == 0 ) {
390 if( this_thr->th.th_current_task != & team -> t.t_implicit_task_taskdata[ 0 ] ) {
391 team -> t.t_implicit_task_taskdata[ 0 ].td_parent = this_thr->th.th_current_task;
392 this_thr->th.th_current_task = & team -> t.t_implicit_task_taskdata[ 0 ];
393 }
394 } else {
395 team -> t.t_implicit_task_taskdata[ tid ].td_parent = team -> t.t_implicit_task_taskdata[ 0 ].td_parent;
396 this_thr->th.th_current_task = & team -> t.t_implicit_task_taskdata[ tid ];
397 }
398
399 KF_TRACE( 10, ( "__kmp_push_current_task_to_thread(exit): T#%d this_thread=%p curtask=%p "
400 "parent_task=%p\n",
401 tid, this_thr, this_thr->th.th_current_task,
402 team->t.t_implicit_task_taskdata[tid].td_parent ) );
403}
404
405
406//----------------------------------------------------------------------
407// __kmp_task_start: bookkeeping for a task starting execution
408// GTID: global thread id of calling thread
409// task: task starting execution
410// current_task: task suspending
411
412static void
413__kmp_task_start( kmp_int32 gtid, kmp_task_t * task, kmp_taskdata_t * current_task )
414{
415 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
416 kmp_info_t * thread = __kmp_threads[ gtid ];
417
418 KA_TRACE(10, ("__kmp_task_start(enter): T#%d starting task %p: current_task=%p\n",
419 gtid, taskdata, current_task) );
420
421 KMP_DEBUG_ASSERT( taskdata -> td_flags.tasktype == TASK_EXPLICIT );
422
423 // mark currently executing task as suspended
424 // TODO: GEH - make sure root team implicit task is initialized properly.
425 // KMP_DEBUG_ASSERT( current_task -> td_flags.executing == 1 );
426 current_task -> td_flags.executing = 0;
427
428 // Add task to stack if tied
429#ifdef BUILD_TIED_TASK_STACK
430 if ( taskdata -> td_flags.tiedness == TASK_TIED )
431 {
432 __kmp_push_task_stack( gtid, thread, taskdata );
433 }
434#endif /* BUILD_TIED_TASK_STACK */
435
436 // mark starting task as executing and as current task
437 thread -> th.th_current_task = taskdata;
438
439 KMP_DEBUG_ASSERT( taskdata -> td_flags.started == 0 );
440 KMP_DEBUG_ASSERT( taskdata -> td_flags.executing == 0 );
441 taskdata -> td_flags.started = 1;
442 taskdata -> td_flags.executing = 1;
443 KMP_DEBUG_ASSERT( taskdata -> td_flags.complete == 0 );
444 KMP_DEBUG_ASSERT( taskdata -> td_flags.freed == 0 );
445
446 // GEH TODO: shouldn't we pass some sort of location identifier here?
447 // APT: yes, we will pass location here.
448 // need to store current thread state (in a thread or taskdata structure)
449 // before setting work_state, otherwise wrong state is set after end of task
450
451 KA_TRACE(10, ("__kmp_task_start(exit): T#%d task=%p\n",
452 gtid, taskdata ) );
453
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000454#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +0000455 if (ompt_enabled &&
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000456 ompt_callbacks.ompt_callback(ompt_event_task_begin)) {
457 kmp_taskdata_t *parent = taskdata->td_parent;
458 ompt_callbacks.ompt_callback(ompt_event_task_begin)(
459 parent ? parent->ompt_task_info.task_id : ompt_task_id_none,
460 parent ? &(parent->ompt_task_info.frame) : NULL,
461 taskdata->ompt_task_info.task_id,
462 taskdata->ompt_task_info.function);
463 }
464#endif
Jonas Hahnfeld39b68622016-01-28 10:39:52 +0000465#if OMP_40_ENABLED && OMPT_SUPPORT && OMPT_TRACE
466 /* OMPT emit all dependences if requested by the tool */
467 if (ompt_enabled && taskdata->ompt_task_info.ndeps > 0 &&
468 ompt_callbacks.ompt_callback(ompt_event_task_dependences))
469 {
470 ompt_callbacks.ompt_callback(ompt_event_task_dependences)(
471 taskdata->ompt_task_info.task_id,
472 taskdata->ompt_task_info.deps,
473 taskdata->ompt_task_info.ndeps
474 );
475 /* We can now free the allocated memory for the dependencies */
476 KMP_OMPT_DEPS_FREE (thread, taskdata->ompt_task_info.deps);
477 taskdata->ompt_task_info.deps = NULL;
478 taskdata->ompt_task_info.ndeps = 0;
479 }
480#endif /* OMP_40_ENABLED && OMPT_SUPPORT && OMPT_TRACE */
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000481
Jim Cownie5e8470a2013-09-27 10:38:44 +0000482 return;
483}
484
485
486//----------------------------------------------------------------------
487// __kmpc_omp_task_begin_if0: report that a given serialized task has started execution
488// loc_ref: source location information; points to beginning of task block.
489// gtid: global thread number.
490// task: task thunk for the started task.
491
492void
493__kmpc_omp_task_begin_if0( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t * task )
494{
495 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
496 kmp_taskdata_t * current_task = __kmp_threads[ gtid ] -> th.th_current_task;
497
498 KA_TRACE(10, ("__kmpc_omp_task_begin_if0(enter): T#%d loc=%p task=%p current_task=%p\n",
499 gtid, loc_ref, taskdata, current_task ) );
500
501 taskdata -> td_flags.task_serial = 1; // Execute this task immediately, not deferred.
502 __kmp_task_start( gtid, task, current_task );
503
504 KA_TRACE(10, ("__kmpc_omp_task_begin_if0(exit): T#%d loc=%p task=%p,\n",
505 gtid, loc_ref, taskdata ) );
506
507 return;
508}
509
510#ifdef TASK_UNUSED
511//----------------------------------------------------------------------
512// __kmpc_omp_task_begin: report that a given task has started execution
513// NEVER GENERATED BY COMPILER, DEPRECATED!!!
514
515void
516__kmpc_omp_task_begin( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t * task )
517{
518 kmp_taskdata_t * current_task = __kmp_threads[ gtid ] -> th.th_current_task;
519
520 KA_TRACE(10, ("__kmpc_omp_task_begin(enter): T#%d loc=%p task=%p current_task=%p\n",
521 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task), current_task ) );
522
523 __kmp_task_start( gtid, task, current_task );
524
525 KA_TRACE(10, ("__kmpc_omp_task_begin(exit): T#%d loc=%p task=%p,\n",
526 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
527
528 return;
529}
530#endif // TASK_UNUSED
531
532
533//-------------------------------------------------------------------------------------
534// __kmp_free_task: free the current task space and the space for shareds
535// gtid: Global thread ID of calling thread
536// taskdata: task to free
537// thread: thread data structure of caller
538
539static void
540__kmp_free_task( kmp_int32 gtid, kmp_taskdata_t * taskdata, kmp_info_t * thread )
541{
542 KA_TRACE(30, ("__kmp_free_task: T#%d freeing data from task %p\n",
543 gtid, taskdata) );
544
545 // Check to make sure all flags and counters have the correct values
546 KMP_DEBUG_ASSERT( taskdata->td_flags.tasktype == TASK_EXPLICIT );
547 KMP_DEBUG_ASSERT( taskdata->td_flags.executing == 0 );
548 KMP_DEBUG_ASSERT( taskdata->td_flags.complete == 1 );
549 KMP_DEBUG_ASSERT( taskdata->td_flags.freed == 0 );
550 KMP_DEBUG_ASSERT( TCR_4(taskdata->td_allocated_child_tasks) == 0 || taskdata->td_flags.task_serial == 1);
551 KMP_DEBUG_ASSERT( TCR_4(taskdata->td_incomplete_child_tasks) == 0 );
552
553 taskdata->td_flags.freed = 1;
554 // deallocate the taskdata and shared variable blocks associated with this task
555 #if USE_FAST_MEMORY
556 __kmp_fast_free( thread, taskdata );
557 #else /* ! USE_FAST_MEMORY */
558 __kmp_thread_free( thread, taskdata );
559 #endif
560
561 KA_TRACE(20, ("__kmp_free_task: T#%d freed task %p\n",
562 gtid, taskdata) );
563}
564
565//-------------------------------------------------------------------------------------
566// __kmp_free_task_and_ancestors: free the current task and ancestors without children
567//
568// gtid: Global thread ID of calling thread
569// taskdata: task to free
570// thread: thread data structure of caller
571
572static void
573__kmp_free_task_and_ancestors( kmp_int32 gtid, kmp_taskdata_t * taskdata, kmp_info_t * thread )
574{
575 kmp_int32 children = 0;
576 kmp_int32 team_or_tasking_serialized = taskdata -> td_flags.team_serial || taskdata -> td_flags.tasking_ser;
577
578 KMP_DEBUG_ASSERT( taskdata -> td_flags.tasktype == TASK_EXPLICIT );
579
580 if ( !team_or_tasking_serialized ) {
581 children = KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata -> td_allocated_child_tasks) ) - 1;
582 KMP_DEBUG_ASSERT( children >= 0 );
583 }
584
585 // Now, go up the ancestor tree to see if any ancestors can now be freed.
586 while ( children == 0 )
587 {
588 kmp_taskdata_t * parent_taskdata = taskdata -> td_parent;
589
590 KA_TRACE(20, ("__kmp_free_task_and_ancestors(enter): T#%d task %p complete "
591 "and freeing itself\n", gtid, taskdata) );
592
593 // --- Deallocate my ancestor task ---
594 __kmp_free_task( gtid, taskdata, thread );
595
596 taskdata = parent_taskdata;
597
598 // Stop checking ancestors at implicit task or if tasking serialized
599 // instead of walking up ancestor tree to avoid premature deallocation of ancestors.
600 if ( team_or_tasking_serialized || taskdata -> td_flags.tasktype == TASK_IMPLICIT )
601 return;
602
603 if ( !team_or_tasking_serialized ) {
604 // Predecrement simulated by "- 1" calculation
605 children = KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata -> td_allocated_child_tasks) ) - 1;
606 KMP_DEBUG_ASSERT( children >= 0 );
607 }
608 }
609
610 KA_TRACE(20, ("__kmp_free_task_and_ancestors(exit): T#%d task %p has %d children; "
611 "not freeing it yet\n", gtid, taskdata, children) );
612}
613
614//---------------------------------------------------------------------
615// __kmp_task_finish: bookkeeping to do when a task finishes execution
616// gtid: global thread ID for calling thread
617// task: task to be finished
618// resumed_task: task to be resumed. (may be NULL if task is serialized)
619
620static void
621__kmp_task_finish( kmp_int32 gtid, kmp_task_t *task, kmp_taskdata_t *resumed_task )
622{
623 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
624 kmp_info_t * thread = __kmp_threads[ gtid ];
625 kmp_int32 children = 0;
626
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000627#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +0000628 if (ompt_enabled &&
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000629 ompt_callbacks.ompt_callback(ompt_event_task_end)) {
630 kmp_taskdata_t *parent = taskdata->td_parent;
631 ompt_callbacks.ompt_callback(ompt_event_task_end)(
632 taskdata->ompt_task_info.task_id);
633 }
634#endif
635
Jim Cownie5e8470a2013-09-27 10:38:44 +0000636 KA_TRACE(10, ("__kmp_task_finish(enter): T#%d finishing task %p and resuming task %p\n",
637 gtid, taskdata, resumed_task) );
638
639 KMP_DEBUG_ASSERT( taskdata -> td_flags.tasktype == TASK_EXPLICIT );
640
641 // Pop task from stack if tied
642#ifdef BUILD_TIED_TASK_STACK
643 if ( taskdata -> td_flags.tiedness == TASK_TIED )
644 {
645 __kmp_pop_task_stack( gtid, thread, taskdata );
646 }
647#endif /* BUILD_TIED_TASK_STACK */
648
Jim Cownie5e8470a2013-09-27 10:38:44 +0000649 KMP_DEBUG_ASSERT( taskdata -> td_flags.complete == 0 );
Jim Cownie5e8470a2013-09-27 10:38:44 +0000650 taskdata -> td_flags.complete = 1; // mark the task as completed
651 KMP_DEBUG_ASSERT( taskdata -> td_flags.started == 1 );
652 KMP_DEBUG_ASSERT( taskdata -> td_flags.freed == 0 );
653
654 // Only need to keep track of count if team parallel and tasking not serialized
655 if ( !( taskdata -> td_flags.team_serial || taskdata -> td_flags.tasking_ser ) ) {
656 // Predecrement simulated by "- 1" calculation
657 children = KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata -> td_parent -> td_incomplete_child_tasks) ) - 1;
658 KMP_DEBUG_ASSERT( children >= 0 );
659#if OMP_40_ENABLED
660 if ( taskdata->td_taskgroup )
661 KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata->td_taskgroup->count) );
Jim Cownie181b4bb2013-12-23 17:28:57 +0000662 __kmp_release_deps(gtid,taskdata);
Jim Cownie5e8470a2013-09-27 10:38:44 +0000663#endif
664 }
665
Jim Cownie4cc4bb42014-10-07 16:25:50 +0000666 // td_flags.executing must be marked as 0 after __kmp_release_deps has been called
667 // Othertwise, if a task is executed immediately from the release_deps code
668 // the flag will be reset to 1 again by this same function
669 KMP_DEBUG_ASSERT( taskdata -> td_flags.executing == 1 );
670 taskdata -> td_flags.executing = 0; // suspend the finishing task
671
Jim Cownie5e8470a2013-09-27 10:38:44 +0000672 KA_TRACE(20, ("__kmp_task_finish: T#%d finished task %p, %d incomplete children\n",
673 gtid, taskdata, children) );
674
Jim Cownie181b4bb2013-12-23 17:28:57 +0000675#if OMP_40_ENABLED
676 /* If the tasks' destructor thunk flag has been set, we need to invoke the
677 destructor thunk that has been generated by the compiler.
678 The code is placed here, since at this point other tasks might have been released
679 hence overlapping the destructor invokations with some other work in the
680 released tasks. The OpenMP spec is not specific on when the destructors are
681 invoked, so we should be free to choose.
682 */
683 if (taskdata->td_flags.destructors_thunk) {
684 kmp_routine_entry_t destr_thunk = task->destructors;
685 KMP_ASSERT(destr_thunk);
686 destr_thunk(gtid, task);
687 }
688#endif // OMP_40_ENABLED
689
Jim Cownie5e8470a2013-09-27 10:38:44 +0000690 // bookkeeping for resuming task:
691 // GEH - note tasking_ser => task_serial
692 KMP_DEBUG_ASSERT( (taskdata->td_flags.tasking_ser || taskdata->td_flags.task_serial) ==
693 taskdata->td_flags.task_serial);
694 if ( taskdata->td_flags.task_serial )
695 {
696 if (resumed_task == NULL) {
697 resumed_task = taskdata->td_parent; // In a serialized task, the resumed task is the parent
698 }
699 else {
700 // verify resumed task passed in points to parent
701 KMP_DEBUG_ASSERT( resumed_task == taskdata->td_parent );
702 }
703 }
704 else {
705 KMP_DEBUG_ASSERT( resumed_task != NULL ); // verify that resumed task is passed as arguemnt
706 }
707
708 // Free this task and then ancestor tasks if they have no children.
Jonathan Peyton727ba6e2016-01-27 21:20:26 +0000709 // Restore th_current_task first as suggested by John:
710 // johnmc: if an asynchronous inquiry peers into the runtime system
711 // it doesn't see the freed task as the current task.
712 thread->th.th_current_task = resumed_task;
Jim Cownie5e8470a2013-09-27 10:38:44 +0000713 __kmp_free_task_and_ancestors(gtid, taskdata, thread);
714
Jim Cownie5e8470a2013-09-27 10:38:44 +0000715 // TODO: GEH - make sure root team implicit task is initialized properly.
716 // KMP_DEBUG_ASSERT( resumed_task->td_flags.executing == 0 );
717 resumed_task->td_flags.executing = 1; // resume previous task
718
719 KA_TRACE(10, ("__kmp_task_finish(exit): T#%d finished task %p, resuming task %p\n",
720 gtid, taskdata, resumed_task) );
721
722 return;
723}
724
725//---------------------------------------------------------------------
726// __kmpc_omp_task_complete_if0: report that a task has completed execution
727// loc_ref: source location information; points to end of task block.
728// gtid: global thread number.
729// task: task thunk for the completed task.
730
731void
732__kmpc_omp_task_complete_if0( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t *task )
733{
734 KA_TRACE(10, ("__kmpc_omp_task_complete_if0(enter): T#%d loc=%p task=%p\n",
735 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
736
737 __kmp_task_finish( gtid, task, NULL ); // this routine will provide task to resume
738
739 KA_TRACE(10, ("__kmpc_omp_task_complete_if0(exit): T#%d loc=%p task=%p\n",
740 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
741
742 return;
743}
744
745#ifdef TASK_UNUSED
746//---------------------------------------------------------------------
747// __kmpc_omp_task_complete: report that a task has completed execution
748// NEVER GENERATED BY COMPILER, DEPRECATED!!!
749
750void
751__kmpc_omp_task_complete( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t *task )
752{
753 KA_TRACE(10, ("__kmpc_omp_task_complete(enter): T#%d loc=%p task=%p\n",
754 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
755
756 __kmp_task_finish( gtid, task, NULL ); // Not sure how to find task to resume
757
758 KA_TRACE(10, ("__kmpc_omp_task_complete(exit): T#%d loc=%p task=%p\n",
759 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
760 return;
761}
762#endif // TASK_UNUSED
763
764
Andrey Churbanove5f44922015-04-29 16:22:07 +0000765#if OMPT_SUPPORT
766//----------------------------------------------------------------------------------------------------
767// __kmp_task_init_ompt:
Jonathan Peytonb401db62015-10-09 17:38:05 +0000768// Initialize OMPT fields maintained by a task. This will only be called after
769// ompt_tool, so we already know whether ompt is enabled or not.
Andrey Churbanove5f44922015-04-29 16:22:07 +0000770
Jonathan Peytonb401db62015-10-09 17:38:05 +0000771static inline void
772__kmp_task_init_ompt( kmp_taskdata_t * task, int tid, void * function )
Andrey Churbanove5f44922015-04-29 16:22:07 +0000773{
Jonathan Peytonb401db62015-10-09 17:38:05 +0000774 if (ompt_enabled) {
775 task->ompt_task_info.task_id = __ompt_task_id_new(tid);
776 task->ompt_task_info.function = function;
777 task->ompt_task_info.frame.exit_runtime_frame = NULL;
778 task->ompt_task_info.frame.reenter_runtime_frame = NULL;
Jonas Hahnfeld39b68622016-01-28 10:39:52 +0000779#if OMP_40_ENABLED
780 task->ompt_task_info.ndeps = 0;
781 task->ompt_task_info.deps = NULL;
782#endif /* OMP_40_ENABLED */
Jonathan Peytonb401db62015-10-09 17:38:05 +0000783 }
Andrey Churbanove5f44922015-04-29 16:22:07 +0000784}
785#endif
786
787
Jim Cownie5e8470a2013-09-27 10:38:44 +0000788//----------------------------------------------------------------------------------------------------
789// __kmp_init_implicit_task: Initialize the appropriate fields in the implicit task for a given thread
790//
791// loc_ref: reference to source location of parallel region
792// this_thr: thread data structure corresponding to implicit task
793// team: team for this_thr
794// tid: thread id of given thread within team
795// set_curr_task: TRUE if need to push current task to thread
796// NOTE: Routine does not set up the implicit task ICVS. This is assumed to have already been done elsewhere.
797// TODO: Get better loc_ref. Value passed in may be NULL
798
799void
800__kmp_init_implicit_task( ident_t *loc_ref, kmp_info_t *this_thr, kmp_team_t *team, int tid, int set_curr_task )
801{
802 kmp_taskdata_t * task = & team->t.t_implicit_task_taskdata[ tid ];
803
804 KF_TRACE(10, ("__kmp_init_implicit_task(enter): T#:%d team=%p task=%p, reinit=%s\n",
805 tid, team, task, set_curr_task ? "TRUE" : "FALSE" ) );
806
807 task->td_task_id = KMP_GEN_TASK_ID();
808 task->td_team = team;
809// task->td_parent = NULL; // fix for CQ230101 (broken parent task info in debugger)
810 task->td_ident = loc_ref;
811 task->td_taskwait_ident = NULL;
812 task->td_taskwait_counter = 0;
813 task->td_taskwait_thread = 0;
814
815 task->td_flags.tiedness = TASK_TIED;
816 task->td_flags.tasktype = TASK_IMPLICIT;
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000817#if OMP_41_ENABLED
818 task->td_flags.proxy = TASK_FULL;
819#endif
820
Jim Cownie5e8470a2013-09-27 10:38:44 +0000821 // All implicit tasks are executed immediately, not deferred
822 task->td_flags.task_serial = 1;
823 task->td_flags.tasking_ser = ( __kmp_tasking_mode == tskm_immediate_exec );
824 task->td_flags.team_serial = ( team->t.t_serialized ) ? 1 : 0;
825
826 task->td_flags.started = 1;
827 task->td_flags.executing = 1;
828 task->td_flags.complete = 0;
829 task->td_flags.freed = 0;
830
Jim Cownie181b4bb2013-12-23 17:28:57 +0000831#if OMP_40_ENABLED
Jim Cownie5e8470a2013-09-27 10:38:44 +0000832 task->td_dephash = NULL;
833 task->td_depnode = NULL;
Jim Cownie181b4bb2013-12-23 17:28:57 +0000834#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +0000835
836 if (set_curr_task) { // only do this initialization the first time a thread is created
837 task->td_incomplete_child_tasks = 0;
838 task->td_allocated_child_tasks = 0; // Not used because do not need to deallocate implicit task
839#if OMP_40_ENABLED
840 task->td_taskgroup = NULL; // An implicit task does not have taskgroup
841#endif
842 __kmp_push_current_task_to_thread( this_thr, team, tid );
843 } else {
844 KMP_DEBUG_ASSERT(task->td_incomplete_child_tasks == 0);
845 KMP_DEBUG_ASSERT(task->td_allocated_child_tasks == 0);
846 }
847
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000848#if OMPT_SUPPORT
Jonathan Peytonb401db62015-10-09 17:38:05 +0000849 __kmp_task_init_ompt(task, tid, NULL);
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000850#endif
851
Jim Cownie5e8470a2013-09-27 10:38:44 +0000852 KF_TRACE(10, ("__kmp_init_implicit_task(exit): T#:%d team=%p task=%p\n",
853 tid, team, task ) );
854}
855
856// Round up a size to a power of two specified by val
857// Used to insert padding between structures co-allocated using a single malloc() call
858static size_t
859__kmp_round_up_to_val( size_t size, size_t val ) {
860 if ( size & ( val - 1 ) ) {
861 size &= ~ ( val - 1 );
862 if ( size <= KMP_SIZE_T_MAX - val ) {
863 size += val; // Round up if there is no overflow.
864 }; // if
865 }; // if
866 return size;
867} // __kmp_round_up_to_va
868
869
870//---------------------------------------------------------------------------------
871// __kmp_task_alloc: Allocate the taskdata and task data structures for a task
872//
873// loc_ref: source location information
874// gtid: global thread number.
875// flags: include tiedness & task type (explicit vs. implicit) of the ''new'' task encountered.
876// Converted from kmp_int32 to kmp_tasking_flags_t in routine.
877// sizeof_kmp_task_t: Size in bytes of kmp_task_t data structure including private vars accessed in task.
878// sizeof_shareds: Size in bytes of array of pointers to shared vars accessed in task.
879// task_entry: Pointer to task code entry point generated by compiler.
880// returns: a pointer to the allocated kmp_task_t structure (task).
881
882kmp_task_t *
883__kmp_task_alloc( ident_t *loc_ref, kmp_int32 gtid, kmp_tasking_flags_t *flags,
884 size_t sizeof_kmp_task_t, size_t sizeof_shareds,
885 kmp_routine_entry_t task_entry )
886{
887 kmp_task_t *task;
888 kmp_taskdata_t *taskdata;
889 kmp_info_t *thread = __kmp_threads[ gtid ];
890 kmp_team_t *team = thread->th.th_team;
891 kmp_taskdata_t *parent_task = thread->th.th_current_task;
892 size_t shareds_offset;
893
894 KA_TRACE(10, ("__kmp_task_alloc(enter): T#%d loc=%p, flags=(0x%x) "
895 "sizeof_task=%ld sizeof_shared=%ld entry=%p\n",
896 gtid, loc_ref, *((kmp_int32 *)flags), sizeof_kmp_task_t,
897 sizeof_shareds, task_entry) );
898
899 if ( parent_task->td_flags.final ) {
900 if (flags->merged_if0) {
901 }
902 flags->final = 1;
903 }
904
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000905#if OMP_41_ENABLED
906 if ( flags->proxy == TASK_PROXY ) {
907 flags->tiedness = TASK_UNTIED;
908 flags->merged_if0 = 1;
909
910 /* are we running in a sequential parallel or tskm_immediate_exec... we need tasking support enabled */
911 if ( (thread->th.th_task_team) == NULL ) {
912 /* This should only happen if the team is serialized
913 setup a task team and propagate it to the thread
914 */
915 KMP_DEBUG_ASSERT(team->t.t_serialized);
916 KA_TRACE(30,("T#%d creating task team in __kmp_task_alloc for proxy task\n", gtid));
Jonathan Peyton54127982015-11-04 21:37:48 +0000917 __kmp_task_team_setup(thread,team,1); // 1 indicates setup the current team regardless of nthreads
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000918 thread->th.th_task_team = team->t.t_task_team[thread->th.th_task_state];
919 }
920 kmp_task_team_t * task_team = thread->th.th_task_team;
921
922 /* tasking must be enabled now as the task might not be pushed */
923 if ( !KMP_TASKING_ENABLED( task_team ) ) {
924 KA_TRACE(30,("T#%d enabling tasking in __kmp_task_alloc for proxy task\n", gtid));
925 __kmp_enable_tasking( task_team, thread );
926 kmp_int32 tid = thread->th.th_info.ds.ds_tid;
927 kmp_thread_data_t * thread_data = & task_team -> tt.tt_threads_data[ tid ];
928 // No lock needed since only owner can allocate
929 if (thread_data -> td.td_deque == NULL ) {
930 __kmp_alloc_task_deque( thread, thread_data );
931 }
932 }
933
934 if ( task_team->tt.tt_found_proxy_tasks == FALSE )
935 TCW_4(task_team -> tt.tt_found_proxy_tasks, TRUE);
936 }
937#endif
938
Jim Cownie5e8470a2013-09-27 10:38:44 +0000939 // Calculate shared structure offset including padding after kmp_task_t struct
940 // to align pointers in shared struct
941 shareds_offset = sizeof( kmp_taskdata_t ) + sizeof_kmp_task_t;
942 shareds_offset = __kmp_round_up_to_val( shareds_offset, sizeof( void * ));
943
944 // Allocate a kmp_taskdata_t block and a kmp_task_t block.
945 KA_TRACE(30, ("__kmp_task_alloc: T#%d First malloc size: %ld\n",
946 gtid, shareds_offset) );
947 KA_TRACE(30, ("__kmp_task_alloc: T#%d Second malloc size: %ld\n",
948 gtid, sizeof_shareds) );
949
950 // Avoid double allocation here by combining shareds with taskdata
951 #if USE_FAST_MEMORY
952 taskdata = (kmp_taskdata_t *) __kmp_fast_allocate( thread, shareds_offset + sizeof_shareds );
953 #else /* ! USE_FAST_MEMORY */
954 taskdata = (kmp_taskdata_t *) __kmp_thread_malloc( thread, shareds_offset + sizeof_shareds );
955 #endif /* USE_FAST_MEMORY */
956
957 task = KMP_TASKDATA_TO_TASK(taskdata);
958
959 // Make sure task & taskdata are aligned appropriately
Andrey Churbanovd1c55042015-01-19 18:29:35 +0000960#if KMP_ARCH_X86 || KMP_ARCH_PPC64 || !KMP_HAVE_QUAD
Jim Cownie5e8470a2013-09-27 10:38:44 +0000961 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)taskdata) & (sizeof(double)-1) ) == 0 );
962 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)task) & (sizeof(double)-1) ) == 0 );
963#else
964 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)taskdata) & (sizeof(_Quad)-1) ) == 0 );
965 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)task) & (sizeof(_Quad)-1) ) == 0 );
966#endif
967 if (sizeof_shareds > 0) {
968 // Avoid double allocation here by combining shareds with taskdata
969 task->shareds = & ((char *) taskdata)[ shareds_offset ];
970 // Make sure shareds struct is aligned to pointer size
971 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)task->shareds) & (sizeof(void *)-1) ) == 0 );
972 } else {
973 task->shareds = NULL;
974 }
975 task->routine = task_entry;
976 task->part_id = 0; // AC: Always start with 0 part id
977
978 taskdata->td_task_id = KMP_GEN_TASK_ID();
979 taskdata->td_team = team;
Jim Cownie181b4bb2013-12-23 17:28:57 +0000980 taskdata->td_alloc_thread = thread;
Jim Cownie5e8470a2013-09-27 10:38:44 +0000981 taskdata->td_parent = parent_task;
982 taskdata->td_level = parent_task->td_level + 1; // increment nesting level
983 taskdata->td_ident = loc_ref;
984 taskdata->td_taskwait_ident = NULL;
985 taskdata->td_taskwait_counter = 0;
986 taskdata->td_taskwait_thread = 0;
987 KMP_DEBUG_ASSERT( taskdata->td_parent != NULL );
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000988#if OMP_41_ENABLED
989 // avoid copying icvs for proxy tasks
990 if ( flags->proxy == TASK_FULL )
991#endif
992 copy_icvs( &taskdata->td_icvs, &taskdata->td_parent->td_icvs );
Jim Cownie5e8470a2013-09-27 10:38:44 +0000993
994 taskdata->td_flags.tiedness = flags->tiedness;
995 taskdata->td_flags.final = flags->final;
996 taskdata->td_flags.merged_if0 = flags->merged_if0;
Jim Cownie181b4bb2013-12-23 17:28:57 +0000997#if OMP_40_ENABLED
998 taskdata->td_flags.destructors_thunk = flags->destructors_thunk;
999#endif // OMP_40_ENABLED
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001000#if OMP_41_ENABLED
1001 taskdata->td_flags.proxy = flags->proxy;
1002#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001003 taskdata->td_flags.tasktype = TASK_EXPLICIT;
1004
1005 // GEH - TODO: fix this to copy parent task's value of tasking_ser flag
1006 taskdata->td_flags.tasking_ser = ( __kmp_tasking_mode == tskm_immediate_exec );
1007
1008 // GEH - TODO: fix this to copy parent task's value of team_serial flag
1009 taskdata->td_flags.team_serial = ( team->t.t_serialized ) ? 1 : 0;
1010
1011 // GEH - Note we serialize the task if the team is serialized to make sure implicit parallel region
1012 // tasks are not left until program termination to execute. Also, it helps locality to execute
1013 // immediately.
Jonathan Peyton7881aa12015-05-21 21:16:38 +00001014 taskdata->td_flags.task_serial = ( parent_task->td_flags.final
Jim Cownie5e8470a2013-09-27 10:38:44 +00001015 || taskdata->td_flags.team_serial || taskdata->td_flags.tasking_ser );
1016
1017 taskdata->td_flags.started = 0;
1018 taskdata->td_flags.executing = 0;
1019 taskdata->td_flags.complete = 0;
1020 taskdata->td_flags.freed = 0;
1021
1022 taskdata->td_flags.native = flags->native;
1023
1024 taskdata->td_incomplete_child_tasks = 0;
1025 taskdata->td_allocated_child_tasks = 1; // start at one because counts current task and children
1026#if OMP_40_ENABLED
1027 taskdata->td_taskgroup = parent_task->td_taskgroup; // task inherits the taskgroup from the parent task
1028 taskdata->td_dephash = NULL;
1029 taskdata->td_depnode = NULL;
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001030#endif
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001031
1032 // Only need to keep track of child task counts if team parallel and tasking not serialized or if it is a proxy task
1033#if OMP_41_ENABLED
1034 if ( flags->proxy == TASK_PROXY || !( taskdata -> td_flags.team_serial || taskdata -> td_flags.tasking_ser ) )
1035#else
1036 if ( !( taskdata -> td_flags.team_serial || taskdata -> td_flags.tasking_ser ) )
1037#endif
1038 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001039 KMP_TEST_THEN_INC32( (kmp_int32 *)(& parent_task->td_incomplete_child_tasks) );
1040#if OMP_40_ENABLED
1041 if ( parent_task->td_taskgroup )
1042 KMP_TEST_THEN_INC32( (kmp_int32 *)(& parent_task->td_taskgroup->count) );
1043#endif
1044 // Only need to keep track of allocated child tasks for explicit tasks since implicit not deallocated
1045 if ( taskdata->td_parent->td_flags.tasktype == TASK_EXPLICIT ) {
1046 KMP_TEST_THEN_INC32( (kmp_int32 *)(& taskdata->td_parent->td_allocated_child_tasks) );
1047 }
1048 }
1049
1050 KA_TRACE(20, ("__kmp_task_alloc(exit): T#%d created task %p parent=%p\n",
1051 gtid, taskdata, taskdata->td_parent) );
1052
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001053#if OMPT_SUPPORT
Jonathan Peytonb401db62015-10-09 17:38:05 +00001054 __kmp_task_init_ompt(taskdata, gtid, (void*) task_entry);
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001055#endif
1056
Jim Cownie5e8470a2013-09-27 10:38:44 +00001057 return task;
1058}
1059
1060
1061kmp_task_t *
1062__kmpc_omp_task_alloc( ident_t *loc_ref, kmp_int32 gtid, kmp_int32 flags,
1063 size_t sizeof_kmp_task_t, size_t sizeof_shareds,
1064 kmp_routine_entry_t task_entry )
1065{
1066 kmp_task_t *retval;
1067 kmp_tasking_flags_t *input_flags = (kmp_tasking_flags_t *) & flags;
1068
1069 input_flags->native = FALSE;
1070 // __kmp_task_alloc() sets up all other runtime flags
1071
Jonathan Peyton1c9e6432015-06-03 18:24:02 +00001072#if OMP_41_ENABLED
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001073 KA_TRACE(10, ("__kmpc_omp_task_alloc(enter): T#%d loc=%p, flags=(%s %s) "
Jim Cownie5e8470a2013-09-27 10:38:44 +00001074 "sizeof_task=%ld sizeof_shared=%ld entry=%p\n",
1075 gtid, loc_ref, input_flags->tiedness ? "tied " : "untied",
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001076 input_flags->proxy ? "proxy" : "",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001077 sizeof_kmp_task_t, sizeof_shareds, task_entry) );
Jonathan Peyton1c9e6432015-06-03 18:24:02 +00001078#else
1079 KA_TRACE(10, ("__kmpc_omp_task_alloc(enter): T#%d loc=%p, flags=(%s) "
1080 "sizeof_task=%ld sizeof_shared=%ld entry=%p\n",
1081 gtid, loc_ref, input_flags->tiedness ? "tied " : "untied",
1082 sizeof_kmp_task_t, sizeof_shareds, task_entry) );
1083#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001084
1085 retval = __kmp_task_alloc( loc_ref, gtid, input_flags, sizeof_kmp_task_t,
1086 sizeof_shareds, task_entry );
1087
1088 KA_TRACE(20, ("__kmpc_omp_task_alloc(exit): T#%d retval %p\n", gtid, retval) );
1089
1090 return retval;
1091}
1092
1093//-----------------------------------------------------------
1094// __kmp_invoke_task: invoke the specified task
1095//
1096// gtid: global thread ID of caller
1097// task: the task to invoke
1098// current_task: the task to resume after task invokation
1099
1100static void
1101__kmp_invoke_task( kmp_int32 gtid, kmp_task_t *task, kmp_taskdata_t * current_task )
1102{
1103 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
Jim Cownie181b4bb2013-12-23 17:28:57 +00001104#if OMP_40_ENABLED
1105 int discard = 0 /* false */;
1106#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001107 KA_TRACE(30, ("__kmp_invoke_task(enter): T#%d invoking task %p, current_task=%p\n",
1108 gtid, taskdata, current_task) );
Jonathan Peytone03b62f2015-10-08 18:49:40 +00001109 KMP_DEBUG_ASSERT(task);
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001110#if OMP_41_ENABLED
1111 if ( taskdata->td_flags.proxy == TASK_PROXY &&
1112 taskdata->td_flags.complete == 1)
1113 {
1114 // This is a proxy task that was already completed but it needs to run
1115 // its bottom-half finish
1116 KA_TRACE(30, ("__kmp_invoke_task: T#%d running bottom finish for proxy task %p\n",
1117 gtid, taskdata) );
1118
1119 __kmp_bottom_half_finish_proxy(gtid,task);
1120
1121 KA_TRACE(30, ("__kmp_invoke_task(exit): T#%d completed bottom finish for proxy task %p, resuming task %p\n", gtid, taskdata, current_task) );
1122
1123 return;
1124 }
1125#endif
1126
1127#if OMP_41_ENABLED
1128 // Proxy tasks are not handled by the runtime
1129 if ( taskdata->td_flags.proxy != TASK_PROXY )
1130#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001131 __kmp_task_start( gtid, task, current_task );
1132
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001133#if OMPT_SUPPORT
1134 ompt_thread_info_t oldInfo;
1135 kmp_info_t * thread;
Jonathan Peytonb68a85d2015-09-21 18:11:22 +00001136 if (ompt_enabled) {
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001137 // Store the threads states and restore them after the task
1138 thread = __kmp_threads[ gtid ];
1139 oldInfo = thread->th.ompt_thread_info;
1140 thread->th.ompt_thread_info.wait_id = 0;
1141 thread->th.ompt_thread_info.state = ompt_state_work_parallel;
1142 taskdata->ompt_task_info.frame.exit_runtime_frame = __builtin_frame_address(0);
1143 }
1144#endif
1145
Jim Cownie181b4bb2013-12-23 17:28:57 +00001146#if OMP_40_ENABLED
1147 // TODO: cancel tasks if the parallel region has also been cancelled
1148 // TODO: check if this sequence can be hoisted above __kmp_task_start
1149 // if cancellation has been enabled for this run ...
1150 if (__kmp_omp_cancellation) {
1151 kmp_info_t *this_thr = __kmp_threads [ gtid ];
1152 kmp_team_t * this_team = this_thr->th.th_team;
1153 kmp_taskgroup_t * taskgroup = taskdata->td_taskgroup;
1154 if ((taskgroup && taskgroup->cancel_request) || (this_team->t.t_cancel_request == cancel_parallel)) {
Jonathan Peyton45be4502015-08-11 21:36:41 +00001155 KMP_COUNT_BLOCK(TASK_cancelled);
Jim Cownie181b4bb2013-12-23 17:28:57 +00001156 // this task belongs to a task group and we need to cancel it
1157 discard = 1 /* true */;
1158 }
1159 }
1160
Jim Cownie5e8470a2013-09-27 10:38:44 +00001161 //
1162 // Invoke the task routine and pass in relevant data.
1163 // Thunks generated by gcc take a different argument list.
1164 //
Jim Cownie181b4bb2013-12-23 17:28:57 +00001165 if (!discard) {
Jonathan Peyton45be4502015-08-11 21:36:41 +00001166 KMP_COUNT_BLOCK(TASK_executed);
1167 KMP_TIME_BLOCK (TASK_execution);
Jim Cownie181b4bb2013-12-23 17:28:57 +00001168#endif // OMP_40_ENABLED
Jonathan Peytonadee8c52015-11-11 17:49:50 +00001169
1170#if OMPT_SUPPORT && OMPT_TRACE
1171 /* let OMPT know that we're about to run this task */
1172 if (ompt_enabled &&
1173 ompt_callbacks.ompt_callback(ompt_event_task_switch))
1174 {
1175 ompt_callbacks.ompt_callback(ompt_event_task_switch)(
1176 current_task->ompt_task_info.task_id,
1177 taskdata->ompt_task_info.task_id);
1178 }
1179#endif
1180
Jim Cownie5e8470a2013-09-27 10:38:44 +00001181#ifdef KMP_GOMP_COMPAT
Jim Cownie181b4bb2013-12-23 17:28:57 +00001182 if (taskdata->td_flags.native) {
1183 ((void (*)(void *))(*(task->routine)))(task->shareds);
1184 }
1185 else
Jim Cownie5e8470a2013-09-27 10:38:44 +00001186#endif /* KMP_GOMP_COMPAT */
Jim Cownie181b4bb2013-12-23 17:28:57 +00001187 {
1188 (*(task->routine))(gtid, task);
1189 }
Jonathan Peytonadee8c52015-11-11 17:49:50 +00001190
1191#if OMPT_SUPPORT && OMPT_TRACE
1192 /* let OMPT know that we're returning to the callee task */
1193 if (ompt_enabled &&
1194 ompt_callbacks.ompt_callback(ompt_event_task_switch))
1195 {
1196 ompt_callbacks.ompt_callback(ompt_event_task_switch)(
1197 taskdata->ompt_task_info.task_id,
1198 current_task->ompt_task_info.task_id);
1199 }
1200#endif
1201
Jim Cownie181b4bb2013-12-23 17:28:57 +00001202#if OMP_40_ENABLED
Jim Cownie5e8470a2013-09-27 10:38:44 +00001203 }
Jim Cownie181b4bb2013-12-23 17:28:57 +00001204#endif // OMP_40_ENABLED
Jim Cownie5e8470a2013-09-27 10:38:44 +00001205
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001206
1207#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +00001208 if (ompt_enabled) {
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001209 thread->th.ompt_thread_info = oldInfo;
1210 taskdata->ompt_task_info.frame.exit_runtime_frame = 0;
1211 }
1212#endif
1213
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001214#if OMP_41_ENABLED
1215 // Proxy tasks are not handled by the runtime
1216 if ( taskdata->td_flags.proxy != TASK_PROXY )
1217#endif
1218 __kmp_task_finish( gtid, task, current_task );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001219
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001220 KA_TRACE(30, ("__kmp_invoke_task(exit): T#%d completed task %p, resuming task %p\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001221 gtid, taskdata, current_task) );
1222 return;
1223}
1224
1225//-----------------------------------------------------------------------
1226// __kmpc_omp_task_parts: Schedule a thread-switchable task for execution
1227//
1228// loc_ref: location of original task pragma (ignored)
1229// gtid: Global Thread ID of encountering thread
1230// new_task: task thunk allocated by __kmp_omp_task_alloc() for the ''new task''
1231// Returns:
1232// TASK_CURRENT_NOT_QUEUED (0) if did not suspend and queue current task to be resumed later.
1233// TASK_CURRENT_QUEUED (1) if suspended and queued the current task to be resumed later.
1234
1235kmp_int32
1236__kmpc_omp_task_parts( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t * new_task)
1237{
1238 kmp_taskdata_t * new_taskdata = KMP_TASK_TO_TASKDATA(new_task);
1239
1240 KA_TRACE(10, ("__kmpc_omp_task_parts(enter): T#%d loc=%p task=%p\n",
1241 gtid, loc_ref, new_taskdata ) );
1242
1243 /* Should we execute the new task or queue it? For now, let's just always try to
1244 queue it. If the queue fills up, then we'll execute it. */
1245
1246 if ( __kmp_push_task( gtid, new_task ) == TASK_NOT_PUSHED ) // if cannot defer
1247 { // Execute this task immediately
1248 kmp_taskdata_t * current_task = __kmp_threads[ gtid ] -> th.th_current_task;
1249 new_taskdata->td_flags.task_serial = 1;
1250 __kmp_invoke_task( gtid, new_task, current_task );
1251 }
1252
1253 KA_TRACE(10, ("__kmpc_omp_task_parts(exit): T#%d returning TASK_CURRENT_NOT_QUEUED: "
1254 "loc=%p task=%p, return: TASK_CURRENT_NOT_QUEUED\n", gtid, loc_ref,
1255 new_taskdata ) );
1256
1257 return TASK_CURRENT_NOT_QUEUED;
1258}
1259
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001260//---------------------------------------------------------------------
1261// __kmp_omp_task: Schedule a non-thread-switchable task for execution
1262// gtid: Global Thread ID of encountering thread
1263// new_task: non-thread-switchable task thunk allocated by __kmp_omp_task_alloc()
1264// serialize_immediate: if TRUE then if the task is executed immediately its execution will be serialized
1265// returns:
1266//
1267// TASK_CURRENT_NOT_QUEUED (0) if did not suspend and queue current task to be resumed later.
1268// TASK_CURRENT_QUEUED (1) if suspended and queued the current task to be resumed later.
1269kmp_int32
1270__kmp_omp_task( kmp_int32 gtid, kmp_task_t * new_task, bool serialize_immediate )
1271{
1272 kmp_taskdata_t * new_taskdata = KMP_TASK_TO_TASKDATA(new_task);
1273
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001274#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +00001275 if (ompt_enabled) {
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001276 new_taskdata->ompt_task_info.frame.reenter_runtime_frame =
1277 __builtin_frame_address(0);
1278 }
1279#endif
1280
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001281 /* Should we execute the new task or queue it? For now, let's just always try to
1282 queue it. If the queue fills up, then we'll execute it. */
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001283#if OMP_41_ENABLED
1284 if ( new_taskdata->td_flags.proxy == TASK_PROXY || __kmp_push_task( gtid, new_task ) == TASK_NOT_PUSHED ) // if cannot defer
1285#else
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001286 if ( __kmp_push_task( gtid, new_task ) == TASK_NOT_PUSHED ) // if cannot defer
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001287#endif
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001288 { // Execute this task immediately
1289 kmp_taskdata_t * current_task = __kmp_threads[ gtid ] -> th.th_current_task;
1290 if ( serialize_immediate )
1291 new_taskdata -> td_flags.task_serial = 1;
1292 __kmp_invoke_task( gtid, new_task, current_task );
1293 }
1294
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001295#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +00001296 if (ompt_enabled) {
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001297 new_taskdata->ompt_task_info.frame.reenter_runtime_frame = 0;
1298 }
1299#endif
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001300
1301 return TASK_CURRENT_NOT_QUEUED;
1302}
Jim Cownie5e8470a2013-09-27 10:38:44 +00001303
1304//---------------------------------------------------------------------
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001305// __kmpc_omp_task: Wrapper around __kmp_omp_task to schedule a non-thread-switchable task from
1306// the parent thread only!
Jim Cownie5e8470a2013-09-27 10:38:44 +00001307// loc_ref: location of original task pragma (ignored)
1308// gtid: Global Thread ID of encountering thread
1309// new_task: non-thread-switchable task thunk allocated by __kmp_omp_task_alloc()
1310// returns:
1311//
1312// TASK_CURRENT_NOT_QUEUED (0) if did not suspend and queue current task to be resumed later.
1313// TASK_CURRENT_QUEUED (1) if suspended and queued the current task to be resumed later.
1314
1315kmp_int32
1316__kmpc_omp_task( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t * new_task)
1317{
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001318 kmp_int32 res;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001319
Jonathan Peytond2eb3c72015-08-26 20:02:21 +00001320#if KMP_DEBUG
1321 kmp_taskdata_t * new_taskdata = KMP_TASK_TO_TASKDATA(new_task);
1322#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001323 KA_TRACE(10, ("__kmpc_omp_task(enter): T#%d loc=%p task=%p\n",
1324 gtid, loc_ref, new_taskdata ) );
1325
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001326 res = __kmp_omp_task(gtid,new_task,true);
Jim Cownie5e8470a2013-09-27 10:38:44 +00001327
1328 KA_TRACE(10, ("__kmpc_omp_task(exit): T#%d returning TASK_CURRENT_NOT_QUEUED: loc=%p task=%p\n",
1329 gtid, loc_ref, new_taskdata ) );
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001330 return res;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001331}
1332
Jim Cownie5e8470a2013-09-27 10:38:44 +00001333//-------------------------------------------------------------------------------------
1334// __kmpc_omp_taskwait: Wait until all tasks generated by the current task are complete
1335
1336kmp_int32
1337__kmpc_omp_taskwait( ident_t *loc_ref, kmp_int32 gtid )
1338{
1339 kmp_taskdata_t * taskdata;
1340 kmp_info_t * thread;
1341 int thread_finished = FALSE;
1342
Jonathan Peyton54127982015-11-04 21:37:48 +00001343 KA_TRACE(10, ("__kmpc_omp_taskwait(enter): T#%d loc=%p\n", gtid, loc_ref) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001344
1345 if ( __kmp_tasking_mode != tskm_immediate_exec ) {
1346 // GEH TODO: shouldn't we have some sort of OMPRAP API calls here to mark begin wait?
1347
1348 thread = __kmp_threads[ gtid ];
1349 taskdata = thread -> th.th_current_task;
Jonathan Peyton960ea2f2015-11-09 15:57:04 +00001350
1351#if OMPT_SUPPORT && OMPT_TRACE
1352 ompt_task_id_t my_task_id;
1353 ompt_parallel_id_t my_parallel_id;
1354
1355 if (ompt_enabled) {
1356 kmp_team_t *team = thread->th.th_team;
1357 my_task_id = taskdata->ompt_task_info.task_id;
1358 my_parallel_id = team->t.ompt_team_info.parallel_id;
1359
1360 if (ompt_callbacks.ompt_callback(ompt_event_taskwait_begin)) {
1361 ompt_callbacks.ompt_callback(ompt_event_taskwait_begin)(
1362 my_parallel_id, my_task_id);
1363 }
1364 }
1365#endif
1366
Jim Cownie5e8470a2013-09-27 10:38:44 +00001367#if USE_ITT_BUILD
1368 // Note: These values are used by ITT events as well.
1369#endif /* USE_ITT_BUILD */
1370 taskdata->td_taskwait_counter += 1;
1371 taskdata->td_taskwait_ident = loc_ref;
1372 taskdata->td_taskwait_thread = gtid + 1;
1373
1374#if USE_ITT_BUILD
1375 void * itt_sync_obj = __kmp_itt_taskwait_object( gtid );
1376 if ( itt_sync_obj != NULL )
1377 __kmp_itt_taskwait_starting( gtid, itt_sync_obj );
1378#endif /* USE_ITT_BUILD */
1379
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001380#if OMP_41_ENABLED
1381 if ( ! taskdata->td_flags.team_serial || (thread->th.th_task_team != NULL && thread->th.th_task_team->tt.tt_found_proxy_tasks) )
1382#else
1383 if ( ! taskdata->td_flags.team_serial )
1384#endif
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001385 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001386 // GEH: if team serialized, avoid reading the volatile variable below.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001387 kmp_flag_32 flag(&(taskdata->td_incomplete_child_tasks), 0U);
Jim Cownie5e8470a2013-09-27 10:38:44 +00001388 while ( TCR_4(taskdata -> td_incomplete_child_tasks) != 0 ) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001389 flag.execute_tasks(thread, gtid, FALSE, &thread_finished
1390 USE_ITT_BUILD_ARG(itt_sync_obj), __kmp_task_stealing_constraint );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001391 }
1392 }
1393#if USE_ITT_BUILD
1394 if ( itt_sync_obj != NULL )
1395 __kmp_itt_taskwait_finished( gtid, itt_sync_obj );
1396#endif /* USE_ITT_BUILD */
1397
1398 // GEH TODO: shouldn't we have some sort of OMPRAP API calls here to mark end of wait?
1399 taskdata->td_taskwait_thread = - taskdata->td_taskwait_thread;
Jonathan Peyton960ea2f2015-11-09 15:57:04 +00001400
1401#if OMPT_SUPPORT && OMPT_TRACE
1402 if (ompt_enabled &&
1403 ompt_callbacks.ompt_callback(ompt_event_taskwait_end)) {
1404 ompt_callbacks.ompt_callback(ompt_event_taskwait_end)(
1405 my_parallel_id, my_task_id);
1406 }
1407#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001408 }
1409
1410 KA_TRACE(10, ("__kmpc_omp_taskwait(exit): T#%d task %p finished waiting, "
1411 "returning TASK_CURRENT_NOT_QUEUED\n", gtid, taskdata) );
1412
1413 return TASK_CURRENT_NOT_QUEUED;
1414}
1415
1416
1417//-------------------------------------------------
1418// __kmpc_omp_taskyield: switch to a different task
1419
1420kmp_int32
1421__kmpc_omp_taskyield( ident_t *loc_ref, kmp_int32 gtid, int end_part )
1422{
1423 kmp_taskdata_t * taskdata;
1424 kmp_info_t * thread;
1425 int thread_finished = FALSE;
1426
Jonathan Peyton45be4502015-08-11 21:36:41 +00001427 KMP_COUNT_BLOCK(OMP_TASKYIELD);
1428
Jim Cownie5e8470a2013-09-27 10:38:44 +00001429 KA_TRACE(10, ("__kmpc_omp_taskyield(enter): T#%d loc=%p end_part = %d\n",
1430 gtid, loc_ref, end_part) );
1431
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001432 if ( __kmp_tasking_mode != tskm_immediate_exec && __kmp_init_parallel ) {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001433 // GEH TODO: shouldn't we have some sort of OMPRAP API calls here to mark begin wait?
1434
1435 thread = __kmp_threads[ gtid ];
1436 taskdata = thread -> th.th_current_task;
1437 // Should we model this as a task wait or not?
1438#if USE_ITT_BUILD
1439 // Note: These values are used by ITT events as well.
1440#endif /* USE_ITT_BUILD */
1441 taskdata->td_taskwait_counter += 1;
1442 taskdata->td_taskwait_ident = loc_ref;
1443 taskdata->td_taskwait_thread = gtid + 1;
1444
1445#if USE_ITT_BUILD
1446 void * itt_sync_obj = __kmp_itt_taskwait_object( gtid );
1447 if ( itt_sync_obj != NULL )
1448 __kmp_itt_taskwait_starting( gtid, itt_sync_obj );
1449#endif /* USE_ITT_BUILD */
1450 if ( ! taskdata->td_flags.team_serial ) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001451 kmp_task_team_t * task_team = thread->th.th_task_team;
1452 if (task_team != NULL) {
Andrey Churbanov6d224db2015-02-10 18:37:43 +00001453 if (KMP_TASKING_ENABLED(task_team)) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001454 __kmp_execute_tasks_32( thread, gtid, NULL, FALSE, &thread_finished
1455 USE_ITT_BUILD_ARG(itt_sync_obj), __kmp_task_stealing_constraint );
1456 }
1457 }
Jim Cownie5e8470a2013-09-27 10:38:44 +00001458 }
Jim Cownie5e8470a2013-09-27 10:38:44 +00001459#if USE_ITT_BUILD
1460 if ( itt_sync_obj != NULL )
1461 __kmp_itt_taskwait_finished( gtid, itt_sync_obj );
1462#endif /* USE_ITT_BUILD */
1463
1464 // GEH TODO: shouldn't we have some sort of OMPRAP API calls here to mark end of wait?
1465 taskdata->td_taskwait_thread = - taskdata->td_taskwait_thread;
1466 }
1467
1468 KA_TRACE(10, ("__kmpc_omp_taskyield(exit): T#%d task %p resuming, "
1469 "returning TASK_CURRENT_NOT_QUEUED\n", gtid, taskdata) );
1470
1471 return TASK_CURRENT_NOT_QUEUED;
1472}
1473
1474
1475#if OMP_40_ENABLED
1476//-------------------------------------------------------------------------------------
1477// __kmpc_taskgroup: Start a new taskgroup
1478
1479void
Jim Cownie181b4bb2013-12-23 17:28:57 +00001480__kmpc_taskgroup( ident_t* loc, int gtid )
Jim Cownie5e8470a2013-09-27 10:38:44 +00001481{
1482 kmp_info_t * thread = __kmp_threads[ gtid ];
1483 kmp_taskdata_t * taskdata = thread->th.th_current_task;
1484 kmp_taskgroup_t * tg_new =
1485 (kmp_taskgroup_t *)__kmp_thread_malloc( thread, sizeof( kmp_taskgroup_t ) );
1486 KA_TRACE(10, ("__kmpc_taskgroup: T#%d loc=%p group=%p\n", gtid, loc, tg_new) );
1487 tg_new->count = 0;
Jim Cownie181b4bb2013-12-23 17:28:57 +00001488 tg_new->cancel_request = cancel_noreq;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001489 tg_new->parent = taskdata->td_taskgroup;
1490 taskdata->td_taskgroup = tg_new;
1491}
1492
1493
1494//-------------------------------------------------------------------------------------
1495// __kmpc_end_taskgroup: Wait until all tasks generated by the current task
1496// and its descendants are complete
1497
1498void
Jim Cownie181b4bb2013-12-23 17:28:57 +00001499__kmpc_end_taskgroup( ident_t* loc, int gtid )
Jim Cownie5e8470a2013-09-27 10:38:44 +00001500{
1501 kmp_info_t * thread = __kmp_threads[ gtid ];
1502 kmp_taskdata_t * taskdata = thread->th.th_current_task;
1503 kmp_taskgroup_t * taskgroup = taskdata->td_taskgroup;
1504 int thread_finished = FALSE;
1505
1506 KA_TRACE(10, ("__kmpc_end_taskgroup(enter): T#%d loc=%p\n", gtid, loc) );
1507 KMP_DEBUG_ASSERT( taskgroup != NULL );
1508
1509 if ( __kmp_tasking_mode != tskm_immediate_exec ) {
1510#if USE_ITT_BUILD
1511 // For ITT the taskgroup wait is similar to taskwait until we need to distinguish them
1512 void * itt_sync_obj = __kmp_itt_taskwait_object( gtid );
1513 if ( itt_sync_obj != NULL )
1514 __kmp_itt_taskwait_starting( gtid, itt_sync_obj );
1515#endif /* USE_ITT_BUILD */
1516
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001517#if OMP_41_ENABLED
1518 if ( ! taskdata->td_flags.team_serial || (thread->th.th_task_team != NULL && thread->th.th_task_team->tt.tt_found_proxy_tasks) )
1519#else
1520 if ( ! taskdata->td_flags.team_serial )
1521#endif
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001522 {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001523 kmp_flag_32 flag(&(taskgroup->count), 0U);
Jim Cownie5e8470a2013-09-27 10:38:44 +00001524 while ( TCR_4(taskgroup->count) != 0 ) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001525 flag.execute_tasks(thread, gtid, FALSE, &thread_finished
1526 USE_ITT_BUILD_ARG(itt_sync_obj), __kmp_task_stealing_constraint );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001527 }
1528 }
1529
1530#if USE_ITT_BUILD
1531 if ( itt_sync_obj != NULL )
1532 __kmp_itt_taskwait_finished( gtid, itt_sync_obj );
1533#endif /* USE_ITT_BUILD */
1534 }
1535 KMP_DEBUG_ASSERT( taskgroup->count == 0 );
1536
1537 // Restore parent taskgroup for the current task
1538 taskdata->td_taskgroup = taskgroup->parent;
1539 __kmp_thread_free( thread, taskgroup );
1540
1541 KA_TRACE(10, ("__kmpc_end_taskgroup(exit): T#%d task %p finished waiting\n", gtid, taskdata) );
1542}
1543#endif
1544
1545
1546//------------------------------------------------------
1547// __kmp_remove_my_task: remove a task from my own deque
1548
1549static kmp_task_t *
1550__kmp_remove_my_task( kmp_info_t * thread, kmp_int32 gtid, kmp_task_team_t *task_team,
1551 kmp_int32 is_constrained )
1552{
1553 kmp_task_t * task;
1554 kmp_taskdata_t * taskdata;
1555 kmp_thread_data_t *thread_data;
1556 kmp_uint32 tail;
1557
1558 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
1559 KMP_DEBUG_ASSERT( task_team -> tt.tt_threads_data != NULL ); // Caller should check this condition
1560
1561 thread_data = & task_team -> tt.tt_threads_data[ __kmp_tid_from_gtid( gtid ) ];
1562
1563 KA_TRACE(10, ("__kmp_remove_my_task(enter): T#%d ntasks=%d head=%u tail=%u\n",
1564 gtid, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1565 thread_data->td.td_deque_tail) );
1566
1567 if (TCR_4(thread_data -> td.td_deque_ntasks) == 0) {
1568 KA_TRACE(10, ("__kmp_remove_my_task(exit #1): T#%d No tasks to remove: ntasks=%d head=%u tail=%u\n",
1569 gtid, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1570 thread_data->td.td_deque_tail) );
1571 return NULL;
1572 }
1573
1574 __kmp_acquire_bootstrap_lock( & thread_data -> td.td_deque_lock );
1575
1576 if (TCR_4(thread_data -> td.td_deque_ntasks) == 0) {
1577 __kmp_release_bootstrap_lock( & thread_data -> td.td_deque_lock );
1578 KA_TRACE(10, ("__kmp_remove_my_task(exit #2): T#%d No tasks to remove: ntasks=%d head=%u tail=%u\n",
1579 gtid, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1580 thread_data->td.td_deque_tail) );
1581 return NULL;
1582 }
1583
1584 tail = ( thread_data -> td.td_deque_tail - 1 ) & TASK_DEQUE_MASK; // Wrap index.
1585 taskdata = thread_data -> td.td_deque[ tail ];
1586
1587 if (is_constrained) {
1588 // we need to check if the candidate obeys task scheduling constraint:
1589 // only child of current task can be scheduled
1590 kmp_taskdata_t * current = thread->th.th_current_task;
1591 kmp_int32 level = current->td_level;
1592 kmp_taskdata_t * parent = taskdata->td_parent;
1593 while ( parent != current && parent->td_level > level ) {
1594 parent = parent->td_parent; // check generation up to the level of the current task
1595 KMP_DEBUG_ASSERT(parent != NULL);
1596 }
1597 if ( parent != current ) {
1598 // If the tail task is not a child, then no other childs can appear in the deque.
1599 __kmp_release_bootstrap_lock( & thread_data -> td.td_deque_lock );
1600 KA_TRACE(10, ("__kmp_remove_my_task(exit #2): T#%d No tasks to remove: ntasks=%d head=%u tail=%u\n",
1601 gtid, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1602 thread_data->td.td_deque_tail) );
1603 return NULL;
1604 }
1605 }
1606
1607 thread_data -> td.td_deque_tail = tail;
1608 TCW_4(thread_data -> td.td_deque_ntasks, thread_data -> td.td_deque_ntasks - 1);
1609
1610 __kmp_release_bootstrap_lock( & thread_data->td.td_deque_lock );
1611
1612 KA_TRACE(10, ("__kmp_remove_my_task(exit #2): T#%d task %p removed: ntasks=%d head=%u tail=%u\n",
1613 gtid, taskdata, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1614 thread_data->td.td_deque_tail) );
1615
1616 task = KMP_TASKDATA_TO_TASK( taskdata );
1617 return task;
1618}
1619
1620
1621//-----------------------------------------------------------
1622// __kmp_steal_task: remove a task from another thread's deque
1623// Assume that calling thread has already checked existence of
1624// task_team thread_data before calling this routine.
1625
1626static kmp_task_t *
1627__kmp_steal_task( kmp_info_t *victim, kmp_int32 gtid, kmp_task_team_t *task_team,
1628 volatile kmp_uint32 *unfinished_threads, int *thread_finished,
1629 kmp_int32 is_constrained )
1630{
1631 kmp_task_t * task;
1632 kmp_taskdata_t * taskdata;
1633 kmp_thread_data_t *victim_td, *threads_data;
Jonathan Peyton7c4d66d2015-06-08 20:01:14 +00001634 kmp_int32 victim_tid;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001635
1636 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
1637
1638 threads_data = task_team -> tt.tt_threads_data;
1639 KMP_DEBUG_ASSERT( threads_data != NULL ); // Caller should check this condition
1640
1641 victim_tid = victim->th.th_info.ds.ds_tid;
1642 victim_td = & threads_data[ victim_tid ];
1643
1644 KA_TRACE(10, ("__kmp_steal_task(enter): T#%d try to steal from T#%d: task_team=%p ntasks=%d "
1645 "head=%u tail=%u\n",
1646 gtid, __kmp_gtid_from_thread( victim ), task_team, victim_td->td.td_deque_ntasks,
1647 victim_td->td.td_deque_head, victim_td->td.td_deque_tail) );
1648
1649 if ( (TCR_4(victim_td -> td.td_deque_ntasks) == 0) || // Caller should not check this condition
1650 (TCR_PTR(victim->th.th_task_team) != task_team)) // GEH: why would this happen?
1651 {
1652 KA_TRACE(10, ("__kmp_steal_task(exit #1): T#%d could not steal from T#%d: task_team=%p "
1653 "ntasks=%d head=%u tail=%u\n",
1654 gtid, __kmp_gtid_from_thread( victim ), task_team, victim_td->td.td_deque_ntasks,
1655 victim_td->td.td_deque_head, victim_td->td.td_deque_tail) );
1656 return NULL;
1657 }
1658
1659 __kmp_acquire_bootstrap_lock( & victim_td -> td.td_deque_lock );
1660
1661 // Check again after we acquire the lock
1662 if ( (TCR_4(victim_td -> td.td_deque_ntasks) == 0) ||
1663 (TCR_PTR(victim->th.th_task_team) != task_team)) // GEH: why would this happen?
1664 {
1665 __kmp_release_bootstrap_lock( & victim_td -> td.td_deque_lock );
1666 KA_TRACE(10, ("__kmp_steal_task(exit #2): T#%d could not steal from T#%d: task_team=%p "
1667 "ntasks=%d head=%u tail=%u\n",
1668 gtid, __kmp_gtid_from_thread( victim ), task_team, victim_td->td.td_deque_ntasks,
1669 victim_td->td.td_deque_head, victim_td->td.td_deque_tail) );
1670 return NULL;
1671 }
1672
1673 KMP_DEBUG_ASSERT( victim_td -> td.td_deque != NULL );
1674
1675 if ( !is_constrained ) {
1676 taskdata = victim_td -> td.td_deque[ victim_td -> td.td_deque_head ];
1677 // Bump head pointer and Wrap.
1678 victim_td -> td.td_deque_head = ( victim_td -> td.td_deque_head + 1 ) & TASK_DEQUE_MASK;
1679 } else {
1680 // While we have postponed tasks let's steal from tail of the deque (smaller tasks)
1681 kmp_int32 tail = ( victim_td -> td.td_deque_tail - 1 ) & TASK_DEQUE_MASK; // Wrap index.
1682 taskdata = victim_td -> td.td_deque[ tail ];
1683 // we need to check if the candidate obeys task scheduling constraint:
1684 // only child of current task can be scheduled
1685 kmp_taskdata_t * current = __kmp_threads[ gtid ]->th.th_current_task;
1686 kmp_int32 level = current->td_level;
1687 kmp_taskdata_t * parent = taskdata->td_parent;
1688 while ( parent != current && parent->td_level > level ) {
1689 parent = parent->td_parent; // check generation up to the level of the current task
1690 KMP_DEBUG_ASSERT(parent != NULL);
1691 }
1692 if ( parent != current ) {
1693 // If the tail task is not a child, then no other childs can appear in the deque (?).
1694 __kmp_release_bootstrap_lock( & victim_td -> td.td_deque_lock );
1695 KA_TRACE(10, ("__kmp_steal_task(exit #2): T#%d could not steal from T#%d: task_team=%p "
1696 "ntasks=%d head=%u tail=%u\n",
1697 gtid, __kmp_gtid_from_thread( threads_data[victim_tid].td.td_thr ),
1698 task_team, victim_td->td.td_deque_ntasks,
1699 victim_td->td.td_deque_head, victim_td->td.td_deque_tail) );
1700 return NULL;
1701 }
1702 victim_td -> td.td_deque_tail = tail;
1703 }
1704 if (*thread_finished) {
1705 // We need to un-mark this victim as a finished victim. This must be done before
1706 // releasing the lock, or else other threads (starting with the master victim)
1707 // might be prematurely released from the barrier!!!
Jonathan Peytone8104ad2015-06-08 18:56:33 +00001708 kmp_uint32 count;
1709
1710 count = KMP_TEST_THEN_INC32( (kmp_int32 *)unfinished_threads );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001711
1712 KA_TRACE(20, ("__kmp_steal_task: T#%d inc unfinished_threads to %d: task_team=%p\n",
1713 gtid, count + 1, task_team) );
1714
1715 *thread_finished = FALSE;
1716 }
1717 TCW_4(victim_td -> td.td_deque_ntasks, TCR_4(victim_td -> td.td_deque_ntasks) - 1);
1718
1719 __kmp_release_bootstrap_lock( & victim_td -> td.td_deque_lock );
1720
Jonathan Peyton45be4502015-08-11 21:36:41 +00001721 KMP_COUNT_BLOCK(TASK_stolen);
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001722 KA_TRACE(10, ("__kmp_steal_task(exit #3): T#%d stole task %p from T#%d: task_team=%p "
Jim Cownie5e8470a2013-09-27 10:38:44 +00001723 "ntasks=%d head=%u tail=%u\n",
1724 gtid, taskdata, __kmp_gtid_from_thread( victim ), task_team,
1725 victim_td->td.td_deque_ntasks, victim_td->td.td_deque_head,
1726 victim_td->td.td_deque_tail) );
1727
1728 task = KMP_TASKDATA_TO_TASK( taskdata );
1729 return task;
1730}
1731
1732
1733//-----------------------------------------------------------------------------
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001734// __kmp_execute_tasks_template: Choose and execute tasks until either the condition
Jim Cownie5e8470a2013-09-27 10:38:44 +00001735// is statisfied (return true) or there are none left (return false).
1736// final_spin is TRUE if this is the spin at the release barrier.
1737// thread_finished indicates whether the thread is finished executing all
1738// the tasks it has on its deque, and is at the release barrier.
1739// spinner is the location on which to spin.
1740// spinner == NULL means only execute a single task and return.
1741// checker is the value to check to terminate the spin.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001742template <class C>
1743static inline int __kmp_execute_tasks_template(kmp_info_t *thread, kmp_int32 gtid, C *flag, int final_spin,
1744 int *thread_finished
1745 USE_ITT_BUILD_ARG(void * itt_sync_obj), kmp_int32 is_constrained)
Jim Cownie5e8470a2013-09-27 10:38:44 +00001746{
1747 kmp_task_team_t * task_team;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001748 kmp_thread_data_t * threads_data;
1749 kmp_task_t * task;
1750 kmp_taskdata_t * current_task = thread -> th.th_current_task;
1751 volatile kmp_uint32 * unfinished_threads;
1752 kmp_int32 nthreads, last_stolen, k, tid;
1753
1754 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
1755 KMP_DEBUG_ASSERT( thread == __kmp_threads[ gtid ] );
1756
1757 task_team = thread -> th.th_task_team;
Jonathan Peyton54127982015-11-04 21:37:48 +00001758 if (task_team == NULL) return FALSE;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001759
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001760 KA_TRACE(15, ("__kmp_execute_tasks_template(enter): T#%d final_spin=%d *thread_finished=%d\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001761 gtid, final_spin, *thread_finished) );
1762
1763 threads_data = (kmp_thread_data_t *)TCR_PTR(task_team -> tt.tt_threads_data);
1764 KMP_DEBUG_ASSERT( threads_data != NULL );
1765
1766 nthreads = task_team -> tt.tt_nproc;
1767 unfinished_threads = &(task_team -> tt.tt_unfinished_threads);
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001768#if OMP_41_ENABLED
1769 KMP_DEBUG_ASSERT( nthreads > 1 || task_team->tt.tt_found_proxy_tasks);
1770#else
Jim Cownie5e8470a2013-09-27 10:38:44 +00001771 KMP_DEBUG_ASSERT( nthreads > 1 );
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001772#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001773 KMP_DEBUG_ASSERT( TCR_4((int)*unfinished_threads) >= 0 );
1774
1775 // Choose tasks from our own work queue.
1776 start:
1777 while (( task = __kmp_remove_my_task( thread, gtid, task_team, is_constrained )) != NULL ) {
1778#if USE_ITT_BUILD && USE_ITT_NOTIFY
1779 if ( __itt_sync_create_ptr || KMP_ITT_DEBUG ) {
1780 if ( itt_sync_obj == NULL ) {
1781 // we are at fork barrier where we could not get the object reliably
1782 itt_sync_obj = __kmp_itt_barrier_object( gtid, bs_forkjoin_barrier );
1783 }
1784 __kmp_itt_task_starting( itt_sync_obj );
1785 }
1786#endif /* USE_ITT_BUILD && USE_ITT_NOTIFY */
1787 __kmp_invoke_task( gtid, task, current_task );
1788#if USE_ITT_BUILD
1789 if ( itt_sync_obj != NULL )
1790 __kmp_itt_task_finished( itt_sync_obj );
1791#endif /* USE_ITT_BUILD */
1792
1793 // If this thread is only partway through the barrier and the condition
1794 // is met, then return now, so that the barrier gather/release pattern can proceed.
1795 // If this thread is in the last spin loop in the barrier, waiting to be
1796 // released, we know that the termination condition will not be satisified,
1797 // so don't waste any cycles checking it.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001798 if (flag == NULL || (!final_spin && flag->done_check())) {
1799 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #1): T#%d spin condition satisfied\n", gtid) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001800 return TRUE;
1801 }
Jonathan Peyton54127982015-11-04 21:37:48 +00001802 if (thread->th.th_task_team == NULL) break;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001803 KMP_YIELD( __kmp_library == library_throughput ); // Yield before executing next task
1804 }
1805
1806 // This thread's work queue is empty. If we are in the final spin loop
1807 // of the barrier, check and see if the termination condition is satisfied.
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001808#if OMP_41_ENABLED
1809 // The work queue may be empty but there might be proxy tasks still executing
1810 if (final_spin && TCR_4(current_task -> td_incomplete_child_tasks) == 0)
1811#else
1812 if (final_spin)
1813#endif
1814 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001815 // First, decrement the #unfinished threads, if that has not already
1816 // been done. This decrement might be to the spin location, and
1817 // result in the termination condition being satisfied.
1818 if (! *thread_finished) {
Jonathan Peytone8104ad2015-06-08 18:56:33 +00001819 kmp_uint32 count;
1820
1821 count = KMP_TEST_THEN_DEC32( (kmp_int32 *)unfinished_threads ) - 1;
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001822 KA_TRACE(20, ("__kmp_execute_tasks_template(dec #1): T#%d dec unfinished_threads to %d task_team=%p\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001823 gtid, count, task_team) );
1824 *thread_finished = TRUE;
1825 }
1826
1827 // It is now unsafe to reference thread->th.th_team !!!
1828 // Decrementing task_team->tt.tt_unfinished_threads can allow the master
1829 // thread to pass through the barrier, where it might reset each thread's
1830 // th.th_team field for the next parallel region.
1831 // If we can steal more work, we know that this has not happened yet.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001832 if (flag != NULL && flag->done_check()) {
1833 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #2): T#%d spin condition satisfied\n", gtid) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001834 return TRUE;
1835 }
1836 }
1837
Jonathan Peyton54127982015-11-04 21:37:48 +00001838 if (thread->th.th_task_team == NULL) return FALSE;
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001839#if OMP_41_ENABLED
1840 // check if there are other threads to steal from, otherwise go back
1841 if ( nthreads == 1 )
1842 goto start;
1843#endif
1844
Jim Cownie5e8470a2013-09-27 10:38:44 +00001845 // Try to steal from the last place I stole from successfully.
1846 tid = thread -> th.th_info.ds.ds_tid;//__kmp_tid_from_gtid( gtid );
1847 last_stolen = threads_data[ tid ].td.td_deque_last_stolen;
1848
1849 if (last_stolen != -1) {
1850 kmp_info_t *other_thread = threads_data[last_stolen].td.td_thr;
1851
1852 while ((task = __kmp_steal_task( other_thread, gtid, task_team, unfinished_threads,
1853 thread_finished, is_constrained )) != NULL)
1854 {
1855#if USE_ITT_BUILD && USE_ITT_NOTIFY
1856 if ( __itt_sync_create_ptr || KMP_ITT_DEBUG ) {
1857 if ( itt_sync_obj == NULL ) {
1858 // we are at fork barrier where we could not get the object reliably
1859 itt_sync_obj = __kmp_itt_barrier_object( gtid, bs_forkjoin_barrier );
1860 }
1861 __kmp_itt_task_starting( itt_sync_obj );
1862 }
1863#endif /* USE_ITT_BUILD && USE_ITT_NOTIFY */
1864 __kmp_invoke_task( gtid, task, current_task );
1865#if USE_ITT_BUILD
1866 if ( itt_sync_obj != NULL )
1867 __kmp_itt_task_finished( itt_sync_obj );
1868#endif /* USE_ITT_BUILD */
1869
1870 // Check to see if this thread can proceed.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001871 if (flag == NULL || (!final_spin && flag->done_check())) {
1872 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #3): T#%d spin condition satisfied\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001873 gtid) );
1874 return TRUE;
1875 }
1876
Jonathan Peyton54127982015-11-04 21:37:48 +00001877 if (thread->th.th_task_team == NULL) break;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001878 KMP_YIELD( __kmp_library == library_throughput ); // Yield before executing next task
1879 // If the execution of the stolen task resulted in more tasks being
1880 // placed on our run queue, then restart the whole process.
1881 if (TCR_4(threads_data[ tid ].td.td_deque_ntasks) != 0) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001882 KA_TRACE(20, ("__kmp_execute_tasks_template: T#%d stolen task spawned other tasks, restart\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001883 gtid) );
1884 goto start;
1885 }
1886 }
1887
1888 // Don't give priority to stealing from this thread anymore.
1889 threads_data[ tid ].td.td_deque_last_stolen = -1;
1890
1891 // The victims's work queue is empty. If we are in the final spin loop
1892 // of the barrier, check and see if the termination condition is satisfied.
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001893#if OMP_41_ENABLED
1894 // The work queue may be empty but there might be proxy tasks still executing
1895 if (final_spin && TCR_4(current_task -> td_incomplete_child_tasks) == 0)
1896#else
1897 if (final_spin)
1898#endif
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001899 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001900 // First, decrement the #unfinished threads, if that has not already
1901 // been done. This decrement might be to the spin location, and
1902 // result in the termination condition being satisfied.
1903 if (! *thread_finished) {
Jonathan Peytone8104ad2015-06-08 18:56:33 +00001904 kmp_uint32 count;
1905
1906 count = KMP_TEST_THEN_DEC32( (kmp_int32 *)unfinished_threads ) - 1;
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001907 KA_TRACE(20, ("__kmp_execute_tasks_template(dec #2): T#%d dec unfinished_threads to %d "
Jim Cownie5e8470a2013-09-27 10:38:44 +00001908 "task_team=%p\n", gtid, count, task_team) );
1909 *thread_finished = TRUE;
1910 }
1911
1912 // If __kmp_tasking_mode != tskm_immediate_exec
1913 // then it is now unsafe to reference thread->th.th_team !!!
1914 // Decrementing task_team->tt.tt_unfinished_threads can allow the master
1915 // thread to pass through the barrier, where it might reset each thread's
1916 // th.th_team field for the next parallel region.
1917 // If we can steal more work, we know that this has not happened yet.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001918 if (flag != NULL && flag->done_check()) {
1919 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #4): T#%d spin condition satisfied\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001920 gtid) );
1921 return TRUE;
1922 }
1923 }
Jonathan Peyton54127982015-11-04 21:37:48 +00001924 if (thread->th.th_task_team == NULL) return FALSE;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001925 }
1926
1927 // Find a different thread to steal work from. Pick a random thread.
1928 // My initial plan was to cycle through all the threads, and only return
1929 // if we tried to steal from every thread, and failed. Arch says that's
1930 // not such a great idea.
1931 // GEH - need yield code in this loop for throughput library mode?
1932 new_victim:
1933 k = __kmp_get_random( thread ) % (nthreads - 1);
1934 if ( k >= thread -> th.th_info.ds.ds_tid ) {
1935 ++k; // Adjusts random distribution to exclude self
1936 }
1937 {
1938 kmp_info_t *other_thread = threads_data[k].td.td_thr;
1939 int first;
1940
1941 // There is a slight chance that __kmp_enable_tasking() did not wake up
1942 // all threads waiting at the barrier. If this thread is sleeping, then
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001943 // wake it up. Since we were going to pay the cache miss penalty
1944 // for referencing another thread's kmp_info_t struct anyway, the check
Jim Cownie5e8470a2013-09-27 10:38:44 +00001945 // shouldn't cost too much performance at this point.
1946 // In extra barrier mode, tasks do not sleep at the separate tasking
1947 // barrier, so this isn't a problem.
1948 if ( ( __kmp_tasking_mode == tskm_task_teams ) &&
1949 (__kmp_dflt_blocktime != KMP_MAX_BLOCKTIME) &&
1950 (TCR_PTR(other_thread->th.th_sleep_loc) != NULL))
1951 {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001952 __kmp_null_resume_wrapper(__kmp_gtid_from_thread(other_thread), other_thread->th.th_sleep_loc);
Jim Cownie5e8470a2013-09-27 10:38:44 +00001953 // A sleeping thread should not have any tasks on it's queue.
Alp Toker8f2d3f02014-02-24 10:40:15 +00001954 // There is a slight possibility that it resumes, steals a task from
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001955 // another thread, which spawns more tasks, all in the time that it takes
Jim Cownie5e8470a2013-09-27 10:38:44 +00001956 // this thread to check => don't write an assertion that the victim's
1957 // queue is empty. Try stealing from a different thread.
1958 goto new_victim;
1959 }
1960
1961 // Now try to steal work from the selected thread
1962 first = TRUE;
1963 while ((task = __kmp_steal_task( other_thread, gtid, task_team, unfinished_threads,
1964 thread_finished, is_constrained )) != NULL)
1965 {
1966#if USE_ITT_BUILD && USE_ITT_NOTIFY
1967 if ( __itt_sync_create_ptr || KMP_ITT_DEBUG ) {
1968 if ( itt_sync_obj == NULL ) {
1969 // we are at fork barrier where we could not get the object reliably
1970 itt_sync_obj = __kmp_itt_barrier_object( gtid, bs_forkjoin_barrier );
1971 }
1972 __kmp_itt_task_starting( itt_sync_obj );
1973 }
1974#endif /* USE_ITT_BUILD && USE_ITT_NOTIFY */
1975 __kmp_invoke_task( gtid, task, current_task );
1976#if USE_ITT_BUILD
1977 if ( itt_sync_obj != NULL )
1978 __kmp_itt_task_finished( itt_sync_obj );
1979#endif /* USE_ITT_BUILD */
1980
1981 // Try stealing from this victim again, in the future.
1982 if (first) {
1983 threads_data[ tid ].td.td_deque_last_stolen = k;
1984 first = FALSE;
1985 }
1986
1987 // Check to see if this thread can proceed.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001988 if (flag == NULL || (!final_spin && flag->done_check())) {
1989 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #5): T#%d spin condition satisfied\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001990 gtid) );
1991 return TRUE;
1992 }
Jonathan Peyton54127982015-11-04 21:37:48 +00001993 if (thread->th.th_task_team == NULL) break;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001994 KMP_YIELD( __kmp_library == library_throughput ); // Yield before executing next task
1995
1996 // If the execution of the stolen task resulted in more tasks being
1997 // placed on our run queue, then restart the whole process.
1998 if (TCR_4(threads_data[ tid ].td.td_deque_ntasks) != 0) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001999 KA_TRACE(20, ("__kmp_execute_tasks_template: T#%d stolen task spawned other tasks, restart\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00002000 gtid) );
2001 goto start;
2002 }
2003 }
2004
2005 // The victims's work queue is empty. If we are in the final spin loop
2006 // of the barrier, check and see if the termination condition is satisfied.
2007 // Going on and finding a new victim to steal from is expensive, as it
2008 // involves a lot of cache misses, so we definitely want to re-check the
2009 // termination condition before doing that.
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002010#if OMP_41_ENABLED
2011 // The work queue may be empty but there might be proxy tasks still executing
2012 if (final_spin && TCR_4(current_task -> td_incomplete_child_tasks) == 0)
2013#else
2014 if (final_spin)
2015#endif
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00002016 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00002017 // First, decrement the #unfinished threads, if that has not already
2018 // been done. This decrement might be to the spin location, and
2019 // result in the termination condition being satisfied.
2020 if (! *thread_finished) {
Jonathan Peytone8104ad2015-06-08 18:56:33 +00002021 kmp_uint32 count;
2022
2023 count = KMP_TEST_THEN_DEC32( (kmp_int32 *)unfinished_threads ) - 1;
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002024 KA_TRACE(20, ("__kmp_execute_tasks_template(dec #3): T#%d dec unfinished_threads to %d; "
Jim Cownie5e8470a2013-09-27 10:38:44 +00002025 "task_team=%p\n",
2026 gtid, count, task_team) );
2027 *thread_finished = TRUE;
2028 }
2029
2030 // If __kmp_tasking_mode != tskm_immediate_exec,
2031 // then it is now unsafe to reference thread->th.th_team !!!
2032 // Decrementing task_team->tt.tt_unfinished_threads can allow the master
2033 // thread to pass through the barrier, where it might reset each thread's
2034 // th.th_team field for the next parallel region.
2035 // If we can steal more work, we know that this has not happened yet.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002036 if (flag != NULL && flag->done_check()) {
2037 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #6): T#%d spin condition satisfied\n", gtid) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00002038 return TRUE;
2039 }
2040 }
Jonathan Peyton54127982015-11-04 21:37:48 +00002041 if (thread->th.th_task_team == NULL) return FALSE;
Jim Cownie5e8470a2013-09-27 10:38:44 +00002042 }
2043
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002044 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #7): T#%d can't find work\n", gtid) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00002045 return FALSE;
2046}
2047
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002048int __kmp_execute_tasks_32(kmp_info_t *thread, kmp_int32 gtid, kmp_flag_32 *flag, int final_spin,
2049 int *thread_finished
2050 USE_ITT_BUILD_ARG(void * itt_sync_obj), kmp_int32 is_constrained)
2051{
2052 return __kmp_execute_tasks_template(thread, gtid, flag, final_spin, thread_finished
2053 USE_ITT_BUILD_ARG(itt_sync_obj), is_constrained);
2054}
2055
2056int __kmp_execute_tasks_64(kmp_info_t *thread, kmp_int32 gtid, kmp_flag_64 *flag, int final_spin,
2057 int *thread_finished
2058 USE_ITT_BUILD_ARG(void * itt_sync_obj), kmp_int32 is_constrained)
2059{
2060 return __kmp_execute_tasks_template(thread, gtid, flag, final_spin, thread_finished
2061 USE_ITT_BUILD_ARG(itt_sync_obj), is_constrained);
2062}
2063
2064int __kmp_execute_tasks_oncore(kmp_info_t *thread, kmp_int32 gtid, kmp_flag_oncore *flag, int final_spin,
2065 int *thread_finished
2066 USE_ITT_BUILD_ARG(void * itt_sync_obj), kmp_int32 is_constrained)
2067{
2068 return __kmp_execute_tasks_template(thread, gtid, flag, final_spin, thread_finished
2069 USE_ITT_BUILD_ARG(itt_sync_obj), is_constrained);
2070}
2071
2072
Jim Cownie5e8470a2013-09-27 10:38:44 +00002073
2074//-----------------------------------------------------------------------------
2075// __kmp_enable_tasking: Allocate task team and resume threads sleeping at the
2076// next barrier so they can assist in executing enqueued tasks.
2077// First thread in allocates the task team atomically.
2078
2079static void
2080__kmp_enable_tasking( kmp_task_team_t *task_team, kmp_info_t *this_thr )
2081{
Jim Cownie5e8470a2013-09-27 10:38:44 +00002082 kmp_thread_data_t *threads_data;
2083 int nthreads, i, is_init_thread;
2084
2085 KA_TRACE( 10, ( "__kmp_enable_tasking(enter): T#%d\n",
2086 __kmp_gtid_from_thread( this_thr ) ) );
2087
2088 KMP_DEBUG_ASSERT(task_team != NULL);
Jonathan Peytonfe9a1d72015-08-26 19:58:48 +00002089 KMP_DEBUG_ASSERT(this_thr->th.th_team != NULL);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002090
2091 nthreads = task_team->tt.tt_nproc;
2092 KMP_DEBUG_ASSERT(nthreads > 0);
Jonathan Peytonfe9a1d72015-08-26 19:58:48 +00002093 KMP_DEBUG_ASSERT(nthreads == this_thr->th.th_team->t.t_nproc);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002094
2095 // Allocate or increase the size of threads_data if necessary
2096 is_init_thread = __kmp_realloc_task_threads_data( this_thr, task_team );
2097
2098 if (!is_init_thread) {
2099 // Some other thread already set up the array.
2100 KA_TRACE( 20, ( "__kmp_enable_tasking(exit): T#%d: threads array already set up.\n",
2101 __kmp_gtid_from_thread( this_thr ) ) );
2102 return;
2103 }
2104 threads_data = (kmp_thread_data_t *)TCR_PTR(task_team -> tt.tt_threads_data);
2105 KMP_DEBUG_ASSERT( threads_data != NULL );
2106
2107 if ( ( __kmp_tasking_mode == tskm_task_teams ) &&
2108 ( __kmp_dflt_blocktime != KMP_MAX_BLOCKTIME ) )
2109 {
2110 // Release any threads sleeping at the barrier, so that they can steal
2111 // tasks and execute them. In extra barrier mode, tasks do not sleep
2112 // at the separate tasking barrier, so this isn't a problem.
2113 for (i = 0; i < nthreads; i++) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002114 volatile void *sleep_loc;
Jim Cownie5e8470a2013-09-27 10:38:44 +00002115 kmp_info_t *thread = threads_data[i].td.td_thr;
2116
2117 if (i == this_thr->th.th_info.ds.ds_tid) {
2118 continue;
2119 }
2120 // Since we haven't locked the thread's suspend mutex lock at this
2121 // point, there is a small window where a thread might be putting
2122 // itself to sleep, but hasn't set the th_sleep_loc field yet.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002123 // To work around this, __kmp_execute_tasks_template() periodically checks
Jim Cownie5e8470a2013-09-27 10:38:44 +00002124 // see if other threads are sleeping (using the same random
2125 // mechanism that is used for task stealing) and awakens them if
2126 // they are.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002127 if ( ( sleep_loc = TCR_PTR( thread -> th.th_sleep_loc) ) != NULL )
Jim Cownie5e8470a2013-09-27 10:38:44 +00002128 {
2129 KF_TRACE( 50, ( "__kmp_enable_tasking: T#%d waking up thread T#%d\n",
2130 __kmp_gtid_from_thread( this_thr ),
2131 __kmp_gtid_from_thread( thread ) ) );
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002132 __kmp_null_resume_wrapper(__kmp_gtid_from_thread(thread), sleep_loc);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002133 }
2134 else {
2135 KF_TRACE( 50, ( "__kmp_enable_tasking: T#%d don't wake up thread T#%d\n",
2136 __kmp_gtid_from_thread( this_thr ),
2137 __kmp_gtid_from_thread( thread ) ) );
2138 }
2139 }
2140 }
2141
2142 KA_TRACE( 10, ( "__kmp_enable_tasking(exit): T#%d\n",
2143 __kmp_gtid_from_thread( this_thr ) ) );
2144}
2145
2146
2147/* ------------------------------------------------------------------------ */
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002148/* // TODO: Check the comment consistency
Jim Cownie5e8470a2013-09-27 10:38:44 +00002149 * Utility routines for "task teams". A task team (kmp_task_t) is kind of
2150 * like a shadow of the kmp_team_t data struct, with a different lifetime.
2151 * After a child * thread checks into a barrier and calls __kmp_release() from
2152 * the particular variant of __kmp_<barrier_kind>_barrier_gather(), it can no
2153 * longer assume that the kmp_team_t structure is intact (at any moment, the
2154 * master thread may exit the barrier code and free the team data structure,
2155 * and return the threads to the thread pool).
2156 *
2157 * This does not work with the the tasking code, as the thread is still
2158 * expected to participate in the execution of any tasks that may have been
2159 * spawned my a member of the team, and the thread still needs access to all
2160 * to each thread in the team, so that it can steal work from it.
2161 *
2162 * Enter the existence of the kmp_task_team_t struct. It employs a reference
2163 * counting mechanims, and is allocated by the master thread before calling
2164 * __kmp_<barrier_kind>_release, and then is release by the last thread to
2165 * exit __kmp_<barrier_kind>_release at the next barrier. I.e. the lifetimes
2166 * of the kmp_task_team_t structs for consecutive barriers can overlap
2167 * (and will, unless the master thread is the last thread to exit the barrier
2168 * release phase, which is not typical).
2169 *
2170 * The existence of such a struct is useful outside the context of tasking,
2171 * but for now, I'm trying to keep it specific to the OMP_30_ENABLED macro,
2172 * so that any performance differences show up when comparing the 2.5 vs. 3.0
2173 * libraries.
2174 *
2175 * We currently use the existence of the threads array as an indicator that
2176 * tasks were spawned since the last barrier. If the structure is to be
2177 * useful outside the context of tasking, then this will have to change, but
2178 * not settting the field minimizes the performance impact of tasking on
2179 * barriers, when no explicit tasks were spawned (pushed, actually).
2180 */
2181
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002182
Jim Cownie5e8470a2013-09-27 10:38:44 +00002183static kmp_task_team_t *__kmp_free_task_teams = NULL; // Free list for task_team data structures
2184// Lock for task team data structures
2185static kmp_bootstrap_lock_t __kmp_task_team_lock = KMP_BOOTSTRAP_LOCK_INITIALIZER( __kmp_task_team_lock );
2186
2187
2188//------------------------------------------------------------------------------
2189// __kmp_alloc_task_deque:
2190// Allocates a task deque for a particular thread, and initialize the necessary
2191// data structures relating to the deque. This only happens once per thread
2192// per task team since task teams are recycled.
2193// No lock is needed during allocation since each thread allocates its own
2194// deque.
2195
2196static void
2197__kmp_alloc_task_deque( kmp_info_t *thread, kmp_thread_data_t *thread_data )
2198{
2199 __kmp_init_bootstrap_lock( & thread_data -> td.td_deque_lock );
2200 KMP_DEBUG_ASSERT( thread_data -> td.td_deque == NULL );
2201
2202 // Initialize last stolen task field to "none"
2203 thread_data -> td.td_deque_last_stolen = -1;
2204
2205 KMP_DEBUG_ASSERT( TCR_4(thread_data -> td.td_deque_ntasks) == 0 );
2206 KMP_DEBUG_ASSERT( thread_data -> td.td_deque_head == 0 );
2207 KMP_DEBUG_ASSERT( thread_data -> td.td_deque_tail == 0 );
2208
2209 KE_TRACE( 10, ( "__kmp_alloc_task_deque: T#%d allocating deque[%d] for thread_data %p\n",
2210 __kmp_gtid_from_thread( thread ), TASK_DEQUE_SIZE, thread_data ) );
2211 // Allocate space for task deque, and zero the deque
2212 // Cannot use __kmp_thread_calloc() because threads not around for
2213 // kmp_reap_task_team( ).
2214 thread_data -> td.td_deque = (kmp_taskdata_t **)
2215 __kmp_allocate( TASK_DEQUE_SIZE * sizeof(kmp_taskdata_t *));
2216}
2217
2218
2219//------------------------------------------------------------------------------
2220// __kmp_free_task_deque:
2221// Deallocates a task deque for a particular thread.
2222// Happens at library deallocation so don't need to reset all thread data fields.
2223
2224static void
2225__kmp_free_task_deque( kmp_thread_data_t *thread_data )
2226{
2227 __kmp_acquire_bootstrap_lock( & thread_data -> td.td_deque_lock );
2228
2229 if ( thread_data -> td.td_deque != NULL ) {
2230 TCW_4(thread_data -> td.td_deque_ntasks, 0);
2231 __kmp_free( thread_data -> td.td_deque );
2232 thread_data -> td.td_deque = NULL;
2233 }
2234 __kmp_release_bootstrap_lock( & thread_data -> td.td_deque_lock );
2235
2236#ifdef BUILD_TIED_TASK_STACK
2237 // GEH: Figure out what to do here for td_susp_tied_tasks
2238 if ( thread_data -> td.td_susp_tied_tasks.ts_entries != TASK_STACK_EMPTY ) {
2239 __kmp_free_task_stack( __kmp_thread_from_gtid( gtid ), thread_data );
2240 }
2241#endif // BUILD_TIED_TASK_STACK
2242}
2243
2244
2245//------------------------------------------------------------------------------
2246// __kmp_realloc_task_threads_data:
2247// Allocates a threads_data array for a task team, either by allocating an initial
2248// array or enlarging an existing array. Only the first thread to get the lock
2249// allocs or enlarges the array and re-initializes the array eleemnts.
2250// That thread returns "TRUE", the rest return "FALSE".
2251// Assumes that the new array size is given by task_team -> tt.tt_nproc.
2252// The current size is given by task_team -> tt.tt_max_threads.
2253
2254static int
2255__kmp_realloc_task_threads_data( kmp_info_t *thread, kmp_task_team_t *task_team )
2256{
2257 kmp_thread_data_t ** threads_data_p;
2258 kmp_int32 nthreads, maxthreads;
2259 int is_init_thread = FALSE;
2260
2261 if ( TCR_4(task_team -> tt.tt_found_tasks) ) {
2262 // Already reallocated and initialized.
2263 return FALSE;
2264 }
2265
2266 threads_data_p = & task_team -> tt.tt_threads_data;
2267 nthreads = task_team -> tt.tt_nproc;
2268 maxthreads = task_team -> tt.tt_max_threads;
2269
2270 // All threads must lock when they encounter the first task of the implicit task
2271 // region to make sure threads_data fields are (re)initialized before used.
2272 __kmp_acquire_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2273
2274 if ( ! TCR_4(task_team -> tt.tt_found_tasks) ) {
2275 // first thread to enable tasking
2276 kmp_team_t *team = thread -> th.th_team;
2277 int i;
2278
2279 is_init_thread = TRUE;
2280 if ( maxthreads < nthreads ) {
2281
2282 if ( *threads_data_p != NULL ) {
2283 kmp_thread_data_t *old_data = *threads_data_p;
2284 kmp_thread_data_t *new_data = NULL;
2285
2286 KE_TRACE( 10, ( "__kmp_realloc_task_threads_data: T#%d reallocating "
2287 "threads data for task_team %p, new_size = %d, old_size = %d\n",
2288 __kmp_gtid_from_thread( thread ), task_team,
2289 nthreads, maxthreads ) );
2290 // Reallocate threads_data to have more elements than current array
2291 // Cannot use __kmp_thread_realloc() because threads not around for
2292 // kmp_reap_task_team( ). Note all new array entries are initialized
2293 // to zero by __kmp_allocate().
2294 new_data = (kmp_thread_data_t *)
2295 __kmp_allocate( nthreads * sizeof(kmp_thread_data_t) );
2296 // copy old data to new data
Andrey Churbanov74bf17b2015-04-02 13:27:08 +00002297 KMP_MEMCPY_S( (void *) new_data, nthreads * sizeof(kmp_thread_data_t),
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00002298 (void *) old_data,
2299 maxthreads * sizeof(kmp_taskdata_t *) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00002300
2301#ifdef BUILD_TIED_TASK_STACK
2302 // GEH: Figure out if this is the right thing to do
2303 for (i = maxthreads; i < nthreads; i++) {
2304 kmp_thread_data_t *thread_data = & (*threads_data_p)[i];
2305 __kmp_init_task_stack( __kmp_gtid_from_thread( thread ), thread_data );
2306 }
2307#endif // BUILD_TIED_TASK_STACK
2308 // Install the new data and free the old data
2309 (*threads_data_p) = new_data;
2310 __kmp_free( old_data );
2311 }
2312 else {
2313 KE_TRACE( 10, ( "__kmp_realloc_task_threads_data: T#%d allocating "
2314 "threads data for task_team %p, size = %d\n",
2315 __kmp_gtid_from_thread( thread ), task_team, nthreads ) );
2316 // Make the initial allocate for threads_data array, and zero entries
2317 // Cannot use __kmp_thread_calloc() because threads not around for
2318 // kmp_reap_task_team( ).
2319 *threads_data_p = (kmp_thread_data_t *)
2320 __kmp_allocate( nthreads * sizeof(kmp_thread_data_t) );
2321#ifdef BUILD_TIED_TASK_STACK
2322 // GEH: Figure out if this is the right thing to do
2323 for (i = 0; i < nthreads; i++) {
2324 kmp_thread_data_t *thread_data = & (*threads_data_p)[i];
2325 __kmp_init_task_stack( __kmp_gtid_from_thread( thread ), thread_data );
2326 }
2327#endif // BUILD_TIED_TASK_STACK
2328 }
2329 task_team -> tt.tt_max_threads = nthreads;
2330 }
2331 else {
2332 // If array has (more than) enough elements, go ahead and use it
2333 KMP_DEBUG_ASSERT( *threads_data_p != NULL );
2334 }
2335
2336 // initialize threads_data pointers back to thread_info structures
2337 for (i = 0; i < nthreads; i++) {
2338 kmp_thread_data_t *thread_data = & (*threads_data_p)[i];
2339 thread_data -> td.td_thr = team -> t.t_threads[i];
2340
2341 if ( thread_data -> td.td_deque_last_stolen >= nthreads) {
2342 // The last stolen field survives across teams / barrier, and the number
2343 // of threads may have changed. It's possible (likely?) that a new
2344 // parallel region will exhibit the same behavior as the previous region.
2345 thread_data -> td.td_deque_last_stolen = -1;
2346 }
2347 }
2348
2349 KMP_MB();
2350 TCW_SYNC_4(task_team -> tt.tt_found_tasks, TRUE);
2351 }
2352
2353 __kmp_release_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2354 return is_init_thread;
2355}
2356
2357
2358//------------------------------------------------------------------------------
2359// __kmp_free_task_threads_data:
2360// Deallocates a threads_data array for a task team, including any attached
2361// tasking deques. Only occurs at library shutdown.
2362
2363static void
2364__kmp_free_task_threads_data( kmp_task_team_t *task_team )
2365{
2366 __kmp_acquire_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2367 if ( task_team -> tt.tt_threads_data != NULL ) {
2368 int i;
2369 for (i = 0; i < task_team->tt.tt_max_threads; i++ ) {
2370 __kmp_free_task_deque( & task_team -> tt.tt_threads_data[i] );
2371 }
2372 __kmp_free( task_team -> tt.tt_threads_data );
2373 task_team -> tt.tt_threads_data = NULL;
2374 }
2375 __kmp_release_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2376}
2377
2378
2379//------------------------------------------------------------------------------
2380// __kmp_allocate_task_team:
2381// Allocates a task team associated with a specific team, taking it from
2382// the global task team free list if possible. Also initializes data structures.
2383
2384static kmp_task_team_t *
2385__kmp_allocate_task_team( kmp_info_t *thread, kmp_team_t *team )
2386{
2387 kmp_task_team_t *task_team = NULL;
2388 int nthreads;
2389
2390 KA_TRACE( 20, ( "__kmp_allocate_task_team: T#%d entering; team = %p\n",
2391 (thread ? __kmp_gtid_from_thread( thread ) : -1), team ) );
2392
2393 if (TCR_PTR(__kmp_free_task_teams) != NULL) {
2394 // Take a task team from the task team pool
2395 __kmp_acquire_bootstrap_lock( &__kmp_task_team_lock );
2396 if (__kmp_free_task_teams != NULL) {
2397 task_team = __kmp_free_task_teams;
2398 TCW_PTR(__kmp_free_task_teams, task_team -> tt.tt_next);
2399 task_team -> tt.tt_next = NULL;
2400 }
2401 __kmp_release_bootstrap_lock( &__kmp_task_team_lock );
2402 }
2403
2404 if (task_team == NULL) {
2405 KE_TRACE( 10, ( "__kmp_allocate_task_team: T#%d allocating "
2406 "task team for team %p\n",
2407 __kmp_gtid_from_thread( thread ), team ) );
2408 // Allocate a new task team if one is not available.
2409 // Cannot use __kmp_thread_malloc() because threads not around for
2410 // kmp_reap_task_team( ).
2411 task_team = (kmp_task_team_t *) __kmp_allocate( sizeof(kmp_task_team_t) );
2412 __kmp_init_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2413 //task_team -> tt.tt_threads_data = NULL; // AC: __kmp_allocate zeroes returned memory
2414 //task_team -> tt.tt_max_threads = 0;
2415 //task_team -> tt.tt_next = NULL;
2416 }
2417
2418 TCW_4(task_team -> tt.tt_found_tasks, FALSE);
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002419#if OMP_41_ENABLED
2420 TCW_4(task_team -> tt.tt_found_proxy_tasks, FALSE);
2421#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00002422 task_team -> tt.tt_nproc = nthreads = team->t.t_nproc;
2423
Jim Cownie5e8470a2013-09-27 10:38:44 +00002424 TCW_4( task_team -> tt.tt_unfinished_threads, nthreads );
2425 TCW_4( task_team -> tt.tt_active, TRUE );
Jim Cownie5e8470a2013-09-27 10:38:44 +00002426
Jonathan Peyton54127982015-11-04 21:37:48 +00002427 KA_TRACE( 20, ( "__kmp_allocate_task_team: T#%d exiting; task_team = %p unfinished_threads init'd to %d\n",
2428 (thread ? __kmp_gtid_from_thread( thread ) : -1), task_team, task_team -> tt.tt_unfinished_threads) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00002429 return task_team;
2430}
2431
2432
2433//------------------------------------------------------------------------------
2434// __kmp_free_task_team:
2435// Frees the task team associated with a specific thread, and adds it
2436// to the global task team free list.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002437
Jonathan Peyton54127982015-11-04 21:37:48 +00002438void
Jim Cownie5e8470a2013-09-27 10:38:44 +00002439__kmp_free_task_team( kmp_info_t *thread, kmp_task_team_t *task_team )
2440{
2441 KA_TRACE( 20, ( "__kmp_free_task_team: T#%d task_team = %p\n",
2442 thread ? __kmp_gtid_from_thread( thread ) : -1, task_team ) );
2443
Jim Cownie5e8470a2013-09-27 10:38:44 +00002444 // Put task team back on free list
2445 __kmp_acquire_bootstrap_lock( & __kmp_task_team_lock );
2446
2447 KMP_DEBUG_ASSERT( task_team -> tt.tt_next == NULL );
2448 task_team -> tt.tt_next = __kmp_free_task_teams;
Jim Cownie5e8470a2013-09-27 10:38:44 +00002449 TCW_PTR(__kmp_free_task_teams, task_team);
2450
2451 __kmp_release_bootstrap_lock( & __kmp_task_team_lock );
2452}
2453
2454
2455//------------------------------------------------------------------------------
2456// __kmp_reap_task_teams:
2457// Free all the task teams on the task team free list.
2458// Should only be done during library shutdown.
2459// Cannot do anything that needs a thread structure or gtid since they are already gone.
2460
2461void
2462__kmp_reap_task_teams( void )
2463{
2464 kmp_task_team_t *task_team;
2465
2466 if ( TCR_PTR(__kmp_free_task_teams) != NULL ) {
2467 // Free all task_teams on the free list
2468 __kmp_acquire_bootstrap_lock( &__kmp_task_team_lock );
2469 while ( ( task_team = __kmp_free_task_teams ) != NULL ) {
2470 __kmp_free_task_teams = task_team -> tt.tt_next;
2471 task_team -> tt.tt_next = NULL;
2472
2473 // Free threads_data if necessary
2474 if ( task_team -> tt.tt_threads_data != NULL ) {
2475 __kmp_free_task_threads_data( task_team );
2476 }
2477 __kmp_free( task_team );
2478 }
2479 __kmp_release_bootstrap_lock( &__kmp_task_team_lock );
2480 }
2481}
2482
Jim Cownie5e8470a2013-09-27 10:38:44 +00002483//------------------------------------------------------------------------------
2484// __kmp_wait_to_unref_task_teams:
2485// Some threads could still be in the fork barrier release code, possibly
2486// trying to steal tasks. Wait for each thread to unreference its task team.
2487//
2488void
2489__kmp_wait_to_unref_task_teams(void)
2490{
2491 kmp_info_t *thread;
2492 kmp_uint32 spins;
2493 int done;
2494
2495 KMP_INIT_YIELD( spins );
2496
Jim Cownie5e8470a2013-09-27 10:38:44 +00002497 for (;;) {
2498 done = TRUE;
2499
2500 // TODO: GEH - this may be is wrong because some sync would be necessary
2501 // in case threads are added to the pool during the traversal.
2502 // Need to verify that lock for thread pool is held when calling
2503 // this routine.
2504 for (thread = (kmp_info_t *)__kmp_thread_pool;
2505 thread != NULL;
2506 thread = thread->th.th_next_pool)
2507 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00002508#if KMP_OS_WINDOWS
2509 DWORD exit_val;
2510#endif
2511 if ( TCR_PTR(thread->th.th_task_team) == NULL ) {
2512 KA_TRACE( 10, ("__kmp_wait_to_unref_task_team: T#%d task_team == NULL\n",
2513 __kmp_gtid_from_thread( thread ) ) );
2514 continue;
2515 }
2516#if KMP_OS_WINDOWS
2517 // TODO: GEH - add this check for Linux* OS / OS X* as well?
2518 if (!__kmp_is_thread_alive(thread, &exit_val)) {
Jonathan Peyton54127982015-11-04 21:37:48 +00002519 thread->th.th_task_team = NULL;
Jim Cownie5e8470a2013-09-27 10:38:44 +00002520 continue;
2521 }
2522#endif
2523
2524 done = FALSE; // Because th_task_team pointer is not NULL for this thread
2525
2526 KA_TRACE( 10, ("__kmp_wait_to_unref_task_team: Waiting for T#%d to unreference task_team\n",
2527 __kmp_gtid_from_thread( thread ) ) );
2528
2529 if ( __kmp_dflt_blocktime != KMP_MAX_BLOCKTIME ) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002530 volatile void *sleep_loc;
Jim Cownie5e8470a2013-09-27 10:38:44 +00002531 // If the thread is sleeping, awaken it.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002532 if ( ( sleep_loc = TCR_PTR( thread->th.th_sleep_loc) ) != NULL ) {
Jim Cownie5e8470a2013-09-27 10:38:44 +00002533 KA_TRACE( 10, ( "__kmp_wait_to_unref_task_team: T#%d waking up thread T#%d\n",
2534 __kmp_gtid_from_thread( thread ), __kmp_gtid_from_thread( thread ) ) );
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002535 __kmp_null_resume_wrapper(__kmp_gtid_from_thread(thread), sleep_loc);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002536 }
2537 }
2538 }
2539 if (done) {
2540 break;
2541 }
2542
2543 // If we are oversubscribed,
2544 // or have waited a bit (and library mode is throughput), yield.
2545 // Pause is in the following code.
2546 KMP_YIELD( TCR_4(__kmp_nth) > __kmp_avail_proc );
2547 KMP_YIELD_SPIN( spins ); // Yields only if KMP_LIBRARY=throughput
2548 }
Jim Cownie5e8470a2013-09-27 10:38:44 +00002549}
2550
2551
2552//------------------------------------------------------------------------------
2553// __kmp_task_team_setup: Create a task_team for the current team, but use
2554// an already created, unused one if it already exists.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002555void
Jonathan Peyton54127982015-11-04 21:37:48 +00002556__kmp_task_team_setup( kmp_info_t *this_thr, kmp_team_t *team, int always )
Jim Cownie5e8470a2013-09-27 10:38:44 +00002557{
2558 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
2559
Jonathan Peyton54127982015-11-04 21:37:48 +00002560 // If this task_team hasn't been created yet, allocate it. It will be used in the region after the next.
2561 // If it exists, it is the current task team and shouldn't be touched yet as it may still be in use.
2562 if (team->t.t_task_team[this_thr->th.th_task_state] == NULL && (always || team->t.t_nproc > 1) ) {
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002563 team->t.t_task_team[this_thr->th.th_task_state] = __kmp_allocate_task_team( this_thr, team );
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002564 KA_TRACE(20, ("__kmp_task_team_setup: Master T#%d created new task_team %p for team %d at parity=%d\n",
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002565 __kmp_gtid_from_thread(this_thr), team->t.t_task_team[this_thr->th.th_task_state],
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002566 ((team != NULL) ? team->t.t_id : -1), this_thr->th.th_task_state));
Jim Cownie5e8470a2013-09-27 10:38:44 +00002567 }
Jonathan Peyton54127982015-11-04 21:37:48 +00002568
2569 // After threads exit the release, they will call sync, and then point to this other task_team; make sure it is
2570 // allocated and properly initialized. As threads spin in the barrier release phase, they will continue to use the
2571 // previous task_team struct(above), until they receive the signal to stop checking for tasks (they can't safely
2572 // reference the kmp_team_t struct, which could be reallocated by the master thread). No task teams are formed for
2573 // serialized teams.
Jonathan Peytone1dad192015-11-30 20:05:13 +00002574 if (team->t.t_nproc > 1) {
2575 int other_team = 1 - this_thr->th.th_task_state;
2576 if (team->t.t_task_team[other_team] == NULL) { // setup other team as well
2577 team->t.t_task_team[other_team] = __kmp_allocate_task_team( this_thr, team );
2578 KA_TRACE(20, ("__kmp_task_team_setup: Master T#%d created second new task_team %p for team %d at parity=%d\n",
2579 __kmp_gtid_from_thread( this_thr ), team->t.t_task_team[other_team],
2580 ((team != NULL) ? team->t.t_id : -1), other_team ));
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002581 }
Jonathan Peytone1dad192015-11-30 20:05:13 +00002582 else { // Leave the old task team struct in place for the upcoming region; adjust as needed
2583 kmp_task_team_t *task_team = team->t.t_task_team[other_team];
2584 if (!task_team->tt.tt_active || team->t.t_nproc != task_team->tt.tt_nproc) {
2585 TCW_4(task_team->tt.tt_nproc, team->t.t_nproc);
2586 TCW_4(task_team->tt.tt_found_tasks, FALSE);
2587#if OMP_41_ENABLED
2588 TCW_4(task_team->tt.tt_found_proxy_tasks, FALSE);
2589#endif
2590 TCW_4(task_team->tt.tt_unfinished_threads, team->t.t_nproc );
2591 TCW_4(task_team->tt.tt_active, TRUE );
2592 }
2593 // if team size has changed, the first thread to enable tasking will realloc threads_data if necessary
2594 KA_TRACE(20, ("__kmp_task_team_setup: Master T#%d reset next task_team %p for team %d at parity=%d\n",
2595 __kmp_gtid_from_thread( this_thr ), team->t.t_task_team[other_team],
2596 ((team != NULL) ? team->t.t_id : -1), other_team ));
2597 }
Jim Cownie5e8470a2013-09-27 10:38:44 +00002598 }
2599}
2600
2601
2602//------------------------------------------------------------------------------
2603// __kmp_task_team_sync: Propagation of task team data from team to threads
2604// which happens just after the release phase of a team barrier. This may be
2605// called by any thread, but only for teams with # threads > 1.
2606
2607void
2608__kmp_task_team_sync( kmp_info_t *this_thr, kmp_team_t *team )
2609{
2610 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
2611
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002612 // Toggle the th_task_state field, to switch which task_team this thread refers to
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002613 this_thr->th.th_task_state = 1 - this_thr->th.th_task_state;
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002614 // It is now safe to propagate the task team pointer from the team struct to the current thread.
2615 TCW_PTR(this_thr->th.th_task_team, team->t.t_task_team[this_thr->th.th_task_state]);
Jonathan Peyton54127982015-11-04 21:37:48 +00002616 KA_TRACE(20, ("__kmp_task_team_sync: Thread T#%d task team switched to task_team %p from Team #%d (parity=%d)\n",
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002617 __kmp_gtid_from_thread( this_thr ), this_thr->th.th_task_team,
2618 ((team != NULL) ? team->t.t_id : -1), this_thr->th.th_task_state));
Jim Cownie5e8470a2013-09-27 10:38:44 +00002619}
2620
2621
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00002622//--------------------------------------------------------------------------------------------
2623// __kmp_task_team_wait: Master thread waits for outstanding tasks after the barrier gather
Jonathan Peyton54127982015-11-04 21:37:48 +00002624// phase. Only called by master thread if #threads in team > 1 or if proxy tasks were created.
2625// wait is a flag that defaults to 1 (see kmp.h), but waiting can be turned off by passing in 0
2626// optionally as the last argument. When wait is zero, master thread does not wait for
2627// unfinished_threads to reach 0.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002628void
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002629__kmp_task_team_wait( kmp_info_t *this_thr, kmp_team_t *team
Jim Cownie181b4bb2013-12-23 17:28:57 +00002630 USE_ITT_BUILD_ARG(void * itt_sync_obj)
Jonathan Peyton54127982015-11-04 21:37:48 +00002631 , int wait)
Jim Cownie5e8470a2013-09-27 10:38:44 +00002632{
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002633 kmp_task_team_t *task_team = team->t.t_task_team[this_thr->th.th_task_state];
Jim Cownie5e8470a2013-09-27 10:38:44 +00002634
2635 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
2636 KMP_DEBUG_ASSERT( task_team == this_thr->th.th_task_team );
2637
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002638 if ( ( task_team != NULL ) && KMP_TASKING_ENABLED(task_team) ) {
Jonathan Peyton54127982015-11-04 21:37:48 +00002639 if (wait) {
2640 KA_TRACE(20, ("__kmp_task_team_wait: Master T#%d waiting for all tasks (for unfinished_threads to reach 0) on task_team = %p\n",
2641 __kmp_gtid_from_thread(this_thr), task_team));
2642 // Worker threads may have dropped through to release phase, but could still be executing tasks. Wait
2643 // here for tasks to complete. To avoid memory contention, only master thread checks termination condition.
2644 kmp_flag_32 flag(&task_team->tt.tt_unfinished_threads, 0U);
2645 flag.wait(this_thr, TRUE
2646 USE_ITT_BUILD_ARG(itt_sync_obj));
2647 }
2648 // Deactivate the old task team, so that the worker threads will stop referencing it while spinning.
2649 KA_TRACE(20, ("__kmp_task_team_wait: Master T#%d deactivating task_team %p: "
2650 "setting active to false, setting local and team's pointer to NULL\n",
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002651 __kmp_gtid_from_thread(this_thr), task_team));
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002652#if OMP_41_ENABLED
2653 KMP_DEBUG_ASSERT( task_team->tt.tt_nproc > 1 || task_team->tt.tt_found_proxy_tasks == TRUE );
2654 TCW_SYNC_4( task_team->tt.tt_found_proxy_tasks, FALSE );
2655#else
Jim Cownie5e8470a2013-09-27 10:38:44 +00002656 KMP_DEBUG_ASSERT( task_team->tt.tt_nproc > 1 );
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002657#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00002658 TCW_SYNC_4( task_team->tt.tt_active, FALSE );
2659 KMP_MB();
2660
2661 TCW_PTR(this_thr->th.th_task_team, NULL);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002662 }
2663}
2664
2665
2666//------------------------------------------------------------------------------
2667// __kmp_tasking_barrier:
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00002668// This routine may only called when __kmp_tasking_mode == tskm_extra_barrier.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002669// Internal function to execute all tasks prior to a regular barrier or a
2670// join barrier. It is a full barrier itself, which unfortunately turns
2671// regular barriers into double barriers and join barriers into 1 1/2
2672// barriers.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002673void
2674__kmp_tasking_barrier( kmp_team_t *team, kmp_info_t *thread, int gtid )
2675{
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002676 volatile kmp_uint32 *spin = &team->t.t_task_team[thread->th.th_task_state]->tt.tt_unfinished_threads;
Jim Cownie5e8470a2013-09-27 10:38:44 +00002677 int flag = FALSE;
2678 KMP_DEBUG_ASSERT( __kmp_tasking_mode == tskm_extra_barrier );
2679
2680#if USE_ITT_BUILD
2681 KMP_FSYNC_SPIN_INIT( spin, (kmp_uint32*) NULL );
2682#endif /* USE_ITT_BUILD */
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002683 kmp_flag_32 spin_flag(spin, 0U);
2684 while (! spin_flag.execute_tasks(thread, gtid, TRUE, &flag
2685 USE_ITT_BUILD_ARG(NULL), 0 ) ) {
Jim Cownie5e8470a2013-09-27 10:38:44 +00002686#if USE_ITT_BUILD
2687 // TODO: What about itt_sync_obj??
2688 KMP_FSYNC_SPIN_PREPARE( spin );
2689#endif /* USE_ITT_BUILD */
2690
2691 if( TCR_4(__kmp_global.g.g_done) ) {
2692 if( __kmp_global.g.g_abort )
2693 __kmp_abort_thread( );
2694 break;
2695 }
2696 KMP_YIELD( TRUE ); // GH: We always yield here
2697 }
2698#if USE_ITT_BUILD
2699 KMP_FSYNC_SPIN_ACQUIRED( (void*) spin );
2700#endif /* USE_ITT_BUILD */
2701}
2702
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002703
2704#if OMP_41_ENABLED
2705
2706/* __kmp_give_task puts a task into a given thread queue if:
Jonathan Peytonff684e42016-02-11 22:58:29 +00002707 - the queue for that thread was created
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002708 - there's space in that queue
2709
2710 Because of this, __kmp_push_task needs to check if there's space after getting the lock
2711 */
2712static bool __kmp_give_task ( kmp_info_t *thread, kmp_int32 tid, kmp_task_t * task )
2713{
2714 kmp_task_team_t * task_team = thread->th.th_task_team;
2715 kmp_thread_data_t * thread_data = & task_team -> tt.tt_threads_data[ tid ];
2716 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
2717 bool result = false;
2718
2719 KA_TRACE(20, ("__kmp_give_task: trying to give task %p to thread %d.\n", taskdata, tid ) );
2720
2721 // assert tasking is enabled? what if not?
2722 KMP_DEBUG_ASSERT( task_team != NULL );
2723
2724 if (thread_data -> td.td_deque == NULL ) {
2725 // There's no queue in this thread, go find another one
2726 // We're guaranteed that at least one thread has a queue
2727 KA_TRACE(30, ("__kmp_give_task: thread %d has no queue while giving task %p.\n", tid, taskdata ) );
2728 return result;
2729 }
2730
2731 if ( TCR_4(thread_data -> td.td_deque_ntasks) >= TASK_DEQUE_SIZE )
2732 {
2733 KA_TRACE(30, ("__kmp_give_task: queue is full while giving task %p to thread %d.\n", taskdata, tid ) );
2734 return result;
2735 }
2736
2737 __kmp_acquire_bootstrap_lock( & thread_data-> td.td_deque_lock );
2738
2739 if ( TCR_4(thread_data -> td.td_deque_ntasks) >= TASK_DEQUE_SIZE )
2740 {
2741 KA_TRACE(30, ("__kmp_give_task: queue is full while giving task %p to thread %d.\n", taskdata, tid ) );
2742 goto release_and_exit;
2743 }
2744
2745 thread_data -> td.td_deque[ thread_data -> td.td_deque_tail ] = taskdata;
2746 // Wrap index.
2747 thread_data -> td.td_deque_tail = ( thread_data -> td.td_deque_tail + 1 ) & TASK_DEQUE_MASK;
2748 TCW_4(thread_data -> td.td_deque_ntasks, TCR_4(thread_data -> td.td_deque_ntasks) + 1);
2749
2750 result = true;
Jonathan Peyton1406f012015-05-22 22:35:51 +00002751 KA_TRACE(30, ("__kmp_give_task: successfully gave task %p to thread %d.\n", taskdata, tid ) );
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002752
2753release_and_exit:
2754 __kmp_release_bootstrap_lock( & thread_data-> td.td_deque_lock );
2755
2756 return result;
2757}
2758
2759
2760/* The finish of the a proxy tasks is divided in two pieces:
2761 - the top half is the one that can be done from a thread outside the team
2762 - the bottom half must be run from a them within the team
2763
2764 In order to run the bottom half the task gets queued back into one of the threads of the team.
2765 Once the td_incomplete_child_task counter of the parent is decremented the threads can leave the barriers.
2766 So, the bottom half needs to be queued before the counter is decremented. The top half is therefore divided in two parts:
2767 - things that can be run before queuing the bottom half
2768 - things that must be run after queuing the bottom half
2769
2770 This creates a second race as the bottom half can free the task before the second top half is executed. To avoid this
2771 we use the td_incomplete_child_task of the proxy task to synchronize the top and bottom half.
2772*/
2773
2774static void __kmp_first_top_half_finish_proxy( kmp_taskdata_t * taskdata )
2775{
2776 KMP_DEBUG_ASSERT( taskdata -> td_flags.tasktype == TASK_EXPLICIT );
2777 KMP_DEBUG_ASSERT( taskdata -> td_flags.proxy == TASK_PROXY );
2778 KMP_DEBUG_ASSERT( taskdata -> td_flags.complete == 0 );
2779 KMP_DEBUG_ASSERT( taskdata -> td_flags.freed == 0 );
2780
2781 taskdata -> td_flags.complete = 1; // mark the task as completed
2782
2783 if ( taskdata->td_taskgroup )
2784 KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata->td_taskgroup->count) );
2785
2786 // Create an imaginary children for this task so the bottom half cannot release the task before we have completed the second top half
2787 TCR_4(taskdata->td_incomplete_child_tasks++);
2788}
2789
2790static void __kmp_second_top_half_finish_proxy( kmp_taskdata_t * taskdata )
2791{
2792 kmp_int32 children = 0;
2793
2794 // Predecrement simulated by "- 1" calculation
2795 children = KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata -> td_parent -> td_incomplete_child_tasks) ) - 1;
2796 KMP_DEBUG_ASSERT( children >= 0 );
2797
2798 // Remove the imaginary children
2799 TCR_4(taskdata->td_incomplete_child_tasks--);
2800}
2801
2802static void __kmp_bottom_half_finish_proxy( kmp_int32 gtid, kmp_task_t * ptask )
2803{
2804 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(ptask);
2805 kmp_info_t * thread = __kmp_threads[ gtid ];
2806
2807 KMP_DEBUG_ASSERT( taskdata -> td_flags.proxy == TASK_PROXY );
2808 KMP_DEBUG_ASSERT( taskdata -> td_flags.complete == 1 ); // top half must run before bottom half
2809
2810 // We need to wait to make sure the top half is finished
2811 // Spinning here should be ok as this should happen quickly
2812 while ( TCR_4(taskdata->td_incomplete_child_tasks) > 0 ) ;
2813
2814 __kmp_release_deps(gtid,taskdata);
2815 __kmp_free_task_and_ancestors(gtid, taskdata, thread);
2816}
2817
2818/*!
2819@ingroup TASKING
2820@param gtid Global Thread ID of encountering thread
2821@param ptask Task which execution is completed
2822
2823Execute the completation of a proxy task from a thread of that is part of the team. Run first and bottom halves directly.
2824*/
2825void __kmpc_proxy_task_completed( kmp_int32 gtid, kmp_task_t *ptask )
2826{
2827 KMP_DEBUG_ASSERT( ptask != NULL );
2828 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(ptask);
2829 KA_TRACE(10, ("__kmp_proxy_task_completed(enter): T#%d proxy task %p completing\n", gtid, taskdata ) );
2830
2831 KMP_DEBUG_ASSERT( taskdata->td_flags.proxy == TASK_PROXY );
2832
2833 __kmp_first_top_half_finish_proxy(taskdata);
2834 __kmp_second_top_half_finish_proxy(taskdata);
2835 __kmp_bottom_half_finish_proxy(gtid,ptask);
2836
2837 KA_TRACE(10, ("__kmp_proxy_task_completed(exit): T#%d proxy task %p completing\n", gtid, taskdata ) );
2838}
2839
2840/*!
2841@ingroup TASKING
2842@param ptask Task which execution is completed
2843
2844Execute the completation of a proxy task from a thread that could not belong to the team.
2845*/
2846void __kmpc_proxy_task_completed_ooo ( kmp_task_t *ptask )
2847{
2848 KMP_DEBUG_ASSERT( ptask != NULL );
2849 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(ptask);
2850
2851 KA_TRACE(10, ("__kmp_proxy_task_completed_ooo(enter): proxy task completing ooo %p\n", taskdata ) );
2852
2853 KMP_DEBUG_ASSERT( taskdata->td_flags.proxy == TASK_PROXY );
2854
2855 __kmp_first_top_half_finish_proxy(taskdata);
2856
Jonathan Peytonff684e42016-02-11 22:58:29 +00002857 // Enqueue task to complete bottom half completion from a thread within the corresponding team
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002858 kmp_team_t * team = taskdata->td_team;
2859 kmp_int32 nthreads = team->t.t_nproc;
2860 kmp_info_t *thread;
2861 kmp_int32 k = 0;
2862
2863 do {
Jonathan Peyton1406f012015-05-22 22:35:51 +00002864 //This should be similar to k = __kmp_get_random( thread ) % nthreads but we cannot use __kmp_get_random here
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002865 //For now we're just linearly trying to find a thread
2866 k = (k+1) % nthreads;
2867 thread = team->t.t_threads[k];
2868 } while ( !__kmp_give_task( thread, k, ptask ) );
2869
2870 __kmp_second_top_half_finish_proxy(taskdata);
2871
2872 KA_TRACE(10, ("__kmp_proxy_task_completed_ooo(exit): proxy task completing ooo %p\n", taskdata ) );
2873}
2874
2875#endif