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
b3bdabe2
Commit
b3bdabe2
authored
Mar 25, 2010
by
Sergey Vojtovich
Browse files
Options
Browse Files
Download
Plain Diff
Merge fix for BUG47598 to mysql-5.1-bugteam.
parents
5a9bad95
85094f3c
Changes
5
Hide whitespace changes
Inline
Side-by-side
Showing
5 changed files
with
7 additions
and
26 deletions
+7
-26
storage/myisam/mi_open.c
storage/myisam/mi_open.c
+3
-0
storage/myisam/mi_page.c
storage/myisam/mi_page.c
+0
-7
storage/myisam/mi_write.c
storage/myisam/mi_write.c
+1
-1
storage/myisam/rt_index.c
storage/myisam/rt_index.c
+1
-9
storage/myisam/rt_split.c
storage/myisam/rt_split.c
+2
-9
No files found.
storage/myisam/mi_open.c
View file @
b3bdabe2
...
...
@@ -652,6 +652,9 @@ MI_INFO *mi_open(const char *name, int mode, uint open_flags)
myisam_open_list
=
list_add
(
myisam_open_list
,
&
m_info
->
open_list
);
pthread_mutex_unlock
(
&
THR_LOCK_myisam
);
bzero
(
info
.
buff
,
share
->
base
.
max_key_block_length
*
2
);
if
(
myisam_log_file
>=
0
)
{
intern_filename
(
name_buff
,
share
->
index_file_name
);
...
...
storage/myisam/mi_page.c
View file @
b3bdabe2
...
...
@@ -86,13 +86,6 @@ int _mi_write_keypage(register MI_INFO *info, register MI_KEYDEF *keyinfo,
if
((
length
=
keyinfo
->
block_length
)
>
IO_SIZE
*
2
&&
info
->
state
->
key_file_length
!=
page
+
length
)
length
=
((
mi_getint
(
buff
)
+
IO_SIZE
-
1
)
&
(
uint
)
~
(
IO_SIZE
-
1
));
#ifdef HAVE_purify
{
length
=
mi_getint
(
buff
);
bzero
((
uchar
*
)
buff
+
length
,
keyinfo
->
block_length
-
length
);
length
=
keyinfo
->
block_length
;
}
#endif
DBUG_RETURN
((
key_cache_write
(
info
->
s
->
key_cache
,
info
->
s
->
kfile
,
page
,
level
,
(
uchar
*
)
buff
,
length
,
(
uint
)
keyinfo
->
block_length
,
...
...
storage/myisam/mi_write.c
View file @
b3bdabe2
...
...
@@ -825,7 +825,7 @@ static int _mi_balance_page(register MI_INFO *info, MI_KEYDEF *keyinfo,
(
size_t
)
(
length
=
new_left_length
-
left_length
-
k_length
));
pos
=
buff
+
2
+
length
;
memcpy
((
uchar
*
)
father_key_pos
,(
uchar
*
)
pos
,(
size_t
)
k_length
);
bmove
((
uchar
*
)
buff
+
2
,(
uchar
*
)
pos
+
k_length
,
new_right_length
);
bmove
((
uchar
*
)
buff
+
2
,
(
uchar
*
)
pos
+
k_length
,
new_right_length
-
2
);
}
else
{
/* Move keys -> buff */
...
...
storage/myisam/rt_index.c
View file @
b3bdabe2
...
...
@@ -641,18 +641,12 @@ static int rtree_insert_level(MI_INFO *info, uint keynr, uchar *key,
}
case
1
:
/* root was split, grow a new root */
{
uchar
*
new_root_buf
;
uchar
*
new_root_buf
=
info
->
buff
+
info
->
s
->
base
.
max_key_block_length
;
my_off_t
new_root
;
uchar
*
new_key
;
uint
nod_flag
=
info
->
s
->
base
.
key_reflength
;
DBUG_PRINT
(
"rtree"
,
(
"root was split, grow a new root"
));
if
(
!
(
new_root_buf
=
(
uchar
*
)
my_alloca
((
uint
)
keyinfo
->
block_length
+
MI_MAX_KEY_BUFF
)))
{
my_errno
=
HA_ERR_OUT_OF_MEM
;
DBUG_RETURN
(
-
1
);
/* purecov: inspected */
}
mi_putint
(
new_root_buf
,
2
,
nod_flag
);
if
((
new_root
=
_mi_new
(
info
,
keyinfo
,
DFLT_INIT_HITS
))
==
...
...
@@ -680,10 +674,8 @@ static int rtree_insert_level(MI_INFO *info, uint keynr, uchar *key,
DBUG_PRINT
(
"rtree"
,
(
"new root page: %lu level: %d nod_flag: %u"
,
(
ulong
)
new_root
,
0
,
mi_test_if_nod
(
new_root_buf
)));
my_afree
((
uchar
*
)
new_root_buf
);
break
;
err1:
my_afree
((
uchar
*
)
new_root_buf
);
DBUG_RETURN
(
-
1
);
/* purecov: inspected */
}
default:
...
...
storage/myisam/rt_split.c
View file @
b3bdabe2
...
...
@@ -258,7 +258,7 @@ int rtree_split_page(MI_INFO *info, MI_KEYDEF *keyinfo, uchar *page, uchar *key,
double
*
old_coord
;
int
n_dim
;
uchar
*
source_cur
,
*
cur1
,
*
cur2
;
uchar
*
new_page
;
uchar
*
new_page
=
info
->
buff
;
int
err_code
=
0
;
uint
nod_flag
=
mi_test_if_nod
(
page
);
uint
full_length
=
key_length
+
(
nod_flag
?
nod_flag
:
...
...
@@ -304,12 +304,7 @@ int rtree_split_page(MI_INFO *info, MI_KEYDEF *keyinfo, uchar *page, uchar *key,
goto
split_err
;
}
if
(
!
(
new_page
=
(
uchar
*
)
my_alloca
((
uint
)
keyinfo
->
block_length
)))
{
err_code
=
-
1
;
goto
split_err
;
}
info
->
buff_used
=
1
;
stop
=
task
+
(
max_keys
+
1
);
cur1
=
rt_PAGE_FIRST_KEY
(
page
,
nod_flag
);
cur2
=
rt_PAGE_FIRST_KEY
(
new_page
,
nod_flag
);
...
...
@@ -345,8 +340,6 @@ int rtree_split_page(MI_INFO *info, MI_KEYDEF *keyinfo, uchar *page, uchar *key,
DFLT_INIT_HITS
,
new_page
);
DBUG_PRINT
(
"rtree"
,
(
"split new block: %lu"
,
(
ulong
)
*
new_page_offs
));
my_afree
((
uchar
*
)
new_page
);
split_err:
my_afree
((
uchar
*
)
coord_buf
);
DBUG_RETURN
(
err_code
);
...
...
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