Method matchBoolean

src/jrd/optimizer/Retrieval.cpp:1689–2032

}

bool Retrieval::matchBoolean(IndexScratch* indexScratch,
							 BoolExprNode* boolean,
							 unsigned scope) const
{
	if (boolean->nodFlags & ExprNode::FLAG_DEOPTIMIZE)
		return false;

	const auto cmpNode = nodeAs<ComparativeBoolNode>(boolean);
	const auto missingNode = nodeAs<MissingBoolNode>(boolean);
	const auto listNode = nodeAs<InListBoolNode>(boolean);
	const auto notNode = nodeAs<NotBoolNode>(boolean);
	const auto rseNode = nodeAs<RseBoolNode>(boolean);
	bool forward = true;
	ValueExprNode* value = nullptr;
	ValueExprNode* match = nullptr;
	ValueListNode* list = nullptr;

	if (cmpNode)
	{
		match = cmpNode->arg1;
		value = cmpNode->arg2;
	}
	else if (listNode)
	{
		match = listNode->arg;
		list = listNode->list;

		if (!list->computable(csb, stream, false))
			return false;
	}
	else if (missingNode)
		match = missingNode->arg;
	else
	{
		fb_assert(notNode || rseNode);
		return false;
	}

	ValueExprNode* value2 = (cmpNode && cmpNode->blrOp == blr_between) ?
		cmpNode->arg3 : nullptr;

	const auto idx = indexScratch->index;

	if (idx->idx_flags & idx_condition)
	{
		// If index condition matches the boolean, this should not be
		// considered a match. Full index scan will be used instead.
		if (idx->idx_condition->sameAs(boolean, true))
			return false;
	}

	if (idx->idx_flags & idx_expression)
	{
		// see if one side or the other is matchable to the index expression

		if (!checkIndexExpression(idx, match) ||
			(value && !value->computable(csb, stream, false)))
		{