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
149
150
151
152
|
// Copyright 2024 Huawei Cloud Computing Technology Co., Ltd.
//
// 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 "test/utils/large_objects/large_object_utils.hpp"
#include <cstddef>
#include <fstream>
#include <limits>
#include <random>
#include <string>
#include "src/buildtool/file_system/file_system_manager.hpp"
#include "src/utils/cpp/gsl.hpp"
namespace {
class Randomizer final {
public:
Randomizer(std::uint64_t min, std::uint64_t max) noexcept
: range_(std::random_device{}()), distribution_(min, max) {}
[[nodiscard]] inline auto Get() noexcept -> uint64_t {
return distribution_(range_);
}
private:
std::mt19937_64 range_;
std::uniform_int_distribution<std::mt19937_64::result_type> distribution_;
};
/// \brief Create a number of chunks of the predefined size.
/// \tparam UChunkLength Length of each chunk.
/// \tparam USize Number of chunks.
template <size_t kChunkLength, size_t kPoolSize>
class ChunkPool final {
public:
[[nodiscard]] static auto Instance() noexcept
-> ChunkPool<kChunkLength, kPoolSize> const& {
static ChunkPool<kChunkLength, kPoolSize> pool;
return pool;
}
[[nodiscard]] auto operator[](size_t index) const noexcept
-> std::string const& {
return gsl::at(pool_, static_cast<std::ptrdiff_t>(index));
}
private:
std::array<std::string, kPoolSize> pool_;
explicit ChunkPool() noexcept {
// Starts from 1 to exclude '\0' from randomization
Randomizer randomizer{1, std::numeric_limits<char>::max()};
for (size_t i = 0; i < pool_.size(); ++i) {
auto& chunk = gsl::at(pool_, static_cast<std::ptrdiff_t>(i));
chunk.resize(kChunkLength);
for (size_t j = 0; j < kChunkLength; ++j) {
chunk[j] = randomizer.Get();
}
}
}
};
} // namespace
auto LargeObjectUtils::GenerateFile(std::filesystem::path const& path,
std::uintmax_t size) noexcept -> bool {
// Remove the file, if exists:
if (not FileSystemManager::RemoveFile(path)) {
return false;
}
static constexpr size_t kChunkLength = 128;
static constexpr size_t kPoolSize = 64;
using Pool = ChunkPool<kChunkLength, kPoolSize>;
// To create a random file, the initial chunk position and the shift are
// randomized:
Randomizer randomizer{std::numeric_limits<size_t>::min(),
std::numeric_limits<size_t>::max()};
const size_t pool_index = randomizer.Get() % kPoolSize;
const size_t pool_shift = randomizer.Get() % 10;
const size_t step_count = size / kChunkLength + 1;
try {
std::ofstream stream(path);
for (size_t i = 0; i < step_count && stream.good(); ++i) {
const size_t index = (pool_index + i * pool_shift) % kPoolSize;
if (i != step_count - 1) {
stream << Pool::Instance()[index];
}
else {
auto count = std::min(size - kChunkLength * i, kChunkLength);
stream << Pool::Instance()[index].substr(0, count);
}
}
if (not stream.good()) {
return false;
}
stream.close();
} catch (...) {
return false;
}
return true;
}
auto LargeObjectUtils::GenerateDirectory(std::filesystem::path const& path,
std::uintmax_t entries_count) noexcept
-> bool {
// Recreate the directory:
if (not FileSystemManager::RemoveDirectory(path) or
not FileSystemManager::CreateDirectory(path)) {
return false;
}
Randomizer randomizer{std::numeric_limits<size_t>::min(),
std::numeric_limits<size_t>::max()};
std::uintmax_t entries = 0;
while (entries < entries_count) {
// Randomize the number for a file:
auto const random_number = randomizer.Get();
auto const file_name =
std::string(kTreeEntryPrefix) + std::to_string(random_number);
std::filesystem::path const file_path = path / file_name;
// Check file uniqueness:
if (FileSystemManager::IsFile(file_path)) {
continue;
}
try {
std::ofstream stream(file_path);
stream << random_number;
stream.close();
} catch (...) {
return false;
}
++entries;
}
return true;
}
|
