GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/catalog_traversal_parallel.h
Date: 2026-09-06 02:40:30
Exec Total Coverage
Lines: 187 199 94.0%
Branches: 160 244 65.6%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5 #ifndef CVMFS_CATALOG_TRAVERSAL_PARALLEL_H_
6 #define CVMFS_CATALOG_TRAVERSAL_PARALLEL_H_
7
8 #include <stack>
9 #include <string>
10 #include <vector>
11
12 #include "catalog_traversal.h"
13 #include "util/atomic.h"
14 #include "util/exception.h"
15 #include "util/tube.h"
16
17 namespace swissknife {
18
19 /**
20 * This class implements the same functionality as CatalogTraversal, but in
21 * parallel. For common functionality, see the documentation of
22 * CatalogTraversal. Differences:
23 * - can choose number of threads
24 * - traversal types change meaning:
25 * - depth-first -> parallelized post-order traversal (parents are processed
26 * after all children are finished)
27 * - breadth-first -> same as original, but parallelized
28 */
29 template<class ObjectFetcherT>
30 class CatalogTraversalParallel : public CatalogTraversalBase<ObjectFetcherT> {
31 public:
32 typedef CatalogTraversalBase<ObjectFetcherT> Base;
33 typedef ObjectFetcherT ObjectFetcherTN;
34 typedef typename ObjectFetcherT::CatalogTN CatalogTN;
35 typedef typename ObjectFetcherT::HistoryTN HistoryTN;
36 typedef CatalogTraversalData<CatalogTN> CallbackDataTN;
37 typedef typename CatalogTN::NestedCatalogList NestedCatalogList;
38 typedef typename Base::Parameters Parameters;
39 typedef typename Base::TraversalType TraversalType;
40 typedef std::vector<shash::Any> HashList;
41
42 1915 explicit CatalogTraversalParallel(const Parameters &params)
43 : CatalogTraversalBase<ObjectFetcherT>(params)
44 1915 , num_threads_(params.num_threads)
45
4/8
✓ Branch 2 taken 1915 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 1915 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 1915 times.
✗ Branch 9 not taken.
✓ Branch 11 taken 1915 times.
✗ Branch 12 not taken.
 1915 , serialize_callbacks_(params.serialize_callbacks) {
46 1915 atomic_init32(&num_errors_);
47
1/2
✓ Branch 1 taken 1915 times.
✗ Branch 2 not taken.
 1915 shash::Any null_hash;
48 1915 null_hash.SetNull();
49
1/2
✓ Branch 1 taken 1915 times.
✗ Branch 2 not taken.
 1915 catalogs_processing_.Init(1024, null_hash, hasher);
50
1/2
✓ Branch 1 taken 1915 times.
✗ Branch 2 not taken.
 1915 catalogs_done_.Init(1024, null_hash, hasher);
51 1915 pthread_mutex_init(&catalog_callback_lock_, NULL);
52 1915 pthread_mutex_init(&catalogs_lock_, NULL);
53 1915 effective_history_depth_ = this->default_history_depth_;
54 1915 effective_timestamp_threshold_ = this->default_timestamp_threshold_;
55 1915 }
56
57 protected:
58 struct CatalogJob : public CatalogTraversal<ObjectFetcherT>::CatalogJob,
59 public Observable<int> {
60 14364895 explicit CatalogJob(const std::string &path,
61 const shash::Any &hash,
62 const unsigned tree_level,
63 const uint64_t history_depth,
64 CatalogTN *parent = NULL)
65 : CatalogTraversal<ObjectFetcherT>::CatalogJob(path, hash, tree_level,
66 14364895 history_depth, parent) {
67 14364895 atomic_init32(&children_unprocessed);
68 14364895 }
69
70
1/2
✓ Branch 1 taken 7162724 times.
✗ Branch 2 not taken.
 7163387 void WakeParents() { this->NotifyListeners(0); }
71
72 atomic_int32 children_unprocessed;
73 };
74
75 public:
76 /**
77 * Starts the traversal process.
78 * After calling this methods CatalogTraversal will go through all catalogs
79 * and call the registered callback methods for each found catalog.
80 * If something goes wrong in the process, the traversal will be cancelled.
81 *
82 * @return true, when all catalogs were successfully processed. On
83 * failure the traversal is cancelled and false is returned.
84 */
85 1266 bool Traverse(const TraversalType type = Base::kBreadthFirst) {
86
1/2
✓ Branch 1 taken 1266 times.
✗ Branch 2 not taken.
 1266 const shash::Any root_catalog_hash = this->GetRepositoryRootCatalogHash();
87
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 1266 times.
 1266 if (root_catalog_hash.IsNull()) {
88 ✗ return false;
89 }
90
1/2
✓ Branch 1 taken 1266 times.
✗ Branch 2 not taken.
 1266 return Traverse(root_catalog_hash, type);
91 }
92
93 /**
94 * Starts the traversal process at the catalog pointed to by the given hash
95 *
96 * @param root_catalog_hash the entry point into the catalog traversal
97 * @return true when catalogs were successfully traversed
98 */
99 1851 bool Traverse(const shash::Any &root_catalog_hash,
100 const TraversalType type = Base::kBreadthFirst) {
101 // add the root catalog of the repository as the first element on the job
102 // stack
103 3702 if (this->no_repeat_history_
104
4/6
✓ Branch 0 taken 993 times.
✓ Branch 1 taken 858 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 993 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 1851 times.
 1851 && catalogs_done_.Contains(root_catalog_hash)) {
105 ✗ return true;
106 }
107 1851 effective_traversal_type_ = type;
108
3/6
✓ Branch 2 taken 1851 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 1851 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 1851 times.
✗ Branch 9 not taken.
 1851 CatalogJob *root_job = new CatalogJob("", root_catalog_hash, 0, 0);
109 1851 PushJob(root_job);
110 1851 return DoTraverse();
111 }
112
113 /**
114 * Start the traversal process from a list of root catalogs. Same as
115 * TraverseRevision function, TraverseList does not traverse into predecessor
116 * catalog revisions and ignores TraversalParameter settings.
117 */
118 1323 bool TraverseList(const HashList &root_catalog_list,
119 const TraversalType type = Base::kBreadthFirst) {
120 // Push in reverse order for CatalogTraversal-like behavior
121 1323 HashList::const_reverse_iterator i = root_catalog_list.rbegin();
122 1323 const HashList::const_reverse_iterator iend = root_catalog_list.rend();
123 1323 bool has_pushed = false;
124 {
125 1323 MutexLockGuard const m(&catalogs_lock_);
126
3/4
✓ Branch 2 taken 4117 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2794 times.
✓ Branch 5 taken 1323 times.
 4117 for (; i != iend; ++i) {
127
7/8
✓ Branch 0 taken 2443 times.
✓ Branch 1 taken 351 times.
✓ Branch 4 taken 2443 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 850 times.
✓ Branch 7 taken 1593 times.
✓ Branch 8 taken 850 times.
✓ Branch 9 taken 1944 times.
 2794 if (this->no_repeat_history_ && catalogs_done_.Contains(*i)) {
128 850 continue;
129 }
130
131
3/6
✓ Branch 2 taken 1944 times.
✗ Branch 3 not taken.
✓ Branch 6 taken 1944 times.
✗ Branch 7 not taken.
✓ Branch 9 taken 1944 times.
✗ Branch 10 not taken.
 1944 CatalogJob *root_job = new CatalogJob("", *i, 0, 0);
132
1/2
✓ Branch 1 taken 1944 times.
✗ Branch 2 not taken.
 1944 PushJobUnlocked(root_job);
133 1944 has_pushed = true;
134 }
135 1323 }
136 // noop: no catalogs to traverse
137
2/2
✓ Branch 0 taken 325 times.
✓ Branch 1 taken 998 times.
 1323 if (!has_pushed) {
138 325 return true;
139 }
140 998 effective_traversal_type_ = type;
141 998 effective_history_depth_ = Parameters::kNoHistory;
142 998 effective_timestamp_threshold_ = Parameters::kNoTimestampThreshold;
143
1/2
✓ Branch 1 taken 998 times.
✗ Branch 2 not taken.
 998 bool const result = DoTraverse();
144 998 effective_history_depth_ = this->default_history_depth_;
145 998 effective_timestamp_threshold_ = this->default_timestamp_threshold_;
146 998 return result;
147 }
148
149 /**
150 * Starts the traversal process at the catalog pointed to by the given hash
151 * but doesn't traverse into predecessor catalog revisions. This overrides the
152 * TraversalParameter settings provided at construction.
153 *
154 * @param root_catalog_hash the entry point into the catalog traversal
155 * @return true when catalogs were successfully traversed
156 */
157 78 bool TraverseRevision(const shash::Any &root_catalog_hash,
158 const TraversalType type = Base::kBreadthFirst) {
159 78 effective_history_depth_ = Parameters::kNoHistory;
160 78 effective_timestamp_threshold_ = Parameters::kNoTimestampThreshold;
161 78 bool const result = Traverse(root_catalog_hash, type);
162 78 effective_history_depth_ = this->default_history_depth_;
163 78 effective_timestamp_threshold_ = this->default_timestamp_threshold_;
164 78 return result;
165 }
166
167 protected:
168 66000056 static uint32_t hasher(const shash::Any &key) {
169 // Don't start with the first bytes, because == is using them as well
170 return static_cast<uint32_t>(
171 66000056 *(reinterpret_cast<const uint32_t *>(key.digest) + 1));
172 }
173
174 2849 bool DoTraverse() {
175 // Optimal number of threads is yet to be determined. The main event loop
176 // contains a spin-lock, so it should not be more than number of cores.
177 2849 threads_process_ = reinterpret_cast<pthread_t *>(
178 2849 smalloc(sizeof(pthread_t) * num_threads_));
179
2/2
✓ Branch 0 taken 3395 times.
✓ Branch 1 taken 2849 times.
 6244 for (unsigned int i = 0; i < num_threads_; ++i) {
180 3395 int const retval = pthread_create(&threads_process_[i], NULL, MainProcessQueue,
181 this);
182
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3395 times.
 3395 if (retval != 0)
183 ✗ PANIC(kLogStderr, "failed to create thread");
184 }
185
186
2/2
✓ Branch 0 taken 3395 times.
✓ Branch 1 taken 2849 times.
 6244 for (unsigned int i = 0; i < num_threads_; ++i) {
187 3395 int const retval = pthread_join(threads_process_[i], NULL);
188
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3395 times.
 3395 assert(retval == 0);
189 }
190 2849 free(threads_process_);
191
192
2/2
✓ Branch 1 taken 39 times.
✓ Branch 2 taken 2810 times.
 2849 if (atomic_read32(&num_errors_))
193 39 return false;
194
195
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2810 times.
 2810 assert(catalogs_processing_.size() == 0);
196
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2810 times.
 2810 assert(pre_job_queue_.IsEmpty());
197
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2810 times.
 2810 assert(post_job_queue_.IsEmpty());
198 2810 return true;
199 }
200
201 3395 static void *MainProcessQueue(void *data) {
202 3395 CatalogTraversalParallel<ObjectFetcherT> *traversal = reinterpret_cast<
203 CatalogTraversalParallel<ObjectFetcherT> *>(data);
204 CatalogJob *current_job;
205 while (true) {
206 15684862 current_job = traversal->post_job_queue_.TryPopFront();
207
2/2
✓ Branch 0 taken 1324920 times.
✓ Branch 1 taken 14364505 times.
 15689425 if (current_job != NULL) {
208 1324920 traversal->ProcessJobPost(current_job);
209 } else {
210 14364505 current_job = traversal->pre_job_queue_.PopFront();
211 // NULL means the master thread tells us to finish
212
2/2
✓ Branch 1 taken 3395 times.
✓ Branch 2 taken 14361149 times.
 14364622 if (current_job->hash.IsNull()) {
213
1/2
✓ Branch 0 taken 3395 times.
✗ Branch 1 not taken.
 3395 delete current_job;
214 3356 break;
215 }
216 14361149 traversal->ProcessJobPre(current_job);
217 }
218 }
219 3356 return NULL;
220 }
221
222 2849 void NotifyFinished() {
223
1/2
✓ Branch 1 taken 2849 times.
✗ Branch 2 not taken.
 2849 shash::Any null_hash;
224 2849 null_hash.SetNull();
225
2/2
✓ Branch 0 taken 3395 times.
✓ Branch 1 taken 2849 times.
 6244 for (unsigned i = 0; i < num_threads_; ++i) {
226
3/6
✓ Branch 2 taken 3395 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 3395 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 3395 times.
✗ Branch 9 not taken.
 3395 CatalogJob *job = new CatalogJob("", null_hash, 0, 0);
227
1/2
✓ Branch 1 taken 3395 times.
✗ Branch 2 not taken.
 3395 pre_job_queue_.EnqueueFront(job);
228 }
229 2849 }
230
231 1851 void PushJob(CatalogJob *job) {
232 1851 MutexLockGuard const m(&catalogs_lock_);
233
1/2
✓ Branch 1 taken 1851 times.
✗ Branch 2 not taken.
 1851 PushJobUnlocked(job);
234 1851 }
235
236 14361500 void PushJobUnlocked(CatalogJob *job) {
237 14361500 catalogs_processing_.Insert(job->hash, job);
238 14361500 pre_job_queue_.EnqueueFront(job);
239 14361500 }
240
241 14360993 void ProcessJobPre(CatalogJob *job) {
242
4/6
✓ Branch 0 taken 14360993 times.
✗ Branch 1 not taken.
✓ Branch 3 taken 14356469 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 39 times.
✓ Branch 6 taken 14356430 times.
 14360993 if (!this->PrepareCatalog(job)) {
243 39 atomic_inc32(&num_errors_);
244
1/2
✓ Branch 1 taken 39 times.
✗ Branch 2 not taken.
 39 NotifyFinished();
245 13032290 return;
246 }
247
2/2
✓ Branch 0 taken 192 times.
✓ Branch 1 taken 14356238 times.
 14356430 if (job->ignore) {
248
1/2
✓ Branch 1 taken 192 times.
✗ Branch 2 not taken.
 192 FinalizeJob(job);
249 192 return;
250 }
251
1/2
✓ Branch 1 taken 14322620 times.
✗ Branch 2 not taken.
 14356238 NestedCatalogList const catalog_list = job->catalog->ListOwnNestedCatalogs();
252 unsigned int num_children;
253 // Ensure that pushed children won't call ProcessJobPost on this job
254 // before this function finishes
255 {
256 14322620 MutexLockGuard const m(&catalogs_lock_);
257
2/2
✓ Branch 0 taken 7197776 times.
✓ Branch 1 taken 7163454 times.
 14361230 if (effective_traversal_type_ == Base::kBreadthFirst) {
258
1/2
✓ Branch 1 taken 7197776 times.
✗ Branch 2 not taken.
 7197776 num_children = PushPreviousRevision(job)
259
1/2
✓ Branch 1 taken 7197776 times.
✗ Branch 2 not taken.
 7197776 + PushNestedCatalogs(job, catalog_list);
260 } else {
261
1/2
✓ Branch 1 taken 7163454 times.
✗ Branch 2 not taken.
 7163454 num_children = PushNestedCatalogs(job, catalog_list)
262
1/2
✓ Branch 1 taken 7163454 times.
✗ Branch 2 not taken.
 7163454 + PushPreviousRevision(job);
263 7163454 atomic_write32(&job->children_unprocessed, num_children);
264 }
265
3/6
✓ Branch 0 taken 14361230 times.
✗ Branch 1 not taken.
✓ Branch 3 taken 14361230 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 14361230 times.
 14361230 if (!this->CloseCatalog(false, job)) {
266 ✗ atomic_inc32(&num_errors_);
267 ✗ NotifyFinished();
268 }
269 14361230 }
270
271 // breadth-first: can post-process immediately
272 // depth-first: no children -> can post-process immediately
273
4/4
✓ Branch 0 taken 7163298 times.
✓ Branch 1 taken 7197464 times.
✓ Branch 2 taken 5838378 times.
✓ Branch 3 taken 1324920 times.
 14360762 if (effective_traversal_type_ == Base::kBreadthFirst || num_children == 0) {
274
1/2
✓ Branch 1 taken 13032215 times.
✗ Branch 2 not taken.
 13035842 ProcessJobPost(job);
275 13032215 return;
276 }
277
2/2
✓ Branch 1 taken 1324920 times.
✓ Branch 2 taken 13032059 times.
 14357135 }
278
279 14361230 unsigned int PushNestedCatalogs(CatalogJob *job,
280 const NestedCatalogList &catalog_list) {
281 14361230 typename NestedCatalogList::const_iterator i = catalog_list.begin();
282 14361230 typename NestedCatalogList::const_iterator const iend = catalog_list.end();
283 14361230 unsigned int num_children = 0;
284
2/2
✓ Branch 2 taken 14357823 times.
✓ Branch 3 taken 14361230 times.
 28719053 for (; i != iend; ++i) {
285
7/8
✓ Branch 0 taken 21735 times.
✓ Branch 1 taken 14336088 times.
✓ Branch 4 taken 21735 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 2445 times.
✓ Branch 7 taken 19290 times.
✓ Branch 8 taken 2445 times.
✓ Branch 9 taken 14355378 times.
 14357823 if (this->no_repeat_history_ && catalogs_done_.Contains(i->hash)) {
286 2445 continue;
287 }
288
289 CatalogJob *child;
290 28710756 if (!this->no_repeat_history_
291
7/8
✓ Branch 0 taken 19290 times.
✓ Branch 1 taken 14336088 times.
✓ Branch 4 taken 19290 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 18978 times.
✓ Branch 7 taken 312 times.
✓ Branch 8 taken 14355066 times.
✓ Branch 9 taken 312 times.
 14355378 || !catalogs_processing_.Lookup(i->hash, &child)) {
292
2/2
✓ Branch 0 taken 14298843 times.
✓ Branch 1 taken 56223 times.
 14355066 CatalogTN *parent = (this->no_close_) ? job->catalog : NULL;
293
1/2
✓ Branch 2 taken 14355066 times.
✗ Branch 3 not taken.
 28710132 child = new CatalogJob(i->mountpoint.ToString(),
294
1/2
✓ Branch 2 taken 14355066 times.
✗ Branch 3 not taken.
 14355066 i->hash,
295 14355066 job->tree_level + 1,
296
1/2
✓ Branch 1 taken 14355066 times.
✗ Branch 2 not taken.
 14355066 job->history_depth,
297 parent);
298
1/2
✓ Branch 1 taken 14355066 times.
✗ Branch 2 not taken.
 14355066 PushJobUnlocked(child);
299 }
300
301
2/2
✓ Branch 0 taken 7162152 times.
✓ Branch 1 taken 7193226 times.
 14355378 if (effective_traversal_type_ == Base::kDepthFirst) {
302
1/2
✓ Branch 1 taken 7162152 times.
✗ Branch 2 not taken.
 7162152 child->RegisterListener(&CatalogTraversalParallel::OnChildFinished,
303 this, job);
304 }
305 14355378 ++num_children;
306 }
307 14361230 return num_children;
308 }
309
310 /**
311 * Pushes the previous revision of a root catalog.
312 * @return the number of catalogs pushed on the processing stack
313 */
314 14361230 unsigned int PushPreviousRevision(CatalogJob *job) {
315 // only root catalogs are used for entering a previous revision (graph)
316
2/2
✓ Branch 1 taken 14354963 times.
✓ Branch 2 taken 6267 times.
 14361230 if (!job->catalog->IsRoot()) {
317 14354963 return 0;
318 }
319
320
1/2
✓ Branch 1 taken 6267 times.
✗ Branch 2 not taken.
 6267 const shash::Any previous_revision = job->catalog->GetPreviousRevision();
321
2/2
✓ Branch 1 taken 573 times.
✓ Branch 2 taken 5694 times.
 6267 if (previous_revision.IsNull()) {
322 573 return 0;
323 }
324
325 // check if the next deeper history level is actually requested
326
3/4
✓ Branch 1 taken 5694 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 3055 times.
✓ Branch 4 taken 2639 times.
 5694 if (this->IsBelowPruningThresholds(*job, effective_history_depth_,
327 effective_timestamp_threshold_)) {
328 3055 return 0;
329 }
330
331 5278 if (this->no_repeat_history_
332
5/8
✓ Branch 0 taken 1547 times.
✓ Branch 1 taken 1092 times.
✓ Branch 3 taken 1547 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 1547 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 2639 times.
 2639 && catalogs_done_.Contains(previous_revision)) {
333 ✗ return 0;
334 }
335
336 CatalogJob *prev_job;
337 5278 if (!this->no_repeat_history_
338
5/8
✓ Branch 0 taken 1547 times.
✓ Branch 1 taken 1092 times.
✓ Branch 3 taken 1547 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 1547 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 2639 times.
✗ Branch 8 not taken.
 2639 || !catalogs_processing_.Lookup(previous_revision, &prev_job)) {
339
2/4
✓ Branch 2 taken 2639 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 2639 times.
✗ Branch 6 not taken.
 5278 prev_job = new CatalogJob("", previous_revision, 0,
340
1/2
✓ Branch 1 taken 2639 times.
✗ Branch 2 not taken.
 2639 job->history_depth + 1);
341
1/2
✓ Branch 1 taken 2639 times.
✗ Branch 2 not taken.
 2639 PushJobUnlocked(prev_job);
342 }
343
344
2/2
✓ Branch 0 taken 585 times.
✓ Branch 1 taken 2054 times.
 2639 if (effective_traversal_type_ == Base::kDepthFirst) {
345
1/2
✓ Branch 1 taken 585 times.
✗ Branch 2 not taken.
 585 prev_job->RegisterListener(&CatalogTraversalParallel::OnChildFinished,
346 this, job);
347 }
348 2639 return 1;
349 }
350
351 14358890 void ProcessJobPost(CatalogJob *job) {
352 // Save time by keeping catalog open when suitable
353
1/2
✓ Branch 0 taken 14358890 times.
✗ Branch 1 not taken.
 14358890 if (job->catalog == NULL) {
354
3/4
✓ Branch 0 taken 14358890 times.
✗ Branch 1 not taken.
✓ Branch 3 taken 2457 times.
✓ Branch 4 taken 14312675 times.
 14358890 if (!this->ReopenCatalog(job)) {
355 2457 atomic_inc32(&num_errors_);
356 ✗ NotifyFinished();
357 ✗ return;
358 }
359 }
360
1/2
✓ Branch 0 taken 14312675 times.
✗ Branch 1 not taken.
 14312675 if (serialize_callbacks_) {
361 14312675 MutexLockGuard const m(&catalog_callback_lock_);
362
2/4
✓ Branch 1 taken 14361230 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 14361230 times.
✗ Branch 5 not taken.
 14361230 this->NotifyListeners(job->GetCallbackData());
363 14361230 } else {
364 ✗ this->NotifyListeners(job->GetCallbackData());
365 }
366
2/2
✓ Branch 0 taken 62192 times.
✓ Branch 1 taken 14299038 times.
 14361230 if (!this->no_close_) {
367
2/4
✓ Branch 0 taken 62192 times.
✗ Branch 1 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 62192 times.
 62192 if (!this->CloseCatalog(true, job)) {
368 ✗ atomic_inc32(&num_errors_);
369 ✗ NotifyFinished();
370 ✗ return;
371 }
372 }
373 14361230 FinalizeJob(job);
374 }
375
376 14361305 void FinalizeJob(CatalogJob *job) {
377 {
378 14361305 MutexLockGuard const m(&catalogs_lock_);
379
1/2
✓ Branch 1 taken 14361422 times.
✗ Branch 2 not taken.
 14361422 catalogs_processing_.Erase(job->hash);
380
1/2
✓ Branch 1 taken 14361422 times.
✗ Branch 2 not taken.
 14361422 catalogs_done_.Insert(job->hash, true);
381 // No more catalogs to process -> finish
382
1/2
✓ Branch 2 taken 2810 times.
✗ Branch 3 not taken.
 14364232 if (catalogs_processing_.size() == 0 && pre_job_queue_.IsEmpty()
383
5/6
✓ Branch 0 taken 2810 times.
✓ Branch 1 taken 14358612 times.
✓ Branch 3 taken 2810 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 2810 times.
✓ Branch 6 taken 14358612 times.
 14364232 && post_job_queue_.IsEmpty()) {
384
1/2
✓ Branch 1 taken 2810 times.
✗ Branch 2 not taken.
 2810 NotifyFinished();
385 }
386 14361422 }
387
2/2
✓ Branch 0 taken 7163426 times.
✓ Branch 1 taken 7197918 times.
 14361344 if (effective_traversal_type_ == Base::kDepthFirst) {
388 7163426 job->WakeParents();
389 }
390
2/2
✓ Branch 0 taken 14360096 times.
✓ Branch 1 taken 429 times.
 14360525 delete job;
391 14358575 }
392
393 7162074 void OnChildFinished(const int &a, CatalogJob *job) {
394 // atomic_xadd32 returns value before subtraction -> needs to equal 1
395
2/2
✓ Branch 1 taken 1324920 times.
✓ Branch 2 taken 5837739 times.
 7162074 if (atomic_xadd32(&job->children_unprocessed, -1) == 1) {
396 1324920 post_job_queue_.EnqueueFront(job);
397 }
398 7162659 }
399
400 unsigned int num_threads_;
401 bool serialize_callbacks_;
402
403 uint64_t effective_history_depth_;
404 time_t effective_timestamp_threshold_;
405 TraversalType effective_traversal_type_;
406
407 pthread_t *threads_process_;
408 atomic_int32 num_errors_;
409
410 Tube<CatalogJob> pre_job_queue_;
411 Tube<CatalogJob> post_job_queue_;
412 SmallHashDynamic<shash::Any, CatalogJob *> catalogs_processing_;
413 SmallHashDynamic<shash::Any, bool> catalogs_done_;
414 pthread_mutex_t catalogs_lock_;
415
416 pthread_mutex_t catalog_callback_lock_;
417 };
418
419 } // namespace swissknife
420
421 #endif // CVMFS_CATALOG_TRAVERSAL_PARALLEL_H_
422