blob: 54ac9d9ca4990ce1dc8fb1435bf2929d9e230e0b [file] [log] [blame]
akmhoque66e66182014-02-21 17:56:03 -06001/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil -*- */
2/*
3 * Copyright (c) 2012 University of California, Los Angeles
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2 as
7 * published by the Free Software Foundation;
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 *
18 * Author: Zhenkai Zhu <zhenkai@cs.ucla.edu>
19 * Chaoyi Bian <bcy@pku.edu.cn>
20 * Alexander Afanasyev <alexander.afanasyev@ucla.edu>
21 */
22
23#ifndef SYNC_STATE_H
24#define SYNC_STATE_H
25
26#include "sync-state-leaf-container.h"
27#include <boost/exception/all.hpp>
28#include "boost/tuple/tuple.hpp"
29#include "sync-state.pb.h"
30
31/**
32 * \defgroup sync SYNC protocol
33 *
34 * Implementation of SYNC protocol
35 */
36namespace Sync {
37
38/**
39 * \ingroup sync
40 * @brief this prefix will be used for the dummy node which increases its sequence number whenever
41 * a remove operation happens; this is to prevent the reversion of root digest when we prune
42 * a branch, i.e. help the root digest to be forward only
43 * No corresponding data msg would be published and no attempt would be made to retrieve the
44 * data msg
45 */
46const std::string forwarderPrefix = "/d0n0t18ak/t0ps8cr8t";
47
48class State;
49typedef boost::shared_ptr<State> StatePtr;
50typedef boost::shared_ptr<State> StateConstPtr;
51
52/**
53 * \ingroup sync
54 * @brief Container for state leaves and definition of the abstract interface to work with State objects
55 */
56class State
57{
58public:
59 virtual ~State () { };
60
61 /**
62 * @brief Add or update leaf to the state tree
63 *
64 * @param info name of the leaf
65 * @param seq sequence number of the leaf
66 */
67 virtual boost::tuple<bool/*inserted*/, bool/*updated*/, SeqNo/*oldSeqNo*/>
68 update (NameInfoConstPtr info, const SeqNo &seq) = 0;
69
70 /**
71 * @brief Remove leaf from the state tree
72 * @param info name of the leaf
73 */
74 virtual bool
75 remove (NameInfoConstPtr info) = 0;
76
77 /**
78 * @brief Get state leaves
79 */
80 const LeafContainer &
81 getLeaves () const
82 { return m_leaves; }
83
84protected:
85 LeafContainer m_leaves;
86};
87
88
89/**
90 * @brief Formats a protobuf SyncStateMsg msg
91 * @param oss output SyncStateMsg msg
92 * @param state state
93 * @returns output SyncStateMsg msg
94 */
95SyncStateMsg &
96operator << (SyncStateMsg &ossm, const State &state);
97
98
99/**
100 * @brief Parse a protobuf SyncStateMsg msg
101 * @param iss input SyncStateMsg msg
102 * @param state state
103 * @returns SyncStateMsg msg
104 */
105SyncStateMsg &
106operator >> (SyncStateMsg &issm, State &state);
107
108namespace Error {
109/**
110 * @brief Will be thrown when data cannot be properly decoded to SyncStateMsg
111 */
112struct SyncStateMsgDecodingFailure : virtual boost::exception, virtual std::exception { };
113}
114
115} // Sync
116
117#endif // SYNC_STATE_H