GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/path_filters/relaxed_path_filter.cc
Date: 2026-11-08 02:41:18
Exec Total Coverage
Lines: 45 46 97.8%
Branches: 33 46 71.7%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5 #include "path_filters/relaxed_path_filter.h"
6
7 #include <cstdio>
8 #include <string>
9
10 using namespace catalog; // NOLINT
11
12 13 RelaxedPathFilter *RelaxedPathFilter::Create(const std::string &dirtab_path) {
13
1/2
✓ Branch 2 taken 13 times.
✗ Branch 3 not taken.
 13 RelaxedPathFilter *dt = new RelaxedPathFilter();
14 13 dt->Open(dirtab_path);
15 13 return dt;
16 }
17
18
19 3105 bool RelaxedPathFilter::IsMatching(const std::string &path) const {
20 3105 bool has_positive_match = Dirtab::IsMatching(path);
21
2/2
✓ Branch 0 taken 1725 times.
✓ Branch 1 taken 1380 times.
 3105 if (!has_positive_match) {
22
1/2
✓ Branch 1 taken 1725 times.
✗ Branch 2 not taken.
 1725 std::string current_path = path;
23
2/2
✓ Branch 1 taken 2867 times.
✓ Branch 2 taken 1044 times.
 3911 while (current_path.length() > 0) {
24 2867 const size_t new_length = current_path.find_last_of("/");
25
1/2
✓ Branch 1 taken 2867 times.
✗ Branch 2 not taken.
 2867 current_path = current_path.substr(0, new_length);
26
3/4
✓ Branch 1 taken 2867 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 681 times.
✓ Branch 4 taken 2186 times.
 2867 if (exact_dirtab_.IsMatching(current_path)) {
27 681 has_positive_match = true;
28 681 break;
29 }
30 } // walk through sub paths
31 1725 }
32
33
4/4
✓ Branch 0 taken 2061 times.
✓ Branch 1 taken 1044 times.
✓ Branch 3 taken 1818 times.
✓ Branch 4 taken 243 times.
 3105 return has_positive_match && !IsOpposing(path);
34 }
35
36
37 3480 bool RelaxedPathFilter::IsOpposing(const std::string &path) const {
38
3/4
✓ Branch 1 taken 3480 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 213 times.
✓ Branch 4 taken 3267 times.
 3480 if (Dirtab::IsOpposing(path))
39 213 return true;
40
41
1/2
✓ Branch 1 taken 3267 times.
✗ Branch 2 not taken.
 3267 std::string current_path = path;
42
2/2
✓ Branch 1 taken 7257 times.
✓ Branch 2 taken 3224 times.
 10481 while (current_path.length() > 0) {
43 7257 const size_t new_length = current_path.find_last_of("/");
44
1/2
✓ Branch 1 taken 7257 times.
✗ Branch 2 not taken.
 7257 current_path = current_path.substr(0, new_length);
45
3/4
✓ Branch 1 taken 7257 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 43 times.
✓ Branch 4 taken 7214 times.
 7257 if (Dirtab::IsOpposing(current_path)) {
46 43 return true;
47 }
48 }
49
50 3224 return false;
51 3267 }
52
53
54 300 bool RelaxedPathFilter::Parse(const std::string &dirtab) {
55 300 return Dirtab::Parse(dirtab) & exact_dirtab_.Parse(dirtab);
56 }
57
58 13 bool RelaxedPathFilter::Parse(FILE *dirtab_file) {
59 13 bool result = Dirtab::Parse(dirtab_file);
60 13 rewind(dirtab_file);
61 13 result &= exact_dirtab_.Parse(dirtab_file);
62 13 return result;
63 }
64
65
66 718 bool RelaxedPathFilter::ParsePathspec(const std::string &pathspec_str,
67 bool negation) {
68
2/2
✓ Branch 0 taken 118 times.
✓ Branch 1 taken 600 times.
 718 if (negation) {
69
1/2
✓ Branch 1 taken 118 times.
✗ Branch 2 not taken.
 118 return Dirtab::ParsePathspec(pathspec_str, true);
70 }
71 600 bool success = true;
72
1/2
✓ Branch 1 taken 600 times.
✗ Branch 2 not taken.
 600 std::string current_pathspec_str(pathspec_str);
73
2/2
✓ Branch 1 taken 849 times.
✓ Branch 2 taken 600 times.
 1449 while (current_pathspec_str.length() > 0) {
74
2/4
✓ Branch 1 taken 849 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 849 times.
 849 if (!Dirtab::ParsePathspec(current_pathspec_str, false))
75 ✗ success = false;
76 849 const size_t new_length = current_pathspec_str.find_last_of("/");
77
1/2
✓ Branch 1 taken 849 times.
✗ Branch 2 not taken.
 849 current_pathspec_str = current_pathspec_str.substr(0, new_length);
78 }
79
80 600 return success;
81 600 }
82