#pragma once #include "indexer.h" #include "serializer.h" #include #include struct QueryFile; struct QueryType; struct QueryFunc; struct QueryVar; struct QueryDatabase; template struct WithFileContent { T value; std::string file_content; WithFileContent(const T& value, const std::string& file_content) : value(value), file_content(file_content) {} }; struct QueryFile { struct Def { std::string path; std::vector args; LanguageId language; // Includes in the file. std::vector includes; // Outline of the file (ie, for code lens). std::vector outline; // Every symbol found in the file (ie, for goto definition) std::vector all_symbols; // Parts of the file which are disabled. std::vector inactive_regions; // Used by |$ccls/freshenIndex|. std::vector dependencies; }; using DefUpdate = WithFileContent; int id = -1; std::optional def; int symbol_idx = -1; }; 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 UseUpdate = std::unordered_map, std::vector>>; using UsrUpdate = std::unordered_map, std::vector>>; struct QueryFunc : QueryEntity { Usr usr; int symbol_idx = -1; std::forward_list def; std::vector declarations; std::vector uses; std::vector derived; }; struct QueryType : QueryEntity { Usr usr; int symbol_idx = -1; std::forward_list def; std::vector declarations; std::vector uses; std::vector derived; std::vector instances; }; struct QueryVar : QueryEntity { Usr usr; int symbol_idx = -1; std::forward_list 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); // Merge |update| into this update; this can reduce overhead / index update // work can be parallelized. void Merge(IndexUpdate&& update); int file_id; // File updates. std::optional files_removed; std::optional files_def_update; // Function updates. std::vector funcs_removed; std::vector> funcs_def_update; UseUpdate funcs_declarations; UseUpdate funcs_uses; UsrUpdate funcs_derived; // Type updates. std::vector types_removed; std::vector> types_def_update; UseUpdate types_declarations; UseUpdate types_uses; UsrUpdate types_derived; UsrUpdate types_instances; // Variable updates. std::vector vars_removed; std::vector> vars_def_update; UseUpdate vars_declarations; UseUpdate vars_uses; }; // The query database is heavily optimized for fast queries. It is stored // in-memory. struct QueryDatabase { // All File/Func/Type/Var symbols. std::vector symbols; std::vector files; std::unordered_map name2file_id; spp::sparse_hash_map usr2func; spp::sparse_hash_map usr2type; spp::sparse_hash_map usr2var; // Marks the given Usrs as invalid. void RemoveUsrs(SymbolKind usr_kind, const std::vector& to_remove); void RemoveUsrs(SymbolKind usr_kind, int file_id, const std::vector& to_remove); // Insert the contents of |update| into |db|. void ApplyIndexUpdate(IndexUpdate* update); int Update(QueryFile::DefUpdate&& u); void Update(int file_id, std::vector>&& us); void Update(int file_id, std::vector>&& us); void Update(int file_id, std::vector>&& us); void UpdateSymbols(int* symbol_idx, SymbolKind kind, Usr usr); std::string_view GetSymbolName(int symbol_idx, bool qualified); QueryFile& GetFile(SymbolIdx ref) { return files[ref.usr]; } QueryFunc& GetFunc(SymbolIdx ref) { return usr2func[ref.usr]; } QueryType& GetType(SymbolIdx ref) { return usr2type[ref.usr]; } QueryVar& GetVar(SymbolIdx ref) { return usr2var[ref.usr]; } QueryFunc& Func(Usr usr) { return usr2func[usr]; } QueryType& Type(Usr usr) { return usr2type[usr]; } QueryVar& Var(Usr usr) { return usr2var[usr]; } };