make format

Author: soheilshahrouz

vpr/src/noc/noc_traffic_flows.h

@@ -74,8 +74,7 @@ struct t_noc_traffic_flow {
         , sink_router_cluster_id(sink_router_id)
         , traffic_flow_bandwidth(flow_bandwidth)
         , max_traffic_flow_latency(max_flow_latency)
-        , traffic_flow_priority(flow_priority)
-    {}
+        , traffic_flow_priority(flow_priority) {}
 };
 
 class NocTrafficFlows {

vpr/src/pack/pack.cpp

@@ -192,11 +192,11 @@ bool try_pack(t_packer_opts* packer_opts,
                 VTR_LOG("Floorplan regions are overfull: trying to pack again with more attraction groups exploration. \n");
                 attraction_groups.create_att_groups_for_overfull_regions();
                 VTR_LOG("Pack iteration is %d\n", pack_iteration);
-            } else if (pack_iteration == 3)  {
+            } else if (pack_iteration == 3) {
                 attraction_groups.create_att_groups_for_all_regions();
                 VTR_LOG("Floorplan regions are overfull: trying to pack again with more attraction groups exploration. \n");
                 VTR_LOG("Pack iteration is %d\n", pack_iteration);
-            } else if (pack_iteration == 4)  {
+            } else if (pack_iteration == 4) {
                 attraction_groups.create_att_groups_for_all_regions();
                 VTR_LOG("Floorplan regions are overfull: trying to pack again with more attraction groups exploration and higher target pin utilization. \n");
                 VTR_LOG("Pack iteration is %d\n", pack_iteration);

vpr/src/place/initial_noc_placement.cpp

@@ -32,7 +32,7 @@ static void place_constrained_noc_router(ClusterBlockId router_blk_id);
  *   NoC routers.
  *   @param seed Used for shuffling NoC routers.
  */
-static void place_noc_routers_randomly (std::vector<ClusterBlockId>& unfixed_routers, int seed);
+static void place_noc_routers_randomly(std::vector<ClusterBlockId>& unfixed_routers, int seed);
 
 /**
  * @brief Runs a simulated annealing optimizer for NoC routers.
@@ -58,8 +58,7 @@ static bool accept_noc_swap(double delta_cost, double prob) {
     }
 }
 
-static void place_constrained_noc_router(ClusterBlockId router_blk_id)
-{
+static void place_constrained_noc_router(ClusterBlockId router_blk_id) {
     auto& cluster_ctx = g_vpr_ctx.clustering();
     const auto& floorplanning_ctx = g_vpr_ctx.floorplanning();
 
@@ -87,8 +86,7 @@ static void place_constrained_noc_router(ClusterBlockId router_blk_id)
     }
 }
 
-static void place_noc_routers_randomly (std::vector<ClusterBlockId>& unfixed_routers, int seed)
-{
+static void place_noc_routers_randomly(std::vector<ClusterBlockId>& unfixed_routers, int seed) {
     auto& place_ctx = g_vpr_ctx.placement();
     auto& noc_ctx = g_vpr_ctx.noc();
     auto& cluster_ctx = g_vpr_ctx.clustering();
@@ -153,8 +151,7 @@ static void place_noc_routers_randomly (std::vector<ClusterBlockId>& unfixed_rou
     } // end for of random router placement
 }
 
-static void noc_routers_anneal(const t_noc_opts& noc_opts)
-{
+static void noc_routers_anneal(const t_noc_opts& noc_opts) {
     auto& noc_ctx = g_vpr_ctx.noc();
 
     // Only NoC related costs are considered
@@ -267,7 +264,7 @@ void initial_noc_placement(const t_noc_opts& noc_opts, int seed) {
     }
 
     // Place unconstrained NoC routers randomly
-    place_noc_routers_randomly(unfixed_routers,seed);
+    place_noc_routers_randomly(unfixed_routers, seed);
 
     // populate internal data structures to maintain route, bandwidth usage, and latencies
     initial_noc_routing();

vpr/src/place/initial_placement.cpp

@@ -821,7 +821,7 @@ static bool place_macro(int macros_max_num_tries, const t_pl_macro& pl_macro, en
     //If blk_types_empty_locs_in_grid is not NULL, means that initial placement has been failed in first iteration for this block type
     //We need to place densely in second iteration to be able to find a legal initial placement solution
     if (blk_types_empty_locs_in_grid != nullptr && !blk_types_empty_locs_in_grid->empty()) {
-    	VTR_LOGV_DEBUG(g_vpr_ctx.placement().f_placer_debug, "\t\t\tTry dense placement\n");
+        VTR_LOGV_DEBUG(g_vpr_ctx.placement().f_placer_debug, "\t\t\tTry dense placement\n");
         macro_placed = try_dense_placement(pl_macro, pr, block_type, pad_loc_type, blk_types_empty_locs_in_grid);
     }
 

vpr/src/place/move_utils.cpp

@@ -1031,8 +1031,7 @@ void compressed_grid_to_loc(t_logical_block_type_ptr blk_type,
     to_loc = t_pl_loc(grid_loc.x, grid_loc.y, sub_tile, grid_loc.layer_num);
 }
 
-bool has_empty_compatible_subtile(t_logical_block_type_ptr type, const t_physical_tile_loc& to_loc)
-{
+bool has_empty_compatible_subtile(t_logical_block_type_ptr type, const t_physical_tile_loc& to_loc) {
     auto& device_ctx = g_vpr_ctx.device();
     auto& place_ctx = g_vpr_ctx.placement();
 
@@ -1142,7 +1141,7 @@ bool find_compatible_compressed_loc_in_range(t_logical_block_type_ptr type,
             VTR_ASSERT(to_loc.y <= search_range.ymax);
 
             if (from_loc.x == to_loc.x && from_loc.y == to_loc.y && from_loc.layer_num == to_layer_num) {
-                continue;             //Same from/to location -- try again for new y-position
+                continue;                  //Same from/to location -- try again for new y-position
             } else if (search_for_empty) { // Check if the location has at least one empty sub-tile
                 legal = has_empty_compatible_subtile(type, to_loc);
             } else {

vpr/src/place/noc_place_checkpoint.h

@@ -26,9 +26,9 @@
  */
 class NoCPlacementCheckpoint {
   public:
-   /**
-    * @brief Default constructor initializes private member variables.
-    */
+    /**
+     * @brief Default constructor initializes private member variables.
+     */
     NoCPlacementCheckpoint();
     NoCPlacementCheckpoint(const NoCPlacementCheckpoint& other) = delete;
     NoCPlacementCheckpoint& operator=(const NoCPlacementCheckpoint& other) = delete;