/*
 * CINELERRA
 * Copyright (C) 2008 Adam Williams <broadcast at earthling dot net>
 *
 * 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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */

#include <stdlib.h>
#include <string.h>
#include <stdarg.h>

#include "bchash.h"
#include "bcsignals.h"
#include "filesystem.h"

BC_Hash::BC_Hash()
{
	this->filename[0] = 0;
	total = 0;
	allocated = 0;
	names = 0;
	values = 0;
}

BC_Hash::BC_Hash(const char *filename)
{
	strcpy(this->filename, filename);
	total = 0;
	allocated = 0;
	names = 0;
	values = 0;

	FileSystem directory;

	directory.parse_tildas(this->filename);
}

void BC_Hash::clear()
{
	for(int i = 0; i < total; i++)
	{
		delete [] names[i];
		delete [] values[i];
	}
	total = 0;
}

BC_Hash::~BC_Hash()
{
	clear();
	delete [] names;
	delete [] values;
}

void BC_Hash::reallocate_table(int new_total)
{
	if(allocated < new_total)
	{
		int new_allocated = new_total * 2;
		char **new_names = new char*[new_allocated];
		char **new_values = new char*[new_allocated];

		for(int i = 0; i < total; i++)
		{
			new_names[i] = names[i];
			new_values[i] = values[i];
		}

		delete [] names;
		delete [] values;

		names = new_names;
		values = new_values;
		allocated = new_allocated;
	}
}

int BC_Hash::load_file(FILE *fp)
{
	char line[4096];
	int done = 0, ch = -1;
	total = 0;

	while( !done ) {
		char *bp = line, *ep = bp + sizeof(line);
		if( !fgets(bp, ep-bp, fp) ) break;
		// skip ws (indent)
		while( bp < ep && *bp == ' ' ) ++bp;
		if( bp >= ep || !*bp || *bp == '\n' ) continue;
		char *title = bp;
		// span to ws
		while( bp < ep && *bp && *bp != ' ' && *bp != '\n' ) ++bp;
		if( bp >= ep || title == bp ) continue;
 		int title_len = bp - title;
		// skip blank seperator
		if( *bp++ != ' ' ) continue;
		reallocate_table(total + 1);
		char *tp = new char[title_len + 1];
		names[total] = tp;
		while( --title_len >= 0 ) *tp++ = *title++;
		*tp = 0;
		// accumulate value (+ continued lines)
		char *value = bp;
		while( bp < ep && !done ) {
			while( bp < ep && *bp && *bp != '\n' ) ++bp;
			if( bp >= ep || !*bp ) break;
			if( (ch=fgetc(fp)) < 0 ) break;
			if( ch != '+' ) { ungetc(ch, fp); break; }
			*bp++ = '\n';
			done = !fgets(bp, ep-bp, fp);
		}
		int value_len = bp - value;
		char *vp = new char[value_len + 1];
		values[total] = vp;
		while( --value_len >= 0 ) *vp++ = *value++;
		*vp = 0;
		total++;
	}
	return 0;
}

int BC_Hash::load()
{
	FILE *fp = fopen(filename, "r");
	if( !fp ) return 1;
	int ret = load_file(fp);
	fclose(fp);
	return ret;
}

int BC_Hash::save_file(FILE *fp)
{
	for(int i = 0; i < total; i++) {
		fputs(names[i], fp);
		char *vp = values[i];
		char *bp = vp;
		fputc(' ',fp);
		while( (vp=strchr(vp, '\n')) ) {
			while( bp < vp ) fputc(*bp++,fp);
			fputc('\n',fp);  fputc('+',fp);
			++bp;  ++vp;
		}
		while( *bp ) fputc(*bp++,fp);
		fputc('\n', fp);
        }
	return 0;
}

int BC_Hash::save()
{
	FILE *fp = fopen(filename,"w");
	if( !fp ) return 1;
	int ret = save_file(fp);
	fclose(fp);
	return ret;
}

int BC_Hash::load_string(const char *bfr)
{
	FILE *fp = fmemopen((void*)bfr, strlen(bfr), "r");
	if( !fp ) return 1;
	int ret = load_file(fp);
	fclose(fp);
	return ret;
}

int BC_Hash::save_string(char *&bfr)
{
	size_t bsz = 0;
	FILE *fp = open_memstream(&bfr, &bsz);
	if( !fp ) return 1;
	int ret = save_file(fp);
	fclose(fp);
	return ret;
}



int32_t BC_Hash::get(const char *name, int32_t default_)
{
	for(int i = 0; i < total; i++)
	{
		if(!strcmp(names[i], name))
		{
			return (int32_t)atol(values[i]);
		}
	}
	return default_;  // failed
}

int64_t BC_Hash::get(const char *name, int64_t default_)
{
	int64_t result = default_;
	for(int i = 0; i < total; i++)
	{
		if(!strcmp(names[i], name))
		{
			sscanf(values[i], "%jd", &result);
			return result;
		}
	}
	return result;
}

double BC_Hash::get(const char *name, double default_)
{
	for(int i = 0; i < total; i++)
	{
		if(!strcmp(names[i], name))
		{
			return atof(values[i]);
		}
	}
	return default_;  // failed
}

float BC_Hash::get(const char *name, float default_)
{
	for(int i = 0; i < total; i++)
	{
		if(!strcmp(names[i], name))
		{
			return atof(values[i]);
		}
	}
	return default_;  // failed
}

char* BC_Hash::get(const char *name, char *default_)
{
	for(int i = 0; i < total; i++)
	{
		if(!strcmp(names[i], name))
		{
			strcpy(default_, values[i]);
			return values[i];
		}
	}
	return default_;  // failed
}

int BC_Hash::update(const char *name, double value) // update a value if it exists
{
	char string[BCSTRLEN];
	sprintf(string, "%.16e", value);
	return update(name, string);
}

int BC_Hash::update(const char *name, float value) // update a value if it exists
{
	char string[BCSTRLEN];
	sprintf(string, "%.6e", value);
	return update(name, string);
}

int BC_Hash::update(const char *name, int32_t value) // update a value if it exists
{
	char string[BCSTRLEN];
	sprintf(string, "%d", value);
	return update(name, string);
}

int BC_Hash::update(const char *name, int64_t value) // update a value if it exists
{
	char string[BCSTRLEN];
	sprintf(string, "%jd", value);
	return update(name, string);
}

int BC_Hash::update(const char *name, const char *value)
{
	for(int i = 0; i < total; i++)
	{
		if(!strcmp(names[i], name))
		{
			delete [] values[i];
			values[i] = new char[strlen(value) + 1];
			strcpy(values[i], value);
			return 0;
		}
	}

// didn't find so create new entry
	reallocate_table(total + 1);
	names[total] = new char[strlen(name) + 1];
	strcpy(names[total], name);
	values[total] = new char[strlen(value) + 1];
	strcpy(values[total], value);
	total++;
	return 1;
}

#define varFn(rtyp, fn, typ) \
rtyp BC_Hash::fn##f(typ value, const char *fmt, ...) { \
  char string[BCTEXTLEN];  va_list ap; va_start(ap, fmt); \
  vsnprintf(string, BCTEXTLEN, fmt, ap); \
  va_end(ap);  return fn(string, value); \
}

varFn(int,update,double)	varFn(double,get,double)
varFn(int,update,float)		varFn(float,get,float)
varFn(int,update,int32_t)	varFn(int32_t,get,int32_t)
varFn(int,update,int64_t)	varFn(int64_t,get,int64_t)
varFn(int,update,const char *)	varFn(char *,get,char *)


void BC_Hash::copy_from(BC_Hash *src)
{
// Can't delete because this is used by file decoders after plugins
// request data.  use explicit destructor to clear/clean
// 	this->~BC_Hash();

SET_TRACE
	reallocate_table(src->total);
//	total = src->total;
SET_TRACE
	for(int i = 0; i < src->total; i++)
	{
		update(src->names[i], src->values[i]);
// 		names[i] = new char[strlen(src->names[i]) + 1];
// 		values[i] = new char[strlen(src->values[i]) + 1];
// 		strcpy(names[i], src->names[i]);
// 		strcpy(values[i], src->values[i]);
	}
SET_TRACE
}

int BC_Hash::equivalent(BC_Hash *src)
{
	for(int i = 0; i < total && i < src->total; i++)
	{
		if(strcmp(names[i], src->names[i]) ||
			strcmp(values[i], src->values[i])) return 0;
	}
	return 1;
}

int BC_Hash::size()
{
	return total;
}

char* BC_Hash::get_key(int number)
{
	return names[number];
}

char* BC_Hash::get_value(int number)
{
	return values[number];
}


void BC_Hash::dump()
{
	printf("BC_Hash::dump\n");
	for(int i = 0; i < total; i++)
		printf("	key=%s value=%s\n", names[i], values[i]);
}