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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
// Copyright (c) 2013 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.
#include "chrome/service/cloud_print/printer_job_queue_handler.h"
#include <math.h>
#include <algorithm>
#include "base/values.h"
namespace cloud_print {
class TimeProviderImpl : public PrinterJobQueueHandler::TimeProvider {
public:
base::Time GetNow() override;
};
base::Time TimeProviderImpl::GetNow() {
return base::Time::Now();
}
JobDetails::JobDetails() {}
JobDetails::~JobDetails() {}
void JobDetails::Clear() {
job_id_.clear();
job_title_.clear();
job_owner_.clear();
print_ticket_.clear();
print_ticket_mime_type_.clear();
print_data_mime_type_.clear();
print_data_file_path_ = base::FilePath();
print_data_url_.clear();
print_ticket_url_.clear();
tags_.clear();
time_remaining_ = base::TimeDelta();
}
// static
bool JobDetails::ordering(const JobDetails& first, const JobDetails& second) {
return first.time_remaining_ < second.time_remaining_;
}
PrinterJobQueueHandler::PrinterJobQueueHandler(TimeProvider* time_provider)
: time_provider_(time_provider) {}
PrinterJobQueueHandler::PrinterJobQueueHandler()
: time_provider_(new TimeProviderImpl()) {}
PrinterJobQueueHandler::~PrinterJobQueueHandler() {}
void PrinterJobQueueHandler::ConstructJobDetailsFromJson(
const base::DictionaryValue* job_data,
JobDetails* job_details) {
job_details->Clear();
job_data->GetString(kIdValue, &job_details->job_id_);
job_data->GetString(kTitleValue, &job_details->job_title_);
job_data->GetString(kOwnerValue, &job_details->job_owner_);
job_data->GetString(kTicketUrlValue, &job_details->print_ticket_url_);
job_data->GetString(kFileUrlValue, &job_details->print_data_url_);
// Get tags for print job.
const base::ListValue* tags = NULL;
if (job_data->GetList(kTagsValue, &tags)) {
for (size_t i = 0; i < tags->GetSize(); i++) {
std::string value;
if (tags->GetString(i, &value))
job_details->tags_.push_back(value);
}
}
}
base::TimeDelta PrinterJobQueueHandler::ComputeBackoffTime(
const std::string& job_id) {
FailedJobMap::const_iterator job_location = failed_job_map_.find(job_id);
if (job_location == failed_job_map_.end()) {
return base::TimeDelta();
}
base::TimeDelta backoff_time =
base::TimeDelta::FromSeconds(kJobFirstWaitTimeSecs);
backoff_time *=
// casting argument to double and result to uint64 to avoid compilation
// issues
static_cast<int64>(pow(
static_cast<long double>(kJobWaitTimeExponentialMultiplier),
job_location->second.retries_) + 0.5);
base::Time scheduled_retry =
job_location->second.last_retry_ + backoff_time;
base::Time now = time_provider_->GetNow();
base::TimeDelta time_remaining;
if (scheduled_retry < now) {
return base::TimeDelta();
}
return scheduled_retry - now;
}
void PrinterJobQueueHandler::GetJobsFromQueue(
const base::DictionaryValue* json_data,
std::vector<JobDetails>* jobs) {
std::vector<JobDetails> jobs_with_timeouts;
jobs->clear();
const base::ListValue* job_list = NULL;
if (!json_data->GetList(kJobListValue, &job_list)) {
return;
}
size_t list_size = job_list->GetSize();
for (size_t cur_job = 0; cur_job < list_size; cur_job++) {
const base::DictionaryValue* job_data = NULL;
if (job_list->GetDictionary(cur_job, &job_data)) {
JobDetails job_details_current;
ConstructJobDetailsFromJson(job_data, &job_details_current);
job_details_current.time_remaining_ =
ComputeBackoffTime(job_details_current.job_id_);
if (job_details_current.time_remaining_ == base::TimeDelta()) {
jobs->push_back(job_details_current);
} else {
jobs_with_timeouts.push_back(job_details_current);
}
}
}
sort(jobs_with_timeouts.begin(), jobs_with_timeouts.end(),
&JobDetails::ordering);
jobs->insert(jobs->end(), jobs_with_timeouts.begin(),
jobs_with_timeouts.end());
}
void PrinterJobQueueHandler::JobDone(const std::string& job_id) {
failed_job_map_.erase(job_id);
}
bool PrinterJobQueueHandler::JobFetchFailed(const std::string& job_id) {
FailedJobMetadata metadata;
metadata.retries_ = 0;
metadata.last_retry_ = time_provider_->GetNow();
std::pair<FailedJobMap::iterator, bool> job_found =
failed_job_map_.insert(FailedJobPair(job_id, metadata));
// If the job has already failed once, increment the number of retries.
// If it has failed too many times, remove it from the map and tell the caller
// to report a failure.
if (!job_found.second) {
if (job_found.first->second.retries_ >= kNumRetriesBeforeAbandonJob) {
failed_job_map_.erase(job_found.first);
return false;
}
job_found.first->second.retries_ += 1;
job_found.first->second.last_retry_ = time_provider_->GetNow();
}
return true;
}
} // namespace cloud_print
|
