-
Notifications
You must be signed in to change notification settings - Fork 0
/
pg_queryid.c
1065 lines (938 loc) · 26.7 KB
/
pg_queryid.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
/*-------------------------------------------------------------------------
*
* pg_queryid.c: External query fingerprinting for PostgreSQL.
*
* This extension imports PostgreSQL's fingerprinting functions and adds some
* additional configuration options for its heuristic.
*
* This program is open source, licensed under the PostgreSQL license.
* For license terms, see the LICENSE file.
*
* Copyright (c) 2008-2022, PostgreSQL Global Development Group
* Copyright (C) 2021-2022: Julien Rouhaud
*
*-------------------------------------------------------------------------
*/
#include "postgres.h"
#if PG_VERSION_NUM < 140000
#error "Requires PostgreSQL 14 or above"
#endif
#include "catalog/pg_class.h"
#include "catalog/pg_collation.h"
#include "catalog/pg_type.h"
#include "common/hashfn.h"
#include "miscadmin.h"
#include "parser/analyze.h"
#include "tcop/tcopprot.h"
#include "utils/builtins.h"
#include "utils/guc.h"
#include "utils/lsyscache.h"
#include "utils/queryjumble.h"
#include "utils/syscache.h"
#include "utils/varlena.h"
PG_MODULE_MAGIC;
/*
* Wrappers around pgq_AppendJumble to encapsulate details of serialization
* of individual local variable elements.
*/
#define PGQ_APP_JUMB(item) \
pgq_AppendJumble(jstate, (const unsigned char *) &(item), sizeof(item))
#define PGQ_APP_JUMB_STRING(str) \
pgq_AppendJumble(jstate, (const unsigned char *) (str), strlen(str) + 1)
#define PGQ_JUMBLE_EXPR(s, n) if (!pgq_JumbleExpr(s, n)) return false
typedef enum pgqKind
{
pgq_Rel,
pgq_Func,
pgq_Seq,
pgq_Coll,
pgq_Typ
} pgqKind;
/* Saved hook values in case of unload */
static post_parse_analyze_hook_type prev_post_parse_analyze_hook = NULL;
/*---- Local variables ----*/
static bool is_spl = false;
/*---- GUC variables ----*/
static bool pgq_use_names;
static bool pgq_ignore_schema;
static bool pgq_ignore_temp;
/*---- Function declarations ----*/
void _PG_init(void);
PG_FUNCTION_INFO_V1(pg_queryid);
static void pgq_post_parse_analyze(ParseState *pstate, Query *query,
JumbleState *jstate);
static void pgq_AppendJumble(JumbleState *jstate,
const unsigned char *item, Size size);
static uint64 pgq_compute_utility_queryid(const char *str, int query_location, int query_len);
static bool pgq_JumbleExpr(JumbleState *jstate, Node *node);
static JumbleState *pgq_JumbleQuery(Query *query, const char *querytext);
static void pgq_JumbleOid(JumbleState *jstate, pgqKind kind, Oid oid);
static bool pgq_JumbleQueryInternal(JumbleState *jstate, Query *query);
static bool pgq_JumbleRangeTable(JumbleState *jstate, List *rtable);
static void pgq_JumbleRowMarks(JumbleState *jstate, List *rowMarks);
static void pgq_RecordConstLocation(JumbleState *jstate, int location);
/*
* Module load callback
*/
void
_PG_init(void)
{
char *spl_string;
List *spl;
/*
* We don't want to change the queryid fingerprinting algorithm dynamically
* as it would lead to duplicated entries for extensions like
* pg_stat_statements which rely on the queryid. We however still allow to
* dynamically load the module as pg_queryid() SRF can be used to compute
* the queryid of a given query with core implementation.
*/
if (!process_shared_preload_libraries_in_progress)
{
is_spl = false;
return;
}
is_spl = true;
spl_string = pstrdup(shared_preload_libraries_string);
if (!SplitIdentifierString(spl_string, ',', &spl))
elog(ERROR, "Could not parse shared_preload_libraries");
if (strcmp(llast(spl), "pg_queryid") != 0)
elog(ERROR, "pg_queryid should be last the last element in shared_preload_libraries");
list_free(spl);
pfree(spl_string);
/*
* Define (or redefine) custom GUC variables.
*/
DefineCustomBoolVariable("pg_queryid.use_object_names",
"Fingerprint queries using object names rather than Oids.",
NULL,
&pgq_use_names,
true,
PGC_SUSET,
0,
NULL,
NULL,
NULL);
DefineCustomBoolVariable("pg_queryid.ignore_schema",
"Ignore schema for query fingerprinting.",
NULL,
&pgq_ignore_schema,
false,
PGC_SUSET,
0,
NULL,
NULL,
NULL);
DefineCustomBoolVariable("pg_queryid.ignore_temp_tables",
"Don't fingerprint queries using temporary relations.",
NULL,
&pgq_ignore_temp,
false,
PGC_SUSET,
0,
NULL,
NULL,
NULL);
EmitWarningsOnPlaceholders("pg_queryid");
/*
* Install hooks.
*/
prev_post_parse_analyze_hook = post_parse_analyze_hook;
post_parse_analyze_hook = pgq_post_parse_analyze;
}
static void
pgq_post_parse_analyze(ParseState *pstate, Query *query, JumbleState *jstate)
{
JumbleState *pgq_jstate;
if (query->queryId != UINT64CONST(0) || jstate != NULL)
elog(ERROR, "pg_queryid: a queryid has already been calculated");
pgq_jstate = pgq_JumbleQuery(query, pstate->p_sourcetext);
if (prev_post_parse_analyze_hook)
prev_post_parse_analyze_hook(pstate, query, pgq_jstate);
}
/*
* AppendJumble: Append a value that is substantive in a given query to
* the current jumble.
*/
static void
pgq_AppendJumble(JumbleState *jstate, const unsigned char *item, Size size)
{
unsigned char *jumble = jstate->jumble;
Size jumble_len = jstate->jumble_len;
/*
* Whenever the jumble buffer is full, we hash the current contents and
* reset the buffer to contain just that hash value, thus relying on the
* hash to summarize everything so far.
*/
while (size > 0)
{
Size part_size;
if (jumble_len >= JUMBLE_SIZE)
{
uint64 start_hash;
start_hash = DatumGetUInt64(hash_any_extended(jumble,
JUMBLE_SIZE, 0));
memcpy(jumble, &start_hash, sizeof(start_hash));
jumble_len = sizeof(start_hash);
}
part_size = Min(size, JUMBLE_SIZE - jumble_len);
memcpy(jumble + jumble_len, item, part_size);
jumble_len += part_size;
item += part_size;
size -= part_size;
}
jstate->jumble_len = jumble_len;
}
/*
* Compute a query identifier for the given utility query string.
*/
static uint64
pgq_compute_utility_queryid(const char *query_text, int query_location,
int query_len)
{
uint64 queryId;
const char *sql;
/*
* Confine our attention to the relevant part of the string, if the
* query is a portion of a multi-statement source string.
*/
sql = CleanQuerytext(query_text, &query_location, &query_len);
queryId = DatumGetUInt64(hash_any_extended((const unsigned char *) sql,
query_len, 0));
/*
* If we are unlucky enough to get a hash of zero(invalid), use
* queryID as 2 instead, queryID 1 is already in use for normal
* statements.
*/
if (queryId == UINT64CONST(0))
queryId = UINT64CONST(2);
return queryId;
}
/*
* Jumble an expression tree
*
* In general this function should handle all the same node types that
* expression_tree_walker() does, and therefore it's coded to be as parallel
* to that function as possible. However, since we are only invoked on
* queries immediately post-parse-analysis, we need not handle node types
* that only appear in planning.
*
* Note: the reason we don't simply use expression_tree_walker() is that the
* point of that function is to support tree walkers that don't care about
* most tree node types, but here we care about all types. We should complain
* about any unrecognized node type.
*/
static bool
pgq_JumbleExpr(JumbleState *jstate, Node *node)
{
ListCell *temp;
if (node == NULL)
return true;
/* Guard against stack overflow due to overly complex expressions */
check_stack_depth();
/*
* We always emit the node's NodeTag, then any additional fields that are
* considered significant, and then we recurse to any child nodes.
*/
PGQ_APP_JUMB(node->type);
switch (nodeTag(node))
{
case T_Var:
{
Var *var = (Var *) node;
if(pgq_use_names && !IS_SPECIAL_VARNO(var->varno))
{
}
else
{
PGQ_APP_JUMB(var->varno);
PGQ_APP_JUMB(var->varattno);
PGQ_APP_JUMB(var->varlevelsup);
}
}
break;
case T_Const:
{
Const *c = (Const *) node;
/* We jumble only the constant's type, not its value */
PGQ_APP_JUMB(c->consttype);
/* Also, record its parse location for query normalization */
pgq_RecordConstLocation(jstate, c->location);
}
break;
case T_Param:
{
Param *p = (Param *) node;
PGQ_APP_JUMB(p->paramkind);
PGQ_APP_JUMB(p->paramid);
PGQ_APP_JUMB(p->paramtype);
/* Also, track the highest external Param id */
if (p->paramkind == PARAM_EXTERN &&
p->paramid > jstate->highest_extern_param_id)
jstate->highest_extern_param_id = p->paramid;
}
break;
case T_Aggref:
{
Aggref *expr = (Aggref *) node;
pgq_JumbleOid(jstate, pgq_Func, expr->aggfnoid);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->aggdirectargs);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->args);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->aggorder);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->aggdistinct);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->aggfilter);
}
break;
case T_GroupingFunc:
{
GroupingFunc *grpnode = (GroupingFunc *) node;
PGQ_JUMBLE_EXPR(jstate, (Node *) grpnode->refs);
}
break;
case T_WindowFunc:
{
WindowFunc *expr = (WindowFunc *) node;
PGQ_APP_JUMB(expr->winfnoid);
PGQ_APP_JUMB(expr->winref);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->args);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->aggfilter);
}
break;
case T_SubscriptingRef:
{
SubscriptingRef *sbsref = (SubscriptingRef *) node;
PGQ_JUMBLE_EXPR(jstate, (Node *) sbsref->refupperindexpr);
PGQ_JUMBLE_EXPR(jstate, (Node *) sbsref->reflowerindexpr);
PGQ_JUMBLE_EXPR(jstate, (Node *) sbsref->refexpr);
PGQ_JUMBLE_EXPR(jstate, (Node *) sbsref->refassgnexpr);
}
break;
case T_FuncExpr:
{
FuncExpr *expr = (FuncExpr *) node;
pgq_JumbleOid(jstate, pgq_Func, expr->funcid);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->args);
}
break;
case T_NamedArgExpr:
{
NamedArgExpr *nae = (NamedArgExpr *) node;
PGQ_APP_JUMB(nae->argnumber);
PGQ_JUMBLE_EXPR(jstate, (Node *) nae->arg);
}
break;
case T_OpExpr:
case T_DistinctExpr: /* struct-equivalent to OpExpr */
case T_NullIfExpr: /* struct-equivalent to OpExpr */
{
OpExpr *expr = (OpExpr *) node;
PGQ_APP_JUMB(expr->opno);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->args);
}
break;
case T_ScalarArrayOpExpr:
{
ScalarArrayOpExpr *expr = (ScalarArrayOpExpr *) node;
PGQ_APP_JUMB(expr->opno);
PGQ_APP_JUMB(expr->useOr);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->args);
}
break;
case T_BoolExpr:
{
BoolExpr *expr = (BoolExpr *) node;
PGQ_APP_JUMB(expr->boolop);
PGQ_JUMBLE_EXPR(jstate, (Node *) expr->args);
}
break;
case T_SubLink:
{
SubLink *sublink = (SubLink *) node;
PGQ_APP_JUMB(sublink->subLinkType);
PGQ_APP_JUMB(sublink->subLinkId);
PGQ_JUMBLE_EXPR(jstate, (Node *) sublink->testexpr);
if (!pgq_JumbleQueryInternal(jstate,
castNode(Query, sublink->subselect)))
return false;
}
break;
case T_FieldSelect:
{
FieldSelect *fs = (FieldSelect *) node;
PGQ_APP_JUMB(fs->fieldnum);
PGQ_JUMBLE_EXPR(jstate, (Node *) fs->arg);
}
break;
case T_FieldStore:
{
FieldStore *fstore = (FieldStore *) node;
PGQ_JUMBLE_EXPR(jstate, (Node *) fstore->arg);
PGQ_JUMBLE_EXPR(jstate, (Node *) fstore->newvals);
}
break;
case T_RelabelType:
{
RelabelType *rt = (RelabelType *) node;
PGQ_APP_JUMB(rt->resulttype);
PGQ_JUMBLE_EXPR(jstate, (Node *) rt->arg);
}
break;
case T_CoerceViaIO:
{
CoerceViaIO *cio = (CoerceViaIO *) node;
PGQ_APP_JUMB(cio->resulttype);
PGQ_JUMBLE_EXPR(jstate, (Node *) cio->arg);
}
break;
case T_ArrayCoerceExpr:
{
ArrayCoerceExpr *acexpr = (ArrayCoerceExpr *) node;
PGQ_APP_JUMB(acexpr->resulttype);
PGQ_JUMBLE_EXPR(jstate, (Node *) acexpr->arg);
PGQ_JUMBLE_EXPR(jstate, (Node *) acexpr->elemexpr);
}
break;
case T_ConvertRowtypeExpr:
{
ConvertRowtypeExpr *crexpr = (ConvertRowtypeExpr *) node;
PGQ_APP_JUMB(crexpr->resulttype);
PGQ_JUMBLE_EXPR(jstate, (Node *) crexpr->arg);
}
break;
case T_CollateExpr:
{
CollateExpr *ce = (CollateExpr *) node;
pgq_JumbleOid(jstate, pgq_Coll, ce->collOid);
PGQ_JUMBLE_EXPR(jstate, (Node *) ce->arg);
}
break;
case T_CaseExpr:
{
CaseExpr *caseexpr = (CaseExpr *) node;
PGQ_JUMBLE_EXPR(jstate, (Node *) caseexpr->arg);
foreach(temp, caseexpr->args)
{
CaseWhen *when = lfirst_node(CaseWhen, temp);
PGQ_JUMBLE_EXPR(jstate, (Node *) when->expr);
PGQ_JUMBLE_EXPR(jstate, (Node *) when->result);
}
PGQ_JUMBLE_EXPR(jstate, (Node *) caseexpr->defresult);
}
break;
case T_CaseTestExpr:
{
CaseTestExpr *ct = (CaseTestExpr *) node;
pgq_JumbleOid(jstate, pgq_Typ, ct->typeId);
}
break;
case T_ArrayExpr:
PGQ_JUMBLE_EXPR(jstate, (Node *) ((ArrayExpr *) node)->elements);
break;
case T_RowExpr:
PGQ_JUMBLE_EXPR(jstate, (Node *) ((RowExpr *) node)->args);
break;
case T_RowCompareExpr:
{
RowCompareExpr *rcexpr = (RowCompareExpr *) node;
PGQ_APP_JUMB(rcexpr->rctype);
PGQ_JUMBLE_EXPR(jstate, (Node *) rcexpr->largs);
PGQ_JUMBLE_EXPR(jstate, (Node *) rcexpr->rargs);
}
break;
case T_CoalesceExpr:
PGQ_JUMBLE_EXPR(jstate, (Node *) ((CoalesceExpr *) node)->args);
break;
case T_MinMaxExpr:
{
MinMaxExpr *mmexpr = (MinMaxExpr *) node;
PGQ_APP_JUMB(mmexpr->op);
PGQ_JUMBLE_EXPR(jstate, (Node *) mmexpr->args);
}
break;
case T_SQLValueFunction:
{
SQLValueFunction *svf = (SQLValueFunction *) node;
PGQ_APP_JUMB(svf->op);
/* type is fully determined by op */
PGQ_APP_JUMB(svf->typmod);
}
break;
case T_XmlExpr:
{
XmlExpr *xexpr = (XmlExpr *) node;
PGQ_APP_JUMB(xexpr->op);
PGQ_JUMBLE_EXPR(jstate, (Node *) xexpr->named_args);
PGQ_JUMBLE_EXPR(jstate, (Node *) xexpr->args);
}
break;
case T_NullTest:
{
NullTest *nt = (NullTest *) node;
PGQ_APP_JUMB(nt->nulltesttype);
PGQ_JUMBLE_EXPR(jstate, (Node *) nt->arg);
}
break;
case T_BooleanTest:
{
BooleanTest *bt = (BooleanTest *) node;
PGQ_APP_JUMB(bt->booltesttype);
PGQ_JUMBLE_EXPR(jstate, (Node *) bt->arg);
}
break;
case T_CoerceToDomain:
{
CoerceToDomain *cd = (CoerceToDomain *) node;
PGQ_APP_JUMB(cd->resulttype);
PGQ_JUMBLE_EXPR(jstate, (Node *) cd->arg);
}
break;
case T_CoerceToDomainValue:
{
CoerceToDomainValue *cdv = (CoerceToDomainValue *) node;
pgq_JumbleOid(jstate, pgq_Typ, cdv->typeId);
}
break;
case T_SetToDefault:
{
SetToDefault *sd = (SetToDefault *) node;
pgq_JumbleOid(jstate, pgq_Typ, sd->typeId);
}
break;
case T_CurrentOfExpr:
{
CurrentOfExpr *ce = (CurrentOfExpr *) node;
PGQ_APP_JUMB(ce->cvarno);
if (ce->cursor_name)
PGQ_APP_JUMB_STRING(ce->cursor_name);
PGQ_APP_JUMB(ce->cursor_param);
}
break;
case T_NextValueExpr:
{
NextValueExpr *nve = (NextValueExpr *) node;
pgq_JumbleOid(jstate, pgq_Seq, nve->seqid);
pgq_JumbleOid(jstate, pgq_Typ, nve->typeId);
}
break;
case T_InferenceElem:
{
InferenceElem *ie = (InferenceElem *) node;
pgq_JumbleOid(jstate, pgq_Coll, ie->infercollid);
PGQ_APP_JUMB(ie->inferopclass);
PGQ_JUMBLE_EXPR(jstate, ie->expr);
}
break;
case T_TargetEntry:
{
TargetEntry *tle = (TargetEntry *) node;
PGQ_APP_JUMB(tle->resno);
PGQ_APP_JUMB(tle->ressortgroupref);
PGQ_JUMBLE_EXPR(jstate, (Node *) tle->expr);
}
break;
case T_RangeTblRef:
{
RangeTblRef *rtr = (RangeTblRef *) node;
PGQ_APP_JUMB(rtr->rtindex);
}
break;
case T_JoinExpr:
{
JoinExpr *join = (JoinExpr *) node;
PGQ_APP_JUMB(join->jointype);
PGQ_APP_JUMB(join->isNatural);
PGQ_APP_JUMB(join->rtindex);
PGQ_JUMBLE_EXPR(jstate, join->larg);
PGQ_JUMBLE_EXPR(jstate, join->rarg);
PGQ_JUMBLE_EXPR(jstate, join->quals);
}
break;
case T_FromExpr:
{
FromExpr *from = (FromExpr *) node;
PGQ_JUMBLE_EXPR(jstate, (Node *) from->fromlist);
PGQ_JUMBLE_EXPR(jstate, from->quals);
}
break;
case T_OnConflictExpr:
{
OnConflictExpr *conf = (OnConflictExpr *) node;
PGQ_APP_JUMB(conf->action);
PGQ_JUMBLE_EXPR(jstate, (Node *) conf->arbiterElems);
PGQ_JUMBLE_EXPR(jstate, conf->arbiterWhere);
PGQ_JUMBLE_EXPR(jstate, (Node *) conf->onConflictSet);
PGQ_JUMBLE_EXPR(jstate, conf->onConflictWhere);
PGQ_APP_JUMB(conf->constraint);
PGQ_APP_JUMB(conf->exclRelIndex);
PGQ_JUMBLE_EXPR(jstate, (Node *) conf->exclRelTlist);
}
break;
case T_List:
foreach(temp, (List *) node)
{
PGQ_JUMBLE_EXPR(jstate, (Node *) lfirst(temp));
}
break;
case T_IntList:
foreach(temp, (List *) node)
{
PGQ_APP_JUMB(lfirst_int(temp));
}
break;
case T_SortGroupClause:
{
SortGroupClause *sgc = (SortGroupClause *) node;
PGQ_APP_JUMB(sgc->tleSortGroupRef);
PGQ_APP_JUMB(sgc->eqop);
PGQ_APP_JUMB(sgc->sortop);
PGQ_APP_JUMB(sgc->nulls_first);
}
break;
case T_GroupingSet:
{
GroupingSet *gsnode = (GroupingSet *) node;
PGQ_JUMBLE_EXPR(jstate, (Node *) gsnode->content);
}
break;
case T_WindowClause:
{
WindowClause *wc = (WindowClause *) node;
PGQ_APP_JUMB(wc->winref);
PGQ_APP_JUMB(wc->frameOptions);
PGQ_JUMBLE_EXPR(jstate, (Node *) wc->partitionClause);
PGQ_JUMBLE_EXPR(jstate, (Node *) wc->orderClause);
PGQ_JUMBLE_EXPR(jstate, wc->startOffset);
PGQ_JUMBLE_EXPR(jstate, wc->endOffset);
}
break;
case T_CommonTableExpr:
{
CommonTableExpr *cte = (CommonTableExpr *) node;
/* we store the string name because RTE_CTE RTEs need it */
PGQ_APP_JUMB_STRING(cte->ctename);
PGQ_APP_JUMB(cte->ctematerialized);
if (!pgq_JumbleQueryInternal(jstate,
castNode(Query, cte->ctequery)))
return false;
}
break;
case T_SetOperationStmt:
{
SetOperationStmt *setop = (SetOperationStmt *) node;
PGQ_APP_JUMB(setop->op);
PGQ_APP_JUMB(setop->all);
PGQ_JUMBLE_EXPR(jstate, setop->larg);
PGQ_JUMBLE_EXPR(jstate, setop->rarg);
}
break;
case T_RangeTblFunction:
{
RangeTblFunction *rtfunc = (RangeTblFunction *) node;
PGQ_JUMBLE_EXPR(jstate, rtfunc->funcexpr);
}
break;
case T_TableFunc:
{
TableFunc *tablefunc = (TableFunc *) node;
PGQ_JUMBLE_EXPR(jstate, tablefunc->docexpr);
PGQ_JUMBLE_EXPR(jstate, tablefunc->rowexpr);
PGQ_JUMBLE_EXPR(jstate, (Node *) tablefunc->colexprs);
}
break;
case T_TableSampleClause:
{
TableSampleClause *tsc = (TableSampleClause *) node;
PGQ_APP_JUMB(tsc->tsmhandler);
PGQ_JUMBLE_EXPR(jstate, (Node *) tsc->args);
PGQ_JUMBLE_EXPR(jstate, (Node *) tsc->repeatable);
}
break;
default:
/* Only a warning, since we can stumble along anyway */
elog(WARNING, "unrecognized node type: %d",
(int) nodeTag(node));
break;
}
return true;
}
static JumbleState *
pgq_JumbleQuery(Query *query, const char *querytext)
{
JumbleState *jstate = NULL;
if (query->utilityStmt)
{
query->queryId = pgq_compute_utility_queryid(querytext,
query->stmt_location,
query->stmt_len);
}
else
{
jstate = (JumbleState *) palloc(sizeof(JumbleState));
/* Set up workspace for query jumbling */
jstate->jumble = (unsigned char *) palloc(JUMBLE_SIZE);
jstate->jumble_len = 0;
jstate->clocations_buf_size = 32;
jstate->clocations = (LocationLen *)
palloc(jstate->clocations_buf_size * sizeof(LocationLen));
jstate->clocations_count = 0;
jstate->highest_extern_param_id = 0;
/* Compute query ID and mark the Query node with it */
if (pgq_JumbleQueryInternal(jstate, query))
{
query->queryId = DatumGetUInt64(hash_any_extended(jstate->jumble,
jstate->jumble_len,
0));
/*
* If we are unlucky enough to get a hash of zero, use 1 instead, to
* prevent confusion with the utility-statement case.
*/
if (query->queryId == UINT64CONST(0))
query->queryId = UINT64CONST(1);
}
else
jstate = NULL;
}
return jstate;
}
static void
pgq_JumbleOid(JumbleState *jstate, pgqKind kind, Oid oid)
{
switch (kind)
{
case pgq_Rel:
if (pgq_use_names)
{
PGQ_APP_JUMB_STRING(get_rel_name(oid));
if (!pgq_ignore_schema)
PGQ_APP_JUMB_STRING(get_namespace_name(get_rel_namespace(oid)));
}
else
PGQ_APP_JUMB(oid);
break;
case pgq_Func:
if (pgq_use_names)
{
PGQ_APP_JUMB_STRING(get_func_name(oid));
if (!pgq_ignore_schema)
PGQ_APP_JUMB_STRING(get_namespace_name(get_func_namespace(oid)));
}
else
PGQ_APP_JUMB(oid);
break;
case pgq_Seq:
if (pgq_use_names)
{
PGQ_APP_JUMB_STRING(get_rel_name(oid));
if (!pgq_ignore_schema)
PGQ_APP_JUMB_STRING(get_namespace_name(get_rel_namespace(oid)));
}
else
PGQ_APP_JUMB(oid);
break;
case pgq_Coll:
if (pgq_use_names && OidIsValid(oid))
{
HeapTuple tp;
char *collname;
Oid collnamespace;
tp = SearchSysCache1(COLLOID, ObjectIdGetDatum(oid));
if (HeapTupleIsValid(tp))
{
Form_pg_collation colltup = (Form_pg_collation) GETSTRUCT(tp);
collname = pstrdup(NameStr(colltup->collname));
collnamespace = colltup->collnamespace;
ReleaseSysCache(tp);
}
else
elog(ERROR, "cache lookup failed for collation %u", oid);
PGQ_APP_JUMB_STRING(collname);
if (!pgq_ignore_schema)
PGQ_APP_JUMB_STRING(get_namespace_name(collnamespace));
}
else
PGQ_APP_JUMB(oid);
break;
case pgq_Typ:
if (pgq_use_names)
{
HeapTuple tp;
char *typname;
Oid typnamespace;
tp = SearchSysCache1(TYPEOID, ObjectIdGetDatum(oid));
if (HeapTupleIsValid(tp))
{
Form_pg_type typtup = (Form_pg_type) GETSTRUCT(tp);
typname = pstrdup(NameStr(typtup->typname));
typnamespace = typtup->typnamespace;
}
elog(ERROR, "cache lookup failed for type %u", oid);
PGQ_APP_JUMB_STRING(typname);
if (!pgq_ignore_schema)
PGQ_APP_JUMB_STRING(get_namespace_name(typnamespace));
}
else
PGQ_APP_JUMB(oid);
break;
default:
elog(ERROR, "pg_queryid: unexpected kind %d", kind);
}
}
/*
* pgq_JumbleQueryInternal: Selectively serialize the query tree, appending
* significant data to the "query jumble" while ignoring nonsignificant data.
*
* Rule of thumb for what to include is that we should ignore anything not
* semantically significant (such as alias names) as well as anything that can
* be deduced from child nodes (else we'd just be double-hashing that piece
* of information).
*/
static bool
pgq_JumbleQueryInternal(JumbleState *jstate, Query *query)
{
Assert(IsA(query, Query));
Assert(query->utilityStmt == NULL);
PGQ_APP_JUMB(query->commandType);
/* resultRelation is usually predictable from commandType */
PGQ_JUMBLE_EXPR(jstate, (Node *) query->cteList);
if (!pgq_JumbleRangeTable(jstate, query->rtable))
return false;
PGQ_JUMBLE_EXPR(jstate, (Node *) query->jointree);
PGQ_JUMBLE_EXPR(jstate, (Node *) query->targetList);
PGQ_JUMBLE_EXPR(jstate, (Node *) query->onConflict);
PGQ_JUMBLE_EXPR(jstate, (Node *) query->returningList);
PGQ_JUMBLE_EXPR(jstate, (Node *) query->groupClause);
PGQ_JUMBLE_EXPR(jstate, (Node *) query->groupingSets);
PGQ_JUMBLE_EXPR(jstate, query->havingQual);
PGQ_JUMBLE_EXPR(jstate, (Node *) query->windowClause);
PGQ_JUMBLE_EXPR(jstate, (Node *) query->distinctClause);
PGQ_JUMBLE_EXPR(jstate, (Node *) query->sortClause);
PGQ_JUMBLE_EXPR(jstate, query->limitOffset);
PGQ_JUMBLE_EXPR(jstate, query->limitCount);
pgq_JumbleRowMarks(jstate, query->rowMarks);
PGQ_JUMBLE_EXPR(jstate, query->setOperations);
return true;
}
/*
* Jumble a range table
*/
static bool
pgq_JumbleRangeTable(JumbleState *jstate, List *rtable)
{
ListCell *lc;
foreach(lc, rtable)
{
RangeTblEntry *rte = lfirst_node(RangeTblEntry, lc);
PGQ_APP_JUMB(rte->rtekind);
switch (rte->rtekind)
{
case RTE_RELATION:
if (pgq_ignore_temp &&
get_rel_persistence(rte->relid) == RELPERSISTENCE_TEMP)
return false;
pgq_JumbleOid(jstate, pgq_Rel, rte->relid);
PGQ_JUMBLE_EXPR(jstate, (Node *) rte->tablesample);
break;
case RTE_SUBQUERY:
if (!pgq_JumbleQueryInternal(jstate, rte->subquery))
return false;
break;
case RTE_JOIN:
PGQ_APP_JUMB(rte->jointype);
break;
case RTE_FUNCTION:
PGQ_JUMBLE_EXPR(jstate, (Node *) rte->functions);
break;
case RTE_TABLEFUNC:
PGQ_JUMBLE_EXPR(jstate, (Node *) rte->tablefunc);
break;
case RTE_VALUES:
PGQ_JUMBLE_EXPR(jstate, (Node *) rte->values_lists);
break;
case RTE_CTE:
/*
* Depending on the CTE name here isn't ideal, but it's the
* only info we have to identify the referenced WITH item.
*/
PGQ_APP_JUMB_STRING(rte->ctename);
PGQ_APP_JUMB(rte->ctelevelsup);
break;
case RTE_NAMEDTUPLESTORE:
PGQ_APP_JUMB_STRING(rte->enrname);
break;
case RTE_RESULT:
break;
default:
elog(ERROR, "unrecognized RTE kind: %d", (int) rte->rtekind);
break;
}
}
return true;
}
/*
* Jumble a rowMarks list
*/
static void
pgq_JumbleRowMarks(JumbleState *jstate, List *rowMarks)
{
ListCell *lc;
foreach(lc, rowMarks)
{
RowMarkClause *rowmark = lfirst_node(RowMarkClause, lc);
if (!rowmark->pushedDown)
{