Function BTR_evaluate

src/jrd/btr.cpp:1130–1300

}

void BTR_evaluate(thread_db* tdbb, const IndexRetrieval* retrieval, RecordBitmap** bitmap,
				  RecordBitmap* bitmap_and)
{
/**************************************
 *
 *	B T R _ e v a l u a t e
 *
 **************************************
 *
 * Functional description
 *	Do an index scan and return a bitmap
 * 	of all candidate record numbers.
 *
 **************************************/
	SET_TDBB(tdbb);

	RelationPages* relPages = retrieval->irb_relation->getPages(tdbb);
	WIN window(relPages->rel_pg_space_id, -1);

	temporary_key lowerKey, upperKey;
	lowerKey.key_flags = 0;
	lowerKey.key_length = 0;
	upperKey.key_flags = 0;
	upperKey.key_length = 0;

	AutoPtr<IndexScanListIterator> iterator =
		retrieval->irb_list ? FB_NEW_POOL(*tdbb->getDefaultPool())
			IndexScanListIterator(tdbb, retrieval) : nullptr;

	temporary_key* lower = &lowerKey;
	temporary_key* upper = &upperKey;
	USHORT forceInclFlag = 0;

	if (!BTR_make_bounds(tdbb, retrieval, iterator, lower, upper, forceInclFlag))
		return;

	index_desc idx;
	btree_page* page = nullptr;

	do
	{
		if (!page) // scan from the index root
			page = BTR_find_page(tdbb, retrieval, &window, &idx, lower, upper);

		const bool descending = (idx.idx_flags & idx_descending);
		bool skipLowerKey = (retrieval->irb_generic & ~forceInclFlag) & irb_exclude_lower;
		const bool partLower = (retrieval->irb_lower_count < idx.idx_count);

		// If there is a starting descriptor, search down index to starting position.
		// This may involve sibling buckets if splits are in progress.  If there
		// isn't a starting descriptor, walk down the left side of the index.

		USHORT prefix;
		UCHAR* pointer;
		if (retrieval->irb_lower_count)
		{
			while (!(pointer = find_node_start_point(page, lower, 0, &prefix,
				descending, (retrieval->irb_generic & (irb_starting | irb_partial)))))