Routing/router.h at master · LaurabelleKay/Routing · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#ifndef R_H
#define R_H

#include "common.h"
using namespace ::std;

void gridToGraph(Point **points, int *graph, int gridx, int gridy);
void ripUpReroute(
    int numWires,
    int *graph,
    int gridx,
    int gridy,
    vector<int> unsuccessful,
    Wire *W,
    vector<vector<pair<int, int>>> edges,
    vector<int> &reRoute,
    vector<BoundingBox> BB,
    vector<vector<int>> &dependencyList,
    int *numSuccessful);

int LM(
    int *graph,
    int gridx,
    int gridy,
    int rTop,
    int rBottom,
    int rRight,
    int rLeft,
    int srcx,
    int srcy,
    int snkx,
    int snky,
    int wire,
    int edgeIndex);

int expand(int rTop, int rBottom, int rRight, int rLeft, int numWires, int wireIndex, int *graph, int gridx, int gridy);
void ripUp(int wireIndex, int numPins, int **pins, int *graph, int gridx, int gridy);

void schedule(
    Point **points,
    Wire *W,
    vector<vector<pair<int, int>>> edges,
    vector<vector<int>> dependencyList,
    vector<int> routeList,
    vector<BoundingBox> BB,
    int gridx,
    int gridy,
    int numEdges,
    int numWires);

void sequentialSchedule(
    Point **points,
    Wire *W,
    vector<vector<pair<int, int>>> edges,
    vector<vector<int>> dependencyList,
    vector<int> routeList,
    vector<BoundingBox> BB,
    int gridx,
    int gridy,
    int numEdges,
    int numWires);

#endif