459 lines
26 KiB
C++
459 lines
26 KiB
C++
/*
|
|
* ClientKnobs.cpp
|
|
*
|
|
* This source file is part of the FoundationDB open source project
|
|
*
|
|
* Copyright 2013-2026 Apple Inc. and the FoundationDB project authors
|
|
*
|
|
* 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 "fdbclient/Knobs.h"
|
|
#include "flow/IRandom.h"
|
|
#include "flow/Knobs.h"
|
|
#include "flow/UnitTest.h"
|
|
#include "flow/flow.h"
|
|
|
|
#include <iostream>
|
|
|
|
int getSimulatedTxnTimeoutSeconds() {
|
|
if (deterministicRandom()->truePercent(90)) {
|
|
return 5;
|
|
} else {
|
|
return deterministicRandom()->randomInt(1, 11); // [1, 10]
|
|
}
|
|
}
|
|
|
|
#define init(knob, value) INIT_KNOB(knob, value)
|
|
|
|
ClientKnobs::ClientKnobs(Randomize randomize, IsSimulated isSimulated) {
|
|
initialize(randomize, isSimulated);
|
|
}
|
|
|
|
namespace {
|
|
FlowKnobs globalFlowKnobs(Randomize::False, IsSimulated::False);
|
|
ClientKnobs globalClientKnobs(Randomize::False, IsSimulated::False);
|
|
ClientKnobs bootstrapGlobalClientKnobs(Randomize::False, IsSimulated::False);
|
|
|
|
FlowKnobs& mutableFlowKnobs() {
|
|
return *const_cast<FlowKnobs*>(FLOW_KNOBS);
|
|
}
|
|
|
|
ClientKnobs& mutableClientKnobs() {
|
|
return *const_cast<ClientKnobs*>(CLIENT_KNOBS);
|
|
}
|
|
|
|
Optional<KnobValue> tryParseKnobValueImpl(std::string const& knobName, std::string const& knobValue) {
|
|
auto parsedKnobValue = FLOW_KNOBS->parseKnobValue(knobName, knobValue);
|
|
if (!std::holds_alternative<NoKnobFound>(parsedKnobValue)) {
|
|
return KnobValueRef::create(parsedKnobValue);
|
|
}
|
|
|
|
parsedKnobValue = CLIENT_KNOBS->parseKnobValue(knobName, knobValue);
|
|
if (!std::holds_alternative<NoKnobFound>(parsedKnobValue)) {
|
|
return KnobValueRef::create(parsedKnobValue);
|
|
}
|
|
|
|
return {};
|
|
}
|
|
} // namespace
|
|
|
|
ClientKnobs const* CLIENT_KNOBS = &bootstrapGlobalClientKnobs;
|
|
|
|
void resetClientKnobs(Randomize randomize, IsSimulated isSimulated) {
|
|
FLOW_KNOBS = &globalFlowKnobs;
|
|
CLIENT_KNOBS = &globalClientKnobs;
|
|
globalFlowKnobs.reset(randomize, isSimulated);
|
|
globalClientKnobs.reset(randomize, isSimulated);
|
|
}
|
|
|
|
void initializeClientKnobs(Randomize randomize, IsSimulated isSimulated) {
|
|
mutableFlowKnobs().initialize(randomize, isSimulated);
|
|
mutableClientKnobs().initialize(randomize, isSimulated);
|
|
}
|
|
|
|
Optional<KnobValue> tryParseClientKnobValue(std::string const& knobName, std::string const& knobValue) {
|
|
return tryParseKnobValueImpl(knobName, knobValue);
|
|
}
|
|
|
|
KnobValue parseClientKnobValue(std::string const& knobName, std::string const& knobValue) {
|
|
auto result = tryParseClientKnobValue(knobName, knobValue);
|
|
if (!result.present()) {
|
|
throw invalid_option();
|
|
}
|
|
return result.get();
|
|
}
|
|
|
|
bool trySetClientKnob(std::string const& knobName, KnobValueRef const& knobValue) {
|
|
const bool setFlowKnob = knobValue.visitSetKnob(knobName, mutableFlowKnobs());
|
|
const bool setClientKnob = knobValue.visitSetKnob(knobName, mutableClientKnobs());
|
|
return setFlowKnob || setClientKnob;
|
|
}
|
|
|
|
void setClientKnob(std::string const& knobName, KnobValueRef const& knobValue) {
|
|
if (trySetClientKnob(knobName, knobValue)) {
|
|
return;
|
|
}
|
|
|
|
TraceEvent(SevWarnAlways, "FailedToSetKnob").detail("KnobName", knobName).detail("KnobValue", knobValue.toString());
|
|
throw invalid_option_value();
|
|
}
|
|
|
|
void setupClientKnobs(std::vector<std::pair<std::string, std::string>> const& knobs) {
|
|
for (const auto& [knobName, knobValueString] : knobs) {
|
|
try {
|
|
setClientKnob(knobName, parseClientKnobValue(knobName, knobValueString));
|
|
} catch (Error& e) {
|
|
if (e.code() == error_code_invalid_option_value) {
|
|
std::cerr << "WARNING: Invalid value '" << knobValueString << "' for knob option '" << knobName
|
|
<< "'\n";
|
|
TraceEvent(SevWarnAlways, "InvalidKnobValue")
|
|
.detail("Knob", printable(knobName))
|
|
.detail("Value", printable(knobValueString));
|
|
} else if (e.code() == error_code_invalid_option) {
|
|
std::cerr << "WARNING: Invalid knob option '" << knobName << "'\n";
|
|
TraceEvent(SevWarnAlways, "InvalidKnobName")
|
|
.detail("Knob", printable(knobName))
|
|
.detail("Value", printable(knobValueString));
|
|
} else {
|
|
std::cerr << "ERROR: Failed to set knob option '" << knobName << "': " << e.what() << "\n";
|
|
TraceEvent(SevError, "FailedToSetKnob")
|
|
.errorUnsuppressed(e)
|
|
.detail("Knob", printable(knobName))
|
|
.detail("Value", printable(knobValueString));
|
|
throw e;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void ClientKnobs::initialize(Randomize randomize, IsSimulated isSimulated) {
|
|
// clang-format off
|
|
|
|
init( TOO_MANY, 1000000 );
|
|
|
|
init( SYSTEM_MONITOR_INTERVAL, 5.0 );
|
|
init( NETWORK_BUSYNESS_MONITOR_INTERVAL, 1.0 );
|
|
init( TSS_METRICS_LOGGING_INTERVAL, 120.0 ); // 2 minutes by default
|
|
|
|
init( FAILURE_MAX_DELAY, 5.0 );
|
|
init( FAILURE_MIN_DELAY, 4.0 ); if( randomize && buggify() ) FAILURE_MIN_DELAY = 1.0;
|
|
init( RECOVERY_DELAY_START_GENERATION, 70 );
|
|
init( RECOVERY_DELAY_SECONDS_PER_GENERATION, 60.0 );
|
|
init( MAX_GENERATIONS, 100 );
|
|
init( MAX_GENERATIONS_OVERRIDE, 0 );
|
|
init( MAX_GENERATIONS_SIM, 50 ); //Disable network connections after this many generations in simulation, should be less than RECOVERY_DELAY_START_GENERATION
|
|
|
|
init( COORDINATOR_RECONNECTION_DELAY, 1.0 );
|
|
init( CLIENT_EXAMPLE_AMOUNT, 20 );
|
|
init( MAX_CLIENT_STATUS_AGE, 1.0 );
|
|
init( MAX_COMMIT_PROXY_CONNECTIONS, 5 ); if( randomize && buggify() ) MAX_COMMIT_PROXY_CONNECTIONS = 1;
|
|
init( MAX_GRV_PROXY_CONNECTIONS, 3 ); if( randomize && buggify() ) MAX_GRV_PROXY_CONNECTIONS = 1;
|
|
init( STATUS_IDLE_TIMEOUT, 120.0 );
|
|
init( STATUS_TIMEOUT, 30.0 );
|
|
init( GRPC_CTL_SERVICE_DEFAULT_TIMEOUT, 5.0 );
|
|
init( SEND_ENTIRE_VERSION_VECTOR, false );
|
|
|
|
// wrong_shard_server sometimes comes from the only nonfailed server, so we need to avoid a fast spin
|
|
|
|
init( WRONG_SHARD_SERVER_DELAY, .01 ); if( randomize && buggify() ) WRONG_SHARD_SERVER_DELAY = deterministicRandom()->random01(); // FLOW_KNOBS->PREVENT_FAST_SPIN_DELAY; // SOMEDAY: This delay can limit performance of retrieving data when the cache is mostly wrong (e.g. dumping the database after a test)
|
|
init( FUTURE_VERSION_RETRY_DELAY, .01 ); if( randomize && buggify() ) FUTURE_VERSION_RETRY_DELAY = deterministicRandom()->random01();// FLOW_KNOBS->PREVENT_FAST_SPIN_DELAY;
|
|
init( GRV_ERROR_RETRY_DELAY, 5.0 ); if( randomize && buggify() ) GRV_ERROR_RETRY_DELAY = 0.01 + 5 * deterministicRandom()->random01();
|
|
init( REPLY_BYTE_LIMIT, 80000 );
|
|
init( DEFAULT_BACKOFF, .01 ); if( randomize && buggify() ) DEFAULT_BACKOFF = deterministicRandom()->random01();
|
|
init( DEFAULT_MAX_BACKOFF, 1.0 );
|
|
init( BACKOFF_GROWTH_RATE, 2.0 );
|
|
init( RESOURCE_CONSTRAINED_MAX_BACKOFF, 30.0 );
|
|
init( PROXY_COMMIT_OVERHEAD_BYTES, 23 ); //The size of serializing 7 tags (3 primary, 3 remote, 1 log router) + 2 for the tag length
|
|
init( SHARD_STAT_SMOOTH_AMOUNT, 5.0 );
|
|
init( INIT_MID_SHARD_BYTES, 10000000 ); if( randomize && buggify() ) INIT_MID_SHARD_BYTES = 40000; else if(randomize && buggify(0.75)) INIT_MID_SHARD_BYTES = 200000; // The same value as SERVER_KNOBS->MIN_SHARD_BYTES
|
|
|
|
init( TRANSACTION_SIZE_LIMIT, 1e7 );
|
|
init( KEY_SIZE_LIMIT, 1e4 );
|
|
init( SYSTEM_KEY_SIZE_LIMIT, 3e4 );
|
|
init( VALUE_SIZE_LIMIT, 1e5 );
|
|
init( SPLIT_KEY_SIZE_LIMIT, KEY_SIZE_LIMIT/2 ); if( randomize && buggify() ) SPLIT_KEY_SIZE_LIMIT = KEY_SIZE_LIMIT - 31;//serverKeysPrefixFor(UID()).size() - 1;
|
|
init( METADATA_VERSION_CACHE_SIZE, 1000 );
|
|
init( CHANGE_FEED_LOCATION_LIMIT, 10000 );
|
|
init( CHANGE_FEED_CACHE_SIZE, 100000 ); if( randomize && buggify() ) CHANGE_FEED_CACHE_SIZE = 1;
|
|
init( CHANGE_FEED_POP_TIMEOUT, 10.0 );
|
|
init( CHANGE_FEED_STREAM_MIN_BYTES, 1e4 ); if( randomize && buggify() ) CHANGE_FEED_STREAM_MIN_BYTES = 1;
|
|
init( CHANGE_FEED_START_INTERVAL, 20.0 ); if( randomize && buggify() ) CHANGE_FEED_START_INTERVAL = 10.0;
|
|
init( CHANGE_FEED_COALESCE_LOCATIONS, true ); if( randomize && buggify() ) CHANGE_FEED_COALESCE_LOCATIONS = false;
|
|
init( CHANGE_FEED_CACHE_FLUSH_BYTES, 10e6 ); if( randomize && buggify() ) CHANGE_FEED_CACHE_FLUSH_BYTES = deterministicRandom()->randomInt64(1, 1e6);
|
|
init( CHANGE_FEED_CACHE_EXPIRE_TIME, 60.0 ); if( randomize && buggify() ) CHANGE_FEED_CACHE_EXPIRE_TIME = 1.0;
|
|
init( CHANGE_FEED_CACHE_LIMIT_BYTES, 500000 ); if( randomize && buggify() ) CHANGE_FEED_CACHE_LIMIT_BYTES = 50000;
|
|
init( ENABLE_NATIVE_CDC, false ); if( randomize && buggify() ) ENABLE_NATIVE_CDC = true;
|
|
init( NATIVE_CDC_TAG_COUNT, 256 ); if( randomize && buggify() ) NATIVE_CDC_TAG_COUNT = 2;
|
|
|
|
init( MAX_BATCH_SIZE, 1000 ); if( randomize && buggify() ) MAX_BATCH_SIZE = 1;
|
|
init( GRV_BATCH_TIMEOUT, 0.005 ); if( randomize && buggify() ) GRV_BATCH_TIMEOUT = 0.1;
|
|
init( BROADCAST_BATCH_SIZE, 20 ); if( randomize && buggify() ) BROADCAST_BATCH_SIZE = 1;
|
|
init( TRANSACTION_TIMEOUT_DELAY_INTERVAL, 10.0 ); if( randomize && buggify() ) TRANSACTION_TIMEOUT_DELAY_INTERVAL = 1.0;
|
|
|
|
init( LOCATION_CACHE_EVICTION_SIZE, 600000 );
|
|
init( LOCATION_CACHE_EVICTION_SIZE_SIM, 10 ); if( randomize && buggify() ) LOCATION_CACHE_EVICTION_SIZE_SIM = 3;
|
|
init( LOCATION_CACHE_ENDPOINT_FAILURE_GRACE_PERIOD, 60 );
|
|
init( LOCATION_CACHE_FAILED_ENDPOINT_RETRY_INTERVAL, 60 );
|
|
|
|
init( GET_RANGE_SHARD_LIMIT, 2 );
|
|
init( WARM_RANGE_SHARD_LIMIT, 100 );
|
|
init( STORAGE_METRICS_SHARD_LIMIT, 100 ); if( randomize && buggify() ) STORAGE_METRICS_SHARD_LIMIT = 10;
|
|
init( SHARD_COUNT_LIMIT, 80 ); if( randomize && buggify() ) SHARD_COUNT_LIMIT = 3;
|
|
init( STORAGE_METRICS_UNFAIR_SPLIT_LIMIT, 2.0/3.0 );
|
|
init( STORAGE_METRICS_TOO_MANY_SHARDS_DELAY, 15.0 );
|
|
init( AGGREGATE_HEALTH_METRICS_MAX_STALENESS, 0.5 );
|
|
init( DETAILED_HEALTH_METRICS_MAX_STALENESS, 5.0 );
|
|
init( MID_SHARD_SIZE_MAX_STALENESS, 10.0 );
|
|
init( TAG_ENCODE_KEY_SERVERS, false ); if( randomize && buggify() ) TAG_ENCODE_KEY_SERVERS = true;
|
|
init( QUARANTINE_TSS_ON_MISMATCH, true ); if( randomize && buggify() ) QUARANTINE_TSS_ON_MISMATCH = false; // if true, a tss mismatch will put the offending tss in quarantine. If false, it will just be killed
|
|
init( CHANGE_FEED_EMPTY_BATCH_TIME, 0.005 );
|
|
|
|
//KeyRangeMap
|
|
init( KRM_GET_RANGE_LIMIT, 1e5 ); if( randomize && buggify() ) KRM_GET_RANGE_LIMIT = 10;
|
|
init( KRM_GET_RANGE_LIMIT_BYTES, 1e8 ); if( randomize && buggify() ) KRM_GET_RANGE_LIMIT_BYTES = 10000; //This must be sufficiently larger than KEY_SIZE_LIMIT to ensure that at least two entries will be returned from an attempt to read a key range map
|
|
|
|
init( DEFAULT_MAX_OUTSTANDING_WATCHES, 1e4 );
|
|
init( ABSOLUTE_MAX_WATCHES, 1e6 );
|
|
init( WATCH_POLLING_TIME, 1.0 ); if( randomize && buggify() ) WATCH_POLLING_TIME = 5.0;
|
|
init( NO_RECENT_UPDATES_DURATION, 20.0 ); if( randomize && buggify() ) NO_RECENT_UPDATES_DURATION = 0.1;
|
|
init( FAST_WATCH_TIMEOUT, 20.0 ); if( randomize && buggify() ) FAST_WATCH_TIMEOUT = 1.0;
|
|
init( WATCH_TIMEOUT, 30.0 ); if( randomize && buggify() ) WATCH_TIMEOUT = 20.0;
|
|
|
|
// Versions -- knobs that control 5s timeout
|
|
init( VERSIONS_PER_SECOND, 1e6 ); // Must be the same as SERVER_KNOBS->VERSIONS_PER_SECOND
|
|
init( MAX_WRITE_TRANSACTION_LIFE_VERSIONS, 5 * VERSIONS_PER_SECOND); if (isSimulated) MAX_WRITE_TRANSACTION_LIFE_VERSIONS = getSimulatedTxnTimeoutSeconds() * VERSIONS_PER_SECOND;
|
|
|
|
// Core
|
|
init( CORE_VERSIONSPERSECOND, 1e6 );
|
|
init( LOG_RANGE_BLOCK_SIZE, CORE_VERSIONSPERSECOND );
|
|
init( MUTATION_BLOCK_SIZE, 10000);
|
|
init( MAX_VERSION_CACHE_LAG, 0.1 );
|
|
init( MAX_PROXY_CONTACT_LAG, 0.2 );
|
|
init( DEBUG_USE_GRV_CACHE_CHANCE, -1.0 ); // For 100% chance at 1.0, this means 0.0 is not 0%. We don't want the default to be 0.
|
|
init( FORCE_GRV_CACHE_OFF, false );
|
|
init( GRV_CACHE_RK_COOLDOWN, 60.0 );
|
|
init( GRV_SUSTAINED_THROTTLING_THRESHOLD, 0.1 );
|
|
|
|
// TaskBucket
|
|
init( TASKBUCKET_LOGGING_DELAY, 5.0 );
|
|
init( TASKBUCKET_MAX_PRIORITY, 1 );
|
|
init( TASKBUCKET_CHECK_TIMEOUT_CHANCE, 0.02 ); if( randomize && buggify() ) TASKBUCKET_CHECK_TIMEOUT_CHANCE = 1.0;
|
|
init( TASKBUCKET_TIMEOUT_JITTER_OFFSET, 0.9 );
|
|
init( TASKBUCKET_TIMEOUT_JITTER_RANGE, 0.2 );
|
|
init( TASKBUCKET_CHECK_ACTIVE_DELAY, 0.5 );
|
|
init( TASKBUCKET_CHECK_ACTIVE_AMOUNT, 10 );
|
|
init( TASKBUCKET_TIMEOUT_VERSIONS, 60*CORE_VERSIONSPERSECOND ); if( randomize && buggify() ) TASKBUCKET_TIMEOUT_VERSIONS = 30*CORE_VERSIONSPERSECOND;
|
|
init( TASKBUCKET_MAX_TASK_KEYS, 1000 ); if( randomize && buggify() ) TASKBUCKET_MAX_TASK_KEYS = 20;
|
|
|
|
//Backup
|
|
init( BACKUP_LOCAL_FILE_WRITE_BLOCK, 024*1024 );
|
|
init( BACKUP_MANIFEST_CHUNK_SIZE, std::numeric_limits<int>::max() ); if( randomize && buggify() ) BACKUP_MANIFEST_CHUNK_SIZE = 64;
|
|
init( BACKUP_CONCURRENT_DELETES, 100 );
|
|
init( BACKUP_SIMULATED_LIMIT_BYTES, 1e6 ); if( randomize && buggify() ) BACKUP_SIMULATED_LIMIT_BYTES = 1000;
|
|
init( BACKUP_GET_RANGE_LIMIT_BYTES, 1e6 );
|
|
init( BACKUP_LOCK_BYTES, 1e8 );
|
|
init( BACKUP_RANGE_TIMEOUT, TASKBUCKET_TIMEOUT_VERSIONS/CORE_VERSIONSPERSECOND/2.0 );
|
|
init( BACKUP_RANGE_MINWAIT, std::max(1.0, BACKUP_RANGE_TIMEOUT/2.0));
|
|
init( BULKDUMP_JOB_TIMEOUT, 3600 * 24 ); // 24 hours - large DBs may take days
|
|
init( BULKLOAD_JOB_TIMEOUT, 3600 * 24 ); // 24 hours - large DBs may take days
|
|
init( BACKUP_SNAPSHOT_DISPATCH_INTERVAL_SEC, 10 * 60 ); // 10 minutes
|
|
init( BACKUP_DEFAULT_SNAPSHOT_INTERVAL_SEC, 3600 * 24 * 10); // 10 days
|
|
init( BACKUP_SHARD_TASK_LIMIT, 1000 ); if( randomize && buggify() ) BACKUP_SHARD_TASK_LIMIT = 4;
|
|
init( BACKUP_AGGREGATE_POLL_RATE_UPDATE_INTERVAL, 60);
|
|
init( BACKUP_AGGREGATE_POLL_RATE, 2.0 ); // polls per second target for all agents on the cluster
|
|
init( BACKUP_LOG_WRITE_BATCH_MAX_SIZE, 1e6 ); //Must be much smaller than TRANSACTION_SIZE_LIMIT
|
|
init( BACKUP_MAX_LOG_RANGES, 21 ); if( randomize && buggify() ) BACKUP_MAX_LOG_RANGES = 4;
|
|
init( BACKUP_SIM_COPY_LOG_RANGES, 100 );
|
|
init( BACKUP_VERSION_DELAY, 5*CORE_VERSIONSPERSECOND );
|
|
bool buggifyMapLimits = randomize && buggify();
|
|
init( BACKUP_MAP_KEY_LOWER_LIMIT, 1e4 ); if( buggifyMapLimits ) BACKUP_MAP_KEY_LOWER_LIMIT = 4;
|
|
init( BACKUP_MAP_KEY_UPPER_LIMIT, 1e5 ); if( buggifyMapLimits ) BACKUP_MAP_KEY_UPPER_LIMIT = 30;
|
|
init( BACKUP_COPY_TASKS, 90 );
|
|
init( BACKUP_BLOCK_SIZE, LOG_RANGE_BLOCK_SIZE/10 );
|
|
init( BACKUP_ALLOW_DRYRUN, false );
|
|
init( COPY_LOG_BLOCK_SIZE, LOG_RANGE_BLOCK_SIZE ); // the maximum possible value due the getLogRanges limitations
|
|
init( COPY_LOG_BLOCKS_PER_TASK, 1000 );
|
|
init( COPY_LOG_PREFETCH_BLOCKS, 3 );
|
|
init( COPY_LOG_READ_AHEAD_BYTES, BACKUP_LOCK_BYTES / COPY_LOG_PREFETCH_BLOCKS); // each task will use up to COPY_LOG_PREFETCH_BLOCKS * COPY_LOG_READ_AHEAD_BYTES memory
|
|
init( COPY_LOG_TASK_DURATION_SECONDS, 10 );
|
|
init( BACKUP_TASKS_PER_AGENT, 10 );
|
|
init( BACKUP_POLL_PROGRESS_SECONDS, 10 );
|
|
init( SIM_BACKUP_TASKS_PER_AGENT, 10 );
|
|
init( BACKUP_RANGEFILE_BLOCK_SIZE, 1024 * 1024);
|
|
init( BACKUP_LOGFILE_BLOCK_SIZE, 1024 * 1024);
|
|
init( BACKUP_DISPATCH_ADDTASK_SIZE, 50 );
|
|
init( RESTORE_DISPATCH_ADDTASK_SIZE, 150 );
|
|
init( RESTORE_DISPATCH_BATCH_SIZE, 30000 ); if( randomize && buggify() ) RESTORE_DISPATCH_BATCH_SIZE = 20;
|
|
init (RESTORE_PARTITIONED_BATCH_VERSION_SIZE, 10000000); // each step restores 10s worth of data
|
|
init( RESTORE_WRITE_TX_SIZE, 256 * 1024 );
|
|
init( APPLY_MAX_LOCK_BYTES, 1e9 );
|
|
init( APPLY_MIN_LOCK_BYTES, 11e6 ); //Must be bigger than TRANSACTION_SIZE_LIMIT
|
|
init( APPLY_BLOCK_SIZE, LOG_RANGE_BLOCK_SIZE/5 );
|
|
init( APPLY_MAX_DECAY_RATE, 0.99 );
|
|
init( APPLY_MAX_INCREASE_FACTOR, 1.1 );
|
|
init( BACKUP_ERROR_DELAY, 10.0 );
|
|
init( BACKUP_STATUS_DELAY, 40.0 );
|
|
init( BACKUP_STATUS_JITTER, 0.05 );
|
|
init( MIN_CLEANUP_SECONDS, 3600.0 );
|
|
init( RESTORE_RANGES_READ_BATCH, 10000 );
|
|
|
|
init( RANGE_PARTITIONED_BACKUP_VDIR_INTERVAL, 100000 * 1000000LL );
|
|
init( BACKUP_NUM_OF_PARTITIONS, 100 );
|
|
init( BACKUP_CONTAINER_LOCAL_ALLOW_RELATIVE_PATH, false );
|
|
init( ENABLE_REPLICA_CONSISTENCY_CHECK_ON_BACKUP_READS, false ); if( randomize && buggify() ) { ENABLE_REPLICA_CONSISTENCY_CHECK_ON_BACKUP_READS = true; }
|
|
init( BACKUP_CONSISTENCY_CHECK_REQUIRED_REPLICAS, -2 ); // Do consistency check based on all available storage replicas
|
|
init( BACKUP_READS_USE_LOW_PRIORITY, false ); if ( randomize && buggify()) { BACKUP_READS_USE_LOW_PRIORITY = deterministicRandom()->random01() < 0.1; }
|
|
init( BULKLOAD_JOB_HISTORY_COUNT_MAX, 10 ); if (randomize && buggify()) BULKLOAD_JOB_HISTORY_COUNT_MAX = deterministicRandom()->randomInt(1, 10);
|
|
init( BULKLOAD_VERBOSE_LEVEL, 10 );
|
|
init( S3CLIENT_VERBOSE_LEVEL, 10 );
|
|
|
|
// Configuration
|
|
init( DEFAULT_AUTO_COMMIT_PROXIES, 3 );
|
|
init( DEFAULT_AUTO_GRV_PROXIES, 1 );
|
|
init( DEFAULT_AUTO_RESOLVERS, 1 );
|
|
init( DEFAULT_AUTO_LOGS, 3 );
|
|
init( DEFAULT_COMMIT_GRV_PROXIES_RATIO, 3 );
|
|
init( DEFAULT_MAX_GRV_PROXIES, 4 );
|
|
|
|
init( GLOBAL_CONFIG_REFRESH_BACKOFF, 0.5 );
|
|
init( GLOBAL_CONFIG_REFRESH_MAX_BACKOFF, 60.0 );
|
|
init( GLOBAL_CONFIG_REFRESH_TIMEOUT, 10.0 );
|
|
|
|
init( IS_ACCEPTABLE_DELAY, 1.5 );
|
|
|
|
init( HTTP_REQUEST_AWS_V4_HEADER, true );
|
|
init( BLOBSTORE_ENCRYPTION_TYPE, "" );
|
|
init( BLOBSTORE_CONNECT_TRIES, 10 );
|
|
init( BLOBSTORE_CONNECT_TIMEOUT, 10 );
|
|
init( BLOBSTORE_MAX_CONNECTION_LIFE, 120 );
|
|
init( BLOBSTORE_REQUEST_TRIES, 10 );
|
|
init( BLOBSTORE_REQUEST_TIMEOUT_MIN, 60 );
|
|
|
|
init( BLOBSTORE_CONCURRENT_UPLOADS, BACKUP_TASKS_PER_AGENT*2 );
|
|
init( BLOBSTORE_CONCURRENT_LISTS, 20 );
|
|
init( BLOBSTORE_CONCURRENT_REQUESTS, BLOBSTORE_CONCURRENT_UPLOADS + BLOBSTORE_CONCURRENT_LISTS + 5);
|
|
|
|
init( BLOBSTORE_CONCURRENT_WRITES_PER_FILE, 5 );
|
|
init( BLOBSTORE_CONCURRENT_READS_PER_FILE, 3 );
|
|
init( BLOBSTORE_ENABLE_READ_CACHE, true ); if ( randomize && buggify() ) BLOBSTORE_ENABLE_READ_CACHE = deterministicRandom()->coinflip();
|
|
init( BLOBSTORE_READ_BLOCK_SIZE, 1024 * 1024 );
|
|
init( BLOBSTORE_READ_AHEAD_BLOCKS, 0 );
|
|
init( BLOBSTORE_READ_CACHE_BLOCKS_PER_FILE, 2 );
|
|
init( BLOBSTORE_MULTIPART_MAX_PART_SIZE, 20000000 );
|
|
init( BLOBSTORE_MULTIPART_MIN_PART_SIZE, 5242880 );
|
|
init( BLOBSTORE_MULTIPART_RETRY_DELAY_MS, 1000 );
|
|
init( BLOBSTORE_GLOBAL_CONNECTION_POOL, false );
|
|
init( BLOBSTORE_ENABLE_LOGGING, true );
|
|
init( BLOBSTORE_STATS_LOGGING_INTERVAL, 10.0 );
|
|
init( BLOBSTORE_LATENCY_LOGGING_INTERVAL, 120.0 );
|
|
init( BLOBSTORE_LATENCY_LOGGING_ACCURACY, 0.01 );
|
|
|
|
// These are basically unlimited by default but can be used to reduce blob IO if needed
|
|
init( BLOBSTORE_REQUESTS_PER_SECOND, 200 );
|
|
init( BLOBSTORE_MAX_SEND_BYTES_PER_SECOND, 1e9 );
|
|
init( BLOBSTORE_MAX_RECV_BYTES_PER_SECOND, 1e9 );
|
|
|
|
init( BLOBSTORE_MAX_DELAY_RETRYABLE_ERROR, 20 ); // Align with AWS SDK best practices (was 60s)
|
|
init( BLOBSTORE_MAX_DELAY_CONNECTION_FAILED, 10 );
|
|
init (BLOBSTORE_ENABLE_OBJECT_INTEGRITY_CHECK,true );
|
|
|
|
init( BLOBSTORE_LIST_REQUESTS_PER_SECOND, 200 );
|
|
init( BLOBSTORE_WRITE_REQUESTS_PER_SECOND, 50 );
|
|
init( BLOBSTORE_READ_REQUESTS_PER_SECOND, 100 );
|
|
init( BLOBSTORE_DELETE_REQUESTS_PER_SECOND, 200 );
|
|
|
|
// Request 1000 keys at a time, the maximum allowed
|
|
init( BLOBSTORE_LIST_MAX_KEYS_PER_PAGE, 1000 );
|
|
|
|
// Dynamic Knobs
|
|
init( COMMIT_QUORUM_TIMEOUT, 3.0 );
|
|
init( GET_GENERATION_QUORUM_TIMEOUT, 3.0 );
|
|
init( GET_KNOB_TIMEOUT, 3.0 );
|
|
init( TIMEOUT_RETRY_UPPER_BOUND, 20.0 );
|
|
|
|
// Client Status Info
|
|
init(CSI_SAMPLING_PROBABILITY, -1.0);
|
|
init(CSI_SIZE_LIMIT, std::numeric_limits<int64_t>::max());
|
|
if (randomize && buggify()) {
|
|
CSI_SAMPLING_PROBABILITY = deterministicRandom()->random01() / 10; // rand range 0 - 0.1
|
|
CSI_SIZE_LIMIT = deterministicRandom()->randomInt(1024 * 1024, 100 * 1024 * 1024); // 1 MB - 100 MB
|
|
}
|
|
init(CSI_STATUS_DELAY, 10.0 );
|
|
|
|
init( CONSISTENCY_CHECK_RATE_LIMIT_MAX, 50e6 ); // Limit in per sec
|
|
init( CONSISTENCY_CHECK_ONE_ROUND_TARGET_COMPLETION_TIME, 7 * 24 * 60 * 60 ); // 7 days
|
|
init( CONSISTENCY_CHECK_URGENT_NEXT_WAIT_TIME, 600 );
|
|
init( CONSISTENCY_CHECK_URGENT_BATCH_SHARD_COUNT, 10 ); if( randomize && buggify() ) CONSISTENCY_CHECK_URGENT_BATCH_SHARD_COUNT = 2;
|
|
init( CONSISTENCY_CHECK_URGENT_RETRY_DEPTH_MAX, 10 ); if( randomize && buggify() ) CONSISTENCY_CHECK_URGENT_RETRY_DEPTH_MAX = 1;
|
|
init( CONSISTENCY_CHECK_URGENT_RANGE_BEGIN_0, "" ); if( randomize && buggify() ) CONSISTENCY_CHECK_URGENT_RANGE_BEGIN_0 = "";
|
|
init( CONSISTENCY_CHECK_URGENT_RANGE_END_0, "\\xff\\xff" ); if( randomize && buggify() ) CONSISTENCY_CHECK_URGENT_RANGE_END_0 = "\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x33\\x66\\x63\\x36";
|
|
init( CONSISTENCY_CHECK_URGENT_RANGE_BEGIN_1, "" );
|
|
init( CONSISTENCY_CHECK_URGENT_RANGE_END_1, "" );
|
|
init( CONSISTENCY_CHECK_URGENT_RANGE_BEGIN_2, "" );
|
|
init( CONSISTENCY_CHECK_URGENT_RANGE_END_2, "" );
|
|
init( CONSISTENCY_CHECK_URGENT_RANGE_BEGIN_3, "" ); if( randomize && buggify() ) CONSISTENCY_CHECK_URGENT_RANGE_BEGIN_3 = "\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x33\\x66\\x65\\x34\\x63\\x62";
|
|
init( CONSISTENCY_CHECK_URGENT_RANGE_END_3, "" ); if( randomize && buggify() ) CONSISTENCY_CHECK_URGENT_RANGE_END_3 = "\\xff\\xff";
|
|
|
|
//fdbcli
|
|
init( CLI_CONNECT_PARALLELISM, 400 );
|
|
init( CLI_CONNECT_TIMEOUT, 10.0 );
|
|
init( CLI_PRINT_INVALID_CONFIGURATION, false );
|
|
|
|
// trace
|
|
init( TRACE_LOG_FILE_IDENTIFIER_MAX_LENGTH, 50 );
|
|
|
|
// transaction tags
|
|
init( MAX_TAGS_PER_TRANSACTION, 5 );
|
|
init( MAX_TRANSACTION_TAG_LENGTH, 255 );
|
|
init( COMMIT_SAMPLE_COST, 100 ); if( randomize && buggify() ) COMMIT_SAMPLE_COST = 10;
|
|
init( INCOMPLETE_SHARD_PLUS, 4096 );
|
|
init( READ_TAG_SAMPLE_RATE, 0.01 ); if( randomize && buggify() ) READ_TAG_SAMPLE_RATE = 1.0; // Communicated to clients from cluster
|
|
init( TAG_THROTTLE_SMOOTHING_WINDOW, 2.0 );
|
|
init( TAG_THROTTLE_RECHECK_INTERVAL, 5.0 ); if( randomize && buggify() ) TAG_THROTTLE_RECHECK_INTERVAL = 0.0;
|
|
init( TAG_THROTTLE_EXPIRATION_INTERVAL, 60.0 ); if( randomize && buggify() ) TAG_THROTTLE_EXPIRATION_INTERVAL = 1.0;
|
|
init( TAG_THROTTLING_PAGE_SIZE, 4096 ); if( randomize && buggify() ) TAG_THROTTLING_PAGE_SIZE = 4096;
|
|
init( TAG_THROTTLING_RW_FUNGIBILITY_RATIO, 4.0 );
|
|
// Preserve the old public knob spelling while moving new code to the non-global name.
|
|
double_knobs["global_tag_throttling_rw_fungibility_ratio"] =
|
|
KnobValue<double>{ &TAG_THROTTLING_RW_FUNGIBILITY_RATIO };
|
|
init( TRANSACTION_LOCK_REJECTION_RETRIABLE, true );
|
|
|
|
// busyness reporting
|
|
init( BUSYNESS_SPIKE_START_THRESHOLD, 0.100 );
|
|
init( BUSYNESS_SPIKE_SATURATED_THRESHOLD, 0.500 );
|
|
|
|
init( CHANGE_QUORUM_BAD_STATE_RETRY_TIMES, 3 );
|
|
init( CHANGE_QUORUM_BAD_STATE_RETRY_DELAY, 2.0 );
|
|
|
|
init( ENABLE_MUTATION_CHECKSUM, false ); if ( randomize && buggify() ) ENABLE_MUTATION_CHECKSUM = deterministicRandom()->coinflip();
|
|
init( ENABLE_ACCUMULATIVE_CHECKSUM, false ); if ( randomize && buggify() ) ENABLE_ACCUMULATIVE_CHECKSUM = deterministicRandom()->coinflip();
|
|
init( ENABLE_ACCUMULATIVE_CHECKSUM_LOGGING, false );
|
|
|
|
// clang-format on
|
|
}
|
|
|
|
TEST_CASE("/fdbclient/knobs/initialize") {
|
|
// This test depends on TASKBUCKET_TIMEOUT_VERSIONS being defined as a constant multiple of CORE_VERSIONSPERSECOND
|
|
ClientKnobs clientKnobs(Randomize::False, IsSimulated::False);
|
|
int64_t initialCoreVersionsPerSecond = clientKnobs.CORE_VERSIONSPERSECOND;
|
|
int initialTaskBucketTimeoutVersions = clientKnobs.TASKBUCKET_TIMEOUT_VERSIONS;
|
|
clientKnobs.setKnob("core_versionspersecond", initialCoreVersionsPerSecond * 2);
|
|
ASSERT_EQ(clientKnobs.CORE_VERSIONSPERSECOND, initialCoreVersionsPerSecond * 2);
|
|
ASSERT_EQ(clientKnobs.TASKBUCKET_TIMEOUT_VERSIONS, initialTaskBucketTimeoutVersions);
|
|
clientKnobs.initialize(Randomize::False, IsSimulated::False);
|
|
ASSERT_EQ(clientKnobs.CORE_VERSIONSPERSECOND, initialCoreVersionsPerSecond * 2);
|
|
ASSERT_EQ(clientKnobs.TASKBUCKET_TIMEOUT_VERSIONS, initialTaskBucketTimeoutVersions * 2);
|
|
return Void();
|
|
}
|