/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/**
 * Copyright (c) 2014-2015,  The University of Memphis,
 *                           Regents of the University of California,
 *                           Arizona Board of Regents.
 *
 * This file is part of NLSR (Named-data Link State Routing).
 * See AUTHORS.md for complete list of NLSR authors and contributors.
 *
 * NLSR 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.
 *
 * NLSR 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
 * NLSR, e.g., in COPYING.md file.  If not, see <http://www.gnu.org/licenses/>.
 **/

#include "adjacency.hpp"
#include "tlv-nlsr.hpp"

#include <ndn-cxx/util/concepts.hpp>
#include <ndn-cxx/encoding/block-helpers.hpp>

namespace nlsr {
namespace tlv  {

BOOST_CONCEPT_ASSERT((ndn::WireEncodable<Adjacency>));
BOOST_CONCEPT_ASSERT((ndn::WireDecodable<Adjacency>));
static_assert(std::is_base_of<ndn::tlv::Error, Adjacency::Error>::value,
              "Adjacency::Error must inherit from tlv::Error");

Adjacency::Adjacency()
  : m_cost(0)
{
}

Adjacency::Adjacency(const ndn::Block& block)
{
  wireDecode(block);
}

template<bool T>
size_t
Adjacency::wireEncode(ndn::EncodingImpl<T>& block) const
{
  size_t totalLength = 0;

  totalLength += ndn::prependNonNegativeIntegerBlock(block,
                                                     ndn::tlv::nlsr::Cost,
                                                     m_cost);

  totalLength += block.prependByteArrayBlock(
    ndn::tlv::nlsr::Uri, reinterpret_cast<const uint8_t*>(m_uri.c_str()), m_uri.size());

  totalLength += m_name.wireEncode(block);

  totalLength += block.prependVarNumber(totalLength);
  totalLength += block.prependVarNumber(ndn::tlv::nlsr::Adjacency);

  return totalLength;
}

template size_t
Adjacency::wireEncode<true>(ndn::EncodingImpl<true>& block) const;

template size_t
Adjacency::wireEncode<false>(ndn::EncodingImpl<false>& block) const;

const ndn::Block&
Adjacency::wireEncode() const
{
  if (m_wire.hasWire()) {
    return m_wire;
  }

  ndn::EncodingEstimator estimator;
  size_t estimatedSize = wireEncode(estimator);

  ndn::EncodingBuffer buffer(estimatedSize, 0);
  wireEncode(buffer);

  m_wire = buffer.block();

  return m_wire;
}

void
Adjacency::wireDecode(const ndn::Block& wire)
{
  m_name.clear();
  m_uri = "";
  m_cost = 0;

  m_wire = wire;

  if (m_wire.type() != ndn::tlv::nlsr::Adjacency) {
    std::stringstream error;
    error << "Expected Adjacency Block, but Block is of a different type: #"
          << m_wire.type();
    throw Error(error.str());
  }

  m_wire.parse();

  ndn::Block::element_const_iterator val = m_wire.elements_begin();

  if (val != m_wire.elements_end() && val->type() == ndn::tlv::Name) {
    m_name.wireDecode(*val);
    ++val;
  }
  else {
    throw Error("Missing required Name field");
  }

  if (val != m_wire.elements_end() && val->type() == ndn::tlv::nlsr::Uri) {
    m_uri.assign(reinterpret_cast<const char*>(val->value()), val->value_size());
    ++val;
  }
  else {
    throw Error("Missing required Uri field");
  }

  if (val != m_wire.elements_end() && val->type() == ndn::tlv::nlsr::Cost) {
    m_cost = ndn::readNonNegativeInteger(*val);
    ++val;
  }
  else {
    throw Error("Missing required Cost field");
  }
}

std::ostream&
operator<<(std::ostream& os, const Adjacency& adjacency)
{
  os << "Adjacency("
     << "Name: " << adjacency.getName() << ", "
     << "Uri: " << adjacency.getUri() << ", "
     << "Cost: " << adjacency.getCost() << ")";

  return os;
}

} // namespace tlv
} // namespace nlsr