From f32bdf5d0d3af5fd6ee6bf6430905f9c4bf5fefa Mon Sep 17 00:00:00 2001 From: Ashwin Agrawal Date: Fri, 24 May 2019 16:30:38 -0700 Subject: [PATCH v1 1/2] Fix typos in few tableam comments. --- src/backend/access/table/tableamapi.c | 2 +- src/include/access/tableam.h | 14 +++++++------- 2 files changed, 8 insertions(+), 8 deletions(-) diff --git a/src/backend/access/table/tableamapi.c b/src/backend/access/table/tableamapi.c index 32877e7674f..0df5ba35803 100644 --- a/src/backend/access/table/tableamapi.c +++ b/src/backend/access/table/tableamapi.c @@ -91,7 +91,7 @@ GetTableAmRoutine(Oid amhandler) Assert(routine->relation_estimate_size != NULL); - /* optional, but one callback implies presence of hte other */ + /* optional, but one callback implies presence of the other */ Assert((routine->scan_bitmap_next_block == NULL) == (routine->scan_bitmap_next_tuple == NULL)); Assert(routine->scan_sample_next_block != NULL); diff --git a/src/include/access/tableam.h b/src/include/access/tableam.h index 0b6ac15d316..2d06d52d71f 100644 --- a/src/include/access/tableam.h +++ b/src/include/access/tableam.h @@ -231,7 +231,7 @@ typedef struct TableAmRoutine /* * Estimate the size of shared memory needed for a parallel scan of this - * relation. The snapshot does not need to be accounted for. + * relation. */ Size (*parallelscan_estimate) (Relation rel); @@ -434,8 +434,8 @@ typedef struct TableAmRoutine * * Note that only the subset of the relcache filled by * RelationBuildLocalRelation() can be relied upon and that the relation's - * catalog entries either will either not yet exist (new relation), or - * will still reference the old relfilenode. + * catalog entries will either not yet exist (new relation), or will still + * reference the old relfilenode. * * As output *freezeXid, *minmulti must be set to the values appropriate * for pg_class.{relfrozenxid, relminmxid}. For AMs that don't need those @@ -591,7 +591,7 @@ typedef struct TableAmRoutine * See table_relation_estimate_size(). * * While block oriented, it shouldn't be too hard for an AM that doesn't - * doesn't internally use blocks to convert into a usable representation. + * internally use blocks to convert into a usable representation. * * This differs from the relation_size callback by returning size * estimates (both relation size and tuple count) for planning purposes, @@ -967,7 +967,7 @@ table_index_fetch_end(struct IndexFetchTableData *scan) * * *all_dead, if all_dead is not NULL, will be set to true by * table_index_fetch_tuple() iff it is guaranteed that no backend needs to see - * that tuple. Index AMs can use that do avoid returning that tid in future + * that tuple. Index AMs can use that to avoid returning that tid in future * searches. * * The difference between this function and table_fetch_row_version is that @@ -1014,8 +1014,8 @@ extern bool table_index_fetch_tuple_check(Relation rel, * true, false otherwise. * * See table_index_fetch_tuple's comment about what the difference between - * these functions is. This function is the correct to use outside of - * index entry->table tuple lookups. + * these functions is. This function is correct to use outside of index + * entry->table tuple lookups. */ static inline bool table_tuple_fetch_row_version(Relation rel, -- 2.19.1