2016-02-09 23:12:00 +00:00
|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
2017-07-15 23:03:42 +00:00
|
|
|
// This source code is licensed under both the GPLv2 (found in the
|
|
|
|
// COPYING file in the root directory) and Apache 2.0 License
|
|
|
|
// (found in the LICENSE.Apache file in the root directory).
|
2013-10-16 21:59:46 +00:00
|
|
|
//
|
2017-04-06 21:49:13 +00:00
|
|
|
#include "util/string_util.h"
|
|
|
|
|
|
|
|
#include <algorithm>
|
2024-03-04 18:08:32 +00:00
|
|
|
#include <cerrno>
|
Refactor trimming logic for immutable memtables (#5022)
Summary:
MyRocks currently sets `max_write_buffer_number_to_maintain` in order to maintain enough history for transaction conflict checking. The effectiveness of this approach depends on the size of memtables. When memtables are small, it may not keep enough history; when memtables are large, this may consume too much memory.
We are proposing a new way to configure memtable list history: by limiting the memory usage of immutable memtables. The new option is `max_write_buffer_size_to_maintain` and it will take precedence over the old `max_write_buffer_number_to_maintain` if they are both set to non-zero values. The new option accounts for the total memory usage of flushed immutable memtables and mutable memtable. When the total usage exceeds the limit, RocksDB may start dropping immutable memtables (which is also called trimming history), starting from the oldest one.
The semantics of the old option actually works both as an upper bound and lower bound. History trimming will start if number of immutable memtables exceeds the limit, but it will never go below (limit-1) due to history trimming.
In order the mimic the behavior with the new option, history trimming will stop if dropping the next immutable memtable causes the total memory usage go below the size limit. For example, assuming the size limit is set to 64MB, and there are 3 immutable memtables with sizes of 20, 30, 30. Although the total memory usage is 80MB > 64MB, dropping the oldest memtable will reduce the memory usage to 60MB < 64MB, so in this case no memtable will be dropped.
Pull Request resolved: https://github.com/facebook/rocksdb/pull/5022
Differential Revision: D14394062
Pulled By: miasantreble
fbshipit-source-id: 60457a509c6af89d0993f988c9b5c2aa9e45f5c5
2019-08-23 20:54:09 +00:00
|
|
|
#include <cinttypes>
|
2017-04-06 21:49:13 +00:00
|
|
|
#include <cmath>
|
2024-03-04 18:08:32 +00:00
|
|
|
#include <cstdio>
|
|
|
|
#include <cstdlib>
|
2013-05-21 18:37:06 +00:00
|
|
|
#include <sstream>
|
|
|
|
#include <string>
|
2017-04-06 21:49:13 +00:00
|
|
|
#include <utility>
|
2013-05-21 18:37:06 +00:00
|
|
|
#include <vector>
|
2022-10-26 19:08:20 +00:00
|
|
|
|
2019-03-12 20:46:12 +00:00
|
|
|
#include "port/port.h"
|
2019-07-04 02:03:29 +00:00
|
|
|
#include "port/sys_time.h"
|
2017-04-06 21:49:13 +00:00
|
|
|
#include "rocksdb/slice.h"
|
2013-05-21 18:37:06 +00:00
|
|
|
|
2021-03-25 06:06:31 +00:00
|
|
|
#ifndef __has_cpp_attribute
|
|
|
|
#define ROCKSDB_HAS_CPP_ATTRIBUTE(x) 0
|
|
|
|
#else
|
|
|
|
#define ROCKSDB_HAS_CPP_ATTRIBUTE(x) __has_cpp_attribute(x)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if ROCKSDB_HAS_CPP_ATTRIBUTE(maybe_unused) && __cplusplus >= 201703L
|
|
|
|
#define ROCKSDB_MAYBE_UNUSED [[maybe_unused]]
|
|
|
|
#elif ROCKSDB_HAS_CPP_ATTRIBUTE(gnu::unused) || __GNUC__
|
|
|
|
#define ROCKSDB_MAYBE_UNUSED [[gnu::unused]]
|
|
|
|
#else
|
|
|
|
#define ROCKSDB_MAYBE_UNUSED
|
|
|
|
#endif
|
|
|
|
|
2020-02-20 20:07:53 +00:00
|
|
|
namespace ROCKSDB_NAMESPACE {
|
2013-05-21 18:37:06 +00:00
|
|
|
|
2017-04-06 21:49:13 +00:00
|
|
|
const std::string kNullptrString = "nullptr";
|
|
|
|
|
2014-11-21 16:05:28 +00:00
|
|
|
std::vector<std::string> StringSplit(const std::string& arg, char delim) {
|
2014-04-10 04:17:14 +00:00
|
|
|
std::vector<std::string> splits;
|
|
|
|
std::stringstream ss(arg);
|
|
|
|
std::string item;
|
|
|
|
while (std::getline(ss, item, delim)) {
|
2013-05-21 18:37:06 +00:00
|
|
|
splits.push_back(item);
|
|
|
|
}
|
|
|
|
return splits;
|
|
|
|
}
|
2014-04-10 04:17:14 +00:00
|
|
|
|
2017-04-06 21:49:13 +00:00
|
|
|
// for micros < 10ms, print "XX us".
|
|
|
|
// for micros < 10sec, print "XX ms".
|
|
|
|
// for micros >= 10 sec, print "XX sec".
|
|
|
|
// for micros <= 1 hour, print Y:X M:S".
|
|
|
|
// for micros > 1 hour, print Z:Y:X H:M:S".
|
|
|
|
int AppendHumanMicros(uint64_t micros, char* output, int len,
|
|
|
|
bool fixed_format) {
|
|
|
|
if (micros < 10000 && !fixed_format) {
|
|
|
|
return snprintf(output, len, "%" PRIu64 " us", micros);
|
|
|
|
} else if (micros < 10000000 && !fixed_format) {
|
|
|
|
return snprintf(output, len, "%.3lf ms",
|
|
|
|
static_cast<double>(micros) / 1000);
|
|
|
|
} else if (micros < 1000000l * 60 && !fixed_format) {
|
|
|
|
return snprintf(output, len, "%.3lf sec",
|
|
|
|
static_cast<double>(micros) / 1000000);
|
|
|
|
} else if (micros < 1000000ll * 60 * 60 && !fixed_format) {
|
|
|
|
return snprintf(output, len, "%02" PRIu64 ":%05.3f M:S",
|
|
|
|
micros / 1000000 / 60,
|
|
|
|
static_cast<double>(micros % 60000000) / 1000000);
|
|
|
|
} else {
|
|
|
|
return snprintf(output, len, "%02" PRIu64 ":%02" PRIu64 ":%05.3f H:M:S",
|
|
|
|
micros / 1000000 / 3600, (micros / 1000000 / 60) % 60,
|
|
|
|
static_cast<double>(micros % 60000000) / 1000000);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// for sizes >=10TB, print "XXTB"
|
|
|
|
// for sizes >=10GB, print "XXGB"
|
|
|
|
// etc.
|
|
|
|
// append file size summary to output and return the len
|
|
|
|
int AppendHumanBytes(uint64_t bytes, char* output, int len) {
|
|
|
|
const uint64_t ull10 = 10;
|
|
|
|
if (bytes >= ull10 << 40) {
|
|
|
|
return snprintf(output, len, "%" PRIu64 "TB", bytes >> 40);
|
|
|
|
} else if (bytes >= ull10 << 30) {
|
|
|
|
return snprintf(output, len, "%" PRIu64 "GB", bytes >> 30);
|
|
|
|
} else if (bytes >= ull10 << 20) {
|
|
|
|
return snprintf(output, len, "%" PRIu64 "MB", bytes >> 20);
|
|
|
|
} else if (bytes >= ull10 << 10) {
|
|
|
|
return snprintf(output, len, "%" PRIu64 "KB", bytes >> 10);
|
|
|
|
} else {
|
|
|
|
return snprintf(output, len, "%" PRIu64 "B", bytes);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void AppendNumberTo(std::string* str, uint64_t num) {
|
|
|
|
char buf[30];
|
|
|
|
snprintf(buf, sizeof(buf), "%" PRIu64, num);
|
|
|
|
str->append(buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
void AppendEscapedStringTo(std::string* str, const Slice& value) {
|
|
|
|
for (size_t i = 0; i < value.size(); i++) {
|
|
|
|
char c = value[i];
|
|
|
|
if (c >= ' ' && c <= '~') {
|
|
|
|
str->push_back(c);
|
|
|
|
} else {
|
|
|
|
char buf[10];
|
|
|
|
snprintf(buf, sizeof(buf), "\\x%02x",
|
|
|
|
static_cast<unsigned int>(c) & 0xff);
|
|
|
|
str->append(buf);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string NumberToHumanString(int64_t num) {
|
2024-01-10 18:17:31 +00:00
|
|
|
char buf[21];
|
|
|
|
int64_t absnum;
|
|
|
|
|
|
|
|
if (num < 0) {
|
|
|
|
// abs(INT64_MIN) is INT64_MAX+1 which overflows int64_t and become itself.
|
|
|
|
// So we convert it to INT64_MAX to avoid fall into <10000 slot.
|
|
|
|
absnum = num == INT64_MIN ? INT64_MAX : -num;
|
|
|
|
} else {
|
|
|
|
absnum = num;
|
|
|
|
}
|
|
|
|
|
2017-04-06 21:49:13 +00:00
|
|
|
if (absnum < 10000) {
|
|
|
|
snprintf(buf, sizeof(buf), "%" PRIi64, num);
|
|
|
|
} else if (absnum < 10000000) {
|
|
|
|
snprintf(buf, sizeof(buf), "%" PRIi64 "K", num / 1000);
|
|
|
|
} else if (absnum < 10000000000LL) {
|
|
|
|
snprintf(buf, sizeof(buf), "%" PRIi64 "M", num / 1000000);
|
|
|
|
} else {
|
|
|
|
snprintf(buf, sizeof(buf), "%" PRIi64 "G", num / 1000000000);
|
|
|
|
}
|
|
|
|
return std::string(buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string BytesToHumanString(uint64_t bytes) {
|
|
|
|
const char* size_name[] = {"KB", "MB", "GB", "TB"};
|
|
|
|
double final_size = static_cast<double>(bytes);
|
|
|
|
size_t size_idx;
|
|
|
|
|
|
|
|
// always start with KB
|
|
|
|
final_size /= 1024;
|
|
|
|
size_idx = 0;
|
|
|
|
|
|
|
|
while (size_idx < 3 && final_size >= 1024) {
|
|
|
|
final_size /= 1024;
|
|
|
|
size_idx++;
|
|
|
|
}
|
|
|
|
|
|
|
|
char buf[20];
|
|
|
|
snprintf(buf, sizeof(buf), "%.2f %s", final_size, size_name[size_idx]);
|
|
|
|
return std::string(buf);
|
|
|
|
}
|
|
|
|
|
2019-07-04 02:03:29 +00:00
|
|
|
std::string TimeToHumanString(int unixtime) {
|
|
|
|
char time_buffer[80];
|
|
|
|
time_t rawtime = unixtime;
|
|
|
|
struct tm tInfo;
|
2022-05-25 01:20:17 +00:00
|
|
|
struct tm* timeinfo = port::LocalTimeR(&rawtime, &tInfo);
|
2019-07-04 02:03:29 +00:00
|
|
|
assert(timeinfo == &tInfo);
|
|
|
|
strftime(time_buffer, 80, "%c", timeinfo);
|
|
|
|
return std::string(time_buffer);
|
|
|
|
}
|
|
|
|
|
2017-04-06 21:49:13 +00:00
|
|
|
std::string EscapeString(const Slice& value) {
|
|
|
|
std::string r;
|
|
|
|
AppendEscapedStringTo(&r, value);
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ConsumeDecimalNumber(Slice* in, uint64_t* val) {
|
|
|
|
uint64_t v = 0;
|
|
|
|
int digits = 0;
|
|
|
|
while (!in->empty()) {
|
|
|
|
char c = (*in)[0];
|
|
|
|
if (c >= '0' && c <= '9') {
|
|
|
|
++digits;
|
|
|
|
const unsigned int delta = (c - '0');
|
|
|
|
static const uint64_t kMaxUint64 = ~static_cast<uint64_t>(0);
|
|
|
|
if (v > kMaxUint64 / 10 ||
|
|
|
|
(v == kMaxUint64 / 10 && delta > kMaxUint64 % 10)) {
|
|
|
|
// Overflow
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
v = (v * 10) + delta;
|
|
|
|
in->remove_prefix(1);
|
|
|
|
} else {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*val = v;
|
|
|
|
return (digits > 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isSpecialChar(const char c) {
|
|
|
|
if (c == '\\' || c == '#' || c == ':' || c == '\r' || c == '\n') {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
using CharMap = std::pair<char, char>;
|
|
|
|
}
|
|
|
|
|
|
|
|
char UnescapeChar(const char c) {
|
|
|
|
static const CharMap convert_map[] = {{'r', '\r'}, {'n', '\n'}};
|
|
|
|
|
|
|
|
auto iter = std::find_if(std::begin(convert_map), std::end(convert_map),
|
|
|
|
[c](const CharMap& p) { return p.first == c; });
|
|
|
|
|
|
|
|
if (iter == std::end(convert_map)) {
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
return iter->second;
|
|
|
|
}
|
|
|
|
|
|
|
|
char EscapeChar(const char c) {
|
|
|
|
static const CharMap convert_map[] = {{'\n', 'n'}, {'\r', 'r'}};
|
|
|
|
|
|
|
|
auto iter = std::find_if(std::begin(convert_map), std::end(convert_map),
|
|
|
|
[c](const CharMap& p) { return p.first == c; });
|
|
|
|
|
|
|
|
if (iter == std::end(convert_map)) {
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
return iter->second;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string EscapeOptionString(const std::string& raw_string) {
|
|
|
|
std::string output;
|
|
|
|
for (auto c : raw_string) {
|
|
|
|
if (isSpecialChar(c)) {
|
|
|
|
output += '\\';
|
|
|
|
output += EscapeChar(c);
|
|
|
|
} else {
|
|
|
|
output += c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return output;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string UnescapeOptionString(const std::string& escaped_string) {
|
|
|
|
bool escaped = false;
|
|
|
|
std::string output;
|
|
|
|
|
|
|
|
for (auto c : escaped_string) {
|
|
|
|
if (escaped) {
|
|
|
|
output += UnescapeChar(c);
|
|
|
|
escaped = false;
|
|
|
|
} else {
|
|
|
|
if (c == '\\') {
|
|
|
|
escaped = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
output += c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return output;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string trim(const std::string& str) {
|
2024-03-04 18:08:32 +00:00
|
|
|
if (str.empty()) {
|
|
|
|
return std::string();
|
|
|
|
}
|
2017-04-06 21:49:13 +00:00
|
|
|
size_t start = 0;
|
|
|
|
size_t end = str.size() - 1;
|
2018-02-16 00:43:23 +00:00
|
|
|
while (isspace(str[start]) != 0 && start < end) {
|
2017-04-06 21:49:13 +00:00
|
|
|
++start;
|
|
|
|
}
|
2018-02-16 00:43:23 +00:00
|
|
|
while (isspace(str[end]) != 0 && start < end) {
|
2017-04-06 21:49:13 +00:00
|
|
|
--end;
|
|
|
|
}
|
|
|
|
if (start <= end) {
|
|
|
|
return str.substr(start, end - start + 1);
|
|
|
|
}
|
|
|
|
return std::string();
|
|
|
|
}
|
|
|
|
|
2020-05-21 17:56:40 +00:00
|
|
|
bool EndsWith(const std::string& string, const std::string& pattern) {
|
|
|
|
size_t plen = pattern.size();
|
|
|
|
size_t slen = string.size();
|
|
|
|
if (plen <= slen) {
|
|
|
|
return string.compare(slen - plen, plen, pattern) == 0;
|
|
|
|
} else {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool StartsWith(const std::string& string, const std::string& pattern) {
|
|
|
|
return string.compare(0, pattern.size(), pattern) == 0;
|
|
|
|
}
|
|
|
|
|
2017-04-06 21:49:13 +00:00
|
|
|
|
|
|
|
bool ParseBoolean(const std::string& type, const std::string& value) {
|
|
|
|
if (value == "true" || value == "1") {
|
|
|
|
return true;
|
|
|
|
} else if (value == "false" || value == "0") {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
throw std::invalid_argument(type);
|
|
|
|
}
|
|
|
|
|
2021-05-20 04:40:43 +00:00
|
|
|
uint8_t ParseUint8(const std::string& value) {
|
|
|
|
uint64_t num = ParseUint64(value);
|
|
|
|
if ((num >> 8LL) == 0) {
|
|
|
|
return static_cast<uint8_t>(num);
|
|
|
|
} else {
|
|
|
|
throw std::out_of_range(value);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-04-06 21:49:13 +00:00
|
|
|
uint32_t ParseUint32(const std::string& value) {
|
|
|
|
uint64_t num = ParseUint64(value);
|
|
|
|
if ((num >> 32LL) == 0) {
|
|
|
|
return static_cast<uint32_t>(num);
|
|
|
|
} else {
|
|
|
|
throw std::out_of_range(value);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-03-12 20:46:12 +00:00
|
|
|
int32_t ParseInt32(const std::string& value) {
|
|
|
|
int64_t num = ParseInt64(value);
|
2022-05-05 20:08:21 +00:00
|
|
|
if (num <= std::numeric_limits<int32_t>::max() &&
|
|
|
|
num >= std::numeric_limits<int32_t>::min()) {
|
2019-03-12 20:46:12 +00:00
|
|
|
return static_cast<int32_t>(num);
|
|
|
|
} else {
|
|
|
|
throw std::out_of_range(value);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-04-06 21:49:13 +00:00
|
|
|
|
|
|
|
uint64_t ParseUint64(const std::string& value) {
|
|
|
|
size_t endchar;
|
|
|
|
#ifndef CYGWIN
|
|
|
|
uint64_t num = std::stoull(value.c_str(), &endchar);
|
|
|
|
#else
|
|
|
|
char* endptr;
|
|
|
|
uint64_t num = std::strtoul(value.c_str(), &endptr, 0);
|
|
|
|
endchar = endptr - value.c_str();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (endchar < value.length()) {
|
|
|
|
char c = value[endchar];
|
2024-03-04 18:08:32 +00:00
|
|
|
if (c == 'k' || c == 'K') {
|
2017-04-06 21:49:13 +00:00
|
|
|
num <<= 10LL;
|
2024-03-04 18:08:32 +00:00
|
|
|
} else if (c == 'm' || c == 'M') {
|
2017-04-06 21:49:13 +00:00
|
|
|
num <<= 20LL;
|
2024-03-04 18:08:32 +00:00
|
|
|
} else if (c == 'g' || c == 'G') {
|
2017-04-06 21:49:13 +00:00
|
|
|
num <<= 30LL;
|
2024-03-04 18:08:32 +00:00
|
|
|
} else if (c == 't' || c == 'T') {
|
2017-04-06 21:49:13 +00:00
|
|
|
num <<= 40LL;
|
2024-03-04 18:08:32 +00:00
|
|
|
}
|
2017-04-06 21:49:13 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return num;
|
|
|
|
}
|
|
|
|
|
2019-03-12 20:46:12 +00:00
|
|
|
int64_t ParseInt64(const std::string& value) {
|
|
|
|
size_t endchar;
|
|
|
|
#ifndef CYGWIN
|
|
|
|
int64_t num = std::stoll(value.c_str(), &endchar);
|
|
|
|
#else
|
|
|
|
char* endptr;
|
|
|
|
int64_t num = std::strtoll(value.c_str(), &endptr, 0);
|
|
|
|
endchar = endptr - value.c_str();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (endchar < value.length()) {
|
|
|
|
char c = value[endchar];
|
2024-03-04 18:08:32 +00:00
|
|
|
if (c == 'k' || c == 'K') {
|
2019-03-12 20:46:12 +00:00
|
|
|
num <<= 10LL;
|
2024-03-04 18:08:32 +00:00
|
|
|
} else if (c == 'm' || c == 'M') {
|
2019-03-12 20:46:12 +00:00
|
|
|
num <<= 20LL;
|
2024-03-04 18:08:32 +00:00
|
|
|
} else if (c == 'g' || c == 'G') {
|
2019-03-12 20:46:12 +00:00
|
|
|
num <<= 30LL;
|
2024-03-04 18:08:32 +00:00
|
|
|
} else if (c == 't' || c == 'T') {
|
2019-03-12 20:46:12 +00:00
|
|
|
num <<= 40LL;
|
2024-03-04 18:08:32 +00:00
|
|
|
}
|
2019-03-12 20:46:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return num;
|
|
|
|
}
|
|
|
|
|
2017-04-06 21:49:13 +00:00
|
|
|
int ParseInt(const std::string& value) {
|
|
|
|
size_t endchar;
|
|
|
|
#ifndef CYGWIN
|
|
|
|
int num = std::stoi(value.c_str(), &endchar);
|
|
|
|
#else
|
|
|
|
char* endptr;
|
|
|
|
int num = std::strtoul(value.c_str(), &endptr, 0);
|
|
|
|
endchar = endptr - value.c_str();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (endchar < value.length()) {
|
|
|
|
char c = value[endchar];
|
2024-03-04 18:08:32 +00:00
|
|
|
if (c == 'k' || c == 'K') {
|
2017-04-06 21:49:13 +00:00
|
|
|
num <<= 10;
|
2024-03-04 18:08:32 +00:00
|
|
|
} else if (c == 'm' || c == 'M') {
|
2017-04-06 21:49:13 +00:00
|
|
|
num <<= 20;
|
2024-03-04 18:08:32 +00:00
|
|
|
} else if (c == 'g' || c == 'G') {
|
2017-04-06 21:49:13 +00:00
|
|
|
num <<= 30;
|
2024-03-04 18:08:32 +00:00
|
|
|
}
|
2017-04-06 21:49:13 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return num;
|
|
|
|
}
|
|
|
|
|
|
|
|
double ParseDouble(const std::string& value) {
|
|
|
|
#ifndef CYGWIN
|
|
|
|
return std::stod(value);
|
|
|
|
#else
|
|
|
|
return std::strtod(value.c_str(), 0);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t ParseSizeT(const std::string& value) {
|
|
|
|
return static_cast<size_t>(ParseUint64(value));
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<int> ParseVectorInt(const std::string& value) {
|
|
|
|
std::vector<int> result;
|
|
|
|
size_t start = 0;
|
|
|
|
while (start < value.size()) {
|
|
|
|
size_t end = value.find(':', start);
|
|
|
|
if (end == std::string::npos) {
|
|
|
|
result.push_back(ParseInt(value.substr(start)));
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
result.push_back(ParseInt(value.substr(start, end - start)));
|
|
|
|
start = end + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SerializeIntVector(const std::vector<int>& vec, std::string* value) {
|
|
|
|
*value = "";
|
|
|
|
for (size_t i = 0; i < vec.size(); ++i) {
|
|
|
|
if (i > 0) {
|
|
|
|
*value += ":";
|
|
|
|
}
|
2022-05-06 20:03:58 +00:00
|
|
|
*value += std::to_string(vec[i]);
|
2017-04-06 21:49:13 +00:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
Offpeak in db option (#11893)
Summary:
RocksDB's primary function is to facilitate read and write operations. Compactions, while essential for minimizing read amplifications and optimizing storage, can sometimes compete with these primary tasks. Especially during periods of high read/write traffic, it's vital to ensure that primary operations receive priority, avoiding any potential disruptions or slowdowns. Conversely, during off-peak times when traffic is minimal, it's an opportune moment to tackle low-priority tasks like TTL based compactions, optimizing resource usage.
In this PR, we are incorporating the concept of off-peak time into RocksDB by introducing `daily_offpeak_time_utc` within the DBOptions. This setting is formatted as "HH:mm-HH:mm" where the first one before "-" is the start time and the second one is the end time, inclusive. It will be later used for resource optimization in subsequent PRs.
Pull Request resolved: https://github.com/facebook/rocksdb/pull/11893
Test Plan:
- New Unit Test Added - `DBOptionsTest::OffPeakTimes`
- Existing Unit Test Updated - `OptionsTest`, `OptionsSettableTest`
Reviewed By: pdillinger
Differential Revision: D49714553
Pulled By: jaykorean
fbshipit-source-id: fef51ea7c0fede6431c715bff116ddbb567c8752
2023-09-29 20:03:39 +00:00
|
|
|
int ParseTimeStringToSeconds(const std::string& value) {
|
|
|
|
int hours, minutes;
|
|
|
|
char colon;
|
|
|
|
|
|
|
|
std::istringstream stream(value);
|
|
|
|
stream >> hours >> colon >> minutes;
|
|
|
|
|
|
|
|
if (stream.fail() || !stream.eof() || colon != ':') {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (hours < 0 || hours > 23 || minutes < 0 || minutes > 59) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
return hours * 3600 + minutes * 60;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool TryParseTimeRangeString(const std::string& value, int& start_time,
|
|
|
|
int& end_time) {
|
|
|
|
if (value.empty()) {
|
|
|
|
start_time = 0;
|
|
|
|
end_time = 0;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
auto split = StringSplit(value, '-');
|
|
|
|
if (split.size() != 2) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
start_time = ParseTimeStringToSeconds(split[0]);
|
|
|
|
if (start_time < 0) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
end_time = ParseTimeStringToSeconds(split[1]);
|
|
|
|
if (end_time < 0) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2021-03-25 06:06:31 +00:00
|
|
|
// Copied from folly/string.cpp:
|
|
|
|
// https://github.com/facebook/folly/blob/0deef031cb8aab76dc7e736f8b7c22d701d5f36b/folly/String.cpp#L457
|
|
|
|
// There are two variants of `strerror_r` function, one returns
|
|
|
|
// `int`, and another returns `char*`. Selecting proper version using
|
|
|
|
// preprocessor macros portably is extremely hard.
|
|
|
|
//
|
|
|
|
// For example, on Android function signature depends on `__USE_GNU` and
|
|
|
|
// `__ANDROID_API__` macros (https://git.io/fjBBE).
|
|
|
|
//
|
|
|
|
// So we are using C++ overloading trick: we pass a pointer of
|
|
|
|
// `strerror_r` to `invoke_strerror_r` function, and C++ compiler
|
|
|
|
// selects proper function.
|
|
|
|
|
|
|
|
#if !(defined(_WIN32) && (defined(__MINGW32__) || defined(_MSC_VER)))
|
|
|
|
ROCKSDB_MAYBE_UNUSED
|
|
|
|
static std::string invoke_strerror_r(int (*strerror_r)(int, char*, size_t),
|
|
|
|
int err, char* buf, size_t buflen) {
|
|
|
|
// Using XSI-compatible strerror_r
|
|
|
|
int r = strerror_r(err, buf, buflen);
|
|
|
|
|
|
|
|
// OSX/FreeBSD use EINVAL and Linux uses -1 so just check for non-zero
|
|
|
|
if (r != 0) {
|
|
|
|
snprintf(buf, buflen, "Unknown error %d (strerror_r failed with error %d)",
|
|
|
|
err, errno);
|
|
|
|
}
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
ROCKSDB_MAYBE_UNUSED
|
|
|
|
static std::string invoke_strerror_r(char* (*strerror_r)(int, char*, size_t),
|
|
|
|
int err, char* buf, size_t buflen) {
|
|
|
|
// Using GNU strerror_r
|
|
|
|
return strerror_r(err, buf, buflen);
|
|
|
|
}
|
|
|
|
#endif // !(defined(_WIN32) && (defined(__MINGW32__) || defined(_MSC_VER)))
|
|
|
|
|
|
|
|
std::string errnoStr(int err) {
|
|
|
|
char buf[1024];
|
|
|
|
buf[0] = '\0';
|
|
|
|
|
|
|
|
std::string result;
|
|
|
|
|
|
|
|
// https://developer.apple.com/library/mac/documentation/Darwin/Reference/ManPages/man3/strerror_r.3.html
|
|
|
|
// http://www.kernel.org/doc/man-pages/online/pages/man3/strerror.3.html
|
|
|
|
#if defined(_WIN32) && (defined(__MINGW32__) || defined(_MSC_VER))
|
|
|
|
// mingw64 has no strerror_r, but Windows has strerror_s, which C11 added
|
|
|
|
// as well. So maybe we should use this across all platforms (together
|
|
|
|
// with strerrorlen_s). Note strerror_r and _s have swapped args.
|
|
|
|
int r = strerror_s(buf, sizeof(buf), err);
|
|
|
|
if (r != 0) {
|
|
|
|
snprintf(buf, sizeof(buf),
|
|
|
|
"Unknown error %d (strerror_r failed with error %d)", err, errno);
|
|
|
|
}
|
|
|
|
result.assign(buf);
|
|
|
|
#else
|
|
|
|
// Using any strerror_r
|
|
|
|
result.assign(invoke_strerror_r(strerror_r, err, buf, sizeof(buf)));
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2020-02-20 20:07:53 +00:00
|
|
|
} // namespace ROCKSDB_NAMESPACE
|