#include "message_handler.h" #include "query_utils.h" #include "queue_manager.h" #include #include #include namespace { struct Ipc_CqueryRandom : public RequestMessage { const static IpcId kIpcId = IpcId::CqueryRandom; }; MAKE_REFLECT_STRUCT(Ipc_CqueryRandom, id); REGISTER_IPC_MESSAGE(Ipc_CqueryRandom); const double kDeclWeight = 3; const double kDamping = 0.1; template struct Kind; template <> struct Kind { static constexpr SymbolKind value = SymbolKind::Func; }; template <> struct Kind { static constexpr SymbolKind value = SymbolKind::Type; }; template <> struct Kind { static constexpr SymbolKind value = SymbolKind::Var; }; template void Add(const std::unordered_map& sym2id, std::vector>& adj, const std::vector>& ids, int n, double w = 1) { for (Id id : ids) { auto it = sym2id.find(SymbolIdx{id, Kind::value}); if (it != sym2id.end()) adj[it->second][n] += w; } } struct CqueryRandomHandler : BaseMessageHandler { void Run(Ipc_CqueryRandom* request) override { std::unordered_map sym2id; std::vector syms; int n = 0; for (RawId i = 0; i < db->funcs.size(); i++) if (db->funcs[i].AnyDef()) { syms.push_back(SymbolIdx{Id(i), SymbolKind::Func}); sym2id[syms.back()] = n++; } for (RawId i = 0; i < db->types.size(); i++) if (db->types[i].AnyDef()) { syms.push_back(SymbolIdx{Id(i), SymbolKind::Type}); sym2id[syms.back()] = n++; } for (RawId i = 0; i < db->vars.size(); i++) if (db->vars[i].AnyDef()) { syms.push_back(SymbolIdx{Id(i), SymbolKind::Var}); sym2id[syms.back()] = n++; } std::vector> adj(n); auto add = [&](const std::vector& uses, double w) { for (Use use : uses) { auto it = sym2id.find(use); if (it != sym2id.end()) adj[it->second][n] += w; } }; n = 0; for (QueryFunc& func : db->funcs) if (func.AnyDef()) { add(func.declarations, kDeclWeight); add(func.uses, 1); Add(sym2id, adj, func.derived, n); n++; } for (QueryType& type : db->types) if (const auto* def = type.AnyDef()) { add(type.uses, 1); Add(sym2id, adj, type.instances, n); Add(sym2id, adj, def->funcs, n); Add(sym2id, adj, def->types, n); Add(sym2id, adj, def->vars, n); n++; } for (QueryVar& var : db->vars) if (var.AnyDef()) { add(var.declarations, kDeclWeight); add(var.uses, 1); n++; } for (int i = 0; i < n; i++) { double sum = 0; adj[i][i] += 1; for (auto& it : adj[i]) sum += it.second; for (auto& it : adj[i]) it.second = it.second / sum * (1 - kDamping); } std::vector x(n, 1), y; for (int j = 0; j < 30; j++) { y.assign(n, kDamping); for (int i = 0; i < n; i++) for (auto& it : adj[i]) y[it.first] += x[i] * it.second; double d = 0; for (int i = 0; i < n; i++) d = std::max(d, fabs(x[i] - y[i])); if (d < 1e-5) break; x.swap(y); } double sum = std::accumulate(x.begin(), x.end(), 0.); Out_LocationList out; out.id = request->id; double roulette = rand() / (RAND_MAX + 1.0) * sum; sum = 0; for (int i = 0; i < n; i++) { sum += x[i]; if (sum >= roulette) { Maybe use = GetDefinitionExtentOfSymbol(db, syms[i]); if (!use) continue; optional ls_loc = GetLsLocation(db, working_files, *use); if (ls_loc) out.result.push_back(*ls_loc); break; } } QueueManager::WriteStdout(IpcId::CqueryRandom, out); } }; REGISTER_MESSAGE_HANDLER(CqueryRandomHandler); } // namespace