[vpr][place] apply Vaughn's comments on place.cpp

Author: amin1377

vpr/src/place/net_cost_handler.cpp

@@ -2216,7 +2216,7 @@ void free_chan_w_factors_for_place_cost () {
     chany_place_cost_fac.clear();
 }
 
-void init_net_cost_structs(size_t num_nets) {
+void init_place_move_structs(size_t num_nets) {
     net_cost.resize(num_nets, -1.);
     proposed_net_cost.resize(num_nets, -1.);
     /* Used to store costs for moves not yet made and to indicate when a net's   *
@@ -2225,7 +2225,7 @@ void init_net_cost_structs(size_t num_nets) {
     bb_updated_before.resize(num_nets, NetUpdateState::NOT_UPDATED_YET);
 }
 
-void free_net_cost_structs() {
+void free_place_move_structs() {
     vtr::release_memory(net_cost);
     vtr::release_memory(proposed_net_cost);
     vtr::release_memory(bb_updated_before);

vpr/src/place/net_cost_handler.h

@@ -6,6 +6,9 @@
 
 /**
  * @brief The method used to calculate palcement cost
+ * @details For comp_cost.  NORMAL means use the method that generates updateable bounding boxes for speed.  
+ * CHECK means compute all bounding boxes from scratch using a very simple routine to allow checks 
+ * of the other costs.
  * NORMAL: Compute cost efficiently using incremental techniques.
  * CHECK: Brute-force cost computation; useful to validate the more complex incremental cost update code.
  */
@@ -125,12 +128,12 @@ void free_chan_w_factors_for_place_cost ();
  * @brief Resize net_cost, proposed_net_cost, and  bb_updated_before data structures to accommodate all nets.
  * @param num_nets Number of nets in the netlist (clustered currently) that the placement engine uses.
  */
-void init_net_cost_structs(size_t num_nets);
+void init_place_move_structs(size_t num_nets);
 
 /**
  * @brief Free net_cost, proposed_net_cost, and  bb_updated_before data structures.
  */
-void free_net_cost_structs();
+void free_place_move_structs();
 
 /**
  * @brief Resize temporary storage data structures needed to determine which nets are affected by a move and data needed per net 

vpr/src/place/place.cpp

@@ -98,12 +98,6 @@ static constexpr double ERROR_TOL = .01;
  * variables round-offs check.                                            */
 static constexpr int MAX_MOVES_BEFORE_RECOMPUTE = 500000;
 
-/* For comp_cost.  NORMAL means use the method that generates updateable  *
- * bounding boxes for speed.  CHECK means compute all bounding boxes from *
- * scratch using a very simple routine to allow checks of the other       *
- * costs.                                   
- */
-
 constexpr float INVALID_DELAY = std::numeric_limits<float>::quiet_NaN();
 constexpr float INVALID_COST = std::numeric_limits<double>::quiet_NaN();
 
@@ -1905,7 +1899,7 @@ static void alloc_and_load_placement_structs(float place_cost_exp,
         }
     }
 
-    init_net_cost_structs(num_nets);
+    init_place_move_structs(num_nets);
 
     if (cube_bb) {
         place_move_ctx.bb_coords.resize(num_nets, t_bb());
@@ -1951,7 +1945,7 @@ static void free_placement_structs(const t_placer_opts& placer_opts, const t_noc
 
     free_placement_macros_structs();
 
-    free_net_cost_structs();
+    free_place_move_structs();
 
     vtr::release_memory(place_move_ctx.bb_coords);
     vtr::release_memory(place_move_ctx.bb_num_on_edges);