@@ -984,12 +984,12 @@ table_index_fetch_end(struct IndexFetchTableData *scan)
984984 * that tuple. Index AMs can use that to avoid returning that tid in future
985985 * searches.
986986 *
987- * The difference between this function andtable_fetch_row_version is that
988- * this function returns the currently visible version of a row if the AM
989- * supports storing multiple row versions reachable via a single index entry
990- * (like heap's HOT). Whereastable_fetch_row_version only evaluates the
991- * tuple exactly at `tid`. Outside of index entry ->table tuple lookups,
992- * table_tuple_fetch_row_version is what's usually needed.
987+ * The difference between this function andtable_tuple_fetch_row_version()
988+ *is that this function returns the currently visible version of a row if
989+ *the AM supports storing multiple row versions reachable via a single index
990+ *entry (like heap's HOT). Whereastable_tuple_fetch_row_version() only
991+ *evaluates the tuple exactly at `tid`. Outside of index entry ->table tuple
992+ *lookups, table_tuple_fetch_row_version() is what's usually needed.
993993 */
994994static inline bool
995995table_index_fetch_tuple (struct IndexFetchTableData * scan ,
@@ -1043,8 +1043,9 @@ table_tuple_fetch_row_version(Relation rel,
10431043/*
10441044 * Verify that `tid` is a potentially valid tuple identifier. That doesn't
10451045 * mean that the pointed to row needs to exist or be visible, but that
1046- * attempting to fetch the row (e.g. with table_get_latest_tid() or
1047- * table_fetch_row_version()) should not error out if called with that tid.
1046+ * attempting to fetch the row (e.g. with table_tuple_get_latest_tid() or
1047+ * table_tuple_fetch_row_version()) should not error out if called with that
1048+ * tid.
10481049 *
10491050 * `scan` needs to have been started via table_beginscan().
10501051 */
@@ -1177,8 +1178,8 @@ table_tuple_complete_speculative(Relation rel, TupleTableSlot *slot,
11771178/*
11781179 * Insert multiple tuples into a table.
11791180 *
1180- * This is liketable_insert (), but inserts multiple tuples in one
1181- * operation. That's often faster than callingtable_insert () in a loop,
1181+ * This is liketable_tuple_insert (), but inserts multiple tuples in one
1182+ * operation. That's often faster than callingtable_tuple_insert () in a loop,
11821183 * because e.g. the AM can reduce WAL logging and page locking overhead.
11831184 *
11841185 * Except for taking `nslots` tuples as input, as an array of TupleTableSlots