mirror of
https://github.com/MaskRay/ccls.git
synced 2024-11-28 10:31:56 +00:00
177 lines
5.1 KiB
C++
177 lines
5.1 KiB
C++
/* Copyright 2017-2018 ccls Authors
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
you may not use this file except in compliance with the License.
|
|
You may obtain a copy of the License at
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
See the License for the specific language governing permissions and
|
|
limitations under the License.
|
|
==============================================================================*/
|
|
|
|
#include "utils.h"
|
|
|
|
#include "log.hh"
|
|
#include "platform.h"
|
|
|
|
#include <siphash.h>
|
|
|
|
#include <llvm/ADT/StringRef.h>
|
|
#include <llvm/Support/FileSystem.h>
|
|
#include <llvm/Support/Path.h>
|
|
using namespace llvm;
|
|
|
|
#include <algorithm>
|
|
#include <assert.h>
|
|
#include <ctype.h>
|
|
#include <errno.h>
|
|
#include <functional>
|
|
#include <string.h>
|
|
#include <unordered_map>
|
|
|
|
uint64_t HashUsr(std::string_view s) {
|
|
union {
|
|
uint64_t ret;
|
|
uint8_t out[8];
|
|
};
|
|
// k is an arbitrary key. Don't change it.
|
|
const uint8_t k[16] = {0xd0, 0xe5, 0x4d, 0x61, 0x74, 0x63, 0x68, 0x52,
|
|
0x61, 0x79, 0xea, 0x70, 0xca, 0x70, 0xf0, 0x0d};
|
|
(void)siphash(reinterpret_cast<const uint8_t *>(s.data()), s.size(), k, out,
|
|
8);
|
|
return ret;
|
|
}
|
|
|
|
uint64_t HashUsr(llvm::StringRef s) {
|
|
return HashUsr(std::string_view(s.data(), s.size()));
|
|
}
|
|
|
|
bool EndsWith(std::string_view s, std::string_view suffix) {
|
|
return s.size() >= suffix.size() &&
|
|
std::equal(suffix.rbegin(), suffix.rend(), s.rbegin());
|
|
}
|
|
|
|
bool StartsWith(std::string_view s, std::string_view prefix) {
|
|
return s.size() >= prefix.size() &&
|
|
std::equal(prefix.begin(), prefix.end(), s.begin());
|
|
}
|
|
|
|
bool EndsWithAny(std::string_view s, const std::vector<std::string> &ss) {
|
|
return std::any_of(ss.begin(), ss.end(),
|
|
std::bind(EndsWith, s, std::placeholders::_1));
|
|
}
|
|
|
|
bool FindAnyPartial(const std::string &value,
|
|
const std::vector<std::string> &values) {
|
|
return std::any_of(std::begin(values), std::end(values),
|
|
[&value](const std::string &v) {
|
|
return value.find(v) != std::string::npos;
|
|
});
|
|
}
|
|
|
|
std::vector<std::string> SplitString(const std::string &str,
|
|
const std::string &delimiter) {
|
|
// http://stackoverflow.com/a/13172514
|
|
std::vector<std::string> strings;
|
|
|
|
std::string::size_type pos = 0;
|
|
std::string::size_type prev = 0;
|
|
while ((pos = str.find(delimiter, prev)) != std::string::npos) {
|
|
strings.push_back(str.substr(prev, pos - prev));
|
|
prev = pos + 1;
|
|
}
|
|
|
|
// To get the last substring (or only, if delimiter is not found)
|
|
strings.push_back(str.substr(prev));
|
|
|
|
return strings;
|
|
}
|
|
|
|
std::string LowerPathIfInsensitive(const std::string &path) {
|
|
#if defined(_WIN32)
|
|
std::string ret = path;
|
|
for (char &c : ret)
|
|
c = tolower(c);
|
|
return ret;
|
|
#else
|
|
return path;
|
|
#endif
|
|
}
|
|
|
|
void EnsureEndsInSlash(std::string &path) {
|
|
if (path.empty() || path[path.size() - 1] != '/')
|
|
path += '/';
|
|
}
|
|
|
|
std::string EscapeFileName(std::string path) {
|
|
bool slash = path.size() && path.back() == '/';
|
|
for (char &c : path)
|
|
if (c == '\\' || c == '/' || c == ':')
|
|
c = '@';
|
|
if (slash)
|
|
path += '/';
|
|
return path;
|
|
}
|
|
|
|
std::string ResolveIfRelative(const std::string &directory,
|
|
const std::string &path) {
|
|
if (sys::path::is_absolute(path))
|
|
return path;
|
|
SmallString<256> Ret;
|
|
sys::path::append(Ret, directory, path);
|
|
return NormalizePath(Ret.str());
|
|
}
|
|
|
|
std::optional<int64_t> LastWriteTime(const std::string &path) {
|
|
sys::fs::file_status Status;
|
|
if (sys::fs::status(path, Status))
|
|
return {};
|
|
return sys::toTimeT(Status.getLastModificationTime());
|
|
}
|
|
|
|
std::optional<std::string> ReadContent(const std::string &filename) {
|
|
char buf[4096];
|
|
std::string ret;
|
|
FILE *f = fopen(filename.c_str(), "rb");
|
|
if (!f)
|
|
return {};
|
|
size_t n;
|
|
while ((n = fread(buf, 1, sizeof buf, f)) > 0)
|
|
ret.append(buf, n);
|
|
fclose(f);
|
|
return ret;
|
|
}
|
|
|
|
void WriteToFile(const std::string &filename, const std::string &content) {
|
|
FILE *f = fopen(filename.c_str(), "wb");
|
|
if (!f ||
|
|
(content.size() && fwrite(content.c_str(), content.size(), 1, f) != 1)) {
|
|
LOG_S(ERROR) << "failed to write to " << filename << ' ' << strerror(errno);
|
|
return;
|
|
}
|
|
fclose(f);
|
|
}
|
|
|
|
// Find discontinous |search| in |content|.
|
|
// Return |found| and the count of skipped chars before found.
|
|
int ReverseSubseqMatch(std::string_view pat, std::string_view text,
|
|
int case_sensitivity) {
|
|
if (case_sensitivity == 1)
|
|
case_sensitivity = std::any_of(pat.begin(), pat.end(), isupper) ? 2 : 0;
|
|
int j = pat.size();
|
|
if (!j)
|
|
return text.size();
|
|
for (int i = text.size(); i--;)
|
|
if ((case_sensitivity ? text[i] == pat[j - 1]
|
|
: tolower(text[i]) == tolower(pat[j - 1])) &&
|
|
!--j)
|
|
return i;
|
|
return -1;
|
|
}
|
|
|
|
std::string GetDefaultResourceDirectory() { return DEFAULT_RESOURCE_DIRECTORY; }
|