2014-08-05 16:56:49 +00:00
|
|
|
/*
|
2015-02-17 21:11:34 +00:00
|
|
|
* ZeroTier One - Network Virtualization Everywhere
|
2016-01-12 22:04:55 +00:00
|
|
|
* Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
|
2014-08-05 16:56:49 +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 3 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, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "Dictionary.hpp"
|
|
|
|
#include "C25519.hpp"
|
|
|
|
#include "Identity.hpp"
|
|
|
|
#include "Utils.hpp"
|
|
|
|
|
|
|
|
namespace ZeroTier {
|
|
|
|
|
2015-10-02 01:12:16 +00:00
|
|
|
Dictionary::iterator Dictionary::find(const std::string &key)
|
|
|
|
{
|
|
|
|
for(iterator i(begin());i!=end();++i) {
|
|
|
|
if (i->first == key)
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
return end();
|
|
|
|
}
|
|
|
|
Dictionary::const_iterator Dictionary::find(const std::string &key) const
|
|
|
|
{
|
|
|
|
for(const_iterator i(begin());i!=end();++i) {
|
|
|
|
if (i->first == key)
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
return end();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Dictionary::getBoolean(const std::string &key,bool dfl) const
|
|
|
|
{
|
|
|
|
const_iterator e(find(key));
|
|
|
|
if (e == end())
|
|
|
|
return dfl;
|
|
|
|
if (e->second.length() < 1)
|
|
|
|
return dfl;
|
|
|
|
switch(e->second[0]) {
|
|
|
|
case '1':
|
|
|
|
case 't':
|
|
|
|
case 'T':
|
|
|
|
case 'y':
|
|
|
|
case 'Y':
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string &Dictionary::operator[](const std::string &key)
|
|
|
|
{
|
|
|
|
for(iterator i(begin());i!=end();++i) {
|
|
|
|
if (i->first == key)
|
|
|
|
return i->second;
|
|
|
|
}
|
|
|
|
push_back(std::pair<std::string,std::string>(key,std::string()));
|
|
|
|
std::sort(begin(),end());
|
|
|
|
for(iterator i(begin());i!=end();++i) {
|
|
|
|
if (i->first == key)
|
|
|
|
return i->second;
|
|
|
|
}
|
|
|
|
return front().second; // should be unreachable!
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string Dictionary::toString() const
|
|
|
|
{
|
|
|
|
std::string s;
|
|
|
|
for(const_iterator kv(begin());kv!=end();++kv) {
|
|
|
|
_appendEsc(kv->first.data(),(unsigned int)kv->first.length(),s);
|
|
|
|
s.push_back('=');
|
|
|
|
_appendEsc(kv->second.data(),(unsigned int)kv->second.length(),s);
|
|
|
|
s.append(ZT_EOL_S);
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2015-05-06 10:05:20 +00:00
|
|
|
void Dictionary::updateFromString(const char *s,unsigned int maxlen)
|
2014-08-05 16:56:49 +00:00
|
|
|
{
|
|
|
|
bool escapeState = false;
|
|
|
|
std::string keyBuf;
|
|
|
|
std::string *element = &keyBuf;
|
2014-08-08 16:46:00 +00:00
|
|
|
const char *end = s + maxlen;
|
|
|
|
while ((*s)&&(s < end)) {
|
2014-08-05 16:56:49 +00:00
|
|
|
if (escapeState) {
|
|
|
|
escapeState = false;
|
|
|
|
switch(*s) {
|
|
|
|
case '0':
|
|
|
|
element->push_back((char)0);
|
|
|
|
break;
|
|
|
|
case 'r':
|
|
|
|
element->push_back('\r');
|
|
|
|
break;
|
|
|
|
case 'n':
|
|
|
|
element->push_back('\n');
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
element->push_back(*s);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (*s == '\\') {
|
|
|
|
escapeState = true;
|
|
|
|
} else if (*s == '=') {
|
|
|
|
if (element == &keyBuf)
|
|
|
|
element = &((*this)[keyBuf]);
|
|
|
|
} else if ((*s == '\r')||(*s == '\n')) {
|
|
|
|
if ((element == &keyBuf)&&(keyBuf.length() > 0))
|
|
|
|
(*this)[keyBuf];
|
|
|
|
keyBuf = "";
|
|
|
|
element = &keyBuf;
|
|
|
|
} else element->push_back(*s);
|
|
|
|
}
|
|
|
|
++s;
|
|
|
|
}
|
|
|
|
if ((element == &keyBuf)&&(keyBuf.length() > 0))
|
|
|
|
(*this)[keyBuf];
|
|
|
|
}
|
|
|
|
|
2015-05-06 10:05:20 +00:00
|
|
|
void Dictionary::fromString(const char *s,unsigned int maxlen)
|
|
|
|
{
|
|
|
|
clear();
|
|
|
|
updateFromString(s,maxlen);
|
|
|
|
}
|
|
|
|
|
2015-10-02 01:12:16 +00:00
|
|
|
void Dictionary::eraseKey(const std::string &key)
|
|
|
|
{
|
|
|
|
for(iterator i(begin());i!=end();++i) {
|
|
|
|
if (i->first == key) {
|
|
|
|
this->erase(i);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-04-08 22:26:45 +00:00
|
|
|
bool Dictionary::sign(const Identity &id,uint64_t now)
|
2014-08-05 16:56:49 +00:00
|
|
|
{
|
|
|
|
try {
|
2014-08-08 16:46:00 +00:00
|
|
|
// Sign identity and timestamp fields too. If there's an existing
|
|
|
|
// signature, _mkSigBuf() ignores it.
|
2014-08-05 16:56:49 +00:00
|
|
|
char nows[32];
|
2015-04-08 22:26:45 +00:00
|
|
|
Utils::snprintf(nows,sizeof(nows),"%llx",(unsigned long long)now);
|
2014-08-05 16:56:49 +00:00
|
|
|
(*this)[ZT_DICTIONARY_SIGNATURE_IDENTITY] = id.toString(false);
|
|
|
|
(*this)[ZT_DICTIONARY_SIGNATURE_TIMESTAMP] = nows;
|
2014-08-08 16:46:00 +00:00
|
|
|
|
|
|
|
// Create a blob to hash and sign from fields in sorted order
|
|
|
|
std::string buf;
|
|
|
|
_mkSigBuf(buf);
|
|
|
|
|
|
|
|
// Add signature field
|
|
|
|
C25519::Signature sig(id.sign(buf.data(),(unsigned int)buf.length()));
|
|
|
|
(*this)[ZT_DICTIONARY_SIGNATURE] = Utils::hex(sig.data,(unsigned int)sig.size());
|
|
|
|
|
2014-08-05 16:56:49 +00:00
|
|
|
return true;
|
|
|
|
} catch ( ... ) {
|
2014-08-08 16:46:00 +00:00
|
|
|
// Probably means identity has no secret key field
|
|
|
|
removeSignature();
|
2014-08-05 16:56:49 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Dictionary::verify(const Identity &id) const
|
|
|
|
{
|
|
|
|
try {
|
|
|
|
std::string buf;
|
|
|
|
_mkSigBuf(buf);
|
|
|
|
const_iterator sig(find(ZT_DICTIONARY_SIGNATURE));
|
|
|
|
if (sig == end())
|
|
|
|
return false;
|
|
|
|
std::string sigbin(Utils::unhex(sig->second));
|
2014-08-08 21:57:13 +00:00
|
|
|
return id.verify(buf.data(),(unsigned int)buf.length(),sigbin.data(),(unsigned int)sigbin.length());
|
2014-08-05 16:56:49 +00:00
|
|
|
} catch ( ... ) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-08-14 23:52:22 +00:00
|
|
|
uint64_t Dictionary::signatureTimestamp() const
|
|
|
|
{
|
|
|
|
const_iterator ts(find(ZT_DICTIONARY_SIGNATURE_TIMESTAMP));
|
|
|
|
if (ts == end())
|
|
|
|
return 0;
|
|
|
|
return Utils::hexStrToU64(ts->second.c_str());
|
|
|
|
}
|
|
|
|
|
2014-08-05 16:56:49 +00:00
|
|
|
void Dictionary::_mkSigBuf(std::string &buf) const
|
|
|
|
{
|
|
|
|
unsigned long pairs = 0;
|
|
|
|
for(const_iterator i(begin());i!=end();++i) {
|
2014-08-08 16:46:00 +00:00
|
|
|
if (i->first != ZT_DICTIONARY_SIGNATURE) {
|
2014-08-05 16:56:49 +00:00
|
|
|
buf.append(i->first);
|
|
|
|
buf.push_back('=');
|
|
|
|
buf.append(i->second);
|
|
|
|
buf.push_back('\0');
|
|
|
|
++pairs;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
buf.push_back((char)0xff);
|
|
|
|
buf.push_back((char)((pairs >> 24) & 0xff)); // pad with number of key/value pairs at end
|
|
|
|
buf.push_back((char)((pairs >> 16) & 0xff));
|
|
|
|
buf.push_back((char)((pairs >> 8) & 0xff));
|
|
|
|
buf.push_back((char)(pairs & 0xff));
|
|
|
|
}
|
|
|
|
|
|
|
|
void Dictionary::_appendEsc(const char *data,unsigned int len,std::string &to)
|
|
|
|
{
|
|
|
|
for(unsigned int i=0;i<len;++i) {
|
|
|
|
switch(data[i]) {
|
|
|
|
case 0:
|
|
|
|
to.append("\\0");
|
|
|
|
break;
|
|
|
|
case '\r':
|
|
|
|
to.append("\\r");
|
|
|
|
break;
|
|
|
|
case '\n':
|
|
|
|
to.append("\\n");
|
|
|
|
break;
|
|
|
|
case '\\':
|
|
|
|
to.append("\\\\");
|
|
|
|
break;
|
|
|
|
case '=':
|
|
|
|
to.append("\\=");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
to.push_back(data[i]);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace ZeroTier
|