blob: 631fddf5edc6dc3ad1f2f33210e6e73adac9cab6 [file] [log] [blame]
Sam McCall3f0243f2018-07-03 08:09:29 +00001//===--- FileDistance.h - File proximity scoring -----------------*- C++-*-===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This library measures the distance between file paths.
11// It's used for ranking symbols, e.g. in code completion.
12// |foo/bar.h -> foo/bar.h| = 0.
13// |foo/bar.h -> foo/baz.h| < |foo/bar.h -> baz.h|.
14// This is an edit-distance, where edits go up or down the directory tree.
15// It's not symmetrical, the costs of going up and down may not match.
16//
17// Dealing with multiple sources:
18// In practice we care about the distance from a source file, but files near
19// its main-header and #included files are considered "close".
20// So we start with a set of (anchor, cost) pairs, and call the distance to a
21// path the minimum of `cost + |source -> path|`.
22//
23// We allow each source to limit the number of up-traversals paths may start
24// with. Up-traversals may reach things that are not "semantically near".
25//
26// Symbol URI schemes:
27// Symbol locations may be represented by URIs rather than file paths directly.
28// In this case we want to perform distance computations in URI space rather
29// than in file-space, without performing redundant conversions.
30// Therefore we have a lookup structure that accepts URIs, so that intermediate
31// calculations for the same scheme can be reused.
32//
33// Caveats:
34// Assuming up and down traversals each have uniform costs is simplistic.
35// Often there are "semantic roots" whose children are almost unrelated.
36// (e.g. /usr/include/, or / in an umbrella repository). We ignore this.
37//
38//===----------------------------------------------------------------------===//
39
40#include "URI.h"
41#include "llvm/ADT/DenseMap.h"
42#include "llvm/ADT/DenseMapInfo.h"
43#include "llvm/ADT/SmallString.h"
44#include "llvm/ADT/StringRef.h"
45#include "llvm/Support/Allocator.h"
46#include "llvm/Support/Path.h"
47#include "llvm/Support/StringSaver.h"
48
49namespace clang {
50namespace clangd {
51
52struct FileDistanceOptions {
53 unsigned UpCost = 2; // |foo/bar.h -> foo|
54 unsigned DownCost = 1; // |foo -> foo/bar.h|
55 unsigned IncludeCost = 2; // |foo.cc -> included_header.h|
56};
57
58struct SourceParams {
59 // Base cost for paths starting at this source.
60 unsigned Cost = 0;
61 // Limits the number of upwards traversals allowed from this source.
62 unsigned MaxUpTraversals = std::numeric_limits<unsigned>::max();
63};
64
65// Supports lookups to find the minimum distance to a file from any source.
66// This object should be reused, it memoizes intermediate computations.
67class FileDistance {
68public:
Kirill Bobyrevc1bb7b92018-08-31 08:19:50 +000069 static constexpr unsigned Unreachable = std::numeric_limits<unsigned>::max();
Sam McCall3f0243f2018-07-03 08:09:29 +000070
71 FileDistance(llvm::StringMap<SourceParams> Sources,
72 const FileDistanceOptions &Opts = {});
73
74 // Computes the minimum distance from any source to the file path.
75 unsigned distance(llvm::StringRef Path);
76
77private:
78 // Costs computed so far. Always contains sources and their ancestors.
79 // We store hash codes only. Collisions are rare and consequences aren't dire.
80 llvm::DenseMap<llvm::hash_code, unsigned> Cache;
81 FileDistanceOptions Opts;
82};
83
84// Supports lookups like FileDistance, but the lookup keys are URIs.
85// We convert each of the sources to the scheme of the URI and do a FileDistance
86// comparison on the bodies.
87class URIDistance {
88public:
89 URIDistance(llvm::StringMap<SourceParams> Sources,
90 const FileDistanceOptions &Opts = {})
91 : Sources(Sources), Opts(Opts) {}
92
93 // Computes the minimum distance from any source to the URI.
94 // Only sources that can be mapped into the URI's scheme are considered.
95 unsigned distance(llvm::StringRef URI);
96
97private:
98 // Returns the FileDistance for a URI scheme, creating it if needed.
99 FileDistance &forScheme(llvm::StringRef Scheme);
100
101 // We cache the results using the original strings so we can skip URI parsing.
102 llvm::DenseMap<llvm::hash_code, unsigned> Cache;
103 llvm::StringMap<SourceParams> Sources;
104 llvm::StringMap<std::unique_ptr<FileDistance>> ByScheme;
105 FileDistanceOptions Opts;
106};
107
108} // namespace clangd
109} // namespace clang