File tree Expand file tree Collapse file tree 1 file changed +4
-7
lines changed Expand file tree Collapse file tree 1 file changed +4
-7
lines changed Original file line number Diff line number Diff line change @@ -118,18 +118,17 @@ Placer::Placer(const Netlist<>& net_list,
118
118
119
119
// Gets initial cost and loads bounding boxes.
120
120
costs_.bb_cost = net_cost_handler_.comp_bb_cost (e_cost_methods::NORMAL).first ;
121
- costs_.bb_cost_norm = 1 / costs_.bb_cost ;
122
121
123
122
if (placer_opts.place_algorithm .is_timing_driven ()) {
124
123
alloc_and_init_timing_objects_ (net_list, analysis_opts);
125
124
} else {
126
125
VTR_ASSERT (placer_opts.place_algorithm == e_place_algorithm::BOUNDING_BOX_PLACE);
127
- // Timing cost and normalization factors are not used
128
- constexpr double INVALID_COST = std::numeric_limits<double >::quiet_NaN ();
129
- costs_.timing_cost = INVALID_COST;
130
- costs_.timing_cost_norm = INVALID_COST;
126
+ // Timing cost is not used
127
+ costs_.timing_cost = std::numeric_limits<double >::quiet_NaN ();
131
128
}
132
129
130
+ costs_.update_norm_factors ();
131
+
133
132
if (noc_opts.noc ) {
134
133
VTR_ASSERT (noc_cost_handler_.has_value ());
135
134
@@ -215,8 +214,6 @@ void Placer::alloc_and_init_timing_objects_(const Netlist<>& net_list,
215
214
write_setup_timing_graph_dot (getEchoFileName (E_ECHO_INITIAL_PLACEMENT_TIMING_GRAPH) + std::string (" .dot" ),
216
215
*timing_info_, debug_tnode);
217
216
}
218
-
219
- costs_.timing_cost_norm = 1 / costs_.timing_cost ;
220
217
}
221
218
222
219
void Placer::check_place_ () {
You can’t perform that action at this time.
0 commit comments