2012-07-23 05:47:21 +00:00
|
|
|
/*
|
2010-07-13 12:15:46 +00:00
|
|
|
Serval Distributed Numbering Architecture (DNA)
|
2012-07-23 05:47:21 +00:00
|
|
|
Copyright (C) 2010 Paul Gardner-Stephen
|
2010-07-13 12:15:46 +00:00
|
|
|
|
|
|
|
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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
*/
|
|
|
|
|
2012-02-23 02:15:42 +00:00
|
|
|
#include "serval.h"
|
2012-06-25 05:20:38 +00:00
|
|
|
#include "rhizome.h"
|
2012-11-07 06:12:45 +00:00
|
|
|
#include "str.h"
|
2012-06-08 05:57:15 +00:00
|
|
|
#include <ctype.h>
|
2010-07-13 12:15:46 +00:00
|
|
|
|
2013-10-03 07:14:06 +00:00
|
|
|
int cmp_sid_t(const sid_t *a, const sid_t *b)
|
|
|
|
{
|
|
|
|
return memcmp(a, b, sizeof a->binary);
|
|
|
|
}
|
|
|
|
|
2013-02-14 05:36:01 +00:00
|
|
|
int str_to_sid_t(sid_t *sid, const char *hex)
|
|
|
|
{
|
|
|
|
if (strcmp(hex, "broadcast") == 0) {
|
|
|
|
*sid = SID_BROADCAST;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return fromhexstr(sid->binary, hex, sizeof sid->binary);
|
|
|
|
}
|
|
|
|
|
|
|
|
int strn_to_sid_t(sid_t *sid, const char *hex, const char **endp)
|
|
|
|
{
|
|
|
|
if (str_startswith(hex, "broadcast", endp) == 0) {
|
|
|
|
*sid = SID_BROADCAST;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
sid_t tmp;
|
|
|
|
int n = fromhex(tmp.binary, hex, sizeof tmp.binary);
|
|
|
|
if (n != sizeof tmp.binary)
|
|
|
|
return -1;
|
|
|
|
*sid = tmp;
|
|
|
|
if (endp)
|
|
|
|
*endp = hex + sizeof sid->binary * 2;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-07-12 06:44:25 +00:00
|
|
|
int str_is_subscriber_id(const char *sid)
|
|
|
|
{
|
2012-07-23 02:53:17 +00:00
|
|
|
size_t len = 0;
|
|
|
|
return strn_is_subscriber_id(sid, &len) && sid[len] == '\0';
|
2012-07-12 06:44:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int strn_is_subscriber_id(const char *sid, size_t *lenp)
|
|
|
|
{
|
|
|
|
if (strncasecmp(sid, "broadcast", 9) == 0) {
|
|
|
|
if (lenp)
|
|
|
|
*lenp = 9;
|
|
|
|
return 1;
|
|
|
|
}
|
2012-11-07 06:12:45 +00:00
|
|
|
if (is_xsubstring(sid, SID_STRLEN)) {
|
2012-07-12 06:44:25 +00:00
|
|
|
if (lenp)
|
|
|
|
*lenp = SID_STRLEN;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-06-25 05:20:38 +00:00
|
|
|
int rhizome_strn_is_manifest_id(const char *id)
|
|
|
|
{
|
2012-11-07 06:12:45 +00:00
|
|
|
return is_xsubstring(id, RHIZOME_MANIFEST_ID_STRLEN);
|
2012-06-25 05:20:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int rhizome_str_is_manifest_id(const char *id)
|
|
|
|
{
|
2012-11-07 06:12:45 +00:00
|
|
|
return is_xstring(id, RHIZOME_MANIFEST_ID_STRLEN);
|
2012-06-25 05:20:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int rhizome_strn_is_bundle_key(const char *key)
|
|
|
|
{
|
2012-11-07 06:12:45 +00:00
|
|
|
return is_xsubstring(key, RHIZOME_BUNDLE_KEY_STRLEN);
|
2012-06-25 05:20:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int rhizome_str_is_bundle_key(const char *key)
|
|
|
|
{
|
2012-11-07 06:12:45 +00:00
|
|
|
return is_xstring(key, RHIZOME_BUNDLE_KEY_STRLEN);
|
2012-06-25 05:20:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int rhizome_strn_is_bundle_crypt_key(const char *key)
|
|
|
|
{
|
2012-11-07 06:12:45 +00:00
|
|
|
return is_xsubstring(key, RHIZOME_CRYPT_KEY_STRLEN);
|
2012-06-25 05:20:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int rhizome_str_is_bundle_crypt_key(const char *key)
|
|
|
|
{
|
2012-11-07 06:12:45 +00:00
|
|
|
return is_xstring(key, RHIZOME_CRYPT_KEY_STRLEN);
|
2012-06-25 05:20:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int rhizome_strn_is_file_hash(const char *hash)
|
|
|
|
{
|
2012-11-07 06:12:45 +00:00
|
|
|
return is_xsubstring(hash, RHIZOME_FILEHASH_STRLEN);
|
2012-06-25 05:20:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int rhizome_str_is_file_hash(const char *hash)
|
|
|
|
{
|
2012-11-07 06:12:45 +00:00
|
|
|
return is_xstring(hash, RHIZOME_FILEHASH_STRLEN);
|
2012-06-25 05:20:38 +00:00
|
|
|
}
|
|
|
|
|
2012-07-23 02:53:17 +00:00
|
|
|
int str_is_did(const char *did)
|
|
|
|
{
|
|
|
|
size_t len = 0;
|
|
|
|
return strn_is_did(did, &len) && did[len] == '\0';
|
|
|
|
}
|
|
|
|
|
2012-07-23 05:47:21 +00:00
|
|
|
int is_didchar(char c)
|
|
|
|
{
|
|
|
|
return isdigit(c) || c == '*' || c == '#' || c == '+';
|
|
|
|
}
|
|
|
|
|
2012-07-23 02:53:17 +00:00
|
|
|
int strn_is_did(const char *did, size_t *lenp)
|
|
|
|
{
|
|
|
|
int i;
|
2012-07-23 05:47:21 +00:00
|
|
|
for (i = 0; i < DID_MAXSIZE && is_didchar(did[i]); ++i)
|
|
|
|
;
|
2012-07-23 02:53:17 +00:00
|
|
|
if (i < DID_MINSIZE)
|
|
|
|
return 0;
|
|
|
|
if (lenp)
|
|
|
|
*lenp = i;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2012-12-03 03:40:32 +00:00
|
|
|
void write_uint64(unsigned char *o,uint64_t v)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for(i=0;i<8;i++)
|
|
|
|
{ *(o++)=v&0xff; v=v>>8; }
|
|
|
|
}
|
|
|
|
|
|
|
|
void write_uint32(unsigned char *o,uint32_t v)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for(i=0;i<4;i++)
|
|
|
|
{ *(o++)=v&0xff; v=v>>8; }
|
|
|
|
}
|
|
|
|
|
|
|
|
void write_uint16(unsigned char *o,uint16_t v)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for(i=0;i<2;i++)
|
|
|
|
{ *(o++)=v&0xff; v=v>>8; }
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t read_uint64(unsigned char *o)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
uint64_t v=0;
|
|
|
|
for(i=0;i<8;i++) v=(v<<8)|o[8-1-i];
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t read_uint32(unsigned char *o)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
uint32_t v=0;
|
|
|
|
for(i=0;i<4;i++) v=(v<<8)|o[4-1-i];
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint16_t read_uint16(unsigned char *o)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
uint16_t v=0;
|
|
|
|
for(i=0;i<2;i++) v=(v<<8)|o[2-1-i];
|
|
|
|
return v;
|
|
|
|
}
|