eu.mihosoft.freerouting.autoroute.AutorouteEngine Maven / Gradle / Ivy
The newest version!
/*
* Copyright (C) 2014 Alfons Wirtz
* website www.freerouting.net
*
* Copyright (C) 2017 Michael Hoffer
* Website www.freerouting.mihosoft.eu
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU 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 General Public License at rooms_to_remove = new LinkedList();
for (CompleteFreeSpaceExpansionRoom curr_room : complete_expansion_rooms)
{
if (curr_room.is_net_dependent())
{
rooms_to_remove.add(curr_room);
}
}
for (CompleteFreeSpaceExpansionRoom curr_room : rooms_to_remove)
{
this.remove_complete_expansion_room(curr_room);
}
}
// invalidate the neighbour rooms of the items of p_net_no
Collection- item_list = this.board.get_items();
for (Item curr_item : item_list)
{
if (curr_item.contains_net(p_net_no))
{
this.board.additional_update_after_change(curr_item);
}
}
}
}
this.net_no = p_net_no;
this.stoppable_thread = p_stoppable_thread;
this.time_limit = p_time_limit;
}
/* Autoroutes a connection between p_start_set and p_dest_set.
* Returns ALREADY_CONNECTED, ROUTED, NOT_ROUTED, or INSERT_ERROR.
*/
public AutorouteResult autoroute_connection(Set
- p_start_set, Set
- p_dest_set,
AutorouteControl p_ctrl, SortedSet
- p_ripped_item_list)
{
MazeSearchAlgo maze_search_algo;
try
{
maze_search_algo = MazeSearchAlgo.get_instance(p_start_set, p_dest_set, this, p_ctrl);
} catch (Exception e)
{
System.out.println("AutorouteEngine.autoroute_connection: Exception in MazeSearchAlgo.get_instance");
System.out.println(e);
maze_search_algo = null;
}
MazeSearchAlgo.Result search_result = null;
if (maze_search_algo != null)
{
try
{
search_result = maze_search_algo.find_connection();
} catch (Exception e)
{
System.out.println("AutorouteEngine.autoroute_connection: Exception in maze_search_algo.find_connection");
}
}
LocateFoundConnectionAlgo autoroute_result = null;
if (search_result != null)
{
try
{
autoroute_result =
LocateFoundConnectionAlgo.get_instance(search_result, p_ctrl, this.autoroute_search_tree,
board.rules.get_trace_angle_restriction(), p_ripped_item_list, board.get_test_level());
} catch (Exception e)
{
System.out.println("AutorouteEngine.autoroute_connection: Exception in LocateFoundConnectionAlgo.get_instance");
}
}
if (!this.maintain_database)
{
this.clear();
}
else
{
this.reset_all_doors();
}
if (autoroute_result == null)
{
return AutorouteResult.NOT_ROUTED;
}
if (autoroute_result.connection_items == null)
{
if (this.board.get_test_level().ordinal() >= TestLevel.CRITICAL_DEBUGGING_OUTPUT.ordinal())
{
System.out.println("AutorouteEngine.autoroute_connection: result_items != null expected");
}
return AutorouteResult.ALREADY_CONNECTED;
}
// Delete the ripped connections.
SortedSet
- ripped_connections = new TreeSet
- ();
Set
changed_nets = new TreeSet();
Item.StopConnectionOption stop_connection_option;
if (p_ctrl.remove_unconnected_vias)
{
stop_connection_option = Item.StopConnectionOption.NONE;
}
else
{
stop_connection_option = Item.StopConnectionOption.FANOUT_VIA;
}
for (Item curr_ripped_item : p_ripped_item_list)
{
ripped_connections.addAll(curr_ripped_item.get_connection_items(stop_connection_option));
for (int i = 0; i < curr_ripped_item.net_count(); ++i)
{
changed_nets.add(curr_ripped_item.get_net_no(i));
}
}
// let the observers know the changes in the eu.mihosoft.freerouting.board database.
boolean observers_activated = !this.board.observers_active();
if (observers_activated)
{
this.board.start_notify_observers();
}
board.remove_items(ripped_connections, false);
for (int curr_net_no : changed_nets)
{
this.board.remove_trace_tails(curr_net_no, stop_connection_option);
}
InsertFoundConnectionAlgo insert_found_connection_algo =
InsertFoundConnectionAlgo.get_instance(autoroute_result, board, p_ctrl);
if (observers_activated)
{
this.board.end_notify_observers();
}
if (insert_found_connection_algo == null)
{
return AutorouteResult.INSERT_ERROR;
}
return AutorouteResult.ROUTED;
}
/**
* Returns the net number of the current connection to route.
*/
public int get_net_no()
{
return this.net_no;
}
/**
* Returns if the user has stopped the autorouter.
*/
public boolean is_stop_requested()
{
if (this.time_limit != null)
{
if (this.time_limit.limit_exceeded())
{
return true;
}
}
if (this.stoppable_thread == null)
{
return false;
}
return this.stoppable_thread.is_stop_requested();
}
/**
* Clears all temporary data
*/
public void clear()
{
if (complete_expansion_rooms != null)
{
for (CompleteFreeSpaceExpansionRoom curr_room : complete_expansion_rooms)
{
curr_room.remove_from_tree(this.autoroute_search_tree);
}
}
complete_expansion_rooms = null;
incomplete_expansion_rooms = null;
expansion_room_instance_count = 0;
board.clear_all_item_temporary_autoroute_data();
}
/**
* Draws the shapes of the expansion rooms created so far.
*/
public void draw(java.awt.Graphics p_graphics, eu.mihosoft.freerouting.boardgraphics.GraphicsContext p_graphics_context, double p_intensity)
{
if (complete_expansion_rooms == null)
{
return;
}
for (CompleteFreeSpaceExpansionRoom curr_room : complete_expansion_rooms)
{
curr_room.draw(p_graphics, p_graphics_context, p_intensity);
}
Collection- item_list = this.board.get_items();
for (Item curr_item : item_list)
{
ItemAutorouteInfo autoroute_info = curr_item.get_autoroute_info();
if (autoroute_info != null)
{
autoroute_info.draw(p_graphics, p_graphics_context, p_intensity);
}
}
// this.drill_page_array.draw(p_graphics, p_graphics_context, p_intensity);
}
/**
* Creates a new FreeSpaceExpansionRoom and adds it to the room list.
* Its shape is normally unbounded at construction time of the room.
* The final (completed) shape will be a subshape of the start shape, which
* does not overlap with any obstacle, and it is as big as possible.
* p_contained_points will remain contained in the shape, after it is completed.
*/
public IncompleteFreeSpaceExpansionRoom add_incomplete_expansion_room(TileShape p_shape, int p_layer, TileShape p_contained_shape)
{
IncompleteFreeSpaceExpansionRoom new_room = new IncompleteFreeSpaceExpansionRoom(p_shape, p_layer, p_contained_shape);
if (this.incomplete_expansion_rooms == null)
{
this.incomplete_expansion_rooms = new LinkedList
();
}
this.incomplete_expansion_rooms.add(new_room);
return new_room;
}
/**
* Returns the first elemment in the list of incomplete expansion rooms or null, if the list is empty.
*/
public IncompleteFreeSpaceExpansionRoom get_first_incomplete_expansion_room()
{
if (incomplete_expansion_rooms == null)
{
return null;
}
if (incomplete_expansion_rooms.isEmpty())
{
return null;
}
Iterator it = incomplete_expansion_rooms.iterator();
return it.next();
}
/**
* Removes an incomplete room from the database.
*/
public void remove_incomplete_expansion_room(IncompleteFreeSpaceExpansionRoom p_room)
{
this.remove_all_doors(p_room);
incomplete_expansion_rooms.remove(p_room);
}
/**
* Removes a complete expansion room from the database and creates
* new incomplete expansion rooms for the neighbours.
*/
public void remove_complete_expansion_room(CompleteFreeSpaceExpansionRoom p_room)
{
// create new incomplete expansion rooms for all neighbours
TileShape room_shape = p_room.get_shape();
int room_layer = p_room.get_layer();
Collection room_doors = p_room.get_doors();
for (ExpansionDoor curr_door : room_doors)
{
ExpansionRoom curr_neighbour = curr_door.other_room(p_room);
if (curr_neighbour != null)
{
curr_neighbour.remove_door(curr_door);
TileShape neighbour_shape = curr_neighbour.get_shape();
TileShape intersection = room_shape.intersection(neighbour_shape);
if (intersection.dimension() == 1)
{
// add a new incomplete room to curr_neighbour.
int[] touching_sides = room_shape.touching_sides(neighbour_shape);
Line[] line_arr = new Line[1];
line_arr[0] = neighbour_shape.border_line(touching_sides[1]).opposite();
Simplex new_incomplete_room_shape = Simplex.get_instance(line_arr);
IncompleteFreeSpaceExpansionRoom new_incomplete_room =
add_incomplete_expansion_room(new_incomplete_room_shape, room_layer, intersection);
ExpansionDoor new_door = new ExpansionDoor(curr_neighbour, new_incomplete_room, 1);
curr_neighbour.add_door(new_door);
new_incomplete_room.add_door(new_door);
}
}
}
this.remove_all_doors(p_room);
p_room.remove_from_tree(this.autoroute_search_tree);
if (complete_expansion_rooms != null)
{
complete_expansion_rooms.remove(p_room);
}
else
{
System.out.println("AutorouteEngine.remove_complete_expansion_room: this.complete_expansion_rooms is null");
}
this.drill_page_array.invalidate(room_shape);
}
/**
* Completes the shape of p_room.
* Returns the resulting rooms after completing the shape.
* p_room will no more exist after this function.
*/
public Collection complete_expansion_room(IncompleteFreeSpaceExpansionRoom p_room)
{
try
{
Collection result = new LinkedList();
TileShape from_door_shape = null;
SearchTreeObject ignore_object = null;
Collection room_doors = p_room.get_doors();
for (ExpansionDoor curr_door : room_doors)
{
ExpansionRoom other_room = curr_door.other_room(p_room);
if (other_room instanceof CompleteFreeSpaceExpansionRoom && curr_door.dimension == 2)
{
from_door_shape = curr_door.get_shape();
ignore_object = (CompleteFreeSpaceExpansionRoom) other_room;
break;
}
}
Collection completed_shapes =
this.autoroute_search_tree.complete_shape(p_room, this.net_no, ignore_object, from_door_shape);
this.remove_incomplete_expansion_room(p_room);
Iterator it = completed_shapes.iterator();
boolean is_first_completed_room = true;
while (it.hasNext())
{
IncompleteFreeSpaceExpansionRoom curr_incomplete_room = it.next();
if (curr_incomplete_room.get_shape().dimension() != 2)
{
continue;
}
if (is_first_completed_room)
{
is_first_completed_room = false;
CompleteFreeSpaceExpansionRoom completed_room = this.add_complete_room(curr_incomplete_room);
if (completed_room != null)
{
result.add(completed_room);
}
}
else
{
// the shape of the first completed room may have changed and may
// intersect now with the other shapes. Therefore the completed shapes
// have to be recalculated.
Collection curr_completed_shapes =
this.autoroute_search_tree.complete_shape(curr_incomplete_room, this.net_no,
ignore_object, from_door_shape);
Iterator it2 = curr_completed_shapes.iterator();
while (it2.hasNext())
{
IncompleteFreeSpaceExpansionRoom tmp_room = it2.next();
CompleteFreeSpaceExpansionRoom completed_room = this.add_complete_room(tmp_room);
if (completed_room != null)
{
result.add(completed_room);
}
}
}
}
return result;
} catch (Exception e)
{
System.out.print("AutorouteEngine.complete_expansion_room: ");
System.out.println(e);
return new LinkedList();
}
}
/**
* Calculates the doors and adds the completed room to the room database.
*/
private CompleteFreeSpaceExpansionRoom add_complete_room(IncompleteFreeSpaceExpansionRoom p_room)
{
CompleteFreeSpaceExpansionRoom completed_room = (CompleteFreeSpaceExpansionRoom) calculate_doors(p_room);
CompleteFreeSpaceExpansionRoom result;
if (completed_room != null && completed_room.get_shape().dimension() == 2)
{
if (complete_expansion_rooms == null)
{
complete_expansion_rooms = new LinkedList();
}
complete_expansion_rooms.add(completed_room);
this.autoroute_search_tree.insert(completed_room);
result = completed_room;
}
else
{
result = null;
}
return result;
}
/**
* Calculates the neighbours of p_room and inserts doors to
* the new created neighbour rooms.
* The shape of the result room may be different to the shape of p_room
*/
private CompleteExpansionRoom calculate_doors(ExpansionRoom p_room)
{
CompleteExpansionRoom result;
if (this.autoroute_search_tree instanceof ShapeSearchTree90Degree)
{
result = SortedOrthogonalRoomNeighbours.calculate(p_room, this);
}
else if (this.autoroute_search_tree instanceof ShapeSearchTree45Degree)
{
result = Sorted45DegreeRoomNeighbours.calculate(p_room, this);
}
else
{
result = SortedRoomNeighbours.calculate(p_room, this);
}
return result;
}
/** Completes the shapes of the neigbour rooms of p_room, so that the
* doors of p_room will not change later on.
*/
public void complete_neigbour_rooms(CompleteExpansionRoom p_room)
{
if (p_room.get_doors() == null)
{
return;
}
Iterator it = p_room.get_doors().iterator();
while (it.hasNext())
{
ExpansionDoor curr_door = it.next();
// cast to ExpansionRoom becaus ExpansionDoor.other_room works differently with
// parameter type CompleteExpansionRoom.
ExpansionRoom neighbour_room = curr_door.other_room((ExpansionRoom) p_room);
if (neighbour_room != null)
{
if (neighbour_room instanceof IncompleteFreeSpaceExpansionRoom)
{
this.complete_expansion_room((IncompleteFreeSpaceExpansionRoom) neighbour_room);
// restart reading because the doors have changed
it = p_room.get_doors().iterator();
}
else if (neighbour_room instanceof ObstacleExpansionRoom)
{
ObstacleExpansionRoom obstacle_neighbour_room = (ObstacleExpansionRoom) neighbour_room;
if (!obstacle_neighbour_room.all_doors_calculated())
{
this.calculate_doors(obstacle_neighbour_room);
obstacle_neighbour_room.set_doors_calculated(true);
}
}
}
}
}
/**
* Invalidates all drill pages intersecting with p_shape, so the they must be recalculated at the next
* call of get_ddrills()
*/
public void invalidate_drill_pages(TileShape p_shape)
{
this.drill_page_array.invalidate(p_shape);
}
/**
* Removes all doors from p_room
*/
void remove_all_doors(ExpansionRoom p_room)
{
Iterator it = p_room.get_doors().iterator();
while (it.hasNext())
{
ExpansionDoor curr_door = it.next();
ExpansionRoom other_room = curr_door.other_room(p_room);
if (other_room != null)
{
other_room.remove_door(curr_door);
if (other_room instanceof IncompleteFreeSpaceExpansionRoom)
{
this.remove_incomplete_expansion_room((IncompleteFreeSpaceExpansionRoom) other_room);
}
}
}
p_room.clear_doors();
}
/**
* Returns all complete free space expansion rooms with a target door to an item in the set p_items.
*/
Set get_rooms_with_target_items(Set- p_items)
{
Set
result = new TreeSet();
if (this.complete_expansion_rooms != null)
{
for (CompleteFreeSpaceExpansionRoom curr_room : this.complete_expansion_rooms)
{
Collection target_door_list = curr_room.get_target_doors();
for (TargetItemExpansionDoor curr_target_door : target_door_list)
{
Item curr_target_item = curr_target_door.item;
if (p_items.contains(curr_target_item))
{
result.add(curr_room);
}
}
}
}
return result;
}
/**
* Checks, if the internal datastructure is valid.
*/
public boolean validate()
{
if (complete_expansion_rooms == null)
{
return true;
}
boolean result = true;
for (CompleteFreeSpaceExpansionRoom curr_room : complete_expansion_rooms)
{
if (!curr_room.validate(this))
{
result = false;
}
}
return result;
}
/**
* Reset all doors for autorouting the next connnection, in case the autorouting database is retained.
*/
private void reset_all_doors()
{
if (this.complete_expansion_rooms != null)
{
for (ExpansionRoom curr_room : this.complete_expansion_rooms)
{
curr_room.reset_doors();
}
}
Collection- item_list = this.board.get_items();
for (Item curr_item : item_list)
{
ItemAutorouteInfo curr_autoroute_info = curr_item.get_autoroute_info_pur();
if (curr_autoroute_info != null)
{
curr_autoroute_info.reset_doors();
curr_autoroute_info.set_precalculated_connection(null);
}
}
this.drill_page_array.reset();
}
protected int generate_room_id_no()
{
++expansion_room_instance_count;
return expansion_room_instance_count;
}
/**
* The current search tree used in autorouting.
* It depends on the trac clearance class used in the eu.mihosoft.freerouting.autoroute algorithm.
*/
public final ShapeSearchTree autoroute_search_tree;
/** If maintain_database, the autorouter database is maintained after a connection is
* completed for performance reasons.
*/
public final boolean maintain_database;
static final int TRACE_WIDTH_TOLERANCE = 2;
/**
* The net number used for routing in this eu.mihosoft.freerouting.autoroute algorithm.
*/
private int net_no;
/**
* The 2-dimensional array of rectangular pages of ExpansionDrills
*/
final DrillPageArray drill_page_array;
/**
* To be able to stop the expansion algorithm.
*/
Stoppable stoppable_thread;
/**
* To stop the expansion algorithm after a time limit is exceeded.
*/
private TimeLimit time_limit;
/** The PCB-eu.mihosoft.freerouting.board of this eu.mihosoft.freerouting.autoroute algorithm. */
final RoutingBoard board;
/** The list of incomplete expansion rooms on the routing eu.mihosoft.freerouting.board */
private List
incomplete_expansion_rooms = null;
/** The list of complete expansion rooms on the routing eu.mihosoft.freerouting.board */
private List complete_expansion_rooms = null;
/** The count of expansion rooms created so far */
private int expansion_room_instance_count = 0;
/**
* The pussible results of autorouting a connection
*/
public enum AutorouteResult
{
ALREADY_CONNECTED, ROUTED, NOT_ROUTED, INSERT_ERROR
}
}