GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/catalog_traversal_parallel.h
Date: 2025-11-30 02:35:17
Exec Total Coverage
Lines: 186 199 93.5%
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 285 explicit CatalogTraversalParallel(const Parameters &params)
43 : CatalogTraversalBase<ObjectFetcherT>(params)
44 285 , num_threads_(params.num_threads)
45
4/8
✓ Branch 2 taken 285 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 285 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 285 times.
✗ Branch 9 not taken.
✓ Branch 11 taken 285 times.
✗ Branch 12 not taken.
 285 , serialize_callbacks_(params.serialize_callbacks) {
46 285 atomic_init32(&num_errors_);
47
1/2
✓ Branch 1 taken 285 times.
✗ Branch 2 not taken.
 285 shash::Any null_hash;
48 285 null_hash.SetNull();
49
1/2
✓ Branch 1 taken 285 times.
✗ Branch 2 not taken.
 285 catalogs_processing_.Init(1024, null_hash, hasher);
50
1/2
✓ Branch 1 taken 285 times.
✗ Branch 2 not taken.
 285 catalogs_done_.Init(1024, null_hash, hasher);
51 285 pthread_mutex_init(&catalog_callback_lock_, NULL);
52 285 pthread_mutex_init(&catalogs_lock_, NULL);
53 285 effective_history_depth_ = this->default_history_depth_;
54 285 effective_timestamp_threshold_ = this->default_timestamp_threshold_;
55 285 }
56
57 protected:
58 struct CatalogJob : public CatalogTraversal<ObjectFetcherT>::CatalogJob,
59 public Observable<int> {
60 1842285 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 1842285 history_depth, parent) {
67 1842285 atomic_init32(&children_unprocessed);
68 1842285 }
69
70
1/2
✓ Branch 1 taken 918400 times.
✗ Branch 2 not taken.
 918505 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 200 bool Traverse(const TraversalType type = Base::kBreadthFirst) {
86
1/2
✓ Branch 1 taken 200 times.
✗ Branch 2 not taken.
 200 const shash::Any root_catalog_hash = this->GetRepositoryRootCatalogHash();
87
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 200 times.
 200 if (root_catalog_hash.IsNull()) {
88 ✗ return false;
89 }
90
1/2
✓ Branch 1 taken 200 times.
✗ Branch 2 not taken.
 200 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 275 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 550 if (this->no_repeat_history_
104
4/6
✓ Branch 0 taken 165 times.
✓ Branch 1 taken 110 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 165 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 275 times.
 275 && catalogs_done_.Contains(root_catalog_hash)) {
105 ✗ return true;
106 }
107 275 effective_traversal_type_ = type;
108
3/6
✓ Branch 2 taken 275 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 275 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 275 times.
✗ Branch 9 not taken.
 275 CatalogJob *root_job = new CatalogJob("", root_catalog_hash, 0, 0);
109 275 PushJob(root_job);
110 275 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 245 bool TraverseList(const HashList &root_catalog_list,
119 const TraversalType type = Base::kBreadthFirst) {
120 // Push in reverse order for CatalogTraversal-like behavior
121 245 HashList::const_reverse_iterator i = root_catalog_list.rbegin();
122 245 const HashList::const_reverse_iterator iend = root_catalog_list.rend();
123 245 bool has_pushed = false;
124 {
125 245 MutexLockGuard m(&catalogs_lock_);
126
3/4
✓ Branch 2 taken 745 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 500 times.
✓ Branch 5 taken 245 times.
 745 for (; i != iend; ++i) {
127
7/8
✓ Branch 0 taken 455 times.
✓ Branch 1 taken 45 times.
✓ Branch 4 taken 455 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 170 times.
✓ Branch 7 taken 285 times.
✓ Branch 8 taken 170 times.
✓ Branch 9 taken 330 times.
 500 if (this->no_repeat_history_ && catalogs_done_.Contains(*i)) {
128 170 continue;
129 }
130
131
3/6
✓ Branch 2 taken 330 times.
✗ Branch 3 not taken.
✓ Branch 6 taken 330 times.
✗ Branch 7 not taken.
✓ Branch 9 taken 330 times.
✗ Branch 10 not taken.
 330 CatalogJob *root_job = new CatalogJob("", *i, 0, 0);
132
1/2
✓ Branch 1 taken 330 times.
✗ Branch 2 not taken.
 330 PushJobUnlocked(root_job);
133 330 has_pushed = true;
134 }
135 245 }
136 // noop: no catalogs to traverse
137
2/2
✓ Branch 0 taken 65 times.
✓ Branch 1 taken 180 times.
 245 if (!has_pushed) {
138 65 return true;
139 }
140 180 effective_traversal_type_ = type;
141 180 effective_history_depth_ = Parameters::kNoHistory;
142 180 effective_timestamp_threshold_ = Parameters::kNoTimestampThreshold;
143
1/2
✓ Branch 1 taken 180 times.
✗ Branch 2 not taken.
 180 bool result = DoTraverse();
144 180 effective_history_depth_ = this->default_history_depth_;
145 180 effective_timestamp_threshold_ = this->default_timestamp_threshold_;
146 180 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 10 bool TraverseRevision(const shash::Any &root_catalog_hash,
158 const TraversalType type = Base::kBreadthFirst) {
159 10 effective_history_depth_ = Parameters::kNoHistory;
160 10 effective_timestamp_threshold_ = Parameters::kNoTimestampThreshold;
161 10 bool result = Traverse(root_catalog_hash, type);
162 10 effective_history_depth_ = this->default_history_depth_;
163 10 effective_timestamp_threshold_ = this->default_timestamp_threshold_;
164 10 return result;
165 }
166
167 protected:
168 8451865 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 8451865 *(reinterpret_cast<const uint32_t *>(key.digest) + 1));
172 }
173
174 455 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 455 threads_process_ = reinterpret_cast<pthread_t *>(
178 455 smalloc(sizeof(pthread_t) * num_threads_));
179
2/2
✓ Branch 0 taken 525 times.
✓ Branch 1 taken 455 times.
 980 for (unsigned int i = 0; i < num_threads_; ++i) {
180 525 int retval = pthread_create(&threads_process_[i], NULL, MainProcessQueue,
181 this);
182
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 525 times.
 525 if (retval != 0)
183 ✗ PANIC(kLogStderr, "failed to create thread");
184 }
185
186
2/2
✓ Branch 0 taken 525 times.
✓ Branch 1 taken 455 times.
 980 for (unsigned int i = 0; i < num_threads_; ++i) {
187 525 int retval = pthread_join(threads_process_[i], NULL);
188
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 525 times.
 525 assert(retval == 0);
189 }
190 455 free(threads_process_);
191
192
2/2
✓ Branch 1 taken 5 times.
✓ Branch 2 taken 450 times.
 455 if (atomic_read32(&num_errors_))
193 5 return false;
194
195
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 450 times.
 450 assert(catalogs_processing_.size() == 0);
196
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 450 times.
 450 assert(pre_job_queue_.IsEmpty());
197
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 450 times.
 450 assert(post_job_queue_.IsEmpty());
198 450 return true;
199 }
200
201 525 static void *MainProcessQueue(void *data) {
202 525 CatalogTraversalParallel<ObjectFetcherT> *traversal = reinterpret_cast<
203 CatalogTraversalParallel<ObjectFetcherT> *>(data);
204 CatalogJob *current_job;
205 while (true) {
206 2011390 current_job = traversal->post_job_queue_.TryPopFront();
207
2/2
✓ Branch 0 taken 169910 times.
✓ Branch 1 taken 1842135 times.
 2012045 if (current_job != NULL) {
208 169910 traversal->ProcessJobPost(current_job);
209 } else {
210 1842135 current_job = traversal->pre_job_queue_.PopFront();
211 // NULL means the master thread tells us to finish
212
2/2
✓ Branch 1 taken 525 times.
✓ Branch 2 taken 1841735 times.
 1842280 if (current_job->hash.IsNull()) {
213
1/2
✓ Branch 0 taken 525 times.
✗ Branch 1 not taken.
 525 delete current_job;
214 520 break;
215 }
216 1841735 traversal->ProcessJobPre(current_job);
217 }
218 }
219 520 return NULL;
220 }
221
222 455 void NotifyFinished() {
223
1/2
✓ Branch 1 taken 455 times.
✗ Branch 2 not taken.
 455 shash::Any null_hash;
224 455 null_hash.SetNull();
225
2/2
✓ Branch 0 taken 525 times.
✓ Branch 1 taken 455 times.
 980 for (unsigned i = 0; i < num_threads_; ++i) {
226
3/6
✓ Branch 2 taken 525 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 525 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 525 times.
✗ Branch 9 not taken.
 525 CatalogJob *job = new CatalogJob("", null_hash, 0, 0);
227
1/2
✓ Branch 1 taken 525 times.
✗ Branch 2 not taken.
 525 pre_job_queue_.EnqueueFront(job);
228 }
229 455 }
230
231 275 void PushJob(CatalogJob *job) {
232 275 MutexLockGuard m(&catalogs_lock_);
233
1/2
✓ Branch 1 taken 275 times.
✗ Branch 2 not taken.
 275 PushJobUnlocked(job);
234 275 }
235
236 1841760 void PushJobUnlocked(CatalogJob *job) {
237 1841760 catalogs_processing_.Insert(job->hash, job);
238 1841760 pre_job_queue_.EnqueueFront(job);
239 1841760 }
240
241 1841695 void ProcessJobPre(CatalogJob *job) {
242
4/6
✓ Branch 0 taken 1841695 times.
✗ Branch 1 not taken.
✓ Branch 3 taken 1841490 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 5 times.
✓ Branch 6 taken 1841485 times.
 1841695 if (!this->PrepareCatalog(job)) {
243 5 atomic_inc32(&num_errors_);
244
1/2
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
 5 NotifyFinished();
245 1671285 return;
246 }
247
2/2
✓ Branch 0 taken 30 times.
✓ Branch 1 taken 1841455 times.
 1841485 if (job->ignore) {
248
1/2
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
 30 FinalizeJob(job);
249 30 return;
250 }
251
1/2
✓ Branch 1 taken 1837845 times.
✗ Branch 2 not taken.
 1841455 NestedCatalogList 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 1837845 MutexLockGuard m(&catalogs_lock_);
257
2/2
✓ Branch 0 taken 923210 times.
✓ Branch 1 taken 918510 times.
 1841720 if (effective_traversal_type_ == Base::kBreadthFirst) {
258
1/2
✓ Branch 1 taken 923210 times.
✗ Branch 2 not taken.
 923210 num_children = PushPreviousRevision(job)
259
1/2
✓ Branch 1 taken 923210 times.
✗ Branch 2 not taken.
 923210 + PushNestedCatalogs(job, catalog_list);
260 } else {
261
1/2
✓ Branch 1 taken 918510 times.
✗ Branch 2 not taken.
 918510 num_children = PushNestedCatalogs(job, catalog_list)
262
1/2
✓ Branch 1 taken 918510 times.
✗ Branch 2 not taken.
 918510 + PushPreviousRevision(job);
263 918510 atomic_write32(&job->children_unprocessed, num_children);
264 }
265
3/6
✓ Branch 0 taken 1841720 times.
✗ Branch 1 not taken.
✓ Branch 3 taken 1841720 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 1841720 times.
 1841720 if (!this->CloseCatalog(false, job)) {
266 ✗ atomic_inc32(&num_errors_);
267 ✗ NotifyFinished();
268 }
269 1841720 }
270
271 // breadth-first: can post-process immediately
272 // depth-first: no children -> can post-process immediately
273
4/4
✓ Branch 0 taken 918475 times.
✓ Branch 1 taken 923225 times.
✓ Branch 2 taken 748565 times.
✓ Branch 3 taken 169910 times.
 1841700 if (effective_traversal_type_ == Base::kBreadthFirst || num_children == 0) {
274
1/2
✓ Branch 1 taken 1671265 times.
✗ Branch 2 not taken.
 1671790 ProcessJobPost(job);
275 1671265 return;
276 }
277
2/2
✓ Branch 1 taken 169910 times.
✓ Branch 2 taken 1671250 times.
 1841175 }
278
279 1841720 unsigned int PushNestedCatalogs(CatalogJob *job,
280 const NestedCatalogList &catalog_list) {
281 1841720 typename NestedCatalogList::const_iterator i = catalog_list.begin();
282 1841720 typename NestedCatalogList::const_iterator iend = catalog_list.end();
283 1841720 unsigned int num_children = 0;
284
2/2
✓ Branch 2 taken 1841145 times.
✓ Branch 3 taken 1841720 times.
 3682865 for (; i != iend; ++i) {
285
7/8
✓ Branch 0 taken 3185 times.
✓ Branch 1 taken 1837960 times.
✓ Branch 4 taken 3185 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 335 times.
✓ Branch 7 taken 2850 times.
✓ Branch 8 taken 335 times.
✓ Branch 9 taken 1840810 times.
 1841145 if (this->no_repeat_history_ && catalogs_done_.Contains(i->hash)) {
286 335 continue;
287 }
288
289 CatalogJob *child;
290 3681620 if (!this->no_repeat_history_
291
7/8
✓ Branch 0 taken 2850 times.
✓ Branch 1 taken 1837960 times.
✓ Branch 4 taken 2850 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 2810 times.
✓ Branch 7 taken 40 times.
✓ Branch 8 taken 1840770 times.
✓ Branch 9 taken 40 times.
 1840810 || !catalogs_processing_.Lookup(i->hash, &child)) {
292
2/2
✓ Branch 0 taken 1833185 times.
✓ Branch 1 taken 7585 times.
 1840770 CatalogTN *parent = (this->no_close_) ? job->catalog : NULL;
293
1/2
✓ Branch 2 taken 1840770 times.
✗ Branch 3 not taken.
 3681540 child = new CatalogJob(i->mountpoint.ToString(),
294
1/2
✓ Branch 2 taken 1840770 times.
✗ Branch 3 not taken.
 1840770 i->hash,
295 1840770 job->tree_level + 1,
296
1/2
✓ Branch 1 taken 1840770 times.
✗ Branch 2 not taken.
 1840770 job->history_depth,
297 parent);
298
1/2
✓ Branch 1 taken 1840770 times.
✗ Branch 2 not taken.
 1840770 PushJobUnlocked(child);
299 }
300
301
2/2
✓ Branch 0 taken 918300 times.
✓ Branch 1 taken 922510 times.
 1840810 if (effective_traversal_type_ == Base::kDepthFirst) {
302
1/2
✓ Branch 1 taken 918300 times.
✗ Branch 2 not taken.
 918300 child->RegisterListener(&CatalogTraversalParallel::OnChildFinished,
303 this, job);
304 }
305 1840810 ++num_children;
306 }
307 1841720 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 1841720 unsigned int PushPreviousRevision(CatalogJob *job) {
315 // only root catalogs are used for entering a previous revision (graph)
316
2/2
✓ Branch 1 taken 1840755 times.
✓ Branch 2 taken 965 times.
 1841720 if (!job->catalog->IsRoot()) {
317 1840755 return 0;
318 }
319
320
1/2
✓ Branch 1 taken 965 times.
✗ Branch 2 not taken.
 965 const shash::Any previous_revision = job->catalog->GetPreviousRevision();
321
2/2
✓ Branch 1 taken 95 times.
✓ Branch 2 taken 870 times.
 965 if (previous_revision.IsNull()) {
322 95 return 0;
323 }
324
325 // check if the next deeper history level is actually requested
326
3/4
✓ Branch 1 taken 870 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 485 times.
✓ Branch 4 taken 385 times.
 870 if (this->IsBelowPruningThresholds(*job, effective_history_depth_,
327 effective_timestamp_threshold_)) {
328 485 return 0;
329 }
330
331 770 if (this->no_repeat_history_
332
5/8
✓ Branch 0 taken 245 times.
✓ Branch 1 taken 140 times.
✓ Branch 3 taken 245 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 245 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 385 times.
 385 && catalogs_done_.Contains(previous_revision)) {
333 ✗ return 0;
334 }
335
336 CatalogJob *prev_job;
337 770 if (!this->no_repeat_history_
338
5/8
✓ Branch 0 taken 245 times.
✓ Branch 1 taken 140 times.
✓ Branch 3 taken 245 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 245 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 385 times.
✗ Branch 8 not taken.
 385 || !catalogs_processing_.Lookup(previous_revision, &prev_job)) {
339
2/4
✓ Branch 2 taken 385 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 385 times.
✗ Branch 6 not taken.
 770 prev_job = new CatalogJob("", previous_revision, 0,
340
1/2
✓ Branch 1 taken 385 times.
✗ Branch 2 not taken.
 385 job->history_depth + 1);
341
1/2
✓ Branch 1 taken 385 times.
✗ Branch 2 not taken.
 385 PushJobUnlocked(prev_job);
342 }
343
344
2/2
✓ Branch 0 taken 75 times.
✓ Branch 1 taken 310 times.
 385 if (effective_traversal_type_ == Base::kDepthFirst) {
345
1/2
✓ Branch 1 taken 75 times.
✗ Branch 2 not taken.
 75 prev_job->RegisterListener(&CatalogTraversalParallel::OnChildFinished,
346 this, job);
347 }
348 385 return 1;
349 }
350
351 1841480 void ProcessJobPost(CatalogJob *job) {
352 // Save time by keeping catalog open when suitable
353
2/2
✓ Branch 0 taken 1841475 times.
✓ Branch 1 taken 5 times.
 1841480 if (job->catalog == NULL) {
354
2/4
✓ Branch 0 taken 1841475 times.
✗ Branch 1 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 1837665 times.
 1841475 if (!this->ReopenCatalog(job)) {
355 ✗ atomic_inc32(&num_errors_);
356 ✗ NotifyFinished();
357 ✗ return;
358 }
359 }
360
1/2
✓ Branch 0 taken 1837670 times.
✗ Branch 1 not taken.
 1837670 if (serialize_callbacks_) {
361 1837670 MutexLockGuard m(&catalog_callback_lock_);
362
2/4
✓ Branch 1 taken 1841720 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 1841720 times.
✗ Branch 5 not taken.
 1841720 this->NotifyListeners(job->GetCallbackData());
363 1841720 } else {
364 ✗ this->NotifyListeners(job->GetCallbackData());
365 }
366
2/2
✓ Branch 0 taken 8510 times.
✓ Branch 1 taken 1833210 times.
 1841720 if (!this->no_close_) {
367
2/4
✓ Branch 0 taken 8510 times.
✗ Branch 1 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 8510 times.
 8510 if (!this->CloseCatalog(true, job)) {
368 ✗ atomic_inc32(&num_errors_);
369 ✗ NotifyFinished();
370 ✗ return;
371 }
372 }
373 1841720 FinalizeJob(job);
374 }
375
376 1841725 void FinalizeJob(CatalogJob *job) {
377 {
378 1841725 MutexLockGuard m(&catalogs_lock_);
379
1/2
✓ Branch 1 taken 1841750 times.
✗ Branch 2 not taken.
 1841750 catalogs_processing_.Erase(job->hash);
380
1/2
✓ Branch 1 taken 1841750 times.
✗ Branch 2 not taken.
 1841750 catalogs_done_.Insert(job->hash, true);
381 // No more catalogs to process -> finish
382
1/2
✓ Branch 2 taken 450 times.
✗ Branch 3 not taken.
 1842200 if (catalogs_processing_.size() == 0 && pre_job_queue_.IsEmpty()
383
5/6
✓ Branch 0 taken 450 times.
✓ Branch 1 taken 1841300 times.
✓ Branch 3 taken 450 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 450 times.
✓ Branch 6 taken 1841300 times.
 1842200 && post_job_queue_.IsEmpty()) {
384
1/2
✓ Branch 1 taken 450 times.
✗ Branch 2 not taken.
 450 NotifyFinished();
385 }
386 1841750 }
387
2/2
✓ Branch 0 taken 918505 times.
✓ Branch 1 taken 923240 times.
 1841745 if (effective_traversal_type_ == Base::kDepthFirst) {
388 918505 job->WakeParents();
389 }
390
2/2
✓ Branch 0 taken 1841590 times.
✓ Branch 1 taken 50 times.
 1841640 delete job;
391 1841170 }
392
393 918245 void OnChildFinished(const int &a, CatalogJob *job) {
394 // atomic_xadd32 returns value before subtraction -> needs to equal 1
395
2/2
✓ Branch 1 taken 169910 times.
✓ Branch 2 taken 748435 times.
 918245 if (atomic_xadd32(&job->children_unprocessed, -1) == 1) {
396 169910 post_job_queue_.EnqueueFront(job);
397 }
398 918345 }
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