/*
 *                            COPYRIGHT
 *
 *  pcb-rnd, interactive printed circuit board design
 *  Copyright (C) 2021 Tibor 'Igor2' Palinkas
 *
 *  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 2 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 for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 31 Milk Street, # 960789 Boston, MA 02196 USA.
 *
 *  Contact:
 *    Project page: http://repo.hu/projects/pcb-rnd
 *    lead developer: http://repo.hu/projects/pcb-rnd/contact.html
 *    mailing list: pcb-rnd (at) list.repo.hu (send "subscribe")
 */

static pcb_2netmap_oseg_t *oseg_new(pcb_2netmap_t *map, pcb_net_t *net, int shorted)
{
	pcb_2netmap_oseg_t *os;
	os = calloc(sizeof(pcb_2netmap_oseg_t), 1);
	os->next = map->osegs;
	map->osegs = os;
	os->net = net;
	os->shorted = shorted;
	return os;
}

static pcb_2netmap_obj_t *map_seg_out_obj(pcb_2netmap_t *map, pcb_any_obj_t *obj)
{
	pcb_2netmap_obj_t *res = malloc(sizeof(pcb_2netmap_obj_t));

	/* copy the object but reset some fields as this object is not part of any layer list */
	switch(obj->type) {
		case PCB_OBJ_LINE: memcpy(&res->o, obj, sizeof(res->o.line)); memset(&res->o.line.link, 0, sizeof(gdl_elem_t)); break;
		case PCB_OBJ_RAT:  memcpy(&res->o, obj, sizeof(res->o.rat));  memset(&res->o.rat.link, 0, sizeof(gdl_elem_t)); break;
		case PCB_OBJ_ARC:  memcpy(&res->o, obj, sizeof(res->o.arc));  memset(&res->o.arc.link,  0, sizeof(gdl_elem_t)); break;
		case PCB_OBJ_PSTK: memcpy(&res->o, obj, sizeof(res->o.pstk)); memset(&res->o.pstk.link,  0, sizeof(gdl_elem_t)); break;
		case PCB_OBJ_POLY: memcpy(&res->o, obj, sizeof(res->o.poly)); memset(&res->o.poly.link,  0, sizeof(gdl_elem_t)); break;
		case PCB_OBJ_TEXT: memcpy(&res->o, obj, sizeof(res->o.text)); memset(&res->o.text.link,  0, sizeof(gdl_elem_t)); break;
		default:;
	}
	res->orig = obj;

	return res;
}

/* copy all objects of i->seg to o, starting from start_side; returns last
   object copied */
static pcb_any_obj_t *map_seg_out_copy(pcb_2netmap_t *map, pcb_2netmap_oseg_t *o, pcb_2netmap_iseg_t *i, int start_side)
{
	long n;
	if (start_side == 0) {
		for(n = 0; n < i->seg->objs.used; n++)
			vtp0_append(&o->objs, map_seg_out_obj(map, i->seg->objs.array[n]));
		return i->seg->objs.array[i->seg->objs.used-1];
	}

	for(n = i->seg->objs.used-1; n >= 0; n--)
		vtp0_append(&o->objs, map_seg_out_obj(map, i->seg->objs.array[n]));

	if (i->seg->objs.used == 0)
		return NULL;
	return i->seg->objs.array[0];
}


static pcb_any_obj_t *map_seg_out_coords(pcb_2netmap_t *map, pcb_2netmap_oseg_t *o, pcb_2netmap_iseg_t *i, int start_side)
{
	long n;
	if (start_side == 0) {
		for(n = 0; n < i->seg->objs.used; n++)
			vtp0_append(&o->objs, map_seg_out_obj(map, i->seg->objs.array[n]));
		return i->seg->objs.array[i->seg->objs.used-1];
	}

	for(n = i->seg->objs.used-1; n >= 0; n--)
		vtp0_append(&o->objs, map_seg_out_obj(map, i->seg->objs.array[n]));
	return i->seg->objs.array[0];
}

/* replace a hub object with a dummy object that acts as a bridge between 'from'
   object and the starting object of to_iseg */
static void map_seg_add_bridge(pcb_2netmap_t *map, pcb_2netmap_oseg_t *oseg, pcb_any_obj_t *from,  pcb_any_obj_t *hub_obj, pcb_2netmap_iseg_t *to_iseg, int to_start_side)
{
	pcb_any_obj_t *to;
	pcb_2netmap_obj_t *tmp = calloc(sizeof(pcb_2netmap_obj_t), 1);

	assert(to_iseg->seg->objs.used > 0);
	if (to_start_side == 0)
		to = to_iseg->seg->objs.array[0];
	else
		to = to_iseg->seg->objs.array[to_iseg->seg->objs.used - 1];

	switch(hub_obj->type) {
		case PCB_OBJ_LINE:
			tmp->o.line = *(pcb_line_t *)hub_obj;
			map_seg_get_end_coords_on_line(from, (pcb_line_t *)hub_obj, &tmp->o.line.Point1.X, &tmp->o.line.Point1.Y);
			map_seg_get_end_coords_on_line(to,   (pcb_line_t *)hub_obj, &tmp->o.line.Point2.X, &tmp->o.line.Point2.Y);
			memset(&tmp->o.line.link, 0, sizeof(tmp->o.line.link));
			break;
		case PCB_OBJ_RAT:
			abort();
		case PCB_OBJ_ARC:
			{
				double sa, ea;
				pcb_arc_t *hub_arc = (pcb_arc_t *)hub_obj;
				map_seg_get_end_coords_on_arc(from, hub_arc, &sa);
				map_seg_get_end_coords_on_arc(to,   hub_arc, &ea);
				tmp->o.arc = *hub_arc;

				/* check in which direction middle of the new arc would still fall
				   onto the original arc; this decides the angle range so the
				   new arc curves the right direction */
				if (pcb_angle_in_arc(hub_arc, sa+(ea-sa)/2, 1)) {
					tmp->o.arc.StartAngle = sa;
					tmp->o.arc.Delta = ea - sa;
				}
				else {
					tmp->o.arc.StartAngle = ea;
					tmp->o.arc.Delta = 360-(ea - sa);
				}
				memset(&tmp->o.arc.link, 0, sizeof(tmp->o.arc.link));
			}
			break;
		case PCB_OBJ_PSTK:
			tmp->o.pstk = *(pcb_pstk_t *)hub_obj;
			memset(&tmp->o.pstk.link, 0, sizeof(tmp->o.pstk.link));
			break;

		default:;
			tmp->o.line.type = PCB_OBJ_VOID;
			break;
	}
	vtp0_append(&oseg->objs, tmp);
}

/* Return end coords of trace object; returns 0 on plain trace object, -1 on
   strange object. On strange object sets object center as ex;ey */
static int oseg_map_get_ends_(pcb_2netmap_obj_t *curr, rnd_coord_t ex[2], rnd_coord_t ey[2])
{
	int n;

	switch(curr->o.any.type) {
		case PCB_OBJ_LINE:
			ex[0] = curr->o.line.Point1.X;
			ey[0] = curr->o.line.Point1.Y;
			ex[1] = curr->o.line.Point2.X;
			ey[1] = curr->o.line.Point2.Y;
			return 0;
		case PCB_OBJ_ARC:
			for(n = 0; n < 2; n++)
				pcb_arc_get_end(&curr->o.arc, n, &ex[n], &ey[n]);
			return 0;
		case PCB_OBJ_PSTK:
		default:
			pcb_obj_center(&curr->o.any, &ex[0], &ey[0]);
			ex[1] = ex[0];
			ey[1] = ey[0];
			break;
	}
	return -1;
}

/* Arrived at curr from last point px;py. Look at the two ends of trace object
   curr and load the one that's closer to px;py into npx;npy and the futher
   one into nx;ny. Return the distance^2 from px;py to npx;npy. *endi is either
   0 or 1 depending on start/end index choosen for npx;npy */
static double oseg_map_get_ends(pcb_2netmap_obj_t *curr, rnd_coord_t px, rnd_coord_t py, rnd_coord_t *npx, rnd_coord_t *npy, rnd_coord_t *nx, rnd_coord_t *ny, int *endi)
{
	rnd_coord_t ex[2], ey[2];
	double d[2];
	int n;

	if (oseg_map_get_ends_(curr, ex, ey) != 0) {
		*npx = *nx = ex[0];
		*npy = *ny = ey[0];
		*endi = 0;
		return rnd_distance2(px, py, *npx, *npy);
	}

	for(n = 0; n < 2; n++)
		d[n] = rnd_distance2(px, py, ex[n], ey[n]);

	if (d[0] < d[1]) {
		*npx = ex[0]; *npy = ey[0];
		*nx  = ex[1]; *ny  = ey[1];
		*endi = 0;
		return d[0];
	}

	*npx = ex[1]; *npy = ey[1];
	*nx  = ex[0]; *ny  = ey[0];
	*endi = 1;
	return d[1];
}

static pcb_layer_t *get_random_copper_layer(pcb_board_t *pcb)
{
	rnd_layer_id_t lid;
	if (pcb_layer_list(pcb, PCB_LYT_COPPER, &lid, 1) < 1)
		return NULL;

	return pcb_get_layer(pcb->Data, lid);
}

static void oseg_map_coords(pcb_2netmap_t *map, pcb_2netmap_oseg_t *oseg)
{
	pcb_board_t *pcb = map->ec->pcb;
	long n;
	pcb_2netmap_obj_t *curr, *prev = NULL;
	rnd_coord_t px, py, npx, npy, nx, ny, th = 1, cl = 1;
	double d2;
	int endi;

	if (oseg->objs.used < 1)
		return;

	prev = oseg->objs.array[0];
	if ((prev->orig->term != NULL) || (prev->orig->type == PCB_OBJ_PSTK)) {
		pcb_obj_center(&prev->o.any, &px, &py);
		prev->x = px;
		prev->y = py;
	}
	else if (oseg->objs.used > 1) { /* starting from a non-padstack, non-terminal object - have to sort out which end is the common end with the second object */
		rnd_coord_t pex[2], pey[2], nex[2], ney[2];
		int pi, ni;
		double d, best = RND_COORD_MAX;

		curr = oseg->objs.array[1];
		oseg_map_get_ends_(prev, pex, pey);
		oseg_map_get_ends_(curr, nex, ney);

		for(pi = 0; pi < 2; pi++) {
			for(ni = 0; ni < 2; ni++) {
				d = rnd_distance2(pex[pi], pey[pi], nex[ni], ney[ni]);
				if (d < best) {
					best = d;
					px = pex[pi];
					py = pey[pi];
				}
			}
		}
	}

	/* find connected endpoints */
	for(n = 1; n < oseg->objs.used; n++) {
		curr = oseg->objs.array[n];

		/* remember last known trace geometry just in case we need to insert dummies */
		switch(curr->o.any.type) {
			case PCB_OBJ_LINE: th = curr->o.line.Thickness; cl = curr->o.line.Clearance; break;
			case PCB_OBJ_ARC:  th = curr->o.arc.Thickness;  cl = curr->o.arc.Clearance; break;
			default:;
		}
		
		/* check endpoint matching; px;py is the last object's end, npx;npy is
		   the current object's start (the new px;py if they don't match) and
		   nx;ny is the "next" x;y, the new cursor position (end of curr) */
		d2 = oseg_map_get_ends(curr, px, py, &npx, &npy, &nx, &ny, &endi);

		/* if endpoints are not properly connected, insert a dummy bridge line */
		if (d2 > RND_MM_TO_COORD(0.01)) {
			pcb_layer_t *ply = NULL;

			if (curr->o.any.parent_type == PCB_PARENT_LAYER)
				ply = curr->o.any.parent.layer;
			if (prev->o.any.parent_type == PCB_PARENT_LAYER)
				ply = prev->o.any.parent.layer;
			else
				ply = get_random_copper_layer(pcb); /* corner case: curr and prev are both padstacks */

			if (ply != NULL) {
				pcb_2netmap_obj_t *tmp = calloc(sizeof(pcb_2netmap_obj_t), 1);
				tmp->o.line.type = PCB_OBJ_LINE;
				tmp->o.line.ID = 0;
				tmp->o.line.Point1.X = px; tmp->o.line.Point1.Y = py;
				tmp->o.line.Point2.X = npx; tmp->o.line.Point2.Y = npy;
				tmp->o.line.Thickness = th; tmp->o.line.Clearance = cl;
				tmp->x = npx; tmp->y = npy;
				tmp->o.line.parent_type = PCB_PARENT_LAYER;
				tmp->o.line.parent.layer = ply;
				vtp0_insert_len(&oseg->objs, n, (void **)&tmp, 1);
				n++;
			}
		}

		curr->x = nx;
		curr->y = ny;
		if (curr->o.any.type == PCB_OBJ_ARC) {
			if (endi == 0) { /* the arc object is in the right direction, just copy */
				curr->sa = curr->o.arc.StartAngle;
				curr->da = curr->o.arc.Delta;
			}
			else { /* need to reverse arc */
				curr->sa = curr->o.arc.StartAngle + curr->o.arc.Delta;
				curr->da = -curr->o.arc.Delta;
			}
		}

		prev = curr;
		px = nx;
		py = ny;
	}
}

static void map_seg_out(pcb_2netmap_t *map, pcb_2netmap_iseg_t *iseg)
{
	pcb_2netmap_iseg_t *prev, *es;
	pcb_2netmap_oseg_t *oseg = oseg_new(map, iseg->net, iseg->shorted);
	int n, start_side = iseg->term[0] ? 0 : 1; /* assumes we are starting from a terminal */
	pcb_any_obj_t *end_obj, *hub_last_obj = NULL, *last_obj = NULL, *hub_obj;

	iseg->used = 1;

	for(;;) {
		/* copy current iseg */
printf("* iseg: %p %d\n", (void *)iseg, start_side);
		if (iseg->seg->hub) {
			hub_last_obj = last_obj;
			hub_obj = iseg->seg->objs.array[0];
		}
		else {
			if (hub_last_obj != NULL) {
				map_seg_add_bridge(map, oseg, hub_last_obj, hub_obj, iseg, start_side);
				hub_last_obj = NULL;
			}
			last_obj = map_seg_out_copy(map, oseg, iseg, start_side);
		}

		prev = iseg;
		iseg = iseg->path_next;
		if (iseg == NULL)
			break;

		end_obj = NULL;

printf("* prev term: %d %d\n", prev->term[0], prev->term[1]);

		/* figure the common object and determine start_side for the new iseg */
		end_obj = NULL;
		for(n = 0; n < 2; n++) {
			printf("* junc: %d %p\n", n, (void *)prev->seg->junction[n]);
			if (prev->seg->junction[n] != NULL) {
				es = htpp_get(&map->o2n, prev->seg->junction[n]);
				if (es == iseg) {
					end_obj = prev->seg->junction[n];
					break;
				}
			}
		}

		assert(end_obj != NULL);
		if (iseg->seg->objs.array[0] == end_obj)
			start_side = 0;
		else
			start_side = 1;
	}

	oseg_map_coords(map, oseg);
}

/*** Search a path from a starting segment to any terminal using the A* algorithm ***/

typedef struct ast_ctx_s {
	pcb_2netmap_t *map;
	pcb_2netmap_iseg_t *start;
} ast_ctx_t;

static long heur(usrch_a_star_t *ctx, void *node_)
{
	ast_ctx_t *actx = ctx->user_data;
	pcb_2netmap_iseg_t *node = node_;
	long score = node->seg->objs.used;

	/* avoid shorts: overlaps should happen on legit segs */
	if (node->net != actx->start->net) score += 1000;

	/* try to use new segment: least overlap */
	if (node->used) score += 300;

	/* avoid bridge segments: go for paths with less junctions */
	if (!node->term[0] && !node->term[1]) score += 200;

	return score;
}


static long cost(usrch_a_star_t *ctx, void *from, void *to_)
{
	return heur(ctx, to_);
}

static void *neighbor_pre(usrch_a_star_t *ctx, void *curr)
{
	static int count;
	count = 0;
	return &count;
}

static void *neighbor(usrch_a_star_t *ctx, void *curr_, void *nctx)
{
	ast_ctx_t *actx = ctx->user_data;
	pcb_2netmap_iseg_t  *curr = curr_;
	pcb_any_obj_t *obj = NULL;
	void *res;
	int *count = nctx;

	for(;;) {
		if (*count == 2)
			return NULL;

		obj = curr->seg->junction[*count];
		(*count)++;
		if (obj != NULL) {
			res = htpp_get(&actx->map->o2n, obj);
			if (res != NULL)
				break;
		}
	}

	return res;
}

static int is_target(usrch_a_star_t *ctx, void *curr_)
{
	ast_ctx_t *actx = ctx->user_data;
	pcb_2netmap_iseg_t *curr = curr_;
	return ((curr != actx->start) && (curr->term[0] || curr->term[1]));
}

static void set_mark(usrch_a_star_t *ctx, void *node, usrch_a_star_node_t *mark)
{
	pcb_2netmap_iseg_t *seg = node;
	seg->mark = mark;
}

static usrch_a_star_node_t *get_mark(usrch_a_star_t *ctx, void *node)
{
	pcb_2netmap_iseg_t *seg = node;
	return seg->mark;
}

static void map_seg_search(pcb_2netmap_t *map, pcb_2netmap_iseg_t *iseg, int only_unused)
{
	usrch_a_star_node_t *it;
	usrch_a_star_t a = {0};
	ast_ctx_t actx;
	pcb_2netmap_iseg_t *n, *last;
	usrch_res_t sr;

	actx.map = map;
	actx.start = iseg;

	a.heuristic = heur;
	a.cost = cost;
	a.is_target = is_target;
	a.neighbor_pre = neighbor_pre;
	a.neighbor = neighbor;
	a.set_mark = set_mark;
	a.get_mark = get_mark;
	a.user_data = &actx;

	sr = usrch_a_star_search(&a, iseg, NULL);

printf("-------------------\n");

	if (sr == USRCH_RES_FOUND) {
		/* pick up the the results and build a path using ->path_next and render the output net */
		last = NULL;
		for(n = usrch_a_star_path_first(&a, &it); n != NULL; n = usrch_a_star_path_next(&a, &it)) {
			if (only_unused && n->used)
				continue;
printf(" + %p\n", (void *)n);
			n->path_next = last;
			last = n;
			n->used = 1;
		}
	}
	else {
		/* didn't find any connection, iseg is an unfinished net */
		last = iseg;
		last->path_next = NULL;
	}
	map_seg_out(map, last);

	usrch_a_star_uninit(&a);
}

static void map_segs(pcb_2netmap_t *map)
{
	pcb_2netmap_iseg_t *i;

	/* search nets that start or end in a terminal */
	for(i = map->isegs; i != NULL; i = i->next) {
		if (i->used) continue;
		if (i->term[0] && i->term[1]) /* simplest case: terminal-to-terminal */
			map_seg_out(map, i);
		else if (i->term[0] || i->term[1]) /* at least one end has termianl */
			map_seg_search(map, i, 0);
	}


	/* caller wants to see free floating nets; pick up any leftover */
	if (map->find_floating)
		for(i = map->isegs; i != NULL; i = i->next)
			if (!i->used)
				map_seg_search(map, i, 1);
}
