Skip to content
Navigation Menu
{{ message }}
forked from RedisGraph/RedisGraph
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathast_validations.c
More file actions
2332 lines (2012 loc) · 74.5 KB
/
Copy pathast_validations.c
File metadata and controls
2332 lines (2012 loc) · 74.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (c) 2006-Present, Redis Ltd.
* All rights reserved.
*
* Licensed under your choice of the Redis Source Available License 2.0
* (RSALv2); or (b) the Server Side Public License v1 (SSPLv1); or (c) the
* GNU Affero General Public License v3 (AGPLv3).
*/
#include "RG.h"
#include "ast.h"
#include "util.h"
#include "astnode.h"
#include "ast_shared.h"
#include "../util/arr.h"
#include "ast_visitor.h"
#include "../errors/errors.h"
#include "../util/rax_extensions.h"
#include "../procedures/procedure.h"
#include "../execution_plan/ops/op.h"
#include "../arithmetic/arithmetic_expression.h"
typedef enum {
NOT_DEFINED = -0x01, // Yet to be defined
REGULAR = 0x00, // UNION
ALL = 0x01 // UNION ALL
} is_union_all;
typedef struct {
rax *defined_identifiers; // identifiers environment
cypher_astnode_type_t clause; // top-level clause type
is_union_all union_all; // union type (regular or ALL)
bool ignore_identifiers; // ignore identifiers in case `RETURN *` was met in a call {} clause
} validations_ctx;
// ast validation visitor mappings
// number of ast-node types: _MAX_VT_OFF = sizeof(struct cypher_astnode_vts) / sizeof(struct cypher_astnode_vt *) = 115
static visit validations_mapping[115];
// validate that allShortestPaths is in a supported place
static bool _ValidateAllShortestPaths
(
const cypher_astnode_t *root // root to validate
) {
ASSERT(root != NULL);
cypher_astnode_type_t t = cypher_astnode_type(root);
// if we found allShortestPaths in invalid parent return true
if(t == CYPHER_AST_SHORTEST_PATH &&
!cypher_ast_shortest_path_is_single(root)) {
return false;
}
// allShortestPaths is invalid in the MATCH predicate
if(t == CYPHER_AST_MATCH) {
const cypher_astnode_t *predicate = cypher_ast_match_get_predicate(root);
return predicate == NULL || _ValidateAllShortestPaths(predicate);
}
// recursively traverse all children
uint nchildren = cypher_astnode_nchildren(root);
for(uint i = 0; i < nchildren; i ++) {
const cypher_astnode_t *child = cypher_astnode_get_child(root, i);
if(!_ValidateAllShortestPaths(child)) {
return false;
}
}
return true;
}
// validate that shortestPaths is in a supported place
static bool _ValidateShortestPaths
(
const cypher_astnode_t *root // root to validate
) {
ASSERT(root != NULL);
cypher_astnode_type_t t = cypher_astnode_type(root);
// if we found allShortestPaths in invalid parent return true
if(t == CYPHER_AST_SHORTEST_PATH &&
cypher_ast_shortest_path_is_single(root)) {
return false;
}
// shortestPaths is invalid in the MATCH pattern
if(t == CYPHER_AST_MATCH) {
const cypher_astnode_t *pattern = cypher_ast_match_get_pattern(root);
return _ValidateShortestPaths(pattern);
}
if(t == CYPHER_AST_WITH || t == CYPHER_AST_RETURN) {
return true;
}
// recursively traverse all children
uint nchildren = cypher_astnode_nchildren(root);
for(uint i = 0; i < nchildren; i ++) {
const cypher_astnode_t *child = cypher_astnode_get_child(root, i);
if(!_ValidateShortestPaths(child)) {
return false;
}
}
return true;
}
// introduce aliases of a WITH clause to the bound vars
// return true if no errors where encountered, false otherwise
static bool _AST_GetWithAliases
(
const cypher_astnode_t *node, // ast-node from which to retrieve the aliases
rax *aliases // rax to which to insert the aliases
) {
if(!node || (cypher_astnode_type(node) != CYPHER_AST_WITH)) {
return false;
}
// local env to check for duplicate column names
rax *local_env = raxNew();
// traverse the projections
uint num_with_projections = cypher_ast_with_nprojections(node);
for(uint i = 0; i < num_with_projections; i ++) {
const cypher_astnode_t *child = cypher_ast_with_get_projection(node, i);
const cypher_astnode_t *alias_node = cypher_ast_projection_get_alias(child);
const char *alias;
if(alias_node) {
// Retrieve "a" from "WITH [1, 2, 3] as a"
alias = cypher_ast_identifier_get_name(alias_node);
} else {
// Retrieve "a" from "WITH a"
const cypher_astnode_t *expr = cypher_ast_projection_get_expression(child);
if(cypher_astnode_type(expr) != CYPHER_AST_IDENTIFIER) {
ErrorCtx_SetError(EMSG_WITH_PROJ_MISSING_ALIAS);
raxFree(local_env);
return false;
}
alias = cypher_ast_identifier_get_name(expr);
}
raxInsert(aliases, (unsigned char *)alias, strlen(alias), NULL, NULL);
// check for duplicate column names (other than internal representation
// of outer-context variables)
if(raxTryInsert(local_env, (unsigned char *)alias, strlen(alias), NULL,
NULL) == 0 &&
alias[0] != '@') {
ErrorCtx_SetError(EMSG_SAME_RESULT_COLUMN_NAME);
raxFree(local_env);
return false;
}
}
raxFree(local_env);
return true;
}
// Extract identifiers / aliases from a procedure call.
static void _AST_GetProcCallAliases
(
const cypher_astnode_t *node, // ast-node to validate
rax *identifiers // rax to extract identifiers to
) {
// CALL db.labels() yield label
// CALL db.labels() yield label as l
ASSERT(node && identifiers);
ASSERT(cypher_astnode_type(node) == CYPHER_AST_CALL);
// traverse projections, collecting the identifiers and expressions
uint projection_count = cypher_ast_call_nprojections(node);
for(uint i = 0; i < projection_count; i++) {
const char *identifier = NULL;
const cypher_astnode_t *proj_node = cypher_ast_call_get_projection(node, i);
const cypher_astnode_t *alias_node = cypher_ast_projection_get_alias(proj_node);
if(alias_node) {
// Alias is given: YIELD label AS l.
identifier = cypher_ast_identifier_get_name(alias_node);
raxInsert(identifiers, (unsigned char *)identifier, strlen(identifier), NULL, NULL);
}
// Introduce expression-identifier as well
// Example: YIELD label --> label is introduced (removed outside of scope)
const cypher_astnode_t *exp_node = cypher_ast_projection_get_expression(proj_node);
identifier = cypher_ast_identifier_get_name(exp_node);
raxInsert(identifiers, (unsigned char *)identifier, strlen(identifier), NULL, NULL);
}
}
// make sure multi-hop traversals has length greater than or equal to zero
static AST_Validation _ValidateMultiHopTraversal
(
const cypher_astnode_t *edge, // ast-node to validate
const cypher_astnode_t *range // varlength range
) {
int start = 1;
int end = INT_MAX - 2;
const cypher_astnode_t *range_start = cypher_ast_range_get_start(range);
if(range_start) {
start = AST_ParseIntegerNode(range_start);
}
const cypher_astnode_t *range_end = cypher_ast_range_get_end(range);
if(range_end) {
end = AST_ParseIntegerNode(range_end);
}
// Validate specified range
if(start > end) {
ErrorCtx_SetError(EMSG_VAR_LEN_INVALID_RANGE);
return AST_INVALID;
}
return AST_VALID;
}
// Verify that MERGE doesn't redeclare bound relations, that one reltype is specified for unbound relations,
// and that the entity is not a variable length pattern
static AST_Validation _ValidateMergeRelation
(
const cypher_astnode_t *entity, // ast-node (rel-pattern)
rax *defined_aliases // bound variables
) {
// Verify that this is not a variable length relationship
const cypher_astnode_t *range = cypher_ast_rel_pattern_get_varlength(entity);
if(range) {
ErrorCtx_SetError(EMSG_VAR_LEN, "MERGE");
return AST_INVALID;
}
const cypher_astnode_t *identifier = cypher_ast_rel_pattern_get_identifier(entity);
const char *alias = NULL;
if(identifier) {
alias = cypher_ast_identifier_get_name(identifier);
// Verify that we're not redeclaring a bound variable
if(raxFind(defined_aliases, (unsigned char *)alias, strlen(alias)) != raxNotFound) {
ErrorCtx_SetError(EMSG_REDECLARE, "variable", alias, "MERGE");
return AST_INVALID;
}
}
// Exactly one reltype should be specified for the introduced edge
uint reltype_count = cypher_ast_rel_pattern_nreltypes(entity);
if(reltype_count != 1) {
ErrorCtx_SetError(EMSG_ONE_RELATIONSHIP_TYPE, "MERGE");
return AST_INVALID;
}
// We don't need to validate the MERGE edge's direction, as an undirected edge
// in MERGE should result a single outgoing edge to be created.
return AST_VALID;
}
// Verify that MERGE does not introduce labels or properties to bound nodes
static AST_Validation _ValidateMergeNode
(
const cypher_astnode_t *entity, // ast-node
rax *defined_aliases // bound variables
) {
if(raxSize(defined_aliases) == 0) {
return AST_VALID;
}
const cypher_astnode_t *identifier = cypher_ast_node_pattern_get_identifier(entity);
if(!identifier) {
return AST_VALID;
}
const char *alias = cypher_ast_identifier_get_name(identifier);
// If the entity is unaliased or not previously bound, it cannot be redeclared
if(raxFind(defined_aliases, (unsigned char *)alias, strlen(alias)) == raxNotFound) {
return AST_VALID;
}
// If the entity is already bound, the MERGE pattern should not introduce labels or properties
if(cypher_ast_node_pattern_nlabels(entity) ||
cypher_ast_node_pattern_get_properties(entity)) {
ErrorCtx_SetError(EMSG_REDECLARE, "node", alias, "MERGE");
return AST_INVALID;
}
return AST_VALID;
}
// Validate that the relation alias of an edge is not bound
static AST_Validation _ValidateCreateRelation
(
const cypher_astnode_t *entity, // ast-node
rax *defined_aliases // bounded variables
) {
const cypher_astnode_t *identifier = cypher_ast_rel_pattern_get_identifier(entity);
if(identifier) {
const char *alias = cypher_ast_identifier_get_name(identifier);
if(raxFind(defined_aliases, (unsigned char *)alias, strlen(alias)) != raxNotFound) {
ErrorCtx_SetError(EMSG_REDECLARE, "variable", alias, "CREATE");
return AST_INVALID;
}
}
return AST_VALID;
}
// Validate each entity referenced in a single path of a CREATE clause.
static AST_Validation _Validate_CREATE_Entities
(
const cypher_astnode_t *path, // ast-node (pattern-path)
rax *defined_aliases // bound vars
) {
uint nelems = cypher_ast_pattern_path_nelements(path);
// Redeclaration of a node is not allowed only when the path is of length 0, as in: MATCH (a) CREATE (a).
// Otherwise, using a defined alias of a node is allowed, as in: MATCH (a) CREATE (a)-[:E]->(:B)
if(nelems == 1) {
const cypher_astnode_t *node = cypher_ast_pattern_path_get_element(path, 0);
const cypher_astnode_t *identifier = cypher_ast_node_pattern_get_identifier(node);
if(identifier) {
const char *alias = cypher_ast_identifier_get_name(identifier);
if(raxFind(defined_aliases, (unsigned char *)alias, strlen(alias)) != raxNotFound) {
ErrorCtx_SetError(EMSG_REDECLARE, "variable", alias, "CREATE");
return AST_INVALID;
}
}
}
return AST_VALID;
}
// make sure an identifier is bound
static AST_Validation _Validate_referred_identifier
(
rax *defined_identifiers, // bound variables
const char *identifier // identifier to check
) {
int len = strlen(identifier);
if(raxFind(defined_identifiers, (unsigned char *)identifier, len) == raxNotFound) {
ErrorCtx_SetError(EMSG_NOT_DEFINED_LEN, len, identifier);
return AST_INVALID;
}
return AST_VALID;
}
// validate a list comprehension
static VISITOR_STRATEGY _Validate_list_comprehension
(
const cypher_astnode_t *n, // ast-node
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
// we enter ONLY when start=true, so no check is needed
const cypher_astnode_t *id = cypher_ast_list_comprehension_get_identifier(n);
const char *identifier = cypher_ast_identifier_get_name(id);
bool is_new = (raxFind(vctx->defined_identifiers, (unsigned char *)identifier, strlen(identifier)) == raxNotFound);
// Introduce local identifier if it is not yet introduced
if(is_new) {
raxInsert(vctx->defined_identifiers, (unsigned char *)identifier, strlen(identifier), NULL, NULL);
}
// Visit expression-children
// Visit expression
const cypher_astnode_t *exp = cypher_ast_list_comprehension_get_expression(n);
if(exp) {
AST_Visitor_visit(exp, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
}
// Visit predicate
const cypher_astnode_t *pred = cypher_ast_list_comprehension_get_predicate(n);
if(pred) {
AST_Visitor_visit(pred, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
}
// Visit eval
const cypher_astnode_t *eval = cypher_ast_list_comprehension_get_eval(n);
if(eval) {
AST_Visitor_visit(eval, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
}
// list comprehension identifier is no longer bound, remove it from bound vars
// if it was introduced
if(is_new) {
raxRemove(vctx->defined_identifiers, (unsigned char *)identifier, strlen(identifier), NULL);
}
// do not traverse children
return VISITOR_CONTINUE;
}
// validate a pattern comprehension
static VISITOR_STRATEGY _Validate_pattern_comprehension
(
const cypher_astnode_t *n, // ast-node
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
// we enter ONLY when start=true, so no check is needed
const cypher_astnode_t *id = cypher_ast_pattern_comprehension_get_identifier(n);
bool is_new;
const char *identifier;
if(id) {
identifier = cypher_ast_identifier_get_name(id);
is_new = (raxFind(vctx->defined_identifiers, (unsigned char *)identifier, strlen(identifier)) == raxNotFound);
}
else {
is_new = false;
}
// Introduce local identifier if it is not yet introduced
if(is_new) {
raxInsert(vctx->defined_identifiers, (unsigned char *)identifier, strlen(identifier), NULL, NULL);
}
// Visit expression-children
// Visit pattern
const cypher_astnode_t *pattern = cypher_ast_pattern_comprehension_get_pattern(n);
if(pattern) {
AST_Visitor_visit(pattern, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
}
// Visit predicate
const cypher_astnode_t *pred = cypher_ast_pattern_comprehension_get_predicate(n);
if(pred) {
AST_Visitor_visit(pred, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
}
// Visit eval
const cypher_astnode_t *eval = cypher_ast_pattern_comprehension_get_eval(n);
if(eval) {
AST_Visitor_visit(eval, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
}
// pattern comprehension identifier is no longer bound, remove it from bound vars
// if it was introduced
if(is_new) {
raxRemove(vctx->defined_identifiers, (unsigned char *)identifier, strlen(identifier), NULL);
}
// do not traverse children
return VISITOR_CONTINUE;
}
// validate that an identifier is bound
static VISITOR_STRATEGY _Validate_identifier
(
const cypher_astnode_t *n, // ast-node (identifier)
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
if(!start || vctx->ignore_identifiers) {
return VISITOR_CONTINUE;
}
const char *identifier = cypher_ast_identifier_get_name(n);
if(_Validate_referred_identifier(vctx->defined_identifiers, identifier) == AST_INVALID) {
return VISITOR_BREAK;
}
return VISITOR_RECURSE;
}
// validate the values of a map
static VISITOR_STRATEGY _Validate_map
(
const cypher_astnode_t *n, // ast-node (map)
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
// we enter ONLY when start=true, so no check is needed
// traverse the entries of the map
uint nentries = cypher_ast_map_nentries(n);
for (uint i = 0; i < nentries; i++) {
const cypher_astnode_t *exp = cypher_ast_map_get_value(n, i);
AST_Visitor_visit(exp, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
}
// do not traverse children
return VISITOR_CONTINUE;
}
// validate a projection
static VISITOR_STRATEGY _Validate_projection
(
const cypher_astnode_t *n, // ast-node
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
// we enter ONLY when start=true, so no check is needed
const cypher_astnode_t *exp = cypher_ast_projection_get_expression(n);
AST_Visitor_visit(exp, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
// do not traverse children
return VISITOR_CONTINUE;
}
// validate a function-call
static AST_Validation _ValidateFunctionCall
(
const char *funcName, // function name
bool include_aggregates // are aggregations allowed
) {
// check existence of the function-name
if(!AR_FuncExists(funcName)) {
ErrorCtx_SetError(EMSG_UNKNOWN_FUNCTION, funcName);
return AST_INVALID;
}
if(!include_aggregates && AR_FuncIsAggregate(funcName)) {
// Provide a unique error for using aggregate functions from inappropriate contexts
ErrorCtx_SetError(EMSG_INVALID_USE_OF_AGGREGATION_FUNCTION, funcName);
return AST_INVALID;
}
return AST_VALID;
}
// validate an apply-all operator
static VISITOR_STRATEGY _Validate_apply_all_operator
(
const cypher_astnode_t *n, // ast-node
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
if(!start) {
return VISITOR_CONTINUE;
}
// Working with a function call that has * as its argument.
const cypher_astnode_t *func = cypher_ast_apply_all_operator_get_func_name(n);
const char *func_name = cypher_ast_function_name_get_value(func);
// Verify that this is a COUNT call.
if(strcasecmp(func_name, "COUNT")) {
ErrorCtx_SetError(EMSG_INVALID_USAGE_OF_STAR_PARAMETER);
return VISITOR_BREAK;
}
// Verify that DISTINCT is not specified.
if(cypher_ast_apply_all_operator_get_distinct(n)) {
// TODO consider opening a parser error, this construction is invalid in Neo's parser.
ErrorCtx_SetError(EMSG_INVALID_USAGE_OF_DISTINCT_STAR_PARAMETER);
return VISITOR_BREAK;
}
return VISITOR_RECURSE;
}
// validate an apply operator
static VISITOR_STRATEGY _Validate_apply_operator
(
const cypher_astnode_t *n, // ast-node
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
if(!start) {
return VISITOR_CONTINUE;
}
// Collect the function name.
const cypher_astnode_t *func = cypher_ast_apply_operator_get_func_name(n);
const char *func_name = cypher_ast_function_name_get_value(func);
if(_ValidateFunctionCall(func_name, (vctx->clause == CYPHER_AST_WITH ||
vctx->clause == CYPHER_AST_RETURN)) == AST_INVALID) {
return VISITOR_BREAK;
}
return VISITOR_RECURSE;
}
// validate reduce
static VISITOR_STRATEGY _Validate_reduce
(
const cypher_astnode_t *n, // ast-node
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
if(!start) {
return VISITOR_CONTINUE;
}
cypher_astnode_type_t orig_clause = vctx->clause;
// change clause type of vctx so that function-validation will work properly
// (include-aggregations should be set to false)
vctx->clause = CYPHER_AST_REDUCE;
// A reduce call has an accumulator and a local list variable that should
// only be accessed within its scope;
// do not leave them in the identifiers map
// example: reduce(sum=0, n in [1,2] | sum+n)
// the reduce function is composed of 5 components:
// 1. accumulator `sum`
// 2. accumulator init expression `0`
// 3. list expression `[1,2,3]`
// 4. variable `n`
// 5. eval expression `sum + n`
// make sure that the init expression is a known var or valid exp.
const cypher_astnode_t *init_node = cypher_ast_reduce_get_init(n);
if(cypher_astnode_type(init_node) == CYPHER_AST_IDENTIFIER) {
// check if the variable has already been introduced
const char *var_str = cypher_ast_identifier_get_name(init_node);
if(raxFind(vctx->defined_identifiers, (unsigned char *)var_str, strlen(var_str)) == raxNotFound) {
ErrorCtx_SetError(EMSG_NOT_DEFINED, var_str);
return VISITOR_BREAK;
}
}
else {
AST_Visitor_visit(init_node, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
}
// make sure that the list expression is a list (or list comprehension) or an
// alias of an existing one.
const cypher_astnode_t *list_var = cypher_ast_reduce_get_expression(n);
if(cypher_astnode_type(list_var) == CYPHER_AST_IDENTIFIER) {
const char *list_var_str = cypher_ast_identifier_get_name(list_var);
if(raxFind(vctx->defined_identifiers, (unsigned char *) list_var_str, strlen(list_var_str)) == raxNotFound) {
ErrorCtx_SetError(EMSG_NOT_DEFINED, list_var_str);
return VISITOR_BREAK;
}
}
// Visit the list expression (no need to introduce local vars)
AST_Visitor_visit(list_var, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
// make sure that the eval-expression exists
const cypher_astnode_t *eval_node = cypher_ast_reduce_get_eval(n);
if(!eval_node) {
ErrorCtx_SetError(EMSG_MISSING_EVAL_EXP_IN_REDUCE);
return VISITOR_BREAK;
}
// If accumulator is already in the environment, don't reintroduce it
const cypher_astnode_t *accum_node =cypher_ast_reduce_get_accumulator(n);
const char *accum_str = cypher_ast_identifier_get_name(accum_node);
bool introduce_accum =
(raxFind(vctx->defined_identifiers, (unsigned char *) accum_str, strlen(accum_str))
== raxNotFound);
if(introduce_accum)
raxInsert(vctx->defined_identifiers, (unsigned char *) accum_str, strlen(accum_str), NULL, NULL);
// same for the list var
const cypher_astnode_t *list_var_node =cypher_ast_reduce_get_identifier(n);
const char *list_var_str = cypher_ast_identifier_get_name(list_var_node);
bool introduce_list_var = (raxFind(vctx->defined_identifiers, (unsigned char *) list_var_str, strlen(list_var_str))
== raxNotFound);
if(introduce_list_var)
raxInsert(vctx->defined_identifiers, (unsigned char *) list_var_str, strlen(list_var_str), NULL, NULL);
// visit eval expression
const cypher_astnode_t *eval_exp = cypher_ast_reduce_get_eval(n);
AST_Visitor_visit(eval_exp, visitor);
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
// change clause type back
vctx->clause = orig_clause;
// Remove local vars\aliases if introduced
if(introduce_accum) {
raxRemove(vctx->defined_identifiers, (unsigned char *) accum_str, strlen(accum_str), NULL);
}
if(introduce_list_var) {
raxRemove(vctx->defined_identifiers, (unsigned char *) list_var_str, strlen(list_var_str), NULL);
}
// do not traverse children
return VISITOR_CONTINUE;
}
// Validate the property maps used in node/edge patterns in MATCH, and CREATE clauses
static AST_Validation _ValidateInlinedProperties
(
const cypher_astnode_t *props // ast-node representing the map
) {
if(props == NULL) {
return AST_VALID;
}
// Emit an error if the properties are not presented as a map, as in:
// MATCH (p {invalid_property_construction}) RETURN p
if(cypher_astnode_type(props) != CYPHER_AST_MAP) {
ErrorCtx_SetError(EMSG_UNHANDLED_TYPE_INLINE_PROPERTIES);
return AST_INVALID;
}
// traverse map entries
uint prop_count = cypher_ast_map_nentries(props);
for(uint i = 0; i < prop_count; i++) {
const cypher_astnode_t *prop_val = cypher_ast_map_get_value(props, i);
const cypher_astnode_t **patterns = AST_GetTypedNodes(prop_val, CYPHER_AST_PATTERN_PATH);
uint patterns_count = array_len(patterns);
array_free(patterns);
if(patterns_count > 0) {
// Encountered query of the form:
// MATCH (a {prop: ()-[]->()}) RETURN a
ErrorCtx_SetError(EMSG_UNHANDLED_TYPE_INLINE_PROPERTIES);
return AST_INVALID;
}
}
return AST_VALID;
}
// validate a relation-pattern
static VISITOR_STRATEGY _Validate_rel_pattern
(
const cypher_astnode_t *n, // ast-node (rel-pattern)s
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
if(!start) {
return VISITOR_CONTINUE;
}
const cypher_astnode_t *range = cypher_ast_rel_pattern_get_varlength(n);
if(vctx->clause == CYPHER_AST_CREATE) {
// validate that the relation alias is not bound
if(_ValidateCreateRelation(n, vctx->defined_identifiers) == AST_INVALID) {
return VISITOR_BREAK;
}
// Validate that each relation has exactly one type
uint reltype_count = cypher_ast_rel_pattern_nreltypes(n);
if(reltype_count != 1) {
ErrorCtx_SetError(EMSG_ONE_RELATIONSHIP_TYPE, "CREATE");
return VISITOR_BREAK;
}
// Validate that each relation being created is directed
if(cypher_ast_rel_pattern_get_direction(n) == CYPHER_REL_BIDIRECTIONAL) {
ErrorCtx_SetError(EMSG_CREATE_DIRECTED_RELATIONSHIP);
return VISITOR_BREAK;
}
// Validate that each relation being created is not variable length relationship
if(range) {
ErrorCtx_SetError(EMSG_VAR_LEN, "CREATE");
return VISITOR_BREAK;
}
}
if(_ValidateInlinedProperties(cypher_ast_rel_pattern_get_properties(n)) == AST_INVALID) {
return VISITOR_BREAK;
}
if(vctx->clause == CYPHER_AST_MERGE &&
_ValidateMergeRelation(n, vctx->defined_identifiers) == AST_INVALID) {
return VISITOR_BREAK;
}
const cypher_astnode_t *alias_node = cypher_ast_rel_pattern_get_identifier(n);
if(!alias_node && !range) {
return VISITOR_RECURSE; // Skip unaliased, single-hop entities.
}
// If this is a multi-hop traversal, validate it accordingly
if(range && _ValidateMultiHopTraversal(n, range) == AST_INVALID) {
return VISITOR_BREAK;
}
if(alias_node) {
const char *alias = cypher_ast_identifier_get_name(alias_node);
void *alias_type = raxFind(vctx->defined_identifiers, (unsigned char *)alias, strlen(alias));
if(alias_type == raxNotFound) {
raxInsert(vctx->defined_identifiers, (unsigned char *)alias, strlen(alias), (void *)T_EDGE, NULL);
return VISITOR_RECURSE;
}
if(alias_type != (void *)T_EDGE && alias_type != NULL) {
ErrorCtx_SetError(EMSG_SAME_ALIAS_NODE_RELATIONSHIP, alias);
return VISITOR_BREAK;
}
if(vctx->clause == CYPHER_AST_MATCH && alias_type != NULL) {
ErrorCtx_SetError(EMSG_SAME_ALIAS_MULTIPLE_PATTERNS, alias);
return VISITOR_BREAK;
}
}
return VISITOR_RECURSE;
}
// 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(EMSG_SAME_ALIAS_NODE_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
(
const cypher_astnode_t *n, // ast-node
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
if(!start) {
return VISITOR_CONTINUE;
}
if(cypher_ast_shortest_path_is_single(n)) {
const cypher_astnode_t *path = cypher_ast_shortest_path_get_path(n);
int elements = cypher_ast_pattern_path_nelements(path);
const cypher_astnode_t *start = cypher_ast_node_pattern_get_identifier(cypher_ast_pattern_path_get_element(path, 0));
const cypher_astnode_t *end = cypher_ast_node_pattern_get_identifier(cypher_ast_pattern_path_get_element(path, elements - 1));
if(start == NULL || end == NULL) {
ErrorCtx_SetError(EMSG_SHORTESTPATH_BOUND_NODES);
return VISITOR_BREAK;
}
const char *start_id = cypher_ast_identifier_get_name(start);
const char *end_id = cypher_ast_identifier_get_name(end);
if(raxFind(vctx->defined_identifiers, (unsigned char *)start_id, strlen(start_id)) == raxNotFound ||
raxFind(vctx->defined_identifiers, (unsigned char *)end_id, strlen(end_id)) == raxNotFound) {
ErrorCtx_SetError(EMSG_SHORTESTPATH_BOUND_NODES);
return VISITOR_BREAK;
}
return VISITOR_RECURSE;
} else {
// MATCH (a), (b), p = allShortestPaths((a)-[*2..]->(b)) RETURN p
// validate rel pattern range doesn't contains a minimum > 1
const cypher_astnode_t **ranges = AST_GetTypedNodes(n, CYPHER_AST_RANGE);
int range_count = array_len(ranges);
for(int i = 0; i < range_count; i++) {
long min_hops = 1;
const cypher_astnode_t *r = ranges[i];
const cypher_astnode_t *start = cypher_ast_range_get_start(r);
if(start) min_hops = AST_ParseIntegerNode(start);
if(min_hops != 1) {
ErrorCtx_SetError(EMSG_ALLSHORTESTPATH_MINIMAL_LENGTH);
break;
}
}
array_free(ranges);
}
if(ErrorCtx_EncounteredError()) {
return VISITOR_BREAK;
}
return VISITOR_RECURSE;
}
// validate a pattern-path expression
static VISITOR_STRATEGY _Validate_pattern_path
(
const cypher_astnode_t *n, // ast-node
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
if(!start) {
return VISITOR_CONTINUE;
}
if(vctx->clause == CYPHER_AST_CREATE &&
(_Validate_CREATE_Entities(n, vctx->defined_identifiers) == AST_INVALID)) {
return VISITOR_BREAK;
}
return VISITOR_RECURSE;
}
// validate a named path
static VISITOR_STRATEGY _Validate_named_path
(
const cypher_astnode_t *n, // ast-node (named path)
bool start, // first traversal
ast_visitor *visitor // visitor
) {
validations_ctx *vctx = AST_Visitor_GetContext(visitor);
if(!start) {
return VISITOR_CONTINUE;
}
// introduce identifiers to bound variables environment
const cypher_astnode_t *alias_node = cypher_ast_named_path_get_identifier(n);
const char *alias = cypher_ast_identifier_get_name(alias_node);
raxInsert(vctx->defined_identifiers, (unsigned char *)alias, strlen(alias), NULL, NULL);
return VISITOR_RECURSE;
}
// validate limit and skip modifiers
static AST_Validation _Validate_LIMIT_SKIP_Modifiers
(
const cypher_astnode_t *limit, // limit ast-node
const cypher_astnode_t *skip // skip ast-node
) {
if(limit) {
// Handle non-integer or non parameter types specified as LIMIT value
// The value validation of integer node or parameter node is done in run time evaluation.
if(cypher_astnode_type(limit) != CYPHER_AST_INTEGER &&
cypher_astnode_type(limit) != CYPHER_AST_PARAMETER) {
ErrorCtx_SetError(EMSG_LIMIT_MUST_BE_NON_NEGATIVE);
return AST_INVALID;
}
}
if(skip) {
// Handle non-integer or non parameter types specified as skip value
// The value validation of integer node or parameter node is done in run time evaluation.
if(cypher_astnode_type(skip) != CYPHER_AST_INTEGER &&
cypher_astnode_type(skip) != CYPHER_AST_PARAMETER) {
ErrorCtx_SetError(EMSG_SKIP_MUST_BE_NON_NEGATIVE);
return AST_INVALID;
}
}
return AST_VALID;
}
// validate UNION clauses
static AST_Validation _ValidateUnion_Clauses
(
const AST *ast // ast-node
) {
AST_Validation res = AST_VALID;
uint *union_indices = AST_GetClauseIndices(ast, CYPHER_AST_UNION);
uint union_clause_count = array_len(union_indices);
You can’t perform that action at this time.