1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
/*
* Copyright 2019 Xilinx Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <gtest/gtest.h>
#include <iostream>
#include <memory>
#include <vitis/ai/profiling.hpp>
#include <vitis/ai/ring_queue.hpp>
using namespace vitis::ai;
static constexpr int QUEUE_SIZE = 1000;
template <typename T>
class TestQueue : public ::testing::Test {
public:
TestQueue() {}
virtual ~TestQueue() {}
void SetUp() { queue = std::make_shared<RingQueue<T>>(QUEUE_SIZE); }
void TearDown() {}
std::shared_ptr<RingQueue<T>> queue;
};
class TestIntQueue : public TestQueue<int> {};
TEST_F(TestIntQueue, TestPushPop) {
int in = 5;
__TIC__(PUSH)
queue->push(in);
__TOC__(PUSH)
int out;
__TIC__(POP)
bool ret = queue->pop(out);
__TOC__(POP)
EXPECT_TRUE(ret) << "should be able to pop";
EXPECT_EQ(in, out);
}
TEST_F(TestIntQueue, TestPopEmptyQueue) {
int out;
bool ret = queue->pop(out);
EXPECT_FALSE(ret) << "should fail to pop";
}
TEST_F(TestIntQueue, TestPushFullQueue) {
for (int i = 0; i < QUEUE_SIZE; i++) {
queue->push(i);
}
int in = 1001;
queue->push(in);
int out;
int sum = 0;
int expected_sum = 1001;
for (int i = 0; i < QUEUE_SIZE; i++) {
while (!queue->pop(out))
;
sum += out;
expected_sum += i;
}
EXPECT_EQ(expected_sum, sum);
}
|
