foedus::storage::masstree::MasstreePartitionerData Struct Reference

Dynamic information of one partitioner. More...

Detailed Description

Dynamic information of one partitioner.

Because partition keys are KeySlice, this is fixed-size like ArrayPartitionerData.

Definition at line 138 of file masstree_partitioner_impl.hpp.

#include <masstree_partitioner_impl.hpp>

Public Member Functions
	MasstreePartitionerData ()=delete
	~MasstreePartitionerData ()=delete
uint16_t	find_partition (const char *key, uint16_t key_length) const
	Returns the partition (node ID) that should contain the key. More...

Public Attributes
uint16_t	partition_count_
KeySlice	low_keys_ [kMaxIntermediatePointers]
uint16_t	partitions_ [kMaxIntermediatePointers]

Constructor & Destructor Documentation

foedus::storage::masstree::MasstreePartitionerData::MasstreePartitionerData ( )

delete

foedus::storage::masstree::MasstreePartitionerData::~MasstreePartitionerData ( )

delete

Member Function Documentation

uint16_t foedus::storage::masstree::MasstreePartitionerData::find_partition	(	const char *	key,
		uint16_t	key_length
	)		const

Returns the partition (node ID) that should contain the key.

MasstreePartitionerData methods, binary search.

Definition at line 527 of file masstree_partitioner_impl.cpp.

References ASSERT_ND, foedus::storage::masstree::is_key_aligned_and_zero_padded(), low_keys_, foedus::storage::masstree::normalize_be_bytes_full_aligned(), partition_count_, and partitions_.

Referenced by foedus::storage::masstree::MasstreePartitioner::partition_batch().

                                                                                           {
  if (key_length == 0) {
    return partitions_[0];
  }

  // so far we do a simple sequential search here. we might want
  // 1) binary search until candidate count becomes less than 8, 2) sequential search.
  ASSERT_ND(is_key_aligned_and_zero_padded(key, key_length));
  KeySlice slice = normalize_be_bytes_full_aligned(key);
  uint16_t i;
  for (i = 1; i < partition_count_; ++i) {
    if (low_keys_[i] > slice) {
      break;
    }
  }
  // now, i points to the first partition whose low_key is strictly larger than key.
  // thus, the one before it should be the right partition.
  return partitions_[i - 1];
}

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

KeySlice foedus::storage::masstree::MasstreePartitionerData::low_keys_[kMaxIntermediatePointers]

Definition at line 147 of file masstree_partitioner_impl.hpp.

Referenced by foedus::storage::masstree::MasstreeComposer::drop_volatiles(), find_partition(), and foedus::storage::masstree::operator<<().

uint16_t foedus::storage::masstree::MasstreePartitionerData::partition_count_

Definition at line 146 of file masstree_partitioner_impl.hpp.

Referenced by foedus::storage::masstree::MasstreeComposer::drop_volatiles(), find_partition(), foedus::storage::masstree::MasstreePartitioner::is_partitionable(), foedus::storage::masstree::operator<<(), and foedus::storage::masstree::MasstreePartitioner::partition_batch().

uint16_t foedus::storage::masstree::MasstreePartitionerData::partitions_[kMaxIntermediatePointers]

Definition at line 148 of file masstree_partitioner_impl.hpp.

Referenced by foedus::storage::masstree::MasstreeComposer::drop_volatiles(), find_partition(), and foedus::storage::masstree::operator<<().

---

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

• /home/shino/foedus_code/foedus-core/include/foedus/storage/masstree/masstree_partitioner_impl.hpp
• /home/shino/foedus_code/foedus-core/src/foedus/storage/masstree/masstree_partitioner_impl.cpp