-
Notifications
You must be signed in to change notification settings - Fork 67
/
Copy pathhooks.c
1127 lines (967 loc) · 32.3 KB
/
hooks.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
/* ------------------------------------------------------------------------
*
* hooks.c
* definitions of rel_pathlist and join_pathlist hooks
*
* Copyright (c) 2016-2020, Postgres Professional
* Portions Copyright (c) 1996-2016, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
* ------------------------------------------------------------------------
*/
#include "compat/pg_compat.h"
#include "compat/rowmarks_fix.h"
#if PG_VERSION_NUM >= 120000
#include "access/table.h"
#endif
#include "declarative.h"
#include "hooks.h"
#include "init.h"
#include "partition_filter.h"
#include "partition_router.h"
#include "pathman_workers.h"
#include "planner_tree_modification.h"
#include "runtime_append.h"
#include "runtime_merge_append.h"
#include "utility_stmt_hooking.h"
#include "utils.h"
#include "xact_handling.h"
#include "access/transam.h"
#include "access/xact.h"
#include "catalog/pg_authid.h"
#include "miscadmin.h"
#include "optimizer/cost.h"
#include "optimizer/prep.h"
#include "optimizer/restrictinfo.h"
#include "rewrite/rewriteManip.h"
#include "utils/typcache.h"
#include "utils/lsyscache.h"
#ifdef USE_ASSERT_CHECKING
#define USE_RELCACHE_LOGGING
#endif
/* Borrowed from joinpath.c */
#define PATH_PARAM_BY_REL(path, rel) \
((path)->param_info && bms_overlap(PATH_REQ_OUTER(path), (rel)->relids))
static inline bool
allow_star_schema_join(PlannerInfo *root,
Path *outer_path,
Path *inner_path)
{
Relids innerparams = PATH_REQ_OUTER(inner_path);
Relids outerrelids = outer_path->parent->relids;
/*
* It's a star-schema case if the outer rel provides some but not all of
* the inner rel's parameterization.
*/
return (bms_overlap(innerparams, outerrelids) &&
bms_nonempty_difference(innerparams, outerrelids));
}
set_join_pathlist_hook_type pathman_set_join_pathlist_next = NULL;
set_rel_pathlist_hook_type pathman_set_rel_pathlist_hook_next = NULL;
planner_hook_type pathman_planner_hook_next = NULL;
post_parse_analyze_hook_type pathman_post_parse_analyze_hook_next = NULL;
shmem_startup_hook_type pathman_shmem_startup_hook_next = NULL;
ProcessUtility_hook_type pathman_process_utility_hook_next = NULL;
/* Take care of joins */
void
pathman_join_pathlist_hook(PlannerInfo *root,
RelOptInfo *joinrel,
RelOptInfo *outerrel,
RelOptInfo *innerrel,
JoinType jointype,
JoinPathExtraData *extra)
{
JoinCostWorkspace workspace;
JoinType saved_jointype = jointype;
RangeTblEntry *inner_rte = root->simple_rte_array[innerrel->relid];
PartRelationInfo *inner_prel;
List *joinclauses,
*otherclauses;
WalkerContext context;
double paramsel;
Node *part_expr;
ListCell *lc;
/* Call hooks set by other extensions */
if (pathman_set_join_pathlist_next)
pathman_set_join_pathlist_next(root, joinrel, outerrel,
innerrel, jointype, extra);
/* Check that both pg_pathman & RuntimeAppend nodes are enabled */
if (!IsPathmanReady() || !pg_pathman_enable_runtimeappend)
return;
/* We should only consider base inner relations */
if (innerrel->reloptkind != RELOPT_BASEREL)
return;
/* We shouldn't process tables with active children */
if (inner_rte->inh)
return;
/* We shouldn't process functions etc */
if (inner_rte->rtekind != RTE_RELATION)
return;
/* We don't support these join types (since inner will be parameterized) */
if (jointype == JOIN_FULL ||
jointype == JOIN_RIGHT ||
jointype == JOIN_UNIQUE_INNER)
return;
/* Skip if inner table is not allowed to act as parent (e.g. FROM ONLY) */
if (PARENTHOOD_DISALLOWED == get_rel_parenthood_status(inner_rte))
return;
/* Proceed iff relation 'innerrel' is partitioned */
if ((inner_prel = get_pathman_relation_info(inner_rte->relid)) == NULL)
return;
/*
* Check if query is:
* 1) UPDATE part_table SET = .. FROM part_table.
* 2) DELETE FROM part_table USING part_table.
*
* Either outerrel or innerrel may be a result relation.
*/
if ((root->parse->resultRelation == outerrel->relid ||
root->parse->resultRelation == innerrel->relid) &&
(root->parse->commandType == CMD_UPDATE ||
root->parse->commandType == CMD_DELETE))
{
int rti = -1,
count = 0;
/* Inner relation must be partitioned */
Assert(inner_prel);
/* Check each base rel of outer relation */
while ((rti = bms_next_member(outerrel->relids, rti)) >= 0)
{
Oid outer_baserel = root->simple_rte_array[rti]->relid;
/* Is it partitioned? */
if (has_pathman_relation_info(outer_baserel))
count++;
}
if (count > 0)
ereport(ERROR,
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
errmsg("DELETE and UPDATE queries with a join "
"of partitioned tables are not supported")));
}
/* Replace virtual join types with a real one */
if (jointype == JOIN_UNIQUE_OUTER || jointype == JOIN_UNIQUE_INNER)
jointype = JOIN_INNER;
/* Extract join clauses which will separate partitions */
if (IS_OUTER_JOIN(extra->sjinfo->jointype))
{
extract_actual_join_clauses_compat(extra->restrictlist,
joinrel->relids,
&joinclauses,
&otherclauses);
}
else
{
/* We can treat all clauses alike for an inner join */
joinclauses = extract_actual_clauses(extra->restrictlist, false);
otherclauses = NIL;
}
/* Make copy of partitioning expression and fix Var's varno attributes */
part_expr = PrelExpressionForRelid(inner_prel, innerrel->relid);
paramsel = 1.0;
foreach (lc, joinclauses)
{
WrapperNode *wrap;
InitWalkerContext(&context, part_expr, inner_prel, NULL);
wrap = walk_expr_tree((Expr *) lfirst(lc), &context);
paramsel *= wrap->paramsel;
}
foreach (lc, innerrel->pathlist)
{
AppendPath *cur_inner_path = (AppendPath *) lfirst(lc);
Path *outer,
*inner;
NestPath *nest_path; /* NestLoop we're creating */
ParamPathInfo *ppi; /* parameterization info */
Relids required_nestloop,
required_inner;
List *filtered_joinclauses = NIL,
*saved_ppi_list,
*pathkeys;
ListCell *rinfo_lc;
if (!IsA(cur_inner_path, AppendPath))
continue;
/* Select cheapest path for outerrel */
outer = outerrel->cheapest_total_path;
/* We cannot use an outer path that is parameterized by the inner rel */
if (PATH_PARAM_BY_REL(outer, innerrel))
continue;
/* Wrap 'outer' in unique path if needed */
if (saved_jointype == JOIN_UNIQUE_OUTER)
{
outer = (Path *) create_unique_path(root, outerrel,
outer, extra->sjinfo);
Assert(outer);
}
/* Make inner path depend on outerrel's columns */
required_inner = bms_union(PATH_REQ_OUTER((Path *) cur_inner_path),
outerrel->relids);
/* Preserve existing ppis built by get_appendrel_parampathinfo() */
saved_ppi_list = innerrel->ppilist;
/* Get the ParamPathInfo for a parameterized path */
innerrel->ppilist = NIL;
ppi = get_baserel_parampathinfo(root, innerrel, required_inner);
innerrel->ppilist = saved_ppi_list;
/* Skip ppi->ppi_clauses don't reference partition attribute */
if (!(ppi && get_partitioning_clauses(ppi->ppi_clauses,
inner_prel,
innerrel->relid)))
continue;
/* Try building RuntimeAppend path, skip if it's not possible */
inner = create_runtime_append_path(root, cur_inner_path, ppi, paramsel);
if (!inner)
continue;
required_nestloop = calc_nestloop_required_outer_compat(outer, inner);
/*
* Check to see if proposed path is still parameterized, and reject if the
* parameterization wouldn't be sensible --- unless allow_star_schema_join
* says to allow it anyway. Also, we must reject if have_dangerous_phv
* doesn't like the look of it, which could only happen if the nestloop is
* still parameterized.
*/
if (required_nestloop &&
((!bms_overlap(required_nestloop, extra->param_source_rels) &&
!allow_star_schema_join(root, outer, inner)) ||
have_dangerous_phv(root, outer->parent->relids, required_inner)))
continue;
initial_cost_nestloop_compat(root, &workspace, jointype, outer, inner, extra);
pathkeys = build_join_pathkeys(root, joinrel, jointype, outer->pathkeys);
/* Discard all clauses that are to be evaluated by 'inner' */
foreach (rinfo_lc, extra->restrictlist)
{
RestrictInfo *rinfo = (RestrictInfo *) lfirst(rinfo_lc);
Assert(IsA(rinfo, RestrictInfo));
if (!join_clause_is_movable_to(rinfo, inner->parent))
filtered_joinclauses = lappend(filtered_joinclauses, rinfo);
}
nest_path =
create_nestloop_path_compat(root, joinrel, jointype,
&workspace, extra, outer, inner,
filtered_joinclauses, pathkeys,
calc_nestloop_required_outer_compat(outer, inner));
/*
* NOTE: Override 'rows' value produced by standard estimator.
* Currently we use get_parameterized_joinrel_size() since
* it works just fine, but this might change some day.
*/
#if PG_VERSION_NUM >= 150000 /* reason: commit 18fea737b5e4 */
nest_path->jpath.path.rows =
#else
nest_path->path.rows =
#endif
get_parameterized_joinrel_size_compat(root, joinrel,
outer, inner,
extra->sjinfo,
filtered_joinclauses);
/* Finally we can add the new NestLoop path */
add_path(joinrel, (Path *) nest_path);
}
/* Don't forget to close 'inner_prel'! */
close_pathman_relation_info(inner_prel);
}
/* Cope with simple relations */
void
pathman_rel_pathlist_hook(PlannerInfo *root,
RelOptInfo *rel,
Index rti,
RangeTblEntry *rte)
{
PartRelationInfo *prel;
Relation parent_rel; /* parent's relation (heap) */
PlanRowMark *parent_rowmark; /* parent's rowmark */
Oid *children; /* selected children oids */
List *ranges, /* a list of IndexRanges */
*wrappers; /* a list of WrapperNodes */
PathKey *pathkeyAsc = NULL,
*pathkeyDesc = NULL;
double paramsel = 1.0; /* default part selectivity */
WalkerContext context;
Node *part_expr;
List *part_clauses;
ListCell *lc;
int irange_len,
i;
/* Invoke original hook if needed */
if (pathman_set_rel_pathlist_hook_next)
pathman_set_rel_pathlist_hook_next(root, rel, rti, rte);
/* Make sure that pg_pathman is ready */
if (!IsPathmanReady())
return;
/* We shouldn't process tables with active children */
if (rte->inh)
return;
/*
* Skip if it's a result relation (UPDATE | DELETE | INSERT),
* or not a (partitioned) physical relation at all.
*/
if (rte->rtekind != RTE_RELATION ||
rte->relkind != RELKIND_RELATION ||
root->parse->resultRelation == rti)
return;
#ifdef LEGACY_ROWMARKS_95
/* It's better to exit, since RowMarks might be broken */
if (root->parse->commandType != CMD_SELECT &&
root->parse->commandType != CMD_INSERT)
return;
/* SELECT FOR SHARE/UPDATE is not handled by above check */
foreach(lc, root->rowMarks)
{
PlanRowMark *rc = (PlanRowMark *) lfirst(lc);
if (rc->rti == rti)
return;
}
#endif
/* Skip if this table is not allowed to act as parent (e.g. FROM ONLY) */
if (PARENTHOOD_DISALLOWED == get_rel_parenthood_status(rte))
return;
/* Proceed iff relation 'rel' is partitioned */
if ((prel = get_pathman_relation_info(rte->relid)) == NULL)
return;
/*
* Check that this child is not the parent table itself.
* This is exactly how standard inheritance works.
*
* Helps with queries like this one:
*
* UPDATE test.tmp t SET value = 2
* WHERE t.id IN (SELECT id
* FROM test.tmp2 t2
* WHERE id = t.id);
*
* or unions, multilevel partitioning, etc.
*
* Since we disable optimizations on 9.5, we
* have to skip parent table that has already
* been expanded by standard inheritance.
*/
if (rel->reloptkind == RELOPT_OTHER_MEMBER_REL)
{
foreach (lc, root->append_rel_list)
{
AppendRelInfo *appinfo = (AppendRelInfo *) lfirst(lc);
Oid child_oid,
parent_oid;
/* Is it actually the same table? */
child_oid = root->simple_rte_array[appinfo->child_relid]->relid;
parent_oid = root->simple_rte_array[appinfo->parent_relid]->relid;
/*
* If there's an 'appinfo', it means that somebody
* (PG?) has already processed this partitioned table
* and added its children to the plan.
*/
if (appinfo->child_relid == rti &&
OidIsValid(appinfo->parent_reloid))
{
if (child_oid == parent_oid)
goto cleanup;
else if (!has_pathman_relation_info(parent_oid))
ereport(ERROR,
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
errmsg("could not expand partitioned table \"%s\"",
get_rel_name(child_oid)),
errhint("Do not use inheritance and pg_pathman partitions together")));
}
}
}
/* Make copy of partitioning expression and fix Var's varno attributes */
part_expr = PrelExpressionForRelid(prel, rti);
/* Get partitioning-related clauses (do this before append_child_relation()) */
part_clauses = get_partitioning_clauses(rel->baserestrictinfo, prel, rti);
if (prel->parttype == PT_RANGE)
{
/*
* Get pathkeys for ascending and descending sort by partitioned column.
*/
List *pathkeys;
TypeCacheEntry *tce;
/* Determine operator type */
tce = lookup_type_cache(prel->ev_type, TYPECACHE_LT_OPR | TYPECACHE_GT_OPR);
/* Make pathkeys */
pathkeys = build_expression_pathkey(root, (Expr *) part_expr, NULL,
tce->lt_opr, NULL, false);
if (pathkeys)
pathkeyAsc = (PathKey *) linitial(pathkeys);
pathkeys = build_expression_pathkey(root, (Expr *) part_expr, NULL,
tce->gt_opr, NULL, false);
if (pathkeys)
pathkeyDesc = (PathKey *) linitial(pathkeys);
}
children = PrelGetChildrenArray(prel);
ranges = list_make1_irange_full(prel, IR_COMPLETE);
/* Make wrappers over restrictions and collect final rangeset */
InitWalkerContext(&context, part_expr, prel, NULL);
wrappers = NIL;
foreach(lc, rel->baserestrictinfo)
{
WrapperNode *wrap;
RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
wrap = walk_expr_tree(rinfo->clause, &context);
paramsel *= wrap->paramsel;
wrappers = lappend(wrappers, wrap);
ranges = irange_list_intersection(ranges, wrap->rangeset);
}
/* Get number of selected partitions */
irange_len = irange_list_length(ranges);
if (prel->enable_parent)
irange_len++; /* also add parent */
/* Expand simple_rte_array and simple_rel_array */
if (irange_len > 0)
{
int current_len = root->simple_rel_array_size,
new_len = current_len + irange_len;
/* Expand simple_rel_array */
root->simple_rel_array = (RelOptInfo **)
repalloc(root->simple_rel_array,
new_len * sizeof(RelOptInfo *));
memset((void *) &root->simple_rel_array[current_len], 0,
irange_len * sizeof(RelOptInfo *));
/* Expand simple_rte_array */
root->simple_rte_array = (RangeTblEntry **)
repalloc(root->simple_rte_array,
new_len * sizeof(RangeTblEntry *));
memset((void *) &root->simple_rte_array[current_len], 0,
irange_len * sizeof(RangeTblEntry *));
#if PG_VERSION_NUM >= 110000
/*
* Make sure append_rel_array is wide enough; if it hasn't been
* allocated previously, care to zero out [0; current_len) part.
*/
if (root->append_rel_array == NULL)
root->append_rel_array = (AppendRelInfo **)
palloc0(current_len * sizeof(AppendRelInfo *));
root->append_rel_array = (AppendRelInfo **)
repalloc(root->append_rel_array,
new_len * sizeof(AppendRelInfo *));
memset((void *) &root->append_rel_array[current_len], 0,
irange_len * sizeof(AppendRelInfo *));
#endif
/* Don't forget to update array size! */
root->simple_rel_array_size = new_len;
}
/* Parent has already been locked by rewriter */
parent_rel = heap_open_compat(rte->relid, NoLock);
parent_rowmark = get_plan_rowmark(root->rowMarks, rti);
/* Add parent if asked to */
if (prel->enable_parent)
append_child_relation(root, parent_rel, parent_rowmark,
rti, 0, rte->relid, NULL);
/* Iterate all indexes in rangeset and append child relations */
foreach(lc, ranges)
{
IndexRange irange = lfirst_irange(lc);
for (i = irange_lower(irange); i <= irange_upper(irange); i++)
append_child_relation(root, parent_rel, parent_rowmark,
rti, i, children[i], wrappers);
}
/* Now close parent relation */
heap_close_compat(parent_rel, NoLock);
/* Clear path list and make it point to NIL */
list_free_deep(rel->pathlist);
rel->pathlist = NIL;
#if PG_VERSION_NUM >= 90600
/* Clear old partial path list */
list_free(rel->partial_pathlist);
rel->partial_pathlist = NIL;
#endif
/* Generate new paths using the rels we've just added */
set_append_rel_pathlist(root, rel, rti, pathkeyAsc, pathkeyDesc);
set_append_rel_size_compat(root, rel, rti);
/* consider gathering partial paths for the parent appendrel */
generate_gather_paths_compat(root, rel);
/* Skip if both custom nodes are disabled */
if (!(pg_pathman_enable_runtimeappend ||
pg_pathman_enable_runtime_merge_append))
goto cleanup;
/* Skip if there's no PARAMs in partitioning-related clauses */
if (!clause_contains_params((Node *) part_clauses))
goto cleanup;
/* Generate Runtime[Merge]Append paths if needed */
foreach (lc, rel->pathlist)
{
AppendPath *cur_path = (AppendPath *) lfirst(lc);
Relids inner_required = PATH_REQ_OUTER((Path *) cur_path);
Path *inner_path = NULL;
ParamPathInfo *ppi;
/* Skip if rel contains some join-related stuff or path type mismatched */
if (!(IsA(cur_path, AppendPath) || IsA(cur_path, MergeAppendPath)) ||
rel->has_eclass_joins || rel->joininfo)
{
continue;
}
/* Get existing parameterization */
ppi = get_appendrel_parampathinfo(rel, inner_required);
if (IsA(cur_path, AppendPath) && pg_pathman_enable_runtimeappend)
inner_path = create_runtime_append_path(root, cur_path,
ppi, paramsel);
else if (IsA(cur_path, MergeAppendPath) &&
pg_pathman_enable_runtime_merge_append)
{
/* Check struct layout compatibility */
if (offsetof(AppendPath, subpaths) !=
offsetof(MergeAppendPath, subpaths))
elog(FATAL, "Struct layouts of AppendPath and "
"MergeAppendPath differ");
inner_path = create_runtime_merge_append_path(root, cur_path,
ppi, paramsel);
}
if (inner_path)
add_path(rel, inner_path);
}
cleanup:
/* Don't forget to close 'prel'! */
close_pathman_relation_info(prel);
}
/*
* Intercept 'pg_pathman.enable' GUC assignments.
*/
void
pathman_enable_assign_hook(bool newval, void *extra)
{
elog(DEBUG2, "pg_pathman_enable_assign_hook() [newval = %s] triggered",
newval ? "true" : "false");
if (!(newval == pathman_init_state.pg_pathman_enable &&
newval == pathman_init_state.auto_partition &&
newval == pathman_init_state.override_copy &&
newval == pg_pathman_enable_runtimeappend &&
newval == pg_pathman_enable_runtime_merge_append &&
newval == pg_pathman_enable_partition_filter &&
newval == pg_pathman_enable_bounds_cache))
{
elog(NOTICE,
"RuntimeAppend, RuntimeMergeAppend and PartitionFilter nodes "
"and some other options have been %s",
newval ? "enabled" : "disabled");
}
pathman_init_state.auto_partition = newval;
pathman_init_state.override_copy = newval;
pg_pathman_enable_runtimeappend = newval;
pg_pathman_enable_runtime_merge_append = newval;
pg_pathman_enable_partition_filter = newval;
pg_pathman_enable_bounds_cache = newval;
/* Purge caches if pathman was disabled */
if (!newval)
{
unload_config();
}
}
static void
execute_for_plantree(PlannedStmt *planned_stmt,
Plan *(*proc) (List *rtable, Plan *plan))
{
List *subplans = NIL;
ListCell *lc;
Plan *resplan = proc(planned_stmt->rtable, planned_stmt->planTree);
if (resplan)
planned_stmt->planTree = resplan;
foreach (lc, planned_stmt->subplans)
{
Plan *subplan = lfirst(lc);
resplan = proc(planned_stmt->rtable, (Plan *) lfirst(lc));
if (resplan)
subplans = lappend(subplans, resplan);
else
subplans = lappend(subplans, subplan);
}
planned_stmt->subplans = subplans;
}
/*
* Planner hook. It disables inheritance for tables that have been partitioned
* by pathman to prevent standart PostgreSQL partitioning mechanism from
* handling those tables.
*
* Since >= 13 (6aba63ef3e6) query_string parameter was added.
*/
PlannedStmt *
#if PG_VERSION_NUM >= 130000
pathman_planner_hook(Query *parse, const char *query_string, int cursorOptions, ParamListInfo boundParams)
#else
pathman_planner_hook(Query *parse, int cursorOptions, ParamListInfo boundParams)
#endif
{
PlannedStmt *result;
uint32 query_id = parse->queryId;
/* Save the result in case it changes */
bool pathman_ready = IsPathmanReady();
PG_TRY();
{
if (pathman_ready)
{
/* Increase planner() calls count */
incr_planner_calls_count();
/* Modify query tree if needed */
pathman_transform_query(parse, boundParams);
}
/* Invoke original hook if needed */
if (pathman_planner_hook_next)
#if PG_VERSION_NUM >= 130000
result = pathman_planner_hook_next(parse, query_string, cursorOptions, boundParams);
#else
result = pathman_planner_hook_next(parse, cursorOptions, boundParams);
#endif
else
#if PG_VERSION_NUM >= 130000
result = standard_planner(parse, query_string, cursorOptions, boundParams);
#else
result = standard_planner(parse, cursorOptions, boundParams);
#endif
if (pathman_ready)
{
/* Add PartitionFilter node for INSERT queries */
execute_for_plantree(result, add_partition_filters);
/* Add PartitionRouter node for UPDATE queries */
execute_for_plantree(result, add_partition_routers);
/* Decrement planner() calls count */
decr_planner_calls_count();
/* HACK: restore queryId set by pg_stat_statements */
result->queryId = query_id;
}
}
/* We must decrease parenthood statuses refcount on ERROR */
PG_CATCH();
{
if (pathman_ready)
{
/* Caught an ERROR, decrease count */
decr_planner_calls_count();
}
/* Rethrow ERROR further */
PG_RE_THROW();
}
PG_END_TRY();
/* Finally return the Plan */
return result;
}
/*
* Post parse analysis hook. It makes sure the config is loaded before executing
* any statement, including utility commands.
*/
#if PG_VERSION_NUM >= 140000
/*
* pathman_post_parse_analyze_hook(), pathman_post_parse_analyze_hook_next():
* in 14 new argument was added (5fd9dfa5f50)
*/
void
pathman_post_parse_analyze_hook(ParseState *pstate, Query *query, JumbleState *jstate)
{
/* Invoke original hook if needed */
if (pathman_post_parse_analyze_hook_next)
pathman_post_parse_analyze_hook_next(pstate, query, jstate);
#else
void
pathman_post_parse_analyze_hook(ParseState *pstate, Query *query)
{
/* Invoke original hook if needed */
if (pathman_post_parse_analyze_hook_next)
pathman_post_parse_analyze_hook_next(pstate, query);
#endif
/* See cook_partitioning_expression() */
if (!pathman_hooks_enabled)
return;
/* We shouldn't proceed on: ... */
if (query->commandType == CMD_UTILITY)
{
/* ... BEGIN */
if (xact_is_transaction_stmt(query->utilityStmt))
return;
/* ... SET pg_pathman.enable */
if (xact_is_set_stmt(query->utilityStmt, PATHMAN_ENABLE))
{
/* Accept all events in case it's "enable = OFF" */
if (IsPathmanReady())
finish_delayed_invalidation();
return;
}
/* ... SET [TRANSACTION] */
if (xact_is_set_stmt(query->utilityStmt, NULL))
return;
/* ... ALTER EXTENSION pg_pathman */
if (xact_is_alter_pathman_stmt(query->utilityStmt))
{
/* Leave no delayed events before ALTER EXTENSION */
if (IsPathmanReady())
finish_delayed_invalidation();
/* Disable pg_pathman to perform a painless update */
(void) set_config_option(PATHMAN_ENABLE, "off",
PGC_SUSET, PGC_S_SESSION,
GUC_ACTION_SAVE, true, 0, false);
return;
}
}
/* Finish all delayed invalidation jobs */
if (IsPathmanReady())
finish_delayed_invalidation();
/* Load config if pg_pathman exists & it's still necessary */
if (IsPathmanEnabled() &&
!IsPathmanInitialized() &&
/* Now evaluate the most expensive clause */
get_pathman_schema() != InvalidOid)
{
load_config(); /* perform main cache initialization */
}
if (!IsPathmanReady())
return;
/* Process inlined SQL functions (we've already entered planning stage) */
if (IsPathmanReady() && get_planner_calls_count() > 0)
{
/* Check that pg_pathman is the last extension loaded */
if (post_parse_analyze_hook != pathman_post_parse_analyze_hook)
{
Oid save_userid;
int save_sec_context;
bool need_priv_escalation = !superuser(); /* we might be a SU */
char *spl_value; /* value of "shared_preload_libraries" GUC */
/* Do we have to escalate privileges? */
if (need_priv_escalation)
{
/* Get current user's Oid and security context */
GetUserIdAndSecContext(&save_userid, &save_sec_context);
/* Become superuser in order to bypass sequence ACL checks */
SetUserIdAndSecContext(BOOTSTRAP_SUPERUSERID,
save_sec_context | SECURITY_LOCAL_USERID_CHANGE);
}
/* TODO: add a test for this case (non-privileged user etc) */
/* Only SU can read this GUC */
#if PG_VERSION_NUM >= 90600
spl_value = GetConfigOptionByName("shared_preload_libraries", NULL, false);
#else
spl_value = GetConfigOptionByName("shared_preload_libraries", NULL);
#endif
/* Restore user's privileges */
if (need_priv_escalation)
SetUserIdAndSecContext(save_userid, save_sec_context);
ereport(ERROR,
(errmsg("extension conflict has been detected"),
errdetail("shared_preload_libraries = \"%s\"", spl_value),
errhint("pg_pathman should be the last extension listed in "
"\"shared_preload_libraries\" GUC in order to "
"prevent possible conflicts with other extensions")));
}
/* Modify query tree if needed */
pathman_transform_query(query, NULL);
return;
}
#if PG_VERSION_NUM >= 100000
/*
* for now this call works only for declarative partitioning so
* we disabled it
*/
pathman_post_analyze_query(query);
#endif
}
/*
* Initialize dsm_config & shmem_config.
*/
void
pathman_shmem_startup_hook(void)
{
/* Invoke original hook if needed */
if (pathman_shmem_startup_hook_next)
pathman_shmem_startup_hook_next();
/* Allocate shared memory objects */
LWLockAcquire(AddinShmemInitLock, LW_EXCLUSIVE);
init_concurrent_part_task_slots();
LWLockRelease(AddinShmemInitLock);
}
/*
* Invalidate PartRelationInfo cache entry if needed.
*/
void
pathman_relcache_hook(Datum arg, Oid relid)
{
Oid pathman_config_relid;
/* See cook_partitioning_expression() */
if (!pathman_hooks_enabled)
return;
if (!IsPathmanReady())
return;
/* Invalidation event for whole cache */
if (relid == InvalidOid)
{
invalidate_bounds_cache();
invalidate_parents_cache();
invalidate_status_cache();
delay_pathman_shutdown(); /* see below */
}
/*
* Invalidation event for PATHMAN_CONFIG table (probably DROP EXTENSION).
* Digging catalogs here is expensive and probably illegal, so we take
* cached relid. It is possible that we don't know it atm (e.g. pathman
* was disabled). However, in this case caches must have been cleaned
* on disable, and there is no DROP-specific additional actions.
*/
pathman_config_relid = get_pathman_config_relid(true);
if (relid == pathman_config_relid)
{
delay_pathman_shutdown();
}
/* Invalidation event for some user table */
else if (relid >= FirstNormalObjectId)
{
/* Invalidate PartBoundInfo entry if needed */
forget_bounds_of_rel(relid);
/* Invalidate PartStatusInfo entry if needed */
forget_status_of_relation(relid);
/* Invalidate PartParentInfo entry if needed */
forget_parent_of_partition(relid);
}
}
/*
* Utility function invoker hook.
* NOTE: 'first_arg' is (PlannedStmt *) in PG 10, or (Node *) in PG <= 9.6.
* In PG 13 (2f9661311b8) command completion tags was reworked (added QueryCompletion struct)
*/
void
#if PG_VERSION_NUM >= 140000
/*
* pathman_post_parse_analyze_hook(), pathman_post_parse_analyze_hook_next():
* in 14 new argument was added (5fd9dfa5f50)
*/
pathman_process_utility_hook(PlannedStmt *first_arg,
const char *queryString,
bool readOnlyTree,
ProcessUtilityContext context,
ParamListInfo params,
QueryEnvironment *queryEnv,
DestReceiver *dest, QueryCompletion *queryCompletion)
{
Node *parsetree = first_arg->utilityStmt;
int stmt_location = first_arg->stmt_location,
stmt_len = first_arg->stmt_len;
#elif PG_VERSION_NUM >= 130000
pathman_process_utility_hook(PlannedStmt *first_arg,
const char *queryString,
ProcessUtilityContext context,
ParamListInfo params,
QueryEnvironment *queryEnv,
DestReceiver *dest, QueryCompletion *queryCompletion)
{
Node *parsetree = first_arg->utilityStmt;
int stmt_location = first_arg->stmt_location,
stmt_len = first_arg->stmt_len;
#elif PG_VERSION_NUM >= 100000
pathman_process_utility_hook(PlannedStmt *first_arg,
const char *queryString,
ProcessUtilityContext context,
ParamListInfo params,
QueryEnvironment *queryEnv,
DestReceiver *dest, char *completionTag)
{
Node *parsetree = first_arg->utilityStmt;
int stmt_location = first_arg->stmt_location,