121     void offer_work(typename Partitioner::split_type& split_obj, execution_data& ed) {  in offer_work()
122        offer_work_impl(ed, *this, split_obj);  in offer_work()
126     void offer_work(const Range& r, depth_t d, execution_data& ed) {  in offer_work()
127         offer_work_impl(ed, *this, r, d);  in offer_work()
132     void offer_work_impl(execution_data& ed, Args&&... constructor_args) {  in offer_work_impl()
135 …start_for& right_child = *alloc.new_object<start_for>(ed, std::forward<Args>(constructor_args)...,…  in offer_work_impl()
138         right_child.my_parent = my_parent = alloc.new_object<tree_node>(ed, my_parent, 2, alloc);  in offer_work_impl()
140         right_child.spawn_self(ed);  in offer_work_impl()
143     void spawn_self(execution_data& ed) {  in spawn_self()
144         my_partition.spawn_task(*this, *context(ed));  in spawn_self()
150 void start_for<Range, Body, Partitioner>::finalize(const execution_data& ed) {  in finalize()  argument
158     fold_tree<tree_node>(parent, ed);  in finalize()
159     allocator.deallocate(this, ed);  in finalize()
165 task* start_for<Range, Body, Partitioner>::execute(execution_data& ed) {  in execute()  argument
166     if (!is_same_affinity(ed)) {  in execute()
167         my_partition.note_affinity(execution_slot(ed));  in execute()
169     my_partition.check_being_stolen(*this, ed);  in execute()
170     my_partition.execute(*this, my_range, ed);  in execute()
171     finalize(ed);  in execute()
177 task* start_for<Range, Body, Partitioner>::cancel(execution_data& ed) {  in cancel()  argument
178     finalize(ed);  in cancel()