1 /*-------------------------------------------------------------------------
4 * hinting on how to execute a query for PostgreSQL
6 * Copyright (c) 2012-2017, NIPPON TELEGRAPH AND TELEPHONE CORPORATION
8 *-------------------------------------------------------------------------
13 #include "catalog/pg_collation.h"
14 #include "catalog/pg_index.h"
15 #include "commands/prepare.h"
16 #include "mb/pg_wchar.h"
17 #include "miscadmin.h"
18 #include "nodes/nodeFuncs.h"
19 #include "optimizer/clauses.h"
20 #include "optimizer/cost.h"
21 #include "optimizer/geqo.h"
22 #include "optimizer/joininfo.h"
23 #include "optimizer/pathnode.h"
24 #include "optimizer/paths.h"
25 #include "optimizer/plancat.h"
26 #include "optimizer/planner.h"
27 #include "optimizer/prep.h"
28 #include "optimizer/restrictinfo.h"
29 #include "parser/scansup.h"
30 #include "tcop/utility.h"
31 #include "utils/builtins.h"
32 #include "utils/lsyscache.h"
33 #include "utils/memutils.h"
34 #include "utils/rel.h"
35 #include "utils/syscache.h"
36 #include "utils/resowner.h"
38 #include "catalog/pg_class.h"
40 #include "executor/spi.h"
41 #include "catalog/pg_type.h"
45 /* partially copied from pg_stat_statements */
46 #include "normalize_query.h"
49 #include "access/htup_details.h"
51 #ifdef PG_MODULE_MAGIC
55 #define BLOCK_COMMENT_START "/*"
56 #define BLOCK_COMMENT_END "*/"
57 #define HINT_COMMENT_KEYWORD "+"
58 #define HINT_START BLOCK_COMMENT_START HINT_COMMENT_KEYWORD
59 #define HINT_END BLOCK_COMMENT_END
62 #define HINT_SEQSCAN "SeqScan"
63 #define HINT_INDEXSCAN "IndexScan"
64 #define HINT_INDEXSCANREGEXP "IndexScanRegexp"
65 #define HINT_BITMAPSCAN "BitmapScan"
66 #define HINT_BITMAPSCANREGEXP "BitmapScanRegexp"
67 #define HINT_TIDSCAN "TidScan"
68 #define HINT_NOSEQSCAN "NoSeqScan"
69 #define HINT_NOINDEXSCAN "NoIndexScan"
70 #define HINT_NOBITMAPSCAN "NoBitmapScan"
71 #define HINT_NOTIDSCAN "NoTidScan"
72 #define HINT_INDEXONLYSCAN "IndexOnlyScan"
73 #define HINT_INDEXONLYSCANREGEXP "IndexOnlyScanRegexp"
74 #define HINT_NOINDEXONLYSCAN "NoIndexOnlyScan"
75 #define HINT_PARALLEL "Parallel"
77 #define HINT_NESTLOOP "NestLoop"
78 #define HINT_MERGEJOIN "MergeJoin"
79 #define HINT_HASHJOIN "HashJoin"
80 #define HINT_NONESTLOOP "NoNestLoop"
81 #define HINT_NOMERGEJOIN "NoMergeJoin"
82 #define HINT_NOHASHJOIN "NoHashJoin"
83 #define HINT_LEADING "Leading"
84 #define HINT_SET "Set"
85 #define HINT_ROWS "Rows"
87 #define HINT_ARRAY_DEFAULT_INITSIZE 8
89 #define hint_ereport(str, detail) \
90 ereport(pg_hint_plan_message_level, \
91 (errhidestmt(hidestmt), \
92 errmsg("pg_hint_plan%s: hint syntax error at or near \"%s\"", qnostr, (str)), \
95 #define skip_space(str) \
96 while (isspace(*str)) \
101 ENABLE_SEQSCAN = 0x01,
102 ENABLE_INDEXSCAN = 0x02,
103 ENABLE_BITMAPSCAN = 0x04,
104 ENABLE_TIDSCAN = 0x08,
105 ENABLE_INDEXONLYSCAN = 0x10
110 ENABLE_NESTLOOP = 0x01,
111 ENABLE_MERGEJOIN = 0x02,
112 ENABLE_HASHJOIN = 0x04
115 #define ENABLE_ALL_SCAN (ENABLE_SEQSCAN | ENABLE_INDEXSCAN | \
116 ENABLE_BITMAPSCAN | ENABLE_TIDSCAN | \
117 ENABLE_INDEXONLYSCAN)
118 #define ENABLE_ALL_JOIN (ENABLE_NESTLOOP | ENABLE_MERGEJOIN | ENABLE_HASHJOIN)
119 #define DISABLE_ALL_SCAN 0
120 #define DISABLE_ALL_JOIN 0
122 /* hint keyword of enum type*/
123 typedef enum HintKeyword
125 HINT_KEYWORD_SEQSCAN,
126 HINT_KEYWORD_INDEXSCAN,
127 HINT_KEYWORD_INDEXSCANREGEXP,
128 HINT_KEYWORD_BITMAPSCAN,
129 HINT_KEYWORD_BITMAPSCANREGEXP,
130 HINT_KEYWORD_TIDSCAN,
131 HINT_KEYWORD_NOSEQSCAN,
132 HINT_KEYWORD_NOINDEXSCAN,
133 HINT_KEYWORD_NOBITMAPSCAN,
134 HINT_KEYWORD_NOTIDSCAN,
135 HINT_KEYWORD_INDEXONLYSCAN,
136 HINT_KEYWORD_INDEXONLYSCANREGEXP,
137 HINT_KEYWORD_NOINDEXONLYSCAN,
139 HINT_KEYWORD_NESTLOOP,
140 HINT_KEYWORD_MERGEJOIN,
141 HINT_KEYWORD_HASHJOIN,
142 HINT_KEYWORD_NONESTLOOP,
143 HINT_KEYWORD_NOMERGEJOIN,
144 HINT_KEYWORD_NOHASHJOIN,
146 HINT_KEYWORD_LEADING,
149 HINT_KEYWORD_PARALLEL,
151 HINT_KEYWORD_UNRECOGNIZED
154 #define SCAN_HINT_ACCEPTS_INDEX_NAMES(kw) \
155 (kw == HINT_KEYWORD_INDEXSCAN || \
156 kw == HINT_KEYWORD_INDEXSCANREGEXP || \
157 kw == HINT_KEYWORD_INDEXONLYSCAN || \
158 kw == HINT_KEYWORD_INDEXONLYSCANREGEXP || \
159 kw == HINT_KEYWORD_BITMAPSCAN || \
160 kw == HINT_KEYWORD_BITMAPSCANREGEXP)
163 typedef struct Hint Hint;
164 typedef struct HintState HintState;
166 typedef Hint *(*HintCreateFunction) (const char *hint_str,
168 HintKeyword hint_keyword);
169 typedef void (*HintDeleteFunction) (Hint *hint);
170 typedef void (*HintDescFunction) (Hint *hint, StringInfo buf, bool nolf);
171 typedef int (*HintCmpFunction) (const Hint *a, const Hint *b);
172 typedef const char *(*HintParseFunction) (Hint *hint, HintState *hstate,
173 Query *parse, const char *str);
176 #define NUM_HINT_TYPE 6
177 typedef enum HintType
179 HINT_TYPE_SCAN_METHOD,
180 HINT_TYPE_JOIN_METHOD,
187 static const char *HintTypeName[] = {
197 typedef enum HintStatus
199 HINT_STATE_NOTUSED = 0, /* specified relation not used in query */
200 HINT_STATE_USED, /* hint is used */
201 HINT_STATE_DUPLICATION, /* specified hint duplication */
202 HINT_STATE_ERROR /* execute error (parse error does not include
206 #define hint_state_enabled(hint) ((hint)->base.state == HINT_STATE_NOTUSED || \
207 (hint)->base.state == HINT_STATE_USED)
209 static unsigned int qno = 0;
210 static char qnostr[32];
212 /* common data for all hints. */
215 const char *hint_str; /* must not do pfree */
216 const char *keyword; /* must not do pfree */
217 HintKeyword hint_keyword;
220 HintDeleteFunction delete_func;
221 HintDescFunction desc_func;
222 HintCmpFunction cmp_func;
223 HintParseFunction parse_func;
226 /* scan method hints */
227 typedef struct ScanMethodHint
233 unsigned char enforce_mask;
236 typedef struct ParentIndexInfo
241 char *expression_str;
248 /* join method hints */
249 typedef struct JoinMethodHint
255 unsigned char enforce_mask;
257 Relids inner_joinrelids;
260 /* join order hints */
261 typedef struct OuterInnerRels
264 List *outer_inner_pair;
267 typedef struct LeadingHint
270 List *relations; /* relation names specified in Leading hint */
271 OuterInnerRels *outer_inner;
274 /* change a run-time parameter hints */
275 typedef struct SetHint
278 char *name; /* name of variable */
284 typedef enum RowsValueType {
285 RVT_ABSOLUTE, /* Rows(... #1000) */
286 RVT_ADD, /* Rows(... +1000) */
287 RVT_SUB, /* Rows(... -1000) */
288 RVT_MULTI, /* Rows(... *1.2) */
290 typedef struct RowsHint
297 Relids inner_joinrelids;
299 RowsValueType value_type;
304 typedef struct ParallelHint
308 char *nworkers_str; /* original string of nworkers */
309 int nworkers; /* num of workers specified by Worker */
310 bool force_parallel; /* force parallel scan */
314 * Describes a context of hint processing.
318 char *hint_str; /* original hint string */
321 int nall_hints; /* # of valid all hints */
322 int max_all_hints; /* # of slots for all hints */
323 Hint **all_hints; /* parsed all hints */
325 /* # of each hints */
326 int num_hints[NUM_HINT_TYPE];
328 /* for scan method hints */
329 ScanMethodHint **scan_hints; /* parsed scan hints */
331 /* Initial values of parameters */
332 int init_scan_mask; /* enable_* mask */
333 int init_nworkers; /* max_parallel_workers_per_gather */
334 int init_min_para_size; /* min_parallel_relation_size*/
335 int init_paratup_cost; /* parallel_tuple_cost */
336 int init_parasetup_cost;/* parallel_setup_cost */
338 Index parent_relid; /* inherit parent of table relid */
339 ScanMethodHint *parent_scan_hint; /* scan hint for the parent */
340 ParallelHint *parent_parallel_hint; /* parallel hint for the parent */
341 List *parent_index_infos; /* list of parent table's index */
343 JoinMethodHint **join_hints; /* parsed join hints */
344 int init_join_mask; /* initial value join parameter */
345 List **join_hint_level;
346 LeadingHint **leading_hint; /* parsed Leading hints */
347 SetHint **set_hints; /* parsed Set hints */
348 GucContext context; /* which GUC parameters can we set? */
349 RowsHint **rows_hints; /* parsed Rows hints */
350 ParallelHint **parallel_hints; /* parsed Parallel hints */
354 * Describes a hint parser module which is bound with particular hint keyword.
356 typedef struct HintParser
359 HintCreateFunction create_func;
360 HintKeyword hint_keyword;
363 /* Module callbacks */
367 static void push_hint(HintState *hstate);
368 static void pop_hint(void);
370 static void pg_hint_plan_ProcessUtility(Node *parsetree,
371 const char *queryString,
372 ProcessUtilityContext context,
373 ParamListInfo params,
374 DestReceiver *dest, char *completionTag);
375 static PlannedStmt *pg_hint_plan_planner(Query *parse, int cursorOptions,
376 ParamListInfo boundParams);
377 static void pg_hint_plan_get_relation_info(PlannerInfo *root,
378 Oid relationObjectId,
379 bool inhparent, RelOptInfo *rel);
380 static RelOptInfo *pg_hint_plan_join_search(PlannerInfo *root,
384 /* Scan method hint callbacks */
385 static Hint *ScanMethodHintCreate(const char *hint_str, const char *keyword,
386 HintKeyword hint_keyword);
387 static void ScanMethodHintDelete(ScanMethodHint *hint);
388 static void ScanMethodHintDesc(ScanMethodHint *hint, StringInfo buf, bool nolf);
389 static int ScanMethodHintCmp(const ScanMethodHint *a, const ScanMethodHint *b);
390 static const char *ScanMethodHintParse(ScanMethodHint *hint, HintState *hstate,
391 Query *parse, const char *str);
393 /* Join method hint callbacks */
394 static Hint *JoinMethodHintCreate(const char *hint_str, const char *keyword,
395 HintKeyword hint_keyword);
396 static void JoinMethodHintDelete(JoinMethodHint *hint);
397 static void JoinMethodHintDesc(JoinMethodHint *hint, StringInfo buf, bool nolf);
398 static int JoinMethodHintCmp(const JoinMethodHint *a, const JoinMethodHint *b);
399 static const char *JoinMethodHintParse(JoinMethodHint *hint, HintState *hstate,
400 Query *parse, const char *str);
402 /* Leading hint callbacks */
403 static Hint *LeadingHintCreate(const char *hint_str, const char *keyword,
404 HintKeyword hint_keyword);
405 static void LeadingHintDelete(LeadingHint *hint);
406 static void LeadingHintDesc(LeadingHint *hint, StringInfo buf, bool nolf);
407 static int LeadingHintCmp(const LeadingHint *a, const LeadingHint *b);
408 static const char *LeadingHintParse(LeadingHint *hint, HintState *hstate,
409 Query *parse, const char *str);
411 /* Set hint callbacks */
412 static Hint *SetHintCreate(const char *hint_str, const char *keyword,
413 HintKeyword hint_keyword);
414 static void SetHintDelete(SetHint *hint);
415 static void SetHintDesc(SetHint *hint, StringInfo buf, bool nolf);
416 static int SetHintCmp(const SetHint *a, const SetHint *b);
417 static const char *SetHintParse(SetHint *hint, HintState *hstate, Query *parse,
420 /* Rows hint callbacks */
421 static Hint *RowsHintCreate(const char *hint_str, const char *keyword,
422 HintKeyword hint_keyword);
423 static void RowsHintDelete(RowsHint *hint);
424 static void RowsHintDesc(RowsHint *hint, StringInfo buf, bool nolf);
425 static int RowsHintCmp(const RowsHint *a, const RowsHint *b);
426 static const char *RowsHintParse(RowsHint *hint, HintState *hstate,
427 Query *parse, const char *str);
429 /* Parallel hint callbacks */
430 static Hint *ParallelHintCreate(const char *hint_str, const char *keyword,
431 HintKeyword hint_keyword);
432 static void ParallelHintDelete(ParallelHint *hint);
433 static void ParallelHintDesc(ParallelHint *hint, StringInfo buf, bool nolf);
434 static int ParallelHintCmp(const ParallelHint *a, const ParallelHint *b);
435 static const char *ParallelHintParse(ParallelHint *hint, HintState *hstate,
436 Query *parse, const char *str);
438 static void quote_value(StringInfo buf, const char *value);
440 static const char *parse_quoted_value(const char *str, char **word,
443 RelOptInfo *pg_hint_plan_standard_join_search(PlannerInfo *root,
446 void pg_hint_plan_join_search_one_level(PlannerInfo *root, int level);
447 void pg_hint_plan_set_rel_pathlist(PlannerInfo * root, RelOptInfo *rel,
448 Index rti, RangeTblEntry *rte);
449 static void create_plain_partial_paths(PlannerInfo *root,
451 static int compute_parallel_worker(RelOptInfo *rel, BlockNumber pages);
453 static void make_rels_by_clause_joins(PlannerInfo *root, RelOptInfo *old_rel,
454 ListCell *other_rels);
455 static void make_rels_by_clauseless_joins(PlannerInfo *root,
457 ListCell *other_rels);
458 static bool has_join_restriction(PlannerInfo *root, RelOptInfo *rel);
459 static void set_append_rel_pathlist(PlannerInfo *root, RelOptInfo *rel,
460 Index rti, RangeTblEntry *rte);
461 static void generate_mergeappend_paths(PlannerInfo *root, RelOptInfo *rel,
462 List *live_childrels,
463 List *all_child_pathkeys);
464 static Path *get_cheapest_parameterized_child_path(PlannerInfo *root,
466 Relids required_outer);
467 static List *accumulate_append_subpath(List *subpaths, Path *path);
468 RelOptInfo *pg_hint_plan_make_join_rel(PlannerInfo *root, RelOptInfo *rel1,
471 static void pg_hint_plan_plpgsql_stmt_beg(PLpgSQL_execstate *estate,
473 static void pg_hint_plan_plpgsql_stmt_end(PLpgSQL_execstate *estate,
475 static void plpgsql_query_erase_callback(ResourceReleasePhase phase,
479 static int set_config_option_noerror(const char *name, const char *value,
480 GucContext context, GucSource source,
481 GucAction action, bool changeVal, int elevel);
482 static void setup_scan_method_enforcement(ScanMethodHint *scanhint,
484 static int set_config_int32_option(const char *name, int32 value,
488 static bool pg_hint_plan_enable_hint = true;
489 static int debug_level = 0;
490 static int pg_hint_plan_message_level = INFO;
491 /* Default is off, to keep backward compatibility. */
492 static bool pg_hint_plan_enable_hint_table = false;
494 /* Internal static variables. */
495 static bool hidestmt = false; /* Allow or inhibit STATEMENT: output */
497 static int plpgsql_recurse_level = 0; /* PLpgSQL recursion level */
498 static int hint_inhibit_level = 0; /* Inhibit hinting if this is above 0 */
499 /* (This could not be above 1) */
500 static int max_hint_nworkers = -1; /* Maximum nworkers of Workers hints */
502 static const struct config_enum_entry parse_messages_level_options[] = {
503 {"debug", DEBUG2, true},
504 {"debug5", DEBUG5, false},
505 {"debug4", DEBUG4, false},
506 {"debug3", DEBUG3, false},
507 {"debug2", DEBUG2, false},
508 {"debug1", DEBUG1, false},
510 {"info", INFO, false},
511 {"notice", NOTICE, false},
512 {"warning", WARNING, false},
513 {"error", ERROR, false},
515 * {"fatal", FATAL, true},
516 * {"panic", PANIC, true},
521 static const struct config_enum_entry parse_debug_level_options[] = {
524 {"detailed", 2, false},
525 {"verbose", 3, false},
537 /* Saved hook values in case of unload */
538 static ProcessUtility_hook_type prev_ProcessUtility = NULL;
539 static planner_hook_type prev_planner = NULL;
540 static get_relation_info_hook_type prev_get_relation_info = NULL;
541 static join_search_hook_type prev_join_search = NULL;
542 static set_rel_pathlist_hook_type prev_set_rel_pathlist = NULL;
544 /* Hold reference to currently active hint */
545 static HintState *current_hint_state = NULL;
548 * List of hint contexts. We treat the head of the list as the Top of the
549 * context stack, so current_hint_state always points the first element of this
552 static List *HintStateStack = NIL;
555 * Holds statement name during executing EXECUTE command. NULL for other
558 static char *stmt_name = NULL;
560 static const HintParser parsers[] = {
561 {HINT_SEQSCAN, ScanMethodHintCreate, HINT_KEYWORD_SEQSCAN},
562 {HINT_INDEXSCAN, ScanMethodHintCreate, HINT_KEYWORD_INDEXSCAN},
563 {HINT_INDEXSCANREGEXP, ScanMethodHintCreate, HINT_KEYWORD_INDEXSCANREGEXP},
564 {HINT_BITMAPSCAN, ScanMethodHintCreate, HINT_KEYWORD_BITMAPSCAN},
565 {HINT_BITMAPSCANREGEXP, ScanMethodHintCreate,
566 HINT_KEYWORD_BITMAPSCANREGEXP},
567 {HINT_TIDSCAN, ScanMethodHintCreate, HINT_KEYWORD_TIDSCAN},
568 {HINT_NOSEQSCAN, ScanMethodHintCreate, HINT_KEYWORD_NOSEQSCAN},
569 {HINT_NOINDEXSCAN, ScanMethodHintCreate, HINT_KEYWORD_NOINDEXSCAN},
570 {HINT_NOBITMAPSCAN, ScanMethodHintCreate, HINT_KEYWORD_NOBITMAPSCAN},
571 {HINT_NOTIDSCAN, ScanMethodHintCreate, HINT_KEYWORD_NOTIDSCAN},
572 {HINT_INDEXONLYSCAN, ScanMethodHintCreate, HINT_KEYWORD_INDEXONLYSCAN},
573 {HINT_INDEXONLYSCANREGEXP, ScanMethodHintCreate,
574 HINT_KEYWORD_INDEXONLYSCANREGEXP},
575 {HINT_NOINDEXONLYSCAN, ScanMethodHintCreate, HINT_KEYWORD_NOINDEXONLYSCAN},
577 {HINT_NESTLOOP, JoinMethodHintCreate, HINT_KEYWORD_NESTLOOP},
578 {HINT_MERGEJOIN, JoinMethodHintCreate, HINT_KEYWORD_MERGEJOIN},
579 {HINT_HASHJOIN, JoinMethodHintCreate, HINT_KEYWORD_HASHJOIN},
580 {HINT_NONESTLOOP, JoinMethodHintCreate, HINT_KEYWORD_NONESTLOOP},
581 {HINT_NOMERGEJOIN, JoinMethodHintCreate, HINT_KEYWORD_NOMERGEJOIN},
582 {HINT_NOHASHJOIN, JoinMethodHintCreate, HINT_KEYWORD_NOHASHJOIN},
584 {HINT_LEADING, LeadingHintCreate, HINT_KEYWORD_LEADING},
585 {HINT_SET, SetHintCreate, HINT_KEYWORD_SET},
586 {HINT_ROWS, RowsHintCreate, HINT_KEYWORD_ROWS},
587 {HINT_PARALLEL, ParallelHintCreate, HINT_KEYWORD_PARALLEL},
589 {NULL, NULL, HINT_KEYWORD_UNRECOGNIZED}
592 PLpgSQL_plugin plugin_funcs = {
596 pg_hint_plan_plpgsql_stmt_beg,
597 pg_hint_plan_plpgsql_stmt_end,
603 * Module load callbacks
608 PLpgSQL_plugin **var_ptr;
610 /* Define custom GUC variables. */
611 DefineCustomBoolVariable("pg_hint_plan.enable_hint",
612 "Force planner to use plans specified in the hint comment preceding to the query.",
614 &pg_hint_plan_enable_hint,
622 DefineCustomEnumVariable("pg_hint_plan.debug_print",
623 "Logs results of hint parsing.",
627 parse_debug_level_options,
634 DefineCustomEnumVariable("pg_hint_plan.parse_messages",
635 "Message level of parse errors.",
637 &pg_hint_plan_message_level,
639 parse_messages_level_options,
646 DefineCustomEnumVariable("pg_hint_plan.message_level",
647 "Message level of debug messages.",
649 &pg_hint_plan_message_level,
651 parse_messages_level_options,
658 DefineCustomBoolVariable("pg_hint_plan.enable_hint_table",
659 "Let pg_hint_plan look up the hint table.",
661 &pg_hint_plan_enable_hint_table,
670 prev_ProcessUtility = ProcessUtility_hook;
671 ProcessUtility_hook = pg_hint_plan_ProcessUtility;
672 prev_planner = planner_hook;
673 planner_hook = pg_hint_plan_planner;
674 prev_get_relation_info = get_relation_info_hook;
675 get_relation_info_hook = pg_hint_plan_get_relation_info;
676 prev_join_search = join_search_hook;
677 join_search_hook = pg_hint_plan_join_search;
678 prev_set_rel_pathlist = set_rel_pathlist_hook;
679 set_rel_pathlist_hook = pg_hint_plan_set_rel_pathlist;
681 /* setup PL/pgSQL plugin hook */
682 var_ptr = (PLpgSQL_plugin **) find_rendezvous_variable("PLpgSQL_plugin");
683 *var_ptr = &plugin_funcs;
685 RegisterResourceReleaseCallback(plpgsql_query_erase_callback, NULL);
689 * Module unload callback
695 PLpgSQL_plugin **var_ptr;
697 /* Uninstall hooks. */
698 ProcessUtility_hook = prev_ProcessUtility;
699 planner_hook = prev_planner;
700 get_relation_info_hook = prev_get_relation_info;
701 join_search_hook = prev_join_search;
702 set_rel_pathlist_hook = prev_set_rel_pathlist;
704 /* uninstall PL/pgSQL plugin hook */
705 var_ptr = (PLpgSQL_plugin **) find_rendezvous_variable("PLpgSQL_plugin");
710 * create and delete functions the hint object
714 ScanMethodHintCreate(const char *hint_str, const char *keyword,
715 HintKeyword hint_keyword)
717 ScanMethodHint *hint;
719 hint = palloc(sizeof(ScanMethodHint));
720 hint->base.hint_str = hint_str;
721 hint->base.keyword = keyword;
722 hint->base.hint_keyword = hint_keyword;
723 hint->base.type = HINT_TYPE_SCAN_METHOD;
724 hint->base.state = HINT_STATE_NOTUSED;
725 hint->base.delete_func = (HintDeleteFunction) ScanMethodHintDelete;
726 hint->base.desc_func = (HintDescFunction) ScanMethodHintDesc;
727 hint->base.cmp_func = (HintCmpFunction) ScanMethodHintCmp;
728 hint->base.parse_func = (HintParseFunction) ScanMethodHintParse;
729 hint->relname = NULL;
730 hint->indexnames = NIL;
731 hint->regexp = false;
732 hint->enforce_mask = 0;
734 return (Hint *) hint;
738 ScanMethodHintDelete(ScanMethodHint *hint)
744 pfree(hint->relname);
745 list_free_deep(hint->indexnames);
750 JoinMethodHintCreate(const char *hint_str, const char *keyword,
751 HintKeyword hint_keyword)
753 JoinMethodHint *hint;
755 hint = palloc(sizeof(JoinMethodHint));
756 hint->base.hint_str = hint_str;
757 hint->base.keyword = keyword;
758 hint->base.hint_keyword = hint_keyword;
759 hint->base.type = HINT_TYPE_JOIN_METHOD;
760 hint->base.state = HINT_STATE_NOTUSED;
761 hint->base.delete_func = (HintDeleteFunction) JoinMethodHintDelete;
762 hint->base.desc_func = (HintDescFunction) JoinMethodHintDesc;
763 hint->base.cmp_func = (HintCmpFunction) JoinMethodHintCmp;
764 hint->base.parse_func = (HintParseFunction) JoinMethodHintParse;
766 hint->inner_nrels = 0;
767 hint->relnames = NULL;
768 hint->enforce_mask = 0;
769 hint->joinrelids = NULL;
770 hint->inner_joinrelids = NULL;
772 return (Hint *) hint;
776 JoinMethodHintDelete(JoinMethodHint *hint)
785 for (i = 0; i < hint->nrels; i++)
786 pfree(hint->relnames[i]);
787 pfree(hint->relnames);
790 bms_free(hint->joinrelids);
791 bms_free(hint->inner_joinrelids);
796 LeadingHintCreate(const char *hint_str, const char *keyword,
797 HintKeyword hint_keyword)
801 hint = palloc(sizeof(LeadingHint));
802 hint->base.hint_str = hint_str;
803 hint->base.keyword = keyword;
804 hint->base.hint_keyword = hint_keyword;
805 hint->base.type = HINT_TYPE_LEADING;
806 hint->base.state = HINT_STATE_NOTUSED;
807 hint->base.delete_func = (HintDeleteFunction)LeadingHintDelete;
808 hint->base.desc_func = (HintDescFunction) LeadingHintDesc;
809 hint->base.cmp_func = (HintCmpFunction) LeadingHintCmp;
810 hint->base.parse_func = (HintParseFunction) LeadingHintParse;
811 hint->relations = NIL;
812 hint->outer_inner = NULL;
814 return (Hint *) hint;
818 LeadingHintDelete(LeadingHint *hint)
823 list_free_deep(hint->relations);
824 if (hint->outer_inner)
825 pfree(hint->outer_inner);
830 SetHintCreate(const char *hint_str, const char *keyword,
831 HintKeyword hint_keyword)
835 hint = palloc(sizeof(SetHint));
836 hint->base.hint_str = hint_str;
837 hint->base.keyword = keyword;
838 hint->base.hint_keyword = hint_keyword;
839 hint->base.type = HINT_TYPE_SET;
840 hint->base.state = HINT_STATE_NOTUSED;
841 hint->base.delete_func = (HintDeleteFunction) SetHintDelete;
842 hint->base.desc_func = (HintDescFunction) SetHintDesc;
843 hint->base.cmp_func = (HintCmpFunction) SetHintCmp;
844 hint->base.parse_func = (HintParseFunction) SetHintParse;
849 return (Hint *) hint;
853 SetHintDelete(SetHint *hint)
863 list_free(hint->words);
868 RowsHintCreate(const char *hint_str, const char *keyword,
869 HintKeyword hint_keyword)
873 hint = palloc(sizeof(RowsHint));
874 hint->base.hint_str = hint_str;
875 hint->base.keyword = keyword;
876 hint->base.hint_keyword = hint_keyword;
877 hint->base.type = HINT_TYPE_ROWS;
878 hint->base.state = HINT_STATE_NOTUSED;
879 hint->base.delete_func = (HintDeleteFunction) RowsHintDelete;
880 hint->base.desc_func = (HintDescFunction) RowsHintDesc;
881 hint->base.cmp_func = (HintCmpFunction) RowsHintCmp;
882 hint->base.parse_func = (HintParseFunction) RowsHintParse;
884 hint->inner_nrels = 0;
885 hint->relnames = NULL;
886 hint->joinrelids = NULL;
887 hint->inner_joinrelids = NULL;
888 hint->rows_str = NULL;
889 hint->value_type = RVT_ABSOLUTE;
892 return (Hint *) hint;
896 RowsHintDelete(RowsHint *hint)
905 for (i = 0; i < hint->nrels; i++)
906 pfree(hint->relnames[i]);
907 pfree(hint->relnames);
910 bms_free(hint->joinrelids);
911 bms_free(hint->inner_joinrelids);
916 ParallelHintCreate(const char *hint_str, const char *keyword,
917 HintKeyword hint_keyword)
921 hint = palloc(sizeof(ScanMethodHint));
922 hint->base.hint_str = hint_str;
923 hint->base.keyword = keyword;
924 hint->base.hint_keyword = hint_keyword;
925 hint->base.type = HINT_TYPE_PARALLEL;
926 hint->base.state = HINT_STATE_NOTUSED;
927 hint->base.delete_func = (HintDeleteFunction) ParallelHintDelete;
928 hint->base.desc_func = (HintDescFunction) ParallelHintDesc;
929 hint->base.cmp_func = (HintCmpFunction) ParallelHintCmp;
930 hint->base.parse_func = (HintParseFunction) ParallelHintParse;
931 hint->relname = NULL;
933 hint->nworkers_str = "0";
935 return (Hint *) hint;
939 ParallelHintDelete(ParallelHint *hint)
945 pfree(hint->relname);
951 HintStateCreate(void)
955 hstate = palloc(sizeof(HintState));
956 hstate->hint_str = NULL;
957 hstate->nall_hints = 0;
958 hstate->max_all_hints = 0;
959 hstate->all_hints = NULL;
960 memset(hstate->num_hints, 0, sizeof(hstate->num_hints));
961 hstate->scan_hints = NULL;
962 hstate->init_scan_mask = 0;
963 hstate->init_nworkers = 0;
964 hstate->init_min_para_size = 0;
965 hstate->init_paratup_cost = 0;
966 hstate->init_parasetup_cost = 0;
967 hstate->parent_relid = 0;
968 hstate->parent_scan_hint = NULL;
969 hstate->parent_parallel_hint = NULL;
970 hstate->parent_index_infos = NIL;
971 hstate->join_hints = NULL;
972 hstate->init_join_mask = 0;
973 hstate->join_hint_level = NULL;
974 hstate->leading_hint = NULL;
975 hstate->context = superuser() ? PGC_SUSET : PGC_USERSET;
976 hstate->set_hints = NULL;
977 hstate->rows_hints = NULL;
978 hstate->parallel_hints = NULL;
984 HintStateDelete(HintState *hstate)
991 if (hstate->hint_str)
992 pfree(hstate->hint_str);
994 for (i = 0; i < hstate->num_hints[HINT_TYPE_SCAN_METHOD]; i++)
995 hstate->all_hints[i]->delete_func(hstate->all_hints[i]);
996 if (hstate->all_hints)
997 pfree(hstate->all_hints);
998 if (hstate->parent_index_infos)
999 list_free(hstate->parent_index_infos);
1003 * Copy given value into buf, with quoting with '"' if necessary.
1006 quote_value(StringInfo buf, const char *value)
1008 bool need_quote = false;
1011 for (str = value; *str != '\0'; str++)
1013 if (isspace(*str) || *str == '(' || *str == ')' || *str == '"')
1016 appendStringInfoCharMacro(buf, '"');
1021 for (str = value; *str != '\0'; str++)
1024 appendStringInfoCharMacro(buf, '"');
1026 appendStringInfoCharMacro(buf, *str);
1030 appendStringInfoCharMacro(buf, '"');
1034 ScanMethodHintDesc(ScanMethodHint *hint, StringInfo buf, bool nolf)
1038 appendStringInfo(buf, "%s(", hint->base.keyword);
1039 if (hint->relname != NULL)
1041 quote_value(buf, hint->relname);
1042 foreach(l, hint->indexnames)
1044 appendStringInfoCharMacro(buf, ' ');
1045 quote_value(buf, (char *) lfirst(l));
1048 appendStringInfoString(buf, ")");
1050 appendStringInfoChar(buf, '\n');
1054 JoinMethodHintDesc(JoinMethodHint *hint, StringInfo buf, bool nolf)
1058 appendStringInfo(buf, "%s(", hint->base.keyword);
1059 if (hint->relnames != NULL)
1061 quote_value(buf, hint->relnames[0]);
1062 for (i = 1; i < hint->nrels; i++)
1064 appendStringInfoCharMacro(buf, ' ');
1065 quote_value(buf, hint->relnames[i]);
1068 appendStringInfoString(buf, ")");
1070 appendStringInfoChar(buf, '\n');
1074 OuterInnerDesc(OuterInnerRels *outer_inner, StringInfo buf)
1076 if (outer_inner->relation == NULL)
1083 appendStringInfoCharMacro(buf, '(');
1084 foreach(l, outer_inner->outer_inner_pair)
1089 appendStringInfoCharMacro(buf, ' ');
1091 OuterInnerDesc(lfirst(l), buf);
1094 appendStringInfoCharMacro(buf, ')');
1097 quote_value(buf, outer_inner->relation);
1101 LeadingHintDesc(LeadingHint *hint, StringInfo buf, bool nolf)
1103 appendStringInfo(buf, "%s(", HINT_LEADING);
1104 if (hint->outer_inner == NULL)
1111 foreach(l, hint->relations)
1116 appendStringInfoCharMacro(buf, ' ');
1118 quote_value(buf, (char *) lfirst(l));
1122 OuterInnerDesc(hint->outer_inner, buf);
1124 appendStringInfoString(buf, ")");
1126 appendStringInfoChar(buf, '\n');
1130 SetHintDesc(SetHint *hint, StringInfo buf, bool nolf)
1132 bool is_first = true;
1135 appendStringInfo(buf, "%s(", HINT_SET);
1136 foreach(l, hint->words)
1141 appendStringInfoCharMacro(buf, ' ');
1143 quote_value(buf, (char *) lfirst(l));
1145 appendStringInfo(buf, ")");
1147 appendStringInfoChar(buf, '\n');
1151 RowsHintDesc(RowsHint *hint, StringInfo buf, bool nolf)
1155 appendStringInfo(buf, "%s(", hint->base.keyword);
1156 if (hint->relnames != NULL)
1158 quote_value(buf, hint->relnames[0]);
1159 for (i = 1; i < hint->nrels; i++)
1161 appendStringInfoCharMacro(buf, ' ');
1162 quote_value(buf, hint->relnames[i]);
1165 appendStringInfo(buf, " %s", hint->rows_str);
1166 appendStringInfoString(buf, ")");
1168 appendStringInfoChar(buf, '\n');
1172 ParallelHintDesc(ParallelHint *hint, StringInfo buf, bool nolf)
1174 appendStringInfo(buf, "%s(", hint->base.keyword);
1175 if (hint->relname != NULL)
1177 quote_value(buf, hint->relname);
1179 /* number of workers */
1180 appendStringInfoCharMacro(buf, ' ');
1181 quote_value(buf, hint->nworkers_str);
1182 /* application mode of num of workers */
1183 appendStringInfoCharMacro(buf, ' ');
1184 appendStringInfoString(buf,
1185 (hint->force_parallel ? "hard" : "soft"));
1187 appendStringInfoString(buf, ")");
1189 appendStringInfoChar(buf, '\n');
1193 * Append string which represents all hints in a given state to buf, with
1194 * preceding title with them.
1197 desc_hint_in_state(HintState *hstate, StringInfo buf, const char *title,
1198 HintStatus state, bool nolf)
1202 appendStringInfo(buf, "%s:", title);
1204 appendStringInfoChar(buf, '\n');
1207 for (i = 0; i < hstate->nall_hints; i++)
1209 if (hstate->all_hints[i]->state != state)
1212 hstate->all_hints[i]->desc_func(hstate->all_hints[i], buf, nolf);
1216 if (nolf && nshown == 0)
1217 appendStringInfoString(buf, "(none)");
1221 * Dump contents of given hstate to server log with log level LOG.
1224 HintStateDump(HintState *hstate)
1230 elog(LOG, "pg_hint_plan:\nno hint");
1234 initStringInfo(&buf);
1236 appendStringInfoString(&buf, "pg_hint_plan:\n");
1237 desc_hint_in_state(hstate, &buf, "used hint", HINT_STATE_USED, false);
1238 desc_hint_in_state(hstate, &buf, "not used hint", HINT_STATE_NOTUSED, false);
1239 desc_hint_in_state(hstate, &buf, "duplication hint", HINT_STATE_DUPLICATION, false);
1240 desc_hint_in_state(hstate, &buf, "error hint", HINT_STATE_ERROR, false);
1242 elog(LOG, "%s", buf.data);
1248 HintStateDump2(HintState *hstate)
1254 elog(pg_hint_plan_message_level,
1255 "pg_hint_plan%s: HintStateDump: no hint", qnostr);
1259 initStringInfo(&buf);
1260 appendStringInfo(&buf, "pg_hint_plan%s: HintStateDump: ", qnostr);
1261 desc_hint_in_state(hstate, &buf, "{used hints", HINT_STATE_USED, true);
1262 desc_hint_in_state(hstate, &buf, "}, {not used hints", HINT_STATE_NOTUSED, true);
1263 desc_hint_in_state(hstate, &buf, "}, {duplicate hints", HINT_STATE_DUPLICATION, true);
1264 desc_hint_in_state(hstate, &buf, "}, {error hints", HINT_STATE_ERROR, true);
1265 appendStringInfoChar(&buf, '}');
1267 ereport(pg_hint_plan_message_level,
1269 errmsg("%s", buf.data)));
1279 RelnameCmp(const void *a, const void *b)
1281 const char *relnamea = *((const char **) a);
1282 const char *relnameb = *((const char **) b);
1284 return strcmp(relnamea, relnameb);
1288 ScanMethodHintCmp(const ScanMethodHint *a, const ScanMethodHint *b)
1290 return RelnameCmp(&a->relname, &b->relname);
1294 JoinMethodHintCmp(const JoinMethodHint *a, const JoinMethodHint *b)
1298 if (a->nrels != b->nrels)
1299 return a->nrels - b->nrels;
1301 for (i = 0; i < a->nrels; i++)
1304 if ((result = RelnameCmp(&a->relnames[i], &b->relnames[i])) != 0)
1312 LeadingHintCmp(const LeadingHint *a, const LeadingHint *b)
1318 SetHintCmp(const SetHint *a, const SetHint *b)
1320 return strcmp(a->name, b->name);
1324 RowsHintCmp(const RowsHint *a, const RowsHint *b)
1328 if (a->nrels != b->nrels)
1329 return a->nrels - b->nrels;
1331 for (i = 0; i < a->nrels; i++)
1334 if ((result = RelnameCmp(&a->relnames[i], &b->relnames[i])) != 0)
1342 ParallelHintCmp(const ParallelHint *a, const ParallelHint *b)
1344 return RelnameCmp(&a->relname, &b->relname);
1348 HintCmp(const void *a, const void *b)
1350 const Hint *hinta = *((const Hint **) a);
1351 const Hint *hintb = *((const Hint **) b);
1353 if (hinta->type != hintb->type)
1354 return hinta->type - hintb->type;
1355 if (hinta->state == HINT_STATE_ERROR)
1357 if (hintb->state == HINT_STATE_ERROR)
1359 return hinta->cmp_func(hinta, hintb);
1363 * Returns byte offset of hint b from hint a. If hint a was specified before
1364 * b, positive value is returned.
1367 HintCmpWithPos(const void *a, const void *b)
1369 const Hint *hinta = *((const Hint **) a);
1370 const Hint *hintb = *((const Hint **) b);
1373 result = HintCmp(a, b);
1375 result = hinta->hint_str - hintb->hint_str;
1384 parse_keyword(const char *str, StringInfo buf)
1388 while (!isspace(*str) && *str != '(' && *str != '\0')
1389 appendStringInfoCharMacro(buf, *str++);
1395 skip_parenthesis(const char *str, char parenthesis)
1399 if (*str != parenthesis)
1401 if (parenthesis == '(')
1402 hint_ereport(str, ("Opening parenthesis is necessary."));
1403 else if (parenthesis == ')')
1404 hint_ereport(str, ("Closing parenthesis is necessary."));
1415 * Parse a token from str, and store malloc'd copy into word. A token can be
1416 * quoted with '"'. Return value is pointer to unparsed portion of original
1417 * string, or NULL if an error occurred.
1419 * Parsed token is truncated within NAMEDATALEN-1 bytes, when truncate is true.
1422 parse_quoted_value(const char *str, char **word, bool truncate)
1427 /* Skip leading spaces. */
1430 initStringInfo(&buf);
1443 /* Double quotation must be closed. */
1447 hint_ereport(str, ("Unterminated quoted string."));
1452 * Skip escaped double quotation.
1454 * We don't allow slash-asterisk and asterisk-slash (delimiters of
1455 * block comments) to be an object name, so users must specify
1456 * alias for such object names.
1458 * Those special names can be allowed if we care escaped slashes
1459 * and asterisks, but we don't.
1468 else if (isspace(*str) || *str == '(' || *str == ')' || *str == '"' ||
1472 appendStringInfoCharMacro(&buf, *str++);
1477 hint_ereport(str, ("Zero-length delimited string."));
1484 /* Truncate name if it's too long */
1486 truncate_identifier(buf.data, strlen(buf.data), true);
1493 static OuterInnerRels *
1494 OuterInnerRelsCreate(char *name, List *outer_inner_list)
1496 OuterInnerRels *outer_inner;
1498 outer_inner = palloc(sizeof(OuterInnerRels));
1499 outer_inner->relation = name;
1500 outer_inner->outer_inner_pair = outer_inner_list;
1506 parse_parentheses_Leading_in(const char *str, OuterInnerRels **outer_inner)
1508 List *outer_inner_pair = NIL;
1510 if ((str = skip_parenthesis(str, '(')) == NULL)
1515 /* Store words in parentheses into outer_inner_list. */
1516 while(*str != ')' && *str != '\0')
1518 OuterInnerRels *outer_inner_rels;
1522 str = parse_parentheses_Leading_in(str, &outer_inner_rels);
1530 if ((str = parse_quoted_value(str, &name, true)) == NULL)
1533 outer_inner_rels = OuterInnerRelsCreate(name, NIL);
1536 outer_inner_pair = lappend(outer_inner_pair, outer_inner_rels);
1541 (str = skip_parenthesis(str, ')')) == NULL)
1543 list_free(outer_inner_pair);
1547 *outer_inner = OuterInnerRelsCreate(NULL, outer_inner_pair);
1553 parse_parentheses_Leading(const char *str, List **name_list,
1554 OuterInnerRels **outer_inner)
1557 bool truncate = true;
1559 if ((str = skip_parenthesis(str, '(')) == NULL)
1565 if ((str = parse_parentheses_Leading_in(str, outer_inner)) == NULL)
1570 /* Store words in parentheses into name_list. */
1571 while(*str != ')' && *str != '\0')
1573 if ((str = parse_quoted_value(str, &name, truncate)) == NULL)
1575 list_free(*name_list);
1579 *name_list = lappend(*name_list, name);
1584 if ((str = skip_parenthesis(str, ')')) == NULL)
1590 parse_parentheses(const char *str, List **name_list, HintKeyword keyword)
1593 bool truncate = true;
1595 if ((str = skip_parenthesis(str, '(')) == NULL)
1600 /* Store words in parentheses into name_list. */
1601 while(*str != ')' && *str != '\0')
1603 if ((str = parse_quoted_value(str, &name, truncate)) == NULL)
1605 list_free(*name_list);
1609 *name_list = lappend(*name_list, name);
1612 if (keyword == HINT_KEYWORD_INDEXSCANREGEXP ||
1613 keyword == HINT_KEYWORD_INDEXONLYSCANREGEXP ||
1614 keyword == HINT_KEYWORD_BITMAPSCANREGEXP ||
1615 keyword == HINT_KEYWORD_SET)
1621 if ((str = skip_parenthesis(str, ')')) == NULL)
1627 parse_hints(HintState *hstate, Query *parse, const char *str)
1632 initStringInfo(&buf);
1633 while (*str != '\0')
1635 const HintParser *parser;
1637 /* in error message, we output the comment including the keyword. */
1638 head = (char *) str;
1640 /* parse only the keyword of the hint. */
1641 resetStringInfo(&buf);
1642 str = parse_keyword(str, &buf);
1644 for (parser = parsers; parser->keyword != NULL; parser++)
1646 char *keyword = parser->keyword;
1649 if (strcasecmp(buf.data, keyword) != 0)
1652 hint = parser->create_func(head, keyword, parser->hint_keyword);
1654 /* parser of each hint does parse in a parenthesis. */
1655 if ((str = hint->parse_func(hint, hstate, parse, str)) == NULL)
1657 hint->delete_func(hint);
1663 * Add hint information into all_hints array. If we don't have
1664 * enough space, double the array.
1666 if (hstate->nall_hints == 0)
1668 hstate->max_all_hints = HINT_ARRAY_DEFAULT_INITSIZE;
1669 hstate->all_hints = (Hint **)
1670 palloc(sizeof(Hint *) * hstate->max_all_hints);
1672 else if (hstate->nall_hints == hstate->max_all_hints)
1674 hstate->max_all_hints *= 2;
1675 hstate->all_hints = (Hint **)
1676 repalloc(hstate->all_hints,
1677 sizeof(Hint *) * hstate->max_all_hints);
1680 hstate->all_hints[hstate->nall_hints] = hint;
1681 hstate->nall_hints++;
1688 if (parser->keyword == NULL)
1691 ("Unrecognized hint keyword \"%s\".", buf.data));
1702 * Get hints from table by client-supplied query string and application name.
1705 get_hints_from_table(const char *client_query, const char *client_application)
1707 const char *search_query =
1709 " FROM hint_plan.hints "
1710 " WHERE norm_query_string = $1 "
1711 " AND ( application_name = $2 "
1712 " OR application_name = '' ) "
1713 " ORDER BY application_name DESC";
1714 static SPIPlanPtr plan = NULL;
1716 Oid argtypes[2] = { TEXTOID, TEXTOID };
1718 bool nulls[2] = { false, false };
1724 hint_inhibit_level++;
1731 p = SPI_prepare(search_query, 2, argtypes);
1732 plan = SPI_saveplan(p);
1736 qry = cstring_to_text(client_query);
1737 app = cstring_to_text(client_application);
1738 values[0] = PointerGetDatum(qry);
1739 values[1] = PointerGetDatum(app);
1741 SPI_execute_plan(plan, values, nulls, true, 1);
1743 if (SPI_processed > 0)
1747 hints = SPI_getvalue(SPI_tuptable->vals[0],
1748 SPI_tuptable->tupdesc, 1);
1750 * Here we use SPI_palloc to ensure that hints string is valid even
1751 * after SPI_finish call. We can't use simple palloc because it
1752 * allocates memory in SPI's context and that context is deleted in
1755 buf = SPI_palloc(strlen(hints) + 1);
1762 hint_inhibit_level--;
1766 hint_inhibit_level--;
1775 * Get client-supplied query string.
1778 get_query_string(void)
1782 if (plpgsql_recurse_level > 0)
1785 * This is quite ugly but this is the only point I could find where
1786 * we can get the query string.
1788 p = (char*)error_context_stack->arg;
1792 PreparedStatement *entry;
1794 entry = FetchPreparedStatement(stmt_name, true);
1795 p = entry->plansource->query_string;
1798 p = debug_query_string;
1804 * Get hints from the head block comment in client-supplied query string.
1807 get_hints_from_comment(const char *p)
1809 const char *hint_head;
1817 /* extract query head comment. */
1818 hint_head = strstr(p, HINT_START);
1819 if (hint_head == NULL)
1821 for (;p < hint_head; p++)
1824 * Allow these characters precedes hint comment:
1826 * - alphabets which are in ASCII range
1827 * - space, tabs and new-lines
1828 * - underscores, for identifier
1829 * - commas, for SELECT clause, EXPLAIN and PREPARE
1830 * - parentheses, for EXPLAIN and PREPARE
1832 * Note that we don't use isalpha() nor isalnum() in ctype.h here to
1833 * avoid behavior which depends on locale setting.
1835 if (!(*p >= '0' && *p <= '9') &&
1836 !(*p >= 'A' && *p <= 'Z') &&
1837 !(*p >= 'a' && *p <= 'z') &&
1841 *p != '(' && *p != ')')
1845 len = strlen(HINT_START);
1850 /* find hint end keyword. */
1851 if ((tail = strstr(p, HINT_END)) == NULL)
1853 hint_ereport(head, ("Unterminated block comment."));
1857 /* We don't support nested block comments. */
1858 if ((head = strstr(p, BLOCK_COMMENT_START)) != NULL && head < tail)
1860 hint_ereport(head, ("Nested block comments are not supported."));
1864 /* Make a copy of hint. */
1866 head = palloc(len + 1);
1867 memcpy(head, p, len);
1875 * Parse hints that got, create hint struct from parse tree and parse hints.
1878 create_hintstate(Query *parse, const char *hints)
1887 /* -1 means that no Parallel hint is specified. */
1888 max_hint_nworkers = -1;
1891 hstate = HintStateCreate();
1892 hstate->hint_str = (char *) hints;
1894 /* parse each hint. */
1895 parse_hints(hstate, parse, p);
1897 /* When nothing specified a hint, we free HintState and returns NULL. */
1898 if (hstate->nall_hints == 0)
1900 HintStateDelete(hstate);
1904 /* Sort hints in order of original position. */
1905 qsort(hstate->all_hints, hstate->nall_hints, sizeof(Hint *),
1908 /* Count number of hints per hint-type. */
1909 for (i = 0; i < hstate->nall_hints; i++)
1911 Hint *cur_hint = hstate->all_hints[i];
1912 hstate->num_hints[cur_hint->type]++;
1916 * If an object (or a set of objects) has multiple hints of same hint-type,
1917 * only the last hint is valid and others are ignored in planning.
1918 * Hints except the last are marked as 'duplicated' to remember the order.
1920 for (i = 0; i < hstate->nall_hints - 1; i++)
1922 Hint *cur_hint = hstate->all_hints[i];
1923 Hint *next_hint = hstate->all_hints[i + 1];
1926 * Leading hint is marked as 'duplicated' in transform_join_hints.
1928 if (cur_hint->type == HINT_TYPE_LEADING &&
1929 next_hint->type == HINT_TYPE_LEADING)
1933 * Note that we need to pass addresses of hint pointers, because
1934 * HintCmp is designed to sort array of Hint* by qsort.
1936 if (HintCmp(&cur_hint, &next_hint) == 0)
1938 hint_ereport(cur_hint->hint_str,
1939 ("Conflict %s hint.", HintTypeName[cur_hint->type]));
1940 cur_hint->state = HINT_STATE_DUPLICATION;
1945 * Make sure that per-type array pointers point proper position in the
1946 * array which consists of all hints.
1948 hstate->scan_hints = (ScanMethodHint **) hstate->all_hints;
1949 hstate->join_hints = (JoinMethodHint **) (hstate->scan_hints +
1950 hstate->num_hints[HINT_TYPE_SCAN_METHOD]);
1951 hstate->leading_hint = (LeadingHint **) (hstate->join_hints +
1952 hstate->num_hints[HINT_TYPE_JOIN_METHOD]);
1953 hstate->set_hints = (SetHint **) (hstate->leading_hint +
1954 hstate->num_hints[HINT_TYPE_LEADING]);
1955 hstate->rows_hints = (RowsHint **) (hstate->set_hints +
1956 hstate->num_hints[HINT_TYPE_SET]);
1957 hstate->parallel_hints = (ParallelHint **) (hstate->set_hints +
1958 hstate->num_hints[HINT_TYPE_ROWS]);
1964 * Parse inside of parentheses of scan-method hints.
1967 ScanMethodHintParse(ScanMethodHint *hint, HintState *hstate, Query *parse,
1970 const char *keyword = hint->base.keyword;
1971 HintKeyword hint_keyword = hint->base.hint_keyword;
1972 List *name_list = NIL;
1975 if ((str = parse_parentheses(str, &name_list, hint_keyword)) == NULL)
1978 /* Parse relation name and index name(s) if given hint accepts. */
1979 length = list_length(name_list);
1981 /* at least twp parameters required */
1985 ("%s hint requires a relation.", hint->base.keyword));
1986 hint->base.state = HINT_STATE_ERROR;
1990 hint->relname = linitial(name_list);
1991 hint->indexnames = list_delete_first(name_list);
1993 /* check whether the hint accepts index name(s) */
1994 if (length > 1 && !SCAN_HINT_ACCEPTS_INDEX_NAMES(hint_keyword))
1997 ("%s hint accepts only one relation.",
1998 hint->base.keyword));
1999 hint->base.state = HINT_STATE_ERROR;
2003 /* Set a bit for specified hint. */
2004 switch (hint_keyword)
2006 case HINT_KEYWORD_SEQSCAN:
2007 hint->enforce_mask = ENABLE_SEQSCAN;
2009 case HINT_KEYWORD_INDEXSCAN:
2010 hint->enforce_mask = ENABLE_INDEXSCAN;
2012 case HINT_KEYWORD_INDEXSCANREGEXP:
2013 hint->enforce_mask = ENABLE_INDEXSCAN;
2014 hint->regexp = true;
2016 case HINT_KEYWORD_BITMAPSCAN:
2017 hint->enforce_mask = ENABLE_BITMAPSCAN;
2019 case HINT_KEYWORD_BITMAPSCANREGEXP:
2020 hint->enforce_mask = ENABLE_BITMAPSCAN;
2021 hint->regexp = true;
2023 case HINT_KEYWORD_TIDSCAN:
2024 hint->enforce_mask = ENABLE_TIDSCAN;
2026 case HINT_KEYWORD_NOSEQSCAN:
2027 hint->enforce_mask = ENABLE_ALL_SCAN ^ ENABLE_SEQSCAN;
2029 case HINT_KEYWORD_NOINDEXSCAN:
2030 hint->enforce_mask = ENABLE_ALL_SCAN ^ ENABLE_INDEXSCAN;
2032 case HINT_KEYWORD_NOBITMAPSCAN:
2033 hint->enforce_mask = ENABLE_ALL_SCAN ^ ENABLE_BITMAPSCAN;
2035 case HINT_KEYWORD_NOTIDSCAN:
2036 hint->enforce_mask = ENABLE_ALL_SCAN ^ ENABLE_TIDSCAN;
2038 case HINT_KEYWORD_INDEXONLYSCAN:
2039 hint->enforce_mask = ENABLE_INDEXSCAN | ENABLE_INDEXONLYSCAN;
2041 case HINT_KEYWORD_INDEXONLYSCANREGEXP:
2042 hint->enforce_mask = ENABLE_INDEXSCAN | ENABLE_INDEXONLYSCAN;
2043 hint->regexp = true;
2045 case HINT_KEYWORD_NOINDEXONLYSCAN:
2046 hint->enforce_mask = ENABLE_ALL_SCAN ^ ENABLE_INDEXONLYSCAN;
2049 hint_ereport(str, ("Unrecognized hint keyword \"%s\".", keyword));
2058 JoinMethodHintParse(JoinMethodHint *hint, HintState *hstate, Query *parse,
2061 const char *keyword = hint->base.keyword;
2062 HintKeyword hint_keyword = hint->base.hint_keyword;
2063 List *name_list = NIL;
2065 if ((str = parse_parentheses(str, &name_list, hint_keyword)) == NULL)
2068 hint->nrels = list_length(name_list);
2070 if (hint->nrels > 0)
2076 * Transform relation names from list to array to sort them with qsort
2079 hint->relnames = palloc(sizeof(char *) * hint->nrels);
2080 foreach (l, name_list)
2082 hint->relnames[i] = lfirst(l);
2087 list_free(name_list);
2089 /* A join hint requires at least two relations */
2090 if (hint->nrels < 2)
2093 ("%s hint requires at least two relations.",
2094 hint->base.keyword));
2095 hint->base.state = HINT_STATE_ERROR;
2099 /* Sort hints in alphabetical order of relation names. */
2100 qsort(hint->relnames, hint->nrels, sizeof(char *), RelnameCmp);
2102 switch (hint_keyword)
2104 case HINT_KEYWORD_NESTLOOP:
2105 hint->enforce_mask = ENABLE_NESTLOOP;
2107 case HINT_KEYWORD_MERGEJOIN:
2108 hint->enforce_mask = ENABLE_MERGEJOIN;
2110 case HINT_KEYWORD_HASHJOIN:
2111 hint->enforce_mask = ENABLE_HASHJOIN;
2113 case HINT_KEYWORD_NONESTLOOP:
2114 hint->enforce_mask = ENABLE_ALL_JOIN ^ ENABLE_NESTLOOP;
2116 case HINT_KEYWORD_NOMERGEJOIN:
2117 hint->enforce_mask = ENABLE_ALL_JOIN ^ ENABLE_MERGEJOIN;
2119 case HINT_KEYWORD_NOHASHJOIN:
2120 hint->enforce_mask = ENABLE_ALL_JOIN ^ ENABLE_HASHJOIN;
2123 hint_ereport(str, ("Unrecognized hint keyword \"%s\".", keyword));
2132 OuterInnerPairCheck(OuterInnerRels *outer_inner)
2135 if (outer_inner->outer_inner_pair == NIL)
2137 if (outer_inner->relation)
2143 if (list_length(outer_inner->outer_inner_pair) == 2)
2145 foreach(l, outer_inner->outer_inner_pair)
2147 if (!OuterInnerPairCheck(lfirst(l)))
2158 OuterInnerList(OuterInnerRels *outer_inner)
2160 List *outer_inner_list = NIL;
2162 OuterInnerRels *outer_inner_rels;
2164 foreach(l, outer_inner->outer_inner_pair)
2166 outer_inner_rels = (OuterInnerRels *)(lfirst(l));
2168 if (outer_inner_rels->relation != NULL)
2169 outer_inner_list = lappend(outer_inner_list,
2170 outer_inner_rels->relation);
2172 outer_inner_list = list_concat(outer_inner_list,
2173 OuterInnerList(outer_inner_rels));
2175 return outer_inner_list;
2179 LeadingHintParse(LeadingHint *hint, HintState *hstate, Query *parse,
2182 List *name_list = NIL;
2183 OuterInnerRels *outer_inner = NULL;
2185 if ((str = parse_parentheses_Leading(str, &name_list, &outer_inner)) ==
2189 if (outer_inner != NULL)
2190 name_list = OuterInnerList(outer_inner);
2192 hint->relations = name_list;
2193 hint->outer_inner = outer_inner;
2195 /* A Leading hint requires at least two relations */
2196 if ( hint->outer_inner == NULL && list_length(hint->relations) < 2)
2198 hint_ereport(hint->base.hint_str,
2199 ("%s hint requires at least two relations.",
2201 hint->base.state = HINT_STATE_ERROR;
2203 else if (hint->outer_inner != NULL &&
2204 !OuterInnerPairCheck(hint->outer_inner))
2206 hint_ereport(hint->base.hint_str,
2207 ("%s hint requires two sets of relations when parentheses nests.",
2209 hint->base.state = HINT_STATE_ERROR;
2216 SetHintParse(SetHint *hint, HintState *hstate, Query *parse, const char *str)
2218 List *name_list = NIL;
2220 if ((str = parse_parentheses(str, &name_list, hint->base.hint_keyword))
2224 hint->words = name_list;
2226 /* We need both name and value to set GUC parameter. */
2227 if (list_length(name_list) == 2)
2229 hint->name = linitial(name_list);
2230 hint->value = lsecond(name_list);
2234 hint_ereport(hint->base.hint_str,
2235 ("%s hint requires name and value of GUC parameter.",
2237 hint->base.state = HINT_STATE_ERROR;
2244 RowsHintParse(RowsHint *hint, HintState *hstate, Query *parse,
2247 HintKeyword hint_keyword = hint->base.hint_keyword;
2248 List *name_list = NIL;
2252 if ((str = parse_parentheses(str, &name_list, hint_keyword)) == NULL)
2255 /* Last element must be rows specification */
2256 hint->nrels = list_length(name_list) - 1;
2258 if (hint->nrels > 0)
2264 * Transform relation names from list to array to sort them with qsort
2267 hint->relnames = palloc(sizeof(char *) * hint->nrels);
2268 foreach (l, name_list)
2270 if (hint->nrels <= i)
2272 hint->relnames[i] = lfirst(l);
2277 /* Retieve rows estimation */
2278 rows_str = list_nth(name_list, hint->nrels);
2279 hint->rows_str = rows_str; /* store as-is for error logging */
2280 if (rows_str[0] == '#')
2282 hint->value_type = RVT_ABSOLUTE;
2285 else if (rows_str[0] == '+')
2287 hint->value_type = RVT_ADD;
2290 else if (rows_str[0] == '-')
2292 hint->value_type = RVT_SUB;
2295 else if (rows_str[0] == '*')
2297 hint->value_type = RVT_MULTI;
2302 hint_ereport(rows_str, ("Unrecognized rows value type notation."));
2303 hint->base.state = HINT_STATE_ERROR;
2306 hint->rows = strtod(rows_str, &end_ptr);
2309 hint_ereport(rows_str,
2310 ("%s hint requires valid number as rows estimation.",
2311 hint->base.keyword));
2312 hint->base.state = HINT_STATE_ERROR;
2316 /* A join hint requires at least two relations */
2317 if (hint->nrels < 2)
2320 ("%s hint requires at least two relations.",
2321 hint->base.keyword));
2322 hint->base.state = HINT_STATE_ERROR;
2326 list_free(name_list);
2328 /* Sort relnames in alphabetical order. */
2329 qsort(hint->relnames, hint->nrels, sizeof(char *), RelnameCmp);
2335 ParallelHintParse(ParallelHint *hint, HintState *hstate, Query *parse,
2338 HintKeyword hint_keyword = hint->base.hint_keyword;
2339 List *name_list = NIL;
2343 bool force_parallel = false;
2345 if ((str = parse_parentheses(str, &name_list, hint_keyword)) == NULL)
2348 /* Parse relation name and index name(s) if given hint accepts. */
2349 length = list_length(name_list);
2351 if (length < 2 || length > 3)
2354 ("Wrong number of arguments for %s hint.",
2355 hint->base.keyword));
2356 hint->base.state = HINT_STATE_ERROR;
2360 hint->relname = linitial(name_list);
2362 /* The second parameter is number of workers */
2363 hint->nworkers_str = list_nth(name_list, 1);
2364 nworkers = strtod(hint->nworkers_str, &end_ptr);
2365 if (*end_ptr || nworkers < 0)
2367 hint_ereport(hint->nworkers_str,
2368 ("number of workers must be a positive integer: %s",
2369 hint->base.keyword));
2370 hint->base.state = HINT_STATE_ERROR;
2374 hint->nworkers = nworkers;
2376 if (nworkers > max_hint_nworkers)
2377 max_hint_nworkers = nworkers;
2379 /* optional third parameter is specified */
2382 const char *modeparam = (const char *)list_nth(name_list, 2);
2383 if (strcasecmp(modeparam, "hard") == 0)
2384 force_parallel = true;
2385 else if (strcasecmp(modeparam, "soft") != 0)
2388 ("The mode of Worker hint must be soft or hard."));
2389 hint->base.state = HINT_STATE_ERROR;
2394 hint->force_parallel = force_parallel;
2400 * set GUC parameter functions
2404 get_current_scan_mask()
2409 mask |= ENABLE_SEQSCAN;
2410 if (enable_indexscan)
2411 mask |= ENABLE_INDEXSCAN;
2412 if (enable_bitmapscan)
2413 mask |= ENABLE_BITMAPSCAN;
2415 mask |= ENABLE_TIDSCAN;
2416 if (enable_indexonlyscan)
2417 mask |= ENABLE_INDEXONLYSCAN;
2423 get_current_join_mask()
2427 if (enable_nestloop)
2428 mask |= ENABLE_NESTLOOP;
2429 if (enable_mergejoin)
2430 mask |= ENABLE_MERGEJOIN;
2431 if (enable_hashjoin)
2432 mask |= ENABLE_HASHJOIN;
2438 * Sets GUC prameters without throwing exception. Reutrns false if something
2442 set_config_option_noerror(const char *name, const char *value,
2443 GucContext context, GucSource source,
2444 GucAction action, bool changeVal, int elevel)
2447 MemoryContext ccxt = CurrentMemoryContext;
2451 result = set_config_option(name, value, context, source,
2452 action, changeVal, 0, false);
2458 /* Save error info */
2459 MemoryContextSwitchTo(ccxt);
2460 errdata = CopyErrorData();
2464 (errcode(errdata->sqlerrcode),
2465 errhidestmt(hidestmt),
2466 errmsg("%s", errdata->message),
2467 errdata->detail ? errdetail("%s", errdata->detail) : 0,
2468 errdata->hint ? errhint("%s", errdata->hint) : 0));
2469 FreeErrorData(errdata);
2477 * Sets GUC parameter of int32 type without throwing exceptions. Returns false
2478 * if something wrong.
2481 set_config_int32_option(const char *name, int32 value, GucContext context)
2483 char buf[16]; /* enough for int32 */
2485 if (snprintf(buf, 16, "%d", value) < 0)
2487 ereport(pg_hint_plan_message_level,
2488 (errmsg ("Cannot set integer value: %d: %s",
2489 max_hint_nworkers, strerror(errno))));
2494 set_config_option_noerror(name, buf, context,
2495 PGC_S_SESSION, GUC_ACTION_SAVE, true,
2496 pg_hint_plan_message_level);
2499 /* setup scan method enforcement according to given options */
2501 setup_guc_enforcement(SetHint **options, int noptions, GucContext context)
2505 for (i = 0; i < noptions; i++)
2507 SetHint *hint = options[i];
2510 if (!hint_state_enabled(hint))
2513 result = set_config_option_noerror(hint->name, hint->value, context,
2514 PGC_S_SESSION, GUC_ACTION_SAVE, true,
2515 pg_hint_plan_message_level);
2517 hint->base.state = HINT_STATE_USED;
2519 hint->base.state = HINT_STATE_ERROR;
2526 * Setup parallel execution environment.
2528 * If hint is not NULL, set up using it, elsewise reset to initial environment.
2531 setup_parallel_plan_enfocement(ParallelHint *hint, HintState *state)
2535 hint->base.state = HINT_STATE_USED;
2536 set_config_int32_option("max_parallel_workers_per_gather",
2537 hint->nworkers, state->context);
2540 set_config_int32_option("max_parallel_workers_per_gather",
2541 state->init_nworkers, state->context);
2543 /* force means that enforce parallel as far as possible */
2544 if (hint && hint->force_parallel)
2546 set_config_int32_option("parallel_tuple_cost", 0, state->context);
2547 set_config_int32_option("parallel_setup_cost", 0, state->context);
2548 set_config_int32_option("min_parallel_relation_size", 0,
2553 set_config_int32_option("parallel_tuple_cost",
2554 state->init_paratup_cost, state->context);
2555 set_config_int32_option("parallel_setup_cost",
2556 state->init_parasetup_cost, state->context);
2557 set_config_int32_option("min_parallel_relation_size",
2558 state->init_min_para_size, state->context);
2562 #define SET_CONFIG_OPTION(name, type_bits) \
2563 set_config_option_noerror((name), \
2564 (mask & (type_bits)) ? "true" : "false", \
2565 context, PGC_S_SESSION, GUC_ACTION_SAVE, true, ERROR)
2569 * Setup GUC environment to enforce scan methods. If scanhint is NULL, reset
2570 * GUCs to the saved state in state.
2573 setup_scan_method_enforcement(ScanMethodHint *scanhint, HintState *state)
2575 unsigned char enforce_mask = state->init_scan_mask;
2576 GucContext context = state->context;
2581 enforce_mask = scanhint->enforce_mask;
2582 scanhint->base.state = HINT_STATE_USED;
2585 if (enforce_mask == ENABLE_SEQSCAN || enforce_mask == ENABLE_INDEXSCAN ||
2586 enforce_mask == ENABLE_BITMAPSCAN || enforce_mask == ENABLE_TIDSCAN
2587 || enforce_mask == (ENABLE_INDEXSCAN | ENABLE_INDEXONLYSCAN)
2589 mask = enforce_mask;
2591 mask = enforce_mask & current_hint_state->init_scan_mask;
2593 SET_CONFIG_OPTION("enable_seqscan", ENABLE_SEQSCAN);
2594 SET_CONFIG_OPTION("enable_indexscan", ENABLE_INDEXSCAN);
2595 SET_CONFIG_OPTION("enable_bitmapscan", ENABLE_BITMAPSCAN);
2596 SET_CONFIG_OPTION("enable_tidscan", ENABLE_TIDSCAN);
2597 SET_CONFIG_OPTION("enable_indexonlyscan", ENABLE_INDEXONLYSCAN);
2601 set_join_config_options(unsigned char enforce_mask, GucContext context)
2605 if (enforce_mask == ENABLE_NESTLOOP || enforce_mask == ENABLE_MERGEJOIN ||
2606 enforce_mask == ENABLE_HASHJOIN)
2607 mask = enforce_mask;
2609 mask = enforce_mask & current_hint_state->init_join_mask;
2611 SET_CONFIG_OPTION("enable_nestloop", ENABLE_NESTLOOP);
2612 SET_CONFIG_OPTION("enable_mergejoin", ENABLE_MERGEJOIN);
2613 SET_CONFIG_OPTION("enable_hashjoin", ENABLE_HASHJOIN);
2617 * pg_hint_plan hook functions
2621 pg_hint_plan_ProcessUtility(Node *parsetree, const char *queryString,
2622 ProcessUtilityContext context,
2623 ParamListInfo params,
2624 DestReceiver *dest, char *completionTag)
2629 * Use standard planner if pg_hint_plan is disabled or current nesting
2630 * depth is nesting depth of SPI calls.
2632 if (!pg_hint_plan_enable_hint || hint_inhibit_level > 0)
2634 if (debug_level > 1)
2635 ereport(pg_hint_plan_message_level,
2636 (errmsg ("pg_hint_plan: ProcessUtility:"
2637 " pg_hint_plan.enable_hint = off")));
2638 if (prev_ProcessUtility)
2639 (*prev_ProcessUtility) (parsetree, queryString,
2641 dest, completionTag);
2643 standard_ProcessUtility(parsetree, queryString,
2645 dest, completionTag);
2650 if (IsA(node, ExplainStmt))
2653 * Draw out parse tree of actual query from Query struct of EXPLAIN
2659 stmt = (ExplainStmt *) node;
2661 Assert(IsA(stmt->query, Query));
2662 query = (Query *) stmt->query;
2664 if (query->commandType == CMD_UTILITY && query->utilityStmt != NULL)
2665 node = query->utilityStmt;
2669 * If the query was a EXECUTE or CREATE TABLE AS EXECUTE, get query string
2670 * specified to preceding PREPARE command to use it as source of hints.
2672 if (IsA(node, ExecuteStmt))
2676 stmt = (ExecuteStmt *) node;
2677 stmt_name = stmt->name;
2681 * CREATE AS EXECUTE behavior has changed since 9.2, so we must handle it
2684 if (IsA(node, CreateTableAsStmt))
2686 CreateTableAsStmt *stmt;
2689 stmt = (CreateTableAsStmt *) node;
2690 Assert(IsA(stmt->query, Query));
2691 query = (Query *) stmt->query;
2693 if (query->commandType == CMD_UTILITY &&
2694 IsA(query->utilityStmt, ExecuteStmt))
2696 ExecuteStmt *estmt = (ExecuteStmt *) query->utilityStmt;
2697 stmt_name = estmt->name;
2703 if (debug_level > 1)
2704 ereport(pg_hint_plan_message_level,
2705 (errmsg ("pg_hint_plan: ProcessUtility:"
2706 " stmt_name = \"%s\", statement=\"%s\"",
2707 stmt_name, queryString)));
2711 if (prev_ProcessUtility)
2712 (*prev_ProcessUtility) (parsetree, queryString,
2714 dest, completionTag);
2716 standard_ProcessUtility(parsetree, queryString,
2718 dest, completionTag);
2732 if (prev_ProcessUtility)
2733 (*prev_ProcessUtility) (parsetree, queryString,
2735 dest, completionTag);
2737 standard_ProcessUtility(parsetree, queryString,
2739 dest, completionTag);
2743 * Push a hint into hint stack which is implemented with List struct. Head of
2744 * list is top of stack.
2747 push_hint(HintState *hstate)
2749 /* Prepend new hint to the list means pushing to stack. */
2750 HintStateStack = lcons(hstate, HintStateStack);
2752 /* Pushed hint is the one which should be used hereafter. */
2753 current_hint_state = hstate;
2756 /* Pop a hint from hint stack. Popped hint is automatically discarded. */
2760 /* Hint stack must not be empty. */
2761 if(HintStateStack == NIL)
2762 elog(ERROR, "hint stack is empty");
2765 * Take a hint at the head from the list, and free it. Switch
2766 * current_hint_state to point new head (NULL if the list is empty).
2768 HintStateStack = list_delete_first(HintStateStack);
2769 HintStateDelete(current_hint_state);
2770 if(HintStateStack == NIL)
2771 current_hint_state = NULL;
2773 current_hint_state = (HintState *) lfirst(list_head(HintStateStack));
2776 static PlannedStmt *
2777 pg_hint_plan_planner(Query *parse, int cursorOptions, ParamListInfo boundParams)
2779 const char *hints = NULL;
2782 pgssJumbleState jstate;
2785 PlannedStmt *result;
2791 if (debug_level > 1)
2792 snprintf(qnostr, sizeof(qnostr), "[qno=0x%x]", qno++);
2796 * Use standard planner if pg_hint_plan is disabled or current nesting
2797 * depth is nesting depth of SPI calls. Other hook functions try to change
2798 * plan with current_hint_state if any, so set it to NULL.
2800 if (!pg_hint_plan_enable_hint || hint_inhibit_level > 0)
2802 if (debug_level > 1)
2803 elog(pg_hint_plan_message_level,
2804 "pg_hint_plan%s: planner: enable_hint=%d,"
2805 " hint_inhibit_level=%d",
2806 qnostr, pg_hint_plan_enable_hint, hint_inhibit_level);
2809 goto standard_planner_proc;
2812 /* Create hint struct from client-supplied query string. */
2813 query = get_query_string();
2816 * Create hintstate from hint specified for the query, if any.
2818 * First we lookup hint in pg_hint.hints table by normalized query string,
2819 * unless pg_hint_plan.enable_hint_table is OFF.
2820 * This parameter provides option to avoid overhead of table lookup during
2823 * If no hint was found, then we try to get hint from special query comment.
2825 if (pg_hint_plan_enable_hint_table)
2828 * Search hint information which is stored for the query and the
2829 * application. Query string is normalized before using in condition
2830 * in order to allow fuzzy matching.
2832 * XXX: normalizing code is copied from pg_stat_statements.c, so be
2833 * careful when supporting PostgreSQL's version up.
2835 jstate.jumble = (unsigned char *) palloc(JUMBLE_SIZE);
2836 jstate.jumble_len = 0;
2837 jstate.clocations_buf_size = 32;
2838 jstate.clocations = (pgssLocationLen *)
2839 palloc(jstate.clocations_buf_size * sizeof(pgssLocationLen));
2840 jstate.clocations_count = 0;
2841 JumbleQuery(&jstate, parse);
2843 * generate_normalized_query() copies exact given query_len bytes, so we
2844 * add 1 byte for null-termination here. As comments on
2845 * generate_normalized_query says, generate_normalized_query doesn't
2846 * take care of null-terminate, but additional 1 byte ensures that '\0'
2847 * byte in the source buffer to be copied into norm_query.
2849 query_len = strlen(query) + 1;
2850 norm_query = generate_normalized_query(&jstate,
2853 GetDatabaseEncoding());
2854 hints = get_hints_from_table(norm_query, application_name);
2855 if (debug_level > 1)
2858 snprintf(msgstr, 1024, "hints from table: \"%s\":"
2859 " normalzed_query=\"%s\", application name =\"%s\"",
2860 hints, norm_query, application_name);
2863 ereport(pg_hint_plan_message_level,
2864 (errhidestmt(hidestmt),
2865 errmsg("pg_hint_plan%s:"
2866 " no match found in table:"
2867 " application name = \"%s\","
2868 " normalzed_query=\"%s\"",
2869 qnostr, application_name, norm_query)));
2876 hints = get_hints_from_comment(query);
2878 if (debug_level > 1)
2880 snprintf(msgstr, 1024, "hints in comment=\"%s\"",
2881 hints ? hints : "(none)");
2882 if (debug_level > 2 ||
2883 stmt_name || strcmp(query, debug_query_string))
2884 snprintf(msgstr + strlen(msgstr), 1024- strlen(msgstr),
2885 ", stmt=\"%s\", query=\"%s\", debug_query_string=\"%s\"",
2886 stmt_name, query, debug_query_string);
2890 hstate = create_hintstate(parse, hints);
2893 * Use standard planner if the statement has not valid hint. Other hook
2894 * functions try to change plan with current_hint_state if any, so set it
2898 goto standard_planner_proc;
2901 * Push new hint struct to the hint stack to disable previous hint context.
2905 /* Set scan enforcement here. */
2906 save_nestlevel = NewGUCNestLevel();
2908 /* Apply Set hints, then save it as the initial state */
2909 setup_guc_enforcement(current_hint_state->set_hints,
2910 current_hint_state->num_hints[HINT_TYPE_SET],
2911 current_hint_state->context);
2913 current_hint_state->init_scan_mask = get_current_scan_mask();
2914 current_hint_state->init_join_mask = get_current_join_mask();
2915 current_hint_state->init_min_para_size = min_parallel_relation_size;
2916 current_hint_state->init_paratup_cost = parallel_tuple_cost;
2917 current_hint_state->init_parasetup_cost = parallel_setup_cost;
2920 * max_parallel_workers_per_gather should be non-zero here if Workers hint
2923 if (max_hint_nworkers >= 0)
2925 current_hint_state->init_nworkers = 0;
2926 set_config_int32_option("max_parallel_workers_per_gather",
2927 1, current_hint_state->context);
2930 if (debug_level > 1)
2932 ereport(pg_hint_plan_message_level,
2933 (errhidestmt(hidestmt),
2934 errmsg("pg_hint_plan%s: planner: %s",
2940 * Use PG_TRY mechanism to recover GUC parameters and current_hint_state to
2941 * the state when this planner started when error occurred in planner.
2946 result = (*prev_planner) (parse, cursorOptions, boundParams);
2948 result = standard_planner(parse, cursorOptions, boundParams);
2953 * Rollback changes of GUC parameters, and pop current hint context
2954 * from hint stack to rewind the state.
2956 AtEOXact_GUC(true, save_nestlevel);
2962 /* Print hint in debug mode. */
2963 if (debug_level == 1)
2964 HintStateDump(current_hint_state);
2965 else if (debug_level > 1)
2966 HintStateDump2(current_hint_state);
2969 * Rollback changes of GUC parameters, and pop current hint context from
2970 * hint stack to rewind the state.
2972 AtEOXact_GUC(true, save_nestlevel);
2977 standard_planner_proc:
2978 if (debug_level > 1)
2980 ereport(pg_hint_plan_message_level,
2981 (errhidestmt(hidestmt),
2982 errmsg("pg_hint_plan%s: planner: no valid hint (%s)",
2986 current_hint_state = NULL;
2988 return (*prev_planner) (parse, cursorOptions, boundParams);
2990 return standard_planner(parse, cursorOptions, boundParams);
2994 * Find scan method hint to be applied to the given relation
2996 static ScanMethodHint *
2997 find_scan_hint(PlannerInfo *root, Index relid, RelOptInfo *rel)
3003 * We don't apply scan method hint if the relation is:
3004 * - not a base relation
3005 * - not an ordinary relation (such as join and subquery)
3007 if (rel && (rel->reloptkind != RELOPT_BASEREL ||
3008 rel->rtekind != RTE_RELATION))
3011 rte = root->simple_rte_array[relid];
3013 /* We don't force scan method of foreign tables */
3014 if (rte->relkind == RELKIND_FOREIGN_TABLE)
3017 /* Find scan method hint, which matches given names, from the list. */
3018 for (i = 0; i < current_hint_state->num_hints[HINT_TYPE_SCAN_METHOD]; i++)
3020 ScanMethodHint *hint = current_hint_state->scan_hints[i];
3022 /* We ignore disabled hints. */
3023 if (!hint_state_enabled(hint))
3026 if (RelnameCmp(&rte->eref->aliasname, &hint->relname) == 0)
3033 static ParallelHint *
3034 find_parallel_hint(PlannerInfo *root, Index relid, RelOptInfo *rel)
3040 * We don't apply scan method hint if the relation is:
3041 * - not a base relation and inheritance children
3042 * - not an ordinary relation (such as join and subquery)
3044 if (rel && ((rel->reloptkind != RELOPT_BASEREL &&
3045 rel->reloptkind != RELOPT_OTHER_MEMBER_REL) ||
3046 rel->rtekind != RTE_RELATION))
3049 rte = root->simple_rte_array[relid];
3051 /* We can't force scan method of foreign tables */
3052 if (rte->relkind == RELKIND_FOREIGN_TABLE)
3055 /* Find scan method hint, which matches given names, from the list. */
3056 for (i = 0; i < current_hint_state->num_hints[HINT_TYPE_PARALLEL]; i++)
3058 ParallelHint *hint = current_hint_state->parallel_hints[i];
3060 /* We ignore disabled hints. */
3061 if (!hint_state_enabled(hint))
3064 if (RelnameCmp(&rte->eref->aliasname, &hint->relname) == 0)
3074 * Returns TRUE on match, FALSE on no match.
3076 * s1 --- the data to match against
3077 * s2 --- the pattern
3079 * Because we copy s1 to NameData, make the size of s1 less than NAMEDATALEN.
3082 regexpeq(const char *s1, const char *s2)
3088 strcpy(name.data, s1);
3089 regexp = cstring_to_text(s2);
3091 result = DirectFunctionCall2Coll(nameregexeq,
3092 DEFAULT_COLLATION_OID,
3093 NameGetDatum(&name),
3094 PointerGetDatum(regexp));
3095 return DatumGetBool(result);
3099 delete_indexes(ScanMethodHint *hint, RelOptInfo *rel, Oid relationObjectId)
3107 * We delete all the IndexOptInfo list and prevent you from being usable by
3110 if (hint->enforce_mask == ENABLE_SEQSCAN ||
3111 hint->enforce_mask == ENABLE_TIDSCAN)
3113 list_free_deep(rel->indexlist);
3114 rel->indexlist = NIL;
3115 hint->base.state = HINT_STATE_USED;
3121 * When a list of indexes is not specified, we just use all indexes.
3123 if (hint->indexnames == NIL)
3127 * Leaving only an specified index, we delete it from a IndexOptInfo list
3131 if (debug_level > 0)
3132 initStringInfo(&buf);
3134 for (cell = list_head(rel->indexlist); cell; cell = next)
3136 IndexOptInfo *info = (IndexOptInfo *) lfirst(cell);
3137 char *indexname = get_rel_name(info->indexoid);
3139 bool use_index = false;
3143 foreach(l, hint->indexnames)
3145 char *hintname = (char *) lfirst(l);
3149 result = regexpeq(indexname, hintname);
3151 result = RelnameCmp(&indexname, &hintname) == 0;
3156 if (debug_level > 0)
3158 appendStringInfoCharMacro(&buf, ' ');
3159 quote_value(&buf, indexname);
3167 * to make the index a candidate when definition of this index is
3168 * matched with the index's definition of current_hint_state.
3170 if (OidIsValid(relationObjectId) && !use_index)
3172 foreach(l, current_hint_state->parent_index_infos)
3176 ParentIndexInfo *p_info = (ParentIndexInfo *)lfirst(l);
3178 /* check to match the parameter of unique */
3179 if (p_info->indisunique != info->unique)
3182 /* check to match the parameter of index's method */
3183 if (p_info->method != info->relam)
3186 /* to check to match the indexkey's configuration */
3187 if ((list_length(p_info->column_names)) !=
3191 /* check to match the indexkey's configuration */
3192 for (i = 0; i < info->ncolumns; i++)
3194 char *c_attname = NULL;
3195 char *p_attname = NULL;
3198 list_nth(p_info->column_names, i);
3200 /* both are expressions */
3201 if (info->indexkeys[i] == 0 && !p_attname)
3204 /* one's column is expression, the other is not */
3205 if (info->indexkeys[i] == 0 || !p_attname)
3208 c_attname = get_attname(relationObjectId,
3209 info->indexkeys[i]);
3211 if (strcmp(p_attname, c_attname) != 0)
3214 if (p_info->indcollation[i] != info->indexcollations[i])
3217 if (p_info->opclass[i] != info->opcintype[i])
3220 if (((p_info->indoption[i] & INDOPTION_DESC) != 0) !=
3221 info->reverse_sort[i])
3224 if (((p_info->indoption[i] & INDOPTION_NULLS_FIRST) != 0) !=
3225 info->nulls_first[i])
3230 if (i != info->ncolumns)
3233 if ((p_info->expression_str && (info->indexprs != NIL)) ||
3234 (p_info->indpred_str && (info->indpred != NIL)))
3237 * Fetch the pg_index tuple by the Oid of the index
3239 ht_idx = SearchSysCache1(INDEXRELID,
3240 ObjectIdGetDatum(info->indexoid));
3242 /* check to match the expression's parameter of index */
3243 if (p_info->expression_str &&
3244 !heap_attisnull(ht_idx, Anum_pg_index_indexprs))
3251 * to change the expression's parameter of child's
3254 exprsDatum = SysCacheGetAttr(INDEXRELID, ht_idx,
3255 Anum_pg_index_indexprs,
3258 result = DirectFunctionCall2(pg_get_expr,
3263 if (strcmp(p_info->expression_str,
3264 text_to_cstring(DatumGetTextP(result))) != 0)
3267 ReleaseSysCache(ht_idx);
3273 /* Check to match the predicate's parameter of index */
3274 if (p_info->indpred_str &&
3275 !heap_attisnull(ht_idx, Anum_pg_index_indpred))
3282 * to change the predicate's parameter of child's
3285 predDatum = SysCacheGetAttr(INDEXRELID, ht_idx,
3286 Anum_pg_index_indpred,
3289 result = DirectFunctionCall2(pg_get_expr,
3294 if (strcmp(p_info->indpred_str,
3295 text_to_cstring(DatumGetTextP(result))) != 0)
3298 ReleaseSysCache(ht_idx);
3305 ReleaseSysCache(ht_idx);
3307 else if (p_info->expression_str || (info->indexprs != NIL))
3309 else if (p_info->indpred_str || (info->indpred != NIL))
3314 /* to log the candidate of index */
3315 if (debug_level > 0)
3317 appendStringInfoCharMacro(&buf, ' ');
3318 quote_value(&buf, indexname);
3326 rel->indexlist = list_delete_cell(rel->indexlist, cell, prev);
3333 if (debug_level == 1)
3336 StringInfoData rel_buf;
3338 if (OidIsValid(relationObjectId))
3339 relname = get_rel_name(relationObjectId);
3341 relname = hint->relname;
3343 initStringInfo(&rel_buf);
3344 quote_value(&rel_buf, relname);
3347 (errmsg("available indexes for %s(%s):%s",
3352 pfree(rel_buf.data);
3357 * Return information of index definition.
3359 static ParentIndexInfo *
3360 get_parent_index_info(Oid indexoid, Oid relid)
3362 ParentIndexInfo *p_info = palloc(sizeof(ParentIndexInfo));
3363 Relation indexRelation;
3364 Form_pg_index index;
3368 indexRelation = index_open(indexoid, RowExclusiveLock);
3370 index = indexRelation->rd_index;
3372 p_info->indisunique = index->indisunique;
3373 p_info->method = indexRelation->rd_rel->relam;
3375 p_info->column_names = NIL;
3376 p_info->indcollation = (Oid *) palloc(sizeof(Oid) * index->indnatts);
3377 p_info->opclass = (Oid *) palloc(sizeof(Oid) * index->indnatts);
3378 p_info->indoption = (int16 *) palloc(sizeof(Oid) * index->indnatts);
3380 for (i = 0; i < index->indnatts; i++)
3382 attname = get_attname(relid, index->indkey.values[i]);
3383 p_info->column_names = lappend(p_info->column_names, attname);
3385 p_info->indcollation[i] = indexRelation->rd_indcollation[i];
3386 p_info->opclass[i] = indexRelation->rd_opcintype[i];
3387 p_info->indoption[i] = indexRelation->rd_indoption[i];
3391 * to check to match the expression's parameter of index with child indexes
3393 p_info->expression_str = NULL;
3394 if(!heap_attisnull(indexRelation->rd_indextuple, Anum_pg_index_indexprs))
3400 exprsDatum = SysCacheGetAttr(INDEXRELID, indexRelation->rd_indextuple,
3401 Anum_pg_index_indexprs, &isnull);
3403 result = DirectFunctionCall2(pg_get_expr,
3405 ObjectIdGetDatum(relid));
3407 p_info->expression_str = text_to_cstring(DatumGetTextP(result));
3411 * to check to match the predicate's parameter of index with child indexes
3413 p_info->indpred_str = NULL;
3414 if(!heap_attisnull(indexRelation->rd_indextuple, Anum_pg_index_indpred))
3420 predDatum = SysCacheGetAttr(INDEXRELID, indexRelation->rd_indextuple,
3421 Anum_pg_index_indpred, &isnull);
3423 result = DirectFunctionCall2(pg_get_expr,
3425 ObjectIdGetDatum(relid));
3427 p_info->indpred_str = text_to_cstring(DatumGetTextP(result));
3430 index_close(indexRelation, NoLock);
3436 * Set planner guc parameters according to corresponding scan hints.
3439 setup_hint_enforcement(PlannerInfo *root, Oid relationObjectId,
3440 bool inhparent, RelOptInfo *rel)
3442 Index new_parent_relid = 0;
3444 ScanMethodHint *scanhint = NULL;
3447 * We could register the parent relation of the following children here
3448 * when inhparent == true but inheritnce planner doesn't call this function
3449 * for parents. Since we cannot distinguish who called this function we
3450 * cannot do other than always seeking the parent regardless of who called
3455 if (debug_level > 1)
3456 ereport(pg_hint_plan_message_level,
3458 errmsg ("pg_hint_plan%s: get_relation_info"
3459 " skipping inh parent: relation=%u(%s), inhparent=%d,"
3460 " current_hint_state=%p, hint_inhibit_level=%d",
3461 qnostr, relationObjectId,
3462 get_rel_name(relationObjectId),
3463 inhparent, current_hint_state, hint_inhibit_level)));
3467 /* Find the parent for this relation other than the registered parent */
3468 foreach (l, root->append_rel_list)
3470 AppendRelInfo *appinfo = (AppendRelInfo *) lfirst(l);
3472 if (appinfo->child_relid == rel->relid)
3474 if (current_hint_state->parent_relid != appinfo->parent_relid)
3475 new_parent_relid = appinfo->parent_relid;
3482 /* This relation doesn't have a parent. Cancel current_hint_state. */
3483 current_hint_state->parent_relid = 0;
3484 current_hint_state->parent_scan_hint = NULL;
3485 current_hint_state->parent_parallel_hint = NULL;
3488 if (new_parent_relid > 0)
3491 * Here we found a new parent for the current relation. Scan continues
3492 * hint to other childrens of this parent so remember it * to avoid
3493 * hinthintredundant setup cost.
3495 ScanMethodHint *parent_scan_hint = NULL;
3496 ParallelHint *parent_parallel_hint = NULL;
3498 current_hint_state->parent_relid = new_parent_relid;
3500 /* Find hints for the parent */
3501 current_hint_state->parent_scan_hint = parent_scan_hint =
3502 find_scan_hint(root, current_hint_state->parent_relid, NULL);
3504 current_hint_state->parent_parallel_hint = parent_parallel_hint =
3505 find_parallel_hint(root, current_hint_state->parent_relid, NULL);
3507 if (parent_scan_hint)
3510 * If hint is found for the parent, apply it for this child instead
3513 parent_scan_hint->base.state = HINT_STATE_USED;
3515 /* Apply index mask in the same manner to the parent. */
3516 if (parent_scan_hint->indexnames)
3519 Relation parent_rel;
3522 root->simple_rte_array[current_hint_state->parent_relid]->relid;
3523 parent_rel = heap_open(parentrel_oid, NoLock);
3525 /* Search the parent relation for indexes match the hint spec */
3526 foreach(l, RelationGetIndexList(parent_rel))
3528 Oid indexoid = lfirst_oid(l);
3529 char *indexname = get_rel_name(indexoid);
3531 ParentIndexInfo *parent_index_info;
3533 foreach(lc, parent_scan_hint->indexnames)
3535 if (RelnameCmp(&indexname, &lfirst(lc)) == 0)
3542 get_parent_index_info(indexoid, parentrel_oid);
3543 current_hint_state->parent_index_infos =
3544 lappend(current_hint_state->parent_index_infos, parent_index_info);
3546 heap_close(parent_rel, NoLock);
3550 /* Setup planner environment */
3551 setup_scan_method_enforcement(parent_scan_hint, current_hint_state);
3552 setup_parallel_plan_enfocement(
3553 find_parallel_hint(root, rel->relid, rel), current_hint_state);
3556 /* Process index restriction hint inheritance */
3557 if (current_hint_state->parent_scan_hint != 0)
3559 delete_indexes(current_hint_state->parent_scan_hint, rel,
3562 /* Scan fixation status is the same to the parent. */
3563 if (debug_level > 1)
3564 ereport(pg_hint_plan_message_level,
3566 errmsg("pg_hint_plan%s: get_relation_info:"
3567 " index deletion by parent hint: "
3568 "relation=%u(%s), inhparent=%d, current_hint_state=%p,"
3569 " hint_inhibit_level=%d",
3570 qnostr, relationObjectId,
3571 get_rel_name(relationObjectId),
3572 inhparent, current_hint_state, hint_inhibit_level)));
3576 /* This table doesn't have a parent hint. Apply its own hint if any. */
3577 if ((scanhint = find_scan_hint(root, rel->relid, rel)) != NULL)
3579 setup_scan_method_enforcement(scanhint, current_hint_state);
3581 delete_indexes(scanhint, rel, InvalidOid);
3583 if (debug_level > 1)
3584 ereport(pg_hint_plan_message_level,
3586 errmsg ("pg_hint_plan%s: get_relation_info"
3588 " relation=%u(%s), inhparent=%d, current_hint=%p,"
3589 " hint_inhibit_level=%d, scanmask=0x%x",
3590 qnostr, relationObjectId,
3591 get_rel_name(relationObjectId),
3592 inhparent, current_hint_state, hint_inhibit_level,
3593 scanhint->enforce_mask)));
3597 /* Do the same for parallel plan enforcement */
3598 setup_parallel_plan_enfocement(find_parallel_hint(root, rel->relid, rel),
3599 current_hint_state);
3601 /* Nothing to apply. Reset the scan mask to intial state */
3602 if (debug_level > 1)
3603 ereport(pg_hint_plan_message_level,
3604 (errhidestmt (true),
3605 errmsg ("pg_hint_plan%s: get_relation_info"
3607 " relation=%u(%s), inhparent=%d, current_hint=%p,"
3608 " hint_inhibit_level=%d, scanmask=0x%x",
3609 qnostr, relationObjectId,
3610 get_rel_name(relationObjectId),
3611 inhparent, current_hint_state, hint_inhibit_level,
3612 current_hint_state->init_scan_mask)));
3613 setup_scan_method_enforcement(NULL, current_hint_state);
3617 pg_hint_plan_get_relation_info(PlannerInfo *root, Oid relationObjectId,
3618 bool inhparent, RelOptInfo *rel)
3620 if (prev_get_relation_info)
3621 (*prev_get_relation_info) (root, relationObjectId, inhparent, rel);
3624 * Do nothing if we don't have a valid hint in this context or current
3625 * nesting depth is at SPI calls.
3627 if (!current_hint_state || hint_inhibit_level > 0)
3629 if (debug_level > 1)
3630 ereport(pg_hint_plan_message_level,
3631 (errhidestmt (true),
3632 errmsg ("pg_hint_plan%s: get_relation_info"
3633 " no hint to apply: relation=%u(%s), inhparent=%d,"
3634 " current_hint_state=%p, hint_inhibit_level=%d",
3635 qnostr, relationObjectId,
3636 get_rel_name(relationObjectId),
3637 inhparent, current_hint_state, hint_inhibit_level)));
3641 setup_hint_enforcement(root, relationObjectId, inhparent, rel);
3647 * Return index of relation which matches given aliasname, or 0 if not found.
3648 * If same aliasname was used multiple times in a query, return -1.
3651 find_relid_aliasname(PlannerInfo *root, char *aliasname, List *initial_rels,
3657 for (i = 1; i < root->simple_rel_array_size; i++)
3661 if (root->simple_rel_array[i] == NULL)
3664 Assert(i == root->simple_rel_array[i]->relid);
3666 if (RelnameCmp(&aliasname,
3667 &root->simple_rte_array[i]->eref->aliasname) != 0)
3670 foreach(l, initial_rels)
3672 RelOptInfo *rel = (RelOptInfo *) lfirst(l);
3674 if (rel->reloptkind == RELOPT_BASEREL)
3676 if (rel->relid != i)
3681 Assert(rel->reloptkind == RELOPT_JOINREL);
3683 if (!bms_is_member(i, rel->relids))
3690 ("Relation name \"%s\" is ambiguous.",
3705 * Return join hint which matches given joinrelids.
3707 static JoinMethodHint *
3708 find_join_hint(Relids joinrelids)
3713 join_hint = current_hint_state->join_hint_level[bms_num_members(joinrelids)];
3715 foreach(l, join_hint)
3717 JoinMethodHint *hint = (JoinMethodHint *) lfirst(l);
3719 if (bms_equal(joinrelids, hint->joinrelids))
3727 OuterInnerJoinCreate(OuterInnerRels *outer_inner, LeadingHint *leading_hint,
3728 PlannerInfo *root, List *initial_rels, HintState *hstate, int nbaserel)
3730 OuterInnerRels *outer_rels;
3731 OuterInnerRels *inner_rels;
3732 Relids outer_relids;
3733 Relids inner_relids;
3735 JoinMethodHint *hint;
3737 if (outer_inner->relation != NULL)
3739 return bms_make_singleton(
3740 find_relid_aliasname(root, outer_inner->relation,
3742 leading_hint->base.hint_str));
3745 outer_rels = lfirst(outer_inner->outer_inner_pair->head);
3746 inner_rels = lfirst(outer_inner->outer_inner_pair->tail);
3748 outer_relids = OuterInnerJoinCreate(outer_rels,
3754 inner_relids = OuterInnerJoinCreate(inner_rels,
3761 join_relids = bms_add_members(outer_relids, inner_relids);
3763 if (bms_num_members(join_relids) > nbaserel)
3767 * If we don't have join method hint, create new one for the
3768 * join combination with all join methods are enabled.
3770 hint = find_join_hint(join_relids);
3774 * Here relnames is not set, since Relids bitmap is sufficient to
3775 * control paths of this query afterward.
3777 hint = (JoinMethodHint *) JoinMethodHintCreate(
3778 leading_hint->base.hint_str,
3780 HINT_KEYWORD_LEADING);
3781 hint->base.state = HINT_STATE_USED;
3782 hint->nrels = bms_num_members(join_relids);
3783 hint->enforce_mask = ENABLE_ALL_JOIN;
3784 hint->joinrelids = bms_copy(join_relids);
3785 hint->inner_nrels = bms_num_members(inner_relids);
3786 hint->inner_joinrelids = bms_copy(inner_relids);
3788 hstate->join_hint_level[hint->nrels] =
3789 lappend(hstate->join_hint_level[hint->nrels], hint);
3793 hint->inner_nrels = bms_num_members(inner_relids);
3794 hint->inner_joinrelids = bms_copy(inner_relids);
3801 create_bms_of_relids(Hint *base, PlannerInfo *root, List *initial_rels,
3802 int nrels, char **relnames)
3805 Relids relids = NULL;
3809 for (j = 0; j < nrels; j++)
3811 relname = relnames[j];
3813 relid = find_relid_aliasname(root, relname, initial_rels,
3817 base->state = HINT_STATE_ERROR;
3820 * the aliasname is not found(relid == 0) or same aliasname was used
3821 * multiple times in a query(relid == -1)
3828 if (bms_is_member(relid, relids))
3830 hint_ereport(base->hint_str,
3831 ("Relation name \"%s\" is duplicated.", relname));
3832 base->state = HINT_STATE_ERROR;
3836 relids = bms_add_member(relids, relid);
3841 * Transform join method hint into handy form.
3843 * - create bitmap of relids from alias names, to make it easier to check
3844 * whether a join path matches a join method hint.
3845 * - add join method hints which are necessary to enforce join order
3846 * specified by Leading hint
3849 transform_join_hints(HintState *hstate, PlannerInfo *root, int nbaserel,
3850 List *initial_rels, JoinMethodHint **join_method_hints)
3858 LeadingHint *lhint = NULL;
3861 * Create bitmap of relids from alias names for each join method hint.
3862 * Bitmaps are more handy than strings in join searching.
3864 for (i = 0; i < hstate->num_hints[HINT_TYPE_JOIN_METHOD]; i++)
3866 JoinMethodHint *hint = hstate->join_hints[i];
3868 if (!hint_state_enabled(hint) || hint->nrels > nbaserel)
3871 hint->joinrelids = create_bms_of_relids(&(hint->base), root,
3872 initial_rels, hint->nrels, hint->relnames);
3874 if (hint->joinrelids == NULL || hint->base.state == HINT_STATE_ERROR)
3877 hstate->join_hint_level[hint->nrels] =
3878 lappend(hstate->join_hint_level[hint->nrels], hint);
3882 * Create bitmap of relids from alias names for each rows hint.
3883 * Bitmaps are more handy than strings in join searching.
3885 for (i = 0; i < hstate->num_hints[HINT_TYPE_ROWS]; i++)
3887 RowsHint *hint = hstate->rows_hints[i];
3889 if (!hint_state_enabled(hint) || hint->nrels > nbaserel)
3892 hint->joinrelids = create_bms_of_relids(&(hint->base), root,
3893 initial_rels, hint->nrels, hint->relnames);
3896 /* Do nothing if no Leading hint was supplied. */
3897 if (hstate->num_hints[HINT_TYPE_LEADING] == 0)
3901 * Decide whether to use Leading hint
3903 for (i = 0; i < hstate->num_hints[HINT_TYPE_LEADING]; i++)
3905 LeadingHint *leading_hint = (LeadingHint *)hstate->leading_hint[i];
3908 if (leading_hint->base.state == HINT_STATE_ERROR)
3914 foreach(l, leading_hint->relations)
3916 relname = (char *)lfirst(l);;
3918 relid = find_relid_aliasname(root, relname, initial_rels,
3919 leading_hint->base.hint_str);
3921 leading_hint->base.state = HINT_STATE_ERROR;
3926 if (bms_is_member(relid, relids))
3928 hint_ereport(leading_hint->base.hint_str,
3929 ("Relation name \"%s\" is duplicated.", relname));
3930 leading_hint->base.state = HINT_STATE_ERROR;
3934 relids = bms_add_member(relids, relid);
3937 if (relid <= 0 || leading_hint->base.state == HINT_STATE_ERROR)
3942 hint_ereport(lhint->base.hint_str,
3943 ("Conflict %s hint.", HintTypeName[lhint->base.type]));
3944 lhint->base.state = HINT_STATE_DUPLICATION;
3946 leading_hint->base.state = HINT_STATE_USED;
3947 lhint = leading_hint;
3950 /* check to exist Leading hint marked with 'used'. */
3955 * We need join method hints which fit specified join order in every join
3956 * level. For example, Leading(A B C) virtually requires following join
3957 * method hints, if no join method hint supplied:
3959 * - level 2: NestLoop(A B), MergeJoin(A B), HashJoin(A B)
3960 * - level 3: NestLoop(A B C), MergeJoin(A B C), HashJoin(A B C)
3962 * If we already have join method hint which fits specified join order in
3963 * that join level, we leave it as-is and don't add new hints.
3967 if (lhint->outer_inner == NULL)
3969 foreach(l, lhint->relations)
3971 JoinMethodHint *hint;
3973 relname = (char *)lfirst(l);
3976 * Find relid of the relation which has given name. If we have the
3977 * name given in Leading hint multiple times in the join, nothing to
3980 relid = find_relid_aliasname(root, relname, initial_rels,
3983 /* Create bitmap of relids for current join level. */
3984 joinrelids = bms_add_member(joinrelids, relid);
3987 /* We never have join method hint for single relation. */
3992 * If we don't have join method hint, create new one for the
3993 * join combination with all join methods are enabled.
3995 hint = find_join_hint(joinrelids);
3999 * Here relnames is not set, since Relids bitmap is sufficient
4000 * to control paths of this query afterward.
4002 hint = (JoinMethodHint *) JoinMethodHintCreate(
4003 lhint->base.hint_str,
4005 HINT_KEYWORD_LEADING);
4006 hint->base.state = HINT_STATE_USED;
4007 hint->nrels = njoinrels;
4008 hint->enforce_mask = ENABLE_ALL_JOIN;
4009 hint->joinrelids = bms_copy(joinrelids);
4012 join_method_hints[njoinrels] = hint;
4014 if (njoinrels >= nbaserel)
4017 bms_free(joinrelids);
4023 * Delete all join hints which have different combination from Leading
4026 for (i = 2; i <= njoinrels; i++)
4028 list_free(hstate->join_hint_level[i]);
4030 hstate->join_hint_level[i] = lappend(NIL, join_method_hints[i]);
4035 joinrelids = OuterInnerJoinCreate(lhint->outer_inner,
4042 njoinrels = bms_num_members(joinrelids);
4043 Assert(njoinrels >= 2);
4046 * Delete all join hints which have different combination from Leading
4049 for (i = 2;i <= njoinrels; i++)
4051 if (hstate->join_hint_level[i] != NIL)
4053 ListCell *prev = NULL;
4054 ListCell *next = NULL;
4055 for(l = list_head(hstate->join_hint_level[i]); l; l = next)
4058 JoinMethodHint *hint = (JoinMethodHint *)lfirst(l);
4062 if (hint->inner_nrels == 0 &&
4063 !(bms_intersect(hint->joinrelids, joinrelids) == NULL ||
4064 bms_equal(bms_union(hint->joinrelids, joinrelids),
4067 hstate->join_hint_level[i] =
4068 list_delete_cell(hstate->join_hint_level[i], l,
4077 bms_free(joinrelids);
4080 if (hint_state_enabled(lhint))
4082 set_join_config_options(DISABLE_ALL_JOIN, current_hint_state->context);
4089 * set_plain_rel_pathlist
4090 * Build access paths for a plain relation (no subquery, no inheritance)
4092 * This function was copied and edited from set_plain_rel_pathlist() in
4093 * src/backend/optimizer/path/allpaths.c
4095 * - removed parallel stuff.
4098 set_plain_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
4100 Relids required_outer;
4103 * We don't support pushing join clauses into the quals of a seqscan, but
4104 * it could still have required parameterization due to LATERAL refs in
4107 required_outer = rel->lateral_relids;
4109 /* Consider sequential scan */
4110 add_path(rel, create_seqscan_path(root, rel, required_outer, 0));
4112 /* If appropriate, consider parallel sequential scan */
4113 if (rel->consider_parallel && required_outer == NULL)
4115 ParallelHint *phint = find_parallel_hint(root, rel->relid, rel);
4117 /* Consider parallel paths only if not inhibited by hint */
4118 if (!phint || phint->nworkers > 0)
4119 create_plain_partial_paths(root, rel);
4122 * Overwirte parallel_workers if requested. partial_pathlist seems to
4123 * have up to one path but looping over all possible paths don't harm.
4125 if (phint && phint->nworkers > 0 && phint->force_parallel)
4128 foreach (l, rel->partial_pathlist)
4130 Path *ppath = (Path *) lfirst(l);
4132 Assert(ppath->parallel_workers > 0);
4133 ppath->parallel_workers = phint->nworkers;
4138 /* Consider index scans */
4139 create_index_paths(root, rel);
4141 /* Consider TID scans */
4142 create_tidscan_paths(root, rel);
4146 * Clear exiting access paths and create new ones applying hints.
4147 * This does the similar to set_rel_pathlist
4150 rebuild_scan_path(HintState *hstate, PlannerInfo *root, int level,
4155 foreach(l, initial_rels)
4157 RelOptInfo *rel = (RelOptInfo *) lfirst(l);
4160 /* Skip relations which we can't choose scan method. */
4161 if (rel->reloptkind != RELOPT_BASEREL || rel->rtekind != RTE_RELATION)
4164 rte = root->simple_rte_array[rel->relid];
4166 /* We can't force scan method of foreign tables */
4167 if (rte->relkind == RELKIND_FOREIGN_TABLE)
4171 * Create scan paths with GUC parameters which are at the beginning of
4172 * planner if scan method hint is not specified, otherwise use
4173 * specified hints and mark the hint as used.
4175 setup_scan_method_enforcement(find_scan_hint(root, rel->relid, rel),
4178 /* Setup parallel environment according to the hint */
4179 setup_parallel_plan_enfocement(
4180 find_parallel_hint(root, rel->relid, rel), current_hint_state);
4182 /* remove existing partial paths from this baserel */
4183 list_free_deep(rel->partial_pathlist);
4184 rel->partial_pathlist = NIL;
4186 /* remove existing paths from this baserel */
4187 list_free_deep(rel->pathlist);
4188 rel->pathlist = NIL;
4194 /* remove partial paths from all chlidren */
4195 foreach (l, root->append_rel_list)
4197 AppendRelInfo *appinfo = (AppendRelInfo *) lfirst(l);
4198 RelOptInfo *childrel;
4200 if (appinfo->parent_relid != rel->relid)
4203 childrel = root->simple_rel_array[appinfo->child_relid];
4204 list_free_deep(childrel->partial_pathlist);
4205 childrel->partial_pathlist = NIL;
4207 /* It's an "append relation", process accordingly */
4208 set_append_rel_pathlist(root, rel, rel->relid, rte);
4212 set_plain_rel_pathlist(root, rel, rte);
4216 * If this is a baserel, consider gathering any partial paths we may
4217 * hinthave created for it.
4219 if (rel->reloptkind == RELOPT_BASEREL)
4220 generate_gather_paths(root, rel);
4222 /* Now find the cheapest of the paths for this rel */
4227 * Restore the GUC variables we set above.
4229 setup_scan_method_enforcement(NULL, hstate);
4233 * wrapper of make_join_rel()
4235 * call make_join_rel() after changing enable_* parameters according to given
4239 make_join_rel_wrapper(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
4242 JoinMethodHint *hint;
4246 joinrelids = bms_union(rel1->relids, rel2->relids);
4247 hint = find_join_hint(joinrelids);
4248 bms_free(joinrelids);
4251 return pg_hint_plan_make_join_rel(root, rel1, rel2);
4253 if (hint->inner_nrels == 0)
4255 save_nestlevel = NewGUCNestLevel();
4257 set_join_config_options(hint->enforce_mask,
4258 current_hint_state->context);
4260 rel = pg_hint_plan_make_join_rel(root, rel1, rel2);
4261 hint->base.state = HINT_STATE_USED;
4264 * Restore the GUC variables we set above.
4266 AtEOXact_GUC(true, save_nestlevel);
4269 rel = pg_hint_plan_make_join_rel(root, rel1, rel2);
4278 add_paths_to_joinrel_wrapper(PlannerInfo *root,
4279 RelOptInfo *joinrel,
4280 RelOptInfo *outerrel,
4281 RelOptInfo *innerrel,
4283 SpecialJoinInfo *sjinfo,
4286 ScanMethodHint *scan_hint = NULL;
4288 JoinMethodHint *join_hint;
4291 if ((scan_hint = find_scan_hint(root, innerrel->relid, innerrel)) != NULL)
4292 setup_scan_method_enforcement(scan_hint, current_hint_state);
4294 joinrelids = bms_union(outerrel->relids, innerrel->relids);
4295 join_hint = find_join_hint(joinrelids);
4296 bms_free(joinrelids);
4298 if (join_hint && join_hint->inner_nrels != 0)
4300 save_nestlevel = NewGUCNestLevel();
4302 if (bms_equal(join_hint->inner_joinrelids, innerrel->relids))
4305 set_join_config_options(join_hint->enforce_mask,
4306 current_hint_state->context);
4308 add_paths_to_joinrel(root, joinrel, outerrel, innerrel, jointype,
4309 sjinfo, restrictlist);
4310 join_hint->base.state = HINT_STATE_USED;
4314 set_join_config_options(DISABLE_ALL_JOIN,
4315 current_hint_state->context);
4316 add_paths_to_joinrel(root, joinrel, outerrel, innerrel, jointype,
4317 sjinfo, restrictlist);
4321 * Restore the GUC variables we set above.
4323 AtEOXact_GUC(true, save_nestlevel);
4326 add_paths_to_joinrel(root, joinrel, outerrel, innerrel, jointype,
4327 sjinfo, restrictlist);
4329 /* Reset the environment if changed */
4330 if (scan_hint != NULL)
4331 setup_scan_method_enforcement(NULL, current_hint_state);
4335 get_num_baserels(List *initial_rels)
4340 foreach(l, initial_rels)
4342 RelOptInfo *rel = (RelOptInfo *) lfirst(l);
4344 if (rel->reloptkind == RELOPT_BASEREL)
4346 else if (rel->reloptkind ==RELOPT_JOINREL)
4347 nbaserel+= bms_num_members(rel->relids);
4350 /* other values not expected here */
4351 elog(ERROR, "unrecognized reloptkind type: %d", rel->reloptkind);
4359 pg_hint_plan_join_search(PlannerInfo *root, int levels_needed,
4362 JoinMethodHint **join_method_hints;
4366 bool leading_hint_enable;
4369 * Use standard planner (or geqo planner) if pg_hint_plan is disabled or no
4370 * valid hint is supplied or current nesting depth is nesting depth of SPI
4373 if (!current_hint_state || hint_inhibit_level > 0)
4375 if (prev_join_search)
4376 return (*prev_join_search) (root, levels_needed, initial_rels);
4377 else if (enable_geqo && levels_needed >= geqo_threshold)
4378 return geqo(root, levels_needed, initial_rels);
4380 return standard_join_search(root, levels_needed, initial_rels);
4383 /* apply scan method hint rebuild scan path. */
4384 rebuild_scan_path(current_hint_state, root, levels_needed, initial_rels);
4387 * In the case using GEQO, only scan method hints and Set hints have
4388 * effect. Join method and join order is not controllable by hints.
4390 if (enable_geqo && levels_needed >= geqo_threshold)
4391 return geqo(root, levels_needed, initial_rels);
4393 nbaserel = get_num_baserels(initial_rels);
4394 current_hint_state->join_hint_level =
4395 palloc0(sizeof(List *) * (nbaserel + 1));
4396 join_method_hints = palloc0(sizeof(JoinMethodHint *) * (nbaserel + 1));
4398 leading_hint_enable = transform_join_hints(current_hint_state,
4400 initial_rels, join_method_hints);
4402 rel = pg_hint_plan_standard_join_search(root, levels_needed, initial_rels);
4404 for (i = 2; i <= nbaserel; i++)
4406 list_free(current_hint_state->join_hint_level[i]);
4408 /* free Leading hint only */
4409 if (join_method_hints[i] != NULL &&
4410 join_method_hints[i]->enforce_mask == ENABLE_ALL_JOIN)
4411 JoinMethodHintDelete(join_method_hints[i]);
4413 pfree(current_hint_state->join_hint_level);
4414 pfree(join_method_hints);
4416 if (leading_hint_enable)
4417 set_join_config_options(current_hint_state->init_join_mask,
4418 current_hint_state->context);
4424 * Force number of wokers if instructed by hint
4427 pg_hint_plan_set_rel_pathlist(PlannerInfo * root, RelOptInfo *rel,
4428 Index rti, RangeTblEntry *rte)
4430 ParallelHint *phint;
4433 bool regenerate = false;
4435 /* Hint has not been parsed yet, or this is not a parallel'able relation */
4436 if (current_hint_state == NULL || rel->partial_pathlist == NIL)
4439 phint = find_parallel_hint(root, rel->relid, rel);
4441 if (phint == NULL || !phint->force_parallel)
4445 * This relation contains gather paths previously created and they prevent
4446 * adding new gahter path with same cost. Remove them.
4448 oldpathlist = rel->pathlist;
4449 rel->pathlist = NIL;
4450 foreach (l, oldpathlist)
4452 Path *path = (Path *) lfirst(l);
4454 if (IsA(path, GatherPath) &&
4455 path->parallel_workers != phint->nworkers)
4461 rel->pathlist = lappend(rel->pathlist, path);
4463 list_free(oldpathlist);
4467 foreach (l, rel->partial_pathlist)
4469 Path *ppath = (Path *) lfirst(l);
4471 if (phint && phint->nworkers > 0 && phint->force_parallel)
4473 Assert(ppath->parallel_workers > 0);
4474 ppath->parallel_workers = phint->nworkers;
4478 generate_gather_paths(root, rel);
4484 * Build access paths for a base relation
4486 * This function was copied and edited from set_rel_pathlist() in
4487 * src/backend/optimizer/path/allpaths.c
4490 set_rel_pathlist(PlannerInfo *root, RelOptInfo *rel,
4491 Index rti, RangeTblEntry *rte)
4493 if (IS_DUMMY_REL(rel))
4495 /* We already proved the relation empty, so nothing more to do */
4499 /* It's an "append relation", process accordingly */
4500 set_append_rel_pathlist(root, rel, rti, rte);
4504 if (rel->rtekind == RTE_RELATION)
4506 if (rte->relkind == RELKIND_RELATION)
4508 if(rte->tablesample != NULL)
4509 elog(ERROR, "sampled relation is not supported");
4511 /* Plain relation */
4512 set_plain_rel_pathlist(root, rel, rte);
4515 elog(ERROR, "unexpected relkind: %c", rte->relkind);
4518 elog(ERROR, "unexpected rtekind: %d", (int) rel->rtekind);
4522 * Allow a plugin to editorialize on the set of Paths for this base
4523 * relation. It could add new paths (such as CustomPaths) by calling
4524 * add_path(), or delete or modify paths added by the core code.
4526 if (set_rel_pathlist_hook)
4527 (*set_rel_pathlist_hook) (root, rel, rti, rte);
4529 /* Now find the cheapest of the paths for this rel */
4534 * stmt_beg callback is called when each query in PL/pgSQL function is about
4535 * to be executed. At that timing, we save query string in the global variable
4536 * plpgsql_query_string to use it in planner hook. It's safe to use one global
4537 * variable for the purpose, because its content is only necessary until
4538 * planner hook is called for the query, so recursive PL/pgSQL function calls
4539 * don't harm this mechanism.
4542 pg_hint_plan_plpgsql_stmt_beg(PLpgSQL_execstate *estate, PLpgSQL_stmt *stmt)
4544 plpgsql_recurse_level++;
4548 * stmt_end callback is called then each query in PL/pgSQL function has
4549 * finished. At that timing, we clear plpgsql_query_string to tell planner
4550 * hook that next call is not for a query written in PL/pgSQL block.
4553 pg_hint_plan_plpgsql_stmt_end(PLpgSQL_execstate *estate, PLpgSQL_stmt *stmt)
4555 plpgsql_recurse_level--;
4558 void plpgsql_query_erase_callback(ResourceReleasePhase phase,
4563 if (phase != RESOURCE_RELEASE_AFTER_LOCKS)
4565 /* Cancel plpgsql nest level*/
4566 plpgsql_recurse_level = 0;
4569 #define standard_join_search pg_hint_plan_standard_join_search
4570 #define join_search_one_level pg_hint_plan_join_search_one_level
4571 #define make_join_rel make_join_rel_wrapper
4574 #undef make_join_rel
4575 #define make_join_rel pg_hint_plan_make_join_rel
4576 #define add_paths_to_joinrel add_paths_to_joinrel_wrapper
4577 #include "make_join_rel.c"
4579 #include "pg_stat_statements.c"