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
|
/*
BAREOS® - Backup Archiving REcovery Open Sourced
Copyright (C) 2000-2012 Free Software Foundation Europe e.V.
Copyright (C) 2011-2012 Planets Communications B.V.
Copyright (C) 2019-2022 Bareos GmbH & Co. KG
This program is Free Software; you can redistribute it and/or
modify it under the terms of version three of the GNU Affero General Public
License as published by the Free Software Foundation and included
in the file LICENSE.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#include "include/bareos.h"
#include "include/jcr.h"
#include "lib/recent_job_results_list.h"
#include "lib/dlist.h"
#include "lib/berrno.h"
#include <vector>
#include <mutex>
#include <fstream>
static std::vector<RecentJobResultsList::JobResult> recent_job_results_list;
static const int max_count_recent_job_results = 10;
static std::mutex mutex;
void RecentJobResultsList::Cleanup()
{
std::lock_guard<std::mutex> lg(mutex);
if (!recent_job_results_list.empty()) { recent_job_results_list.clear(); }
}
bool RecentJobResultsList::ImportFromFile(std::ifstream& file)
{
#if defined HAVE_IS_TRIVIALLY_COPYABLE
static_assert(
std::is_trivially_copyable<RecentJobResultsList::JobResult>::value,
"RecentJobResultsList::JobResult must be trivially copyable");
#endif
uint32_t num;
try {
file.read(reinterpret_cast<char*>(&num), sizeof(num));
Dmsg1(100, "Read num_items=%d\n", num);
if (num > 4 * max_count_recent_job_results) { /* sanity check */
return false;
}
std::lock_guard<std::mutex> m(mutex);
for (; num; num--) {
RecentJobResultsList::JobResult job;
file.read(reinterpret_cast<char*>(&job), sizeof(job));
if (job.JobId > 0) {
recent_job_results_list.push_back(job);
if (recent_job_results_list.size() > max_count_recent_job_results) {
recent_job_results_list.erase(recent_job_results_list.begin());
}
}
}
} catch (const std::system_error& e) {
BErrNo be;
Dmsg3(010, "Could not open or read state file. ERR=%s - %s\n",
be.bstrerror(), e.code().message().c_str());
return false;
} catch (const std::exception& e) {
Dmsg0(100, "Could not open or read file. Some error occurred: %s\n",
e.what());
return false;
}
return true;
}
bool RecentJobResultsList::ExportToFile(std::ofstream& file)
{
if (!recent_job_results_list.empty()) {
std::lock_guard<std::mutex> m(mutex);
uint32_t num
= recent_job_results_list.size(); // always first entry in the file
#if defined HAVE_IS_TRIVIALLY_COPYABLE
static_assert(
std::is_trivially_copyable<RecentJobResultsList::JobResult>::value,
"RecentJobResultsList::JobResult must be trivially copyable");
#endif
try {
file.write(reinterpret_cast<char*>(&num), sizeof(num));
for (const auto& je : recent_job_results_list) {
file.write(reinterpret_cast<const char*>(&je),
sizeof(struct RecentJobResultsList::JobResult));
}
} catch (const std::system_error& e) {
BErrNo be;
Dmsg3(010, "Could not write state file. ERR=%s - %s\n", be.bstrerror(),
e.code().message().c_str());
return false;
} catch (const std::exception& e) {
Dmsg0(100, "Could not write file. Some error occurred: %s\n", e.what());
return false;
}
}
return true;
}
void RecentJobResultsList::Append(JobControlRecord* jcr)
{
RecentJobResultsList::JobResult je;
je.Errors = jcr->JobErrors;
je.JobType = jcr->getJobType();
je.JobId = jcr->JobId;
je.VolSessionId = jcr->VolSessionId;
je.VolSessionTime = jcr->VolSessionTime;
bstrncpy(je.Job, jcr->Job, sizeof(je.Job));
je.JobFiles = jcr->JobFiles;
je.JobBytes = jcr->JobBytes;
je.JobStatus = jcr->getJobStatus();
je.JobLevel = jcr->getJobLevel();
je.start_time = jcr->start_time;
je.end_time = time(nullptr);
std::lock_guard<std::mutex> lg(mutex);
recent_job_results_list.push_back(je);
if (recent_job_results_list.size() > max_count_recent_job_results) {
recent_job_results_list.erase(recent_job_results_list.begin());
}
}
std::vector<RecentJobResultsList::JobResult> RecentJobResultsList::Get()
{
std::lock_guard<std::mutex> lg(mutex);
return recent_job_results_list;
}
std::size_t RecentJobResultsList::Count()
{
std::lock_guard<std::mutex> lg(mutex);
return recent_job_results_list.size();
}
bool RecentJobResultsList::IsEmpty()
{
std::lock_guard<std::mutex> lg(mutex);
return recent_job_results_list.empty();
}
RecentJobResultsList::JobResult RecentJobResultsList::GetMostRecentJobResult()
{
std::lock_guard<std::mutex> lg(mutex);
if (recent_job_results_list.size()) {
return recent_job_results_list.front();
}
return RecentJobResultsList::JobResult{};
}
|
