GCC Code Coverage Report

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