chromium/third_party/leveldatabase/src/table/table.cc

// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.

#include "leveldb/table.h"

#include "leveldb/cache.h"
#include "leveldb/comparator.h"
#include "leveldb/env.h"
#include "leveldb/filter_policy.h"
#include "leveldb/options.h"
#include "table/block.h"
#include "table/filter_block.h"
#include "table/format.h"
#include "table/two_level_iterator.h"
#include "util/coding.h"

namespace leveldb {

struct Table::Rep { … };

Status Table::Open(const Options& options, RandomAccessFile* file,
                   uint64_t size, Table** table) { … }

void Table::ReadMeta(const Footer& footer) { … }

void Table::ReadFilter(const Slice& filter_handle_value) { … }

Table::~Table() { … }

static void DeleteBlock(void* arg, void* ignored) { … }

static void DeleteCachedBlock(const Slice& key, void* value) { … }

static void ReleaseBlock(void* arg, void* h) { … }

// Convert an index iterator value (i.e., an encoded BlockHandle)
// into an iterator over the contents of the corresponding block.
Iterator* Table::BlockReader(void* arg, const ReadOptions& options,
                             const Slice& index_value) { … }

Iterator* Table::NewIterator(const ReadOptions& options) const { … }

Status Table::InternalGet(const ReadOptions& options, const Slice& k, void* arg,
                          void (*handle_result)(void*, const Slice&,
                                                const Slice&)) { … }

uint64_t Table::ApproximateOffsetOf(const Slice& key) const { … }

}  // namespace leveldb