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

Commitc74d49d

Browse files
committed
Fix many typos and inconsistencies
Author: Alexander LakhinDiscussion:https://postgr.es/m/af27d1b3-a128-9d62-46e0-88f424397f44@gmail.com
1 parent459c3cd commitc74d49d

File tree

50 files changed

+76
-89
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

50 files changed

+76
-89
lines changed

‎contrib/bloom/blutils.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -341,7 +341,7 @@ BloomPageAddItem(BloomState *state, Page page, BloomTuple *tuple)
341341
/*
342342
* Allocate a new page (either by recycling, or by extending the index file)
343343
* The returned buffer is already pinned and exclusive-locked
344-
* Caller is responsible for initializing the page by callingBloomInitBuffer
344+
* Caller is responsible for initializing the page by callingBloomInitPage
345345
*/
346346
Buffer
347347
BloomNewBuffer(Relationindex)

‎contrib/intarray/_int_selfuncs.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -43,7 +43,7 @@ static intcompare_val_int4(const void *a, const void *b);
4343
*
4444
* The default array selectivity operators for the @>, && and @< operators
4545
* work fine for integer arrays. However, if we tried to just use arraycontsel
46-
* andarracontjoinsel directly as the cost estimator functions for our
46+
* andarraycontjoinsel directly as the cost estimator functions for our
4747
* operators, they would not work as intended, because they look at the
4848
* operator's OID. Our operators behave exactly like the built-in anyarray
4949
* versions, but we must tell the cost estimator functions which built-in

‎contrib/pg_trgm/trgm_regexp.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -441,9 +441,9 @@ typedef struct
441441
structTrgmPackedGraph
442442
{
443443
/*
444-
* colorTrigramsCount andcolorTrigramsGroups contain information about
445-
*howtrigrams are grouped into color trigrams. "colorTrigramsCount" is
446-
*thecount of color trigrams and "colorTrigramGroups" contains number of
444+
* colorTrigramsCount andcolorTrigramGroups contain information about how
445+
* trigrams are grouped into color trigrams. "colorTrigramsCount" is the
446+
* count of color trigrams and "colorTrigramGroups" contains number of
447447
* simple trigrams for each color trigram. The array of simple trigrams
448448
* (stored separately from this struct) is ordered so that the simple
449449
* trigrams for each color trigram are consecutive, and they're in order

‎contrib/pgcrypto/crypt-des.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@
1111
*binaries of libcrypt exportable from the USA
1212
*
1313
* Adapted for FreeBSD-4.0 by Mark R V Murray
14-
*this file should now *only* exportcrypt_des(), in order to make
14+
*this file should now *only* exportpx_crypt_des(), in order to make
1515
*a module that can be optionally included in libcrypt.
1616
*
1717
* Redistribution and use in source and binary forms, with or without

‎contrib/postgres_fdw/expected/postgres_fdw.out

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -665,7 +665,7 @@ EXPLAIN (VERBOSE, COSTS OFF) SELECT * FROM ft1 t1 WHERE c1 = ANY(ARRAY[c2, 1, c1
665665
Remote SQL: SELECT "C 1", c2, c3, c4, c5, c6, c7, c8 FROM "S 1"."T 1" WHERE (("C 1" = ANY (ARRAY[c2, 1, ("C 1" + 0)])))
666666
(3 rows)
667667

668-
EXPLAIN (VERBOSE, COSTS OFF) SELECT * FROM ft1 t1 WHERE c1 = (ARRAY[c1,c2,3])[1]; --ArrayRef
668+
EXPLAIN (VERBOSE, COSTS OFF) SELECT * FROM ft1 t1 WHERE c1 = (ARRAY[c1,c2,3])[1]; --SubscriptingRef
669669
QUERY PLAN
670670
----------------------------------------------------------------------------------------------------------------------
671671
Foreign Scan on public.ft1 t1

‎contrib/postgres_fdw/sql/postgres_fdw.sql

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -297,7 +297,7 @@ EXPLAIN (VERBOSE, COSTS OFF) SELECT * FROM ft1 t1 WHERE c1 = -c1; -- Op
297297
EXPLAIN (VERBOSE, COSTS OFF)SELECT*FROM ft1 t1WHERE1= c1!;-- OpExpr(r)
298298
EXPLAIN (VERBOSE, COSTS OFF)SELECT*FROM ft1 t1WHERE (c1IS NOT NULL) IS DISTINCTFROM (c1IS NOT NULL);-- DistinctExpr
299299
EXPLAIN (VERBOSE, COSTS OFF)SELECT*FROM ft1 t1WHERE c1= ANY(ARRAY[c2,1, c1+0]);-- ScalarArrayOpExpr
300-
EXPLAIN (VERBOSE, COSTS OFF)SELECT*FROM ft1 t1WHERE c1= (ARRAY[c1,c2,3])[1];--ArrayRef
300+
EXPLAIN (VERBOSE, COSTS OFF)SELECT*FROM ft1 t1WHERE c1= (ARRAY[c1,c2,3])[1];--SubscriptingRef
301301
EXPLAIN (VERBOSE, COSTS OFF)SELECT*FROM ft1 t1WHERE c6= E'foo''s\\bar';-- check special chars
302302
EXPLAIN (VERBOSE, COSTS OFF)SELECT*FROM ft1 t1WHERE c8='foo';-- can't be sent to remote
303303
-- parameterized remote path for foreign table

‎doc/src/sgml/diskusage.sgml

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -87,9 +87,9 @@ WHERE c.relname = 'customer' AND
8787
c2.oid = i.indexrelid
8888
ORDER BY c2.relname;
8989

90-
relname | relpages
91-
----------------------+----------
92-
customer_id_indexdex | 26
90+
relname | relpages
91+
-------------------+----------
92+
customer_id_index | 26
9393
</programlisting>
9494
</para>
9595

‎src/backend/access/brin/brin_tuple.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
/*
2-
*brin_tuples.c
2+
*brin_tuple.c
33
*Method implementations for tuples in BRIN indexes.
44
*
55
* Intended usage is that code outside this file only deals with
@@ -207,7 +207,7 @@ brin_form_tuple(BrinDesc *brdesc, BlockNumber blkno, BrinMemTuple *tuple,
207207
/*
208208
* Note that we reverse the sense of null bits in this module: we
209209
* store a 1 for a null attribute rather than a 0. So we must reverse
210-
* the sense of the att_isnull test inbr_deconstruct_tuple as well.
210+
* the sense of the att_isnull test inbrin_deconstruct_tuple as well.
211211
*/
212212
bitP= ((bits8*) ((char*)rettuple+SizeOfBrinTuple))-1;
213213
bitmask=HIGHBIT;

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -621,8 +621,8 @@ btparallelrescan(IndexScanDesc scan)
621621

622622
/*
623623
* _bt_parallel_seize() -- Begin the process of advancing the scan to a new
624-
*page. Other scans must wait until we callbt_parallel_release() or
625-
*bt_parallel_done().
624+
*page. Other scans must wait until we call_bt_parallel_release()
625+
*or _bt_parallel_done().
626626
*
627627
* The return value is true if we successfully seized the scan and false
628628
* if we did not. The latter case occurs if no pages remain for the current

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -181,7 +181,7 @@ btree_xlog_insert(bool isleaf, bool ismeta, XLogReaderState *record)
181181

182182
if (PageAddItem(page, (Item)datapos,datalen,xlrec->offnum,
183183
false, false)==InvalidOffsetNumber)
184-
elog(PANIC,"btree_insert_redo: failed to add item");
184+
elog(PANIC,"btree_xlog_insert: failed to add item");
185185

186186
PageSetLSN(page,lsn);
187187
MarkBufferDirty(buffer);

‎src/backend/catalog/heap.c

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1588,9 +1588,8 @@ RemoveAttributeById(Oid relid, AttrNumber attnum)
15881588
/*
15891589
* Grab an exclusive lock on the target table, which we will NOT release
15901590
* until end of transaction. (In the simple case where we are directly
1591-
* dropping this column, AlterTableDropColumn already did this ... but
1592-
* when cascading from a drop of some other object, we may not have any
1593-
* lock.)
1591+
* dropping this column, ATExecDropColumn already did this ... but when
1592+
* cascading from a drop of some other object, we may not have any lock.)
15941593
*/
15951594
rel=relation_open(relid,AccessExclusiveLock);
15961595

‎src/backend/executor/execExpr.c

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1200,12 +1200,12 @@ ExecInitExprRec(Expr *node, ExprState *state,
12001200
* field's values[]/nulls[] entries as both the caseval
12011201
* source and the result address for this subexpression.
12021202
* That's okay only because (1) both FieldStore and
1203-
*ArrayRef evaluate their arg or refexpr inputs first,
1204-
* and (2) any such CaseTestExpr is directly the arg or
1205-
* refexpr input. So any read of the caseval will occur
1206-
* before there's a chance to overwrite it. Also, if
1207-
* multiple entries in the newvals/fieldnums lists target
1208-
* the same field, they'll effectively be applied
1203+
*SubscriptingRef evaluate their arg or refexpr inputs
1204+
*first,and (2) any such CaseTestExpr is directly the
1205+
*arg orrefexpr input. So any read of the caseval will
1206+
*occurbefore there's a chance to overwrite it. Also,
1207+
*ifmultiple entries in the newvals/fieldnums lists
1208+
*targetthe same field, they'll effectively be applied
12091209
* left-to-right which is what we want.
12101210
*/
12111211
save_innermost_caseval=state->innermost_caseval;

‎src/backend/libpq/be-fsstubs.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -62,7 +62,7 @@
6262
* A non-null entry is a pointer to a LargeObjectDesc allocated in the
6363
* LO private memory context "fscxt". The cookies array itself is also
6464
* dynamically allocated in that context. Its current allocated size is
65-
*cookies_len entries, of which any unused entries will be NULL.
65+
*cookies_size entries, of which any unused entries will be NULL.
6666
*/
6767
staticLargeObjectDesc**cookies=NULL;
6868
staticintcookies_size=0;

‎src/backend/nodes/tidbitmap.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -934,7 +934,7 @@ tbm_extract_page_tuple(PagetableEntry *page, TBMIterateResult *output)
934934
}
935935

936936
/*
937-
*tbm_advance_schunkbit - Advance thechunkbit
937+
*tbm_advance_schunkbit - Advance theschunkbit
938938
*/
939939
staticinlinevoid
940940
tbm_advance_schunkbit(PagetableEntry*chunk,int*schunkbitp)

‎src/backend/optimizer/path/equivclass.c

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -929,11 +929,10 @@ generate_base_implied_equalities_no_const(PlannerInfo *root,
929929
/*
930930
* We scan the EC members once and track the last-seen member for each
931931
* base relation. When we see another member of the same base relation,
932-
* we generate "prev_mem = cur_mem". This results in the minimum number
933-
* of derived clauses, but it's possible that it will fail when a
934-
* different ordering would succeed. XXX FIXME: use a UNION-FIND
935-
* algorithm similar to the way we build merged ECs. (Use a list-of-lists
936-
* for each rel.)
932+
* we generate "prev_em = cur_em". This results in the minimum number of
933+
* derived clauses, but it's possible that it will fail when a different
934+
* ordering would succeed. XXX FIXME: use a UNION-FIND algorithm similar
935+
* to the way we build merged ECs. (Use a list-of-lists for each rel.)
937936
*/
938937
prev_ems= (EquivalenceMember**)
939938
palloc0(root->simple_rel_array_size*sizeof(EquivalenceMember*));

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3911,7 +3911,7 @@ create_foreignscan_plan(PlannerInfo *root, ForeignPath *best_path,
39113911
}
39123912

39133913
/*
3914-
*create_custom_plan
3914+
*create_customscan_plan
39153915
*
39163916
* Transform a CustomPath into a Plan.
39173917
*/

‎src/backend/optimizer/util/clauses.c

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -3409,10 +3409,10 @@ eval_const_expressions_mutator(Node *node,
34093409
{
34103410
/*
34113411
* This case could be folded into the generic handling used
3412-
* forArrayRef etc. But because the simplification logic is
3413-
* so trivial, applying evaluate_expr() to perform it would be
3414-
* a heavy overhead. BooleanTest is probably common enough to
3415-
* justify keeping this bespoke implementation.
3412+
* forSubscriptingRef etc. But because the simplification
3413+
*logic isso trivial, applying evaluate_expr() to perform it
3414+
*would bea heavy overhead. BooleanTest is probably common
3415+
*enough tojustify keeping this bespoke implementation.
34163416
*/
34173417
BooleanTest*btest= (BooleanTest*)node;
34183418
BooleanTest*newbtest;

‎src/backend/parser/analyze.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2082,7 +2082,7 @@ transformSetOperationTree(ParseState *pstate, SelectStmt *stmt,
20822082
* Select common collation. A common collation is required for
20832083
* all set operators except UNION ALL; see SQL:2008 7.13 <query
20842084
* expression> Syntax Rule 15c. (If we fail to identify a common
2085-
* collation for a UNION ALL column, thecurCollations element
2085+
* collation for a UNION ALL column, thecolCollations element
20862086
* will be set to InvalidOid, which may result in a runtime error
20872087
* if something at a higher query level wants to use the column's
20882088
* collation.)

‎src/backend/parser/gram.y

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12542,7 +12542,7 @@ SimpleTypename:
1254212542
* Note that ConstInterval is not included here since it must
1254312543
* be pushed up higher in the rules to accommodate the postfix
1254412544
* options (e.g. INTERVAL '1' YEAR). Likewise, we have to handle
12545-
* the generic-type-name case inAExprConst to avoid premature
12545+
* the generic-type-name case inAexprConst to avoid premature
1254612546
* reduce/reduce conflicts against function names.
1254712547
*/
1254812548
ConstTypename:

‎src/backend/parser/parse_target.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -695,9 +695,9 @@ transformAssignmentIndirection(ParseState *pstate,
695695
/*
696696
* Set up a substitution. We abuse CaseTestExpr for this. It's safe
697697
* to do so because the only nodes that will be above the CaseTestExpr
698-
* in the finished expression will be FieldStore andArrayRef nodes.
699-
* (There could be other stuff in the tree, but it will be within
700-
* other child fields of those node types.)
698+
* in the finished expression will be FieldStore andSubscriptingRef
699+
*nodes.(There could be other stuff in the tree, but it will be
700+
*withinother child fields of those node types.)
701701
*/
702702
CaseTestExpr*ctest=makeNode(CaseTestExpr);
703703

‎src/backend/postmaster/bgworker.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -525,7 +525,7 @@ ResetBackgroundWorkerCrashTimes(void)
525525
if (rw->rw_worker.bgw_restart_time==BGW_NEVER_RESTART)
526526
{
527527
/*
528-
* Workers markedBGW_NVER_RESTART shouldn't get relaunched after
528+
* Workers markedBGW_NEVER_RESTART shouldn't get relaunched after
529529
* the crash, so forget about them. (If we wait until after the
530530
* crash to forget about them, and they are parallel workers,
531531
* parallel_terminate_count will get incremented after we've

‎src/backend/replication/logical/logical.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -114,7 +114,7 @@ CheckLogicalDecodingRequirements(void)
114114
}
115115

116116
/*
117-
* Helper function forCreateInitialDecodingContext() and
117+
* Helper function forCreateInitDecodingContext() and
118118
* CreateDecodingContext() performing common tasks.
119119
*/
120120
staticLogicalDecodingContext*

‎src/backend/replication/slot.c

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1334,7 +1334,9 @@ SaveSlotToPath(ReplicationSlot *slot, const char *dir, int elevel)
13341334
return;
13351335
}
13361336

1337-
/* Check CreateSlot() for the reasoning of using a crit. section. */
1337+
/*
1338+
* Check CreateSlotOnDisk() for the reasoning of using a critical section.
1339+
*/
13381340
START_CRIT_SECTION();
13391341

13401342
fsync_fname(path, false);

‎src/backend/rewrite/rewriteHandler.c

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -980,11 +980,11 @@ process_matched_tle(TargetEntry *src_tle,
980980
*
981981
* As a further complication, the destination column might be a domain,
982982
* resulting in each assignment containing a CoerceToDomain node over a
983-
* FieldStore orArrayRef. These should have matching target domains,
984-
* so we strip them and reconstitute a single CoerceToDomain over the
985-
* combined FieldStore/ArrayRef nodes. (Notice that this has the result
986-
* that the domain's checks are applied only after we do all the field or
987-
* element updates, not after each one. This is arguably desirable.)
983+
* FieldStore orSubscriptingRef. These should have matching target
984+
*domains,so we strip them and reconstitute a single CoerceToDomain over
985+
*thecombined FieldStore/SubscriptingRef nodes. (Notice that this has the
986+
*resultthat the domain's checks are applied only after we do all the
987+
*field orelement updates, not after each one. This is arguably desirable.)
988988
*----------
989989
*/
990990
src_expr= (Node*)src_tle->expr;

‎src/backend/storage/buffer/freelist.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -220,7 +220,7 @@ StrategyGetBuffer(BufferAccessStrategy strategy, uint32 *buf_state)
220220
* If asked, we need to waken the bgwriter. Since we don't want to rely on
221221
* a spinlock for this we force a read from shared memory once, and then
222222
* set the latch based on that value. We need to go through that length
223-
* because otherwisebgprocno might be reset while/after we check because
223+
* because otherwisebgwprocno might be reset while/after we check because
224224
* the compiler might just reread from memory.
225225
*
226226
* This can possibly set the latch of the wrong process if the bgwriter

‎src/backend/storage/buffer/localbuf.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -537,7 +537,7 @@ GetLocalBufferStorage(void)
537537
/*
538538
* CheckForLocalBufferLeaks - ensure this backend holds no local buffer pins
539539
*
540-
* This is just likeCheckBufferLeaks(), but for local buffers.
540+
* This is just likeCheckForBufferLeaks(), but for local buffers.
541541
*/
542542
staticvoid
543543
CheckForLocalBufferLeaks(void)

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -226,9 +226,9 @@ BarrierAttach(Barrier *barrier)
226226
}
227227

228228
/*
229-
* Detach from a barrier. This may release other waiters from BarrierWait and
230-
* advance the phase if they were only waiting for this backend. Return true
231-
* if this participant was the last to detach.
229+
* Detach from a barrier. This may release other waiters from
230+
*BarrierArriveAndWait() andadvance the phase if they were only waiting for
231+
*this backend. Return trueif this participant was the last to detach.
232232
*/
233233
bool
234234
BarrierDetach(Barrier*barrier)

‎src/backend/utils/Gen_dummy_probes.pl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@
1414
#
1515
#-------------------------------------------------------------------------
1616

17-
# turn off perlcritic forautogened code
17+
# turn off perlcritic forautogenerated code
1818
## no critic
1919

2020
$0 =~s/^.*?(\w+)[\.\w+]*$/$1/;

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1322,7 +1322,7 @@ array_recv(PG_FUNCTION_ARGS)
13221322
lBound[i]=pq_getmsgint(buf,4);
13231323

13241324
/*
1325-
* Check overflow of upper bound. (ArrayNItems() below checks that
1325+
* Check overflow of upper bound. (ArrayGetNItems() below checks that
13261326
* dim[i] >= 0)
13271327
*/
13281328
if (dim[i]!=0)

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1374,7 +1374,7 @@ time_scale(PG_FUNCTION_ARGS)
13741374

13751375
/* AdjustTimeForTypmod()
13761376
* Force the precision of the time value to a specified value.
1377-
* Uses *exactly* the same code as inAdjustTimestampForTypemod()
1377+
* Uses *exactly* the same code as inAdjustTimestampForTypmod()
13781378
* but we make a separate copy because those types do not
13791379
* have a fundamental tie together but rather a coincidence of
13801380
* implementation. - thomas

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3029,7 +3029,7 @@ DecodeSpecial(int field, char *lowtoken, int *val)
30293029
}
30303030

30313031

3032-
/*ClearPgTM
3032+
/*ClearPgTm
30333033
*
30343034
* Zero out a pg_tm and associated fsec_t
30353035
*/

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -527,7 +527,7 @@ dotrim(const char *string, int stringlen,
527527
*
528528
* Syntax:
529529
*
530-
* bytea byteatrim(byta string, bytea set)
530+
* bytea byteatrim(bytea string, bytea set)
531531
*
532532
* Purpose:
533533
*

‎src/backend/utils/cache/plancache.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -504,7 +504,7 @@ DropCachedPlan(CachedPlanSource *plansource)
504504
plansource->is_saved= false;
505505
}
506506

507-
/* Decrement genericCachePlan's refcount and drop if no longer needed */
507+
/* Decrement genericCachedPlan's refcount and drop if no longer needed */
508508
ReleaseGenericPlan(plansource);
509509

510510
/* Mark it no longer valid */

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2258,7 +2258,7 @@ check_for_freed_segments(dsa_area *area)
22582258
}
22592259

22602260
/*
2261-
* Workhorse forcheck_for_free_segments(), and also used directly in path
2261+
* Workhorse forcheck_for_freed_segments(), and also used directly in path
22622262
* where the area lock is already held. This should be called after acquiring
22632263
* the lock but before looking up any segment by index number, to make sure we
22642264
* unmap any stale segments that might have previously had the same index as a

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -231,7 +231,7 @@ FreePageManagerGet(FreePageManager *fpm, Size npages, Size *first_page)
231231

232232
/*
233233
* FreePageManagerGetInternal may have set contiguous_pages_dirty.
234-
* Recomputecontigous_pages if so.
234+
* Recomputecontiguous_pages if so.
235235
*/
236236
FreePageManagerUpdateLargest(fpm);
237237

‎src/include/access/attnum.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -55,7 +55,7 @@ typedef int16 AttrNumber;
5555
)
5656

5757
/*
58-
*AttributeOffsetGetAttributeNumber
58+
*AttrOffsetGetAttrNumber
5959
*Returns the attribute number for an attribute offset.
6060
*/
6161
#defineAttrOffsetGetAttrNumber(attributeOffset) \

‎src/include/access/hash.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -457,7 +457,7 @@ extern void hashbucketcleanup(Relation rel, Bucket cur_bucket,
457457
BufferAccessStrategybstrategy,
458458
uint32maxbucket,uint32highmask,uint32lowmask,
459459
double*tuples_removed,double*num_index_tuples,
460-
boolbucket_has_garbage,
460+
boolsplit_cleanup,
461461
IndexBulkDeleteCallbackcallback,void*callback_state);
462462

463463
#endif/* HASH_H */

0 commit comments

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