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
33b96c30
Commit
33b96c30
authored
Dec 20, 2006
by
istruewing@chilla.local
Browse files
Options
Browse Files
Download
Plain Diff
Merge chilla.local:/home/mydev/mysql-4.1-axmrg
into chilla.local:/home/mydev/mysql-5.0-axmrg
parents
deeeeb4f
d9b9778e
Changes
5
Hide whitespace changes
Inline
Side-by-side
Showing
5 changed files
with
14 additions
and
7 deletions
+14
-7
myisam/mi_packrec.c
myisam/mi_packrec.c
+7
-6
myisam/mi_range.c
myisam/mi_range.c
+1
-0
myisam/mi_test1.c
myisam/mi_test1.c
+1
-1
myisam/mi_write.c
myisam/mi_write.c
+1
-0
myisam/rt_split.c
myisam/rt_split.c
+4
-0
No files found.
myisam/mi_packrec.c
View file @
33b96c30
...
...
@@ -179,12 +179,12 @@ my_bool _mi_read_pack_info(MI_INFO *info, pbool fix_keys)
if
(
share
->
min_pack_length
>
254
)
share
->
base
.
min_block_length
+=
2
;
DBUG_PRINT
(
"info"
,
(
"fixed header length: %u"
,
HEAD_LENGTH
));
DBUG_PRINT
(
"info"
,
(
"total header length: %u"
,
share
->
pack
.
header_length
));
DBUG_PRINT
(
"info"
,
(
"total header length: %
l
u"
,
share
->
pack
.
header_length
));
DBUG_PRINT
(
"info"
,
(
"pack file version: %u"
,
share
->
pack
.
version
));
DBUG_PRINT
(
"info"
,
(
"min pack length: %u"
,
share
->
min_pack_length
));
DBUG_PRINT
(
"info"
,
(
"max pack length: %u"
,
share
->
max_pack_length
));
DBUG_PRINT
(
"info"
,
(
"elements of all trees: %u"
,
elements
));
DBUG_PRINT
(
"info"
,
(
"distinct values bytes: %u"
,
intervall_length
));
DBUG_PRINT
(
"info"
,
(
"min pack length: %
l
u"
,
share
->
min_pack_length
));
DBUG_PRINT
(
"info"
,
(
"max pack length: %
l
u"
,
share
->
max_pack_length
));
DBUG_PRINT
(
"info"
,
(
"elements of all trees: %
l
u"
,
elements
));
DBUG_PRINT
(
"info"
,
(
"distinct values bytes: %
l
u"
,
intervall_length
));
DBUG_PRINT
(
"info"
,
(
"number of code trees: %u"
,
trees
));
DBUG_PRINT
(
"info"
,
(
"bytes for record lgt: %u"
,
share
->
pack
.
ref_length
));
DBUG_PRINT
(
"info"
,
(
"record pointer length: %u"
,
rec_reflength
));
...
...
@@ -366,7 +366,8 @@ static uint read_huff_table(MI_BIT_BUFF *bit_buff, MI_DECODE_TREE *decode_tree,
}
size
=
elements
*
2
-
2
;
DBUG_PRINT
(
"info"
,
(
"tree size in uint16: %u"
,
size
));
DBUG_PRINT
(
"info"
,
(
"tree size in bytes: %u"
,
size
*
sizeof
(
uint16
)));
DBUG_PRINT
(
"info"
,
(
"tree size in bytes: %u"
,
size
*
(
uint
)
sizeof
(
uint16
)));
for
(
end
=
ptr
+
size
;
ptr
<
end
;
ptr
++
)
{
...
...
myisam/mi_range.c
View file @
33b96c30
...
...
@@ -171,6 +171,7 @@ static double _mi_search_pos(register MI_INFO *info,
uchar
*
keypos
,
*
buff
;
double
offset
;
DBUG_ENTER
(
"_mi_search_pos"
);
LINT_INIT
(
max_keynr
);
if
(
pos
==
HA_OFFSET_ERROR
)
DBUG_RETURN
(
0
.
5
);
...
...
myisam/mi_test1.c
View file @
33b96c30
...
...
@@ -583,7 +583,7 @@ static struct my_option my_long_options[] =
static
my_bool
get_one_option
(
int
optid
,
const
struct
my_option
*
opt
__attribute__
((
unused
)),
char
*
argument
)
char
*
argument
__attribute__
((
unused
))
)
{
switch
(
optid
)
{
case
'a'
:
...
...
myisam/mi_write.c
View file @
33b96c30
...
...
@@ -583,6 +583,7 @@ int _mi_split_page(register MI_INFO *info, register MI_KEYDEF *keyinfo,
my_off_t
new_pos
;
MI_KEY_PARAM
s_temp
;
DBUG_ENTER
(
"mi_split_page"
);
LINT_INIT
(
after_key
);
DBUG_DUMP
(
"buff"
,(
byte
*
)
buff
,
mi_getint
(
buff
));
if
(
info
->
s
->
keyinfo
+
info
->
lastinx
==
keyinfo
)
...
...
myisam/rt_split.c
View file @
33b96c30
...
...
@@ -188,6 +188,10 @@ static int split_rtree_node(SplitStruct *node, int n_entries,
int
next_node
;
int
i
;
SplitStruct
*
end
=
node
+
n_entries
;
LINT_INIT
(
a
);
LINT_INIT
(
b
);
LINT_INIT
(
next
);
LINT_INIT
(
next_node
);
if
(
all_size
<
min_size
*
2
)
{
...
...
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