/**
 * ZANavi, Zoff Android Navigation system.
 * Copyright (C) 2011-2012 Zoff <zoff@zoff.cc>
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * version 2 as published by the Free Software Foundation.
 *
 * 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., 51 Franklin Street, Fifth Floor,
 * Boston, MA  02110-1301, USA.
 */

/**
 * Navit, a modular navigation system.
 * Copyright (C) 2005-2008 Navit Team
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * version 2 as published by the Free Software Foundation.
 *
 * 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., 51 Franklin Street, Fifth Floor,
 * Boston, MA  02110-1301, USA.
 */

#define NO_GTYPES_ 1

#define _FILE_OFFSET_BITS 64
#define _LARGEFILE_SOURCE
#define _LARGEFILE64_SOURCE
#include <stdlib.h>
#include <glib.h>
#include <assert.h>
#include <string.h>
#include <signal.h>
#include <stdio.h>
#include <math.h>
#include <getopt.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/stat.h>
#include <zlib.h>
#include "file.h"
#include "item.h"
#include "map.h"
#include "zipfile.h"
#include "main.h"
#include "config.h"
#include "linguistics.h"
#include "plugin.h"
#include "maptool.h"

struct rect world_bbox =
{
{ -20000000, -20000000 },
{ 20000000, 20000000 }, };

void bbox_extend(struct coord *c, struct rect *r)
{
	if (c->x < r->l.x)
		r->l.x = c->x;
	if (c->y < r->l.y)
		r->l.y = c->y;
	if (c->x > r->h.x)
		r->h.x = c->x;
	if (c->y > r->h.y)
		r->h.y = c->y;
}

void bbox(struct coord *c, int count, struct rect *r)
{
	if (!count)
		return;
	r->l = *c;
	r->h = *c;
	while (--count)
	{
		c++;
		bbox_extend(c, r);
	}
}

int contains_bbox(int xl, int yl, int xh, int yh, struct rect *r)
{
	if (r->h.x < xl || r->h.x > xh)
	{
		return 0;
	}
	if (r->l.x > xh || r->l.x < xl)
	{
		return 0;
	}
	if (r->h.y < yl || r->h.y > yh)
	{
		return 0;
	}
	if (r->l.y > yh || r->l.y < yl)
	{
		return 0;
	}
	return 1;
}

int bbox_contains_coord(struct rect *r, struct coord *c)
{

	//fprintf(stderr,"bbox_contains_coord: rhx=%d rhy=%d rlx=%d rly=%d, cx=%d cy=%d\n", r->h.x, r->h.y, r->l.x, r->l.y,c->x, c->y);

	if (r->h.x < c->x)
		return 0;
	if (r->l.x > c->x)
		return 0;
	if (r->h.y < c->y)
		return 0;
	if (r->l.y > c->y)
		return 0;
	return 1;
}

int bbox_contains_bbox(struct rect *out, struct rect *in)
{
	if (out->h.x < in->h.x)
		return 0;
	if (out->l.x > in->l.x)
		return 0;
	if (out->h.y < in->h.y)
		return 0;
	if (out->l.y > in->l.y)
		return 0;
	return 1;
}

long long bbox_area(struct rect const *r)
{
	return ((long long) r->h.x - r->l.x) * (r->h.y - r->l.y);
}

void phase1_map(GList *maps, FILE *out_ways, FILE *out_nodes)
{
	struct map_rect *mr;
	struct item *item;
	int count, max = 16384;
	struct coord ca[max];
	struct attr attr;
	struct item_bin *item_bin;

	while (maps)
	{
		mr = map_rect_new(maps->data, NULL);
		while ((item = map_rect_get_item(mr)))
		{
			count = item_coord_get(item, ca, item->type < type_line ? 1 : max);
			item_bin = init_item(item->type, 0);
			item_bin_add_coord(item_bin, ca, count);
			while (item_attr_get(item, attr_any, &attr))
			{
				if (attr.type >= attr_type_string_begin && attr.type <= attr_type_string_end)
				{
					attr.u.str = map_convert_string(maps->data, attr.u.str);
					if (attr.u.str)
					{
						item_bin_add_attr(item_bin, &attr);
						map_convert_free(attr.u.str);
					}
				}
				else
					item_bin_add_attr(item_bin, &attr);
			}
			if (item->type >= type_line)
				item_bin_write(item_bin, out_ways);
			else
				item_bin_write(item_bin, out_nodes);
		}
		map_rect_destroy(mr);
		maps = g_list_next(maps);
	}
}

static void phase34_process_file(struct tile_info *info, FILE *in, FILE *reference)
{
	struct item_bin *ib;
	int max;

	while ((ib = read_item(in, 0)))
	{
		if (ib->type < 0x80000000)
		{
			processed_nodes++;
		}
		else
		{
			processed_ways++;
		}

		if (border_only_map == 1)
		{
			// fprintf(stderr,"max=1\n");
			// max=1; --> shows all borders, all the time. but is too slow!
			max = 4;
		}
		else
		{
			max = 14;
			switch (ib->type)
			{
				case type_town_label_1e7:
				case type_town_label_5e6:
				case type_town_label_2e6:
				case type_town_label_1e6:
				case type_town_label_5e5:
				case type_district_label_1e7:
				case type_district_label_5e6:
				case type_district_label_2e6:
				case type_district_label_1e6:
				case type_district_label_5e5:
					max = 6;
					break;
				case type_town_label_2e5:
				case type_town_label_1e5:
				case type_district_label_2e5:
				case type_district_label_1e5:
				case type_street_n_lanes:
				case type_highway_city:
				case type_highway_land:
				//case type_ramp:
				case type_ramp_highway_land:
					max = 8;
					break;
				case type_town_label_5e4:
				case type_town_label_2e4:
				case type_town_label_1e4:
				case type_district_label_5e4:
				case type_district_label_2e4:
				case type_district_label_1e4:
					max = 9;
					break;
				case type_street_4_land:
				case type_street_4_city:
				case type_ramp_street_4_city:
					max = 10;
					break;
				case type_town_label_5e3:
				case type_town_label_2e3:
				case type_town_label_1e3:
				case type_district_label_5e3:
				case type_district_label_2e3:
				case type_district_label_1e3:
				case type_street_3_city:
				case type_street_3_land:
				case type_ramp_street_3_city:
					max = 12;
					break;
				default:
					break;
			}
		}

		// dont write "street unknown" items to binfile, if option "to ignore unknown types" is set
		if ((ib->type == type_street_unkn) && (ignore_unkown == 1))
		{
		}
		else
		{
			tile_write_item_minmax(info, ib, reference, 0, max);
		}
	}
}

static void phase34_process_file_range(struct tile_info *info, FILE *in, FILE *reference)
{
	struct item_bin *ib;
	int min, max;

	while ((ib = read_item_range(in, &min, &max, 0)))
	{
		if (ib->type < 0x80000000)
			processed_nodes++;
		else
			processed_ways++;

		if ((ib->type == type_street_unkn) && (ignore_unkown == 1))
		{
		}
		else
		{
			tile_write_item_minmax(info, ib, reference, min, max);
		}
	}
}

static int phase34(struct tile_info *info, struct zip_info *zip_info, FILE **in, FILE **reference, int in_count, int with_range)
{
	int i;

	processed_nodes = processed_nodes_out = processed_ways = processed_relations = processed_tiles = 0;

	bytes_read = 0;
	//sig_alrm(0);

	if (!info->write)
	{
		tile_hash = g_hash_table_new(g_str_hash, g_str_equal);
	}

	for (i = 0; i < in_count; i++)
	{
		if (in[i])
		{
			if (with_range)
			{
				phase34_process_file_range(info, in[i], reference ? reference[i] : NULL);
			}
			else
			{
				phase34_process_file(info, in[i], reference ? reference[i] : NULL);
			}
		}
	}

	if (!info->write)
	{
		merge_tiles(info);
	}

	//sig_alrm(0);
	//sig_alrm_end();

	write_tilesdir(info, zip_info, info->tilesdir_out);

	return 0;

}

void dump(FILE *in)
{
	struct item_bin *ib;
	while ((ib = read_item(in, 0)))
	{
		dump_itembin(ib);
	}
}

int phase4(FILE **in, int in_count, int with_range, char *suffix, FILE *tilesdir_out, struct zip_info *zip_info)
{
	struct tile_info info;
	info.write = 0;
	info.maxlen = 0;
	info.suffix = suffix;
	info.tiles_list = NULL;
	info.tilesdir_out = tilesdir_out;
	return phase34(&info, zip_info, in, NULL, in_count, with_range);
}

static int process_slice(FILE **in, FILE **reference, int in_count, int with_range, long long size, char *suffix, struct zip_info *zip_info)
{
	struct tile_head *th;
	char *slice_data, *zip_data;
	int zipfiles = 0;
	struct tile_info info;
	int i;

	slice_data = malloc(size);
	assert(slice_data != NULL);
	zip_data = slice_data;
	th = tile_head_root;
	while (th)
	{
		if (th->process)
		{
			th->zip_data = zip_data;
			zip_data += th->total_size;
		}
		th = th->next;
	}
	for (i = 0; i < in_count; i++)
	{
		if (in[i])
			fseek(in[i], 0, SEEK_SET);
		if (reference && reference[i])
		{
			fseek(reference[i], 0, SEEK_SET);
		}
	}
	info.write = 1;
	info.maxlen = zip_get_maxnamelen(zip_info);
	info.suffix = suffix;
	info.tiles_list = NULL;
	info.tilesdir_out = NULL;
	phase34(&info, zip_info, in, reference, in_count, with_range);

	th = tile_head_root;
	while (th)
	{
		if (th->process)
		{
			if (th->name[0])
			{
				if (th->total_size != th->total_size_used)
				{
					fprintf(stderr, "Size error '%s': %d vs %d\n", th->name, th->total_size, th->total_size_used);
					exit(1);
				}
				write_zipmember(zip_info, th->name, zip_get_maxnamelen(zip_info), th->zip_data, th->total_size);
				zipfiles++;
			}
			else
				fwrite(th->zip_data, th->total_size, 1, zip_get_index(zip_info));
		}
		th = th->next;
	}
	free(slice_data);

	return zipfiles;
}

int phase5(FILE **in, FILE **references, int in_count, int with_range, char *suffix, struct zip_info *zip_info)
{
	long long size;
	int slices;
	int zipnum, written_tiles;
	struct tile_head *th, *th2;

	time_t start_tt, end_tt;
	double diff_tt;
	double diff2_tt;

	create_tile_hash();

	th = tile_head_root;
	size = 0;
	slices = 0;
	fprintf_(stderr, "Maximum slice size "LONGLONG_FMT"\n", slice_size);
	while (th)
	{
		if (size + th->total_size > slice_size)
		{
			fprintf_(stderr,"Slice %d is of size "LONGLONG_FMT"\n", slices, size);
			size = 0;
			slices++;
		}
		size += th->total_size;
		th = th->next;
	}

	if (size)
	{
		fprintf_(stderr,"Slice %d is of size "LONGLONG_FMT"\n", slices, size);
	}

	int max_slices_ = slices;
	th = tile_head_root;
	size = 0;
	slices = 0;

	while (th)
	{
		time(&start_tt);

		fprintf_(stderr,"Slice #%d of %d\n", (slices + 1), (max_slices_ + 1));

		th2 = tile_head_root;
		while (th2)
		{
			th2->process = 0;
			th2 = th2->next;
		}

		size = 0;
		while (th && size + th->total_size < slice_size)
		{
			size += th->total_size;
			th->process = 1;
			th = th->next;
		}

		/* process_slice() modifies zip_info, but need to retain old info */
		zipnum = zip_get_zipnum(zip_info);
		written_tiles = process_slice(in, references, in_count, with_range, size, suffix, zip_info);
		zip_set_zipnum(zip_info, zipnum + written_tiles);

		time(&end_tt);
		diff_tt = difftime(end_tt,start_tt);
		char outstring[200];
		convert_to_human_time(diff_tt, outstring);
		fprintf_(stderr, "-RUNTIME-LOOP-PHASE5: %s this loop run\n", outstring);
		diff2_tt = diff2_tt + diff_tt;
		if ((slices + 1) > 0)
		{
			double eta_time = (diff2_tt / (slices + 1)) * (max_slices_ + 1 - (slices + 1));
			convert_to_human_time(eta_time, outstring);
			fprintf_(stderr, "-RUNTIME-LOOP-PHASE5: %s left\n", outstring);
		}

		slices++;
	}

	return 0;
}

void process_binfile(FILE *in, FILE *out)
{
	struct item_bin *ib;
	while ((ib = read_item(in, 0)))
	{
		fwrite(ib, (ib->len + 1) * 4, 1, out);
	}
}

void add_aux_tiles(char *name, struct zip_info *info)
{
	char buffer[4096];
	char *s;
	FILE *in;
	FILE *tmp;
	in = fopen(name, "rb");
	if (!in)
		return;
	while (fscanf(in, "%s", buffer) == 1)
	{
		s = strchr(buffer, '/');
		if (s)
			s++;
		else
			s = buffer;
		tmp = fopen(buffer, "rb");
		if (tmp)
		{
			fseek(tmp, 0, SEEK_END);
			add_aux_tile(info, s, buffer, ftell(tmp));
			fclose(tmp);
		}
	}
	fclose(in);
}