Lines Matching refs:qnode0
236 tbb::flow::queue_node<int> qnode0(g); in TestFunctionNode() local
243 tbb::flow::make_edge(qnode0, fnode0); in TestFunctionNode()
246 qnode0.try_put(1); in TestFunctionNode()
250 tbb::flow::remove_edge(qnode0, fnode0); in TestFunctionNode()
254 tbb::flow::make_edge(qnode0, fnode1); in TestFunctionNode()
257 qnode0.try_put(1); in TestFunctionNode()
260 tbb::flow::remove_edge(qnode0, fnode1); in TestFunctionNode()
269 … tbb::flow::make_edge(qnode0, fnode0); // TODO: invesigate why it always creates a forwarding task in TestFunctionNode()
273 qnode0.try_put(1); in TestFunctionNode()
274 qnode0.try_put(2); // rejecting node should reject, reverse. in TestFunctionNode()
288 CHECK_MESSAGE( (!qnode0.my_successors.empty()), "empty successors after reset()"); in TestFunctionNode()
290 tbb::flow::remove_edge(qnode0, fnode0); in TestFunctionNode()
300 CHECK_MESSAGE( (fnode1.register_predecessor(qnode0)), "Cannot register as predecessor"); in TestFunctionNode()
305 CHECK_MESSAGE( (!qnode0.my_successors.empty()), "empty successors after reset()"); in TestFunctionNode()
307 tbb::flow::remove_edge(qnode0, fnode1); in TestFunctionNode()
316 … tbb::flow::make_edge(qnode0, fnode0); // TODO: invesigate why it always creates a forwarding task in TestFunctionNode()
319 qnode0.try_put(1); in TestFunctionNode()
322 qnode0.try_put(2); // start queue node. in TestFunctionNode()
338 …CHECK_MESSAGE( (fnode0.my_predecessors.empty() && qnode0.my_successors.empty()), "function_node ed… in TestFunctionNode()