File tree Expand file tree Collapse file tree 1 file changed +3
-8
lines changed Expand file tree Collapse file tree 1 file changed +3
-8
lines changed Original file line number Diff line number Diff line change 5
5
#include < algorithm>
6
6
7
7
#include " rr_graph.h"
8
- #include " globals.h"
9
8
#include " rr_graph_uxsdcxx_interface.h"
10
9
#include " rr_node.h"
11
10
#include " vpr_error.h"
@@ -153,10 +152,8 @@ class EdgeWalker {
153
152
current_edge_ = 0 ;
154
153
current_idx_ = 0 ;
155
154
156
- auto & device_ctx = g_vpr_ctx.device ();
157
- const auto & rr_graph = device_ctx.rr_graph ;
158
155
for (const auto & node : *nodes) {
159
- num_edges_ += rr_graph. num_edges (node.id ());
156
+ num_edges_ += nodes_-> num_edges (node.id ());
160
157
}
161
158
}
162
159
@@ -184,9 +181,7 @@ class EdgeWalker {
184
181
current_edge_ += 1 ;
185
182
}
186
183
187
- auto & device_ctx = g_vpr_ctx.device ();
188
- const auto & rr_graph = device_ctx.rr_graph ;
189
- if (current_edge_ >= rr_graph.num_edges (RRNodeId (current_src_inode_))) {
184
+ if (current_edge_ >= nodes_-> num_edges (RRNodeId (current_src_inode_))) {
190
185
// Done with current_src_inode_, advance to the end of the
191
186
// node list, or the next node with at least 1 edge.
192
187
current_edge_ = 0 ;
@@ -199,7 +194,7 @@ class EdgeWalker {
199
194
VTR_ASSERT (current_idx_ + 1 == num_edges_);
200
195
return current_idx_++;
201
196
}
202
- } while (rr_graph. num_edges (RRNodeId (current_src_inode_)) < 1 );
197
+ } while (nodes_-> num_edges (RRNodeId (current_src_inode_)) < 1 );
203
198
}
204
199
205
200
VTR_ASSERT (current_src_inode_ < nodes_->size ());
You can’t perform that action at this time.
0 commit comments