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
|
/*
* Copyright (c) 2018 Samsung Electronics Co., Ltd. All Rights Reserved
*
* 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 "backend/cpu/MemoryPlanner.h"
#include "model/operand/Index.h"
TEST(Allocator, allocate_test)
{
::neurun::backend::cpu::Allocator allocator(1024);
ASSERT_NE(allocator.base(), nullptr);
}
TEST(BumpPlanner, claim_test)
{
::neurun::backend::cpu::BumpPlanner planner;
auto claim = [&planner](uint32_t index, size_t size, uint32_t expected_offset) {
::neurun::model::operand::Index mem_idx(index);
planner.claim(mem_idx, size);
auto mem_blk = planner.memory_plans()[mem_idx];
ASSERT_EQ(mem_blk.offset, expected_offset);
ASSERT_EQ(mem_blk.size, size);
};
claim(0, 10, 0);
claim(1, 20, 10);
claim(2, 30, 30);
}
TEST(FirstFitPlanner, claim_release_test)
{
::neurun::backend::cpu::FirstFitPlanner planner;
auto claim = [&planner](uint32_t index, size_t size, uint32_t expected_offset) {
::neurun::model::operand::Index mem_idx(index);
planner.claim(mem_idx, size);
auto mem_blk = planner.memory_plans()[mem_idx];
ASSERT_EQ(mem_blk.offset, expected_offset);
ASSERT_EQ(mem_blk.size, size);
};
auto release = [&planner](uint32_t index) {
::neurun::model::operand::Index mem_idx(index);
planner.release(mem_idx);
};
// 0 CLAIM - 10
claim(0, 10, 0);
// 1 CLAIM - 20
claim(1, 20, 10);
// 2 CLAIM - 30
claim(2, 30, 30);
// 0 RELEASE - 10
release(0);
// 3 CLAIM - 20
claim(3, 20, 60);
// 4 CLAIM - 5
claim(4, 5, 0);
// 5 CLAIM - 10
claim(5, 10, 80);
// 6 CLAIM - 5
claim(6, 5, 5);
// 2 RELEASE - 30
release(2);
// 7 CLAIM - 35
claim(7, 35, 90);
// 8 CLAIM - 10
claim(8, 10, 30);
// 4 RELEASE - 5
release(4);
// 9 CLAIM - 10
claim(9, 10, 40);
// 10 CLAIM - 10
claim(10, 10, 50);
// 6 RELEASE
release(6);
// 1 RELEASE
release(1);
// 8 RELEASE
release(8);
// 9 RELEASE
release(9);
// 10 RELEASE
release(10);
// 3 RELEASE
release(3);
// 5 RELEASE
release(5);
// 7 RELEASE
release(7);
}
|
