#include "DataLeafNode.h"
#include "DataInnerNode.h"

using std::unique_ptr;
using std::make_unique;
using blockstore::Block;
using blockstore::Data;
using blockstore::Key;

namespace blobstore {
namespace onblocks {
namespace datanodestore {

DataLeafNode::DataLeafNode(DataNodeView view)
: DataNode(std::move(view)) {
  assert(*node().Depth() == 0);
  assert(numBytes() <= maxStoreableBytes());
}

DataLeafNode::~DataLeafNode() {
}

unique_ptr<DataLeafNode> DataLeafNode::InitializeNewNode(unique_ptr<Block> block) {
  DataNodeView node(std::move(block));
  *node.Depth() = 0;
  *node.Size() = 0;
  //fillDataWithZeroes(); not needed, because a newly created block will be zeroed out. DataLeafNodeTest.SpaceIsZeroFilledWhenGrowing ensures this.
  return make_unique<DataLeafNode>(std::move(node));
}

void *DataLeafNode::data() {
  return const_cast<void*>(const_cast<const DataLeafNode*>(this)->data());
}

const void *DataLeafNode::data() const {
  return node().DataBegin<uint8_t>();
}

uint32_t DataLeafNode::numBytes() const {
  return *node().Size();
}

void DataLeafNode::resize(uint32_t new_size) {
  assert(new_size <= maxStoreableBytes());
  uint32_t old_size = *node().Size();
  if (new_size < old_size) {
    fillDataWithZeroesFromTo(new_size, old_size);
  }
  *node().Size() = new_size;
}

void DataLeafNode::fillDataWithZeroesFromTo(off_t begin, off_t end) {
  std::memset(node().DataBegin<uint8_t>()+begin, 0, end-begin);
}

uint32_t DataLeafNode::maxStoreableBytes() const {
  return node().layout().maxBytesPerLeaf();
}

}
}
}