array_id.hpp

Go to the documentation of this file.

/*
 * Copyright (c) 2014-2015, Hewlett-Packard Development Company, LP.
 * This program 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 2 of the License, or (at your option)
 * any later version.
 *
 * 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
 *
 * HP designates this particular file as subject to the "Classpath" exception
 * as provided by HP in the LICENSE.txt file that accompanied this code.
 */
#ifndef FOEDUS_STORAGE_ARRAY_ARRAY_ID_HPP_
#define FOEDUS_STORAGE_ARRAY_ARRAY_ID_HPP_
#include <stdint.h>

#include <iosfwd>

#include "foedus/storage/storage_id.hpp"

namespace foedus {
namespace storage {
namespace array {

typedef uint64_t ArrayOffset;

const ArrayOffset kMaxArrayOffset = (1ULL << 48) - 1ULL;

struct ArrayRange {
  ArrayRange() : begin_(0), end_(0) {}
  ArrayRange(ArrayOffset begin, ArrayOffset end) : begin_(begin), end_(end) {}
  ArrayRange(ArrayOffset begin, ArrayOffset end, ArrayOffset array_size)
    : begin_(begin), end_(end) {
    if (end > array_size) {
      end_ = array_size;
    }
  }

  bool    overlaps(const ArrayRange& other) const {
    // Case 1: contains(other.begin) or contains(other.end)
    // Case 2: not case 1, but other.contains(begin)
    return contains(other.begin_) || contains(other.end_) || other.contains(begin_);
  }
  bool    contains(ArrayOffset offset) const { return offset >= begin_ && offset < end_; }
  bool    operator==(const ArrayRange& other) const {
    return begin_ == other.begin_ && end_ == other.end_;
  }
  bool    operator!=(const ArrayRange& other) const { return !(this->operator==(other)); }

  ArrayOffset begin_;
  ArrayOffset end_;
};

const uint16_t kHeaderSize = 64;
const uint16_t kDataSize = foedus::storage::kPageSize - kHeaderSize;
const uint16_t kInteriorSize = 16;
const uint16_t kInteriorFanout = (foedus::storage::kPageSize - kHeaderSize) / kInteriorSize;

const uint8_t kMaxLevels = 8;

}  // namespace array
}  // namespace storage
}  // namespace foedus
#endif  // FOEDUS_STORAGE_ARRAY_ARRAY_ID_HPP_