/*
 * Copyright (c) 2017, Shane Bryldt
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 
 * * Redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer.
 * 
 * * Redistributions in binary form must reproduce the above copyright
 * notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the distribution.
 * 
 * * Neither the name of the original author; nor the names of any contributors
 * may be used to endorse or promote products derived from this software
 * without specific prior written permission.
 * 
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include "blade.h"

struct blade_identity_s {
	ks_pool_t *pool;

	const char *uri;
	
	const char *components;
	const char *name;
	const char *domain;
	const char *resource;
	ks_hash_t *parameters;
};

// @todo missed a structure to use cleanup callbacks
static void blade_identity_cleanup(ks_pool_t *pool, void *ptr, void *arg, ks_pool_cleanup_action_t action, ks_pool_cleanup_type_t type)
{
	blade_identity_t *bi = (blade_identity_t *)ptr;

	ks_assert(bi);

	switch (action) {
	case KS_MPCL_ANNOUNCE:
		break;
	case KS_MPCL_TEARDOWN:
		if (bi->uri) ks_pool_free(bi->pool, &bi->uri);
		if (bi->components) ks_pool_free(bi->pool, &bi->components);
		if (bi->parameters) ks_hash_destroy(&bi->parameters);
		break;
	case KS_MPCL_DESTROY:
		break;
	}
}

KS_DECLARE(ks_status_t) blade_identity_create(blade_identity_t **biP, ks_pool_t *pool)
{
	blade_identity_t *bi = NULL;

	ks_assert(biP);
	ks_assert(pool);

	bi = ks_pool_alloc(pool, sizeof(blade_identity_t));
	bi->pool = pool;

	ks_assert(ks_pool_set_cleanup(pool, bi, NULL, blade_identity_cleanup) == KS_STATUS_SUCCESS);

	*biP = bi;

	return KS_STATUS_SUCCESS;
}

KS_DECLARE(ks_status_t) blade_identity_destroy(blade_identity_t **biP)
{
	blade_identity_t *bi = NULL;
	
	ks_assert(biP);
	ks_assert(*biP);

	bi = *biP;
	if (bi->uri) {
		ks_pool_free(bi->pool, &bi->uri);
		ks_pool_free(bi->pool, &bi->components);
	}
	if (bi->parameters) ks_hash_destroy(&bi->parameters);

	ks_pool_free(bi->pool, biP);

	return KS_STATUS_SUCCESS;
}

KS_DECLARE(ks_status_t) blade_identity_parse(blade_identity_t *bi, const char *uri)
{
	char *tmp = NULL;
	char *tmp2 = NULL;
	
	ks_assert(bi);
	ks_assert(uri);

	ks_log(KS_LOG_DEBUG, "Parsing URI: %s\n", uri);
	
	if (bi->uri) {
		ks_pool_free(bi->pool, &bi->uri);
		ks_pool_free(bi->pool, &bi->components);
	}
	bi->uri = ks_pstrdup(bi->pool, uri);
	bi->components = tmp = ks_pstrdup(bi->pool, uri);

	bi->name = tmp;
	if (!(tmp = strchr(tmp, '@'))) return KS_STATUS_FAIL;
	*tmp++ = '\0';
		
	bi->domain = tmp2 = tmp;
	if ((tmp = strchr(tmp, '/'))) {
		*tmp++ = '\0';
		bi->resource = tmp2 = tmp;
	} else tmp = tmp2;

	if ((tmp = strchr(tmp, '?'))) {
		*tmp++ = '\0';

		while (tmp) {
			char *key = tmp;
			char *val = NULL;
			if (!(tmp = strchr(tmp, '='))) return KS_STATUS_FAIL;
			*tmp++ = '\0';
			val = tmp;
			if ((tmp = strchr(tmp, '&'))) {
				*tmp++ = '\0';
			}

			if (!bi->parameters) {
				ks_hash_create(&bi->parameters, KS_HASH_MODE_CASE_INSENSITIVE, KS_HASH_FLAG_NOLOCK | KS_HASH_FLAG_DUP_CHECK, bi->pool);
				ks_assert(bi->parameters);
			}
			ks_hash_insert(bi->parameters, key, val);
		}
	}

	return KS_STATUS_SUCCESS;
}

KS_DECLARE(const char *) blade_identity_uri(blade_identity_t *bi)
{
	ks_assert(bi);

	return bi->uri;
}

KS_DECLARE(const char *) blade_identity_parameter_get(blade_identity_t *bi, const char *key)
{
	ks_assert(bi);
	ks_assert(key);

	return (const char *)ks_hash_search(bi->parameters, (void *)key, KS_UNLOCKED);
}


/* For Emacs:
 * Local Variables:
 * mode:c
 * indent-tabs-mode:t
 * tab-width:4
 * c-basic-offset:4
 * End:
 * For VIM:
 * vim:set softtabstop=4 shiftwidth=4 tabstop=4 noet:
 */