-
Notifications
You must be signed in to change notification settings - Fork 15
/
traverse_with_props.cc
220 lines (192 loc) · 7.58 KB
/
traverse_with_props.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
/*
* ===============================================================
* Description: Implementation of traverse_with_props
*
* Created: 2014-06-23 11:23:46
*
* Author: Ayush Dubey, dubey@cs.cornell.edu
*
* Copyright (C) 2013, Cornell University, see the LICENSE file
* for licensing agreement
* ===============================================================
*/
#define weaver_debug_
#include "common/stl_serialization.h"
#include "common/cache_constants.h"
#include "node_prog/node_prog_type.h"
#include "node_prog/edge.h"
#include "node_prog/traverse_with_props.h"
using node_prog::Node_Parameters_Base;
using node_prog::Node_State_Base;
using node_prog::search_type;
using node_prog::traverse_props_params;
using node_prog::traverse_props_state;
using node_prog::cache_response;
// params
traverse_props_params :: traverse_props_params()
: returning(false)
, collect_nodes(false)
, collect_edges(false)
{ }
uint64_t
traverse_props_params :: size(void *aux_args) const
{
return message::size(aux_args, returning)
+ message::size(aux_args, prev_node)
+ message::size(aux_args, node_aliases)
+ message::size(aux_args, node_props)
+ message::size(aux_args, edge_props)
+ message::size(aux_args, collect_nodes)
+ message::size(aux_args, collect_edges)
+ message::size(aux_args, return_nodes)
+ message::size(aux_args, return_edges);
}
void
traverse_props_params :: pack(e::packer &packer, void *aux_args) const
{
message::pack_buffer(packer, aux_args, returning);
message::pack_buffer(packer, aux_args, prev_node);
message::pack_buffer(packer, aux_args, node_aliases);
message::pack_buffer(packer, aux_args, node_props);
message::pack_buffer(packer, aux_args, edge_props);
message::pack_buffer(packer, aux_args, collect_nodes);
message::pack_buffer(packer, aux_args, collect_edges);
message::pack_buffer(packer, aux_args, return_nodes);
message::pack_buffer(packer, aux_args, return_edges);
}
void
traverse_props_params :: unpack(e::unpacker &unpacker, void *aux_args)
{
message::unpack_buffer(unpacker, aux_args, returning);
message::unpack_buffer(unpacker, aux_args, prev_node);
message::unpack_buffer(unpacker, aux_args, node_aliases);
message::unpack_buffer(unpacker, aux_args, node_props);
message::unpack_buffer(unpacker, aux_args, edge_props);
message::unpack_buffer(unpacker, aux_args, collect_nodes);
message::unpack_buffer(unpacker, aux_args, collect_edges);
message::unpack_buffer(unpacker, aux_args, return_nodes);
message::unpack_buffer(unpacker, aux_args, return_edges);
}
// state
traverse_props_state :: traverse_props_state()
: visited(false)
, out_count(0)
{ }
uint64_t
traverse_props_state :: size(void *aux_args) const
{
return message::size(aux_args, visited)
+ message::size(aux_args, out_count)
+ message::size(aux_args, prev_node)
+ message::size(aux_args, return_nodes)
+ message::size(aux_args, return_edges);
}
void
traverse_props_state :: pack(e::packer &packer, void *aux_args) const
{
message::pack_buffer(packer, aux_args, visited);
message::pack_buffer(packer, aux_args, out_count);
message::pack_buffer(packer, aux_args, prev_node);
message::pack_buffer(packer, aux_args, return_nodes);
message::pack_buffer(packer, aux_args, return_edges);
}
void
traverse_props_state :: unpack(e::unpacker &unpacker, void *aux_args)
{
message::unpack_buffer(unpacker, aux_args, visited);
message::unpack_buffer(unpacker, aux_args, out_count);
message::unpack_buffer(unpacker, aux_args, prev_node);
message::unpack_buffer(unpacker, aux_args, return_nodes);
message::unpack_buffer(unpacker, aux_args, return_edges);
}
bool
check_aliases(const node_prog::node &n, const std::vector<std::string> &aliases)
{
for (const std::string &alias: aliases) {
if (!n.is_alias(alias)) {
return false;
}
}
return true;
}
extern "C" {
PROG_FUNC_DEFINE(traverse_props);
std::pair<search_type, std::vector<std::pair<db::remote_node, std::shared_ptr<Node_Parameters_Base>>>>
node_prog :: node_program(node &n,
db::remote_node &rn,
std::shared_ptr<Node_Parameters_Base> param_ptr,
std::function<Node_State_Base&()> state_getter)
{
Node_State_Base &state_base = state_getter();
traverse_props_state& state = dynamic_cast<traverse_props_state&>(state_base);
Node_Parameters_Base ¶m_base = *param_ptr;
traverse_props_params ¶ms = dynamic_cast<traverse_props_params&>(param_base);
std::vector<std::pair<db::remote_node, std::shared_ptr<Node_Parameters_Base>>> next;
if (!params.returning) {
// request spreading out
if (state.visited || !n.has_all_properties(params.node_props.front()) || !check_aliases(n, params.node_aliases.front())) {
// either this node already visited
// or node does not have requisite params
// return now
params.returning = true;
next.emplace_back(std::make_pair(params.prev_node, std::make_shared<traverse_props_params>(params)));
} else {
state.prev_node = params.prev_node;
params.prev_node = rn; // this node
params.node_aliases.pop_front();
params.node_props.pop_front();
if (params.edge_props.empty()) {
// reached the max hop, return now
assert(params.node_props.empty());
params.return_nodes.emplace(n.get_handle());
} else {
if (params.collect_nodes) {
params.return_nodes.emplace(n.get_handle());
}
auto edge_props = params.edge_props.front();
params.edge_props.pop_front();
bool collect_edges = params.collect_edges;
bool propagate = !params.node_props.empty();
if (!propagate) {
assert(params.edge_props.empty());
collect_edges = true;
}
for (edge &e: n.get_edges()) {
if (e.has_all_properties(edge_props)) {
if (collect_edges) {
params.return_edges.emplace(e.get_handle());
}
if (propagate) {
next.emplace_back(std::make_pair(e.get_neighbor(), std::make_shared<traverse_props_params>(params)));
state.out_count++;
}
}
}
}
if (state.out_count == 0) {
// either no edges satisfy props
// or reached max hops
// return now
params.returning = true;
next.emplace_back(std::make_pair(state.prev_node, std::make_shared<traverse_props_params>(params)));
}
}
state.visited = true;
assert(!next.empty());
} else {
// request returning to start node
for (const node_handle_t &n: params.return_nodes) {
state.return_nodes.emplace(n);
}
for (const edge_handle_t &e: params.return_edges) {
state.return_edges.emplace(e);
}
if (--state.out_count == 0) {
params.return_nodes = std::move(state.return_nodes);
params.return_edges = std::move(state.return_edges);
next.emplace_back(std::make_pair(state.prev_node, std::make_shared<traverse_props_params>(params)));
}
}
return std::make_pair(search_type::BREADTH_FIRST, next);
}
}