@@ -294,7 +294,7 @@ typedef struct TableAmRoutine
294
294
*
295
295
* *all_dead, if all_dead is not NULL, should be set to true by
296
296
* index_fetch_tuple iff it is guaranteed that no backend needs to see
297
- * that tuple. Index AMs can use that do avoid returning that tid in
297
+ * that tuple. Index AMs can use that to avoid returning that tid in
298
298
* future searches.
299
299
*/
300
300
bool (* index_fetch_tuple ) (struct IndexFetchTableData * scan ,
@@ -482,9 +482,9 @@ typedef struct TableAmRoutine
482
482
double * tups_recently_dead );
483
483
484
484
/*
485
- * React to VACUUM command on the relation. The VACUUM might be user
486
- * triggered or by autovacuum. The specific actions performed by the AM
487
- * will depend heavily on the individual AM.
485
+ * React to VACUUM command on the relation. The VACUUM can be
486
+ * triggered by a user or by autovacuum. The specific actions
487
+ * performed by the AM will depend heavily on the individual AM.
488
488
*
489
489
* On entry a transaction is already established, and the relation is
490
490
* locked with a ShareUpdateExclusive lock.
@@ -661,7 +661,7 @@ typedef struct TableAmRoutine
661
661
* false if the sample scan is finished, true otherwise. `scan` was
662
662
* started via table_beginscan_sampling().
663
663
*
664
- * Typically this will first determine the target block by call the
664
+ * Typically this will first determine the target block by calling the
665
665
* TsmRoutine's NextSampleBlock() callback if not NULL, or alternatively
666
666
* perform a sequential scan over all blocks. The determined block is
667
667
* then typically read and pinned.
@@ -679,7 +679,7 @@ typedef struct TableAmRoutine
679
679
*
680
680
* Currently it is required to implement this interface, as there's no
681
681
* alternative way (contrary e.g. to bitmap scans) to implement sample
682
- * scans. If infeasible to implement the AM may raise an error.
682
+ * scans. If infeasible to implement, the AM may raise an error.
683
683
*/
684
684
bool (* scan_sample_next_block ) (TableScanDesc scan ,
685
685
struct SampleScanState * scanstate );
@@ -1084,18 +1084,18 @@ table_compute_xid_horizon_for_tuples(Relation rel,
1084
1084
/*
1085
1085
* Insert a tuple from a slot into table AM routine.
1086
1086
*
1087
- * The options bitmask allows to specify options that allow to change the
1088
- * behaviour of the AM. Several options might be ignored by AMs not supporting
1089
- * them.
1087
+ * The options bitmask allows the caller to specify options that may change the
1088
+ * behaviour of the AM. The AM will ignore options that it does not support.
1090
1089
*
1091
1090
* If the TABLE_INSERT_SKIP_WAL option is specified, the new tuple doesn't
1092
1091
* need to be logged to WAL, even for a non-temp relation. It is the AMs
1093
1092
* choice whether this optimization is supported.
1094
1093
*
1095
1094
* If the TABLE_INSERT_SKIP_FSM option is specified, AMs are free to not reuse
1096
1095
* free space in the relation. This can save some cycles when we know the
1097
- * relation is new and doesn't contain useful amounts of free space. It's
1098
- * commonly passed directly to RelationGetBufferForTuple, see for more info.
1096
+ * relation is new and doesn't contain useful amounts of free space.
1097
+ * TABLE_INSERT_SKIP_FSM is commonly passed directly to
1098
+ * RelationGetBufferForTuple. See that method for more information.
1099
1099
*
1100
1100
* TABLE_INSERT_FROZEN should only be specified for inserts into
1101
1101
* relfilenodes created during the current subtransaction and when
@@ -1111,7 +1111,6 @@ table_compute_xid_horizon_for_tuples(Relation rel,
1111
1111
* Note that most of these options will be applied when inserting into the
1112
1112
* heap's TOAST table, too, if the tuple requires any out-of-line data.
1113
1113
*
1114
- *
1115
1114
* The BulkInsertState object (if any; bistate can be NULL for default
1116
1115
* behavior) is also just passed through to RelationGetBufferForTuple. If
1117
1116
* `bistate` is provided, table_finish_bulk_insert() needs to be called.
@@ -1383,13 +1382,13 @@ table_relation_copy_data(Relation rel, const RelFileNode *newrnode)
1383
1382
* Additional Input parameters:
1384
1383
* - use_sort - if true, the table contents are sorted appropriate for
1385
1384
* `OldIndex`; if false and OldIndex is not InvalidOid, the data is copied
1386
- * in that index's order; if false and OidIndex is InvalidOid, no sorting is
1385
+ * in that index's order; if false and OldIndex is InvalidOid, no sorting is
1387
1386
* performed
1388
- * - OidIndex - see use_sort
1387
+ * - OldIndex - see use_sort
1389
1388
* - OldestXmin - computed by vacuum_set_xid_limits(), even when
1390
1389
* not needed for the relation's AM
1391
- * - *xid_cutoff - dito
1392
- * - *multi_cutoff - dito
1390
+ * - *xid_cutoff - ditto
1391
+ * - *multi_cutoff - ditto
1393
1392
*
1394
1393
* Output parameters:
1395
1394
* - *xid_cutoff - rel's new relfrozenxid value, may be invalid
@@ -1416,10 +1415,10 @@ table_relation_copy_for_cluster(Relation OldTable, Relation NewTable,
1416
1415
}
1417
1416
1418
1417
/*
1419
- * Perform VACUUM on the relation. The VACUUM can be user- triggered or by
1418
+ * Perform VACUUM on the relation. The VACUUM can be triggered by a user or by
1420
1419
* autovacuum. The specific actions performed by the AM will depend heavily on
1421
1420
* the individual AM.
1422
-
1421
+ *
1423
1422
* On entry a transaction needs to already been established, and the
1424
1423
* table is locked with a ShareUpdateExclusive lock.
1425
1424
*
0 commit comments