84 lines
3.2 KiB
C
84 lines
3.2 KiB
C
|
/*
|
||
|
|
* BackupProgress.h
|
||
|
|
*
|
||
|
|
* This source file is part of the FoundationDB open source project
|
||
|
|
*
|
||
|
|
* Copyright 2013-2019 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.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#if defined(NO_INTELLISENSE) && !defined(FDBSERVER_BACKUPPROGRESS_ACTOR_G_H)
|
||
|
|
#define FDBSERVER_BACKUPPROGRESS_ACTOR_G_H
|
||
|
|
#include "fdbserver/BackupProgress.actor.g.h"
|
||
|
|
#elif !defined(FDBSERVER_BACKUPPROGRESS_ACTOR_H)
|
||
|
|
#define FDBSERVER_BACKUPPROGRESS_ACTOR_H
|
||
|
|
|
||
|
|
#include <map>
|
||
|
|
#include "fdbclient/FDBTypes.h"
|
||
|
|
#include "flow/Arena.h"
|
||
|
|
#include "flow/FastRef.h"
|
||
|
|
#include "flow/actorcompiler.h" // This must be the last #include.
|
||
|
|
|
||
|
|
struct BackupProgress : NonCopyable, ReferenceCounted<BackupProgress> {
|
||
|
|
public:
|
||
|
|
BackupProgress(UID id, const std::map<LogEpoch, std::pair<int, Version>>& epochTagsEndVersions)
|
||
|
|
: dbgid(id), epochTagsEndVersions(epochTagsEndVersions) {}
|
||
|
|
~BackupProgress() {}
|
||
|
|
|
||
|
|
// Adds a backup status. If the tag already has an entry, then the max of
|
||
|
|
// savedVersion is used.
|
||
|
|
void addBackupStatus(const WorkerBackupStatus& status);
|
||
|
|
|
||
|
|
// Returns a map of pair<Epoch, endVersion> : map<tag, savedVersion>, so that
|
||
|
|
// the backup range should be [savedVersion + 1, endVersion) for the "tag" of the "Epoch".
|
||
|
|
//
|
||
|
|
// for each old epoch:
|
||
|
|
// if tag in tags_without_backup_progress:
|
||
|
|
// savedVersion = last epoch's endVersion - 1 (First epoch's startVersion = 1)
|
||
|
|
// else if savedVersion < endVersion - 1 = knownCommittedVersion
|
||
|
|
// savedVersion = tag's_savedVersion
|
||
|
|
// backup [savedVersion + 1, endVersion)
|
||
|
|
std::map<std::pair<LogEpoch, Version>, std::map<Tag, Version>> getUnfinishedBackup();
|
||
|
|
|
||
|
|
private:
|
||
|
|
// Returns the previous epoch's EndVersion. Note epoch is not continuous, and
|
||
|
|
// we often has previous epoch N and current epoch N + 2. In case of consecutive
|
||
|
|
// recovery, more gaps are possible. The idea here is to find the last epoch whose
|
||
|
|
// epoch number most close to "epoch", and return the max(savedVersion) + 1.
|
||
|
|
Version getLastEpochEndVersion(LogEpoch epoch);
|
||
|
|
|
||
|
|
std::set<Tag> enumerateLogRouterTags(int logRouterTags) {
|
||
|
|
std::set<Tag> tags;
|
||
|
|
for (int i = 0; i < logRouterTags; i++) {
|
||
|
|
tags.insert(Tag(tagLocalityLogRouter, i));
|
||
|
|
}
|
||
|
|
return tags;
|
||
|
|
}
|
||
|
|
|
||
|
|
const UID dbgid;
|
||
|
|
|
||
|
|
// Note this should be iterated in ascending order.
|
||
|
|
const std::map<LogEpoch, std::pair<int, Version>> epochTagsEndVersions;
|
||
|
|
|
||
|
|
// Backup progress saved in the system keyspace. Note there can be multiple
|
||
|
|
// progress status for a tag in an epoch due to later epoch trying to fill
|
||
|
|
// the gap. "progress" should be iterated in ascending order.
|
||
|
|
std::map<LogEpoch, std::map<Tag, Version>> progress;
|
||
|
|
};
|
||
|
|
|
||
|
|
ACTOR Future<Void> getBackupProgress(Database cx, UID dbgid, Reference<BackupProgress> bStatus);
|
||
|
|
|
||
|
|
#include "flow/unactorcompiler.h"
|
||
|
|
#endif
|