2016-11-28 16:35:09 -05:00
|
|
|
/*
|
2017-02-09 17:08:07 +00:00
|
|
|
* Copyright (c) 2017, Shane Bryldt
|
2016-11-28 16:35:09 -05:00
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2017-02-09 17:08:07 +00:00
|
|
|
#include "blade.h"
|
2016-11-28 16:35:09 -05:00
|
|
|
|
2017-02-09 17:08:07 +00:00
|
|
|
struct blade_identity_s {
|
|
|
|
ks_pool_t *pool;
|
2016-11-28 16:35:09 -05:00
|
|
|
|
2017-02-09 17:08:07 +00:00
|
|
|
const char *uri;
|
2017-02-13 19:07:33 +00:00
|
|
|
|
|
|
|
const char *components;
|
|
|
|
const char *name;
|
|
|
|
const char *domain;
|
|
|
|
const char *resource;
|
|
|
|
ks_hash_t *parameters;
|
2017-02-09 17:08:07 +00:00
|
|
|
};
|
2016-11-28 16:35:09 -05:00
|
|
|
|
2017-02-09 17:08:07 +00:00
|
|
|
|
|
|
|
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;
|
|
|
|
*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;
|
2017-02-13 19:07:33 +00:00
|
|
|
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);
|
2017-02-09 17:08:07 +00:00
|
|
|
|
|
|
|
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)
|
|
|
|
{
|
2017-02-13 19:07:33 +00:00
|
|
|
char *tmp = NULL;
|
|
|
|
char *tmp2 = NULL;
|
|
|
|
|
2017-02-09 17:08:07 +00:00
|
|
|
ks_assert(bi);
|
|
|
|
ks_assert(uri);
|
|
|
|
|
2017-02-14 19:04:48 +00:00
|
|
|
ks_log(KS_LOG_DEBUG, "Parsing URI: %s\n", uri);
|
|
|
|
|
2017-02-13 19:07:33 +00:00
|
|
|
if (bi->uri) {
|
|
|
|
ks_pool_free(bi->pool, &bi->uri);
|
|
|
|
ks_pool_free(bi->pool, &bi->components);
|
|
|
|
}
|
2017-02-10 18:14:48 +00:00
|
|
|
bi->uri = ks_pstrdup(bi->pool, uri);
|
2017-02-13 19:07:33 +00:00
|
|
|
bi->components = tmp = ks_pstrdup(bi->pool, uri);
|
2017-02-10 18:14:48 +00:00
|
|
|
|
2017-02-13 19:07:33 +00:00
|
|
|
bi->name = tmp;
|
|
|
|
if (!(tmp = strchr(tmp, '@'))) return KS_STATUS_FAIL;
|
|
|
|
*tmp++ = '\0';
|
2017-02-14 19:04:48 +00:00
|
|
|
|
2017-02-13 19:07:33 +00:00
|
|
|
bi->domain = tmp2 = tmp;
|
|
|
|
if ((tmp = strchr(tmp, '/'))) {
|
|
|
|
*tmp++ = '\0';
|
|
|
|
bi->resource = tmp2 = tmp;
|
|
|
|
} else tmp = tmp2;
|
2017-02-14 19:04:48 +00:00
|
|
|
|
2017-02-13 19:07:33 +00:00
|
|
|
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);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-02-14 19:04:48 +00:00
|
|
|
// @todo remove this, temporary for testing
|
|
|
|
ks_log(KS_LOG_DEBUG, " name: %s\n", bi->name);
|
|
|
|
ks_log(KS_LOG_DEBUG, " domain: %s\n", bi->domain);
|
|
|
|
ks_log(KS_LOG_DEBUG, " resource: %s\n", bi->resource);
|
|
|
|
for (ks_hash_iterator_t *it = ks_hash_first(bi->parameters, KS_UNLOCKED); it; it = ks_hash_next(&it)) {
|
|
|
|
const char *key = NULL;
|
|
|
|
const char *val = NULL;
|
|
|
|
|
|
|
|
ks_hash_this(it, (const void **)&key, NULL, (void **)&val);
|
|
|
|
|
|
|
|
ks_log(KS_LOG_DEBUG, " key: %s = %s\n", key, val);
|
|
|
|
}
|
|
|
|
|
2017-02-09 17:08:07 +00:00
|
|
|
return KS_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2017-02-14 19:04:48 +00:00
|
|
|
KS_DECLARE(const char *) blade_identity_uri(blade_identity_t *bi)
|
2017-02-09 17:08:07 +00:00
|
|
|
{
|
|
|
|
ks_assert(bi);
|
|
|
|
|
2017-02-14 19:04:48 +00:00
|
|
|
return bi->uri;
|
|
|
|
}
|
|
|
|
|
|
|
|
KS_DECLARE(ks_status_t) blade_identity_parameter_get(blade_identity_t *bi, const char *key, const char **value)
|
|
|
|
{
|
|
|
|
ks_assert(bi);
|
|
|
|
ks_assert(key);
|
|
|
|
ks_assert(value);
|
|
|
|
|
|
|
|
*value = (const char *)ks_hash_search(bi->parameters, (void *)key, KS_UNLOCKED);
|
|
|
|
|
2017-02-09 17:08:07 +00:00
|
|
|
return KS_STATUS_SUCCESS;
|
|
|
|
}
|
2017-02-14 19:04:48 +00:00
|
|
|
|
|
|
|
|
2016-11-28 16:35:09 -05:00
|
|
|
/* 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:
|
|
|
|
*/
|