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
0665ec1d
Commit
0665ec1d
authored
Apr 21, 2015
by
Rik Prohaska
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
tokuftdump should print leaf entry index so that the dump is easier to work with
parent
981200b6
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
4 additions
and
1 deletion
+4
-1
tools/tokuftdump.cc
tools/tokuftdump.cc
+4
-1
No files found.
tools/tokuftdump.cc
View file @
0665ec1d
...
...
@@ -248,6 +248,8 @@ static int64_t getRootNode(FT ft) {
}
static
int
print_le
(
const
void
*
key
,
const
uint32_t
keylen
,
const
LEAFENTRY
&
le
,
const
uint32_t
idx
UU
(),
void
*
const
ai
UU
())
{
unsigned
int
*
le_index
=
(
unsigned
int
*
)
ai
;
printf
(
"%u: "
,
*
le_index
);
*
le_index
+=
1
;
print_klpair
(
stdout
,
key
,
keylen
,
le
);
printf
(
"
\n
"
);
return
0
;
...
...
@@ -537,7 +539,8 @@ static void dump_node(int fd, BLOCKNUM blocknum, FT ft) {
printf
(
" n_bytes_in_buffer= %"
PRIu64
""
,
BLB_DATA
(
n
,
i
)
->
get_disk_size
());
printf
(
" items_in_buffer=%u
\n
"
,
BLB_DATA
(
n
,
i
)
->
num_klpairs
());
if
(
do_dump_data
)
{
BLB_DATA
(
n
,
i
)
->
iterate
<
void
,
print_le
>
(
NULL
);
unsigned
int
le_index
=
0
;
BLB_DATA
(
n
,
i
)
->
iterate
<
void
,
print_le
>
(
&
le_index
);
}
}
}
...
...
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