/* Copyright (C) 2014 J.F.Dockes
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include <unistd.h>
#include <fcntl.h>
#include <string.h>
#include <iostream>
using namespace std;
#include "ohmetacache.hxx"
#include "libupnpp/workqueue.hxx"
#include "libupnpp/log.hxx"
using namespace UPnPP;
class SaveCacheTask {
public:
SaveCacheTask(const string& fn, const mcache_type& cache)
: m_fn(fn), m_cache(cache)
{}
string m_fn;
mcache_type m_cache;
};
static WorkQueue<SaveCacheTask*> saveQueue("SaveQueue");
// Encode uris and values so that they can be decoded (escape %, =, and eol)
static string encode(const string& in)
{
string out;
const char *cp = in.c_str();
for (string::size_type i = 0; i < in.size(); i++) {
unsigned int c;
const char *h = "0123456789ABCDEF";
c = cp[i];
if (c == '%' || c == '=' || c == '\n' || c == '\r') {
out += '%';
out += h[(c >> 4) & 0xf];
out += h[c & 0xf];
} else {
out += char(c);
}
}
return out;
}
static int h2d(int c)
{
if ('0' <= c && c <= '9')
return c - '0';
else if ('A' <= c && c <= 'F')
return 10 + c - 'A';
else
return -1;
}
static string decode(const string &in)
{
string out;
const char *cp = in.c_str();
if (in.size() <= 2)
return in;
string::size_type i = 0;
for (; i < in.size() - 2; i++) {
if (cp[i] == '%') {
int d1 = h2d(cp[++i]);
int d2 = h2d(cp[++i]);
if (d1 != -1 && d2 != -1)
out += (d1 << 4) + d2;
} else {
out += cp[i];
}
}
while (i < in.size()) {
out += cp[i++];
}
return out;
}
bool dmcacheSave(const string& fn, const mcache_type& cache)
{
SaveCacheTask *tsk = new SaveCacheTask(fn, cache);
// Use the flush option to put() so that only the latest version
// stays on the queue, possibly saving writes.
if (!saveQueue.put(tsk, true)) {
LOGERR("dmcacheSave: can't queue save task" << endl);
return false;
}
return true;
}
static void *dmcacheSaveWorker(void *)
{
for (;;) {
SaveCacheTask *tsk = 0;
size_t qsz;
if (!saveQueue.take(&tsk, &qsz)) {
LOGERR("dmcacheSaveWorker: can't get task from queue" << endl);
saveQueue.workerExit();
return (void*)1;
}
LOGDEB("dmcacheSave: got save task: " << tsk->m_cache.size() <<
" entries to " << tsk->m_fn << endl);
ofstream output(tsk->m_fn, ios::out | ios::trunc);
if (!output.is_open()) {
LOGERR("dmcacheSave: could not open " << tsk->m_fn
<< " for writing" << endl);
delete tsk;
continue;
}
for (mcache_type::const_iterator it = tsk->m_cache.begin();
it != tsk->m_cache.end(); it++) {
output << encode(it->first) << '=' << encode(it->second) << '\n';
if (!output.good()) {
LOGERR("dmcacheSave: write error while saving to " <<
tsk->m_fn << endl);
break;
}
}
output.flush();
if (!output.good()) {
LOGERR("dmcacheSave: flush error while saving to " <<
tsk->m_fn << endl);
}
delete tsk;
}
}
// Max size of metadata element ??
#define LL 10*1024
bool dmcacheRestore(const string& fn, mcache_type& cache)
{
// Restore is called once at startup, so seize the opportunity to start the
// save thread
if (!saveQueue.start(1, dmcacheSaveWorker, 0)) {
LOGERR("dmcacheRestore: could not start save thread" << endl);
return false;
}
ifstream input;
input.open(fn, ios::in);
if (!input.is_open()) {
LOGERR("dmcacheRestore: could not open " << fn << endl);
return false;
}
char cline[LL];
for (;;) {
input.getline(cline, LL-1, '\n');
if (input.eof())
break;
if (!input.good()) {
LOGERR("dmcacheRestore: read error on " << fn << endl);
return false;
}
char *cp = strchr(cline, '=');
if (cp == 0) {
LOGERR("dmcacheRestore: no = in line !" << endl);
return false;
}
*cp = 0;
cache[decode(cline)] = decode(cp+1);
}
return true;
}