Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/**
* Copyright (c) 2011-2015 Regents of the University of California.
*
* This file is part of ndnSIM. See AUTHORS for complete list of ndnSIM authors and
* contributors.
*
* ndnSIM 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.
*
* ndnSIM 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
* ndnSIM, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
**/
#ifndef NDNSIM_MODEL_CS_CUSTOM_POLICIES_SIZE_POLICY_HPP
#define NDNSIM_MODEL_CS_CUSTOM_POLICIES_SIZE_POLICY_HPP
/// @cond include_hidden
#include "ns3/ndnSIM/model/ndn-common.hpp"
#include <boost/intrusive/options.hpp>
#include <boost/intrusive/list.hpp>
namespace ns3 {
namespace ndn {
namespace ndnSIM {
/**
* @brief Traits for size policy
*/
struct size_policy_traits {
/// @brief Name that can be used to identify the policy (for NS-3 object model and logging)
static std::string
GetName()
{
return "Size";
}
struct policy_hook_type : public boost::intrusive::list_member_hook<> {
};
template<class Container>
struct container_hook {
typedef boost::intrusive::member_hook<Container, policy_hook_type, &Container::policy_hook_>
type;
};
template<class Base, class Container, class Hook>
struct policy {
typedef typename boost::intrusive::list<Container, Hook> policy_container;
class type : public policy_container {
public:
typedef policy policy_base; // to get access to get_freshness methods from outside
typedef Container parent_trie;
type(Base& base)
: base_(base)
, max_size_(100)
, current_size_(0)
{
}
inline void
update(typename parent_trie::iterator item)
{
// do nothing
}
inline bool
insert(typename parent_trie::iterator item)
{
size_t dataSize = item->payload()->GetData()->wireEncode().size();
current_size_ += dataSize;
while (current_size_ > max_size_) {
base_.erase(&(*policy_container::begin()));
}
policy_container::push_back(*item);
return true;
}
inline void
lookup(typename parent_trie::iterator item)
{
}
inline void
erase(typename parent_trie::iterator item)
{
size_t dataSize = item->payload()->GetData()->wireEncode().size();
current_size_ -= dataSize;
}
inline void
clear()
{
policy_container::clear();
current_size_ = 0;
}
inline void
set_max_size(size_t max_size)
{
max_size_ = max_size;
}
inline size_t
get_max_size() const
{
return max_size_;
}
private:
type() = delete;
private:
Base& base_;
size_t max_size_;
size_t current_size_;
};
};
};
} // ndnSIM
} // ndn
} // ns3
/// @endcond
#endif // SIZE_POLICY_H
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment