| /oneTBB/test/common/ |
| H A D | test_follows_and_precedes_api.h | 52 std::array<MessageType, 3>& messages) {
67 preds[i].try_put(messages[i]);
84 preds[i].try_put(messages[i]);
99 preds[i].try_put(messages[i]);
116 preds[i].try_put(messages[i]);
159 CHECK_MESSAGE((messages.size() == 1),
162 node.try_put(messages[0]);
177 CHECK_MESSAGE((messages.size() == 3),
184 node.try_put(messages[i]);
199 CHECK_MESSAGE((messages.size() == 3),
[all …]
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Flow_Graph_Single_Vs_Broadcast.rst | 8 communicate by pushing and pulling messages. Two policies for pushing
9 messages are used, depending on the type of the node:
94 policy for forwarding messages. Putting three messages to the
95 ``buffer_node`` results in three messages being pushed. Notice also only
101 message it receives to all accepting successors. Putting three messages
102 to the ``broadcast_node`` results in a total of nine messages pushed to
106 Only nodes designed to buffer (hold and forward received messages) have
|
| H A D | use_limiter_node.rst | 8 limit on the number of messages that can flow through a given point in
20 through before the node starts rejecting incoming messages.
23 A limiter_node maintains an internal count of the messages that it has
26 decrement the count, allowing additional messages to pass through. In
77 therefore start rejecting incoming messages after its internal count
83 drops below the threshold, messages begin flowing from the ``input_node``
|
| H A D | use_concurrency_limits.rst | 8 concurrency limit on the node. To cause it to reject messages after it
15 reached its concurrency limit still accepts incoming messages, but
17 instead reject the incoming messages.
72 instances concurrently, it will start rejecting incoming messages from
76 messages from the ``input_node``. At most four big objects will exist
|
| H A D | Predefined_Node_Types.rst | 33 …currency level and buffering policy. The body can output zero or more messages on each output po…
35 …o all successors. Its input and output are of the same generic type. It does not buffer messages.
37 …t, single-output nodes that buffer messages and send their output to one successor. The order i…
39 …ple that is broadcast to all successors. The policy used to combine messages is selectable as …
43 …first message it receives, while the overwrite_node will accept all messages, broadcasting the…
45 …messages. A special input port can be used to adjust the internal count, allowing further mess…
51 … activity managed by the user or another runtime. This node receives messages of generic type, …
|
| H A D | broadcast_or_send.rst | 9 following predefined nodes push messages to a single successor:
18 Other nodes push messages to all successors that will accept them.
22 Their purpose is to hold messages temporarily, until they are consumed
59 First, function_nodes by default queue up the messages they receive at
63 incoming messages, but instead rely on upstream buffering in the
76 messages in the same order to all nodes or in the current priority order
80 arrives and f2 is available to accept messages. Should f2 receive "9"
|
| H A D | Data_Flow_Graph.rst | 8 messages. Some nodes may only send messages, others may only receive
9 messages, and others may send messages in response to messages that they
82 that puts messages to both the squarer and cuber node.
108 ``input_node``, as the name implies only sends messages and does not
109 receive messages. Its constructor takes two arguments:
|
| H A D | Flow_Graph_Reservation.rst | 9 ``key_matching`` and ``tag_matching``. ``join_nodes`` need messages at
12 messages from its inputs until it has a message at each input. To create
14 and only if all input ports succeed reserving messages will an output
33 messages and try to push the resulting message to any nodes connected
36 predecessors that were reserved are signaled that the messages were
37 used (by calling ``try_consume()``.) Those messages will be discarded
40 predecessors that were reserved are signaled that the messages were
41 not used (by calling ``try_release()``.) At this point, the messages
48 messages, at least one of the predecessors to each of the reserving
55 messages and do not support ``try_get()`` or ``try_reserve()``.
[all …]
|
| H A D | Flow_Graph_Buffering_in_Nodes.rst | 7 |full_name| flow graph nodes use messages
25 If a node discards messages that are not forwarded, and this behavior is
27 store messages that cannot be pushed.
|
| H A D | avoid_dynamic_node_removal.rst | 20 flow graph as nodes are actively processing messages in the graph.
22 nodes while there are messages being processed in the graph can lead to
|
| H A D | use_input_node.rst | 52 will receive all future messages, but may have already missed some.
68 function nodes, the following graph would not drop messages, even though
110 attached first might receive messages that do not reach the successors
|
| H A D | Nodes.rst | 10 may generate zero or more output messages. Some nodes require more than
72 messages to it, either by connecting it to other nodes using edges or by
85 You can then wait for the messages to be processed by calling
147 to one of the messages. If you have a sufficient number of threads
|
| H A D | Mapping_Nodes2Tasks.rst | 11 expression, λ\ :sub:`n`, on one of the three input messages. Because n
36 messages in the order that they arrive. When all tasks are complete, the
|
| H A D | Flow_Graph_resource_tips.rst | 7 You may want to control the number of messages allowed to enter parts of
|
| H A D | Graph_Main_Categories.rst | 12 data messages.
|
| H A D | Flow_Graph_Message_Passing_Protocol.rst | 8 messages between nodes. A node may not be able to receive and process a
|
| H A D | Dependence_Graph.rst | 32 predecessors they have, count the messages they receive and only spawn a
61 the nodes and continue_msg objects as the messages. A continue_node
|
| H A D | Edges.rst | 9 over which messages are passed. They are created by calling the function
|
| H A D | create_token_based_system.rst | 7 A more flexible solution to limit the number of messages in a flow graph
|
| /oneTBB/test/conformance/ |
| H A D | conformance_flowgraph.h | 81 std::vector<V> messages; in get_values() local
85 messages.push_back(tmp); in get_values()
87 return messages; in get_values()
92 std::vector<V> messages; in get_values() local
96 messages.push_back(tmp); in get_values()
98 return messages; in get_values()
|
| H A D | conformance_join_node.cpp | 31 std::vector<my_input_tuple> messages; in get_values() local
34 messages.push_back(tmp); in get_values()
36 return messages; in get_values()
|
| /oneTBB/cmake/compilers/ |
| H A D | MSVC.cmake | 32 …# https://docs.microsoft.com/en-us/cpp/error-messages/compiler-warnings/compiler-warning-level-1-c…
|
| /oneTBB/doc/ |
| H A D | Doxyfile.in | 87 # Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
88 # Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
719 # Configuration options related to warning and progress messages
722 # The QUIET tag can be used to turn on/off the messages that are generated to
724 # messages are off.
729 # The WARNINGS tag can be used to turn on/off the warning messages that are
767 # The WARN_FORMAT tag determines the format of the warning messages that doxygen
778 # messages should be written. If left blank the output is written to standard
|