2019-01-11 00:42:29 +08:00
|
|
|
/*
|
|
|
|
|
* nextpnr -- Next Generation Place and Route
|
|
|
|
|
*
|
|
|
|
|
* Copyright (C) 2019 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.
|
|
|
|
|
*
|
|
|
|
|
* [[cite]] HeAP
|
|
|
|
|
* Analytical Placement for Heterogeneous FPGAs, Marcel Gort and Jason H. Anderson
|
|
|
|
|
* https://janders.eecg.utoronto.ca/pdfs/marcelfpl12.pdf
|
|
|
|
|
*
|
|
|
|
|
* [[cite]] SimPL
|
|
|
|
|
* SimPL: An Effective Placement Algorithm, Myung-Chul Kim, Dong-Jin Lee and Igor L. Markov
|
|
|
|
|
* http://www.ece.umich.edu/cse/awards/pdfs/iccad10-simpl.pdf
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef PLACER_HEAP_H
|
2019-03-26 03:32:58 +08:00
|
|
|
#define PLACER_HEAP_H
|
2019-06-15 19:09:49 +08:00
|
|
|
#include "log.h"
|
2019-06-26 00:19:25 +08:00
|
|
|
#include "nextpnr.h"
|
2019-01-11 00:42:29 +08:00
|
|
|
|
|
|
|
|
NEXTPNR_NAMESPACE_BEGIN
|
2019-02-25 20:48:01 +08:00
|
|
|
|
2019-06-15 19:09:49 +08:00
|
|
|
struct PlacerHeapCfg
|
2019-02-25 20:48:01 +08:00
|
|
|
{
|
|
|
|
|
PlacerHeapCfg(Context *ctx);
|
|
|
|
|
|
2020-02-02 23:45:01 +08:00
|
|
|
float alpha, beta;
|
2019-02-25 20:48:01 +08:00
|
|
|
float criticalityExponent;
|
|
|
|
|
float timingWeight;
|
2019-06-28 19:43:55 +08:00
|
|
|
bool timing_driven;
|
2020-02-02 23:28:11 +08:00
|
|
|
float solverTolerance;
|
2020-02-02 23:40:23 +08:00
|
|
|
bool placeAllAtOnce;
|
2019-02-25 20:48:01 +08:00
|
|
|
|
2020-02-02 23:52:28 +08:00
|
|
|
int hpwl_scale_x, hpwl_scale_y;
|
|
|
|
|
int spread_scale_x, spread_scale_y;
|
|
|
|
|
|
2020-02-02 23:40:23 +08:00
|
|
|
// These cell types will be randomly locked to prevent singular matrices
|
2019-02-25 20:48:01 +08:00
|
|
|
std::unordered_set<IdString> ioBufTypes;
|
2020-02-02 23:40:23 +08:00
|
|
|
// These cell types are part of the same unit (e.g. slices split into
|
|
|
|
|
// components) so will always be spread together
|
|
|
|
|
std::vector<std::unordered_set<IdString>> cellGroups;
|
2019-02-25 20:48:01 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
extern bool placer_heap(Context *ctx, PlacerHeapCfg cfg);
|
2019-01-11 00:42:29 +08:00
|
|
|
NEXTPNR_NAMESPACE_END
|
2019-03-25 20:41:25 +08:00
|
|
|
#endif
|
