Function _Validate_node_pattern

src/ast/ast_validations.c:828–863

validate a node-pattern expression

// validate a node-pattern expression
static VISITOR_STRATEGY _Validate_node_pattern
(
	const cypher_astnode_t *n,  // ast-node (node-pattern)
	bool start,                 // first traversal
	ast_visitor *visitor        // visitor
) {
	validations_ctx *vctx = AST_Visitor_GetContext(visitor);
	if(!start) {
		return VISITOR_CONTINUE;
	}

	if(_ValidateInlinedProperties(cypher_ast_node_pattern_get_properties(n)) == AST_INVALID) {
		return VISITOR_BREAK;
	}

	const cypher_astnode_t *alias_node = cypher_ast_node_pattern_get_identifier(n);
	if(!alias_node) {
		return VISITOR_RECURSE;
	}

	const char *alias = cypher_ast_identifier_get_name(alias_node);
	if(vctx->clause == CYPHER_AST_MERGE) {
		if(_ValidateMergeNode(n, vctx->defined_identifiers) == AST_INVALID) {
			return VISITOR_BREAK;
		}
	} else {
		void *alias_type = raxFind(vctx->defined_identifiers, (unsigned char *)alias, strlen(alias));
		if(alias_type != raxNotFound && alias_type != NULL && alias_type != (void *)T_NODE) {
			ErrorCtx_SetError("The alias '%s' was specified for both a node and a relationship.", alias);
			return VISITOR_BREAK;
		}
	}
	raxInsert(vctx->defined_identifiers, (unsigned char *)alias, strlen(alias), (void *)T_NODE, NULL);

	return VISITOR_RECURSE;
}

// validate a shortest-path expression
static VISITOR_STRATEGY _Validate_shortest_path