mirror of
https://github.com/postgres/postgres.git
synced 2025-11-06 07:49:08 +03:00
Fix spelling errors and typos in comments
Author: Daniel Gustafsson <daniel@yesql.se>
This commit is contained in:
@@ -184,7 +184,7 @@ _bt_search(Relation rel, int keysz, ScanKey scankey, bool nextkey,
|
||||
|
||||
/*
|
||||
* If we're asked to lock leaf in write mode, but didn't manage to, then
|
||||
* relock. That may happend when root page appears to be leaf.
|
||||
* relock. That may happen when the root page appears to be leaf.
|
||||
*/
|
||||
if (access == BT_WRITE && page_access == BT_READ)
|
||||
{
|
||||
|
||||
@@ -487,7 +487,7 @@ AssignTransactionId(TransactionState s)
|
||||
|
||||
/*
|
||||
* Ensure parent(s) have XIDs, so that a child always has an XID later
|
||||
* than its parent. Musn't recurse here, or we might get a stack overflow
|
||||
* than its parent. Mustn't recurse here, or we might get a stack overflow
|
||||
* if we're at the bottom of a huge stack of subtransactions none of which
|
||||
* have XIDs yet.
|
||||
*/
|
||||
|
||||
@@ -834,7 +834,7 @@ DefineRelation(CreateStmt *stmt, char relkind, Oid ownerId,
|
||||
if (OidIsValid(defaultPartOid))
|
||||
defaultRel = heap_open(defaultPartOid, AccessExclusiveLock);
|
||||
|
||||
/* Tranform the bound values */
|
||||
/* Transform the bound values */
|
||||
pstate = make_parsestate(NULL);
|
||||
pstate->p_sourcetext = queryString;
|
||||
|
||||
|
||||
@@ -1622,7 +1622,7 @@ ExecInterpExpr(ExprState *state, ExprContext *econtext, bool *isnull)
|
||||
|
||||
/*
|
||||
* Evaluate aggregate transition / combine function that has a
|
||||
* by-value transition type. That's a seperate case from the
|
||||
* by-value transition type. That's a separate case from the
|
||||
* by-reference implementation because it's a bit simpler.
|
||||
*/
|
||||
EEO_CASE(EEOP_AGG_PLAIN_TRANS_BYVAL)
|
||||
|
||||
@@ -852,7 +852,7 @@ ExecCleanupTupleRouting(ModifyTableState *mtstate,
|
||||
{
|
||||
ResultRelInfo *resultRelInfo = proute->partitions[i];
|
||||
|
||||
/* skip further processsing for uninitialized partitions */
|
||||
/* skip further processing for uninitialized partitions */
|
||||
if (resultRelInfo == NULL)
|
||||
continue;
|
||||
|
||||
|
||||
@@ -438,7 +438,7 @@ llvm_optimize_module(LLVMJitContext *context, LLVMModuleRef module)
|
||||
|
||||
if (context->base.flags & PGJIT_OPT3)
|
||||
{
|
||||
/* TODO: Unscientifically determined threshhold */
|
||||
/* TODO: Unscientifically determined threshold */
|
||||
LLVMPassManagerBuilderUseInlinerWithThreshold(llvm_pmb, 512);
|
||||
}
|
||||
else
|
||||
@@ -853,7 +853,7 @@ llvm_split_symbol_name(const char *name, char **modname, char **funcname)
|
||||
{
|
||||
/*
|
||||
* Symbol names cannot contain a ., therefore we can split based on
|
||||
* first and last occurance of one.
|
||||
* first and last occurrence of one.
|
||||
*/
|
||||
*funcname = rindex(name, '.');
|
||||
(*funcname)++; /* jump over . */
|
||||
|
||||
@@ -65,7 +65,7 @@
|
||||
* and Group, which need these values to be available in their inputs.
|
||||
*
|
||||
* CP_IGNORE_TLIST specifies that the caller plans to replace the targetlist,
|
||||
* and therefore it doens't matter a bit what target list gets generated.
|
||||
* and therefore it doesn't matter a bit what target list gets generated.
|
||||
*/
|
||||
#define CP_EXACT_TLIST 0x0001 /* Plan must return specified tlist */
|
||||
#define CP_SMALL_TLIST 0x0002 /* Prefer narrower tlists */
|
||||
|
||||
@@ -26,7 +26,7 @@
|
||||
pg_atomic_cas:
|
||||
|
||||
! "cas" only works on sparcv9 and sparcv8plus chips, and
|
||||
! requies a compiler targeting these CPUs. It will fail
|
||||
! requires a compiler targeting these CPUs. It will fail
|
||||
! on a compiler targeting sparcv8, and of course will not
|
||||
! be understood by a sparcv8 CPU. gcc continues to use
|
||||
! "ldstub" because it targets sparcv7.
|
||||
|
||||
@@ -429,7 +429,7 @@ dsm_set_control_handle(dsm_handle h)
|
||||
* If there is a non-NULL CurrentResourceOwner, the new segment is associated
|
||||
* with it and must be detached before the resource owner releases, or a
|
||||
* warning will be logged. If CurrentResourceOwner is NULL, the segment
|
||||
* remains attached until explicitely detached or the session ends.
|
||||
* remains attached until explicitly detached or the session ends.
|
||||
* Creating with a NULL CurrentResourceOwner is equivalent to creating
|
||||
* with a non-NULL CurrentResourceOwner and then calling dsm_pin_mapping.
|
||||
*/
|
||||
@@ -527,7 +527,7 @@ dsm_create(Size size, int flags)
|
||||
* If there is a non-NULL CurrentResourceOwner, the attached segment is
|
||||
* associated with it and must be detached before the resource owner releases,
|
||||
* or a warning will be logged. Otherwise the segment remains attached until
|
||||
* explicitely detached or the session ends. See the note atop dsm_create().
|
||||
* explicitly detached or the session ends. See the note atop dsm_create().
|
||||
*/
|
||||
dsm_segment *
|
||||
dsm_attach(dsm_handle h)
|
||||
|
||||
@@ -1030,7 +1030,7 @@ WaitEventSetWait(WaitEventSet *set, long timeout,
|
||||
/*
|
||||
* Wait using linux's epoll_wait(2).
|
||||
*
|
||||
* This is the preferrable wait method, as several readiness notifications are
|
||||
* This is the preferable wait method, as several readiness notifications are
|
||||
* delivered, without having to iterate through all of set->events. The return
|
||||
* epoll_event struct contain a pointer to our events, making association
|
||||
* easy.
|
||||
|
||||
@@ -3706,7 +3706,7 @@ to_timestamp(PG_FUNCTION_ARGS)
|
||||
|
||||
/* ----------
|
||||
* TO_DATE
|
||||
* Make Date from date_str which is formated at argument 'fmt'
|
||||
* Make Date from date_str which is formatted at argument 'fmt'
|
||||
* ----------
|
||||
*/
|
||||
Datum
|
||||
|
||||
@@ -1363,7 +1363,7 @@ compareJsonbScalarValue(JsonbValue *aScalar, JsonbValue *bScalar)
|
||||
|
||||
|
||||
/*
|
||||
* Functions for manipulating the resizeable buffer used by convertJsonb and
|
||||
* Functions for manipulating the resizable buffer used by convertJsonb and
|
||||
* its subroutines.
|
||||
*/
|
||||
|
||||
|
||||
@@ -5040,7 +5040,7 @@ iterate_jsonb_values(Jsonb *jb, uint32 flags, void *state,
|
||||
|
||||
/*
|
||||
* Just recursively iterating over jsonb and call callback on all
|
||||
* correspoding elements
|
||||
* corresponding elements
|
||||
*/
|
||||
while ((type = JsonbIteratorNext(&it, &v, false)) != WJB_DONE)
|
||||
{
|
||||
|
||||
2
src/backend/utils/cache/attoptcache.c
vendored
2
src/backend/utils/cache/attoptcache.c
vendored
@@ -24,7 +24,7 @@
|
||||
#include "utils/syscache.h"
|
||||
|
||||
|
||||
/* Hash table for informations about each attribute's options */
|
||||
/* Hash table for information about each attribute's options */
|
||||
static HTAB *AttoptCacheHash = NULL;
|
||||
|
||||
/* attrelid and attnum form the lookup key, and must appear first */
|
||||
|
||||
2
src/backend/utils/cache/relfilenodemap.c
vendored
2
src/backend/utils/cache/relfilenodemap.c
vendored
@@ -29,7 +29,7 @@
|
||||
#include "utils/relfilenodemap.h"
|
||||
#include "utils/relmapper.h"
|
||||
|
||||
/* Hash table for informations about each relfilenode <-> oid pair */
|
||||
/* Hash table for information about each relfilenode <-> oid pair */
|
||||
static HTAB *RelfilenodeMapHash = NULL;
|
||||
|
||||
/* built first time through in InitializeRelfilenodeMap */
|
||||
|
||||
2
src/backend/utils/cache/typcache.c
vendored
2
src/backend/utils/cache/typcache.c
vendored
@@ -1869,7 +1869,7 @@ assign_record_type_identifier(Oid type_id, int32 typmod)
|
||||
}
|
||||
|
||||
/*
|
||||
* Return the amout of shmem required to hold a SharedRecordTypmodRegistry.
|
||||
* Return the amount of shmem required to hold a SharedRecordTypmodRegistry.
|
||||
* This exists only to avoid exposing private innards of
|
||||
* SharedRecordTypmodRegistry in a header.
|
||||
*/
|
||||
|
||||
Reference in New Issue
Block a user