@@ -119,7 +119,7 @@ typedef HashScanOpaqueData *HashScanOpaque;
119119#define HASH_VERSION 2/* 2 signifies only hash key value is stored */
120120
121121/*
122- *Spares [] holds the number of overflow pages currently allocated at or
122+ *spares [] holds the number of overflow pages currently allocated at or
123123 * before a certain splitpoint. For example, if spares[3] = 7 then there are
124124 * 7 ovflpages before splitpoint 3 (compare BUCKET_TO_BLKNO macro). The
125125 * value in spares[ovflpoint] increases as overflow pages are added at the
@@ -129,14 +129,14 @@ typedef HashScanOpaqueData *HashScanOpaque;
129129 *
130130 * ovflpages that have been recycled for reuse can be found by looking at
131131 * bitmaps that are stored within ovflpages dedicated for the purpose.
132- * The blknos of these bitmap pages are kept inbitmaps []; nmaps is the
132+ * The blknos of these bitmap pages are kept inmapp []; nmaps is the
133133 * number of currently existing bitmaps.
134134 *
135135 * The limitation on the size of spares[] comes from the fact that there's
136136 * no point in having more than 2^32 buckets with only uint32 hashcodes.
137137 * There is no particular upper limit on the size of mapp[], other than
138138 * needing to fit into the metapage. (With 8K block size, 128 bitmaps
139- * limit us to 64Gb of overflow space...)
139+ * limit us to 64GB of overflow space...)
140140 */
141141#define HASH_MAX_SPLITPOINTS 32
142142#define HASH_MAX_BITMAPS 128