mirror of
https://github.com/postgres/postgres.git
synced 2025-07-20 05:03:10 +03:00
pgindent run for 9.0
This commit is contained in:
Bruce Momjian
@ -8,7 +8,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/heapam.c,v 1.287 2010/02/14 18:42:12 rhaas Exp $
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/heapam.c,v 1.288 2010/02/26 02:00:33 momjian Exp $
|
||||
*
|
||||
*
|
||||
* INTERFACE ROUTINES
|
||||
@ -79,8 +79,8 @@ static HeapScanDesc heap_beginscan_internal(Relation relation,
|
||||
bool allow_strat, bool allow_sync,
|
||||
bool is_bitmapscan);
|
||||
static XLogRecPtr log_heap_update(Relation reln, Buffer oldbuf,
|
||||
ItemPointerData from, Buffer newbuf, HeapTuple newtup,
|
||||
bool all_visible_cleared, bool new_all_visible_cleared);
|
||||
ItemPointerData from, Buffer newbuf, HeapTuple newtup,
|
||||
bool all_visible_cleared, bool new_all_visible_cleared);
|
||||
static bool HeapSatisfiesHOTUpdate(Relation relation, Bitmapset *hot_attrs,
|
||||
HeapTuple oldtup, HeapTuple newtup);
|
||||
|
||||
@ -248,8 +248,8 @@ heapgetpage(HeapScanDesc scan, BlockNumber page)
|
||||
|
||||
/*
|
||||
* If the all-visible flag indicates that all tuples on the page are
|
||||
* visible to everyone, we can skip the per-tuple visibility tests.
|
||||
* But not in hot standby mode. A tuple that's already visible to all
|
||||
* visible to everyone, we can skip the per-tuple visibility tests. But
|
||||
* not in hot standby mode. A tuple that's already visible to all
|
||||
* transactions in the master might still be invisible to a read-only
|
||||
* transaction in the standby.
|
||||
*/
|
||||
@ -3667,8 +3667,8 @@ recheck_xmax:
|
||||
* someone setting xmax. Hence recheck after changing lock, same as for
|
||||
* xmax itself.
|
||||
*
|
||||
* Old-style VACUUM FULL is gone, but we have to keep this code as long
|
||||
* as we support having MOVED_OFF/MOVED_IN tuples in the database.
|
||||
* Old-style VACUUM FULL is gone, but we have to keep this code as long as
|
||||
* we support having MOVED_OFF/MOVED_IN tuples in the database.
|
||||
*/
|
||||
recheck_xvac:
|
||||
if (tuple->t_infomask & HEAP_MOVED)
|
||||
@ -4099,9 +4099,9 @@ heap_xlog_cleanup_info(XLogRecPtr lsn, XLogRecord *record)
|
||||
ResolveRecoveryConflictWithSnapshot(xlrec->latestRemovedXid, xlrec->node);
|
||||
|
||||
/*
|
||||
* Actual operation is a no-op. Record type exists to provide a means
|
||||
* for conflict processing to occur before we begin index vacuum actions.
|
||||
* see vacuumlazy.c and also comments in btvacuumpage()
|
||||
* Actual operation is a no-op. Record type exists to provide a means for
|
||||
* conflict processing to occur before we begin index vacuum actions. see
|
||||
* vacuumlazy.c and also comments in btvacuumpage()
|
||||
*/
|
||||
}
|
||||
|
||||
@ -4769,8 +4769,8 @@ heap_redo(XLogRecPtr lsn, XLogRecord *record)
|
||||
uint8 info = record->xl_info & ~XLR_INFO_MASK;
|
||||
|
||||
/*
|
||||
* These operations don't overwrite MVCC data so no conflict
|
||||
* processing is required. The ones in heap2 rmgr do.
|
||||
* These operations don't overwrite MVCC data so no conflict processing is
|
||||
* required. The ones in heap2 rmgr do.
|
||||
*/
|
||||
|
||||
RestoreBkpBlocks(lsn, record, false);
|
||||
@ -4809,8 +4809,8 @@ heap2_redo(XLogRecPtr lsn, XLogRecord *record)
|
||||
uint8 info = record->xl_info & ~XLR_INFO_MASK;
|
||||
|
||||
/*
|
||||
* Note that RestoreBkpBlocks() is called after conflict processing
|
||||
* within each record type handling function.
|
||||
* Note that RestoreBkpBlocks() is called after conflict processing within
|
||||
* each record type handling function.
|
||||
*/
|
||||
|
||||
switch (info & XLOG_HEAP_OPMASK)
|
||||
|
||||
@ -8,7 +8,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/pruneheap.c,v 1.21 2010/02/08 04:33:53 tgl Exp $
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/pruneheap.c,v 1.22 2010/02/26 02:00:33 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -29,8 +29,9 @@
|
||||
typedef struct
|
||||
{
|
||||
TransactionId new_prune_xid; /* new prune hint value for page */
|
||||
TransactionId latestRemovedXid; /* latest xid to be removed by this prune */
|
||||
int nredirected; /* numbers of entries in arrays below */
|
||||
TransactionId latestRemovedXid; /* latest xid to be removed by this
|
||||
* prune */
|
||||
int nredirected; /* numbers of entries in arrays below */
|
||||
int ndead;
|
||||
int nunused;
|
||||
/* arrays that accumulate indexes of items to be changed */
|
||||
@ -85,8 +86,8 @@ heap_page_prune_opt(Relation relation, Buffer buffer, TransactionId OldestXmin)
|
||||
|
||||
/*
|
||||
* We can't write WAL in recovery mode, so there's no point trying to
|
||||
* clean the page. The master will likely issue a cleaning WAL record
|
||||
* soon anyway, so this is no particular loss.
|
||||
* clean the page. The master will likely issue a cleaning WAL record soon
|
||||
* anyway, so this is no particular loss.
|
||||
*/
|
||||
if (RecoveryInProgress())
|
||||
return;
|
||||
@ -164,8 +165,8 @@ heap_page_prune(Relation relation, Buffer buffer, TransactionId OldestXmin,
|
||||
*
|
||||
* First, initialize the new pd_prune_xid value to zero (indicating no
|
||||
* prunable tuples). If we find any tuples which may soon become
|
||||
* prunable, we will save the lowest relevant XID in new_prune_xid.
|
||||
* Also initialize the rest of our working state.
|
||||
* prunable, we will save the lowest relevant XID in new_prune_xid. Also
|
||||
* initialize the rest of our working state.
|
||||
*/
|
||||
prstate.new_prune_xid = InvalidTransactionId;
|
||||
prstate.latestRemovedXid = InvalidTransactionId;
|
||||
@ -370,7 +371,7 @@ heap_prune_chain(Relation relation, Buffer buffer, OffsetNumber rootoffnum,
|
||||
{
|
||||
heap_prune_record_unused(prstate, rootoffnum);
|
||||
HeapTupleHeaderAdvanceLatestRemovedXid(htup,
|
||||
&prstate->latestRemovedXid);
|
||||
&prstate->latestRemovedXid);
|
||||
ndeleted++;
|
||||
}
|
||||
|
||||
@ -499,7 +500,7 @@ heap_prune_chain(Relation relation, Buffer buffer, OffsetNumber rootoffnum,
|
||||
{
|
||||
latestdead = offnum;
|
||||
HeapTupleHeaderAdvanceLatestRemovedXid(htup,
|
||||
&prstate->latestRemovedXid);
|
||||
&prstate->latestRemovedXid);
|
||||
}
|
||||
else if (!recent_dead)
|
||||
break;
|
||||
|
||||
@ -96,7 +96,7 @@
|
||||
* Portions Copyright (c) 1994-5, Regents of the University of California
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/rewriteheap.c,v 1.20 2010/02/03 10:01:29 heikki Exp $
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/rewriteheap.c,v 1.21 2010/02/26 02:00:33 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -281,7 +281,8 @@ end_heap_rewrite(RewriteState state)
|
||||
/* Write an XLOG UNLOGGED record if WAL-logging was skipped */
|
||||
if (!state->rs_use_wal && !state->rs_new_rel->rd_istemp)
|
||||
{
|
||||
char reason[NAMEDATALEN + 30];
|
||||
char reason[NAMEDATALEN + 30];
|
||||
|
||||
snprintf(reason, sizeof(reason), "heap rewrite on \"%s\"",
|
||||
RelationGetRelationName(state->rs_new_rel));
|
||||
XLogReportUnloggedStatement(reason);
|
||||
|
||||
@ -8,7 +8,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/tuptoaster.c,v 1.97 2010/02/04 00:09:13 tgl Exp $
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/tuptoaster.c,v 1.98 2010/02/26 02:00:33 momjian Exp $
|
||||
*
|
||||
*
|
||||
* INTERFACE ROUTINES
|
||||
@ -796,9 +796,9 @@ toast_insert_or_update(Relation rel, HeapTuple newtup, HeapTuple oldtup,
|
||||
}
|
||||
|
||||
/*
|
||||
* Finally we store attributes of type 'm' externally. At this point
|
||||
* we increase the target tuple size, so that 'm' attributes aren't
|
||||
* stored externally unless really necessary.
|
||||
* Finally we store attributes of type 'm' externally. At this point we
|
||||
* increase the target tuple size, so that 'm' attributes aren't stored
|
||||
* externally unless really necessary.
|
||||
*/
|
||||
maxDataLen = TOAST_TUPLE_TARGET_MAIN - hoff;
|
||||
|
||||
@ -1190,8 +1190,8 @@ toast_save_datum(Relation rel, Datum value, int options)
|
||||
*
|
||||
* Normally this is the actual OID of the target toast table, but during
|
||||
* table-rewriting operations such as CLUSTER, we have to insert the OID
|
||||
* of the table's real permanent toast table instead. rd_toastoid is
|
||||
* set if we have to substitute such an OID.
|
||||
* of the table's real permanent toast table instead. rd_toastoid is set
|
||||
* if we have to substitute such an OID.
|
||||
*/
|
||||
if (OidIsValid(rel->rd_toastoid))
|
||||
toast_pointer.va_toastrelid = rel->rd_toastoid;
|
||||
|
||||
@ -8,7 +8,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/visibilitymap.c,v 1.8 2010/02/09 21:43:29 tgl Exp $
|
||||
* $PostgreSQL: pgsql/src/backend/access/heap/visibilitymap.c,v 1.9 2010/02/26 02:00:33 momjian Exp $
|
||||
*
|
||||
* INTERFACE ROUTINES
|
||||
* visibilitymap_clear - clear a bit in the visibility map
|
||||
@ -19,7 +19,7 @@
|
||||
* NOTES
|
||||
*
|
||||
* The visibility map is a bitmap with one bit per heap page. A set bit means
|
||||
* that all tuples on the page are known visible to all transactions, and
|
||||
* that all tuples on the page are known visible to all transactions, and
|
||||
* therefore the page doesn't need to be vacuumed. The map is conservative in
|
||||
* the sense that we make sure that whenever a bit is set, we know the
|
||||
* condition is true, but if a bit is not set, it might or might not be true.
|
||||
@ -377,11 +377,10 @@ visibilitymap_truncate(Relation rel, BlockNumber nheapblocks)
|
||||
rel->rd_istemp);
|
||||
|
||||
/*
|
||||
* We might as well update the local smgr_vm_nblocks setting.
|
||||
* smgrtruncate sent an smgr cache inval message, which will cause
|
||||
* other backends to invalidate their copy of smgr_vm_nblocks, and
|
||||
* this one too at the next command boundary. But this ensures it
|
||||
* isn't outright wrong until then.
|
||||
* We might as well update the local smgr_vm_nblocks setting. smgrtruncate
|
||||
* sent an smgr cache inval message, which will cause other backends to
|
||||
* invalidate their copy of smgr_vm_nblocks, and this one too at the next
|
||||
* command boundary. But this ensures it isn't outright wrong until then.
|
||||
*/
|
||||
if (rel->rd_smgr)
|
||||
rel->rd_smgr->smgr_vm_nblocks = newnblocks;
|
||||
@ -411,7 +410,7 @@ vm_readbuf(Relation rel, BlockNumber blkno, bool extend)
|
||||
{
|
||||
if (smgrexists(rel->rd_smgr, VISIBILITYMAP_FORKNUM))
|
||||
rel->rd_smgr->smgr_vm_nblocks = smgrnblocks(rel->rd_smgr,
|
||||
VISIBILITYMAP_FORKNUM);
|
||||
VISIBILITYMAP_FORKNUM);
|
||||
else
|
||||
rel->rd_smgr->smgr_vm_nblocks = 0;
|
||||
}
|
||||
@ -466,8 +465,8 @@ vm_extend(Relation rel, BlockNumber vm_nblocks)
|
||||
RelationOpenSmgr(rel);
|
||||
|
||||
/*
|
||||
* Create the file first if it doesn't exist. If smgr_vm_nblocks
|
||||
* is positive then it must exist, no need for an smgrexists call.
|
||||
* Create the file first if it doesn't exist. If smgr_vm_nblocks is
|
||||
* positive then it must exist, no need for an smgrexists call.
|
||||
*/
|
||||
if ((rel->rd_smgr->smgr_vm_nblocks == 0 ||
|
||||
rel->rd_smgr->smgr_vm_nblocks == InvalidBlockNumber) &&
|
||||
|
||||
Reference in New Issue
Block a user