Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit0b11a67

Browse files
committed
Fix a boatload of typos in C comments.
Justin PryzbyDiscussion:https://postgr.es/m/20180331105640.GK28454@telsasoft.com
1 parent686d399 commit0b11a67

File tree

29 files changed

+32
-32
lines changed

29 files changed

+32
-32
lines changed

‎contrib/pgcrypto/rijndael.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -163,7 +163,7 @@ gen_tabs(void)
163163
q;
164164

165165
/* log and power tables for GF(2**8) finite field with*/
166-
/* 0x11b as modular polynomial - the simplestprmitive*/
166+
/* 0x11b as modular polynomial - the simplestprimitive*/
167167
/* root is 0x11, used here to generate the tables*/
168168

169169
for (i=0,p=1;i<256;++i)

‎src/backend/access/common/session.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -60,7 +60,7 @@ InitializeSession(void)
6060
* Initialize the per-session DSM segment if it isn't already initialized, and
6161
* return its handle so that worker processes can attach to it.
6262
*
63-
* Unlike the per-context DSM segment, thissegement and its contents are
63+
* Unlike the per-context DSM segment, thissegment and its contents are
6464
* reused for future parallel queries.
6565
*
6666
* Return DSM_HANDLE_INVALID if a segment can't be allocated due to lack of

‎src/backend/access/nbtree/nbtinsert.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -187,9 +187,9 @@ _bt_doinsert(Relation rel, IndexTuple itup,
187187
_bt_relbuf(rel,buf);
188188

189189
/*
190-
* Something did notworkout. Just forget about the cached
190+
* Something did notwork out. Just forget about the cached
191191
* block and follow the normal path. It might be set again if
192-
* the conditions arefavourble.
192+
* the conditions arefavourable.
193193
*/
194194
RelationSetTargetBlock(rel,InvalidBlockNumber);
195195
}

‎src/backend/executor/execProcnode.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -409,7 +409,7 @@ ExecSetExecProcNode(PlanState *node, ExecProcNodeMtd function)
409409
* Add a wrapper around the ExecProcNode callback that checks stack depth
410410
* during the first execution and maybe adds an instrumentation
411411
* wrapper. When the callback is changed after execution has already begun
412-
* that means we'llsuperflously execute ExecProcNodeFirst, but that seems
412+
* that means we'llsuperfluously execute ExecProcNodeFirst, but that seems
413413
* ok.
414414
*/
415415
node->ExecProcNodeReal=function;

‎src/backend/jit/llvm/llvmjit_expr.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1768,7 +1768,7 @@ llvm_compile_expr(ExprState *state)
17681768
b_compare_result,
17691769
b_null);
17701770

1771-
/* build blockanalying the !NULL comparator result */
1771+
/* build blockanalyzing the !NULL comparator result */
17721772
LLVMPositionBuilderAtEnd(b,b_compare_result);
17731773

17741774
/* if results equal, compare next, otherwise done */

‎src/backend/optimizer/geqo/geqo_misc.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -92,7 +92,7 @@ print_gen(FILE *fp, Pool *pool, int generation)
9292
{
9393
intlowest;
9494

95-
/* Get index to lowest ranking gene inpoplulation. */
95+
/* Get index to lowest ranking gene inpopulation. */
9696
/* Use 2nd to last since last is buffer. */
9797
lowest=pool->size>1 ?pool->size-2 :0;
9898

‎src/backend/optimizer/plan/planner.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -6709,7 +6709,7 @@ create_partial_grouping_paths(PlannerInfo *root,
67096709
* Gather Merge.
67106710
*
67116711
* NB: This function shouldn't be used for anything other than a grouped or
6712-
* partially grouped relation not only because of the fact that itexplcitly
6712+
* partially grouped relation not only because of the fact that itexplicitly
67136713
* references group_pathkeys but we pass "true" as the third argument to
67146714
* generate_gather_paths().
67156715
*/
@@ -6841,7 +6841,7 @@ apply_scanjoin_target_to_paths(PlannerInfo *root,
68416841
*/
68426842
rel->reltarget=llast_node(PathTarget,scanjoin_targets);
68436843

6844-
/* Special case:handly dummy relations separately. */
6844+
/* Special case:handle dummy relations separately. */
68456845
if (is_dummy_rel)
68466846
{
68476847
/*

‎src/backend/rewrite/rewriteHandler.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -710,7 +710,7 @@ adjustJoinTreeList(Query *parsetree, bool removert, int rt_index)
710710
* using the parent relation as reference. It must not do anything that
711711
* will not be correct when transposed to the child relation(s). (Step 4
712712
* is incorrect by this light, since child relations might have different
713-
*colun ordering, but the planner will fix things by re-sorting the tlist
713+
*column ordering, but the planner will fix things by re-sorting the tlist
714714
* for each child.)
715715
*/
716716
staticList*

‎src/backend/storage/ipc/ipc.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -374,7 +374,7 @@ on_shmem_exit(pg_on_exit_callback function, Datum arg)
374374
/* ----------------------------------------------------------------
375375
*cancel_before_shmem_exit
376376
*
377-
*this function removes a previously-registed before_shmem_exit
377+
*this function removes a previously-registered before_shmem_exit
378378
*callback. For simplicity, only the latest entry can be
379379
*removed. (We could work harder but there is no need for
380380
*current uses.)

‎src/backend/utils/adt/jsonfuncs.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1172,7 +1172,7 @@ get_object_field_end(void *state, char *fname, bool isnull)
11721172
if (get_last&&_state->result_start!=NULL)
11731173
{
11741174
/*
1175-
* make a text object from the string from theprevously noted json
1175+
* make a text object from the string from thepreviously noted json
11761176
* start up to the end of the previous token (the lexer is by now
11771177
* ahead of us on whatever came after what we're interested in).
11781178
*/

‎src/backend/utils/adt/oracle_compat.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -912,7 +912,7 @@ ascii(PG_FUNCTION_ARGS)
912912
*
913913
*Returns the character having the binary equivalent to val.
914914
*
915-
* For UTF8 we treat theargumwent as a Unicode code point.
915+
* For UTF8 we treat theargument as a Unicode code point.
916916
* For other multi-byte encodings we raise an error for arguments
917917
* outside the strict ASCII range (1..127).
918918
*

‎src/backend/utils/mmgr/dsa.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -649,7 +649,7 @@ dsa_pin_mapping(dsa_area *area)
649649
* will result in an ERROR.
650650
*
651651
* DSA_ALLOC_NO_OOM causes this function to return InvalidDsaPointer when
652-
* no memory is available or a size limitestabled by set_dsa_size_limit
652+
* no memory is available or a size limitestablished by set_dsa_size_limit
653653
* would be exceeded. Otherwise, such allocations will result in an ERROR.
654654
*
655655
* DSA_ALLOC_ZERO causes the allocated memory to be zeroed. Otherwise, the

‎src/backend/utils/sort/sharedtuplestore.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -386,7 +386,7 @@ sts_puttuple(SharedTuplestoreAccessor *accessor, void *meta_data,
386386
sts_flush_chunk(accessor);
387387

388388
/*
389-
* How manyoveflow chunks to go? This will allow readers to
389+
* How manyoverflow chunks to go? This will allow readers to
390390
* skip all of them at once instead of reading each one.
391391
*/
392392
accessor->write_chunk->overflow= (size+STS_CHUNK_DATA_SIZE-1) /

‎src/bin/pg_basebackup/pg_recvlogical.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -121,7 +121,7 @@ sendFeedback(PGconn *conn, TimestampTz now, bool force, bool replyRequested)
121121
intlen=0;
122122

123123
/*
124-
* we normally don't want to send superfluousfeedbacks, but if it's
124+
* we normally don't want to send superfluousfeedback, but if it's
125125
* because of a timeout we need to, otherwise wal_sender_timeout will kill
126126
* us.
127127
*/

‎src/bin/pg_dump/pg_dump.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -811,7 +811,7 @@ main(int argc, char **argv)
811811
/*
812812
* In binary-upgrade mode, we do not have to worry about the actual blob
813813
* data or the associated metadata that resides in the pg_largeobject and
814-
* pg_largeobject_metadata tables,respectivly.
814+
* pg_largeobject_metadata tables,respectively.
815815
*
816816
* However, we do need to collect blob information as there may be
817817
* comments or other information on blobs that we do need to dump out.

‎src/bin/psql/crosstabview.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@
1717
* too much time if the crosstab to generate happens to be unreasonably large
1818
* (worst case: a NxN cartesian product with N=number of tuples).
1919
* The value of 1600 corresponds to the maximum columns per table in storage,
20-
* but it could be as much as INT_MAXtheorically.
20+
* but it could be as much as INT_MAXtheoretically.
2121
*/
2222
#defineCROSSTABVIEW_MAX_COLUMNS 1600
2323

‎src/include/access/hash.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -239,7 +239,7 @@ typedef HashScanOpaqueData *HashScanOpaque;
239239
#defineHASH_SPLITPOINT_PHASE_MASK(HASH_SPLITPOINT_PHASES_PER_GRP - 1)
240240
#defineHASH_SPLITPOINT_GROUPS_WITH_ONE_PHASE10
241241

242-
/* defines max number ofsplitpoit phases a hash index can have */
242+
/* defines max number ofsplitpoint phases a hash index can have */
243243
#defineHASH_MAX_SPLITPOINT_GROUP32
244244
#defineHASH_MAX_SPLITPOINTS \
245245
(((HASH_MAX_SPLITPOINT_GROUP - HASH_SPLITPOINT_GROUPS_WITH_ONE_PHASE) * \

‎src/include/executor/hashjoin.h

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -190,7 +190,7 @@ typedef struct ParallelHashJoinBatch
190190

191191
/*
192192
* Each backend requires a small amount of per-batch state to interact with
193-
* eachParalellHashJoinBatch.
193+
* eachParallelHashJoinBatch.
194194
*/
195195
typedefstructParallelHashJoinBatchAccessor
196196
{
@@ -201,7 +201,7 @@ typedef struct ParallelHashJoinBatchAccessor
201201
size_tntuples;/* number of tuples */
202202
size_tsize;/* size of partition in memory */
203203
size_testimated_size;/* size of partition on disk */
204-
size_told_ntuples;/* how many tuples beforerepartioning? */
204+
size_told_ntuples;/* how many tuples beforerepartitioning? */
205205
boolat_least_one_chunk;/* has this backend allocated a chunk? */
206206

207207
booldone;/* flag to remember that a batch is done */

‎src/include/executor/nodeAgg.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -104,7 +104,7 @@ typedef struct AggStatePerTransData
104104
/*
105105
* Comparators for input columns --- only set/used when aggregate has
106106
* DISTINCT flag. equalfnOne version is used for single-column
107-
*commparisons, equalfnMulti for the case of multiple columns.
107+
*comparisons, equalfnMulti for the case of multiple columns.
108108
*/
109109
FmgrInfoequalfnOne;
110110
ExprState*equalfnMulti;

‎src/include/executor/tablefunc.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -47,7 +47,7 @@ struct TableFuncScanState;
4747
*
4848
* DestroyBuilder shall release all resources associated with a table builder
4949
* context. It may be called either because all rows have been consumed, or
50-
* because an errorocurred while processing the table expression.
50+
* because an erroroccurred while processing the table expression.
5151
*/
5252
typedefstructTableFuncRoutine
5353
{

‎src/include/jit/jit.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@
1515
#include"utils/resowner.h"
1616

1717

18-
/* Flagsdeterimining what kind of JIT operations to perform */
18+
/* Flagsdetermining what kind of JIT operations to perform */
1919
#definePGJIT_NONE 0
2020
#definePGJIT_PERFORM 1 << 0
2121
#definePGJIT_OPT3 1 << 1

‎src/include/jit/llvmjit.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -107,7 +107,7 @@ extern void llvm_inline(LLVMModuleRef mod);
107107

108108
/*
109109
****************************************************************************
110-
* Codeceneration functions.
110+
* Codegeneration functions.
111111
****************************************************************************
112112
*/
113113
externboolllvm_compile_expr(structExprState*state);

‎src/include/lib/dshash.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -42,7 +42,7 @@ typedef dshash_hash (*dshash_hash_function) (const void *v, size_t size,
4242
* Compare and hash functions must be supplied even when attaching, because we
4343
* can't safely share function pointers between backends in general. Either
4444
* the arg variants or the non-arg variants should be supplied; the other
45-
* function pointers should be NULL. If the argvarants are supplied then the
45+
* function pointers should be NULL. If the argvariants are supplied then the
4646
* user data pointer supplied to the create and attach functions will be
4747
* passed to the hash and compare functions.
4848
*/

‎src/include/mb/pg_wchar.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -410,7 +410,7 @@ extern const pg_wchar_tbl pg_wchar_table[];
410410
* points to a lookup table for the second byte. And so on.
411411
*
412412
* Physically, all the trees are stored in one big array, in 'chars16' or
413-
* 'chars32', depending on the maximum value that needs to bereprented. For
413+
* 'chars32', depending on the maximum value that needs to berepresented. For
414414
* each level in each tree, we also store lower and upper bound of allowed
415415
* values - values outside those bounds are considered invalid, and are left
416416
* out of the tables.

‎src/include/nodes/relation.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1444,7 +1444,7 @@ typedef JoinPath NestPath;
14441444
* that the executor need find only one match per outer tuple, and that the
14451445
* mergeclauses are sufficient to identify a match. In such cases the
14461446
* executor can immediately advance the outer relation after processing a
1447-
* match, andtherefoere it need never back up the inner relation.
1447+
* match, andtherefore it need never back up the inner relation.
14481448
*
14491449
* materialize_inner is true if a Material node should be placed atop the
14501450
* inner input. This may appear with or without an inner Sort step.

‎src/include/port.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -347,7 +347,7 @@ extern intisinf(double x);
347347
/*
348348
* Glibc doesn't use the builtin for clang due to a *gcc* bug in a version
349349
* newer than the gcc compatibility clang claims to have. This would cause a
350-
* *lot* ofsuperflous function calls, therefore revert when using clang.
350+
* *lot* ofsuperfluous function calls, therefore revert when using clang.
351351
*/
352352
#ifdef__clang__
353353
/* needs to be separate to not confuse other compilers */

‎src/interfaces/ecpg/ecpglib/data.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -471,7 +471,7 @@ ecpg_get_data(const PGresult *results, int act_tuple, int act_field, int lineno,
471471
memcpy(str,pval,size);
472472
str[varcharsize-1]='\0';
473473

474-
/*compatiblity mode empty string gets -1 indicator but no warning */
474+
/*compatibility mode empty string gets -1 indicator but no warning */
475475
if (size==0) {
476476
/* truncation */
477477
switch (ind_type)

‎src/interfaces/ecpg/pgtypeslib/interval.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -316,7 +316,7 @@ DecodeISO8601Interval(char *str,
316316
* places where DecodeTime is called; and added
317317
* int range = INTERVAL_FULL_RANGE;
318318
*
319-
** ECPGsemes not to have a global IntervalStyle
319+
** ECPGseems not to have a global IntervalStyle
320320
* so added
321321
*int IntervalStyle = INTSTYLE_POSTGRES;
322322
*/

‎src/pl/plpython/plpy_util.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -84,7 +84,7 @@ PLyUnicode_Bytes(PyObject *unicode)
8484
* function. The result is palloc'ed.
8585
*
8686
* Note that this function is disguised as PyString_AsString() when
87-
* using Python 3. That functionretuns a pointer into the internal
87+
* using Python 3. That functionreturns a pointer into the internal
8888
* memory of the argument, which isn't exactly the interface of this
8989
* function. But in either case you get a rather short-lived
9090
* reference that you ought to better leave alone.

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp