/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 133 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 231 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 301 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 375 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 447 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 367 tree.m_maxOccup = slots; in execTUXFRAGREQ() 369 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 374 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 386 tuxDebugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/mysql55-client/mysql-5.5.62/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 85 memset(entList, NodeFillByte, (tree.m_maxOccup + 1) * (TreeEntSize << 2)); in insertNode() 137 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 203 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 274 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 344 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 254 tree.m_maxOccup = 2 + slots - 1; in execTUX_ADD_ATTRREQ() 256 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUX_ADD_ATTRREQ() 261 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUX_ADD_ATTRREQ() 273 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUX_ADD_ATTRREQ()
|
H A D | DbtuxDebug.cpp | 138 if (node.getOccup() == 0 || node.getOccup() > tree.m_maxOccup) { in printNode() 142 out << " zero or greater than max " << tree.m_maxOccup << endl; in printNode() 268 out << " [maxOccup " << dec << tree.m_maxOccup << "]"; in operator <<()
|
/dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 112 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 206 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 269 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 337 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 404 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 354 tree.m_maxOccup = slots; in execTUXFRAGREQ() 356 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 361 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 373 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 112 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 206 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 269 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 337 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 404 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 354 tree.m_maxOccup = slots; in execTUXFRAGREQ() 356 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 361 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 373 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 112 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 206 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 269 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 337 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 404 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 354 tree.m_maxOccup = slots; in execTUXFRAGREQ() 356 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 361 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 373 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 115 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 209 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 272 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 340 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 407 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 359 tree.m_maxOccup = slots; in execTUXFRAGREQ() 361 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 366 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 378 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 115 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 209 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 272 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 340 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 407 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 359 tree.m_maxOccup = slots; in execTUXFRAGREQ() 361 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 366 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 378 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 115 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 209 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 272 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 340 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 407 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 359 tree.m_maxOccup = slots; in execTUXFRAGREQ() 361 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 366 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 378 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 115 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 209 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 272 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 340 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 407 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 359 tree.m_maxOccup = slots; in execTUXFRAGREQ() 361 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 366 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 378 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 115 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 209 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 272 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 340 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 407 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 359 tree.m_maxOccup = slots; in execTUXFRAGREQ() 361 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 366 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 378 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 112 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 206 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 269 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 337 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 404 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 354 tree.m_maxOccup = slots; in execTUXFRAGREQ() 356 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 361 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 373 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|
/dports/databases/mysql56-client/mysql-5.6.51/storage/ndb/src/kernel/blocks/dbtux/ |
H A D | DbtuxNode.cpp | 112 memset(entList, NodeFillByte, tree.m_maxOccup * (TreeEntSize << 2)); in insertNode() 206 ndbrequire(occup < tree.m_maxOccup && pos <= occup); in nodePushUp() 269 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopDown() 337 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePushDown() 404 ndbrequire(occup <= tree.m_maxOccup && pos < occup); in nodePopUp()
|
H A D | DbtuxMeta.cpp | 354 tree.m_maxOccup = slots; in execTUXFRAGREQ() 356 if (! (2 + maxSlack <= tree.m_maxOccup)) { in execTUXFRAGREQ() 361 tree.m_minOccup = tree.m_maxOccup - maxSlack; in execTUXFRAGREQ() 373 debugOut << " maxOccup=" << tree.m_maxOccup; in execTUXFRAGREQ()
|