Coverage Report

Created: 2020-02-18 08:44

/Users/buildslave/jenkins/workspace/coverage/llvm-project/clang/lib/Tooling/FileMatchTrie.cpp
Line
Count
Source (jump to first uncovered line)
1
//===- FileMatchTrie.cpp --------------------------------------------------===//
2
//
3
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4
// See https://llvm.org/LICENSE.txt for license information.
5
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6
//
7
//===----------------------------------------------------------------------===//
8
//
9
//  This file contains the implementation of a FileMatchTrie.
10
//
11
//===----------------------------------------------------------------------===//
12
13
#include "clang/Tooling/FileMatchTrie.h"
14
#include "llvm/ADT/StringMap.h"
15
#include "llvm/ADT/StringRef.h"
16
#include "llvm/Support/FileSystem.h"
17
#include "llvm/Support/Path.h"
18
#include "llvm/Support/raw_ostream.h"
19
#include <string>
20
#include <vector>
21
22
using namespace clang;
23
using namespace tooling;
24
25
namespace {
26
27
/// Default \c PathComparator using \c llvm::sys::fs::equivalent().
28
struct DefaultPathComparator : public PathComparator {
29
44
  bool equivalent(StringRef FileA, StringRef FileB) const override {
30
44
    return FileA == FileB || 
llvm::sys::fs::equivalent(FileA, FileB)2
;
31
44
  }
32
};
33
34
} // namespace
35
36
namespace clang {
37
namespace tooling {
38
39
/// A node of the \c FileMatchTrie.
40
///
41
/// Each node has storage for up to one path and a map mapping a path segment to
42
/// child nodes. The trie starts with an empty root node.
43
class FileMatchTrieNode {
44
public:
45
  /// Inserts 'NewPath' into this trie. \c ConsumedLength denotes
46
  /// the number of \c NewPath's trailing characters already consumed during
47
  /// recursion.
48
  ///
49
  /// An insert of a path
50
  /// 'p'starts at the root node and does the following:
51
  /// - If the node is empty, insert 'p' into its storage and abort.
52
  /// - If the node has a path 'p2' but no children, take the last path segment
53
  ///   's' of 'p2', put a new child into the map at 's' an insert the rest of
54
  ///   'p2' there.
55
  /// - Insert a new child for the last segment of 'p' and insert the rest of
56
  ///   'p' there.
57
  ///
58
  /// An insert operation is linear in the number of a path's segments.
59
29.0k
  void insert(StringRef NewPath, unsigned ConsumedLength = 0) {
60
29.0k
    // We cannot put relative paths into the FileMatchTrie as then a path can be
61
29.0k
    // a postfix of another path, violating a core assumption of the trie.
62
29.0k
    if (llvm::sys::path::is_relative(NewPath))
63
4
      return;
64
29.0k
    if (Path.empty()) {
65
14.0k
      // This is an empty leaf. Store NewPath and return.
66
14.0k
      Path = std::string(NewPath);
67
14.0k
      return;
68
14.0k
    }
69
15.0k
    if (Children.empty()) {
70
721
      // This is a leaf, ignore duplicate entry if 'Path' equals 'NewPath'.
71
721
      if (NewPath == Path)
72
188
          return;
73
533
      // Make this a node and create a child-leaf with 'Path'.
74
533
      StringRef Element(llvm::sys::path::filename(
75
533
          StringRef(Path).drop_back(ConsumedLength)));
76
533
      Children[Element].Path = Path;
77
533
    }
78
15.0k
    StringRef Element(llvm::sys::path::filename(
79
14.8k
          StringRef(NewPath).drop_back(ConsumedLength)));
80
14.8k
    Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1);
81
14.8k
  }
82
83
  /// Tries to find the node under this \c FileMatchTrieNode that best
84
  /// matches 'FileName'.
85
  ///
86
  /// If multiple paths fit 'FileName' equally well, \c IsAmbiguous is set to
87
  /// \c true and an empty string is returned. If no path fits 'FileName', an
88
  /// empty string is returned. \c ConsumedLength denotes the number of
89
  /// \c Filename's trailing characters already consumed during recursion.
90
  ///
91
  /// To find the best matching node for a given path 'p', the
92
  /// \c findEquivalent() function is called recursively for each path segment
93
  /// (back to front) of 'p' until a node 'n' is reached that does not ..
94
  /// - .. have children. In this case it is checked
95
  ///   whether the stored path is equivalent to 'p'. If yes, the best match is
96
  ///   found. Otherwise continue with the parent node as if this node did not
97
  ///   exist.
98
  /// - .. a child matching the next path segment. In this case, all children of
99
  ///   'n' are an equally good match for 'p'. All children are of 'n' are found
100
  ///   recursively and their equivalence to 'p' is determined. If none are
101
  ///   equivalent, continue with the parent node as if 'n' didn't exist. If one
102
  ///   is equivalent, the best match is found. Otherwise, report and ambigiuity
103
  ///   error.
104
  StringRef findEquivalent(const PathComparator& Comparator,
105
                           StringRef FileName,
106
                           bool &IsAmbiguous,
107
61
                           unsigned ConsumedLength = 0) const {
108
61
    if (Children.empty()) {
109
51
      if (Comparator.equivalent(StringRef(Path), FileName))
110
48
        return StringRef(Path);
111
3
      return {};
112
3
    }
113
10
    StringRef Element(llvm::sys::path::filename(FileName.drop_back(
114
10
        ConsumedLength)));
115
10
    llvm::StringMap<FileMatchTrieNode>::const_iterator MatchingChild =
116
10
        Children.find(Element);
117
10
    if (MatchingChild != Children.end()) {
118
9
      StringRef Result = MatchingChild->getValue().findEquivalent(
119
9
          Comparator, FileName, IsAmbiguous,
120
9
          ConsumedLength + Element.size() + 1);
121
9
      if (!Result.empty() || 
IsAmbiguous2
)
122
8
        return Result;
123
2
    }
124
2
    std::vector<StringRef> AllChildren;
125
2
    getAll(AllChildren, MatchingChild);
126
2
    StringRef Result;
127
3
    for (const auto &Child : AllChildren) {
128
3
      if (Comparator.equivalent(Child, FileName)) {
129
2
        if (Result.empty()) {
130
1
          Result = Child;
131
1
        } else {
132
1
          IsAmbiguous = true;
133
1
          return {};
134
1
        }
135
2
      }
136
3
    }
137
2
    
return Result1
;
138
2
  }
139
140
private:
141
  /// Gets all paths under this FileMatchTrieNode.
142
  void getAll(std::vector<StringRef> &Results,
143
5
              llvm::StringMap<FileMatchTrieNode>::const_iterator Except) const {
144
5
    if (Path.empty())
145
0
      return;
146
5
    if (Children.empty()) {
147
3
      Results.push_back(StringRef(Path));
148
3
      return;
149
3
    }
150
2
    for (llvm::StringMap<FileMatchTrieNode>::const_iterator
151
2
         It = Children.begin(), E = Children.end();
152
6
         It != E; 
++It4
) {
153
4
      if (It == Except)
154
1
        continue;
155
3
      It->getValue().getAll(Results, Children.end());
156
3
    }
157
2
  }
158
159
  // The stored absolute path in this node. Only valid for leaf nodes, i.e.
160
  // nodes where Children.empty().
161
  std::string Path;
162
163
  // The children of this node stored in a map based on the next path segment.
164
  llvm::StringMap<FileMatchTrieNode> Children;
165
};
166
167
} // namespace tooling
168
} // namespace clang
169
170
FileMatchTrie::FileMatchTrie()
171
97
    : Root(new FileMatchTrieNode), Comparator(new DefaultPathComparator()) {}
172
173
FileMatchTrie::FileMatchTrie(PathComparator *Comparator)
174
10
    : Root(new FileMatchTrieNode), Comparator(Comparator) {}
175
176
107
FileMatchTrie::~FileMatchTrie() {
177
107
  delete Root;
178
107
}
179
180
14.2k
void FileMatchTrie::insert(StringRef NewPath) {
181
14.2k
  Root->insert(NewPath);
182
14.2k
}
183
184
StringRef FileMatchTrie::findEquivalent(StringRef FileName,
185
55
                                        raw_ostream &Error) const {
186
55
  if (llvm::sys::path::is_relative(FileName)) {
187
3
    Error << "Cannot resolve relative paths";
188
3
    return {};
189
3
  }
190
52
  bool IsAmbiguous = false;
191
52
  StringRef Result = Root->findEquivalent(*Comparator, FileName, IsAmbiguous);
192
52
  if (IsAmbiguous)
193
1
    Error << "Path is ambiguous";
194
52
  return Result;
195
52
}