int notherbackends;
int npreparedxacts;
createdb_failure_params fparms;
+ Snapshot snapshot;
/* Extract options from the statement node tree */
foreach(option, stmt->options)
*/
RequestCheckpoint(CHECKPOINT_IMMEDIATE | CHECKPOINT_FORCE | CHECKPOINT_WAIT);
+ /*
+ * Take an MVCC snapshot to use while scanning through pg_tablespace. For
+ * safety, register the snapshot (this prevents it from changing if
+ * something else were to request a snapshot during the loop).
+ *
+ * Traversing pg_tablespace with an MVCC snapshot is necessary to provide
+ * us with a consistent view of the tablespaces that exist. Using
+ * SnapshotNow here would risk seeing the same tablespace multiple times,
+ * or worse not seeing a tablespace at all, if its tuple is moved around
+ * by a concurrent update (eg an ACL change).
+ *
+ * Inconsistency of this sort is inherent to all SnapshotNow scans, unless
+ * some lock is held to prevent concurrent updates of the rows being
+ * sought. There should be a generic fix for that, but in the meantime
+ * it's worth fixing this case in particular because we are doing very
+ * heavyweight operations within the scan, so that the elapsed time for
+ * the scan is vastly longer than for most other catalog scans. That
+ * means there's a much wider window for concurrent updates to cause
+ * trouble here than anywhere else. XXX this code should be changed
+ * whenever a generic fix is implemented.
+ */
+ snapshot = RegisterSnapshot(GetLatestSnapshot());
+
/*
* Once we start copying subdirectories, we need to be able to clean 'em
* up if we fail. Use an ENSURE block to make sure this happens. (This
* each one to the new database.
*/
rel = heap_open(TableSpaceRelationId, AccessShareLock);
- scan = heap_beginscan(rel, SnapshotNow, 0, NULL);
+ scan = heap_beginscan(rel, snapshot, 0, NULL);
while ((tuple = heap_getnext(scan, ForwardScanDirection)) != NULL)
{
Oid srctablespace = HeapTupleGetOid(tuple);
PG_END_ENSURE_ERROR_CLEANUP(createdb_failure_callback,
PointerGetDatum(&fparms));
+ /* Free our snapshot */
+ UnregisterSnapshot(snapshot);
+
return dboid;
}
Relation rel;
HeapScanDesc scan;
HeapTuple tuple;
+ Snapshot snapshot;
+
+ /*
+ * As in createdb(), we'd better use an MVCC snapshot here, since this
+ * scan can run for a long time. Duplicate visits to tablespaces would be
+ * harmless, but missing a tablespace could result in permanently leaked
+ * files.
+ *
+ * XXX change this when a generic fix for SnapshotNow races is implemented
+ */
+ snapshot = RegisterSnapshot(GetLatestSnapshot());
rel = heap_open(TableSpaceRelationId, AccessShareLock);
- scan = heap_beginscan(rel, SnapshotNow, 0, NULL);
+ scan = heap_beginscan(rel, snapshot, 0, NULL);
while ((tuple = heap_getnext(scan, ForwardScanDirection)) != NULL)
{
Oid dsttablespace = HeapTupleGetOid(tuple);
heap_endscan(scan);
heap_close(rel, AccessShareLock);
+ UnregisterSnapshot(snapshot);
}
/*
Relation rel;
HeapScanDesc scan;
HeapTuple tuple;
+ Snapshot snapshot;
+
+ /*
+ * As in createdb(), we'd better use an MVCC snapshot here; missing a
+ * tablespace could result in falsely reporting the OID is unique, with
+ * disastrous future consequences per the comment above.
+ *
+ * XXX change this when a generic fix for SnapshotNow races is implemented
+ */
+ snapshot = RegisterSnapshot(GetLatestSnapshot());
rel = heap_open(TableSpaceRelationId, AccessShareLock);
- scan = heap_beginscan(rel, SnapshotNow, 0, NULL);
+ scan = heap_beginscan(rel, snapshot, 0, NULL);
while ((tuple = heap_getnext(scan, ForwardScanDirection)) != NULL)
{
Oid dsttablespace = HeapTupleGetOid(tuple);
heap_endscan(scan);
heap_close(rel, AccessShareLock);
+ UnregisterSnapshot(snapshot);
+
return result;
}