| OLD | NEW |
| (Empty) |
| 1 // Copyright 2008, Google Inc. | |
| 2 // | |
| 3 // Redistribution and use in source and binary forms, with or without | |
| 4 // modification, are permitted provided that the following conditions are met: | |
| 5 // | |
| 6 // 1. Redistributions of source code must retain the above copyright notice, | |
| 7 // this list of conditions and the following disclaimer. | |
| 8 // 2. Redistributions in binary form must reproduce the above copyright notice, | |
| 9 // this list of conditions and the following disclaimer in the documentation | |
| 10 // and/or other materials provided with the distribution. | |
| 11 // 3. Neither the name of Google Inc. nor the names of its contributors may be | |
| 12 // used to endorse or promote products derived from this software without | |
| 13 // specific prior written permission. | |
| 14 // | |
| 15 // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED | |
| 16 // WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF | |
| 17 // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO | |
| 18 // EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 19 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | |
| 20 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; | |
| 21 // OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, | |
| 22 // WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR | |
| 23 // OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF | |
| 24 // ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 25 | |
| 26 // TODO(joth): port to chromium | |
| 27 #if 0 | |
| 28 | |
| 29 #include "gears/geolocation/backoff_manager.h" | |
| 30 | |
| 31 #include <assert.h> | |
| 32 | |
| 33 // The baseline minimum period between network requests. | |
| 34 static const int kBaselineMinimumRequestInterval = 1000 * 5; // 5 seconds | |
| 35 // The upper limit of the minimum period between network requests. | |
| 36 static const int kMinimumRequestIntervalLimit = 1000 * 60 * 60 * 3; // 3 hours | |
| 37 | |
| 38 | |
| 39 // static | |
| 40 BackoffManager::ServerMap BackoffManager::servers_; | |
| 41 | |
| 42 // static | |
| 43 Mutex BackoffManager::servers_mutex_; | |
| 44 | |
| 45 // static | |
| 46 void BackoffManager::ReportRequest(const std::string16 &url) { | |
| 47 MutexLock lock(&servers_mutex_); | |
| 48 ServerMap::iterator iter = servers_.find(url); | |
| 49 if (iter != servers_.end()) { | |
| 50 iter->second.first = GetCurrentTimeMillis(); | |
| 51 } else { | |
| 52 servers_[url] = std::make_pair(GetCurrentTimeMillis(), | |
| 53 kBaselineMinimumRequestInterval); | |
| 54 } | |
| 55 } | |
| 56 | |
| 57 // static | |
| 58 int64 BackoffManager::ReportResponse(const std::string16 &url, | |
| 59 bool server_error) { | |
| 60 // Use exponential back-off on server error. | |
| 61 MutexLock lock(&servers_mutex_); | |
| 62 ServerMap::iterator iter = servers_.find(url); | |
| 63 assert(iter != servers_.end()); | |
| 64 int64 *interval = &iter->second.second; | |
| 65 if (server_error) { | |
| 66 if (*interval < kMinimumRequestIntervalLimit) { | |
| 67 // Increase interval by between 90% and 110%. | |
| 68 srand(static_cast<unsigned int>(GetCurrentTimeMillis())); | |
| 69 double increment_proportion = 0.9 + 0.2 * rand() / RAND_MAX; | |
| 70 int64 increment = static_cast<int64>(*interval * increment_proportion); | |
| 71 if (increment > kMinimumRequestIntervalLimit - *interval) { | |
| 72 *interval = kMinimumRequestIntervalLimit; | |
| 73 } else { | |
| 74 *interval += increment; | |
| 75 } | |
| 76 } | |
| 77 } else { | |
| 78 *interval = kBaselineMinimumRequestInterval; | |
| 79 } | |
| 80 return iter->second.first + *interval; | |
| 81 } | |
| 82 | |
| 83 #endif // if 0 | |
| OLD | NEW |