GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/path_filters/relaxed_path_filter.cc
Date: 2026-03-22 02:40:38
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 3 RelaxedPathFilter *RelaxedPathFilter::Create(const std::string &dirtab_path) {
13
1/2
✓ Branch 2 taken 3 times.
✗ Branch 3 not taken.
 3 RelaxedPathFilter *dt = new RelaxedPathFilter();
14 3 dt->Open(dirtab_path);
15 3 return dt;
16 }
17
18
19 78 bool RelaxedPathFilter::IsMatching(const std::string &path) const {
20 78 bool has_positive_match = Dirtab::IsMatching(path);
21
2/2
✓ Branch 0 taken 48 times.
✓ Branch 1 taken 30 times.
 78 if (!has_positive_match) {
22
1/2
✓ Branch 1 taken 48 times.
✗ Branch 2 not taken.
 48 std::string current_path = path;
23
2/2
✓ Branch 1 taken 69 times.
✓ Branch 2 taken 18 times.
 87 while (current_path.length() > 0) {
24 69 const size_t new_length = current_path.find_last_of("/");
25
1/2
✓ Branch 1 taken 69 times.
✗ Branch 2 not taken.
 69 current_path = current_path.substr(0, new_length);
26
3/4
✓ Branch 1 taken 69 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 30 times.
✓ Branch 4 taken 39 times.
 69 if (exact_dirtab_.IsMatching(current_path)) {
27 30 has_positive_match = true;
28 30 break;
29 }
30 } // walk through sub paths
31 48 }
32
33
4/4
✓ Branch 0 taken 60 times.
✓ Branch 1 taken 18 times.
✓ Branch 3 taken 45 times.
✓ Branch 4 taken 15 times.
 78 return has_positive_match && !IsOpposing(path);
34 }
35
36
37 99 bool RelaxedPathFilter::IsOpposing(const std::string &path) const {
38
3/4
✓ Branch 1 taken 99 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 12 times.
✓ Branch 4 taken 87 times.
 99 if (Dirtab::IsOpposing(path))
39 12 return true;
40
41
1/2
✓ Branch 1 taken 87 times.
✗ Branch 2 not taken.
 87 std::string current_path = path;
42
2/2
✓ Branch 1 taken 192 times.
✓ Branch 2 taken 81 times.
 273 while (current_path.length() > 0) {
43 192 const size_t new_length = current_path.find_last_of("/");
44
1/2
✓ Branch 1 taken 192 times.
✗ Branch 2 not taken.
 192 current_path = current_path.substr(0, new_length);
45
3/4
✓ Branch 1 taken 192 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 6 times.
✓ Branch 4 taken 186 times.
 192 if (Dirtab::IsOpposing(current_path)) {
46 6 return true;
47 }
48 }
49
50 81 return false;
51 87 }
52
53
54 9 bool RelaxedPathFilter::Parse(const std::string &dirtab) {
55 9 return Dirtab::Parse(dirtab) & exact_dirtab_.Parse(dirtab);
56 }
57
58 3 bool RelaxedPathFilter::Parse(FILE *dirtab_file) {
59 3 bool result = Dirtab::Parse(dirtab_file);
60 3 rewind(dirtab_file);
61 3 result &= exact_dirtab_.Parse(dirtab_file);
62 3 return result;
63 }
64
65
66 33 bool RelaxedPathFilter::ParsePathspec(const std::string &pathspec_str,
67 bool negation) {
68
2/2
✓ Branch 0 taken 15 times.
✓ Branch 1 taken 18 times.
 33 if (negation) {
69
1/2
✓ Branch 1 taken 15 times.
✗ Branch 2 not taken.
 15 return Dirtab::ParsePathspec(pathspec_str, true);
70 }
71 18 bool success = true;
72
1/2
✓ Branch 1 taken 18 times.
✗ Branch 2 not taken.
 18 std::string current_pathspec_str(pathspec_str);
73
2/2
✓ Branch 1 taken 48 times.
✓ Branch 2 taken 18 times.
 66 while (current_pathspec_str.length() > 0) {
74
2/4
✓ Branch 1 taken 48 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 48 times.
 48 if (!Dirtab::ParsePathspec(current_pathspec_str, false))
75 ✗ success = false;
76 48 const size_t new_length = current_pathspec_str.find_last_of("/");
77
1/2
✓ Branch 1 taken 48 times.
✗ Branch 2 not taken.
 48 current_pathspec_str = current_pathspec_str.substr(0, new_length);
78 }
79
80 18 return success;
81 18 }
82