Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Greenplum
Gpdb
提交
f129615f
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,发现更多精彩内容 >>
提交
f129615f
编写于
6月 03, 2013
作者:
S
Stephen Frost
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Additional spelling corrections
A few more minor spelling corrections, no functional changes. Thom Brown
上级
e1e2bb34
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
5 addition
and
5 deletion
+5
-5
src/backend/access/hash/README
src/backend/access/hash/README
+2
-2
src/backend/access/nbtree/README
src/backend/access/nbtree/README
+1
-1
src/backend/utils/adt/windowfuncs.c
src/backend/utils/adt/windowfuncs.c
+1
-1
src/interfaces/libpq/fe-exec.c
src/interfaces/libpq/fe-exec.c
+1
-1
未找到文件。
src/backend/access/hash/README
浏览文件 @
f129615f
...
...
@@ -429,8 +429,8 @@ algorithm is:
(this requires read/update/write/release of fore and aft siblings)
pin meta page and take buffer content lock in shared mode
determine which bitmap page contains the free space bit for page
relase meta page buffer content lock
pin bitmap page and take buffer content lock in exclusie mode
rel
e
ase meta page buffer content lock
pin bitmap page and take buffer content lock in exclusi
v
e mode
update bitmap bit
mark bitmap page dirty and release buffer content lock and pin
if page number is less than what we saw as first-free-bit in meta:
...
...
src/backend/access/nbtree/README
浏览文件 @
f129615f
...
...
@@ -46,7 +46,7 @@ Lehman and Yao don't require read locks, but assume that in-memory
copies of tree pages are unshared. Postgres shares in-memory buffers
among backends. As a result, we do page-level read locking on btree
pages in order to guarantee that no record is modified while we are
examining it. This reduces concurrency but guarantee
e
s correct
examining it. This reduces concurrency but guarantees correct
behavior. An advantage is that when trading in a read lock for a
write lock, we need not re-read the page after getting the write lock.
Since we're also holding a pin on the shared buffer containing the
...
...
src/backend/utils/adt/windowfuncs.c
浏览文件 @
f129615f
...
...
@@ -161,7 +161,7 @@ window_percent_rank(PG_FUNCTION_ARGS)
/*
* cume_dist
* return fraction betwee
e
n 0 and 1 inclusive,
* return fraction between 0 and 1 inclusive,
* which is described as NP / NR, where NP is the number of rows preceding or
* peers to the current row, and NR is the total number of rows, per spec.
*/
...
...
src/interfaces/libpq/fe-exec.c
浏览文件 @
f129615f
...
...
@@ -279,7 +279,7 @@ PQsetResultAttrs(PGresult *res, int numAttributes, PGresAttDesc *attDescs)
* PG_COPYRES_ATTRS - Copy the source result's attributes
*
* PG_COPYRES_TUPLES - Copy the source result's tuples. This implies
* copying the attrs, see
e
ing how the attrs are needed by the tuples.
* copying the attrs, seeing how the attrs are needed by the tuples.
*
* PG_COPYRES_EVENTS - Copy the source result's events.
*
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录