2015-06-21 23:42:29 -07:00
|
|
|
/*----------------------------------------------------------------------------*/
|
|
|
|
|
/* Copyright (c) FIRST 2015. All Rights Reserved. */
|
|
|
|
|
/* Open Source Software - may be modified and shared by FRC teams. The code */
|
|
|
|
|
/* must be accompanied by the FIRST BSD license file in the root directory of */
|
|
|
|
|
/* the project. */
|
|
|
|
|
/*----------------------------------------------------------------------------*/
|
|
|
|
|
|
2015-06-25 23:12:49 -07:00
|
|
|
#include "Storage.h"
|
2015-06-21 23:42:29 -07:00
|
|
|
|
2015-06-27 10:22:59 -07:00
|
|
|
#include <string>
|
|
|
|
|
#include <tuple>
|
|
|
|
|
|
|
|
|
|
#include "llvm/StringExtras.h"
|
2015-06-28 22:25:17 -07:00
|
|
|
#include "Base64.h"
|
2015-07-31 22:41:26 -07:00
|
|
|
#include "Log.h"
|
2015-06-27 10:22:59 -07:00
|
|
|
|
2015-07-17 07:21:07 -07:00
|
|
|
using namespace nt;
|
2015-06-21 23:42:29 -07:00
|
|
|
|
2015-07-20 23:36:22 -07:00
|
|
|
ATOMIC_STATIC_INIT(Storage)
|
2015-06-21 23:42:29 -07:00
|
|
|
|
2015-07-31 13:21:19 -07:00
|
|
|
Storage::Storage() {}
|
2015-06-21 23:42:29 -07:00
|
|
|
|
2015-06-25 22:57:43 -07:00
|
|
|
Storage::~Storage() {}
|
2015-06-27 10:22:59 -07:00
|
|
|
|
2015-07-29 23:45:04 -07:00
|
|
|
void Storage::SetOutgoing(QueueOutgoingFunc queue_outgoing, bool server) {
|
2015-07-28 22:06:42 -07:00
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
2015-07-29 23:45:04 -07:00
|
|
|
m_queue_outgoing = queue_outgoing;
|
|
|
|
|
m_server = server;
|
2015-07-28 22:06:42 -07:00
|
|
|
}
|
|
|
|
|
|
2015-07-29 23:45:04 -07:00
|
|
|
void Storage::ClearOutgoing() {
|
|
|
|
|
m_queue_outgoing = nullptr;
|
2015-07-29 20:33:13 -07:00
|
|
|
}
|
|
|
|
|
|
2015-07-29 23:45:04 -07:00
|
|
|
NT_Type Storage::GetEntryType(unsigned int id) const {
|
2015-07-29 20:33:13 -07:00
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
2015-07-29 23:45:04 -07:00
|
|
|
if (id >= m_idmap.size()) return NT_UNASSIGNED;
|
2015-07-31 14:16:13 -07:00
|
|
|
auto entry = m_idmap[id];
|
|
|
|
|
if (!entry || !entry->value) return NT_UNASSIGNED;
|
|
|
|
|
return entry->value->type();
|
2015-07-29 23:45:04 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void Storage::ProcessIncoming(std::shared_ptr<Message> msg,
|
|
|
|
|
NetworkConnection* conn, unsigned int proto_rev) {
|
|
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
|
|
|
|
switch (msg->type()) {
|
|
|
|
|
case Message::kKeepAlive:
|
|
|
|
|
break; // ignore
|
|
|
|
|
case Message::kClientHello:
|
|
|
|
|
case Message::kProtoUnsup:
|
|
|
|
|
case Message::kServerHelloDone:
|
|
|
|
|
case Message::kServerHello:
|
|
|
|
|
case Message::kClientHelloDone:
|
|
|
|
|
// shouldn't get these, but ignore if we do
|
|
|
|
|
break;
|
|
|
|
|
case Message::kEntryAssign: {
|
|
|
|
|
unsigned int id = msg->id();
|
|
|
|
|
StringRef name = msg->str();
|
2015-07-31 13:48:33 -07:00
|
|
|
std::shared_ptr<Entry> entry;
|
2015-07-31 13:21:19 -07:00
|
|
|
bool may_need_update = false;
|
2015-07-29 23:45:04 -07:00
|
|
|
if (m_server) {
|
|
|
|
|
// if we're a server, id=0xffff requests are requests for an id
|
|
|
|
|
// to be assigned, and we need to send the new assignment back to
|
|
|
|
|
// the sender as well as all other connections.
|
|
|
|
|
if (id == 0xffff) {
|
|
|
|
|
// see if it was already assigned; ignore if so.
|
|
|
|
|
if (m_entries.count(name) != 0) return;
|
|
|
|
|
|
|
|
|
|
// create it locally
|
|
|
|
|
id = m_idmap.size();
|
|
|
|
|
auto& new_entry = m_entries[name];
|
2015-07-31 13:48:33 -07:00
|
|
|
if (!new_entry) new_entry = std::make_shared<Entry>(name);
|
2015-07-29 23:45:04 -07:00
|
|
|
entry = new_entry;
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->value = msg->value();
|
|
|
|
|
entry->flags = msg->flags();
|
|
|
|
|
entry->id = id;
|
2015-07-29 23:45:04 -07:00
|
|
|
m_idmap.push_back(entry);
|
|
|
|
|
|
|
|
|
|
// send the assignment to everyone (including the originator)
|
2015-07-31 13:21:19 -07:00
|
|
|
if (m_queue_outgoing) {
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
auto outmsg = Message::EntryAssign(
|
2015-07-31 13:48:33 -07:00
|
|
|
name, id, entry->seq_num.value(), msg->value(), msg->flags());
|
2015-07-31 13:21:19 -07:00
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(outmsg, nullptr, nullptr);
|
|
|
|
|
}
|
2015-07-29 23:45:04 -07:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
if (id >= m_idmap.size() || !m_idmap[id]) {
|
|
|
|
|
// ignore arbitrary entry assignments
|
|
|
|
|
// this can happen due to e.g. assignment to deleted entry
|
|
|
|
|
lock.unlock();
|
|
|
|
|
DEBUG("server: received assignment to unknown entry");
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
entry = m_idmap[id];
|
|
|
|
|
} else {
|
|
|
|
|
// clients simply accept new assignments
|
|
|
|
|
if (id == 0xffff) {
|
|
|
|
|
lock.unlock();
|
|
|
|
|
DEBUG("client: received entry assignment request?");
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
if (id >= m_idmap.size()) m_idmap.resize(id+1);
|
|
|
|
|
entry = m_idmap[id];
|
|
|
|
|
if (!entry) {
|
|
|
|
|
// create local
|
|
|
|
|
auto& new_entry = m_entries[name];
|
2015-07-31 13:21:19 -07:00
|
|
|
if (!new_entry) {
|
|
|
|
|
// didn't exist at all (rather than just being a response to a
|
|
|
|
|
// id assignment request)
|
2015-07-31 13:48:33 -07:00
|
|
|
new_entry = std::make_shared<Entry>(name);
|
|
|
|
|
new_entry->value = msg->value();
|
|
|
|
|
new_entry->flags = msg->flags();
|
2015-07-31 13:21:19 -07:00
|
|
|
} else
|
|
|
|
|
may_need_update = true; // we may need to send an update message
|
2015-07-29 23:45:04 -07:00
|
|
|
entry = new_entry;
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->id = id;
|
2015-07-29 23:45:04 -07:00
|
|
|
m_idmap[id] = entry;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// common client and server handling
|
|
|
|
|
|
|
|
|
|
// already exists; ignore if sequence number not higher than local
|
|
|
|
|
SequenceNumber seq_num(msg->seq_num_uid());
|
2015-07-31 13:48:33 -07:00
|
|
|
if (seq_num <= entry->seq_num) {
|
2015-07-31 13:21:19 -07:00
|
|
|
if (may_need_update) {
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
2015-07-31 13:48:33 -07:00
|
|
|
auto msg = Message::EntryUpdate(entry->id, entry->seq_num.value(),
|
|
|
|
|
entry->value);
|
2015-07-31 13:21:19 -07:00
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(msg, nullptr, nullptr);
|
|
|
|
|
}
|
|
|
|
|
return;
|
|
|
|
|
}
|
2015-07-29 23:45:04 -07:00
|
|
|
|
|
|
|
|
// sanity check: name should match id
|
2015-07-31 13:48:33 -07:00
|
|
|
if (msg->str() != entry->name) {
|
2015-07-29 23:45:04 -07:00
|
|
|
lock.unlock();
|
|
|
|
|
DEBUG("entry assignment for same id with different name?");
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// update local
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->value = msg->value();
|
|
|
|
|
entry->seq_num = seq_num;
|
2015-07-29 23:45:04 -07:00
|
|
|
|
|
|
|
|
// don't update flags from a <3.0 remote (not part of message)
|
2015-07-31 13:48:33 -07:00
|
|
|
if (proto_rev >= 0x0300) entry->flags = msg->flags();
|
2015-07-29 23:45:04 -07:00
|
|
|
|
|
|
|
|
// broadcast to all other connections (note for client there won't
|
|
|
|
|
// be any other connections, so don't bother)
|
2015-07-31 13:21:19 -07:00
|
|
|
if (m_server && m_queue_outgoing) {
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
auto outmsg =
|
2015-07-31 13:48:33 -07:00
|
|
|
Message::EntryAssign(entry->name, id, msg->seq_num_uid(),
|
|
|
|
|
msg->value(), entry->flags);
|
2015-07-31 13:21:19 -07:00
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(outmsg, nullptr, conn);
|
|
|
|
|
}
|
2015-07-29 23:45:04 -07:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Message::kEntryUpdate: {
|
|
|
|
|
unsigned int id = msg->id();
|
|
|
|
|
if (id >= m_idmap.size() || !m_idmap[id]) {
|
|
|
|
|
// ignore arbitrary entry updates;
|
|
|
|
|
// this can happen due to deleted entries
|
|
|
|
|
lock.unlock();
|
|
|
|
|
DEBUG("received update to unknown entry");
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
auto& entry = m_idmap[id];
|
|
|
|
|
|
|
|
|
|
// ignore if sequence number not higher than local
|
|
|
|
|
SequenceNumber seq_num(msg->seq_num_uid());
|
2015-07-31 13:48:33 -07:00
|
|
|
if (seq_num <= entry->seq_num) return;
|
2015-07-29 23:45:04 -07:00
|
|
|
|
|
|
|
|
// update local
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->value = msg->value();
|
|
|
|
|
entry->seq_num = seq_num;
|
2015-07-29 23:45:04 -07:00
|
|
|
|
|
|
|
|
// broadcast to all other connections (note for client there won't
|
|
|
|
|
// be any other connections, so don't bother)
|
2015-07-31 13:21:19 -07:00
|
|
|
if (m_server && m_queue_outgoing) {
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(msg, nullptr, conn);
|
|
|
|
|
}
|
2015-07-29 23:45:04 -07:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Message::kFlagsUpdate: {
|
|
|
|
|
unsigned int id = msg->id();
|
|
|
|
|
if (id >= m_idmap.size() || !m_idmap[id]) {
|
|
|
|
|
// ignore arbitrary entry updates;
|
|
|
|
|
// this can happen due to deleted entries
|
|
|
|
|
lock.unlock();
|
|
|
|
|
DEBUG("received flags update to unknown entry");
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
auto& entry = m_idmap[id];
|
|
|
|
|
|
|
|
|
|
// update local
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->flags = msg->flags();
|
2015-07-29 23:45:04 -07:00
|
|
|
|
|
|
|
|
// broadcast to all other connections (note for client there won't
|
|
|
|
|
// be any other connections, so don't bother)
|
2015-07-31 13:21:19 -07:00
|
|
|
if (m_server && m_queue_outgoing) {
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(msg, nullptr, conn);
|
|
|
|
|
}
|
2015-07-29 23:45:04 -07:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Message::kEntryDelete: {
|
|
|
|
|
unsigned int id = msg->id();
|
|
|
|
|
if (id >= m_idmap.size() || !m_idmap[id]) {
|
|
|
|
|
// ignore arbitrary entry updates;
|
|
|
|
|
// this can happen due to deleted entries
|
|
|
|
|
lock.unlock();
|
|
|
|
|
DEBUG("received delete to unknown entry");
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
auto& entry = m_idmap[id];
|
|
|
|
|
|
|
|
|
|
// update local
|
2015-07-31 13:48:33 -07:00
|
|
|
m_entries.erase(entry->name); // erase from map
|
2015-07-29 23:45:04 -07:00
|
|
|
entry.reset(); // delete it from idmap too
|
|
|
|
|
|
|
|
|
|
// broadcast to all other connections (note for client there won't
|
|
|
|
|
// be any other connections, so don't bother)
|
2015-07-31 13:21:19 -07:00
|
|
|
if (m_server && m_queue_outgoing) {
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(msg, nullptr, conn);
|
|
|
|
|
}
|
2015-07-29 23:45:04 -07:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Message::kClearEntries: {
|
|
|
|
|
// update local
|
|
|
|
|
m_entries.clear();
|
|
|
|
|
m_idmap.resize(0);
|
|
|
|
|
|
|
|
|
|
// broadcast to all other connections (note for client there won't
|
|
|
|
|
// be any other connections, so don't bother)
|
2015-07-31 13:21:19 -07:00
|
|
|
if (m_server && m_queue_outgoing) {
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(msg, nullptr, conn);
|
|
|
|
|
}
|
2015-07-29 23:45:04 -07:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Message::kExecuteRpc:
|
|
|
|
|
case Message::kRpcResponse:
|
|
|
|
|
// TODO
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
2015-07-29 20:33:13 -07:00
|
|
|
}
|
|
|
|
|
|
2015-07-31 20:32:52 -07:00
|
|
|
void Storage::GetInitialAssignments(
|
|
|
|
|
std::vector<std::shared_ptr<Message>>* msgs) {
|
|
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
|
|
|
|
for (auto& i : m_entries) {
|
|
|
|
|
auto entry = i.getValue();
|
|
|
|
|
msgs->emplace_back(Message::EntryAssign(i.getKey(), entry->id,
|
|
|
|
|
entry->seq_num.value(),
|
|
|
|
|
entry->value, entry->flags));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void Storage::ApplyInitialAssignments(
|
|
|
|
|
llvm::ArrayRef<std::shared_ptr<Message>> msgs, bool new_server,
|
|
|
|
|
unsigned int proto_rev, std::vector<std::shared_ptr<Message>>* out_msgs) {
|
|
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
|
|
|
|
if (m_server) return; // should not do this on server
|
|
|
|
|
|
|
|
|
|
std::vector<std::shared_ptr<Message>> update_msgs;
|
|
|
|
|
|
|
|
|
|
// clear existing id's
|
|
|
|
|
for (auto& i : m_entries) i.getValue()->id = 0xffff;
|
|
|
|
|
|
|
|
|
|
// clear existing idmap
|
|
|
|
|
m_idmap.resize(0);
|
|
|
|
|
|
|
|
|
|
// apply assignments
|
|
|
|
|
for (auto& msg : msgs) {
|
|
|
|
|
if (!msg->Is(Message::kEntryAssign)) {
|
|
|
|
|
DEBUG("client: received non-entry assignment request?");
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned int id = msg->id();
|
|
|
|
|
if (id == 0xffff) {
|
|
|
|
|
DEBUG("client: received entry assignment request?");
|
|
|
|
|
continue;
|
2015-07-31 13:21:19 -07:00
|
|
|
}
|
2015-07-31 20:32:52 -07:00
|
|
|
|
|
|
|
|
SequenceNumber seq_num(msg->seq_num_uid());
|
|
|
|
|
StringRef name = msg->str();
|
|
|
|
|
|
|
|
|
|
auto& entry = m_entries[name];
|
|
|
|
|
if (!entry) {
|
|
|
|
|
// doesn't currently exist
|
|
|
|
|
entry = std::make_shared<Entry>(name);
|
|
|
|
|
entry->value = msg->value();
|
|
|
|
|
entry->flags = msg->flags();
|
|
|
|
|
entry->seq_num = seq_num;
|
|
|
|
|
} else {
|
|
|
|
|
// if reconnect and sequence number not higher than local, then we
|
|
|
|
|
// don't update the local value and instead send it back to the server
|
|
|
|
|
// as an update message
|
|
|
|
|
if (!new_server && seq_num <= entry->seq_num) {
|
|
|
|
|
update_msgs.emplace_back(Message::EntryUpdate(
|
|
|
|
|
entry->id, entry->seq_num.value(), entry->value));
|
|
|
|
|
} else {
|
|
|
|
|
entry->value = msg->value();
|
|
|
|
|
entry->seq_num = seq_num;
|
|
|
|
|
// don't update flags from a <3.0 remote (not part of message)
|
|
|
|
|
if (proto_rev >= 0x0300) entry->flags = msg->flags();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// set id and save to idmap
|
|
|
|
|
entry->id = id;
|
|
|
|
|
if (id >= m_idmap.size()) m_idmap.resize(id+1);
|
|
|
|
|
m_idmap[id] = entry;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// generate assign messages for unassigned local entries
|
|
|
|
|
for (auto& i : m_entries) {
|
|
|
|
|
auto entry = i.getValue();
|
|
|
|
|
if (entry->id != 0xffff) continue;
|
|
|
|
|
out_msgs->emplace_back(Message::EntryAssign(entry->name, entry->id,
|
|
|
|
|
entry->seq_num.value(),
|
|
|
|
|
entry->value, entry->flags));
|
2015-07-26 20:41:48 -07:00
|
|
|
}
|
2015-07-31 20:32:52 -07:00
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
lock.unlock();
|
|
|
|
|
for (auto& msg : update_msgs) queue_outgoing(msg, nullptr, nullptr);
|
2015-07-26 20:41:48 -07:00
|
|
|
}
|
|
|
|
|
|
2015-07-31 13:21:19 -07:00
|
|
|
std::shared_ptr<Value> Storage::GetEntryValue(StringRef name) const {
|
2015-07-18 01:29:51 -07:00
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
|
|
|
|
auto i = m_entries.find(name);
|
2015-07-31 13:48:33 -07:00
|
|
|
return i == m_entries.end() ? nullptr : i->getValue()->value;
|
2015-07-18 01:29:51 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool Storage::SetEntryValue(StringRef name, std::shared_ptr<Value> value) {
|
|
|
|
|
if (name.empty()) return true;
|
|
|
|
|
if (!value) return true;
|
2015-07-31 13:21:19 -07:00
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
|
|
|
|
auto& new_entry = m_entries[name];
|
2015-07-31 13:48:33 -07:00
|
|
|
if (!new_entry) new_entry = std::make_shared<Entry>(name);
|
2015-07-31 13:21:19 -07:00
|
|
|
auto entry = new_entry;
|
2015-07-31 13:48:33 -07:00
|
|
|
auto old_value = entry->value;
|
2015-07-19 16:02:21 -07:00
|
|
|
if (old_value && old_value->type() != value->type())
|
2015-07-18 01:29:51 -07:00
|
|
|
return false; // error on type mismatch
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->value = value;
|
2015-07-31 13:21:19 -07:00
|
|
|
|
|
|
|
|
// if we're the server, assign an id if it doesn't have one
|
2015-07-31 13:48:33 -07:00
|
|
|
if (m_server && entry->id == 0xffff) {
|
2015-07-31 13:21:19 -07:00
|
|
|
unsigned int id = m_idmap.size();
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->id = id;
|
2015-07-31 13:21:19 -07:00
|
|
|
m_idmap.push_back(entry);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// generate message
|
|
|
|
|
if (!m_queue_outgoing) return true;
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
if (!old_value) {
|
2015-07-31 13:48:33 -07:00
|
|
|
auto msg = Message::EntryAssign(name, entry->id, entry->seq_num.value(),
|
|
|
|
|
value, entry->flags);
|
2015-07-31 13:21:19 -07:00
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(msg, nullptr, nullptr);
|
|
|
|
|
} else if (*old_value != *value) {
|
2015-07-31 13:48:33 -07:00
|
|
|
++entry->seq_num;
|
2015-07-31 13:21:19 -07:00
|
|
|
// don't send an update if we don't have an assigned id yet
|
2015-07-31 13:48:33 -07:00
|
|
|
if (entry->id != 0xffff) {
|
2015-07-31 13:21:19 -07:00
|
|
|
auto msg =
|
2015-07-31 13:48:33 -07:00
|
|
|
Message::EntryUpdate(entry->id, entry->seq_num.value(), value);
|
2015-07-31 13:21:19 -07:00
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(msg, nullptr, nullptr);
|
|
|
|
|
}
|
|
|
|
|
}
|
2015-07-18 01:29:51 -07:00
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void Storage::SetEntryTypeValue(StringRef name, std::shared_ptr<Value> value) {
|
|
|
|
|
if (name.empty()) return;
|
|
|
|
|
if (!value) return;
|
2015-07-31 13:21:19 -07:00
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
2015-07-26 09:27:23 -07:00
|
|
|
auto& entry = m_entries[name];
|
2015-07-31 13:48:33 -07:00
|
|
|
if (!entry) entry = std::make_shared<Entry>(name);
|
|
|
|
|
auto old_value = entry->value;
|
|
|
|
|
entry->value = value;
|
2015-07-31 13:21:19 -07:00
|
|
|
if (old_value && *old_value == *value) return;
|
|
|
|
|
|
|
|
|
|
// if we're the server, assign an id if it doesn't have one
|
2015-07-31 13:48:33 -07:00
|
|
|
if (m_server && entry->id == 0xffff) {
|
2015-07-31 13:21:19 -07:00
|
|
|
unsigned int id = m_idmap.size();
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->id = id;
|
2015-07-31 13:21:19 -07:00
|
|
|
m_idmap.push_back(entry);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// generate message
|
|
|
|
|
if (!m_queue_outgoing) return;
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
if (!old_value || old_value->type() != value->type()) {
|
2015-07-31 13:48:33 -07:00
|
|
|
++entry->seq_num;
|
|
|
|
|
auto msg = Message::EntryAssign(name, entry->id, entry->seq_num.value(),
|
|
|
|
|
value, entry->flags);
|
2015-07-31 13:21:19 -07:00
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(msg, nullptr, nullptr);
|
|
|
|
|
} else {
|
2015-07-31 13:48:33 -07:00
|
|
|
++entry->seq_num;
|
2015-07-31 13:21:19 -07:00
|
|
|
// don't send an update if we don't have an assigned id yet
|
2015-07-31 13:48:33 -07:00
|
|
|
if (entry->id != 0xffff) {
|
2015-07-31 13:21:19 -07:00
|
|
|
auto msg =
|
2015-07-31 13:48:33 -07:00
|
|
|
Message::EntryUpdate(entry->id, entry->seq_num.value(), value);
|
2015-07-31 13:21:19 -07:00
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(msg, nullptr, nullptr);
|
|
|
|
|
}
|
2015-07-18 01:29:51 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void Storage::SetEntryFlags(StringRef name, unsigned int flags) {
|
2015-07-19 17:50:31 -07:00
|
|
|
if (name.empty()) return;
|
2015-07-31 13:21:19 -07:00
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
2015-07-26 09:27:23 -07:00
|
|
|
auto i = m_entries.find(name);
|
|
|
|
|
if (i == m_entries.end()) return;
|
|
|
|
|
auto entry = i->getValue();
|
2015-07-31 13:48:33 -07:00
|
|
|
if (entry->flags == flags) return;
|
|
|
|
|
entry->flags = flags;
|
2015-07-31 13:21:19 -07:00
|
|
|
|
|
|
|
|
// generate message
|
|
|
|
|
if (!m_queue_outgoing) return;
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
2015-07-31 13:48:33 -07:00
|
|
|
unsigned int id = entry->id;
|
2015-07-31 13:21:19 -07:00
|
|
|
// don't send an update if we don't have an assigned id yet
|
|
|
|
|
if (id != 0xffff) {
|
|
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(Message::FlagsUpdate(id, flags), nullptr, nullptr);
|
2015-07-19 16:02:21 -07:00
|
|
|
}
|
2015-07-18 01:29:51 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned int Storage::GetEntryFlags(StringRef name) const {
|
2015-07-31 13:21:19 -07:00
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
|
|
|
|
auto i = m_entries.find(name);
|
2015-07-31 13:48:33 -07:00
|
|
|
return i == m_entries.end() ? 0 : i->getValue()->flags;
|
2015-07-18 01:29:51 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void Storage::DeleteEntry(StringRef name) {
|
2015-07-31 13:21:19 -07:00
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
2015-07-19 18:10:26 -07:00
|
|
|
auto i = m_entries.find(name);
|
|
|
|
|
if (i == m_entries.end()) return;
|
|
|
|
|
auto entry = i->getValue();
|
2015-07-31 13:48:33 -07:00
|
|
|
unsigned int id = entry->id;
|
2015-07-19 18:10:26 -07:00
|
|
|
m_entries.erase(i); // erase from map
|
2015-07-31 13:21:19 -07:00
|
|
|
if (id < m_idmap.size()) m_idmap[id].reset();
|
|
|
|
|
|
2015-07-31 13:48:33 -07:00
|
|
|
if (!entry->value) return;
|
2015-07-31 13:21:19 -07:00
|
|
|
|
|
|
|
|
// if it had a value, generate message
|
|
|
|
|
// don't send an update if we don't have an assigned id yet
|
|
|
|
|
if (id != 0xffff) {
|
|
|
|
|
if (!m_queue_outgoing) return;
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(Message::EntryDelete(id), nullptr, nullptr);
|
|
|
|
|
}
|
2015-07-18 01:29:51 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void Storage::DeleteAllEntries() {
|
2015-07-31 13:21:19 -07:00
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
2015-07-19 18:10:26 -07:00
|
|
|
if (m_entries.empty()) return;
|
|
|
|
|
m_entries.clear();
|
2015-07-31 13:21:19 -07:00
|
|
|
m_idmap.resize(0);
|
|
|
|
|
|
|
|
|
|
// generate message
|
|
|
|
|
if (!m_queue_outgoing) return;
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
lock.unlock();
|
|
|
|
|
queue_outgoing(Message::ClearEntries(), nullptr, nullptr);
|
2015-07-18 01:29:51 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
std::vector<EntryInfo> Storage::GetEntryInfo(StringRef prefix,
|
|
|
|
|
unsigned int types) {
|
|
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
|
|
|
|
std::vector<EntryInfo> infos;
|
|
|
|
|
for (auto& i : m_entries) {
|
|
|
|
|
if (!i.getKey().startswith(prefix)) continue;
|
2015-07-19 16:02:21 -07:00
|
|
|
auto entry = i.getValue();
|
2015-07-31 13:48:33 -07:00
|
|
|
auto value = entry->value;
|
2015-07-19 16:02:21 -07:00
|
|
|
if (!value) continue;
|
2015-07-19 19:42:13 -07:00
|
|
|
if (types != 0 && (types & value->type()) == 0) continue;
|
2015-07-18 01:29:51 -07:00
|
|
|
EntryInfo info;
|
|
|
|
|
info.name = i.getKey();
|
2015-07-19 16:02:21 -07:00
|
|
|
info.type = value->type();
|
2015-07-31 13:48:33 -07:00
|
|
|
info.flags = entry->flags;
|
2015-07-19 16:02:21 -07:00
|
|
|
info.last_change = value->last_change();
|
2015-07-18 01:29:51 -07:00
|
|
|
infos.push_back(std::move(info));
|
|
|
|
|
}
|
|
|
|
|
return infos;
|
|
|
|
|
}
|
|
|
|
|
|
2015-06-28 21:52:06 -07:00
|
|
|
/* Escapes and writes a string, including start and end double quotes */
|
2015-06-27 10:22:59 -07:00
|
|
|
static void WriteString(std::ostream& os, llvm::StringRef str) {
|
|
|
|
|
os << '"';
|
|
|
|
|
for (auto c : str) {
|
|
|
|
|
switch (c) {
|
|
|
|
|
case '\\':
|
|
|
|
|
os << "\\\\";
|
|
|
|
|
break;
|
|
|
|
|
case '\t':
|
|
|
|
|
os << "\\t";
|
|
|
|
|
break;
|
|
|
|
|
case '\n':
|
|
|
|
|
os << "\\n";
|
|
|
|
|
break;
|
|
|
|
|
case '"':
|
|
|
|
|
os << "\\\"";
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
if (std::isprint(c)) {
|
|
|
|
|
os << c;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Write out the escaped representation.
|
|
|
|
|
os << "\\x";
|
|
|
|
|
os << llvm::hexdigit((c >> 4) & 0xF);
|
|
|
|
|
os << llvm::hexdigit((c >> 0) & 0xF);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
os << '"';
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void Storage::SavePersistent(std::ostream& os) const {
|
2015-07-18 01:29:51 -07:00
|
|
|
// copy values out of storage as quickly as possible so lock isn't held
|
|
|
|
|
std::vector<std::pair<std::string, std::shared_ptr<Value>>> entries;
|
|
|
|
|
{
|
|
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
|
|
|
|
entries.reserve(m_entries.size());
|
|
|
|
|
for (auto& i : m_entries) {
|
2015-07-19 16:02:21 -07:00
|
|
|
auto entry = i.getValue();
|
2015-07-18 01:29:51 -07:00
|
|
|
// only write persistent-flagged values
|
2015-07-19 16:02:21 -07:00
|
|
|
if (!entry->IsPersistent()) continue;
|
2015-07-31 13:48:33 -07:00
|
|
|
entries.push_back(std::make_pair(i.getKey(), entry->value));
|
2015-07-18 01:29:51 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2015-07-19 21:10:20 -07:00
|
|
|
// sort in name order
|
|
|
|
|
std::sort(entries.begin(), entries.end(),
|
|
|
|
|
[](const auto& a, const auto& b) { return a.first < b.first; });
|
|
|
|
|
|
2015-06-28 22:24:14 -07:00
|
|
|
std::string base64_encoded;
|
|
|
|
|
|
2015-06-28 21:52:06 -07:00
|
|
|
// header
|
2015-06-27 10:22:59 -07:00
|
|
|
os << "[NetworkTables Storage 3.0]\n";
|
|
|
|
|
|
2015-07-18 01:29:51 -07:00
|
|
|
for (auto& i : entries) {
|
2015-06-27 10:22:59 -07:00
|
|
|
// type
|
2015-07-18 01:29:51 -07:00
|
|
|
auto v = i.second;
|
2015-07-16 01:38:27 -07:00
|
|
|
if (!v) continue;
|
|
|
|
|
switch (v->type()) {
|
2015-06-27 10:22:59 -07:00
|
|
|
case NT_BOOLEAN:
|
|
|
|
|
os << "boolean ";
|
|
|
|
|
break;
|
|
|
|
|
case NT_DOUBLE:
|
|
|
|
|
os << "double ";
|
|
|
|
|
break;
|
|
|
|
|
case NT_STRING:
|
|
|
|
|
os << "string ";
|
|
|
|
|
break;
|
|
|
|
|
case NT_RAW:
|
|
|
|
|
os << "raw ";
|
|
|
|
|
break;
|
|
|
|
|
case NT_BOOLEAN_ARRAY:
|
|
|
|
|
os << "array boolean ";
|
|
|
|
|
break;
|
|
|
|
|
case NT_DOUBLE_ARRAY:
|
|
|
|
|
os << "array double ";
|
|
|
|
|
break;
|
|
|
|
|
case NT_STRING_ARRAY:
|
|
|
|
|
os << "array string ";
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// name
|
2015-07-18 01:29:51 -07:00
|
|
|
WriteString(os, i.first);
|
2015-06-27 10:22:59 -07:00
|
|
|
|
|
|
|
|
// =
|
|
|
|
|
os << '=';
|
|
|
|
|
|
|
|
|
|
// value
|
2015-07-16 01:38:27 -07:00
|
|
|
switch (v->type()) {
|
2015-06-27 10:22:59 -07:00
|
|
|
case NT_BOOLEAN:
|
2015-07-16 01:38:27 -07:00
|
|
|
os << (v->GetBoolean() ? "true" : "false");
|
2015-06-27 10:22:59 -07:00
|
|
|
break;
|
|
|
|
|
case NT_DOUBLE:
|
2015-07-16 01:38:27 -07:00
|
|
|
os << v->GetDouble();
|
2015-06-27 10:22:59 -07:00
|
|
|
break;
|
|
|
|
|
case NT_STRING:
|
2015-07-16 01:38:27 -07:00
|
|
|
WriteString(os, v->GetString());
|
2015-06-27 10:22:59 -07:00
|
|
|
break;
|
2015-06-28 22:24:14 -07:00
|
|
|
case NT_RAW:
|
2015-07-16 01:38:27 -07:00
|
|
|
Base64Encode(v->GetRaw(), &base64_encoded);
|
2015-06-28 22:24:14 -07:00
|
|
|
os << base64_encoded;
|
2015-06-27 10:22:59 -07:00
|
|
|
break;
|
2015-06-28 21:52:06 -07:00
|
|
|
case NT_BOOLEAN_ARRAY: {
|
|
|
|
|
bool first = true;
|
2015-07-16 01:38:27 -07:00
|
|
|
for (auto elem : v->GetBooleanArray()) {
|
2015-07-19 21:10:20 -07:00
|
|
|
if (!first) os << ',';
|
|
|
|
|
first = false;
|
2015-06-28 21:52:06 -07:00
|
|
|
os << (elem ? "true" : "false");
|
2015-06-27 10:22:59 -07:00
|
|
|
}
|
|
|
|
|
break;
|
2015-06-28 21:52:06 -07:00
|
|
|
}
|
|
|
|
|
case NT_DOUBLE_ARRAY: {
|
|
|
|
|
bool first = true;
|
2015-07-16 01:38:27 -07:00
|
|
|
for (auto elem : v->GetDoubleArray()) {
|
2015-07-19 21:10:20 -07:00
|
|
|
if (!first) os << ',';
|
|
|
|
|
first = false;
|
2015-06-28 21:52:06 -07:00
|
|
|
os << elem;
|
2015-06-27 10:22:59 -07:00
|
|
|
}
|
|
|
|
|
break;
|
2015-06-28 21:52:06 -07:00
|
|
|
}
|
|
|
|
|
case NT_STRING_ARRAY: {
|
|
|
|
|
bool first = true;
|
2015-07-16 01:38:27 -07:00
|
|
|
for (auto& elem : v->GetStringArray()) {
|
2015-07-19 21:10:20 -07:00
|
|
|
if (!first) os << ',';
|
|
|
|
|
first = false;
|
2015-06-28 21:52:06 -07:00
|
|
|
WriteString(os, elem);
|
2015-06-27 10:22:59 -07:00
|
|
|
}
|
|
|
|
|
break;
|
2015-06-28 21:52:06 -07:00
|
|
|
}
|
2015-06-27 10:22:59 -07:00
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// eol
|
|
|
|
|
os << '\n';
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2015-06-28 21:52:06 -07:00
|
|
|
/* Extracts an escaped string token. Does not unescape the string.
|
|
|
|
|
* If a string cannot be matched, an empty string is returned.
|
|
|
|
|
* If the string is unterminated, an empty tail string is returned.
|
|
|
|
|
* The returned token includes the starting and trailing quotes (unless the
|
|
|
|
|
* string is unterminated).
|
|
|
|
|
* Returns a pair containing the extracted token (if any) and the remaining
|
|
|
|
|
* tail string.
|
|
|
|
|
*/
|
|
|
|
|
static std::pair<llvm::StringRef, llvm::StringRef> ReadStringToken(
|
|
|
|
|
llvm::StringRef source) {
|
|
|
|
|
// Match opening quote
|
|
|
|
|
if (source.empty() || source.front() != '"')
|
|
|
|
|
return std::make_pair(llvm::StringRef(), source);
|
|
|
|
|
|
|
|
|
|
// Scan for ending double quote, checking for escaped as we go.
|
|
|
|
|
std::size_t size = source.size();
|
|
|
|
|
std::size_t pos;
|
|
|
|
|
for (pos = 1; pos < size; ++pos) {
|
|
|
|
|
if (source[pos] == '"' && source[pos - 1] != '\\') {
|
|
|
|
|
++pos; // we want to include the trailing quote in the result
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return std::make_pair(source.slice(0, pos), source.substr(pos));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int fromxdigit(char ch) {
|
|
|
|
|
if (ch >= 'a' && ch <= 'f')
|
|
|
|
|
return (ch - 'a' + 10);
|
|
|
|
|
else if (ch >= 'A' && ch <= 'F')
|
|
|
|
|
return (ch - 'A' + 10);
|
|
|
|
|
else
|
|
|
|
|
return ch - '0';
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void UnescapeString(llvm::StringRef source, std::string* dest) {
|
2015-07-19 22:44:34 -07:00
|
|
|
assert(source.size() >= 2 && source.front() == '"' && source.back() == '"');
|
2015-06-28 21:52:06 -07:00
|
|
|
dest->clear();
|
|
|
|
|
dest->reserve(source.size() - 2);
|
|
|
|
|
for (auto s = source.begin() + 1, end = source.end() - 1; s != end; ++s) {
|
|
|
|
|
if (*s != '\\') {
|
|
|
|
|
dest->push_back(*s);
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2015-07-19 22:44:34 -07:00
|
|
|
switch (*++s) {
|
2015-06-28 21:52:06 -07:00
|
|
|
case '\\':
|
|
|
|
|
case '"':
|
|
|
|
|
dest->push_back(s[-1]);
|
|
|
|
|
break;
|
|
|
|
|
case 't':
|
|
|
|
|
dest->push_back('\t');
|
|
|
|
|
break;
|
|
|
|
|
case 'n':
|
|
|
|
|
dest->push_back('\n');
|
|
|
|
|
break;
|
|
|
|
|
case 'x': {
|
2015-07-19 22:44:34 -07:00
|
|
|
if (!isxdigit(*(s+1))) {
|
2015-06-28 21:52:06 -07:00
|
|
|
dest->push_back('x'); // treat it like a unknown escape
|
|
|
|
|
break;
|
|
|
|
|
}
|
2015-07-19 22:44:34 -07:00
|
|
|
int ch = fromxdigit(*++s);
|
|
|
|
|
if (isxdigit(*(s+1))) {
|
2015-06-28 21:52:06 -07:00
|
|
|
ch <<= 4;
|
2015-07-19 22:44:34 -07:00
|
|
|
ch |= fromxdigit(*++s);
|
2015-06-28 21:52:06 -07:00
|
|
|
}
|
|
|
|
|
dest->push_back(static_cast<char>(ch));
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
dest->push_back(s[-1]);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2015-07-17 07:21:07 -07:00
|
|
|
bool Storage::LoadPersistent(
|
|
|
|
|
std::istream& is,
|
|
|
|
|
std::function<void(std::size_t line, const char* msg)> warn) {
|
2015-06-27 10:22:59 -07:00
|
|
|
std::string line_str;
|
2015-06-28 21:52:06 -07:00
|
|
|
std::size_t line_num = 1;
|
2015-06-29 23:08:35 -07:00
|
|
|
|
2015-07-18 01:29:51 -07:00
|
|
|
// entries to add
|
|
|
|
|
std::vector<std::pair<std::string, std::shared_ptr<Value>>> entries;
|
|
|
|
|
|
2015-06-29 23:08:35 -07:00
|
|
|
// declare these outside the loop to reduce reallocs
|
|
|
|
|
std::string name, str;
|
|
|
|
|
std::vector<int> boolean_array;
|
|
|
|
|
std::vector<double> double_array;
|
2015-07-16 01:38:27 -07:00
|
|
|
std::vector<std::string> string_array;
|
2015-06-29 23:08:35 -07:00
|
|
|
|
|
|
|
|
// ignore blank lines and lines that start with ; or # (comments)
|
|
|
|
|
while (std::getline(is, line_str)) {
|
|
|
|
|
llvm::StringRef line = llvm::StringRef(line_str).trim();
|
|
|
|
|
if (!line.empty() && line.front() != ';' && line.front() != '#')
|
|
|
|
|
break;
|
|
|
|
|
}
|
2015-06-28 21:52:06 -07:00
|
|
|
|
|
|
|
|
// header
|
|
|
|
|
if (line_str != "[NetworkTables Storage 3.0]") {
|
|
|
|
|
if (warn) warn(line_num, "header line mismatch, ignoring rest of file");
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2015-06-27 10:22:59 -07:00
|
|
|
while (std::getline(is, line_str)) {
|
2015-06-28 21:52:06 -07:00
|
|
|
llvm::StringRef line = llvm::StringRef(line_str).trim();
|
2015-06-27 10:22:59 -07:00
|
|
|
++line_num;
|
|
|
|
|
|
2015-06-29 23:08:35 -07:00
|
|
|
// ignore blank lines and lines that start with ; or # (comments)
|
|
|
|
|
if (line.empty() || line.front() == ';' || line.front() == '#')
|
|
|
|
|
continue;
|
|
|
|
|
|
2015-06-27 10:22:59 -07:00
|
|
|
// type
|
2015-06-28 21:52:06 -07:00
|
|
|
llvm::StringRef type_tok;
|
|
|
|
|
std::tie(type_tok, line) = line.split(' ');
|
2015-06-27 10:22:59 -07:00
|
|
|
NT_Type type = NT_UNASSIGNED;
|
2015-06-28 21:52:06 -07:00
|
|
|
if (type_tok == "boolean") type = NT_BOOLEAN;
|
|
|
|
|
else if (type_tok == "double") type = NT_DOUBLE;
|
|
|
|
|
else if (type_tok == "string") type = NT_STRING;
|
|
|
|
|
else if (type_tok == "raw") type = NT_RAW;
|
|
|
|
|
else if (type_tok == "array") {
|
|
|
|
|
llvm::StringRef array_tok;
|
|
|
|
|
std::tie(array_tok, line) = line.split(' ');
|
|
|
|
|
if (array_tok == "boolean") type = NT_BOOLEAN_ARRAY;
|
|
|
|
|
else if (array_tok == "double") type = NT_DOUBLE_ARRAY;
|
|
|
|
|
else if (array_tok == "string") type = NT_STRING_ARRAY;
|
2015-06-27 10:22:59 -07:00
|
|
|
}
|
|
|
|
|
if (type == NT_UNASSIGNED) {
|
|
|
|
|
if (warn) warn(line_num, "unrecognized type");
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// name
|
2015-06-28 21:52:06 -07:00
|
|
|
llvm::StringRef name_tok;
|
|
|
|
|
std::tie(name_tok, line) = ReadStringToken(line);
|
|
|
|
|
if (name_tok.empty()) {
|
|
|
|
|
if (warn) warn(line_num, "missing name");
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
if (name_tok.back() != '"') {
|
|
|
|
|
if (warn) warn(line_num, "unterminated name string");
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
UnescapeString(name_tok, &name);
|
|
|
|
|
|
|
|
|
|
// =
|
|
|
|
|
line = line.ltrim(" \t");
|
|
|
|
|
if (line.empty() || line.front() != '=') {
|
|
|
|
|
if (warn) warn(line_num, "expected = after name");
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
line = line.drop_front().ltrim(" \t");
|
|
|
|
|
|
|
|
|
|
// value
|
2015-07-18 01:29:51 -07:00
|
|
|
std::shared_ptr<Value> value;
|
2015-06-28 21:52:06 -07:00
|
|
|
switch (type) {
|
|
|
|
|
case NT_BOOLEAN:
|
2015-06-29 23:08:35 -07:00
|
|
|
// only true or false is accepted
|
|
|
|
|
if (line == "true")
|
2015-07-18 01:29:51 -07:00
|
|
|
value = Value::MakeBoolean(true);
|
2015-06-29 23:08:35 -07:00
|
|
|
else if (line == "false")
|
2015-07-18 01:29:51 -07:00
|
|
|
value = Value::MakeBoolean(false);
|
2015-06-29 23:08:35 -07:00
|
|
|
else {
|
|
|
|
|
if (warn)
|
|
|
|
|
warn(line_num, "unrecognized boolean value, not 'true' or 'false'");
|
|
|
|
|
goto next_line;
|
|
|
|
|
}
|
2015-06-28 21:52:06 -07:00
|
|
|
break;
|
2015-06-29 23:08:35 -07:00
|
|
|
case NT_DOUBLE: {
|
|
|
|
|
// need to convert to null-terminated string for strtod()
|
|
|
|
|
str.clear();
|
|
|
|
|
str += line;
|
|
|
|
|
char* end;
|
|
|
|
|
double v = std::strtod(str.c_str(), &end);
|
|
|
|
|
if (*end != '\0') {
|
|
|
|
|
if (warn) warn(line_num, "invalid double value");
|
|
|
|
|
goto next_line;
|
|
|
|
|
}
|
2015-07-18 01:29:51 -07:00
|
|
|
value = Value::MakeDouble(v);
|
2015-06-28 21:52:06 -07:00
|
|
|
break;
|
2015-06-29 23:08:35 -07:00
|
|
|
}
|
|
|
|
|
case NT_STRING: {
|
|
|
|
|
llvm::StringRef str_tok;
|
|
|
|
|
std::tie(str_tok, line) = ReadStringToken(line);
|
|
|
|
|
if (str_tok.empty()) {
|
|
|
|
|
if (warn) warn(line_num, "missing string value");
|
|
|
|
|
goto next_line;
|
|
|
|
|
}
|
|
|
|
|
if (str_tok.back() != '"') {
|
|
|
|
|
if (warn) warn(line_num, "unterminated string value");
|
|
|
|
|
goto next_line;
|
|
|
|
|
}
|
|
|
|
|
UnescapeString(str_tok, &str);
|
2015-07-18 01:29:51 -07:00
|
|
|
value = Value::MakeString(std::move(str));
|
2015-06-28 21:52:06 -07:00
|
|
|
break;
|
|
|
|
|
}
|
2015-06-29 23:08:35 -07:00
|
|
|
case NT_RAW:
|
|
|
|
|
Base64Decode(line, &str);
|
2015-07-18 01:29:51 -07:00
|
|
|
value = Value::MakeRaw(std::move(str));
|
2015-06-28 21:52:06 -07:00
|
|
|
break;
|
2015-06-29 23:08:35 -07:00
|
|
|
case NT_BOOLEAN_ARRAY: {
|
|
|
|
|
llvm::StringRef elem_tok;
|
|
|
|
|
boolean_array.clear();
|
|
|
|
|
while (!line.empty()) {
|
|
|
|
|
std::tie(elem_tok, line) = line.split(',');
|
|
|
|
|
elem_tok = elem_tok.trim(" \t");
|
|
|
|
|
if (elem_tok == "true")
|
|
|
|
|
boolean_array.push_back(1);
|
|
|
|
|
else if (elem_tok == "false")
|
|
|
|
|
boolean_array.push_back(0);
|
|
|
|
|
else {
|
|
|
|
|
if (warn)
|
|
|
|
|
warn(line_num,
|
|
|
|
|
"unrecognized boolean value, not 'true' or 'false'");
|
|
|
|
|
goto next_line;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2015-07-18 01:29:51 -07:00
|
|
|
value = Value::MakeBooleanArray(std::move(boolean_array));
|
2015-06-28 21:52:06 -07:00
|
|
|
break;
|
2015-06-29 23:08:35 -07:00
|
|
|
}
|
|
|
|
|
case NT_DOUBLE_ARRAY: {
|
|
|
|
|
llvm::StringRef elem_tok;
|
|
|
|
|
double_array.clear();
|
|
|
|
|
while (!line.empty()) {
|
|
|
|
|
std::tie(elem_tok, line) = line.split(',');
|
|
|
|
|
elem_tok = elem_tok.trim(" \t");
|
|
|
|
|
// need to convert to null-terminated string for strtod()
|
|
|
|
|
str.clear();
|
|
|
|
|
str += elem_tok;
|
|
|
|
|
char* end;
|
|
|
|
|
double v = std::strtod(str.c_str(), &end);
|
|
|
|
|
if (*end != '\0') {
|
|
|
|
|
if (warn) warn(line_num, "invalid double value");
|
|
|
|
|
goto next_line;
|
|
|
|
|
}
|
|
|
|
|
double_array.push_back(v);
|
|
|
|
|
}
|
|
|
|
|
|
2015-07-18 01:29:51 -07:00
|
|
|
value = Value::MakeDoubleArray(std::move(double_array));
|
2015-06-29 23:08:35 -07:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case NT_STRING_ARRAY: {
|
|
|
|
|
llvm::StringRef elem_tok;
|
2015-07-19 22:44:34 -07:00
|
|
|
string_array.clear();
|
2015-06-29 23:08:35 -07:00
|
|
|
while (!line.empty()) {
|
|
|
|
|
std::tie(elem_tok, line) = ReadStringToken(line);
|
|
|
|
|
if (elem_tok.empty()) {
|
|
|
|
|
if (warn) warn(line_num, "missing string value");
|
|
|
|
|
goto next_line;
|
|
|
|
|
}
|
|
|
|
|
if (elem_tok.back() != '"') {
|
|
|
|
|
if (warn) warn(line_num, "unterminated string value");
|
|
|
|
|
goto next_line;
|
|
|
|
|
}
|
2015-07-19 22:44:34 -07:00
|
|
|
|
|
|
|
|
UnescapeString(elem_tok, &str);
|
|
|
|
|
string_array.push_back(std::move(str));
|
|
|
|
|
|
2015-06-29 23:08:35 -07:00
|
|
|
line = line.ltrim(" \t");
|
|
|
|
|
if (line.empty()) break;
|
|
|
|
|
if (line.front() != ',') {
|
|
|
|
|
if (warn) warn(line_num, "expected comma between strings");
|
|
|
|
|
goto next_line;
|
|
|
|
|
}
|
|
|
|
|
line = line.drop_front().ltrim(" \t");
|
|
|
|
|
}
|
|
|
|
|
|
2015-07-18 01:29:51 -07:00
|
|
|
value = Value::MakeStringArray(std::move(string_array));
|
2015-06-28 21:52:06 -07:00
|
|
|
break;
|
2015-06-29 23:08:35 -07:00
|
|
|
}
|
2015-06-28 21:52:06 -07:00
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
2015-07-18 01:29:51 -07:00
|
|
|
if (!name.empty() && value)
|
|
|
|
|
entries.push_back(std::make_pair(std::move(name), std::move(value)));
|
2015-06-29 23:08:35 -07:00
|
|
|
next_line:
|
|
|
|
|
;
|
2015-06-27 10:22:59 -07:00
|
|
|
}
|
2015-07-18 01:29:51 -07:00
|
|
|
|
|
|
|
|
// copy values into storage as quickly as possible so lock isn't held
|
|
|
|
|
{
|
2015-07-31 13:21:19 -07:00
|
|
|
std::vector<std::shared_ptr<Message>> msgs;
|
|
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
2015-07-18 01:29:51 -07:00
|
|
|
for (auto& i : entries) {
|
2015-07-19 16:46:59 -07:00
|
|
|
auto& entry = m_entries[i.first];
|
2015-07-31 13:48:33 -07:00
|
|
|
if (!entry) entry = std::make_shared<Entry>(i.first);
|
|
|
|
|
auto old_value = entry->value;
|
|
|
|
|
entry->value = i.second;
|
2015-07-19 22:44:34 -07:00
|
|
|
bool was_persist = entry->IsPersistent();
|
2015-07-31 13:48:33 -07:00
|
|
|
if (!was_persist) entry->flags |= NT_PERSISTENT;
|
2015-07-18 01:29:51 -07:00
|
|
|
|
2015-07-31 13:21:19 -07:00
|
|
|
// if we're the server, assign an id if it doesn't have one
|
2015-07-31 13:48:33 -07:00
|
|
|
if (m_server && entry->id == 0xffff) {
|
2015-07-31 13:21:19 -07:00
|
|
|
unsigned int id = m_idmap.size();
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->id = id;
|
2015-07-31 13:21:19 -07:00
|
|
|
m_idmap.push_back(entry);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (!m_queue_outgoing) continue; // shortcut
|
2015-07-31 13:48:33 -07:00
|
|
|
++entry->seq_num;
|
2015-07-31 13:21:19 -07:00
|
|
|
|
2015-07-18 01:29:51 -07:00
|
|
|
// put on update queue
|
2015-07-19 16:02:21 -07:00
|
|
|
if (!old_value || old_value->type() != i.second->type())
|
2015-07-31 13:48:33 -07:00
|
|
|
msgs.emplace_back(Message::EntryAssign(i.first, entry->id,
|
|
|
|
|
entry->seq_num.value(),
|
|
|
|
|
i.second, entry->flags));
|
|
|
|
|
else if (entry->id != 0xffff) {
|
2015-07-31 13:21:19 -07:00
|
|
|
// don't send an update if we don't have an assigned id yet
|
2015-07-19 22:44:34 -07:00
|
|
|
if (*old_value != *i.second)
|
2015-07-31 13:21:19 -07:00
|
|
|
msgs.emplace_back(Message::EntryUpdate(
|
2015-07-31 13:48:33 -07:00
|
|
|
entry->id, entry->seq_num.value(), i.second));
|
2015-07-19 22:44:34 -07:00
|
|
|
if (!was_persist)
|
2015-07-31 13:48:33 -07:00
|
|
|
msgs.emplace_back(Message::FlagsUpdate(entry->id, entry->flags));
|
2015-07-19 16:02:21 -07:00
|
|
|
}
|
2015-07-18 01:29:51 -07:00
|
|
|
}
|
2015-07-31 13:21:19 -07:00
|
|
|
|
|
|
|
|
if (m_queue_outgoing) {
|
|
|
|
|
auto queue_outgoing = m_queue_outgoing;
|
|
|
|
|
lock.unlock();
|
|
|
|
|
for (auto& msg : msgs) queue_outgoing(std::move(msg), nullptr, nullptr);
|
|
|
|
|
}
|
2015-07-18 01:29:51 -07:00
|
|
|
}
|
|
|
|
|
|
2015-06-28 21:52:06 -07:00
|
|
|
return true;
|
2015-06-27 10:22:59 -07:00
|
|
|
}
|