| /oneTBB/examples/graph/som/ |
| H A D | som.cpp | 37 out << "("; in operator <<() 39 out << s.w[i]; in operator <<() 41 out << ","; in operator <<() 44 out << ")"; in operator <<() 45 return out; in operator <<() 60 out << "<"; in operator <<() 61 out << std::get<RADIUS>(s); in operator <<() 63 out << ", "; in operator <<() 64 out << std::get<YV>(s); in operator <<() 65 out << ">"; in operator <<() [all …]
|
| H A D | som.hpp | 39 std::ostream &operator<<(std::ostream &out, const search_result_type &s); 80 friend std::ostream &operator<<(std::ostream &out, const SOM_element &s);
|
| /oneTBB/examples/parallel_pipeline/square/ |
| H A D | square.cpp | 148 TextSlice* out = TextSlice::allocate(2 * MAX_CHAR_PER_INPUT_SLICE); in operator ()() local 149 char* q = out->begin(); in operator ()() 163 out->set_end(q); in operator ()() 165 return out; in operator ()() 179 void MyOutputFunc::operator()(TextSlice* out) const { in operator ()() 180 std::size_t n = fwrite(out->begin(), 1, out->size(), my_output_file); in operator ()() 181 if (n != out->size()) { in operator ()() 185 out->free(); in operator ()()
|
| /oneTBB/ |
| H A D | .gitignore | 33 *.out 56 out/*
|
| H A D | INSTALL.md | 91 …e by Microsoft* team members and community contributors. If the version is out of date, create an … 104 # Create binary directory for out-of-source build 126 REM Create binary directory for out-of-source build
|
| /oneTBB/examples/parallel_for/tachyon/src/ |
| H A D | grid.cpp | 473 gridindex curvox, step, out; in grid_intersect() local 495 out.x = 0; /* never goes out of bounds on this axis */ in grid_intersect() 500 step.x = out.x = -1; in grid_intersect() 506 out.x = g->xsize; in grid_intersect() 519 step.y = out.y = -1; in grid_intersect() 525 out.y = g->ysize; in grid_intersect() 538 step.z = out.z = -1; in grid_intersect() 544 out.z = g->zsize; in grid_intersect() 570 if (ry->maxdist < tmax.x || curvox.x == out.x) in grid_intersect() 589 if (ry->maxdist < tmax.z || curvox.z == out.z) in grid_intersect() [all …]
|
| H A D | ring.hpp | 52 object *newring(void *tex, vector ctr, vector norm, flt in, flt out);
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Working_on_the_Assembly_Line_pipeline.rst | 155 serial in-order, or serial out-of-order. 190 ``MyOutputFunc`` out of the order established by ``MyInputFunc``, the 224 void MyOutputFunc::operator()( TextSlice* out ) const { 225 size_t n = fwrite( out->begin(), 1, out->size(), my_output_file ); 226 if( n!=out->size() ) { 230 out->free(); 234 Method ``operator()`` processes a ``TextSlice``. The parameter ``out`` 257 TextSlice* out = TextSlice::allocate( 2*MAX_CHAR_PER_INPUT_SLICE ); 258 char* q = out->begin(); 272 out->set_end(q); [all …]
|
| H A D | appendix_A.rst | 22 compared to main memory. When the processor runs out of cache memory, it 41 lock on a resource, and its time slice runs out before it releases the
|
| H A D | Cancellation_and_Nested_Parallelism.rst | 64 c. Throw an exception out of B to A. 76 c. Throw an exception upwards out of A.
|
| H A D | Concurrent_Queue_Classes.rst | 52 In a single-threaded program, a queue is a first-in first-out structure. 96 number of values, until memory runs out. It can be bounded by setting
|
| H A D | When_Not_to_Use_Queues.rst | 14 first-in first-out order.
|
| H A D | always_use_wait_for_all.rst | 36 node have been deleted out from underneath it. Placing a
|
| H A D | Linux_C_Dynamic_Memory_Interface_Replacement.rst | 73 g++ foo.o bar.o -ltbbmalloc_proxy -o a.out
|
| H A D | Throughput_of_pipeline.rst | 31 useful work. Making windows too large may cause them to spill out of
|
| /oneTBB/test/tbb/ |
| H A D | test_join_node.cpp | 41 int out = int(std::get<0>(v))/2; in operator ()() local 42 input_node_helper<N, join_node_type>::only_check_value(out, v); in operator ()() 44 return out; in operator ()()
|
| H A D | test_parallel_pipeline.cpp | 195 U out; in operator ()() local 196 my_function(out); in operator ()() 198 return out; in operator ()() 213 U out; in operator ()() local 214 my_function(out); in operator ()() 215 return out; in operator ()()
|
| H A D | test_limiter_node.cpp | 240 void operator()(const int &/*in*/, mfnode_type::output_ports_type &out) { in operator ()() 246 if(!std::get<DECREMENT_OUTPUT>(out).try_put(tbb::flow::continue_msg())) { in operator ()() 251 while( std::get<LIMITER_OUTPUT>(out).try_put(lcnt) ) { in operator ()() 521 [&](const int & value, typename decltype(processing)::output_ports_type & out) { in test_decrement_while_try_put_task() 523 std::get<0>(out).try_put(1); in test_decrement_while_try_put_task()
|
| H A D | test_composite_node.cpp | 329 int out; in test_nested_adder() local 333 output.try_get(out); in test_nested_adder() 334 …CHECK_MESSAGE( (tbb::flow::output_port<0>(outer_node).try_get(out) == output.try_get(out)), "outpu… in test_nested_adder() 335 CHECK_MESSAGE( (out == 8*i), "output from outer_node not correct"); in test_nested_adder()
|
| H A D | test_async_node.cpp | 85 static void copy_value(const T1 &in, T2 &out) { out = in; } in copy_value() 94 static void copy_value(const place_wrapper<T1> &in, place_wrapper<T2> &out) { in copy_value() 95 out.value = in.value; in copy_value()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_join_impl.h | 85 if ( !join_helper<N-1>::reserve( my_input, out ) ) { in reserve() 100 return get_my_item(my_input, out); in get_items() 168 return std::get<0>(my_input).get_item(std::get<0>(out)); 173 return get_my_item(my_input, out); 724 bool try_to_make_tuple(output_type &out) { 726 return join_helper<N>::reserve(my_inputs, out); 798 bool try_to_make_tuple(output_type &out) { 800 return join_helper<N>::get_items(my_inputs, out); 1007 bool try_to_make_tuple(output_type &out) { 1008 key_matching_FE_operation op_data(&out,try_make); [all …]
|
| /oneTBB/doc/GSG/ |
| H A D | intro.rst | 10 parallelism is carried out through threads, an operating system mechanism that allows the same or d…
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Fenced_Data_Transfer.rst | 67 hardware or compiler can cause the sender's writes to appear out of 69 reads to appear out of order (thus breaking condition b).
|
| /oneTBB/examples/graph/dining_philosophers/ |
| H A D | dining_philosophers.cpp | 183 forward_node_type::output_ports_type &out) { in operator ()() argument 184 my_philosopher.forward(in, out); in operator ()()
|
| /oneTBB/examples/task_arena/fractal/ |
| H A D | README.md | 44 * `e` - zoom out the active fractal.
|