diff options
Diffstat (limited to 'src/include')
| -rw-r--r-- | src/include/lib/ilist.h | 2 | ||||
| -rw-r--r-- | src/include/partitioning/partdesc.h | 2 | ||||
| -rw-r--r-- | src/include/port/simd.h | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/src/include/lib/ilist.h b/src/include/lib/ilist.h index e03aa1c683b..095107a99c4 100644 --- a/src/include/lib/ilist.h +++ b/src/include/lib/ilist.h @@ -39,7 +39,7 @@ * operations that can be done without branches (and thus faster) on lists * that use circular representation. However, it is often convenient to * initialize list headers to zeroes rather than setting them up with an - * explicit initialization function, so we also allow the NULL initalization. + * explicit initialization function, so we also allow the NULL initialization. * * EXAMPLES * diff --git a/src/include/partitioning/partdesc.h b/src/include/partitioning/partdesc.h index 7d71fb6e931..e157eae9c1e 100644 --- a/src/include/partitioning/partdesc.h +++ b/src/include/partitioning/partdesc.h @@ -31,7 +31,7 @@ typedef struct PartitionDescData int nparts; /* Number of partitions */ bool detached_exist; /* Are there any detached partitions? */ Oid *oids; /* Array of 'nparts' elements containing - * partition OIDs in order of the their bounds */ + * partition OIDs in order of their bounds */ bool *is_leaf; /* Array of 'nparts' elements storing whether * the corresponding 'oids' element belongs to * a leaf partition or not */ diff --git a/src/include/port/simd.h b/src/include/port/simd.h index c836360d4b7..1fa6c3bc6c4 100644 --- a/src/include/port/simd.h +++ b/src/include/port/simd.h @@ -345,7 +345,7 @@ vector8_ssub(const Vector8 v1, const Vector8 v2) #endif /* ! USE_NO_SIMD */ /* - * Return a vector with all bits set in each lane where the the corresponding + * Return a vector with all bits set in each lane where the corresponding * lanes in the inputs are equal. */ #ifndef USE_NO_SIMD |