Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
M
MariaDB
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
nexedi
MariaDB
Commits
97a3f11e
Commit
97a3f11e
authored
Jul 22, 2014
by
John Esmet
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
FT-304 Fix a memory leak by further separating initialization paths in the block table
parent
b4679c7d
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
37 additions
and
30 deletions
+37
-30
ft/serialize/block_table.cc
ft/serialize/block_table.cc
+37
-30
No files found.
ft/serialize/block_table.cc
View file @
97a3f11e
...
@@ -148,22 +148,12 @@ static_assert(block_allocator::BLOCK_ALLOCATOR_HEADER_RESERVE * 2 ==
...
@@ -148,22 +148,12 @@ static_assert(block_allocator::BLOCK_ALLOCATOR_HEADER_RESERVE * 2 ==
// does NOT initialize the block allocator: the caller is responsible
// does NOT initialize the block allocator: the caller is responsible
void
block_table
::
_create_internal
()
{
void
block_table
::
_create_internal
()
{
memset
(
&
_current
,
0
,
sizeof
(
struct
translation
));
memset
(
&
_inprogress
,
0
,
sizeof
(
struct
translation
));
memset
(
&
_checkpointed
,
0
,
sizeof
(
struct
translation
));
memset
(
&
_mutex
,
0
,
sizeof
(
_mutex
));
memset
(
&
_mutex
,
0
,
sizeof
(
_mutex
));
toku_mutex_init
(
&
_mutex
,
nullptr
);
toku_mutex_init
(
&
_mutex
,
nullptr
);
nb_mutex_init
(
&
_safe_file_size_lock
);
nb_mutex_init
(
&
_safe_file_size_lock
);
_checkpointed
.
type
=
TRANSLATION_CHECKPOINTED
;
_checkpointed
.
smallest_never_used_blocknum
=
make_blocknum
(
RESERVED_BLOCKNUMS
);
_checkpointed
.
length_of_array
=
_checkpointed
.
smallest_never_used_blocknum
.
b
;
_checkpointed
.
blocknum_freelist_head
=
freelist_null
;
XMALLOC_N
(
_checkpointed
.
length_of_array
,
_checkpointed
.
block_translation
);
for
(
int64_t
i
=
0
;
i
<
_checkpointed
.
length_of_array
;
i
++
)
{
_checkpointed
.
block_translation
[
i
].
size
=
0
;
_checkpointed
.
block_translation
[
i
].
u
.
diskoff
=
diskoff_unused
;
}
// we just created a default checkpointed, now copy it to current.
_copy_translation
(
&
_current
,
&
_checkpointed
,
TRANSLATION_CURRENT
);
}
}
// Fill in the checkpointed translation from buffer, and copy checkpointed to current.
// Fill in the checkpointed translation from buffer, and copy checkpointed to current.
...
@@ -217,6 +207,19 @@ void block_table::create() {
...
@@ -217,6 +207,19 @@ void block_table::create() {
// Does not initialize the block allocator
// Does not initialize the block allocator
_create_internal
();
_create_internal
();
_checkpointed
.
type
=
TRANSLATION_CHECKPOINTED
;
_checkpointed
.
smallest_never_used_blocknum
=
make_blocknum
(
RESERVED_BLOCKNUMS
);
_checkpointed
.
length_of_array
=
_checkpointed
.
smallest_never_used_blocknum
.
b
;
_checkpointed
.
blocknum_freelist_head
=
freelist_null
;
XMALLOC_N
(
_checkpointed
.
length_of_array
,
_checkpointed
.
block_translation
);
for
(
int64_t
i
=
0
;
i
<
_checkpointed
.
length_of_array
;
i
++
)
{
_checkpointed
.
block_translation
[
i
].
size
=
0
;
_checkpointed
.
block_translation
[
i
].
u
.
diskoff
=
diskoff_unused
;
}
// we just created a default checkpointed, now copy it to current.
_copy_translation
(
&
_current
,
&
_checkpointed
,
TRANSLATION_CURRENT
);
// Create an empty block allocator.
// Create an empty block allocator.
_bt_block_allocator
.
create
(
block_allocator
::
BLOCK_ALLOCATOR_TOTAL_HEADER_RESERVE
,
_bt_block_allocator
.
create
(
block_allocator
::
BLOCK_ALLOCATOR_TOTAL_HEADER_RESERVE
,
block_allocator
::
BLOCK_ALLOCATOR_ALIGNMENT
);
block_allocator
::
BLOCK_ALLOCATOR_ALIGNMENT
);
...
@@ -263,22 +266,25 @@ void block_table::maybe_truncate_file_on_open(int fd) {
...
@@ -263,22 +266,25 @@ void block_table::maybe_truncate_file_on_open(int fd) {
_mutex_unlock
();
_mutex_unlock
();
}
}
void
block_table
::
_copy_translation
(
struct
translation
*
dst
,
struct
translation
*
src
,
enum
translation_type
newtype
)
{
void
block_table
::
_copy_translation
(
struct
translation
*
dst
,
struct
translation
*
src
,
enum
translation_type
newtype
)
{
paranoid_invariant
(
src
->
length_of_array
>=
src
->
smallest_never_used_blocknum
.
b
);
//verify invariant
// We intend to malloc a fresh block, so the incoming translation should be empty
paranoid_invariant
(
newtype
==
TRANSLATION_DEBUG
||
invariant_null
(
dst
->
block_translation
);
(
src
->
type
==
TRANSLATION_CURRENT
&&
newtype
==
TRANSLATION_INPROGRESS
)
||
(
src
->
type
==
TRANSLATION_CHECKPOINTED
&&
newtype
==
TRANSLATION_CURRENT
));
invariant
(
src
->
length_of_array
>=
src
->
smallest_never_used_blocknum
.
b
);
invariant
(
newtype
==
TRANSLATION_DEBUG
||
(
src
->
type
==
TRANSLATION_CURRENT
&&
newtype
==
TRANSLATION_INPROGRESS
)
||
(
src
->
type
==
TRANSLATION_CHECKPOINTED
&&
newtype
==
TRANSLATION_CURRENT
));
dst
->
type
=
newtype
;
dst
->
type
=
newtype
;
dst
->
smallest_never_used_blocknum
=
src
->
smallest_never_used_blocknum
;
dst
->
smallest_never_used_blocknum
=
src
->
smallest_never_used_blocknum
;
dst
->
blocknum_freelist_head
=
src
->
blocknum_freelist_head
;
dst
->
blocknum_freelist_head
=
src
->
blocknum_freelist_head
;
// destination btt is of fixed size. Allocate+memcpy the exact length necessary.
dst
->
length_of_array
=
dst
->
smallest_never_used_blocknum
.
b
;
// destination btt is of fixed size. Allocate + memcpy the exact length necessary.
dst
->
length_of_array
=
dst
->
smallest_never_used_blocknum
.
b
;
XMALLOC_N
(
dst
->
length_of_array
,
dst
->
block_translation
);
XMALLOC_N
(
dst
->
length_of_array
,
dst
->
block_translation
);
memcpy
(
dst
->
block_translation
,
memcpy
(
dst
->
block_translation
,
src
->
block_translation
,
dst
->
length_of_array
*
sizeof
(
*
dst
->
block_translation
));
src
->
block_translation
,
dst
->
length_of_array
*
sizeof
(
*
dst
->
block_translation
));
// New version of btt is not yet stored on disk.
//New version of btt is not yet stored on disk.
dst
->
block_translation
[
RESERVED_BLOCKNUM_TRANSLATION
].
size
=
0
;
dst
->
block_translation
[
RESERVED_BLOCKNUM_TRANSLATION
].
size
=
0
;
dst
->
block_translation
[
RESERVED_BLOCKNUM_TRANSLATION
].
u
.
diskoff
=
diskoff_unused
;
dst
->
block_translation
[
RESERVED_BLOCKNUM_TRANSLATION
].
u
.
diskoff
=
diskoff_unused
;
}
}
...
@@ -338,11 +344,12 @@ void block_table::_maybe_optimize_translation(struct translation *t) {
...
@@ -338,11 +344,12 @@ void block_table::_maybe_optimize_translation(struct translation *t) {
// block table must be locked by caller of this function
// block table must be locked by caller of this function
void
block_table
::
note_start_checkpoint_unlocked
()
{
void
block_table
::
note_start_checkpoint_unlocked
()
{
toku_mutex_assert_locked
(
&
_mutex
);
toku_mutex_assert_locked
(
&
_mutex
);
// Copy current translation to inprogress translation.
paranoid_invariant
(
_inprogress
.
block_translation
==
NULL
);
// We're going to do O(n) work to copy the translation, so we
//We're going to do O(n) work to copy the translation, so we
// can afford to do O(n) work by optimizing the translation
//can afford to do O(n) work by optimizing the translation
_maybe_optimize_translation
(
&
_current
);
_maybe_optimize_translation
(
&
_current
);
// Copy current translation to inprogress translation.
_copy_translation
(
&
_inprogress
,
&
_current
,
TRANSLATION_INPROGRESS
);
_copy_translation
(
&
_inprogress
,
&
_current
,
TRANSLATION_INPROGRESS
);
_checkpoint_skipped
=
false
;
_checkpoint_skipped
=
false
;
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment