Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
P
postgres-lambda-diff
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container Registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Jakob Huber
postgres-lambda-diff
Commits
f3e5d862
Commit
f3e5d862
authored
24 years ago
by
Tom Lane
Browse files
Options
Downloads
Patches
Plain Diff
Prevent creating a boatload of empty segments when md.c is asked to
access a ridiculously large block number within a relation.
parent
b54faa1b
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/backend/storage/smgr/md.c
+25
-7
25 additions, 7 deletions
src/backend/storage/smgr/md.c
with
25 additions
and
7 deletions
src/backend/storage/smgr/md.c
+
25
−
7
View file @
f3e5d862
...
...
@@ -8,7 +8,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/storage/smgr/md.c,v 1.7
2
2000/0
6/28
0
3
:32:
14
tgl Exp $
* $Header: /cvsroot/pgsql/src/backend/storage/smgr/md.c,v 1.7
3
2000/0
7/10
0
4
:32:
00
tgl Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -714,9 +714,16 @@ mdnblocks(Relation reln)
if
(
v
->
mdfd_chain
==
(
MdfdVec
*
)
NULL
)
{
/*
* Because we pass O_CREAT, we will create the next segment
* (with zero length) immediately, if the last segment is of
* length REL_SEGSIZE. This is unnecessary but harmless, and
* testing for the case would take more cycles than it seems
* worth.
*/
v
->
mdfd_chain
=
_mdfd_openseg
(
reln
,
segno
,
O_CREAT
);
if
(
v
->
mdfd_chain
==
(
MdfdVec
*
)
NULL
)
elog
(
ERROR
,
"cannot count blocks for %s -- open failed"
,
elog
(
ERROR
,
"cannot count blocks for %s -- open failed
: %m
"
,
RelationGetRelationName
(
reln
));
}
...
...
@@ -1038,11 +1045,20 @@ _mdfd_getseg(Relation reln, int blkno)
if
(
v
->
mdfd_chain
==
(
MdfdVec
*
)
NULL
)
{
v
->
mdfd_chain
=
_mdfd_openseg
(
reln
,
i
,
O_CREAT
);
/*
* We will create the next segment only if the target block
* is within it. This prevents Sorcerer's Apprentice syndrome
* if a bug at higher levels causes us to be handed a ridiculously
* large blkno --- otherwise we could create many thousands of
* empty segment files before reaching the "target" block. We
* should never need to create more than one new segment per call,
* so this restriction seems reasonable.
*/
v
->
mdfd_chain
=
_mdfd_openseg
(
reln
,
i
,
(
segno
==
1
)
?
O_CREAT
:
0
);
if
(
v
->
mdfd_chain
==
(
MdfdVec
*
)
NULL
)
elog
(
ERROR
,
"cannot open segment %d of relation %s"
,
i
,
RelationGetRelationName
(
reln
));
elog
(
ERROR
,
"cannot open segment %d of relation %s
(target block %d): %m
"
,
i
,
RelationGetRelationName
(
reln
)
,
blkno
);
}
v
=
v
->
mdfd_chain
;
}
...
...
@@ -1060,8 +1076,10 @@ _mdfd_getseg(Relation reln, int blkno)
* "blind" with no Relation struct. We assume that we are not likely to
* touch the same relation again soon, so we do not create an FD entry for
* the relation --- we just open a kernel file descriptor which will be
* used and promptly closed. The return value is the kernel descriptor,
* or -1 on failure.
* used and promptly closed. We also assume that the target block already
* exists, ie, we need not extend the relation.
*
* The return value is the kernel descriptor, or -1 on failure.
*/
static
int
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment