/* * nextpnr -- Next Generation Place and Route * * Copyright (C) 2018 Claire Xenia Wolf * Copyright (C) 2018 gatecat * * 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. * */ #pragma once #include #include "nextpnr.h" NEXTPNR_NAMESPACE_BEGIN // FastBels is a lookup class that provides a fast lookup for finding BELs // that support a given cell type. struct FastBels { struct TypeData { size_t type_index; int number_of_possible_bels; }; FastBels(Context *ctx, bool check_bel_available, int minBelsForGridPick) : ctx(ctx), check_bel_available(check_bel_available), minBelsForGridPick(minBelsForGridPick) { } void addCellType(IdString cell_type) { auto iter = cell_types.find(cell_type); if (iter != cell_types.end()) { // This cell type has already been added to the fast BEL lookup. return; } size_t type_idx = cell_types.size(); auto &cell_type_data = cell_types[cell_type]; cell_type_data.type_index = type_idx; fast_bels_by_cell_type.resize(type_idx + 1); auto &bel_data = fast_bels_by_cell_type.at(type_idx); NPNR_ASSERT(bel_data.get() == nullptr); bel_data = std::make_unique(); for (auto bel : ctx->getBels()) { if (!ctx->isValidBelForCellType(cell_type, bel)) { continue; } cell_type_data.number_of_possible_bels += 1; } for (auto bel : ctx->getBels()) { if (check_bel_available && !ctx->checkBelAvail(bel)) { continue; } if (!ctx->isValidBelForCellType(cell_type, bel)) { continue; } Loc loc = ctx->getBelLocation(bel); if (minBelsForGridPick >= 0 && cell_type_data.number_of_possible_bels < minBelsForGridPick) { loc.x = loc.y = 0; } if (int(bel_data->size()) < (loc.x + 1)) { bel_data->resize(loc.x + 1); } if (int(bel_data->at(loc.x).size()) < (loc.y + 1)) { bel_data->at(loc.x).resize(loc.y + 1); } bel_data->at(loc.x).at(loc.y).push_back(bel); } } void addBelBucket(BelBucketId partition) { auto iter = partition_types.find(partition); if (iter != partition_types.end()) { // This partition has already been added to the fast BEL lookup. return; } size_t type_idx = partition_types.size(); auto &type_data = partition_types[partition]; type_data.type_index = type_idx; fast_bels_by_partition_type.resize(type_idx + 1); auto &bel_data = fast_bels_by_partition_type.at(type_idx); NPNR_ASSERT(bel_data.get() == nullptr); bel_data = std::make_unique(); for (auto bel : ctx->getBels()) { if (ctx->getBelBucketForBel(bel) != partition) { continue; } type_data.number_of_possible_bels += 1; } for (auto bel : ctx->getBels()) { if (check_bel_available && !ctx->checkBelAvail(bel)) { continue; } if (ctx->getBelBucketForBel(bel) != partition) { continue; } Loc loc = ctx->getBelLocation(bel); if (minBelsForGridPick >= 0 && type_data.number_of_possible_bels < minBelsForGridPick) { loc.x = loc.y = 0; } if (int(bel_data->size()) < (loc.x + 1)) { bel_data->resize(loc.x + 1); } if (int(bel_data->at(loc.x).size()) < (loc.y + 1)) { bel_data->at(loc.x).resize(loc.y + 1); } bel_data->at(loc.x).at(loc.y).push_back(bel); } } typedef std::vector>> FastBelsData; int getBelsForCellType(IdString cell_type, FastBelsData **data) { auto iter = cell_types.find(cell_type); if (iter == cell_types.end()) { addCellType(cell_type); iter = cell_types.find(cell_type); NPNR_ASSERT(iter != cell_types.end()); } auto cell_type_data = iter->second; *data = fast_bels_by_cell_type.at(cell_type_data.type_index).get(); return cell_type_data.number_of_possible_bels; } size_t getBelsForBelBucket(BelBucketId partition, FastBelsData **data) { auto iter = partition_types.find(partition); if (iter == partition_types.end()) { addBelBucket(partition); iter = partition_types.find(partition); NPNR_ASSERT(iter != partition_types.end()); } auto type_data = iter->second; *data = fast_bels_by_partition_type.at(type_data.type_index).get(); return type_data.number_of_possible_bels; } Context *ctx; const bool check_bel_available; const int minBelsForGridPick; dict cell_types; std::vector> fast_bels_by_cell_type; dict partition_types; std::vector> fast_bels_by_partition_type; }; NEXTPNR_NAMESPACE_END 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338