/dports/databases/mysql55-client/mysql-5.5.62/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 186 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 262 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 264 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 292 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 294 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 650 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 652 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 655 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 145 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 149 out << " less than min " << tree.m_minOccup << endl; in printNode() 157 node.getOccup() < tree.m_minOccup) { in printNode() 267 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
H A D | DbtuxMeta.cpp | 261 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUX_ADD_ATTRREQ() 272 debugOut << " minOccup=" << tree.m_minOccup; in execTUX_ADD_ATTRREQ()
|
/dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 194 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 268 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 270 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 298 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 300 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 658 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 660 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 663 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 274 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 278 out << " less than min " << tree.m_minOccup << endl; in printNode() 286 node.getOccup() < tree.m_minOccup) { in printNode() 403 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 194 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 268 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 270 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 298 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 300 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 658 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 660 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 663 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 274 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 278 out << " less than min " << tree.m_minOccup << endl; in printNode() 286 node.getOccup() < tree.m_minOccup) { in printNode() 403 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 194 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 268 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 270 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 298 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 300 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 658 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 660 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 663 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 274 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 278 out << " less than min " << tree.m_minOccup << endl; in printNode() 286 node.getOccup() < tree.m_minOccup) { in printNode() 403 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 212 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 288 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 290 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 318 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 320 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 687 if (node4.getOccup() < tree.m_minOccup) in treeRotateDouble() 690 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 693 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 311 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 315 out << " less than min " << tree.m_minOccup << endl; in printNode() 323 node.getOccup() < tree.m_minOccup) { in printNode() 440 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 197 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 271 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 273 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 301 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 303 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 661 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 663 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 666 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 277 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 281 out << " less than min " << tree.m_minOccup << endl; in printNode() 289 node.getOccup() < tree.m_minOccup) { in printNode() 406 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 197 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 271 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 273 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 301 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 303 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 661 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 663 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 666 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 277 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 281 out << " less than min " << tree.m_minOccup << endl; in printNode() 289 node.getOccup() < tree.m_minOccup) { in printNode() 406 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 197 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 271 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 273 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 301 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 303 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 661 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 663 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 666 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 277 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 281 out << " less than min " << tree.m_minOccup << endl; in printNode() 289 node.getOccup() < tree.m_minOccup) { in printNode() 406 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 197 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 271 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 273 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 301 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 303 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 661 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 663 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 666 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 277 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 281 out << " less than min " << tree.m_minOccup << endl; in printNode() 289 node.getOccup() < tree.m_minOccup) { in printNode() 406 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 197 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 271 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 273 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 301 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 303 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 661 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 663 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 666 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 277 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 281 out << " less than min " << tree.m_minOccup << endl; in printNode() 289 node.getOccup() < tree.m_minOccup) { in printNode() 406 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 194 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 268 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 270 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 298 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 300 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 658 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 660 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 663 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 274 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 278 out << " less than min " << tree.m_minOccup << endl; in printNode() 286 node.getOccup() < tree.m_minOccup) { in printNode() 403 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|
/dports/databases/mysql56-client/mysql-5.6.51/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxTree.cpp | 194 if (node.getOccup() > tree.m_minOccup) { in treeRemove() 268 if (semiNode.getOccup() < tree.m_minOccup) { in treeRemoveSemi() 270 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - semiNode.getOccup()); in treeRemoveSemi() 298 if (parentNode.getOccup() < tree.m_minOccup) { in treeRemoveLeaf() 300 unsigned cnt = min(leafNode.getOccup(), tree.m_minOccup - parentNode.getOccup()); in treeRemoveLeaf() 658 if (node4.getOccup() < tree.m_minOccup) { in treeRotateDouble() 660 unsigned cnt = tree.m_minOccup - node4.getOccup(); in treeRotateDouble() 663 ndbrequire(node4.getOccup() >= tree.m_minOccup); in treeRotateDouble()
|
H A D | DbtuxDebug.cpp | 274 if (node.getChilds() == 2 && node.getOccup() < tree.m_minOccup) { in printNode() 278 out << " less than min " << tree.m_minOccup << endl; in printNode() 286 node.getOccup() < tree.m_minOccup) { in printNode() 403 out << " [minOccup " << dec << tree.m_minOccup << "]"; in operator <<()
|