[Format] Resolved CPP Format Issues

Now that the CI test is fixed, I have resolved all outstanding
format issues.

Author: AlexandreSinger

libs/librtlnumber/src/include/internal_bits.hpp

@@ -27,14 +27,14 @@ constexpr short integer_t_size = (sizeof(integer_t) * 8);
     }
 
 #define unroll_1d(lut) \
-    {lut[_0], lut[_1], lut[_x], lut[_z]}
+    { lut[_0], lut[_1], lut[_x], lut[_z] }
 #define unroll_2d(lut) \
-    {unroll_1d(lut[_0]), unroll_1d(lut[_1]), unroll_1d(lut[_x]), unroll_1d(lut[_z])}
+    { unroll_1d(lut[_0]), unroll_1d(lut[_1]), unroll_1d(lut[_x]), unroll_1d(lut[_z]) }
 
 #define unroll_1d_invert(lut) \
-    {l_not[lut[_0]], l_not[lut[_1]], l_not[lut[_x]], l_not[lut[_z]]}
+    { l_not[lut[_0]], l_not[lut[_1]], l_not[lut[_x]], l_not[lut[_z]] }
 #define unroll_2d_invert(lut) \
-    {unroll_1d_invert(lut[_0]), unroll_1d_invert(lut[_1]), unroll_1d_invert(lut[_x]), unroll_1d_invert(lut[_z])}
+    { unroll_1d_invert(lut[_0]), unroll_1d_invert(lut[_1]), unroll_1d_invert(lut[_x]), unroll_1d_invert(lut[_z]) }
 
 namespace BitSpace {
 typedef uint8_t bit_value_t;

vpr/src/base/read_netlist.cpp

@@ -319,11 +319,11 @@ static void sync_clustered_and_atom_netlists(ClusteredNetlist& clb_nlist,
 }
 
 static void process_complex_block(pugi::xml_node clb_block,
-                                const ClusterBlockId index,
-                                int& num_primitives,
-                                const pugiutil::loc_data& loc_data,
-                                const std::unordered_map<std::string, int>& logical_block_type_name_to_index,
-                                ClusteredNetlist& clb_nlist) {
+                                  const ClusterBlockId index,
+                                  int& num_primitives,
+                                  const pugiutil::loc_data& loc_data,
+                                  const std::unordered_map<std::string, int>& logical_block_type_name_to_index,
+                                  ClusteredNetlist& clb_nlist) {
     const auto& logical_block_types = g_vpr_ctx.device().logical_block_types;
 
     //Parse cb attributes

vpr/src/pack/prepack.cpp

@@ -169,7 +169,6 @@ static std::vector<t_pack_patterns> alloc_and_load_pack_patterns(const std::vect
 
     std::vector<t_pack_patterns> packing_patterns = alloc_and_init_pattern_list_from_hash(pattern_names);
 
-
     /* load packing patterns by traversing the edges to find edges belonging to pattern */
     for (size_t i = 0; i < pattern_names.size(); i++) {
         for (const t_logical_block_type& type : logical_block_types) {

vpr/src/route/check_route.cpp

@@ -740,23 +740,23 @@ static bool check_non_configurable_edges(const Netlist<>& net_list,
             //forward/reverse edge is used.
             std::vector<t_node_edge> dedupped_difference;
             std::ranges::copy_if(difference,
-                         std::back_inserter(dedupped_difference),
-                         [&](t_node_edge forward_edge) {
-                             VTR_ASSERT_MSG(!routing_edges.contains(forward_edge), "Difference should not contain used routing edges");
-
-                             t_node_edge reverse_edge = {forward_edge.to_node, forward_edge.from_node};
-
-                             //Check whether the reverse edge was used
-                             if (rr_edges.contains(reverse_edge) && routing_edges.contains(reverse_edge)) {
-                                 //The reverse edge exists in the set of rr_edges, and was used
-                                 //by the routing.
-                                 //
-                                 //We can therefore safely ignore the fact that this (forward) edge is un-used
-                                 return false; //Drop from difference
-                             } else {
-                                 return true; //Keep, this edge should have been used
-                             }
-                         });
+                                 std::back_inserter(dedupped_difference),
+                                 [&](t_node_edge forward_edge) {
+                                     VTR_ASSERT_MSG(!routing_edges.contains(forward_edge), "Difference should not contain used routing edges");
+
+                                     t_node_edge reverse_edge = {forward_edge.to_node, forward_edge.from_node};
+
+                                     //Check whether the reverse edge was used
+                                     if (rr_edges.contains(reverse_edge) && routing_edges.contains(reverse_edge)) {
+                                         //The reverse edge exists in the set of rr_edges, and was used
+                                         //by the routing.
+                                         //
+                                         //We can therefore safely ignore the fact that this (forward) edge is un-used
+                                         return false; //Drop from difference
+                                     } else {
+                                         return true; //Keep, this edge should have been used
+                                     }
+                                 });
 
             //At this point only valid missing node pairs are in the set
             if (!dedupped_difference.empty()) {

vpr/src/route/rr_graph_generation/rr_graph_intra_cluster.cpp

@@ -202,7 +202,7 @@ static std::vector<int> get_cluster_block_pins(t_physical_tile_type_ptr physical
     bool found_sub_tile = false;
 
     // Iterate over all the sub-tiles to find the sub-tile instance that the cluster block is mapped to.
-    for (const t_sub_tile& sub_tile: physical_tile->sub_tiles) {
+    for (const t_sub_tile& sub_tile : physical_tile->sub_tiles) {
         if (sub_tile.capacity.is_in_range(sub_tile_index)) {
             // This sub-tile type is the one that the cluster block is mapped to.
             found_sub_tile = true;

vpr/src/server/taskresolver.cpp

@@ -8,7 +8,6 @@
 #include "telegramoptions.h"
 #include <gtk/gtk.h>
 
-
 #include <ezgl/application.hpp>
 
 namespace server {

vpr/src/util/vpr_utils.cpp

@@ -1372,9 +1372,7 @@ std::tuple<int, int, std::string, std::string> parse_direct_pin_name(std::string
         std::string source_string{src_string};
 
         // Replace '.' and '[' characters with ' '
-        std::ranges::replace_if(source_string,
-            [](char c) noexcept { return c == '.' || c == '[' || c == ':' || c == ']'; },
-            ' ');
+        std::ranges::replace_if(source_string, [](char c) noexcept { return c == '.' || c == '[' || c == ':' || c == ']'; }, ' ');
 
         std::istringstream source_iss(source_string);
         int start_pin_index, end_pin_index;