51 lines
1.7 KiB
C++
51 lines
1.7 KiB
C++
/*
|
|
* nextpnr -- Next Generation Place and Route
|
|
*
|
|
* Copyright (C) 2018 David Shah <david@symbioticeda.com>
|
|
*
|
|
* Permission to use, copy, modify, and/or distribute this software for any
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
* copyright notice and this permission notice appear in all copies.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*
|
|
*/
|
|
|
|
#ifndef TIMING_H
|
|
#define TIMING_H
|
|
|
|
#include "nextpnr.h"
|
|
|
|
NEXTPNR_NAMESPACE_BEGIN
|
|
|
|
// Evenly redistribute the total path slack amongst all sinks on each path
|
|
void assign_budget(Context *ctx, bool quiet = false);
|
|
|
|
// Perform timing analysis and print out the fmax, and optionally the
|
|
// critical path
|
|
void timing_analysis(Context *ctx, bool slack_histogram = true, bool print_fmax = true, bool print_path = false,
|
|
bool warn_on_failure = false);
|
|
|
|
// Data for the timing optimisation algorithm
|
|
struct NetCriticalityInfo
|
|
{
|
|
// One each per user
|
|
std::vector<delay_t> slack;
|
|
std::vector<float> criticality;
|
|
unsigned max_path_length = 0;
|
|
delay_t cd_worst_slack = std::numeric_limits<delay_t>::max();
|
|
};
|
|
|
|
typedef std::unordered_map<IdString, NetCriticalityInfo> NetCriticalityMap;
|
|
void get_criticalities(Context *ctx, NetCriticalityMap *net_crit);
|
|
|
|
NEXTPNR_NAMESPACE_END
|
|
|
|
#endif
|