queue/main.cpp at master · crespo2014/queue · GitHub

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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
/*
 * main.cpp
 *
 *  Created on: 17 Oct 2014
 *      Author: lester
 */

#include "queue.h"
#include <thread>
#include <unistd.h>
#include <ostream>
#include <iostream>

#include "CppUTest/TestHarness.h"
#include "CppUTestExt/MockSupport.h"
#include "CppUTest/MemoryLeakDetectorNewMacros.h"
#include "CppUTest/CommandLineTestRunner.h"

TEST_GROUP(queue)
{

};

TEST(queue,droped)
{
    size_t count, drop;
    Queue<char, 3, 5> q;
    auto r1 = q.getReader();
    auto r2 = q.getReader();
    auto r3 = q.getReader();

    CHECK(q.get(1) != nullptr);
    q.Commit(5);    // one block full
    CHECK(q.get(1) != nullptr);
    q.Commit(5);    // two block full
    CHECK(q.get(1) != nullptr);
    q.Commit(5);    // 3 block full
    CHECK(q.get(2) != nullptr);     // 5 drops for readers
    q.Commit(2);

    CHECK(r1.get(count, drop) != nullptr);  //read b 1
    CHECK(count == 5);
    CHECK(drop == 0);

    CHECK(r1.get(count, drop) != nullptr);
    CHECK(count == 5);
    CHECK(drop == 5);

    CHECK(r2.get(count, drop) != nullptr);  //read b 1
    CHECK(count == 5);
    CHECK(drop == 0);

    CHECK(r2.get(count, drop) != nullptr);
    CHECK(count == 5);
    CHECK(drop == 5);

    CHECK(r3.get(count, drop) != nullptr);  //read b 1
    CHECK(count == 5);
    CHECK(drop == 0);

    CHECK(r3.get(count, drop) != nullptr);
    CHECK(count == 5);
    CHECK(drop == 5);
}

TEST(queue,full)
{
    size_t count, drop;
    Queue<char, 3, 5> q;
    auto r1 = q.getReader();
    auto r2 = q.getReader();
    auto r3 = q.getReader();

    CHECK(q.get(1) != nullptr);
    q.Commit(5);    // one block full
    CHECK(q.get(1) != nullptr);
    q.Commit(5);    // two block full
    CHECK(q.get(1) != nullptr);
    q.Commit(5);    // 3 block full

    CHECK(r1.get(count, drop) != nullptr);  //read b 1
    CHECK(count == 5);
    CHECK(drop == 0);

    CHECK(r1.get(count, drop) != nullptr);
    CHECK(count == 5);
    CHECK(drop == 0);

    CHECK(r1.get(count, drop) != nullptr);
    CHECK(count == 5);
    CHECK(drop == 0);

    CHECK(r2.get(count, drop) != nullptr);      //read 1
    CHECK(count == 5);
    CHECK(drop == 0);

    //move reader to to second block
    CHECK(r2.get(count, drop) != nullptr); // go to 2 get 5 drop
    CHECK(count == 5);
    CHECK(drop == 0);

    // try to produce more data with all block lock
    CHECK(q.get(5) == nullptr);

    //make room
    CHECK(r2.get(count, drop) != nullptr); // go to 2 get 5 drop
    CHECK(count == 5);
    CHECK(drop == 0);

    // try to produce more data with all block lock
    CHECK(q.get(5) != nullptr);

}


TEST(queue,close_reader)
{
    size_t count, drop;
    Queue<char, 3, 5> q;

    auto r1 = q.getReader();

    std::thread t([&]()
    {   sleep(2);r1.close();});
    r1.get(count, drop);
    CHECK(count == 0);
    t.join();
}

#ifdef CPP_UTEST
int main(int ac, char** av)
{
    return CommandLineTestRunner::RunAllTests(ac, av);
}
#else
int main()
{
    //test();
    return 0;
}

#endif