Skip to content

Commit a2e8b4a

Browse files
remove unused header includes
1 parent e233dab commit a2e8b4a

File tree

5 files changed

+15
-27
lines changed

5 files changed

+15
-27
lines changed

vpr/src/place/place_macro.cpp

Lines changed: 0 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,4 @@
11
#include <cstdio>
2-
#include <ctime>
32
#include <cmath>
43
#include <sstream>
54
#include <map>
@@ -12,8 +11,6 @@
1211
#include "vpr_error.h"
1312
#include "physical_types.h"
1413
#include "globals.h"
15-
#include "place.h"
16-
#include "read_xml_arch_file.h"
1714
#include "place_macro.h"
1815
#include "vpr_utils.h"
1916
#include "echo_files.h"

vpr/src/place/place_timing_update.cpp

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -168,7 +168,7 @@ void update_timing_cost(const PlaceDelayModel* delay_model,
168168
PlacerState& placer_state,
169169
double* timing_cost) {
170170
#ifdef INCR_COMP_TD_COSTS
171-
update_td_costs(delay_model, *criticalities, block_locs, timing_cost);
171+
update_td_costs(delay_model, *criticalities, placer_state, timing_cost);
172172
#else
173173
comp_td_costs(delay_model, *criticalities, placer_state, timing_cost);
174174
#endif
@@ -298,7 +298,7 @@ void update_td_costs(const PlaceDelayModel* delay_model,
298298

299299
#ifdef VTR_ASSERT_DEBUG_ENABLED
300300
double check_timing_cost = 0.;
301-
comp_td_costs(delay_model, place_crit, &check_timing_cost);
301+
comp_td_costs(delay_model, place_crit, placer_state, &check_timing_cost);
302302
VTR_ASSERT_DEBUG_MSG(check_timing_cost == *timing_cost,
303303
"Total timing cost calculated incrementally in update_td_costs() is "
304304
"not consistent with value calculated from scratch in comp_td_costs()");

vpr/src/place/simpleRL_move_generator.cpp

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,15 @@
1+
12
#include "simpleRL_move_generator.h"
3+
24
#include "globals.h"
5+
#include "vtr_random.h"
6+
#include "vtr_time.h"
7+
38
#include <algorithm>
49
#include <numeric>
510
#include <utility>
611

7-
#include "vtr_random.h"
8-
#include "vtr_time.h"
12+
913
/* File-scope routines */
1014
//a scaled and clipped exponential function
1115
static float scaled_clipped_exp(float x) { return std::exp(std::min(1000 * x, float(3.0))); }
@@ -50,7 +54,7 @@ KArmedBanditAgent::KArmedBanditAgent(std::vector<e_move_type> available_moves, e
5054
}
5155

5256
/*
53-
* If the agent selects both move type and block type, the would lool like this:
57+
* If the agent selects both move type and block type, the action table would look like this:
5458
*
5559
* +---------------+---------------+---------------+---------------+
5660
* | (blk0, move0) | (blk0, move1) | ............. | (blk0, moveN) |

vpr/src/place/timing_place.cpp

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -3,18 +3,13 @@
33
* @brief Stores the method definitions of classes defined in timing_place.h.
44
*/
55

6-
#include <cstdio>
76
#include <cmath>
87

98
#include "vtr_util.h"
10-
#include "vtr_memory.h"
11-
#include "vtr_log.h"
129

1310
#include "vpr_types.h"
1411
#include "vpr_utils.h"
15-
#include "globals.h"
1612
#include "net_delay.h"
17-
#include "timing_place_lookup.h"
1813
#include "timing_place.h"
1914
#include "placer_state.h"
2015

vpr/src/place/timing_place_lookup.cpp

Lines changed: 6 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,5 @@
1-
#include <cstdio>
2-
#include <cstring>
1+
32
#include <cmath>
4-
#include <time.h>
53
#include <limits>
64

75
#include "rr_graph_fwd.h"
@@ -15,20 +13,14 @@
1513
#include "vtr_geometry.h"
1614

1715
#include "arch_util.h"
18-
1916
#include "vpr_types.h"
2017
#include "globals.h"
2118
#include "place_and_route.h"
22-
#include "route_common.h"
2319
#include "route_net.h"
24-
#include "route_export.h"
25-
#include "rr_graph.h"
2620
#include "timing_place_lookup.h"
2721
#include "read_xml_arch_file.h"
28-
#include "echo_files.h"
2922
#include "atom_netlist.h"
30-
#include "rr_graph2.h"
31-
#include "place_util.h"
23+
3224
// all functions in profiling:: namespace, which are only activated if PROFILE is defined
3325
#include "route_profiling.h"
3426
#include "router_delay_profiling.h"
@@ -167,7 +159,7 @@ static int get_longest_segment_length(std::vector<t_segment_inf>& segment_inf);
167159
static void fix_empty_coordinates(vtr::NdMatrix<float, 3>& delta_delays);
168160
static void fix_uninitialized_coordinates(vtr::NdMatrix<float, 3>& delta_delays);
169161

170-
static float find_neightboring_average(vtr::NdMatrix<float, 3>& matrix, t_physical_tile_loc tile_loc, int max_distance);
162+
static float find_neighboring_average(vtr::NdMatrix<float, 3>& matrix, t_physical_tile_loc tile_loc, int max_distance);
171163

172164
/******* Globally Accessible Functions **********/
173165

@@ -894,7 +886,7 @@ float delay_reduce(std::vector<float>& delays, e_reducer reducer) {
894886
* If no legal values are found to average over with a range of max_distance,
895887
* we return IMPOSSIBLE_DELTA.
896888
*/
897-
static float find_neightboring_average(
889+
static float find_neighboring_average(
898890
vtr::NdMatrix<float, 3>& matrix,
899891
t_physical_tile_loc tile_loc,
900892
int max_distance) {
@@ -949,7 +941,7 @@ static void fix_empty_coordinates(vtr::NdMatrix<float, 3>& delta_delays) {
949941
for (int delta_x = 0; delta_x < (int)delta_delays.dim_size(1); ++delta_x) {
950942
for (int delta_y = 0; delta_y < (int)delta_delays.dim_size(2); ++delta_y) {
951943
if (delta_delays[layer_num][delta_x][delta_y] == EMPTY_DELTA) {
952-
delta_delays[layer_num][delta_x][delta_y] = find_neightboring_average(delta_delays, {delta_x, delta_y, layer_num}, kMaxAverageDistance);
944+
delta_delays[layer_num][delta_x][delta_y] = find_neighboring_average(delta_delays, {delta_x, delta_y, layer_num}, kMaxAverageDistance);
953945
}
954946
}
955947
}
@@ -987,7 +979,7 @@ static void fill_impossible_coordinates(vtr::NdMatrix<float, 3>& delta_delays) {
987979
for (int delta_x = 0; delta_x < (int)delta_delays.dim_size(1); ++delta_x) {
988980
for (int delta_y = 0; delta_y < (int)delta_delays.dim_size(2); ++delta_y) {
989981
if (delta_delays[layer_num][delta_x][delta_y] == IMPOSSIBLE_DELTA) {
990-
delta_delays[layer_num][delta_x][delta_y] = find_neightboring_average(
982+
delta_delays[layer_num][delta_x][delta_y] = find_neighboring_average(
991983
delta_delays, {delta_x, delta_y, layer_num}, kMaxAverageDistance);
992984
}
993985
}

0 commit comments

Comments
 (0)