blob: 3a363c133989ae0fbcd6b80099cc90c2a0f9248a [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
31/* forward declaration */
32static void __kmp_enable_tasking( kmp_task_team_t *task_team, kmp_info_t *this_thr );
33static void __kmp_alloc_task_deque( kmp_info_t *thread, kmp_thread_data_t *thread_data );
34static int __kmp_realloc_task_threads_data( kmp_info_t *thread, kmp_task_team_t *task_team );
35
Andrey Churbanov535b6fa2015-05-07 17:41:51 +000036#ifdef OMP_41_ENABLED
37static void __kmp_bottom_half_finish_proxy( kmp_int32 gtid, kmp_task_t * ptask );
38#endif
39
Jim Cownie4cc4bb42014-10-07 16:25:50 +000040static inline void __kmp_null_resume_wrapper(int gtid, volatile void *flag) {
Jonathan Peytona0e159f2015-10-08 18:23:38 +000041 if (!flag) return;
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
465
Jim Cownie5e8470a2013-09-27 10:38:44 +0000466 return;
467}
468
469
470//----------------------------------------------------------------------
471// __kmpc_omp_task_begin_if0: report that a given serialized task has started execution
472// loc_ref: source location information; points to beginning of task block.
473// gtid: global thread number.
474// task: task thunk for the started task.
475
476void
477__kmpc_omp_task_begin_if0( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t * task )
478{
479 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
480 kmp_taskdata_t * current_task = __kmp_threads[ gtid ] -> th.th_current_task;
481
482 KA_TRACE(10, ("__kmpc_omp_task_begin_if0(enter): T#%d loc=%p task=%p current_task=%p\n",
483 gtid, loc_ref, taskdata, current_task ) );
484
485 taskdata -> td_flags.task_serial = 1; // Execute this task immediately, not deferred.
486 __kmp_task_start( gtid, task, current_task );
487
488 KA_TRACE(10, ("__kmpc_omp_task_begin_if0(exit): T#%d loc=%p task=%p,\n",
489 gtid, loc_ref, taskdata ) );
490
491 return;
492}
493
494#ifdef TASK_UNUSED
495//----------------------------------------------------------------------
496// __kmpc_omp_task_begin: report that a given task has started execution
497// NEVER GENERATED BY COMPILER, DEPRECATED!!!
498
499void
500__kmpc_omp_task_begin( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t * task )
501{
502 kmp_taskdata_t * current_task = __kmp_threads[ gtid ] -> th.th_current_task;
503
504 KA_TRACE(10, ("__kmpc_omp_task_begin(enter): T#%d loc=%p task=%p current_task=%p\n",
505 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task), current_task ) );
506
507 __kmp_task_start( gtid, task, current_task );
508
509 KA_TRACE(10, ("__kmpc_omp_task_begin(exit): T#%d loc=%p task=%p,\n",
510 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
511
512 return;
513}
514#endif // TASK_UNUSED
515
516
517//-------------------------------------------------------------------------------------
518// __kmp_free_task: free the current task space and the space for shareds
519// gtid: Global thread ID of calling thread
520// taskdata: task to free
521// thread: thread data structure of caller
522
523static void
524__kmp_free_task( kmp_int32 gtid, kmp_taskdata_t * taskdata, kmp_info_t * thread )
525{
526 KA_TRACE(30, ("__kmp_free_task: T#%d freeing data from task %p\n",
527 gtid, taskdata) );
528
529 // Check to make sure all flags and counters have the correct values
530 KMP_DEBUG_ASSERT( taskdata->td_flags.tasktype == TASK_EXPLICIT );
531 KMP_DEBUG_ASSERT( taskdata->td_flags.executing == 0 );
532 KMP_DEBUG_ASSERT( taskdata->td_flags.complete == 1 );
533 KMP_DEBUG_ASSERT( taskdata->td_flags.freed == 0 );
534 KMP_DEBUG_ASSERT( TCR_4(taskdata->td_allocated_child_tasks) == 0 || taskdata->td_flags.task_serial == 1);
535 KMP_DEBUG_ASSERT( TCR_4(taskdata->td_incomplete_child_tasks) == 0 );
536
537 taskdata->td_flags.freed = 1;
538 // deallocate the taskdata and shared variable blocks associated with this task
539 #if USE_FAST_MEMORY
540 __kmp_fast_free( thread, taskdata );
541 #else /* ! USE_FAST_MEMORY */
542 __kmp_thread_free( thread, taskdata );
543 #endif
544
545 KA_TRACE(20, ("__kmp_free_task: T#%d freed task %p\n",
546 gtid, taskdata) );
547}
548
549//-------------------------------------------------------------------------------------
550// __kmp_free_task_and_ancestors: free the current task and ancestors without children
551//
552// gtid: Global thread ID of calling thread
553// taskdata: task to free
554// thread: thread data structure of caller
555
556static void
557__kmp_free_task_and_ancestors( kmp_int32 gtid, kmp_taskdata_t * taskdata, kmp_info_t * thread )
558{
559 kmp_int32 children = 0;
560 kmp_int32 team_or_tasking_serialized = taskdata -> td_flags.team_serial || taskdata -> td_flags.tasking_ser;
561
562 KMP_DEBUG_ASSERT( taskdata -> td_flags.tasktype == TASK_EXPLICIT );
563
564 if ( !team_or_tasking_serialized ) {
565 children = KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata -> td_allocated_child_tasks) ) - 1;
566 KMP_DEBUG_ASSERT( children >= 0 );
567 }
568
569 // Now, go up the ancestor tree to see if any ancestors can now be freed.
570 while ( children == 0 )
571 {
572 kmp_taskdata_t * parent_taskdata = taskdata -> td_parent;
573
574 KA_TRACE(20, ("__kmp_free_task_and_ancestors(enter): T#%d task %p complete "
575 "and freeing itself\n", gtid, taskdata) );
576
577 // --- Deallocate my ancestor task ---
578 __kmp_free_task( gtid, taskdata, thread );
579
580 taskdata = parent_taskdata;
581
582 // Stop checking ancestors at implicit task or if tasking serialized
583 // instead of walking up ancestor tree to avoid premature deallocation of ancestors.
584 if ( team_or_tasking_serialized || taskdata -> td_flags.tasktype == TASK_IMPLICIT )
585 return;
586
587 if ( !team_or_tasking_serialized ) {
588 // Predecrement simulated by "- 1" calculation
589 children = KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata -> td_allocated_child_tasks) ) - 1;
590 KMP_DEBUG_ASSERT( children >= 0 );
591 }
592 }
593
594 KA_TRACE(20, ("__kmp_free_task_and_ancestors(exit): T#%d task %p has %d children; "
595 "not freeing it yet\n", gtid, taskdata, children) );
596}
597
598//---------------------------------------------------------------------
599// __kmp_task_finish: bookkeeping to do when a task finishes execution
600// gtid: global thread ID for calling thread
601// task: task to be finished
602// resumed_task: task to be resumed. (may be NULL if task is serialized)
603
604static void
605__kmp_task_finish( kmp_int32 gtid, kmp_task_t *task, kmp_taskdata_t *resumed_task )
606{
607 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
608 kmp_info_t * thread = __kmp_threads[ gtid ];
609 kmp_int32 children = 0;
610
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000611#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +0000612 if (ompt_enabled &&
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000613 ompt_callbacks.ompt_callback(ompt_event_task_end)) {
614 kmp_taskdata_t *parent = taskdata->td_parent;
615 ompt_callbacks.ompt_callback(ompt_event_task_end)(
616 taskdata->ompt_task_info.task_id);
617 }
618#endif
619
Jim Cownie5e8470a2013-09-27 10:38:44 +0000620 KA_TRACE(10, ("__kmp_task_finish(enter): T#%d finishing task %p and resuming task %p\n",
621 gtid, taskdata, resumed_task) );
622
623 KMP_DEBUG_ASSERT( taskdata -> td_flags.tasktype == TASK_EXPLICIT );
624
625 // Pop task from stack if tied
626#ifdef BUILD_TIED_TASK_STACK
627 if ( taskdata -> td_flags.tiedness == TASK_TIED )
628 {
629 __kmp_pop_task_stack( gtid, thread, taskdata );
630 }
631#endif /* BUILD_TIED_TASK_STACK */
632
Jim Cownie5e8470a2013-09-27 10:38:44 +0000633 KMP_DEBUG_ASSERT( taskdata -> td_flags.complete == 0 );
Jim Cownie5e8470a2013-09-27 10:38:44 +0000634 taskdata -> td_flags.complete = 1; // mark the task as completed
635 KMP_DEBUG_ASSERT( taskdata -> td_flags.started == 1 );
636 KMP_DEBUG_ASSERT( taskdata -> td_flags.freed == 0 );
637
638 // Only need to keep track of count if team parallel and tasking not serialized
639 if ( !( taskdata -> td_flags.team_serial || taskdata -> td_flags.tasking_ser ) ) {
640 // Predecrement simulated by "- 1" calculation
641 children = KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata -> td_parent -> td_incomplete_child_tasks) ) - 1;
642 KMP_DEBUG_ASSERT( children >= 0 );
643#if OMP_40_ENABLED
644 if ( taskdata->td_taskgroup )
645 KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata->td_taskgroup->count) );
Jim Cownie181b4bb2013-12-23 17:28:57 +0000646 __kmp_release_deps(gtid,taskdata);
Jim Cownie5e8470a2013-09-27 10:38:44 +0000647#endif
648 }
649
Jim Cownie4cc4bb42014-10-07 16:25:50 +0000650 // td_flags.executing must be marked as 0 after __kmp_release_deps has been called
651 // Othertwise, if a task is executed immediately from the release_deps code
652 // the flag will be reset to 1 again by this same function
653 KMP_DEBUG_ASSERT( taskdata -> td_flags.executing == 1 );
654 taskdata -> td_flags.executing = 0; // suspend the finishing task
655
Jim Cownie5e8470a2013-09-27 10:38:44 +0000656 KA_TRACE(20, ("__kmp_task_finish: T#%d finished task %p, %d incomplete children\n",
657 gtid, taskdata, children) );
658
Jim Cownie181b4bb2013-12-23 17:28:57 +0000659#if OMP_40_ENABLED
660 /* If the tasks' destructor thunk flag has been set, we need to invoke the
661 destructor thunk that has been generated by the compiler.
662 The code is placed here, since at this point other tasks might have been released
663 hence overlapping the destructor invokations with some other work in the
664 released tasks. The OpenMP spec is not specific on when the destructors are
665 invoked, so we should be free to choose.
666 */
667 if (taskdata->td_flags.destructors_thunk) {
668 kmp_routine_entry_t destr_thunk = task->destructors;
669 KMP_ASSERT(destr_thunk);
670 destr_thunk(gtid, task);
671 }
672#endif // OMP_40_ENABLED
673
Jim Cownie5e8470a2013-09-27 10:38:44 +0000674 // bookkeeping for resuming task:
675 // GEH - note tasking_ser => task_serial
676 KMP_DEBUG_ASSERT( (taskdata->td_flags.tasking_ser || taskdata->td_flags.task_serial) ==
677 taskdata->td_flags.task_serial);
678 if ( taskdata->td_flags.task_serial )
679 {
680 if (resumed_task == NULL) {
681 resumed_task = taskdata->td_parent; // In a serialized task, the resumed task is the parent
682 }
683 else {
684 // verify resumed task passed in points to parent
685 KMP_DEBUG_ASSERT( resumed_task == taskdata->td_parent );
686 }
687 }
688 else {
689 KMP_DEBUG_ASSERT( resumed_task != NULL ); // verify that resumed task is passed as arguemnt
690 }
691
692 // Free this task and then ancestor tasks if they have no children.
693 __kmp_free_task_and_ancestors(gtid, taskdata, thread);
694
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000695 // FIXME johnmc: I this statement should be before the last one so if an
696 // asynchronous inquiry peers into the runtime system it doesn't see the freed
697 // task as the current task
Jim Cownie5e8470a2013-09-27 10:38:44 +0000698 __kmp_threads[ gtid ] -> th.th_current_task = resumed_task; // restore current_task
699
700 // TODO: GEH - make sure root team implicit task is initialized properly.
701 // KMP_DEBUG_ASSERT( resumed_task->td_flags.executing == 0 );
702 resumed_task->td_flags.executing = 1; // resume previous task
703
704 KA_TRACE(10, ("__kmp_task_finish(exit): T#%d finished task %p, resuming task %p\n",
705 gtid, taskdata, resumed_task) );
706
707 return;
708}
709
710//---------------------------------------------------------------------
711// __kmpc_omp_task_complete_if0: report that a task has completed execution
712// loc_ref: source location information; points to end of task block.
713// gtid: global thread number.
714// task: task thunk for the completed task.
715
716void
717__kmpc_omp_task_complete_if0( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t *task )
718{
719 KA_TRACE(10, ("__kmpc_omp_task_complete_if0(enter): T#%d loc=%p task=%p\n",
720 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
721
722 __kmp_task_finish( gtid, task, NULL ); // this routine will provide task to resume
723
724 KA_TRACE(10, ("__kmpc_omp_task_complete_if0(exit): T#%d loc=%p task=%p\n",
725 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
726
727 return;
728}
729
730#ifdef TASK_UNUSED
731//---------------------------------------------------------------------
732// __kmpc_omp_task_complete: report that a task has completed execution
733// NEVER GENERATED BY COMPILER, DEPRECATED!!!
734
735void
736__kmpc_omp_task_complete( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t *task )
737{
738 KA_TRACE(10, ("__kmpc_omp_task_complete(enter): T#%d loc=%p task=%p\n",
739 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
740
741 __kmp_task_finish( gtid, task, NULL ); // Not sure how to find task to resume
742
743 KA_TRACE(10, ("__kmpc_omp_task_complete(exit): T#%d loc=%p task=%p\n",
744 gtid, loc_ref, KMP_TASK_TO_TASKDATA(task) ) );
745 return;
746}
747#endif // TASK_UNUSED
748
749
Andrey Churbanove5f44922015-04-29 16:22:07 +0000750#if OMPT_SUPPORT
751//----------------------------------------------------------------------------------------------------
752// __kmp_task_init_ompt:
753// Initialize OMPT fields maintained by a task. Since the serial task is initialized before
754// ompt_initialize is called, at the point the serial task is initialized we don't know whether
755// OMPT will be used or not when the serial task is initialized. This function provides the support
756// needed to initialize OMPT for the serial task after the fact.
757
758void
759__kmp_task_init_ompt( kmp_taskdata_t * task, int tid )
760{
761 task->ompt_task_info.task_id = __ompt_task_id_new(tid);
762 task->ompt_task_info.function = NULL;
Jonathan Peytonda7c8ab2015-06-29 17:33:03 +0000763 task->ompt_task_info.frame.exit_runtime_frame = NULL;
764 task->ompt_task_info.frame.reenter_runtime_frame = NULL;
Andrey Churbanove5f44922015-04-29 16:22:07 +0000765}
766#endif
767
768
Jim Cownie5e8470a2013-09-27 10:38:44 +0000769//----------------------------------------------------------------------------------------------------
770// __kmp_init_implicit_task: Initialize the appropriate fields in the implicit task for a given thread
771//
772// loc_ref: reference to source location of parallel region
773// this_thr: thread data structure corresponding to implicit task
774// team: team for this_thr
775// tid: thread id of given thread within team
776// set_curr_task: TRUE if need to push current task to thread
777// NOTE: Routine does not set up the implicit task ICVS. This is assumed to have already been done elsewhere.
778// TODO: Get better loc_ref. Value passed in may be NULL
779
780void
781__kmp_init_implicit_task( ident_t *loc_ref, kmp_info_t *this_thr, kmp_team_t *team, int tid, int set_curr_task )
782{
783 kmp_taskdata_t * task = & team->t.t_implicit_task_taskdata[ tid ];
784
785 KF_TRACE(10, ("__kmp_init_implicit_task(enter): T#:%d team=%p task=%p, reinit=%s\n",
786 tid, team, task, set_curr_task ? "TRUE" : "FALSE" ) );
787
788 task->td_task_id = KMP_GEN_TASK_ID();
789 task->td_team = team;
790// task->td_parent = NULL; // fix for CQ230101 (broken parent task info in debugger)
791 task->td_ident = loc_ref;
792 task->td_taskwait_ident = NULL;
793 task->td_taskwait_counter = 0;
794 task->td_taskwait_thread = 0;
795
796 task->td_flags.tiedness = TASK_TIED;
797 task->td_flags.tasktype = TASK_IMPLICIT;
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000798#if OMP_41_ENABLED
799 task->td_flags.proxy = TASK_FULL;
800#endif
801
Jim Cownie5e8470a2013-09-27 10:38:44 +0000802 // All implicit tasks are executed immediately, not deferred
803 task->td_flags.task_serial = 1;
804 task->td_flags.tasking_ser = ( __kmp_tasking_mode == tskm_immediate_exec );
805 task->td_flags.team_serial = ( team->t.t_serialized ) ? 1 : 0;
806
807 task->td_flags.started = 1;
808 task->td_flags.executing = 1;
809 task->td_flags.complete = 0;
810 task->td_flags.freed = 0;
811
Jim Cownie181b4bb2013-12-23 17:28:57 +0000812#if OMP_40_ENABLED
Jim Cownie5e8470a2013-09-27 10:38:44 +0000813 task->td_dephash = NULL;
814 task->td_depnode = NULL;
Jim Cownie181b4bb2013-12-23 17:28:57 +0000815#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +0000816
817 if (set_curr_task) { // only do this initialization the first time a thread is created
818 task->td_incomplete_child_tasks = 0;
819 task->td_allocated_child_tasks = 0; // Not used because do not need to deallocate implicit task
820#if OMP_40_ENABLED
821 task->td_taskgroup = NULL; // An implicit task does not have taskgroup
822#endif
823 __kmp_push_current_task_to_thread( this_thr, team, tid );
824 } else {
825 KMP_DEBUG_ASSERT(task->td_incomplete_child_tasks == 0);
826 KMP_DEBUG_ASSERT(task->td_allocated_child_tasks == 0);
827 }
828
Andrey Churbanovd7d088f2015-04-29 16:42:24 +0000829#if OMPT_SUPPORT
830 __kmp_task_init_ompt(task, tid);
831#endif
832
Jim Cownie5e8470a2013-09-27 10:38:44 +0000833 KF_TRACE(10, ("__kmp_init_implicit_task(exit): T#:%d team=%p task=%p\n",
834 tid, team, task ) );
835}
836
837// Round up a size to a power of two specified by val
838// Used to insert padding between structures co-allocated using a single malloc() call
839static size_t
840__kmp_round_up_to_val( size_t size, size_t val ) {
841 if ( size & ( val - 1 ) ) {
842 size &= ~ ( val - 1 );
843 if ( size <= KMP_SIZE_T_MAX - val ) {
844 size += val; // Round up if there is no overflow.
845 }; // if
846 }; // if
847 return size;
848} // __kmp_round_up_to_va
849
850
851//---------------------------------------------------------------------------------
852// __kmp_task_alloc: Allocate the taskdata and task data structures for a task
853//
854// loc_ref: source location information
855// gtid: global thread number.
856// flags: include tiedness & task type (explicit vs. implicit) of the ''new'' task encountered.
857// Converted from kmp_int32 to kmp_tasking_flags_t in routine.
858// sizeof_kmp_task_t: Size in bytes of kmp_task_t data structure including private vars accessed in task.
859// sizeof_shareds: Size in bytes of array of pointers to shared vars accessed in task.
860// task_entry: Pointer to task code entry point generated by compiler.
861// returns: a pointer to the allocated kmp_task_t structure (task).
862
863kmp_task_t *
864__kmp_task_alloc( ident_t *loc_ref, kmp_int32 gtid, kmp_tasking_flags_t *flags,
865 size_t sizeof_kmp_task_t, size_t sizeof_shareds,
866 kmp_routine_entry_t task_entry )
867{
868 kmp_task_t *task;
869 kmp_taskdata_t *taskdata;
870 kmp_info_t *thread = __kmp_threads[ gtid ];
871 kmp_team_t *team = thread->th.th_team;
872 kmp_taskdata_t *parent_task = thread->th.th_current_task;
873 size_t shareds_offset;
874
875 KA_TRACE(10, ("__kmp_task_alloc(enter): T#%d loc=%p, flags=(0x%x) "
876 "sizeof_task=%ld sizeof_shared=%ld entry=%p\n",
877 gtid, loc_ref, *((kmp_int32 *)flags), sizeof_kmp_task_t,
878 sizeof_shareds, task_entry) );
879
880 if ( parent_task->td_flags.final ) {
881 if (flags->merged_if0) {
882 }
883 flags->final = 1;
884 }
885
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000886#if OMP_41_ENABLED
887 if ( flags->proxy == TASK_PROXY ) {
888 flags->tiedness = TASK_UNTIED;
889 flags->merged_if0 = 1;
890
891 /* are we running in a sequential parallel or tskm_immediate_exec... we need tasking support enabled */
892 if ( (thread->th.th_task_team) == NULL ) {
893 /* This should only happen if the team is serialized
894 setup a task team and propagate it to the thread
895 */
896 KMP_DEBUG_ASSERT(team->t.t_serialized);
897 KA_TRACE(30,("T#%d creating task team in __kmp_task_alloc for proxy task\n", gtid));
898 __kmp_task_team_setup(thread,team,0,1); // 0,1 indicates only setup the current team regardless of nthreads
899 thread->th.th_task_team = team->t.t_task_team[thread->th.th_task_state];
900 }
901 kmp_task_team_t * task_team = thread->th.th_task_team;
902
903 /* tasking must be enabled now as the task might not be pushed */
904 if ( !KMP_TASKING_ENABLED( task_team ) ) {
905 KA_TRACE(30,("T#%d enabling tasking in __kmp_task_alloc for proxy task\n", gtid));
906 __kmp_enable_tasking( task_team, thread );
907 kmp_int32 tid = thread->th.th_info.ds.ds_tid;
908 kmp_thread_data_t * thread_data = & task_team -> tt.tt_threads_data[ tid ];
909 // No lock needed since only owner can allocate
910 if (thread_data -> td.td_deque == NULL ) {
911 __kmp_alloc_task_deque( thread, thread_data );
912 }
913 }
914
915 if ( task_team->tt.tt_found_proxy_tasks == FALSE )
916 TCW_4(task_team -> tt.tt_found_proxy_tasks, TRUE);
917 }
918#endif
919
Jim Cownie5e8470a2013-09-27 10:38:44 +0000920 // Calculate shared structure offset including padding after kmp_task_t struct
921 // to align pointers in shared struct
922 shareds_offset = sizeof( kmp_taskdata_t ) + sizeof_kmp_task_t;
923 shareds_offset = __kmp_round_up_to_val( shareds_offset, sizeof( void * ));
924
925 // Allocate a kmp_taskdata_t block and a kmp_task_t block.
926 KA_TRACE(30, ("__kmp_task_alloc: T#%d First malloc size: %ld\n",
927 gtid, shareds_offset) );
928 KA_TRACE(30, ("__kmp_task_alloc: T#%d Second malloc size: %ld\n",
929 gtid, sizeof_shareds) );
930
931 // Avoid double allocation here by combining shareds with taskdata
932 #if USE_FAST_MEMORY
933 taskdata = (kmp_taskdata_t *) __kmp_fast_allocate( thread, shareds_offset + sizeof_shareds );
934 #else /* ! USE_FAST_MEMORY */
935 taskdata = (kmp_taskdata_t *) __kmp_thread_malloc( thread, shareds_offset + sizeof_shareds );
936 #endif /* USE_FAST_MEMORY */
937
938 task = KMP_TASKDATA_TO_TASK(taskdata);
939
940 // Make sure task & taskdata are aligned appropriately
Andrey Churbanovd1c55042015-01-19 18:29:35 +0000941#if KMP_ARCH_X86 || KMP_ARCH_PPC64 || !KMP_HAVE_QUAD
Jim Cownie5e8470a2013-09-27 10:38:44 +0000942 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)taskdata) & (sizeof(double)-1) ) == 0 );
943 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)task) & (sizeof(double)-1) ) == 0 );
944#else
945 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)taskdata) & (sizeof(_Quad)-1) ) == 0 );
946 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)task) & (sizeof(_Quad)-1) ) == 0 );
947#endif
948 if (sizeof_shareds > 0) {
949 // Avoid double allocation here by combining shareds with taskdata
950 task->shareds = & ((char *) taskdata)[ shareds_offset ];
951 // Make sure shareds struct is aligned to pointer size
952 KMP_DEBUG_ASSERT( ( ((kmp_uintptr_t)task->shareds) & (sizeof(void *)-1) ) == 0 );
953 } else {
954 task->shareds = NULL;
955 }
956 task->routine = task_entry;
957 task->part_id = 0; // AC: Always start with 0 part id
958
959 taskdata->td_task_id = KMP_GEN_TASK_ID();
960 taskdata->td_team = team;
Jim Cownie181b4bb2013-12-23 17:28:57 +0000961 taskdata->td_alloc_thread = thread;
Jim Cownie5e8470a2013-09-27 10:38:44 +0000962 taskdata->td_parent = parent_task;
963 taskdata->td_level = parent_task->td_level + 1; // increment nesting level
964 taskdata->td_ident = loc_ref;
965 taskdata->td_taskwait_ident = NULL;
966 taskdata->td_taskwait_counter = 0;
967 taskdata->td_taskwait_thread = 0;
968 KMP_DEBUG_ASSERT( taskdata->td_parent != NULL );
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000969#if OMP_41_ENABLED
970 // avoid copying icvs for proxy tasks
971 if ( flags->proxy == TASK_FULL )
972#endif
973 copy_icvs( &taskdata->td_icvs, &taskdata->td_parent->td_icvs );
Jim Cownie5e8470a2013-09-27 10:38:44 +0000974
975 taskdata->td_flags.tiedness = flags->tiedness;
976 taskdata->td_flags.final = flags->final;
977 taskdata->td_flags.merged_if0 = flags->merged_if0;
Jim Cownie181b4bb2013-12-23 17:28:57 +0000978#if OMP_40_ENABLED
979 taskdata->td_flags.destructors_thunk = flags->destructors_thunk;
980#endif // OMP_40_ENABLED
Andrey Churbanov535b6fa2015-05-07 17:41:51 +0000981#if OMP_41_ENABLED
982 taskdata->td_flags.proxy = flags->proxy;
983#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +0000984 taskdata->td_flags.tasktype = TASK_EXPLICIT;
985
986 // GEH - TODO: fix this to copy parent task's value of tasking_ser flag
987 taskdata->td_flags.tasking_ser = ( __kmp_tasking_mode == tskm_immediate_exec );
988
989 // GEH - TODO: fix this to copy parent task's value of team_serial flag
990 taskdata->td_flags.team_serial = ( team->t.t_serialized ) ? 1 : 0;
991
992 // GEH - Note we serialize the task if the team is serialized to make sure implicit parallel region
993 // tasks are not left until program termination to execute. Also, it helps locality to execute
994 // immediately.
Jonathan Peyton7881aa12015-05-21 21:16:38 +0000995 taskdata->td_flags.task_serial = ( parent_task->td_flags.final
Jim Cownie5e8470a2013-09-27 10:38:44 +0000996 || taskdata->td_flags.team_serial || taskdata->td_flags.tasking_ser );
997
998 taskdata->td_flags.started = 0;
999 taskdata->td_flags.executing = 0;
1000 taskdata->td_flags.complete = 0;
1001 taskdata->td_flags.freed = 0;
1002
1003 taskdata->td_flags.native = flags->native;
1004
1005 taskdata->td_incomplete_child_tasks = 0;
1006 taskdata->td_allocated_child_tasks = 1; // start at one because counts current task and children
1007#if OMP_40_ENABLED
1008 taskdata->td_taskgroup = parent_task->td_taskgroup; // task inherits the taskgroup from the parent task
1009 taskdata->td_dephash = NULL;
1010 taskdata->td_depnode = NULL;
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001011#endif
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001012
1013 // Only need to keep track of child task counts if team parallel and tasking not serialized or if it is a proxy task
1014#if OMP_41_ENABLED
1015 if ( flags->proxy == TASK_PROXY || !( taskdata -> td_flags.team_serial || taskdata -> td_flags.tasking_ser ) )
1016#else
1017 if ( !( taskdata -> td_flags.team_serial || taskdata -> td_flags.tasking_ser ) )
1018#endif
1019 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001020 KMP_TEST_THEN_INC32( (kmp_int32 *)(& parent_task->td_incomplete_child_tasks) );
1021#if OMP_40_ENABLED
1022 if ( parent_task->td_taskgroup )
1023 KMP_TEST_THEN_INC32( (kmp_int32 *)(& parent_task->td_taskgroup->count) );
1024#endif
1025 // Only need to keep track of allocated child tasks for explicit tasks since implicit not deallocated
1026 if ( taskdata->td_parent->td_flags.tasktype == TASK_EXPLICIT ) {
1027 KMP_TEST_THEN_INC32( (kmp_int32 *)(& taskdata->td_parent->td_allocated_child_tasks) );
1028 }
1029 }
1030
1031 KA_TRACE(20, ("__kmp_task_alloc(exit): T#%d created task %p parent=%p\n",
1032 gtid, taskdata, taskdata->td_parent) );
1033
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001034#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +00001035 if (ompt_enabled) {
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001036 taskdata->ompt_task_info.task_id = __ompt_task_id_new(gtid);
1037 taskdata->ompt_task_info.function = (void*) task_entry;
Jonathan Peytonda7c8ab2015-06-29 17:33:03 +00001038 taskdata->ompt_task_info.frame.exit_runtime_frame = NULL;
1039 taskdata->ompt_task_info.frame.reenter_runtime_frame = NULL;
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001040 }
1041#endif
1042
Jim Cownie5e8470a2013-09-27 10:38:44 +00001043 return task;
1044}
1045
1046
1047kmp_task_t *
1048__kmpc_omp_task_alloc( ident_t *loc_ref, kmp_int32 gtid, kmp_int32 flags,
1049 size_t sizeof_kmp_task_t, size_t sizeof_shareds,
1050 kmp_routine_entry_t task_entry )
1051{
1052 kmp_task_t *retval;
1053 kmp_tasking_flags_t *input_flags = (kmp_tasking_flags_t *) & flags;
1054
1055 input_flags->native = FALSE;
1056 // __kmp_task_alloc() sets up all other runtime flags
1057
Jonathan Peyton1c9e6432015-06-03 18:24:02 +00001058#if OMP_41_ENABLED
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001059 KA_TRACE(10, ("__kmpc_omp_task_alloc(enter): T#%d loc=%p, flags=(%s %s) "
Jim Cownie5e8470a2013-09-27 10:38:44 +00001060 "sizeof_task=%ld sizeof_shared=%ld entry=%p\n",
1061 gtid, loc_ref, input_flags->tiedness ? "tied " : "untied",
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001062 input_flags->proxy ? "proxy" : "",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001063 sizeof_kmp_task_t, sizeof_shareds, task_entry) );
Jonathan Peyton1c9e6432015-06-03 18:24:02 +00001064#else
1065 KA_TRACE(10, ("__kmpc_omp_task_alloc(enter): T#%d loc=%p, flags=(%s) "
1066 "sizeof_task=%ld sizeof_shared=%ld entry=%p\n",
1067 gtid, loc_ref, input_flags->tiedness ? "tied " : "untied",
1068 sizeof_kmp_task_t, sizeof_shareds, task_entry) );
1069#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001070
1071 retval = __kmp_task_alloc( loc_ref, gtid, input_flags, sizeof_kmp_task_t,
1072 sizeof_shareds, task_entry );
1073
1074 KA_TRACE(20, ("__kmpc_omp_task_alloc(exit): T#%d retval %p\n", gtid, retval) );
1075
1076 return retval;
1077}
1078
1079//-----------------------------------------------------------
1080// __kmp_invoke_task: invoke the specified task
1081//
1082// gtid: global thread ID of caller
1083// task: the task to invoke
1084// current_task: the task to resume after task invokation
1085
1086static void
1087__kmp_invoke_task( kmp_int32 gtid, kmp_task_t *task, kmp_taskdata_t * current_task )
1088{
1089 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
Jim Cownie181b4bb2013-12-23 17:28:57 +00001090#if OMP_40_ENABLED
1091 int discard = 0 /* false */;
1092#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001093 KA_TRACE(30, ("__kmp_invoke_task(enter): T#%d invoking task %p, current_task=%p\n",
1094 gtid, taskdata, current_task) );
Jonathan Peytone03b62f2015-10-08 18:49:40 +00001095 KMP_DEBUG_ASSERT(task);
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001096#if OMP_41_ENABLED
1097 if ( taskdata->td_flags.proxy == TASK_PROXY &&
1098 taskdata->td_flags.complete == 1)
1099 {
1100 // This is a proxy task that was already completed but it needs to run
1101 // its bottom-half finish
1102 KA_TRACE(30, ("__kmp_invoke_task: T#%d running bottom finish for proxy task %p\n",
1103 gtid, taskdata) );
1104
1105 __kmp_bottom_half_finish_proxy(gtid,task);
1106
1107 KA_TRACE(30, ("__kmp_invoke_task(exit): T#%d completed bottom finish for proxy task %p, resuming task %p\n", gtid, taskdata, current_task) );
1108
1109 return;
1110 }
1111#endif
1112
1113#if OMP_41_ENABLED
1114 // Proxy tasks are not handled by the runtime
1115 if ( taskdata->td_flags.proxy != TASK_PROXY )
1116#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001117 __kmp_task_start( gtid, task, current_task );
1118
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001119#if OMPT_SUPPORT
1120 ompt_thread_info_t oldInfo;
1121 kmp_info_t * thread;
Jonathan Peytonb68a85d2015-09-21 18:11:22 +00001122 if (ompt_enabled) {
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001123 // Store the threads states and restore them after the task
1124 thread = __kmp_threads[ gtid ];
1125 oldInfo = thread->th.ompt_thread_info;
1126 thread->th.ompt_thread_info.wait_id = 0;
1127 thread->th.ompt_thread_info.state = ompt_state_work_parallel;
1128 taskdata->ompt_task_info.frame.exit_runtime_frame = __builtin_frame_address(0);
1129 }
1130#endif
1131
Jim Cownie181b4bb2013-12-23 17:28:57 +00001132#if OMP_40_ENABLED
1133 // TODO: cancel tasks if the parallel region has also been cancelled
1134 // TODO: check if this sequence can be hoisted above __kmp_task_start
1135 // if cancellation has been enabled for this run ...
1136 if (__kmp_omp_cancellation) {
1137 kmp_info_t *this_thr = __kmp_threads [ gtid ];
1138 kmp_team_t * this_team = this_thr->th.th_team;
1139 kmp_taskgroup_t * taskgroup = taskdata->td_taskgroup;
1140 if ((taskgroup && taskgroup->cancel_request) || (this_team->t.t_cancel_request == cancel_parallel)) {
Jonathan Peyton45be4502015-08-11 21:36:41 +00001141 KMP_COUNT_BLOCK(TASK_cancelled);
Jim Cownie181b4bb2013-12-23 17:28:57 +00001142 // this task belongs to a task group and we need to cancel it
1143 discard = 1 /* true */;
1144 }
1145 }
1146
Jim Cownie5e8470a2013-09-27 10:38:44 +00001147 //
1148 // Invoke the task routine and pass in relevant data.
1149 // Thunks generated by gcc take a different argument list.
1150 //
Jim Cownie181b4bb2013-12-23 17:28:57 +00001151 if (!discard) {
Jonathan Peyton45be4502015-08-11 21:36:41 +00001152 KMP_COUNT_BLOCK(TASK_executed);
1153 KMP_TIME_BLOCK (TASK_execution);
Jim Cownie181b4bb2013-12-23 17:28:57 +00001154#endif // OMP_40_ENABLED
Jim Cownie5e8470a2013-09-27 10:38:44 +00001155#ifdef KMP_GOMP_COMPAT
Jim Cownie181b4bb2013-12-23 17:28:57 +00001156 if (taskdata->td_flags.native) {
1157 ((void (*)(void *))(*(task->routine)))(task->shareds);
1158 }
1159 else
Jim Cownie5e8470a2013-09-27 10:38:44 +00001160#endif /* KMP_GOMP_COMPAT */
Jim Cownie181b4bb2013-12-23 17:28:57 +00001161 {
1162 (*(task->routine))(gtid, task);
1163 }
1164#if OMP_40_ENABLED
Jim Cownie5e8470a2013-09-27 10:38:44 +00001165 }
Jim Cownie181b4bb2013-12-23 17:28:57 +00001166#endif // OMP_40_ENABLED
Jim Cownie5e8470a2013-09-27 10:38:44 +00001167
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001168
1169#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +00001170 if (ompt_enabled) {
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001171 thread->th.ompt_thread_info = oldInfo;
1172 taskdata->ompt_task_info.frame.exit_runtime_frame = 0;
1173 }
1174#endif
1175
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001176#if OMP_41_ENABLED
1177 // Proxy tasks are not handled by the runtime
1178 if ( taskdata->td_flags.proxy != TASK_PROXY )
1179#endif
1180 __kmp_task_finish( gtid, task, current_task );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001181
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001182 KA_TRACE(30, ("__kmp_invoke_task(exit): T#%d completed task %p, resuming task %p\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001183 gtid, taskdata, current_task) );
1184 return;
1185}
1186
1187//-----------------------------------------------------------------------
1188// __kmpc_omp_task_parts: Schedule a thread-switchable task for execution
1189//
1190// loc_ref: location of original task pragma (ignored)
1191// gtid: Global Thread ID of encountering thread
1192// new_task: task thunk allocated by __kmp_omp_task_alloc() for the ''new task''
1193// Returns:
1194// TASK_CURRENT_NOT_QUEUED (0) if did not suspend and queue current task to be resumed later.
1195// TASK_CURRENT_QUEUED (1) if suspended and queued the current task to be resumed later.
1196
1197kmp_int32
1198__kmpc_omp_task_parts( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t * new_task)
1199{
1200 kmp_taskdata_t * new_taskdata = KMP_TASK_TO_TASKDATA(new_task);
1201
1202 KA_TRACE(10, ("__kmpc_omp_task_parts(enter): T#%d loc=%p task=%p\n",
1203 gtid, loc_ref, new_taskdata ) );
1204
1205 /* Should we execute the new task or queue it? For now, let's just always try to
1206 queue it. If the queue fills up, then we'll execute it. */
1207
1208 if ( __kmp_push_task( gtid, new_task ) == TASK_NOT_PUSHED ) // if cannot defer
1209 { // Execute this task immediately
1210 kmp_taskdata_t * current_task = __kmp_threads[ gtid ] -> th.th_current_task;
1211 new_taskdata->td_flags.task_serial = 1;
1212 __kmp_invoke_task( gtid, new_task, current_task );
1213 }
1214
1215 KA_TRACE(10, ("__kmpc_omp_task_parts(exit): T#%d returning TASK_CURRENT_NOT_QUEUED: "
1216 "loc=%p task=%p, return: TASK_CURRENT_NOT_QUEUED\n", gtid, loc_ref,
1217 new_taskdata ) );
1218
1219 return TASK_CURRENT_NOT_QUEUED;
1220}
1221
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001222//---------------------------------------------------------------------
1223// __kmp_omp_task: Schedule a non-thread-switchable task for execution
1224// gtid: Global Thread ID of encountering thread
1225// new_task: non-thread-switchable task thunk allocated by __kmp_omp_task_alloc()
1226// serialize_immediate: if TRUE then if the task is executed immediately its execution will be serialized
1227// returns:
1228//
1229// TASK_CURRENT_NOT_QUEUED (0) if did not suspend and queue current task to be resumed later.
1230// TASK_CURRENT_QUEUED (1) if suspended and queued the current task to be resumed later.
1231kmp_int32
1232__kmp_omp_task( kmp_int32 gtid, kmp_task_t * new_task, bool serialize_immediate )
1233{
1234 kmp_taskdata_t * new_taskdata = KMP_TASK_TO_TASKDATA(new_task);
1235
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001236#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +00001237 if (ompt_enabled) {
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001238 new_taskdata->ompt_task_info.frame.reenter_runtime_frame =
1239 __builtin_frame_address(0);
1240 }
1241#endif
1242
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001243 /* 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. */
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001245#if OMP_41_ENABLED
1246 if ( new_taskdata->td_flags.proxy == TASK_PROXY || __kmp_push_task( gtid, new_task ) == TASK_NOT_PUSHED ) // if cannot defer
1247#else
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001248 if ( __kmp_push_task( gtid, new_task ) == TASK_NOT_PUSHED ) // if cannot defer
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001249#endif
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001250 { // Execute this task immediately
1251 kmp_taskdata_t * current_task = __kmp_threads[ gtid ] -> th.th_current_task;
1252 if ( serialize_immediate )
1253 new_taskdata -> td_flags.task_serial = 1;
1254 __kmp_invoke_task( gtid, new_task, current_task );
1255 }
1256
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001257#if OMPT_SUPPORT
Jonathan Peytonb68a85d2015-09-21 18:11:22 +00001258 if (ompt_enabled) {
Andrey Churbanovd7d088f2015-04-29 16:42:24 +00001259 new_taskdata->ompt_task_info.frame.reenter_runtime_frame = 0;
1260 }
1261#endif
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001262
1263 return TASK_CURRENT_NOT_QUEUED;
1264}
Jim Cownie5e8470a2013-09-27 10:38:44 +00001265
1266//---------------------------------------------------------------------
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001267// __kmpc_omp_task: Wrapper around __kmp_omp_task to schedule a non-thread-switchable task from
1268// the parent thread only!
Jim Cownie5e8470a2013-09-27 10:38:44 +00001269// loc_ref: location of original task pragma (ignored)
1270// gtid: Global Thread ID of encountering thread
1271// new_task: non-thread-switchable task thunk allocated by __kmp_omp_task_alloc()
1272// returns:
1273//
1274// TASK_CURRENT_NOT_QUEUED (0) if did not suspend and queue current task to be resumed later.
1275// TASK_CURRENT_QUEUED (1) if suspended and queued the current task to be resumed later.
1276
1277kmp_int32
1278__kmpc_omp_task( ident_t *loc_ref, kmp_int32 gtid, kmp_task_t * new_task)
1279{
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001280 kmp_int32 res;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001281
Jonathan Peytond2eb3c72015-08-26 20:02:21 +00001282#if KMP_DEBUG
1283 kmp_taskdata_t * new_taskdata = KMP_TASK_TO_TASKDATA(new_task);
1284#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001285 KA_TRACE(10, ("__kmpc_omp_task(enter): T#%d loc=%p task=%p\n",
1286 gtid, loc_ref, new_taskdata ) );
1287
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001288 res = __kmp_omp_task(gtid,new_task,true);
Jim Cownie5e8470a2013-09-27 10:38:44 +00001289
1290 KA_TRACE(10, ("__kmpc_omp_task(exit): T#%d returning TASK_CURRENT_NOT_QUEUED: loc=%p task=%p\n",
1291 gtid, loc_ref, new_taskdata ) );
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001292 return res;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001293}
1294
Jim Cownie5e8470a2013-09-27 10:38:44 +00001295//-------------------------------------------------------------------------------------
1296// __kmpc_omp_taskwait: Wait until all tasks generated by the current task are complete
1297
1298kmp_int32
1299__kmpc_omp_taskwait( ident_t *loc_ref, kmp_int32 gtid )
1300{
1301 kmp_taskdata_t * taskdata;
1302 kmp_info_t * thread;
1303 int thread_finished = FALSE;
1304
1305 KA_TRACE(10, ("__kmpc_omp_taskwait(enter): T#%d loc=%p\n",
1306 gtid, loc_ref) );
1307
1308 if ( __kmp_tasking_mode != tskm_immediate_exec ) {
1309 // GEH TODO: shouldn't we have some sort of OMPRAP API calls here to mark begin wait?
1310
1311 thread = __kmp_threads[ gtid ];
1312 taskdata = thread -> th.th_current_task;
1313#if USE_ITT_BUILD
1314 // Note: These values are used by ITT events as well.
1315#endif /* USE_ITT_BUILD */
1316 taskdata->td_taskwait_counter += 1;
1317 taskdata->td_taskwait_ident = loc_ref;
1318 taskdata->td_taskwait_thread = gtid + 1;
1319
1320#if USE_ITT_BUILD
1321 void * itt_sync_obj = __kmp_itt_taskwait_object( gtid );
1322 if ( itt_sync_obj != NULL )
1323 __kmp_itt_taskwait_starting( gtid, itt_sync_obj );
1324#endif /* USE_ITT_BUILD */
1325
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001326#if OMP_41_ENABLED
1327 if ( ! taskdata->td_flags.team_serial || (thread->th.th_task_team != NULL && thread->th.th_task_team->tt.tt_found_proxy_tasks) )
1328#else
1329 if ( ! taskdata->td_flags.team_serial )
1330#endif
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001331 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001332 // GEH: if team serialized, avoid reading the volatile variable below.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001333 kmp_flag_32 flag(&(taskdata->td_incomplete_child_tasks), 0U);
Jim Cownie5e8470a2013-09-27 10:38:44 +00001334 while ( TCR_4(taskdata -> td_incomplete_child_tasks) != 0 ) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001335 flag.execute_tasks(thread, gtid, FALSE, &thread_finished
1336 USE_ITT_BUILD_ARG(itt_sync_obj), __kmp_task_stealing_constraint );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001337 }
1338 }
1339#if USE_ITT_BUILD
1340 if ( itt_sync_obj != NULL )
1341 __kmp_itt_taskwait_finished( gtid, itt_sync_obj );
1342#endif /* USE_ITT_BUILD */
1343
1344 // GEH TODO: shouldn't we have some sort of OMPRAP API calls here to mark end of wait?
1345 taskdata->td_taskwait_thread = - taskdata->td_taskwait_thread;
1346 }
1347
1348 KA_TRACE(10, ("__kmpc_omp_taskwait(exit): T#%d task %p finished waiting, "
1349 "returning TASK_CURRENT_NOT_QUEUED\n", gtid, taskdata) );
1350
1351 return TASK_CURRENT_NOT_QUEUED;
1352}
1353
1354
1355//-------------------------------------------------
1356// __kmpc_omp_taskyield: switch to a different task
1357
1358kmp_int32
1359__kmpc_omp_taskyield( ident_t *loc_ref, kmp_int32 gtid, int end_part )
1360{
1361 kmp_taskdata_t * taskdata;
1362 kmp_info_t * thread;
1363 int thread_finished = FALSE;
1364
Jonathan Peyton45be4502015-08-11 21:36:41 +00001365 KMP_COUNT_BLOCK(OMP_TASKYIELD);
1366
Jim Cownie5e8470a2013-09-27 10:38:44 +00001367 KA_TRACE(10, ("__kmpc_omp_taskyield(enter): T#%d loc=%p end_part = %d\n",
1368 gtid, loc_ref, end_part) );
1369
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001370 if ( __kmp_tasking_mode != tskm_immediate_exec && __kmp_init_parallel ) {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001371 // GEH TODO: shouldn't we have some sort of OMPRAP API calls here to mark begin wait?
1372
1373 thread = __kmp_threads[ gtid ];
1374 taskdata = thread -> th.th_current_task;
1375 // Should we model this as a task wait or not?
1376#if USE_ITT_BUILD
1377 // Note: These values are used by ITT events as well.
1378#endif /* USE_ITT_BUILD */
1379 taskdata->td_taskwait_counter += 1;
1380 taskdata->td_taskwait_ident = loc_ref;
1381 taskdata->td_taskwait_thread = gtid + 1;
1382
1383#if USE_ITT_BUILD
1384 void * itt_sync_obj = __kmp_itt_taskwait_object( gtid );
1385 if ( itt_sync_obj != NULL )
1386 __kmp_itt_taskwait_starting( gtid, itt_sync_obj );
1387#endif /* USE_ITT_BUILD */
1388 if ( ! taskdata->td_flags.team_serial ) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001389 kmp_task_team_t * task_team = thread->th.th_task_team;
1390 if (task_team != NULL) {
Andrey Churbanov6d224db2015-02-10 18:37:43 +00001391 if (KMP_TASKING_ENABLED(task_team)) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001392 __kmp_execute_tasks_32( thread, gtid, NULL, FALSE, &thread_finished
1393 USE_ITT_BUILD_ARG(itt_sync_obj), __kmp_task_stealing_constraint );
1394 }
1395 }
Jim Cownie5e8470a2013-09-27 10:38:44 +00001396 }
Jim Cownie5e8470a2013-09-27 10:38:44 +00001397#if USE_ITT_BUILD
1398 if ( itt_sync_obj != NULL )
1399 __kmp_itt_taskwait_finished( gtid, itt_sync_obj );
1400#endif /* USE_ITT_BUILD */
1401
1402 // GEH TODO: shouldn't we have some sort of OMPRAP API calls here to mark end of wait?
1403 taskdata->td_taskwait_thread = - taskdata->td_taskwait_thread;
1404 }
1405
1406 KA_TRACE(10, ("__kmpc_omp_taskyield(exit): T#%d task %p resuming, "
1407 "returning TASK_CURRENT_NOT_QUEUED\n", gtid, taskdata) );
1408
1409 return TASK_CURRENT_NOT_QUEUED;
1410}
1411
1412
1413#if OMP_40_ENABLED
1414//-------------------------------------------------------------------------------------
1415// __kmpc_taskgroup: Start a new taskgroup
1416
1417void
Jim Cownie181b4bb2013-12-23 17:28:57 +00001418__kmpc_taskgroup( ident_t* loc, int gtid )
Jim Cownie5e8470a2013-09-27 10:38:44 +00001419{
1420 kmp_info_t * thread = __kmp_threads[ gtid ];
1421 kmp_taskdata_t * taskdata = thread->th.th_current_task;
1422 kmp_taskgroup_t * tg_new =
1423 (kmp_taskgroup_t *)__kmp_thread_malloc( thread, sizeof( kmp_taskgroup_t ) );
1424 KA_TRACE(10, ("__kmpc_taskgroup: T#%d loc=%p group=%p\n", gtid, loc, tg_new) );
1425 tg_new->count = 0;
Jim Cownie181b4bb2013-12-23 17:28:57 +00001426 tg_new->cancel_request = cancel_noreq;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001427 tg_new->parent = taskdata->td_taskgroup;
1428 taskdata->td_taskgroup = tg_new;
1429}
1430
1431
1432//-------------------------------------------------------------------------------------
1433// __kmpc_end_taskgroup: Wait until all tasks generated by the current task
1434// and its descendants are complete
1435
1436void
Jim Cownie181b4bb2013-12-23 17:28:57 +00001437__kmpc_end_taskgroup( ident_t* loc, int gtid )
Jim Cownie5e8470a2013-09-27 10:38:44 +00001438{
1439 kmp_info_t * thread = __kmp_threads[ gtid ];
1440 kmp_taskdata_t * taskdata = thread->th.th_current_task;
1441 kmp_taskgroup_t * taskgroup = taskdata->td_taskgroup;
1442 int thread_finished = FALSE;
1443
1444 KA_TRACE(10, ("__kmpc_end_taskgroup(enter): T#%d loc=%p\n", gtid, loc) );
1445 KMP_DEBUG_ASSERT( taskgroup != NULL );
1446
1447 if ( __kmp_tasking_mode != tskm_immediate_exec ) {
1448#if USE_ITT_BUILD
1449 // For ITT the taskgroup wait is similar to taskwait until we need to distinguish them
1450 void * itt_sync_obj = __kmp_itt_taskwait_object( gtid );
1451 if ( itt_sync_obj != NULL )
1452 __kmp_itt_taskwait_starting( gtid, itt_sync_obj );
1453#endif /* USE_ITT_BUILD */
1454
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001455#if OMP_41_ENABLED
1456 if ( ! taskdata->td_flags.team_serial || (thread->th.th_task_team != NULL && thread->th.th_task_team->tt.tt_found_proxy_tasks) )
1457#else
1458 if ( ! taskdata->td_flags.team_serial )
1459#endif
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001460 {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001461 kmp_flag_32 flag(&(taskgroup->count), 0U);
Jim Cownie5e8470a2013-09-27 10:38:44 +00001462 while ( TCR_4(taskgroup->count) != 0 ) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001463 flag.execute_tasks(thread, gtid, FALSE, &thread_finished
1464 USE_ITT_BUILD_ARG(itt_sync_obj), __kmp_task_stealing_constraint );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001465 }
1466 }
1467
1468#if USE_ITT_BUILD
1469 if ( itt_sync_obj != NULL )
1470 __kmp_itt_taskwait_finished( gtid, itt_sync_obj );
1471#endif /* USE_ITT_BUILD */
1472 }
1473 KMP_DEBUG_ASSERT( taskgroup->count == 0 );
1474
1475 // Restore parent taskgroup for the current task
1476 taskdata->td_taskgroup = taskgroup->parent;
1477 __kmp_thread_free( thread, taskgroup );
1478
1479 KA_TRACE(10, ("__kmpc_end_taskgroup(exit): T#%d task %p finished waiting\n", gtid, taskdata) );
1480}
1481#endif
1482
1483
1484//------------------------------------------------------
1485// __kmp_remove_my_task: remove a task from my own deque
1486
1487static kmp_task_t *
1488__kmp_remove_my_task( kmp_info_t * thread, kmp_int32 gtid, kmp_task_team_t *task_team,
1489 kmp_int32 is_constrained )
1490{
1491 kmp_task_t * task;
1492 kmp_taskdata_t * taskdata;
1493 kmp_thread_data_t *thread_data;
1494 kmp_uint32 tail;
1495
1496 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
1497 KMP_DEBUG_ASSERT( task_team -> tt.tt_threads_data != NULL ); // Caller should check this condition
1498
1499 thread_data = & task_team -> tt.tt_threads_data[ __kmp_tid_from_gtid( gtid ) ];
1500
1501 KA_TRACE(10, ("__kmp_remove_my_task(enter): T#%d ntasks=%d head=%u tail=%u\n",
1502 gtid, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1503 thread_data->td.td_deque_tail) );
1504
1505 if (TCR_4(thread_data -> td.td_deque_ntasks) == 0) {
1506 KA_TRACE(10, ("__kmp_remove_my_task(exit #1): T#%d No tasks to remove: ntasks=%d head=%u tail=%u\n",
1507 gtid, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1508 thread_data->td.td_deque_tail) );
1509 return NULL;
1510 }
1511
1512 __kmp_acquire_bootstrap_lock( & thread_data -> td.td_deque_lock );
1513
1514 if (TCR_4(thread_data -> td.td_deque_ntasks) == 0) {
1515 __kmp_release_bootstrap_lock( & thread_data -> td.td_deque_lock );
1516 KA_TRACE(10, ("__kmp_remove_my_task(exit #2): T#%d No tasks to remove: ntasks=%d head=%u tail=%u\n",
1517 gtid, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1518 thread_data->td.td_deque_tail) );
1519 return NULL;
1520 }
1521
1522 tail = ( thread_data -> td.td_deque_tail - 1 ) & TASK_DEQUE_MASK; // Wrap index.
1523 taskdata = thread_data -> td.td_deque[ tail ];
1524
1525 if (is_constrained) {
1526 // we need to check if the candidate obeys task scheduling constraint:
1527 // only child of current task can be scheduled
1528 kmp_taskdata_t * current = thread->th.th_current_task;
1529 kmp_int32 level = current->td_level;
1530 kmp_taskdata_t * parent = taskdata->td_parent;
1531 while ( parent != current && parent->td_level > level ) {
1532 parent = parent->td_parent; // check generation up to the level of the current task
1533 KMP_DEBUG_ASSERT(parent != NULL);
1534 }
1535 if ( parent != current ) {
1536 // If the tail task is not a child, then no other childs can appear in the deque.
1537 __kmp_release_bootstrap_lock( & thread_data -> td.td_deque_lock );
1538 KA_TRACE(10, ("__kmp_remove_my_task(exit #2): T#%d No tasks to remove: ntasks=%d head=%u tail=%u\n",
1539 gtid, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1540 thread_data->td.td_deque_tail) );
1541 return NULL;
1542 }
1543 }
1544
1545 thread_data -> td.td_deque_tail = tail;
1546 TCW_4(thread_data -> td.td_deque_ntasks, thread_data -> td.td_deque_ntasks - 1);
1547
1548 __kmp_release_bootstrap_lock( & thread_data->td.td_deque_lock );
1549
1550 KA_TRACE(10, ("__kmp_remove_my_task(exit #2): T#%d task %p removed: ntasks=%d head=%u tail=%u\n",
1551 gtid, taskdata, thread_data->td.td_deque_ntasks, thread_data->td.td_deque_head,
1552 thread_data->td.td_deque_tail) );
1553
1554 task = KMP_TASKDATA_TO_TASK( taskdata );
1555 return task;
1556}
1557
1558
1559//-----------------------------------------------------------
1560// __kmp_steal_task: remove a task from another thread's deque
1561// Assume that calling thread has already checked existence of
1562// task_team thread_data before calling this routine.
1563
1564static kmp_task_t *
1565__kmp_steal_task( kmp_info_t *victim, kmp_int32 gtid, kmp_task_team_t *task_team,
1566 volatile kmp_uint32 *unfinished_threads, int *thread_finished,
1567 kmp_int32 is_constrained )
1568{
1569 kmp_task_t * task;
1570 kmp_taskdata_t * taskdata;
1571 kmp_thread_data_t *victim_td, *threads_data;
Jonathan Peyton7c4d66d2015-06-08 20:01:14 +00001572 kmp_int32 victim_tid;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001573
1574 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
1575
1576 threads_data = task_team -> tt.tt_threads_data;
1577 KMP_DEBUG_ASSERT( threads_data != NULL ); // Caller should check this condition
1578
1579 victim_tid = victim->th.th_info.ds.ds_tid;
1580 victim_td = & threads_data[ victim_tid ];
1581
1582 KA_TRACE(10, ("__kmp_steal_task(enter): T#%d try to steal from T#%d: task_team=%p ntasks=%d "
1583 "head=%u tail=%u\n",
1584 gtid, __kmp_gtid_from_thread( victim ), task_team, victim_td->td.td_deque_ntasks,
1585 victim_td->td.td_deque_head, victim_td->td.td_deque_tail) );
1586
1587 if ( (TCR_4(victim_td -> td.td_deque_ntasks) == 0) || // Caller should not check this condition
1588 (TCR_PTR(victim->th.th_task_team) != task_team)) // GEH: why would this happen?
1589 {
1590 KA_TRACE(10, ("__kmp_steal_task(exit #1): T#%d could not steal from T#%d: task_team=%p "
1591 "ntasks=%d head=%u tail=%u\n",
1592 gtid, __kmp_gtid_from_thread( victim ), task_team, victim_td->td.td_deque_ntasks,
1593 victim_td->td.td_deque_head, victim_td->td.td_deque_tail) );
1594 return NULL;
1595 }
1596
1597 __kmp_acquire_bootstrap_lock( & victim_td -> td.td_deque_lock );
1598
1599 // Check again after we acquire the lock
1600 if ( (TCR_4(victim_td -> td.td_deque_ntasks) == 0) ||
1601 (TCR_PTR(victim->th.th_task_team) != task_team)) // GEH: why would this happen?
1602 {
1603 __kmp_release_bootstrap_lock( & victim_td -> td.td_deque_lock );
1604 KA_TRACE(10, ("__kmp_steal_task(exit #2): T#%d could not steal from T#%d: task_team=%p "
1605 "ntasks=%d head=%u tail=%u\n",
1606 gtid, __kmp_gtid_from_thread( victim ), task_team, victim_td->td.td_deque_ntasks,
1607 victim_td->td.td_deque_head, victim_td->td.td_deque_tail) );
1608 return NULL;
1609 }
1610
1611 KMP_DEBUG_ASSERT( victim_td -> td.td_deque != NULL );
1612
1613 if ( !is_constrained ) {
1614 taskdata = victim_td -> td.td_deque[ victim_td -> td.td_deque_head ];
1615 // Bump head pointer and Wrap.
1616 victim_td -> td.td_deque_head = ( victim_td -> td.td_deque_head + 1 ) & TASK_DEQUE_MASK;
1617 } else {
1618 // While we have postponed tasks let's steal from tail of the deque (smaller tasks)
1619 kmp_int32 tail = ( victim_td -> td.td_deque_tail - 1 ) & TASK_DEQUE_MASK; // Wrap index.
1620 taskdata = victim_td -> td.td_deque[ tail ];
1621 // we need to check if the candidate obeys task scheduling constraint:
1622 // only child of current task can be scheduled
1623 kmp_taskdata_t * current = __kmp_threads[ gtid ]->th.th_current_task;
1624 kmp_int32 level = current->td_level;
1625 kmp_taskdata_t * parent = taskdata->td_parent;
1626 while ( parent != current && parent->td_level > level ) {
1627 parent = parent->td_parent; // check generation up to the level of the current task
1628 KMP_DEBUG_ASSERT(parent != NULL);
1629 }
1630 if ( parent != current ) {
1631 // If the tail task is not a child, then no other childs can appear in the deque (?).
1632 __kmp_release_bootstrap_lock( & victim_td -> td.td_deque_lock );
1633 KA_TRACE(10, ("__kmp_steal_task(exit #2): T#%d could not steal from T#%d: task_team=%p "
1634 "ntasks=%d head=%u tail=%u\n",
1635 gtid, __kmp_gtid_from_thread( threads_data[victim_tid].td.td_thr ),
1636 task_team, victim_td->td.td_deque_ntasks,
1637 victim_td->td.td_deque_head, victim_td->td.td_deque_tail) );
1638 return NULL;
1639 }
1640 victim_td -> td.td_deque_tail = tail;
1641 }
1642 if (*thread_finished) {
1643 // We need to un-mark this victim as a finished victim. This must be done before
1644 // releasing the lock, or else other threads (starting with the master victim)
1645 // might be prematurely released from the barrier!!!
Jonathan Peytone8104ad2015-06-08 18:56:33 +00001646 kmp_uint32 count;
1647
1648 count = KMP_TEST_THEN_INC32( (kmp_int32 *)unfinished_threads );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001649
1650 KA_TRACE(20, ("__kmp_steal_task: T#%d inc unfinished_threads to %d: task_team=%p\n",
1651 gtid, count + 1, task_team) );
1652
1653 *thread_finished = FALSE;
1654 }
1655 TCW_4(victim_td -> td.td_deque_ntasks, TCR_4(victim_td -> td.td_deque_ntasks) - 1);
1656
1657 __kmp_release_bootstrap_lock( & victim_td -> td.td_deque_lock );
1658
Jonathan Peyton45be4502015-08-11 21:36:41 +00001659 KMP_COUNT_BLOCK(TASK_stolen);
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001660 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 +00001661 "ntasks=%d head=%u tail=%u\n",
1662 gtid, taskdata, __kmp_gtid_from_thread( victim ), task_team,
1663 victim_td->td.td_deque_ntasks, victim_td->td.td_deque_head,
1664 victim_td->td.td_deque_tail) );
1665
1666 task = KMP_TASKDATA_TO_TASK( taskdata );
1667 return task;
1668}
1669
1670
1671//-----------------------------------------------------------------------------
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001672// __kmp_execute_tasks_template: Choose and execute tasks until either the condition
Jim Cownie5e8470a2013-09-27 10:38:44 +00001673// is statisfied (return true) or there are none left (return false).
1674// final_spin is TRUE if this is the spin at the release barrier.
1675// thread_finished indicates whether the thread is finished executing all
1676// the tasks it has on its deque, and is at the release barrier.
1677// spinner is the location on which to spin.
1678// spinner == NULL means only execute a single task and return.
1679// checker is the value to check to terminate the spin.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001680template <class C>
1681static inline int __kmp_execute_tasks_template(kmp_info_t *thread, kmp_int32 gtid, C *flag, int final_spin,
1682 int *thread_finished
1683 USE_ITT_BUILD_ARG(void * itt_sync_obj), kmp_int32 is_constrained)
Jim Cownie5e8470a2013-09-27 10:38:44 +00001684{
1685 kmp_task_team_t * task_team;
Jim Cownie5e8470a2013-09-27 10:38:44 +00001686 kmp_thread_data_t * threads_data;
1687 kmp_task_t * task;
1688 kmp_taskdata_t * current_task = thread -> th.th_current_task;
1689 volatile kmp_uint32 * unfinished_threads;
1690 kmp_int32 nthreads, last_stolen, k, tid;
1691
1692 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
1693 KMP_DEBUG_ASSERT( thread == __kmp_threads[ gtid ] );
1694
1695 task_team = thread -> th.th_task_team;
1696 KMP_DEBUG_ASSERT( task_team != NULL );
1697
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001698 KA_TRACE(15, ("__kmp_execute_tasks_template(enter): T#%d final_spin=%d *thread_finished=%d\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001699 gtid, final_spin, *thread_finished) );
1700
1701 threads_data = (kmp_thread_data_t *)TCR_PTR(task_team -> tt.tt_threads_data);
1702 KMP_DEBUG_ASSERT( threads_data != NULL );
1703
1704 nthreads = task_team -> tt.tt_nproc;
1705 unfinished_threads = &(task_team -> tt.tt_unfinished_threads);
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001706#if OMP_41_ENABLED
1707 KMP_DEBUG_ASSERT( nthreads > 1 || task_team->tt.tt_found_proxy_tasks);
1708#else
Jim Cownie5e8470a2013-09-27 10:38:44 +00001709 KMP_DEBUG_ASSERT( nthreads > 1 );
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001710#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00001711 KMP_DEBUG_ASSERT( TCR_4((int)*unfinished_threads) >= 0 );
1712
1713 // Choose tasks from our own work queue.
1714 start:
1715 while (( task = __kmp_remove_my_task( thread, gtid, task_team, is_constrained )) != NULL ) {
1716#if USE_ITT_BUILD && USE_ITT_NOTIFY
1717 if ( __itt_sync_create_ptr || KMP_ITT_DEBUG ) {
1718 if ( itt_sync_obj == NULL ) {
1719 // we are at fork barrier where we could not get the object reliably
1720 itt_sync_obj = __kmp_itt_barrier_object( gtid, bs_forkjoin_barrier );
1721 }
1722 __kmp_itt_task_starting( itt_sync_obj );
1723 }
1724#endif /* USE_ITT_BUILD && USE_ITT_NOTIFY */
1725 __kmp_invoke_task( gtid, task, current_task );
1726#if USE_ITT_BUILD
1727 if ( itt_sync_obj != NULL )
1728 __kmp_itt_task_finished( itt_sync_obj );
1729#endif /* USE_ITT_BUILD */
1730
1731 // If this thread is only partway through the barrier and the condition
1732 // is met, then return now, so that the barrier gather/release pattern can proceed.
1733 // If this thread is in the last spin loop in the barrier, waiting to be
1734 // released, we know that the termination condition will not be satisified,
1735 // so don't waste any cycles checking it.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001736 if (flag == NULL || (!final_spin && flag->done_check())) {
1737 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #1): T#%d spin condition satisfied\n", gtid) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001738 return TRUE;
1739 }
1740 KMP_YIELD( __kmp_library == library_throughput ); // Yield before executing next task
1741 }
1742
1743 // This thread's work queue is empty. If we are in the final spin loop
1744 // of the barrier, check and see if the termination condition is satisfied.
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001745#if OMP_41_ENABLED
1746 // The work queue may be empty but there might be proxy tasks still executing
1747 if (final_spin && TCR_4(current_task -> td_incomplete_child_tasks) == 0)
1748#else
1749 if (final_spin)
1750#endif
1751 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001752 // First, decrement the #unfinished threads, if that has not already
1753 // been done. This decrement might be to the spin location, and
1754 // result in the termination condition being satisfied.
1755 if (! *thread_finished) {
Jonathan Peytone8104ad2015-06-08 18:56:33 +00001756 kmp_uint32 count;
1757
1758 count = KMP_TEST_THEN_DEC32( (kmp_int32 *)unfinished_threads ) - 1;
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001759 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 +00001760 gtid, count, task_team) );
1761 *thread_finished = TRUE;
1762 }
1763
1764 // It is now unsafe to reference thread->th.th_team !!!
1765 // Decrementing task_team->tt.tt_unfinished_threads can allow the master
1766 // thread to pass through the barrier, where it might reset each thread's
1767 // th.th_team field for the next parallel region.
1768 // If we can steal more work, we know that this has not happened yet.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001769 if (flag != NULL && flag->done_check()) {
1770 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #2): T#%d spin condition satisfied\n", gtid) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001771 return TRUE;
1772 }
1773 }
1774
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001775#if OMP_41_ENABLED
1776 // check if there are other threads to steal from, otherwise go back
1777 if ( nthreads == 1 )
1778 goto start;
1779#endif
1780
Jim Cownie5e8470a2013-09-27 10:38:44 +00001781 // Try to steal from the last place I stole from successfully.
1782 tid = thread -> th.th_info.ds.ds_tid;//__kmp_tid_from_gtid( gtid );
1783 last_stolen = threads_data[ tid ].td.td_deque_last_stolen;
1784
1785 if (last_stolen != -1) {
1786 kmp_info_t *other_thread = threads_data[last_stolen].td.td_thr;
1787
1788 while ((task = __kmp_steal_task( other_thread, gtid, task_team, unfinished_threads,
1789 thread_finished, is_constrained )) != NULL)
1790 {
1791#if USE_ITT_BUILD && USE_ITT_NOTIFY
1792 if ( __itt_sync_create_ptr || KMP_ITT_DEBUG ) {
1793 if ( itt_sync_obj == NULL ) {
1794 // we are at fork barrier where we could not get the object reliably
1795 itt_sync_obj = __kmp_itt_barrier_object( gtid, bs_forkjoin_barrier );
1796 }
1797 __kmp_itt_task_starting( itt_sync_obj );
1798 }
1799#endif /* USE_ITT_BUILD && USE_ITT_NOTIFY */
1800 __kmp_invoke_task( gtid, task, current_task );
1801#if USE_ITT_BUILD
1802 if ( itt_sync_obj != NULL )
1803 __kmp_itt_task_finished( itt_sync_obj );
1804#endif /* USE_ITT_BUILD */
1805
1806 // Check to see if this thread can proceed.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001807 if (flag == NULL || (!final_spin && flag->done_check())) {
1808 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #3): T#%d spin condition satisfied\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001809 gtid) );
1810 return TRUE;
1811 }
1812
1813 KMP_YIELD( __kmp_library == library_throughput ); // Yield before executing next task
1814 // If the execution of the stolen task resulted in more tasks being
1815 // placed on our run queue, then restart the whole process.
1816 if (TCR_4(threads_data[ tid ].td.td_deque_ntasks) != 0) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001817 KA_TRACE(20, ("__kmp_execute_tasks_template: T#%d stolen task spawned other tasks, restart\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001818 gtid) );
1819 goto start;
1820 }
1821 }
1822
1823 // Don't give priority to stealing from this thread anymore.
1824 threads_data[ tid ].td.td_deque_last_stolen = -1;
1825
1826 // The victims's work queue is empty. If we are in the final spin loop
1827 // of the barrier, check and see if the termination condition is satisfied.
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001828#if OMP_41_ENABLED
1829 // The work queue may be empty but there might be proxy tasks still executing
1830 if (final_spin && TCR_4(current_task -> td_incomplete_child_tasks) == 0)
1831#else
1832 if (final_spin)
1833#endif
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001834 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001835 // First, decrement the #unfinished threads, if that has not already
1836 // been done. This decrement might be to the spin location, and
1837 // result in the termination condition being satisfied.
1838 if (! *thread_finished) {
Jonathan Peytone8104ad2015-06-08 18:56:33 +00001839 kmp_uint32 count;
1840
1841 count = KMP_TEST_THEN_DEC32( (kmp_int32 *)unfinished_threads ) - 1;
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001842 KA_TRACE(20, ("__kmp_execute_tasks_template(dec #2): T#%d dec unfinished_threads to %d "
Jim Cownie5e8470a2013-09-27 10:38:44 +00001843 "task_team=%p\n", gtid, count, task_team) );
1844 *thread_finished = TRUE;
1845 }
1846
1847 // If __kmp_tasking_mode != tskm_immediate_exec
1848 // then it is now unsafe to reference thread->th.th_team !!!
1849 // Decrementing task_team->tt.tt_unfinished_threads can allow the master
1850 // thread to pass through the barrier, where it might reset each thread's
1851 // th.th_team field for the next parallel region.
1852 // If we can steal more work, we know that this has not happened yet.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001853 if (flag != NULL && flag->done_check()) {
1854 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #4): T#%d spin condition satisfied\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001855 gtid) );
1856 return TRUE;
1857 }
1858 }
1859 }
1860
1861 // Find a different thread to steal work from. Pick a random thread.
1862 // My initial plan was to cycle through all the threads, and only return
1863 // if we tried to steal from every thread, and failed. Arch says that's
1864 // not such a great idea.
1865 // GEH - need yield code in this loop for throughput library mode?
1866 new_victim:
1867 k = __kmp_get_random( thread ) % (nthreads - 1);
1868 if ( k >= thread -> th.th_info.ds.ds_tid ) {
1869 ++k; // Adjusts random distribution to exclude self
1870 }
1871 {
1872 kmp_info_t *other_thread = threads_data[k].td.td_thr;
1873 int first;
1874
1875 // There is a slight chance that __kmp_enable_tasking() did not wake up
1876 // all threads waiting at the barrier. If this thread is sleeping, then
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001877 // wake it up. Since we were going to pay the cache miss penalty
1878 // for referencing another thread's kmp_info_t struct anyway, the check
Jim Cownie5e8470a2013-09-27 10:38:44 +00001879 // shouldn't cost too much performance at this point.
1880 // In extra barrier mode, tasks do not sleep at the separate tasking
1881 // barrier, so this isn't a problem.
1882 if ( ( __kmp_tasking_mode == tskm_task_teams ) &&
1883 (__kmp_dflt_blocktime != KMP_MAX_BLOCKTIME) &&
1884 (TCR_PTR(other_thread->th.th_sleep_loc) != NULL))
1885 {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001886 __kmp_null_resume_wrapper(__kmp_gtid_from_thread(other_thread), other_thread->th.th_sleep_loc);
Jim Cownie5e8470a2013-09-27 10:38:44 +00001887 // A sleeping thread should not have any tasks on it's queue.
Alp Toker8f2d3f02014-02-24 10:40:15 +00001888 // There is a slight possibility that it resumes, steals a task from
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001889 // another thread, which spawns more tasks, all in the time that it takes
Jim Cownie5e8470a2013-09-27 10:38:44 +00001890 // this thread to check => don't write an assertion that the victim's
1891 // queue is empty. Try stealing from a different thread.
1892 goto new_victim;
1893 }
1894
1895 // Now try to steal work from the selected thread
1896 first = TRUE;
1897 while ((task = __kmp_steal_task( other_thread, gtid, task_team, unfinished_threads,
1898 thread_finished, is_constrained )) != NULL)
1899 {
1900#if USE_ITT_BUILD && USE_ITT_NOTIFY
1901 if ( __itt_sync_create_ptr || KMP_ITT_DEBUG ) {
1902 if ( itt_sync_obj == NULL ) {
1903 // we are at fork barrier where we could not get the object reliably
1904 itt_sync_obj = __kmp_itt_barrier_object( gtid, bs_forkjoin_barrier );
1905 }
1906 __kmp_itt_task_starting( itt_sync_obj );
1907 }
1908#endif /* USE_ITT_BUILD && USE_ITT_NOTIFY */
1909 __kmp_invoke_task( gtid, task, current_task );
1910#if USE_ITT_BUILD
1911 if ( itt_sync_obj != NULL )
1912 __kmp_itt_task_finished( itt_sync_obj );
1913#endif /* USE_ITT_BUILD */
1914
1915 // Try stealing from this victim again, in the future.
1916 if (first) {
1917 threads_data[ tid ].td.td_deque_last_stolen = k;
1918 first = FALSE;
1919 }
1920
1921 // Check to see if this thread can proceed.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001922 if (flag == NULL || (!final_spin && flag->done_check())) {
1923 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #5): T#%d spin condition satisfied\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001924 gtid) );
1925 return TRUE;
1926 }
1927 KMP_YIELD( __kmp_library == library_throughput ); // Yield before executing next task
1928
1929 // If the execution of the stolen task resulted in more tasks being
1930 // placed on our run queue, then restart the whole process.
1931 if (TCR_4(threads_data[ tid ].td.td_deque_ntasks) != 0) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001932 KA_TRACE(20, ("__kmp_execute_tasks_template: T#%d stolen task spawned other tasks, restart\n",
Jim Cownie5e8470a2013-09-27 10:38:44 +00001933 gtid) );
1934 goto start;
1935 }
1936 }
1937
1938 // The victims's work queue is empty. If we are in the final spin loop
1939 // of the barrier, check and see if the termination condition is satisfied.
1940 // Going on and finding a new victim to steal from is expensive, as it
1941 // involves a lot of cache misses, so we definitely want to re-check the
1942 // termination condition before doing that.
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00001943#if OMP_41_ENABLED
1944 // The work queue may be empty but there might be proxy tasks still executing
1945 if (final_spin && TCR_4(current_task -> td_incomplete_child_tasks) == 0)
1946#else
1947 if (final_spin)
1948#endif
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00001949 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00001950 // First, decrement the #unfinished threads, if that has not already
1951 // been done. This decrement might be to the spin location, and
1952 // result in the termination condition being satisfied.
1953 if (! *thread_finished) {
Jonathan Peytone8104ad2015-06-08 18:56:33 +00001954 kmp_uint32 count;
1955
1956 count = KMP_TEST_THEN_DEC32( (kmp_int32 *)unfinished_threads ) - 1;
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001957 KA_TRACE(20, ("__kmp_execute_tasks_template(dec #3): T#%d dec unfinished_threads to %d; "
Jim Cownie5e8470a2013-09-27 10:38:44 +00001958 "task_team=%p\n",
1959 gtid, count, task_team) );
1960 *thread_finished = TRUE;
1961 }
1962
1963 // If __kmp_tasking_mode != tskm_immediate_exec,
1964 // then it is now unsafe to reference thread->th.th_team !!!
1965 // Decrementing task_team->tt.tt_unfinished_threads can allow the master
1966 // thread to pass through the barrier, where it might reset each thread's
1967 // th.th_team field for the next parallel region.
1968 // If we can steal more work, we know that this has not happened yet.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001969 if (flag != NULL && flag->done_check()) {
1970 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #6): T#%d spin condition satisfied\n", gtid) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001971 return TRUE;
1972 }
1973 }
1974 }
1975
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001976 KA_TRACE(15, ("__kmp_execute_tasks_template(exit #7): T#%d can't find work\n", gtid) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00001977 return FALSE;
1978}
1979
Jim Cownie4cc4bb42014-10-07 16:25:50 +00001980int __kmp_execute_tasks_32(kmp_info_t *thread, kmp_int32 gtid, kmp_flag_32 *flag, int final_spin,
1981 int *thread_finished
1982 USE_ITT_BUILD_ARG(void * itt_sync_obj), kmp_int32 is_constrained)
1983{
1984 return __kmp_execute_tasks_template(thread, gtid, flag, final_spin, thread_finished
1985 USE_ITT_BUILD_ARG(itt_sync_obj), is_constrained);
1986}
1987
1988int __kmp_execute_tasks_64(kmp_info_t *thread, kmp_int32 gtid, kmp_flag_64 *flag, int final_spin,
1989 int *thread_finished
1990 USE_ITT_BUILD_ARG(void * itt_sync_obj), kmp_int32 is_constrained)
1991{
1992 return __kmp_execute_tasks_template(thread, gtid, flag, final_spin, thread_finished
1993 USE_ITT_BUILD_ARG(itt_sync_obj), is_constrained);
1994}
1995
1996int __kmp_execute_tasks_oncore(kmp_info_t *thread, kmp_int32 gtid, kmp_flag_oncore *flag, int final_spin,
1997 int *thread_finished
1998 USE_ITT_BUILD_ARG(void * itt_sync_obj), kmp_int32 is_constrained)
1999{
2000 return __kmp_execute_tasks_template(thread, gtid, flag, final_spin, thread_finished
2001 USE_ITT_BUILD_ARG(itt_sync_obj), is_constrained);
2002}
2003
2004
Jim Cownie5e8470a2013-09-27 10:38:44 +00002005
2006//-----------------------------------------------------------------------------
2007// __kmp_enable_tasking: Allocate task team and resume threads sleeping at the
2008// next barrier so they can assist in executing enqueued tasks.
2009// First thread in allocates the task team atomically.
2010
2011static void
2012__kmp_enable_tasking( kmp_task_team_t *task_team, kmp_info_t *this_thr )
2013{
Jim Cownie5e8470a2013-09-27 10:38:44 +00002014 kmp_thread_data_t *threads_data;
2015 int nthreads, i, is_init_thread;
2016
2017 KA_TRACE( 10, ( "__kmp_enable_tasking(enter): T#%d\n",
2018 __kmp_gtid_from_thread( this_thr ) ) );
2019
2020 KMP_DEBUG_ASSERT(task_team != NULL);
Jonathan Peytonfe9a1d72015-08-26 19:58:48 +00002021 KMP_DEBUG_ASSERT(this_thr->th.th_team != NULL);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002022
2023 nthreads = task_team->tt.tt_nproc;
2024 KMP_DEBUG_ASSERT(nthreads > 0);
Jonathan Peytonfe9a1d72015-08-26 19:58:48 +00002025 KMP_DEBUG_ASSERT(nthreads == this_thr->th.th_team->t.t_nproc);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002026
2027 // Allocate or increase the size of threads_data if necessary
2028 is_init_thread = __kmp_realloc_task_threads_data( this_thr, task_team );
2029
2030 if (!is_init_thread) {
2031 // Some other thread already set up the array.
2032 KA_TRACE( 20, ( "__kmp_enable_tasking(exit): T#%d: threads array already set up.\n",
2033 __kmp_gtid_from_thread( this_thr ) ) );
2034 return;
2035 }
2036 threads_data = (kmp_thread_data_t *)TCR_PTR(task_team -> tt.tt_threads_data);
2037 KMP_DEBUG_ASSERT( threads_data != NULL );
2038
2039 if ( ( __kmp_tasking_mode == tskm_task_teams ) &&
2040 ( __kmp_dflt_blocktime != KMP_MAX_BLOCKTIME ) )
2041 {
2042 // Release any threads sleeping at the barrier, so that they can steal
2043 // tasks and execute them. In extra barrier mode, tasks do not sleep
2044 // at the separate tasking barrier, so this isn't a problem.
2045 for (i = 0; i < nthreads; i++) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002046 volatile void *sleep_loc;
Jim Cownie5e8470a2013-09-27 10:38:44 +00002047 kmp_info_t *thread = threads_data[i].td.td_thr;
2048
2049 if (i == this_thr->th.th_info.ds.ds_tid) {
2050 continue;
2051 }
2052 // Since we haven't locked the thread's suspend mutex lock at this
2053 // point, there is a small window where a thread might be putting
2054 // itself to sleep, but hasn't set the th_sleep_loc field yet.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002055 // To work around this, __kmp_execute_tasks_template() periodically checks
Jim Cownie5e8470a2013-09-27 10:38:44 +00002056 // see if other threads are sleeping (using the same random
2057 // mechanism that is used for task stealing) and awakens them if
2058 // they are.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002059 if ( ( sleep_loc = TCR_PTR( thread -> th.th_sleep_loc) ) != NULL )
Jim Cownie5e8470a2013-09-27 10:38:44 +00002060 {
2061 KF_TRACE( 50, ( "__kmp_enable_tasking: T#%d waking up thread T#%d\n",
2062 __kmp_gtid_from_thread( this_thr ),
2063 __kmp_gtid_from_thread( thread ) ) );
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002064 __kmp_null_resume_wrapper(__kmp_gtid_from_thread(thread), sleep_loc);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002065 }
2066 else {
2067 KF_TRACE( 50, ( "__kmp_enable_tasking: T#%d don't wake up thread T#%d\n",
2068 __kmp_gtid_from_thread( this_thr ),
2069 __kmp_gtid_from_thread( thread ) ) );
2070 }
2071 }
2072 }
2073
2074 KA_TRACE( 10, ( "__kmp_enable_tasking(exit): T#%d\n",
2075 __kmp_gtid_from_thread( this_thr ) ) );
2076}
2077
2078
2079/* ------------------------------------------------------------------------ */
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002080/* // TODO: Check the comment consistency
Jim Cownie5e8470a2013-09-27 10:38:44 +00002081 * Utility routines for "task teams". A task team (kmp_task_t) is kind of
2082 * like a shadow of the kmp_team_t data struct, with a different lifetime.
2083 * After a child * thread checks into a barrier and calls __kmp_release() from
2084 * the particular variant of __kmp_<barrier_kind>_barrier_gather(), it can no
2085 * longer assume that the kmp_team_t structure is intact (at any moment, the
2086 * master thread may exit the barrier code and free the team data structure,
2087 * and return the threads to the thread pool).
2088 *
2089 * This does not work with the the tasking code, as the thread is still
2090 * expected to participate in the execution of any tasks that may have been
2091 * spawned my a member of the team, and the thread still needs access to all
2092 * to each thread in the team, so that it can steal work from it.
2093 *
2094 * Enter the existence of the kmp_task_team_t struct. It employs a reference
2095 * counting mechanims, and is allocated by the master thread before calling
2096 * __kmp_<barrier_kind>_release, and then is release by the last thread to
2097 * exit __kmp_<barrier_kind>_release at the next barrier. I.e. the lifetimes
2098 * of the kmp_task_team_t structs for consecutive barriers can overlap
2099 * (and will, unless the master thread is the last thread to exit the barrier
2100 * release phase, which is not typical).
2101 *
2102 * The existence of such a struct is useful outside the context of tasking,
2103 * but for now, I'm trying to keep it specific to the OMP_30_ENABLED macro,
2104 * so that any performance differences show up when comparing the 2.5 vs. 3.0
2105 * libraries.
2106 *
2107 * We currently use the existence of the threads array as an indicator that
2108 * tasks were spawned since the last barrier. If the structure is to be
2109 * useful outside the context of tasking, then this will have to change, but
2110 * not settting the field minimizes the performance impact of tasking on
2111 * barriers, when no explicit tasks were spawned (pushed, actually).
2112 */
2113
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002114
Jim Cownie5e8470a2013-09-27 10:38:44 +00002115static kmp_task_team_t *__kmp_free_task_teams = NULL; // Free list for task_team data structures
2116// Lock for task team data structures
2117static kmp_bootstrap_lock_t __kmp_task_team_lock = KMP_BOOTSTRAP_LOCK_INITIALIZER( __kmp_task_team_lock );
2118
2119
2120//------------------------------------------------------------------------------
2121// __kmp_alloc_task_deque:
2122// Allocates a task deque for a particular thread, and initialize the necessary
2123// data structures relating to the deque. This only happens once per thread
2124// per task team since task teams are recycled.
2125// No lock is needed during allocation since each thread allocates its own
2126// deque.
2127
2128static void
2129__kmp_alloc_task_deque( kmp_info_t *thread, kmp_thread_data_t *thread_data )
2130{
2131 __kmp_init_bootstrap_lock( & thread_data -> td.td_deque_lock );
2132 KMP_DEBUG_ASSERT( thread_data -> td.td_deque == NULL );
2133
2134 // Initialize last stolen task field to "none"
2135 thread_data -> td.td_deque_last_stolen = -1;
2136
2137 KMP_DEBUG_ASSERT( TCR_4(thread_data -> td.td_deque_ntasks) == 0 );
2138 KMP_DEBUG_ASSERT( thread_data -> td.td_deque_head == 0 );
2139 KMP_DEBUG_ASSERT( thread_data -> td.td_deque_tail == 0 );
2140
2141 KE_TRACE( 10, ( "__kmp_alloc_task_deque: T#%d allocating deque[%d] for thread_data %p\n",
2142 __kmp_gtid_from_thread( thread ), TASK_DEQUE_SIZE, thread_data ) );
2143 // Allocate space for task deque, and zero the deque
2144 // Cannot use __kmp_thread_calloc() because threads not around for
2145 // kmp_reap_task_team( ).
2146 thread_data -> td.td_deque = (kmp_taskdata_t **)
2147 __kmp_allocate( TASK_DEQUE_SIZE * sizeof(kmp_taskdata_t *));
2148}
2149
2150
2151//------------------------------------------------------------------------------
2152// __kmp_free_task_deque:
2153// Deallocates a task deque for a particular thread.
2154// Happens at library deallocation so don't need to reset all thread data fields.
2155
2156static void
2157__kmp_free_task_deque( kmp_thread_data_t *thread_data )
2158{
2159 __kmp_acquire_bootstrap_lock( & thread_data -> td.td_deque_lock );
2160
2161 if ( thread_data -> td.td_deque != NULL ) {
2162 TCW_4(thread_data -> td.td_deque_ntasks, 0);
2163 __kmp_free( thread_data -> td.td_deque );
2164 thread_data -> td.td_deque = NULL;
2165 }
2166 __kmp_release_bootstrap_lock( & thread_data -> td.td_deque_lock );
2167
2168#ifdef BUILD_TIED_TASK_STACK
2169 // GEH: Figure out what to do here for td_susp_tied_tasks
2170 if ( thread_data -> td.td_susp_tied_tasks.ts_entries != TASK_STACK_EMPTY ) {
2171 __kmp_free_task_stack( __kmp_thread_from_gtid( gtid ), thread_data );
2172 }
2173#endif // BUILD_TIED_TASK_STACK
2174}
2175
2176
2177//------------------------------------------------------------------------------
2178// __kmp_realloc_task_threads_data:
2179// Allocates a threads_data array for a task team, either by allocating an initial
2180// array or enlarging an existing array. Only the first thread to get the lock
2181// allocs or enlarges the array and re-initializes the array eleemnts.
2182// That thread returns "TRUE", the rest return "FALSE".
2183// Assumes that the new array size is given by task_team -> tt.tt_nproc.
2184// The current size is given by task_team -> tt.tt_max_threads.
2185
2186static int
2187__kmp_realloc_task_threads_data( kmp_info_t *thread, kmp_task_team_t *task_team )
2188{
2189 kmp_thread_data_t ** threads_data_p;
2190 kmp_int32 nthreads, maxthreads;
2191 int is_init_thread = FALSE;
2192
2193 if ( TCR_4(task_team -> tt.tt_found_tasks) ) {
2194 // Already reallocated and initialized.
2195 return FALSE;
2196 }
2197
2198 threads_data_p = & task_team -> tt.tt_threads_data;
2199 nthreads = task_team -> tt.tt_nproc;
2200 maxthreads = task_team -> tt.tt_max_threads;
2201
2202 // All threads must lock when they encounter the first task of the implicit task
2203 // region to make sure threads_data fields are (re)initialized before used.
2204 __kmp_acquire_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2205
2206 if ( ! TCR_4(task_team -> tt.tt_found_tasks) ) {
2207 // first thread to enable tasking
2208 kmp_team_t *team = thread -> th.th_team;
2209 int i;
2210
2211 is_init_thread = TRUE;
2212 if ( maxthreads < nthreads ) {
2213
2214 if ( *threads_data_p != NULL ) {
2215 kmp_thread_data_t *old_data = *threads_data_p;
2216 kmp_thread_data_t *new_data = NULL;
2217
2218 KE_TRACE( 10, ( "__kmp_realloc_task_threads_data: T#%d reallocating "
2219 "threads data for task_team %p, new_size = %d, old_size = %d\n",
2220 __kmp_gtid_from_thread( thread ), task_team,
2221 nthreads, maxthreads ) );
2222 // Reallocate threads_data to have more elements than current array
2223 // Cannot use __kmp_thread_realloc() because threads not around for
2224 // kmp_reap_task_team( ). Note all new array entries are initialized
2225 // to zero by __kmp_allocate().
2226 new_data = (kmp_thread_data_t *)
2227 __kmp_allocate( nthreads * sizeof(kmp_thread_data_t) );
2228 // copy old data to new data
Andrey Churbanov74bf17b2015-04-02 13:27:08 +00002229 KMP_MEMCPY_S( (void *) new_data, nthreads * sizeof(kmp_thread_data_t),
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00002230 (void *) old_data,
2231 maxthreads * sizeof(kmp_taskdata_t *) );
Jim Cownie5e8470a2013-09-27 10:38:44 +00002232
2233#ifdef BUILD_TIED_TASK_STACK
2234 // GEH: Figure out if this is the right thing to do
2235 for (i = maxthreads; i < nthreads; i++) {
2236 kmp_thread_data_t *thread_data = & (*threads_data_p)[i];
2237 __kmp_init_task_stack( __kmp_gtid_from_thread( thread ), thread_data );
2238 }
2239#endif // BUILD_TIED_TASK_STACK
2240 // Install the new data and free the old data
2241 (*threads_data_p) = new_data;
2242 __kmp_free( old_data );
2243 }
2244 else {
2245 KE_TRACE( 10, ( "__kmp_realloc_task_threads_data: T#%d allocating "
2246 "threads data for task_team %p, size = %d\n",
2247 __kmp_gtid_from_thread( thread ), task_team, nthreads ) );
2248 // Make the initial allocate for threads_data array, and zero entries
2249 // Cannot use __kmp_thread_calloc() because threads not around for
2250 // kmp_reap_task_team( ).
2251 *threads_data_p = (kmp_thread_data_t *)
2252 __kmp_allocate( nthreads * sizeof(kmp_thread_data_t) );
2253#ifdef BUILD_TIED_TASK_STACK
2254 // GEH: Figure out if this is the right thing to do
2255 for (i = 0; i < nthreads; i++) {
2256 kmp_thread_data_t *thread_data = & (*threads_data_p)[i];
2257 __kmp_init_task_stack( __kmp_gtid_from_thread( thread ), thread_data );
2258 }
2259#endif // BUILD_TIED_TASK_STACK
2260 }
2261 task_team -> tt.tt_max_threads = nthreads;
2262 }
2263 else {
2264 // If array has (more than) enough elements, go ahead and use it
2265 KMP_DEBUG_ASSERT( *threads_data_p != NULL );
2266 }
2267
2268 // initialize threads_data pointers back to thread_info structures
2269 for (i = 0; i < nthreads; i++) {
2270 kmp_thread_data_t *thread_data = & (*threads_data_p)[i];
2271 thread_data -> td.td_thr = team -> t.t_threads[i];
2272
2273 if ( thread_data -> td.td_deque_last_stolen >= nthreads) {
2274 // The last stolen field survives across teams / barrier, and the number
2275 // of threads may have changed. It's possible (likely?) that a new
2276 // parallel region will exhibit the same behavior as the previous region.
2277 thread_data -> td.td_deque_last_stolen = -1;
2278 }
2279 }
2280
2281 KMP_MB();
2282 TCW_SYNC_4(task_team -> tt.tt_found_tasks, TRUE);
2283 }
2284
2285 __kmp_release_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2286 return is_init_thread;
2287}
2288
2289
2290//------------------------------------------------------------------------------
2291// __kmp_free_task_threads_data:
2292// Deallocates a threads_data array for a task team, including any attached
2293// tasking deques. Only occurs at library shutdown.
2294
2295static void
2296__kmp_free_task_threads_data( kmp_task_team_t *task_team )
2297{
2298 __kmp_acquire_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2299 if ( task_team -> tt.tt_threads_data != NULL ) {
2300 int i;
2301 for (i = 0; i < task_team->tt.tt_max_threads; i++ ) {
2302 __kmp_free_task_deque( & task_team -> tt.tt_threads_data[i] );
2303 }
2304 __kmp_free( task_team -> tt.tt_threads_data );
2305 task_team -> tt.tt_threads_data = NULL;
2306 }
2307 __kmp_release_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2308}
2309
2310
2311//------------------------------------------------------------------------------
2312// __kmp_allocate_task_team:
2313// Allocates a task team associated with a specific team, taking it from
2314// the global task team free list if possible. Also initializes data structures.
2315
2316static kmp_task_team_t *
2317__kmp_allocate_task_team( kmp_info_t *thread, kmp_team_t *team )
2318{
2319 kmp_task_team_t *task_team = NULL;
2320 int nthreads;
2321
2322 KA_TRACE( 20, ( "__kmp_allocate_task_team: T#%d entering; team = %p\n",
2323 (thread ? __kmp_gtid_from_thread( thread ) : -1), team ) );
2324
2325 if (TCR_PTR(__kmp_free_task_teams) != NULL) {
2326 // Take a task team from the task team pool
2327 __kmp_acquire_bootstrap_lock( &__kmp_task_team_lock );
2328 if (__kmp_free_task_teams != NULL) {
2329 task_team = __kmp_free_task_teams;
2330 TCW_PTR(__kmp_free_task_teams, task_team -> tt.tt_next);
2331 task_team -> tt.tt_next = NULL;
2332 }
2333 __kmp_release_bootstrap_lock( &__kmp_task_team_lock );
2334 }
2335
2336 if (task_team == NULL) {
2337 KE_TRACE( 10, ( "__kmp_allocate_task_team: T#%d allocating "
2338 "task team for team %p\n",
2339 __kmp_gtid_from_thread( thread ), team ) );
2340 // Allocate a new task team if one is not available.
2341 // Cannot use __kmp_thread_malloc() because threads not around for
2342 // kmp_reap_task_team( ).
2343 task_team = (kmp_task_team_t *) __kmp_allocate( sizeof(kmp_task_team_t) );
2344 __kmp_init_bootstrap_lock( & task_team -> tt.tt_threads_lock );
2345 //task_team -> tt.tt_threads_data = NULL; // AC: __kmp_allocate zeroes returned memory
2346 //task_team -> tt.tt_max_threads = 0;
2347 //task_team -> tt.tt_next = NULL;
2348 }
2349
2350 TCW_4(task_team -> tt.tt_found_tasks, FALSE);
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002351#if OMP_41_ENABLED
2352 TCW_4(task_team -> tt.tt_found_proxy_tasks, FALSE);
2353#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00002354 task_team -> tt.tt_nproc = nthreads = team->t.t_nproc;
2355
Jim Cownie5e8470a2013-09-27 10:38:44 +00002356 TCW_4( task_team -> tt.tt_unfinished_threads, nthreads );
2357 TCW_4( task_team -> tt.tt_active, TRUE );
2358 TCW_4( task_team -> tt.tt_ref_ct, nthreads - 1);
2359
2360 KA_TRACE( 20, ( "__kmp_allocate_task_team: T#%d exiting; task_team = %p\n",
2361 (thread ? __kmp_gtid_from_thread( thread ) : -1), task_team ) );
2362 return task_team;
2363}
2364
2365
2366//------------------------------------------------------------------------------
2367// __kmp_free_task_team:
2368// Frees the task team associated with a specific thread, and adds it
2369// to the global task team free list.
2370//
2371
2372static void
2373__kmp_free_task_team( kmp_info_t *thread, kmp_task_team_t *task_team )
2374{
2375 KA_TRACE( 20, ( "__kmp_free_task_team: T#%d task_team = %p\n",
2376 thread ? __kmp_gtid_from_thread( thread ) : -1, task_team ) );
2377
2378 KMP_DEBUG_ASSERT( TCR_4(task_team -> tt.tt_ref_ct) == 0 );
2379
2380 // Put task team back on free list
2381 __kmp_acquire_bootstrap_lock( & __kmp_task_team_lock );
2382
2383 KMP_DEBUG_ASSERT( task_team -> tt.tt_next == NULL );
2384 task_team -> tt.tt_next = __kmp_free_task_teams;
2385 TCW_4(task_team -> tt.tt_found_tasks, FALSE);
2386 TCW_PTR(__kmp_free_task_teams, task_team);
2387
2388 __kmp_release_bootstrap_lock( & __kmp_task_team_lock );
2389}
2390
2391
2392//------------------------------------------------------------------------------
2393// __kmp_reap_task_teams:
2394// Free all the task teams on the task team free list.
2395// Should only be done during library shutdown.
2396// Cannot do anything that needs a thread structure or gtid since they are already gone.
2397
2398void
2399__kmp_reap_task_teams( void )
2400{
2401 kmp_task_team_t *task_team;
2402
2403 if ( TCR_PTR(__kmp_free_task_teams) != NULL ) {
2404 // Free all task_teams on the free list
2405 __kmp_acquire_bootstrap_lock( &__kmp_task_team_lock );
2406 while ( ( task_team = __kmp_free_task_teams ) != NULL ) {
2407 __kmp_free_task_teams = task_team -> tt.tt_next;
2408 task_team -> tt.tt_next = NULL;
2409
2410 // Free threads_data if necessary
2411 if ( task_team -> tt.tt_threads_data != NULL ) {
2412 __kmp_free_task_threads_data( task_team );
2413 }
2414 __kmp_free( task_team );
2415 }
2416 __kmp_release_bootstrap_lock( &__kmp_task_team_lock );
2417 }
2418}
2419
2420
2421//------------------------------------------------------------------------------
2422// __kmp_unref_task_teams:
2423// Remove one thread from referencing the task team structure by
2424// decreasing the reference count and deallocate task team if no more
2425// references to it.
2426//
2427void
2428__kmp_unref_task_team( kmp_task_team_t *task_team, kmp_info_t *thread )
2429{
2430 kmp_uint ref_ct;
2431
2432 ref_ct = KMP_TEST_THEN_DEC32( (kmp_int32 *)(& task_team->tt.tt_ref_ct) ) - 1;
2433
2434 KA_TRACE( 20, ( "__kmp_unref_task_team: T#%d task_team = %p ref_ct = %d\n",
2435 __kmp_gtid_from_thread( thread ), task_team, ref_ct ) );
2436
2437
2438 if ( ref_ct == 0 ) {
2439 __kmp_free_task_team( thread, task_team );
2440 }
2441
2442 TCW_PTR( *((volatile kmp_task_team_t **)(&thread->th.th_task_team)), NULL );
2443}
2444
2445
2446//------------------------------------------------------------------------------
2447// __kmp_wait_to_unref_task_teams:
2448// Some threads could still be in the fork barrier release code, possibly
2449// trying to steal tasks. Wait for each thread to unreference its task team.
2450//
2451void
2452__kmp_wait_to_unref_task_teams(void)
2453{
2454 kmp_info_t *thread;
2455 kmp_uint32 spins;
2456 int done;
2457
2458 KMP_INIT_YIELD( spins );
2459
2460
2461 for (;;) {
2462 done = TRUE;
2463
2464 // TODO: GEH - this may be is wrong because some sync would be necessary
2465 // in case threads are added to the pool during the traversal.
2466 // Need to verify that lock for thread pool is held when calling
2467 // this routine.
2468 for (thread = (kmp_info_t *)__kmp_thread_pool;
2469 thread != NULL;
2470 thread = thread->th.th_next_pool)
2471 {
Jim Cownie5e8470a2013-09-27 10:38:44 +00002472#if KMP_OS_WINDOWS
2473 DWORD exit_val;
2474#endif
2475 if ( TCR_PTR(thread->th.th_task_team) == NULL ) {
2476 KA_TRACE( 10, ("__kmp_wait_to_unref_task_team: T#%d task_team == NULL\n",
2477 __kmp_gtid_from_thread( thread ) ) );
2478 continue;
2479 }
2480#if KMP_OS_WINDOWS
2481 // TODO: GEH - add this check for Linux* OS / OS X* as well?
2482 if (!__kmp_is_thread_alive(thread, &exit_val)) {
2483 if (TCR_PTR(thread->th.th_task_team) != NULL) {
2484 __kmp_unref_task_team( thread->th.th_task_team, thread );
2485 }
2486 continue;
2487 }
2488#endif
2489
2490 done = FALSE; // Because th_task_team pointer is not NULL for this thread
2491
2492 KA_TRACE( 10, ("__kmp_wait_to_unref_task_team: Waiting for T#%d to unreference task_team\n",
2493 __kmp_gtid_from_thread( thread ) ) );
2494
2495 if ( __kmp_dflt_blocktime != KMP_MAX_BLOCKTIME ) {
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002496 volatile void *sleep_loc;
Jim Cownie5e8470a2013-09-27 10:38:44 +00002497 // If the thread is sleeping, awaken it.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002498 if ( ( sleep_loc = TCR_PTR( thread->th.th_sleep_loc) ) != NULL ) {
Jim Cownie5e8470a2013-09-27 10:38:44 +00002499 KA_TRACE( 10, ( "__kmp_wait_to_unref_task_team: T#%d waking up thread T#%d\n",
2500 __kmp_gtid_from_thread( thread ), __kmp_gtid_from_thread( thread ) ) );
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002501 __kmp_null_resume_wrapper(__kmp_gtid_from_thread(thread), sleep_loc);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002502 }
2503 }
2504 }
2505 if (done) {
2506 break;
2507 }
2508
2509 // If we are oversubscribed,
2510 // or have waited a bit (and library mode is throughput), yield.
2511 // Pause is in the following code.
2512 KMP_YIELD( TCR_4(__kmp_nth) > __kmp_avail_proc );
2513 KMP_YIELD_SPIN( spins ); // Yields only if KMP_LIBRARY=throughput
2514 }
2515
2516
2517}
2518
2519
2520//------------------------------------------------------------------------------
2521// __kmp_task_team_setup: Create a task_team for the current team, but use
2522// an already created, unused one if it already exists.
2523// This may be called by any thread, but only for teams with # threads >1.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002524void
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002525__kmp_task_team_setup( kmp_info_t *this_thr, kmp_team_t *team, int both, int always )
Jim Cownie5e8470a2013-09-27 10:38:44 +00002526{
2527 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
2528
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002529 if ( ( team->t.t_task_team[this_thr->th.th_task_state] == NULL ) && ( always || team->t.t_nproc > 1 ) ) {
Jim Cownie5e8470a2013-09-27 10:38:44 +00002530 // Allocate a new task team, which will be propagated to
2531 // all of the worker threads after the barrier. As they
2532 // spin in the barrier release phase, then will continue
2533 // to use the previous task team struct, until they receive
2534 // the signal to stop checking for tasks (they can't safely
2535 // reference the kmp_team_t struct, which could be reallocated
2536 // by the master thread).
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002537 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 +00002538 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 +00002539 __kmp_gtid_from_thread(this_thr), team->t.t_task_team[this_thr->th.th_task_state],
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002540 ((team != NULL) ? team->t.t_id : -1), this_thr->th.th_task_state));
Jim Cownie5e8470a2013-09-27 10:38:44 +00002541 }
Jonathan Peytona0e159f2015-10-08 18:23:38 +00002542 // else: Either all threads have reported in, and no tasks were spawned for this release->gather region
2543 // Leave the old task team struct in place for the upcoming region.
2544 // No task teams are formed for serialized teams.
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002545 if (both) {
2546 int other_team = 1 - this_thr->th.th_task_state;
2547 if ( ( team->t.t_task_team[other_team] == NULL ) && ( team->t.t_nproc > 1 ) ) { // setup other team as well
2548 team->t.t_task_team[other_team] = __kmp_allocate_task_team( this_thr, team );
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002549 KA_TRACE(20, ("__kmp_task_team_setup: Master T#%d created second new task_team %p for team %d at parity=%d\n",
2550 __kmp_gtid_from_thread( this_thr ), team->t.t_task_team[other_team],
2551 ((team != NULL) ? team->t.t_id : -1), other_team ));
2552 }
Jim Cownie5e8470a2013-09-27 10:38:44 +00002553 }
2554}
2555
2556
2557//------------------------------------------------------------------------------
2558// __kmp_task_team_sync: Propagation of task team data from team to threads
2559// which happens just after the release phase of a team barrier. This may be
2560// called by any thread, but only for teams with # threads > 1.
2561
2562void
2563__kmp_task_team_sync( kmp_info_t *this_thr, kmp_team_t *team )
2564{
2565 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
2566
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002567 // In case this thread never saw that the task team was no longer active, unref/deallocate it now.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002568 if ( this_thr->th.th_task_team != NULL ) {
2569 if ( ! TCR_SYNC_4( this_thr->th.th_task_team->tt.tt_active ) ) {
2570 KMP_DEBUG_ASSERT( ! KMP_MASTER_TID( __kmp_tid_from_gtid( __kmp_gtid_from_thread( this_thr ) ) ) );
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002571 KA_TRACE(20, ("__kmp_task_team_sync: Thread T#%d task team (%p)is not active, unrefing\n",
2572 __kmp_gtid_from_thread( this_thr ), this_thr->th.th_task_team));
Jim Cownie5e8470a2013-09-27 10:38:44 +00002573 __kmp_unref_task_team( this_thr->th.th_task_team, this_thr );
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002574 }
2575#if KMP_DEBUG
2576 else { // We are re-using a task team that was never enabled.
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002577 KMP_DEBUG_ASSERT(this_thr->th.th_task_team == team->t.t_task_team[this_thr->th.th_task_state]);
Jim Cownie5e8470a2013-09-27 10:38:44 +00002578 }
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002579#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00002580 }
2581
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002582 // Toggle the th_task_state field, to switch which task_team this thread refers to
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002583 this_thr->th.th_task_state = 1 - this_thr->th.th_task_state;
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002584 // It is now safe to propagate the task team pointer from the team struct to the current thread.
2585 TCW_PTR(this_thr->th.th_task_team, team->t.t_task_team[this_thr->th.th_task_state]);
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002586 KA_TRACE(20, ("__kmp_task_team_sync: Thread T#%d task team switched to %p from Team #%d task team (parity=%d)\n",
2587 __kmp_gtid_from_thread( this_thr ), this_thr->th.th_task_team,
2588 ((team != NULL) ? team->t.t_id : -1), this_thr->th.th_task_state));
Jim Cownie5e8470a2013-09-27 10:38:44 +00002589}
2590
2591
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00002592//--------------------------------------------------------------------------------------------
2593// __kmp_task_team_wait: Master thread waits for outstanding tasks after the barrier gather
2594// phase. Only called by master thread if #threads in team > 1 or if proxy tasks were created
Jim Cownie5e8470a2013-09-27 10:38:44 +00002595void
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002596__kmp_task_team_wait( kmp_info_t *this_thr, kmp_team_t *team
Jim Cownie181b4bb2013-12-23 17:28:57 +00002597 USE_ITT_BUILD_ARG(void * itt_sync_obj)
Jim Cownie5e8470a2013-09-27 10:38:44 +00002598 )
2599{
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002600 kmp_task_team_t *task_team = team->t.t_task_team[this_thr->th.th_task_state];
Jim Cownie5e8470a2013-09-27 10:38:44 +00002601
2602 KMP_DEBUG_ASSERT( __kmp_tasking_mode != tskm_immediate_exec );
2603 KMP_DEBUG_ASSERT( task_team == this_thr->th.th_task_team );
2604
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002605 if ( ( task_team != NULL ) && KMP_TASKING_ENABLED(task_team) ) {
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002606 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",
2607 __kmp_gtid_from_thread(this_thr), task_team));
2608 // Worker threads may have dropped through to release phase, but could still be executing tasks. Wait
2609 // here for tasks to complete. To avoid memory contention, only master thread checks termination condition.
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002610 kmp_flag_32 flag(&task_team->tt.tt_unfinished_threads, 0U);
2611 flag.wait(this_thr, TRUE
2612 USE_ITT_BUILD_ARG(itt_sync_obj));
Jim Cownie5e8470a2013-09-27 10:38:44 +00002613
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002614 // Kill the old task team, so that the worker threads will stop referencing it while spinning.
2615 // They will deallocate it when the reference count reaches zero.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002616 // The master thread is not included in the ref count.
Jonathan Peytone03b62f2015-10-08 18:49:40 +00002617 KA_TRACE(20, ("__kmp_task_team_wait: Master T#%d deactivating task_team %p: setting active to false, setting local and team's pointer to NULL\n",
2618 __kmp_gtid_from_thread(this_thr), task_team));
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002619#if OMP_41_ENABLED
2620 KMP_DEBUG_ASSERT( task_team->tt.tt_nproc > 1 || task_team->tt.tt_found_proxy_tasks == TRUE );
2621 TCW_SYNC_4( task_team->tt.tt_found_proxy_tasks, FALSE );
2622#else
Jim Cownie5e8470a2013-09-27 10:38:44 +00002623 KMP_DEBUG_ASSERT( task_team->tt.tt_nproc > 1 );
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002624#endif
Jim Cownie5e8470a2013-09-27 10:38:44 +00002625 TCW_SYNC_4( task_team->tt.tt_active, FALSE );
2626 KMP_MB();
2627
2628 TCW_PTR(this_thr->th.th_task_team, NULL);
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002629 team->t.t_task_team[this_thr->th.th_task_state] = NULL;
Jim Cownie5e8470a2013-09-27 10:38:44 +00002630 }
2631}
2632
2633
2634//------------------------------------------------------------------------------
2635// __kmp_tasking_barrier:
Jonathan Peyton1bd61b42015-10-08 19:44:16 +00002636// This routine may only called when __kmp_tasking_mode == tskm_extra_barrier.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002637// Internal function to execute all tasks prior to a regular barrier or a
2638// join barrier. It is a full barrier itself, which unfortunately turns
2639// regular barriers into double barriers and join barriers into 1 1/2
2640// barriers.
Jim Cownie5e8470a2013-09-27 10:38:44 +00002641void
2642__kmp_tasking_barrier( kmp_team_t *team, kmp_info_t *thread, int gtid )
2643{
Andrey Churbanov6d224db2015-02-10 18:37:43 +00002644 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 +00002645 int flag = FALSE;
2646 KMP_DEBUG_ASSERT( __kmp_tasking_mode == tskm_extra_barrier );
2647
2648#if USE_ITT_BUILD
2649 KMP_FSYNC_SPIN_INIT( spin, (kmp_uint32*) NULL );
2650#endif /* USE_ITT_BUILD */
Jim Cownie4cc4bb42014-10-07 16:25:50 +00002651 kmp_flag_32 spin_flag(spin, 0U);
2652 while (! spin_flag.execute_tasks(thread, gtid, TRUE, &flag
2653 USE_ITT_BUILD_ARG(NULL), 0 ) ) {
Jim Cownie5e8470a2013-09-27 10:38:44 +00002654#if USE_ITT_BUILD
2655 // TODO: What about itt_sync_obj??
2656 KMP_FSYNC_SPIN_PREPARE( spin );
2657#endif /* USE_ITT_BUILD */
2658
2659 if( TCR_4(__kmp_global.g.g_done) ) {
2660 if( __kmp_global.g.g_abort )
2661 __kmp_abort_thread( );
2662 break;
2663 }
2664 KMP_YIELD( TRUE ); // GH: We always yield here
2665 }
2666#if USE_ITT_BUILD
2667 KMP_FSYNC_SPIN_ACQUIRED( (void*) spin );
2668#endif /* USE_ITT_BUILD */
2669}
2670
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002671
2672#if OMP_41_ENABLED
2673
2674/* __kmp_give_task puts a task into a given thread queue if:
2675 - the queue for that thread it was created
2676 - there's space in that queue
2677
2678 Because of this, __kmp_push_task needs to check if there's space after getting the lock
2679 */
2680static bool __kmp_give_task ( kmp_info_t *thread, kmp_int32 tid, kmp_task_t * task )
2681{
2682 kmp_task_team_t * task_team = thread->th.th_task_team;
2683 kmp_thread_data_t * thread_data = & task_team -> tt.tt_threads_data[ tid ];
2684 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
2685 bool result = false;
2686
2687 KA_TRACE(20, ("__kmp_give_task: trying to give task %p to thread %d.\n", taskdata, tid ) );
2688
2689 // assert tasking is enabled? what if not?
2690 KMP_DEBUG_ASSERT( task_team != NULL );
2691
2692 if (thread_data -> td.td_deque == NULL ) {
2693 // There's no queue in this thread, go find another one
2694 // We're guaranteed that at least one thread has a queue
2695 KA_TRACE(30, ("__kmp_give_task: thread %d has no queue while giving task %p.\n", tid, taskdata ) );
2696 return result;
2697 }
2698
2699 if ( TCR_4(thread_data -> td.td_deque_ntasks) >= TASK_DEQUE_SIZE )
2700 {
2701 KA_TRACE(30, ("__kmp_give_task: queue is full while giving task %p to thread %d.\n", taskdata, tid ) );
2702 return result;
2703 }
2704
2705 __kmp_acquire_bootstrap_lock( & thread_data-> td.td_deque_lock );
2706
2707 if ( TCR_4(thread_data -> td.td_deque_ntasks) >= TASK_DEQUE_SIZE )
2708 {
2709 KA_TRACE(30, ("__kmp_give_task: queue is full while giving task %p to thread %d.\n", taskdata, tid ) );
2710 goto release_and_exit;
2711 }
2712
2713 thread_data -> td.td_deque[ thread_data -> td.td_deque_tail ] = taskdata;
2714 // Wrap index.
2715 thread_data -> td.td_deque_tail = ( thread_data -> td.td_deque_tail + 1 ) & TASK_DEQUE_MASK;
2716 TCW_4(thread_data -> td.td_deque_ntasks, TCR_4(thread_data -> td.td_deque_ntasks) + 1);
2717
2718 result = true;
Jonathan Peyton1406f012015-05-22 22:35:51 +00002719 KA_TRACE(30, ("__kmp_give_task: successfully gave task %p to thread %d.\n", taskdata, tid ) );
Andrey Churbanov535b6fa2015-05-07 17:41:51 +00002720
2721release_and_exit:
2722 __kmp_release_bootstrap_lock( & thread_data-> td.td_deque_lock );
2723
2724 return result;
2725}
2726
2727
2728/* The finish of the a proxy tasks is divided in two pieces:
2729 - the top half is the one that can be done from a thread outside the team
2730 - the bottom half must be run from a them within the team
2731
2732 In order to run the bottom half the task gets queued back into one of the threads of the team.
2733 Once the td_incomplete_child_task counter of the parent is decremented the threads can leave the barriers.
2734 So, the bottom half needs to be queued before the counter is decremented. The top half is therefore divided in two parts:
2735 - things that can be run before queuing the bottom half
2736 - things that must be run after queuing the bottom half
2737
2738 This creates a second race as the bottom half can free the task before the second top half is executed. To avoid this
2739 we use the td_incomplete_child_task of the proxy task to synchronize the top and bottom half.
2740*/
2741
2742static void __kmp_first_top_half_finish_proxy( kmp_taskdata_t * taskdata )
2743{
2744 KMP_DEBUG_ASSERT( taskdata -> td_flags.tasktype == TASK_EXPLICIT );
2745 KMP_DEBUG_ASSERT( taskdata -> td_flags.proxy == TASK_PROXY );
2746 KMP_DEBUG_ASSERT( taskdata -> td_flags.complete == 0 );
2747 KMP_DEBUG_ASSERT( taskdata -> td_flags.freed == 0 );
2748
2749 taskdata -> td_flags.complete = 1; // mark the task as completed
2750
2751 if ( taskdata->td_taskgroup )
2752 KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata->td_taskgroup->count) );
2753
2754 // Create an imaginary children for this task so the bottom half cannot release the task before we have completed the second top half
2755 TCR_4(taskdata->td_incomplete_child_tasks++);
2756}
2757
2758static void __kmp_second_top_half_finish_proxy( kmp_taskdata_t * taskdata )
2759{
2760 kmp_int32 children = 0;
2761
2762 // Predecrement simulated by "- 1" calculation
2763 children = KMP_TEST_THEN_DEC32( (kmp_int32 *)(& taskdata -> td_parent -> td_incomplete_child_tasks) ) - 1;
2764 KMP_DEBUG_ASSERT( children >= 0 );
2765
2766 // Remove the imaginary children
2767 TCR_4(taskdata->td_incomplete_child_tasks--);
2768}
2769
2770static void __kmp_bottom_half_finish_proxy( kmp_int32 gtid, kmp_task_t * ptask )
2771{
2772 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(ptask);
2773 kmp_info_t * thread = __kmp_threads[ gtid ];
2774
2775 KMP_DEBUG_ASSERT( taskdata -> td_flags.proxy == TASK_PROXY );
2776 KMP_DEBUG_ASSERT( taskdata -> td_flags.complete == 1 ); // top half must run before bottom half
2777
2778 // We need to wait to make sure the top half is finished
2779 // Spinning here should be ok as this should happen quickly
2780 while ( TCR_4(taskdata->td_incomplete_child_tasks) > 0 ) ;
2781
2782 __kmp_release_deps(gtid,taskdata);
2783 __kmp_free_task_and_ancestors(gtid, taskdata, thread);
2784}
2785
2786/*!
2787@ingroup TASKING
2788@param gtid Global Thread ID of encountering thread
2789@param ptask Task which execution is completed
2790
2791Execute the completation of a proxy task from a thread of that is part of the team. Run first and bottom halves directly.
2792*/
2793void __kmpc_proxy_task_completed( kmp_int32 gtid, kmp_task_t *ptask )
2794{
2795 KMP_DEBUG_ASSERT( ptask != NULL );
2796 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(ptask);
2797 KA_TRACE(10, ("__kmp_proxy_task_completed(enter): T#%d proxy task %p completing\n", gtid, taskdata ) );
2798
2799 KMP_DEBUG_ASSERT( taskdata->td_flags.proxy == TASK_PROXY );
2800
2801 __kmp_first_top_half_finish_proxy(taskdata);
2802 __kmp_second_top_half_finish_proxy(taskdata);
2803 __kmp_bottom_half_finish_proxy(gtid,ptask);
2804
2805 KA_TRACE(10, ("__kmp_proxy_task_completed(exit): T#%d proxy task %p completing\n", gtid, taskdata ) );
2806}
2807
2808/*!
2809@ingroup TASKING
2810@param ptask Task which execution is completed
2811
2812Execute the completation of a proxy task from a thread that could not belong to the team.
2813*/
2814void __kmpc_proxy_task_completed_ooo ( kmp_task_t *ptask )
2815{
2816 KMP_DEBUG_ASSERT( ptask != NULL );
2817 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(ptask);
2818
2819 KA_TRACE(10, ("__kmp_proxy_task_completed_ooo(enter): proxy task completing ooo %p\n", taskdata ) );
2820
2821 KMP_DEBUG_ASSERT( taskdata->td_flags.proxy == TASK_PROXY );
2822
2823 __kmp_first_top_half_finish_proxy(taskdata);
2824
2825 // Enqueue task to complete bottom half completation from a thread within the corresponding team
2826 kmp_team_t * team = taskdata->td_team;
2827 kmp_int32 nthreads = team->t.t_nproc;
2828 kmp_info_t *thread;
2829 kmp_int32 k = 0;
2830
2831 do {
Jonathan Peyton1406f012015-05-22 22:35:51 +00002832 //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 +00002833 //For now we're just linearly trying to find a thread
2834 k = (k+1) % nthreads;
2835 thread = team->t.t_threads[k];
2836 } while ( !__kmp_give_task( thread, k, ptask ) );
2837
2838 __kmp_second_top_half_finish_proxy(taskdata);
2839
2840 KA_TRACE(10, ("__kmp_proxy_task_completed_ooo(exit): proxy task completing ooo %p\n", taskdata ) );
2841}
2842
2843#endif