Home
last modified time | relevance | path

Searched refs:F (Results 1 – 24 of 24) sorted by relevance

/oneTBB/examples/migration/recursive_fibonacci/
H A Dtask_emulation_layer.h95 F create_child(Args&&... args) { in create_child()
106 F* allocate_child(Args&&... args) { in allocate_child()
160 F* obj = new F{std::forward<Args>(args)...}; in allocate_child_impl()
193 template <typename F, typename... Args>
195 F obj{std::forward<Args>(args)...}; in create_root_task()
203 F* obj = new F{std::forward<Args>(args)...}; in allocate_root_task()
209 template <typename F>
210 void run_task(F&& f) { in run_task()
214 template <typename F>
215 void run_task(F* f) { in run_task()
[all …]
H A Dfibonacci.cpp27 template <typename F>
28 std::pair</* result */ unsigned long, /* time */ unsigned long> measure(F&& f, in measure()
/oneTBB/include/oneapi/tbb/
H A Dtask_group.h78 template<typename F>
82 template<typename F>
85 const F m_func;
107 template<typename F>
113 template<typename F>
434 template<typename F>
436 const F m_func;
472 template <typename F>
474 const F& m_func;
658 template<typename F>
[all …]
H A Dtask_arena.h42 F &my_func;
64 template<typename F>
66 F &my_func;
202 R isolate_impl(F& f) { in isolate_impl()
208 template <typename F>
211 const F m_func;
230 template<typename F>
385 template<typename F>
402 template<typename F>
444 template<typename F>
[all …]
H A Dcollaborative_call_once.h96 template <typename F> in alignas()
97 void run_once(F&& f) { in alignas()
106 function_stack_task<F> t{ std::forward<F>(f), m_storage.m_wait_context }; in alignas()
/oneTBB/doc/main/reference/
H A Dtask_group_extensions.rst40 //only the requirements for the return type of function F are changed
41 template<typename F>
42 task_handle defer(F&& f);
44 //only the requirements for the return type of function F are changed
45 template<typename F>
46 task_group_status run_and_wait(const F& f);
49 template<typename F>
50 void run(F&& f);
61 .. cpp:function:: template<typename F> task_handle defer(F&& f)
68 .. cpp:function:: template<typename F> task_group_status run_and_wait(const F& f)
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_template_helpers.h287 template< typename F, typename Pack > friend void call(F&& f, Pack&& p);
288 template< typename Ret, typename F, typename Pack > friend Ret call_and_return(F&& f, Pack&& p);
293 template< typename Ret, typename F, typename... Preceding >
297 template< typename Ret, typename F, typename... Preceding >
319 template< typename F, typename Pack > friend void call(F&& f, Pack&& p);
320 template< typename Ret, typename F, typename Pack > friend Ret call_and_return(F&& f, Pack&& p);
323 template< typename Ret, typename F, typename... Preceding >
341 template< typename F, typename Pack >
342 void call(F&& f, Pack&& p) {
346 template< typename Ret, typename F, typename Pack >
[all …]
H A D_utils.h267 template <typename F>
268 void atomic_do_once( const F& initializer, std::atomic<do_once_state>& state ) { in atomic_do_once()
350 template <typename F, typename... Args> in atomic_do_once()
351 auto invoke(F&& f, Args&&... args) in atomic_do_once()
353 noexcept(std::is_nothrow_invocable_v<F, Args...>) in atomic_do_once()
354 -> std::invoke_result_t<F, Args...> in atomic_do_once()
356 return std::invoke(std::forward<F>(f), std::forward<Args>(args)...); in atomic_do_once()
359 noexcept(noexcept(std::forward<F>(f)(std::forward<Args>(args)...))) in atomic_do_once()
360 -> decltype(std::forward<F>(f)(std::forward<Args>(args)...)) in atomic_do_once()
362 return std::forward<F>(f)(std::forward<Args>(args)...); in atomic_do_once()
H A D_task.h79 template <typename F>
83 F user_callback_copy = *static_cast<F*>(user_callback); in suspend_callback()
87 template <typename F>
88 void suspend(F f) { in suspend()
89 r1::suspend(&suspend_callback<F>, &f); in suspend()
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DWavefront.rst80 int F[MAX_LEN+1][MAX_LEN+1];
87 F[i][j] = x[i-1]==y[j-1] ? F[i-1][j-1]+1:
88 max(F[i][j-1],F[i-1][j]);
92 The kernel sets ``F[i][j]`` to the length of the longest common
94 that F[0][0..ylen] and ``F[0..xlen][0]`` have already been
99 ``F[i][j]``.
128 Another consideration is grain size. Scheduling each ``F[i][j]``
172 F[i][j] = x[i-1]==y[j-1] ? F[i-1][j-1]+1:
173 max(F[i][j-1],F[i-1][j]);
/oneTBB/test/common/
H A Dvector_types.h45 static constexpr int F = sizeof(Mvec)/sizeof(float); variable
72 for( int i = 0; i < F*n; ++i ) {
91 for( int j = 0; j < F; ++j ) in init()
92 ((float*)value)[j] = float(n*start+F*i+j); in init()
H A Dconcepts_common.h232 template <typename T, typename F = T> using WithFeeder = ParallelForEachFeederBody<T, F, /*() = */S…
233 template <typename T, typename F = T> using WithFeederNoOperatorRoundBrackets = ParallelForEachFeed…
234 template <typename T, typename F = T> using WithFeederOperatorRoundBracketsNonConst = ParallelForEa…
235 …emplate <typename T, typename F = T> using WithFeederWrongFirstInputOperatorRoundBrackets = Parall…
236 …emplate <typename T, typename F = T> using WithFeederWrongSecondInputOperatorRoundBrackets = Paral…
H A Ddoctest.h1339 template <typename F>
1342 F value; bool flipped;
1343 IsNaN(F f, bool flip = false) : value(f), flipped(flip) { }
1344 IsNaN<F> operator!() const { return { value, !flipped }; }
4059 template <typename F>
4060 IsNaN<F>::operator bool() const {
4067 template <typename F>
4068 String toString(IsNaN<F> in) { return String(in.flipped ? "! " : "") + "IsNaN( " + doctest::toStrin…
/oneTBB/src/tbb/
H A Dexception.cpp44 template <typename F>
45 /*[[noreturn]]*/ void do_throw_noexcept(F throw_func) noexcept { in do_throw_noexcept()
61 template <typename F>
62 /*[[noreturn]]*/ void do_throw(F throw_func) { in do_throw()
/oneTBB/doc/main/tbb_userguide/
H A DDependence_Graph.rst42 complete before D and F start executing. This is a partial ordering
44 B and E or C and F.
95 node_t F(g, [](msg_t){ f(); } );
101 make_edge(E, F);
H A DCancellation_and_Nested_Parallelism.rst73 b. Cancel tasks in A and, by downwards propagation, in E, F, and G.
H A DParallelizing_Flow_Graph.rst24 function F. For each value in the sequence, G squares the value and H
H A DData_Flow_Graph.rst81 node F from **Simple Data Flow Graph** above is implemented as a loop
/oneTBB/test/tbb/
H A Dtest_global_control.cpp126 template <typename F>
127 void TestException( F &f ) { in TestException()
H A Dtest_openmp.cpp150 void RunTest( Func F, int m, int n, int p) { in RunTest() argument
153 F(actual, A, m, B, n, p); in RunTest()
H A Dtest_task_arena.cpp1286 template <typename F>
1287 void TestExecute(F &f) { in TestExecute()
1293 template <typename F>
1294 void TestExecute(const F &f) { in TestExecute()
1299 template <typename F>
1300 void TestIsolate(F &f) { in TestIsolate()
1306 template <typename F>
1307 void TestIsolate(const F &f) { in TestIsolate()
H A Dtest_scheduler_mix.cpp393 template <typename F>
394 …auto find_arena(std::size_t start, F f) -> decltype(f(std::declval<ArenaPtrRWMutex&>(), std::size_… in find_arena()
H A Dtest_task_group.cpp274 const std::uintptr_t F = 6765; variable
284 CHECK( sum == numRepeats * F );
/oneTBB/examples/parallel_for/polygon_overlay/
H A DREADME.md4 …as described in Parallelizing the [Polygon Overlay Problem Using Orca, by H.F. Langendoen](http://…