routing.h

Go to the documentation of this file.

//===================================================================//
// Universal GRAaph Minor Mapping (UGRAMM) method for CGRA           //
// file : routing.h                                                  //
// description: contains variables and function declaration related  //
//              to routing.                                          //
//===================================================================//
 
#ifndef ROUTING_H
#define ROUTING_H
 
#include <boost/config.hpp>
#include <iostream>
#include <fstream>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/algorithm/string.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/graph/copy.hpp>
#include <queue>
#include <map>
#include <list>
#include <bitset>
#include <algorithm>
#include <boost/algorithm/string.hpp>
 
//-------------------------------------------------------------------//
//------------------- [Routing] Helper function ---------------------//
//-------------------------------------------------------------------//
 
bool matchesPattern(const std::string& key, const std::string& gName, const std::string& lockName);
 
void findGNodeID_FuncCell(const std::string &lockedNodeName, std::vector<int> &suitableGIDs);
 
int findFuncCellFromOutputPin(int signal, DirectedGraph *G);
 
int findOutputPinFromFuncCell(int signal, DirectedGraph *G);
 
int findRoot(int signal, std::map<int, NodeConfig> *gConfig);
 
int getSignalCost(int signal);
 
bool hasOverlap(int signal);
 
int totalUsed(DirectedGraph *G);
 
int totalOveruse(DirectedGraph *G);
 
void adjustHistoryCosts(DirectedGraph *G);
 
int cmpfunc(const void *a, const void *b);
 
void sortList(int list[], int n, std::map<int, NodeConfig> *hConfig);
 
//-------------------------------------------------------------------//
//-------------------- [Routing] Main function ----------------------//
//-------------------------------------------------------------------//
 
void ripup(int signal, std::list<int> *nodes);
 
void ripUpRouting(int signal, DirectedGraph *G);
 
void depositRoute(int signal, std::list<int> *nodes);
 
 
float calculate_cost (int next);
 
int route(DirectedGraph *G, int signal, std::set<int> sink, std::list<int> *route, std::map<int, NodeConfig> *gConfig, std::map<int, NodeConfig> *hConfig);
 
int routeSignal(DirectedGraph *G, DirectedGraph *H, int y, std::map<int, NodeConfig> *gConfig, std::map<int, NodeConfig> *hConfig);
 
#endif