ASIC place & route framework. This crate contains interface definitions of the core parts of the place & route flow.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

49 lines
1.5 KiB

/*
* Copyright (c) 2020-2021 Thomas Kramer.
*
* This file is part of LibrEDA
* (see https://codeberg.org/libreda).
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
//! Basic trait for a router.
// use crate::db;
// use db::L2NEdit;
//
// use std::collections::HashMap;
//
// /// Basic trait for a router.
// pub trait Router<LN: L2NEdit> {
// /// Get the name of the routing engine.
// fn name(&self) -> &str;
//
// /// Routing algorithm implementation.
// fn route_impl(&self,
// chip: &mut LN,
// top_cell: LN::CellId,
// nets: &Vec<LN::NetId>,
// ) ;
//
// /// Wrapper around `route_impl()`.
// /// Does some sanity checks before and after.
// fn route(&self,
// chip: &mut LN,
// top_cell: LN::CellId,
// nets: &Vec<LN::NetId>,
// ) {
// self.route_impl(chip, top_cell, nets)
// }
// }