mirror of
https://github.com/postgres/postgres.git
synced 2025-04-20 00:42:27 +03:00
Fix typos in the code
Author: Vignesh C Reviewed-by: Dilip Kumar, Michael Paquier Discussion: https://postgr.es/m/CALDaNm0ni+GAOe4+fbXiOxNrVudajMYmhJFtXGX-zBPoN8ixhw@mail.gmail.com
This commit is contained in:
parent
517bf2d910
commit
6ca86bb7e9
@ -467,7 +467,7 @@ comp_ptrgm(const void *v1, const void *v2)
|
|||||||
* ulen1: count of unique trigrams of array "trg1".
|
* ulen1: count of unique trigrams of array "trg1".
|
||||||
* len2: length of array "trg2" and array "trg2indexes".
|
* len2: length of array "trg2" and array "trg2indexes".
|
||||||
* len: length of the array "found".
|
* len: length of the array "found".
|
||||||
* lags: set of boolean flags parametrizing similarity calculation.
|
* lags: set of boolean flags parameterizing similarity calculation.
|
||||||
* bounds: whether each trigram is left/right bound of word.
|
* bounds: whether each trigram is left/right bound of word.
|
||||||
*
|
*
|
||||||
* Returns word similarity.
|
* Returns word similarity.
|
||||||
@ -632,7 +632,7 @@ iterate_word_similarity(int *trg2indexes,
|
|||||||
*
|
*
|
||||||
* str1: search pattern string, of length slen1 bytes.
|
* str1: search pattern string, of length slen1 bytes.
|
||||||
* str2: text in which we are looking for a word, of length slen2 bytes.
|
* str2: text in which we are looking for a word, of length slen2 bytes.
|
||||||
* flags: set of boolean flags parametrizing similarity calculation.
|
* flags: set of boolean flags parameterizing similarity calculation.
|
||||||
*
|
*
|
||||||
* Returns word similarity.
|
* Returns word similarity.
|
||||||
*/
|
*/
|
||||||
|
@ -169,7 +169,7 @@ pgp_get_keyid(MBuf *pgp_data, char *dst)
|
|||||||
break;
|
break;
|
||||||
case PGP_PKT_SYMENCRYPTED_SESSKEY:
|
case PGP_PKT_SYMENCRYPTED_SESSKEY:
|
||||||
got_symenc_key++;
|
got_symenc_key++;
|
||||||
/* fallthru */
|
/* fall through */
|
||||||
case PGP_PKT_SIGNATURE:
|
case PGP_PKT_SIGNATURE:
|
||||||
case PGP_PKT_MARKER:
|
case PGP_PKT_MARKER:
|
||||||
case PGP_PKT_TRUST:
|
case PGP_PKT_TRUST:
|
||||||
|
@ -74,7 +74,7 @@ sepgsql_database_post_create(Oid databaseId, const char *dtemplate)
|
|||||||
* Compute a default security label of the newly created database based on
|
* Compute a default security label of the newly created database based on
|
||||||
* a pair of security label of client and source database.
|
* a pair of security label of client and source database.
|
||||||
*
|
*
|
||||||
* XXX - uncoming version of libselinux supports to take object name to
|
* XXX - upcoming version of libselinux supports to take object name to
|
||||||
* handle special treatment on default security label.
|
* handle special treatment on default security label.
|
||||||
*/
|
*/
|
||||||
rel = table_open(DatabaseRelationId, AccessShareLock);
|
rel = table_open(DatabaseRelationId, AccessShareLock);
|
||||||
|
@ -85,7 +85,7 @@ fixup_whole_row_references(Oid relOid, Bitmapset *columns)
|
|||||||
* When user is querying on a table with children, it implicitly accesses
|
* When user is querying on a table with children, it implicitly accesses
|
||||||
* child tables also. So, we also need to check security label of child
|
* child tables also. So, we also need to check security label of child
|
||||||
* tables and columns, but here is no guarantee attribute numbers are
|
* tables and columns, but here is no guarantee attribute numbers are
|
||||||
* same between the parent ans children.
|
* same between the parent and children.
|
||||||
* It returns a bitmapset which contains attribute number of the child
|
* It returns a bitmapset which contains attribute number of the child
|
||||||
* table based on the given bitmapset of the parent.
|
* table based on the given bitmapset of the parent.
|
||||||
*/
|
*/
|
||||||
|
@ -51,7 +51,7 @@ sepgsql_schema_post_create(Oid namespaceId)
|
|||||||
* Compute a default security label when we create a new schema object
|
* Compute a default security label when we create a new schema object
|
||||||
* under the working database.
|
* under the working database.
|
||||||
*
|
*
|
||||||
* XXX - uncoming version of libselinux supports to take object name to
|
* XXX - upcoming version of libselinux supports to take object name to
|
||||||
* handle special treatment on default security label; such as special
|
* handle special treatment on default security label; such as special
|
||||||
* label on "pg_temp" schema.
|
* label on "pg_temp" schema.
|
||||||
*/
|
*/
|
||||||
|
@ -501,8 +501,8 @@ toast_fetch_datum(struct varlena *attr)
|
|||||||
* in the toast relation
|
* in the toast relation
|
||||||
*
|
*
|
||||||
* Note that this function supports non-compressed external datums
|
* Note that this function supports non-compressed external datums
|
||||||
* and compressed external datums (in which case the requrested slice
|
* and compressed external datums (in which case the requested slice
|
||||||
* has to be a prefix, i.e. sliceoffset has to be 0).
|
* has to be a prefix, i.e. sliceoffset has to be 0).
|
||||||
* ----------
|
* ----------
|
||||||
*/
|
*/
|
||||||
static struct varlena *
|
static struct varlena *
|
||||||
|
@ -814,7 +814,7 @@ _bt_bestsplitloc(FindSplitData *state, int perfectpenalty,
|
|||||||
final->firstoldonright < state->newitemoff + MAX_LEAF_INTERVAL)
|
final->firstoldonright < state->newitemoff + MAX_LEAF_INTERVAL)
|
||||||
{
|
{
|
||||||
/*
|
/*
|
||||||
* Avoid the problem by peforming a 50:50 split when the new item is
|
* Avoid the problem by performing a 50:50 split when the new item is
|
||||||
* just to the right of the would-be "many duplicates" split point.
|
* just to the right of the would-be "many duplicates" split point.
|
||||||
*/
|
*/
|
||||||
final = &state->splits[0];
|
final = &state->splits[0];
|
||||||
|
@ -1052,7 +1052,7 @@ XLogWalRcvFlush(bool dying)
|
|||||||
* false, this is a no-op.
|
* false, this is a no-op.
|
||||||
*
|
*
|
||||||
* If 'requestReply' is true, requests the server to reply immediately upon
|
* If 'requestReply' is true, requests the server to reply immediately upon
|
||||||
* receiving this message. This is used for heartbearts, when approaching
|
* receiving this message. This is used for heartbeats, when approaching
|
||||||
* wal_receiver_timeout.
|
* wal_receiver_timeout.
|
||||||
*/
|
*/
|
||||||
static void
|
static void
|
||||||
|
@ -476,7 +476,7 @@ sort_item_compare(const void *a, const void *b, void *arg)
|
|||||||
* build_column_frequencies
|
* build_column_frequencies
|
||||||
* compute frequencies of values in each column
|
* compute frequencies of values in each column
|
||||||
*
|
*
|
||||||
* This returns an array of SortItems for each attibute the MCV is built
|
* This returns an array of SortItems for each attribute the MCV is built
|
||||||
* on, with a frequency (number of occurrences) for each value. This is
|
* on, with a frequency (number of occurrences) for each value. This is
|
||||||
* then used to compute "base" frequency of MCV items.
|
* then used to compute "base" frequency of MCV items.
|
||||||
*
|
*
|
||||||
|
@ -1208,7 +1208,7 @@ BufferAlloc(SMgrRelation smgr, char relpersistence, ForkNumber forkNum,
|
|||||||
LWLockAcquire(newPartitionLock, LW_EXCLUSIVE);
|
LWLockAcquire(newPartitionLock, LW_EXCLUSIVE);
|
||||||
/* remember we have no old-partition lock or tag */
|
/* remember we have no old-partition lock or tag */
|
||||||
oldPartitionLock = NULL;
|
oldPartitionLock = NULL;
|
||||||
/* this just keeps the compiler quiet about uninit variables */
|
/* keep the compiler quiet about uninitialized variables */
|
||||||
oldHash = 0;
|
oldHash = 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -636,7 +636,7 @@ PublishStartupProcessInformation(void)
|
|||||||
}
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Used from bufgr to share the value of the buffer that Startup waits on,
|
* Used from bufmgr to share the value of the buffer that Startup waits on,
|
||||||
* or to reset the value to "not waiting" (-1). This allows processing
|
* or to reset the value to "not waiting" (-1). This allows processing
|
||||||
* of recovery conflicts for buffer pins. Set is made before backends look
|
* of recovery conflicts for buffer pins. Set is made before backends look
|
||||||
* at this value, so locking not required, especially since the set is
|
* at this value, so locking not required, especially since the set is
|
||||||
|
@ -205,7 +205,7 @@ struct ColumnIOData
|
|||||||
Oid typid; /* column type id */
|
Oid typid; /* column type id */
|
||||||
int32 typmod; /* column type modifier */
|
int32 typmod; /* column type modifier */
|
||||||
TypeCat typcat; /* column type category */
|
TypeCat typcat; /* column type category */
|
||||||
ScalarIOData scalar_io; /* metadata cache for directi conversion
|
ScalarIOData scalar_io; /* metadata cache for direct conversion
|
||||||
* through input function */
|
* through input function */
|
||||||
union
|
union
|
||||||
{
|
{
|
||||||
|
@ -1692,7 +1692,7 @@ FreePageManagerPutInternal(FreePageManager *fpm, Size first_page, Size npages,
|
|||||||
|
|
||||||
/*
|
/*
|
||||||
* The act of allocating pages to recycle may have invalidated the
|
* The act of allocating pages to recycle may have invalidated the
|
||||||
* results of our previous btree reserch, so repeat it. (We could
|
* results of our previous btree research, so repeat it. (We could
|
||||||
* recheck whether any of our split-avoidance strategies that were
|
* recheck whether any of our split-avoidance strategies that were
|
||||||
* not viable before now are, but it hardly seems worthwhile, so
|
* not viable before now are, but it hardly seems worthwhile, so
|
||||||
* we don't bother. Consolidation can't be possible now if it
|
* we don't bother. Consolidation can't be possible now if it
|
||||||
|
@ -333,7 +333,7 @@ reap_child(bool wait_for_child)
|
|||||||
thread_handles[thread_num] = thread_handles[parallel_jobs - 1];
|
thread_handles[thread_num] = thread_handles[parallel_jobs - 1];
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Move last active thead arg struct into the now-dead slot, and the
|
* Move last active thread arg struct into the now-dead slot, and the
|
||||||
* now-dead slot to the end for reuse by the next thread. Though the
|
* now-dead slot to the end for reuse by the next thread. Though the
|
||||||
* thread struct is in use by another thread, we can safely swap the
|
* thread struct is in use by another thread, we can safely swap the
|
||||||
* struct pointers within the array.
|
* struct pointers within the array.
|
||||||
|
@ -1490,7 +1490,7 @@ psql_completion(const char *text, int start, int end)
|
|||||||
else if (TailMatches("CREATE"))
|
else if (TailMatches("CREATE"))
|
||||||
matches = completion_matches(text, create_command_generator);
|
matches = completion_matches(text, create_command_generator);
|
||||||
|
|
||||||
/* complete with somthing you can create or replace */
|
/* complete with something you can create or replace */
|
||||||
else if (TailMatches("CREATE", "OR", "REPLACE"))
|
else if (TailMatches("CREATE", "OR", "REPLACE"))
|
||||||
COMPLETE_WITH("FUNCTION", "PROCEDURE", "LANGUAGE", "RULE", "VIEW",
|
COMPLETE_WITH("FUNCTION", "PROCEDURE", "LANGUAGE", "RULE", "VIEW",
|
||||||
"AGGREGATE", "TRANSFORM");
|
"AGGREGATE", "TRANSFORM");
|
||||||
|
@ -819,7 +819,7 @@ rfmtlong(long lng_val, const char *fmt, char *outbuf)
|
|||||||
sign = 1;
|
sign = 1;
|
||||||
if (leftalign)
|
if (leftalign)
|
||||||
{
|
{
|
||||||
/* can't use strncat(,,0) here, Solaris would freek out */
|
/* can't use strncat(,,0) here, Solaris would freak out */
|
||||||
if (sign)
|
if (sign)
|
||||||
if (signdone)
|
if (signdone)
|
||||||
{
|
{
|
||||||
|
@ -17,7 +17,7 @@
|
|||||||
#include "pgtypeslib_extern.h"
|
#include "pgtypeslib_extern.h"
|
||||||
|
|
||||||
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
||||||
* and changesd struct pg_tm to struct tm
|
* and changed struct pg_tm to struct tm
|
||||||
*/
|
*/
|
||||||
static void
|
static void
|
||||||
AdjustFractSeconds(double frac, struct /* pg_ */ tm *tm, fsec_t *fsec, int scale)
|
AdjustFractSeconds(double frac, struct /* pg_ */ tm *tm, fsec_t *fsec, int scale)
|
||||||
@ -35,7 +35,7 @@ AdjustFractSeconds(double frac, struct /* pg_ */ tm *tm, fsec_t *fsec, int scale
|
|||||||
|
|
||||||
|
|
||||||
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
||||||
* and changesd struct pg_tm to struct tm
|
* and changed struct pg_tm to struct tm
|
||||||
*/
|
*/
|
||||||
static void
|
static void
|
||||||
AdjustFractDays(double frac, struct /* pg_ */ tm *tm, fsec_t *fsec, int scale)
|
AdjustFractDays(double frac, struct /* pg_ */ tm *tm, fsec_t *fsec, int scale)
|
||||||
@ -88,7 +88,7 @@ ISO8601IntegerWidth(const char *fieldstart)
|
|||||||
|
|
||||||
|
|
||||||
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
||||||
* and changesd struct pg_tm to struct tm
|
* and changed struct pg_tm to struct tm
|
||||||
*/
|
*/
|
||||||
static inline void
|
static inline void
|
||||||
ClearPgTm(struct /* pg_ */ tm *tm, fsec_t *fsec)
|
ClearPgTm(struct /* pg_ */ tm *tm, fsec_t *fsec)
|
||||||
@ -104,7 +104,7 @@ ClearPgTm(struct /* pg_ */ tm *tm, fsec_t *fsec)
|
|||||||
|
|
||||||
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
||||||
*
|
*
|
||||||
* * changesd struct pg_tm to struct tm
|
* * changed struct pg_tm to struct tm
|
||||||
*
|
*
|
||||||
* * Made the function static
|
* * Made the function static
|
||||||
*/
|
*/
|
||||||
@ -311,7 +311,7 @@ DecodeISO8601Interval(char *str,
|
|||||||
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
/* copy&pasted from .../src/backend/utils/adt/datetime.c
|
||||||
* with 3 exceptions
|
* with 3 exceptions
|
||||||
*
|
*
|
||||||
* * changesd struct pg_tm to struct tm
|
* * changed struct pg_tm to struct tm
|
||||||
*
|
*
|
||||||
* * ECPG code called this without a 'range' parameter
|
* * ECPG code called this without a 'range' parameter
|
||||||
* removed 'int range' from the argument list and
|
* removed 'int range' from the argument list and
|
||||||
|
Loading…
x
Reference in New Issue
Block a user