| /oneTBB/examples/graph/fgbzip2/ |
| H A D | fgbzip2.cpp | 80 if (!buffer.isLast) { in operator ()()
89 buffer.outputBuffer.len = outSize; in operator ()()
91 return buffer; in operator ()()
106 void readChunk(Buffer& buffer) { in readChunk() argument
112 void writeChunk(const Buffer& buffer) { in writeChunk() argument
113 m_outputStream.write(buffer.b, buffer.len); in writeChunk()
178 BufferMsg buffer; in writingLoop() local
179 m_writeQueue.pop(buffer); in writingLoop()
180 while (!buffer.isLast) { in writingLoop()
182 m_writeQueue.pop(buffer); in writingLoop()
[all …]
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Lazy_Initialization.rst | 70 … Here you can see the code for the implementation. Already calculated values are stored in a buffer
80 std::uint64_t LazyFibHelper(int n, FibBuffer& buffer) {
85 // Calculate nth value only once and store it in the buffer.
88 oneapi::tbb::collaborative_call_once(buffer[n].first, [&]() {
90 oneapi::tbb::parallel_invoke([&] { a = LazyFibHelper(n - 2, buffer); },
91 [&] { b = LazyFibHelper(n - 1, buffer); });
92 buffer[n].second = a + b;
95 return buffer[n].second;
99 FibBuffer buffer(n+1);
100 return LazyFibHelper(n, buffer);
|
| /oneTBB/test/common/ |
| H A D | test_follows_and_precedes_api.h | 63 tbb::flow::buffer_node<typename NodeType::output_type> buffer(g);
64 tbb::flow::make_edge(node, buffer);
71 …CHECK_MESSAGE((buffer.try_get(storage) && !buffer.try_get(storage)), "Not exact edge quantity was …
80 tbb::flow::buffer_node<typename NodeType::output_type> buffer(g);
81 tbb::flow::make_edge(node, buffer);
89 …CHECK_MESSAGE((buffer.try_get(storage) && !buffer.try_get(storage)), "Not exact edge quantity was …
181 buffer(tbb::flow::follows(successors[0], successors[1], successors[2]));
188 CHECK_MESSAGE((buffer.try_get(storage)), "Not exact edge quantity was made");
190 buffer.clear();
|
| /oneTBB/test/tbb/ |
| H A D | test_collaborative_call_once.cpp | 385 std::uint64_t collaborative_recursive_fib(int n, FibBuffer& buffer) { in collaborative_recursive_fib() argument
389 tbb::collaborative_call_once(buffer[n].first, [&]() { in collaborative_recursive_fib()
391 tbb::parallel_invoke([&] { a = collaborative_recursive_fib(n - 2, buffer); }, in collaborative_recursive_fib()
392 [&] { b = collaborative_recursive_fib(n - 1, buffer); }); in collaborative_recursive_fib()
393 buffer[n].second = a + b; in collaborative_recursive_fib()
395 return buffer[n].second; in collaborative_recursive_fib()
399 FibBuffer buffer(n); in collaborative_recursive_fib() local
400 return collaborative_recursive_fib(n-1, buffer); in collaborative_recursive_fib()
|
| /oneTBB/doc/main/reference/scalable_memory_pools/ |
| H A D | fixed_pool_cls.rst | 9 A class for scalable memory allocation from a buffer of fixed size.
41 fixed_pool(void *buffer, size_t size);
57 .. cpp:function:: fixed_pool(void *buffer, size_t size)
59 …Effects**: Constructs a memory pool to manage the memory of size ``size`` pointed to by ``buffer``.
|
| /oneTBB/examples/parallel_for/tachyon/src/ |
| H A D | trace.hpp | 58 char *buffer; member
80 char *buffer; member
|
| H A D | trace_rest.cpp | 82 writetgaregion(p.tga, p.iwidth, p.iheight, p.startx, p.starty, p.stopx, p.stopy, p.buffer); in thread_io()
83 free(p.buffer); /* free the buffer once we are done with it.. */ in thread_io()
|
| H A D | tgafile.cpp | 123 char *buffer) { in writetgaregion() argument
134 bufpos = buffer + (totalx * 3) * (totaly - y - 1); in writetgaregion()
|
| /oneTBB/examples/common/gui/ |
| H A D | winvideo.hpp | 218 char buffer[256], in loop_once() local
219 n = _snprintf(buffer, 128, "%s: %d fps", v->title, int(double(g_fps + g_skips) / sec)); in loop_once()
221 _snprintf(buffer + n, in loop_once()
226 SetWindowTextA(g_hAppWnd, buffer); in loop_once()
|
| H A D | xvideo.cpp | 394 char buffer[256]; in next_frame() local
395 snprintf(buffer, in next_frame()
401 XStoreName(dpy, win, buffer); in next_frame()
|
| /oneTBB/src/tbb/ |
| H A D | tcm_adaptor.cpp | 59 tcm_result_t (*tcm_get_version_info)(char* buffer, uint32_t buffer_size){nullptr};
249 char buffer[1024]; in print_version() local
250 tcm_get_version_info(buffer, 1024); in print_version()
251 std::fprintf(stderr, "%.*s", 1024, buffer); in print_version()
|
| H A D | tcm.h | 167 __TCM_EXPORT tcm_result_t tcmGetVersionInfo(char* buffer, uint32_t buffer_size);
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | broadcast_or_send.rst | 21 The nodes that push to only a single successor are all buffer nodes.
62 buffer policy set to rejecting. So, f1 and f2 do not internally buffer
75 node continues to buffer the message, should it eventually deliver the
|
| H A D | Using_Circular_Buffers.rst | 11 circular buffer of size at least ``ntoken``, where ``ntoken`` is the
18 the time the circular buffer wraps around to reallocate an item, the
|
| H A D | use_concurrency_limits.rst | 13 third argument controls the buffer policy used by the node, and is by
73 the ``input_node``, causing the ``input_node`` to buffer its last created
|
| H A D | Predefined_Node_Types.rst | 35 …o all successors. Its input and output are of the same generic type. It does not buffer messages.
37 …- Single-input, single-output nodes that buffer messages and send their output to one successor…
43 …- Single-input, single-output nodes that buffer a single message and broadcast their outputs to…
45 …the internal count, allowing further messages to be broadcast. The node does not buffer messages.
|
| H A D | create_token_based_system.rst | 19 and a buffer policy:
29 The buffer policy can be one of the following:
120 dummy type; it could for example be a buffer or other object that is
|
| H A D | use_graph_reset.rst | 11 left in a buffer. But even beyond remnants in the buffers, there are
|
| H A D | When_Not_to_Use_Queues.rst | 7 Queues are widely used in parallel programs to buffer consumers from
|
| H A D | Flow_Graph_Reservation.rst | 53 ``buffer_nodes`` buffer their output, so they accept a switch of their
54 output edge from push to pull mode. ``broadcast_nodes`` do not buffer
121 buffer messages, the message is dropped. Because not all the inputs to
|
| /oneTBB/doc/main/reference/ |
| H A D | make_edges_function.rst | 71 buffer_node<int> buffer(g);
75 make_edges(handlers, buffer);
|
| /oneTBB/test/tbbmalloc/ |
| H A D | test_scalable_allocator.cpp | 223 static char buffer[8*1024*1024]; variable
224 tbb::fixed_pool fixedPool(buffer, sizeof(buffer));
|
| /oneTBB/test/conformance/ |
| H A D | conformance_global_control.cpp | 367 static std::jmp_buf buffer; variable
371 std::longjmp(buffer, 1); in __anon3ebcafb90302()
378 if (setjmp(buffer) == 0) {
385 if (setjmp(buffer) == 0) {
|
| /oneTBB/examples/graph/logic_sim/ |
| H A D | basics.hpp | 364 class buffer : public gate<1> { class
383 buffer(oneapi::tbb::flow::graph& g) : gate<1>(g, buffer_body()) {} in buffer() function in buffer
384 buffer(const buffer& src) : gate<1>(src.my_graph, buffer_body()) {} in buffer() function in buffer
385 ~buffer() {} in ~buffer()
|
| /oneTBB/src/tbbmalloc_proxy/ |
| H A D | proxy.cpp | 680 char buffer[sz]; in SkipReplacement()
682 char *dllStr = buffer; in SkipReplacement()
|