Reconcile backed (PG 15 -> 13) features with the code of PG13.

Author: a.pervushina

aqo.c

@@ -247,7 +247,7 @@ _PG_init(void)
 RegisterResourceReleaseCallback(aqo_free_callback, NULL);
 RegisterAQOPlanNodeMethods();
 
-MarkGUCPrefixReserved("aqo");
+EmitWarningsOnPlaceholders("aqo");
 RequestAddinShmemSpace(aqo_memsize());
 }
 

cardinality_estimation.c

@@ -45,8 +45,8 @@ predict_debug_output(List *clauses, List *selectivities,
 appendStringInfoString(&debug_str, "}, relnames: { ");
 foreach(lc, relnames)
 {
-String *relname = lfirst_node(String, lc);
-appendStringInfo(&debug_str, "%s ", relname->sval);
+Value *relname = lfirst_node(String, lc);
+appendStringInfo(&debug_str, "%s ", valStr(relname));
 }
 
 appendStringInfo(&debug_str, "}, result: %lf", result);

cardinality_hooks.c

@@ -164,12 +164,9 @@ aqo_set_baserel_rows_estimate(PlannerInfo *root, RelOptInfo *rel)
 rte = planner_rt_fetch(rel->relid, root);
 if (rte && OidIsValid(rte->relid))
 {
-String *s = makeNode(String);
-
 /* Predict for a plane table. */
 Assert(rte->eref && rte->eref->aliasname);
-s->sval = pstrdup(rte->eref->aliasname);
-relnames = list_make1(s);
+relnames = list_make1(makeString(pstrdup(rte->eref->aliasname)));
 }
 
 clauses = aqo_get_clauses(root, rel->baserestrictinfo);
@@ -276,12 +273,9 @@ aqo_get_parameterized_baserel_size(PlannerInfo *root,
 
 if (rte && OidIsValid(rte->relid))
 {
-String *s = makeNode(String);
-
 /* Predict for a plane table. */
 Assert(rte->eref && rte->eref->aliasname);
-s->sval = pstrdup(rte->eref->aliasname);
-relnames = list_make1(s);
+relnames = list_make1(makeString(pstrdup(rte->eref->aliasname)));
 }
 
 predicted = predict_for_relation(allclauses, selectivities, relnames, &fss);

expected/gucs.out

@@ -34,7 +34,7 @@ EXPLAIN (ANALYZE, VERBOSE, COSTS OFF, TIMING OFF, SUMMARY OFF)
 
 -- Check existence of the interface functions.
 SELECT obj_description('public.show_cardinality_errors'::regproc::oid);
-obj_description
+obj_description
 -----------------------------------------------------------------------------------------
 Get cardinality error of last query execution. Return queries having the largest error.
 (1 row)

expected/unsupported.out

@@ -582,7 +582,8 @@ NOTICE: Cleaning aqo_data records
 -- TODO: figure out with remaining queries in the ML storage.
 SELECT num, to_char(error, '9.99EEEE')::text AS error, query_text
 FROM public.show_cardinality_errors() cef, aqo_query_texts aqt
-WHERE aqt.query_hash = cef.id;
+WHERE aqt.query_hash = cef.id
+ORDER BY (error, md5(query_text)) DESC;
 num | error | query_text
 -----+-----------+-------------------------------------------------------------------------------------------
 1 | 9.69e+02 | SELECT str FROM expln(' +
@@ -598,9 +599,9 @@ WHERE aqt.query_hash = cef.id;
 | | to_char(error, '9.99EEEE')::text AS error +
 | | FROM public.show_cardinality_errors() +
 | | WHERE error > 0.;
-3 | 0.00e+00 | CREATE TABLE t AS SELECT (gs.* / 50) AS x FROM generate_series(1,1000) AS gs;
+5 | 0.00e+00 | CREATE TABLE t AS SELECT (gs.* / 50) AS x FROM generate_series(1,1000) AS gs;
 4 | 0.00e+00 | SELECT public.clean_aqo_data();
-5 | 0.00e+00 | CREATE TABLE t1 AS SELECT mod(gs,10) AS x, mod(gs+1,10) AS y +
+3 | 0.00e+00 | CREATE TABLE t1 AS SELECT mod(gs,10) AS x, mod(gs+1,10) AS y +
 | | FROM generate_series(1,1000) AS gs;
 (5 rows)
 

hash.c

@@ -449,11 +449,11 @@ get_relations_hash(List *relnames)
 /* generate array of hashes. */
 foreach(lc, relnames)
 {
-String *relname = lfirst_node(String, lc);
+Value *relname = (Value *) lfirst(lc);
 
 hashes[i++] = DatumGetInt64(hash_any_extended(
-(unsigned char *) relname->sval,
-strlen(relname->sval), 0));
+(unsigned char *) strVal(relname),
+strlen(strVal(relname)), 0));
 }
 
 /* Sort the array to make query insensitive to input order of relations. */

learn_cache.c

@@ -56,7 +56,7 @@ calculate_size(int cols, List *relnames)
 /* Calculate memory size needed to store relation names */
 foreach(lc, relnames)
 {
-size += strlen(lfirst_node(String, lc)->sval) + 1;
+size += strlen(strVal(lfirst(lc))) + 1;
 }
 
 return size;
@@ -134,7 +134,7 @@ lc_update_fss(uint64 fs, int fss, OkNNrdata *data, List *relnames)
 /* store strings of relation names. Each string ends with 0-byte */
 foreach(lc, relnames)
 {
-char *relname = lfirst_node(String, lc)->sval;
+char *relname = strVal(lfirst(lc));
 int len = strlen(relname) + 1;
 
 memcpy(ptr, relname, len);
@@ -245,11 +245,9 @@ init_with_dsm(OkNNrdata *data, dsm_block_hdr *hdr, List **relnames)
 *relnames = NIL;
 for (i = 0; i < hdr->nrelids; i++)
 {
-String *s = makeNode(String);
 int len = strlen(ptr) + 1;
 
-s->sval = pstrdup(ptr);
-*relnames = lappend(*relnames, s);
+*relnames = lappend(*relnames, makeString(pstrdup(ptr)));
 ptr += len;
 }
 return calculate_size(hdr->cols, *relnames);

path_utils.c

@@ -148,12 +148,7 @@ get_relnames(PlannerInfo *root, Relids relids)
 {
 rte = planner_rt_fetch(i, root);
 if (OidIsValid(rte->relid))
-{
-String *s = makeNode(String);
-
-s->sval = pstrdup(rte->eref->aliasname);
-l = lappend(l, s);
-}
+l = lappend(l, makeString(pstrdup(rte->eref->aliasname)));
 }
 return l;
 }
@@ -648,9 +643,9 @@ aqo_store_upper_signature_hook(PlannerInfo *root,
 set_cheapest(input_rel);
 clauses = get_path_clauses(input_rel->cheapest_total_path,
 root, &selectivities);
-relids = get_list_of_relids(root, input_rel->relids);
+relnames = get_relnames(root, input_rel->relids);
 fss_node->val.type = T_Integer;
 fss_node->location = -1;
-fss_node->val.val.ival = get_fss_for_object(relids, clauses, NIL, NULL, NULL);
+fss_node->val.val.ival = get_fss_for_object(relnames, clauses, NIL, NULL, NULL);
 output_rel->ext_nodes = lappend(output_rel->ext_nodes, (void *) fss_node);
 }

sql/unsupported.sql

@@ -187,6 +187,7 @@ SELECT public.clean_aqo_data();
 -- TODO: figure out with remaining queries in the ML storage.
 SELECT num, to_char(error, '9.99EEEE')::text AS error, query_text
 FROM public.show_cardinality_errors() cef, aqo_query_texts aqt
-WHERE aqt.query_hash = cef.id;
+WHERE aqt.query_hash = cef.id
+ORDER BY (error, md5(query_text)) DESC;
 
 DROP EXTENSION aqo;

storage.c

@@ -17,6 +17,9 @@
 
 #include "postgres.h"
 
+#include "nodes/value.h"
+#include "postgres.h"
+
 #include "access/heapam.h"
 #include "access/table.h"
 #include "access/tableam.h"
@@ -336,7 +339,7 @@ form_strings_vector(List *relnames)
 
 foreach(lc, relnames)
 {
-char *relname = (lfirst_node(String, lc))->sval;
+char *relname = strVal(lfirst(lc));
 
 rels[i++] = CStringGetTextDatum(relname);
 }
@@ -359,9 +362,9 @@ deform_strings_vector(Datum datum)
 &values, NULL, &nelems);
 for (i = 0; i < nelems; ++i)
 {
-String *s = makeNode(String);
+Value *s;
 
-s->sval = pstrdup(TextDatumGetCString(values[i]));
+s = makeString(pstrdup(TextDatumGetCString(values[i])));
 relnames = lappend(relnames, s);
 }
 
@@ -448,7 +451,7 @@ load_fss(uint64 fs, int fss, OkNNrdata *data, List **relnames)
 elog(ERROR, "unexpected number of features for hash (" \
 UINT64_FORMAT", %d):\
 expected %d features, obtained %d",
-fs, fss, ncols, DatumGetInt32(values[2]));
+fs, fss, data->cols, DatumGetInt32(values[2]));
 }
 else
 success = false;
@@ -583,7 +586,7 @@ update_fss(uint64 fs, int fss, OkNNrdata *data, List *relnames)
 */
 elog(ERROR, "AQO data piece ("UINT64_FORMAT" %d) concurrently"
 " updated by a stranger backend.",
-fhash, fsshash);
+fs, fss);
 result = false;
 }
 }