GCC Code Coverage Report

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