Method makeKeys

src/jrd/btr.cpp:767–805

}

void IndexScanListIterator::makeKeys(thread_db* tdbb, temporary_key* lower, temporary_key* upper)
{
	m_lowerValues[m_segno] = *m_iterator;
	m_upperValues[m_segno] = *m_iterator;

	const auto keyType =
		(m_retrieval->irb_generic & irb_multi_starting) ? INTL_KEY_MULTI_STARTING :
		(m_retrieval->irb_generic & irb_starting) ? INTL_KEY_PARTIAL :
		(m_retrieval->irb_desc.idx_flags & idx_unique) ? INTL_KEY_UNIQUE :
		INTL_KEY_SORT;

	// Make the lower bound key

	idx_e errorCode = BTR_make_key(tdbb, m_retrieval->irb_lower_count, getLowerValues(),
		getScale(), &m_retrieval->irb_desc, lower, keyType, nullptr);

	if (errorCode == idx_e_ok)
	{
		if (m_retrieval->irb_generic & irb_equality)
		{
			// If we have an equality search, lower/upper bounds are actually the same key
			copy_key(lower, upper);
		}
		else
		{
			// Make the upper bound key

			errorCode = BTR_make_key(tdbb, m_retrieval->irb_upper_count, getUpperValues(),
				getScale(), &m_retrieval->irb_desc, upper, keyType, nullptr);
		}
	}

	if (errorCode != idx_e_ok)
	{
		index_desc temp_idx = m_retrieval->irb_desc;
		IndexErrorContext context(m_retrieval->irb_relation, &temp_idx);
		context.raise(tdbb, errorCode);
	}
}


void BTR_all(thread_db* tdbb, jrd_rel* relation, IndexDescList& idxList, RelationPages* relPages)