fix formatting

Author: duck2

libs/libvtrutil/src/vtr_thread_pool.h

@@ -33,7 +33,7 @@ namespace vtr {
  * pool.wait_for_all(); // There's no API to wait for a single task
  */
 class thread_pool {
-private:
+  private:
     /* Thread-local data */
     struct ThreadData {
         std::thread thread;
@@ -58,7 +58,7 @@ class thread_pool {
     std::mutex completion_mutex;
     std::condition_variable completion_cv;
 
-public:
+  public:
     thread_pool(size_t thread_count) {
         threads.reserve(thread_count);
 
@@ -110,12 +110,12 @@ class thread_pool {
             try {
                 f();
             } catch (const std::exception& e) {
-                VTR_LOG_ERROR("Thread %zu failed task with error: %s\n", 
-                             std::this_thread::get_id(), e.what());
+                VTR_LOG_ERROR("Thread %zu failed task with error: %s\n",
+                              std::this_thread::get_id(), e.what());
                 throw;
             } catch (...) {
-                VTR_LOG_ERROR("Thread %zu failed task with unknown error\n", 
-                             std::this_thread::get_id());
+                VTR_LOG_ERROR("Thread %zu failed task with unknown error\n",
+                              std::this_thread::get_id());
                 throw;
             }
 
@@ -156,4 +156,4 @@ class thread_pool {
     }
 };
 
-}  // namespace vtr
+} // namespace vtr

vpr/src/base/read_options.cpp

@@ -2557,7 +2557,7 @@ argparse::ArgumentParser create_arg_parser(const std::string& prog_name, t_optio
             " * parallel_decomp: timing_driven with additional parallelism obtained by decomposing high-fanout nets, possibly reducing quality\n"
             " * nested: parallel with parallelized path search\n")
         .default_value("timing_driven")
-        .choices({"nested","parallel", "parallel_decomp", "timing_driven"})
+        .choices({"nested", "parallel", "parallel_decomp", "timing_driven"})
         .show_in(argparse::ShowIn::HELP_ONLY);
 
     route_grp.add_argument(args.min_incremental_reroute_fanout, "--min_incremental_reroute_fanout")

vpr/src/route/NestedNetlistRouter.tpp

@@ -22,7 +22,7 @@ inline RouteIterResults NestedNetlistRouter<HeapType>::route_netlist(int itry, f
     /* Organize netlist into a PartitionTree.
      * Nets in a given level of nodes are guaranteed to not have any overlapping bounding boxes, so they can be routed in parallel. */
     vtr::Timer timer;
-    if(!_tree){
+    if (!_tree) {
         _tree = PartitionTree(_net_list);
         PartitionTreeDebug::log("Iteration " + std::to_string(itry) + ": built partition tree in " + std::to_string(timer.elapsed_sec()) + " s");
     }
@@ -62,7 +62,7 @@ void NestedNetlistRouter<HeapType>::route_partition_tree_node(PartitionTreeNode&
     });
 
     vtr::Timer timer;
-    
+
     /* Route all nets in this node serially */
     for (auto net_id : nets) {
         auto& results = get_thread_results();
@@ -105,9 +105,9 @@ void NestedNetlistRouter<HeapType>::route_partition_tree_node(PartitionTreeNode&
     }
 
     PartitionTreeDebug::log("Node with " + std::to_string(node.nets.size())
-                           + " nets and " + std::to_string(node.vnets.size())
-                           + " virtual nets routed in " + std::to_string(timer.elapsed_sec())
-                           + " s");
+                            + " nets and " + std::to_string(node.vnets.size())
+                            + " virtual nets routed in " + std::to_string(timer.elapsed_sec())
+                            + " s");
 
     /* Schedule child nodes as new tasks */
     if (node.left && node.right) {