Method getInversion

src/jrd/optimizer/Retrieval.cpp:241–369

}

InversionCandidate* Retrieval::getInversion()
{
	if (finalCandidate)
		return finalCandidate;

	auto iter = optimizer->getConjuncts(outerFlag, innerFlag);

	InversionCandidate* invCandidate = nullptr;

	if (relation && !relation->rel_file && !relation->isVirtual())
	{
		InversionCandidateList inversions;

		// First, handle "AND" comparisons (all nodes except OR)
		for (iter.rewind(); iter.hasData(); ++iter)
		{
			const auto booleanNode = nodeAs<BinaryBoolNode>(*iter);

			if (!(iter & Optimizer::CONJUNCT_USED) &&
				(!booleanNode || booleanNode->blrOp != blr_or))
			{
				invCandidate = matchOnIndexes(indexScratches, iter, 1);

				if (invCandidate)
					inversions.add(invCandidate);
			}
		}

		getInversionCandidates(inversions, indexScratches, 1);

		// Second, handle "OR" comparisons
		for (iter.rewind(); iter.hasData(); ++iter)
		{
			const auto booleanNode = nodeAs<BinaryBoolNode>(*iter);

			if (!(iter & Optimizer::CONJUNCT_USED) &&
				(booleanNode && booleanNode->blrOp == blr_or))
			{
				invCandidate = matchOnIndexes(indexScratches, iter, 1);

				if (invCandidate)
				{
					invCandidate->boolean = iter;
					inversions.add(invCandidate);
				}
			}
		}

		if (sort)
			analyzeNavigation(inversions);

#ifdef OPT_DEBUG_RETRIEVAL
		// Debug
		printCandidates(inversions);
#endif

		invCandidate = makeInversion(inversions);