ccls/src/messages/cquery_call_hierarchy.cc

218 lines
6.6 KiB
C++
Raw Normal View History

#include "message_handler.h"
#include "query_utils.h"
#include "queue_manager.h"
#include <loguru.hpp>
namespace {
2018-03-20 02:51:42 +00:00
enum class CallType : uint8_t {
Direct = 0,
Base = 1,
Derived = 2,
All = 1 | 2
};
MAKE_REFLECT_TYPE_PROXY(CallType);
bool operator&(CallType lhs, CallType rhs) {
return uint8_t(lhs) & uint8_t(rhs);
}
struct Ipc_CqueryCallHierarchy
: public RequestMessage<Ipc_CqueryCallHierarchy> {
const static IpcId kIpcId = IpcId::CqueryCallHierarchy;
struct Params {
// If id is specified, expand a node; otherwise textDocument+position should
// be specified for building the root and |levels| of nodes below.
lsTextDocumentIdentifier textDocument;
lsPosition position;
Maybe<QueryFuncId> id;
// true: callee tree (functions called by this function); false: caller tree
// (where this function is called)
bool callee = false;
// Base: include base functions; All: include both base and derived
// functions.
CallType callType = CallType::All;
2018-02-25 23:24:51 +00:00
bool detailedName = false;
int levels = 1;
};
Params params;
};
MAKE_REFLECT_STRUCT(Ipc_CqueryCallHierarchy::Params,
textDocument,
position,
2018-02-25 23:24:51 +00:00
id,
callee,
callType,
2018-02-25 23:24:51 +00:00
detailedName,
levels);
MAKE_REFLECT_STRUCT(Ipc_CqueryCallHierarchy, id, params);
REGISTER_IPC_MESSAGE(Ipc_CqueryCallHierarchy);
struct Out_CqueryCallHierarchy : public lsOutMessage<Out_CqueryCallHierarchy> {
struct Entry {
QueryFuncId id;
std::string_view name;
lsLocation location;
CallType callType = CallType::Direct;
int numChildren;
// Empty if the |levels| limit is reached.
std::vector<Entry> children;
};
lsRequestId id;
optional<Entry> result;
};
MAKE_REFLECT_STRUCT(Out_CqueryCallHierarchy::Entry,
id,
name,
location,
callType,
numChildren,
children);
MAKE_REFLECT_STRUCT(Out_CqueryCallHierarchy, jsonrpc, id, result);
2018-02-26 03:10:02 +00:00
bool Expand(MessageHandler* m,
Out_CqueryCallHierarchy::Entry* entry,
bool callee,
CallType call_type,
2018-02-25 23:24:51 +00:00
bool detailed_name,
int levels) {
const QueryFunc& func = m->db->funcs[entry->id.id];
const QueryFunc::Def* def = func.AnyDef();
entry->numChildren = 0;
if (!def)
2018-02-26 03:10:02 +00:00
return false;
auto handle = [&](Use use, CallType call_type) {
entry->numChildren++;
if (levels > 0) {
2018-02-26 03:10:02 +00:00
Out_CqueryCallHierarchy::Entry entry1;
entry1.id = QueryFuncId(use.id);
2018-03-01 01:53:43 +00:00
if (auto loc = GetLsLocation(m->db, m->working_files, use))
entry1.location = *loc;
2018-02-26 03:10:02 +00:00
entry1.callType = call_type;
if (Expand(m, &entry1, callee, call_type, detailed_name, levels - 1))
entry->children.push_back(std::move(entry1));
}
};
auto handle_uses = [&](const QueryFunc& func, CallType call_type) {
if (callee) {
if (const auto* def = func.AnyDef())
for (SymbolRef ref : def->callees)
if (ref.kind == SymbolKind::Func)
2018-03-20 02:51:42 +00:00
handle(Use(ref.range, ref.id, ref.kind, ref.role, def->file),
call_type);
} else {
for (Use use : func.uses)
if (use.kind == SymbolKind::Func)
handle(use, call_type);
}
};
std::unordered_set<Usr> seen;
seen.insert(func.usr);
std::vector<const QueryFunc*> stack;
2018-02-26 03:10:02 +00:00
if (detailed_name)
entry->name = def->detailed_name;
else
entry->name = def->ShortName();
handle_uses(func, CallType::Direct);
// Callers/callees of base functions.
if (call_type & CallType::Base) {
stack.push_back(&func);
while (stack.size()) {
const QueryFunc& func1 = *stack.back();
stack.pop_back();
if (auto* def1 = func1.AnyDef()) {
EachDefinedEntity(m->db->funcs, def1->bases, [&](QueryFunc& func2) {
if (!seen.count(func2.usr)) {
seen.insert(func2.usr);
stack.push_back(&func2);
handle_uses(func2, CallType::Base);
}
});
}
}
}
// Callers/callees of derived functions.
if (call_type & CallType::Derived) {
stack.push_back(&func);
while (stack.size()) {
const QueryFunc& func1 = *stack.back();
stack.pop_back();
EachDefinedEntity(m->db->funcs, func1.derived, [&](QueryFunc& func2) {
if (!seen.count(func2.usr)) {
seen.insert(func2.usr);
stack.push_back(&func2);
handle_uses(func2, CallType::Derived);
}
});
}
}
2018-02-26 03:10:02 +00:00
return true;
}
struct CqueryCallHierarchyHandler
: BaseMessageHandler<Ipc_CqueryCallHierarchy> {
optional<Out_CqueryCallHierarchy::Entry> BuildInitial(QueryFuncId root_id,
bool callee,
CallType call_type,
2018-02-25 23:24:51 +00:00
bool detailed_name,
int levels) {
const auto* def = db->funcs[root_id.id].AnyDef();
if (!def)
return {};
Out_CqueryCallHierarchy::Entry entry;
entry.id = root_id;
2018-02-26 03:10:02 +00:00
entry.callType = CallType::Direct;
2018-03-01 01:53:43 +00:00
if (def->spell) {
if (optional<lsLocation> loc =
2018-03-20 02:51:42 +00:00
GetLsLocation(db, working_files, *def->spell))
2018-03-01 01:53:43 +00:00
entry.location = *loc;
}
Expand(this, &entry, callee, call_type, detailed_name, levels);
return entry;
}
void Run(Ipc_CqueryCallHierarchy* request) override {
const auto& params = request->params;
Out_CqueryCallHierarchy out;
out.id = request->id;
if (params.id) {
Out_CqueryCallHierarchy::Entry entry;
entry.id = *params.id;
2018-02-26 03:10:02 +00:00
entry.callType = CallType::Direct;
if (entry.id.id < db->funcs.size())
Expand(this, &entry, params.callee, params.callType,
params.detailedName, params.levels);
out.result = std::move(entry);
} else {
QueryFile* file;
if (!FindFileOrFail(db, project, request->id,
params.textDocument.uri.GetPath(), &file))
return;
WorkingFile* working_file =
working_files->GetFileByFilename(file->def->path);
for (SymbolRef sym :
2018-03-20 02:51:42 +00:00
FindSymbolsAtLocation(working_file, file, params.position)) {
if (sym.kind == SymbolKind::Func) {
out.result =
BuildInitial(QueryFuncId(sym.id), params.callee, params.callType,
2018-03-20 02:51:42 +00:00
params.detailedName, params.levels);
break;
}
}
}
QueueManager::WriteStdout(IpcId::CqueryCallHierarchy, out);
}
};
REGISTER_MESSAGE_HANDLER(CqueryCallHierarchyHandler);
} // namespace