93 /// Adjust column widths to fit long file paths and function names.
138 /// Get the number of redundant path components in each path in \p Paths.
139 unsigned getNumRedundantPathComponents(ArrayRef<std::string> Paths) {  in getNumRedundantPathComponents()  argument
142   SmallVector<StringRef, 8> FirstPathComponents{sys::path::begin(Paths[0]),  in getNumRedundantPathComponents()
143                                                 sys::path::end(Paths[0])};  in getNumRedundantPathComponents()
146   for (unsigned I = 1, E = Paths.size(); NumRedundant > 0 && I < E; ++I) {  in getNumRedundantPathComponents()
147     StringRef Path = Paths[I];  in getNumRedundantPathComponents()
151       // useful parts of already-visited paths.  in getNumRedundantPathComponents()
167 /// Determine the length of the longest redundant prefix of the paths in
168 /// \p Paths.
169 unsigned getRedundantPrefixLen(ArrayRef<std::string> Paths) {  in getRedundantPrefixLen()  argument
171   if (Paths.size() <= 1)  in getRedundantPrefixLen()
175   unsigned NumRedundant = getNumRedundantPathComponents(Paths);  in getRedundantPrefixLen()
176   auto Component = sys::path::begin(Paths[0]);  in getRedundantPrefixLen()
186 /// from \p LCP in \p Paths. \p Paths can't be empty. If there's only one
187 /// element in \p Paths, the length of the substr is returned. Note this is
189 unsigned getRedundantPrefixLen(ArrayRef<StringRef> Paths, unsigned LCP) {  in getRedundantPrefixLen()  argument
190   assert(!Paths.empty() && "Paths must have at least one element");  in getRedundantPrefixLen()
192   auto Iter = Paths.begin();  in getRedundantPrefixLen()
193   auto IterE = Paths.end();  in getRedundantPrefixLen()