foedus::snapshot::MergeSort::SortEntry Struct Reference

Entries we actually sort. More...

Detailed Description

Entries we actually sort.

• 0-7 bytes: the key. ArrayOffset, or the most significant 8 bytes of other storages' key.
• 8-9 bytes: compressed epoch (difference from base_epoch)
• 10-12 bytes: in-epoch-ordinal
• 13 byte's 1st bit: Whether the key needs additional comparison if the 8-bytes are the same. This is set to true only in masstree and the key length is not 8 bytes.
• 13 byte's other bits -15 bytes: Position in MergeSort's buffer.

It's quite important to keep this 16 bytes. But, in some cases, we need more than 16 bytes to compare logs. In that case, we have to addtionally invoke batch_sort_adjust_sort().

Definition at line 116 of file merge_sort.hpp.

#include <merge_sort.hpp>

Public Member Functions
void	set (uint64_t key, uint16_t compressed_epoch, uint32_t in_epoch_ordinal, bool needs_additional_check, MergedPosition position) __attribute__((always_inline))
uint64_t	get_key () const __attribute__((always_inline))
bool	needs_additional_check () const __attribute__((always_inline))
MergedPosition	get_position () const __attribute__((always_inline))

Public Attributes
__uint128_t	data_

Member Function Documentation

uint64_t foedus::snapshot::MergeSort::SortEntry::get_key ( ) const

inline

Definition at line 132 of file merge_sort.hpp.

References data_.

Referenced by foedus::storage::array::ArrayComposeContext::execute(), and foedus::storage::hash::HashComposeContext::execute().

                                                  {
      return static_cast<uint64_t>(data_ >> 64);
    }

Here is the caller graph for this function:

MergedPosition foedus::snapshot::MergeSort::SortEntry::get_position ( ) const

inline

Definition at line 138 of file merge_sort.hpp.

References data_.

Referenced by foedus::snapshot::MergeSort::assert_sorted(), foedus::snapshot::MergeSort::change_log_type_at(), foedus::snapshot::MergeSort::fetch_logs(), foedus::snapshot::MergeSort::get_log_type_from_sort_position(), foedus::snapshot::MergeSort::groupify(), and foedus::snapshot::MergeSort::resolve_sort_position().

                                                             {
      return static_cast<MergedPosition>(data_) & 0x7FFFFFU;
    }

Here is the caller graph for this function:

bool foedus::snapshot::MergeSort::SortEntry::needs_additional_check ( ) const

inline

Definition at line 135 of file merge_sort.hpp.

References data_.

Referenced by set().

                                                             {
      return data_ & (1U << 23);
    }

Here is the caller graph for this function:

void foedus::snapshot::MergeSort::SortEntry::set ( uint64_t  key, uint16_t  compressed_epoch, uint32_t  in_epoch_ordinal, bool  needs_additional_check, MergedPosition  position  )

inline

Definition at line 117 of file merge_sort.hpp.

References ASSERT_ND, data_, foedus::snapshot::MergeSort::kMaxMergedPosition, and needs_additional_check().

Referenced by foedus::snapshot::MergeSort::assert_sorted().

                                             {
      ASSERT_ND(in_epoch_ordinal < (1U << 24));
      ASSERT_ND(position < kMaxMergedPosition);
      data_
        = static_cast<__uint128_t>(key) << 64
          | static_cast<__uint128_t>(compressed_epoch) << 48
          | static_cast<__uint128_t>(in_epoch_ordinal) << 24
          | static_cast<__uint128_t>(needs_additional_check ? 1U << 23 : 0)
          | static_cast<__uint128_t>(position);
    }

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

__uint128_t foedus::snapshot::MergeSort::SortEntry::data_

Definition at line 142 of file merge_sort.hpp.

Referenced by foedus::snapshot::MergeSort::assert_sorted(), get_key(), get_position(), needs_additional_check(), and set().

---

The documentation for this struct was generated from the following file:

• /home/shino/foedus_code/foedus-core/include/foedus/snapshot/merge_sort.hpp