39 #include "kmp_wait_release.h"
50 #ifdef KMP_SUPPORT_GRAPH_OUTPUT
51 static kmp_int32 kmp_node_id_seed = 0;
55 __kmp_init_node ( kmp_depnode_t *node )
58 node->dn.successors = NULL;
59 __kmp_init_lock(&node->dn.lock);
61 #ifdef KMP_SUPPORT_GRAPH_OUTPUT
62 node->dn.id = KMP_TEST_THEN_INC32(&kmp_node_id_seed);
66 static inline kmp_depnode_t *
67 __kmp_node_ref ( kmp_depnode_t *node )
69 KMP_TEST_THEN_INC32(&node->dn.nrefs);
74 __kmp_node_deref ( kmp_info_t *thread, kmp_depnode_t *node )
78 kmp_int32 n = KMP_TEST_THEN_DEC32(&node->dn.nrefs) - 1;
80 KMP_ASSERT(node->dn.nrefs == 0);
82 __kmp_fast_free(thread,node);
84 __kmp_thread_free(thread,node);
89 #define KMP_ACQUIRE_DEPNODE(gtid,n) __kmp_acquire_lock(&(n)->dn.lock,(gtid))
90 #define KMP_RELEASE_DEPNODE(gtid,n) __kmp_release_lock(&(n)->dn.lock,(gtid))
93 __kmp_depnode_list_free ( kmp_info_t *thread, kmp_depnode_list *list );
95 static const kmp_int32 kmp_dephash_log2 = 6;
96 static const kmp_int32 kmp_dephash_size = (1 << kmp_dephash_log2);
98 static inline kmp_int32
99 __kmp_dephash_hash ( kmp_intptr_t addr )
102 return ((addr >> kmp_dephash_log2) ^ addr) % kmp_dephash_size;
105 static kmp_dephash_t *
106 __kmp_dephash_create ( kmp_info_t *thread )
110 kmp_int32 size = kmp_dephash_size *
sizeof(kmp_dephash_entry_t) +
sizeof(kmp_dephash_t);
113 h = (kmp_dephash_t *) __kmp_fast_allocate( thread, size );
115 h = (kmp_dephash_t *) __kmp_thread_malloc( thread, size );
121 h->buckets = (kmp_dephash_entry **)(h+1);
123 for ( kmp_int32 i = 0; i < kmp_dephash_size; i++ )
130 __kmp_dephash_free ( kmp_info_t *thread, kmp_dephash_t *h )
132 for ( kmp_int32 i=0; i < kmp_dephash_size; i++ ) {
133 if ( h->buckets[i] ) {
134 kmp_dephash_entry_t *next;
135 for ( kmp_dephash_entry_t *entry = h->buckets[i]; entry; entry = next ) {
136 next = entry->next_in_bucket;
137 __kmp_depnode_list_free(thread,entry->last_ins);
138 __kmp_node_deref(thread,entry->last_out);
140 __kmp_fast_free(thread,entry);
142 __kmp_thread_free(thread,entry);
148 __kmp_fast_free(thread,h);
150 __kmp_thread_free(thread,h);
154 static kmp_dephash_entry *
155 __kmp_dephash_find ( kmp_info_t *thread, kmp_dephash_t *h, kmp_intptr_t addr )
157 kmp_int32 bucket = __kmp_dephash_hash(addr);
159 kmp_dephash_entry_t *entry;
160 for ( entry = h->buckets[bucket]; entry; entry = entry->next_in_bucket )
161 if ( entry->addr == addr )
break;
163 if ( entry == NULL ) {
166 entry = (kmp_dephash_entry_t *) __kmp_fast_allocate( thread,
sizeof(kmp_dephash_entry_t) );
168 entry = (kmp_dephash_entry_t *) __kmp_thread_malloc( thread,
sizeof(kmp_dephash_entry_t) );
171 entry->last_out = NULL;
172 entry->last_ins = NULL;
173 entry->next_in_bucket = h->buckets[bucket];
174 h->buckets[bucket] = entry;
177 if ( entry->next_in_bucket ) h->nconflicts++;
183 static kmp_depnode_list_t *
184 __kmp_add_node ( kmp_info_t *thread, kmp_depnode_list_t *list, kmp_depnode_t *node )
186 kmp_depnode_list_t *new_head;
189 new_head = (kmp_depnode_list_t *) __kmp_fast_allocate(thread,
sizeof(kmp_depnode_list_t));
191 new_head = (kmp_depnode_list_t *) __kmp_thread_malloc(thread,
sizeof(kmp_depnode_list_t));
194 new_head->node = __kmp_node_ref(node);
195 new_head->next = list;
201 __kmp_depnode_list_free ( kmp_info_t *thread, kmp_depnode_list *list )
203 kmp_depnode_list *next;
205 for ( ; list ; list = next ) {
208 __kmp_node_deref(thread,list->node);
210 __kmp_fast_free(thread,list);
212 __kmp_thread_free(thread,list);
218 __kmp_track_dependence ( kmp_depnode_t *source, kmp_depnode_t *sink )
220 #ifdef KMP_SUPPORT_GRAPH_OUTPUT
221 kmp_taskdata_t * task_source = KMP_TASK_TO_TASKDATA(source->dn.task);
222 kmp_taskdata_t * task_sink = KMP_TASK_TO_TASKDATA(sink->dn.task);
224 __kmp_printf(
"%d(%s) -> %d(%s)\n", source->dn.id, task_source->td_ident->psource, sink->dn.id, task_sink->td_ident->psource);
228 template<
bool filter >
229 static inline kmp_int32
230 __kmp_process_deps ( kmp_int32 gtid, kmp_depnode_t *node, kmp_dephash_t *hash,
231 bool dep_barrier,kmp_int32 ndeps, kmp_depend_info_t *dep_list)
233 KA_TRACE(30, (
"__kmp_process_deps<%d>: T#%d processing %d depencies : dep_barrier = %d\n", filter, gtid, ndeps, dep_barrier ) );
235 kmp_info_t *thread = __kmp_threads[ gtid ];
236 kmp_int32 npredecessors=0;
237 for ( kmp_int32 i = 0; i < ndeps ; i++ ) {
238 const kmp_depend_info_t * dep = &dep_list[i];
240 KMP_DEBUG_ASSERT(dep->flags.in);
242 if ( filter && dep->base_addr == 0 )
continue;
244 kmp_dephash_entry_t *info = __kmp_dephash_find(thread,hash,dep->base_addr);
245 kmp_depnode_t *last_out = info->last_out;
247 if ( dep->flags.out && info->last_ins ) {
248 for ( kmp_depnode_list_t * p = info->last_ins; p; p = p->next ) {
249 kmp_depnode_t * indep = p->node;
250 if ( indep->dn.task ) {
251 KMP_ACQUIRE_DEPNODE(gtid,indep);
252 if ( indep->dn.task ) {
253 __kmp_track_dependence(indep,node);
254 indep->dn.successors = __kmp_add_node(thread, indep->dn.successors, node);
255 KA_TRACE(40,(
"__kmp_process_deps<%d>: T#%d adding dependence from %p to %p",
256 filter,gtid, KMP_TASK_TO_TASKDATA(indep->dn.task), KMP_TASK_TO_TASKDATA(node->dn.task)));
259 KMP_RELEASE_DEPNODE(gtid,indep);
263 __kmp_depnode_list_free(thread,info->last_ins);
264 info->last_ins = NULL;
266 }
else if ( last_out && last_out->dn.task ) {
267 KMP_ACQUIRE_DEPNODE(gtid,last_out);
268 if ( last_out->dn.task ) {
269 __kmp_track_dependence(last_out,node);
270 last_out->dn.successors = __kmp_add_node(thread, last_out->dn.successors, node);
271 KA_TRACE(40,(
"__kmp_process_deps<%d>: T#%d adding dependence from %p to %p",
272 filter,gtid, KMP_TASK_TO_TASKDATA(last_out->dn.task), KMP_TASK_TO_TASKDATA(node->dn.task)));
276 KMP_RELEASE_DEPNODE(gtid,last_out);
282 __kmp_node_deref(thread,last_out);
283 info->last_out = NULL;
285 if ( dep->flags.out ) {
286 __kmp_node_deref(thread,last_out);
287 info->last_out = __kmp_node_ref(node);
289 info->last_ins = __kmp_add_node(thread, info->last_ins, node);
294 KA_TRACE(30, (
"__kmp_process_deps<%d>: T#%d found %d predecessors\n", filter, gtid, npredecessors ) );
296 return npredecessors;
299 #define NO_DEP_BARRIER (false)
300 #define DEP_BARRIER (true)
304 __kmp_check_deps ( kmp_int32 gtid, kmp_depnode_t *node, kmp_task_t *task, kmp_dephash_t *hash,
bool dep_barrier,
305 kmp_int32 ndeps, kmp_depend_info_t *dep_list,
306 kmp_int32 ndeps_noalias, kmp_depend_info_t *noalias_dep_list )
310 kmp_taskdata_t * taskdata = KMP_TASK_TO_TASKDATA(task);
311 KA_TRACE(20, (
"__kmp_check_deps: T#%d checking dependencies for task %p : %d possibly aliased dependencies, %d non-aliased depedencies : dep_barrier=%d .\n", gtid, taskdata, ndeps, ndeps_noalias, dep_barrier ) );
315 for ( i = 0; i < ndeps; i ++ ) {
316 if ( dep_list[i].base_addr != 0 )
317 for (
int j = i+1; j < ndeps; j++ )
318 if ( dep_list[i].base_addr == dep_list[j].base_addr ) {
319 dep_list[i].flags.in |= dep_list[j].flags.in;
320 dep_list[i].flags.out |= dep_list[j].flags.out;
321 dep_list[j].base_addr = 0;
327 node->dn.npredecessors = -1;
332 npredecessors = __kmp_process_deps<true>(gtid, node, hash, dep_barrier, ndeps, dep_list);
333 npredecessors += __kmp_process_deps<false>(gtid, node, hash, dep_barrier, ndeps_noalias, noalias_dep_list);
335 node->dn.task = task;
342 npredecessors = KMP_TEST_THEN_ADD32(&node->dn.npredecessors, npredecessors) + npredecessors;
344 KA_TRACE(20, (
"__kmp_check_deps: T#%d found %d predecessors for task %p \n", gtid, npredecessors, taskdata ) );
347 return npredecessors > 0 ?
true :
false;
351 __kmp_release_deps ( kmp_int32 gtid, kmp_taskdata_t *task )
353 kmp_info_t *thread = __kmp_threads[ gtid ];
354 kmp_depnode_t *node = task->td_depnode;
356 if ( task->td_dephash ) {
357 KA_TRACE(40, (
"__kmp_realease_deps: T#%d freeing dependencies hash of task %p.\n", gtid, task ) );
358 __kmp_dephash_free(thread,task->td_dephash);
363 KA_TRACE(20, (
"__kmp_realease_deps: T#%d notifying succesors of task %p.\n", gtid, task ) );
365 KMP_ACQUIRE_DEPNODE(gtid,node);
366 node->dn.task = NULL;
367 KMP_RELEASE_DEPNODE(gtid,node);
369 kmp_depnode_list_t *next;
370 for ( kmp_depnode_list_t *p = node->dn.successors; p; p = next ) {
371 kmp_depnode_t *successor = p->node;
372 kmp_int32 npredecessors = KMP_TEST_THEN_DEC32(&successor->dn.npredecessors) - 1;
375 if ( npredecessors == 0 ) {
377 if ( successor->dn.task ) {
378 KA_TRACE(20, (
"__kmp_realease_deps: T#%d successor %p of %p scheduled for execution.\n", gtid, successor->dn.task, task ) );
379 __kmp_omp_task(gtid,successor->dn.task,
false);
384 __kmp_node_deref(thread,p->node);
386 __kmp_fast_free(thread,p);
388 __kmp_thread_free(thread,p);
392 __kmp_node_deref(thread,node);
394 KA_TRACE(20, (
"__kmp_realease_deps: T#%d all successors of %p notified of completation\n", gtid, task ) );
413 kmp_int32 ndeps, kmp_depend_info_t *dep_list,
414 kmp_int32 ndeps_noalias, kmp_depend_info_t *noalias_dep_list )
417 kmp_taskdata_t * new_taskdata = KMP_TASK_TO_TASKDATA(new_task);
418 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(enter): T#%d loc=%p task=%p\n",
419 gtid, loc_ref, new_taskdata ) );
421 kmp_info_t *thread = __kmp_threads[ gtid ];
422 kmp_taskdata_t * current_task = thread->th.th_current_task;
424 bool serial = current_task->td_flags.team_serial || current_task->td_flags.tasking_ser || current_task->td_flags.final;
426 serial = serial && !(new_taskdata->td_flags.proxy == TASK_PROXY);
429 if ( !serial && ( ndeps > 0 || ndeps_noalias > 0 )) {
431 if ( current_task->td_dephash == NULL )
432 current_task->td_dephash = __kmp_dephash_create(thread);
435 kmp_depnode_t *node = (kmp_depnode_t *) __kmp_fast_allocate(thread,
sizeof(kmp_depnode_t));
437 kmp_depnode_t *node = (kmp_depnode_t *) __kmp_thread_malloc(thread,
sizeof(kmp_depnode_t));
440 __kmp_init_node(node);
441 new_taskdata->td_depnode = node;
443 if ( __kmp_check_deps( gtid, node, new_task, current_task->td_dephash, NO_DEP_BARRIER,
444 ndeps, dep_list, ndeps_noalias,noalias_dep_list ) ) {
445 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(exit): T#%d task had blocking dependencies: "
446 "loc=%p task=%p, return: TASK_CURRENT_NOT_QUEUED\n", gtid, loc_ref,
448 return TASK_CURRENT_NOT_QUEUED;
452 kmp_task_team_t * task_team = thread->th.th_task_team;
453 if ( task_team && task_team->tt.tt_found_proxy_tasks )
457 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(exit): T#%d ignored dependencies for task (serialized)"
458 "loc=%p task=%p\n", gtid, loc_ref, new_taskdata ) );
461 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(exit): T#%d task had no blocking dependencies : "
462 "loc=%p task=%p, transferring to __kmpc_omp_task\n", gtid, loc_ref,
465 return __kmpc_omp_task(loc_ref,gtid,new_task);
481 kmp_int32 ndeps_noalias, kmp_depend_info_t *noalias_dep_list )
483 KA_TRACE(10, (
"__kmpc_omp_wait_deps(enter): T#%d loc=%p\n", gtid, loc_ref) );
485 if ( ndeps == 0 && ndeps_noalias == 0 ) {
486 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d has no dependencies to wait upon : loc=%p\n", gtid, loc_ref) );
490 kmp_info_t *thread = __kmp_threads[ gtid ];
491 kmp_taskdata_t * current_task = thread->th.th_current_task;
496 bool ignore = current_task->td_flags.team_serial || current_task->td_flags.tasking_ser || current_task->td_flags.final;
498 ignore = ignore && thread->th.th_task_team->tt.tt_found_proxy_tasks == FALSE;
500 ignore = ignore || current_task->td_dephash == NULL;
503 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d has no blocking dependencies : loc=%p\n", gtid, loc_ref) );
508 __kmp_init_node(&node);
510 if (!__kmp_check_deps( gtid, &node, NULL, current_task->td_dephash, DEP_BARRIER,
511 ndeps, dep_list, ndeps_noalias, noalias_dep_list )) {
512 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d has no blocking dependencies : loc=%p\n", gtid, loc_ref) );
516 int thread_finished = FALSE;
517 kmp_flag_32 flag((
volatile kmp_uint32 *)&(node.dn.npredecessors), 0U);
518 while ( node.dn.npredecessors > 0 ) {
519 flag.execute_tasks(thread, gtid, FALSE, &thread_finished,
523 __kmp_task_stealing_constraint );
526 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d finished waiting : loc=%p\n", gtid, loc_ref) );
void __kmpc_omp_wait_deps(ident_t *loc_ref, kmp_int32 gtid, kmp_int32 ndeps, kmp_depend_info_t *dep_list, kmp_int32 ndeps_noalias, kmp_depend_info_t *noalias_dep_list)
kmp_int32 __kmpc_omp_task_with_deps(ident_t *loc_ref, kmp_int32 gtid, kmp_task_t *new_task, kmp_int32 ndeps, kmp_depend_info_t *dep_list, kmp_int32 ndeps_noalias, kmp_depend_info_t *noalias_dep_list)