Skip to content

Commit ec23fea

Browse files
authored
Merge pull request #2813 from verilog-to-routing/tmep_placer_class
Placer class
2 parents 69619a0 + 6905b3e commit ec23fea

35 files changed

+1151
-927
lines changed

libs/EXTERNAL/libtatum/libtatum/tatum/SetupAnalysis.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ namespace tatum {
1616

1717
/** \file
1818
* The 'SetupAnalysis' class defines the operations needed by a GraphWalker class
19-
* to perform a setup (max/longest path) analysis. It satisifes and extends the GraphVisitor
19+
* to perform a setup (max/longest path) analysis. It satisfies and extends the GraphVisitor
2020
* concept class.
2121
*
2222
* Setup Analysis Principles

libs/EXTERNAL/libtatum/libtatum/tatum/TimingConstraints.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -132,7 +132,7 @@ Time TimingConstraints::setup_constraint(const DomainId src_domain, const Domain
132132
return iter->second;
133133
}
134134

135-
//If no capture node specific constraint was found, fallback to the domain pair constriant
135+
//If no capture node specific constraint was found, fallback to the domain pair constraint
136136
iter = setup_constraints_.find(NodeDomainPair(src_domain, sink_domain, NodeId::INVALID()));
137137
if(iter != setup_constraints_.end()) {
138138
return iter->second;

libs/EXTERNAL/libtatum/libtatum/tatum/TimingConstraints.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -45,7 +45,7 @@ class TimingConstraints {
4545
///\returns The source NodeId of the specified domain
4646
NodeId clock_domain_source_node(const DomainId id) const;
4747

48-
//\returns whether the specified domain id corresponds to a virtual lcock
48+
//\returns whether the specified domain id corresponds to a virtual clock
4949
bool is_virtual_clock(const DomainId id) const;
5050

5151
///\returns The domain of the specified node id if it is a clock source

libs/EXTERNAL/libtatum/libtatum/tatum/graph_visitors/CommonAnalysisOps.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ namespace tatum { namespace detail {
99
*
1010
* The operations for CommonAnalysisVisitor to perform setup analysis.
1111
* The setup analysis operations define that maximum edge delays are used, and that the
12-
* maixmum arrival time (and minimum required times) are propagated through the timing graph.
12+
* maximum arrival time (and minimum required times) are propagated through the timing graph.
1313
*
1414
* \see HoldAnalysisOps
1515
* \see SetupAnalysisOps

libs/EXTERNAL/libtatum/libtatum/tatum/graph_visitors/CommonAnalysisVisitor.hpp

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -152,10 +152,10 @@ bool CommonAnalysisVisitor<AnalysisOps>::do_arrival_pre_traverse_node(const Timi
152152
bool node_constrained = false;
153153

154154
if(tc.node_is_constant_generator(node_id)) {
155-
//We progpagate the tags from constant generators to ensure any sinks driven
155+
//We propagate the tags from constant generators to ensure any sinks driven
156156
//only by constant generators are recorded as constrained.
157157
//
158-
//We use a special tag to initialize constant generators which gets overritten
158+
//We use a special tag to initialize constant generators which gets overwritten
159159
//by any non-constant tag at downstream nodes
160160

161161
TimingTag const_gen_tag = ops_.const_gen_tag();

libs/EXTERNAL/libtatum/libtatum/tatum/graph_visitors/SetupAnalysisOps.hpp

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ namespace tatum { namespace detail {
88
*
99
* The operations for CommonAnalysisVisitor to perform setup analysis.
1010
* The setup analysis operations define that maximum edge delays are used, and that the
11-
* maixmum arrival time (and minimum required times) are propagated through the timing graph.
11+
* maximum arrival time (and minimum required times) are propagated through the timing graph.
1212
*
1313
* \see HoldAnalysisOps
1414
* \see CommonAnalysisVisitor
@@ -121,7 +121,7 @@ class SetupAnalysisOps : public CommonAnalysisOps {
121121
Time calculate_slack(const Time required_time, const Time arrival_time) {
122122
//Setup requires the arrival to occur *before* the required time, so
123123
//slack is the amount of required time left after the arrival time; meaning
124-
//we we subtract the arrival time from the required time to get the setup slack
124+
//we subtract the arrival time from the required time to get the setup slack
125125
return required_time - arrival_time;
126126
}
127127

libs/EXTERNAL/libtatum/libtatum/tatum/graph_walkers/ParallelLevelizedWalker.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@
1111
namespace tatum {
1212

1313
/**
14-
* A parallel timing analyzer which traveres the timing graph in a levelized
14+
* A parallel timing analyzer which traverses the timing graph in a levelized
1515
* manner. However nodes within each level are processed in parallel using
1616
* Thread Building Blocks (TBB). If TBB is not available it operates serially and is
1717
* equivalent to the SerialWalker.

libs/librrgraph/src/base/rr_spatial_lookup.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -163,7 +163,7 @@ std::vector<RRNodeId> RRSpatialLookup::find_nodes(int layer,
163163
nodes.reserve(num_nodes);
164164
for (const auto& node : rr_node_indices_[type][layer][node_x][node_y][side]) {
165165
if (RRNodeId(node)) {
166-
nodes.push_back(RRNodeId(node));
166+
nodes.emplace_back(node);
167167
}
168168
}
169169

libs/libvtrutil/src/vtr_time.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,7 @@ class Timer {
3636
constexpr static float BYTE_TO_MIB = 1024 * 1024;
3737
};
3838

39-
///@brief Scoped time class which prints the time elapsed for the specifid action
39+
///@brief Scoped time class which prints the time elapsed for the specified action
4040
class ScopedActionTimer : public Timer {
4141
public:
4242
ScopedActionTimer(std::string action);

vpr/src/base/clustered_netlist_utils.h

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -14,6 +14,7 @@ class ClusteredPinAtomPinsLookup {
1414
typedef typename vtr::Range<atom_pin_iterator> atom_pin_range;
1515

1616
public:
17+
ClusteredPinAtomPinsLookup() = default;
1718
ClusteredPinAtomPinsLookup(const ClusteredNetlist& clustered_netlist, const AtomNetlist& atom_netlist, const IntraLbPbPinLookup& pb_gpin_lookup);
1819

1920
atom_pin_range connected_atom_pins(ClusterPinId clustered_pin) const;

0 commit comments

Comments
 (0)