45 lines
1.6 KiB
C++
45 lines
1.6 KiB
C++
|
#pragma once
|
||
|
|
|
||
|
|
#include <memory>
|
||
|
|
|
||
|
|
#include "communication/messaging/distributed.hpp"
|
||
|
|
#include "communication/rpc/rpc.hpp"
|
||
|
|
#include "database/graph_db.hpp"
|
||
|
|
#include "database/graph_db_accessor.hpp"
|
||
|
|
#include "distributed/remote_data_rpc_messages.hpp"
|
||
|
|
#include "transactions/type.hpp"
|
||
|
|
|
||
|
|
namespace distributed {
|
||
|
|
|
||
|
|
/** Serves this worker's data to others. */
|
||
|
|
class RemoteDataRpcServer {
|
||
|
|
// TODO maybe reuse GraphDbAccessors. It would reduce the load on tx::Engine
|
||
|
|
// locks (not sure what the gain would be). But have some way of cache
|
||
|
|
// invalidation.
|
||
|
|
public:
|
||
|
|
RemoteDataRpcServer(database::GraphDb &db,
|
||
|
|
communication::messaging::System &system)
|
||
|
|
: db_(db), system_(system) {
|
||
|
|
rpc_server_.Register<RemoteVertexRpc>([this](const RemoteVertexReq &req) {
|
||
|
|
database::GraphDbAccessor dba(db_, req.member.tx_id);
|
||
|
|
auto vertex = dba.FindVertexChecked(req.member.gid, false);
|
||
|
|
CHECK(vertex.GetOld())
|
||
|
|
<< "Old record must exist when sending vertex by RPC";
|
||
|
|
return std::make_unique<RemoteVertexRes>(vertex.GetOld(), db_.WorkerId());
|
||
|
|
});
|
||
|
|
|
||
|
|
rpc_server_.Register<RemoteEdgeRpc>([this](const RemoteEdgeReq &req) {
|
||
|
|
database::GraphDbAccessor dba(db_, req.member.tx_id);
|
||
|
|
auto edge = dba.FindEdgeChecked(req.member.gid, false);
|
||
|
|
CHECK(edge.GetOld()) << "Old record must exist when sending edge by RPC";
|
||
|
|
return std::make_unique<RemoteEdgeRes>(edge.GetOld(), db_.WorkerId());
|
||
|
|
});
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
database::GraphDb &db_;
|
||
|
|
communication::messaging::System &system_;
|
||
|
|
communication::rpc::Server rpc_server_{system_, kRemoteDataRpcName};
|
||
|
|
};
|
||
|
|
} // namespace distributed
|