Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Greenplum
Gpdb
提交
fa60fb63
G
Gpdb
项目概览
Greenplum
/
Gpdb
通知
7
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
G
Gpdb
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
fa60fb63
编写于
5月 20, 2015
作者:
H
Heikki Linnakangas
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix more typos in comments.
Patch by CharSyam, plus a few more I spotted with grep.
上级
4fc72cc7
变更
23
隐藏空白更改
内联
并排
Showing
23 changed file
with
29 addition
and
29 deletion
+29
-29
src/backend/access/brin/brin_pageops.c
src/backend/access/brin/brin_pageops.c
+1
-1
src/backend/access/heap/README.tuplock
src/backend/access/heap/README.tuplock
+1
-1
src/backend/access/transam/twophase.c
src/backend/access/transam/twophase.c
+1
-1
src/backend/access/transam/xact.c
src/backend/access/transam/xact.c
+1
-1
src/backend/commands/event_trigger.c
src/backend/commands/event_trigger.c
+1
-1
src/backend/commands/vacuumlazy.c
src/backend/commands/vacuumlazy.c
+1
-1
src/backend/postmaster/bgwriter.c
src/backend/postmaster/bgwriter.c
+1
-1
src/backend/replication/basebackup.c
src/backend/replication/basebackup.c
+2
-2
src/backend/replication/logical/origin.c
src/backend/replication/logical/origin.c
+1
-1
src/backend/replication/logical/reorderbuffer.c
src/backend/replication/logical/reorderbuffer.c
+2
-2
src/backend/replication/logical/snapbuild.c
src/backend/replication/logical/snapbuild.c
+4
-4
src/backend/replication/slot.c
src/backend/replication/slot.c
+1
-1
src/backend/storage/buffer/bufmgr.c
src/backend/storage/buffer/bufmgr.c
+1
-1
src/backend/storage/ipc/dsm.c
src/backend/storage/ipc/dsm.c
+1
-1
src/backend/storage/ipc/procarray.c
src/backend/storage/ipc/procarray.c
+1
-1
src/backend/storage/ipc/shm_mq.c
src/backend/storage/ipc/shm_mq.c
+1
-1
src/bin/pg_dump/pg_dump.c
src/bin/pg_dump/pg_dump.c
+1
-1
src/bin/pg_upgrade/pg_upgrade.c
src/bin/pg_upgrade/pg_upgrade.c
+1
-1
src/bin/psql/print.c
src/bin/psql/print.c
+1
-1
src/include/c.h
src/include/c.h
+1
-1
src/include/utils/rel.h
src/include/utils/rel.h
+1
-1
src/interfaces/libpq/fe-auth.c
src/interfaces/libpq/fe-auth.c
+2
-2
src/tools/pgindent/pgindent
src/tools/pgindent/pgindent
+1
-1
未找到文件。
src/backend/access/brin/brin_pageops.c
浏览文件 @
fa60fb63
...
...
@@ -494,7 +494,7 @@ brin_evacuate_page(Relation idxRel, BlockNumber pagesPerRange,
* index item of size itemsz. If oldbuf is a valid buffer, it is also locked
* (in an order determined to avoid deadlocks.)
*
* If there's no existing page with enough free space to accomodate the new
* If there's no existing page with enough free space to accom
m
odate the new
* item, the relation is extended. If this happens, *extended is set to true.
*
* If we find that the old page is no longer a regular index page (because
...
...
src/backend/access/heap/README.tuplock
浏览文件 @
fa60fb63
...
...
@@ -9,7 +9,7 @@ is implemented by storing locking information in the tuple header: a tuple is
marked as locked by setting the current transaction's XID as its XMAX, and
setting additional infomask bits to distinguish this case from the more normal
case of having deleted the tuple. When multiple transactions concurrently
lock a tuple, a MultiXact is used; see below. This mechanism can accomodate
lock a tuple, a MultiXact is used; see below. This mechanism can accom
m
odate
arbitrarily large numbers of tuples being locked simultaneously.
When it is necessary to wait for a tuple-level lock to be released, the basic
...
...
src/backend/access/transam/twophase.c
浏览文件 @
fa60fb63
...
...
@@ -269,7 +269,7 @@ AtAbort_Twophase(void)
* can be finished later, so just unlock it.
*
* If we abort during prepare, after having written the WAL record, we
* might not have transfered all locks and other state to the prepared
* might not have transfer
r
ed all locks and other state to the prepared
* transaction yet. Likewise, if we abort during commit or rollback,
* after having written the WAL record, we might not have released
* all the resources held by the transaction yet. In those cases, the
...
...
src/backend/access/transam/xact.c
浏览文件 @
fa60fb63
...
...
@@ -2317,7 +2317,7 @@ PrepareTransaction(void)
/*
* In normal commit-processing, this is all non-critical post-transaction
* cleanup. When the transaction is prepared, however, it's important that
* the locks and other per-backend resources are transfered to the
* the locks and other per-backend resources are transfer
r
ed to the
* prepared transaction's PGPROC entry. Note that if an error is raised
* here, it's too late to abort the transaction. XXX: This probably should
* be in a critical section, to force a PANIC if any of this fails, but
...
...
src/backend/commands/event_trigger.c
浏览文件 @
fa60fb63
...
...
@@ -883,7 +883,7 @@ EventTriggerSQLDrop(Node *parsetree)
/*
* Nothing to do if run list is empty. Note this shouldn't happen,
* because if there are no sql_drop events, then objects-to-drop wouldn't
* have been collected in the first place and we would have quit
ted
above.
* have been collected in the first place and we would have quit above.
*/
if
(
runlist
==
NIL
)
return
;
...
...
src/backend/commands/vacuumlazy.c
浏览文件 @
fa60fb63
...
...
@@ -952,7 +952,7 @@ lazy_scan_heap(Relation onerel, LVRelStats *vacrelstats,
heap_execute_freeze_tuple
(
htup
,
&
frozen
[
i
]);
}
/* Now WAL-log freezing if nec
c
essary */
/* Now WAL-log freezing if necessary */
if
(
RelationNeedsWAL
(
onerel
))
{
XLogRecPtr
recptr
;
...
...
src/backend/postmaster/bgwriter.c
浏览文件 @
fa60fb63
...
...
@@ -297,7 +297,7 @@ BackgroundWriterMain(void)
* overall timeout handling but just assume we're going to get called
* often enough even if hibernation mode is active. It's not that
* important that log_snap_interval_ms is met strictly. To make sure
* we're not waking the disk up unnec
ce
sarily on an idle system we
* we're not waking the disk up unnec
es
sarily on an idle system we
* check whether there has been any WAL inserted since the last time
* we've logged a running xacts.
*
...
...
src/backend/replication/basebackup.c
浏览文件 @
fa60fb63
...
...
@@ -85,7 +85,7 @@ static char *statrelpath = NULL;
/* The actual number of bytes, transfer of which may cause sleep. */
static
uint64
throttling_sample
;
/* Amount of data already transfered but not yet throttled. */
/* Amount of data already transfer
r
ed but not yet throttled. */
static
int64
throttling_counter
;
/* The minimum time required to transfer throttling_sample bytes. */
...
...
@@ -172,7 +172,7 @@ perform_base_backup(basebackup_options *opt, DIR *tblspcdir)
/*
* The minimum amount of time for throttling_sample bytes to be
* transfered.
* transfer
r
ed.
*/
elapsed_min_unit
=
USECS_PER_SEC
/
THROTTLING_FREQUENCY
;
...
...
src/backend/replication/logical/origin.c
浏览文件 @
fa60fb63
...
...
@@ -1342,7 +1342,7 @@ pg_replication_origin_advance(PG_FUNCTION_ARGS)
/*
* Can't sensibly pass a local commit to be flushed at checkpoint - this
* xact hasn't committed yet. This is why this function should be used to
* set up the intial replication state, but not for replay.
* set up the in
i
tial replication state, but not for replay.
*/
replorigin_advance
(
node
,
remote_commit
,
InvalidXLogRecPtr
,
true
/* go backward */
,
true
/* wal log */
);
...
...
src/backend/replication/logical/reorderbuffer.c
浏览文件 @
fa60fb63
...
...
@@ -143,7 +143,7 @@ typedef struct ReorderBufferDiskChange
* without hitting disk in OLTP workloads, while starting to spool to disk in
* other workloads reasonably fast.
*
* At some point in the future it probaly makes sense to have a more elaborate
* At some point in the future it proba
b
ly makes sense to have a more elaborate
* resource management here, but it's not entirely clear what that would look
* like.
*/
...
...
@@ -1704,7 +1704,7 @@ ReorderBufferForget(ReorderBuffer *rb, TransactionId xid, XLogRecPtr lsn)
txn
->
final_lsn
=
lsn
;
/*
* Proc
c
ess cache invalidation messages if there are any. Even if we're
* Process cache invalidation messages if there are any. Even if we're
* not interested in the transaction's contents, it could have manipulated
* the catalog and we need to update the caches according to that.
*/
...
...
src/backend/replication/logical/snapbuild.c
浏览文件 @
fa60fb63
...
...
@@ -770,7 +770,7 @@ SnapBuildDistributeNewCatalogSnapshot(SnapBuild *builder, XLogRecPtr lsn)
/*
* Iterate through all toplevel transactions. This can include
* subtransactions which we just don't yet know to be that, but that's
* fine, they will just get an unnec
ce
sary snapshot queued.
* fine, they will just get an unnec
es
sary snapshot queued.
*/
dlist_foreach
(
txn_i
,
&
builder
->
reorder
->
toplevel_by_lsn
)
{
...
...
@@ -1212,7 +1212,7 @@ SnapBuildFindSnapshot(SnapBuild *builder, XLogRecPtr lsn, xl_running_xacts *runn
* to CONSISTENT.
* NB: We need to search running.xip when seeing a transaction's end to
* make sure it's a toplevel transaction and it's been one of the
* intially running ones.
* in
i
tially running ones.
* Interestingly, in contrast to HS, this allows us not to care about
* subtransactions - and by extension suboverflowed xl_running_xacts -
* at all.
...
...
@@ -1657,7 +1657,7 @@ SnapBuildRestore(SnapBuild *builder, XLogRecPtr lsn)
* Make sure the snapshot had been stored safely to disk, that's normally
* cheap.
* Note that we do not need PANIC here, nobody will be able to use the
* slot without fsyncing, and saving it won't suceed without an fsync()
* slot without fsyncing, and saving it won't suc
c
eed without an fsync()
* either...
* ----
*/
...
...
@@ -1749,7 +1749,7 @@ SnapBuildRestore(SnapBuild *builder, XLogRecPtr lsn)
/*
* We are only interested in consistent snapshots for now, comparing
* whether one i
m
complete snapshot is more "advanced" seems to be
* whether one i
n
complete snapshot is more "advanced" seems to be
* unnecessarily complex.
*/
if
(
ondisk
.
builder
.
state
<
SNAPBUILD_CONSISTENT
)
...
...
src/backend/replication/slot.c
浏览文件 @
fa60fb63
...
...
@@ -79,7 +79,7 @@ typedef struct ReplicationSlotOnDisk
/* size of the part covered by the checksum */
#define SnapBuildOnDiskChecksummedSize \
sizeof(ReplicationSlotOnDisk) - SnapBuildOnDiskNotChecksummedSize
/* size of the slot data that is version depend
a
nt */
/* size of the slot data that is version depend
e
nt */
#define ReplicationSlotOnDiskV2Size \
sizeof(ReplicationSlotOnDisk) - ReplicationSlotOnDiskConstantSize
...
...
src/backend/storage/buffer/bufmgr.c
浏览文件 @
fa60fb63
...
...
@@ -2165,7 +2165,7 @@ CheckForBufferLeaks(void)
}
}
/* if nec
c
essary search the hash */
/* if necessary search the hash */
if
(
PrivateRefCountOverflowed
)
{
HASH_SEQ_STATUS
hstat
;
...
...
src/backend/storage/ipc/dsm.c
浏览文件 @
fa60fb63
...
...
@@ -225,7 +225,7 @@ dsm_cleanup_using_control_segment(dsm_handle old_control_handle)
/*
* Try to attach the segment. If this fails, it probably just means that
* the operating system has been rebooted and the segment no longer
* exists, or an unrelated proces has used the same shm ID. So just fall
* exists, or an unrelated proces
s
has used the same shm ID. So just fall
* out quietly.
*/
if
(
!
dsm_impl_op
(
DSM_OP_ATTACH
,
old_control_handle
,
0
,
&
impl_private
,
...
...
src/backend/storage/ipc/procarray.c
浏览文件 @
fa60fb63
...
...
@@ -2001,7 +2001,7 @@ GetOldestSafeDecodingTransactionId(void)
/*
* If there's already a slot pegging the xmin horizon, we can start with
* that value, it's guaranteed to be safe since it's computed by this
* routine initally and has been enforced since.
* routine init
i
ally and has been enforced since.
*/
if
(
TransactionIdIsValid
(
procArray
->
replication_slot_catalog_xmin
)
&&
TransactionIdPrecedes
(
procArray
->
replication_slot_catalog_xmin
,
...
...
src/backend/storage/ipc/shm_mq.c
浏览文件 @
fa60fb63
...
...
@@ -1047,7 +1047,7 @@ shm_mq_inc_bytes_read(volatile shm_mq *mq, Size n)
/*
* Get the number of bytes written. The sender need not use this to access
* the count of bytes written, but the rec
ie
ver must.
* the count of bytes written, but the rec
ei
ver must.
*/
static
uint64
shm_mq_get_bytes_written
(
volatile
shm_mq
*
mq
,
bool
*
detached
)
...
...
src/bin/pg_dump/pg_dump.c
浏览文件 @
fa60fb63
...
...
@@ -15484,7 +15484,7 @@ dumpRule(Archive *fout, DumpOptions *dopt, RuleInfo *rinfo)
* is able and expected to modify those tables after the extension has been
* loaded. For these tables, we dump out only the data- the structure is
* expected to be handled at CREATE EXTENSION time, including any indexes or
* for
ie
gn keys, which brings us to-
* for
ei
gn keys, which brings us to-
*
* 3. Record FK dependencies between configuration tables.
*
...
...
src/bin/pg_upgrade/pg_upgrade.c
浏览文件 @
fa60fb63
...
...
@@ -198,7 +198,7 @@ setup(char *argv0, bool *live_check)
* start, assume the server is running. If the pid file is left over
* from a server crash, this also allows any committed transactions
* stored in the WAL to be replayed so they are not lost, because WAL
* files are not transfered from old to new servers.
* files are not transfer
r
ed from old to new servers.
*/
if
(
start_postmaster
(
&
old_cluster
,
false
))
stop_postmaster
(
false
);
...
...
src/bin/psql/print.c
浏览文件 @
fa60fb63
...
...
@@ -749,7 +749,7 @@ print_aligned_text(const printTableContent *cont, FILE *fout)
{
/*
* Optional optimized word wrap. Shrink columns with a high max/avg
* ratio. Slighly bias against wider columns. (Increases chance a
* ratio. Sligh
t
ly bias against wider columns. (Increases chance a
* narrow column will fit in its cell.) If available columns is
* positive... and greater than the width of the unshrinkable column
* headers
...
...
src/include/c.h
浏览文件 @
fa60fb63
...
...
@@ -982,7 +982,7 @@ typedef NameData *Name;
* To better support parallel installations of major PostgeSQL
* versions as well as parallel installations of major library soname
* versions, we mangle the gettext domain name by appending those
* version numbers. The coding rule ought to be that where
e
ver the
* version numbers. The coding rule ought to be that wherever the
* domain name is mentioned as a literal, it must be wrapped into
* PG_TEXTDOMAIN(). The macros below do not work on non-literals; but
* that is somewhat intentional because it avoids having to worry
...
...
src/include/utils/rel.h
浏览文件 @
fa60fb63
...
...
@@ -89,7 +89,7 @@ typedef struct RelationData
* survived into, or zero if not changed in the current transaction (or we
* have forgotten changing it). rd_newRelfilenodeSubid can be forgotten
* when a relation has multiple new relfilenodes within a single
* transaction, with one of them occuring in a subsequently aborted
* transaction, with one of them occur
r
ing in a subsequently aborted
* subtransaction, e.g. BEGIN; TRUNCATE t; SAVEPOINT save; TRUNCATE t;
* ROLLBACK TO save; -- rd_newRelfilenode is now forgotten
*/
...
...
src/interfaces/libpq/fe-auth.c
浏览文件 @
fa60fb63
...
...
@@ -300,7 +300,7 @@ pg_SSPI_continue(PGconn *conn)
if
(
conn
->
sspictx
==
NULL
)
{
/* On first run, transfer retr
ei
ved context handle */
/* On first run, transfer retr
ie
ved context handle */
conn
->
sspictx
=
malloc
(
sizeof
(
CtxtHandle
));
if
(
conn
->
sspictx
==
NULL
)
{
...
...
@@ -373,7 +373,7 @@ pg_SSPI_startup(PGconn *conn, int use_negotiate)
conn
->
sspictx
=
NULL
;
/*
* Retr
ei
ve credentials handle
* Retr
ie
ve credentials handle
*/
conn
->
sspicred
=
malloc
(
sizeof
(
CredHandle
));
if
(
conn
->
sspicred
==
NULL
)
...
...
src/tools/pgindent/pgindent
浏览文件 @
fa60fb63
...
...
@@ -19,7 +19,7 @@ my $devnull = File::Spec->devnull;
my
$indent_opts
=
"
-bad -bap -bc -bl -d0 -cdb -nce -nfc1 -di12 -i4 -l79 -lp -nip -npro -bbb
";
# indent-depend
a
nt settings
# indent-depend
e
nt settings
my
$extra_opts
=
"";
my
(
$typedefs_file
,
$typedef_str
,
$code_base
,
$excludes
,
$indent
,
$build
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录