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
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
mariadb
Commits
965d6ac6
Commit
965d6ac6
authored
Apr 08, 2006
by
jonas@perch.ndb.mysql.com
Browse files
Options
Browse Files
Download
Plain Diff
Merge perch.ndb.mysql.com:/home/jonas/src/50-work
into perch.ndb.mysql.com:/home/jonas/src/51-work
parents
878ce564
739b0d67
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
16 additions
and
4 deletions
+16
-4
storage/ndb/src/ndbapi/NdbDictionaryImpl.cpp
storage/ndb/src/ndbapi/NdbDictionaryImpl.cpp
+6
-1
storage/ndb/src/ndbapi/NdbLinHash.hpp
storage/ndb/src/ndbapi/NdbLinHash.hpp
+10
-3
No files found.
storage/ndb/src/ndbapi/NdbDictionaryImpl.cpp
View file @
965d6ac6
...
...
@@ -1789,9 +1789,14 @@ NdbDictInterface::getTable(const BaseString& name, bool fullyQualifiedNames)
// Copy name to m_buffer to get a word sized buffer
m_buffer
.
clear
();
m_buffer
.
grow
(
namelen_words
*
4
);
m_buffer
.
grow
(
namelen_words
*
4
+
4
);
m_buffer
.
append
(
name
.
c_str
(),
namelen
);
#ifndef IGNORE_VALGRIND_WARNINGS
Uint32
pad
=
0
;
m_buffer
.
append
(
&
pad
,
4
);
#endif
LinearSectionPtr
ptr
[
1
];
ptr
[
0
].
p
=
(
Uint32
*
)
m_buffer
.
get_data
();
ptr
[
0
].
sz
=
namelen_words
;
...
...
storage/ndb/src/ndbapi/NdbLinHash.hpp
View file @
965d6ac6
...
...
@@ -427,19 +427,26 @@ NdbLinHash<C>::getNext(NdbElement_t<C> * curr){
return
curr
->
next
;
int
dir
=
0
,
seg
=
0
;
if
(
curr
!=
0
){
int
counts
;
if
(
curr
!=
0
)
{
getBucket
(
curr
->
hash
,
&
dir
,
&
seg
);
counts
=
seg
+
1
;
}
else
{
counts
=
0
;
}
for
(
int
countd
=
dir
;
countd
<
DIRECTORYSIZE
;
countd
++
){
if
(
directory
[
countd
]
!=
0
)
{
for
(
int
counts
=
seg
+
1
;
counts
<
SEGMENTSIZE
;
counts
++
){
for
(;
counts
<
SEGMENTSIZE
;
counts
++
){
if
(
directory
[
countd
]
->
elements
[
counts
]
!=
0
)
{
return
directory
[
countd
]
->
elements
[
counts
];
}
}
}
counts
=
0
;
}
return
0
;
...
...
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