Function BTR_make_bounds

src/jrd/btr.cpp:1765–1851

bool BTR_make_bounds(thread_db* tdbb, const IndexRetrieval* retrieval,
					 IndexScanListIterator* iterator,
					 temporary_key* lower, temporary_key* upper,
					 USHORT& forceInclFlag)
{
/**************************************
 *
 *	B T R _ m a k e _ b o u n d s
 *
 **************************************
 *
 * Functional description
 *	Construct search keys for lower/upper bounds for the given retrieval.
 *
 **************************************/

	// If we already have a key, assume that we are looking for an equality

	if (retrieval->irb_key)
	{
		copy_key(retrieval->irb_key, lower);
		copy_key(retrieval->irb_key, upper);
	}
	else
	{
		if (iterator && iterator->isEmpty())
			return false;

		idx_e errorCode = idx_e_ok;
		const auto idx = &retrieval->irb_desc;
		forceInclFlag &= ~(irb_force_lower | irb_force_upper);

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

		bool forceIncludeUpper = false, forceIncludeLower = false;

		if (const auto count = retrieval->irb_upper_count)
		{
			const auto values = iterator ? iterator->getUpperValues() :
				retrieval->irb_value + retrieval->irb_desc.idx_count;

			errorCode = BTR_make_key(tdbb, count, values, retrieval->irb_scale,
				idx, upper, keyType, &forceIncludeUpper);
		}

		if (errorCode == idx_e_ok)
		{
			if (const auto count = retrieval->irb_lower_count)
			{
				const auto values = iterator ? iterator->getLowerValues() :
					retrieval->irb_value;

				errorCode = BTR_make_key(tdbb, count, values, retrieval->irb_scale,
					idx, lower, keyType, &forceIncludeLower);