// Copyright 2017-2018 ccls Authors // SPDX-License-Identifier: Apache-2.0 #pragma once #include "indexer.hh" #include "serializer.hh" #include "working_files.hh" #include #include #include namespace llvm { template <> struct DenseMapInfo { static inline ccls::ExtentRef getEmptyKey() { return {}; } static inline ccls::ExtentRef getTombstoneKey() { return {{ccls::Range(), ccls::Usr(-1)}}; } static unsigned getHashValue(ccls::ExtentRef sym) { return std::hash()(sym); } static bool isEqual(ccls::ExtentRef l, ccls::ExtentRef r) { return l == r; } }; } // namespace llvm namespace ccls { struct QueryFile { struct Def { std::string path; std::vector args; LanguageId language; // Includes in the file. std::vector includes; // Parts of the file which are disabled. std::vector skipped_ranges; // Used by |$ccls/reload|. std::vector dependencies; }; using DefUpdate = std::pair; int id = -1; std::optional def; // `extent` is valid => declaration; invalid => regular reference llvm::DenseMap symbol2refcnt; }; template struct QueryEntity { using Def = QDef; Def *AnyDef() { Def *ret = nullptr; for (auto &i : static_cast(this)->def) { ret = &i; if (i.spell) break; } return ret; } const Def *AnyDef() const { return const_cast(this)->AnyDef(); } }; using DeclRefUpdate = std::unordered_map, std::vector>>; using UseUpdate = std::unordered_map, std::vector>>; using UsrUpdate = std::unordered_map, std::vector>>; struct QueryFunc : QueryEntity { Usr usr; llvm::SmallVector def; std::vector declarations; std::vector derived; std::vector uses; }; struct QueryType : QueryEntity { Usr usr; llvm::SmallVector def; std::vector declarations; std::vector derived; std::vector instances; std::vector uses; }; struct QueryVar : QueryEntity { Usr usr; llvm::SmallVector def; std::vector declarations; std::vector uses; }; struct IndexUpdate { // Creates a new IndexUpdate based on the delta from previous to current. If // no delta computation should be done just pass null for previous. static IndexUpdate CreateDelta(IndexFile *previous, IndexFile *current); int file_id; // Dummy one to refresh all semantic highlight. bool refresh = false; decltype(IndexFile::lid2path) prev_lid2path; decltype(IndexFile::lid2path) lid2path; // File updates. std::optional files_removed; std::optional files_def_update; // Function updates. int funcs_hint; std::vector> funcs_removed; std::vector> funcs_def_update; DeclRefUpdate funcs_declarations; UseUpdate funcs_uses; UsrUpdate funcs_derived; // Type updates. int types_hint; std::vector> types_removed; std::vector> types_def_update; DeclRefUpdate types_declarations; UseUpdate types_uses; UsrUpdate types_derived; UsrUpdate types_instances; // Variable updates. int vars_hint; std::vector> vars_removed; std::vector> vars_def_update; DeclRefUpdate vars_declarations; UseUpdate vars_uses; }; struct DenseMapInfoForUsr { static inline Usr getEmptyKey() { return 0; } static inline Usr getTombstoneKey() { return ~0ULL; } static unsigned getHashValue(Usr w) { return w; } static bool isEqual(Usr l, Usr r) { return l == r; } }; using Lid2file_id = std::unordered_map; // The query database is heavily optimized for fast queries. It is stored // in-memory. struct DB { std::vector files; llvm::StringMap name2file_id; llvm::DenseMap func_usr, type_usr, var_usr; std::vector funcs; std::vector types; std::vector vars; void clear(); template void RemoveUsrs(Kind kind, int file_id, const std::vector> &to_remove); // Insert the contents of |update| into |db|. void ApplyIndexUpdate(IndexUpdate *update); int GetFileId(const std::string &path); int Update(QueryFile::DefUpdate &&u); void Update(const Lid2file_id &, int file_id, std::vector> &&us); void Update(const Lid2file_id &, int file_id, std::vector> &&us); void Update(const Lid2file_id &, int file_id, std::vector> &&us); std::string_view GetSymbolName(SymbolIdx sym, bool qualified); std::vector GetFileSet(const std::vector &folders); bool HasFunc(Usr usr) const { return func_usr.count(usr); } bool HasType(Usr usr) const { return type_usr.count(usr); } bool HasVar(Usr usr) const { return var_usr.count(usr); } QueryFunc &Func(Usr usr) { return funcs[func_usr[usr]]; } QueryType &Type(Usr usr) { return types[type_usr[usr]]; } QueryVar &Var(Usr usr) { return vars[var_usr[usr]]; } QueryFile &GetFile(SymbolIdx ref) { return files[ref.usr]; } QueryFunc &GetFunc(SymbolIdx ref) { return Func(ref.usr); } QueryType &GetType(SymbolIdx ref) { return Type(ref.usr); } QueryVar &GetVar(SymbolIdx ref) { return Var(ref.usr); } }; Maybe GetDefinitionSpell(DB *db, SymbolIdx sym); // Get defining declaration (if exists) or an arbitrary declaration (otherwise) // for each id. std::vector GetFuncDeclarations(DB *, const std::vector &); std::vector GetTypeDeclarations(DB *, const std::vector &); std::vector GetVarDeclarations(DB *, const std::vector &, unsigned); // Get non-defining declarations. std::vector &GetNonDefDeclarations(DB *db, SymbolIdx sym); std::vector GetUsesForAllBases(DB *db, QueryFunc &root); std::vector GetUsesForAllDerived(DB *db, QueryFunc &root); std::optional GetLsRange(WorkingFile *working_file, const Range &location); DocumentUri GetLsDocumentUri(DB *db, int file_id, std::string *path); DocumentUri GetLsDocumentUri(DB *db, int file_id); std::optional GetLsLocation(DB *db, WorkingFiles *wfiles, Use use); std::optional GetLsLocation(DB *db, WorkingFiles *wfiles, SymbolRef sym, int file_id); std::vector GetLsLocations(DB *db, WorkingFiles *wfiles, const std::vector &uses); // Returns a symbol. The symbol will *NOT* have a location assigned. std::optional GetSymbolInfo(DB *db, SymbolIdx sym, bool detailed); std::vector FindSymbolsAtLocation(WorkingFile *working_file, QueryFile *file, Position &ls_pos, bool smallest = false); template void WithEntity(DB *db, SymbolIdx sym, Fn &&fn) { switch (sym.kind) { case Kind::Invalid: case Kind::File: break; case Kind::Func: fn(db->GetFunc(sym)); break; case Kind::Type: fn(db->GetType(sym)); break; case Kind::Var: fn(db->GetVar(sym)); break; } } template void EachEntityDef(DB *db, SymbolIdx sym, Fn &&fn) { WithEntity(db, sym, [&](const auto &entity) { for (auto &def : entity.def) if (!fn(def)) break; }); } template void EachOccurrence(DB *db, SymbolIdx sym, bool include_decl, Fn &&fn) { WithEntity(db, sym, [&](const auto &entity) { for (Use use : entity.uses) fn(use); if (include_decl) { for (auto &def : entity.def) if (def.spell) fn(*def.spell); for (Use use : entity.declarations) fn(use); } }); } SymbolKind GetSymbolKind(DB *db, SymbolIdx sym); template void EachDefinedFunc(DB *db, const std::vector &usrs, Fn &&fn) { for (Usr usr : usrs) { auto &obj = db->Func(usr); if (!obj.def.empty()) fn(obj); } } } // namespace ccls