upload router w/o ap_uint

router_w_o_ap/Makefile

+TARGET = sim
+OBJS = $(CPPS:.cpp=.o)
+CPPS = $(wildcard *.cpp)
+CXX = g++
+CXXFLAGS = -O3
+
+all: $(TARGET)
+
+$(TARGET): $(OBJS)
+	$(CXX) -o $@ $(OBJS)
+
+clean:
+	rm *.o
+	rm $(TARGET)

router_w_o_ap/README.md

+# Basic router
+* A*ベースの配線プログラム
+* 入力
+  * 盤面サイズ(size_x, size_y)
+  * ライン数(line_num)
+  * 盤面情報(size_x$`\times`$size_yの盤面に整数を割り当て，自然数: ライン端点，-1: 配線禁止領域, 0: 配線領域)
+* 出力
+  * status(自然数: 配線成功，0: 配線失敗)，配線成功時のstatusは総配線長を表す
+  * 配線結果
+* routerに渡す盤面情報，routerから返される配線結果は1次元配列(入力が2次元配列の場合，変換が必要)
+* ハードウェア化に備えて余計な型やヘッダファイルを含むが，その辺はご了承願いたい...
+
+### Change log
+* 2019.07.16
+  * 端点の隣接判定に関するバグを修正
+  * 端点を結ぶパスが存在しないときにプログラムが停止するバグを修正
+  * 配線成功時のstatusを総配線長に変更
+
+### 関数呼び出し
+* 関数routerの呼び出し方法は以下のサンプルコードの通り
+* routerの第5引数はシード値で指定は任意(default=12345)
+
+```
+short int size_x = 10, size_y = 10;
+short int line_num = 6;
+short int board[10][10], board_str[100];
+
+/* ここで盤面情報を設定 */
+
+// Transform "board" to "board_str"
+for(int y = 0; y < size_y; y++) {
+	for(int x = 0; x < size_x; x++) {
+		int idx = y * size_x + x;
+		board_str[idx] = board[y][x];
+	}
+}
+
+int status = router(size_x, size_y, line_num, board_str, 1234567);
+
+// Transform "board_str" to "board"
+for(int y = 0; y < size_y; y++) {
+	for(int x = 0; x < size_x; x++) {
+		int idx = y * size_x + x;
+		board[y][x] = board_str[idx];
+	}
+}
+```
+
+### 必要ファイル
+* router.cpp
+* router.hpp
+* ap_int.h
+* etc/ap_fixed_sim.h
+* etc/ap_int_sim.h
+* etc/ap_private.h
+
+### パラメタ
+* router.hpp上部で以下を設定可能
+
+|定数名|説明|
+|:---|:---|
+|ROUND_LIMIT|引きはがし再配線回数の上限(default: 32768, Max: 65534)，小さいほど諦めが早い|
+|PRINT_BOARD|配線前と配線後の盤面を表示(コメントアウトで非表示)|
+|PRINT_SEARCH|配線の途中経過をすべて表示(コメントアウトで非表示)|

router_w_o_ap/main.cpp

+#include "router.hpp"
+
+int main(int argc, char *argv[]){
+	
+	short int size_x = 10, size_y = 10;
+	short int line_num = 6;
+	
+	short int board[10][10], board_str[100];
+	
+	int x, y;
+	for(y = 0; y < size_y; y++) {
+		for(x = 0; x < size_x; x ++) {
+			board[y][x] = 0;
+		}
+	}
+	
+	// Terminal cells (value > 0)
+	board[0][1] = 1;
+	board[7][1] = 1;
+	board[0][3] = 2;
+	board[8][4] = 2;
+	board[4][5] = 3;
+	board[6][5] = 3;
+	board[4][6] = 4;
+	board[7][2] = 4;
+	board[5][4] = 5;
+	board[6][6] = 5;
+	board[9][8] = 6;
+	board[9][9] = 6;
+	
+	// Routing disenabled cells (value < 0)
+	board[0][0] = -1;
+	board[1][7] = -1;
+	board[1][8] = -1;
+	board[2][1] = -1;
+	board[2][7] = -1;
+	board[2][8] = -1;
+	board[3][1] = -1;
+	board[4][1] = -1;
+	board[5][1] = -1;
+	
+	// Transform "board" to "board_str"
+	for(y = 0; y < size_y; y++) {
+		for(x = 0; x < size_x; x++) {
+			int idx = y * size_x + x;
+			board_str[idx] = board[y][x];
+		}
+	}
+	
+	/** top function of router **/
+	// status = 1: OK
+	// status = 0: NG
+	int status = router(size_x, size_y, line_num, board_str);
+	
+	/** top function of router (User can set "seed" value manually when calling this function.) **/
+	//int status = router(size_x, size_y, line_num, board_str, 1234567);
+	
+	cout << "Router status: " << status << endl;
+	
+	// Transform "board_str" to "board"
+	for(y = 0; y < size_y; y++) {
+		for(x = 0; x < size_x; x++) {
+			int idx = y * size_x + x;
+			board[y][x] = board_str[idx];
+		}
+	}
+	
+	return 0;
+}

router_w_o_ap/router.cpp

+#include "router.hpp"
+
+// DATA_BIT: bit length of cell idx
+// PRIO_BIT: bit length of cost(priority)
+int router(short int size_x, short int size_y, short int line_num, short int board_str[], unsigned int seed){
+	
+	unsigned short int board_str_len = size_x * size_y;
+	unsigned short int j;
+	
+	unsigned short int terminals[MAX_LINES][2];
+	short int paths_size[MAX_LINES];
+	unsigned short int paths[MAX_LINES][MAX_PATH];
+	bool adjacents[MAX_LINES];
+	
+	unsigned short int weights[MAX_CELLS];
+	
+	short int i, x, y, p;
+	
+	// Line init.
+	for(i = 0; i < line_num; i++) {
+		terminals[i][0] = DATA_MAX;
+		terminals[i][1] = DATA_MAX;
+		paths_size[i] = 0;
+		adjacents[i] = false;
+	}
+	for(j = 0; j < board_str_len; j++) {
+		weights[j] = 1; // init. value is "1"
+		i = board_str[j];
+		if(i > 0) {
+			if(terminals[i-1][0] == DATA_MAX) { terminals[i-1][0] = j; }
+			else if(terminals[i-1][1] == DATA_MAX) { terminals[i-1][1] = j; }
+			else {
+				cout << "Error: line#" << i << endl;
+				exit(1);
+			}
+			weights[j] = PRIO_MAX;
+		}
+		else if(i < 0) {
+			weights[j] = PRIO_MAX;
+		}
+	}
+	
+#ifdef PRINT_BOARD
+	cout << "== Print board ==" << endl;
+	for(y = 0; y < size_y; y++) {
+		for(x = 0; x < size_x; x++) {
+			j = y * size_x + x;
+			i = board_str[j];
+			if(i == 0) { cout << "-"; }
+			else if(i == -1) { cout << "X"; }
+			else{ cout << i; }
+			if(x != size_x-1) { cout << " "; }
+		}
+		cout << endl;
+	}
+#endif
+	for(i = 0; i < line_num; i++) {
+		unsigned short int t1 = terminals[i][0];
+		unsigned short int t2 = terminals[i][1];
+		short int t1_x = t1 % size_x;
+		short int t1_y = t1 / size_x;
+		short int t2_x = t2 % size_x;
+		short int t2_y = t2 / size_x;
+		short int dist = abs(t1_x - t2_x) + abs(t1_y - t2_y); // Manhattan dist.
+		if(dist == 1) {
+			adjacents[i] = true;
+#ifdef PRINT_BOARD
+			cout << "Line #" << i + 1 << " needs no routing" << endl;
+#endif
+		}
+	}
+	
+	
+	lfsr_random_init(seed);
+	
+	// Step 1
+	cout << "1st routing ..." << endl;
+	for(i = 0; i < line_num; i++) {
+		if(adjacents[i]) continue;
+#ifdef PRINT_SEARCH
+		cout << "Line #" << i + 1 << endl;
+#endif
+		unsigned short int t1 = terminals[i][0];
+		unsigned short int t2 = terminals[i][1];
+		weights[t1] = 1;
+		if(search(size_x, size_y, &paths_size[i], paths[i], t1, t2, weights) < 0) { return 0; }
+		weights[t1] = PRIO_MAX;
+	}
+	
+	bool has_overlap;
+	unsigned char overlap_checks[MAX_CELLS];
+	
+	// Step 2
+	cout << "rip-up routing ..." << endl;
+	short int last_target = -1;
+	unsigned short int round;
+	for(round = 1; round <= ROUND_LIMIT; round++) {
+		short int target = lfsr_random() % line_num;
+		if(adjacents[target]) continue;
+		if(target == last_target) continue;
+		last_target = target;
+		unsigned short int round_weight = new_weight(round);
+
+#ifdef PRINT_SEARCH		
+		cout << "Line #" << target + 1 << "(round: " << round << ", weight: " << round_weight << ")" << endl;
+#endif
+		
+		unsigned short int t1 = terminals[target][0];
+		unsigned short int t2 = terminals[target][1];
+		
+		for(p = 0; p < paths_size[target]; p++) {
+			weights[paths[target][p]] = 1;
+		}
+		for(i = 0; i < line_num; i++) {
+			if(i == target) continue;
+			for(p = 0; p < paths_size[i]; p++) {
+				weights[paths[i][p]] = round_weight;
+			}
+		}
+		weights[t1] = 1;
+		search(size_x, size_y, &paths_size[target], paths[target], t1, t2, weights);
+		weights[t1] = PRIO_MAX;
+		
+		has_overlap = false;
+		for(j = 0; j < board_str_len; j++) {
+			i = board_str[j];
+			if(i > 0 || i < 0) { overlap_checks[j] = 1; }
+			else { overlap_checks[j] = 0; }
+		}
+		for(i = 0; i < line_num; i++) {
+			for(p = 0; p < paths_size[i]; p++) {
+				unsigned short int cell_id = paths[i][p];
+				if(overlap_checks[cell_id] > 0) {
+					has_overlap = true;
+					break;
+				}
+				overlap_checks[cell_id] = 1;
+			}
+		}
+		if(!has_overlap) break;
+	}
+	
+	/** //debug
+	for(j = 0; j < board_str_len; j++) {
+		i = board_str[j];
+		cout << i << ": " << weights[j] << endl;
+	}
+	**/
+	
+	if(has_overlap) { // Cannot solve
+		return 0;
+	}
+	
+	int total_wire_length = 0;
+	for(i = 0; i < line_num; i++) {
+		total_wire_length += paths_size[i];
+		for(p = 0; p < paths_size[i]; p++) {
+			unsigned short int cell_id = paths[i][p];
+			board_str[cell_id] = i + 1;
+		}
+	}
+	
+#ifdef PRINT_BOARD
+	cout << "== Print answer ==" << endl;
+	for(y = 0; y < size_y; y++) {
+		for(x = 0; x < size_x; x++) {
+			j = y * size_x + x;
+			i = board_str[j];
+			if(i == 0) { cout << "-"; }
+			else if(i == -1) { cout << "X"; }
+			else{ cout << i; }
+			if(x != size_x-1) { cout << " "; }
+		}
+		cout << endl;
+	}
+#endif
+	
+	return total_wire_length;
+}
+
+void lfsr_random_init(unsigned int seed) {
+	lfsr = seed;
+}
+
+unsigned int lfsr_random() {
+	bool b_32 = false, b_22 = false, b_2 = false, b_1 = false;
+	if(lfsr % 2 == 1) b_32 = true;
+	if((lfsr >> 10) % 2 == 1) b_22 = true;
+	if((lfsr >> 30) % 2 == 1) b_2 = true;
+	if((lfsr >> 31) % 2 == 1) b_1 = true;
+	bool new_bit = b_32 ^ b_22 ^ b_2 ^ b_1;
+	lfsr = lfsr >> 1;
+	if(new_bit) lfsr += 2147483648;
+	return lfsr;
+	/**
+	bool b_32 = lfsr.get_bit(32-32);
+	bool b_22 = lfsr.get_bit(32-22);
+	bool b_2 = lfsr.get_bit(32-2);
+	bool b_1 = lfsr.get_bit(32-1);
+	bool new_bit = b_32 ^ b_22 ^ b_2 ^ b_1;
+	lfsr = lfsr >> 1;
+	lfsr.set_bit(31, new_bit);
+	return lfsr.to_uint();
+	**/
+}
+
+unsigned short int new_weight(unsigned short int x) {
+	unsigned short int y = (x & 0x00FF) + 1;
+	return (unsigned short int)(y);
+}
+
+int search(short int size_x, short int size_y, short int *path_size, unsigned short int path[MAX_PATH], unsigned short int start, unsigned short int goal, unsigned short int w[MAX_CELLS]){
+	
+	unsigned short int dist[MAX_CELLS];
+	unsigned short int prev[MAX_CELLS];
+	
+	int j;
+	for(j = 0; j < MAX_CELLS; j++) {
+		dist[j] = PRIO_MAX;
+	}
+	
+	unsigned short int pq_len = 0;
+    bool is_empty = true;
+    unsigned int pq_nodes[MAX_PQ];
+	
+	short int goal_x = goal % size_x;
+	short int goal_y = goal / size_x;
+	
+	dist[start] = 0;
+	enqueue(pq_nodes, 0, start, &pq_len, &is_empty);
+	
+	bool find_path = false; // No path exists
+	while(!is_empty) {
+		
+		unsigned short int prev_cost;
+		unsigned short int s;
+		dequeue(pq_nodes, &prev_cost, &s, &pq_len, &is_empty);
+		
+		unsigned short int dist_s = dist[s];
+		
+		if(s == goal) {
+			find_path = true;
+			break;
+		}
+		
+		unsigned short int cost = w[s];
+		short int s_x = s % size_x;
+		short int s_y = s / size_x;
+		
+		int a;
+		for(a = 0; a < 4; a++) {
+			short int d_x = s_x;
+			short int d_y = s_y;
+			switch(a) {
+				case 0: d_x -= 1; break;
+				case 1: d_x += 1; break;
+				case 2: d_y -= 1; break;
+				case 3: d_y += 1; break;
+			}
+			if(d_x >= 0 && d_x < size_x && d_y >= 0 && d_y < size_y) {
+				unsigned short int d = d_y * size_x + d_x;
+				if(w[d] == PRIO_MAX && d != goal) continue;
+				
+				unsigned short int dist_d = dist_s + cost;
+				if(dist_d < dist[d]) {
+					dist[d] = dist_d;
+					prev[d] = s;
+					dist_d += abs(d_x - goal_x) + abs(d_y - goal_y);
+					enqueue(pq_nodes, dist_d, d, &pq_len, &is_empty);
+				}
+			}
+		}
+	}
+	if(!find_path){ return -1; }
+	
+	unsigned short int t = prev[goal];
+	short int p = 0;
+#ifdef PRINT_SEARCH
+	cout << "Path: ";
+#endif
+	while(t != start) {
+#ifdef PRINT_SEARCH
+		cout << "(" << (short int)t % size_x << ", " << (short int)t / size_x << ")";
+#endif
+		path[p] = t;
+		p++;
+		t = prev[t];
+	}
+#ifdef PRINT_SEARCH
+	cout << endl;
+#endif
+	*path_size = p;
+	
+	return 0;
+}
+
+// Enqueue (Insert an element)
+void enqueue(unsigned int pq_nodes[MAX_PQ], unsigned short int priority, unsigned short int data, unsigned short int *pq_len, bool *is_empty){
+
+	(*pq_len)++;
+	if ((*pq_len) == 0) { (*pq_len)--; } // Queue is full -> Last element is automatically removed
+	// Note that last element is not always the lowest priority one. //
+
+	unsigned short int i = (*pq_len);
+	unsigned short int p = (*pq_len) >> 1; // parent node
+	while (i > 1 && (unsigned short int)(pq_nodes[p] >> DATA_BIT) >= priority) {
+		pq_nodes[i] = pq_nodes[p];
+		i = p;
+		p = p >> 1; // parent node
+	}
+	pq_nodes[i] = ((unsigned int)priority << DATA_BIT) | (unsigned int)data;
+	*is_empty = false;
+}
+
+// Dequeue (Extract and remove the top element)
+void dequeue(unsigned int pq_nodes[MAX_PQ], unsigned short int *ret_priority, unsigned short int *ret_data, unsigned short int *pq_len, bool *is_empty){
+
+	*ret_priority = (unsigned short int)(pq_nodes[1] >> DATA_BIT);
+	*ret_data     = (unsigned short int)(pq_nodes[1] & DATA_MASK);
+	
+	unsigned short int i = 1; // root node
+	unsigned short int last_priority = (unsigned short int)(pq_nodes[*pq_len] >> DATA_BIT); // Priority of last element
+
+	while (!(i >> (PQ_BIT-1))) {
+		unsigned short int c1 = i << 1; // child node (L)
+		unsigned short int c2 = c1 + 1; // child node (R)
+		if (c1 < *pq_len && (unsigned short int)(pq_nodes[c1] >> DATA_BIT) <= last_priority) {
+			if (c2 < *pq_len && (unsigned short int)(pq_nodes[c2] >> DATA_BIT) <= (unsigned short int)(pq_nodes[c1] >> DATA_BIT)) {
+				pq_nodes[i] = pq_nodes[c2];
+				i = c2;
+			}
+			else {
+				pq_nodes[i] = pq_nodes[c1];
+				i = c1;
+			}
+		}
+		else {
+			if (c2 < *pq_len && (unsigned short int)(pq_nodes[c2] >> DATA_BIT) <= last_priority) {
+				pq_nodes[i] = pq_nodes[c2];
+				i = c2;
+			}
+			else {
+				break;
+			}
+		}
+	}
+	pq_nodes[i] = pq_nodes[*pq_len];
+	(*pq_len)--;
+	if ((*pq_len) == 0) { *is_empty = true; }
+}

router_w_o_ap/router.hpp

+#ifndef __ROUTER_HPP__
+#define __ROUTER_HPP__
+
+#include <iostream>
+
+/**
+#ifdef SOFTWARE
+	#include "ap_int.h"
+#else
+	#include <ap_int.h>
+#endif
+**/
+
+using namespace std;
+
+#define ROUND_LIMIT 32768 // Max=65534(=2^16-2)
+#define PRINT_BOARD
+//#define PRINT_SEARCH // for router debug
+
+#define MAX_LINES 256
+#define MAX_PATH 128
+#define MAX_CELLS 16384 // 128x128
+
+#define PQ_BIT     16
+#define MAX_PQ  65536
+
+#define PRIO_BIT   16
+#define DATA_BIT   16
+#define ELEM_BIT   32 // ELEM_BIT = PRIO_BIT + DATA_BIT
+
+#define DATA_MASK  65535 // 0000 FFFF
+#define DATA_MAX   65535 // FFFF
+#define PRIO_MAX   65535 // FFFF
+
+/** top function (User can set "seed" value manually when calling this function.) **/
+int router(short int size_x, short int size_y, short int line_num, short int board_str[], unsigned int seed = 12345);
+
+static unsigned int lfsr;
+void lfsr_random_init(unsigned int seed);
+unsigned int lfsr_random();
+unsigned short int new_weight(unsigned short int x);
+
+int search(short int size_x, short int size_y, short int *path_size, unsigned short int path[MAX_PATH], unsigned short int start, unsigned short int goal, unsigned short int w[MAX_CELLS]);
+void enqueue(unsigned int pq_nodes[MAX_PQ], unsigned short int priority, unsigned short int data, unsigned short int *pq_len, bool *is_empty);
+void dequeue(unsigned int pq_nodes[MAX_PQ], unsigned short int *ret_priority, unsigned short int *ret_data, unsigned short int *pq_len, bool *is_empty);
+
+#endif /* __ROUTER_HPP__ */