@@ -75,7 +75,7 @@ RRNodeId RRSpatialLookup::find_node(int layer,
75
75
return RRNodeId::INVALID ();
76
76
}
77
77
78
- return RRNodeId ( rr_node_indices_[type][layer][node_x][node_y][node_side][ptc]) ;
78
+ return rr_node_indices_[type][layer][node_x][node_y][node_side][ptc];
79
79
}
80
80
81
81
std::vector<RRNodeId> RRSpatialLookup::find_nodes_in_range (int layer,
@@ -155,14 +155,14 @@ std::vector<RRNodeId> RRSpatialLookup::find_nodes(int layer,
155
155
/* Reserve space to avoid memory fragmentation */
156
156
size_t num_nodes = 0 ;
157
157
for (const auto & node : rr_node_indices_[type][layer][node_x][node_y][side]) {
158
- if (RRNodeId ( node)) {
158
+ if (node. is_valid ( )) {
159
159
num_nodes++;
160
160
}
161
161
}
162
162
163
163
nodes.reserve (num_nodes);
164
164
for (const auto & node : rr_node_indices_[type][layer][node_x][node_y][side]) {
165
- if (RRNodeId ( node)) {
165
+ if (node. is_valid ( )) {
166
166
nodes.emplace_back (node);
167
167
}
168
168
}
@@ -272,11 +272,11 @@ void RRSpatialLookup::add_node(RRNodeId node,
272
272
273
273
if (size_t (ptc) >= rr_node_indices_[type][layer][x][y][side].size ()) {
274
274
/* Deposit invalid ids to newly allocated elements while original elements are untouched */
275
- rr_node_indices_[type][layer][x][y][side].resize (ptc + 1 , int ( RRNodeId::INVALID () ));
275
+ rr_node_indices_[type][layer][x][y][side].resize (ptc + 1 , RRNodeId::INVALID ());
276
276
}
277
277
278
278
/* Resize on demand finished; Register the node */
279
- rr_node_indices_[type][layer][x][y][side][ptc] = int ( node) ;
279
+ rr_node_indices_[type][layer][x][y][side][ptc] = node;
280
280
}
281
281
282
282
bool RRSpatialLookup::remove_node (RRNodeId node,
@@ -302,11 +302,11 @@ bool RRSpatialLookup::remove_node(RRNodeId node,
302
302
if ((size_t )y >= rr_node_indices_[type].dim_size (2 )) return false ;
303
303
if (side >= rr_node_indices_[type].dim_size (3 )) return false ;
304
304
if ((size_t )ptc >= rr_node_indices_[type][layer][x][y][side].size ()) return false ;
305
- if (rr_node_indices_[type][layer][x][y][side][ptc] != int ( node) ) return false ;
305
+ if (rr_node_indices_[type][layer][x][y][side][ptc] != node) return false ;
306
306
307
307
// The node was in the spatial lookup; remove it. -1 corresponds to an invalid node id,
308
308
// and so is treated as absent in the spatial lookup
309
- rr_node_indices_[type][layer][x][y][side][ptc] = - 1 ;
309
+ rr_node_indices_[type][layer][x][y][side][ptc] = RRNodeId::INVALID () ;
310
310
return true ;
311
311
}
312
312
@@ -353,8 +353,8 @@ void RRSpatialLookup::reorder(const vtr::vector<RRNodeId, RRNodeId> dest_order)
353
353
for (size_t y = 0 ; y < grid.dim_size (2 ); y++) {
354
354
for (size_t s = 0 ; s < grid.dim_size (3 ); s++) {
355
355
for (auto &node: grid[l][x][y][s]) {
356
- if (node != OPEN ) {
357
- node = size_t ( dest_order[RRNodeId ( node)]) ;
356
+ if (node. is_valid () ) {
357
+ node = dest_order[node] ;
358
358
}
359
359
}
360
360
}
0 commit comments