blob: 77219bf088f57199f620589d111e81746ff74c05 (
plain)
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
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CHROME_BROWSER_SYNC_RETRY_VERIFIER_H_
#define CHROME_BROWSER_SYNC_RETRY_VERIFIER_H_
#include "base/time.h"
// TODO(akalin): Move this to somewhere in sync/ and make
// sync/engine/polling_constants.h private.
namespace syncer {
namespace sessions {
class SyncSessionSnapshot;
} // namespace sessions
} // namespace syncer
namespace browser_sync {
// The minimum and maximum wait times for a retry. The actual retry would take
// place somewhere in this range. The algorithm that calculates the retry wait
// time uses rand functions.
struct DelayInfo {
int64 min_delay;
int64 max_delay;
};
// Class to verify retries take place using the exponential backoff algorithm.
class RetryVerifier {
public:
static const int kMaxRetry = 3;
RetryVerifier();
~RetryVerifier();
int retry_count() const { return retry_count_; }
// Initialize with the current sync session snapshot. Using the snapshot
// we will figure out when the first retry sync happened.
void Initialize(const syncer::sessions::SyncSessionSnapshot& snap);
void VerifyRetryInterval(
const syncer::sessions::SyncSessionSnapshot& snap);
bool done() const { return done_; }
bool Succeeded() const { return done() && success_; }
private:
int retry_count_;
base::Time last_sync_time_;
DelayInfo delay_table_[kMaxRetry];
bool success_;
bool done_;
DISALLOW_COPY_AND_ASSIGN(RetryVerifier);
};
} // namespace browser_sync
#endif // CHROME_BROWSER_SYNC_RETRY_VERIFIER_H_
|
