Updated comments.

Author: Antonin Houska

concurrent.c

@@ -342,14 +342,14 @@ apply_insert(Relation rel, HeapTuple tup, TupleTableSlot *slot,
 	Relation	rel_ins;
 	ResultRelInfo *rri = NULL;
 
-	/* Which partition does the tuple belong to? */
 	if (conv_map)
 		tup = convert_tuple_for_dest_table(tup, conv_map);
 	ExecStoreHeapTuple(tup, slot, false);
 	if (proute)
 	{
 		PartitionEntry	*entry;
 
+		/* Which partition does the tuple belong to? */
 		rri = ExecFindPartition(mtstate, mtstate->rootResultRelInfo,
 								proute, slot, estate);
 		rel_ins = rri->ri_RelationDesc;

pg_rewrite.c

@@ -1077,8 +1077,8 @@ rewrite_table_impl(char *relschema_src, char *relname_src,
 			 * Build scan key that we'll use to look for rows to be updated /
 			 * deleted during logical decoding.
 			 *
-			 * As all the partitions have the same identity index, there
-			 * should only be a single identity key.
+			 * As all the partitions have the same definition of the identity
+			 * index, there should only be a single identity key.
 			 */
 			if (ident_key == NULL)
 				ident_key = build_identity_key(entry->ident_index,
@@ -1372,9 +1372,9 @@ get_identity_index(Relation rel_dst, Relation rel_src)
 	tupdesc_src = RelationGetDescr(index_src);
 
 	/*
-	 * The tuple descriptors might not be equal, since some attributes of
-	 * rel_dst can have different types. What should match though is attribute
-	 * names and their order.
+	 * The tuple descriptors might not be equal, since some attributes can
+	 * have different types. What should match though is attribute names and
+	 * their order.
 	 */
 	if (tupdesc_src->natts != tupdesc_dst->natts)
 		match = false;