Integrate schema based reader with edge refactoring.

Signed-off-by: Keith Rothman <[email protected]>

Author: litghost

vpr/src/route/rr_graph.cpp

@@ -725,7 +725,7 @@ static void build_rr_graph(const t_graph_type graph_type,
 
     //Partition the rr graph edges for efficient access to configurable/non-configurable
     //edge subsets. Must be done after RR switches have been allocated
-    partition_rr_graph_edges(&device_ctx.rr_nodes);
+    device_ctx.rr_nodes.partition_edges();
 
     //Save the channel widths for the newly constructed graph
     device_ctx.chan_width = nodes_per_chan;

vpr/src/route/rr_graph_storage.h

@@ -6,6 +6,7 @@
 #include "rr_node_fwd.h"
 #include "rr_graph2.h"
 #include "vtr_log.h"
+#include "vpr_utils.h"
 
 /* Main structure describing one routing resource node.  Everything in       *
  * this structure should describe the graph -- information needed only       *
@@ -101,6 +102,17 @@ class t_rr_graph_storage {
         clear();
     }
 
+    // Makes room in storage for RRNodeId in amoritized O(1) fashion.
+    //
+    // This results in an allocation pattern similiar to what would happen
+    // if push_back(x) / emplace_back() were used if underlying storage
+    // was not preallocated.
+    void make_room_for_node(RRNodeId elem_position) {
+        make_room_in_vector(&storage_, size_t(elem_position));
+        ptc_.reserve(storage_.capacity());
+        ptc_.resize(storage_.size());
+    }
+
     void reserve(size_t size) {
         // No edges can be assigned if mutating the rr node array.
         VTR_ASSERT(!edges_read_);