Lines Matching refs:ed
161 void fold_tree(node* n, const execution_data& ed) { in fold_tree() argument
176 self->join(ed.context); in fold_tree()
177 self->m_allocator.delete_object(self, ed); in fold_tree()
273 void execute(StartType &start, Range &range, execution_data& ed) { in execute()
285 start.offer_work( split_obj, ed ); in execute()
289 self().work_balance(start, range, ed); in execute()
381 static bool is_stolen_task(const execution_data& ed) { in is_stolen_task() argument
382 return execution_slot(ed) != original_slot(ed); in is_stolen_task()
408 … bool check_being_stolen(Task &t, const execution_data& ed) { // part of old should_execute_range() in check_being_stolen()
411 …if( is_stolen_task(ed) && t.my_parent->m_ref_count >= 2 ) { // runs concurrently with the left task in check_being_stolen()
433 void work_balance(StartType &start, Range &range, execution_data& ed) { in work_balance()
443 start.offer_work( range_pool.front(), range_pool.front_depth(), ed ); in work_balance()
452 } while( !range_pool.empty() && !ed.context->is_group_execution_cancelled() ); in work_balance()
509 void execute(StartType &start, Range &range, execution_data& ed) { in execute() argument
512 start.offer_work( split_obj, ed ); in execute()
613 bool should_execute_range(const execution_data& ed) { in should_execute_range() argument
614 if( num_chunks<VICTIM_CHUNKS && is_stolen_task(ed) ) in should_execute_range()