FilesExpand file tree

 master

/

object_pool_test.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

148 lines (126 loc) · 3.32 KB

 master

/

object_pool_test.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

148 lines (126 loc) · 3.32 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

143

144

145

146

147

148

/*

* .============.

* // M A K E / \

* // C++ DEV / \

* // E A S Y / \/ \

* ++ ----------. \/\ .

* \\ \ \ /\ /

* \\ \ \ /

* \\ \ \ /

* -============'

*

* Copyright (c) 2018 Hevake and contributors, all rights reserved.

*

* This file is part of cpp-tbox (https://github.com/cpp-main/cpp-tbox)

* Use of this source code is governed by MIT license that can be found

* in the LICENSE file in the root of the source tree. All contributing

* project authors may be found in the CONTRIBUTORS.md file in the root

* of the source tree.

*/

#include <gtest/gtest.h>

#include "object_pool.hpp"

namespace tbox {

namespace {

TEST(ObjectPool, Char) {

ObjectPool<char> pool;

for (int i = 0; i < 10; ++i) {

auto p = pool.alloc('a' + i);

EXPECT_EQ(*p, 'a' + i);

pool.free(p);

}

}

TEST(ObjectPool, AllocMany) {

ObjectPool<int> pool(50);

std::vector<int*> tmp;

for (int i = 0; i < 100; ++i) {

auto p = pool.alloc(i);

tmp.push_back(p);

}

for (int *p : tmp)

pool.free(p);

tmp.clear();

for (int i = 0; i < 50; ++i) {

auto p = pool.alloc(i);

tmp.push_back(p);

}

for (int *p : tmp)

pool.free(p);

tmp.clear();

}

TEST(ObjectPool, Int) {

ObjectPool<int> pool;

for (int i = 0; i < 10; ++i) {

auto p = pool.alloc(123);

EXPECT_EQ(*p, 123);

pool.free(p);

}

}

TEST(ObjectPool, MyStruct) {

struct MyStruct {

MyStruct(int i) : i_(i) { }

char rev[100];

int i_;

};

ObjectPool<MyStruct> pool;

for (int i = 0; i < 10; ++i) {

auto p = pool.alloc(123);

EXPECT_EQ(p->i_, 123);

pool.free(p);

}

}

TEST(ObjectPool, Stat_1) {

ObjectPool<int> pool;

for (int i = 0; i < 10; ++i) {

auto p = pool.alloc();

pool.free(p);

}

auto stat = pool.getStat();

EXPECT_EQ(stat.total_alloc_times, 10);

EXPECT_EQ(stat.total_free_times, 10);

EXPECT_EQ(stat.peak_alloc_number, 1);

EXPECT_EQ(stat.peak_free_number, 1);

}

TEST(ObjectPool, Stat_2) {

ObjectPool<int> pool(5);

std::vector<int*> vec;

//! 先申请10

for (int i = 0; i < 10; ++i) {

auto p = pool.alloc();

vec.push_back(p);

}

auto stat = pool.getStat();

EXPECT_EQ(stat.total_alloc_times, 10);

EXPECT_EQ(stat.total_free_times, 0);

EXPECT_EQ(stat.peak_alloc_number, 10);

EXPECT_EQ(stat.peak_free_number, 0);

//! 释放10

for (auto p : vec)

pool.free(p);

vec.clear();

stat = pool.getStat();

EXPECT_EQ(stat.total_alloc_times, 10);

EXPECT_EQ(stat.total_free_times, 10);

EXPECT_EQ(stat.peak_alloc_number, 10);

EXPECT_EQ(stat.peak_free_number, 5);

//! 再申请3个

for (int i = 0; i < 3; ++i) {

auto p = pool.alloc();

vec.push_back(p);

}

stat = pool.getStat();

EXPECT_EQ(stat.total_alloc_times, 13);

EXPECT_EQ(stat.total_free_times, 10);

EXPECT_EQ(stat.peak_alloc_number, 10);

EXPECT_EQ(stat.peak_free_number, 5);

//! 释放3个

for (auto p : vec)

pool.free(p);

vec.clear();

stat = pool.getStat();

EXPECT_EQ(stat.total_alloc_times, 13);

EXPECT_EQ(stat.total_free_times, 13);

EXPECT_EQ(stat.peak_alloc_number, 10);

EXPECT_EQ(stat.peak_free_number, 5);

}

}

}