leveldb::Compaction Class Reference

#include <version_set.h>

Collaboration diagram for leveldb::Compaction:

Public Member Functions
	~Compaction ()
int	level () const
VersionEdit *	edit ()
int	num_input_files (int which) const
FileMetaData *	input (int which, int i) const
uint64_t	MaxOutputFileSize () const
bool	IsTrivialMove () const
void	AddInputDeletions (VersionEdit *edit)
bool	IsBaseLevelForKey (const Slice &user_key)
bool	ShouldStopBefore (const Slice &internal_key)
void	ReleaseInputs ()

Private Member Functions
	Compaction (const Options *options, int level)

Private Attributes
int	level_
uint64_t	max_output_file_size_
Version *	input_version_
VersionEdit	edit_
std::vector< FileMetaData * >	inputs_ [2]
std::vector< FileMetaData * >	grandparents_
size_t	grandparent_index_
bool	seen_key_
int64_t	overlapped_bytes_
size_t	level_ptrs_ [config::kNumLevels]

Friends
class	Version
class	VersionSet

Detailed Description

Definition at line 324 of file version_set.h.

Constructor & Destructor Documentation

~Compaction()

leveldb::Compaction::~Compaction

(

)

Definition at line 1460 of file version_set.cc.

                        {
  if (input_version_ != NULL) {
    input_version_->Unref();
  }
}

Here is the call graph for this function:

Compaction()

leveldb::Compaction::Compaction ( const Options *  options, int  level  )

private

Definition at line 1448 of file version_set.cc.

    : level_(level),
      max_output_file_size_(MaxFileSizeForLevel(options, level)),
      input_version_(NULL),
      grandparent_index_(0),
      seen_key_(false),
      overlapped_bytes_(0) {
  for (int i = 0; i < config::kNumLevels; i++) {
    level_ptrs_[i] = 0;
  }
}

Member Function Documentation

AddInputDeletions()

void leveldb::Compaction::AddInputDeletions

(

VersionEdit *

edit

)

Definition at line 1476 of file version_set.cc.

                                                    {
  for (int which = 0; which < 2; which++) {
    for (size_t i = 0; i < inputs_[which].size(); i++) {
      edit->DeleteFile(level_ + which, inputs_[which][i]->number);
    }
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

edit()

VersionEdit* leveldb::Compaction::edit ( )

inline

Definition at line 334 of file version_set.h.

{ return &edit_; }

Here is the caller graph for this function:

input()

FileMetaData* leveldb::Compaction::input ( int  which, int  i  ) const

inline

Definition at line 340 of file version_set.h.

{ return inputs_[which][i]; }

Here is the caller graph for this function:

IsBaseLevelForKey()

bool leveldb::Compaction::IsBaseLevelForKey

(

const Slice &

user_key

)

Definition at line 1484 of file version_set.cc.

                                                        {
  // Maybe use binary search to find right entry instead of linear search?
  const Comparator* user_cmp = input_version_->vset_->icmp_.user_comparator();
  for (int lvl = level_ + 2; lvl < config::kNumLevels; lvl++) {
    const std::vector<FileMetaData*>& files = input_version_->files_[lvl];
    for (; level_ptrs_[lvl] < files.size(); ) {
      FileMetaData* f = files[level_ptrs_[lvl]];
      if (user_cmp->Compare(user_key, f->largest.user_key()) <= 0) {
        // We've advanced far enough
        if (user_cmp->Compare(user_key, f->smallest.user_key()) >= 0) {
          // Key falls in this file's range, so definitely not base level
          return false;
        }
        break;
      }
      level_ptrs_[lvl]++;
    }
  }
  return true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

IsTrivialMove()

bool leveldb::Compaction::IsTrivialMove

(

)

const

Definition at line 1466 of file version_set.cc.

                                     {
  const VersionSet* vset = input_version_->vset_;
  // Avoid a move if there is lots of overlapping grandparent data.
  // Otherwise, the move could create a parent file that will require
  // a very expensive merge later on.
  return (num_input_files(0) == 1 && num_input_files(1) == 0 &&
          TotalFileSize(grandparents_) <=
              MaxGrandParentOverlapBytes(vset->options_));
}

Here is the call graph for this function:

Here is the caller graph for this function:

level()

int leveldb::Compaction::level ( ) const

inline

Definition at line 330 of file version_set.h.

{ return level_; }

Here is the caller graph for this function:

MaxOutputFileSize()

uint64_t leveldb::Compaction::MaxOutputFileSize ( ) const

inline

Definition at line 343 of file version_set.h.

{ return max_output_file_size_; }

Here is the caller graph for this function:

num_input_files()

int leveldb::Compaction::num_input_files ( int  which ) const

inline

Definition at line 337 of file version_set.h.

{ return inputs_[which].size(); }

Here is the caller graph for this function:

ReleaseInputs()

void leveldb::Compaction::ReleaseInputs

(

)

Definition at line 1528 of file version_set.cc.

                               {
  if (input_version_ != NULL) {
    input_version_->Unref();
    input_version_ = NULL;
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

ShouldStopBefore()

bool leveldb::Compaction::ShouldStopBefore

(

const Slice &

internal_key

)

Definition at line 1505 of file version_set.cc.

                                                           {
  const VersionSet* vset = input_version_->vset_;
  // Scan to find earliest grandparent file that contains key.
  const InternalKeyComparator* icmp = &vset->icmp_;
  while (grandparent_index_ < grandparents_.size() &&
      icmp->Compare(internal_key,
                    grandparents_[grandparent_index_]->largest.Encode()) > 0) {
    if (seen_key_) {
      overlapped_bytes_ += grandparents_[grandparent_index_]->file_size;
    }
    grandparent_index_++;
  }
  seen_key_ = true;

  if (overlapped_bytes_ > MaxGrandParentOverlapBytes(vset->options_)) {
    // Too much overlap for current output; start new output
    overlapped_bytes_ = 0;
    return true;
  } else {
    return false;
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Friends And Related Function Documentation

Version

friend class Version

friend

Definition at line 366 of file version_set.h.

VersionSet

friend class VersionSet

friend

Definition at line 367 of file version_set.h.

Member Data Documentation

edit_

VersionEdit leveldb::Compaction::edit_

private

Definition at line 374 of file version_set.h.

grandparent_index_

size_t leveldb::Compaction::grandparent_index_

private

Definition at line 382 of file version_set.h.

grandparents_

std::vector<FileMetaData*> leveldb::Compaction::grandparents_

private

Definition at line 381 of file version_set.h.

input_version_

Version* leveldb::Compaction::input_version_

private

Definition at line 373 of file version_set.h.

inputs_

std::vector<FileMetaData*> leveldb::Compaction::inputs_[2]

private

Definition at line 377 of file version_set.h.

level_

int leveldb::Compaction::level_

private

Definition at line 371 of file version_set.h.

level_ptrs_

size_t leveldb::Compaction::level_ptrs_[config::kNumLevels]

private

Definition at line 393 of file version_set.h.

max_output_file_size_

uint64_t leveldb::Compaction::max_output_file_size_

private

Definition at line 372 of file version_set.h.

overlapped_bytes_

int64_t leveldb::Compaction::overlapped_bytes_

private

Definition at line 384 of file version_set.h.

seen_key_

bool leveldb::Compaction::seen_key_

private

Definition at line 383 of file version_set.h.

---

The documentation for this class was generated from the following files:

• db/version_set.h
• db/version_set.cc