Function _UseIdOptimization

src/execution_plan/optimizations/seek_by_id.c:60–105

}

static void _UseIdOptimization(ExecutionPlan *plan, OpBase *scan_op) {
	/* See if there's a filter of the form
	 * ID(n) op X
	 * where X is a constant and op in [EQ, GE, LE, GT, LT] */
	OpBase *parent = scan_op->parent;
	OpBase *grandparent;
	UnsignedRange *id_range = NULL;
	while(parent && parent->type == OPType_FILTER) {
		grandparent = parent->parent; // Track the next op to visit in case we free parent.
		OpFilter *filter = (OpFilter *)parent;
		FT_FilterNode *f = filter->filterTree;

		AST_Operator op;
		EntityID id;
		bool reverse;
		if(_idFilter(f, &op, &id, &reverse)) {
			if(!id_range) id_range = UnsignedRange_New();
			if(reverse) op = ArithmeticOp_ReverseOp(op);
			UnsignedRange_TightenRange(id_range, op, id);

			// Free replaced operations.
			ExecutionPlan_RemoveOp(plan, (OpBase *)filter);
			OpBase_Free((OpBase *)filter);
		}
		// Advance.
		parent = grandparent;
	}
	if(id_range) {
		/* Don't replace label scan, but set it to have range query.
		 * Issue 818 https://github.com/RedisGraph/RedisGraph/issues/818
		 * This optimization caused a range query over the entire range of ids in the graph
		 * regardless to the label. */
		if(scan_op->type == OPType_NODE_BY_LABEL_SCAN) {
			NodeByLabelScan *label_scan = (NodeByLabelScan *) scan_op;
			NodeByLabelScanOp_SetIDRange(label_scan, id_range);
		} else {
			const char *alias = ((AllNodeScan *)scan_op)->alias;
			OpBase *opNodeByIdSeek = NewNodeByIdSeekOp(scan_op->plan, alias, id_range);

			// Managed to reduce!
			ExecutionPlan_ReplaceOp(plan, scan_op, opNodeByIdSeek);
			OpBase_Free(scan_op);
		}
		UnsignedRange_Free(id_range);
	}
}

void seekByID(ExecutionPlan *plan) {
	ASSERT(plan != NULL);