blob: 17d52ee485af3c27fd10f1af134f3cc6638b0122 [file] [log] [blame]
/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil -*- */
/*
* Copyright (c) 2012 University of California, Los Angeles
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation;
*
* 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
*
* Author: Zhenkai Zhu <zhenkai@cs.ucla.edu>
* 卞超轶 Chaoyi Bian <bcy@pku.edu.cn>
* Alexander Afanasyev <alexander.afanasyev@ucla.edu>
*/
#include "sync-app-data-publish.h"
using namespace std;
using namespace boost;
namespace Sync
{
string
AppDataPublish::getRecentData (const string &prefix, uint32_t session)
{
if (m_recentData.find(make_pair(prefix, session)) != m_recentData.end())
return m_recentData[make_pair(prefix, session)];
else
return "";
}
uint32_t
AppDataPublish::getHighestSeq (const string &prefix, uint32_t session)
{
unordered_map<string, Seq>::iterator i = m_sequenceLog.find(prefix);
if (i != m_sequenceLog.end())
{
Seq s = i->second;
if (s.session == session)
return s.seq;
}
return 0;
}
bool
AppDataPublish::publishData (const string &name, uint32_t session, const string &dataBuffer, int freshness)
{
uint32_t seq = getHighestSeq(name, session);
if (seq == 0)
m_sequenceLog.erase(name);
seq++;
if (seq == 0)
seq = 1;
Seq s;
s.session = session;
s.seq = seq;
m_sequenceLog[name] = s;
ostringstream contentNameWithSeqno;
contentNameWithSeqno << name << "/" << session << "/" << seq;
m_ccnxHandle->publishData (contentNameWithSeqno.str (), dataBuffer, freshness);
unordered_map<pair<string, uint32_t>, string>::iterator it = m_recentData.find(make_pair(name, session));
if (it != m_recentData.end())
m_recentData.erase(it);
m_recentData.insert(make_pair(make_pair(name, session), dataBuffer));
return true;
}
}