-
Notifications
You must be signed in to change notification settings - Fork 409
/
cypher_expr.c
1416 lines (1216 loc) · 46.6 KB
/
cypher_expr.c
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
/*
* For PostgreSQL Database Management System:
* (formerly known as Postgres, then as Postgres95)
*
* Portions Copyright (c) 1996-2010, The PostgreSQL Global Development Group
*
* Portions Copyright (c) 1994, The Regents of the University of California
*
* Permission to use, copy, modify, and distribute this software and its documentation for any purpose,
* without fee, and without a written agreement is hereby granted, provided that the above copyright notice
* and this paragraph and the following two paragraphs appear in all copies.
*
* IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR DIRECT,
* INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS,
* ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY
* OF CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
* BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
* THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND THE UNIVERSITY OF CALIFORNIA
* HAS NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
*/
#include "postgres.h"
#include "catalog/pg_type.h"
#include "miscadmin.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "nodes/nodes.h"
#include "nodes/parsenodes.h"
#include "nodes/value.h"
#include "optimizer/tlist.h"
#include "parser/parse_coerce.h"
#include "parser/parse_collate.h"
#include "parser/parse_expr.h"
#include "parser/parse_func.h"
#include "parser/cypher_clause.h"
#include "parser/parse_node.h"
#include "parser/parse_oper.h"
#include "parser/parse_relation.h"
#include "utils/builtins.h"
#include "utils/float.h"
#include "utils/int8.h"
#include "utils/lsyscache.h"
#include "utils/syscache.h"
#include "commands/label_commands.h"
#include "nodes/cypher_nodes.h"
#include "parser/cypher_expr.h"
#include "parser/cypher_item.h"
#include "parser/cypher_parse_node.h"
#include "parser/cypher_transform_entity.h"
#include "utils/ag_func.h"
#include "utils/agtype.h"
/* names of typecast functions */
#define FUNC_AGTYPE_TYPECAST_EDGE "agtype_typecast_edge"
#define FUNC_AGTYPE_TYPECAST_PATH "agtype_typecast_path"
#define FUNC_AGTYPE_TYPECAST_VERTEX "agtype_typecast_vertex"
#define FUNC_AGTYPE_TYPECAST_NUMERIC "agtype_typecast_numeric"
#define FUNC_AGTYPE_TYPECAST_FLOAT "agtype_typecast_float"
#define FUNC_AGTYPE_TYPECAST_INT "agtype_typecast_int"
#define FUNC_AGTYPE_TYPECAST_PG_FLOAT8 "agtype_to_float8"
#define FUNC_AGTYPE_TYPECAST_PG_BIGINT "agtype_to_int8"
#define FUNC_AGTYPE_TYPECAST_BOOL "agtype_typecast_bool"
static Node *transform_cypher_expr_recurse(cypher_parsestate *cpstate,
Node *expr);
static Node *transform_A_Const(cypher_parsestate *cpstate, A_Const *ac);
static Node *transform_ColumnRef(cypher_parsestate *cpstate, ColumnRef *cref);
static Node *transform_A_Indirection(cypher_parsestate *cpstate,
A_Indirection *a_ind);
static Node *transform_AEXPR_OP(cypher_parsestate *cpstate, A_Expr *a);
static Node *transform_BoolExpr(cypher_parsestate *cpstate, BoolExpr *expr);
static Node *transform_cypher_bool_const(cypher_parsestate *cpstate,
cypher_bool_const *bc);
static Node *transform_cypher_integer_const(cypher_parsestate *cpstate,
cypher_integer_const *ic);
static Node *transform_AEXPR_IN(cypher_parsestate *cpstate, A_Expr *a);
static Node *transform_cypher_param(cypher_parsestate *cpstate,
cypher_param *cp);
static Node *transform_cypher_map(cypher_parsestate *cpstate, cypher_map *cm);
static Node *transform_cypher_list(cypher_parsestate *cpstate,
cypher_list *cl);
static Node *transform_cypher_string_match(cypher_parsestate *cpstate,
cypher_string_match *csm_node);
static Node *transform_cypher_typecast(cypher_parsestate *cpstate,
cypher_typecast *ctypecast);
static Node *transform_CaseExpr(cypher_parsestate *cpstate,
CaseExpr *cexpr);
static Node *transform_CoalesceExpr(cypher_parsestate *cpstate,
CoalesceExpr *cexpr);
static Node *transform_SubLink(cypher_parsestate *cpstate, SubLink *sublink);
static Node *transform_FuncCall(cypher_parsestate *cpstate, FuncCall *fn);
static Node *transform_WholeRowRef(ParseState *pstate, ParseNamespaceItem *pnsi,
int location, int sublevels_up);
static ArrayExpr *make_agtype_array_expr(List *args);
/* transform a cypher expression */
Node *transform_cypher_expr(cypher_parsestate *cpstate, Node *expr,
ParseExprKind expr_kind)
{
ParseState *pstate = (ParseState *)cpstate;
ParseExprKind old_expr_kind;
Node *result;
// save and restore identity of expression type we're parsing
Assert(expr_kind != EXPR_KIND_NONE);
old_expr_kind = pstate->p_expr_kind;
pstate->p_expr_kind = expr_kind;
result = transform_cypher_expr_recurse(cpstate, expr);
pstate->p_expr_kind = old_expr_kind;
return result;
}
static Node *transform_cypher_expr_recurse(cypher_parsestate *cpstate,
Node *expr)
{
if (!expr)
return NULL;
// guard against stack overflow due to overly complex expressions
check_stack_depth();
switch (nodeTag(expr))
{
case T_A_Const:
return transform_A_Const(cpstate, (A_Const *)expr);
case T_ColumnRef:
return transform_ColumnRef(cpstate, (ColumnRef *)expr);
case T_A_Indirection:
return transform_A_Indirection(cpstate, (A_Indirection *)expr);
case T_A_Expr:
{
A_Expr *a = (A_Expr *)expr;
switch (a->kind)
{
case AEXPR_OP:
return transform_AEXPR_OP(cpstate, a);
case AEXPR_IN:
return transform_AEXPR_IN(cpstate, a);
default:
ereport(ERROR, (errmsg_internal("unrecognized A_Expr kind: %d",
a->kind)));
}
break;
}
case T_BoolExpr:
return transform_BoolExpr(cpstate, (BoolExpr *)expr);
case T_NullTest:
{
NullTest *n = (NullTest *)expr;
NullTest *transformed_expr = makeNode(NullTest);
transformed_expr->arg = (Expr *)transform_cypher_expr_recurse(cpstate,
(Node *)n->arg);
transformed_expr->nulltesttype = n->nulltesttype;
transformed_expr->argisrow = type_is_rowtype(exprType((Node *)transformed_expr->arg));
transformed_expr->location = n->location;
return (Node *) transformed_expr;
}
case T_CaseExpr:
return transform_CaseExpr(cpstate, (CaseExpr *) expr);
case T_CaseTestExpr:
return expr;
case T_CoalesceExpr:
return transform_CoalesceExpr(cpstate, (CoalesceExpr *) expr);
case T_ExtensibleNode:
if (is_ag_node(expr, cypher_bool_const))
return transform_cypher_bool_const(cpstate,
(cypher_bool_const *)expr);
if (is_ag_node(expr, cypher_integer_const))
return transform_cypher_integer_const(cpstate,
(cypher_integer_const *)expr);
if (is_ag_node(expr, cypher_param))
return transform_cypher_param(cpstate, (cypher_param *)expr);
if (is_ag_node(expr, cypher_map))
return transform_cypher_map(cpstate, (cypher_map *)expr);
if (is_ag_node(expr, cypher_list))
return transform_cypher_list(cpstate, (cypher_list *)expr);
if (is_ag_node(expr, cypher_string_match))
return transform_cypher_string_match(cpstate,
(cypher_string_match *)expr);
if (is_ag_node(expr, cypher_typecast))
return transform_cypher_typecast(cpstate,
(cypher_typecast *)expr);
ereport(ERROR,
(errmsg_internal("unrecognized ExtensibleNode: %s",
((ExtensibleNode *)expr)->extnodename)));
return NULL;
case T_FuncCall:
return transform_FuncCall(cpstate, (FuncCall *)expr);
case T_SubLink:
return transform_SubLink(cpstate, (SubLink *)expr);
break;
default:
ereport(ERROR, (errmsg_internal("unrecognized node type: %d",
nodeTag(expr))));
}
return NULL;
}
static Node *transform_A_Const(cypher_parsestate *cpstate, A_Const *ac)
{
ParseState *pstate = (ParseState *)cpstate;
ParseCallbackState pcbstate;
Value *v = &ac->val;
Datum d = (Datum)0;
bool is_null = false;
Const *c;
setup_parser_errposition_callback(&pcbstate, pstate, ac->location);
switch (nodeTag(v))
{
case T_Integer:
d = integer_to_agtype((int64)intVal(v));
break;
case T_Float:
{
char *n = strVal(v);
int64 i;
if (scanint8(n, true, &i))
{
d = integer_to_agtype(i);
}
else
{
float8 f = float8in_internal(n, NULL, "double precision", n);
d = float_to_agtype(f);
}
}
break;
case T_String:
d = string_to_agtype(strVal(v));
break;
case T_Null:
is_null = true;
break;
default:
ereport(ERROR,
(errmsg_internal("unrecognized node type: %d", nodeTag(v))));
return NULL;
}
cancel_parser_errposition_callback(&pcbstate);
// typtypmod, typcollation, typlen, and typbyval of agtype are hard-coded.
c = makeConst(AGTYPEOID, -1, InvalidOid, -1, d, is_null, false);
c->location = ac->location;
return (Node *)c;
}
/*
* Private function borrowed from PG's transformWholeRowRef.
* Construct a whole-row reference to represent the notation "relation.*".
*/
static Node *transform_WholeRowRef(ParseState *pstate, ParseNamespaceItem *pnsi,
int location, int sublevels_up)
{
Var *result;
int vnum;
RangeTblEntry *rte;
Assert(pnsi->p_rte != NULL);
rte = pnsi->p_rte;
/* Find the RTE's rangetable location */
vnum = pnsi->p_rtindex;
/*
* Build the appropriate referencing node. Note that if the RTE is a
* function returning scalar, we create just a plain reference to the
* function value, not a composite containing a single column. This is
* pretty inconsistent at first sight, but it's what we've done
* historically. One argument for it is that "rel" and "rel.*" mean the
* same thing for composite relations, so why not for scalar functions...
*/
result = makeWholeRowVar(rte, vnum, sublevels_up, true);
/* location is not filled in by makeWholeRowVar */
result->location = location;
/* mark relation as requiring whole-row SELECT access */
markVarForSelectPriv(pstate, result, rte);
return (Node *)result;
}
/*
* Function to transform a ColumnRef node from the grammar into a Var node
* Code borrowed from PG's transformColumnRef.
*/
static Node *transform_ColumnRef(cypher_parsestate *cpstate, ColumnRef *cref)
{
ParseState *pstate = (ParseState *)cpstate;
Node *field1 = NULL;
Node *field2 = NULL;
char *colname = NULL;
char *nspname = NULL;
char *relname = NULL;
Node *node = NULL;
ParseNamespaceItem *pnsi = NULL;
int levels_up;
switch (list_length(cref->fields))
{
case 1:
{
transform_entity *te;
field1 = (Node*)linitial(cref->fields);
Assert(IsA(field1, String));
colname = strVal(field1);
/* Try to identify as an unqualified column */
node = colNameToVar(pstate, colname, false, cref->location);
if (node != NULL)
{
break;
}
/*
* If expr_kind is WHERE, Try to find the columnRef as a
* transform_entity and extract the expr.
*/
if (pstate->p_expr_kind == EXPR_KIND_WHERE)
{
te = find_variable(cpstate, colname) ;
if (te != NULL && te->expr != NULL)
{
node = (Node *)te->expr;
break;
}
}
/*
* Not known as a column of any range-table entry.
* Try to find the name as a relation. Note that only
* relations already entered into the rangetable will be
* recognized.
*
* This is a hack for backwards compatibility with
* PostQUEL-inspired syntax. The preferred form now is
* "rel.*".
*/
pnsi = refnameNamespaceItem(pstate, NULL, colname,
cref->location, &levels_up);
if (pnsi)
{
node = transform_WholeRowRef(pstate, pnsi, cref->location,
levels_up);
}
else
{
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("could not find rte for %s", colname),
parser_errposition(pstate, cref->location)));
}
if (node == NULL)
{
ereport(ERROR, (errcode(ERRCODE_DATA_EXCEPTION),
errmsg("unable to transform whole row for %s",
colname),
parser_errposition(pstate, cref->location)));
}
break;
}
case 2:
{
Oid inputTypeId = InvalidOid;
Oid targetTypeId = InvalidOid;
field1 = (Node*)linitial(cref->fields);
field2 = (Node*)lsecond(cref->fields);
Assert(IsA(field1, String));
relname = strVal(field1);
if (IsA(field2, String))
{
colname = strVal(field2);
}
/* locate the referenced RTE */
pnsi = refnameNamespaceItem(pstate, nspname, relname,
cref->location, &levels_up);
if (pnsi == NULL)
{
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("could not find rte for %s.%s", relname,
colname),
parser_errposition(pstate, cref->location)));
break;
}
/*
* TODO: Left in for potential future use.
* Is it a whole-row reference?
*/
if (IsA(field2, A_Star))
{
node = transform_WholeRowRef(pstate, pnsi, cref->location,
levels_up);
break;
}
Assert(IsA(field2, String));
/* try to identify as a column of the RTE */
node = scanNSItemForColumn(pstate, pnsi, 0, colname,
cref->location);
if (node == NULL)
{
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("could not find column %s in rel %s of rte",
colname, relname),
parser_errposition(pstate, cref->location)));
}
/* coerce it to AGTYPE if possible */
inputTypeId = exprType(node);
targetTypeId = AGTYPEOID;
if (can_coerce_type(1, &inputTypeId, &targetTypeId,
COERCION_EXPLICIT))
{
node = coerce_type(pstate, node, inputTypeId, targetTypeId,
-1, COERCION_EXPLICIT,
COERCE_EXPLICIT_CAST, -1);
}
break;
}
default:
{
ereport(ERROR,
(errcode(ERRCODE_SYNTAX_ERROR),
errmsg("improper qualified name (too many dotted names): %s",
NameListToString(cref->fields)),
parser_errposition(pstate, cref->location)));
break;
}
}
if (node == NULL)
{
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("variable `%s` does not exist", colname),
parser_errposition(pstate, cref->location)));
}
return node;
}
static Node *transform_AEXPR_OP(cypher_parsestate *cpstate, A_Expr *a)
{
ParseState *pstate = (ParseState *)cpstate;
Node *last_srf = pstate->p_last_srf;
Node *lexpr = transform_cypher_expr_recurse(cpstate, a->lexpr);
Node *rexpr = transform_cypher_expr_recurse(cpstate, a->rexpr);
return (Node *)make_op(pstate, a->name, lexpr, rexpr, last_srf,
a->location);
}
static Node *transform_AEXPR_IN(cypher_parsestate *cpstate, A_Expr *a)
{
Oid func_in_oid;
FuncExpr *result;
List *args = NIL;
args = lappend(args, transform_cypher_expr_recurse(cpstate, a->rexpr));
args = lappend(args, transform_cypher_expr_recurse(cpstate, a->lexpr));
/* get the agtype_access_slice function */
func_in_oid = get_ag_func_oid("agtype_in_operator", 2, AGTYPEOID,
AGTYPEOID);
result = makeFuncExpr(func_in_oid, AGTYPEOID, args, InvalidOid, InvalidOid,
COERCE_EXPLICIT_CALL);
result->location = exprLocation(a->lexpr);
return (Node *)result;
}
static Node *transform_BoolExpr(cypher_parsestate *cpstate, BoolExpr *expr)
{
ParseState *pstate = (ParseState *)cpstate;
List *args = NIL;
const char *opname;
ListCell *la;
switch (expr->boolop)
{
case AND_EXPR:
opname = "AND";
break;
case OR_EXPR:
opname = "OR";
break;
case NOT_EXPR:
opname = "NOT";
break;
default:
ereport(ERROR, (errmsg_internal("unrecognized boolop: %d",
(int)expr->boolop)));
return NULL;
}
foreach (la, expr->args)
{
Node *arg = lfirst(la);
arg = transform_cypher_expr_recurse(cpstate, arg);
arg = coerce_to_boolean(pstate, arg, opname);
args = lappend(args, arg);
}
return (Node *)makeBoolExpr(expr->boolop, args, expr->location);
}
static Node *transform_cypher_bool_const(cypher_parsestate *cpstate,
cypher_bool_const *bc)
{
ParseState *pstate = (ParseState *)cpstate;
ParseCallbackState pcbstate;
Datum agt;
Const *c;
setup_parser_errposition_callback(&pcbstate, pstate, bc->location);
agt = boolean_to_agtype(bc->boolean);
cancel_parser_errposition_callback(&pcbstate);
// typtypmod, typcollation, typlen, and typbyval of agtype are hard-coded.
c = makeConst(AGTYPEOID, -1, InvalidOid, -1, agt, false, false);
c->location = bc->location;
return (Node *)c;
}
static Node *transform_cypher_integer_const(cypher_parsestate *cpstate,
cypher_integer_const *ic)
{
ParseState *pstate = (ParseState *)cpstate;
ParseCallbackState pcbstate;
Datum agt;
Const *c;
setup_parser_errposition_callback(&pcbstate, pstate, ic->location);
agt = integer_to_agtype(ic->integer);
cancel_parser_errposition_callback(&pcbstate);
// typtypmod, typcollation, typlen, and typbyval of agtype are hard-coded.
c = makeConst(AGTYPEOID, -1, InvalidOid, -1, agt, false, false);
c->location = ic->location;
return (Node *)c;
}
static Node *transform_cypher_param(cypher_parsestate *cpstate,
cypher_param *cp)
{
ParseState *pstate = (ParseState *)cpstate;
Const *const_str;
FuncExpr *func_expr;
Oid func_access_oid;
List *args = NIL;
if (!cpstate->params)
{
ereport(
ERROR,
(errcode(ERRCODE_UNDEFINED_PARAMETER),
errmsg(
"parameters argument is missing from cypher() function call"),
parser_errposition(pstate, cp->location)));
}
/* get the agtype_access_operator function */
func_access_oid = get_ag_func_oid("agtype_access_operator", 1,
AGTYPEARRAYOID);
args = lappend(args, copyObject(cpstate->params));
const_str = makeConst(AGTYPEOID, -1, InvalidOid, -1,
string_to_agtype(cp->name), false, false);
args = lappend(args, const_str);
func_expr = makeFuncExpr(func_access_oid, AGTYPEOID, args, InvalidOid,
InvalidOid, COERCE_EXPLICIT_CALL);
func_expr->location = cp->location;
return (Node *)func_expr;
}
static Node *transform_cypher_map(cypher_parsestate *cpstate, cypher_map *cm)
{
ParseState *pstate = (ParseState *)cpstate;
List *newkeyvals = NIL;
ListCell *le;
FuncExpr *fexpr;
Oid func_oid;
Assert(list_length(cm->keyvals) % 2 == 0);
le = list_head(cm->keyvals);
while (le != NULL)
{
Node *key;
Node *val;
Node *newval;
ParseCallbackState pcbstate;
Const *newkey;
key = lfirst(le);
le = lnext(cm->keyvals, le);
val = lfirst(le);
le = lnext(cm->keyvals, le);
newval = transform_cypher_expr_recurse(cpstate, val);
setup_parser_errposition_callback(&pcbstate, pstate, cm->location);
// typtypmod, typcollation, typlen, and typbyval of agtype are
// hard-coded.
newkey = makeConst(TEXTOID, -1, InvalidOid, -1,
CStringGetTextDatum(strVal(key)), false, false);
cancel_parser_errposition_callback(&pcbstate);
newkeyvals = lappend(lappend(newkeyvals, newkey), newval);
}
if (list_length(newkeyvals) == 0)
{
func_oid = get_ag_func_oid("agtype_build_map", 0);
}
else if (!cm->keep_null)
{
func_oid = get_ag_func_oid("agtype_build_map_nonull", 1, ANYOID);
}
else
{
func_oid = get_ag_func_oid("agtype_build_map", 1, ANYOID);
}
fexpr = makeFuncExpr(func_oid, AGTYPEOID, newkeyvals, InvalidOid,
InvalidOid, COERCE_EXPLICIT_CALL);
fexpr->location = cm->location;
return (Node *)fexpr;
}
/*
* Helper function to transform a cypher list into an agtype list. The function
* will use agtype_add to concatenate lists when the number of parameters
* exceeds 100, a PG limitation.
*/
static Node *transform_cypher_list(cypher_parsestate *cpstate, cypher_list *cl)
{
List *abl_args = NIL;
ListCell *le = NULL;
FuncExpr *aa_lhs_arg = NULL;
FuncExpr *fexpr = NULL;
Oid abl_func_oid = InvalidOid;
Oid aa_func_oid = InvalidOid;
int nelems = 0;
int i = 0;
/* determine which build function we need */
nelems = list_length(cl->elems);
if (nelems == 0)
{
abl_func_oid = get_ag_func_oid("agtype_build_list", 0);
}
else
{
abl_func_oid = get_ag_func_oid("agtype_build_list", 1, ANYOID);
}
/* get the concat function oid, if necessary */
if (nelems > 100)
{
aa_func_oid = get_ag_func_oid("agtype_add", 2, AGTYPEOID, AGTYPEOID);
}
/* iterate through the list of elements */
foreach (le, cl->elems)
{
Node *texpr = NULL;
/* transform the argument */
texpr = transform_cypher_expr_recurse(cpstate, lfirst(le));
/*
* If we have more than 100 elements we will need to add in the list
* concatenation function.
*/
if (i >= 100)
{
/* build the list function node argument for concatenate */
fexpr = makeFuncExpr(abl_func_oid, AGTYPEOID, abl_args, InvalidOid,
InvalidOid, COERCE_EXPLICIT_CALL);
fexpr->location = cl->location;
/* initial case, set up for concatenating 2 lists */
if (aa_lhs_arg == NULL)
{
aa_lhs_arg = fexpr;
}
/*
* For every other case, concatenate the list on to the previous
* concatenate operation.
*/
else
{
List *aa_args = list_make2(aa_lhs_arg, fexpr);
fexpr = makeFuncExpr(aa_func_oid, AGTYPEOID, aa_args,
InvalidOid, InvalidOid,
COERCE_EXPLICIT_CALL);
fexpr->location = cl->location;
/* set the lhs to the concatenation operation */
aa_lhs_arg = fexpr;
}
/* reset */
abl_args = NIL;
i = 0;
fexpr = NULL;
}
/* now add the latest transformed expression to the list */
abl_args = lappend(abl_args, texpr);
i++;
}
/* now build the final list function */
fexpr = makeFuncExpr(abl_func_oid, AGTYPEOID, abl_args, InvalidOid,
InvalidOid, COERCE_EXPLICIT_CALL);
fexpr->location = cl->location;
/*
* If there was a previous concatenation or list function, build a final
* concatenation function node
*/
if (aa_lhs_arg != NULL)
{
List *aa_args = list_make2(aa_lhs_arg, fexpr);
fexpr = makeFuncExpr(aa_func_oid, AGTYPEOID, aa_args, InvalidOid,
InvalidOid, COERCE_EXPLICIT_CALL);
}
return (Node *)fexpr;
}
// makes a VARIADIC agtype array
static ArrayExpr *make_agtype_array_expr(List *args)
{
ArrayExpr *newa = makeNode(ArrayExpr);
newa->elements = args;
/* assume all the variadic arguments were coerced to the same type */
newa->element_typeid = AGTYPEOID;
newa->array_typeid = AGTYPEARRAYOID;
if (!OidIsValid(newa->array_typeid))
{
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_OBJECT),
errmsg("could not find array type for data type %s",
format_type_be(newa->element_typeid))));
}
/* array_collid will be set by parse_collate.c */
newa->multidims = false;
return newa;
}
static Node *transform_A_Indirection(cypher_parsestate *cpstate,
A_Indirection *a_ind)
{
int location;
ListCell *lc = NULL;
Node *ind_arg_expr = NULL;
FuncExpr *func_expr = NULL;
Oid func_access_oid = InvalidOid;
Oid func_slice_oid = InvalidOid;
List *args = NIL;
bool is_access = false;
/* validate that we have an indirection with at least 1 entry */
Assert(a_ind != NULL && list_length(a_ind->indirection));
/* get the agtype_access_operator function */
func_access_oid = get_ag_func_oid("agtype_access_operator", 1,
AGTYPEARRAYOID);
/* get the agtype_access_slice function */
func_slice_oid = get_ag_func_oid("agtype_access_slice", 3, AGTYPEOID,
AGTYPEOID, AGTYPEOID);
/* transform indirection argument expression */
ind_arg_expr = transform_cypher_expr_recurse(cpstate, a_ind->arg);
/* get the location of the expression */
location = exprLocation(ind_arg_expr);
/* add the expression as the first entry */
args = lappend(args, ind_arg_expr);
/* iterate through the indirections */
foreach (lc, a_ind->indirection)
{
Node *node = lfirst(lc);
/* is this a slice? */
if (IsA(node, A_Indices) && ((A_Indices *)node)->is_slice)
{
A_Indices *indices = (A_Indices *)node;
/* were we working on an access? if so, wrap and close it */
if (is_access)
{
ArrayExpr *newa = make_agtype_array_expr(args);
func_expr = makeFuncExpr(func_access_oid, AGTYPEOID,
list_make1(newa),
InvalidOid, InvalidOid,
COERCE_EXPLICIT_CALL);
func_expr->funcvariadic = true;
func_expr->location = location;
/*
* The result of this function is the input to the next access
* or slice operator. So we need to start out with a new arg
* list with this function expression.
*/
args = lappend(NIL, func_expr);
/* we are no longer working on an access */
is_access = false;
}
/* add slice bounds to args */
if (!indices->lidx)
{
A_Const *n = makeNode(A_Const);
n->val.type = T_Null;
n->location = -1;
node = transform_cypher_expr_recurse(cpstate, (Node *)n);
}
else
{
node = transform_cypher_expr_recurse(cpstate, indices->lidx);
}
args = lappend(args, node);
if (!indices->uidx)
{
A_Const *n = makeNode(A_Const);
n->val.type = T_Null;
n->location = -1;
node = transform_cypher_expr_recurse(cpstate, (Node *)n);
}
else
{
node = transform_cypher_expr_recurse(cpstate, indices->uidx);
}
args = lappend(args, node);
/* wrap and close it */
func_expr = makeFuncExpr(func_slice_oid, AGTYPEOID, args,
InvalidOid, InvalidOid,
COERCE_EXPLICIT_CALL);
func_expr->location = location;
/*
* The result of this function is the input to the next access
* or slice operator. So we need to start out with a new arg
* list with this function expression.
*/
args = lappend(NIL, func_expr);
}
/* is this a string or index?*/
else if (IsA(node, String) || IsA(node, A_Indices))
{
/* we are working on an access */
is_access = true;
/* is this an index? */
if (IsA(node, A_Indices))
{
A_Indices *indices = (A_Indices *)node;
node = transform_cypher_expr_recurse(cpstate, indices->uidx);
args = lappend(args, node);
}
/* it must be a string */
else
{
Const *const_str = makeConst(AGTYPEOID, -1, InvalidOid, -1,
string_to_agtype(strVal(node)),
false, false);
args = lappend(args, const_str);
}
}
/* not an indirection we understand */
else
{
ereport(ERROR,
(errmsg("invalid indirection node %d", nodeTag(node))));
}
}
/* if we were doing an access, we need wrap the args with access func. */
if (is_access)
{
ArrayExpr *newa = make_agtype_array_expr(args);
func_expr = makeFuncExpr(func_access_oid, AGTYPEOID, list_make1(newa),
InvalidOid, InvalidOid,
COERCE_EXPLICIT_CALL);
func_expr->funcvariadic = true;
}
Assert(func_expr != NULL);
func_expr->location = location;
return (Node *)func_expr;
}
static Node *transform_cypher_string_match(cypher_parsestate *cpstate,
cypher_string_match *csm_node)
{
Node *expr;
FuncExpr *func_expr;
Oid func_access_oid;
List *args = NIL;
const char *func_name;
switch (csm_node->operation)
{
case CSMO_STARTS_WITH:
func_name = "agtype_string_match_starts_with";
break;
case CSMO_ENDS_WITH:
func_name = "agtype_string_match_ends_with";
break;
case CSMO_CONTAINS:
func_name = "agtype_string_match_contains";
break;
default:
ereport(ERROR,
(errmsg_internal("unknown Cypher string match operation")));
}
func_access_oid = get_ag_func_oid(func_name, 2, AGTYPEOID, AGTYPEOID);
expr = transform_cypher_expr_recurse(cpstate, csm_node->lhs);
args = lappend(args, expr);
expr = transform_cypher_expr_recurse(cpstate, csm_node->rhs);
args = lappend(args, expr);
func_expr = makeFuncExpr(func_access_oid, AGTYPEOID, args, InvalidOid,
InvalidOid, COERCE_EXPLICIT_CALL);
func_expr->location = csm_node->location;
return (Node *)func_expr;
}
/*
* Function to create a typecasting node
*/
static Node *transform_cypher_typecast(cypher_parsestate *cpstate,
cypher_typecast *ctypecast)
{
List *fname;
FuncCall *fnode;