GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/path_filters/dirtab.cc
Date: 2025-07-06 02:35:01
Exec Total Coverage
Lines: 87 95 91.6%
Branches: 68 92 73.9%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5 #include "dirtab.h"
6
7 #include <cassert>
8 #include <cerrno>
9 #include <cstdio>
10 #include <cstdlib>
11
12 #include "util/logging.h"
13 #include "util/posix.h"
14 #include "util/string.h"
15
16 namespace catalog {
17
18 600 Dirtab::Dirtab() : valid_(true) { }
19
20
21 25 bool Dirtab::Open(const std::string &dirtab_path) {
22
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 25 times.
 25 if (!FileExists(dirtab_path)) {
23 ✗ LogCvmfs(kLogCatalog, kLogStderr, "Cannot find dirtab at '%s'",
24 dirtab_path.c_str());
25 ✗ valid_ = false;
26 ✗ return valid_;
27 }
28
29 25 FILE *dirtab_file = fopen(dirtab_path.c_str(), "r");
30
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25 times.
 25 if (dirtab_file == NULL) {
31 ✗ LogCvmfs(kLogCatalog, kLogStderr,
32 "Cannot open dirtab for reading at '%s' "
33 "(errno: %d)",
34 ✗ dirtab_path.c_str(), errno);
35 ✗ valid_ = false;
36 ✗ return valid_;
37 }
38
39 25 valid_ = Parse(dirtab_file);
40 25 fclose(dirtab_file);
41 25 return valid_;
42 }
43
44 500 bool Dirtab::Parse(const std::string &dirtab) {
45 500 valid_ = true;
46 500 off_t line_offset = 0;
47
2/2
✓ Branch 1 taken 2350 times.
✓ Branch 2 taken 500 times.
 2850 while (line_offset < static_cast<off_t>(dirtab.size())) {
48 4700 const std::string line = GetLineMem(dirtab.c_str() + line_offset,
49
1/2
✓ Branch 3 taken 2350 times.
✗ Branch 4 not taken.
 2350 dirtab.size() - line_offset);
50 2350 line_offset += line.size() + 1; // +1 == skipped \n
51
3/4
✓ Branch 1 taken 2350 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 50 times.
✓ Branch 4 taken 2300 times.
 2350 if (!ParseLine(line)) {
52 50 valid_ = false;
53 }
54 2350 }
55
4/4
✓ Branch 0 taken 450 times.
✓ Branch 1 taken 50 times.
✓ Branch 3 taken 425 times.
✓ Branch 4 taken 25 times.
 500 valid_ = valid_ && CheckRuleValidity();
56 500 return valid_;
57 }
58
59
60 50 bool Dirtab::Parse(FILE *dirtab_file) {
61 50 valid_ = true;
62 50 std::string line;
63
3/4
✓ Branch 1 taken 100 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 50 times.
✓ Branch 4 taken 50 times.
 100 while (GetLineFile(dirtab_file, &line)) {
64
2/4
✓ Branch 1 taken 50 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 50 times.
 50 if (!ParseLine(line)) {
65 ✗ valid_ = false;
66 }
67 }
68
3/6
✓ Branch 0 taken 50 times.
✗ Branch 1 not taken.
✓ Branch 3 taken 50 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 50 times.
✗ Branch 6 not taken.
 50 valid_ = valid_ && CheckRuleValidity();
69 50 return valid_;
70 50 }
71
72
73 2400 bool Dirtab::ParseLine(const std::string &line) {
74 // line parsing is done using std::string iterators. Each parsing method ex-
75 // pects an iterator and the end iterator. While parsing itr is constantly
76 // incremented to walk through the given .cvmfsdirtab line.
77 2400 std::string::const_iterator itr = line.begin();
78 2400 const std::string::const_iterator iend = line.end();
79 2400 bool negation = false;
80
81 // parse preamble
82 2400 SkipWhitespace(iend, &itr);
83
2/2
✓ Branch 1 taken 725 times.
✓ Branch 2 taken 1675 times.
 2400 if (*itr == Dirtab::kCommentMarker) {
84 725 return true;
85
2/2
✓ Branch 1 taken 700 times.
✓ Branch 2 taken 975 times.
 1675 } else if (*itr == Dirtab::kNegationMarker) {
86 700 negation = true;
87 700 ++itr;
88 700 SkipWhitespace(iend, &itr);
89 }
90
91 // extract and parse pathspec
92
2/4
✓ Branch 2 taken 1675 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 1675 times.
✗ Branch 6 not taken.
 3350 const std::string pathspec_str(Trim(std::string(itr, iend)));
93
1/2
✓ Branch 1 taken 1675 times.
✗ Branch 2 not taken.
 1675 return this->ParsePathspec(pathspec_str, negation);
94 1675 }
95
96 1925 bool Dirtab::ParsePathspec(const std::string &pathspec_str, bool negation) {
97
2/2
✓ Branch 1 taken 250 times.
✓ Branch 2 taken 1675 times.
 1925 if (pathspec_str.empty()) {
98 250 return true;
99 }
100
1/2
✓ Branch 1 taken 1675 times.
✗ Branch 2 not taken.
 1675 const Pathspec pathspec(pathspec_str);
101
102 // all generated Pathspecs need to be valid and positive rules must be
103 // absolute. Otherwise the .cvmfsdirtab is not valid.
104
8/8
✓ Branch 1 taken 1650 times.
✓ Branch 2 taken 25 times.
✓ Branch 3 taken 975 times.
✓ Branch 4 taken 675 times.
✓ Branch 6 taken 25 times.
✓ Branch 7 taken 950 times.
✓ Branch 8 taken 50 times.
✓ Branch 9 taken 1625 times.
 1675 if (!pathspec.IsValid() || (!negation && !pathspec.IsAbsolute())) {
105 50 return false;
106 }
107
108 // create a new dirtab rule
109
1/2
✓ Branch 1 taken 1625 times.
✗ Branch 2 not taken.
 1625 const Rule rule(pathspec, negation);
110
1/2
✓ Branch 1 taken 1625 times.
✗ Branch 2 not taken.
 1625 AddRule(rule);
111 1625 return true;
112 1675 }
113
114
115 1625 void Dirtab::AddRule(const Rule &rule) {
116
2/2
✓ Branch 0 taken 675 times.
✓ Branch 1 taken 950 times.
 1625 if (rule.is_negation) {
117 675 negative_rules_.push_back(rule);
118 } else {
119 950 positive_rules_.push_back(rule);
120 }
121 1625 }
122
123
124 500 bool Dirtab::CheckRuleValidity() const {
125 // check if there are contradicting positive and negative rules
126 500 Rules::const_iterator p = positive_rules_.begin();
127 500 const Rules::const_iterator pend = positive_rules_.end();
128
2/2
✓ Branch 2 taken 925 times.
✓ Branch 3 taken 475 times.
 1400 for (; p != pend; ++p) {
129
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 925 times.
 925 assert(!p->is_negation);
130 925 Rules::const_iterator n = negative_rules_.begin();
131 925 const Rules::const_iterator nend = negative_rules_.end();
132
2/2
✓ Branch 2 taken 1375 times.
✓ Branch 3 taken 900 times.
 2275 for (; n != nend; ++n) {
133
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 1375 times.
 1375 assert(n->is_negation);
134
3/4
✓ Branch 3 taken 1375 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 25 times.
✓ Branch 6 taken 1350 times.
 1375 if (p->pathspec == n->pathspec) {
135 25 return false;
136 }
137 }
138 }
139
140 475 return true;
141 }
142
143
144 2075 bool Dirtab::IsMatching(const std::string &path) const {
145 // check if path has a positive match
146 2075 bool has_positive_match = false;
147 2075 Rules::const_iterator p = positive_rules_.begin();
148 2075 const Rules::const_iterator pend = positive_rules_.end();
149
2/2
✓ Branch 2 taken 4350 times.
✓ Branch 3 taken 1000 times.
 5350 for (; p != pend; ++p) {
150
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 4350 times.
 4350 assert(!p->is_negation);
151
3/4
✓ Branch 2 taken 4350 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 1075 times.
✓ Branch 5 taken 3275 times.
 4350 if (p->pathspec.IsMatching(path)) {
152 1075 has_positive_match = true;
153 1075 break;
154 }
155 }
156
157
5/6
✓ Branch 0 taken 1075 times.
✓ Branch 1 taken 1000 times.
✓ Branch 3 taken 1075 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 900 times.
✓ Branch 6 taken 175 times.
 2075 return has_positive_match && !IsOpposing(path);
158 }
159
160
161 3975 bool Dirtab::IsOpposing(const std::string &path) const {
162 3975 Rules::const_iterator n = negative_rules_.begin();
163 3975 const Rules::const_iterator nend = negative_rules_.end();
164
2/2
✓ Branch 2 taken 6600 times.
✓ Branch 3 taken 3275 times.
 9875 for (; n != nend; ++n) {
165
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 6600 times.
 6600 assert(n->is_negation);
166
3/4
✓ Branch 2 taken 6600 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 700 times.
✓ Branch 5 taken 5900 times.
 6600 if (n->pathspec.IsMatchingRelaxed(path)) {
167 700 return true;
168 }
169 }
170
171 3275 return false;
172 }
173
174 } // namespace catalog
175