removed unsused argument

Author: behzadmehmood-rs

vpr/src/route/router_lookahead_extended_map.cpp

@@ -399,8 +399,7 @@ std::pair<float, int> ExtendedMapLookahead::run_dijkstra(RRNodeId start_node,
             path_count++;
             this->add_paths<Entry>(start_node, current, *paths, routing_costs);
         } else {
-            util::expand_dijkstra_neighbours(device_ctx.rr_nodes,
-                                             current, paths, node_expanded, &pq);
+            util::expand_dijkstra_neighbours(current, paths, node_expanded, &pq);
             (*node_expanded)[size_t(node)] = true;
         }
     }

vpr/src/route/router_lookahead_map_utils.cpp

@@ -252,8 +252,7 @@ util::Cost_Entry util::Expansion_Cost_Entry::get_median_entry() const {
 }
 
 template<typename Entry>
-void expand_dijkstra_neighbours(const t_rr_graph_storage& rr_nodes,
-                                const Entry& parent_entry,
+void expand_dijkstra_neighbours(const Entry& parent_entry,
                                 std::vector<util::Search_Path>* paths,
                                 std::vector<bool>* node_expanded,
                                 std::priority_queue<Entry,
@@ -263,7 +262,6 @@ void expand_dijkstra_neighbours(const t_rr_graph_storage& rr_nodes,
     const auto& rr_graph = device_ctx.rr_graph;
     RRNodeId parent = parent_entry.rr_node;
 
-    auto& parent_node = rr_nodes[size_t(parent)];
     for (int iedge = 0; iedge < rr_graph.num_edges(parent); iedge++) {
         int child_node_ind = size_t(rr_graph.edge_sink_node(RRNodeId(parent), iedge));
         int switch_ind = rr_graph.edge_switch(parent, iedge);
@@ -287,15 +285,13 @@ void expand_dijkstra_neighbours(const t_rr_graph_storage& rr_nodes,
     }
 }
 
-template void expand_dijkstra_neighbours(const t_rr_graph_storage& rr_nodes,
-                                         const PQ_Entry_Delay& parent_entry,
+template void expand_dijkstra_neighbours(const PQ_Entry_Delay& parent_entry,
                                          std::vector<Search_Path>* paths,
                                          std::vector<bool>* node_expanded,
                                          std::priority_queue<PQ_Entry_Delay,
                                                              std::vector<PQ_Entry_Delay>,
                                                              std::greater<PQ_Entry_Delay>>* pq);
-template void expand_dijkstra_neighbours(const t_rr_graph_storage& rr_nodes,
-                                         const PQ_Entry_Base_Cost& parent_entry,
+template void expand_dijkstra_neighbours(const PQ_Entry_Base_Cost& parent_entry,
                                          std::vector<Search_Path>* paths,
                                          std::vector<bool>* node_expanded,
                                          std::priority_queue<PQ_Entry_Base_Cost,

vpr/src/route/router_lookahead_map_utils.h

@@ -238,8 +238,7 @@ struct Search_Path {
 
 /* iterates over the children of the specified node and selectively pushes them onto the priority queue */
 template<typename Entry>
-void expand_dijkstra_neighbours(const t_rr_graph_storage& rr_nodes,
-                                const Entry& parent_entry,
+void expand_dijkstra_neighbours(const Entry& parent_entry,
                                 std::vector<Search_Path>* paths,
                                 std::vector<bool>* node_expanded,
                                 std::priority_queue<Entry,