2017-01-19 18:00:00 +01:00
|
|
|
/*-------------------------------------------------------------------------
|
|
|
|
*
|
|
|
|
* pg_subscription.c
|
|
|
|
* replication subscriptions
|
|
|
|
*
|
2019-01-02 18:44:25 +01:00
|
|
|
* Portions Copyright (c) 1996-2019, PostgreSQL Global Development Group
|
2017-01-25 18:32:05 +01:00
|
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
2017-01-19 18:00:00 +01:00
|
|
|
*
|
|
|
|
* IDENTIFICATION
|
|
|
|
* src/backend/catalog/pg_subscription.c
|
|
|
|
*
|
|
|
|
*-------------------------------------------------------------------------
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "postgres.h"
|
|
|
|
|
|
|
|
#include "miscadmin.h"
|
|
|
|
|
|
|
|
#include "access/genam.h"
|
|
|
|
#include "access/heapam.h"
|
|
|
|
#include "access/htup_details.h"
|
tableam: Add and use scan APIs.
Too allow table accesses to be not directly dependent on heap, several
new abstractions are needed. Specifically:
1) Heap scans need to be generalized into table scans. Do this by
introducing TableScanDesc, which will be the "base class" for
individual AMs. This contains the AM independent fields from
HeapScanDesc.
The previous heap_{beginscan,rescan,endscan} et al. have been
replaced with a table_ version.
There's no direct replacement for heap_getnext(), as that returned
a HeapTuple, which is undesirable for a other AMs. Instead there's
table_scan_getnextslot(). But note that heap_getnext() lives on,
it's still used widely to access catalog tables.
This is achieved by new scan_begin, scan_end, scan_rescan,
scan_getnextslot callbacks.
2) The portion of parallel scans that's shared between backends need
to be able to do so without the user doing per-AM work. To achieve
that new parallelscan_{estimate, initialize, reinitialize}
callbacks are introduced, which operate on a new
ParallelTableScanDesc, which again can be subclassed by AMs.
As it is likely that several AMs are going to be block oriented,
block oriented callbacks that can be shared between such AMs are
provided and used by heap. table_block_parallelscan_{estimate,
intiialize, reinitialize} as callbacks, and
table_block_parallelscan_{nextpage, init} for use in AMs. These
operate on a ParallelBlockTableScanDesc.
3) Index scans need to be able to access tables to return a tuple, and
there needs to be state across individual accesses to the heap to
store state like buffers. That's now handled by introducing a
sort-of-scan IndexFetchTable, which again is intended to be
subclassed by individual AMs (for heap IndexFetchHeap).
The relevant callbacks for an AM are index_fetch_{end, begin,
reset} to create the necessary state, and index_fetch_tuple to
retrieve an indexed tuple. Note that index_fetch_tuple
implementations need to be smarter than just blindly fetching the
tuples for AMs that have optimizations similar to heap's HOT - the
currently alive tuple in the update chain needs to be fetched if
appropriate.
Similar to table_scan_getnextslot(), it's undesirable to continue
to return HeapTuples. Thus index_fetch_heap (might want to rename
that later) now accepts a slot as an argument. Core code doesn't
have a lot of call sites performing index scans without going
through the systable_* API (in contrast to loads of heap_getnext
calls and working directly with HeapTuples).
Index scans now store the result of a search in
IndexScanDesc->xs_heaptid, rather than xs_ctup->t_self. As the
target is not generally a HeapTuple anymore that seems cleaner.
To be able to sensible adapt code to use the above, two further
callbacks have been introduced:
a) slot_callbacks returns a TupleTableSlotOps* suitable for creating
slots capable of holding a tuple of the AMs
type. table_slot_callbacks() and table_slot_create() are based
upon that, but have additional logic to deal with views, foreign
tables, etc.
While this change could have been done separately, nearly all the
call sites that needed to be adapted for the rest of this commit
also would have been needed to be adapted for
table_slot_callbacks(), making separation not worthwhile.
b) tuple_satisfies_snapshot checks whether the tuple in a slot is
currently visible according to a snapshot. That's required as a few
places now don't have a buffer + HeapTuple around, but a
slot (which in heap's case internally has that information).
Additionally a few infrastructure changes were needed:
I) SysScanDesc, as used by systable_{beginscan, getnext} et al. now
internally uses a slot to keep track of tuples. While
systable_getnext() still returns HeapTuples, and will so for the
foreseeable future, the index API (see 1) above) now only deals with
slots.
The remainder, and largest part, of this commit is then adjusting all
scans in postgres to use the new APIs.
Author: Andres Freund, Haribabu Kommi, Alvaro Herrera
Discussion:
https://postgr.es/m/20180703070645.wchpu5muyto5n647@alap3.anarazel.de
https://postgr.es/m/20160812231527.GA690404@alvherre.pgsql
2019-03-11 20:46:41 +01:00
|
|
|
#include "access/tableam.h"
|
2017-03-23 13:36:36 +01:00
|
|
|
#include "access/xact.h"
|
2017-01-19 18:00:00 +01:00
|
|
|
|
2017-03-23 13:36:36 +01:00
|
|
|
#include "catalog/indexing.h"
|
2017-01-19 18:00:00 +01:00
|
|
|
#include "catalog/pg_type.h"
|
|
|
|
#include "catalog/pg_subscription.h"
|
2017-03-23 13:36:36 +01:00
|
|
|
#include "catalog/pg_subscription_rel.h"
|
2017-01-19 18:00:00 +01:00
|
|
|
|
|
|
|
#include "nodes/makefuncs.h"
|
|
|
|
|
2017-07-04 04:47:06 +02:00
|
|
|
#include "storage/lmgr.h"
|
|
|
|
|
2017-01-19 18:00:00 +01:00
|
|
|
#include "utils/array.h"
|
|
|
|
#include "utils/builtins.h"
|
|
|
|
#include "utils/fmgroids.h"
|
2017-03-23 13:36:36 +01:00
|
|
|
#include "utils/pg_lsn.h"
|
|
|
|
#include "utils/rel.h"
|
2017-01-19 18:00:00 +01:00
|
|
|
#include "utils/syscache.h"
|
|
|
|
|
|
|
|
|
|
|
|
static List *textarray_to_stringlist(ArrayType *textarray);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fetch the subscription from the syscache.
|
|
|
|
*/
|
|
|
|
Subscription *
|
|
|
|
GetSubscription(Oid subid, bool missing_ok)
|
|
|
|
{
|
2017-05-17 22:31:56 +02:00
|
|
|
HeapTuple tup;
|
|
|
|
Subscription *sub;
|
|
|
|
Form_pg_subscription subform;
|
|
|
|
Datum datum;
|
|
|
|
bool isnull;
|
2017-01-19 18:00:00 +01:00
|
|
|
|
|
|
|
tup = SearchSysCache1(SUBSCRIPTIONOID, ObjectIdGetDatum(subid));
|
|
|
|
|
|
|
|
if (!HeapTupleIsValid(tup))
|
|
|
|
{
|
|
|
|
if (missing_ok)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
elog(ERROR, "cache lookup failed for subscription %u", subid);
|
|
|
|
}
|
|
|
|
|
|
|
|
subform = (Form_pg_subscription) GETSTRUCT(tup);
|
|
|
|
|
|
|
|
sub = (Subscription *) palloc(sizeof(Subscription));
|
|
|
|
sub->oid = subid;
|
|
|
|
sub->dbid = subform->subdbid;
|
|
|
|
sub->name = pstrdup(NameStr(subform->subname));
|
|
|
|
sub->owner = subform->subowner;
|
|
|
|
sub->enabled = subform->subenabled;
|
|
|
|
|
|
|
|
/* Get conninfo */
|
|
|
|
datum = SysCacheGetAttr(SUBSCRIPTIONOID,
|
|
|
|
tup,
|
|
|
|
Anum_pg_subscription_subconninfo,
|
|
|
|
&isnull);
|
|
|
|
Assert(!isnull);
|
2017-04-14 18:54:09 +02:00
|
|
|
sub->conninfo = TextDatumGetCString(datum);
|
2017-01-19 18:00:00 +01:00
|
|
|
|
|
|
|
/* Get slotname */
|
|
|
|
datum = SysCacheGetAttr(SUBSCRIPTIONOID,
|
|
|
|
tup,
|
|
|
|
Anum_pg_subscription_subslotname,
|
|
|
|
&isnull);
|
2017-05-09 16:20:42 +02:00
|
|
|
if (!isnull)
|
|
|
|
sub->slotname = pstrdup(NameStr(*DatumGetName(datum)));
|
|
|
|
else
|
|
|
|
sub->slotname = NULL;
|
2017-01-19 18:00:00 +01:00
|
|
|
|
2017-04-14 19:58:46 +02:00
|
|
|
/* Get synccommit */
|
|
|
|
datum = SysCacheGetAttr(SUBSCRIPTIONOID,
|
|
|
|
tup,
|
|
|
|
Anum_pg_subscription_subsynccommit,
|
|
|
|
&isnull);
|
|
|
|
Assert(!isnull);
|
|
|
|
sub->synccommit = TextDatumGetCString(datum);
|
|
|
|
|
2017-01-19 18:00:00 +01:00
|
|
|
/* Get publications */
|
|
|
|
datum = SysCacheGetAttr(SUBSCRIPTIONOID,
|
|
|
|
tup,
|
|
|
|
Anum_pg_subscription_subpublications,
|
|
|
|
&isnull);
|
|
|
|
Assert(!isnull);
|
|
|
|
sub->publications = textarray_to_stringlist(DatumGetArrayTypeP(datum));
|
|
|
|
|
|
|
|
ReleaseSysCache(tup);
|
|
|
|
|
|
|
|
return sub;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return number of subscriptions defined in given database.
|
|
|
|
* Used by dropdb() to check if database can indeed be dropped.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
CountDBSubscriptions(Oid dbid)
|
|
|
|
{
|
2017-05-17 22:31:56 +02:00
|
|
|
int nsubs = 0;
|
|
|
|
Relation rel;
|
|
|
|
ScanKeyData scankey;
|
|
|
|
SysScanDesc scan;
|
|
|
|
HeapTuple tup;
|
2017-01-19 18:00:00 +01:00
|
|
|
|
2019-01-21 19:32:19 +01:00
|
|
|
rel = table_open(SubscriptionRelationId, RowExclusiveLock);
|
2017-01-19 18:00:00 +01:00
|
|
|
|
|
|
|
ScanKeyInit(&scankey,
|
|
|
|
Anum_pg_subscription_subdbid,
|
|
|
|
BTEqualStrategyNumber, F_OIDEQ,
|
|
|
|
ObjectIdGetDatum(dbid));
|
|
|
|
|
|
|
|
scan = systable_beginscan(rel, InvalidOid, false,
|
|
|
|
NULL, 1, &scankey);
|
|
|
|
|
|
|
|
while (HeapTupleIsValid(tup = systable_getnext(scan)))
|
|
|
|
nsubs++;
|
|
|
|
|
|
|
|
systable_endscan(scan);
|
|
|
|
|
2019-01-21 19:32:19 +01:00
|
|
|
table_close(rel, NoLock);
|
2017-01-19 18:00:00 +01:00
|
|
|
|
|
|
|
return nsubs;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free memory allocated by subscription struct.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
FreeSubscription(Subscription *sub)
|
|
|
|
{
|
|
|
|
pfree(sub->name);
|
|
|
|
pfree(sub->conninfo);
|
2017-05-09 16:20:42 +02:00
|
|
|
if (sub->slotname)
|
|
|
|
pfree(sub->slotname);
|
2017-01-19 18:00:00 +01:00
|
|
|
list_free_deep(sub->publications);
|
|
|
|
pfree(sub);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* get_subscription_oid - given a subscription name, look up the OID
|
|
|
|
*
|
|
|
|
* If missing_ok is false, throw an error if name not found. If true, just
|
|
|
|
* return InvalidOid.
|
|
|
|
*/
|
|
|
|
Oid
|
|
|
|
get_subscription_oid(const char *subname, bool missing_ok)
|
|
|
|
{
|
|
|
|
Oid oid;
|
|
|
|
|
Remove WITH OIDS support, change oid catalog column visibility.
Previously tables declared WITH OIDS, including a significant fraction
of the catalog tables, stored the oid column not as a normal column,
but as part of the tuple header.
This special column was not shown by default, which was somewhat odd,
as it's often (consider e.g. pg_class.oid) one of the more important
parts of a row. Neither pg_dump nor COPY included the contents of the
oid column by default.
The fact that the oid column was not an ordinary column necessitated a
significant amount of special case code to support oid columns. That
already was painful for the existing, but upcoming work aiming to make
table storage pluggable, would have required expanding and duplicating
that "specialness" significantly.
WITH OIDS has been deprecated since 2005 (commit ff02d0a05280e0).
Remove it.
Removing includes:
- CREATE TABLE and ALTER TABLE syntax for declaring the table to be
WITH OIDS has been removed (WITH (oids[ = true]) will error out)
- pg_dump does not support dumping tables declared WITH OIDS and will
issue a warning when dumping one (and ignore the oid column).
- restoring an pg_dump archive with pg_restore will warn when
restoring a table with oid contents (and ignore the oid column)
- COPY will refuse to load binary dump that includes oids.
- pg_upgrade will error out when encountering tables declared WITH
OIDS, they have to be altered to remove the oid column first.
- Functionality to access the oid of the last inserted row (like
plpgsql's RESULT_OID, spi's SPI_lastoid, ...) has been removed.
The syntax for declaring a table WITHOUT OIDS (or WITH (oids = false)
for CREATE TABLE) is still supported. While that requires a bit of
support code, it seems unnecessary to break applications / dumps that
do not use oids, and are explicit about not using them.
The biggest user of WITH OID columns was postgres' catalog. This
commit changes all 'magic' oid columns to be columns that are normally
declared and stored. To reduce unnecessary query breakage all the
newly added columns are still named 'oid', even if a table's column
naming scheme would indicate 'reloid' or such. This obviously
requires adapting a lot code, mostly replacing oid access via
HeapTupleGetOid() with access to the underlying Form_pg_*->oid column.
The bootstrap process now assigns oids for all oid columns in
genbki.pl that do not have an explicit value (starting at the largest
oid previously used), only oids assigned later by oids will be above
FirstBootstrapObjectId. As the oid column now is a normal column the
special bootstrap syntax for oids has been removed.
Oids are not automatically assigned during insertion anymore, all
backend code explicitly assigns oids with GetNewOidWithIndex(). For
the rare case that insertions into the catalog via SQL are called for
the new pg_nextoid() function can be used (which only works on catalog
tables).
The fact that oid columns on system tables are now normal columns
means that they will be included in the set of columns expanded
by * (i.e. SELECT * FROM pg_class will now include the table's oid,
previously it did not). It'd not technically be hard to hide oid
column by default, but that'd mean confusing behavior would either
have to be carried forward forever, or it'd cause breakage down the
line.
While it's not unlikely that further adjustments are needed, the
scope/invasiveness of the patch makes it worthwhile to get merge this
now. It's painful to maintain externally, too complicated to commit
after the code code freeze, and a dependency of a number of other
patches.
Catversion bump, for obvious reasons.
Author: Andres Freund, with contributions by John Naylor
Discussion: https://postgr.es/m/20180930034810.ywp2c7awz7opzcfr@alap3.anarazel.de
2018-11-21 00:36:57 +01:00
|
|
|
oid = GetSysCacheOid2(SUBSCRIPTIONNAME, Anum_pg_subscription_oid,
|
|
|
|
MyDatabaseId, CStringGetDatum(subname));
|
2017-01-19 18:00:00 +01:00
|
|
|
if (!OidIsValid(oid) && !missing_ok)
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_UNDEFINED_OBJECT),
|
|
|
|
errmsg("subscription \"%s\" does not exist", subname)));
|
|
|
|
return oid;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* get_subscription_name - given a subscription OID, look up the name
|
2018-09-18 05:00:18 +02:00
|
|
|
*
|
|
|
|
* If missing_ok is false, throw an error if name not found. If true, just
|
|
|
|
* return NULL.
|
2017-01-19 18:00:00 +01:00
|
|
|
*/
|
|
|
|
char *
|
2018-09-18 05:00:18 +02:00
|
|
|
get_subscription_name(Oid subid, bool missing_ok)
|
2017-01-19 18:00:00 +01:00
|
|
|
{
|
2017-05-17 22:31:56 +02:00
|
|
|
HeapTuple tup;
|
|
|
|
char *subname;
|
2017-01-19 18:00:00 +01:00
|
|
|
Form_pg_subscription subform;
|
|
|
|
|
|
|
|
tup = SearchSysCache1(SUBSCRIPTIONOID, ObjectIdGetDatum(subid));
|
|
|
|
|
|
|
|
if (!HeapTupleIsValid(tup))
|
2018-09-18 05:00:18 +02:00
|
|
|
{
|
|
|
|
if (!missing_ok)
|
|
|
|
elog(ERROR, "cache lookup failed for subscription %u", subid);
|
|
|
|
return NULL;
|
|
|
|
}
|
2017-01-19 18:00:00 +01:00
|
|
|
|
|
|
|
subform = (Form_pg_subscription) GETSTRUCT(tup);
|
|
|
|
subname = pstrdup(NameStr(subform->subname));
|
|
|
|
|
|
|
|
ReleaseSysCache(tup);
|
|
|
|
|
|
|
|
return subname;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert text array to list of strings.
|
|
|
|
*
|
|
|
|
* Note: the resulting list of strings is pallocated here.
|
|
|
|
*/
|
|
|
|
static List *
|
|
|
|
textarray_to_stringlist(ArrayType *textarray)
|
|
|
|
{
|
2017-05-17 22:31:56 +02:00
|
|
|
Datum *elems;
|
|
|
|
int nelems,
|
|
|
|
i;
|
|
|
|
List *res = NIL;
|
2017-01-19 18:00:00 +01:00
|
|
|
|
|
|
|
deconstruct_array(textarray,
|
|
|
|
TEXTOID, -1, false, 'i',
|
|
|
|
&elems, NULL, &nelems);
|
|
|
|
|
|
|
|
if (nelems == 0)
|
|
|
|
return NIL;
|
|
|
|
|
|
|
|
for (i = 0; i < nelems; i++)
|
2017-04-14 18:54:09 +02:00
|
|
|
res = lappend(res, makeString(TextDatumGetCString(elems[i])));
|
2017-01-19 18:00:00 +01:00
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
/*
|
2018-04-06 16:00:26 +02:00
|
|
|
* Add new state record for a subscription table.
|
2017-03-23 13:36:36 +01:00
|
|
|
*/
|
Remove WITH OIDS support, change oid catalog column visibility.
Previously tables declared WITH OIDS, including a significant fraction
of the catalog tables, stored the oid column not as a normal column,
but as part of the tuple header.
This special column was not shown by default, which was somewhat odd,
as it's often (consider e.g. pg_class.oid) one of the more important
parts of a row. Neither pg_dump nor COPY included the contents of the
oid column by default.
The fact that the oid column was not an ordinary column necessitated a
significant amount of special case code to support oid columns. That
already was painful for the existing, but upcoming work aiming to make
table storage pluggable, would have required expanding and duplicating
that "specialness" significantly.
WITH OIDS has been deprecated since 2005 (commit ff02d0a05280e0).
Remove it.
Removing includes:
- CREATE TABLE and ALTER TABLE syntax for declaring the table to be
WITH OIDS has been removed (WITH (oids[ = true]) will error out)
- pg_dump does not support dumping tables declared WITH OIDS and will
issue a warning when dumping one (and ignore the oid column).
- restoring an pg_dump archive with pg_restore will warn when
restoring a table with oid contents (and ignore the oid column)
- COPY will refuse to load binary dump that includes oids.
- pg_upgrade will error out when encountering tables declared WITH
OIDS, they have to be altered to remove the oid column first.
- Functionality to access the oid of the last inserted row (like
plpgsql's RESULT_OID, spi's SPI_lastoid, ...) has been removed.
The syntax for declaring a table WITHOUT OIDS (or WITH (oids = false)
for CREATE TABLE) is still supported. While that requires a bit of
support code, it seems unnecessary to break applications / dumps that
do not use oids, and are explicit about not using them.
The biggest user of WITH OID columns was postgres' catalog. This
commit changes all 'magic' oid columns to be columns that are normally
declared and stored. To reduce unnecessary query breakage all the
newly added columns are still named 'oid', even if a table's column
naming scheme would indicate 'reloid' or such. This obviously
requires adapting a lot code, mostly replacing oid access via
HeapTupleGetOid() with access to the underlying Form_pg_*->oid column.
The bootstrap process now assigns oids for all oid columns in
genbki.pl that do not have an explicit value (starting at the largest
oid previously used), only oids assigned later by oids will be above
FirstBootstrapObjectId. As the oid column now is a normal column the
special bootstrap syntax for oids has been removed.
Oids are not automatically assigned during insertion anymore, all
backend code explicitly assigns oids with GetNewOidWithIndex(). For
the rare case that insertions into the catalog via SQL are called for
the new pg_nextoid() function can be used (which only works on catalog
tables).
The fact that oid columns on system tables are now normal columns
means that they will be included in the set of columns expanded
by * (i.e. SELECT * FROM pg_class will now include the table's oid,
previously it did not). It'd not technically be hard to hide oid
column by default, but that'd mean confusing behavior would either
have to be carried forward forever, or it'd cause breakage down the
line.
While it's not unlikely that further adjustments are needed, the
scope/invasiveness of the patch makes it worthwhile to get merge this
now. It's painful to maintain externally, too complicated to commit
after the code code freeze, and a dependency of a number of other
patches.
Catversion bump, for obvious reasons.
Author: Andres Freund, with contributions by John Naylor
Discussion: https://postgr.es/m/20180930034810.ywp2c7awz7opzcfr@alap3.anarazel.de
2018-11-21 00:36:57 +01:00
|
|
|
void
|
2018-04-06 16:00:26 +02:00
|
|
|
AddSubscriptionRelState(Oid subid, Oid relid, char state,
|
|
|
|
XLogRecPtr sublsn)
|
2017-03-23 13:36:36 +01:00
|
|
|
{
|
|
|
|
Relation rel;
|
|
|
|
HeapTuple tup;
|
|
|
|
bool nulls[Natts_pg_subscription_rel];
|
|
|
|
Datum values[Natts_pg_subscription_rel];
|
|
|
|
|
2017-07-04 04:47:06 +02:00
|
|
|
LockSharedObject(SubscriptionRelationId, subid, 0, AccessShareLock);
|
|
|
|
|
2019-01-21 19:32:19 +01:00
|
|
|
rel = table_open(SubscriptionRelRelationId, RowExclusiveLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
/* Try finding existing mapping. */
|
|
|
|
tup = SearchSysCacheCopy2(SUBSCRIPTIONRELMAP,
|
|
|
|
ObjectIdGetDatum(relid),
|
|
|
|
ObjectIdGetDatum(subid));
|
2018-04-06 16:00:26 +02:00
|
|
|
if (HeapTupleIsValid(tup))
|
|
|
|
elog(ERROR, "subscription table %u in subscription %u already exists",
|
|
|
|
relid, subid);
|
|
|
|
|
|
|
|
/* Form the tuple. */
|
|
|
|
memset(values, 0, sizeof(values));
|
|
|
|
memset(nulls, false, sizeof(nulls));
|
|
|
|
values[Anum_pg_subscription_rel_srsubid - 1] = ObjectIdGetDatum(subid);
|
|
|
|
values[Anum_pg_subscription_rel_srrelid - 1] = ObjectIdGetDatum(relid);
|
|
|
|
values[Anum_pg_subscription_rel_srsubstate - 1] = CharGetDatum(state);
|
|
|
|
if (sublsn != InvalidXLogRecPtr)
|
|
|
|
values[Anum_pg_subscription_rel_srsublsn - 1] = LSNGetDatum(sublsn);
|
|
|
|
else
|
|
|
|
nulls[Anum_pg_subscription_rel_srsublsn - 1] = true;
|
2017-03-23 13:36:36 +01:00
|
|
|
|
2018-04-06 16:00:26 +02:00
|
|
|
tup = heap_form_tuple(RelationGetDescr(rel), values, nulls);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
2018-04-06 16:00:26 +02:00
|
|
|
/* Insert tuple into catalog. */
|
Remove WITH OIDS support, change oid catalog column visibility.
Previously tables declared WITH OIDS, including a significant fraction
of the catalog tables, stored the oid column not as a normal column,
but as part of the tuple header.
This special column was not shown by default, which was somewhat odd,
as it's often (consider e.g. pg_class.oid) one of the more important
parts of a row. Neither pg_dump nor COPY included the contents of the
oid column by default.
The fact that the oid column was not an ordinary column necessitated a
significant amount of special case code to support oid columns. That
already was painful for the existing, but upcoming work aiming to make
table storage pluggable, would have required expanding and duplicating
that "specialness" significantly.
WITH OIDS has been deprecated since 2005 (commit ff02d0a05280e0).
Remove it.
Removing includes:
- CREATE TABLE and ALTER TABLE syntax for declaring the table to be
WITH OIDS has been removed (WITH (oids[ = true]) will error out)
- pg_dump does not support dumping tables declared WITH OIDS and will
issue a warning when dumping one (and ignore the oid column).
- restoring an pg_dump archive with pg_restore will warn when
restoring a table with oid contents (and ignore the oid column)
- COPY will refuse to load binary dump that includes oids.
- pg_upgrade will error out when encountering tables declared WITH
OIDS, they have to be altered to remove the oid column first.
- Functionality to access the oid of the last inserted row (like
plpgsql's RESULT_OID, spi's SPI_lastoid, ...) has been removed.
The syntax for declaring a table WITHOUT OIDS (or WITH (oids = false)
for CREATE TABLE) is still supported. While that requires a bit of
support code, it seems unnecessary to break applications / dumps that
do not use oids, and are explicit about not using them.
The biggest user of WITH OID columns was postgres' catalog. This
commit changes all 'magic' oid columns to be columns that are normally
declared and stored. To reduce unnecessary query breakage all the
newly added columns are still named 'oid', even if a table's column
naming scheme would indicate 'reloid' or such. This obviously
requires adapting a lot code, mostly replacing oid access via
HeapTupleGetOid() with access to the underlying Form_pg_*->oid column.
The bootstrap process now assigns oids for all oid columns in
genbki.pl that do not have an explicit value (starting at the largest
oid previously used), only oids assigned later by oids will be above
FirstBootstrapObjectId. As the oid column now is a normal column the
special bootstrap syntax for oids has been removed.
Oids are not automatically assigned during insertion anymore, all
backend code explicitly assigns oids with GetNewOidWithIndex(). For
the rare case that insertions into the catalog via SQL are called for
the new pg_nextoid() function can be used (which only works on catalog
tables).
The fact that oid columns on system tables are now normal columns
means that they will be included in the set of columns expanded
by * (i.e. SELECT * FROM pg_class will now include the table's oid,
previously it did not). It'd not technically be hard to hide oid
column by default, but that'd mean confusing behavior would either
have to be carried forward forever, or it'd cause breakage down the
line.
While it's not unlikely that further adjustments are needed, the
scope/invasiveness of the patch makes it worthwhile to get merge this
now. It's painful to maintain externally, too complicated to commit
after the code code freeze, and a dependency of a number of other
patches.
Catversion bump, for obvious reasons.
Author: Andres Freund, with contributions by John Naylor
Discussion: https://postgr.es/m/20180930034810.ywp2c7awz7opzcfr@alap3.anarazel.de
2018-11-21 00:36:57 +01:00
|
|
|
CatalogTupleInsert(rel, tup);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
2018-04-06 16:00:26 +02:00
|
|
|
heap_freetuple(tup);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
2018-04-06 16:00:26 +02:00
|
|
|
/* Cleanup. */
|
2019-01-21 19:32:19 +01:00
|
|
|
table_close(rel, NoLock);
|
2018-04-06 16:00:26 +02:00
|
|
|
}
|
2017-03-23 13:36:36 +01:00
|
|
|
|
2018-04-06 16:00:26 +02:00
|
|
|
/*
|
|
|
|
* Update the state of a subscription table.
|
|
|
|
*/
|
Remove WITH OIDS support, change oid catalog column visibility.
Previously tables declared WITH OIDS, including a significant fraction
of the catalog tables, stored the oid column not as a normal column,
but as part of the tuple header.
This special column was not shown by default, which was somewhat odd,
as it's often (consider e.g. pg_class.oid) one of the more important
parts of a row. Neither pg_dump nor COPY included the contents of the
oid column by default.
The fact that the oid column was not an ordinary column necessitated a
significant amount of special case code to support oid columns. That
already was painful for the existing, but upcoming work aiming to make
table storage pluggable, would have required expanding and duplicating
that "specialness" significantly.
WITH OIDS has been deprecated since 2005 (commit ff02d0a05280e0).
Remove it.
Removing includes:
- CREATE TABLE and ALTER TABLE syntax for declaring the table to be
WITH OIDS has been removed (WITH (oids[ = true]) will error out)
- pg_dump does not support dumping tables declared WITH OIDS and will
issue a warning when dumping one (and ignore the oid column).
- restoring an pg_dump archive with pg_restore will warn when
restoring a table with oid contents (and ignore the oid column)
- COPY will refuse to load binary dump that includes oids.
- pg_upgrade will error out when encountering tables declared WITH
OIDS, they have to be altered to remove the oid column first.
- Functionality to access the oid of the last inserted row (like
plpgsql's RESULT_OID, spi's SPI_lastoid, ...) has been removed.
The syntax for declaring a table WITHOUT OIDS (or WITH (oids = false)
for CREATE TABLE) is still supported. While that requires a bit of
support code, it seems unnecessary to break applications / dumps that
do not use oids, and are explicit about not using them.
The biggest user of WITH OID columns was postgres' catalog. This
commit changes all 'magic' oid columns to be columns that are normally
declared and stored. To reduce unnecessary query breakage all the
newly added columns are still named 'oid', even if a table's column
naming scheme would indicate 'reloid' or such. This obviously
requires adapting a lot code, mostly replacing oid access via
HeapTupleGetOid() with access to the underlying Form_pg_*->oid column.
The bootstrap process now assigns oids for all oid columns in
genbki.pl that do not have an explicit value (starting at the largest
oid previously used), only oids assigned later by oids will be above
FirstBootstrapObjectId. As the oid column now is a normal column the
special bootstrap syntax for oids has been removed.
Oids are not automatically assigned during insertion anymore, all
backend code explicitly assigns oids with GetNewOidWithIndex(). For
the rare case that insertions into the catalog via SQL are called for
the new pg_nextoid() function can be used (which only works on catalog
tables).
The fact that oid columns on system tables are now normal columns
means that they will be included in the set of columns expanded
by * (i.e. SELECT * FROM pg_class will now include the table's oid,
previously it did not). It'd not technically be hard to hide oid
column by default, but that'd mean confusing behavior would either
have to be carried forward forever, or it'd cause breakage down the
line.
While it's not unlikely that further adjustments are needed, the
scope/invasiveness of the patch makes it worthwhile to get merge this
now. It's painful to maintain externally, too complicated to commit
after the code code freeze, and a dependency of a number of other
patches.
Catversion bump, for obvious reasons.
Author: Andres Freund, with contributions by John Naylor
Discussion: https://postgr.es/m/20180930034810.ywp2c7awz7opzcfr@alap3.anarazel.de
2018-11-21 00:36:57 +01:00
|
|
|
void
|
2018-04-06 16:00:26 +02:00
|
|
|
UpdateSubscriptionRelState(Oid subid, Oid relid, char state,
|
|
|
|
XLogRecPtr sublsn)
|
|
|
|
{
|
|
|
|
Relation rel;
|
|
|
|
HeapTuple tup;
|
|
|
|
bool nulls[Natts_pg_subscription_rel];
|
|
|
|
Datum values[Natts_pg_subscription_rel];
|
|
|
|
bool replaces[Natts_pg_subscription_rel];
|
2017-03-23 13:36:36 +01:00
|
|
|
|
2018-04-06 16:00:26 +02:00
|
|
|
LockSharedObject(SubscriptionRelationId, subid, 0, AccessShareLock);
|
|
|
|
|
2019-01-21 19:32:19 +01:00
|
|
|
rel = table_open(SubscriptionRelRelationId, RowExclusiveLock);
|
2018-04-06 16:00:26 +02:00
|
|
|
|
|
|
|
/* Try finding existing mapping. */
|
|
|
|
tup = SearchSysCacheCopy2(SUBSCRIPTIONRELMAP,
|
|
|
|
ObjectIdGetDatum(relid),
|
|
|
|
ObjectIdGetDatum(subid));
|
|
|
|
if (!HeapTupleIsValid(tup))
|
|
|
|
elog(ERROR, "subscription table %u in subscription %u does not exist",
|
|
|
|
relid, subid);
|
|
|
|
|
|
|
|
/* Update the tuple. */
|
|
|
|
memset(values, 0, sizeof(values));
|
|
|
|
memset(nulls, false, sizeof(nulls));
|
|
|
|
memset(replaces, false, sizeof(replaces));
|
|
|
|
|
|
|
|
replaces[Anum_pg_subscription_rel_srsubstate - 1] = true;
|
|
|
|
values[Anum_pg_subscription_rel_srsubstate - 1] = CharGetDatum(state);
|
|
|
|
|
|
|
|
replaces[Anum_pg_subscription_rel_srsublsn - 1] = true;
|
|
|
|
if (sublsn != InvalidXLogRecPtr)
|
|
|
|
values[Anum_pg_subscription_rel_srsublsn - 1] = LSNGetDatum(sublsn);
|
|
|
|
else
|
|
|
|
nulls[Anum_pg_subscription_rel_srsublsn - 1] = true;
|
|
|
|
|
|
|
|
tup = heap_modify_tuple(tup, RelationGetDescr(rel), values, nulls,
|
|
|
|
replaces);
|
|
|
|
|
|
|
|
/* Update the catalog. */
|
|
|
|
CatalogTupleUpdate(rel, &tup->t_self, tup);
|
|
|
|
|
2017-03-23 13:36:36 +01:00
|
|
|
/* Cleanup. */
|
2019-01-21 19:32:19 +01:00
|
|
|
table_close(rel, NoLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get state of subscription table.
|
|
|
|
*
|
|
|
|
* Returns SUBREL_STATE_UNKNOWN when not found and missing_ok is true.
|
|
|
|
*/
|
|
|
|
char
|
|
|
|
GetSubscriptionRelState(Oid subid, Oid relid, XLogRecPtr *sublsn,
|
|
|
|
bool missing_ok)
|
|
|
|
{
|
|
|
|
Relation rel;
|
|
|
|
HeapTuple tup;
|
|
|
|
char substate;
|
|
|
|
bool isnull;
|
|
|
|
Datum d;
|
|
|
|
|
2019-01-21 19:32:19 +01:00
|
|
|
rel = table_open(SubscriptionRelRelationId, AccessShareLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
/* Try finding the mapping. */
|
|
|
|
tup = SearchSysCache2(SUBSCRIPTIONRELMAP,
|
|
|
|
ObjectIdGetDatum(relid),
|
|
|
|
ObjectIdGetDatum(subid));
|
|
|
|
|
|
|
|
if (!HeapTupleIsValid(tup))
|
|
|
|
{
|
|
|
|
if (missing_ok)
|
|
|
|
{
|
2019-01-21 19:32:19 +01:00
|
|
|
table_close(rel, AccessShareLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
*sublsn = InvalidXLogRecPtr;
|
|
|
|
return SUBREL_STATE_UNKNOWN;
|
|
|
|
}
|
|
|
|
|
|
|
|
elog(ERROR, "subscription table %u in subscription %u does not exist",
|
|
|
|
relid, subid);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get the state. */
|
|
|
|
d = SysCacheGetAttr(SUBSCRIPTIONRELMAP, tup,
|
|
|
|
Anum_pg_subscription_rel_srsubstate, &isnull);
|
|
|
|
Assert(!isnull);
|
|
|
|
substate = DatumGetChar(d);
|
|
|
|
d = SysCacheGetAttr(SUBSCRIPTIONRELMAP, tup,
|
|
|
|
Anum_pg_subscription_rel_srsublsn, &isnull);
|
|
|
|
if (isnull)
|
|
|
|
*sublsn = InvalidXLogRecPtr;
|
|
|
|
else
|
|
|
|
*sublsn = DatumGetLSN(d);
|
|
|
|
|
|
|
|
/* Cleanup */
|
|
|
|
ReleaseSysCache(tup);
|
2019-01-21 19:32:19 +01:00
|
|
|
table_close(rel, AccessShareLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
return substate;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Drop subscription relation mapping. These can be for a particular
|
|
|
|
* subscription, or for a particular relation, or both.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
RemoveSubscriptionRel(Oid subid, Oid relid)
|
|
|
|
{
|
|
|
|
Relation rel;
|
tableam: Add and use scan APIs.
Too allow table accesses to be not directly dependent on heap, several
new abstractions are needed. Specifically:
1) Heap scans need to be generalized into table scans. Do this by
introducing TableScanDesc, which will be the "base class" for
individual AMs. This contains the AM independent fields from
HeapScanDesc.
The previous heap_{beginscan,rescan,endscan} et al. have been
replaced with a table_ version.
There's no direct replacement for heap_getnext(), as that returned
a HeapTuple, which is undesirable for a other AMs. Instead there's
table_scan_getnextslot(). But note that heap_getnext() lives on,
it's still used widely to access catalog tables.
This is achieved by new scan_begin, scan_end, scan_rescan,
scan_getnextslot callbacks.
2) The portion of parallel scans that's shared between backends need
to be able to do so without the user doing per-AM work. To achieve
that new parallelscan_{estimate, initialize, reinitialize}
callbacks are introduced, which operate on a new
ParallelTableScanDesc, which again can be subclassed by AMs.
As it is likely that several AMs are going to be block oriented,
block oriented callbacks that can be shared between such AMs are
provided and used by heap. table_block_parallelscan_{estimate,
intiialize, reinitialize} as callbacks, and
table_block_parallelscan_{nextpage, init} for use in AMs. These
operate on a ParallelBlockTableScanDesc.
3) Index scans need to be able to access tables to return a tuple, and
there needs to be state across individual accesses to the heap to
store state like buffers. That's now handled by introducing a
sort-of-scan IndexFetchTable, which again is intended to be
subclassed by individual AMs (for heap IndexFetchHeap).
The relevant callbacks for an AM are index_fetch_{end, begin,
reset} to create the necessary state, and index_fetch_tuple to
retrieve an indexed tuple. Note that index_fetch_tuple
implementations need to be smarter than just blindly fetching the
tuples for AMs that have optimizations similar to heap's HOT - the
currently alive tuple in the update chain needs to be fetched if
appropriate.
Similar to table_scan_getnextslot(), it's undesirable to continue
to return HeapTuples. Thus index_fetch_heap (might want to rename
that later) now accepts a slot as an argument. Core code doesn't
have a lot of call sites performing index scans without going
through the systable_* API (in contrast to loads of heap_getnext
calls and working directly with HeapTuples).
Index scans now store the result of a search in
IndexScanDesc->xs_heaptid, rather than xs_ctup->t_self. As the
target is not generally a HeapTuple anymore that seems cleaner.
To be able to sensible adapt code to use the above, two further
callbacks have been introduced:
a) slot_callbacks returns a TupleTableSlotOps* suitable for creating
slots capable of holding a tuple of the AMs
type. table_slot_callbacks() and table_slot_create() are based
upon that, but have additional logic to deal with views, foreign
tables, etc.
While this change could have been done separately, nearly all the
call sites that needed to be adapted for the rest of this commit
also would have been needed to be adapted for
table_slot_callbacks(), making separation not worthwhile.
b) tuple_satisfies_snapshot checks whether the tuple in a slot is
currently visible according to a snapshot. That's required as a few
places now don't have a buffer + HeapTuple around, but a
slot (which in heap's case internally has that information).
Additionally a few infrastructure changes were needed:
I) SysScanDesc, as used by systable_{beginscan, getnext} et al. now
internally uses a slot to keep track of tuples. While
systable_getnext() still returns HeapTuples, and will so for the
foreseeable future, the index API (see 1) above) now only deals with
slots.
The remainder, and largest part, of this commit is then adjusting all
scans in postgres to use the new APIs.
Author: Andres Freund, Haribabu Kommi, Alvaro Herrera
Discussion:
https://postgr.es/m/20180703070645.wchpu5muyto5n647@alap3.anarazel.de
https://postgr.es/m/20160812231527.GA690404@alvherre.pgsql
2019-03-11 20:46:41 +01:00
|
|
|
TableScanDesc scan;
|
2017-03-23 13:36:36 +01:00
|
|
|
ScanKeyData skey[2];
|
|
|
|
HeapTuple tup;
|
|
|
|
int nkeys = 0;
|
|
|
|
|
2019-01-21 19:32:19 +01:00
|
|
|
rel = table_open(SubscriptionRelRelationId, RowExclusiveLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
if (OidIsValid(subid))
|
|
|
|
{
|
|
|
|
ScanKeyInit(&skey[nkeys++],
|
|
|
|
Anum_pg_subscription_rel_srsubid,
|
|
|
|
BTEqualStrategyNumber,
|
|
|
|
F_OIDEQ,
|
|
|
|
ObjectIdGetDatum(subid));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (OidIsValid(relid))
|
|
|
|
{
|
|
|
|
ScanKeyInit(&skey[nkeys++],
|
|
|
|
Anum_pg_subscription_rel_srrelid,
|
|
|
|
BTEqualStrategyNumber,
|
|
|
|
F_OIDEQ,
|
|
|
|
ObjectIdGetDatum(relid));
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Do the search and delete what we found. */
|
tableam: Add and use scan APIs.
Too allow table accesses to be not directly dependent on heap, several
new abstractions are needed. Specifically:
1) Heap scans need to be generalized into table scans. Do this by
introducing TableScanDesc, which will be the "base class" for
individual AMs. This contains the AM independent fields from
HeapScanDesc.
The previous heap_{beginscan,rescan,endscan} et al. have been
replaced with a table_ version.
There's no direct replacement for heap_getnext(), as that returned
a HeapTuple, which is undesirable for a other AMs. Instead there's
table_scan_getnextslot(). But note that heap_getnext() lives on,
it's still used widely to access catalog tables.
This is achieved by new scan_begin, scan_end, scan_rescan,
scan_getnextslot callbacks.
2) The portion of parallel scans that's shared between backends need
to be able to do so without the user doing per-AM work. To achieve
that new parallelscan_{estimate, initialize, reinitialize}
callbacks are introduced, which operate on a new
ParallelTableScanDesc, which again can be subclassed by AMs.
As it is likely that several AMs are going to be block oriented,
block oriented callbacks that can be shared between such AMs are
provided and used by heap. table_block_parallelscan_{estimate,
intiialize, reinitialize} as callbacks, and
table_block_parallelscan_{nextpage, init} for use in AMs. These
operate on a ParallelBlockTableScanDesc.
3) Index scans need to be able to access tables to return a tuple, and
there needs to be state across individual accesses to the heap to
store state like buffers. That's now handled by introducing a
sort-of-scan IndexFetchTable, which again is intended to be
subclassed by individual AMs (for heap IndexFetchHeap).
The relevant callbacks for an AM are index_fetch_{end, begin,
reset} to create the necessary state, and index_fetch_tuple to
retrieve an indexed tuple. Note that index_fetch_tuple
implementations need to be smarter than just blindly fetching the
tuples for AMs that have optimizations similar to heap's HOT - the
currently alive tuple in the update chain needs to be fetched if
appropriate.
Similar to table_scan_getnextslot(), it's undesirable to continue
to return HeapTuples. Thus index_fetch_heap (might want to rename
that later) now accepts a slot as an argument. Core code doesn't
have a lot of call sites performing index scans without going
through the systable_* API (in contrast to loads of heap_getnext
calls and working directly with HeapTuples).
Index scans now store the result of a search in
IndexScanDesc->xs_heaptid, rather than xs_ctup->t_self. As the
target is not generally a HeapTuple anymore that seems cleaner.
To be able to sensible adapt code to use the above, two further
callbacks have been introduced:
a) slot_callbacks returns a TupleTableSlotOps* suitable for creating
slots capable of holding a tuple of the AMs
type. table_slot_callbacks() and table_slot_create() are based
upon that, but have additional logic to deal with views, foreign
tables, etc.
While this change could have been done separately, nearly all the
call sites that needed to be adapted for the rest of this commit
also would have been needed to be adapted for
table_slot_callbacks(), making separation not worthwhile.
b) tuple_satisfies_snapshot checks whether the tuple in a slot is
currently visible according to a snapshot. That's required as a few
places now don't have a buffer + HeapTuple around, but a
slot (which in heap's case internally has that information).
Additionally a few infrastructure changes were needed:
I) SysScanDesc, as used by systable_{beginscan, getnext} et al. now
internally uses a slot to keep track of tuples. While
systable_getnext() still returns HeapTuples, and will so for the
foreseeable future, the index API (see 1) above) now only deals with
slots.
The remainder, and largest part, of this commit is then adjusting all
scans in postgres to use the new APIs.
Author: Andres Freund, Haribabu Kommi, Alvaro Herrera
Discussion:
https://postgr.es/m/20180703070645.wchpu5muyto5n647@alap3.anarazel.de
https://postgr.es/m/20160812231527.GA690404@alvherre.pgsql
2019-03-11 20:46:41 +01:00
|
|
|
scan = table_beginscan_catalog(rel, nkeys, skey);
|
2017-03-23 13:36:36 +01:00
|
|
|
while (HeapTupleIsValid(tup = heap_getnext(scan, ForwardScanDirection)))
|
|
|
|
{
|
2017-06-14 16:26:46 +02:00
|
|
|
CatalogTupleDelete(rel, &tup->t_self);
|
2017-03-23 13:36:36 +01:00
|
|
|
}
|
tableam: Add and use scan APIs.
Too allow table accesses to be not directly dependent on heap, several
new abstractions are needed. Specifically:
1) Heap scans need to be generalized into table scans. Do this by
introducing TableScanDesc, which will be the "base class" for
individual AMs. This contains the AM independent fields from
HeapScanDesc.
The previous heap_{beginscan,rescan,endscan} et al. have been
replaced with a table_ version.
There's no direct replacement for heap_getnext(), as that returned
a HeapTuple, which is undesirable for a other AMs. Instead there's
table_scan_getnextslot(). But note that heap_getnext() lives on,
it's still used widely to access catalog tables.
This is achieved by new scan_begin, scan_end, scan_rescan,
scan_getnextslot callbacks.
2) The portion of parallel scans that's shared between backends need
to be able to do so without the user doing per-AM work. To achieve
that new parallelscan_{estimate, initialize, reinitialize}
callbacks are introduced, which operate on a new
ParallelTableScanDesc, which again can be subclassed by AMs.
As it is likely that several AMs are going to be block oriented,
block oriented callbacks that can be shared between such AMs are
provided and used by heap. table_block_parallelscan_{estimate,
intiialize, reinitialize} as callbacks, and
table_block_parallelscan_{nextpage, init} for use in AMs. These
operate on a ParallelBlockTableScanDesc.
3) Index scans need to be able to access tables to return a tuple, and
there needs to be state across individual accesses to the heap to
store state like buffers. That's now handled by introducing a
sort-of-scan IndexFetchTable, which again is intended to be
subclassed by individual AMs (for heap IndexFetchHeap).
The relevant callbacks for an AM are index_fetch_{end, begin,
reset} to create the necessary state, and index_fetch_tuple to
retrieve an indexed tuple. Note that index_fetch_tuple
implementations need to be smarter than just blindly fetching the
tuples for AMs that have optimizations similar to heap's HOT - the
currently alive tuple in the update chain needs to be fetched if
appropriate.
Similar to table_scan_getnextslot(), it's undesirable to continue
to return HeapTuples. Thus index_fetch_heap (might want to rename
that later) now accepts a slot as an argument. Core code doesn't
have a lot of call sites performing index scans without going
through the systable_* API (in contrast to loads of heap_getnext
calls and working directly with HeapTuples).
Index scans now store the result of a search in
IndexScanDesc->xs_heaptid, rather than xs_ctup->t_self. As the
target is not generally a HeapTuple anymore that seems cleaner.
To be able to sensible adapt code to use the above, two further
callbacks have been introduced:
a) slot_callbacks returns a TupleTableSlotOps* suitable for creating
slots capable of holding a tuple of the AMs
type. table_slot_callbacks() and table_slot_create() are based
upon that, but have additional logic to deal with views, foreign
tables, etc.
While this change could have been done separately, nearly all the
call sites that needed to be adapted for the rest of this commit
also would have been needed to be adapted for
table_slot_callbacks(), making separation not worthwhile.
b) tuple_satisfies_snapshot checks whether the tuple in a slot is
currently visible according to a snapshot. That's required as a few
places now don't have a buffer + HeapTuple around, but a
slot (which in heap's case internally has that information).
Additionally a few infrastructure changes were needed:
I) SysScanDesc, as used by systable_{beginscan, getnext} et al. now
internally uses a slot to keep track of tuples. While
systable_getnext() still returns HeapTuples, and will so for the
foreseeable future, the index API (see 1) above) now only deals with
slots.
The remainder, and largest part, of this commit is then adjusting all
scans in postgres to use the new APIs.
Author: Andres Freund, Haribabu Kommi, Alvaro Herrera
Discussion:
https://postgr.es/m/20180703070645.wchpu5muyto5n647@alap3.anarazel.de
https://postgr.es/m/20160812231527.GA690404@alvherre.pgsql
2019-03-11 20:46:41 +01:00
|
|
|
table_endscan(scan);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
2019-01-21 19:32:19 +01:00
|
|
|
table_close(rel, RowExclusiveLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get all relations for subscription.
|
|
|
|
*
|
2017-04-26 18:04:44 +02:00
|
|
|
* Returned list is palloc'ed in current memory context.
|
2017-03-23 13:36:36 +01:00
|
|
|
*/
|
|
|
|
List *
|
|
|
|
GetSubscriptionRelations(Oid subid)
|
|
|
|
{
|
|
|
|
List *res = NIL;
|
|
|
|
Relation rel;
|
|
|
|
HeapTuple tup;
|
|
|
|
int nkeys = 0;
|
2017-05-17 22:31:56 +02:00
|
|
|
ScanKeyData skey[2];
|
|
|
|
SysScanDesc scan;
|
2017-03-23 13:36:36 +01:00
|
|
|
|
2019-01-21 19:32:19 +01:00
|
|
|
rel = table_open(SubscriptionRelRelationId, AccessShareLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
ScanKeyInit(&skey[nkeys++],
|
|
|
|
Anum_pg_subscription_rel_srsubid,
|
|
|
|
BTEqualStrategyNumber, F_OIDEQ,
|
|
|
|
ObjectIdGetDatum(subid));
|
|
|
|
|
|
|
|
scan = systable_beginscan(rel, InvalidOid, false,
|
|
|
|
NULL, nkeys, skey);
|
|
|
|
|
|
|
|
while (HeapTupleIsValid(tup = systable_getnext(scan)))
|
|
|
|
{
|
2017-05-17 22:31:56 +02:00
|
|
|
Form_pg_subscription_rel subrel;
|
|
|
|
SubscriptionRelState *relstate;
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
subrel = (Form_pg_subscription_rel) GETSTRUCT(tup);
|
|
|
|
|
2017-05-17 22:31:56 +02:00
|
|
|
relstate = (SubscriptionRelState *) palloc(sizeof(SubscriptionRelState));
|
2017-03-23 13:36:36 +01:00
|
|
|
relstate->relid = subrel->srrelid;
|
|
|
|
relstate->state = subrel->srsubstate;
|
|
|
|
relstate->lsn = subrel->srsublsn;
|
|
|
|
|
|
|
|
res = lappend(res, relstate);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Cleanup */
|
|
|
|
systable_endscan(scan);
|
2019-01-21 19:32:19 +01:00
|
|
|
table_close(rel, AccessShareLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get all relations for subscription that are not in a ready state.
|
|
|
|
*
|
2017-04-26 18:04:44 +02:00
|
|
|
* Returned list is palloc'ed in current memory context.
|
2017-03-23 13:36:36 +01:00
|
|
|
*/
|
|
|
|
List *
|
|
|
|
GetSubscriptionNotReadyRelations(Oid subid)
|
|
|
|
{
|
|
|
|
List *res = NIL;
|
|
|
|
Relation rel;
|
|
|
|
HeapTuple tup;
|
|
|
|
int nkeys = 0;
|
2017-05-17 22:31:56 +02:00
|
|
|
ScanKeyData skey[2];
|
|
|
|
SysScanDesc scan;
|
2017-03-23 13:36:36 +01:00
|
|
|
|
2019-01-21 19:32:19 +01:00
|
|
|
rel = table_open(SubscriptionRelRelationId, AccessShareLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
ScanKeyInit(&skey[nkeys++],
|
|
|
|
Anum_pg_subscription_rel_srsubid,
|
|
|
|
BTEqualStrategyNumber, F_OIDEQ,
|
|
|
|
ObjectIdGetDatum(subid));
|
|
|
|
|
|
|
|
ScanKeyInit(&skey[nkeys++],
|
|
|
|
Anum_pg_subscription_rel_srsubstate,
|
|
|
|
BTEqualStrategyNumber, F_CHARNE,
|
|
|
|
CharGetDatum(SUBREL_STATE_READY));
|
|
|
|
|
|
|
|
scan = systable_beginscan(rel, InvalidOid, false,
|
|
|
|
NULL, nkeys, skey);
|
|
|
|
|
|
|
|
while (HeapTupleIsValid(tup = systable_getnext(scan)))
|
|
|
|
{
|
2017-05-17 22:31:56 +02:00
|
|
|
Form_pg_subscription_rel subrel;
|
|
|
|
SubscriptionRelState *relstate;
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
subrel = (Form_pg_subscription_rel) GETSTRUCT(tup);
|
|
|
|
|
2017-05-17 22:31:56 +02:00
|
|
|
relstate = (SubscriptionRelState *) palloc(sizeof(SubscriptionRelState));
|
2017-03-23 13:36:36 +01:00
|
|
|
relstate->relid = subrel->srrelid;
|
|
|
|
relstate->state = subrel->srsubstate;
|
|
|
|
relstate->lsn = subrel->srsublsn;
|
|
|
|
|
|
|
|
res = lappend(res, relstate);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Cleanup */
|
|
|
|
systable_endscan(scan);
|
2019-01-21 19:32:19 +01:00
|
|
|
table_close(rel, AccessShareLock);
|
2017-03-23 13:36:36 +01:00
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|