151c0b2f7Stbbdev /* 2b15aabb3Stbbdev Copyright (c) 2020-2021 Intel Corporation 351c0b2f7Stbbdev 451c0b2f7Stbbdev Licensed under the Apache License, Version 2.0 (the "License"); 551c0b2f7Stbbdev you may not use this file except in compliance with the License. 651c0b2f7Stbbdev You may obtain a copy of the License at 751c0b2f7Stbbdev 851c0b2f7Stbbdev http://www.apache.org/licenses/LICENSE-2.0 951c0b2f7Stbbdev 1051c0b2f7Stbbdev Unless required by applicable law or agreed to in writing, software 1151c0b2f7Stbbdev distributed under the License is distributed on an "AS IS" BASIS, 1251c0b2f7Stbbdev WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 1351c0b2f7Stbbdev See the License for the specific language governing permissions and 1451c0b2f7Stbbdev limitations under the License. 1551c0b2f7Stbbdev */ 1651c0b2f7Stbbdev 17b15aabb3Stbbdev #if __INTEL_COMPILER && _MSC_VER 18b15aabb3Stbbdev #pragma warning(disable : 2586) // decorated name length exceeded, name was truncated 19b15aabb3Stbbdev #endif 2051c0b2f7Stbbdev 21*de0109beSIlya Mishin #define CONFORMANCE_BUFFERING_NODES 22*de0109beSIlya Mishin #define CONFORMANCE_QUEUE_NODE 2351c0b2f7Stbbdev 2451c0b2f7Stbbdev #include "conformance_flowgraph.h" 2551c0b2f7Stbbdev 2651c0b2f7Stbbdev //! \file conformance_queue_node.cpp 2751c0b2f7Stbbdev //! \brief Test for [flow_graph.queue_node] specification 2851c0b2f7Stbbdev 29*de0109beSIlya Mishin //! Test queue_node single_push 3051c0b2f7Stbbdev //! \brief \ref requirement 31*de0109beSIlya Mishin TEST_CASE("queue_node single_push"){ 32*de0109beSIlya Mishin conformance::test_forwarding_single_push<oneapi::tbb::flow::queue_node<int>>(); 3351c0b2f7Stbbdev } 3451c0b2f7Stbbdev 35*de0109beSIlya Mishin //! Test function_node buffering 3651c0b2f7Stbbdev //! \brief \ref requirement 3751c0b2f7Stbbdev TEST_CASE("queue_node buffering"){ 38*de0109beSIlya Mishin conformance::test_buffering<oneapi::tbb::flow::queue_node<int>, int>(); 3951c0b2f7Stbbdev } 4051c0b2f7Stbbdev 41*de0109beSIlya Mishin //! Constructs an empty queue_node that belongs to the same graph g as src. 42*de0109beSIlya Mishin //! Any intermediate state of src, including its links to predecessors and successors, is not copied. 4351c0b2f7Stbbdev //! \brief \ref requirement 4451c0b2f7Stbbdev TEST_CASE("queue_node copy constructor"){ 45*de0109beSIlya Mishin conformance::test_copy_ctor_for_buffering_nodes<oneapi::tbb::flow::queue_node<int>>(); 4651c0b2f7Stbbdev } 4751c0b2f7Stbbdev 4851c0b2f7Stbbdev //! Test inheritance relations 4951c0b2f7Stbbdev //! \brief \ref interface 5051c0b2f7Stbbdev TEST_CASE("queue_node superclasses"){ 51*de0109beSIlya Mishin conformance::test_inheritance<oneapi::tbb::flow::queue_node<int>, int, int>(); 52*de0109beSIlya Mishin conformance::test_inheritance<oneapi::tbb::flow::queue_node<void*>, void*, void*>(); 5351c0b2f7Stbbdev } 5451c0b2f7Stbbdev 55*de0109beSIlya Mishin //! Test queue_node node `try_put()` and `try_get()` 56*de0109beSIlya Mishin //! \brief \ref requirement 57*de0109beSIlya Mishin TEST_CASE("queue_node methods"){ 58*de0109beSIlya Mishin oneapi::tbb::flow::graph g; 59*de0109beSIlya Mishin oneapi::tbb::flow::queue_node<int> testing_node(g); 60*de0109beSIlya Mishin 61*de0109beSIlya Mishin int tmp1 = -1; 62*de0109beSIlya Mishin int tmp2 = -1; 63*de0109beSIlya Mishin 64*de0109beSIlya Mishin CHECK_MESSAGE((!testing_node.try_get(tmp1) && tmp1 == -1), "`try_get` must returns false if there is no non-reserved item currently in the node."); 65*de0109beSIlya Mishin 66*de0109beSIlya Mishin testing_node.try_put(1); 67*de0109beSIlya Mishin testing_node.try_put(2); 68*de0109beSIlya Mishin g.wait_for_all(); 69*de0109beSIlya Mishin 70*de0109beSIlya Mishin testing_node.try_get(tmp1); 71*de0109beSIlya Mishin CHECK_MESSAGE((tmp1 == 1), "Messages must be an FIFO order"); 72*de0109beSIlya Mishin 73*de0109beSIlya Mishin testing_node.try_get(tmp2); 74*de0109beSIlya Mishin CHECK_MESSAGE((tmp2 == 2), "Additional `try_get()' does not receive the same value as previous"); 75*de0109beSIlya Mishin } 76