aboutsummaryrefslogtreecommitdiffstats
path: root/docs/archapi.md
diff options
context:
space:
mode:
authorgatecat <gatecat@ds0.me>2021-12-19 18:46:10 +0000
committerGitHub <noreply@github.com>2021-12-19 18:46:10 +0000
commit62a3e093856063180526b7189d5e711a98036fa0 (patch)
treed03ba5688367cb476a06b19d04ca78d0352afce3 /docs/archapi.md
parent56d550733346000584b9490fac0953fe07124035 (diff)
parentddb084e9a8a0cba10536951236cde824526e8071 (diff)
downloadnextpnr-62a3e093856063180526b7189d5e711a98036fa0.tar.gz
nextpnr-62a3e093856063180526b7189d5e711a98036fa0.tar.bz2
nextpnr-62a3e093856063180526b7189d5e711a98036fa0.zip
Merge pull request #883 from YosysHQ/gatecat/new-predictdelay
archapi: Use arbitrary rather than actual placement in predictDelay [breaking change]
Diffstat (limited to 'docs/archapi.md')
-rw-r--r--docs/archapi.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/archapi.md b/docs/archapi.md
index f2571f08..5034d7d1 100644
--- a/docs/archapi.md
+++ b/docs/archapi.md
@@ -517,7 +517,7 @@ result, and for that estimate it is considered more acceptable to return a
slightly too high result and it is considered less acceptable to return a
too low result (thus "low upper bound").
-### delay\_t predictDelay(const NetInfo \*net\_info, const PortRef &sink) const
+### delay\_t predictDelay(BelId src_bel, IdString src_pin, BelId dst_bel, IdString dst_pin) const
Return a reasonably good estimate for the total `maxDelay()` delay for the
given arc. This should return a low upper bound for the fastest route for that arc.