"c.f." should be "cf.".
* this is noticeably cheaper and doesn't require catalog access.
*
* This test is safe since even an oid wraparound will preserve this
- * property (c.f. GetNewObjectId()) and it has the advantage that it works
+ * property (cf. GetNewObjectId()) and it has the advantage that it works
* correctly even if a user decides to create a relation in the pg_catalog
* namespace.
* ----
* WHERE CURRENT OF doesn't contain leaky function calls.
* Moreover, it is essential that this is considered non-leaky,
* since the planner must always generate a TID scan when CURRENT
- * OF is present -- c.f. cost_tidscan.
+ * OF is present -- cf. cost_tidscan.
*/
return false;
* all our platforms, but it also simplifies memory ordering concerns
* between the remote and local lsn. We use a lwlock instead of a spinlock
* so it's less harmful to hold the lock over a WAL write
- * (c.f. AdvanceReplicationProgress).
+ * (cf. AdvanceReplicationProgress).
*
* ---------------------------------------------------------------------------
*/
* they are written to the WAL and is responsible to reassemble them into
* toplevel transaction sized pieces. When a transaction is completely
* reassembled - signalled by reading the transaction commit record - it
- * will then call the output plugin (c.f. ReorderBufferCommit()) with the
+ * will then call the output plugin (cf. ReorderBufferCommit()) with the
* individual changes. The output plugins rely on snapshots built by
* snapbuild.c which hands them to us.
*
/*
* Execute invalidations happening outside the context of a decoded
* transaction. That currently happens either for xid-less commits
- * (c.f. RecordTransactionCommit()) or for invalidations in uninteresting
+ * (cf. RecordTransactionCommit()) or for invalidations in uninteresting
* transactions (via ReorderBufferForget()).
*/
void
* catalog in a transaction. During normal operation this is achieved by using
* CommandIds/cmin/cmax. The problem with that however is that for space
* efficiency reasons only one value of that is stored
- * (c.f. combocid.c). Since ComboCids are only available in memory we log
+ * (cf. combocid.c). Since ComboCids are only available in memory we log
* additional information which allows us to get the original (cmin, cmax)
* pair during visibility checks. Check the reorderbuffer.c's comment above
* ResolveCminCmaxDuringDecoding() for details.
/*
* latestObservedXid is at least set to the point where SUBTRANS was
- * started up to (c.f. ProcArrayInitRecovery()) or to the biggest xid
+ * started up to (cf. ProcArrayInitRecovery()) or to the biggest xid
* RecordKnownAssignedTransactionIds() was called for. Initialize
* subtrans from thereon, up to nextXid - 1.
*
/*
* This shouldn't happen as dropping a relation is intended to be
- * impossible if still referenced (c.f. CheckTableNotInUse()). But
+ * impossible if still referenced (cf. CheckTableNotInUse()). But
* if we get here anyway, we can't just delete the relcache entry,
* as it possibly could get accessed later (as e.g. the error
* might get trapped and handled via a subtransaction rollback).
/*
* In 9.0+, we have column comments for: relations, views, composite
- * types, and foreign tables (c.f. CommentObject() in comment.c).
+ * types, and foreign tables (cf. CommentObject() in comment.c).
*/
if (tableinfo.relkind == RELKIND_RELATION ||
tableinfo.relkind == RELKIND_VIEW ||