wbtiger
/
foundationdb
mirror of https://github.com/apple/foundationdb.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
foundationdb/fdbrpc/ReplicationUtils.h

87 lines
4.0 KiB
C
Raw Normal View History

Initial repository commit
2017-05-26 04:48:44 +08:00
/*
* ReplicationUtils.h
*
* This source file is part of the FoundationDB open source project
*
* Copyright 2013-2018 Apple Inc. and the FoundationDB project authors
remove trailing whitespace from our copyright headers ; fixed formatting of python setup.py
2018-02-22 02:25:11 +08:00
*
Initial repository commit
2017-05-26 04:48:44 +08:00
* 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
remove trailing whitespace from our copyright headers ; fixed formatting of python setup.py
2018-02-22 02:25:11 +08:00
*
Initial repository commit
2017-05-26 04:48:44 +08:00
* http://www.apache.org/licenses/LICENSE-2.0
remove trailing whitespace from our copyright headers ; fixed formatting of python setup.py
2018-02-22 02:25:11 +08:00
*
Initial repository commit
2017-05-26 04:48:44 +08:00
* 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.
*/
#ifndef FLOW_REPLICATIONTEST_H
#define FLOW_REPLICATIONTEST_H
#pragma once
#include "flow/flow.h"
Adjust all includes to be relative to the root. Remove the use of relative paths. A header at foo/bar.h could be included by files under foo/ with "bar.h", but would be included everywhere else as "foo/bar.h". Adjust so that every include references such a header with the latter form. Signed-off-by: Robert Escriva <rescriva@dropbox.com>
2018-10-20 01:30:13 +08:00
#include "fdbrpc/ReplicationTypes.h"
Initial repository commit
2017-05-26 04:48:44 +08:00
apply clang-format to *.c, *.cpp, *.h, *.hpp files
2021-03-11 02:06:03 +08:00
typedef std::string repTestType;
// string value defining test type
Initial repository commit
2017-05-26 04:48:44 +08:00
apply clang-format to *.c, *.cpp, *.h, *.hpp files
2021-03-11 02:06:03 +08:00
extern repTestType convertToTestType(int iValue);
// converts integer value to a test type
Initial repository commit
2017-05-26 04:48:44 +08:00
extern int testReplication();
apply clang-format to *.c, *.cpp, *.h, *.hpp files
2021-03-11 02:06:03 +08:00
extern double ratePolicy(Reference<LocalitySet>& localitySet,
Reference<IReplicationPolicy> const& policy,
unsigned int nSelectTests);
// returns the value for the rate policy
// given a localitySet, replication policy and number of selected tests, apply the
// policy and return the rating
// rating can be -1 there are no unique results failing while applying the replication
// policy, otherwise largest mode from the items per unique set of locaility entry
// are returned.
Initial repository commit
2017-05-26 04:48:44 +08:00
apply clang-format to *.c, *.cpp, *.h, *.hpp files
2021-03-11 02:06:03 +08:00
extern bool findBestPolicySet(std::vector<LocalityEntry>& bestResults,
Reference<LocalitySet>& localitySet,
Reference<IReplicationPolicy> const& policy,
unsigned int nMinItems,
unsigned int nSelectTests,
unsigned int nPolicyTests);
// returns the best policy set
// given locality set, replication policy, number of min items, number of select
// test, number of policy tests, find the best from locality set, including few
// random items, get the rate policy having test rate, best rate and returning
// the success state.
Initial repository commit
2017-05-26 04:48:44 +08:00
apply clang-format to *.c, *.cpp, *.h, *.hpp files
2021-03-11 02:06:03 +08:00
extern bool findBestUniquePolicySet(std::vector<LocalityEntry>& bestResults,
Reference<LocalitySet>& localitySet,
Reference<IReplicationPolicy> const& policy,
StringRef localityUniquenessKey,
unsigned int nMinItems,
unsigned int nSelectTests,
unsigned int nPolicyTests);
Initial repository commit
2017-05-26 04:48:44 +08:00
// The following function will return TRUE if all possible combinations
// of the new Item array will not pass the specified policy
apply clang-format to *.c, *.cpp, *.h, *.hpp files
2021-03-11 02:06:03 +08:00
extern bool validateAllCombinations(std::vector<LocalityData>& offendingCombo,
LocalityGroup const& localitySet,
Reference<IReplicationPolicy> const& policy,
std::vector<LocalityData> const& newItems,
unsigned int nCombinationSize,
bool bCheckIfValid = true);
Initial repository commit
2017-05-26 04:48:44 +08:00
apply clang-format to *.c, *.cpp, *.h, *.hpp files
2021-03-11 02:06:03 +08:00
extern bool validateAllCombinations(LocalityGroup const& localitySet,
Reference<IReplicationPolicy> const& policy,
std::vector<LocalityData> const& newItems,
unsigned int nCombinationSize,
bool bCheckIfValid = true);
Fix the GRV performance regression introduced by adding the policy engine to GRV calculations. Construction of LocalityGroup from LocalityData is expensive, and the previous code greatly ran afoul of that. The policy engine does a large amount of interning of strings and building compressed maps to make the expected many future selectReplica calls cheap. Unfortunately we don't call selectReplicas, so much of this work is undesireable for us, and a large amount of CPU time is spent doing this initialization work. The new changes aggressively do the minimal LocalityGroup::add() calls necessary, and make them as cheap as possibly by removing all elements from LocalityData that don't need to be considered by the policy. This optimization was also applied to the PeekCursor used during recovery, which should speed recoveries up by a small amount.
2017-11-16 13:05:10 +08:00
/// Remove all pieces of locality information from the LocalityData that will not be used when validating the policy.
more work towards shrinking locality
2020-04-19 12:29:38 +08:00
void filterLocalityDataForPolicyDcAndProcess(Reference<IReplicationPolicy> policy, LocalityData* ld);
removed LocalitySetRef and IRepPolicyRef typedefs, because for clarity the Ref suffix is reserved for arena allocated objects instead of reference counted objects.
2019-03-14 04:14:39 +08:00
void filterLocalityDataForPolicy(Reference<IReplicationPolicy> policy, LocalityData* ld);
void filterLocalityDataForPolicy(Reference<IReplicationPolicy> policy, std::vector<LocalityData>* vld);
Fix the GRV performance regression introduced by adding the policy engine to GRV calculations. Construction of LocalityGroup from LocalityData is expensive, and the previous code greatly ran afoul of that. The policy engine does a large amount of interning of strings and building compressed maps to make the expected many future selectReplica calls cheap. Unfortunately we don't call selectReplicas, so much of this work is undesireable for us, and a large amount of CPU time is spent doing this initialization work. The new changes aggressively do the minimal LocalityGroup::add() calls necessary, and make them as cheap as possibly by removing all elements from LocalityData that don't need to be considered by the policy. This optimization was also applied to the PeekCursor used during recovery, which should speed recoveries up by a small amount.
2017-11-16 13:05:10 +08:00
Initial repository commit
2017-05-26 04:48:44 +08:00
#endif