mirror of
https://github.com/saymrwulf/onnxruntime.git
synced 2026-06-18 01:54:05 +00:00
00412a76e9
* Exclude some training specific code around the allocation planning and initializer handling from the minimal build. Simplify the code around tracking start/end usage of a value.
39 lines
1.4 KiB
C++
39 lines
1.4 KiB
C++
// Copyright (c) Microsoft Corporation. All rights reserved.
|
|
// Licensed under the MIT License.
|
|
|
|
#include "core/framework/mem_pattern_planner.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
namespace onnxruntime {
|
|
namespace test {
|
|
TEST(MemPatternPlannerTest, TraceAllocaitonTest) {
|
|
const bool using_counters = false; // we're not tracking start/end for use/re-use of each allocation via counters
|
|
MemPatternPlanner planner{using_counters};
|
|
planner.TraceAllocation(0, 1024);
|
|
planner.TraceAllocation(1, 256);
|
|
planner.TraceAllocation(2, 512);
|
|
planner.TraceAllocation(3, 1024);
|
|
|
|
auto pattern = planner.GenerateMemPattern();
|
|
|
|
EXPECT_EQ(pattern.PeakSize(), 1024u + 256u + 512u + 1024u);
|
|
EXPECT_EQ(pattern.GetBlock(0)->offset_, 0u);
|
|
EXPECT_EQ(pattern.GetBlock(1)->offset_, 1024u);
|
|
EXPECT_EQ(pattern.GetBlock(2)->offset_, 1024 + 256u);
|
|
EXPECT_EQ(pattern.GetBlock(3)->offset_, 1024u + 256u + 512u);
|
|
|
|
planner.TraceFree(1);
|
|
planner.TraceAllocation(4, 512);
|
|
planner.TraceFree(3);
|
|
planner.TraceAllocation(5, 600);
|
|
planner.TraceAllocation(6, 200);
|
|
|
|
pattern = planner.GenerateMemPattern();
|
|
|
|
EXPECT_EQ(pattern.PeakSize(), 1024u + 256u + 512u + 1024u + 512u);
|
|
EXPECT_EQ(pattern.GetBlock(4)->offset_, 1024u + 256u + 512u + 1024u);
|
|
EXPECT_EQ(pattern.GetBlock(5)->offset_, 1024u + 256u + 512u);
|
|
EXPECT_EQ(pattern.GetBlock(6)->offset_, 1024u);
|
|
}
|
|
} // namespace test
|
|
} // namespace onnxruntime
|